(const Quaternion& other) const\n\t{\n\t\treturn (x > other.x && y > other.y && z > other.z && w > other.w);\n\t}\n\n\tbool Quaternion::operator>=(const Quaternion& other) const\n\t{\n\t\treturn (x >= other.x && y >= other.y && z >= other.z && w >= other.w);\n\t}\n\n\tbool Quaternion::operator==(const Quaternion& other) const\n\t{\n\t\treturn (x == other.x && y == other.y && z == other.z && w == other.w);\n\t}\n\n\tbool Quaternion::operator!=(const Quaternion& other) const\n\t{\n\t\treturn (x != other.x || y != other.y || z != other.z, w != other.w);\n\t}\n\n\tbool Quaternion::IsZero() const\n\t{\n\t\treturn (x == 0.0f && y == 0.0f && z == 0.0f && w == 0.0f);\n\t}\n\n\tbool Quaternion::IsOne() const\n\t{\n\t\treturn (x == 1.0f && y == 1.0f && z == 1.0f && w == 1.0f);\n\t}\n\n\tconst Vec3 Quaternion::Rotate(const Quaternion& quaternion, const Vec3& axis)\n\t{\n\t\tfloat tempX, tempY, tempZ, tempW;\n\t\ttempX = (((quaternion.w * axis.x) + (quaternion.y * axis.z)) - (quaternion.z * axis.y));\n\t\ttempY = (((quaternion.w * axis.y) + (quaternion.z * axis.x)) - (quaternion.x * axis.z));\n\t\ttempZ = (((quaternion.w * axis.z) + (quaternion.x * axis.y)) - (quaternion.y * axis.x));\n\t\ttempW = (((quaternion.x * axis.x) + (quaternion.y * axis.y)) + (quaternion.z * axis.z));\n\t\treturn Vec3(\n\t\t\t((((tempW * quaternion.x) + (tempX * quaternion.w)) - (tempY * quaternion.z)) + (tempZ * quaternion.y)),\n\t\t\t((((tempW * quaternion.y) + (tempY * quaternion.w)) - (tempZ * quaternion.x)) + (tempX * quaternion.z)),\n\t\t\t((((tempW * quaternion.z) + (tempZ * quaternion.w)) - (tempX * quaternion.y)) + (tempY * quaternion.x))\n\t\t);\n\t}\n\n\tconst Quaternion Quaternion::Rotation(const Vec3& axis1, const Vec3& axis2)\n\t{\n\t\tfloat cosHalfAngle, recipCosHalfAngle;\n\t\tcosHalfAngle = sqrt((1.0f * (1.0f + axis1.Dot(axis2))));\n\t\trecipCosHalfAngle = (1.0f / cosHalfAngle);\n\t\treturn Quaternion\n\t\t(\n\t\t\t(Vec3::Cross(axis1, axis2) * recipCosHalfAngle), (cosHalfAngle * 0.5f)\n\t\t);\n\t}\n\n\tconst Quaternion Quaternion::Rotation(const float r, const Vec3 axis)\n\t{\n\t\tfloat angle = r * 0.5f;\n\t\treturn Quaternion(\n\t\t\t(axis * sin(r)), cos(r)\n\t\t);\n\t}\n\n\tconst Quaternion Quaternion::RotationX(const float r)\n\t{\n\t\tfloat angle = r * 0.5f;\n\t\treturn Quaternion(sin(angle), 0.0f, 0.0f, cos(angle));\n\t}\n\n\tconst Quaternion Quaternion::RotationY(const float r)\n\t{\n\t\tfloat angle = r * 0.5f;\n\t\treturn Quaternion(0.0f, sin(angle), 0.0f, cos(angle));\n\t}\n\n\tconst Quaternion Quaternion::RotationZ(const float r)\n\t{\n\t\tfloat angle = r * 0.5f;\n\t\treturn Quaternion(0.0f, 0.0f, sin(angle), cos(angle));\n\t}\n\n\tQuaternion Quaternion::Normalize()\n\t{\n\t\tfloat length = sqrt(x * x + y * y + z * z + w * w);\n\t\treturn Quaternion(x / length, y / length, z / length, w / length);\n\t}\n\n\tQuaternion Quaternion::Normalize(const Quaternion& other)\n\t{\n\t\tfloat length = other.Length();\n\t\treturn Quaternion(other.x / length, other.y / length, other.z / length, other.w / length);\n\t}\n\n\tfloat Quaternion::Dot(const Quaternion& other) const\n\t{\n\t\treturn x * other.x + y * other.y + z * other.z + w * other.w;\n\t}\n\n\tfloat Quaternion::Dot(const Quaternion& other1, const Quaternion& other2)\n\t{\n\t\treturn other1.x * other2.x + other1.y * other2.y + other1.z + other2.z + other1.w * other2.w;\n\t}\n\n\tQuaternion Quaternion::Conjugate() const\n\t{\n\t\treturn Quaternion(-x, -y, -z, w);\n\t}\n\n\tconst Quaternion Quaternion::Zero(0.0f, 0.0f, 0.0f, 0.0f);\n\tconst Quaternion Quaternion::Identity(0.0f, 0.0f, 0.0f, 1.0f);\n}"},"middle":{"kind":"string","value":"Quaternion& Quaternion::operator+=(const float value)\n\t{\n\t\tx += value;\n\t\ty += value;\n\t\tz += value;\n\t\tw += value;\n\t\treturn *this;\n\t}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"\tclass Vec4;\n","file_path":"Engine/include/math/CotQuaternion.h","rank":0,"score":178629.8132119183},{"content":"\tclass Vec3;\n","file_path":"Engine/include/math/CotQuaternion.h","rank":1,"score":178621.05006660835},{"content":"\tclass Vec3;\n","file_path":"Engine/include/math/CotVec4.h","rank":2,"score":178615.00717985723},{"content":"\tclass COT_API Quaternion final\n\n\t{\n\n\tpublic:\n\n\t\tunion\n\n\t\t{\n\n\t\t\tstruct\n\n\t\t\t{\n\n\t\t\t\tfloat x, y, z, w;\n\n\t\t\t};\n\n\t\t\tfloat ToArray[4];\n\n\t\t};\n\n\n\n\t\tQuaternion();\n\n\t\tQuaternion(const float value);\n\n\t\tQuaternion(const float xx, const float yy, const float zz, const float ww);\n\n\t\tQuaternion(const float* array);\n\n\t\tQuaternion(const Vec3& v, float ww);\n\n\t\tQuaternion(const Vec4& v);\n\n\t\tQuaternion(const Quaternion& other);\n\n\t\tQuaternion(const Quaternion&& other);\n","file_path":"Engine/include/math/CotQuaternion.h","rank":3,"score":139933.4873862201},{"content":"\tclass COT_API Vec4 final\n\n\t{\n\n\tpublic:\n\n\t\tunion\n\n\t\t{\n\n\t\t\tstruct\n\n\t\t\t{\n\n\t\t\t\tfloat x, y, z, w;\n\n\t\t\t};\n\n\t\t\tfloat ToArray[4];\n\n\t\t};\n\n\n\n\t\tVec4();\n\n\t\tVec4(const float value);\n\n\t\tVec4(const float xx, const float yy);\n\n\t\tVec4(const Vec2& other);\n\n\t\tVec4(const float xx, const float yy, const float zz);\n\n\t\tVec4(const Vec3& other);\n\n\t\tVec4(const float xx, const float yy, const float zz, const float ww);\n\n\t\tVec4(const float* array);\n","file_path":"Engine/include/math/CotVec4.h","rank":4,"score":139922.6252362061},{"content":"\tclass COT_API Vec3 final\n\n\t{\n\n\tpublic:\n\n\t\tunion\n\n\t\t{\n\n\t\t\tstruct\n\n\t\t\t{\n\n\t\t\t\tfloat x, y, z;\n\n\t\t\t};\n\n\t\t\tfloat ToArray[3];\n\n\t\t};\n\n\n\n\t\tVec3();\n\n\t\tVec3(const float value);\n\n\t\tVec3(const float xx, const float yy);\n\n\t\tVec3(const Vec2& other);\n\n\t\tVec3(const float xx, const float yy, const float zz);\n\n\t\tVec3(const float* array);\n\n\t\tVec3(const Vec3& other);\n\n\t\tVec3(const Vec3&& other);\n","file_path":"Engine/include/math/CotVec3.h","rank":5,"score":139913.6793728065},{"content":"\tclass Vec3;\n","file_path":"Engine/include/math/CotMat4.h","rank":6,"score":137059.68324513195},{"content":" LONG x2;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":7,"score":127452.1586376348},{"content":" FLOAT V; // Barycentric Hit Coordinates\n","file_path":"Engine/thirdparty/directx/include/d3dx9mesh.h","rank":8,"score":127446.72211593491},{"content":" INT Pitch;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":9,"score":127441.62357961375},{"content":" SHORT X, Y; // Top-left coordinates of the rect in the destination surface\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":10,"score":127419.73172161318},{"content":" long W;\n","file_path":"Engine/thirdparty/libvorbis/include/vorbis/codec.h","rank":11,"score":124353.67243869304},{"content":"\t\t~Quaternion();\n\n\n\n\t\tvoid SetXYZ(const Vec3& v);\n\n\t\tVec3 GetXYZ() const;\n\n\n\n\t\tvoid SetEuler(const Vec3& euler);\n\n\t\tVec3 GetEuler() const;\n\n\n\n\t\tfloat Length() const;\n\n\t\tVec3 GetAxis() const;\n\n\n\n\t\tconst Quaternion operator+(const Quaternion& other) const;\n\n\t\tconst Quaternion operator-(const Quaternion& other) const;\n\n\t\tconst Quaternion operator*(const Quaternion& other) const;\n\n\t\tconst Quaternion operator/(const Quaternion& other) const;\n\n\n\n\t\tconst Quaternion operator+(const float value) const;\n\n\t\tconst Quaternion operator-(const float value) const;\n\n\t\tconst Quaternion operator*(const float value) const;\n\n\t\tconst Quaternion operator/(const float value) const;\n","file_path":"Engine/include/math/CotQuaternion.h","rank":12,"score":118949.18311877771},{"content":"\t\tbool operator==(const Quaternion& other) const;\n\n\t\tbool operator!=(const Quaternion& other) const;\n\n\n\n\t\tbool IsZero() const;\n\n\t\tbool IsOne() const;\n\n\n\n\t\tstatic const Vec3 Rotate(const Quaternion& quaternion, const Vec3& axis);\n\n\n\n\t\tstatic const Quaternion Rotation(const Vec3& axis1, const Vec3& axis2);\n\n\t\tstatic const Quaternion Rotation(const float r, const Vec3 axis);\n\n\n\n\t\tstatic const Quaternion RotationX(const float r);\n\n\t\tstatic const Quaternion RotationY(const float r);\n\n\t\tstatic const Quaternion RotationZ(const float r);\n\n\n\n\t\tQuaternion Normalize();\n\n\t\tstatic Quaternion Normalize(const Quaternion& other);\n\n\n\n\t\tfloat Dot(const Quaternion& other) const;\n\n\t\tstatic float Dot(const Quaternion& other1, const Quaternion& other2);\n\n\n\n\t\tQuaternion Conjugate() const;\n\n\n\n\t\tstatic const Quaternion Zero;\n\n\t\tstatic const Quaternion Identity;\n\n\t};\n\n}","file_path":"Engine/include/math/CotQuaternion.h","rank":13,"score":118936.54392515883},{"content":"\n\n\t\tQuaternion& operator+=(const Quaternion& other);\n\n\t\tQuaternion& operator-=(const Quaternion& other);\n\n\t\tQuaternion& operator*=(const Quaternion& other);\n\n\t\tQuaternion& operator/=(const Quaternion& other);\n\n\t\tQuaternion& operator=(const Quaternion& other);\n\n\n\n\t\tQuaternion& operator+=(const float value);\n\n\t\tQuaternion& operator-=(const float value);\n\n\t\tQuaternion& operator*=(const float value);\n\n\t\tQuaternion& operator/=(const float value);\n\n\t\tQuaternion& operator=(const float value);\n\n\n\n\t\tconst Quaternion operator-() const;\n\n\n\n\t\tbool operator<(const Quaternion& other) const;\n\n\t\tbool operator<=(const Quaternion& other) const;\n\n\t\tbool operator>(const Quaternion& other) const;\n\n\t\tbool operator>=(const Quaternion& other) const;\n\n\n","file_path":"Engine/include/math/CotQuaternion.h","rank":14,"score":118933.27317433007},{"content":"#pragma once\n\n\n\n#include \"base/CotRule.h\"\n\n\n\nnamespace Cot \n\n{\n","file_path":"Engine/include/math/CotQuaternion.h","rank":15,"score":118931.62037861774},{"content":"\t\tVec4& operator+=(const float value);\n\n\t\tVec4& operator-=(const float value);\n\n\t\tVec4& operator*=(const float value);\n\n\t\tVec4& operator/=(const float value);\n\n\t\tVec4& operator=(const float value);\n\n\n\n\t\tconst Vec4 operator-() const;\n\n\n\n\t\tbool operator<(const Vec4& other) const;\n\n\t\tbool operator<=(const Vec4& other) const;\n\n\t\tbool operator>(const Vec4& other) const;\n\n\t\tbool operator>=(const Vec4& other) const;\n\n\n\n\t\tbool operator==(const Vec4& other) const;\n\n\t\tbool operator!=(const Vec4& other) const;\n\n\n\n\t\tbool IsZero() const;\n\n\t\tbool IsOne() const;\n\n\n\n\t\tVec4 Normalize();\n","file_path":"Engine/include/math/CotVec4.h","rank":16,"score":118926.86689404667},{"content":"\t\tVec4(const Vec4& other);\n\n\t\tVec4(const Vec4&& other);\n\n\t\t~Vec4();\n\n\n\n\t\tconst Vec4 operator+(const Vec4& other) const;\n\n\t\tconst Vec4 operator-(const Vec4& other) const;\n\n\t\tconst Vec4 operator*(const Vec4& other) const;\n\n\t\tconst Vec4 operator/(const Vec4& other) const;\n\n\n\n\t\tconst Vec4 operator+(const float value) const;\n\n\t\tconst Vec4 operator-(const float value) const;\n\n\t\tconst Vec4 operator*(const float value) const;\n\n\t\tconst Vec4 operator/(const float value) const;\n\n\n\n\t\tVec4& operator+=(const Vec4& other);\n\n\t\tVec4& operator-=(const Vec4& other);\n\n\t\tVec4& operator*=(const Vec4& other);\n\n\t\tVec4& operator/=(const Vec4& other);\n\n\t\tVec4& operator=(const Vec4& other);\n\n\n","file_path":"Engine/include/math/CotVec4.h","rank":17,"score":118926.53946229967},{"content":"#pragma once\n\n\n\n#include \"base/CotRule.h\"\n\n\n\nnamespace Cot\n\n{\n","file_path":"Engine/include/math/CotVec4.h","rank":18,"score":118925.32484451986},{"content":"\t\tstatic Vec4 Normalize(const Vec4& other);\n\n\n\n\t\tfloat Length() const;\n\n\t\tfloat Distance(const Vec4& other) const;\n\n\t\tstatic float Distance(const Vec4& other1, const Vec4& other2);\n\n\n\n\t\tfloat Dot(const Vec4& other) const;\n\n\t\tstatic float Dot(const Vec4& other1, const Vec4& other2);\n\n\n\n\t\tstatic const Vec4 Zero;\n\n\t\tstatic const Vec4 One;\n\n\t};\n\n}","file_path":"Engine/include/math/CotVec4.h","rank":19,"score":118922.34393859975},{"content":"\t\t~Vec3();\n\n\n\n\t\tconst Vec3 operator+(const Vec3& other) const;\n\n\t\tconst Vec3 operator-(const Vec3& other) const;\n\n\t\tconst Vec3 operator*(const Vec3& other) const;\n\n\t\tconst Vec3 operator/(const Vec3& other) const;\n\n\n\n\t\tconst Vec3 operator+(const float value) const;\n\n\t\tconst Vec3 operator-(const float value) const;\n\n\t\tconst Vec3 operator*(const float value) const;\n\n\t\tconst Vec3 operator/(const float value) const;\n\n\n\n\t\tVec3& operator+=(const Vec3& other);\n\n\t\tVec3& operator-=(const Vec3& other);\n\n\t\tVec3& operator*=(const Vec3& other);\n\n\t\tVec3& operator/=(const Vec3& other);\n\n\t\tVec3& operator=(const Vec3& other);\n\n\n\n\t\tVec3& operator+=(const float value);\n\n\t\tVec3& operator-=(const float value);\n","file_path":"Engine/include/math/CotVec3.h","rank":20,"score":118921.09965309182},{"content":"\t\tVec3& operator*=(const float value);\n\n\t\tVec3& operator/=(const float value);\n\n\t\tVec3& operator=(const float value);\n\n\n\n\t\tconst Vec3 operator*(const Mat4& mat) const;\n\n\t\tVec3& operator*=(const Mat4& mat);\n\n\n\n\t\tconst Vec3 operator-() const;\n\n\n\n\t\tbool operator<(const Vec3& other) const;\n\n\t\tbool operator<=(const Vec3& other) const;\n\n\t\tbool operator>(const Vec3& other) const;\n\n\t\tbool operator>=(const Vec3& other) const;\n\n\n\n\t\tbool operator==(const Vec3& other) const;\n\n\t\tbool operator!=(const Vec3& other) const;\n\n\n\n\t\tbool IsZero() const;\n\n\t\tbool IsOne() const;\n\n\n","file_path":"Engine/include/math/CotVec3.h","rank":21,"score":118919.0888960675},{"content":"\t\tVec3 Normalize();\n\n\t\tstatic Vec3 Normalize(const Vec3& other);\n\n\n\n\t\tfloat Length() const;\n\n\t\tfloat Distance(const Vec3& other) const;\n\n\t\tstatic float Distance(const Vec3& other1, const Vec3& other2);\n\n\n\n\t\tfloat Dot(const Vec3& other) const;\n\n\t\tstatic float Dot(const Vec3& other1, const Vec3& other2);\n\n\n\n\t\tVec3 Cross(const Vec3& other) const;\n\n\t\tstatic Vec3 Cross(const Vec3& other1, const Vec3& other2);\n\n\n\n\t\tstatic const Vec3 Zero;\n\n\t\tstatic const Vec3 One;\n\n\n\n\t\tstatic const Vec3 Front;\n\n\t\tstatic const Vec3 Back;\n\n\t\tstatic const Vec3 Up;\n\n\t\tstatic const Vec3 Down;\n\n\t\tstatic const Vec3 Left;\n\n\t\tstatic const Vec3 Right;\n\n\n\n\t\tstatic const Vec3 AxisX;\n\n\t\tstatic const Vec3 AxisY;\n\n\t\tstatic const Vec3 AxisZ;\n\n\t};\n\n}","file_path":"Engine/include/math/CotVec3.h","rank":22,"score":118919.03005153978},{"content":"#pragma once\n\n\n\n#include \"base/CotRule.h\"\n\n\n\nnamespace Cot \n\n{\n","file_path":"Engine/include/math/CotVec3.h","rank":23,"score":118919.02303443008},{"content":"\tclass Vec2;\n","file_path":"Engine/include/math/CotVec4.h","rank":24,"score":114138.55982552955},{"content":"\tclass Vec2;\n","file_path":"Engine/include/math/CotVec3.h","rank":25,"score":114132.51091464961},{"content":"\tclass Mat4;\n","file_path":"Engine/include/math/CotVec3.h","rank":26,"score":114132.51091464961},{"content":"namespace Cot\n\n{\n\n\tCOT_API inline const char* GetVersion()\n\n\t{\n\n\t\treturn \"CotEngine v1.5.7\";\n\n\t}\n","file_path":"Engine/include/CotEngine.h","rank":27,"score":111556.95664367868},{"content":"\t\tclass Vec4 GetColumn(int index);\n\n\n\n\t\tstatic Mat4 Multiply(const Mat4& mat1, const Mat4& mat2);\n\n\n\n\t\tstatic Mat4 Orthographic(float left, float right, float bottom, float top, float near, float far);\n\n\t\tstatic Mat4 Perspective(float fov, float aspectRatio, float near, float far);\n\n\t\tstatic Mat4 LookAt(const class Vec3& eye, const Vec3& center, const Vec3& up);\n\n\n\n\t\tstatic Mat4 Translate(const Vec3& position);\n\n\t\tstatic Mat4 Rotate(float angle, const Vec3& axis);\n\n\t\tstatic Mat4 Rotate(const class Quaternion& quaternion);\n\n\t\tstatic Mat4 Scale(const Vec3& scale);\n\n\t\tstatic Mat4 Transpose(const Mat4& mat);\n\n\n\n\t\tstatic const Mat4 Zero;\n\n\t\tstatic const Mat4 Identity;\n\n\n\n\t};\n\n}","file_path":"Engine/include/math/CotMat4.h","rank":28,"score":110604.494833343},{"content":"namespace Cot\n\n{\n\n\tComponent(Button, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(Button);\n\n\tprivate:\n\n\t\tenum class Type { Color, Image, };\n\n\t\tType\t\t\t\t_buttonType;\n\n\t\tSpriteRenderer*\t\t_spriteRenderer;\n\n\t\tTexture*\t\t\t_originImage;\n\n\t\tTexture*\t\t\t_clickImage;\n\n\t\tColor\t\t\t\t_originColor;\n\n\t\tColor\t\t\t\t_clickColor;\n\n\t\tbool\t\t\t\t_down;\n\n\n\n\t\tCallBack<void()>\t_buttonDown;\n\n\t\tCallBack<void()>\t_buttonUp;\n\n\t\tCallBack<void()>\t_buttonClick;\n\n\n\n\tpublic:\n\n\t\t// Image\n\n\t\tButton* Init(const string& clickImage);\n\n\t\tButton* Init(const Color& clickColor);\n\n\n\n\t\tvoid Reset() override;\n\n\t\tvoid Awake() override;\n\n\t\tvoid Update(Time& time) override;\n\n\n\n\t\tvoid AddButtonDown(const Function<void()>& function);\n\n\t\tvoid AddButtonUp(const Function<void()>& function);\n\n\t\tvoid AddButtonClick(const Function<void()>& function);\n\n\n\n\t};\n","file_path":"Engine/include/component/CotButton.h","rank":29,"score":109676.05568774493},{"content":"namespace Cot\n\n{\n\n\tCOT_API inline bool IntersectRect(Rect& rect1, Rect& rect2);\n\n\tCOT_API inline bool IntersectCircle(Circle& circle1, Circle& circle2);\n\n\n\n\tCOT_API inline bool IntersectRectCircle(Rect& rect, Circle& circle);\n\n\n\n\tCOT_API inline bool PointInRect(Rect& rect, Vec2& position);\n","file_path":"Engine/include/physics/CotPhysics.h","rank":30,"score":109676.05568774493},{"content":"namespace Cot\n\n{\n\n\tCOT_API void RegisteInputDevice(InputDevice* device);\n\n\tCOT_API void DestroyInputDevice();\n\n\n\n\tCOT_API bool IsKeyDown(KeyCode code);\n\n\tCOT_API bool IsKeyStay(KeyCode code);\n\n\tCOT_API bool IsKeyUp(KeyCode code);\n\n\n\n\tCOT_API bool IsMouseDown(MouseButton button);\n\n\tCOT_API bool IsMouseStay(MouseButton button);\n\n\tCOT_API bool IsMouseUp(MouseButton button);\n\n\n\n\tCOT_API Vec2 GetMousePosition();\n\n\tCOT_API float GetMouseWheel();\n","file_path":"Engine/include/input/CotInput.h","rank":31,"score":109676.05568774493},{"content":"namespace Cot\n\n{\n\n\tComponent(ICollider)\n\n\t{\n\n\t\tCOT_COMPONENT(ICollider);\n\n\tpublic:\n\n\t\tenum class Type\n\n\t\t{\n\n\t\t\tBox,\n\n\t\t\tCircle,\n\n\t\t\tLine,\n\n\t\t};\n\n\n\n\tprotected:\n\n\t\tType\t_collType;\n\n\t\tbool\t_enter = false;\n\n\t\tEntity* _target;\n\n\n\n\tpublic:\n\n\t\tvoid SetEnter(bool enter) { _enter = enter; }\n\n\t\tbool IsEnter() { return _enter; }\n\n\n\n\t\tType GetCollType() { return _collType; }\n\n\n\n\t\tvoid SetTarget(Entity* target) { _target = target; }\n\n\t\tEntity* GetTarget() { return _target; }\n\n\n\n\t};\n","file_path":"Engine/include/component/CotICollider.h","rank":32,"score":109676.05568774493},{"content":"namespace Cot\n\n{\n\n\tCOT_API inline D3DXCOLOR\t\tToDxMath(const Color32& color);\n\n\tCOT_API inline D3DXMATRIX\t\tToDxMath(const Mat4& mat);\n\n\tCOT_API inline D3DXVECTOR2\t\tToDxMath(const Vec2& vec);\n\n\tCOT_API inline D3DXVECTOR3\t\tToDxMath(const Vec3& vec);\n\n\tCOT_API inline D3DXVECTOR4\t\tToDxMath(const Vec4& vec);\n\n\tCOT_API inline D3DXQUATERNION\tToDxMath(const Quaternion& quternion);\n\n\tCOT_API inline RECT\t\t\t\tToDxMath(Rect& rect);\n","file_path":"Engine/include/math/CotGL2DX.h","rank":33,"score":109676.05568774493},{"content":"namespace Cot\n\n{\n\n\tComponentExt(FontRenderer, IRenderComponent, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(FontRenderer);\n\n\tprivate:\n\n\t\tFont*\t_font;\n\n\t\tstring\t_text;\n\n\n\n\tpublic:\n\n\t\tFontRenderer* Init(const string& font, const string& text, int fontSize);\n\n\n\n\t\tvoid Reset() override;\n\n\t\tvoid Update(Time& time) override;\n\n\t\tvoid OnDestroy() override;\n\n\n\n\t\tvoid SetFont(Font* font);\n\n\t\tvoid SetFont(const string& font, int fontSize);\n\n\t\tFont* GetFont() { return _font; }\n\n\n\n\t\tvoid SetFontSize(int fontSize);\n\n\t\tint GetFontSize() { return _font->GetFontSize(); }\n\n\n\n\t\tvoid SetText(const string& text);\n\n\t\tstring GetText() { return _text; }\n\n\n\n\t};\n","file_path":"Engine/include/component/CotFontRenderer.h","rank":34,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tenum class AudioState\n\n\t{\n\n\t\tPlaying,\n\n\t\tPaused,\n\n\t\tStopped,\n\n\t};\n\n\n\n\tComponent(AudioSource, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(AudioSource);\n\n\tprivate:\n\n\t\tAudioClip*\t_clip;\n\n\t\tAudioState\t_state;\n\n\t\tALuint\t\t_source;\n\n\t\tfloat\t\t_volume;\n\n\t\tfloat\t\t_pitch;\n\n\t\tfloat\t\t_maxDistance;\n\n\t\tVec3\t\t_velocity;\n\n\t\tbool\t\t_loop;\n\n\t\tbool\t\t_2d;\n\n\n\n\tpublic:\n\n\t\tAudioSource* Init(const string& filename, bool loop = false);\n\n\n\n\t\tvoid Reset() override;\n\n\t\tvoid Update(Time& time) override;\n\n\t\tvoid OnDestroy() override;\n\n\n\n\t\tvoid Play();\n\n\t\tvoid Pause();\n\n\t\tvoid Resume();\n\n\t\tvoid Stop();\n\n\n\n\t\tvoid SetClip(const string& filename);\n\n\t\tAudioClip& GetClip() { return *_clip; }\n\n\n\n\t\tvoid SetPitch(float pitch);\n\n\t\tfloat GetPitch() { return _pitch; }\n\n\n\n\t\tvoid SetLoop(bool loop);\n\n\t\tbool IsLoop() { return _loop; }\n\n\n\n\t\tvoid SetVolume(float volume);\n\n\t\tfloat GetVolume() { return _volume; }\n\n\n\n\t\tint GetPosition();\n\n\t\tint GetLength() { return _clip->GetLength(); }\n\n\n\n\t\tvoid SetMaxDistance(float maxDistance);\n\n\t\tfloat GetMaxDistance() { return _maxDistance; }\n\n\n\n\t\tvoid SetVelocity(const Vec3& velocity);\n\n\t\tVec3 GetVelocity() { return _velocity; }\n\n\n\n\t\tvoid Set2D(bool value);\n\n\t\tbool Is2D() { return _2d; }\n\n\n\n\t\tAudioState GetState() { return _state; }\n\n\n\n\t};\n","file_path":"Engine/include/component/CotAudioSource.h","rank":35,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tComponentExt(SpriteRenderer, IRenderComponent, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(SpriteRenderer);\n\n\tprotected:\n\n\t\tTexture*\t_texture;\n\n\n\n\tpublic:\n\n\t\tSpriteRenderer* Init(const string& filename);\n\n\t\tSpriteRenderer* Init(const string& caif, const string& key);\n\n\n\n\t\tvoid Reset() override;\n\n\t\tvoid Update(Time& time) override;\n\n\t\tvoid OnDestroy() override;\n\n\n\n\t\tvoid SetTexture(Texture* texture);\n\n\t\tvoid SetTexture(const string& filename);\n\n\t\tvoid SetTexture(const string& caif, const string& key);\n\n\t\tTexture* GetTexture() { return _texture; }\n\n\n\n\t};\n","file_path":"Engine/include/component/CotSpriteRenderer.h","rank":36,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tComponent(PrograssBar, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(PrograssBar);\n\n\tprivate:\n\n\t\tSpriteRenderer* _spriteRenderer;\n\n\t\tfloat _value;\n\n\t\tfloat _x;\n\n\n\n\tpublic:\n\n\t\tvoid Reset() override;\n\n\t\tvoid Awake() override;\n\n\n\n\t\tvoid SetValue(float value);\n\n\t\tfloat GetValue() { return _value; }\n\n\t\t\n\n\t};\n","file_path":"Engine/include/component/CotPrograssBar.h","rank":37,"score":107891.36542042563},{"content":"namespace Cot \n\n{\n\n\tCOT_API inline float ToRad(const float deg);\n\n\tCOT_API inline float ToDeg(const float rad);\n\n\tCOT_API inline float Pi();\n\n\tCOT_API inline float Lerp(float v1, float v2, float amount);\n\n\t\n\n\ttemplate<typename T>\n\n\tCOT_API inline T Clamp(const T value, const T min, const T max)\n\n\t{\n\n\t\tif (value < min)\n\n\t\t{\n\n\t\t\treturn min;\n\n\t\t}\n\n\t\telse if (value > max)\n\n\t\t{\n\n\t\t\treturn max;\n\n\t\t}\n\n\t\treturn value;\n\n\t}\n\n\n\n\ttemplate<typename T>\n\n\tCOT_API inline T Max(const T v1, const T v2)\n\n\t{\n\n\t\treturn (v1 > v2) ? return v1 : return v2;\n\n\t}\n\n\n\n\ttemplate<typename T>\n\n\tCOT_API inline T Min(const T v1, const T v2)\n\n\t{\n\n\t\treturn (v1 > v2) ? return v1 : return v2;\n\n\t}\n","file_path":"Engine/include/math/CotMathFunc.h","rank":38,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tComponentExt(BoxCollider, ICollider, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(BoxCollider);\n\n\tprivate:\n\n\t\tSize\t_size;\n\n\t\tVec2\t_offset;\n\n\n\n\tpublic:\n\n\t\tBoxCollider* Init(const Size& size = Size(300, 300));\n\n\n\n\t\tvoid Reset() override;\n\n\t\tvoid Update(Time& time) override;\n\n\n\n\t\tvoid SetSpriteSize();\n\n\n\n\t\tvoid SetOffset(const Vec2& offset);\n\n\t\tVec2 GetOffset() { return _offset; }\n\n\n\n\t\tvoid SetRect(const Size& size);\n\n\t\tRect GetRect();\n\n\n\n\t};\n","file_path":"Engine/include/component/CotBoxCollider.h","rank":39,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tComponentExt(ScrollBar, SpriteRenderer, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(ScrollBar);\n\n\tprivate:\n\n\t\tEntity* _button;\n\n\t\tbool\t_buttonDown;\n\n\t\tfloat\t_beginY;\n\n\t\tfloat\t_endY;\n\n\n\n\t\tfloat\t_value;\n\n\t\tfloat\t_minValue;\n\n\t\tfloat\t_maxValue;\n\n\n\n\tpublic:\n\n\t\tScrollBar* Init(const string& background, Entity* button);\n\n\t\t\n\n\t\tvoid Reset() override;\n\n\t\tvoid Update(Time& time) override;\n\n\t\tvoid OnDestroy() override;\n\n\n\n\t\tvoid SetValue(float value);\n\n\t\tfloat GetValue() { return _value; }\n\n\n\n\t};\n","file_path":"Engine/include/component/CotScrollBar.h","rank":40,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tComponent(IRenderComponent, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(IRenderComponent);\n\n\tpublic:\n\n\t\tenum class Type\n\n\t\t{\n\n\t\t\tSprite,\n\n\t\t\tFont,\n\n\t\t};\n\n\t\t\n\n\tprotected:\n\n\t\tType\t_renderType;\n\n\t\tVec2\t_anchor;\n\n\t\tColor\t_color;\n\n\t\tRect\t_rect;\n\n\t\tSize\t_size;\n\n\t\tint\t\t_depth;\n\n\t\tMask*\t_maskData;\n\n\t\tbool\t_masked;\n\n\n\n\tpublic:\n\n\t\tType GetRenderType() { return _renderType; }\n\n\n\n\t\tvoid SetMask(Mask* maskData, bool value);\n\n\t\tbool IsUseMask() { return _masked; }\n\n\t\tMask* GetMaskData() { return _maskData; }\n\n\n\n\t\tvoid SetAnchor(const Vec2& anchor);\n\n\t\tVec2 GetAnchor() { return _anchor; }\n\n\n\n\t\tvoid SetRect(const Rect& rect);\n\n\t\tRect GetRect() { return _rect; }\n\n\n\n\t\tvoid SetSize(const Size& size);\n\n\t\tSize GetSize() { return _size; }\n\n\n\n\t\tvoid SetDepth(int depth);\n\n\t\tint GetDepth() { return _depth; }\n\n\n\n\t\tvoid SetColor(const Color& color);\n\n\t\tColor GetColor() { return _color; }\n\n\n\n\t};\n","file_path":"Engine/include/component/CotIRenderComponent.h","rank":41,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tComponent(AudioListener, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(AudioListener);\n\n\tprivate:\n\n\t\tALCdevice*\t_device;\n\n\t\tALCcontext* _context;\n\n\n\n\tpublic:\n\n\t\tAudioListener* Init();\n\n\t\tvoid Update(Time& time) override;\n\n\n\n\t};\n","file_path":"Engine/include/component/CotAudioListener.h","rank":42,"score":107891.36542042563},{"content":"namespace Cot\n\n{\n\n\tComponentExt(CircleCollider, ICollider, COT_API)\n\n\t{\n\n\t\tCOT_COMPONENT(CircleCollider);\n\n\tprivate:\n\n\t\tfloat\t_radius;\n\n\t\tVec2\t_offset;\n\n\n\n\tpublic:\n\n\t\tCircleCollider* Init(float radius = 0.0f);\n\n\n\n\t\tvoid Reset() override;\n\n\t\tvoid Update(Time& time) override;\n\n\n\n\t\tvoid SetOffset(const Vec2& offset);\n\n\t\tVec2 GetOffset() { return _offset; }\n\n\n\n\t\tvoid SetRadius(float radius);\n\n\t\tCircle GetCircle();\n\n\n\n\t};\n","file_path":"Engine/include/component/CotCircleCollider.h","rank":43,"score":107891.36542042563},{"content":"class ValueConstIterator;\n\n\n\n} // namespace Json\n\n\n\n#endif // JSON_FORWARDS_H_INCLUDED\n\n\n\n// //////////////////////////////////////////////////////////////////////\n\n// End of content of file: include/json/forwards.h\n\n// //////////////////////////////////////////////////////////////////////\n\n\n\n\n\n\n\n\n\n\n\n\n\n// //////////////////////////////////////////////////////////////////////\n\n// Beginning of content of file: include/json/features.h\n\n// //////////////////////////////////////////////////////////////////////\n\n\n\n// Copyright 2007-2010 Baptiste Lepilleur and The JsonCpp Authors\n","file_path":"Engine/thirdparty/json/include/json/json.h","rank":44,"score":106667.98681231124},{"content":"class ValueConstIterator;\n\n\n\n} // namespace Json\n\n\n\n#endif // JSON_FORWARDS_H_INCLUDED\n\n\n\n// //////////////////////////////////////////////////////////////////////\n\n// End of content of file: include/json/forwards.h\n\n// //////////////////////////////////////////////////////////////////////\n\n\n\n\n\n\n\n\n\n\n\n#endif //ifndef JSON_FORWARD_AMALGATED_H_INCLUDED\n","file_path":"Engine/thirdparty/json/include/json/json-forwards.h","rank":45,"score":102979.38451773452},{"content":"class JSON_API ValueConstIterator : public ValueIteratorBase {\n\n friend class Value;\n\n\n\npublic:\n\n typedef const Value value_type;\n\n //typedef unsigned int size_t;\n\n //typedef int difference_type;\n\n typedef const Value& reference;\n\n typedef const Value* pointer;\n\n typedef ValueConstIterator SelfType;\n\n\n\n ValueConstIterator();\n\n ValueConstIterator(ValueIterator const& other);\n\n\n\nprivate:\n\n/*! \\internal Use by Value to create an iterator.\n\n */\n\n explicit ValueConstIterator(const Value::ObjectValues::iterator& current);\n\npublic:\n\n SelfType& operator=(const ValueIteratorBase& other);\n","file_path":"Engine/thirdparty/json/include/json/json.h","rank":46,"score":100690.82367664558},{"content":" LPVOID pValue; // data for the default of the effect\n","file_path":"Engine/thirdparty/directx/include/d3dx9mesh.h","rank":47,"score":95083.18530760742},{"content":" D3DXQUATERNION Value;\n","file_path":"Engine/thirdparty/directx/include/d3dx9anim.h","rank":48,"score":95078.58241840679},{"content":" WORD value;\n","file_path":"Engine/thirdparty/directx/include/d3dx9math.h","rank":49,"score":95078.58241840678},{"content":" float z;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":50,"score":94866.38035264192},{"content":" float x;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":51,"score":94839.38995832019},{"content":" FLOAT x, y, z, w;\n","file_path":"Engine/thirdparty/directx/include/d3dx9math.h","rank":52,"score":94839.38995832019},{"content":" BOOL InVBlank;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":53,"score":92047.17966822787},{"content":" float MinZ; /* Min/max of clip Volume */\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":54,"score":92047.17966822787},{"content":" float MaxZ;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":55,"score":92047.17966822787},{"content":" INT RowPitch;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":56,"score":92042.24603559567},{"content":" INT SlicePitch;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":57,"score":92042.24603559567},{"content":" BYTE PitchAndFamily;\n","file_path":"Engine/thirdparty/directx/include/d3dx9core.h","rank":58,"score":92042.24603559567},{"content":" int returned;\n","file_path":"Engine/thirdparty/libvorbis/include/ogg/ogg.h","rank":59,"score":92039.80602564912},{"content":" HRESULT ReturnCode;\n","file_path":"Engine/thirdparty/directx/include/d3d9types.h","rank":60,"score":92039.80602564912},{"content":" long lW;\n","file_path":"Engine/thirdparty/libvorbis/include/vorbis/codec.h","rank":61,"score":92034.94578475777},{"content":" long nW;\n","file_path":"Engine/thirdparty/libvorbis/include/vorbis/codec.h","rank":62,"score":92034.94578475777},{"content":" DWORD DefaultValue; // offset of default value\n","file_path":"Engine/thirdparty/directx/include/d3dx9shader.h","rank":63,"score":92003.42358913997},{"content":" DWORD ZCmpCaps;\n","file_path":"Engine/thirdparty/directx/include/d3d9caps.h","rank":64,"score":89163.33954488905},{"content":" int pcm_returned;\n","file_path":"Engine/thirdparty/libvorbis/include/vorbis/codec.h","rank":65,"score":89156.19691869125},{"content":" long body_returned; /* elements of fill returned */\n","file_path":"Engine/thirdparty/libvorbis/include/ogg/ogg.h","rank":66,"score":89156.19691869125},{"content":" long lacing_returned;\n","file_path":"Engine/thirdparty/libvorbis/include/ogg/ogg.h","rank":67,"score":89156.19691869125},{"content":" long centerW;\n","file_path":"Engine/thirdparty/libvorbis/include/vorbis/codec.h","rank":68,"score":89151.48894925181},{"content":" float MaxVertexW;\n","file_path":"Engine/thirdparty/directx/include/d3d9caps.h","rank":69,"score":89151.48894925181},{"content":" DWORD MaxVertexShaderConst; // number of vertex shader constant registers\n","file_path":"Engine/thirdparty/directx/include/d3d9caps.h","rank":70,"score":86450.07768551432},{"content":" float PixelShader1xMaxValue; // max value storable in registers of ps.1.x shaders\n","file_path":"Engine/thirdparty/directx/include/d3d9caps.h","rank":71,"score":86413.61395655731},{"content":" DWORD MaxVShaderInstructionsExecuted; // maximum number of vertex shader instructions that can be executed\n","file_path":"Engine/thirdparty/directx/include/d3d9caps.h","rank":72,"score":83905.79858773535},{"content":"#include \"math/CotVec4.h\"\n\n#include \"math/CotVec2.h\"\n\n#include \"math/CotVec3.h\"\n\n#include <cmath>\n\n\n\nnamespace Cot \n\n{\n\n\tVec4::Vec4()\n\n\t\t: x(0.0f), y(0.0f), z(0.0f), w(0.0f)\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const float value)\n\n\t\t: x(value), y(value), z(value), w(value)\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const float xx, const float yy)\n\n\t\t: x(xx), y(yy), z(0.0f), w(0.0f)\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const Vec2& other)\n","file_path":"Engine/src/CotVec4.cpp","rank":75,"score":81116.78464237148},{"content":"\t\t: x(other.x), y(other.y), z(0.0f), w(0.0f)\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const float xx, const float yy, const float zz)\n\n\t\t: x(xx), y(yy), z(zz), w(0.0f)\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const Vec3& other)\n\n\t\t: x(other.x), y(other.y), z(other.z), w(0.0f)\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const float xx, const float yy, const float zz, const float ww)\n\n\t\t: x(xx), y(yy), z(zz), w(ww)\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const float* array)\n\n\t\t: x(array[0]), y(array[1]), z(array[2]), w(array[3])\n\n\t{\t}\n\n\n\n\tVec4::Vec4(const Vec4& other)\n","file_path":"Engine/src/CotVec4.cpp","rank":76,"score":81116.48291866129},{"content":"\t\t}\n\n\n\n\t\tfloat zz = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\tzz = z / value;\n\n\t\t}\n\n\n\n\t\tfloat ww = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\tww = w / value;\n\n\t\t}\n\n\t\treturn Vec4(xx, yy, zz, ww);\n\n\t}\n\n\n\n\tVec4& Vec4::operator+=(const Vec4& other)\n\n\t{\n\n\t\tx += other.x;\n\n\t\ty += other.y;\n","file_path":"Engine/src/CotVec4.cpp","rank":77,"score":81111.42472927677},{"content":"\t\tif (other.z > 0.0f)\n\n\t\t{\n\n\t\t\tzz = z / other.z;\n\n\t\t}\n\n\n\n\t\tfloat ww = 0.0f;\n\n\t\tif (other.w > 0.0f)\n\n\t\t{\n\n\t\t\tww = w / other.w;\n\n\t\t}\n\n\t\treturn Vec4(xx, yy, zz, ww);\n\n\t}\n\n\n\n\tconst Vec4 Vec4::operator+(const float value) const\n\n\t{\n\n\t\treturn Vec4(x + value, y + value, z + value, w + value);\n\n\t}\n\n\n\n\tconst Vec4 Vec4::operator-(const float value) const\n\n\t{\n","file_path":"Engine/src/CotVec4.cpp","rank":78,"score":81110.59266907649},{"content":"#include \"math/CotVec3.h\"\n\n#include \"math/CotVec2.h\"\n\n#include \"math/CotMat4.h\"\n\n\n\nnamespace Cot \n\n{\n\n\tVec3::Vec3()\n\n\t\t: x(0.0f), y(0.0f), z(0.0f)\n\n\t{\t}\n\n\n\n\tVec3::Vec3(const float value)\n\n\t\t: x(value), y(value), z(value)\n\n\t{\t}\n\n\n\n\tVec3::Vec3(const float xx, const float yy)\n\n\t\t: x(xx), y(yy), z(0.0f)\n\n\t{\t}\n\n\n\n\tVec3::Vec3(const Vec2& other)\n\n\t\t: x(other.x), y(other.y), z(0.0f)\n","file_path":"Engine/src/CotVec3.cpp","rank":79,"score":81107.7659355377},{"content":"\t\treturn *this;\n\n\t}\n\n\n\n\tVec4& Vec4::operator/=(const Vec4& other)\n\n\t{\n\n\t\tfloat xx = 0.0f;\n\n\t\tif (other.x > 0.0f)\n\n\t\t{\n\n\t\t\txx = x / other.x;\n\n\t\t}\n\n\t\tx = xx;\n\n\n\n\t\tfloat yy = 0.0f;\n\n\t\tif (other.y > 0.0f)\n\n\t\t{\n\n\t\t\tyy = y / other.y;\n\n\t\t}\n\n\t\ty = yy;\n\n\n\n\t\tfloat zz = 0.0f;\n","file_path":"Engine/src/CotVec4.cpp","rank":84,"score":81103.82075853318},{"content":"\t\treturn Vec4(x - value, y - value, z - value, w - value);\n\n\t}\n\n\n\n\tconst Vec4 Vec4::operator*(const float value) const\n\n\t{\n\n\t\treturn Vec4(x * value, y * value, z * value, w * value);\n\n\t}\n\n\n\n\tconst Vec4 Vec4::operator/(const float value) const\n\n\t{\n\n\t\tfloat xx = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\txx = x / value;\n\n\t\t}\n\n\n\n\t\tfloat yy = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\tyy = y / value;\n","file_path":"Engine/src/CotVec4.cpp","rank":87,"score":81103.11334090677},{"content":"#include \"math/CotVec2.h\"\n\n#include <cmath>\n\n\n\nnamespace Cot \n\n{\n\n\tVec2::Vec2()\n\n\t\t: x(0.0f), y(0.0f)\n\n\t{\t}\n\n\n\n\tVec2::Vec2(const float value)\n\n\t\t: x(value), y(value)\n\n\t{\t}\n\n\n\n\tVec2::Vec2(const float xx, const float yy)\n\n\t\t: x(xx), y(yy)\n\n\t{\t}\n\n\n\n\tVec2::Vec2(const float* array)\n\n\t\t: x(array[0]), y(array[1])\n\n\t{\t}\n","file_path":"Engine/src/CotVec2.cpp","rank":88,"score":35.03750153382204},{"content":"\t\t{\n\n\t\t\txx = x / other.x;\n\n\t\t}\n\n\n\n\t\tfloat yy = 0.0f;\n\n\t\tif (other.y > 0.0f)\n\n\t\t{\n\n\t\t\tyy = y / other.y;\n\n\t\t}\n\n\n\n\t\tfloat zz = 0.0f;\n\n\t\tif (other.z > 0.0f)\n\n\t\t{\n\n\t\t\tzz = z / other.z;\n\n\t\t}\n\n\t\treturn Vec3(xx, yy, zz);\n\n\t}\n\n\n\n\tconst Vec3 Vec3::operator+(const float value) const\n\n\t{\n","file_path":"Engine/src/CotVec3.cpp","rank":89,"score":30.876344442040335},{"content":"\n\n\t\tfloat yy = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\tyy = y / value;\n\n\t\t}\n\n\n\n\t\tfloat zz = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\tzz = z / value;\n\n\t\t}\n\n\t\treturn Vec3(xx, yy, zz);\n\n\t}\n\n\n\n\tVec3& Vec3::operator+=(const Vec3& other)\n\n\t{\n\n\t\tx += other.x;\n\n\t\ty += other.y;\n\n\t\tz += other.z;\n","file_path":"Engine/src/CotVec3.cpp","rank":90,"score":30.819872987667978},{"content":"\t{\t}\n\n\n\n\tVec3::Vec3(const float xx, const float yy, const float zz)\n\n\t\t: x(xx), y(yy), z(zz)\n\n\t{\t}\n\n\n\n\tVec3::Vec3(const float* array)\n\n\t\t: x(array[0]), y(array[1]), z(array[2])\n\n\t{\t}\n\n\n\n\tVec3::Vec3(const Vec3& other)\n\n\t\t: x(other.x), y(other.y), z(other.z)\n\n\t{\t}\n\n\n\n\tVec3::Vec3(const Vec3&& other)\n\n\t\t: x(other.x), y(other.y), z(other.z)\n\n\t{\t}\n\n\n\n\tVec3::~Vec3()\n\n\t{\t}\n","file_path":"Engine/src/CotVec3.cpp","rank":91,"score":30.81178252318434},{"content":"#include \"math/CotMat4.h\"\n\n#include \"math/CotGeometry.h\"\n\n#include \"math/CotVec3.h\"\n\n#include \"math/CotVec4.h\"\n\n#include \"math/CotQuaternion.h\"\n\n#include \"math/CotMathFunc.h\"\n\n#include <cmath>\n\n\n\nnamespace Cot \n\n{\n\n\tMat4::Mat4()\n\n\t\t: _11(1.0f), _12(0.0f), _13(0.0f), _14(0.0f)\n\n\t\t, _21(0.0f), _22(1.0f), _23(0.0f), _24(0.0f)\n\n\t\t, _31(0.0f), _32(0.0f), _33(1.0f), _34(0.0f)\n\n\t\t, _41(0.0f), _42(0.0f), _43(0.0f), _44(1.0f)\n\n\t{ }\n\n\n\n\tMat4::Mat4\n\n\t(\n\n\t\tconst float m11, const float m12, const float m13, const float m14,\n","file_path":"Engine/src/CotMat4.cpp","rank":92,"score":26.849276852293322},{"content":"\tconst Vec4 Vec4::operator*(const Vec4& other) const\n\n\t{\n\n\t\treturn Vec4(x * other.x, y * other.y, z * other.z, w * other.w);\n\n\t}\n\n\n\n\tconst Vec4 Vec4::operator/(const Vec4& other) const\n\n\t{\n\n\t\tfloat xx = 0.0f;\n\n\t\tif (other.x > 0.0f)\n\n\t\t{\n\n\t\t\txx = x / other.x;\n\n\t\t}\n\n\n\n\t\tfloat yy = 0.0f;\n\n\t\tif (other.y > 0.0f)\n\n\t\t{\n\n\t\t\tyy = y / other.y;\n\n\t\t}\n\n\n\n\t\tfloat zz = 0.0f;\n","file_path":"Engine/src/CotVec4.cpp","rank":93,"score":25.508493294490883},{"content":"\t{\n\n\t\tfloat deltaX = (other.x - x);\n\n\t\tfloat deltaY = (other.y - y);\n\n\t\tfloat deltaZ = (other.z - z);\n\n\t\tfloat deltaW = (other.w - w);\n\n\t\treturn sqrt(deltaX * deltaX + deltaY * deltaY + deltaZ * deltaZ + deltaW * deltaW);\n\n\t}\n\n\n\n\tfloat Vec4::Distance(const Vec4& other1, const Vec4& other2)\n\n\t{\n\n\t\tfloat deltaX = (other1.x - other2.x);\n\n\t\tfloat deltaY = (other1.y - other2.y);\n\n\t\tfloat deltaZ = (other1.z - other2.z);\n\n\t\tfloat deltaW = (other1.w - other2.w);\n\n\t\treturn sqrt(deltaX * deltaX + deltaY * deltaY + deltaZ * deltaZ + deltaW * deltaW);\n\n\t}\n\n\n\n\tfloat Vec4::Dot(const Vec4& other) const\n\n\t{\n\n\t\treturn x * other.x + y * other.y + z * other.z + w * other.w;\n","file_path":"Engine/src/CotVec4.cpp","rank":94,"score":24.365866709693567},{"content":"\t{\n\n\t\tfloat xx = 0.0f;\n\n\t\tif (other.x > 0.0f)\n\n\t\t{\n\n\t\t\txx = x / other.x;\n\n\t\t}\n\n\t\tx = xx;\n\n\n\n\t\tfloat yy = 0.0f;\n\n\t\tif (other.y > 0.0f)\n\n\t\t{\n\n\t\t\tyy = y / other.y;\n\n\t\t}\n\n\t\ty = yy;\n\n\n\n\t\tfloat zz = 0.0f;\n\n\t\tif (other.z > 0.0f)\n\n\t\t{\n\n\t\t\tzz = z / other.z;\n\n\t\t}\n","file_path":"Engine/src/CotVec3.cpp","rank":95,"score":22.745228921358937},{"content":"\t\tvoid ResetTransform();\n\n\n\n\t\tvoid SetPosition(const Vec3& position);\n\n\t\tvoid SetPositionX(float x);\n\n\t\tvoid SetPositionY(float y);\n\n\t\tvoid SetPositionZ(float z);\n\n\t\tVec3 GetPosition();\n\n\n\n\t\tvoid SetRotateAxis(float deg, const Vec3& axis);\n\n\t\tVec3 GetRotate();\n\n\n\n\t\tvoid SetScale(const Vec3& scale);\n\n\t\tvoid SetScaleX(float x);\n\n\t\tvoid SetScaleY(float y);\n\n\t\tvoid SetScaleZ(float z);\n\n\t\tVec3 GetScale();\n\n\n\n\t\tvoid SetLocalPosition(const Vec3& position);\n\n\t\tvoid SetLocalPositionX(float x);\n\n\t\tvoid SetLocalPositionY(float y);\n","file_path":"Engine/include/base/CotEntity.h","rank":96,"score":22.411138635926463},{"content":"\t\treturn Vec3(x + value, y + value, z + value);\n\n\t}\n\n\n\n\tconst Vec3 Vec3::operator-(const float value) const\n\n\t{\n\n\t\treturn Vec3(x - value, y - value, z - value);\n\n\t}\n\n\n\n\tconst Vec3 Vec3::operator*(const float value) const\n\n\t{\n\n\t\treturn Vec3(x * value, y * value, z * value);\n\n\t}\n\n\n\n\tconst Vec3 Vec3::operator/(const float value) const\n\n\t{\n\n\t\tfloat xx = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\txx = x / value;\n\n\t\t}\n","file_path":"Engine/src/CotVec3.cpp","rank":97,"score":21.74218556883645},{"content":"\t\tfloat xx = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\txx = x / value;\n\n\t\t}\n\n\n\n\t\tfloat yy = 0.0f;\n\n\t\tif (value > 0.0f)\n\n\t\t{\n\n\t\t\tyy = y / value;\n\n\t\t}\n\n\t\treturn Vec2(xx, yy);\n\n\t}\n\n\n\n\tVec2& Vec2::operator+=(const Vec2& other)\n\n\t{\n\n\t\tx += other.x;\n\n\t\ty += other.y;\n\n\t\treturn *this;\n\n\t}\n","file_path":"Engine/src/CotVec2.cpp","rank":98,"score":21.477735247423215},{"content":"\t\tif (other.z > 0.0f)\n\n\t\t{\n\n\t\t\tzz = z / other.z;\n\n\t\t}\n\n\t\tz = zz;\n\n\n\n\t\tfloat ww = 0.0f;\n\n\t\tif (other.w > 0.0f)\n\n\t\t{\n\n\t\t\tww = w / other.w;\n\n\t\t}\n\n\t\tw = ww;\n\n\n\n\t\treturn *this;\n\n\t}\n\n\n\n\tVec4& Vec4::operator=(const Vec4& other)\n\n\t{\n\n\t\tx = other.x;\n\n\t\ty = other.y;\n","file_path":"Engine/src/CotVec4.cpp","rank":99,"score":21.477018882151537}],"string":"[\n {\n \"content\": \"\\tclass Vec4;\\n\",\n \"file_path\": \"Engine/include/math/CotQuaternion.h\",\n \"rank\": 0,\n \"score\": 178629.8132119183\n },\n {\n \"content\": \"\\tclass Vec3;\\n\",\n \"file_path\": \"Engine/include/math/CotQuaternion.h\",\n \"rank\": 1,\n \"score\": 178621.05006660835\n },\n {\n \"content\": \"\\tclass Vec3;\\n\",\n \"file_path\": \"Engine/include/math/CotVec4.h\",\n \"rank\": 2,\n \"score\": 178615.00717985723\n },\n {\n \"content\": \"\\tclass COT_API Quaternion final\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tunion\\n\\n\\t\\t{\\n\\n\\t\\t\\tstruct\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tfloat x, y, z, w;\\n\\n\\t\\t\\t};\\n\\n\\t\\t\\tfloat ToArray[4];\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tQuaternion();\\n\\n\\t\\tQuaternion(const float value);\\n\\n\\t\\tQuaternion(const float xx, const float yy, const float zz, const float ww);\\n\\n\\t\\tQuaternion(const float* array);\\n\\n\\t\\tQuaternion(const Vec3& v, float ww);\\n\\n\\t\\tQuaternion(const Vec4& v);\\n\\n\\t\\tQuaternion(const Quaternion& other);\\n\\n\\t\\tQuaternion(const Quaternion&& other);\\n\",\n \"file_path\": \"Engine/include/math/CotQuaternion.h\",\n \"rank\": 3,\n \"score\": 139933.4873862201\n },\n {\n \"content\": \"\\tclass COT_API Vec4 final\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tunion\\n\\n\\t\\t{\\n\\n\\t\\t\\tstruct\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tfloat x, y, z, w;\\n\\n\\t\\t\\t};\\n\\n\\t\\t\\tfloat ToArray[4];\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tVec4();\\n\\n\\t\\tVec4(const float value);\\n\\n\\t\\tVec4(const float xx, const float yy);\\n\\n\\t\\tVec4(const Vec2& other);\\n\\n\\t\\tVec4(const float xx, const float yy, const float zz);\\n\\n\\t\\tVec4(const Vec3& other);\\n\\n\\t\\tVec4(const float xx, const float yy, const float zz, const float ww);\\n\\n\\t\\tVec4(const float* array);\\n\",\n \"file_path\": \"Engine/include/math/CotVec4.h\",\n \"rank\": 4,\n \"score\": 139922.6252362061\n },\n {\n \"content\": \"\\tclass COT_API Vec3 final\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tunion\\n\\n\\t\\t{\\n\\n\\t\\t\\tstruct\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tfloat x, y, z;\\n\\n\\t\\t\\t};\\n\\n\\t\\t\\tfloat ToArray[3];\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tVec3();\\n\\n\\t\\tVec3(const float value);\\n\\n\\t\\tVec3(const float xx, const float yy);\\n\\n\\t\\tVec3(const Vec2& other);\\n\\n\\t\\tVec3(const float xx, const float yy, const float zz);\\n\\n\\t\\tVec3(const float* array);\\n\\n\\t\\tVec3(const Vec3& other);\\n\\n\\t\\tVec3(const Vec3&& other);\\n\",\n \"file_path\": \"Engine/include/math/CotVec3.h\",\n \"rank\": 5,\n \"score\": 139913.6793728065\n },\n {\n \"content\": \"\\tclass Vec3;\\n\",\n \"file_path\": \"Engine/include/math/CotMat4.h\",\n \"rank\": 6,\n \"score\": 137059.68324513195\n },\n {\n \"content\": \" LONG x2;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 7,\n \"score\": 127452.1586376348\n },\n {\n \"content\": \" FLOAT V; // Barycentric Hit Coordinates\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3dx9mesh.h\",\n \"rank\": 8,\n \"score\": 127446.72211593491\n },\n {\n \"content\": \" INT Pitch;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 9,\n \"score\": 127441.62357961375\n },\n {\n \"content\": \" SHORT X, Y; // Top-left coordinates of the rect in the destination surface\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 10,\n \"score\": 127419.73172161318\n },\n {\n \"content\": \" long W;\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/vorbis/codec.h\",\n \"rank\": 11,\n \"score\": 124353.67243869304\n },\n {\n \"content\": \"\\t\\t~Quaternion();\\n\\n\\n\\n\\t\\tvoid SetXYZ(const Vec3& v);\\n\\n\\t\\tVec3 GetXYZ() const;\\n\\n\\n\\n\\t\\tvoid SetEuler(const Vec3& euler);\\n\\n\\t\\tVec3 GetEuler() const;\\n\\n\\n\\n\\t\\tfloat Length() const;\\n\\n\\t\\tVec3 GetAxis() const;\\n\\n\\n\\n\\t\\tconst Quaternion operator+(const Quaternion& other) const;\\n\\n\\t\\tconst Quaternion operator-(const Quaternion& other) const;\\n\\n\\t\\tconst Quaternion operator*(const Quaternion& other) const;\\n\\n\\t\\tconst Quaternion operator/(const Quaternion& other) const;\\n\\n\\n\\n\\t\\tconst Quaternion operator+(const float value) const;\\n\\n\\t\\tconst Quaternion operator-(const float value) const;\\n\\n\\t\\tconst Quaternion operator*(const float value) const;\\n\\n\\t\\tconst Quaternion operator/(const float value) const;\\n\",\n \"file_path\": \"Engine/include/math/CotQuaternion.h\",\n \"rank\": 12,\n \"score\": 118949.18311877771\n },\n {\n \"content\": \"\\t\\tbool operator==(const Quaternion& other) const;\\n\\n\\t\\tbool operator!=(const Quaternion& other) const;\\n\\n\\n\\n\\t\\tbool IsZero() const;\\n\\n\\t\\tbool IsOne() const;\\n\\n\\n\\n\\t\\tstatic const Vec3 Rotate(const Quaternion& quaternion, const Vec3& axis);\\n\\n\\n\\n\\t\\tstatic const Quaternion Rotation(const Vec3& axis1, const Vec3& axis2);\\n\\n\\t\\tstatic const Quaternion Rotation(const float r, const Vec3 axis);\\n\\n\\n\\n\\t\\tstatic const Quaternion RotationX(const float r);\\n\\n\\t\\tstatic const Quaternion RotationY(const float r);\\n\\n\\t\\tstatic const Quaternion RotationZ(const float r);\\n\\n\\n\\n\\t\\tQuaternion Normalize();\\n\\n\\t\\tstatic Quaternion Normalize(const Quaternion& other);\\n\\n\\n\\n\\t\\tfloat Dot(const Quaternion& other) const;\\n\\n\\t\\tstatic float Dot(const Quaternion& other1, const Quaternion& other2);\\n\\n\\n\\n\\t\\tQuaternion Conjugate() const;\\n\\n\\n\\n\\t\\tstatic const Quaternion Zero;\\n\\n\\t\\tstatic const Quaternion Identity;\\n\\n\\t};\\n\\n}\",\n \"file_path\": \"Engine/include/math/CotQuaternion.h\",\n \"rank\": 13,\n \"score\": 118936.54392515883\n },\n {\n \"content\": \"\\n\\n\\t\\tQuaternion& operator+=(const Quaternion& other);\\n\\n\\t\\tQuaternion& operator-=(const Quaternion& other);\\n\\n\\t\\tQuaternion& operator*=(const Quaternion& other);\\n\\n\\t\\tQuaternion& operator/=(const Quaternion& other);\\n\\n\\t\\tQuaternion& operator=(const Quaternion& other);\\n\\n\\n\\n\\t\\tQuaternion& operator+=(const float value);\\n\\n\\t\\tQuaternion& operator-=(const float value);\\n\\n\\t\\tQuaternion& operator*=(const float value);\\n\\n\\t\\tQuaternion& operator/=(const float value);\\n\\n\\t\\tQuaternion& operator=(const float value);\\n\\n\\n\\n\\t\\tconst Quaternion operator-() const;\\n\\n\\n\\n\\t\\tbool operator<(const Quaternion& other) const;\\n\\n\\t\\tbool operator<=(const Quaternion& other) const;\\n\\n\\t\\tbool operator>(const Quaternion& other) const;\\n\\n\\t\\tbool operator>=(const Quaternion& other) const;\\n\\n\\n\",\n \"file_path\": \"Engine/include/math/CotQuaternion.h\",\n \"rank\": 14,\n \"score\": 118933.27317433007\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"base/CotRule.h\\\"\\n\\n\\n\\nnamespace Cot \\n\\n{\\n\",\n \"file_path\": \"Engine/include/math/CotQuaternion.h\",\n \"rank\": 15,\n \"score\": 118931.62037861774\n },\n {\n \"content\": \"\\t\\tVec4& operator+=(const float value);\\n\\n\\t\\tVec4& operator-=(const float value);\\n\\n\\t\\tVec4& operator*=(const float value);\\n\\n\\t\\tVec4& operator/=(const float value);\\n\\n\\t\\tVec4& operator=(const float value);\\n\\n\\n\\n\\t\\tconst Vec4 operator-() const;\\n\\n\\n\\n\\t\\tbool operator<(const Vec4& other) const;\\n\\n\\t\\tbool operator<=(const Vec4& other) const;\\n\\n\\t\\tbool operator>(const Vec4& other) const;\\n\\n\\t\\tbool operator>=(const Vec4& other) const;\\n\\n\\n\\n\\t\\tbool operator==(const Vec4& other) const;\\n\\n\\t\\tbool operator!=(const Vec4& other) const;\\n\\n\\n\\n\\t\\tbool IsZero() const;\\n\\n\\t\\tbool IsOne() const;\\n\\n\\n\\n\\t\\tVec4 Normalize();\\n\",\n \"file_path\": \"Engine/include/math/CotVec4.h\",\n \"rank\": 16,\n \"score\": 118926.86689404667\n },\n {\n \"content\": \"\\t\\tVec4(const Vec4& other);\\n\\n\\t\\tVec4(const Vec4&& other);\\n\\n\\t\\t~Vec4();\\n\\n\\n\\n\\t\\tconst Vec4 operator+(const Vec4& other) const;\\n\\n\\t\\tconst Vec4 operator-(const Vec4& other) const;\\n\\n\\t\\tconst Vec4 operator*(const Vec4& other) const;\\n\\n\\t\\tconst Vec4 operator/(const Vec4& other) const;\\n\\n\\n\\n\\t\\tconst Vec4 operator+(const float value) const;\\n\\n\\t\\tconst Vec4 operator-(const float value) const;\\n\\n\\t\\tconst Vec4 operator*(const float value) const;\\n\\n\\t\\tconst Vec4 operator/(const float value) const;\\n\\n\\n\\n\\t\\tVec4& operator+=(const Vec4& other);\\n\\n\\t\\tVec4& operator-=(const Vec4& other);\\n\\n\\t\\tVec4& operator*=(const Vec4& other);\\n\\n\\t\\tVec4& operator/=(const Vec4& other);\\n\\n\\t\\tVec4& operator=(const Vec4& other);\\n\\n\\n\",\n \"file_path\": \"Engine/include/math/CotVec4.h\",\n \"rank\": 17,\n \"score\": 118926.53946229967\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"base/CotRule.h\\\"\\n\\n\\n\\nnamespace Cot\\n\\n{\\n\",\n \"file_path\": \"Engine/include/math/CotVec4.h\",\n \"rank\": 18,\n \"score\": 118925.32484451986\n },\n {\n \"content\": \"\\t\\tstatic Vec4 Normalize(const Vec4& other);\\n\\n\\n\\n\\t\\tfloat Length() const;\\n\\n\\t\\tfloat Distance(const Vec4& other) const;\\n\\n\\t\\tstatic float Distance(const Vec4& other1, const Vec4& other2);\\n\\n\\n\\n\\t\\tfloat Dot(const Vec4& other) const;\\n\\n\\t\\tstatic float Dot(const Vec4& other1, const Vec4& other2);\\n\\n\\n\\n\\t\\tstatic const Vec4 Zero;\\n\\n\\t\\tstatic const Vec4 One;\\n\\n\\t};\\n\\n}\",\n \"file_path\": \"Engine/include/math/CotVec4.h\",\n \"rank\": 19,\n \"score\": 118922.34393859975\n },\n {\n \"content\": \"\\t\\t~Vec3();\\n\\n\\n\\n\\t\\tconst Vec3 operator+(const Vec3& other) const;\\n\\n\\t\\tconst Vec3 operator-(const Vec3& other) const;\\n\\n\\t\\tconst Vec3 operator*(const Vec3& other) const;\\n\\n\\t\\tconst Vec3 operator/(const Vec3& other) const;\\n\\n\\n\\n\\t\\tconst Vec3 operator+(const float value) const;\\n\\n\\t\\tconst Vec3 operator-(const float value) const;\\n\\n\\t\\tconst Vec3 operator*(const float value) const;\\n\\n\\t\\tconst Vec3 operator/(const float value) const;\\n\\n\\n\\n\\t\\tVec3& operator+=(const Vec3& other);\\n\\n\\t\\tVec3& operator-=(const Vec3& other);\\n\\n\\t\\tVec3& operator*=(const Vec3& other);\\n\\n\\t\\tVec3& operator/=(const Vec3& other);\\n\\n\\t\\tVec3& operator=(const Vec3& other);\\n\\n\\n\\n\\t\\tVec3& operator+=(const float value);\\n\\n\\t\\tVec3& operator-=(const float value);\\n\",\n \"file_path\": \"Engine/include/math/CotVec3.h\",\n \"rank\": 20,\n \"score\": 118921.09965309182\n },\n {\n \"content\": \"\\t\\tVec3& operator*=(const float value);\\n\\n\\t\\tVec3& operator/=(const float value);\\n\\n\\t\\tVec3& operator=(const float value);\\n\\n\\n\\n\\t\\tconst Vec3 operator*(const Mat4& mat) const;\\n\\n\\t\\tVec3& operator*=(const Mat4& mat);\\n\\n\\n\\n\\t\\tconst Vec3 operator-() const;\\n\\n\\n\\n\\t\\tbool operator<(const Vec3& other) const;\\n\\n\\t\\tbool operator<=(const Vec3& other) const;\\n\\n\\t\\tbool operator>(const Vec3& other) const;\\n\\n\\t\\tbool operator>=(const Vec3& other) const;\\n\\n\\n\\n\\t\\tbool operator==(const Vec3& other) const;\\n\\n\\t\\tbool operator!=(const Vec3& other) const;\\n\\n\\n\\n\\t\\tbool IsZero() const;\\n\\n\\t\\tbool IsOne() const;\\n\\n\\n\",\n \"file_path\": \"Engine/include/math/CotVec3.h\",\n \"rank\": 21,\n \"score\": 118919.0888960675\n },\n {\n \"content\": \"\\t\\tVec3 Normalize();\\n\\n\\t\\tstatic Vec3 Normalize(const Vec3& other);\\n\\n\\n\\n\\t\\tfloat Length() const;\\n\\n\\t\\tfloat Distance(const Vec3& other) const;\\n\\n\\t\\tstatic float Distance(const Vec3& other1, const Vec3& other2);\\n\\n\\n\\n\\t\\tfloat Dot(const Vec3& other) const;\\n\\n\\t\\tstatic float Dot(const Vec3& other1, const Vec3& other2);\\n\\n\\n\\n\\t\\tVec3 Cross(const Vec3& other) const;\\n\\n\\t\\tstatic Vec3 Cross(const Vec3& other1, const Vec3& other2);\\n\\n\\n\\n\\t\\tstatic const Vec3 Zero;\\n\\n\\t\\tstatic const Vec3 One;\\n\\n\\n\\n\\t\\tstatic const Vec3 Front;\\n\\n\\t\\tstatic const Vec3 Back;\\n\\n\\t\\tstatic const Vec3 Up;\\n\\n\\t\\tstatic const Vec3 Down;\\n\\n\\t\\tstatic const Vec3 Left;\\n\\n\\t\\tstatic const Vec3 Right;\\n\\n\\n\\n\\t\\tstatic const Vec3 AxisX;\\n\\n\\t\\tstatic const Vec3 AxisY;\\n\\n\\t\\tstatic const Vec3 AxisZ;\\n\\n\\t};\\n\\n}\",\n \"file_path\": \"Engine/include/math/CotVec3.h\",\n \"rank\": 22,\n \"score\": 118919.03005153978\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"base/CotRule.h\\\"\\n\\n\\n\\nnamespace Cot \\n\\n{\\n\",\n \"file_path\": \"Engine/include/math/CotVec3.h\",\n \"rank\": 23,\n \"score\": 118919.02303443008\n },\n {\n \"content\": \"\\tclass Vec2;\\n\",\n \"file_path\": \"Engine/include/math/CotVec4.h\",\n \"rank\": 24,\n \"score\": 114138.55982552955\n },\n {\n \"content\": \"\\tclass Vec2;\\n\",\n \"file_path\": \"Engine/include/math/CotVec3.h\",\n \"rank\": 25,\n \"score\": 114132.51091464961\n },\n {\n \"content\": \"\\tclass Mat4;\\n\",\n \"file_path\": \"Engine/include/math/CotVec3.h\",\n \"rank\": 26,\n \"score\": 114132.51091464961\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tCOT_API inline const char* GetVersion()\\n\\n\\t{\\n\\n\\t\\treturn \\\"CotEngine v1.5.7\\\";\\n\\n\\t}\\n\",\n \"file_path\": \"Engine/include/CotEngine.h\",\n \"rank\": 27,\n \"score\": 111556.95664367868\n },\n {\n \"content\": \"\\t\\tclass Vec4 GetColumn(int index);\\n\\n\\n\\n\\t\\tstatic Mat4 Multiply(const Mat4& mat1, const Mat4& mat2);\\n\\n\\n\\n\\t\\tstatic Mat4 Orthographic(float left, float right, float bottom, float top, float near, float far);\\n\\n\\t\\tstatic Mat4 Perspective(float fov, float aspectRatio, float near, float far);\\n\\n\\t\\tstatic Mat4 LookAt(const class Vec3& eye, const Vec3& center, const Vec3& up);\\n\\n\\n\\n\\t\\tstatic Mat4 Translate(const Vec3& position);\\n\\n\\t\\tstatic Mat4 Rotate(float angle, const Vec3& axis);\\n\\n\\t\\tstatic Mat4 Rotate(const class Quaternion& quaternion);\\n\\n\\t\\tstatic Mat4 Scale(const Vec3& scale);\\n\\n\\t\\tstatic Mat4 Transpose(const Mat4& mat);\\n\\n\\n\\n\\t\\tstatic const Mat4 Zero;\\n\\n\\t\\tstatic const Mat4 Identity;\\n\\n\\n\\n\\t};\\n\\n}\",\n \"file_path\": \"Engine/include/math/CotMat4.h\",\n \"rank\": 28,\n \"score\": 110604.494833343\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponent(Button, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(Button);\\n\\n\\tprivate:\\n\\n\\t\\tenum class Type { Color, Image, };\\n\\n\\t\\tType\\t\\t\\t\\t_buttonType;\\n\\n\\t\\tSpriteRenderer*\\t\\t_spriteRenderer;\\n\\n\\t\\tTexture*\\t\\t\\t_originImage;\\n\\n\\t\\tTexture*\\t\\t\\t_clickImage;\\n\\n\\t\\tColor\\t\\t\\t\\t_originColor;\\n\\n\\t\\tColor\\t\\t\\t\\t_clickColor;\\n\\n\\t\\tbool\\t\\t\\t\\t_down;\\n\\n\\n\\n\\t\\tCallBack<void()>\\t_buttonDown;\\n\\n\\t\\tCallBack<void()>\\t_buttonUp;\\n\\n\\t\\tCallBack<void()>\\t_buttonClick;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\t// Image\\n\\n\\t\\tButton* Init(const string& clickImage);\\n\\n\\t\\tButton* Init(const Color& clickColor);\\n\\n\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Awake() override;\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\n\\n\\t\\tvoid AddButtonDown(const Function<void()>& function);\\n\\n\\t\\tvoid AddButtonUp(const Function<void()>& function);\\n\\n\\t\\tvoid AddButtonClick(const Function<void()>& function);\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotButton.h\",\n \"rank\": 29,\n \"score\": 109676.05568774493\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tCOT_API inline bool IntersectRect(Rect& rect1, Rect& rect2);\\n\\n\\tCOT_API inline bool IntersectCircle(Circle& circle1, Circle& circle2);\\n\\n\\n\\n\\tCOT_API inline bool IntersectRectCircle(Rect& rect, Circle& circle);\\n\\n\\n\\n\\tCOT_API inline bool PointInRect(Rect& rect, Vec2& position);\\n\",\n \"file_path\": \"Engine/include/physics/CotPhysics.h\",\n \"rank\": 30,\n \"score\": 109676.05568774493\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tCOT_API void RegisteInputDevice(InputDevice* device);\\n\\n\\tCOT_API void DestroyInputDevice();\\n\\n\\n\\n\\tCOT_API bool IsKeyDown(KeyCode code);\\n\\n\\tCOT_API bool IsKeyStay(KeyCode code);\\n\\n\\tCOT_API bool IsKeyUp(KeyCode code);\\n\\n\\n\\n\\tCOT_API bool IsMouseDown(MouseButton button);\\n\\n\\tCOT_API bool IsMouseStay(MouseButton button);\\n\\n\\tCOT_API bool IsMouseUp(MouseButton button);\\n\\n\\n\\n\\tCOT_API Vec2 GetMousePosition();\\n\\n\\tCOT_API float GetMouseWheel();\\n\",\n \"file_path\": \"Engine/include/input/CotInput.h\",\n \"rank\": 31,\n \"score\": 109676.05568774493\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponent(ICollider)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(ICollider);\\n\\n\\tpublic:\\n\\n\\t\\tenum class Type\\n\\n\\t\\t{\\n\\n\\t\\t\\tBox,\\n\\n\\t\\t\\tCircle,\\n\\n\\t\\t\\tLine,\\n\\n\\t\\t};\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tType\\t_collType;\\n\\n\\t\\tbool\\t_enter = false;\\n\\n\\t\\tEntity* _target;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid SetEnter(bool enter) { _enter = enter; }\\n\\n\\t\\tbool IsEnter() { return _enter; }\\n\\n\\n\\n\\t\\tType GetCollType() { return _collType; }\\n\\n\\n\\n\\t\\tvoid SetTarget(Entity* target) { _target = target; }\\n\\n\\t\\tEntity* GetTarget() { return _target; }\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotICollider.h\",\n \"rank\": 32,\n \"score\": 109676.05568774493\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tCOT_API inline D3DXCOLOR\\t\\tToDxMath(const Color32& color);\\n\\n\\tCOT_API inline D3DXMATRIX\\t\\tToDxMath(const Mat4& mat);\\n\\n\\tCOT_API inline D3DXVECTOR2\\t\\tToDxMath(const Vec2& vec);\\n\\n\\tCOT_API inline D3DXVECTOR3\\t\\tToDxMath(const Vec3& vec);\\n\\n\\tCOT_API inline D3DXVECTOR4\\t\\tToDxMath(const Vec4& vec);\\n\\n\\tCOT_API inline D3DXQUATERNION\\tToDxMath(const Quaternion& quternion);\\n\\n\\tCOT_API inline RECT\\t\\t\\t\\tToDxMath(Rect& rect);\\n\",\n \"file_path\": \"Engine/include/math/CotGL2DX.h\",\n \"rank\": 33,\n \"score\": 109676.05568774493\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponentExt(FontRenderer, IRenderComponent, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(FontRenderer);\\n\\n\\tprivate:\\n\\n\\t\\tFont*\\t_font;\\n\\n\\t\\tstring\\t_text;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tFontRenderer* Init(const string& font, const string& text, int fontSize);\\n\\n\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\t\\tvoid OnDestroy() override;\\n\\n\\n\\n\\t\\tvoid SetFont(Font* font);\\n\\n\\t\\tvoid SetFont(const string& font, int fontSize);\\n\\n\\t\\tFont* GetFont() { return _font; }\\n\\n\\n\\n\\t\\tvoid SetFontSize(int fontSize);\\n\\n\\t\\tint GetFontSize() { return _font->GetFontSize(); }\\n\\n\\n\\n\\t\\tvoid SetText(const string& text);\\n\\n\\t\\tstring GetText() { return _text; }\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotFontRenderer.h\",\n \"rank\": 34,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tenum class AudioState\\n\\n\\t{\\n\\n\\t\\tPlaying,\\n\\n\\t\\tPaused,\\n\\n\\t\\tStopped,\\n\\n\\t};\\n\\n\\n\\n\\tComponent(AudioSource, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(AudioSource);\\n\\n\\tprivate:\\n\\n\\t\\tAudioClip*\\t_clip;\\n\\n\\t\\tAudioState\\t_state;\\n\\n\\t\\tALuint\\t\\t_source;\\n\\n\\t\\tfloat\\t\\t_volume;\\n\\n\\t\\tfloat\\t\\t_pitch;\\n\\n\\t\\tfloat\\t\\t_maxDistance;\\n\\n\\t\\tVec3\\t\\t_velocity;\\n\\n\\t\\tbool\\t\\t_loop;\\n\\n\\t\\tbool\\t\\t_2d;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tAudioSource* Init(const string& filename, bool loop = false);\\n\\n\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\t\\tvoid OnDestroy() override;\\n\\n\\n\\n\\t\\tvoid Play();\\n\\n\\t\\tvoid Pause();\\n\\n\\t\\tvoid Resume();\\n\\n\\t\\tvoid Stop();\\n\\n\\n\\n\\t\\tvoid SetClip(const string& filename);\\n\\n\\t\\tAudioClip& GetClip() { return *_clip; }\\n\\n\\n\\n\\t\\tvoid SetPitch(float pitch);\\n\\n\\t\\tfloat GetPitch() { return _pitch; }\\n\\n\\n\\n\\t\\tvoid SetLoop(bool loop);\\n\\n\\t\\tbool IsLoop() { return _loop; }\\n\\n\\n\\n\\t\\tvoid SetVolume(float volume);\\n\\n\\t\\tfloat GetVolume() { return _volume; }\\n\\n\\n\\n\\t\\tint GetPosition();\\n\\n\\t\\tint GetLength() { return _clip->GetLength(); }\\n\\n\\n\\n\\t\\tvoid SetMaxDistance(float maxDistance);\\n\\n\\t\\tfloat GetMaxDistance() { return _maxDistance; }\\n\\n\\n\\n\\t\\tvoid SetVelocity(const Vec3& velocity);\\n\\n\\t\\tVec3 GetVelocity() { return _velocity; }\\n\\n\\n\\n\\t\\tvoid Set2D(bool value);\\n\\n\\t\\tbool Is2D() { return _2d; }\\n\\n\\n\\n\\t\\tAudioState GetState() { return _state; }\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotAudioSource.h\",\n \"rank\": 35,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponentExt(SpriteRenderer, IRenderComponent, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(SpriteRenderer);\\n\\n\\tprotected:\\n\\n\\t\\tTexture*\\t_texture;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tSpriteRenderer* Init(const string& filename);\\n\\n\\t\\tSpriteRenderer* Init(const string& caif, const string& key);\\n\\n\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\t\\tvoid OnDestroy() override;\\n\\n\\n\\n\\t\\tvoid SetTexture(Texture* texture);\\n\\n\\t\\tvoid SetTexture(const string& filename);\\n\\n\\t\\tvoid SetTexture(const string& caif, const string& key);\\n\\n\\t\\tTexture* GetTexture() { return _texture; }\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotSpriteRenderer.h\",\n \"rank\": 36,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponent(PrograssBar, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(PrograssBar);\\n\\n\\tprivate:\\n\\n\\t\\tSpriteRenderer* _spriteRenderer;\\n\\n\\t\\tfloat _value;\\n\\n\\t\\tfloat _x;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Awake() override;\\n\\n\\n\\n\\t\\tvoid SetValue(float value);\\n\\n\\t\\tfloat GetValue() { return _value; }\\n\\n\\t\\t\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotPrograssBar.h\",\n \"rank\": 37,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot \\n\\n{\\n\\n\\tCOT_API inline float ToRad(const float deg);\\n\\n\\tCOT_API inline float ToDeg(const float rad);\\n\\n\\tCOT_API inline float Pi();\\n\\n\\tCOT_API inline float Lerp(float v1, float v2, float amount);\\n\\n\\t\\n\\n\\ttemplate<typename T>\\n\\n\\tCOT_API inline T Clamp(const T value, const T min, const T max)\\n\\n\\t{\\n\\n\\t\\tif (value < min)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn min;\\n\\n\\t\\t}\\n\\n\\t\\telse if (value > max)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn max;\\n\\n\\t\\t}\\n\\n\\t\\treturn value;\\n\\n\\t}\\n\\n\\n\\n\\ttemplate<typename T>\\n\\n\\tCOT_API inline T Max(const T v1, const T v2)\\n\\n\\t{\\n\\n\\t\\treturn (v1 > v2) ? return v1 : return v2;\\n\\n\\t}\\n\\n\\n\\n\\ttemplate<typename T>\\n\\n\\tCOT_API inline T Min(const T v1, const T v2)\\n\\n\\t{\\n\\n\\t\\treturn (v1 > v2) ? return v1 : return v2;\\n\\n\\t}\\n\",\n \"file_path\": \"Engine/include/math/CotMathFunc.h\",\n \"rank\": 38,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponentExt(BoxCollider, ICollider, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(BoxCollider);\\n\\n\\tprivate:\\n\\n\\t\\tSize\\t_size;\\n\\n\\t\\tVec2\\t_offset;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tBoxCollider* Init(const Size& size = Size(300, 300));\\n\\n\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\n\\n\\t\\tvoid SetSpriteSize();\\n\\n\\n\\n\\t\\tvoid SetOffset(const Vec2& offset);\\n\\n\\t\\tVec2 GetOffset() { return _offset; }\\n\\n\\n\\n\\t\\tvoid SetRect(const Size& size);\\n\\n\\t\\tRect GetRect();\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotBoxCollider.h\",\n \"rank\": 39,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponentExt(ScrollBar, SpriteRenderer, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(ScrollBar);\\n\\n\\tprivate:\\n\\n\\t\\tEntity* _button;\\n\\n\\t\\tbool\\t_buttonDown;\\n\\n\\t\\tfloat\\t_beginY;\\n\\n\\t\\tfloat\\t_endY;\\n\\n\\n\\n\\t\\tfloat\\t_value;\\n\\n\\t\\tfloat\\t_minValue;\\n\\n\\t\\tfloat\\t_maxValue;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tScrollBar* Init(const string& background, Entity* button);\\n\\n\\t\\t\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\t\\tvoid OnDestroy() override;\\n\\n\\n\\n\\t\\tvoid SetValue(float value);\\n\\n\\t\\tfloat GetValue() { return _value; }\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotScrollBar.h\",\n \"rank\": 40,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponent(IRenderComponent, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(IRenderComponent);\\n\\n\\tpublic:\\n\\n\\t\\tenum class Type\\n\\n\\t\\t{\\n\\n\\t\\t\\tSprite,\\n\\n\\t\\t\\tFont,\\n\\n\\t\\t};\\n\\n\\t\\t\\n\\n\\tprotected:\\n\\n\\t\\tType\\t_renderType;\\n\\n\\t\\tVec2\\t_anchor;\\n\\n\\t\\tColor\\t_color;\\n\\n\\t\\tRect\\t_rect;\\n\\n\\t\\tSize\\t_size;\\n\\n\\t\\tint\\t\\t_depth;\\n\\n\\t\\tMask*\\t_maskData;\\n\\n\\t\\tbool\\t_masked;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tType GetRenderType() { return _renderType; }\\n\\n\\n\\n\\t\\tvoid SetMask(Mask* maskData, bool value);\\n\\n\\t\\tbool IsUseMask() { return _masked; }\\n\\n\\t\\tMask* GetMaskData() { return _maskData; }\\n\\n\\n\\n\\t\\tvoid SetAnchor(const Vec2& anchor);\\n\\n\\t\\tVec2 GetAnchor() { return _anchor; }\\n\\n\\n\\n\\t\\tvoid SetRect(const Rect& rect);\\n\\n\\t\\tRect GetRect() { return _rect; }\\n\\n\\n\\n\\t\\tvoid SetSize(const Size& size);\\n\\n\\t\\tSize GetSize() { return _size; }\\n\\n\\n\\n\\t\\tvoid SetDepth(int depth);\\n\\n\\t\\tint GetDepth() { return _depth; }\\n\\n\\n\\n\\t\\tvoid SetColor(const Color& color);\\n\\n\\t\\tColor GetColor() { return _color; }\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotIRenderComponent.h\",\n \"rank\": 41,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponent(AudioListener, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(AudioListener);\\n\\n\\tprivate:\\n\\n\\t\\tALCdevice*\\t_device;\\n\\n\\t\\tALCcontext* _context;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tAudioListener* Init();\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotAudioListener.h\",\n \"rank\": 42,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"namespace Cot\\n\\n{\\n\\n\\tComponentExt(CircleCollider, ICollider, COT_API)\\n\\n\\t{\\n\\n\\t\\tCOT_COMPONENT(CircleCollider);\\n\\n\\tprivate:\\n\\n\\t\\tfloat\\t_radius;\\n\\n\\t\\tVec2\\t_offset;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tCircleCollider* Init(float radius = 0.0f);\\n\\n\\n\\n\\t\\tvoid Reset() override;\\n\\n\\t\\tvoid Update(Time& time) override;\\n\\n\\n\\n\\t\\tvoid SetOffset(const Vec2& offset);\\n\\n\\t\\tVec2 GetOffset() { return _offset; }\\n\\n\\n\\n\\t\\tvoid SetRadius(float radius);\\n\\n\\t\\tCircle GetCircle();\\n\\n\\n\\n\\t};\\n\",\n \"file_path\": \"Engine/include/component/CotCircleCollider.h\",\n \"rank\": 43,\n \"score\": 107891.36542042563\n },\n {\n \"content\": \"class ValueConstIterator;\\n\\n\\n\\n} // namespace Json\\n\\n\\n\\n#endif // JSON_FORWARDS_H_INCLUDED\\n\\n\\n\\n// //////////////////////////////////////////////////////////////////////\\n\\n// End of content of file: include/json/forwards.h\\n\\n// //////////////////////////////////////////////////////////////////////\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n// //////////////////////////////////////////////////////////////////////\\n\\n// Beginning of content of file: include/json/features.h\\n\\n// //////////////////////////////////////////////////////////////////////\\n\\n\\n\\n// Copyright 2007-2010 Baptiste Lepilleur and The JsonCpp Authors\\n\",\n \"file_path\": \"Engine/thirdparty/json/include/json/json.h\",\n \"rank\": 44,\n \"score\": 106667.98681231124\n },\n {\n \"content\": \"class ValueConstIterator;\\n\\n\\n\\n} // namespace Json\\n\\n\\n\\n#endif // JSON_FORWARDS_H_INCLUDED\\n\\n\\n\\n// //////////////////////////////////////////////////////////////////////\\n\\n// End of content of file: include/json/forwards.h\\n\\n// //////////////////////////////////////////////////////////////////////\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n#endif //ifndef JSON_FORWARD_AMALGATED_H_INCLUDED\\n\",\n \"file_path\": \"Engine/thirdparty/json/include/json/json-forwards.h\",\n \"rank\": 45,\n \"score\": 102979.38451773452\n },\n {\n \"content\": \"class JSON_API ValueConstIterator : public ValueIteratorBase {\\n\\n friend class Value;\\n\\n\\n\\npublic:\\n\\n typedef const Value value_type;\\n\\n //typedef unsigned int size_t;\\n\\n //typedef int difference_type;\\n\\n typedef const Value& reference;\\n\\n typedef const Value* pointer;\\n\\n typedef ValueConstIterator SelfType;\\n\\n\\n\\n ValueConstIterator();\\n\\n ValueConstIterator(ValueIterator const& other);\\n\\n\\n\\nprivate:\\n\\n/*! \\\\internal Use by Value to create an iterator.\\n\\n */\\n\\n explicit ValueConstIterator(const Value::ObjectValues::iterator& current);\\n\\npublic:\\n\\n SelfType& operator=(const ValueIteratorBase& other);\\n\",\n \"file_path\": \"Engine/thirdparty/json/include/json/json.h\",\n \"rank\": 46,\n \"score\": 100690.82367664558\n },\n {\n \"content\": \" LPVOID pValue; // data for the default of the effect\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3dx9mesh.h\",\n \"rank\": 47,\n \"score\": 95083.18530760742\n },\n {\n \"content\": \" D3DXQUATERNION Value;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3dx9anim.h\",\n \"rank\": 48,\n \"score\": 95078.58241840679\n },\n {\n \"content\": \" WORD value;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3dx9math.h\",\n \"rank\": 49,\n \"score\": 95078.58241840678\n },\n {\n \"content\": \" float z;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 50,\n \"score\": 94866.38035264192\n },\n {\n \"content\": \" float x;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 51,\n \"score\": 94839.38995832019\n },\n {\n \"content\": \" FLOAT x, y, z, w;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3dx9math.h\",\n \"rank\": 52,\n \"score\": 94839.38995832019\n },\n {\n \"content\": \" BOOL InVBlank;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 53,\n \"score\": 92047.17966822787\n },\n {\n \"content\": \" float MinZ; /* Min/max of clip Volume */\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 54,\n \"score\": 92047.17966822787\n },\n {\n \"content\": \" float MaxZ;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 55,\n \"score\": 92047.17966822787\n },\n {\n \"content\": \" INT RowPitch;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 56,\n \"score\": 92042.24603559567\n },\n {\n \"content\": \" INT SlicePitch;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 57,\n \"score\": 92042.24603559567\n },\n {\n \"content\": \" BYTE PitchAndFamily;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3dx9core.h\",\n \"rank\": 58,\n \"score\": 92042.24603559567\n },\n {\n \"content\": \" int returned;\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/ogg/ogg.h\",\n \"rank\": 59,\n \"score\": 92039.80602564912\n },\n {\n \"content\": \" HRESULT ReturnCode;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9types.h\",\n \"rank\": 60,\n \"score\": 92039.80602564912\n },\n {\n \"content\": \" long lW;\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/vorbis/codec.h\",\n \"rank\": 61,\n \"score\": 92034.94578475777\n },\n {\n \"content\": \" long nW;\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/vorbis/codec.h\",\n \"rank\": 62,\n \"score\": 92034.94578475777\n },\n {\n \"content\": \" DWORD DefaultValue; // offset of default value\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3dx9shader.h\",\n \"rank\": 63,\n \"score\": 92003.42358913997\n },\n {\n \"content\": \" DWORD ZCmpCaps;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9caps.h\",\n \"rank\": 64,\n \"score\": 89163.33954488905\n },\n {\n \"content\": \" int pcm_returned;\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/vorbis/codec.h\",\n \"rank\": 65,\n \"score\": 89156.19691869125\n },\n {\n \"content\": \" long body_returned; /* elements of fill returned */\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/ogg/ogg.h\",\n \"rank\": 66,\n \"score\": 89156.19691869125\n },\n {\n \"content\": \" long lacing_returned;\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/ogg/ogg.h\",\n \"rank\": 67,\n \"score\": 89156.19691869125\n },\n {\n \"content\": \" long centerW;\\n\",\n \"file_path\": \"Engine/thirdparty/libvorbis/include/vorbis/codec.h\",\n \"rank\": 68,\n \"score\": 89151.48894925181\n },\n {\n \"content\": \" float MaxVertexW;\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9caps.h\",\n \"rank\": 69,\n \"score\": 89151.48894925181\n },\n {\n \"content\": \" DWORD MaxVertexShaderConst; // number of vertex shader constant registers\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9caps.h\",\n \"rank\": 70,\n \"score\": 86450.07768551432\n },\n {\n \"content\": \" float PixelShader1xMaxValue; // max value storable in registers of ps.1.x shaders\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9caps.h\",\n \"rank\": 71,\n \"score\": 86413.61395655731\n },\n {\n \"content\": \" DWORD MaxVShaderInstructionsExecuted; // maximum number of vertex shader instructions that can be executed\\n\",\n \"file_path\": \"Engine/thirdparty/directx/include/d3d9caps.h\",\n \"rank\": 72,\n \"score\": 83905.79858773535\n },\n {\n \"content\": \"#include \\\"math/CotVec4.h\\\"\\n\\n#include \\\"math/CotVec2.h\\\"\\n\\n#include \\\"math/CotVec3.h\\\"\\n\\n#include <cmath>\\n\\n\\n\\nnamespace Cot \\n\\n{\\n\\n\\tVec4::Vec4()\\n\\n\\t\\t: x(0.0f), y(0.0f), z(0.0f), w(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const float value)\\n\\n\\t\\t: x(value), y(value), z(value), w(value)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const float xx, const float yy)\\n\\n\\t\\t: x(xx), y(yy), z(0.0f), w(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const Vec2& other)\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 75,\n \"score\": 81116.78464237148\n },\n {\n \"content\": \"\\t\\t: x(other.x), y(other.y), z(0.0f), w(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const float xx, const float yy, const float zz)\\n\\n\\t\\t: x(xx), y(yy), z(zz), w(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const Vec3& other)\\n\\n\\t\\t: x(other.x), y(other.y), z(other.z), w(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const float xx, const float yy, const float zz, const float ww)\\n\\n\\t\\t: x(xx), y(yy), z(zz), w(ww)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const float* array)\\n\\n\\t\\t: x(array[0]), y(array[1]), z(array[2]), w(array[3])\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec4::Vec4(const Vec4& other)\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 76,\n \"score\": 81116.48291866129\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\n\\n\\t\\tfloat zz = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tzz = z / value;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat ww = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tww = w / value;\\n\\n\\t\\t}\\n\\n\\t\\treturn Vec4(xx, yy, zz, ww);\\n\\n\\t}\\n\\n\\n\\n\\tVec4& Vec4::operator+=(const Vec4& other)\\n\\n\\t{\\n\\n\\t\\tx += other.x;\\n\\n\\t\\ty += other.y;\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 77,\n \"score\": 81111.42472927677\n },\n {\n \"content\": \"\\t\\tif (other.z > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tzz = z / other.z;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat ww = 0.0f;\\n\\n\\t\\tif (other.w > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tww = w / other.w;\\n\\n\\t\\t}\\n\\n\\t\\treturn Vec4(xx, yy, zz, ww);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec4 Vec4::operator+(const float value) const\\n\\n\\t{\\n\\n\\t\\treturn Vec4(x + value, y + value, z + value, w + value);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec4 Vec4::operator-(const float value) const\\n\\n\\t{\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 78,\n \"score\": 81110.59266907649\n },\n {\n \"content\": \"#include \\\"math/CotVec3.h\\\"\\n\\n#include \\\"math/CotVec2.h\\\"\\n\\n#include \\\"math/CotMat4.h\\\"\\n\\n\\n\\nnamespace Cot \\n\\n{\\n\\n\\tVec3::Vec3()\\n\\n\\t\\t: x(0.0f), y(0.0f), z(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec3::Vec3(const float value)\\n\\n\\t\\t: x(value), y(value), z(value)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec3::Vec3(const float xx, const float yy)\\n\\n\\t\\t: x(xx), y(yy), z(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec3::Vec3(const Vec2& other)\\n\\n\\t\\t: x(other.x), y(other.y), z(0.0f)\\n\",\n \"file_path\": \"Engine/src/CotVec3.cpp\",\n \"rank\": 79,\n \"score\": 81107.7659355377\n },\n {\n \"content\": \"\\t\\treturn *this;\\n\\n\\t}\\n\\n\\n\\n\\tVec4& Vec4::operator/=(const Vec4& other)\\n\\n\\t{\\n\\n\\t\\tfloat xx = 0.0f;\\n\\n\\t\\tif (other.x > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\txx = x / other.x;\\n\\n\\t\\t}\\n\\n\\t\\tx = xx;\\n\\n\\n\\n\\t\\tfloat yy = 0.0f;\\n\\n\\t\\tif (other.y > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tyy = y / other.y;\\n\\n\\t\\t}\\n\\n\\t\\ty = yy;\\n\\n\\n\\n\\t\\tfloat zz = 0.0f;\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 84,\n \"score\": 81103.82075853318\n },\n {\n \"content\": \"\\t\\treturn Vec4(x - value, y - value, z - value, w - value);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec4 Vec4::operator*(const float value) const\\n\\n\\t{\\n\\n\\t\\treturn Vec4(x * value, y * value, z * value, w * value);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec4 Vec4::operator/(const float value) const\\n\\n\\t{\\n\\n\\t\\tfloat xx = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\txx = x / value;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat yy = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tyy = y / value;\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 87,\n \"score\": 81103.11334090677\n },\n {\n \"content\": \"#include \\\"math/CotVec2.h\\\"\\n\\n#include <cmath>\\n\\n\\n\\nnamespace Cot \\n\\n{\\n\\n\\tVec2::Vec2()\\n\\n\\t\\t: x(0.0f), y(0.0f)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec2::Vec2(const float value)\\n\\n\\t\\t: x(value), y(value)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec2::Vec2(const float xx, const float yy)\\n\\n\\t\\t: x(xx), y(yy)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec2::Vec2(const float* array)\\n\\n\\t\\t: x(array[0]), y(array[1])\\n\\n\\t{\\t}\\n\",\n \"file_path\": \"Engine/src/CotVec2.cpp\",\n \"rank\": 88,\n \"score\": 35.03750153382204\n },\n {\n \"content\": \"\\t\\t{\\n\\n\\t\\t\\txx = x / other.x;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat yy = 0.0f;\\n\\n\\t\\tif (other.y > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tyy = y / other.y;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat zz = 0.0f;\\n\\n\\t\\tif (other.z > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tzz = z / other.z;\\n\\n\\t\\t}\\n\\n\\t\\treturn Vec3(xx, yy, zz);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec3 Vec3::operator+(const float value) const\\n\\n\\t{\\n\",\n \"file_path\": \"Engine/src/CotVec3.cpp\",\n \"rank\": 89,\n \"score\": 30.876344442040335\n },\n {\n \"content\": \"\\n\\n\\t\\tfloat yy = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tyy = y / value;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat zz = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tzz = z / value;\\n\\n\\t\\t}\\n\\n\\t\\treturn Vec3(xx, yy, zz);\\n\\n\\t}\\n\\n\\n\\n\\tVec3& Vec3::operator+=(const Vec3& other)\\n\\n\\t{\\n\\n\\t\\tx += other.x;\\n\\n\\t\\ty += other.y;\\n\\n\\t\\tz += other.z;\\n\",\n \"file_path\": \"Engine/src/CotVec3.cpp\",\n \"rank\": 90,\n \"score\": 30.819872987667978\n },\n {\n \"content\": \"\\t{\\t}\\n\\n\\n\\n\\tVec3::Vec3(const float xx, const float yy, const float zz)\\n\\n\\t\\t: x(xx), y(yy), z(zz)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec3::Vec3(const float* array)\\n\\n\\t\\t: x(array[0]), y(array[1]), z(array[2])\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec3::Vec3(const Vec3& other)\\n\\n\\t\\t: x(other.x), y(other.y), z(other.z)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec3::Vec3(const Vec3&& other)\\n\\n\\t\\t: x(other.x), y(other.y), z(other.z)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tVec3::~Vec3()\\n\\n\\t{\\t}\\n\",\n \"file_path\": \"Engine/src/CotVec3.cpp\",\n \"rank\": 91,\n \"score\": 30.81178252318434\n },\n {\n \"content\": \"#include \\\"math/CotMat4.h\\\"\\n\\n#include \\\"math/CotGeometry.h\\\"\\n\\n#include \\\"math/CotVec3.h\\\"\\n\\n#include \\\"math/CotVec4.h\\\"\\n\\n#include \\\"math/CotQuaternion.h\\\"\\n\\n#include \\\"math/CotMathFunc.h\\\"\\n\\n#include <cmath>\\n\\n\\n\\nnamespace Cot \\n\\n{\\n\\n\\tMat4::Mat4()\\n\\n\\t\\t: _11(1.0f), _12(0.0f), _13(0.0f), _14(0.0f)\\n\\n\\t\\t, _21(0.0f), _22(1.0f), _23(0.0f), _24(0.0f)\\n\\n\\t\\t, _31(0.0f), _32(0.0f), _33(1.0f), _34(0.0f)\\n\\n\\t\\t, _41(0.0f), _42(0.0f), _43(0.0f), _44(1.0f)\\n\\n\\t{ }\\n\\n\\n\\n\\tMat4::Mat4\\n\\n\\t(\\n\\n\\t\\tconst float m11, const float m12, const float m13, const float m14,\\n\",\n \"file_path\": \"Engine/src/CotMat4.cpp\",\n \"rank\": 92,\n \"score\": 26.849276852293322\n },\n {\n \"content\": \"\\tconst Vec4 Vec4::operator*(const Vec4& other) const\\n\\n\\t{\\n\\n\\t\\treturn Vec4(x * other.x, y * other.y, z * other.z, w * other.w);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec4 Vec4::operator/(const Vec4& other) const\\n\\n\\t{\\n\\n\\t\\tfloat xx = 0.0f;\\n\\n\\t\\tif (other.x > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\txx = x / other.x;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat yy = 0.0f;\\n\\n\\t\\tif (other.y > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tyy = y / other.y;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat zz = 0.0f;\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 93,\n \"score\": 25.508493294490883\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tfloat deltaX = (other.x - x);\\n\\n\\t\\tfloat deltaY = (other.y - y);\\n\\n\\t\\tfloat deltaZ = (other.z - z);\\n\\n\\t\\tfloat deltaW = (other.w - w);\\n\\n\\t\\treturn sqrt(deltaX * deltaX + deltaY * deltaY + deltaZ * deltaZ + deltaW * deltaW);\\n\\n\\t}\\n\\n\\n\\n\\tfloat Vec4::Distance(const Vec4& other1, const Vec4& other2)\\n\\n\\t{\\n\\n\\t\\tfloat deltaX = (other1.x - other2.x);\\n\\n\\t\\tfloat deltaY = (other1.y - other2.y);\\n\\n\\t\\tfloat deltaZ = (other1.z - other2.z);\\n\\n\\t\\tfloat deltaW = (other1.w - other2.w);\\n\\n\\t\\treturn sqrt(deltaX * deltaX + deltaY * deltaY + deltaZ * deltaZ + deltaW * deltaW);\\n\\n\\t}\\n\\n\\n\\n\\tfloat Vec4::Dot(const Vec4& other) const\\n\\n\\t{\\n\\n\\t\\treturn x * other.x + y * other.y + z * other.z + w * other.w;\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 94,\n \"score\": 24.365866709693567\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tfloat xx = 0.0f;\\n\\n\\t\\tif (other.x > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\txx = x / other.x;\\n\\n\\t\\t}\\n\\n\\t\\tx = xx;\\n\\n\\n\\n\\t\\tfloat yy = 0.0f;\\n\\n\\t\\tif (other.y > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tyy = y / other.y;\\n\\n\\t\\t}\\n\\n\\t\\ty = yy;\\n\\n\\n\\n\\t\\tfloat zz = 0.0f;\\n\\n\\t\\tif (other.z > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tzz = z / other.z;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Engine/src/CotVec3.cpp\",\n \"rank\": 95,\n \"score\": 22.745228921358937\n },\n {\n \"content\": \"\\t\\tvoid ResetTransform();\\n\\n\\n\\n\\t\\tvoid SetPosition(const Vec3& position);\\n\\n\\t\\tvoid SetPositionX(float x);\\n\\n\\t\\tvoid SetPositionY(float y);\\n\\n\\t\\tvoid SetPositionZ(float z);\\n\\n\\t\\tVec3 GetPosition();\\n\\n\\n\\n\\t\\tvoid SetRotateAxis(float deg, const Vec3& axis);\\n\\n\\t\\tVec3 GetRotate();\\n\\n\\n\\n\\t\\tvoid SetScale(const Vec3& scale);\\n\\n\\t\\tvoid SetScaleX(float x);\\n\\n\\t\\tvoid SetScaleY(float y);\\n\\n\\t\\tvoid SetScaleZ(float z);\\n\\n\\t\\tVec3 GetScale();\\n\\n\\n\\n\\t\\tvoid SetLocalPosition(const Vec3& position);\\n\\n\\t\\tvoid SetLocalPositionX(float x);\\n\\n\\t\\tvoid SetLocalPositionY(float y);\\n\",\n \"file_path\": \"Engine/include/base/CotEntity.h\",\n \"rank\": 96,\n \"score\": 22.411138635926463\n },\n {\n \"content\": \"\\t\\treturn Vec3(x + value, y + value, z + value);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec3 Vec3::operator-(const float value) const\\n\\n\\t{\\n\\n\\t\\treturn Vec3(x - value, y - value, z - value);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec3 Vec3::operator*(const float value) const\\n\\n\\t{\\n\\n\\t\\treturn Vec3(x * value, y * value, z * value);\\n\\n\\t}\\n\\n\\n\\n\\tconst Vec3 Vec3::operator/(const float value) const\\n\\n\\t{\\n\\n\\t\\tfloat xx = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\txx = x / value;\\n\\n\\t\\t}\\n\",\n \"file_path\": \"Engine/src/CotVec3.cpp\",\n \"rank\": 97,\n \"score\": 21.74218556883645\n },\n {\n \"content\": \"\\t\\tfloat xx = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\txx = x / value;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tfloat yy = 0.0f;\\n\\n\\t\\tif (value > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tyy = y / value;\\n\\n\\t\\t}\\n\\n\\t\\treturn Vec2(xx, yy);\\n\\n\\t}\\n\\n\\n\\n\\tVec2& Vec2::operator+=(const Vec2& other)\\n\\n\\t{\\n\\n\\t\\tx += other.x;\\n\\n\\t\\ty += other.y;\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\",\n \"file_path\": \"Engine/src/CotVec2.cpp\",\n \"rank\": 98,\n \"score\": 21.477735247423215\n },\n {\n \"content\": \"\\t\\tif (other.z > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tzz = z / other.z;\\n\\n\\t\\t}\\n\\n\\t\\tz = zz;\\n\\n\\n\\n\\t\\tfloat ww = 0.0f;\\n\\n\\t\\tif (other.w > 0.0f)\\n\\n\\t\\t{\\n\\n\\t\\t\\tww = w / other.w;\\n\\n\\t\\t}\\n\\n\\t\\tw = ww;\\n\\n\\n\\n\\t\\treturn *this;\\n\\n\\t}\\n\\n\\n\\n\\tVec4& Vec4::operator=(const Vec4& other)\\n\\n\\t{\\n\\n\\t\\tx = other.x;\\n\\n\\t\\ty = other.y;\\n\",\n \"file_path\": \"Engine/src/CotVec4.cpp\",\n \"rank\": 99,\n \"score\": 21.477018882151537\n }\n]","isConversational":false}}},{"rowIdx":283,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"trunk/third_party/webrtc/modules/rtp_rtcp/test/testAPI/test_api_audio.cc"},"repo_name":{"kind":"string","value":"goddino/libjingle"},"commit":{"kind":"string","value":"9516bee51c73af4c3082e74b88ed1198a0eb2bb1"},"file_code":{"kind":"string","value":"\n\n#include <algorithm>\n#include <vector>\n#include \"testing/gtest/include/gtest/gtest.h\"\n\n#include \"webrtc/modules/rtp_rtcp/test/testAPI/test_api.h\"\n\n#include \"webrtc/common_types.h\"\n#include \"webrtc/modules/rtp_rtcp/interface/rtp_rtcp.h\"\n#include \"webrtc/modules/rtp_rtcp/interface/rtp_rtcp_defines.h\"\n\nusing namespace webrtc;\n\n#define test_rate 64000u\n\nclass VerifyingAudioReceiver : public RtpData {\n public:\n virtual int32_t OnReceivedPayloadData(\n const uint8_t* payloadData,\n const uint16_t payloadSize,\n const webrtc::WebRtcRTPHeader* rtpHeader) {\n if (rtpHeader->header.payloadType == 98 ||\n rtpHeader->header.payloadType == 99) {\n EXPECT_EQ(4, payloadSize);\n char str[5];\n memcpy(str, payloadData, payloadSize);\n str[4] = 0;\n \n \n \n \n EXPECT_STRCASEEQ(\"test\", str);\n return 0;\n }\n if (rtpHeader->header.payloadType == 100 ||\n rtpHeader->header.payloadType == 101 ||\n rtpHeader->header.payloadType == 102) {\n if (rtpHeader->type.Audio.channel == 1) {\n if (payloadData[0] == 0xff) {\n \n \n return 0;\n }\n }\n ADD_FAILURE() << \"This code path should never happen.\";\n return -1;\n }\n return 0;\n }\n};\n\nclass RTPCallback : public RtpFeedback {\n public:\n virtual int32_t OnInitializeDecoder(\n const int32_t id,\n const int8_t payloadType,\n const char payloadName[RTP_PAYLOAD_NAME_SIZE],\n const int frequency,\n const uint8_t channels,\n const uint32_t rate) {\n if (payloadType == 96) {\n EXPECT_EQ(test_rate, rate) <<\n \"The rate should be 64K for this payloadType\";\n }\n return 0;\n }\n virtual void OnPacketTimeout(const int32_t id) {\n }\n virtual void OnReceivedPacket(const int32_t id,\n const RtpRtcpPacketType packetType) {\n }\n virtual void OnPeriodicDeadOrAlive(const int32_t id,\n const RTPAliveType alive) {\n }\n virtual void OnIncomingSSRCChanged(const int32_t id,\n const uint32_t SSRC) {\n }\n virtual void OnIncomingCSRCChanged(const int32_t id,\n const uint32_t CSRC,\n const bool added) {\n }\n};\n\nclass AudioFeedback : public RtpAudioFeedback {\n virtual void OnReceivedTelephoneEvent(const int32_t id,\n const uint8_t event,\n const bool end) {\n static uint8_t expectedEvent = 0;\n\n if (end) {\n uint8_t oldEvent = expectedEvent-1;\n if (expectedEvent == 32) {\n oldEvent = 15;\n }\n EXPECT_EQ(oldEvent, event);\n } else {\n EXPECT_EQ(expectedEvent, event);\n expectedEvent++;\n }\n if (expectedEvent == 16) {\n expectedEvent = 32;\n }\n }\n virtual void OnPlayTelephoneEvent(const int32_t id,\n const uint8_t event,\n const uint16_t lengthMs,\n const uint8_t volume) {\n };\n};\n\nclass RtpRtcpAudioTest : public ::testing::Test {\n protected:\n RtpRtcpAudioTest() : fake_clock(123456) {\n test_CSRC[0] = 1234;\n test_CSRC[2] = 2345;\n test_id = 123;\n test_ssrc = 3456;\n test_timestamp = 4567;\n test_sequence_number = 2345;\n }\n ~RtpRtcpAudioTest() {}\n\n virtual void SetUp() {\n audioFeedback = new AudioFeedback();\n data_receiver1 = new VerifyingAudioReceiver();\n data_receiver2 = new VerifyingAudioReceiver();\n rtp_callback = new RTPCallback();\n transport1 = new LoopBackTransport();\n transport2 = new LoopBackTransport();\n\n RtpRtcp::Configuration configuration;\n configuration.id = test_id;\n configuration.audio = true;\n configuration.clock = &fake_clock;\n configuration.incoming_data = data_receiver1;\n configuration.outgoing_transport = transport1;\n configuration.audio_messages = audioFeedback;\n\n module1 = RtpRtcp::CreateRtpRtcp(configuration);\n\n configuration.id = test_id + 1;\n configuration.incoming_data = data_receiver2;\n configuration.incoming_messages = rtp_callback;\n configuration.outgoing_transport = transport2;\n configuration.audio_messages = audioFeedback;\n\n module2 = RtpRtcp::CreateRtpRtcp(configuration);\n\n transport1->SetSendModule(module2);\n transport2->SetSendModule(module1);\n }\n\n virtual void TearDown() {\n delete module1;\n delete module2;\n delete transport1;\n delete transport2;\n delete audioFeedback;\n delete data_receiver1;\n delete data_receiver2;\n delete rtp_callback;\n }\n\n int test_id;\n RtpRtcp* module1;\n RtpRtcp* module2;\n VerifyingAudioReceiver* data_receiver1;\n VerifyingAudioReceiver* data_receiver2;\n LoopBackTransport* transport1;\n LoopBackTransport* transport2;\n AudioFeedback* audioFeedback;\n RTPCallback* rtp_callback;\n uint32_t test_ssrc;\n uint32_t test_timestamp;\n uint16_t test_sequence_number;\n uint32_t test_CSRC[webrtc::kRtpCsrcSize];\n SimulatedClock fake_clock;\n};\n\nTEST_F(RtpRtcpAudioTest, Basic) {\n EXPECT_EQ(0, module1->SetSSRC(test_ssrc));\n EXPECT_EQ(0, module1->SetStartTimestamp(test_timestamp));\n\n \n EXPECT_EQ(0, module2->SetTelephoneEventForwardToDecoder(true));\n\n EXPECT_EQ(0, module1->SetSendingStatus(true));\n\n \n\n \n \n EXPECT_EQ(-1, module1->SendOutgoingData(webrtc::kAudioFrameSpeech,\n 96, 0, -1, NULL, 0));\n\n CodecInst voiceCodec;\n voiceCodec.pltype = 96;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"PCMU\", 5);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterSendPayload(voiceCodec));\n voiceCodec.rate = test_rate;\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n printf(\"4\\n\");\n\n const uint8_t test[5] = \"test\";\n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech, 96,\n 0, -1, test, 4));\n\n EXPECT_EQ(test_ssrc, module2->RemoteSSRC());\n EXPECT_EQ(test_timestamp, module2->RemoteTimestamp());\n}\n\nTEST_F(RtpRtcpAudioTest, RED) {\n CodecInst voiceCodec;\n voiceCodec.pltype = 96;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"PCMU\", 5);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterSendPayload(voiceCodec));\n voiceCodec.rate = test_rate;\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n EXPECT_EQ(0, module1->SetSSRC(test_ssrc));\n EXPECT_EQ(0, module1->SetStartTimestamp(test_timestamp));\n EXPECT_EQ(0, module1->SetSendingStatus(true));\n\n voiceCodec.pltype = 127;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"RED\", 4);\n\n EXPECT_EQ(0, module1->SetSendREDPayloadType(voiceCodec.pltype));\n int8_t red = 0;\n EXPECT_EQ(0, module1->SendREDPayloadType(red));\n EXPECT_EQ(voiceCodec.pltype, red);\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n RTPFragmentationHeader fragmentation;\n fragmentation.fragmentationVectorSize = 2;\n fragmentation.fragmentationLength = new uint32_t[2];\n fragmentation.fragmentationLength[0] = 4;\n fragmentation.fragmentationLength[1] = 4;\n fragmentation.fragmentationOffset = new uint32_t[2];\n fragmentation.fragmentationOffset[0] = 0;\n fragmentation.fragmentationOffset[1] = 4;\n fragmentation.fragmentationTimeDiff = new uint16_t[2];\n fragmentation.fragmentationTimeDiff[0] = 0;\n fragmentation.fragmentationTimeDiff[1] = 0;\n fragmentation.fragmentationPlType = new uint8_t[2];\n fragmentation.fragmentationPlType[0] = 96;\n fragmentation.fragmentationPlType[1] = 96;\n\n const uint8_t test[5] = \"test\";\n \n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech,\n 96, 160, -1, test, 4,\n &fragmentation));\n\n EXPECT_EQ(0, module1->SetSendREDPayloadType(-1));\n EXPECT_EQ(-1, module1->SendREDPayloadType(red));\n}\n\nTEST_F(RtpRtcpAudioTest, DTMF) {\n CodecInst voiceCodec;\n voiceCodec.pltype = 96;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"PCMU\", 5);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterSendPayload(voiceCodec));\n voiceCodec.rate = test_rate;\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n EXPECT_EQ(0, module1->SetSSRC(test_ssrc));\n EXPECT_EQ(0, module1->SetStartTimestamp(test_timestamp));\n EXPECT_EQ(0, module1->SetSendingStatus(true));\n\n \n voiceCodec.pltype = 97;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"telephone-event\", 16);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n \n uint32_t timeStamp = 160;\n\n \n for (int i = 0; i < 16; i++) {\n EXPECT_EQ(0, module1->SendTelephoneEventOutband(i, timeStamp, 10));\n }\n timeStamp += 160; \n\n const uint8_t test[9] = \"test\";\n\n \n \n for (;timeStamp <= 250 * 160; timeStamp += 160) {\n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech, 96,\n timeStamp, -1, test, 4));\n fake_clock.AdvanceTimeMilliseconds(20);\n module1->Process();\n }\n EXPECT_EQ(0, module1->SendTelephoneEventOutband(32, 9000, 10));\n\n for (;timeStamp <= 740 * 160; timeStamp += 160) {\n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech, 96,\n timeStamp, -1, test, 4));\n fake_clock.AdvanceTimeMilliseconds(20);\n module1->Process();\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <algorithm>\n#include <vector>\n#include \"testing/gtest/include/gtest/gtest.h\"\n\n#include \"webrtc/modules/rtp_rtcp/test/testAPI/test_api.h\"\n\n#include \"webrtc/common_types.h\"\n#include \"webrtc/modules/rtp_rtcp/interface/rtp_rtcp.h\"\n#include \"webrtc/modules/rtp_rtcp/interface/rtp_rtcp_defines.h\"\n\nusing namespace webrtc;\n\n#define test_rate 64000u\n\nclass VerifyingAudioReceiver : public RtpData {\n public:\n virtual int32_t OnReceivedPayloadData(\n const uint8_t* payloadData,\n const uint16_t payloadSize,\n const webrtc::WebRtcRTPHeader* rtpHeader) {\n if (rtpHeader->header.payloadType == 98 ||\n rtpHeader->header.payloadType == 99) {\n EXPECT_EQ(4, payloadSize);\n char str[5];\n memcpy(str, payloadData, payloadSize);\n str[4] = 0;\n \n \n \n \n EXPECT_STRCASEEQ(\"test\", str);\n return 0;\n }\n if (rtpHeader->header.payloadType == 100 ||\n rtpHeader->header.payloadType == 101 ||\n rtpHeader->header.payloadType == 102) {\n if (rtpHeader->type.Audio.channel == 1) {\n if (payloadData[0] == 0xff) {\n \n \n return 0;\n }\n }\n ADD_FAILURE() << \"This code path should never happen.\";\n return -1;\n }\n return 0;\n }\n};\n\nclass RTPCallback : public RtpFeedback {\n public:\n virtual int32_t OnInitializeDecoder(\n const int32_t id,\n const int8_t payloadType,\n const char payloadName[RTP_PAYLOAD_NAME_SIZE],\n const int frequency,\n const uint8_t channels,\n const uint32_t rate) {\n if (payloadType == 96) {\n EXPECT_EQ(test_rate, rate) <<\n \"The rate should be 64K for this payloadType\";\n }\n return 0;\n }\n virtual void OnPacketTimeout(const int32_t id) {\n }\n virtual void OnReceivedPacket(const int32_t id,\n const RtpRtcpPacketType packetType) {\n }\n virtual void OnPeriodicDeadOrAlive(const int32_t id,\n const RTPAliveType alive) {\n }\n virtual void OnIncomingSSRCChanged(const int32_t id,\n const uint32_t SSRC) {\n }\n virtual void OnIncomingCSRCChanged(const int32_t id,\n const uint32_t CSRC,\n const bool added) {\n }\n};\n\nclass AudioFeedback : public RtpAudioFeedback {\n virtual void OnReceivedTelephoneEvent(const int32_t id,\n const uint8_t event,\n const bool end) {\n static uint8_t expectedEvent = 0;\n\n if (end) {\n uint8_t oldEvent = expectedEvent-1;\n if (expectedEvent == 32) {\n oldEvent = 15;\n }\n EXPECT_EQ(oldEvent, event);\n } else {\n EXPECT_EQ(expectedEvent, event);\n expectedEvent++;\n }\n if (expectedEvent == 16) {\n expectedEvent = 32;\n }\n }\n virtual void OnPlayTelephoneEvent(const int32_t id,\n const uint8_t event,\n const uint16_t lengthMs,\n const uint8_t volume) {\n };\n};\n\nclass RtpRtcpAudioTest : public ::testing::Test {\n protected:\n RtpRtcpAudioTest() : fake_clock(123456) {\n test_CSRC[0] = 1234;\n test_CSRC[2] = 2345;\n test_id = 123;\n test_ssrc = 3456;\n test_timestamp = 4567;\n test_sequence_number = 2345;\n }\n ~RtpRtcpAudioTest() {}\n\n virtual void SetUp() {\n audioFeedback = new AudioFeedback();\n data_receiver1 = new VerifyingAudioReceiver();\n data_receiver2 = new VerifyingAudioReceiver();\n rtp_callback = new RTPCallback();\n transport1 = new LoopBackTransport();\n transport2 = new LoopBackTransport();\n\n RtpRtcp::Configuration configuration;\n configuration.id = test_id;\n configuration.audio = true;\n configuration.clock = &fake_clock;\n configuration.incoming_data = data_receiver1;\n configuration.outgoing_transport = transport1;\n configuration.audio_messages = audioFeedback;\n\n module1 = RtpRtcp::CreateRtpRtcp(configuration);\n\n configuration.id = test_id + 1;\n configuration.incoming_data = data_receiver2;\n configuration.incoming_messages = rtp_callback;\n configuration.outgoing_transport = transport2;\n configuration.audio_messages = audioFeedback;\n\n module2 = RtpRtcp::CreateRtpRtcp(configuration);\n\n transport1->SetSendModule(module2);\n transport2->SetSendModule(module1);\n }\n\n virtual void TearDown() {\n delete module1;\n delete module2;\n delete transport1;\n delete transport2;\n delete audioFeedback;\n delete data_receiver1;\n delete data_receiver2;\n delete rtp_callback;\n }\n\n int test_id;\n RtpRtcp* module1;\n RtpRtcp* module2;\n VerifyingAudioReceiver* data_receiver1;\n VerifyingAudioReceiver* data_receiver2;\n LoopBackTransport* transport1;\n LoopBackTransport* transport2;\n AudioFeedback* audioFeedback;\n RTPCallback* rtp_callback;\n uint32_t test_ssrc;\n uint32_t test_timestamp;\n uint16_t test_sequence_number;\n uint32_t test_CSRC[webrtc::kRtpCsrcSize];\n SimulatedClock fake_clock;\n};\n\nTEST_F(RtpRtcpAudioTest, Basic) {\n EXPECT_EQ(0, module1->SetSSRC(test_ssrc));\n EXPECT_EQ(0, module1->SetStartTimestamp(test_timestamp));\n\n \n EXPECT_EQ(0, module2->SetTelephoneEventForwardToDecoder(true));\n\n EXPECT_EQ(0, module1->SetSendingStatus(true));\n\n \n\n \n \n EXPECT_EQ(-1, module1->SendOutgoingData(webrtc::kAudioFrameSpeech,\n 96, 0, -1, NULL, 0));\n\n CodecInst voiceCodec;\n voiceCodec.pltype = 96;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"PCMU\", 5);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterSendPayload(voiceCodec));\n voiceCodec.rate = test_rate;\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n printf(\"4\\n\");\n\n const uint8_t test[5] = \"test\";\n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech, 96,\n 0, -1, test, 4));\n\n EXPECT_EQ(test_ssrc, module2->RemoteSSRC());\n EXPECT_EQ(test_timestamp, module2->RemoteTimestamp());\n}\n\nTEST_F(RtpRtcpAudioTest, RED) {\n CodecInst voiceCodec;\n voiceCodec.pltype = 96;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"PCMU\", 5);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterSendPayload(voiceCodec));\n voiceCodec.rate = test_rate;\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n EXPECT_EQ(0, module1->SetSSRC(test_ssrc"},"suffix":{"kind":"string","value":"160; timeStamp += 160) {\n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech, 96,\n timeStamp, -1, test, 4));\n fake_clock.AdvanceTimeMilliseconds(20);\n module1->Process();\n }\n}\n"},"middle":{"kind":"string","value":"));\n EXPECT_EQ(0, module1->SetStartTimestamp(test_timestamp));\n EXPECT_EQ(0, module1->SetSendingStatus(true));\n\n voiceCodec.pltype = 127;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"RED\", 4);\n\n EXPECT_EQ(0, module1->SetSendREDPayloadType(voiceCodec.pltype));\n int8_t red = 0;\n EXPECT_EQ(0, module1->SendREDPayloadType(red));\n EXPECT_EQ(voiceCodec.pltype, red);\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n RTPFragmentationHeader fragmentation;\n fragmentation.fragmentationVectorSize = 2;\n fragmentation.fragmentationLength = new uint32_t[2];\n fragmentation.fragmentationLength[0] = 4;\n fragmentation.fragmentationLength[1] = 4;\n fragmentation.fragmentationOffset = new uint32_t[2];\n fragmentation.fragmentationOffset[0] = 0;\n fragmentation.fragmentationOffset[1] = 4;\n fragmentation.fragmentationTimeDiff = new uint16_t[2];\n fragmentation.fragmentationTimeDiff[0] = 0;\n fragmentation.fragmentationTimeDiff[1] = 0;\n fragmentation.fragmentationPlType = new uint8_t[2];\n fragmentation.fragmentationPlType[0] = 96;\n fragmentation.fragmentationPlType[1] = 96;\n\n const uint8_t test[5] = \"test\";\n \n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech,\n 96, 160, -1, test, 4,\n &fragmentation));\n\n EXPECT_EQ(0, module1->SetSendREDPayloadType(-1));\n EXPECT_EQ(-1, module1->SendREDPayloadType(red));\n}\n\nTEST_F(RtpRtcpAudioTest, DTMF) {\n CodecInst voiceCodec;\n voiceCodec.pltype = 96;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"PCMU\", 5);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module1->RegisterReceivePayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterSendPayload(voiceCodec));\n voiceCodec.rate = test_rate;\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n EXPECT_EQ(0, module1->SetSSRC(test_ssrc));\n EXPECT_EQ(0, module1->SetStartTimestamp(test_timestamp));\n EXPECT_EQ(0, module1->SetSendingStatus(true));\n\n \n voiceCodec.pltype = 97;\n voiceCodec.plfreq = 8000;\n memcpy(voiceCodec.plname, \"telephone-event\", 16);\n\n EXPECT_EQ(0, module1->RegisterSendPayload(voiceCodec));\n EXPECT_EQ(0, module2->RegisterReceivePayload(voiceCodec));\n\n \n uint32_t timeStamp = 160;\n\n \n for (int i = 0; i < 16; i++) {\n EXPECT_EQ(0, module1->SendTelephoneEventOutband(i, timeStamp, 10));\n }\n timeStamp += 160; \n\n const uint8_t test[9] = \"test\";\n\n \n \n for (;timeStamp <= 250 * 160; timeStamp += 160) {\n EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech, 96,\n timeStamp, -1, test, 4));\n fake_clock.AdvanceTimeMilliseconds(20);\n module1->Process();\n }\n EXPECT_EQ(0, module1->SendTelephoneEventOutband(32, 9000, 10));\n\n for (;timeStamp <= 740 * "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":284,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"lib/fiber/element_pair_topology.hpp"},"repo_name":{"kind":"string","value":"nicolas-chaulet/bempp"},"commit":{"kind":"string","value":"0f5cc72e0e542437e787db5704978456b0ad9e35"},"file_code":{"kind":"string","value":"\n\n#ifndef fiber_element_pair_topology_hpp\n#define fiber_element_pair_topology_hpp\n\n#include \"../common/common.hpp\"\n\n#include \"../common/armadillo_fwd.hpp\"\n#include <cassert>\n#include <iostream>\n#include <boost/tuple/tuple_comparison.hpp>\n\nnamespace Fiber\n{\n\nstruct ElementPairTopology\n{\n ElementPairTopology() :\n type(Disjoint),\n testVertexCount(0), trialVertexCount(0),\n testSharedVertex0(-1), testSharedVertex1(-1),\n trialSharedVertex0(-1), trialSharedVertex1(-1)\n {}\n\n enum Type { Disjoint, SharedVertex, SharedEdge, Coincident };\n Type type;\n unsigned char testVertexCount;\n unsigned char trialVertexCount;\n signed char testSharedVertex0;\n signed char testSharedVertex1;\n signed char trialSharedVertex0;\n signed char trialSharedVertex1;\n\n bool operator<(const ElementPairTopology& other) const {\n using boost::tuples::make_tuple;\n return make_tuple(type, testVertexCount, trialVertexCount,\n testSharedVertex0, testSharedVertex1,\n trialSharedVertex0, trialSharedVertex1) <\n make_tuple(other.type, other.testVertexCount, other.trialVertexCount,\n other.testSharedVertex0, other.testSharedVertex1,\n other.trialSharedVertex0, other.trialSharedVertex1);\n }\n\n bool operator==(const ElementPairTopology& other) const {\n return type == other.type &&\n testVertexCount == other.testVertexCount &&\n trialVertexCount == other.trialVertexCount &&\n testSharedVertex0 == other.testSharedVertex0 &&\n testSharedVertex1 == other.testSharedVertex1 &&\n trialSharedVertex0 == other.trialSharedVertex0 &&\n trialSharedVertex1 == other.trialSharedVertex1;\n }\n\n bool operator!=(const ElementPairTopology& other) const {\n return !operator==(other);\n }\n\n friend std::ostream&\n operator<< (std::ostream& dest, const ElementPairTopology& obj)\n {\n dest << obj.type << \" \"\n << (int)obj.testVertexCount << \" \"\n << (int)obj.trialVertexCount << \" \"\n << (int)obj.testSharedVertex0 << \" \"\n << (int)obj.testSharedVertex1 << \" \"\n << (int)obj.trialSharedVertex0 << \" \"\n << (int)obj.trialSharedVertex1;\n return dest;\n }\n};\n\ninline ElementPairTopology determineElementPairTopologyIn3D(\n const arma::Col<int>& testElementCornerIndices,\n const arma::Col<int>& trialElementCornerIndices)\n{\n ElementPairTopology topology;\n\n \n#ifndef NDEBUG\n const int MIN_VERTEX_COUNT = 3;\n#endif\n const int MAX_VERTEX_COUNT = 4;\n topology.testVertexCount = testElementCornerIndices.n_rows;\n assert(MIN_VERTEX_COUNT <= topology.testVertexCount &&\n topology.testVertexCount <= MAX_VERTEX_COUNT);\n topology.trialVertexCount = trialElementCornerIndices.n_rows;\n assert(MIN_VERTEX_COUNT <= topology.trialVertexCount &&\n topology.trialVertexCount <= MAX_VERTEX_COUNT);\n\n \n int testSharedVertices[MAX_VERTEX_COUNT];\n int trialSharedVertices[MAX_VERTEX_COUNT];\n int hits = 0;\n\n for (int trialV = 0; trialV < topology.trialVertexCount; ++trialV)\n for (int testV = 0; testV < topology.testVertexCount; ++testV)\n if (testElementCornerIndices(testV) ==\n trialElementCornerIndices(trialV))\n {\n testSharedVertices[hits] = testV;\n trialSharedVertices[hits] = trialV;\n ++hits;\n break;\n }\n\n if (hits == 0)\n {\n topology.type = ElementPairTopology::Disjoint;\n }\n else if (hits == 1)\n {\n topology.type = ElementPairTopology::SharedVertex;\n topology.testSharedVertex0 = testSharedVertices[0];\n topology.trialSharedVertex0 = trialSharedVertices[0];\n }\n else if (hits == 2) \n {\n topology.type = ElementPairTopology::SharedEdge;\n topology.testSharedVertex0 = testSharedVertices[0];\n topology.testSharedVertex1 = testSharedVertices[1];\n topology.trialSharedVertex0 = trialSharedVertices[0];\n topology.trialSharedVertex1 = trialSharedVertices[1];\n }\n \n else if (hits == topology.testVertexCount &&\n hits == topology.trialVertexCount)\n {\n \n \n for (int i = 0; i < hits; ++i)\n assert(testSharedVertices[i] == trialSharedVertices[i]);\n topology.type = ElementPairTopology::Coincident;\n }\n else\n throw std::runtime_error(\n \"Standard3DIntegrationManager::\"\n \"selectTestKernelTrialQuadratureRules() :\"\n \"Invalid element configuration\");\n\n return topology;\n}\n\n} \n\n#endif\n"},"prefix":{"kind":"string","value":"\n\n#ifndef fiber_element_pair_topology_hpp\n#define fiber_element_pair_topology_hpp\n\n#include \"../common/common.hpp\"\n\n#include \"../common/armadillo_fwd.hpp\"\n#include <cassert>\n#include <iostream>\n#include <boost/tuple/tuple_comparison.hpp>\n\nnamespace Fiber\n{\n\nstruct ElementPairTopology\n{\n ElementPairTopology() :\n type(Disjoint),\n testVertexCount(0), trialVertexCount(0),\n testSharedVertex0(-1), testSharedVertex1(-1),\n trialSharedVertex0(-1), trialSharedVertex1(-1)\n {}\n\n enum Type { Disjoint, SharedVertex, SharedEdge, Coincident };\n Type type;\n unsigned char testVertexCount;\n unsigned char trialVertexCount;\n signed char testSharedVertex0;\n signed char testSharedVertex1;\n signed char trialSharedVertex0;\n signed char trialSharedVertex1;\n\n bool operator<(const ElementPairTopology& other) const {\n using boost::tuples::make_tuple;\n return make_tuple(type, testVertexCount, trialVertexCount,\n testSharedVertex0, testSharedVertex1,\n trialSharedVertex0, trialSharedVertex1) <\n make_tuple(other.type, other.testVertexCount, other.trialVertexCount,\n other.testSharedVertex0, other.testSharedVertex1,\n other.trialSharedVertex0, other.trialSharedVertex1);\n }\n\n bool operator==(const ElementPairTopology& o"},"suffix":{"kind":"string","value":"+testV)\n if (testElementCornerIndices(testV) ==\n trialElementCornerIndices(trialV))\n {\n testSharedVertices[hits] = testV;\n trialSharedVertices[hits] = trialV;\n ++hits;\n break;\n }\n\n if (hits == 0)\n {\n topology.type = ElementPairTopology::Disjoint;\n }\n else if (hits == 1)\n {\n topology.type = ElementPairTopology::SharedVertex;\n topology.testSharedVertex0 = testSharedVertices[0];\n topology.trialSharedVertex0 = trialSharedVertices[0];\n }\n else if (hits == 2) \n {\n topology.type = ElementPairTopology::SharedEdge;\n topology.testSharedVertex0 = testSharedVertices[0];\n topology.testSharedVertex1 = testSharedVertices[1];\n topology.trialSharedVertex0 = trialSharedVertices[0];\n topology.trialSharedVertex1 = trialSharedVertices[1];\n }\n \n else if (hits == topology.testVertexCount &&\n hits == topology.trialVertexCount)\n {\n \n \n for (int i = 0; i < hits; ++i)\n assert(testSharedVertices[i] == trialSharedVertices[i]);\n topology.type = ElementPairTopology::Coincident;\n }\n else\n throw std::runtime_error(\n \"Standard3DIntegrationManager::\"\n \"selectTestKernelTrialQuadratureRules() :\"\n \"Invalid element configuration\");\n\n return topology;\n}\n\n} \n\n#endif\n"},"middle":{"kind":"string","value":"ther) const {\n return type == other.type &&\n testVertexCount == other.testVertexCount &&\n trialVertexCount == other.trialVertexCount &&\n testSharedVertex0 == other.testSharedVertex0 &&\n testSharedVertex1 == other.testSharedVertex1 &&\n trialSharedVertex0 == other.trialSharedVertex0 &&\n trialSharedVertex1 == other.trialSharedVertex1;\n }\n\n bool operator!=(const ElementPairTopology& other) const {\n return !operator==(other);\n }\n\n friend std::ostream&\n operator<< (std::ostream& dest, const ElementPairTopology& obj)\n {\n dest << obj.type << \" \"\n << (int)obj.testVertexCount << \" \"\n << (int)obj.trialVertexCount << \" \"\n << (int)obj.testSharedVertex0 << \" \"\n << (int)obj.testSharedVertex1 << \" \"\n << (int)obj.trialSharedVertex0 << \" \"\n << (int)obj.trialSharedVertex1;\n return dest;\n }\n};\n\ninline ElementPairTopology determineElementPairTopologyIn3D(\n const arma::Col<int>& testElementCornerIndices,\n const arma::Col<int>& trialElementCornerIndices)\n{\n ElementPairTopology topology;\n\n \n#ifndef NDEBUG\n const int MIN_VERTEX_COUNT = 3;\n#endif\n const int MAX_VERTEX_COUNT = 4;\n topology.testVertexCount = testElementCornerIndices.n_rows;\n assert(MIN_VERTEX_COUNT <= topology.testVertexCount &&\n topology.testVertexCount <= MAX_VERTEX_COUNT);\n topology.trialVertexCount = trialElementCornerIndices.n_rows;\n assert(MIN_VERTEX_COUNT <= topology.trialVertexCount &&\n topology.trialVertexCount <= MAX_VERTEX_COUNT);\n\n \n int testSharedVertices[MAX_VERTEX_COUNT];\n int trialSharedVertices[MAX_VERTEX_COUNT];\n int hits = 0;\n\n for (int trialV = 0; trialV < topology.trialVertexCount; ++trialV)\n for (int testV = 0; testV < topology.testVertexCount; +"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"enum CallVariant\n\n{\n\n TEST_TRIAL = 0,\n\n TRIAL_TEST = 1\n\n};\n\n\n\ntypedef int LocalDofIndex;\n\nconst LocalDofIndex ALL_DOFS = -1;\n\n\n\n}\n\n\n\n#endif\n","file_path":"lib/fiber/types.hpp","rank":0,"score":187458.7934374725},{"content":"enum GeometricalDataType\n\n{\n\n GLOBALS = 0x0001,\n\n INTEGRATION_ELEMENTS = 0x0002,\n\n NORMALS = 0x0004,\n\n JACOBIANS_TRANSPOSED = 0x0008,\n\n JACOBIAN_INVERSES_TRANSPOSED = 0x0010\n\n};\n\n\n\n/** \\cond FORWARD_DECL */\n\ntemplate <typename CoordinateType> class ConstGeometricalDataSlice;\n\n/** \\endcond */\n\n\n\ntemplate <typename CoordinateType>\n","file_path":"lib/fiber/geometrical_data.hpp","rank":1,"score":178588.53894853673},{"content":"enum BasisDataType\n\n{\n\n VALUES = 0x0001,\n\n DERIVATIVES = 0x0002\n\n};\n\n\n\n/** \\cond FORWARD_DECL */\n\ntemplate <typename ValueType> class ConstBasisDataSlice;\n\n/** \\endcond */\n\n\n\ntemplate <typename ValueType>\n","file_path":"lib/fiber/basis_data.hpp","rank":2,"score":178588.5389485367},{"content":"struct GetInfoHelper<Func, VECTOR_CLASS<char *> >\n\n{\n\n static cl_int\n\n get(Func f, cl_uint name, VECTOR_CLASS<char *>* param)\n\n {\n\n cl_uint err = f(name, param->size() * sizeof(char *), &(*param)[0], NULL);\n\n if (err != CL_SUCCESS) {\n\n return err;\n\n }\n\n \n\n return CL_SUCCESS;\n\n }\n\n};\n\n\n\n// Specialized GetInfoHelper for STRING_CLASS params\n\ntemplate <typename Func>\n","file_path":"lib/fiber/CL/cl.hpp","rank":3,"score":176506.84658784064},{"content":"struct MblockArrayConverter<Type, Type>\n\n{\n\n static void convert(\n\n unsigned int n,\n\n const boost::shared_array<mblock<Type> *>& in,\n\n boost::shared_array<mblock<Type> *>& out) {\n\n out = in;\n\n }\n\n};\n\n\n\ntemplate <typename ValueType>\n\nvoid SparseToHMatrixConverter<ValueType>::constructHMatrix(\n\n int* rowOffsets, int* colIndices, double* values,\n\n std::vector<unsigned int>& domain_o2p,\n\n std::vector<unsigned int>& range_p2o,\n\n double eps,\n\n bemblcluster<AhmedDofType, AhmedDofType>* blockCluster,\n\n boost::shared_array<AhmedMblock*>& mblocks,\n\n int& maximumRank)\n\n{\n","file_path":"lib/assembly/sparse_to_h_matrix_converter.cpp","rank":4,"score":170064.80276353093},{"content":"struct GetInfoHelper<Func, CPP_TYPE> \\\n\n{ \\\n\n static cl_int get(Func f, cl_uint name, CPP_TYPE* param) \\\n\n { \\\n\n cl_uint err = f(name, sizeof(CPP_TYPE), param, NULL); \\\n\n if (err != CL_SUCCESS) { \\\n\n return err; \\\n\n } \\\n\n \\\n\n return ReferenceHandler<CPP_TYPE::cl_type>::retain((*param)()); \\\n\n } \\\n\n}; \\\n\n} \n\n\n\n\n\n#define __PARAM_NAME_INFO_1_0(F) \\\n\n F(cl_platform_info, CL_PLATFORM_PROFILE, STRING_CLASS) \\\n\n F(cl_platform_info, CL_PLATFORM_VERSION, STRING_CLASS) \\\n\n F(cl_platform_info, CL_PLATFORM_NAME, STRING_CLASS) \\\n\n F(cl_platform_info, CL_PLATFORM_VENDOR, STRING_CLASS) \\\n","file_path":"lib/fiber/CL/cl.hpp","rank":5,"score":157411.51858549006},{"content":"struct PiecewiseLinearContinuousScalarBasisTraits<4, CoordinateType, ValueType>\n\n{\n\npublic:\n\n typedef Dune::Q1LocalBasis<CoordinateType, ValueType, 2> DuneBasis;\n\n};\n\n\n\ntemplate <int elementVertexCount, typename ValueType>\n","file_path":"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp","rank":6,"score":148248.23237424754},{"content":"struct PiecewiseLinearContinuousScalarBasisTraits<2, CoordinateType, ValueType>\n\n{\n\npublic:\n\n typedef Dune::Q1LocalBasis<CoordinateType, ValueType, 1> DuneBasis;\n\n};\n\n\n\n// Triangle\n\ntemplate <typename CoordinateType, typename ValueType>\n","file_path":"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp","rank":7,"score":148248.23237424754},{"content":"struct PiecewiseLinearContinuousScalarBasisTraits<3, CoordinateType, ValueType>\n\n{\n\npublic:\n\n typedef Dune::P1LocalBasis<CoordinateType, ValueType, 2> DuneBasis;\n\n};\n\n\n\n// Quadrilateral\n\ntemplate <typename CoordinateType, typename ValueType>\n","file_path":"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp","rank":8,"score":148248.23237424754},{"content":"enum DofType\n\n{\n\n GLOBAL_DOFS, FLAT_LOCAL_DOFS\n\n};\n\n\n\n/** \\ingroup space\n\n * \\brief Function space.\n\n *\n\n * This class represents a space of functions defined on a grid. The space is\n\n * spanned by a finite number of scalar- or vector-valued basis functions. The\n\n * template parameter \\p BasisFunctionType is the type of the values of (the\n\n * components of) these basis functions, and can be set to \\c float,\n\n * \\c double, <tt>std::complex<float></tt> or <tt>std::complex<double></tt>.\n\n *\n\n * The basis functions of a space, also known as global degrees of freedom\n\n * (DOFs), can have support extending over multiple elements of the grid. They\n\n * are, however, composed of one or more *local* basis functions (local\n\n * degrees of freedom), each of which resides on a single element. The mapping\n\n * of local to global degrees of freedom is triggered by calling the function\n\n * assignDofs(). Many other member functions of Space may only be invoked after\n\n * assignDofs() has beeen called. */\n\ntemplate <typename BasisFunctionType>\n","file_path":"lib/space/space.hpp","rank":9,"score":139015.70472538922},{"content":"struct LocalDof\n\n{\n\n LocalDof() {}\n\n LocalDof(EntityIndex ei, LocalDofIndex ldi) :\n\n entityIndex(ei), dofIndex(ldi) {\n\n }\n\n\n\n EntityIndex entityIndex;\n\n LocalDofIndex dofIndex;\n\n};\n\n\n\ntemplate <typename ValueType>\n","file_path":"lib/common/types.hpp","rank":10,"score":138052.9799339606},{"content":"struct Point3D\n\n{\n\n ValueType x, y, z;\n\n};\n\n\n\n} // namespace Bempp\n\n\n\n#endif\n","file_path":"lib/common/types.hpp","rank":11,"score":138052.9799339606},{"content":"#define __DECLARE_PARAM_TRAITS(token, param_name, T) \\\n\nstruct token; \\\n\ntemplate<> \\\n","file_path":"lib/fiber/CL/cl.hpp","rank":12,"score":135711.0531631047},{"content":"struct Equal\n\n{\n\n bool operator()(const std::pair<double, QuadratureOptions>& first,\n\n const std::pair<double, QuadratureOptions>& second) const\n\n {\n\n return first.first == second.first;\n\n }\n\n};\n\n\n\n} // namespace\n\n\n\nAccuracyOptionsEx::AccuracyOptionsEx()\n\n{\n\n m_doubleRegular.push_back(std::make_pair(std::numeric_limits<double>::infinity(),\n\n QuadratureOptions()));\n\n}\n\n\n\nAccuracyOptionsEx::AccuracyOptionsEx(const AccuracyOptions& oldStyleOpts)\n\n{\n\n m_singleRegular = oldStyleOpts.singleRegular;\n","file_path":"lib/fiber/accuracy_options.cpp","rank":13,"score":135705.18754253467},{"content":"struct Coercion\n\n{\n\n // If you get a compilation error here, chances are that you are trying to\n\n // mix floating-point numbers with different precisions (e.g. float and\n\n // double or std::complex<float> and double). BEM++ does not support this.\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":14,"score":135705.18754253467},{"content":"struct LessOrEqual\n\n{\n\n bool operator()(const std::pair<double, QuadratureOptions>& first,\n\n const std::pair<double, QuadratureOptions>& second) const\n\n {\n\n return first.first <= second.first;\n\n }\n\n};\n\n\n","file_path":"lib/fiber/accuracy_options.cpp","rank":15,"score":132687.71270744532},{"content":"struct ReferenceHandler\n\n{ };\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":16,"score":132687.71270744532},{"content":"struct GeometricalData\n\n{\n\n arma::Mat<CoordinateType> globals;\n\n arma::Row<CoordinateType> integrationElements;\n\n arma::Cube<CoordinateType> jacobiansTransposed;\n\n arma::Cube<CoordinateType> jacobianInversesTransposed;\n\n arma::Mat<CoordinateType> normals;\n\n\n\n // For the time being, I (somewhat dangerously) assume that\n\n // integrationElements or globals or normals are always used\n\n int pointCount() const {\n\n int result = std::max(std::max(globals.n_cols, normals.n_cols),\n\n integrationElements.n_cols);\n\n assert(result > 0);\n\n return result;\n\n }\n\n\n\n int dimWorld() const {\n\n int result = std::max(globals.n_rows, normals.n_rows);\n\n assert(result > 0);\n\n return result;\n\n }\n\n\n\n ConstGeometricalDataSlice<CoordinateType> const_slice(int point) const {\n\n return ConstGeometricalDataSlice<CoordinateType>(*this, point);\n\n }\n\n};\n\n\n\ntemplate <typename CoordinateType>\n","file_path":"lib/fiber/geometrical_data.hpp","rank":17,"score":132687.71270744532},{"content":"struct AccuracyOptions\n\n{\n\npublic:\n\n /** \\brief Options controlling integration of regular functions\n\n * on single elements. */\n\n QuadratureOptions singleRegular;\n\n /** \\brief Options controlling integration of regular functions\n\n * on pairs of elements. */\n\n QuadratureOptions doubleRegular;\n\n /** \\brief Options controlling integration of singular functions\n\n * on pairs of elements. */\n\n QuadratureOptions doubleSingular;\n\n};\n\n\n\n/** \\brief New-style options controlling quadrature accuracy. */\n","file_path":"lib/fiber/accuracy_options.hpp","rank":18,"score":132687.71270744532},{"content":"struct VerbosityLevel {\n\n enum Level {\n\n DEFAULT = 0,\n\n HIGH = 5,\n\n LOW = -5\n\n };\n\n};\n\n\n\n} // namespace Fiber\n\n\n\n#endif\n","file_path":"lib/fiber/verbosity_level.hpp","rank":19,"score":132687.71270744532},{"content":"struct ScalarTraits\n\n{\n\n // If you get a compilation error here, you are probably trying to use an\n\n // unsupported floating-point type. The supported types are: float, double,\n\n // std::complex<float> and std::complex<double>.\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":20,"score":132687.71270744532},{"content":"struct param_traits {};\n\n\n","file_path":"lib/fiber/CL/cl.hpp","rank":21,"score":132687.71270744532},{"content":"struct QuadraturePoint\n\n{\n\n\tdouble coords[NUM_COORDS];\n\n\tdouble quadrature_weight;\n\n};\n\n\n\n\n\n\n\n/**\n\n * @ingroup quadrature\n\n *\n\n * The QuadratureRule object is a non specialzed template class for all\n\n * different @p QUADRATURE_RULES and @p ELEMENT_SHAPES (e.g. GAUSS for\n\n * TRIANGLES). \n\n * @tparam ELEMENT_SHAPE \n\n * @tparam QUADRATURE_RULE\n\n */\n\ntemplate<ELEMENT_SHAPE SHAPE, QUADRATURE_RULE RULE>\n","file_path":"lib/fiber/quadrature/quadrature.hpp","rank":22,"score":132687.71270744532},{"content":"struct BasisData\n\n{\n\n // values(i,k,l) = (f_k)_i(x_l) ->\n\n // ith component of kth basis function at lth point\n\n _3dArray<ValueType> values;\n\n // derivatives(i,j,k,l) = (d_j (f_k)_i)(x_l) ->\n\n // derivative in direction j of ith component of kth basis function at lth point\n\n _4dArray<ValueType> derivatives;\n\n\n\n int componentCount() const {\n\n return std::max<int>(values.extent(0), derivatives.extent(0));\n\n }\n\n\n\n int functionCount() const {\n\n return std::max<int>(values.extent(1), derivatives.extent(2));\n\n }\n\n\n\n int pointCount() const {\n\n return std::max<int>(values.extent(2), derivatives.extent(3));\n\n }\n\n\n\n ConstBasisDataSlice<ValueType> const_slice(int function, int point) const {\n\n return ConstBasisDataSlice<ValueType>(*this, function, point);\n\n }\n\n};\n\n\n\ntemplate <typename ValueType>\n","file_path":"lib/fiber/basis_data.hpp","rank":23,"score":132687.71270744532},{"content":"struct null_deleter\n\n{\n\n void operator() (const void*) const {\n\n }\n\n};\n\n\n\n/** \\brief Create a shared pointer from a reference to an object allocated on stack.\n\n\n\nThe object will not be deleted when the shared pointer goes out of scope. */\n\ntemplate <typename T>\n\ninline shared_ptr<T> make_shared_from_ref(T& t)\n\n{\n\n return shared_ptr<T>(&t, null_deleter());\n\n}\n\n\n\ntemplate <typename T>\n\ninline shared_ptr<const T> make_shared_from_const_ref(const T& t)\n\n{\n\n return shared_ptr<const T>(&t, null_deleter());\n\n}\n\n\n\n} // namespace Fiber\n\n\n\n#endif // fiber_shared_ptr_hpp\n","file_path":"lib/fiber/shared_ptr.hpp","rank":24,"score":132687.71270744532},{"content":"enum SpaceType { \n\n PIECEWISE_CONSTANTS,\n\n PIECEWISE_LINEARS\n\n};\n\n\n\ntemplate <typename BFT, typename RT>\n","file_path":"tests/unit/linalg/laplace_3d_dirichlet_fixture.hpp","rank":25,"score":130263.31381397537},{"content":"struct GetInfoFunctor1\n\n{\n\n Func f_; const Arg0& arg0_; const Arg1& arg1_;\n\n cl_int operator ()(\n\n cl_uint param, ::size_t size, void* value, ::size_t* size_ret)\n\n { return f_(arg0_, arg1_, param, size, value, size_ret); }\n\n};\n\n\n\ntemplate <typename Func, typename Arg0, typename T>\n\ninline cl_int\n\ngetInfo(Func f, const Arg0& arg0, cl_uint name, T* param)\n\n{\n\n GetInfoFunctor0<Func, Arg0> f0 = { f, arg0 };\n\n return GetInfoHelper<GetInfoFunctor0<Func, Arg0>, T>\n\n ::get(f0, name, param);\n\n}\n\n\n\ntemplate <typename Func, typename Arg0, typename Arg1, typename T>\n\ninline cl_int\n\ngetInfo(Func f, const Arg0& arg0, const Arg1& arg1, cl_uint name, T* param)\n\n{\n\n GetInfoFunctor1<Func, Arg0, Arg1> f0 = { f, arg0, arg1 };\n\n return GetInfoHelper<GetInfoFunctor1<Func, Arg0, Arg1>, T>\n\n ::get(f0, name, param);\n\n}\n\n\n\ntemplate<typename T>\n","file_path":"lib/fiber/CL/cl.hpp","rank":26,"score":129848.56585107828},{"content":"struct LocalSpaceArg\n\n{\n\n ::size_t size_;\n\n};\n\n\n\nnamespace detail {\n\n\n\ntemplate <typename T>\n","file_path":"lib/fiber/CL/cl.hpp","rank":27,"score":129848.56585107828},{"content":"struct KernelArgumentHandler\n\n{\n\n static ::size_t size(const T&) { return sizeof(T); }\n\n static T* ptr(T& value) { return &value; }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":28,"score":129848.56585107828},{"content":"struct DoubleQuadratureDescriptor\n\n{\n\n ElementPairTopology topology;\n\n int testOrder;\n\n int trialOrder;\n\n\n\n bool operator<(const DoubleQuadratureDescriptor& other) const {\n\n using boost::tuples::make_tuple;\n\n return make_tuple(topology, testOrder, trialOrder) <\n\n make_tuple(other.topology, other.testOrder, other.trialOrder);\n\n }\n\n\n\n bool operator==(const DoubleQuadratureDescriptor& other) const {\n\n return topology == other.topology &&\n\n testOrder == other.testOrder &&\n\n trialOrder == other.trialOrder;\n\n }\n\n\n\n bool operator!=(const DoubleQuadratureDescriptor& other) const {\n\n return !operator==(other);\n","file_path":"lib/fiber/numerical_quadrature.hpp","rank":29,"score":129848.56585107828},{"content":"struct OpenClOptions\n\n{\n\n OpenClOptions ()\n\n {\n\n useOpenCl = true;\n\n }\n\n\n\n bool useOpenCl;\n\n // add more as required\n\n};\n\n\n\n}\n\n\n\n#endif\n","file_path":"lib/fiber/opencl_options.hpp","rank":30,"score":129848.56585107828},{"content":"struct GetInfoFunctor0\n\n{\n\n Func f_; const Arg0& arg0_;\n\n cl_int operator ()(\n\n cl_uint param, ::size_t size, void* value, ::size_t* size_ret)\n\n { return f_(arg0_, param, size, value, size_ret); }\n\n};\n\n\n\ntemplate <typename Func, typename Arg0, typename Arg1>\n","file_path":"lib/fiber/CL/cl.hpp","rank":31,"score":129848.56585107828},{"content":"struct GetInfoHelper\n\n{\n\n static cl_int\n\n get(Functor f, cl_uint name, T* param)\n\n {\n\n return f(name, sizeof(T), param, NULL);\n\n }\n\n};\n\n\n\n// Specialized GetInfoHelper for VECTOR_CLASS params\n\ntemplate <typename Func, typename T>\n","file_path":"lib/fiber/CL/cl.hpp","rank":32,"score":129848.56585107828},{"content":"struct SingleQuadratureDescriptor\n\n{\n\n int vertexCount;\n\n int order;\n\n\n\n bool operator<(const SingleQuadratureDescriptor& other) const {\n\n return std::make_pair(vertexCount, order) <\n\n std::make_pair(other.vertexCount, other.order);\n\n }\n\n\n\n bool operator==(const SingleQuadratureDescriptor& other) const {\n\n return vertexCount == other.vertexCount &&\n\n order == other.order;\n\n }\n\n\n\n bool operator!=(const SingleQuadratureDescriptor& other) const {\n\n return !operator==(other);\n\n }\n\n\n\n friend std::ostream&\n","file_path":"lib/fiber/numerical_quadrature.hpp","rank":33,"score":129848.56585107828},{"content":"struct AhmedTypeTraits\n\n{\n\n typedef T Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/assembly/ahmed_aux_fwd.hpp","rank":34,"score":129318.03197259083},{"content":"struct PointTraits<5>\n\n{\ttypedef Mat<double,5,1> point_type; };\n\n\n\ntemplate<>\n","file_path":"lib/fiber/quadrature/mat.hpp","rank":35,"score":127723.91219135188},{"content":"struct PointTraits<4>\n\n{\ttypedef Mat<double,4,1> point_type; };\n\n\n\ntemplate<>\n","file_path":"lib/fiber/quadrature/mat.hpp","rank":36,"score":127723.91219135188},{"content":"struct PointTraits<2>\n\n{\ttypedef Mat<double,2,1> point_type; };\n\n\n\ntemplate<>\n","file_path":"lib/fiber/quadrature/mat.hpp","rank":37,"score":127723.91219135188},{"content":"struct PointTraits<6>\n\n{\ttypedef Mat<double,6,1> point_type; };\n\n//@}\n\n\n\n\n\n//////////////////////////////////////////////////////////////////////\n\n// OUTPUT ////////////////////////////////////////////////////////\n\n//////////////////////////////////////////////////////////////////////\n\n\n\n/**\n\n * overloading output operator.\n\n * @tparam T value_type\n\n * @tparam NUM_ROWS number of rows\n\n * @tparam NUM_COLS number of colums\n\n * @param[out] out output-stream\n\n * @param[in] m mat to write\n\n */\n\ntemplate<typename T, int NUM_ROWS, int NUM_COLS>\n\nstd::ostream& operator << (std::ostream& out,\n\n const Mat<T,NUM_ROWS,NUM_COLS>& m)\n","file_path":"lib/fiber/quadrature/mat.hpp","rank":38,"score":127723.91219135188},{"content":"struct PointTraits<1>\n\n{\ttypedef Mat<double,1,1> point_type; };\n\n\n\ntemplate<>\n","file_path":"lib/fiber/quadrature/mat.hpp","rank":39,"score":127723.91219135188},{"content":"struct PointTraits<3>\n\n{\ttypedef Mat<double,3,1> point_type; };\n\n\n\ntemplate<>\n","file_path":"lib/fiber/quadrature/mat.hpp","rank":40,"score":127723.91219135188},{"content":"struct QuadratureOptions;\n\ntemplate <typename ValueType> class Basis;\n\ntemplate <typename CoordinateType> class CollectionOfBasisTransformations;\n\ntemplate <typename ValueType> class CollectionOfKernels;\n\ntemplate <typename BasisFunctionType, typename KernelType, typename ResultType>\n","file_path":"lib/fiber/default_evaluator_for_integral_operators.hpp","rank":42,"score":127172.39233947435},{"content":"struct ScalarTraits<double>\n\n{\n\n typedef double RealType;\n\n typedef std::complex<double> ComplexType;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":43,"score":124884.76533498483},{"content":"struct ScalarTraits<float>\n\n{\n\n typedef float RealType;\n\n typedef std::complex<float> ComplexType;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":44,"score":124884.76533498483},{"content":"struct IdentityOperator<BasisFunctionType, ResultType>::Impl\n\n{\n\n typedef Fiber::ScalarFunctionValueFunctor<CoordinateType>\n\n TransformationFunctor;\n\n\n\n Impl() : transformations(TransformationFunctor())\n\n {}\n\n\n\n Fiber::DefaultCollectionOfBasisTransformations<TransformationFunctor>\n\n transformations;\n\n};\n\n/** \\endcond */\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n\nIdentityOperator<BasisFunctionType, ResultType>::IdentityOperator(\n\n const shared_ptr<const Space<BasisFunctionType> >& domain,\n\n const shared_ptr<const Space<BasisFunctionType> >& range,\n\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange,\n\n const std::string& label,\n\n int symmetry) :\n","file_path":"lib/assembly/identity_operator.cpp","rank":45,"score":122233.81001526414},{"content":"struct ReferenceHandler<cl_mem>\n\n{\n\n static cl_int retain(cl_mem memory)\n\n { return ::clRetainMemObject(memory); }\n\n static cl_int release(cl_mem memory)\n\n { return ::clReleaseMemObject(memory); }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":46,"score":122208.5918233809},{"content":"struct ReferenceHandler<cl_kernel>\n\n{\n\n static cl_int retain(cl_kernel kernel)\n\n { return ::clRetainKernel(kernel); }\n\n static cl_int release(cl_kernel kernel)\n\n { return ::clReleaseKernel(kernel); }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":47,"score":122208.5918233809},{"content":"struct ReferenceHandler<cl_context>\n\n{\n\n static cl_int retain(cl_context context)\n\n { return ::clRetainContext(context); }\n\n static cl_int release(cl_context context)\n\n { return ::clReleaseContext(context); }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":48,"score":122208.5918233809},{"content":"struct ReferenceHandler<cl_sampler>\n\n{\n\n static cl_int retain(cl_sampler sampler)\n\n { return ::clRetainSampler(sampler); }\n\n static cl_int release(cl_sampler sampler)\n\n { return ::clReleaseSampler(sampler); }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":49,"score":122208.5918233809},{"content":"struct ReferenceHandler<cl_event>\n\n{\n\n static cl_int retain(cl_event event)\n\n { return ::clRetainEvent(event); }\n\n static cl_int release(cl_event event)\n\n { return ::clReleaseEvent(event); }\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"lib/fiber/CL/cl.hpp","rank":50,"score":122208.5918233809},{"content":"struct ReferenceHandler<cl_program>\n\n{\n\n static cl_int retain(cl_program program)\n\n { return ::clRetainProgram(program); }\n\n static cl_int release(cl_program program)\n\n { return ::clReleaseProgram(program); }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":51,"score":122208.5918233809},{"content":"struct Coercion<double, double>\n\n{\n\n typedef double Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":52,"score":121106.41598731262},{"content":"struct Coercion<float, float>\n\n{\n\n typedef float Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":53,"score":121106.41598731262},{"content":"struct generate_test_case_4_num_type {\n\n explicit generate_test_case_4_num_type( const_string tc_name, Generator& G )\n\n : m_test_case_name( tc_name )\n\n , m_holder( G )\n\n {}\n\n\n\n template<typename TestType>\n\n void operator()( mpl::identity<TestType> ) {\n\n std::string full_name;\n\n assign_op( full_name, m_test_case_name, 0 );\n\n\n\n // This is the essential fragment changed wrt. boost_test_case_template.hpp\n\n std::stringstream sstream;\n\n sstream << full_name;\n\n sstream << '<';\n\n sstream << TestType::value;\n\n sstream << '>';\n\n full_name = sstream.str();\n\n\n\n m_holder.m_test_cases.push_back(\n","file_path":"tests/unit/boost_test_case_num_template.hpp","rank":54,"score":119770.36071084044},{"content":"struct ReferenceHandler<cl_command_queue>\n\n{\n\n static cl_int retain(cl_command_queue queue)\n\n { return ::clRetainCommandQueue(queue); }\n\n static cl_int release(cl_command_queue queue)\n\n { return ::clReleaseCommandQueue(queue); }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":55,"score":119681.75062069544},{"content":"struct ReferenceHandler<cl_device_id>\n\n{\n\n // cl_device_id does not have retain().\n\n static cl_int retain(cl_device_id)\n\n { return CL_INVALID_DEVICE; }\n\n // cl_device_id does not have release().\n\n static cl_int release(cl_device_id)\n\n { return CL_INVALID_DEVICE; }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":56,"score":119681.75062069544},{"content":"struct ReferenceHandler<cl_platform_id>\n\n{\n\n // cl_platform_id does not have retain().\n\n static cl_int retain(cl_platform_id)\n\n { return CL_INVALID_PLATFORM; }\n\n // cl_platform_id does not have release().\n\n static cl_int release(cl_platform_id)\n\n { return CL_INVALID_PLATFORM; }\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/CL/cl.hpp","rank":57,"score":119681.75062069544},{"content":"struct DefaultDirectSolver<BasisFunctionType, ResultType>::Impl\n\n{\n\n Impl(const BoundaryOperator<BasisFunctionType, ResultType>& op_) :\n\n op(op_)\n\n {\n\n }\n\n\n\n Impl(const BlockedBoundaryOperator<BasisFunctionType, ResultType>& op_) :\n\n op(op_)\n\n {\n\n }\n\n \n\n boost::variant<\n\n BoundaryOperator<BasisFunctionType, ResultType>,\n\n BlockedBoundaryOperator<BasisFunctionType, ResultType> > op;\n\n};\n\n\n\n/** \\endcond */\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"lib/linalg/default_direct_solver.cpp","rank":58,"score":118338.21758936445},{"content":"struct DefaultIterativeSolver<BasisFunctionType, ResultType>::Impl\n\n{\n\n\n\n // Constructor for non-blocked operators\n\n Impl(const BoundaryOperator<BasisFunctionType, ResultType>& op_,\n\n ConvergenceTestMode::Mode mode_) :\n\n op(op_),\n\n mode(mode_)\n\n {\n\n typedef BoundaryOperator<BasisFunctionType, ResultType> BoundaryOp;\n\n typedef Solver<BasisFunctionType, ResultType> Solver_;\n\n const BoundaryOp& boundaryOp = boost::get<BoundaryOp>(op);\n\n if (!boundaryOp.isInitialized())\n\n throw std::invalid_argument(\"DefaultIterativeSolver::Impl::Impl(): \"\n\n \"boundary operator must be initialized\");\n\n\n\n if (mode == ConvergenceTestMode::TEST_CONVERGENCE_IN_DUAL_TO_RANGE) {\n\n if (boundaryOp.domain()->globalDofCount() !=\n\n boundaryOp.dualToRange()->globalDofCount())\n\n throw std::invalid_argument(\"DefaultIterativeSolver::Impl::Impl(): \"\n","file_path":"lib/linalg/default_iterative_solver.cpp","rank":59,"score":118338.21758936445},{"content":"struct KernelArgumentHandler<LocalSpaceArg>\n\n{\n\n static ::size_t size(const LocalSpaceArg& value) { return value.size_; }\n\n static void* ptr(LocalSpaceArg&) { return NULL; }\n\n};\n\n\n\n} \n\n//! \\endcond\n\n\n\ninline LocalSpaceArg\n\n__local(::size_t size)\n\n{\n\n LocalSpaceArg ret = { size };\n\n return ret;\n\n}\n\n\n","file_path":"lib/fiber/CL/cl.hpp","rank":60,"score":117292.08172787684},{"content":"struct PiecewiseLinearContinuousScalarBasisTraits\n\n{\n\n};\n\n\n\n// Line\n\ntemplate <typename CoordinateType, typename ValueType>\n","file_path":"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp","rank":61,"score":115806.6218329503},{"content":"struct CompareSharedPtrsToConstAbstractBoundaryOperatorIds\n\n{\n\n bool operator()(const shared_ptr<const Bempp::AbstractBoundaryOperatorId>& a,\n\n const shared_ptr<const Bempp::AbstractBoundaryOperatorId>& b) const {\n\n return *a == *b;\n\n }\n\n};\n\n\n\n} // namespace\n\n\n\n/** \\cond PRIVATE */\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"lib/assembly/discrete_boundary_operator_cache.cpp","rank":62,"score":115753.89266808578},{"content":"struct ScalarSpace<BasisFunctionType>::Impl\n\n{\n\n typedef Fiber::ScalarFunctionValueFunctor<CoordinateType>\n\n TransformationFunctor;\n\n\n\n Impl() : transformations(TransformationFunctor())\n\n {}\n\n\n\n Fiber::DefaultCollectionOfBasisTransformations<TransformationFunctor>\n\n transformations;\n\n};\n\n/** \\endcond */\n\n\n\ntemplate <typename BasisFunctionType>\n\nScalarSpace<BasisFunctionType>::ScalarSpace(const shared_ptr<const Grid>& grid) :\n\n Base(grid), m_impl(new Impl)\n\n{\n\n}\n\n\n\ntemplate <typename BasisFunctionType>\n","file_path":"lib/space/scalar_space.cpp","rank":63,"score":115542.89364328989},{"content":"struct DiscreteBoundaryOperatorCache<BasisFunctionType, ResultType>::Impl\n\n{\n\n typedef tbb::concurrent_unordered_map<shared_ptr<const AbstractBoundaryOperatorId>,\n\n boost::weak_ptr<const DiscreteBoundaryOperator<ResultType> >,\n\n tbb::tbb_hash<shared_ptr<const AbstractBoundaryOperatorId> >,\n\n CompareSharedPtrsToConstAbstractBoundaryOperatorIds >\n\n DiscreteBoundaryOperatorMap;\n\n\n\n mutable DiscreteBoundaryOperatorMap discreteOps;\n\n};\n\n/** \\endcond */\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n\nDiscreteBoundaryOperatorCache<BasisFunctionType, ResultType>::\n\nDiscreteBoundaryOperatorCache() :\n\n m_impl(new Impl)\n\n{\n\n}\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"lib/assembly/discrete_boundary_operator_cache.cpp","rank":64,"score":114752.7180302841},{"content":"struct ImageFormat : public cl_image_format\n\n{\n\n ImageFormat(){}\n\n\n\n ImageFormat(cl_channel_order order, cl_channel_type type)\n\n {\n\n image_channel_order = order;\n\n image_channel_data_type = type;\n\n }\n\n\n\n ImageFormat& operator = (const ImageFormat& rhs)\n\n {\n\n if (this != &rhs) {\n\n this->image_channel_data_type = rhs.image_channel_data_type;\n\n this->image_channel_order = rhs.image_channel_order;\n\n }\n\n return *this;\n\n }\n\n};\n\n\n\n/*! \\class Device\n\n * \\brief Device interface for cl_device_id.\n\n */\n","file_path":"lib/fiber/CL/cl.hpp","rank":65,"score":113513.73238020463},{"content":"struct GetInfoHelper<Func, STRING_CLASS>\n\n{\n\n static cl_int get(Func f, cl_uint name, STRING_CLASS* param)\n\n {\n\n ::size_t required;\n\n cl_int err = f(name, 0, NULL, &required);\n\n if (err != CL_SUCCESS) {\n\n return err;\n\n }\n\n\n\n char* value = (char*) alloca(required);\n\n err = f(name, required, value, NULL);\n\n if (err != CL_SUCCESS) {\n\n return err;\n\n }\n\n\n\n *param = value;\n\n return CL_SUCCESS;\n\n }\n\n};\n\n\n\n#define __GET_INFO_HELPER_WITH_RETAIN(CPP_TYPE) \\\n\nnamespace detail { \\\n\ntemplate <typename Func> \\\n","file_path":"lib/fiber/CL/cl.hpp","rank":66,"score":113513.73238020463},{"content":"struct ScalarTraits<std::complex<double> >\n\n{\n\n typedef double RealType;\n\n typedef std::complex<double> ComplexType;\n\n};\n\n\n\n/** \\brief \"Larger\" of the types U and V. */\n\ntemplate <typename U, typename V>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":67,"score":112931.13986015916},{"content":"struct ScalarTraits<std::complex<float> >\n\n{\n\n typedef float RealType;\n\n typedef std::complex<float> ComplexType;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":68,"score":112931.13986015916},{"content":"struct param_traits<detail:: token,param_name> \\\n\n{ \\\n\n enum { value = param_name }; \\\n\n typedef T param_type; \\\n\n};\n\n\n\n__PARAM_NAME_INFO_1_0(__DECLARE_PARAM_TRAITS);\n\n#if defined(CL_VERSION_1_1)\n\n__PARAM_NAME_INFO_1_1(__DECLARE_PARAM_TRAITS);\n\n#endif // CL_VERSION_1_1\n\n\n\n#if defined(USE_CL_DEVICE_FISSION)\n\n__PARAM_NAME_DEVICE_FISSION(__DECLARE_PARAM_TRAITS);\n\n#endif // USE_CL_DEVICE_FISSION\n\n\n\n#undef __DECLARE_PARAM_TRAITS\n\n\n\n// Convenience functions\n\n\n\ntemplate <typename Func, typename T>\n\ninline cl_int\n\ngetInfo(Func f, cl_uint name, T* param)\n\n{\n\n return GetInfoHelper<Func, T>::get(f, name, param);\n\n}\n\n\n\ntemplate <typename Func, typename Arg0>\n","file_path":"lib/fiber/CL/cl.hpp","rank":69,"score":110541.47096734055},{"content":"struct Coercion<double, std::complex<double> >\n\n{\n\n typedef std::complex<double> Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":70,"score":110531.87024296448},{"content":"struct Coercion<float, std::complex<float> >\n\n{\n\n typedef std::complex<float> Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":71,"score":110531.87024296448},{"content":"struct Coercion<std::complex<double>, double>\n\n{\n\n typedef std::complex<double> Type;\n\n};\n\n\n\n} // namespace Fiber\n\n\n\n#endif\n","file_path":"lib/fiber/scalar_traits.hpp","rank":72,"score":110531.87024296448},{"content":"struct Coercion<std::complex<float>, float>\n\n{\n\n typedef std::complex<float> Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":73,"score":110531.87024296448},{"content":"struct AhmedTypeTraits<std::complex<double> >\n\n{\n\n typedef dcomp Type;\n\n};\n\n\n\ntemplate <typename T>\n\ninline typename AhmedTypeTraits<T>::Type* ahmedCast(T* x) {\n\n#ifdef AHMED_USES_STD_COMPLEX\n\n return x;\n\n#else\n\n return reinterpret_cast<typename AhmedTypeTraits<T>::Type*>(x);\n\n#endif \n\n}\n\n\n\nfloat ahmedCast(float x);\n\ndouble ahmedCast(double x);\n\nscomp ahmedCast(std::complex<float> x);\n\ndcomp ahmedCast(std::complex<double> x);\n\n\n\n} // namespace Bempp\n\n\n\n#endif\n","file_path":"lib/assembly/ahmed_aux_fwd.hpp","rank":74,"score":110253.6388576969},{"content":"struct AhmedTypeTraits<std::complex<float> >\n\n{\n\n typedef scomp Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/assembly/ahmed_aux_fwd.hpp","rank":75,"score":110253.6388576969},{"content":"struct GetInfoHelper<Func, VECTOR_CLASS<T> >\n\n{\n\n static cl_int get(Func f, cl_uint name, VECTOR_CLASS<T>* param)\n\n {\n\n ::size_t required;\n\n cl_int err = f(name, 0, NULL, &required);\n\n if (err != CL_SUCCESS) {\n\n return err;\n\n }\n\n\n\n T* value = (T*) alloca(required);\n\n err = f(name, required, value, NULL);\n\n if (err != CL_SUCCESS) {\n\n return err;\n\n }\n\n\n\n param->assign(&value[0], &value[required/sizeof(T)]);\n\n return CL_SUCCESS;\n\n }\n\n};\n\n\n\n// Specialized for getInfo<CL_PROGRAM_BINARIES>\n\ntemplate <typename Func>\n","file_path":"lib/fiber/CL/cl.hpp","rank":76,"score":108278.09973447479},{"content":"struct AhmedDofWrapper : public Point3D<CoordinateType>\n\n{\n\n CoordinateType getcenter(int dim) const\n\n {\n\n switch (dim)\n\n {\n\n case 0: return this->x;\n\n case 1: return this->y;\n\n case 2: return this->z;\n\n default:\n\n throw std::invalid_argument(\"AhmedDofWrapper::getcenter(): \"\n\n \"invalid dimension index\");\n\n }\n\n }\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"lib/assembly/ahmed_aux.hpp","rank":77,"score":108055.94943421069},{"content":"struct size_t : public cl::vector< ::size_t, N> { };\n\n\n\nnamespace detail {\n\n\n\n// GetInfo help struct\n\ntemplate <typename Functor, typename T>\n","file_path":"lib/fiber/CL/cl.hpp","rank":78,"score":106164.79862120884},{"content":"// Copyright (C) 2011-2012 by the BEM++ Authors\n\n//\n\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n\n// of this software and associated documentation files (the \"Software\"), to deal\n\n// in the Software without restriction, including without limitation the rights\n\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\n// copies of the Software, and to permit persons to whom the Software is\n\n// furnished to do so, subject to the following conditions:\n\n//\n\n// The above copyright notice and this permission notice shall be included in\n\n// all copies or substantial portions of the Software.\n\n//\n\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\n// THE SOFTWARE.\n\n\n\n#ifndef fiber_types_hpp\n\n#define fiber_types_hpp\n\n\n\n#include \"../common/common.hpp\"\n\n\n\nnamespace Fiber\n\n{\n\n\n","file_path":"lib/fiber/types.hpp","rank":79,"score":105905.55292845913},{"content":"struct Coercion<std::complex<float>, std::complex<float> >\n\n{\n\n typedef std::complex<float> Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":80,"score":102243.61693498399},{"content":"struct Coercion<std::complex<double>, std::complex<double> >\n\n{\n\n typedef std::complex<double> Type;\n\n};\n\n\n\ntemplate <>\n","file_path":"lib/fiber/scalar_traits.hpp","rank":81,"score":102243.61693498399},{"content":"class QuadratureStrategy<BasisFunctionType, ResultType, GeometryFactory,\n\n typename boost::enable_if<boost::is_same<ResultType, typename ScalarTraits<ResultType>::RealType> >::type > :\n\n public QuadratureStrategyBase<BasisFunctionType, ResultType, GeometryFactory>\n\n{\n\n typedef QuadratureStrategyBase<BasisFunctionType, ResultType, GeometryFactory> Base;\n\npublic:\n\n typedef typename Base::CoordinateType CoordinateType;\n\n};\n\n/** \\endcond */\n\n\n\n} // namespace Fiber\n\n\n\n#endif\n","file_path":"lib/fiber/quadrature_strategy.hpp","rank":82,"score":93584.51750964939},{"content":" def test_type_returns_a_GeometryType_for_codim(self, codim):\n\n entity = self.get_entity(codim)\n","file_path":"python/tests/unit/test_entity.py","rank":83,"score":91750.94650204162},{"content":"class ConstGeometricalDataSlice\n\n{\n\npublic:\n\n ConstGeometricalDataSlice(const GeometricalData<CoordinateType>& geomData,\n\n int point) :\n\n m_geomData(geomData), m_point(point) {}\n\n\n\n CoordinateType global(int dim) const {\n\n return m_geomData.globals(dim, m_point);\n\n }\n\n CoordinateType integrationElement() const {\n\n return m_geomData.integrationElements(m_point);\n\n }\n\n CoordinateType jacobianTransposed(int row, int col) const {\n\n return m_geomData.jacobiansTransposed(row, col, m_point);\n\n }\n\n CoordinateType jacobianInverseTransposed(int row, int col) const {\n\n return m_geomData.jacobianInversesTransposed(row, col, m_point);\n\n }\n\n CoordinateType normal(int dim) const {\n","file_path":"lib/fiber/geometrical_data.hpp","rank":84,"score":90755.29890967123},{"content":"class ConstBasisDataSlice\n\n{\n\npublic:\n\n ConstBasisDataSlice(const BasisData<ValueType>& basisData,\n\n int function, int point) :\n\n m_basisData(basisData), m_function(function), m_point(point) {}\n\n\n\n ValueType values(int dim) const {\n\n return m_basisData.values(dim, m_function, m_point);\n\n }\n\n\n\n ValueType derivatives(int dim, int direction) const {\n\n return m_basisData.derivatives(dim, direction, m_function, m_point);\n\n }\n\n\n\n int componentCount() const {\n\n return m_basisData.componentCount();\n\n }\n\n\n\nprivate:\n\n const BasisData<ValueType>& m_basisData;\n\n int m_function, m_point;\n\n};\n\n\n\n} // namespace Fiber\n\n\n\n#endif // BASIS_DATA_TYPES_HPP\n","file_path":"lib/fiber/basis_data.hpp","rank":85,"score":90755.29890967123},{"content":"enum Symmetry\n\n{\n\n NO_SYMMETRY = 0x0000,\n\n SYMMETRIC = 0x0001,\n\n HERMITIAN = 0x0002,\n\n AUTO_SYMMETRY = 0x8000\n\n};\n\n\n\n} // namespace Bempp\n\n\n\n#endif\n","file_path":"lib/assembly/symmetry.hpp","rank":86,"score":89873.84779439632},{"content":"enum TranspositionMode\n\n{\n\n#ifdef WITH_TRILINOS\n\n /** \\brief Use the non-transposed operator. */\n\n NO_TRANSPOSE = Thyra::NOTRANS,\n\n /** \\brief Use the non-transposed operator with complex-conjugated elements\n\n * (same as \\c NO_TRANSPOSE for operators with real elements). */\n\n CONJUGATE = Thyra::CONJ,\n\n /** \\brief Use the transposed operator. */\n\n TRANSPOSE = Thyra::TRANS,\n\n /** \\brief Use the transposed operator with complex-conjugated elements\n\n * (same as \\c TRANSPOSE for operators with real elements). */\n\n CONJUGATE_TRANSPOSE = Thyra::CONJTRANS\n\n#else\n\n NO_TRANSPOSE,\n\n CONJUGATE,\n\n TRANSPOSE,\n\n CONJUGATE_TRANSPOSE\n\n#endif\n\n};\n\n\n\n} // namespace Bempp\n\n\n\n#endif\n","file_path":"lib/assembly/transposition_mode.hpp","rank":87,"score":86676.22155720726},{"content":"struct GridParameters {\n\n /** \\brief %Grid topology */\n\n enum Topology {\n\n /** \\brief one-dimensional grid embedded in a two-dimensional space */\n\n LINEAR,\n\n /** \\brief two-dimensional grid composed of triangular elements,\n\n embedded in a three-dimensional space */\n\n TRIANGULAR,\n\n /** \\brief two-dimensional grid composed of quadrilateral elements,\n\n embedded in a three-dimensional space */\n\n QUADRILATERAL,\n\n /** \\brief two-dimensional grid composed (potentially) both of\n\n triangular and quadrilateral elements, embedded in a\n\n three-dimensional space */\n\n HYBRID_2D,\n\n /** \\brief three-dimensional grid composed of tetrahedral elements,\n\n embedded in a three-dimensional space*/\n\n TETRAHEDRAL\n\n } topology;\n\n};\n\n\n\n} // namespace Bempp\n\n\n\n#endif\n","file_path":"lib/grid/grid_parameters.hpp","rank":88,"score":85719.66516213119},{"content":"struct AcaOptions\n\n{\n\n /** \\brief Initialize ACA parameters to default values. */\n\n AcaOptions();\n\n\n\n /** \\brief Estimate of the desired approximation accuracy.\n\n *\n\n * Default value: 1e-4. */\n\n double eps;\n\n /** \\brief Cluster-pair admissibility parameter.\n\n *\n\n * Default value: 1.2. */\n\n double eta;\n\n /** \\brief Minimum size of blocks approximated with ACA.\n\n *\n\n * Matrix blocks whose smaller side is less than this value will be stored\n\n * in the dense format (ACA will not be attempted on these blocks).\n\n *\n\n * Default value: 16. */\n\n unsigned int minimumBlockSize;\n","file_path":"lib/assembly/assembly_options.hpp","rank":89,"score":85719.66516213119},{"content":"struct ConvergenceTestMode {\n\n enum Mode {\n\n TEST_CONVERGENCE_IN_DUAL_TO_RANGE,\n\n TEST_CONVERGENCE_IN_RANGE\n\n };\n\n};\n\n\n\n/** \\ingroup linalg\n\n * \\brief An abstract interface for various types of solvers\n\n *\n\n * This class is an interface to the solution of linear systems in BEM++.\n\n * Concrete subclasses implement specific linear solvers.\n\n *\n\n */\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"lib/linalg/solver.hpp","rank":90,"score":85719.66516213119},{"content":"struct SolutionStatus {\n\n enum Status {\n\n CONVERGED,\n\n UNCONVERGED,\n\n UNKNOWN};\n\n};\n\n\n\n/** \\ingroup linalg\n\n * \\brief The base class for the Solution and BlockedSolution container classes.\n\n *\n\n * This class holds various information about the solution of a BEM computation. It derives from\n\n * <a href=\"http://trilinos.sandia.gov/packages/docs/r10.10/packages/thyra/doc/html/structThyra_1_1SolveStatus.html\">Thyra::SolveStatus</a>\n\n * if Trilinos is enabled.\n\n *\n\n * <tt>MagnitudeType</tt> is identical to <tt>float</tt> if <tt>ResultType</tt> is <tt>float</tt> or <tt>complex<float></tt>. It is double\n\n * if <tt>ResultType</tt> is <tt>double</tt> or <tt>complex<double></tt>\n\n */\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"lib/linalg/solution_base.hpp","rank":91,"score":85719.66516213119},{"content":"struct ChunkStatistics\n\n{\n\n ChunkStatistics() : valid(false) {}\n\n bool valid;\n\n size_t chunkStart;\n\n size_t chunkSize;\n\n tbb::tick_count startTime;\n\n tbb::tick_count endTime;\n\n};\n\n\n\n} // namespace Bempp\n\n\n\n#endif\n","file_path":"lib/common/chunk_statistics.hpp","rank":92,"score":85719.66516213119},{"content":"struct CreateOperator_3_I\n\n{\n\n BoundaryOperator<BasisFunctionType, ResultType> operator() (\n\n const shared_ptr<const Context<BasisFunctionType, ResultType> >& context,\n\n const shared_ptr<const Space<BasisFunctionType> >& domain,\n\n const shared_ptr<const Space<BasisFunctionType> >& range,\n\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange) const\n\n {\n\n return 3. * identityOperator<BasisFunctionType, ResultType>(\n\n context, domain, range, dualToRange);\n\n }\n\n};\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"tests/unit/assembly/test_joint_assembly.cpp","rank":93,"score":82900.41519583325},{"content":"struct MblockArrayConverter\n\n{\n\n static void convert(\n\n unsigned int n,\n\n const boost::shared_array<mblock<FromType> *>& in,\n\n boost::shared_array<mblock<ToType> *>& out) {\n\n out = allocateAhmedMblockArray<ToType>(n);\n\n copyH(n, in.get(), out.get());\n\n }\n\n};\n\n\n\ntemplate <typename Type>\n","file_path":"lib/assembly/sparse_to_h_matrix_converter.cpp","rank":94,"score":82900.41519583325},{"content":"struct UnitFunctor\n\n{\n\n typedef ValueType_ ValueType;\n\n typedef typename ScalarTraits<ValueType>::RealType CoordinateType;\n\n\n\n int argumentDimension() const { return 3; }\n\n int resultDimension() const { return 1; }\n\n\n\n void evaluate(const arma::Col<CoordinateType>& point,\n\n arma::Col<ValueType>& result) const {\n\n result(0) = 1.;\n\n }\n\n};\n\n\n","file_path":"tests/unit/linalg/laplace_3d_dirichlet_fixture.hpp","rank":95,"score":82900.41519583325},{"content":"struct ClusterConstructionHelper\n\n{\n\n typedef typename Fiber::ScalarTraits<BasisFunctionType>::RealType CoordinateType;\n\n typedef AhmedDofWrapper<CoordinateType> AhmedDofType;\n\n typedef ExtendedBemCluster<AhmedDofType> AhmedBemCluster;\n\n typedef bemblcluster<AhmedDofType, AhmedDofType> AhmedBemBlcluster;\n\n\n\n static void constructBemCluster(\n\n const Space<BasisFunctionType>& space,\n\n bool indexWithGlobalDofs,\n\n const AcaOptions& acaOptions,\n\n shared_ptr<AhmedBemCluster>& cluster,\n\n shared_ptr<IndexPermutation>& o2p,\n\n shared_ptr<IndexPermutation>& p2o);\n\n\n\n static std::auto_ptr<AhmedBemBlcluster>\n\n constructBemBlockCluster(\n\n const AcaOptions& acaOptions,\n\n bool symmetric,\n\n /* input parameter (effectively const */\n","file_path":"lib/assembly/cluster_construction_helper.hpp","rank":96,"score":82900.41519583325},{"content":"struct CreateOperator_I\n\n{\n\n BoundaryOperator<BasisFunctionType, ResultType> operator() (\n\n const shared_ptr<const Context<BasisFunctionType, ResultType> >& context,\n\n const shared_ptr<const Space<BasisFunctionType> >& domain,\n\n const shared_ptr<const Space<BasisFunctionType> >& range,\n\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange) const\n\n {\n\n return identityOperator<BasisFunctionType, ResultType>(\n\n context, domain, range, dualToRange);\n\n }\n\n};\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"tests/unit/assembly/test_joint_assembly.cpp","rank":97,"score":82900.41519583325},{"content":"struct CreateOperator_V\n\n{\n\n BoundaryOperator<BasisFunctionType, ResultType> operator() (\n\n const shared_ptr<const Context<BasisFunctionType, ResultType> >& context,\n\n const shared_ptr<const Space<BasisFunctionType> >& domain,\n\n const shared_ptr<const Space<BasisFunctionType> >& range,\n\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange) const\n\n {\n\n return laplace3dSingleLayerBoundaryOperator<BasisFunctionType, ResultType>(\n\n context, domain, range, dualToRange);\n\n }\n\n};\n\n\n\ntemplate <typename BasisFunctionType, typename ResultType>\n","file_path":"tests/unit/assembly/test_joint_assembly.cpp","rank":98,"score":81608.77726725866},{"content":"struct SparseToHMatrixConverter\n\n{\n\n typedef typename Fiber::ScalarTraits<ValueType>::RealType CoordinateType;\n\n typedef AhmedDofWrapper<CoordinateType> AhmedDofType;\n\n typedef bemblcluster<AhmedDofType, AhmedDofType> AhmedBemBlcluster;\n\n typedef mblock<typename AhmedTypeTraits<ValueType>::Type> AhmedMblock;\n\n\n\n static void constructHMatrix(\n\n int* rowOffsets, int* colIndices, double* values,\n\n std::vector<unsigned int>& domain_o2p,\n\n std::vector<unsigned int>& range_p2o,\n\n double eps,\n\n AhmedBemBlcluster* blockCluster,\n\n boost::shared_array<AhmedMblock*>& mblocks,\n\n int& maximumRank);\n\n};\n\n\n\n} // namespace Bempp\n\n\n\n#endif // WITH_AHMED\n\n\n\n#endif\n","file_path":"lib/assembly/sparse_to_h_matrix_converter.hpp","rank":99,"score":81608.77726725866}],"string":"[\n {\n \"content\": \"enum CallVariant\\n\\n{\\n\\n TEST_TRIAL = 0,\\n\\n TRIAL_TEST = 1\\n\\n};\\n\\n\\n\\ntypedef int LocalDofIndex;\\n\\nconst LocalDofIndex ALL_DOFS = -1;\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/fiber/types.hpp\",\n \"rank\": 0,\n \"score\": 187458.7934374725\n },\n {\n \"content\": \"enum GeometricalDataType\\n\\n{\\n\\n GLOBALS = 0x0001,\\n\\n INTEGRATION_ELEMENTS = 0x0002,\\n\\n NORMALS = 0x0004,\\n\\n JACOBIANS_TRANSPOSED = 0x0008,\\n\\n JACOBIAN_INVERSES_TRANSPOSED = 0x0010\\n\\n};\\n\\n\\n\\n/** \\\\cond FORWARD_DECL */\\n\\ntemplate <typename CoordinateType> class ConstGeometricalDataSlice;\\n\\n/** \\\\endcond */\\n\\n\\n\\ntemplate <typename CoordinateType>\\n\",\n \"file_path\": \"lib/fiber/geometrical_data.hpp\",\n \"rank\": 1,\n \"score\": 178588.53894853673\n },\n {\n \"content\": \"enum BasisDataType\\n\\n{\\n\\n VALUES = 0x0001,\\n\\n DERIVATIVES = 0x0002\\n\\n};\\n\\n\\n\\n/** \\\\cond FORWARD_DECL */\\n\\ntemplate <typename ValueType> class ConstBasisDataSlice;\\n\\n/** \\\\endcond */\\n\\n\\n\\ntemplate <typename ValueType>\\n\",\n \"file_path\": \"lib/fiber/basis_data.hpp\",\n \"rank\": 2,\n \"score\": 178588.5389485367\n },\n {\n \"content\": \"struct GetInfoHelper<Func, VECTOR_CLASS<char *> >\\n\\n{\\n\\n static cl_int\\n\\n get(Func f, cl_uint name, VECTOR_CLASS<char *>* param)\\n\\n {\\n\\n cl_uint err = f(name, param->size() * sizeof(char *), &(*param)[0], NULL);\\n\\n if (err != CL_SUCCESS) {\\n\\n return err;\\n\\n }\\n\\n \\n\\n return CL_SUCCESS;\\n\\n }\\n\\n};\\n\\n\\n\\n// Specialized GetInfoHelper for STRING_CLASS params\\n\\ntemplate <typename Func>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 3,\n \"score\": 176506.84658784064\n },\n {\n \"content\": \"struct MblockArrayConverter<Type, Type>\\n\\n{\\n\\n static void convert(\\n\\n unsigned int n,\\n\\n const boost::shared_array<mblock<Type> *>& in,\\n\\n boost::shared_array<mblock<Type> *>& out) {\\n\\n out = in;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename ValueType>\\n\\nvoid SparseToHMatrixConverter<ValueType>::constructHMatrix(\\n\\n int* rowOffsets, int* colIndices, double* values,\\n\\n std::vector<unsigned int>& domain_o2p,\\n\\n std::vector<unsigned int>& range_p2o,\\n\\n double eps,\\n\\n bemblcluster<AhmedDofType, AhmedDofType>* blockCluster,\\n\\n boost::shared_array<AhmedMblock*>& mblocks,\\n\\n int& maximumRank)\\n\\n{\\n\",\n \"file_path\": \"lib/assembly/sparse_to_h_matrix_converter.cpp\",\n \"rank\": 4,\n \"score\": 170064.80276353093\n },\n {\n \"content\": \"struct GetInfoHelper<Func, CPP_TYPE> \\\\\\n\\n{ \\\\\\n\\n static cl_int get(Func f, cl_uint name, CPP_TYPE* param) \\\\\\n\\n { \\\\\\n\\n cl_uint err = f(name, sizeof(CPP_TYPE), param, NULL); \\\\\\n\\n if (err != CL_SUCCESS) { \\\\\\n\\n return err; \\\\\\n\\n } \\\\\\n\\n \\\\\\n\\n return ReferenceHandler<CPP_TYPE::cl_type>::retain((*param)()); \\\\\\n\\n } \\\\\\n\\n}; \\\\\\n\\n} \\n\\n\\n\\n\\n\\n#define __PARAM_NAME_INFO_1_0(F) \\\\\\n\\n F(cl_platform_info, CL_PLATFORM_PROFILE, STRING_CLASS) \\\\\\n\\n F(cl_platform_info, CL_PLATFORM_VERSION, STRING_CLASS) \\\\\\n\\n F(cl_platform_info, CL_PLATFORM_NAME, STRING_CLASS) \\\\\\n\\n F(cl_platform_info, CL_PLATFORM_VENDOR, STRING_CLASS) \\\\\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 5,\n \"score\": 157411.51858549006\n },\n {\n \"content\": \"struct PiecewiseLinearContinuousScalarBasisTraits<4, CoordinateType, ValueType>\\n\\n{\\n\\npublic:\\n\\n typedef Dune::Q1LocalBasis<CoordinateType, ValueType, 2> DuneBasis;\\n\\n};\\n\\n\\n\\ntemplate <int elementVertexCount, typename ValueType>\\n\",\n \"file_path\": \"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp\",\n \"rank\": 6,\n \"score\": 148248.23237424754\n },\n {\n \"content\": \"struct PiecewiseLinearContinuousScalarBasisTraits<2, CoordinateType, ValueType>\\n\\n{\\n\\npublic:\\n\\n typedef Dune::Q1LocalBasis<CoordinateType, ValueType, 1> DuneBasis;\\n\\n};\\n\\n\\n\\n// Triangle\\n\\ntemplate <typename CoordinateType, typename ValueType>\\n\",\n \"file_path\": \"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp\",\n \"rank\": 7,\n \"score\": 148248.23237424754\n },\n {\n \"content\": \"struct PiecewiseLinearContinuousScalarBasisTraits<3, CoordinateType, ValueType>\\n\\n{\\n\\npublic:\\n\\n typedef Dune::P1LocalBasis<CoordinateType, ValueType, 2> DuneBasis;\\n\\n};\\n\\n\\n\\n// Quadrilateral\\n\\ntemplate <typename CoordinateType, typename ValueType>\\n\",\n \"file_path\": \"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp\",\n \"rank\": 8,\n \"score\": 148248.23237424754\n },\n {\n \"content\": \"enum DofType\\n\\n{\\n\\n GLOBAL_DOFS, FLAT_LOCAL_DOFS\\n\\n};\\n\\n\\n\\n/** \\\\ingroup space\\n\\n * \\\\brief Function space.\\n\\n *\\n\\n * This class represents a space of functions defined on a grid. The space is\\n\\n * spanned by a finite number of scalar- or vector-valued basis functions. The\\n\\n * template parameter \\\\p BasisFunctionType is the type of the values of (the\\n\\n * components of) these basis functions, and can be set to \\\\c float,\\n\\n * \\\\c double, <tt>std::complex<float></tt> or <tt>std::complex<double></tt>.\\n\\n *\\n\\n * The basis functions of a space, also known as global degrees of freedom\\n\\n * (DOFs), can have support extending over multiple elements of the grid. They\\n\\n * are, however, composed of one or more *local* basis functions (local\\n\\n * degrees of freedom), each of which resides on a single element. The mapping\\n\\n * of local to global degrees of freedom is triggered by calling the function\\n\\n * assignDofs(). Many other member functions of Space may only be invoked after\\n\\n * assignDofs() has beeen called. */\\n\\ntemplate <typename BasisFunctionType>\\n\",\n \"file_path\": \"lib/space/space.hpp\",\n \"rank\": 9,\n \"score\": 139015.70472538922\n },\n {\n \"content\": \"struct LocalDof\\n\\n{\\n\\n LocalDof() {}\\n\\n LocalDof(EntityIndex ei, LocalDofIndex ldi) :\\n\\n entityIndex(ei), dofIndex(ldi) {\\n\\n }\\n\\n\\n\\n EntityIndex entityIndex;\\n\\n LocalDofIndex dofIndex;\\n\\n};\\n\\n\\n\\ntemplate <typename ValueType>\\n\",\n \"file_path\": \"lib/common/types.hpp\",\n \"rank\": 10,\n \"score\": 138052.9799339606\n },\n {\n \"content\": \"struct Point3D\\n\\n{\\n\\n ValueType x, y, z;\\n\\n};\\n\\n\\n\\n} // namespace Bempp\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/common/types.hpp\",\n \"rank\": 11,\n \"score\": 138052.9799339606\n },\n {\n \"content\": \"#define __DECLARE_PARAM_TRAITS(token, param_name, T) \\\\\\n\\nstruct token; \\\\\\n\\ntemplate<> \\\\\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 12,\n \"score\": 135711.0531631047\n },\n {\n \"content\": \"struct Equal\\n\\n{\\n\\n bool operator()(const std::pair<double, QuadratureOptions>& first,\\n\\n const std::pair<double, QuadratureOptions>& second) const\\n\\n {\\n\\n return first.first == second.first;\\n\\n }\\n\\n};\\n\\n\\n\\n} // namespace\\n\\n\\n\\nAccuracyOptionsEx::AccuracyOptionsEx()\\n\\n{\\n\\n m_doubleRegular.push_back(std::make_pair(std::numeric_limits<double>::infinity(),\\n\\n QuadratureOptions()));\\n\\n}\\n\\n\\n\\nAccuracyOptionsEx::AccuracyOptionsEx(const AccuracyOptions& oldStyleOpts)\\n\\n{\\n\\n m_singleRegular = oldStyleOpts.singleRegular;\\n\",\n \"file_path\": \"lib/fiber/accuracy_options.cpp\",\n \"rank\": 13,\n \"score\": 135705.18754253467\n },\n {\n \"content\": \"struct Coercion\\n\\n{\\n\\n // If you get a compilation error here, chances are that you are trying to\\n\\n // mix floating-point numbers with different precisions (e.g. float and\\n\\n // double or std::complex<float> and double). BEM++ does not support this.\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 14,\n \"score\": 135705.18754253467\n },\n {\n \"content\": \"struct LessOrEqual\\n\\n{\\n\\n bool operator()(const std::pair<double, QuadratureOptions>& first,\\n\\n const std::pair<double, QuadratureOptions>& second) const\\n\\n {\\n\\n return first.first <= second.first;\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"lib/fiber/accuracy_options.cpp\",\n \"rank\": 15,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct ReferenceHandler\\n\\n{ };\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 16,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct GeometricalData\\n\\n{\\n\\n arma::Mat<CoordinateType> globals;\\n\\n arma::Row<CoordinateType> integrationElements;\\n\\n arma::Cube<CoordinateType> jacobiansTransposed;\\n\\n arma::Cube<CoordinateType> jacobianInversesTransposed;\\n\\n arma::Mat<CoordinateType> normals;\\n\\n\\n\\n // For the time being, I (somewhat dangerously) assume that\\n\\n // integrationElements or globals or normals are always used\\n\\n int pointCount() const {\\n\\n int result = std::max(std::max(globals.n_cols, normals.n_cols),\\n\\n integrationElements.n_cols);\\n\\n assert(result > 0);\\n\\n return result;\\n\\n }\\n\\n\\n\\n int dimWorld() const {\\n\\n int result = std::max(globals.n_rows, normals.n_rows);\\n\\n assert(result > 0);\\n\\n return result;\\n\\n }\\n\\n\\n\\n ConstGeometricalDataSlice<CoordinateType> const_slice(int point) const {\\n\\n return ConstGeometricalDataSlice<CoordinateType>(*this, point);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename CoordinateType>\\n\",\n \"file_path\": \"lib/fiber/geometrical_data.hpp\",\n \"rank\": 17,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct AccuracyOptions\\n\\n{\\n\\npublic:\\n\\n /** \\\\brief Options controlling integration of regular functions\\n\\n * on single elements. */\\n\\n QuadratureOptions singleRegular;\\n\\n /** \\\\brief Options controlling integration of regular functions\\n\\n * on pairs of elements. */\\n\\n QuadratureOptions doubleRegular;\\n\\n /** \\\\brief Options controlling integration of singular functions\\n\\n * on pairs of elements. */\\n\\n QuadratureOptions doubleSingular;\\n\\n};\\n\\n\\n\\n/** \\\\brief New-style options controlling quadrature accuracy. */\\n\",\n \"file_path\": \"lib/fiber/accuracy_options.hpp\",\n \"rank\": 18,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct VerbosityLevel {\\n\\n enum Level {\\n\\n DEFAULT = 0,\\n\\n HIGH = 5,\\n\\n LOW = -5\\n\\n };\\n\\n};\\n\\n\\n\\n} // namespace Fiber\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/fiber/verbosity_level.hpp\",\n \"rank\": 19,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct ScalarTraits\\n\\n{\\n\\n // If you get a compilation error here, you are probably trying to use an\\n\\n // unsupported floating-point type. The supported types are: float, double,\\n\\n // std::complex<float> and std::complex<double>.\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 20,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct param_traits {};\\n\\n\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 21,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct QuadraturePoint\\n\\n{\\n\\n\\tdouble coords[NUM_COORDS];\\n\\n\\tdouble quadrature_weight;\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\n/**\\n\\n * @ingroup quadrature\\n\\n *\\n\\n * The QuadratureRule object is a non specialzed template class for all\\n\\n * different @p QUADRATURE_RULES and @p ELEMENT_SHAPES (e.g. GAUSS for\\n\\n * TRIANGLES). \\n\\n * @tparam ELEMENT_SHAPE \\n\\n * @tparam QUADRATURE_RULE\\n\\n */\\n\\ntemplate<ELEMENT_SHAPE SHAPE, QUADRATURE_RULE RULE>\\n\",\n \"file_path\": \"lib/fiber/quadrature/quadrature.hpp\",\n \"rank\": 22,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct BasisData\\n\\n{\\n\\n // values(i,k,l) = (f_k)_i(x_l) ->\\n\\n // ith component of kth basis function at lth point\\n\\n _3dArray<ValueType> values;\\n\\n // derivatives(i,j,k,l) = (d_j (f_k)_i)(x_l) ->\\n\\n // derivative in direction j of ith component of kth basis function at lth point\\n\\n _4dArray<ValueType> derivatives;\\n\\n\\n\\n int componentCount() const {\\n\\n return std::max<int>(values.extent(0), derivatives.extent(0));\\n\\n }\\n\\n\\n\\n int functionCount() const {\\n\\n return std::max<int>(values.extent(1), derivatives.extent(2));\\n\\n }\\n\\n\\n\\n int pointCount() const {\\n\\n return std::max<int>(values.extent(2), derivatives.extent(3));\\n\\n }\\n\\n\\n\\n ConstBasisDataSlice<ValueType> const_slice(int function, int point) const {\\n\\n return ConstBasisDataSlice<ValueType>(*this, function, point);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename ValueType>\\n\",\n \"file_path\": \"lib/fiber/basis_data.hpp\",\n \"rank\": 23,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"struct null_deleter\\n\\n{\\n\\n void operator() (const void*) const {\\n\\n }\\n\\n};\\n\\n\\n\\n/** \\\\brief Create a shared pointer from a reference to an object allocated on stack.\\n\\n\\n\\nThe object will not be deleted when the shared pointer goes out of scope. */\\n\\ntemplate <typename T>\\n\\ninline shared_ptr<T> make_shared_from_ref(T& t)\\n\\n{\\n\\n return shared_ptr<T>(&t, null_deleter());\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\\ninline shared_ptr<const T> make_shared_from_const_ref(const T& t)\\n\\n{\\n\\n return shared_ptr<const T>(&t, null_deleter());\\n\\n}\\n\\n\\n\\n} // namespace Fiber\\n\\n\\n\\n#endif // fiber_shared_ptr_hpp\\n\",\n \"file_path\": \"lib/fiber/shared_ptr.hpp\",\n \"rank\": 24,\n \"score\": 132687.71270744532\n },\n {\n \"content\": \"enum SpaceType { \\n\\n PIECEWISE_CONSTANTS,\\n\\n PIECEWISE_LINEARS\\n\\n};\\n\\n\\n\\ntemplate <typename BFT, typename RT>\\n\",\n \"file_path\": \"tests/unit/linalg/laplace_3d_dirichlet_fixture.hpp\",\n \"rank\": 25,\n \"score\": 130263.31381397537\n },\n {\n \"content\": \"struct GetInfoFunctor1\\n\\n{\\n\\n Func f_; const Arg0& arg0_; const Arg1& arg1_;\\n\\n cl_int operator ()(\\n\\n cl_uint param, ::size_t size, void* value, ::size_t* size_ret)\\n\\n { return f_(arg0_, arg1_, param, size, value, size_ret); }\\n\\n};\\n\\n\\n\\ntemplate <typename Func, typename Arg0, typename T>\\n\\ninline cl_int\\n\\ngetInfo(Func f, const Arg0& arg0, cl_uint name, T* param)\\n\\n{\\n\\n GetInfoFunctor0<Func, Arg0> f0 = { f, arg0 };\\n\\n return GetInfoHelper<GetInfoFunctor0<Func, Arg0>, T>\\n\\n ::get(f0, name, param);\\n\\n}\\n\\n\\n\\ntemplate <typename Func, typename Arg0, typename Arg1, typename T>\\n\\ninline cl_int\\n\\ngetInfo(Func f, const Arg0& arg0, const Arg1& arg1, cl_uint name, T* param)\\n\\n{\\n\\n GetInfoFunctor1<Func, Arg0, Arg1> f0 = { f, arg0, arg1 };\\n\\n return GetInfoHelper<GetInfoFunctor1<Func, Arg0, Arg1>, T>\\n\\n ::get(f0, name, param);\\n\\n}\\n\\n\\n\\ntemplate<typename T>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 26,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct LocalSpaceArg\\n\\n{\\n\\n ::size_t size_;\\n\\n};\\n\\n\\n\\nnamespace detail {\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 27,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct KernelArgumentHandler\\n\\n{\\n\\n static ::size_t size(const T&) { return sizeof(T); }\\n\\n static T* ptr(T& value) { return &value; }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 28,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct DoubleQuadratureDescriptor\\n\\n{\\n\\n ElementPairTopology topology;\\n\\n int testOrder;\\n\\n int trialOrder;\\n\\n\\n\\n bool operator<(const DoubleQuadratureDescriptor& other) const {\\n\\n using boost::tuples::make_tuple;\\n\\n return make_tuple(topology, testOrder, trialOrder) <\\n\\n make_tuple(other.topology, other.testOrder, other.trialOrder);\\n\\n }\\n\\n\\n\\n bool operator==(const DoubleQuadratureDescriptor& other) const {\\n\\n return topology == other.topology &&\\n\\n testOrder == other.testOrder &&\\n\\n trialOrder == other.trialOrder;\\n\\n }\\n\\n\\n\\n bool operator!=(const DoubleQuadratureDescriptor& other) const {\\n\\n return !operator==(other);\\n\",\n \"file_path\": \"lib/fiber/numerical_quadrature.hpp\",\n \"rank\": 29,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct OpenClOptions\\n\\n{\\n\\n OpenClOptions ()\\n\\n {\\n\\n useOpenCl = true;\\n\\n }\\n\\n\\n\\n bool useOpenCl;\\n\\n // add more as required\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/fiber/opencl_options.hpp\",\n \"rank\": 30,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct GetInfoFunctor0\\n\\n{\\n\\n Func f_; const Arg0& arg0_;\\n\\n cl_int operator ()(\\n\\n cl_uint param, ::size_t size, void* value, ::size_t* size_ret)\\n\\n { return f_(arg0_, param, size, value, size_ret); }\\n\\n};\\n\\n\\n\\ntemplate <typename Func, typename Arg0, typename Arg1>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 31,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct GetInfoHelper\\n\\n{\\n\\n static cl_int\\n\\n get(Functor f, cl_uint name, T* param)\\n\\n {\\n\\n return f(name, sizeof(T), param, NULL);\\n\\n }\\n\\n};\\n\\n\\n\\n// Specialized GetInfoHelper for VECTOR_CLASS params\\n\\ntemplate <typename Func, typename T>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 32,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct SingleQuadratureDescriptor\\n\\n{\\n\\n int vertexCount;\\n\\n int order;\\n\\n\\n\\n bool operator<(const SingleQuadratureDescriptor& other) const {\\n\\n return std::make_pair(vertexCount, order) <\\n\\n std::make_pair(other.vertexCount, other.order);\\n\\n }\\n\\n\\n\\n bool operator==(const SingleQuadratureDescriptor& other) const {\\n\\n return vertexCount == other.vertexCount &&\\n\\n order == other.order;\\n\\n }\\n\\n\\n\\n bool operator!=(const SingleQuadratureDescriptor& other) const {\\n\\n return !operator==(other);\\n\\n }\\n\\n\\n\\n friend std::ostream&\\n\",\n \"file_path\": \"lib/fiber/numerical_quadrature.hpp\",\n \"rank\": 33,\n \"score\": 129848.56585107828\n },\n {\n \"content\": \"struct AhmedTypeTraits\\n\\n{\\n\\n typedef T Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/assembly/ahmed_aux_fwd.hpp\",\n \"rank\": 34,\n \"score\": 129318.03197259083\n },\n {\n \"content\": \"struct PointTraits<5>\\n\\n{\\ttypedef Mat<double,5,1> point_type; };\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"lib/fiber/quadrature/mat.hpp\",\n \"rank\": 35,\n \"score\": 127723.91219135188\n },\n {\n \"content\": \"struct PointTraits<4>\\n\\n{\\ttypedef Mat<double,4,1> point_type; };\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"lib/fiber/quadrature/mat.hpp\",\n \"rank\": 36,\n \"score\": 127723.91219135188\n },\n {\n \"content\": \"struct PointTraits<2>\\n\\n{\\ttypedef Mat<double,2,1> point_type; };\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"lib/fiber/quadrature/mat.hpp\",\n \"rank\": 37,\n \"score\": 127723.91219135188\n },\n {\n \"content\": \"struct PointTraits<6>\\n\\n{\\ttypedef Mat<double,6,1> point_type; };\\n\\n//@}\\n\\n\\n\\n\\n\\n//////////////////////////////////////////////////////////////////////\\n\\n// OUTPUT ////////////////////////////////////////////////////////\\n\\n//////////////////////////////////////////////////////////////////////\\n\\n\\n\\n/**\\n\\n * overloading output operator.\\n\\n * @tparam T value_type\\n\\n * @tparam NUM_ROWS number of rows\\n\\n * @tparam NUM_COLS number of colums\\n\\n * @param[out] out output-stream\\n\\n * @param[in] m mat to write\\n\\n */\\n\\ntemplate<typename T, int NUM_ROWS, int NUM_COLS>\\n\\nstd::ostream& operator << (std::ostream& out,\\n\\n const Mat<T,NUM_ROWS,NUM_COLS>& m)\\n\",\n \"file_path\": \"lib/fiber/quadrature/mat.hpp\",\n \"rank\": 38,\n \"score\": 127723.91219135188\n },\n {\n \"content\": \"struct PointTraits<1>\\n\\n{\\ttypedef Mat<double,1,1> point_type; };\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"lib/fiber/quadrature/mat.hpp\",\n \"rank\": 39,\n \"score\": 127723.91219135188\n },\n {\n \"content\": \"struct PointTraits<3>\\n\\n{\\ttypedef Mat<double,3,1> point_type; };\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"lib/fiber/quadrature/mat.hpp\",\n \"rank\": 40,\n \"score\": 127723.91219135188\n },\n {\n \"content\": \"struct QuadratureOptions;\\n\\ntemplate <typename ValueType> class Basis;\\n\\ntemplate <typename CoordinateType> class CollectionOfBasisTransformations;\\n\\ntemplate <typename ValueType> class CollectionOfKernels;\\n\\ntemplate <typename BasisFunctionType, typename KernelType, typename ResultType>\\n\",\n \"file_path\": \"lib/fiber/default_evaluator_for_integral_operators.hpp\",\n \"rank\": 42,\n \"score\": 127172.39233947435\n },\n {\n \"content\": \"struct ScalarTraits<double>\\n\\n{\\n\\n typedef double RealType;\\n\\n typedef std::complex<double> ComplexType;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 43,\n \"score\": 124884.76533498483\n },\n {\n \"content\": \"struct ScalarTraits<float>\\n\\n{\\n\\n typedef float RealType;\\n\\n typedef std::complex<float> ComplexType;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 44,\n \"score\": 124884.76533498483\n },\n {\n \"content\": \"struct IdentityOperator<BasisFunctionType, ResultType>::Impl\\n\\n{\\n\\n typedef Fiber::ScalarFunctionValueFunctor<CoordinateType>\\n\\n TransformationFunctor;\\n\\n\\n\\n Impl() : transformations(TransformationFunctor())\\n\\n {}\\n\\n\\n\\n Fiber::DefaultCollectionOfBasisTransformations<TransformationFunctor>\\n\\n transformations;\\n\\n};\\n\\n/** \\\\endcond */\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\\nIdentityOperator<BasisFunctionType, ResultType>::IdentityOperator(\\n\\n const shared_ptr<const Space<BasisFunctionType> >& domain,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& range,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange,\\n\\n const std::string& label,\\n\\n int symmetry) :\\n\",\n \"file_path\": \"lib/assembly/identity_operator.cpp\",\n \"rank\": 45,\n \"score\": 122233.81001526414\n },\n {\n \"content\": \"struct ReferenceHandler<cl_mem>\\n\\n{\\n\\n static cl_int retain(cl_mem memory)\\n\\n { return ::clRetainMemObject(memory); }\\n\\n static cl_int release(cl_mem memory)\\n\\n { return ::clReleaseMemObject(memory); }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 46,\n \"score\": 122208.5918233809\n },\n {\n \"content\": \"struct ReferenceHandler<cl_kernel>\\n\\n{\\n\\n static cl_int retain(cl_kernel kernel)\\n\\n { return ::clRetainKernel(kernel); }\\n\\n static cl_int release(cl_kernel kernel)\\n\\n { return ::clReleaseKernel(kernel); }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 47,\n \"score\": 122208.5918233809\n },\n {\n \"content\": \"struct ReferenceHandler<cl_context>\\n\\n{\\n\\n static cl_int retain(cl_context context)\\n\\n { return ::clRetainContext(context); }\\n\\n static cl_int release(cl_context context)\\n\\n { return ::clReleaseContext(context); }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 48,\n \"score\": 122208.5918233809\n },\n {\n \"content\": \"struct ReferenceHandler<cl_sampler>\\n\\n{\\n\\n static cl_int retain(cl_sampler sampler)\\n\\n { return ::clRetainSampler(sampler); }\\n\\n static cl_int release(cl_sampler sampler)\\n\\n { return ::clReleaseSampler(sampler); }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 49,\n \"score\": 122208.5918233809\n },\n {\n \"content\": \"struct ReferenceHandler<cl_event>\\n\\n{\\n\\n static cl_int retain(cl_event event)\\n\\n { return ::clRetainEvent(event); }\\n\\n static cl_int release(cl_event event)\\n\\n { return ::clReleaseEvent(event); }\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 50,\n \"score\": 122208.5918233809\n },\n {\n \"content\": \"struct ReferenceHandler<cl_program>\\n\\n{\\n\\n static cl_int retain(cl_program program)\\n\\n { return ::clRetainProgram(program); }\\n\\n static cl_int release(cl_program program)\\n\\n { return ::clReleaseProgram(program); }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 51,\n \"score\": 122208.5918233809\n },\n {\n \"content\": \"struct Coercion<double, double>\\n\\n{\\n\\n typedef double Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 52,\n \"score\": 121106.41598731262\n },\n {\n \"content\": \"struct Coercion<float, float>\\n\\n{\\n\\n typedef float Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 53,\n \"score\": 121106.41598731262\n },\n {\n \"content\": \"struct generate_test_case_4_num_type {\\n\\n explicit generate_test_case_4_num_type( const_string tc_name, Generator& G )\\n\\n : m_test_case_name( tc_name )\\n\\n , m_holder( G )\\n\\n {}\\n\\n\\n\\n template<typename TestType>\\n\\n void operator()( mpl::identity<TestType> ) {\\n\\n std::string full_name;\\n\\n assign_op( full_name, m_test_case_name, 0 );\\n\\n\\n\\n // This is the essential fragment changed wrt. boost_test_case_template.hpp\\n\\n std::stringstream sstream;\\n\\n sstream << full_name;\\n\\n sstream << '<';\\n\\n sstream << TestType::value;\\n\\n sstream << '>';\\n\\n full_name = sstream.str();\\n\\n\\n\\n m_holder.m_test_cases.push_back(\\n\",\n \"file_path\": \"tests/unit/boost_test_case_num_template.hpp\",\n \"rank\": 54,\n \"score\": 119770.36071084044\n },\n {\n \"content\": \"struct ReferenceHandler<cl_command_queue>\\n\\n{\\n\\n static cl_int retain(cl_command_queue queue)\\n\\n { return ::clRetainCommandQueue(queue); }\\n\\n static cl_int release(cl_command_queue queue)\\n\\n { return ::clReleaseCommandQueue(queue); }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 55,\n \"score\": 119681.75062069544\n },\n {\n \"content\": \"struct ReferenceHandler<cl_device_id>\\n\\n{\\n\\n // cl_device_id does not have retain().\\n\\n static cl_int retain(cl_device_id)\\n\\n { return CL_INVALID_DEVICE; }\\n\\n // cl_device_id does not have release().\\n\\n static cl_int release(cl_device_id)\\n\\n { return CL_INVALID_DEVICE; }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 56,\n \"score\": 119681.75062069544\n },\n {\n \"content\": \"struct ReferenceHandler<cl_platform_id>\\n\\n{\\n\\n // cl_platform_id does not have retain().\\n\\n static cl_int retain(cl_platform_id)\\n\\n { return CL_INVALID_PLATFORM; }\\n\\n // cl_platform_id does not have release().\\n\\n static cl_int release(cl_platform_id)\\n\\n { return CL_INVALID_PLATFORM; }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 57,\n \"score\": 119681.75062069544\n },\n {\n \"content\": \"struct DefaultDirectSolver<BasisFunctionType, ResultType>::Impl\\n\\n{\\n\\n Impl(const BoundaryOperator<BasisFunctionType, ResultType>& op_) :\\n\\n op(op_)\\n\\n {\\n\\n }\\n\\n\\n\\n Impl(const BlockedBoundaryOperator<BasisFunctionType, ResultType>& op_) :\\n\\n op(op_)\\n\\n {\\n\\n }\\n\\n \\n\\n boost::variant<\\n\\n BoundaryOperator<BasisFunctionType, ResultType>,\\n\\n BlockedBoundaryOperator<BasisFunctionType, ResultType> > op;\\n\\n};\\n\\n\\n\\n/** \\\\endcond */\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"lib/linalg/default_direct_solver.cpp\",\n \"rank\": 58,\n \"score\": 118338.21758936445\n },\n {\n \"content\": \"struct DefaultIterativeSolver<BasisFunctionType, ResultType>::Impl\\n\\n{\\n\\n\\n\\n // Constructor for non-blocked operators\\n\\n Impl(const BoundaryOperator<BasisFunctionType, ResultType>& op_,\\n\\n ConvergenceTestMode::Mode mode_) :\\n\\n op(op_),\\n\\n mode(mode_)\\n\\n {\\n\\n typedef BoundaryOperator<BasisFunctionType, ResultType> BoundaryOp;\\n\\n typedef Solver<BasisFunctionType, ResultType> Solver_;\\n\\n const BoundaryOp& boundaryOp = boost::get<BoundaryOp>(op);\\n\\n if (!boundaryOp.isInitialized())\\n\\n throw std::invalid_argument(\\\"DefaultIterativeSolver::Impl::Impl(): \\\"\\n\\n \\\"boundary operator must be initialized\\\");\\n\\n\\n\\n if (mode == ConvergenceTestMode::TEST_CONVERGENCE_IN_DUAL_TO_RANGE) {\\n\\n if (boundaryOp.domain()->globalDofCount() !=\\n\\n boundaryOp.dualToRange()->globalDofCount())\\n\\n throw std::invalid_argument(\\\"DefaultIterativeSolver::Impl::Impl(): \\\"\\n\",\n \"file_path\": \"lib/linalg/default_iterative_solver.cpp\",\n \"rank\": 59,\n \"score\": 118338.21758936445\n },\n {\n \"content\": \"struct KernelArgumentHandler<LocalSpaceArg>\\n\\n{\\n\\n static ::size_t size(const LocalSpaceArg& value) { return value.size_; }\\n\\n static void* ptr(LocalSpaceArg&) { return NULL; }\\n\\n};\\n\\n\\n\\n} \\n\\n//! \\\\endcond\\n\\n\\n\\ninline LocalSpaceArg\\n\\n__local(::size_t size)\\n\\n{\\n\\n LocalSpaceArg ret = { size };\\n\\n return ret;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 60,\n \"score\": 117292.08172787684\n },\n {\n \"content\": \"struct PiecewiseLinearContinuousScalarBasisTraits\\n\\n{\\n\\n};\\n\\n\\n\\n// Line\\n\\ntemplate <typename CoordinateType, typename ValueType>\\n\",\n \"file_path\": \"lib/fiber/piecewise_linear_continuous_scalar_basis.hpp\",\n \"rank\": 61,\n \"score\": 115806.6218329503\n },\n {\n \"content\": \"struct CompareSharedPtrsToConstAbstractBoundaryOperatorIds\\n\\n{\\n\\n bool operator()(const shared_ptr<const Bempp::AbstractBoundaryOperatorId>& a,\\n\\n const shared_ptr<const Bempp::AbstractBoundaryOperatorId>& b) const {\\n\\n return *a == *b;\\n\\n }\\n\\n};\\n\\n\\n\\n} // namespace\\n\\n\\n\\n/** \\\\cond PRIVATE */\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"lib/assembly/discrete_boundary_operator_cache.cpp\",\n \"rank\": 62,\n \"score\": 115753.89266808578\n },\n {\n \"content\": \"struct ScalarSpace<BasisFunctionType>::Impl\\n\\n{\\n\\n typedef Fiber::ScalarFunctionValueFunctor<CoordinateType>\\n\\n TransformationFunctor;\\n\\n\\n\\n Impl() : transformations(TransformationFunctor())\\n\\n {}\\n\\n\\n\\n Fiber::DefaultCollectionOfBasisTransformations<TransformationFunctor>\\n\\n transformations;\\n\\n};\\n\\n/** \\\\endcond */\\n\\n\\n\\ntemplate <typename BasisFunctionType>\\n\\nScalarSpace<BasisFunctionType>::ScalarSpace(const shared_ptr<const Grid>& grid) :\\n\\n Base(grid), m_impl(new Impl)\\n\\n{\\n\\n}\\n\\n\\n\\ntemplate <typename BasisFunctionType>\\n\",\n \"file_path\": \"lib/space/scalar_space.cpp\",\n \"rank\": 63,\n \"score\": 115542.89364328989\n },\n {\n \"content\": \"struct DiscreteBoundaryOperatorCache<BasisFunctionType, ResultType>::Impl\\n\\n{\\n\\n typedef tbb::concurrent_unordered_map<shared_ptr<const AbstractBoundaryOperatorId>,\\n\\n boost::weak_ptr<const DiscreteBoundaryOperator<ResultType> >,\\n\\n tbb::tbb_hash<shared_ptr<const AbstractBoundaryOperatorId> >,\\n\\n CompareSharedPtrsToConstAbstractBoundaryOperatorIds >\\n\\n DiscreteBoundaryOperatorMap;\\n\\n\\n\\n mutable DiscreteBoundaryOperatorMap discreteOps;\\n\\n};\\n\\n/** \\\\endcond */\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\\nDiscreteBoundaryOperatorCache<BasisFunctionType, ResultType>::\\n\\nDiscreteBoundaryOperatorCache() :\\n\\n m_impl(new Impl)\\n\\n{\\n\\n}\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"lib/assembly/discrete_boundary_operator_cache.cpp\",\n \"rank\": 64,\n \"score\": 114752.7180302841\n },\n {\n \"content\": \"struct ImageFormat : public cl_image_format\\n\\n{\\n\\n ImageFormat(){}\\n\\n\\n\\n ImageFormat(cl_channel_order order, cl_channel_type type)\\n\\n {\\n\\n image_channel_order = order;\\n\\n image_channel_data_type = type;\\n\\n }\\n\\n\\n\\n ImageFormat& operator = (const ImageFormat& rhs)\\n\\n {\\n\\n if (this != &rhs) {\\n\\n this->image_channel_data_type = rhs.image_channel_data_type;\\n\\n this->image_channel_order = rhs.image_channel_order;\\n\\n }\\n\\n return *this;\\n\\n }\\n\\n};\\n\\n\\n\\n/*! \\\\class Device\\n\\n * \\\\brief Device interface for cl_device_id.\\n\\n */\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 65,\n \"score\": 113513.73238020463\n },\n {\n \"content\": \"struct GetInfoHelper<Func, STRING_CLASS>\\n\\n{\\n\\n static cl_int get(Func f, cl_uint name, STRING_CLASS* param)\\n\\n {\\n\\n ::size_t required;\\n\\n cl_int err = f(name, 0, NULL, &required);\\n\\n if (err != CL_SUCCESS) {\\n\\n return err;\\n\\n }\\n\\n\\n\\n char* value = (char*) alloca(required);\\n\\n err = f(name, required, value, NULL);\\n\\n if (err != CL_SUCCESS) {\\n\\n return err;\\n\\n }\\n\\n\\n\\n *param = value;\\n\\n return CL_SUCCESS;\\n\\n }\\n\\n};\\n\\n\\n\\n#define __GET_INFO_HELPER_WITH_RETAIN(CPP_TYPE) \\\\\\n\\nnamespace detail { \\\\\\n\\ntemplate <typename Func> \\\\\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 66,\n \"score\": 113513.73238020463\n },\n {\n \"content\": \"struct ScalarTraits<std::complex<double> >\\n\\n{\\n\\n typedef double RealType;\\n\\n typedef std::complex<double> ComplexType;\\n\\n};\\n\\n\\n\\n/** \\\\brief \\\"Larger\\\" of the types U and V. */\\n\\ntemplate <typename U, typename V>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 67,\n \"score\": 112931.13986015916\n },\n {\n \"content\": \"struct ScalarTraits<std::complex<float> >\\n\\n{\\n\\n typedef float RealType;\\n\\n typedef std::complex<float> ComplexType;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 68,\n \"score\": 112931.13986015916\n },\n {\n \"content\": \"struct param_traits<detail:: token,param_name> \\\\\\n\\n{ \\\\\\n\\n enum { value = param_name }; \\\\\\n\\n typedef T param_type; \\\\\\n\\n};\\n\\n\\n\\n__PARAM_NAME_INFO_1_0(__DECLARE_PARAM_TRAITS);\\n\\n#if defined(CL_VERSION_1_1)\\n\\n__PARAM_NAME_INFO_1_1(__DECLARE_PARAM_TRAITS);\\n\\n#endif // CL_VERSION_1_1\\n\\n\\n\\n#if defined(USE_CL_DEVICE_FISSION)\\n\\n__PARAM_NAME_DEVICE_FISSION(__DECLARE_PARAM_TRAITS);\\n\\n#endif // USE_CL_DEVICE_FISSION\\n\\n\\n\\n#undef __DECLARE_PARAM_TRAITS\\n\\n\\n\\n// Convenience functions\\n\\n\\n\\ntemplate <typename Func, typename T>\\n\\ninline cl_int\\n\\ngetInfo(Func f, cl_uint name, T* param)\\n\\n{\\n\\n return GetInfoHelper<Func, T>::get(f, name, param);\\n\\n}\\n\\n\\n\\ntemplate <typename Func, typename Arg0>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 69,\n \"score\": 110541.47096734055\n },\n {\n \"content\": \"struct Coercion<double, std::complex<double> >\\n\\n{\\n\\n typedef std::complex<double> Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 70,\n \"score\": 110531.87024296448\n },\n {\n \"content\": \"struct Coercion<float, std::complex<float> >\\n\\n{\\n\\n typedef std::complex<float> Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 71,\n \"score\": 110531.87024296448\n },\n {\n \"content\": \"struct Coercion<std::complex<double>, double>\\n\\n{\\n\\n typedef std::complex<double> Type;\\n\\n};\\n\\n\\n\\n} // namespace Fiber\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 72,\n \"score\": 110531.87024296448\n },\n {\n \"content\": \"struct Coercion<std::complex<float>, float>\\n\\n{\\n\\n typedef std::complex<float> Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 73,\n \"score\": 110531.87024296448\n },\n {\n \"content\": \"struct AhmedTypeTraits<std::complex<double> >\\n\\n{\\n\\n typedef dcomp Type;\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\ninline typename AhmedTypeTraits<T>::Type* ahmedCast(T* x) {\\n\\n#ifdef AHMED_USES_STD_COMPLEX\\n\\n return x;\\n\\n#else\\n\\n return reinterpret_cast<typename AhmedTypeTraits<T>::Type*>(x);\\n\\n#endif \\n\\n}\\n\\n\\n\\nfloat ahmedCast(float x);\\n\\ndouble ahmedCast(double x);\\n\\nscomp ahmedCast(std::complex<float> x);\\n\\ndcomp ahmedCast(std::complex<double> x);\\n\\n\\n\\n} // namespace Bempp\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/assembly/ahmed_aux_fwd.hpp\",\n \"rank\": 74,\n \"score\": 110253.6388576969\n },\n {\n \"content\": \"struct AhmedTypeTraits<std::complex<float> >\\n\\n{\\n\\n typedef scomp Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/assembly/ahmed_aux_fwd.hpp\",\n \"rank\": 75,\n \"score\": 110253.6388576969\n },\n {\n \"content\": \"struct GetInfoHelper<Func, VECTOR_CLASS<T> >\\n\\n{\\n\\n static cl_int get(Func f, cl_uint name, VECTOR_CLASS<T>* param)\\n\\n {\\n\\n ::size_t required;\\n\\n cl_int err = f(name, 0, NULL, &required);\\n\\n if (err != CL_SUCCESS) {\\n\\n return err;\\n\\n }\\n\\n\\n\\n T* value = (T*) alloca(required);\\n\\n err = f(name, required, value, NULL);\\n\\n if (err != CL_SUCCESS) {\\n\\n return err;\\n\\n }\\n\\n\\n\\n param->assign(&value[0], &value[required/sizeof(T)]);\\n\\n return CL_SUCCESS;\\n\\n }\\n\\n};\\n\\n\\n\\n// Specialized for getInfo<CL_PROGRAM_BINARIES>\\n\\ntemplate <typename Func>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 76,\n \"score\": 108278.09973447479\n },\n {\n \"content\": \"struct AhmedDofWrapper : public Point3D<CoordinateType>\\n\\n{\\n\\n CoordinateType getcenter(int dim) const\\n\\n {\\n\\n switch (dim)\\n\\n {\\n\\n case 0: return this->x;\\n\\n case 1: return this->y;\\n\\n case 2: return this->z;\\n\\n default:\\n\\n throw std::invalid_argument(\\\"AhmedDofWrapper::getcenter(): \\\"\\n\\n \\\"invalid dimension index\\\");\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"lib/assembly/ahmed_aux.hpp\",\n \"rank\": 77,\n \"score\": 108055.94943421069\n },\n {\n \"content\": \"struct size_t : public cl::vector< ::size_t, N> { };\\n\\n\\n\\nnamespace detail {\\n\\n\\n\\n// GetInfo help struct\\n\\ntemplate <typename Functor, typename T>\\n\",\n \"file_path\": \"lib/fiber/CL/cl.hpp\",\n \"rank\": 78,\n \"score\": 106164.79862120884\n },\n {\n \"content\": \"// Copyright (C) 2011-2012 by the BEM++ Authors\\n\\n//\\n\\n// Permission is hereby granted, free of charge, to any person obtaining a copy\\n\\n// of this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\n// in the Software without restriction, including without limitation the rights\\n\\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\n// copies of the Software, and to permit persons to whom the Software is\\n\\n// furnished to do so, subject to the following conditions:\\n\\n//\\n\\n// The above copyright notice and this permission notice shall be included in\\n\\n// all copies or substantial portions of the Software.\\n\\n//\\n\\n// THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\\n\\n// THE SOFTWARE.\\n\\n\\n\\n#ifndef fiber_types_hpp\\n\\n#define fiber_types_hpp\\n\\n\\n\\n#include \\\"../common/common.hpp\\\"\\n\\n\\n\\nnamespace Fiber\\n\\n{\\n\\n\\n\",\n \"file_path\": \"lib/fiber/types.hpp\",\n \"rank\": 79,\n \"score\": 105905.55292845913\n },\n {\n \"content\": \"struct Coercion<std::complex<float>, std::complex<float> >\\n\\n{\\n\\n typedef std::complex<float> Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 80,\n \"score\": 102243.61693498399\n },\n {\n \"content\": \"struct Coercion<std::complex<double>, std::complex<double> >\\n\\n{\\n\\n typedef std::complex<double> Type;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"lib/fiber/scalar_traits.hpp\",\n \"rank\": 81,\n \"score\": 102243.61693498399\n },\n {\n \"content\": \"class QuadratureStrategy<BasisFunctionType, ResultType, GeometryFactory,\\n\\n typename boost::enable_if<boost::is_same<ResultType, typename ScalarTraits<ResultType>::RealType> >::type > :\\n\\n public QuadratureStrategyBase<BasisFunctionType, ResultType, GeometryFactory>\\n\\n{\\n\\n typedef QuadratureStrategyBase<BasisFunctionType, ResultType, GeometryFactory> Base;\\n\\npublic:\\n\\n typedef typename Base::CoordinateType CoordinateType;\\n\\n};\\n\\n/** \\\\endcond */\\n\\n\\n\\n} // namespace Fiber\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/fiber/quadrature_strategy.hpp\",\n \"rank\": 82,\n \"score\": 93584.51750964939\n },\n {\n \"content\": \" def test_type_returns_a_GeometryType_for_codim(self, codim):\\n\\n entity = self.get_entity(codim)\\n\",\n \"file_path\": \"python/tests/unit/test_entity.py\",\n \"rank\": 83,\n \"score\": 91750.94650204162\n },\n {\n \"content\": \"class ConstGeometricalDataSlice\\n\\n{\\n\\npublic:\\n\\n ConstGeometricalDataSlice(const GeometricalData<CoordinateType>& geomData,\\n\\n int point) :\\n\\n m_geomData(geomData), m_point(point) {}\\n\\n\\n\\n CoordinateType global(int dim) const {\\n\\n return m_geomData.globals(dim, m_point);\\n\\n }\\n\\n CoordinateType integrationElement() const {\\n\\n return m_geomData.integrationElements(m_point);\\n\\n }\\n\\n CoordinateType jacobianTransposed(int row, int col) const {\\n\\n return m_geomData.jacobiansTransposed(row, col, m_point);\\n\\n }\\n\\n CoordinateType jacobianInverseTransposed(int row, int col) const {\\n\\n return m_geomData.jacobianInversesTransposed(row, col, m_point);\\n\\n }\\n\\n CoordinateType normal(int dim) const {\\n\",\n \"file_path\": \"lib/fiber/geometrical_data.hpp\",\n \"rank\": 84,\n \"score\": 90755.29890967123\n },\n {\n \"content\": \"class ConstBasisDataSlice\\n\\n{\\n\\npublic:\\n\\n ConstBasisDataSlice(const BasisData<ValueType>& basisData,\\n\\n int function, int point) :\\n\\n m_basisData(basisData), m_function(function), m_point(point) {}\\n\\n\\n\\n ValueType values(int dim) const {\\n\\n return m_basisData.values(dim, m_function, m_point);\\n\\n }\\n\\n\\n\\n ValueType derivatives(int dim, int direction) const {\\n\\n return m_basisData.derivatives(dim, direction, m_function, m_point);\\n\\n }\\n\\n\\n\\n int componentCount() const {\\n\\n return m_basisData.componentCount();\\n\\n }\\n\\n\\n\\nprivate:\\n\\n const BasisData<ValueType>& m_basisData;\\n\\n int m_function, m_point;\\n\\n};\\n\\n\\n\\n} // namespace Fiber\\n\\n\\n\\n#endif // BASIS_DATA_TYPES_HPP\\n\",\n \"file_path\": \"lib/fiber/basis_data.hpp\",\n \"rank\": 85,\n \"score\": 90755.29890967123\n },\n {\n \"content\": \"enum Symmetry\\n\\n{\\n\\n NO_SYMMETRY = 0x0000,\\n\\n SYMMETRIC = 0x0001,\\n\\n HERMITIAN = 0x0002,\\n\\n AUTO_SYMMETRY = 0x8000\\n\\n};\\n\\n\\n\\n} // namespace Bempp\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/assembly/symmetry.hpp\",\n \"rank\": 86,\n \"score\": 89873.84779439632\n },\n {\n \"content\": \"enum TranspositionMode\\n\\n{\\n\\n#ifdef WITH_TRILINOS\\n\\n /** \\\\brief Use the non-transposed operator. */\\n\\n NO_TRANSPOSE = Thyra::NOTRANS,\\n\\n /** \\\\brief Use the non-transposed operator with complex-conjugated elements\\n\\n * (same as \\\\c NO_TRANSPOSE for operators with real elements). */\\n\\n CONJUGATE = Thyra::CONJ,\\n\\n /** \\\\brief Use the transposed operator. */\\n\\n TRANSPOSE = Thyra::TRANS,\\n\\n /** \\\\brief Use the transposed operator with complex-conjugated elements\\n\\n * (same as \\\\c TRANSPOSE for operators with real elements). */\\n\\n CONJUGATE_TRANSPOSE = Thyra::CONJTRANS\\n\\n#else\\n\\n NO_TRANSPOSE,\\n\\n CONJUGATE,\\n\\n TRANSPOSE,\\n\\n CONJUGATE_TRANSPOSE\\n\\n#endif\\n\\n};\\n\\n\\n\\n} // namespace Bempp\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/assembly/transposition_mode.hpp\",\n \"rank\": 87,\n \"score\": 86676.22155720726\n },\n {\n \"content\": \"struct GridParameters {\\n\\n /** \\\\brief %Grid topology */\\n\\n enum Topology {\\n\\n /** \\\\brief one-dimensional grid embedded in a two-dimensional space */\\n\\n LINEAR,\\n\\n /** \\\\brief two-dimensional grid composed of triangular elements,\\n\\n embedded in a three-dimensional space */\\n\\n TRIANGULAR,\\n\\n /** \\\\brief two-dimensional grid composed of quadrilateral elements,\\n\\n embedded in a three-dimensional space */\\n\\n QUADRILATERAL,\\n\\n /** \\\\brief two-dimensional grid composed (potentially) both of\\n\\n triangular and quadrilateral elements, embedded in a\\n\\n three-dimensional space */\\n\\n HYBRID_2D,\\n\\n /** \\\\brief three-dimensional grid composed of tetrahedral elements,\\n\\n embedded in a three-dimensional space*/\\n\\n TETRAHEDRAL\\n\\n } topology;\\n\\n};\\n\\n\\n\\n} // namespace Bempp\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/grid/grid_parameters.hpp\",\n \"rank\": 88,\n \"score\": 85719.66516213119\n },\n {\n \"content\": \"struct AcaOptions\\n\\n{\\n\\n /** \\\\brief Initialize ACA parameters to default values. */\\n\\n AcaOptions();\\n\\n\\n\\n /** \\\\brief Estimate of the desired approximation accuracy.\\n\\n *\\n\\n * Default value: 1e-4. */\\n\\n double eps;\\n\\n /** \\\\brief Cluster-pair admissibility parameter.\\n\\n *\\n\\n * Default value: 1.2. */\\n\\n double eta;\\n\\n /** \\\\brief Minimum size of blocks approximated with ACA.\\n\\n *\\n\\n * Matrix blocks whose smaller side is less than this value will be stored\\n\\n * in the dense format (ACA will not be attempted on these blocks).\\n\\n *\\n\\n * Default value: 16. */\\n\\n unsigned int minimumBlockSize;\\n\",\n \"file_path\": \"lib/assembly/assembly_options.hpp\",\n \"rank\": 89,\n \"score\": 85719.66516213119\n },\n {\n \"content\": \"struct ConvergenceTestMode {\\n\\n enum Mode {\\n\\n TEST_CONVERGENCE_IN_DUAL_TO_RANGE,\\n\\n TEST_CONVERGENCE_IN_RANGE\\n\\n };\\n\\n};\\n\\n\\n\\n/** \\\\ingroup linalg\\n\\n * \\\\brief An abstract interface for various types of solvers\\n\\n *\\n\\n * This class is an interface to the solution of linear systems in BEM++.\\n\\n * Concrete subclasses implement specific linear solvers.\\n\\n *\\n\\n */\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"lib/linalg/solver.hpp\",\n \"rank\": 90,\n \"score\": 85719.66516213119\n },\n {\n \"content\": \"struct SolutionStatus {\\n\\n enum Status {\\n\\n CONVERGED,\\n\\n UNCONVERGED,\\n\\n UNKNOWN};\\n\\n};\\n\\n\\n\\n/** \\\\ingroup linalg\\n\\n * \\\\brief The base class for the Solution and BlockedSolution container classes.\\n\\n *\\n\\n * This class holds various information about the solution of a BEM computation. It derives from\\n\\n * <a href=\\\"http://trilinos.sandia.gov/packages/docs/r10.10/packages/thyra/doc/html/structThyra_1_1SolveStatus.html\\\">Thyra::SolveStatus</a>\\n\\n * if Trilinos is enabled.\\n\\n *\\n\\n * <tt>MagnitudeType</tt> is identical to <tt>float</tt> if <tt>ResultType</tt> is <tt>float</tt> or <tt>complex<float></tt>. It is double\\n\\n * if <tt>ResultType</tt> is <tt>double</tt> or <tt>complex<double></tt>\\n\\n */\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"lib/linalg/solution_base.hpp\",\n \"rank\": 91,\n \"score\": 85719.66516213119\n },\n {\n \"content\": \"struct ChunkStatistics\\n\\n{\\n\\n ChunkStatistics() : valid(false) {}\\n\\n bool valid;\\n\\n size_t chunkStart;\\n\\n size_t chunkSize;\\n\\n tbb::tick_count startTime;\\n\\n tbb::tick_count endTime;\\n\\n};\\n\\n\\n\\n} // namespace Bempp\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/common/chunk_statistics.hpp\",\n \"rank\": 92,\n \"score\": 85719.66516213119\n },\n {\n \"content\": \"struct CreateOperator_3_I\\n\\n{\\n\\n BoundaryOperator<BasisFunctionType, ResultType> operator() (\\n\\n const shared_ptr<const Context<BasisFunctionType, ResultType> >& context,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& domain,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& range,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange) const\\n\\n {\\n\\n return 3. * identityOperator<BasisFunctionType, ResultType>(\\n\\n context, domain, range, dualToRange);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"tests/unit/assembly/test_joint_assembly.cpp\",\n \"rank\": 93,\n \"score\": 82900.41519583325\n },\n {\n \"content\": \"struct MblockArrayConverter\\n\\n{\\n\\n static void convert(\\n\\n unsigned int n,\\n\\n const boost::shared_array<mblock<FromType> *>& in,\\n\\n boost::shared_array<mblock<ToType> *>& out) {\\n\\n out = allocateAhmedMblockArray<ToType>(n);\\n\\n copyH(n, in.get(), out.get());\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename Type>\\n\",\n \"file_path\": \"lib/assembly/sparse_to_h_matrix_converter.cpp\",\n \"rank\": 94,\n \"score\": 82900.41519583325\n },\n {\n \"content\": \"struct UnitFunctor\\n\\n{\\n\\n typedef ValueType_ ValueType;\\n\\n typedef typename ScalarTraits<ValueType>::RealType CoordinateType;\\n\\n\\n\\n int argumentDimension() const { return 3; }\\n\\n int resultDimension() const { return 1; }\\n\\n\\n\\n void evaluate(const arma::Col<CoordinateType>& point,\\n\\n arma::Col<ValueType>& result) const {\\n\\n result(0) = 1.;\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/unit/linalg/laplace_3d_dirichlet_fixture.hpp\",\n \"rank\": 95,\n \"score\": 82900.41519583325\n },\n {\n \"content\": \"struct ClusterConstructionHelper\\n\\n{\\n\\n typedef typename Fiber::ScalarTraits<BasisFunctionType>::RealType CoordinateType;\\n\\n typedef AhmedDofWrapper<CoordinateType> AhmedDofType;\\n\\n typedef ExtendedBemCluster<AhmedDofType> AhmedBemCluster;\\n\\n typedef bemblcluster<AhmedDofType, AhmedDofType> AhmedBemBlcluster;\\n\\n\\n\\n static void constructBemCluster(\\n\\n const Space<BasisFunctionType>& space,\\n\\n bool indexWithGlobalDofs,\\n\\n const AcaOptions& acaOptions,\\n\\n shared_ptr<AhmedBemCluster>& cluster,\\n\\n shared_ptr<IndexPermutation>& o2p,\\n\\n shared_ptr<IndexPermutation>& p2o);\\n\\n\\n\\n static std::auto_ptr<AhmedBemBlcluster>\\n\\n constructBemBlockCluster(\\n\\n const AcaOptions& acaOptions,\\n\\n bool symmetric,\\n\\n /* input parameter (effectively const */\\n\",\n \"file_path\": \"lib/assembly/cluster_construction_helper.hpp\",\n \"rank\": 96,\n \"score\": 82900.41519583325\n },\n {\n \"content\": \"struct CreateOperator_I\\n\\n{\\n\\n BoundaryOperator<BasisFunctionType, ResultType> operator() (\\n\\n const shared_ptr<const Context<BasisFunctionType, ResultType> >& context,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& domain,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& range,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange) const\\n\\n {\\n\\n return identityOperator<BasisFunctionType, ResultType>(\\n\\n context, domain, range, dualToRange);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"tests/unit/assembly/test_joint_assembly.cpp\",\n \"rank\": 97,\n \"score\": 82900.41519583325\n },\n {\n \"content\": \"struct CreateOperator_V\\n\\n{\\n\\n BoundaryOperator<BasisFunctionType, ResultType> operator() (\\n\\n const shared_ptr<const Context<BasisFunctionType, ResultType> >& context,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& domain,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& range,\\n\\n const shared_ptr<const Space<BasisFunctionType> >& dualToRange) const\\n\\n {\\n\\n return laplace3dSingleLayerBoundaryOperator<BasisFunctionType, ResultType>(\\n\\n context, domain, range, dualToRange);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename BasisFunctionType, typename ResultType>\\n\",\n \"file_path\": \"tests/unit/assembly/test_joint_assembly.cpp\",\n \"rank\": 98,\n \"score\": 81608.77726725866\n },\n {\n \"content\": \"struct SparseToHMatrixConverter\\n\\n{\\n\\n typedef typename Fiber::ScalarTraits<ValueType>::RealType CoordinateType;\\n\\n typedef AhmedDofWrapper<CoordinateType> AhmedDofType;\\n\\n typedef bemblcluster<AhmedDofType, AhmedDofType> AhmedBemBlcluster;\\n\\n typedef mblock<typename AhmedTypeTraits<ValueType>::Type> AhmedMblock;\\n\\n\\n\\n static void constructHMatrix(\\n\\n int* rowOffsets, int* colIndices, double* values,\\n\\n std::vector<unsigned int>& domain_o2p,\\n\\n std::vector<unsigned int>& range_p2o,\\n\\n double eps,\\n\\n AhmedBemBlcluster* blockCluster,\\n\\n boost::shared_array<AhmedMblock*>& mblocks,\\n\\n int& maximumRank);\\n\\n};\\n\\n\\n\\n} // namespace Bempp\\n\\n\\n\\n#endif // WITH_AHMED\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"lib/assembly/sparse_to_h_matrix_converter.hpp\",\n \"rank\": 99,\n \"score\": 81608.77726725866\n }\n]","isConversational":false}}},{"rowIdx":285,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/automaton/core/testnet/testnet.cc"},"repo_name":{"kind":"string","value":"sept-en/automaton"},"commit":{"kind":"string","value":"b7448dfe578cf52df37ec7c86536d1e51017c548"},"file_code":{"kind":"string","value":"#include \"automaton/core/testnet/testnet.h\"\n\n#include <set>\n\n#include \"automaton/core/io/io.h\"\n#include \"automaton/core/node/node.h\"\n\nnamespace automaton {\nnamespace core {\nnamespace testnet {\n\nstatic const uint32_t STARTING_PORT = 12300;\n\nstd::unordered_map<std::string, std::shared_ptr<testnet>> testnet::testnets;\n\nbool testnet::create_testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\n network_protocol_type ntype, uint32_t number_nodes, std::unordered_map<uint32_t,\n std::vector<uint32_t> > peer_list) {\n auto it = testnets.find(id);\n if (it != testnets.end()) {\n LOG(ERROR) << \"Testnet with id \" << id << \" already exists!\";\n return false;\n }\n auto net = std::unique_ptr<testnet>(new testnet(node_type, id, smart_protocol_id, ntype, number_nodes));\n bool initialised = net->init();\n if (!initialised) {\n LOG(ERROR) << \"Testnet \" << id << \" initialization failed!\";\n return false;\n }\n net->connect(peer_list);\n testnets[id] = std::move(net);\n return true;\n}\n\nvoid testnet::destroy_testnet(const std::string& id) {\n auto it = testnets.find(id);\n if (it != testnets.end()) {\n testnets.erase(it);\n }\n}\n\nstd::shared_ptr<testnet> testnet::get_testnet(const std::string& id) {\n auto it = testnets.find(id);\n if (it != testnets.end()) {\n return it->second;\n }\n return nullptr;\n}\n\nstd::vector<std::string> testnet::list_testnets() {\n std::vector<std::string> result;\n for (auto it = testnets.begin(); it != testnets.end(); it++) {\n result.push_back(it->first);\n }\n return result;\n}\n\ntestnet::~testnet() {\n for (uint32_t i = 0; i < node_ids_list.size(); ++i) {\n automaton::core::node::node::remove_node(node_ids_list[i]);\n }\n}\n\nvoid testnet::connect(const std::unordered_map<uint32_t, std::vector<uint32_t> >& peers_list) const {\n std::string id = network_id + \"_\";\n std::string address = \"\";\n uint32_t port = 0;\n if (network_type == network_protocol_type::localhost) {\n address = \"tcp://127.0.0.1:\";\n port = STARTING_PORT;\n } else {\n address = \"sim://1:20:10000:\";\n }\n\n for (auto it = peers_list.begin(); it != peers_list.end(); it++) {\n std::stringstream nid;\n nid << id << it->first;\n std::shared_ptr<automaton::core::node::node> n = automaton::core::node::node::get_node(nid.str());\n if (n == nullptr) {\n LOG(ERROR) << \"No such node: \" << nid.str();\n continue;\n }\n const std::vector<uint32_t>& peers = it->second;\n for (uint32_t i = 0; i < peers.size(); ++i) {\n std::stringstream ss;\n ss << address << (port + peers[i]);\n uint32_t pid = n->add_peer(ss.str());\n n->connect(pid);\n }\n }\n}\n\nstd::vector<std::string> testnet::list_nodes() {\n return node_ids_list;\n}\n\ntestnet::testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\n network_protocol_type ntype, uint32_t number_nodes): node_type(node_type), network_id(id),\n protocol_id(smart_protocol_id), network_type(ntype), number_nodes(number_nodes), node_ids_list(number_nodes, \"\") {}\n\nbool testnet::init() {\n std::string address = \"\";\n uint32_t port = 0;\n if (network_type == network_protocol_type::localhost) {\n address = \"tcp://127.0.0.1:\";\n port = STARTING_PORT;\n } else {\n address = \"sim://100:10000:\";\n }\n for (uint32_t i = 1; i <= number_nodes; ++i) {\n std::string node_id = network_id + \"_\" + std::to_string(i);\n bool res = automaton::core::node::node::launch_node(node_type,\n node_id, protocol_id, address + std::to_string(port + i));\n if (!res) {\n return false;\n }\n node_ids_list[i-1] = node_id;\n }\n return true;\n}\n\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_connections_vector(uint32_t n, uint32_t p) {\n std::unordered_map<uint32_t, std::vector<uint32_t> > result;\n if (p >= ((n + 1) / 2)) {\n LOG(ERROR) << \"'p' is too big! Setting 'p' to max valid number of peers for 'n' = \" << n << \" : \" <<\n ((n + 1) / 2 - 1);\n return result;\n }\n for (uint32_t i = 1; i <= n; ++i) {\n std::vector<uint32_t> peers;\n for (uint32_t j = 0; j < p; ++j) {\n peers.push_back((i + j) % n + 1);\n }\n result[i] = std::move(peers);\n }\n return result;\n}\n\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_rnd_connections_vector(uint32_t n, uint32_t p) {\n std::unordered_map<uint32_t, std::vector<uint32_t> > result;\n uint32_t k;\n if (p >= ((n + 1) / 2)) {\n LOG(ERROR) << \"'p' is too big! Setting 'p' to max valid number of peers for 'n' = \" << n << \" : \" <<\n ((n + 1) / 2 - 1);\n return result;\n }\n for (uint32_t i = 1; i <= n; ++i) {\n std::set<uint32_t> peers;\n while (peers.size() < p) {\n k = std::rand() % n + 1;\n if (k == i) {continue;}\n peers.insert(k);\n }\n result[i] = std::vector<uint32_t>(peers.begin(), peers.end());\n }\n return result;\n}\n\n} \n} \n} \n"},"prefix":{"kind":"string","value":"#include \"automaton/core/testnet/testnet.h\"\n\n#include <set>\n\n#include \"automaton/core/io/io.h\"\n#include \"automaton/core/node/node.h\"\n\nnamespace automaton {\nnamespace core {\nnamespace testnet {\n\nstatic const uint32_t STARTING_PORT = 12300;\n\nstd::unordered_map<std::string, std::shared_ptr<testnet>> testnet::testnets;\n\nbool testnet::create_testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\n network_protocol_type ntype, uint32_t number_nodes, std::unordered_map<uint32_t,\n std::vector<uint32_t> > peer_list) {\n auto it = testnets.find(id);\n if (it != testnets.end()) {\n LOG(ERROR) << \"Testnet with id \" << id << \" already exists!\";\n return false;\n }\n auto net = std::unique_ptr<testnet>(new testnet(node_type, id, smart_protocol_id, ntype, number_nodes));\n bool initialised = net->init();\n if (!initialised) {\n LOG(ERROR) << \"Testnet \" << id << \" initialization failed!\";\n return false;\n }\n net->connect(peer_list);\n testnets"},"suffix":{"kind":"string","value":"= \"\";\n uint32_t port = 0;\n if (network_type == network_protocol_type::localhost) {\n address = \"tcp://127.0.0.1:\";\n port = STARTING_PORT;\n } else {\n address = \"sim://100:10000:\";\n }\n for (uint32_t i = 1; i <= number_nodes; ++i) {\n std::string node_id = network_id + \"_\" + std::to_string(i);\n bool res = automaton::core::node::node::launch_node(node_type,\n node_id, protocol_id, address + std::to_string(port + i));\n if (!res) {\n return false;\n }\n node_ids_list[i-1] = node_id;\n }\n return true;\n}\n\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_connections_vector(uint32_t n, uint32_t p) {\n std::unordered_map<uint32_t, std::vector<uint32_t> > result;\n if (p >= ((n + 1) / 2)) {\n LOG(ERROR) << \"'p' is too big! Setting 'p' to max valid number of peers for 'n' = \" << n << \" : \" <<\n ((n + 1) / 2 - 1);\n return result;\n }\n for (uint32_t i = 1; i <= n; ++i) {\n std::vector<uint32_t> peers;\n for (uint32_t j = 0; j < p; ++j) {\n peers.push_back((i + j) % n + 1);\n }\n result[i] = std::move(peers);\n }\n return result;\n}\n\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_rnd_connections_vector(uint32_t n, uint32_t p) {\n std::unordered_map<uint32_t, std::vector<uint32_t> > result;\n uint32_t k;\n if (p >= ((n + 1) / 2)) {\n LOG(ERROR) << \"'p' is too big! Setting 'p' to max valid number of peers for 'n' = \" << n << \" : \" <<\n ((n + 1) / 2 - 1);\n return result;\n }\n for (uint32_t i = 1; i <= n; ++i) {\n std::set<uint32_t> peers;\n while (peers.size() < p) {\n k = std::rand() % n + 1;\n if (k == i) {continue;}\n peers.insert(k);\n }\n result[i] = std::vector<uint32_t>(peers.begin(), peers.end());\n }\n return result;\n}\n\n} \n} \n} \n"},"middle":{"kind":"string","value":"[id] = std::move(net);\n return true;\n}\n\nvoid testnet::destroy_testnet(const std::string& id) {\n auto it = testnets.find(id);\n if (it != testnets.end()) {\n testnets.erase(it);\n }\n}\n\nstd::shared_ptr<testnet> testnet::get_testnet(const std::string& id) {\n auto it = testnets.find(id);\n if (it != testnets.end()) {\n return it->second;\n }\n return nullptr;\n}\n\nstd::vector<std::string> testnet::list_testnets() {\n std::vector<std::string> result;\n for (auto it = testnets.begin(); it != testnets.end(); it++) {\n result.push_back(it->first);\n }\n return result;\n}\n\ntestnet::~testnet() {\n for (uint32_t i = 0; i < node_ids_list.size(); ++i) {\n automaton::core::node::node::remove_node(node_ids_list[i]);\n }\n}\n\nvoid testnet::connect(const std::unordered_map<uint32_t, std::vector<uint32_t> >& peers_list) const {\n std::string id = network_id + \"_\";\n std::string address = \"\";\n uint32_t port = 0;\n if (network_type == network_protocol_type::localhost) {\n address = \"tcp://127.0.0.1:\";\n port = STARTING_PORT;\n } else {\n address = \"sim://1:20:10000:\";\n }\n\n for (auto it = peers_list.begin(); it != peers_list.end(); it++) {\n std::stringstream nid;\n nid << id << it->first;\n std::shared_ptr<automaton::core::node::node> n = automaton::core::node::node::get_node(nid.str());\n if (n == nullptr) {\n LOG(ERROR) << \"No such node: \" << nid.str();\n continue;\n }\n const std::vector<uint32_t>& peers = it->second;\n for (uint32_t i = 0; i < peers.size(); ++i) {\n std::stringstream ss;\n ss << address << (port + peers[i]);\n uint32_t pid = n->add_peer(ss.str());\n n->connect(pid);\n }\n }\n}\n\nstd::vector<std::string> testnet::list_nodes() {\n return node_ids_list;\n}\n\ntestnet::testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\n network_protocol_type ntype, uint32_t number_nodes): node_type(node_type), network_id(id),\n protocol_id(smart_protocol_id), network_type(ntype), number_nodes(number_nodes), node_ids_list(number_nodes, \"\") {}\n\nbool testnet::init() {\n std::string address "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class testnet {\n\n public:\n\n enum network_protocol_type {\n\n localhost = 1,\n\n simulation = 2\n\n };\n\n\n\n ~testnet();\n\n\n\n static bool create_testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\n\n network_protocol_type ntype, uint32_t number_nodes, std::unordered_map<uint32_t,\n\n std::vector<uint32_t> > peer_list);\n\n\n\n static void destroy_testnet(const std::string& id);\n\n\n\n static std::shared_ptr<testnet> get_testnet(const std::string& id);\n\n\n\n static std::vector<std::string> list_testnets();\n\n\n\n void connect(const std::unordered_map<uint32_t, std::vector<uint32_t> >& peers_list) const;\n","file_path":"src/automaton/core/testnet/testnet.h","rank":0,"score":144806.9425492996},{"content":"function rpc_testnet_get_node_id(m)\n\n local request = TestNetGetNodeID()\n\n request:deserialize(m)\n\n local response = NodeID()\n\n response.node_id = get_testnet_node_id(request.testnet_id, request.node_index)\n\n return response:serialize()\n","file_path":"src/automaton/core/core.lua","rank":1,"score":142168.56568530062},{"content":"function disconnect(node_id, peer_ids)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n for _,id in ipairs(peer_ids) do\n\n node:disconnect(id)\n\n end\n\n return \"\"\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":2,"score":110053.42286049656},{"content":"function connect(node_id, peer_ids)\n\n print(\"getting node \" .. node_id)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n for _,id in ipairs(peer_ids) do\n\n node:connect(id)\n\n end\n\n return \"\"\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":3,"score":110053.42286049656},{"content":"#ifndef AUTOMATON_CORE_TESTNET_TESTNET_H_\n\n#define AUTOMATON_CORE_TESTNET_TESTNET_H_\n\n\n\n#include <memory>\n\n#include <string>\n\n#include <unordered_map>\n\n#include <utility>\n\n#include <vector>\n\n\n\nnamespace automaton {\n\nnamespace core {\n\nnamespace testnet {\n\n\n","file_path":"src/automaton/core/testnet/testnet.h","rank":4,"score":109307.50131997446},{"content":"\n\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_connections_vector(uint32_t n, uint32_t p);\n\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_rnd_connections_vector(uint32_t n, uint32_t p);\n\n\n\n} // namespace testnet\n\n} // namespace core\n\n} // namespace automaton\n\n\n\n#endif // AUTOMATON_CORE_TESTNET_TESTNET_H_\n","file_path":"src/automaton/core/testnet/testnet.h","rank":5,"score":109299.4143957997},{"content":"\n\n std::vector<std::string> list_nodes();\n\n\n\n private:\n\n static std::unordered_map<std::string, std::shared_ptr<testnet>> testnets;\n\n\n\n std::string node_type;\n\n std::string network_id;\n\n std::string protocol_id;\n\n network_protocol_type network_type;\n\n uint32_t number_nodes;\n\n std::vector<std::string> node_ids_list; // <network_id>_1, <network_id>_2, ...\n\n\n\n testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\n\n network_protocol_type ntype, uint32_t number_nodes);\n\n\n\n bool init();\n\n};\n\n\n\n// Helper functions\n","file_path":"src/automaton/core/testnet/testnet.h","rank":6,"score":109298.82802599936},{"content":"function remove_peers(node_id, peer_ids)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n for _,id in ipairs(peer_ids) do\n\n node:remove_peer(id)\n\n print(\"removed \" .. tostring(id))\n\n end\n\n return \"\"\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":7,"score":108561.66097982852},{"content":"function get_peers(node_id, peer_ids)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n local response = PeersList()\n\n response.node_id = node_id\n\n for _,id in ipairs(peer_ids) do\n\n local p = Peer()\n\n p.id = id\n\n p.address = node:get_peer_address(id)\n\n response.peers = p\n\n end\n\n return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":8,"score":108561.66097982852},{"content":"function rpc_start_testnet(m)\n\n local request = Network()\n\n request:deserialize(m)\n\n if (request.is_localhost) then\n\n testnet(localhost, _G[request.protocol_id], request.number_nodes, request.number_peers_per_node, request.logging_path)\n\n else\n\n testnet(simulation, _G[request.protocol_id], request.number_nodes, request.number_peers_per_node, request.logging_path)\n\n end\n\n return \"\"\n\nend\n","file_path":"src/automaton/core/core.lua","rank":18,"score":102507.06342568771},{"content":"function rpc_testnet_destroy(m)\n\n local request = TestNetID()\n\n request:deserialize(m)\n\n testnet_destroy(request.testnet_id)\n\n return \"\"\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":19,"score":102507.06342568771},{"content":"function rpc_testnet_create(m)\n\n local request = TestNetCreate()\n\n request:deserialize(m)\n\n local peers_list = {}\n\n for _,v in pairs(request.topology) do\n\n peers_list[v.from_node] = v.to_node\n\n end\n\n testnet_create(request.testnet_id, request.protocol_id, request.network_type, request.number_nodes, peers_list)\n\n return \"\"\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":20,"score":102507.06342568771},{"content":"function get_protocols(ids)\n\n local protocols = get_core_supported_protocols()\n\n local response = ProtocolsList()\n\n for _,id in ipairs(ids) do\n\n local p = protocols[id] -- p -> std::vector<std::pair<std::string, std::string> >\n\n if p ~= nil then\n\n local m = Protocol()\n\n m.protocol_id = id\n\n for k,v in pairs(p) do\n\n m.file_names = k\n\n m.files = v\n\n end\n\n response.protocols = m\n\n end\n\n end\n\n return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":21,"score":102466.19633702708},{"content":"function remove_nodes(node_ids)\n\n\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":22,"score":100665.65353248196},{"content":"function get_nodes(node_ids)\n\n local response = NodesList()\n\n for _,id in ipairs(node_ids) do\n\n local node = get_node(id)\n\n if (node ~= nil) then\n\n local n = Node()\n\n n.id = node:get_id()\n\n n.protocol_id = node:get_protocol_id()\n\n n.address = node:get_address()\n\n print(\"node \" .. n.id .. \" -> \" .. n.protocol_id .. \" -> \" .. n.address)\n\n response.nodes = n\n\n end\n\n end\n\n return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":23,"score":100665.65353248196},{"content":"function get_nodes_from_testnet(testnet_id)\n\n if networks[testnet_id] ~= nil then\n\n return networks[testnet_id][\"nodes\"]\n\n end\n\n print(\"NO NODES @ PATH \" .. testnet_id)\n\n return nil\n\nend\n","file_path":"src/automaton/examples/smartproto/common/network.lua","rank":24,"score":100636.59593931846},{"content":"function sent(peer_id, msg_id, success)\n\nend\n","file_path":"src/automaton/tests/testnet/testproto/chat.lua","rank":25,"score":99002.48961835624},{"content":"function list_connected_peers(node_id)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n local response = PeerIdsList()\n\n local list = node:peers()\n\n print(\"connected peers to \" .. node_id .. \" ::\")\n\n for _,id in ipairs(list) do\n\n response.peer_ids = id\n\n print(id)\n\n end\n\n return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":26,"score":98930.50237028612},{"content":"function list_known_peers(node_id)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n local response = PeerIdsList()\n\n local list = node:known_peers()\n\n print(\"known peers to \" .. node_id .. \" ::\")\n\n for _,id in ipairs(list) do\n\n response.peer_ids = id\n\n print(id)\n\n end\n\n return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":27,"score":98930.50237028612},{"content":"function add_peers(node_id, peer_addresses)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n local response = PeersList()\n\n response.node_id = node_id\n\n for _,addr in ipairs(peer_addresses) do\n\n local p = Peer()\n\n p.id = node:add_peer(addr)\n\n print(\"added \" .. tostring(p.id))\n\n p.address = addr\n\n response.peers = p\n\n end\n\n return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":28,"score":97257.09573288659},{"content":"function process_cmd(node_id, cmd, params)\n\n local node = get_node(node_id)\n\n if node == nil then\n\n return \"\"\n\n end\n\n local response = NodeCmdResponse()\n\n response.response = node:process_cmd(cmd, params)\n\n return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":29,"score":97257.09573288659},{"content":"function disconnected(peer_id)\n\n peers[peer_id] = nil\n\nend\n\n\n","file_path":"src/automaton/tests/testnet/testproto/connections.lua","rank":30,"score":92924.71485703217},{"content":"function connected(peer_id)\n\n peers[peer_id] = { name = \"N/A\" }\n\n hi = Hello()\n\n hi.name = nodeid\n\n send(peer_id, hi, 1)\n\nend\n\n\n","file_path":"src/automaton/tests/testnet/testproto/connections.lua","rank":31,"score":92924.71485703217},{"content":"function on_Msg(peer_id, m)\n\n if heard_of[m.author] == nil then\n\n heard_of[m.author] = true\n\n end\n\n gossip(peer_id, m)\n\nend\n\n\n","file_path":"src/automaton/tests/testnet/testproto/chat.lua","rank":32,"score":92924.71485703217},{"content":"function on_Hello(peer_id, m)\n\n peers[peer_id].name = m.name\n\nend\n","file_path":"src/automaton/tests/testnet/testproto/connections.lua","rank":33,"score":92924.71485703217},{"content":"class rpc_server_handler: public automaton::core::network::http_server::server_handler {\n\n engine* script;\n\n\n\n public:\n\n explicit rpc_server_handler(engine* en): script(en) {}\n\n std::string handle(std::string json_cmd, http_server::status_code* s) {\n\n std::stringstream sstr(json_cmd);\n\n nlohmann::json j;\n\n sstr >> j;\n\n std::string cmd = \"rpc_\";\n\n std::string msg = \"\";\n\n if (j.find(\"method\") != j.end() && j.find(\"msg\") != j.end()) {\n\n cmd += j[\"method\"].get<std::string>();\n\n msg = j[\"msg\"].get<std::string>();\n\n } else {\n\n LOG(ERROR) << \"ERROR in rpc server handler: Invalid request\";\n\n *s = http_server::status_code::BAD_REQUEST;\n\n return \"\";\n\n }\n\n std::string params = \"\";\n","file_path":"src/automaton/core/core.cc","rank":34,"score":92475.3691730035},{"content":"function gossip(peer_id, msg)\n\n for k, v in pairs(peers) do\n\n if k ~= 0 and k ~= peer_id then\n\n send(k, msg, 0)\n\n end\n\n end\n\nend\n\n\n","file_path":"src/automaton/tests/testnet/testproto/chat.lua","rank":35,"score":91002.29116373339},{"content":"namespace automaton {\n\nnamespace core {\n\nnamespace io {\n\n\n\n/**\n\n Checks whether the specified file exist.\n\n\n\n Returns true if it does.\n\n*/\n\nbool file_exists(const char* filename);\n\n\n\n/**\n\n Gets the file contents and returns them as a string.\n\n\n\n Exception is thrown when error occurs.\n\n*/\n\nstd::string get_file_contents(const char* filename);\n\n\n\n/**\n\n Converts binary byte buffer to hex string representation.\n\n*/\n\nstd::string bin2hex(const std::string& input);\n\n\n\n/**\n\n Creates a binary byte buffer from hex string representation.\n\n*/\n\nstd::string hex2bin(const std::string& input);\n\n\n\n/**\n\n Returns string representing hex value of a number. Does not contain base prefix 0x. Length is always even.\n\n*/\n\nstd::string dec2hex(uint32_t n);\n\n\n\n/**\n\n Returns a number from its hex representation.\n\n*/\n\nuint32_t hex2dec(const std::string& hex);\n\n\n\n\n\n/**\n\n Returns string representation of a date.\n\n*/\n\nstd::string get_date_string(std::chrono::system_clock::time_point t);\n\n\n\nstd::string zero_padded(int num, int width);\n\n\n\n// This must be called after main entry point.\n\nextern bool init_logger();\n\n\n\n} // namespace io\n\n} // namespace core\n","file_path":"src/automaton/core/io/io.h","rank":36,"score":87219.53318958718},{"content":"namespace automaton {\n\nnamespace core {\n\nnamespace io {\n\n\n\nstruct blob {\n\n explicit blob(size_t size) {\n\n resize(size);\n\n }\n\n\n\n ~blob() {\n\n }\n\n\n\n void set(size_t key, int value) {\n\n CHECK_GT(key, buffer.size());\n\n buffer[key] = value;\n\n }\n\n\n\n uint8_t get(size_t key) {\n\n return buffer[key];\n\n }\n\n\n\n size_t size() {\n\n return buffer.size();\n\n }\n\n\n\n void resize(size_t new_size) {\n\n buffer.resize(new_size, 0);\n\n }\n\n\n\n std::string tostring() {\n\n return io::bin2hex(std::string(reinterpret_cast<const char*>(buffer.data()), buffer.size()));\n\n }\n\n\n\n std::vector<uint8_t> buffer;\n\n};\n\n\n\n} // namespace io\n","file_path":"src/automaton/core/io/blob.h","rank":37,"score":87219.53318958718},{"content":"namespace automaton {\n\nnamespace core {\n\nnamespace common {\n\n\n\nstruct status {\n\n enum status_code {\n\n OK = 0,\n\n CANCELLED = 1,\n\n UNKNOWN = 2,\n\n INVALID_ARGUMENT = 3,\n\n DEADLINE_EXCEEDED = 4,\n\n NOT_FOUND = 5,\n\n ALREADY_EXISTS = 6,\n\n PERMISSION_DENIED = 7,\n\n UNAUTHENTICATED = 16,\n\n RESOURCE_EXHAUSTED = 8,\n\n FAILED_PRECONDITION = 9,\n\n ABORTED = 10,\n\n OUT_OF_RANGE = 11,\n\n UNIMPLEMENTED = 12,\n\n INTERNAL = 13,\n\n UNAVAILABLE = 14,\n\n DATA_LOSS = 15,\n\n };\n\n\n\n explicit status(status_code error_code) : code(error_code), msg(\"\") {}\n\n status(status_code error_code, std::string msg) : code(error_code), msg(msg) {}\n\n\n\n status_code code;\n\n std::string msg;\n\n\n\n bool is_ok() {\n\n return code == OK;\n\n }\n\n\n\n static status ok() {\n\n return status(OK);\n\n }\n\n\n\n static status ok(std::string msg) {\n\n return status(OK, msg);\n\n }\n\n\n\n static status canceled(std::string msg) {\n\n return status(CANCELLED, msg);\n\n }\n\n\n\n static status invalid_argument(std::string msg) {\n\n return status(INVALID_ARGUMENT, msg);\n\n }\n\n\n\n static status unknown(std::string msg) {\n\n return status(UNKNOWN, msg);\n\n }\n\n\n\n static status not_found(std::string msg) {\n\n return status(NOT_FOUND, msg);\n\n }\n\n\n\n static status permission_denied(std::string msg) {\n\n return status(PERMISSION_DENIED, msg);\n\n }\n\n\n\n static status resource_exhausted(std::string msg) {\n\n return status(RESOURCE_EXHAUSTED, msg);\n\n }\n\n\n\n static status failed_precondition(std::string msg) {\n\n return status(FAILED_PRECONDITION, msg);\n\n }\n\n\n\n static status aborted(std::string msg) {\n\n return status(ABORTED, msg);\n\n }\n\n\n\n static status out_of_range(std::string msg) {\n\n return status(OUT_OF_RANGE, msg);\n\n }\n\n\n\n static status unimplemented(std::string msg) {\n\n return status(UNIMPLEMENTED, msg);\n\n }\n\n\n\n static status internal(std::string msg) {\n\n return status(INTERNAL, msg);\n\n }\n\n\n\n static status unavailable(std::string msg) {\n\n return status(UNAVAILABLE, msg);\n\n }\n\n\n\n static status data_loss(std::string msg) {\n\n return status(DATA_LOSS, msg);\n\n }\n\n\n\n std::string to_string() const;\n\n};\n\n\n\nstd::ostream& operator<<(std::ostream& os, const status& s);\n\n\n\n} // namespace common\n","file_path":"src/automaton/core/common/status.h","rank":38,"score":87219.53318958718},{"content":"class eth_contract: public automaton::core::network::connection::connection_handler,\n\n public std::enable_shared_from_this<eth_contract> {\n\n public:\n\n static std::unordered_map<std::string, std::shared_ptr<eth_contract> > contracts;\n\n\n\n static void register_contract(const std::string& server, const std::string& address,\n\n std::unordered_map<std::string, std::pair<std::string, bool> > signs);\n\n static std::shared_ptr<eth_contract> get_contract(const std::string&);\n\n\n\n ~eth_contract();\n\n\n\n void call(const std::string& address, const std::string& f, const std::string& params,\n\n std::function<void(const automaton::core::common::status& s, const std::string&)>);\n\n\n\n private:\n\n uint32_t call_id;\n\n std::string server;\n\n std::string address; // ETH address of the contract\n\n std::unordered_map<std::string, std::pair<std::string, bool> > signatures; // function signatures\n\n std::unordered_map<uint32_t,\n","file_path":"src/automaton/core/interop/ethereum/eth_contract_raw.h","rank":39,"score":86529.93380071611},{"content":"namespace automaton {\n\nnamespace core {\n\nnamespace interop {\n\nnamespace ethereum {\n\n\n\n#ifdef _WIN32\n\n// TODO(vitalyster): use correct error level for these errors\n\n#define _ERROR WARNING\n\n#else\n\n#define _ERROR ERROR\n\n#endif\n\n\n\nstatic size_t curl_callback(void *contents, size_t size, size_t nmemb, std::string *s) {\n\n size_t new_length = size * nmemb;\n\n try {\n\n s->append(reinterpret_cast<char*>(contents), new_length);\n\n }\n\n catch (std::bad_alloc &e) {\n\n LOG(_ERROR) << \"Bad_alloc while reading data!\";\n\n return 0;\n\n }\n\n return new_length;\n\n}\n\n\n\nstatic status handle_result(const std::string& result) {\n\n json j;\n\n std::stringstream ss(result);\n\n try {\n\n ss >> j;\n\n } catch (...) {\n\n return status::internal(\"Could not parse JSON!\");\n\n }\n\n\n\n if (j.find(\"error\") != j.end()) {\n\n json obj = j[\"error\"];\n\n if (obj.is_string()) {\n\n std::string error = obj[\"message\"].get<std::string>();\n\n return status::internal(error);\n\n }\n\n return status::internal(obj.dump());\n\n } else if (j.find(\"result\") != j.end()) {\n\n if (j[\"result\"].is_string()) {\n\n std::string result = j[\"result\"].get<std::string>();\n\n return status::ok(result.substr(2));\n\n }\n\n return status::ok(j[\"result\"].dump());\n\n }\n\n return status::internal(\"No result and no error!?\");\n\n}\n\n\n\nstatic status curl_post(const std::string& url, const std::string& data) {\n\n CURL *curl;\n\n CURLcode res;\n\n std::string message;\n\n char curl_err_buf[1024];\n\n\n\n curl = curl_easy_init();\n\n\n\n LOG(INFO) << \"\\n======= REQUEST =======\\n\" << data << \"\\n=====================\";\n\n\n\n if (curl) {\n\n struct curl_slist *list = NULL;\n\n\n\n list = curl_slist_append(list, \"Content-Type: application/json\");\n\n\n\n curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\n\n curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, curl_err_buf);\n\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, curl_callback);\n\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, &message);\n\n curl_easy_setopt(curl, CURLOPT_ENCODING, \"gzip\");\n\n curl_easy_setopt(curl, CURLOPT_HTTPHEADER, list);\n\n\n\n curl_err_buf[0] = '\\0';\n\n curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data.c_str());\n\n res = curl_easy_perform(curl);\n\n curl_slist_free_all(list);\n\n curl_easy_cleanup(curl);\n\n if (res != CURLE_OK) {\n\n size_t len = strlen(curl_err_buf);\n\n LOG(_ERROR) << \"Curl result code != CURLE_OK. Result code: \" << res;\n\n if (len) {\n\n return status::internal(std::string(curl_err_buf, len));\n\n }\n\n return status::internal(\"CURL error\");\n\n } else {\n\n LOG(INFO) << \"\\n======= RESPONSE =======\\n\" << message << \"\\n=====================\";\n\n return handle_result(message);\n\n }\n\n } else {\n\n return status::internal(\"No curl!\");\n\n }\n\n}\n\n\n\nstatic status eth_getTransactionCount(const std::string& url, const std::string& address) {\n\n std::stringstream ss;\n\n ss << \"{\\\"jsonrpc\\\":\\\"2.0\\\",\\\"method\\\":\\\"eth_getTransactionCount\\\",\\\"params\\\":[\\\"\" << address <<\n\n \"\\\",\\\"latest\\\"\" << \"],\\\"id\\\":1}\";\n\n return curl_post(url, ss.str());\n\n}\n\n\n\nstatic status eth_getCode(const std::string& url, const std::string& address) {\n\n std::stringstream ss;\n\n ss << \"{\\\"jsonrpc\\\":\\\"2.0\\\",\\\"method\\\":\\\"eth_getCode\\\",\\\"params\\\":[\\\"\" << address <<\n\n \"\\\",\\\"latest\\\"\" << \"],\\\"id\\\":1}\";\n\n return curl_post(url, ss.str());\n\n}\n\n\n\nstatic status eth_getBalance(const std::string& url, const std::string& address) {\n\n std::stringstream ss;\n\n ss << \"{\\\"jsonrpc\\\":\\\"2.0\\\",\\\"method\\\":\\\"eth_getBalance\\\",\\\"params\\\":[\\\"\" << address <<\n\n \"\\\",\\\"latest\\\"\" << \"],\\\"id\\\":1}\";\n\n return curl_post(url, ss.str());\n\n}\n\n\n\nstatic status eth_gasPrice(const std::string& url) {\n\n std::stringstream ss;\n\n ss << \"{\\\"jsonrpc\\\":\\\"2.0\\\",\\\"method\\\":\\\"eth_gasPrice\\\",\\\"params\\\":[],\\\"id\\\":1}\";\n\n return curl_post(url, ss.str());\n\n}\n\n\n\nstatic status eth_getTransactionReceipt(const std::string& url, const std::string& tx_hash) {\n\n std::stringstream ss;\n\n ss << \"{\\\"jsonrpc\\\":\\\"2.0\\\",\\\"method\\\":\\\"eth_getTransactionReceipt\\\",\\\"params\\\":[\\\"\" << tx_hash << \"\\\"],\\\"id\\\":1}\";\n\n return curl_post(url, ss.str());\n\n}\n\n\n\n// Argument encoding and decoding\n\n\n\n/* TODO(kari):\n\n \t* Replace type bitmask with variables\n\n \t* Type structure is messy and confusing - clean it up\n\n \t* Use switch after replacing the bitmask\n\n \t* Move convertion functions to the io module\n\n * Add support for fixed-point numbers\n\n*/\n\n\n\nstatic const uint32_t BUFFER_SIZE = 2048;\n\n\n\nenum abi_type {\n\n empty = 0,\n\n numerical = 1, // bool, int<>, uint<>, fixed, ufixed, fixed<M>x<N>, ufixed<M>x<N>\n\n fixed_size_bytes = 2, // bytes<>, function(bytes24), address(uint160)\n\n dynamic_size_bytes = 3, // bytes\n\n string = 4, // string\n\n};\n\n\n\nenum abi_array_type {\n\n no_array = 0,\n\n fixed = 1,\n\n dynamic = 2\n\n};\n\n\n\nstatic std::ostream& operator<<(std::ostream& os, const abi_type& obj) {\n\n switch (obj) {\n\n case numerical: os << \"numerical\"; break;\n\n case string: os << \"string\"; break;\n\n case fixed_size_bytes: os << \"fixed_size_bytes\"; break;\n\n case dynamic_size_bytes: os << \"dynamic_size_bytes\"; break;\n\n default: os << \"no type\"; break;\n\n }\n\n return os;\n\n}\n\n\n\nstruct type {\n\n std::string str = \"\";\n\n abi_type s_type = empty;\n\n abi_array_type s_array_type = no_array;\n\n uint32_t array_len = 0;\n\n};\n\n\n\nstatic std::ostream& operator<<(std::ostream& os, const type& obj) {\n\n os << \"TYPE{\" << obj.str << \", \" << obj.s_type;\n\n if (obj.s_array_type != no_array) {\n\n if (obj.s_array_type == fixed) {\n\n os << \", fixed array of size \";\n\n } else {\n\n os << \", dynamic array of size \";\n\n }\n\n os << obj.array_len;\n\n }\n\n os << \"}\";\n\n return os;\n\n}\n\n\n\nstatic type get_type(std::string s) {\n\n type t;\n\n t.str = s;\n\n t.s_array_type = no_array;\n\n t.array_len = 0;\n\n\n\n bool is_array = false;\n\n // Check if it is an array and its size if any\n\n int32_t k1 = 0, k2 = 0, pos, first_pos;\n\n first_pos = pos = s.find('[');\n\n while (pos != std::string::npos) {\n\n k1 = pos;\n\n pos = s.find('[', pos + 1);\n\n }\n\n if (k1 != 0) {\n\n k2 = s.find(']', k1 + 1);\n\n }\n\n if (k1 && k2) {\n\n is_array = true;\n\n if (k1 < (k2 - 1)) {\n\n std::string len_str = s.substr(k1 + 1, k2 - k1 - 1);\n\n t.array_len = stoi(len_str);\n\n }\n\n }\n\n\n\n if (is_array) {\n\n type arr_type = get_type(s.substr(0, k1));\n\n t.s_type = arr_type.s_type;\n\n if (arr_type.s_array_type == dynamic || t.array_len == 0 ||\n\n t.s_type == dynamic_size_bytes || t.s_type == string) {\n\n t.s_array_type = dynamic;\n\n } else {\n\n t.s_array_type = fixed;\n\n }\n\n } else {\n\n if (s == \"function\" || (s.find(\"bytes\") == 0 && s.size() > 5) || s == \"address\") {\n\n t.s_type = fixed_size_bytes;\n\n } else if (s == \"bytes\") {\n\n t.s_type = dynamic_size_bytes;\n\n } else if (s == \"string\") {\n\n t.s_type = string;\n\n } else {\n\n t.s_type = numerical; // TODO(kari): Could be invalid type\n\n }\n\n }\n\n return t;\n\n}\n\n\n\nstatic type extract_array_type(std::string s) {\n\n type new_t;\n\n int32_t k1 = 0, k2 = 0, pos = 0;\n\n pos = s.find('[', pos + 1);\n\n while (pos != std::string::npos) {\n\n k1 = pos;\n\n pos = s.find('[', pos + 1);\n\n }\n\n if (k1 != 0) {\n\n k2 = s.find(']', k1 + 1);\n\n }\n\n if (k1 && k2) {\n\n s.erase(k1, k2 - k1 + 1);\n\n new_t = get_type(s);\n\n } else {\n\n LOG(_ERROR) << \"Array expected!: \" << s;\n\n }\n\n return new_t;\n\n}\n\n\n\nstatic uint32_t calculate_offset(std::vector<std::string> params) {\n\n uint32_t tail_offset = 0;\n\n for (uint32_t i = 0; i < params.size(); ++i) {\n\n type t = get_type(params[i]);\n\n if (t.s_array_type == fixed) {\n\n uint32_t element_count = 1;\n\n // Add the other dimenstions if any\n\n while (t.s_array_type == fixed) {\n\n element_count *= t.array_len;\n\n t = extract_array_type(t.str);\n\n }\n\n tail_offset += 32 * element_count;\n\n } else {\n\n tail_offset += 32;\n\n }\n\n }\n\n return tail_offset;\n\n}\n\n\n\nstatic std::string encode_string(const std::string& byte_array) {\n\n std::stringstream ss;\n\n auto reminder = byte_array.size() % 32;\n\n ss << byte_array << (reminder ? std::string(32 - reminder, '\\0') : \"\");\n\n return ss.str();\n\n}\n\n\n\nstatic std::string u64_to_u256(uint64_t n) {\n\n char bytes[8];\n\n bytes[7] = (n) & 0xFF;\n\n bytes[6] = (n >> 8) & 0xFF;\n\n bytes[5] = (n >> 16) & 0xFF;\n\n bytes[4] = (n >> 24) & 0xFF;\n\n bytes[3] = (n >> 32) & 0xFF;\n\n bytes[2] = (n >> 40) & 0xFF;\n\n bytes[1] = (n >> 48) & 0xFF;\n\n bytes[0] = (n >> 56) & 0xFF;\n\n\n\n return std::string(24, '\\0') + std::string(bytes, 8);\n\n}\n\n\n\nstatic std::string dec_to_i256(bool is_signed, std::string s) {\n\n CryptoPP::Integer::Signedness sign = is_signed ? CryptoPP::Integer::SIGNED : CryptoPP::Integer::UNSIGNED;\n\n if (s.substr(0, 2) == \"0x\") {\n\n s = \"h\" + s.substr(2);\n\n }\n\n CryptoPP::Integer i(s.c_str());\n\n uint8_t bytes[32] = {0};\n\n i.Encode(bytes, 32, sign);\n\n return std::string(reinterpret_cast<const char*>(bytes), 32);\n\n}\n\n\n\nstatic std::string i256_to_dec(bool is_signed, const std::string& s) {\n\n // TODO(kari): If the number is more than 64 bits, throw error or use only 64 bits of it.\n\n CryptoPP::Integer::Signedness sign = is_signed ? CryptoPP::Integer::SIGNED : CryptoPP::Integer::UNSIGNED;\n\n CryptoPP::Integer i(reinterpret_cast<const uint8_t*>(s.c_str()), 32, sign);\n\n std::stringstream ss;\n\n ss << i;\n\n std::string res = ss.str();\n\n return res.substr(0, res.size() - 1); // remove suffix\n\n}\n\n\n\nstatic uint64_t u256_to_u64(const std::string& s) {\n\n if (s.size() != 32) {\n\n LOG(_ERROR) << \"Invalid argument format!\" << s;\n\n return 0;\n\n }\n\n uint64_t n = 0;\n\n for (auto i = 0; i < 8; i++) {\n\n uint64_t k = reinterpret_cast<const uint8_t &>(s[24 + i]);\n\n n |= (k << ((7 - i) * 8));\n\n }\n\n return n;\n\n}\n\n\n\nstatic void check_and_resize_buffer(char** buffer, uint64_t* size, uint64_t pos, uint64_t data_size) {\n\n uint64_t new_size = *size;\n\n while (pos + data_size > new_size) {\n\n new_size += BUFFER_SIZE;\n\n }\n\n if (*size != new_size) {\n\n char* new_buffer = new char[new_size];\n\n memcpy(new_buffer, *buffer, *size);\n\n delete [] *buffer;\n\n *buffer = new_buffer;\n\n *size = new_size;\n\n }\n\n}\n\n\n\nstatic void encode_param(type t, const json& json_data, char** buffer, uint64_t* buf_size,\n\n uint64_t* head_pos, uint64_t* tail_pos) {\n\n if (t.s_array_type == fixed) {\n\n if (!json_data.is_array() || json_data.size() != t.array_len) {\n\n LOG(_ERROR) << \"Invalid argument! Expected array with length \" << t.array_len << \", got \" << json_data;\n\n return;\n\n }\n\n type tp = extract_array_type(t.str);\n\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\n\n encode_param(tp, *it, buffer, buf_size, head_pos, tail_pos);\n\n }\n\n } else if (t.s_array_type == dynamic) {\n\n if (!json_data.is_array()) {\n\n LOG(_ERROR) << \"Invalid argument! Expected array, got \" << json_data;\n\n return;\n\n }\n\n if (t.array_len && json_data.size() != t.array_len) {\n\n LOG(_ERROR) << \"Invalid argument! Expected array with length \" << t.array_len << \", got \" << json_data;\n\n return;\n\n }\n\n std::string encoded;\n\n if (t.array_len == 0) { // Size is unknown; not fixed\n\n encoded = u64_to_u256(json_data.size());\n\n check_and_resize_buffer(buffer, buf_size, *tail_pos, 32);\n\n memcpy(*buffer + *tail_pos, encoded.c_str(), 32);\n\n *tail_pos += 32;\n\n }\n\n uint64_t head_prim_pos = *tail_pos;\n\n uint64_t tail_prim_pos = *tail_pos;\n\n type tp = extract_array_type(t.str);\n\n if (tp.s_array_type == fixed) {\n\n tail_prim_pos += (json_data.size() * calculate_offset({tp.str}));\n\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\n\n encode_param(tp, *it, buffer, buf_size, &head_prim_pos, &tail_prim_pos);\n\n }\n\n } else if (tp.s_type == dynamic_size_bytes || tp.s_type == string || tp.s_array_type == dynamic) {\n\n tail_prim_pos += (32 * json_data.size());\n\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\n\n encoded = u64_to_u256(tail_prim_pos - *tail_pos);\n\n check_and_resize_buffer(buffer, buf_size, head_prim_pos, 32);\n\n memcpy(*buffer + head_prim_pos, encoded.c_str(), 32);\n\n head_prim_pos += 32;\n\n encode_param(tp, *it, buffer, buf_size, &tail_prim_pos, &tail_prim_pos);\n\n }\n\n } else if (tp.s_type == numerical || tp.s_type == fixed_size_bytes) {\n\n tail_prim_pos += (32 * json_data.size());\n\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\n\n encode_param(tp, *it, buffer, buf_size, &head_prim_pos, &tail_prim_pos);\n\n }\n\n } else {\n\n LOG(_ERROR) << \"Invalid type!\" << tp.s_type;\n\n return;\n\n }\n\n *tail_pos = tail_prim_pos;\n\n } else if (t.s_type == string || t.s_type == dynamic_size_bytes) {\n\n if (!json_data.is_string()) {\n\n LOG(_ERROR) << \"Invalid argument!\";\n\n return;\n\n }\n\n std::string s;\n\n std::string data = json_data.get<std::string>();\n\n if (t.s_type == dynamic_size_bytes) {\n\n s = hex2bin(data);\n\n } else {\n\n s = data;\n\n }\n\n std::string encoded = u64_to_u256(s.size());\n\n check_and_resize_buffer(buffer, buf_size, *tail_pos, 32);\n\n memcpy(*buffer + *tail_pos, encoded.c_str(), 32);\n\n *tail_pos += 32;\n\n encoded = encode_string(s);\n\n check_and_resize_buffer(buffer, buf_size, *tail_pos, encoded.size());\n\n memcpy(*buffer + *tail_pos, encoded.c_str(), encoded.size());\n\n *tail_pos += encoded.size();\n\n } else if (t.s_type == fixed_size_bytes) {\n\n if (!json_data.is_string()) {\n\n LOG(_ERROR) << \"Invalid argument! Expected string, got \" << json_data;\n\n return;\n\n }\n\n std::string data = json_data.get<std::string>();\n\n std::string bin_data = hex2bin(data);\n\n if (bin_data.size() > 32) {\n\n LOG(_ERROR) << \"Invalid argument! Size > 32 bytes! \" << data;\n\n return;\n\n }\n\n std::string encoded;\n\n if (t.str == \"address\") {\n\n if (bin_data.size() != 20) {\n\n LOG(_ERROR) << \"Invalid argument! Address size != 20 bytes! \" << data;\n\n return;\n\n }\n\n encoded = std::string(12, '\\0') + bin_data;\n\n } else {\n\n encoded = bin_data + std::string(32 - bin_data.size(), '\\0');\n\n }\n\n check_and_resize_buffer(buffer, buf_size, *head_pos, 32);\n\n memcpy(*buffer + *head_pos, encoded.c_str(), 32);\n\n *head_pos += 32;\n\n } else if (t.s_type == numerical) {\n\n std::string encoded;\n\n if (t.str == \"bool\") {\n\n if (!json_data.is_boolean()) {\n\n LOG(_ERROR) << \"Invalid argument! Expected boolean, got \" << json_data;\n\n return;\n\n }\n\n encoded = u64_to_u256(json_data.get<bool>() ? 1 : 0);\n\n } else if (t.str.find(\"int\") >= 0) {\n\n std::string s;\n\n if (json_data.is_number()) {\n\n s = std::to_string(json_data.get<uint64_t>());\n\n } else if (json_data.is_string()) {\n\n s = json_data.get<std::string>();\n\n } else {\n\n LOG(_ERROR) << \"Invalid argument! Expected number or string, got \" << json_data;\n\n return;\n\n }\n\n bool is_signed = t.str[0] != 'u';\n\n encoded = dec_to_i256(is_signed, s);\n\n } else if (t.str.find(\"fixed\") >= 0) {\n\n LOG(_ERROR) << \"Unsuported data type double!\";\n\n return;\n\n }\n\n check_and_resize_buffer(buffer, buf_size, *head_pos, 32);\n\n memcpy(*buffer + *head_pos, encoded.c_str(), 32);\n\n *head_pos += 32;\n\n } else {\n\n LOG(_ERROR) << \"Undefined type: \" << t.s_type;\n\n }\n\n}\n\n\n\nstatic std::string encode(const std::string& signatures_json, const std::string& parameters_json) {\n\n json j_sigs, j_params;\n\n try {\n\n std::stringstream sigs(signatures_json);\n\n sigs >> j_sigs;\n\n std::stringstream params(parameters_json);\n\n params >> j_params;\n\n } catch (const std::exception& e) {\n\n LOG(_ERROR) << \"Json error: \" << e.what();\n\n return \"\";\n\n }\n\n\n\n if (!j_params.is_array() || j_params.size() != j_sigs.size()) {\n\n LOG(_ERROR) << \"Invalid arguments!\";\n\n return \"\";\n\n }\n\n\n\n char* buffer = new char[BUFFER_SIZE];\n\n uint64_t buf_size = BUFFER_SIZE;\n\n\n\n std::vector<std::string> signatures;\n\n try {\n\n signatures = j_sigs.get<std::vector<std::string> >();\n\n } catch (const std::exception& e) {\n\n LOG(_ERROR) << \"Invalid arguments! \" << e.what();\n\n return \"\";\n\n }\n\n\n\n uint64_t head_pos = 0;\n\n uint64_t tail_pos = calculate_offset(signatures);\n\n std::string signature;\n\n auto p_it = j_params.begin();\n\n uint32_t s_i = 0;\n\n for (; s_i < signatures.size() && p_it != j_params.end(); ++s_i, ++p_it) {\n\n signature = signatures[s_i];\n\n type t = get_type(signature);\n\n if (t.s_type == dynamic_size_bytes || t.s_type == string || t.s_array_type == dynamic) {\n\n std::string encoded = u64_to_u256(tail_pos);\n\n check_and_resize_buffer(&buffer, &buf_size, tail_pos, 32);\n\n memcpy(buffer + head_pos, encoded.c_str(), 32);\n\n head_pos += 32;\n\n encode_param(t, *p_it, &buffer, &buf_size, &tail_pos, &tail_pos);\n\n } else {\n\n encode_param(t, *p_it, &buffer, &buf_size, &head_pos, &tail_pos);\n\n }\n\n }\n\n std::string result = std::string(buffer, tail_pos);\n\n delete [] buffer;\n\n return std::move(result);\n\n}\n\n\n\nstatic std::string decode_param(type t, const std::string& data, uint64_t pos) {\n\n if (t.s_array_type == fixed) {\n\n auto tp = extract_array_type(t.str);\n\n std::stringstream ss;\n\n ss << '[';\n\n if (tp.s_array_type == fixed) {\n\n for (int32_t i = 0; i < t.array_len - 1; ++i) {\n\n ss << decode_param(tp, data, pos) << \",\";\n\n pos += calculate_offset({tp.str});\n\n }\n\n ss << decode_param(tp, data, pos);\n\n } else if (tp.s_type == numerical || tp.s_type == fixed_size_bytes) {\n\n for (int32_t i = 0; i < t.array_len - 1; ++i) {\n\n ss << decode_param(tp, data, pos) << \",\";\n\n pos += 32;\n\n }\n\n ss << decode_param(tp, data, pos);\n\n }\n\n ss << ']';\n\n return ss.str();\n\n } else if (t.s_array_type == dynamic) {\n\n int64_t len = t.array_len;\n\n if (len == 0) {\n\n std::string s = data.substr(pos, 32);\n\n len = u256_to_u64(s);\n\n pos += 32;\n\n }\n\n std::stringstream ss;\n\n ss << '[';\n\n auto tp = extract_array_type(t.str);\n\n if (tp.s_array_type == no_array && (tp.s_type == numerical || tp.s_type == fixed_size_bytes)) {\n\n for (int32_t i = 0; i < len - 1; ++i) {\n\n ss << decode_param(tp, data, pos) << \",\";\n\n pos += 32;\n\n }\n\n ss << decode_param(tp, data, pos);\n\n } else if (tp.s_array_type == fixed) {\n\n for (int32_t i = 0; i < len - 1; ++i) {\n\n ss << decode_param(tp, data, pos) << \",\";\n\n pos += calculate_offset({tp.str});\n\n }\n\n ss << decode_param(tp, data, pos);\n\n } else if (tp.s_type == string || tp.s_type == dynamic_size_bytes || tp.s_array_type == dynamic) {\n\n for (int32_t i = 0; i < len - 1; ++i) {\n\n std::string s = data.substr(pos + (32 * i), 32);\n\n uint64_t offset = u256_to_u64(s);\n\n ss << decode_param(tp, data, pos + offset) << \",\";\n\n }\n\n std::string s = data.substr(pos + (32 * (len - 1)), 32);\n\n uint64_t offset = u256_to_u64(s);\n\n ss << decode_param(tp, data, pos + offset);\n\n } else {\n\n LOG(_ERROR) << \"Invalid type!\";\n\n return \"\";\n\n }\n\n ss << ']';\n\n return ss.str();\n\n } else if (t.s_type == dynamic_size_bytes || t.s_type == string) {\n\n std::string s = data.substr(pos, 32);\n\n int64_t len = u256_to_u64(s);\n\n pos += 32;\n\n std::string res = data.substr(pos, len);\n\n if (t.s_type == string) {\n\n return '\"' + res + '\"';\n\n }\n\n return '\"' + bin2hex(res) + '\"';\n\n } else if (t.s_type == numerical) {\n\n std::string res = data.substr(pos, 32);\n\n if (t.str == \"bool\") {\n\n uint64_t k = u256_to_u64(res);\n\n return k > 0 ? \"true\" : \"false\";\n\n } else if (t.str.find(\"int\") >= 0) {\n\n bool is_signed = t.str[0] != 'u';\n\n return '\"' + i256_to_dec(is_signed, res) + '\"';\n\n } else if (t.str.find(\"fixed\") >= 0) {\n\n LOG(_ERROR) << \"Unsuported data type double!\";\n\n return \"\\\"\\\"\";\n\n }\n\n return \"\";\n\n } else if (t.s_type == fixed_size_bytes) {\n\n if (t.str == \"address\") {\n\n std::string res = data.substr(pos, 32);\n\n return '\"' + bin2hex(res.substr(12, 20)) + '\"';\n\n }\n\n std::regex rgx_sim(\"bytes(\\\\d+)\");\n\n std::smatch match;\n\n const std::string sig = t.str;\n\n uint32_t k = 32;\n\n if (t.str == \"function\") {\n\n k = 24;\n\n } else if (std::regex_match(sig.begin(), sig.end(), match, rgx_sim) && match.size() == 2) {\n\n k = std::stoul(match[1]);\n\n }\n\n std::string res = data.substr(pos, k);\n\n return '\"' + bin2hex(res) + '\"';\n\n } else {\n\n LOG(_ERROR) << \"Undefined type: \" << t.s_type;\n\n }\n\n return \"\";\n\n}\n\n\n\nstatic std::string decode(const std::string& signatures_json, const std::string& data) {\n\n json j_sigs, j_params;\n\n try {\n\n std::stringstream sigs(signatures_json);\n\n sigs >> j_sigs;\n\n } catch (const std::exception& e) {\n\n LOG(_ERROR) << \"Json error: \" << e.what();\n\n return \"\";\n\n }\n\n\n\n std::stringstream ss;\n\n std::string signature;\n\n ss << '[';\n\n uint64_t pos = 0;\n\n for (auto s_it = j_sigs.begin(); s_it != j_sigs.end();) {\n\n signature = (*s_it).get<std::string>();\n\n type t = get_type(signature);\n\n if (t.s_type == dynamic_size_bytes || t.s_type == string || t.s_array_type == dynamic) {\n\n std::string s = data.substr(pos, 32);\n\n uint64_t offset = u256_to_u64(s);\n\n ss << decode_param(t, data, offset);\n\n } else {\n\n ss << decode_param(t, data, pos);\n\n }\n\n if (++s_it != j_sigs.end()) {\n\n ss << ',';\n\n }\n\n if (t.s_array_type == fixed) {\n\n pos += calculate_offset({t.str});\n\n } else {\n\n pos += 32;\n\n }\n\n }\n\n ss << ']';\n\n return ss.str();\n\n}\n\n\n\n} // namespace ethereum\n\n} // namespace interop\n","file_path":"src/automaton/core/interop/ethereum/eth_helper_functions.h","rank":40,"score":84633.63705223227},{"content":"function chat_node(id)\n\n local n = node(id, \"automaton/examples/smartproto/chat/\")\n\n\n\n _G[id] = {\n\n node_type = \"chat\",\n\n }\n\n\n\n return n\n\nend\n","file_path":"src/automaton/examples/smartproto/chat/init.lua","rank":41,"score":78261.6856954901},{"content":"function blockchain_node(id)\n\n local n = node(id, \"automaton/examples/smartproto/blockchain/\")\n\n\n\n -- print(id)\n\n _G[id] = {\n\n node_type = \"blockchain\",\n\n\n\n set_mining_power = function(x)\n\n n:script(\"MINE_ATTEMPTS=\" .. x .. \" return ''\")\n\n end,\n\n\n\n get_mining_power = function()\n\n n:script(\"return tostring(MINE_ATTEMPTS)\");\n\n end,\n\n\n\n get_stats = function()\n\n return n:script(\"return node_stats()\")\n\n end,\n\n\n\n disconnect_all = function()\n","file_path":"src/automaton/examples/smartproto/blockchain/init.lua","rank":42,"score":78261.6856954901},{"content":"class blockchain_cpp_node : public automaton::core::node::node {\n\n public:\n\n blockchain_cpp_node(const std::string& id, const std::string& proto_id);\n\n\n\n ~blockchain_cpp_node();\n\n\n\n void init();\n\n\n\n void script(const std::string& command, std::promise<std::string>* result) {}\n\n\n\n std::string process_cmd(const std::string& cmd, const std::string& params);\n\n\n\n std::string node_stats(uint32_t last_blocks);\n\n\n\n block get_blockchain_top();\n\n\n\n uint32_t get_blocks_size() {\n\n return blocks.size();\n\n }\n\n\n","file_path":"src/automaton/examples/node/blockchain_cpp_node/blockchain_cpp_node.h","rank":43,"score":77876.32672979373},{"content":"function reservation_system_node(id)\n\n local n = node(id, \"automaton/examples/smartproto/reservationsystem/\")\n\n\n\n -- print(id)\n\n _G[id] = {\n\n node_type = \"reservation_system_node\",\n\n\n\n connect = function(peer_id)\n\n n:call(\"connect(\"..tostring(peer_id)..\")\")\n\n end,\n\n\n\n reserve = function(room_id, start_day, end_day)\n\n n:call(\"reserve(\" .. tostring(room_id) .. \",\"\n\n .. tostring(start_day) .. \",\"\n\n .. tostring(end_day) .. \")\")\n\n end,\n\n\n\n cancel = function(room_id, start_day, end_day)\n\n n:call(\"cancel(\" .. tostring(room_id) .. \",\"\n\n .. tostring(start_day) .. \",\"\n\n .. tostring(end_day) .. \")\")\n\n end\n\n }\n\n return n\n\nend\n\n\n\n-- test network functions\n\n\n","file_path":"src/automaton/examples/smartproto/reservationsystem/init.lua","rank":44,"score":77233.76974964066},{"content":"function testnet(discovery, node_factory, num_nodes, num_peers, path)\n\n return discovery(node_factory, num_nodes, num_peers, path)\n\nend\n\n\n","file_path":"src/automaton/examples/smartproto/common/network.lua","rank":45,"score":62659.26343585753},{"content":" uint32_t number_nodes, std::unordered_map<uint32_t, std::vector<uint32_t> > peer_list) {\n\n bool success = false;\n\n if (ntype == \"simulation\") {\n\n success = testnet::create_testnet(\"lua\", id, smart_protocol_id, testnet::network_protocol_type::simulation,\n\n number_nodes, peer_list);\n\n } else if (ntype == \"localhost\") {\n\n success = testnet::create_testnet(\"lua\", id, smart_protocol_id, testnet::network_protocol_type::localhost,\n\n number_nodes, peer_list);\n\n }\n\n if (!success) {\n\n throw std::runtime_error(\"Testnet creation failed!\");\n\n }\n\n std::shared_ptr<testnet> net = testnet::get_testnet(id);\n\n for (auto nid : net->list_nodes()) {\n\n updater->add_node(nid);\n\n }\n\n });\n\n\n\n script.set(\"testnet_destroy\", &testnet::destroy_testnet);\n\n\n","file_path":"src/automaton/core/core.cc","rank":46,"score":60032.74038196619},{"content":" script.set(\"testnet_list_all\", &testnet::list_testnets);\n\n\n\n script.set_function(\"connect_testnet_nodes\",\n\n [&](std::string id, std::unordered_map<uint32_t, std::vector<uint32_t> > peers_list) {\n\n auto net = testnet::get_testnet(id);\n\n if (net == nullptr) {\n\n LOG(ERROR) << \"No testnet with id \" << id;\n\n } else {\n\n net->connect(peers_list);\n\n }\n\n });\n\n\n\n script.set_function(\"list_testnet_nodes\", [&](std::string id) {\n\n auto net = testnet::get_testnet(id);\n\n if (net == nullptr) {\n\n LOG(ERROR) << \"No testnet with id \" << id;\n\n } else {\n\n return net->list_nodes();\n\n }\n\n return std::vector<std::string>();\n","file_path":"src/automaton/core/core.cc","rank":47,"score":60028.3096206236},{"content":" });\n\n\n\n script.set_function(\"get_testnet_node_id\", [&](std::string testnet_id, uint32_t index) -> std::string {\n\n auto net = testnet::get_testnet(testnet_id);\n\n if (net == nullptr) {\n\n LOG(ERROR) << \"No testnet with id \" << testnet_id;\n\n return \"\";\n\n }\n\n std::vector<std::string> nodes = net->list_nodes();\n\n if (index < 1 || index > nodes.size()) {\n\n LOG(ERROR) << \"No node with index \" << index;\n\n return \"\";\n\n }\n\n return nodes[index - 1];\n\n });\n\n\n\n // end of testnet functions\n\n\n\n script.set_function(\"history_add\", [&](std::string cmd){\n\n cli.history_add(cmd.c_str());\n","file_path":"src/automaton/core/core.cc","rank":48,"score":60025.548640974164},{"content":"#include \"automaton/core/node/node.h\"\n\n#include \"automaton/core/node/node_updater.h\"\n\n#include \"automaton/core/script/engine.h\"\n\n#include \"automaton/core/smartproto/smart_protocol.h\"\n\n#include \"automaton/core/testnet/testnet.h\"\n\n\n\n#include \"automaton/core/io/io.h\" // IO needs to be included after boost\n\n\n\nusing automaton::core::data::factory;\n\nusing automaton::core::data::protobuf::protobuf_factory;\n\nusing automaton::core::data::protobuf::protobuf_schema;\n\nusing automaton::core::data::schema;\n\nusing automaton::core::io::get_file_contents;\n\nusing automaton::core::network::http_server;\n\nusing automaton::core::node::luanode::lua_node;\n\nusing automaton::core::node::node;\n\nusing automaton::core::node::default_node_updater;\n\nusing automaton::core::script::engine;\n\nusing automaton::core::smartproto::smart_protocol;\n\nusing automaton::core::testnet::testnet;\n","file_path":"src/automaton/core/core.cc","rank":49,"score":60023.917746297084},{"content":" curl_global_init(CURL_GLOBAL_DEFAULT);\n\n\n\n automaton::core::io::init_logger();\n\n automaton::core::cli::cli cli;\n\n engine script(core_factory);\n\n script.bind_core();\n\n\n\n // Bind node::node class\n\n auto node_type = script.create_simple_usertype<lua_node>();\n\n\n\n node_type.set(sol::call_constructor,\n\n sol::factories(\n\n [&](const std::string& id, std::string proto) -> std::shared_ptr<lua_node> {\n\n return std::dynamic_pointer_cast<lua_node>(node::create(\"lua\", id, proto));\n\n }));\n\n\n\n // Bind this node to its own Lua state.\n\n node_type.set(\"add_peer\", &lua_node::add_peer);\n\n node_type.set(\"remove_peer\", &lua_node::remove_peer);\n\n node_type.set(\"connect\", &lua_node::connect);\n","file_path":"src/automaton/core/core.cc","rank":50,"score":60021.50317361124},{"content":" script.set_function(\"list_nodes_as_table\", [&](){\n\n return sol::as_table(node::list_nodes());\n\n });\n\n\n\n script.set_function(\"get_node\", [&](const std::string& node_id) -> std::shared_ptr<lua_node> {\n\n return std::dynamic_pointer_cast<lua_node>(node::get_node(node_id));\n\n });\n\n\n\n script.set_function(\"launch_node\", [&](std::string node_id, std::string protocol_id, std::string address) {\n\n LOG(INFO) << \"launching node ... \" << node_id << \" on \" << protocol_id << \" @ \" << address;\n\n node::launch_node(\"lua\", node_id, protocol_id, address);\n\n updater->add_node(node_id);\n\n return \"\";\n\n });\n\n\n\n script.set_function(\"remove_node\", &node::remove_node);\n\n\n\n // Bind testnet static functions\n\n\n\n script.set(\"testnet_create\", [&](std::string id, std::string smart_protocol_id, std::string ntype,\n","file_path":"src/automaton/core/core.cc","rank":51,"score":60021.47559042056},{"content":" });\n\n\n\n script.set_function(\"hints_add\", [&](std::string cmd){\n\n cli.hints_add(cmd.c_str());\n\n });\n\n\n\n script.set_function(\"hints_clear\", [&](){\n\n cli.hints_clear();\n\n });\n\n\n\n script.set_function(\"load_protocol\", [&](std::string proto_id, std::string path){\n\n smart_protocol::load(proto_id, path);\n\n });\n\n\n\n automaton::core::network::tcp_init();\n\n\n\n std::shared_ptr<automaton::core::network::simulation> sim = automaton::core::network::simulation::get_simulator();\n\n sim->simulation_start(100);\n\n cli.print(automaton_ascii_logo.c_str());\n\n\n","file_path":"src/automaton/core/core.cc","rank":52,"score":60020.37181057663},{"content":"#include <curl/curl.h>\n\n#include <cryptopp/base64.h>\n\n#include <cryptopp/filters.h>\n\n\n\n#include <future>\n\n#include <fstream>\n\n#include <iostream>\n\n#include <regex>\n\n#include <string>\n\n\n\n#include <json.hpp>\n\n\n\n#include \"automaton/core/cli/cli.h\"\n\n#include \"automaton/core/data/factory.h\"\n\n#include \"automaton/core/data/protobuf/protobuf_factory.h\"\n\n#include \"automaton/core/data/protobuf/protobuf_schema.h\"\n\n#include \"automaton/core/network/http_server.h\"\n\n#include \"automaton/core/network/simulated_connection.h\"\n\n#include \"automaton/core/network/tcp_implementation.h\"\n\n#include \"automaton/core/node/lua_node/lua_node.h\"\n","file_path":"src/automaton/core/core.cc","rank":53,"score":60019.10394696151},{"content":" LOG(ERROR) << \"Status code variable is missing\";\n\n }\n\n std::string encoded;\n\n CryptoPP::StringSource ss(reinterpret_cast<const unsigned char*>(result.c_str()), result.size(), true,\n\n new CryptoPP::Base64Encoder(new CryptoPP::StringSink(encoded)));\n\n return encoded;\n\n }\n\n};\n\n\n\nint main(int argc, char* argv[]) {\n\n string automaton_ascii_logo(automaton_ascii_logo_cstr);\n\n string_replace(&automaton_ascii_logo, \"@\", \"\\x1b[38;5;\");\n\n auto core_factory = std::make_shared<protobuf_factory>();\n\n node::register_node_type(\"lua\", [](const std::string& id, const std::string& proto_id)->std::shared_ptr<node> {\n\n return std::shared_ptr<node>(new lua_node(id, proto_id));\n\n });\n\n\n\n default_node_updater* updater;\n\n{\n\n // TODO(asen): Get rid of this, it is temporary to verify libcurl works across all platforms.\n","file_path":"src/automaton/core/core.cc","rank":54,"score":60015.55257799395},{"content":" node_type.set(\"get_address\", [](lua_node& n) -> std::string {\n\n std::shared_ptr<automaton::core::network::acceptor> a = n.get_acceptor();\n\n if (a) {\n\n return a->get_address();\n\n }\n\n return \"\";\n\n });\n\n\n\n node_type.set(\"process_cmd\", &lua_node::process_cmd);\n\n\n\n node_type.set(\"process_update\", &lua_node::process_update);\n\n\n\n node_type.set(\"get_time_to_update\", &lua_node::get_time_to_update);\n\n\n\n node_type.set(\"call\", [](lua_node& n, std::string command) {\n\n n.script(command, nullptr);\n\n });\n\n\n\n node_type.set(\"known_peers\", [](lua_node& n) {\n\n LOG(DBUG) << \"getting known peers... \" << &n;\n","file_path":"src/automaton/core/core.cc","rank":55,"score":60012.66084536088},{"content":" node_type.set(\"disconnect\", &lua_node::disconnect);\n\n node_type.set(\"send\", &lua_node::send_message);\n\n node_type.set(\"listen\", &lua_node::set_acceptor);\n\n\n\n node_type.set(\"msg_id\", &lua_node::find_message_id);\n\n node_type.set(\"new_msg\", &lua_node::create_msg_by_id);\n\n node_type.set(\"send\", &lua_node::send_message);\n\n\n\n node_type.set(\"dump_logs\", &lua_node::dump_logs);\n\n\n\n node_type.set(\"script\", [](lua_node& n, std::string command) -> std::string {\n\n std::promise<std::string> prom;\n\n std::future<std::string> fut = prom.get_future();\n\n n.script(command, &prom);\n\n std::string result = fut.get();\n\n return result;\n\n });\n\n\n\n node_type.set(\"get_id\", &lua_node::get_id);\n\n node_type.set(\"get_protocol_id\", &lua_node::get_protocol_id);\n","file_path":"src/automaton/core/core.cc","rank":56,"score":60012.14519883586},{"content":"history_add(\"testnet_get_node_id()\")\n\nhints_add(\"testnet_get_node_id()\")\n\nhistory_add(\"testnet_destroy()\")\n\nhints_add(\"testnet_destroy()\")\n\n\n\nhistory_add(\"start_testnet()\")\n\nhints_add(\"start_testnet()\")\n\n\n\nhistory_add(\"history_add()\")\n\nhints_add(\"history_add()\")\n\nhistory_add(\"hints_add()\")\n\nhints_add(\"hints_add()\")\n\nhistory_add(\"hints_clear()\")\n\nhints_add(\"hints_clear()\")\n\n\n\n-- PROTOCOLS RPC --\n\n\n","file_path":"src/automaton/core/core.lua","rank":57,"score":60011.42975041688},{"content":" }\n\n logger_mutex.unlock();\n\n }\n\n });\n\n\n\n std::shared_ptr<automaton::core::network::http_server::server_handler> s_handler(new rpc_server_handler(&script));\n\n http_server rpc_server(rpc_port, s_handler);\n\n rpc_server.run();\n\n\n\n while (1) {\n\n auto input = cli.input(\"\\x1b[38;5;15m\\x1b[1m|A|\\x1b[0m \");\n\n if (input == nullptr) {\n\n cli.print(\"\\n\");\n\n break;\n\n }\n\n\n\n string cmd{input};\n\n cli.history_add(cmd.c_str());\n\n\n\n logger_mutex.lock();\n","file_path":"src/automaton/core/core.cc","rank":58,"score":60011.37089950824},{"content":" script.safe_script(get_file_contents(\"automaton/examples/smartproto/common/names.lua\"));\n\n script.safe_script(get_file_contents(\"automaton/examples/smartproto/common/dump.lua\"));\n\n script.safe_script(get_file_contents(\"automaton/examples/smartproto/common/network.lua\"));\n\n script.safe_script(get_file_contents(\"automaton/examples/smartproto/common/connections_graph.lua\"));\n\n script.safe_script(get_file_contents(\"automaton/examples/smartproto/common/show_states.lua\"));\n\n\n\n std::unordered_map<std::string, std::pair<std::string, std::string> > rpc_commands;\n\n uint32_t rpc_port = 0;\n\n uint32_t updater_workers_number = 0;\n\n uint32_t updater_workers_sleep_time = 0;\n\n\n\n std::ifstream i(\"automaton/core/coreinit.json\");\n\n if (!i.is_open()) {\n\n LOG(ERROR) << \"coreinit.json could not be opened\";\n\n } else {\n\n nlohmann::json j;\n\n i >> j;\n\n i.close();\n\n std::vector<std::vector<std::string>> protocols = j[\"protocols\"];\n\n for (auto& p : protocols) {\n","file_path":"src/automaton/core/core.cc","rank":59,"score":60011.22935354277},{"content":" std::vector<std::string> rpc_luas = j[\"command_implementations\"];\n\n for (auto& p : rpc_luas) {\n\n script.safe_script(get_file_contents(p.c_str()));\n\n }\n\n for (auto& c : j[\"commands\"]) {\n\n rpc_commands[c[\"cmd\"]] = std::make_pair(c[\"input\"], c[\"output\"]);\n\n }\n\n rpc_port = j[\"rpc_config\"][\"default_port\"];\n\n\n\n updater_workers_number = j[\"updater_config\"][\"workers_number\"];\n\n updater_workers_sleep_time = j[\"updater_config\"][\"workers_sleep_time\"];\n\n }\n\n i.close();\n\n updater = new default_node_updater(updater_workers_number, updater_workers_sleep_time, std::set<std::string>());\n\n updater->start();\n\n\n\n // Start dump_logs thread.\n\n std::mutex logger_mutex;\n\n bool stop_logger = false;\n\n std::thread logger([&]() {\n","file_path":"src/automaton/core/core.cc","rank":60,"score":60010.90861951198},{"content":" std::string pid = p[0];\n\n std::string path = p[1];\n\n script.safe_script(get_file_contents((path + \"init.lua\").c_str()));\n\n smart_protocol::load(pid, path);\n\n }\n\n script.set_function(\"get_core_supported_protocols\", [&](){\n\n std::unordered_map<std::string, std::unordered_map<std::string, std::string> > protocols;\n\n for (std::string proto : smart_protocol::list_protocols()) {\n\n auto p = smart_protocol::get_protocol(proto);\n\n protocols[proto] = p->get_msgs_definitions();\n\n protocols[proto][\"config\"] = p->get_configuration_file();\n\n }\n\n return sol::as_table(protocols);\n\n });\n\n\n\n std::vector<std::string> rpc_protos = j[\"command_definitions\"];\n\n for (auto& p : rpc_protos) {\n\n schema* rpc_schema = new protobuf_schema(get_file_contents(p.c_str()));\n\n script.import_schema(rpc_schema);\n\n }\n","file_path":"src/automaton/core/core.cc","rank":61,"score":60010.344319513315},{"content":"}\n\n\n\n LOG(DBUG) << \"tcp_release\";\n\n\n\n automaton::core::network::tcp_release();\n\n\n\n LOG(DBUG) << \"tcp_release done.\";\n\n\n\n return 0;\n\n}\n","file_path":"src/automaton/core/core.cc","rank":62,"score":60009.998278515945},{"content":" // TODO(asen): need STL support for logger\n\n // LOG(DBUG) << n.list_known_peers();\n\n return sol::as_table(n.list_known_peers());\n\n });\n\n\n\n node_type.set(\"peers\", [](lua_node& n) {\n\n LOG(DBUG) << \"getting peers... \" << &n;\n\n // TODO(asen): need STL support for logger\n\n // LOG(DBUG) << n.list_connected_peers();\n\n return sol::as_table(n.list_connected_peers());\n\n });\n\n\n\n node_type.set(\"get_peer_address\", [](lua_node& n, uint32_t pid) {\n\n return n.get_peer_info(pid).address;\n\n });\n\n\n\n script.set_usertype(\"node\", node_type);\n\n\n\n // Bind node static functions\n\n\n","file_path":"src/automaton/core/core.cc","rank":63,"score":60009.03724070865},{"content":"\n\nusing json = nlohmann::json;\n\n\n\nusing std::make_unique;\n\nusing std::string;\n\nusing std::unique_ptr;\n\nusing std::vector;\n\n\n\nvoid string_replace(string* str,\n\n const string& oldStr,\n\n const string& newStr) {\n\n string::size_type pos = 0u;\n\n while ((pos = str->find(oldStr, pos)) != string::npos) {\n\n str->replace(pos, oldStr.length(), newStr);\n\n pos += newStr.length();\n\n }\n\n}\n\n\n\nstatic const char* automaton_ascii_logo_cstr =\n\n \"\\n\\x1b[40m\\x1b[1m\"\n\n \" \" \"\\x1b[0m\\n\\x1b[40m\\x1b[1m\"\n\n \" \" \"\\x1b[0m\\n\\x1b[40m\\x1b[1m\"\n\n \" @197m█▀▀▀█ @39m█ █ █ @11m▀▀█▀▀ @129m█▀▀▀█ @47m█▀█▀█ @9m█▀▀▀█ @27m▀▀█▀▀ @154m█▀▀▀█ @13m█▀█ █ \" \"\\x1b[0m\\n\\x1b[40m\\x1b[1m\" // NOLINT\n\n \" @197m█▀▀▀█ @39m█ ▀ █ @11m█ █ █ @129m█ ▀ █ @47m█ ▀ █ @9m█▀▀▀█ @27m█ █ █ @154m█ ▀ █ @13m█ █ █ @15mCORE \" \"\\x1b[0m\\n\\x1b[40m\\x1b[1m\" // NOLINT\n\n \" @197m▀ ▀ ▀ @39m▀▀▀▀▀ @11m▀ ▀ ▀ @129m▀▀▀▀▀ @47m▀ ▀ ▀ @9m▀ ▀ ▀ @27m▀ ▀ ▀ @154m▀▀▀▀▀ @13m▀ ▀▀▀ @15mv0.0.1 \" \"\\x1b[0m\\n\\x1b[40m\\x1b[1m\" // NOLINT\n\n \" \" \"\\x1b[0m\\n@0m\"\n\n \"▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀\" \"\\x1b[0m\\n\";\n\n\n","file_path":"src/automaton/core/core.cc","rank":64,"score":60008.60095139311},{"content":" LOG(INFO) << \"Server received command: \" << cmd << \" -> \" << automaton::core::io::bin2hex(msg);\n\n if (msg.size() > 0) {\n\n CryptoPP::StringSource ss(msg, true, new CryptoPP::Base64Decoder(new CryptoPP::StringSink(params)));\n\n }\n\n if ((*script)[cmd] == nullptr) {\n\n LOG(ERROR) << \"ERROR in rpc server handler: Invalid request\";\n\n *s = http_server::status_code::BAD_REQUEST;\n\n return \"\";\n\n }\n\n sol::protected_function_result pfr = (*script)[cmd](params);\n\n if (!pfr.valid()) {\n\n sol::error err = pfr;\n\n LOG(ERROR) << \"ERROR in rpc server handler: \" << err.what();\n\n *s = http_server::status_code::INTERNAL_SERVER_ERROR;\n\n return \"\";\n\n }\n\n std::string result = pfr;\n\n if (s != nullptr) {\n\n *s = http_server::status_code::OK;\n\n } else {\n","file_path":"src/automaton/core/core.cc","rank":65,"score":60006.569943505136},{"content":"\n\nhistory_add(\"add_peers()\")\n\nhints_add(\"add_peers()\")\n\nhistory_add(\"remove_peers()\")\n\nhints_add(\"remove_peers()\")\n\nhistory_add(\"list_known_peers()\")\n\nhints_add(\"list_known_peers()\")\n\nhistory_add(\"list_connected_peers()\")\n\nhints_add(\"list_connected_peers()\")\n\nhistory_add(\"get_peers()\")\n\nhints_add(\"get_peers()\")\n\nhistory_add(\"connect()\")\n\nhints_add(\"connect()\")\n\nhistory_add(\"disconnect()\")\n\nhints_add(\"disconnect()\")\n\nhistory_add(\"process_cmd()\")\n\nhints_add(\"process_cmd()\")\n\n\n\nhistory_add(\"testnet_create()\")\n\nhints_add(\"testnet_create()\")\n","file_path":"src/automaton/core/core.lua","rank":66,"score":60005.1849412731},{"content":"-- core.lua\n\n\n\n-- add rpc/core commands to cli history/hints\n\nhistory_add(\"list_supported_protocols()\")\n\nhints_add(\"list_supported_protocols()\")\n\nhistory_add(\"list_running_protocols()\")\n\nhints_add(\"list_running_protocols()\")\n\nhistory_add(\"get_protocols()\")\n\nhints_add(\"get_protocols()\")\n\nhistory_add(\"load_protocol()\")\n\nhints_add(\"load_protocol()\")\n\n\n\nhistory_add(\"launch_node()\")\n\nhints_add(\"launch_node()\")\n\nhistory_add(\"list_nodes()\")\n\nhints_add(\"list_nodes()\")\n\nhistory_add(\"get_node()\")\n\nhints_add(\"get_node()\")\n\nhistory_add(\"remove_node()\")\n\nhints_add(\"remove_node()\")\n","file_path":"src/automaton/core/core.lua","rank":67,"score":60004.942561872005},{"content":" sol::protected_function_result pfr = script.safe_script(cmd, &sol::script_pass_on_error);\n\n logger_mutex.unlock();\n\n\n\n if (!pfr.valid()) {\n\n sol::error err = pfr;\n\n LOG(ERROR) << \"Error while executing command: \" << err.what();\n\n }\n\n }\n\n\n\n rpc_server.stop();\n\n\n\n updater->stop();\n\n delete updater;\n\n\n\n stop_logger = true;\n\n logger.join();\n\n\n\n LOG(DBUG) << \"Destroying lua state & objects\";\n\n\n\n sim->simulation_stop();\n","file_path":"src/automaton/core/core.cc","rank":68,"score":60000.730238236814},{"content":"end\n\n-----------------\n\n\n","file_path":"src/automaton/core/core.lua","rank":69,"score":60000.730238236814},{"content":" while (!stop_logger) {\n\n // Dump logs once per second.\n\n std::this_thread::sleep_for(std::chrono::milliseconds(1500));\n\n logger_mutex.lock();\n\n try {\n\n sol::protected_function_result pfr;\n\n pfr = script.safe_script(\n\n R\"(for k,v in pairs(networks) do\n\n dump_logs(k)\n\n end\n\n )\");\n\n if (!pfr.valid()) {\n\n sol::error err = pfr;\n\n std::cout << \"\\n\" << err.what() << \"\\n\";\n\n break;\n\n }\n\n } catch (std::exception& e) {\n\n LOG(FATAL) << \"Exception in logger: \" << e.what();\n\n } catch (...) {\n\n LOG(FATAL) << \"Exception in logger\";\n","file_path":"src/automaton/core/core.cc","rank":70,"score":60000.730238236814},{"content":"function sent(peer_id, msg_id)\n\nend\n\n\n\nMIN_LAG = 0\n\nMAX_LAG = 0\n\nlag = 0\n\nd_blocks = {}\n\ncurrent_message_id = 0\n\n\n","file_path":"src/automaton/examples/smartproto/blockchain/connections.lua","rank":71,"score":59140.89621652327},{"content":"function sent(peer_id, msg_id, success)\n\n -- log(\"sent\",\n\n -- string.format(\"Sent to %s (%d), success: %s\", peers[peer_id].name, msg_id, tostring(success))\n\n -- )\n\nend\n\n\n","file_path":"src/automaton/examples/smartproto/chat/chat.lua","rank":72,"score":58341.32782408651},{"content":"function sent(peer_id, msg_id, success)\n\nend\n\n\n","file_path":"src/automaton/examples/smartproto/reservationsystem/reservationsystem.lua","rank":73,"score":58341.32782408651},{"content":"function list_nodes()\n\n local res = NodeIdsList()\n\n for _,id in ipairs(list_nodes_as_table()) do\n\n res.node_ids = id\n\n end\n\n return res:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":74,"score":58214.18348942617},{"content":"function rpc_disconnect(m)\n\n local request = PeerIdsList()\n\n request:deserialize(m)\n\n return disconnect(request.node_id, request.peer_ids)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":75,"score":58214.18348942617},{"content":"function rpc_connect(m)\n\n local request = PeerIdsList()\n\n request:deserialize(m)\n\n return connect(request.node_id, request.peer_ids)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":76,"score":58214.18348942617},{"content":"#include <memory>\n\n#include <string>\n\n\n\n#include \"automaton/core/network/tcp_implementation.h\"\n\n\n\nstatic const char* SERVER_ADDRESS = \"127.0.0.1:33777\";\n\nusing namespace automaton::core::network; // NOLINT\n\n\n\nstd::shared_ptr<connection> connection_c;\n\n\n","file_path":"src/automaton/core/rpc_server_core_test.cc","rank":77,"score":57386.562634860435},{"content":" std::stringstream ss;\n\n ss << \"GET /hello.htm HTTP/1.1\\r\\n\";\n\n ss << \"User-Agent: Mozilla/4.0 (compatible; MSIE5.01; Windows NT)\\r\\n\";\n\n ss << \"Host: localhost\\r\\n\";\n\n ss << \"Accept-Language: en-us\\r\\n\";\n\n ss << \"Accept-Encoding: gzip, deflate\\r\\n\";\n\n ss << \"Content-Length: \" << input.size() << \"\\r\\n\";\n\n ss << \"Connection: Keep-Alive\\r\\n\";\n\n ss << \"\\r\\n\" << input;\n\n\n\n connection_c -> async_send(ss.str(), 0);\n\n }\n\n connection_c -> disconnect();\n\n } else {\n\n std::cout << \"Connection init failed!\" << std::endl;\n\n }\n\n}\n\n\n\nint main(int argc, char* argv[]) {\n\n automaton::core::network::tcp_init();\n\n client();\n\n automaton::core::network::tcp_release();\n\n return 0;\n\n}\n","file_path":"src/automaton/core/rpc_server_core_test.cc","rank":78,"score":57373.54285717968},{"content":" void on_connection_error(connection_id c, const automaton::core::common::status& s) {\n\n if (s.code == automaton::core::common::status::OK) {\n\n return;\n\n }\n\n std::cout << s << std::endl;\n\n }\n\n};\n\n\n\nstd::shared_ptr<char> buffer_c = std::shared_ptr<char>(new char[256], std::default_delete<char[]>());\n\n\n\nstd::shared_ptr<client_handler> handler_c;\n\n\n\nvoid client() {\n\n connection_c = connection::create(\"tcp\", 1, SERVER_ADDRESS, std::move(handler_c));\n\n if (connection_c->init()) {\n\n std::cout << \"Connection init was successful!\" << std::endl;\n\n connection_c -> connect();\n\n connection_c -> async_read(buffer_c, 256, 0, 0);\n\n std::string input;\n\n while (std::getline(std::cin, input)) {\n","file_path":"src/automaton/core/rpc_server_core_test.cc","rank":79,"score":57373.31224076798},{"content":"function rpc_process_cmd(m)\n\n local request = NodeCmdRequest()\n\n request:deserialize(m)\n\n return process_cmd(request.node_id, request.cmd, request.params)\n\nend\n\n\n\n-- TESTNET --\n\n\n","file_path":"src/automaton/core/core.lua","rank":80,"score":57361.6041668068},{"content":"function rpc_list_nodes()\n\n return list_nodes()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":81,"score":57361.6041668068},{"content":"function rpc_get_protocols(m)\n\n local request = ProtocolIDsList()\n\n request:deserialize(m)\n\n return get_protocols(request.protocol_ids)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":82,"score":57361.6041668068},{"content":"function rpc_launch_node(m)\n\n local msg = Node()\n\n msg:deserialize(m)\n\n return launch_node(msg.id, msg.protocol_id, msg.address) -- implemented in core.cc\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":83,"score":57361.6041668068},{"content":"function list_supported_protocols()\n\n local m = ProtocolIDsList()\n\n for k,_ in pairs(get_core_supported_protocols()) do\n\n m.protocol_ids = k\n\n end\n\n return m:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":84,"score":57361.6041668068},{"content":"function rpc_get_nodes(m)\n\n local request = NodeIdsList()\n\n request:deserialize(m)\n\n return get_nodes(request.node_ids)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":85,"score":57361.6041668068},{"content":"function rpc_load_protocols(m)\n\n local request = ProtocolsList()\n\n request:deserialize(m)\n\n local protocol_list = {}\n\n for _,p in ipairs(request.protocols) do\n\n protocol_list[p.protocol_id] = p.path\n\n end\n\n return load_protocols(protocol_list)\n\nend\n\n\n\n-- NODE RPC COMMON --\n\n\n","file_path":"src/automaton/core/core.lua","rank":86,"score":57361.6041668068},{"content":"function rpc_remove_peers(m)\n\n local request = PeerIdsList()\n\n request:deserialize(m)\n\n return remove_peers(request.node_id, request.peer_ids)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":87,"score":57361.6041668068},{"content":"function rpc_remove_nodes(m)\n\n\n\nend\n\n\n\n-- NODE RPC --\n\n\n","file_path":"src/automaton/core/core.lua","rank":88,"score":57361.6041668068},{"content":"function rpc_get_peers(m)\n\n local request = PeerIdsList()\n\n request:deserialize(m)\n\n return get_peers(request.node_id, request.peer_ids)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":89,"score":57361.6041668068},{"content":"function rpc_add_peers(m)\n\n local request = PeerAddressesList()\n\n request:deserialize(m)\n\n return add_peers(request.node_id, request.peer_addresses)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":90,"score":57361.6041668068},{"content":"function list_running_protocols()\n\n -- local response = ListProtocolsResponse()\n\n -- need to store and get info\n\n print(\"This function is not yet supported\")\n\n return \"\"\n\n -- return response:serialize()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":91,"score":57361.6041668068},{"content":"function rpc_list_supported_protocols()\n\n return list_supported_protocols()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":92,"score":56534.45904601318},{"content":"function rpc_list_connected_peers(m)\n\n local request = NodeId()\n\n request:deserialize(m)\n\n return list_connected_peers(request.node_id)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":93,"score":56534.45904601318},{"content":"function rpc_list_known_peers(m)\n\n local request = NodeId()\n\n request:deserialize(m)\n\n return list_known_peers(request.node_id)\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":94,"score":56534.45904601318},{"content":"function rpc_list_running_protocols()\n\n return list_running_protocols()\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":95,"score":56534.45904601318},{"content":"function load_protocols(protocol_list)\n\n for pid, path in pairs(protocol_list) do\n\n load_protocol(pid, path)\n\n end\n\n return \"\"\n\nend\n\n\n","file_path":"src/automaton/core/core.lua","rank":96,"score":56534.45904601318},{"content":" return std::shared_ptr<node>(new lua_node(id, proto_id));\n\n });\n\n\n\n EXPECT_EQ(smart_protocol::load(\"chat\", \"automaton/tests/testnet/testproto/\"), true);\n\n\n\n std::shared_ptr<automaton::core::network::simulation> sim = automaton::core::network::simulation::get_simulator();\n\n sim->simulation_start(50);\n\n\n\n EXPECT_EQ(testnet::create_testnet(\"lua\", \"testnet\", \"chat\", testnet::network_protocol_type::simulation, 5,\n\n {\n\n {1, {2, 3}}, {2, {4, 5}}\n\n }),\n\n true);\n\n\n\n auto net = testnet::get_testnet(\"testnet\");\n\n std::vector<std::string> ids = net->list_nodes();\n\n\n\n default_node_updater updater(1, 20, std::set<std::string>(ids.begin(), ids.end()));\n\n updater.start();\n\n\n","file_path":"src/automaton/tests/testnet/test_simulation.cc","rank":97,"score":53121.353129425195},{"content":" return std::shared_ptr<node>(new lua_node(id, proto_id));\n\n });\n\n\n\n EXPECT_EQ(smart_protocol::load(\"chat\", \"automaton/tests/testnet/testproto/\"), true);\n\n\n\n automaton::core::network::tcp_init();\n\n\n\n EXPECT_EQ(testnet::create_testnet(\"lua\", \"testnet\", \"chat\", testnet::network_protocol_type::localhost, 5,\n\n {\n\n {1, {2, 3}}, {2, {4, 5}}\n\n }),\n\n true);\n\n\n\n auto net = testnet::get_testnet(\"testnet\");\n\n std::vector<std::string> ids = net->list_nodes();\n\n\n\n default_node_updater updater(1, 20, std::set<std::string>(ids.begin(), ids.end()));\n\n updater.start();\n\n\n\n auto msg_factory = smart_protocol::get_protocol(\"chat\")->get_factory();\n","file_path":"src/automaton/tests/testnet/test_localhost.cc","rank":98,"score":53120.95427097712},{"content":"#include \"automaton/core/data/factory.h\"\n\n#include \"automaton/core/data/protobuf/protobuf_factory.h\"\n\n#include \"automaton/core/data/protobuf/protobuf_schema.h\"\n\n#include \"automaton/core/network/simulated_connection.h\"\n\n#include \"automaton/core/node/node.h\"\n\n#include \"automaton/core/node/node_updater.h\"\n\n#include \"automaton/core/node/lua_node/lua_node.h\"\n\n#include \"automaton/core/smartproto/smart_protocol.h\"\n\n#include \"automaton/core/testnet/testnet.h\"\n\n\n\n#include \"gtest/gtest.h\"\n\n\n\nusing automaton::core::node::node;\n\nusing automaton::core::node::default_node_updater;\n\nusing automaton::core::node::luanode::lua_node;\n\nusing automaton::core::smartproto::smart_protocol;\n\nusing automaton::core::testnet::testnet;\n\n\n\nTEST(testnet, test_all) {\n\n node::register_node_type(\"lua\", [](const std::string& id, const std::string& proto_id)->std::shared_ptr<node> {\n","file_path":"src/automaton/tests/testnet/test_simulation.cc","rank":99,"score":53117.742079269316}],"string":"[\n {\n \"content\": \"class testnet {\\n\\n public:\\n\\n enum network_protocol_type {\\n\\n localhost = 1,\\n\\n simulation = 2\\n\\n };\\n\\n\\n\\n ~testnet();\\n\\n\\n\\n static bool create_testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\\n\\n network_protocol_type ntype, uint32_t number_nodes, std::unordered_map<uint32_t,\\n\\n std::vector<uint32_t> > peer_list);\\n\\n\\n\\n static void destroy_testnet(const std::string& id);\\n\\n\\n\\n static std::shared_ptr<testnet> get_testnet(const std::string& id);\\n\\n\\n\\n static std::vector<std::string> list_testnets();\\n\\n\\n\\n void connect(const std::unordered_map<uint32_t, std::vector<uint32_t> >& peers_list) const;\\n\",\n \"file_path\": \"src/automaton/core/testnet/testnet.h\",\n \"rank\": 0,\n \"score\": 144806.9425492996\n },\n {\n \"content\": \"function rpc_testnet_get_node_id(m)\\n\\n local request = TestNetGetNodeID()\\n\\n request:deserialize(m)\\n\\n local response = NodeID()\\n\\n response.node_id = get_testnet_node_id(request.testnet_id, request.node_index)\\n\\n return response:serialize()\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 1,\n \"score\": 142168.56568530062\n },\n {\n \"content\": \"function disconnect(node_id, peer_ids)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n for _,id in ipairs(peer_ids) do\\n\\n node:disconnect(id)\\n\\n end\\n\\n return \\\"\\\"\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 2,\n \"score\": 110053.42286049656\n },\n {\n \"content\": \"function connect(node_id, peer_ids)\\n\\n print(\\\"getting node \\\" .. node_id)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n for _,id in ipairs(peer_ids) do\\n\\n node:connect(id)\\n\\n end\\n\\n return \\\"\\\"\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 3,\n \"score\": 110053.42286049656\n },\n {\n \"content\": \"#ifndef AUTOMATON_CORE_TESTNET_TESTNET_H_\\n\\n#define AUTOMATON_CORE_TESTNET_TESTNET_H_\\n\\n\\n\\n#include <memory>\\n\\n#include <string>\\n\\n#include <unordered_map>\\n\\n#include <utility>\\n\\n#include <vector>\\n\\n\\n\\nnamespace automaton {\\n\\nnamespace core {\\n\\nnamespace testnet {\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/testnet/testnet.h\",\n \"rank\": 4,\n \"score\": 109307.50131997446\n },\n {\n \"content\": \"\\n\\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_connections_vector(uint32_t n, uint32_t p);\\n\\nstd::unordered_map<uint32_t, std::vector<uint32_t> > create_rnd_connections_vector(uint32_t n, uint32_t p);\\n\\n\\n\\n} // namespace testnet\\n\\n} // namespace core\\n\\n} // namespace automaton\\n\\n\\n\\n#endif // AUTOMATON_CORE_TESTNET_TESTNET_H_\\n\",\n \"file_path\": \"src/automaton/core/testnet/testnet.h\",\n \"rank\": 5,\n \"score\": 109299.4143957997\n },\n {\n \"content\": \"\\n\\n std::vector<std::string> list_nodes();\\n\\n\\n\\n private:\\n\\n static std::unordered_map<std::string, std::shared_ptr<testnet>> testnets;\\n\\n\\n\\n std::string node_type;\\n\\n std::string network_id;\\n\\n std::string protocol_id;\\n\\n network_protocol_type network_type;\\n\\n uint32_t number_nodes;\\n\\n std::vector<std::string> node_ids_list; // <network_id>_1, <network_id>_2, ...\\n\\n\\n\\n testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\\n\\n network_protocol_type ntype, uint32_t number_nodes);\\n\\n\\n\\n bool init();\\n\\n};\\n\\n\\n\\n// Helper functions\\n\",\n \"file_path\": \"src/automaton/core/testnet/testnet.h\",\n \"rank\": 6,\n \"score\": 109298.82802599936\n },\n {\n \"content\": \"function remove_peers(node_id, peer_ids)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n for _,id in ipairs(peer_ids) do\\n\\n node:remove_peer(id)\\n\\n print(\\\"removed \\\" .. tostring(id))\\n\\n end\\n\\n return \\\"\\\"\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 7,\n \"score\": 108561.66097982852\n },\n {\n \"content\": \"function get_peers(node_id, peer_ids)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n local response = PeersList()\\n\\n response.node_id = node_id\\n\\n for _,id in ipairs(peer_ids) do\\n\\n local p = Peer()\\n\\n p.id = id\\n\\n p.address = node:get_peer_address(id)\\n\\n response.peers = p\\n\\n end\\n\\n return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 8,\n \"score\": 108561.66097982852\n },\n {\n \"content\": \"function rpc_start_testnet(m)\\n\\n local request = Network()\\n\\n request:deserialize(m)\\n\\n if (request.is_localhost) then\\n\\n testnet(localhost, _G[request.protocol_id], request.number_nodes, request.number_peers_per_node, request.logging_path)\\n\\n else\\n\\n testnet(simulation, _G[request.protocol_id], request.number_nodes, request.number_peers_per_node, request.logging_path)\\n\\n end\\n\\n return \\\"\\\"\\n\\nend\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 18,\n \"score\": 102507.06342568771\n },\n {\n \"content\": \"function rpc_testnet_destroy(m)\\n\\n local request = TestNetID()\\n\\n request:deserialize(m)\\n\\n testnet_destroy(request.testnet_id)\\n\\n return \\\"\\\"\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 19,\n \"score\": 102507.06342568771\n },\n {\n \"content\": \"function rpc_testnet_create(m)\\n\\n local request = TestNetCreate()\\n\\n request:deserialize(m)\\n\\n local peers_list = {}\\n\\n for _,v in pairs(request.topology) do\\n\\n peers_list[v.from_node] = v.to_node\\n\\n end\\n\\n testnet_create(request.testnet_id, request.protocol_id, request.network_type, request.number_nodes, peers_list)\\n\\n return \\\"\\\"\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 20,\n \"score\": 102507.06342568771\n },\n {\n \"content\": \"function get_protocols(ids)\\n\\n local protocols = get_core_supported_protocols()\\n\\n local response = ProtocolsList()\\n\\n for _,id in ipairs(ids) do\\n\\n local p = protocols[id] -- p -> std::vector<std::pair<std::string, std::string> >\\n\\n if p ~= nil then\\n\\n local m = Protocol()\\n\\n m.protocol_id = id\\n\\n for k,v in pairs(p) do\\n\\n m.file_names = k\\n\\n m.files = v\\n\\n end\\n\\n response.protocols = m\\n\\n end\\n\\n end\\n\\n return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 21,\n \"score\": 102466.19633702708\n },\n {\n \"content\": \"function remove_nodes(node_ids)\\n\\n\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 22,\n \"score\": 100665.65353248196\n },\n {\n \"content\": \"function get_nodes(node_ids)\\n\\n local response = NodesList()\\n\\n for _,id in ipairs(node_ids) do\\n\\n local node = get_node(id)\\n\\n if (node ~= nil) then\\n\\n local n = Node()\\n\\n n.id = node:get_id()\\n\\n n.protocol_id = node:get_protocol_id()\\n\\n n.address = node:get_address()\\n\\n print(\\\"node \\\" .. n.id .. \\\" -> \\\" .. n.protocol_id .. \\\" -> \\\" .. n.address)\\n\\n response.nodes = n\\n\\n end\\n\\n end\\n\\n return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 23,\n \"score\": 100665.65353248196\n },\n {\n \"content\": \"function get_nodes_from_testnet(testnet_id)\\n\\n if networks[testnet_id] ~= nil then\\n\\n return networks[testnet_id][\\\"nodes\\\"]\\n\\n end\\n\\n print(\\\"NO NODES @ PATH \\\" .. testnet_id)\\n\\n return nil\\n\\nend\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/common/network.lua\",\n \"rank\": 24,\n \"score\": 100636.59593931846\n },\n {\n \"content\": \"function sent(peer_id, msg_id, success)\\n\\nend\\n\",\n \"file_path\": \"src/automaton/tests/testnet/testproto/chat.lua\",\n \"rank\": 25,\n \"score\": 99002.48961835624\n },\n {\n \"content\": \"function list_connected_peers(node_id)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n local response = PeerIdsList()\\n\\n local list = node:peers()\\n\\n print(\\\"connected peers to \\\" .. node_id .. \\\" ::\\\")\\n\\n for _,id in ipairs(list) do\\n\\n response.peer_ids = id\\n\\n print(id)\\n\\n end\\n\\n return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 26,\n \"score\": 98930.50237028612\n },\n {\n \"content\": \"function list_known_peers(node_id)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n local response = PeerIdsList()\\n\\n local list = node:known_peers()\\n\\n print(\\\"known peers to \\\" .. node_id .. \\\" ::\\\")\\n\\n for _,id in ipairs(list) do\\n\\n response.peer_ids = id\\n\\n print(id)\\n\\n end\\n\\n return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 27,\n \"score\": 98930.50237028612\n },\n {\n \"content\": \"function add_peers(node_id, peer_addresses)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n local response = PeersList()\\n\\n response.node_id = node_id\\n\\n for _,addr in ipairs(peer_addresses) do\\n\\n local p = Peer()\\n\\n p.id = node:add_peer(addr)\\n\\n print(\\\"added \\\" .. tostring(p.id))\\n\\n p.address = addr\\n\\n response.peers = p\\n\\n end\\n\\n return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 28,\n \"score\": 97257.09573288659\n },\n {\n \"content\": \"function process_cmd(node_id, cmd, params)\\n\\n local node = get_node(node_id)\\n\\n if node == nil then\\n\\n return \\\"\\\"\\n\\n end\\n\\n local response = NodeCmdResponse()\\n\\n response.response = node:process_cmd(cmd, params)\\n\\n return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 29,\n \"score\": 97257.09573288659\n },\n {\n \"content\": \"function disconnected(peer_id)\\n\\n peers[peer_id] = nil\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/tests/testnet/testproto/connections.lua\",\n \"rank\": 30,\n \"score\": 92924.71485703217\n },\n {\n \"content\": \"function connected(peer_id)\\n\\n peers[peer_id] = { name = \\\"N/A\\\" }\\n\\n hi = Hello()\\n\\n hi.name = nodeid\\n\\n send(peer_id, hi, 1)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/tests/testnet/testproto/connections.lua\",\n \"rank\": 31,\n \"score\": 92924.71485703217\n },\n {\n \"content\": \"function on_Msg(peer_id, m)\\n\\n if heard_of[m.author] == nil then\\n\\n heard_of[m.author] = true\\n\\n end\\n\\n gossip(peer_id, m)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/tests/testnet/testproto/chat.lua\",\n \"rank\": 32,\n \"score\": 92924.71485703217\n },\n {\n \"content\": \"function on_Hello(peer_id, m)\\n\\n peers[peer_id].name = m.name\\n\\nend\\n\",\n \"file_path\": \"src/automaton/tests/testnet/testproto/connections.lua\",\n \"rank\": 33,\n \"score\": 92924.71485703217\n },\n {\n \"content\": \"class rpc_server_handler: public automaton::core::network::http_server::server_handler {\\n\\n engine* script;\\n\\n\\n\\n public:\\n\\n explicit rpc_server_handler(engine* en): script(en) {}\\n\\n std::string handle(std::string json_cmd, http_server::status_code* s) {\\n\\n std::stringstream sstr(json_cmd);\\n\\n nlohmann::json j;\\n\\n sstr >> j;\\n\\n std::string cmd = \\\"rpc_\\\";\\n\\n std::string msg = \\\"\\\";\\n\\n if (j.find(\\\"method\\\") != j.end() && j.find(\\\"msg\\\") != j.end()) {\\n\\n cmd += j[\\\"method\\\"].get<std::string>();\\n\\n msg = j[\\\"msg\\\"].get<std::string>();\\n\\n } else {\\n\\n LOG(ERROR) << \\\"ERROR in rpc server handler: Invalid request\\\";\\n\\n *s = http_server::status_code::BAD_REQUEST;\\n\\n return \\\"\\\";\\n\\n }\\n\\n std::string params = \\\"\\\";\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 34,\n \"score\": 92475.3691730035\n },\n {\n \"content\": \"function gossip(peer_id, msg)\\n\\n for k, v in pairs(peers) do\\n\\n if k ~= 0 and k ~= peer_id then\\n\\n send(k, msg, 0)\\n\\n end\\n\\n end\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/tests/testnet/testproto/chat.lua\",\n \"rank\": 35,\n \"score\": 91002.29116373339\n },\n {\n \"content\": \"namespace automaton {\\n\\nnamespace core {\\n\\nnamespace io {\\n\\n\\n\\n/**\\n\\n Checks whether the specified file exist.\\n\\n\\n\\n Returns true if it does.\\n\\n*/\\n\\nbool file_exists(const char* filename);\\n\\n\\n\\n/**\\n\\n Gets the file contents and returns them as a string.\\n\\n\\n\\n Exception is thrown when error occurs.\\n\\n*/\\n\\nstd::string get_file_contents(const char* filename);\\n\\n\\n\\n/**\\n\\n Converts binary byte buffer to hex string representation.\\n\\n*/\\n\\nstd::string bin2hex(const std::string& input);\\n\\n\\n\\n/**\\n\\n Creates a binary byte buffer from hex string representation.\\n\\n*/\\n\\nstd::string hex2bin(const std::string& input);\\n\\n\\n\\n/**\\n\\n Returns string representing hex value of a number. Does not contain base prefix 0x. Length is always even.\\n\\n*/\\n\\nstd::string dec2hex(uint32_t n);\\n\\n\\n\\n/**\\n\\n Returns a number from its hex representation.\\n\\n*/\\n\\nuint32_t hex2dec(const std::string& hex);\\n\\n\\n\\n\\n\\n/**\\n\\n Returns string representation of a date.\\n\\n*/\\n\\nstd::string get_date_string(std::chrono::system_clock::time_point t);\\n\\n\\n\\nstd::string zero_padded(int num, int width);\\n\\n\\n\\n// This must be called after main entry point.\\n\\nextern bool init_logger();\\n\\n\\n\\n} // namespace io\\n\\n} // namespace core\\n\",\n \"file_path\": \"src/automaton/core/io/io.h\",\n \"rank\": 36,\n \"score\": 87219.53318958718\n },\n {\n \"content\": \"namespace automaton {\\n\\nnamespace core {\\n\\nnamespace io {\\n\\n\\n\\nstruct blob {\\n\\n explicit blob(size_t size) {\\n\\n resize(size);\\n\\n }\\n\\n\\n\\n ~blob() {\\n\\n }\\n\\n\\n\\n void set(size_t key, int value) {\\n\\n CHECK_GT(key, buffer.size());\\n\\n buffer[key] = value;\\n\\n }\\n\\n\\n\\n uint8_t get(size_t key) {\\n\\n return buffer[key];\\n\\n }\\n\\n\\n\\n size_t size() {\\n\\n return buffer.size();\\n\\n }\\n\\n\\n\\n void resize(size_t new_size) {\\n\\n buffer.resize(new_size, 0);\\n\\n }\\n\\n\\n\\n std::string tostring() {\\n\\n return io::bin2hex(std::string(reinterpret_cast<const char*>(buffer.data()), buffer.size()));\\n\\n }\\n\\n\\n\\n std::vector<uint8_t> buffer;\\n\\n};\\n\\n\\n\\n} // namespace io\\n\",\n \"file_path\": \"src/automaton/core/io/blob.h\",\n \"rank\": 37,\n \"score\": 87219.53318958718\n },\n {\n \"content\": \"namespace automaton {\\n\\nnamespace core {\\n\\nnamespace common {\\n\\n\\n\\nstruct status {\\n\\n enum status_code {\\n\\n OK = 0,\\n\\n CANCELLED = 1,\\n\\n UNKNOWN = 2,\\n\\n INVALID_ARGUMENT = 3,\\n\\n DEADLINE_EXCEEDED = 4,\\n\\n NOT_FOUND = 5,\\n\\n ALREADY_EXISTS = 6,\\n\\n PERMISSION_DENIED = 7,\\n\\n UNAUTHENTICATED = 16,\\n\\n RESOURCE_EXHAUSTED = 8,\\n\\n FAILED_PRECONDITION = 9,\\n\\n ABORTED = 10,\\n\\n OUT_OF_RANGE = 11,\\n\\n UNIMPLEMENTED = 12,\\n\\n INTERNAL = 13,\\n\\n UNAVAILABLE = 14,\\n\\n DATA_LOSS = 15,\\n\\n };\\n\\n\\n\\n explicit status(status_code error_code) : code(error_code), msg(\\\"\\\") {}\\n\\n status(status_code error_code, std::string msg) : code(error_code), msg(msg) {}\\n\\n\\n\\n status_code code;\\n\\n std::string msg;\\n\\n\\n\\n bool is_ok() {\\n\\n return code == OK;\\n\\n }\\n\\n\\n\\n static status ok() {\\n\\n return status(OK);\\n\\n }\\n\\n\\n\\n static status ok(std::string msg) {\\n\\n return status(OK, msg);\\n\\n }\\n\\n\\n\\n static status canceled(std::string msg) {\\n\\n return status(CANCELLED, msg);\\n\\n }\\n\\n\\n\\n static status invalid_argument(std::string msg) {\\n\\n return status(INVALID_ARGUMENT, msg);\\n\\n }\\n\\n\\n\\n static status unknown(std::string msg) {\\n\\n return status(UNKNOWN, msg);\\n\\n }\\n\\n\\n\\n static status not_found(std::string msg) {\\n\\n return status(NOT_FOUND, msg);\\n\\n }\\n\\n\\n\\n static status permission_denied(std::string msg) {\\n\\n return status(PERMISSION_DENIED, msg);\\n\\n }\\n\\n\\n\\n static status resource_exhausted(std::string msg) {\\n\\n return status(RESOURCE_EXHAUSTED, msg);\\n\\n }\\n\\n\\n\\n static status failed_precondition(std::string msg) {\\n\\n return status(FAILED_PRECONDITION, msg);\\n\\n }\\n\\n\\n\\n static status aborted(std::string msg) {\\n\\n return status(ABORTED, msg);\\n\\n }\\n\\n\\n\\n static status out_of_range(std::string msg) {\\n\\n return status(OUT_OF_RANGE, msg);\\n\\n }\\n\\n\\n\\n static status unimplemented(std::string msg) {\\n\\n return status(UNIMPLEMENTED, msg);\\n\\n }\\n\\n\\n\\n static status internal(std::string msg) {\\n\\n return status(INTERNAL, msg);\\n\\n }\\n\\n\\n\\n static status unavailable(std::string msg) {\\n\\n return status(UNAVAILABLE, msg);\\n\\n }\\n\\n\\n\\n static status data_loss(std::string msg) {\\n\\n return status(DATA_LOSS, msg);\\n\\n }\\n\\n\\n\\n std::string to_string() const;\\n\\n};\\n\\n\\n\\nstd::ostream& operator<<(std::ostream& os, const status& s);\\n\\n\\n\\n} // namespace common\\n\",\n \"file_path\": \"src/automaton/core/common/status.h\",\n \"rank\": 38,\n \"score\": 87219.53318958718\n },\n {\n \"content\": \"class eth_contract: public automaton::core::network::connection::connection_handler,\\n\\n public std::enable_shared_from_this<eth_contract> {\\n\\n public:\\n\\n static std::unordered_map<std::string, std::shared_ptr<eth_contract> > contracts;\\n\\n\\n\\n static void register_contract(const std::string& server, const std::string& address,\\n\\n std::unordered_map<std::string, std::pair<std::string, bool> > signs);\\n\\n static std::shared_ptr<eth_contract> get_contract(const std::string&);\\n\\n\\n\\n ~eth_contract();\\n\\n\\n\\n void call(const std::string& address, const std::string& f, const std::string& params,\\n\\n std::function<void(const automaton::core::common::status& s, const std::string&)>);\\n\\n\\n\\n private:\\n\\n uint32_t call_id;\\n\\n std::string server;\\n\\n std::string address; // ETH address of the contract\\n\\n std::unordered_map<std::string, std::pair<std::string, bool> > signatures; // function signatures\\n\\n std::unordered_map<uint32_t,\\n\",\n \"file_path\": \"src/automaton/core/interop/ethereum/eth_contract_raw.h\",\n \"rank\": 39,\n \"score\": 86529.93380071611\n },\n {\n \"content\": \"namespace automaton {\\n\\nnamespace core {\\n\\nnamespace interop {\\n\\nnamespace ethereum {\\n\\n\\n\\n#ifdef _WIN32\\n\\n// TODO(vitalyster): use correct error level for these errors\\n\\n#define _ERROR WARNING\\n\\n#else\\n\\n#define _ERROR ERROR\\n\\n#endif\\n\\n\\n\\nstatic size_t curl_callback(void *contents, size_t size, size_t nmemb, std::string *s) {\\n\\n size_t new_length = size * nmemb;\\n\\n try {\\n\\n s->append(reinterpret_cast<char*>(contents), new_length);\\n\\n }\\n\\n catch (std::bad_alloc &e) {\\n\\n LOG(_ERROR) << \\\"Bad_alloc while reading data!\\\";\\n\\n return 0;\\n\\n }\\n\\n return new_length;\\n\\n}\\n\\n\\n\\nstatic status handle_result(const std::string& result) {\\n\\n json j;\\n\\n std::stringstream ss(result);\\n\\n try {\\n\\n ss >> j;\\n\\n } catch (...) {\\n\\n return status::internal(\\\"Could not parse JSON!\\\");\\n\\n }\\n\\n\\n\\n if (j.find(\\\"error\\\") != j.end()) {\\n\\n json obj = j[\\\"error\\\"];\\n\\n if (obj.is_string()) {\\n\\n std::string error = obj[\\\"message\\\"].get<std::string>();\\n\\n return status::internal(error);\\n\\n }\\n\\n return status::internal(obj.dump());\\n\\n } else if (j.find(\\\"result\\\") != j.end()) {\\n\\n if (j[\\\"result\\\"].is_string()) {\\n\\n std::string result = j[\\\"result\\\"].get<std::string>();\\n\\n return status::ok(result.substr(2));\\n\\n }\\n\\n return status::ok(j[\\\"result\\\"].dump());\\n\\n }\\n\\n return status::internal(\\\"No result and no error!?\\\");\\n\\n}\\n\\n\\n\\nstatic status curl_post(const std::string& url, const std::string& data) {\\n\\n CURL *curl;\\n\\n CURLcode res;\\n\\n std::string message;\\n\\n char curl_err_buf[1024];\\n\\n\\n\\n curl = curl_easy_init();\\n\\n\\n\\n LOG(INFO) << \\\"\\\\n======= REQUEST =======\\\\n\\\" << data << \\\"\\\\n=====================\\\";\\n\\n\\n\\n if (curl) {\\n\\n struct curl_slist *list = NULL;\\n\\n\\n\\n list = curl_slist_append(list, \\\"Content-Type: application/json\\\");\\n\\n\\n\\n curl_easy_setopt(curl, CURLOPT_URL, url.c_str());\\n\\n curl_easy_setopt(curl, CURLOPT_ERRORBUFFER, curl_err_buf);\\n\\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, curl_callback);\\n\\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, &message);\\n\\n curl_easy_setopt(curl, CURLOPT_ENCODING, \\\"gzip\\\");\\n\\n curl_easy_setopt(curl, CURLOPT_HTTPHEADER, list);\\n\\n\\n\\n curl_err_buf[0] = '\\\\0';\\n\\n curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data.c_str());\\n\\n res = curl_easy_perform(curl);\\n\\n curl_slist_free_all(list);\\n\\n curl_easy_cleanup(curl);\\n\\n if (res != CURLE_OK) {\\n\\n size_t len = strlen(curl_err_buf);\\n\\n LOG(_ERROR) << \\\"Curl result code != CURLE_OK. Result code: \\\" << res;\\n\\n if (len) {\\n\\n return status::internal(std::string(curl_err_buf, len));\\n\\n }\\n\\n return status::internal(\\\"CURL error\\\");\\n\\n } else {\\n\\n LOG(INFO) << \\\"\\\\n======= RESPONSE =======\\\\n\\\" << message << \\\"\\\\n=====================\\\";\\n\\n return handle_result(message);\\n\\n }\\n\\n } else {\\n\\n return status::internal(\\\"No curl!\\\");\\n\\n }\\n\\n}\\n\\n\\n\\nstatic status eth_getTransactionCount(const std::string& url, const std::string& address) {\\n\\n std::stringstream ss;\\n\\n ss << \\\"{\\\\\\\"jsonrpc\\\\\\\":\\\\\\\"2.0\\\\\\\",\\\\\\\"method\\\\\\\":\\\\\\\"eth_getTransactionCount\\\\\\\",\\\\\\\"params\\\\\\\":[\\\\\\\"\\\" << address <<\\n\\n \\\"\\\\\\\",\\\\\\\"latest\\\\\\\"\\\" << \\\"],\\\\\\\"id\\\\\\\":1}\\\";\\n\\n return curl_post(url, ss.str());\\n\\n}\\n\\n\\n\\nstatic status eth_getCode(const std::string& url, const std::string& address) {\\n\\n std::stringstream ss;\\n\\n ss << \\\"{\\\\\\\"jsonrpc\\\\\\\":\\\\\\\"2.0\\\\\\\",\\\\\\\"method\\\\\\\":\\\\\\\"eth_getCode\\\\\\\",\\\\\\\"params\\\\\\\":[\\\\\\\"\\\" << address <<\\n\\n \\\"\\\\\\\",\\\\\\\"latest\\\\\\\"\\\" << \\\"],\\\\\\\"id\\\\\\\":1}\\\";\\n\\n return curl_post(url, ss.str());\\n\\n}\\n\\n\\n\\nstatic status eth_getBalance(const std::string& url, const std::string& address) {\\n\\n std::stringstream ss;\\n\\n ss << \\\"{\\\\\\\"jsonrpc\\\\\\\":\\\\\\\"2.0\\\\\\\",\\\\\\\"method\\\\\\\":\\\\\\\"eth_getBalance\\\\\\\",\\\\\\\"params\\\\\\\":[\\\\\\\"\\\" << address <<\\n\\n \\\"\\\\\\\",\\\\\\\"latest\\\\\\\"\\\" << \\\"],\\\\\\\"id\\\\\\\":1}\\\";\\n\\n return curl_post(url, ss.str());\\n\\n}\\n\\n\\n\\nstatic status eth_gasPrice(const std::string& url) {\\n\\n std::stringstream ss;\\n\\n ss << \\\"{\\\\\\\"jsonrpc\\\\\\\":\\\\\\\"2.0\\\\\\\",\\\\\\\"method\\\\\\\":\\\\\\\"eth_gasPrice\\\\\\\",\\\\\\\"params\\\\\\\":[],\\\\\\\"id\\\\\\\":1}\\\";\\n\\n return curl_post(url, ss.str());\\n\\n}\\n\\n\\n\\nstatic status eth_getTransactionReceipt(const std::string& url, const std::string& tx_hash) {\\n\\n std::stringstream ss;\\n\\n ss << \\\"{\\\\\\\"jsonrpc\\\\\\\":\\\\\\\"2.0\\\\\\\",\\\\\\\"method\\\\\\\":\\\\\\\"eth_getTransactionReceipt\\\\\\\",\\\\\\\"params\\\\\\\":[\\\\\\\"\\\" << tx_hash << \\\"\\\\\\\"],\\\\\\\"id\\\\\\\":1}\\\";\\n\\n return curl_post(url, ss.str());\\n\\n}\\n\\n\\n\\n// Argument encoding and decoding\\n\\n\\n\\n/* TODO(kari):\\n\\n \\t* Replace type bitmask with variables\\n\\n \\t* Type structure is messy and confusing - clean it up\\n\\n \\t* Use switch after replacing the bitmask\\n\\n \\t* Move convertion functions to the io module\\n\\n * Add support for fixed-point numbers\\n\\n*/\\n\\n\\n\\nstatic const uint32_t BUFFER_SIZE = 2048;\\n\\n\\n\\nenum abi_type {\\n\\n empty = 0,\\n\\n numerical = 1, // bool, int<>, uint<>, fixed, ufixed, fixed<M>x<N>, ufixed<M>x<N>\\n\\n fixed_size_bytes = 2, // bytes<>, function(bytes24), address(uint160)\\n\\n dynamic_size_bytes = 3, // bytes\\n\\n string = 4, // string\\n\\n};\\n\\n\\n\\nenum abi_array_type {\\n\\n no_array = 0,\\n\\n fixed = 1,\\n\\n dynamic = 2\\n\\n};\\n\\n\\n\\nstatic std::ostream& operator<<(std::ostream& os, const abi_type& obj) {\\n\\n switch (obj) {\\n\\n case numerical: os << \\\"numerical\\\"; break;\\n\\n case string: os << \\\"string\\\"; break;\\n\\n case fixed_size_bytes: os << \\\"fixed_size_bytes\\\"; break;\\n\\n case dynamic_size_bytes: os << \\\"dynamic_size_bytes\\\"; break;\\n\\n default: os << \\\"no type\\\"; break;\\n\\n }\\n\\n return os;\\n\\n}\\n\\n\\n\\nstruct type {\\n\\n std::string str = \\\"\\\";\\n\\n abi_type s_type = empty;\\n\\n abi_array_type s_array_type = no_array;\\n\\n uint32_t array_len = 0;\\n\\n};\\n\\n\\n\\nstatic std::ostream& operator<<(std::ostream& os, const type& obj) {\\n\\n os << \\\"TYPE{\\\" << obj.str << \\\", \\\" << obj.s_type;\\n\\n if (obj.s_array_type != no_array) {\\n\\n if (obj.s_array_type == fixed) {\\n\\n os << \\\", fixed array of size \\\";\\n\\n } else {\\n\\n os << \\\", dynamic array of size \\\";\\n\\n }\\n\\n os << obj.array_len;\\n\\n }\\n\\n os << \\\"}\\\";\\n\\n return os;\\n\\n}\\n\\n\\n\\nstatic type get_type(std::string s) {\\n\\n type t;\\n\\n t.str = s;\\n\\n t.s_array_type = no_array;\\n\\n t.array_len = 0;\\n\\n\\n\\n bool is_array = false;\\n\\n // Check if it is an array and its size if any\\n\\n int32_t k1 = 0, k2 = 0, pos, first_pos;\\n\\n first_pos = pos = s.find('[');\\n\\n while (pos != std::string::npos) {\\n\\n k1 = pos;\\n\\n pos = s.find('[', pos + 1);\\n\\n }\\n\\n if (k1 != 0) {\\n\\n k2 = s.find(']', k1 + 1);\\n\\n }\\n\\n if (k1 && k2) {\\n\\n is_array = true;\\n\\n if (k1 < (k2 - 1)) {\\n\\n std::string len_str = s.substr(k1 + 1, k2 - k1 - 1);\\n\\n t.array_len = stoi(len_str);\\n\\n }\\n\\n }\\n\\n\\n\\n if (is_array) {\\n\\n type arr_type = get_type(s.substr(0, k1));\\n\\n t.s_type = arr_type.s_type;\\n\\n if (arr_type.s_array_type == dynamic || t.array_len == 0 ||\\n\\n t.s_type == dynamic_size_bytes || t.s_type == string) {\\n\\n t.s_array_type = dynamic;\\n\\n } else {\\n\\n t.s_array_type = fixed;\\n\\n }\\n\\n } else {\\n\\n if (s == \\\"function\\\" || (s.find(\\\"bytes\\\") == 0 && s.size() > 5) || s == \\\"address\\\") {\\n\\n t.s_type = fixed_size_bytes;\\n\\n } else if (s == \\\"bytes\\\") {\\n\\n t.s_type = dynamic_size_bytes;\\n\\n } else if (s == \\\"string\\\") {\\n\\n t.s_type = string;\\n\\n } else {\\n\\n t.s_type = numerical; // TODO(kari): Could be invalid type\\n\\n }\\n\\n }\\n\\n return t;\\n\\n}\\n\\n\\n\\nstatic type extract_array_type(std::string s) {\\n\\n type new_t;\\n\\n int32_t k1 = 0, k2 = 0, pos = 0;\\n\\n pos = s.find('[', pos + 1);\\n\\n while (pos != std::string::npos) {\\n\\n k1 = pos;\\n\\n pos = s.find('[', pos + 1);\\n\\n }\\n\\n if (k1 != 0) {\\n\\n k2 = s.find(']', k1 + 1);\\n\\n }\\n\\n if (k1 && k2) {\\n\\n s.erase(k1, k2 - k1 + 1);\\n\\n new_t = get_type(s);\\n\\n } else {\\n\\n LOG(_ERROR) << \\\"Array expected!: \\\" << s;\\n\\n }\\n\\n return new_t;\\n\\n}\\n\\n\\n\\nstatic uint32_t calculate_offset(std::vector<std::string> params) {\\n\\n uint32_t tail_offset = 0;\\n\\n for (uint32_t i = 0; i < params.size(); ++i) {\\n\\n type t = get_type(params[i]);\\n\\n if (t.s_array_type == fixed) {\\n\\n uint32_t element_count = 1;\\n\\n // Add the other dimenstions if any\\n\\n while (t.s_array_type == fixed) {\\n\\n element_count *= t.array_len;\\n\\n t = extract_array_type(t.str);\\n\\n }\\n\\n tail_offset += 32 * element_count;\\n\\n } else {\\n\\n tail_offset += 32;\\n\\n }\\n\\n }\\n\\n return tail_offset;\\n\\n}\\n\\n\\n\\nstatic std::string encode_string(const std::string& byte_array) {\\n\\n std::stringstream ss;\\n\\n auto reminder = byte_array.size() % 32;\\n\\n ss << byte_array << (reminder ? std::string(32 - reminder, '\\\\0') : \\\"\\\");\\n\\n return ss.str();\\n\\n}\\n\\n\\n\\nstatic std::string u64_to_u256(uint64_t n) {\\n\\n char bytes[8];\\n\\n bytes[7] = (n) & 0xFF;\\n\\n bytes[6] = (n >> 8) & 0xFF;\\n\\n bytes[5] = (n >> 16) & 0xFF;\\n\\n bytes[4] = (n >> 24) & 0xFF;\\n\\n bytes[3] = (n >> 32) & 0xFF;\\n\\n bytes[2] = (n >> 40) & 0xFF;\\n\\n bytes[1] = (n >> 48) & 0xFF;\\n\\n bytes[0] = (n >> 56) & 0xFF;\\n\\n\\n\\n return std::string(24, '\\\\0') + std::string(bytes, 8);\\n\\n}\\n\\n\\n\\nstatic std::string dec_to_i256(bool is_signed, std::string s) {\\n\\n CryptoPP::Integer::Signedness sign = is_signed ? CryptoPP::Integer::SIGNED : CryptoPP::Integer::UNSIGNED;\\n\\n if (s.substr(0, 2) == \\\"0x\\\") {\\n\\n s = \\\"h\\\" + s.substr(2);\\n\\n }\\n\\n CryptoPP::Integer i(s.c_str());\\n\\n uint8_t bytes[32] = {0};\\n\\n i.Encode(bytes, 32, sign);\\n\\n return std::string(reinterpret_cast<const char*>(bytes), 32);\\n\\n}\\n\\n\\n\\nstatic std::string i256_to_dec(bool is_signed, const std::string& s) {\\n\\n // TODO(kari): If the number is more than 64 bits, throw error or use only 64 bits of it.\\n\\n CryptoPP::Integer::Signedness sign = is_signed ? CryptoPP::Integer::SIGNED : CryptoPP::Integer::UNSIGNED;\\n\\n CryptoPP::Integer i(reinterpret_cast<const uint8_t*>(s.c_str()), 32, sign);\\n\\n std::stringstream ss;\\n\\n ss << i;\\n\\n std::string res = ss.str();\\n\\n return res.substr(0, res.size() - 1); // remove suffix\\n\\n}\\n\\n\\n\\nstatic uint64_t u256_to_u64(const std::string& s) {\\n\\n if (s.size() != 32) {\\n\\n LOG(_ERROR) << \\\"Invalid argument format!\\\" << s;\\n\\n return 0;\\n\\n }\\n\\n uint64_t n = 0;\\n\\n for (auto i = 0; i < 8; i++) {\\n\\n uint64_t k = reinterpret_cast<const uint8_t &>(s[24 + i]);\\n\\n n |= (k << ((7 - i) * 8));\\n\\n }\\n\\n return n;\\n\\n}\\n\\n\\n\\nstatic void check_and_resize_buffer(char** buffer, uint64_t* size, uint64_t pos, uint64_t data_size) {\\n\\n uint64_t new_size = *size;\\n\\n while (pos + data_size > new_size) {\\n\\n new_size += BUFFER_SIZE;\\n\\n }\\n\\n if (*size != new_size) {\\n\\n char* new_buffer = new char[new_size];\\n\\n memcpy(new_buffer, *buffer, *size);\\n\\n delete [] *buffer;\\n\\n *buffer = new_buffer;\\n\\n *size = new_size;\\n\\n }\\n\\n}\\n\\n\\n\\nstatic void encode_param(type t, const json& json_data, char** buffer, uint64_t* buf_size,\\n\\n uint64_t* head_pos, uint64_t* tail_pos) {\\n\\n if (t.s_array_type == fixed) {\\n\\n if (!json_data.is_array() || json_data.size() != t.array_len) {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Expected array with length \\\" << t.array_len << \\\", got \\\" << json_data;\\n\\n return;\\n\\n }\\n\\n type tp = extract_array_type(t.str);\\n\\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\\n\\n encode_param(tp, *it, buffer, buf_size, head_pos, tail_pos);\\n\\n }\\n\\n } else if (t.s_array_type == dynamic) {\\n\\n if (!json_data.is_array()) {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Expected array, got \\\" << json_data;\\n\\n return;\\n\\n }\\n\\n if (t.array_len && json_data.size() != t.array_len) {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Expected array with length \\\" << t.array_len << \\\", got \\\" << json_data;\\n\\n return;\\n\\n }\\n\\n std::string encoded;\\n\\n if (t.array_len == 0) { // Size is unknown; not fixed\\n\\n encoded = u64_to_u256(json_data.size());\\n\\n check_and_resize_buffer(buffer, buf_size, *tail_pos, 32);\\n\\n memcpy(*buffer + *tail_pos, encoded.c_str(), 32);\\n\\n *tail_pos += 32;\\n\\n }\\n\\n uint64_t head_prim_pos = *tail_pos;\\n\\n uint64_t tail_prim_pos = *tail_pos;\\n\\n type tp = extract_array_type(t.str);\\n\\n if (tp.s_array_type == fixed) {\\n\\n tail_prim_pos += (json_data.size() * calculate_offset({tp.str}));\\n\\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\\n\\n encode_param(tp, *it, buffer, buf_size, &head_prim_pos, &tail_prim_pos);\\n\\n }\\n\\n } else if (tp.s_type == dynamic_size_bytes || tp.s_type == string || tp.s_array_type == dynamic) {\\n\\n tail_prim_pos += (32 * json_data.size());\\n\\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\\n\\n encoded = u64_to_u256(tail_prim_pos - *tail_pos);\\n\\n check_and_resize_buffer(buffer, buf_size, head_prim_pos, 32);\\n\\n memcpy(*buffer + head_prim_pos, encoded.c_str(), 32);\\n\\n head_prim_pos += 32;\\n\\n encode_param(tp, *it, buffer, buf_size, &tail_prim_pos, &tail_prim_pos);\\n\\n }\\n\\n } else if (tp.s_type == numerical || tp.s_type == fixed_size_bytes) {\\n\\n tail_prim_pos += (32 * json_data.size());\\n\\n for (auto it = json_data.begin(); it != json_data.end(); ++it) {\\n\\n encode_param(tp, *it, buffer, buf_size, &head_prim_pos, &tail_prim_pos);\\n\\n }\\n\\n } else {\\n\\n LOG(_ERROR) << \\\"Invalid type!\\\" << tp.s_type;\\n\\n return;\\n\\n }\\n\\n *tail_pos = tail_prim_pos;\\n\\n } else if (t.s_type == string || t.s_type == dynamic_size_bytes) {\\n\\n if (!json_data.is_string()) {\\n\\n LOG(_ERROR) << \\\"Invalid argument!\\\";\\n\\n return;\\n\\n }\\n\\n std::string s;\\n\\n std::string data = json_data.get<std::string>();\\n\\n if (t.s_type == dynamic_size_bytes) {\\n\\n s = hex2bin(data);\\n\\n } else {\\n\\n s = data;\\n\\n }\\n\\n std::string encoded = u64_to_u256(s.size());\\n\\n check_and_resize_buffer(buffer, buf_size, *tail_pos, 32);\\n\\n memcpy(*buffer + *tail_pos, encoded.c_str(), 32);\\n\\n *tail_pos += 32;\\n\\n encoded = encode_string(s);\\n\\n check_and_resize_buffer(buffer, buf_size, *tail_pos, encoded.size());\\n\\n memcpy(*buffer + *tail_pos, encoded.c_str(), encoded.size());\\n\\n *tail_pos += encoded.size();\\n\\n } else if (t.s_type == fixed_size_bytes) {\\n\\n if (!json_data.is_string()) {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Expected string, got \\\" << json_data;\\n\\n return;\\n\\n }\\n\\n std::string data = json_data.get<std::string>();\\n\\n std::string bin_data = hex2bin(data);\\n\\n if (bin_data.size() > 32) {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Size > 32 bytes! \\\" << data;\\n\\n return;\\n\\n }\\n\\n std::string encoded;\\n\\n if (t.str == \\\"address\\\") {\\n\\n if (bin_data.size() != 20) {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Address size != 20 bytes! \\\" << data;\\n\\n return;\\n\\n }\\n\\n encoded = std::string(12, '\\\\0') + bin_data;\\n\\n } else {\\n\\n encoded = bin_data + std::string(32 - bin_data.size(), '\\\\0');\\n\\n }\\n\\n check_and_resize_buffer(buffer, buf_size, *head_pos, 32);\\n\\n memcpy(*buffer + *head_pos, encoded.c_str(), 32);\\n\\n *head_pos += 32;\\n\\n } else if (t.s_type == numerical) {\\n\\n std::string encoded;\\n\\n if (t.str == \\\"bool\\\") {\\n\\n if (!json_data.is_boolean()) {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Expected boolean, got \\\" << json_data;\\n\\n return;\\n\\n }\\n\\n encoded = u64_to_u256(json_data.get<bool>() ? 1 : 0);\\n\\n } else if (t.str.find(\\\"int\\\") >= 0) {\\n\\n std::string s;\\n\\n if (json_data.is_number()) {\\n\\n s = std::to_string(json_data.get<uint64_t>());\\n\\n } else if (json_data.is_string()) {\\n\\n s = json_data.get<std::string>();\\n\\n } else {\\n\\n LOG(_ERROR) << \\\"Invalid argument! Expected number or string, got \\\" << json_data;\\n\\n return;\\n\\n }\\n\\n bool is_signed = t.str[0] != 'u';\\n\\n encoded = dec_to_i256(is_signed, s);\\n\\n } else if (t.str.find(\\\"fixed\\\") >= 0) {\\n\\n LOG(_ERROR) << \\\"Unsuported data type double!\\\";\\n\\n return;\\n\\n }\\n\\n check_and_resize_buffer(buffer, buf_size, *head_pos, 32);\\n\\n memcpy(*buffer + *head_pos, encoded.c_str(), 32);\\n\\n *head_pos += 32;\\n\\n } else {\\n\\n LOG(_ERROR) << \\\"Undefined type: \\\" << t.s_type;\\n\\n }\\n\\n}\\n\\n\\n\\nstatic std::string encode(const std::string& signatures_json, const std::string& parameters_json) {\\n\\n json j_sigs, j_params;\\n\\n try {\\n\\n std::stringstream sigs(signatures_json);\\n\\n sigs >> j_sigs;\\n\\n std::stringstream params(parameters_json);\\n\\n params >> j_params;\\n\\n } catch (const std::exception& e) {\\n\\n LOG(_ERROR) << \\\"Json error: \\\" << e.what();\\n\\n return \\\"\\\";\\n\\n }\\n\\n\\n\\n if (!j_params.is_array() || j_params.size() != j_sigs.size()) {\\n\\n LOG(_ERROR) << \\\"Invalid arguments!\\\";\\n\\n return \\\"\\\";\\n\\n }\\n\\n\\n\\n char* buffer = new char[BUFFER_SIZE];\\n\\n uint64_t buf_size = BUFFER_SIZE;\\n\\n\\n\\n std::vector<std::string> signatures;\\n\\n try {\\n\\n signatures = j_sigs.get<std::vector<std::string> >();\\n\\n } catch (const std::exception& e) {\\n\\n LOG(_ERROR) << \\\"Invalid arguments! \\\" << e.what();\\n\\n return \\\"\\\";\\n\\n }\\n\\n\\n\\n uint64_t head_pos = 0;\\n\\n uint64_t tail_pos = calculate_offset(signatures);\\n\\n std::string signature;\\n\\n auto p_it = j_params.begin();\\n\\n uint32_t s_i = 0;\\n\\n for (; s_i < signatures.size() && p_it != j_params.end(); ++s_i, ++p_it) {\\n\\n signature = signatures[s_i];\\n\\n type t = get_type(signature);\\n\\n if (t.s_type == dynamic_size_bytes || t.s_type == string || t.s_array_type == dynamic) {\\n\\n std::string encoded = u64_to_u256(tail_pos);\\n\\n check_and_resize_buffer(&buffer, &buf_size, tail_pos, 32);\\n\\n memcpy(buffer + head_pos, encoded.c_str(), 32);\\n\\n head_pos += 32;\\n\\n encode_param(t, *p_it, &buffer, &buf_size, &tail_pos, &tail_pos);\\n\\n } else {\\n\\n encode_param(t, *p_it, &buffer, &buf_size, &head_pos, &tail_pos);\\n\\n }\\n\\n }\\n\\n std::string result = std::string(buffer, tail_pos);\\n\\n delete [] buffer;\\n\\n return std::move(result);\\n\\n}\\n\\n\\n\\nstatic std::string decode_param(type t, const std::string& data, uint64_t pos) {\\n\\n if (t.s_array_type == fixed) {\\n\\n auto tp = extract_array_type(t.str);\\n\\n std::stringstream ss;\\n\\n ss << '[';\\n\\n if (tp.s_array_type == fixed) {\\n\\n for (int32_t i = 0; i < t.array_len - 1; ++i) {\\n\\n ss << decode_param(tp, data, pos) << \\\",\\\";\\n\\n pos += calculate_offset({tp.str});\\n\\n }\\n\\n ss << decode_param(tp, data, pos);\\n\\n } else if (tp.s_type == numerical || tp.s_type == fixed_size_bytes) {\\n\\n for (int32_t i = 0; i < t.array_len - 1; ++i) {\\n\\n ss << decode_param(tp, data, pos) << \\\",\\\";\\n\\n pos += 32;\\n\\n }\\n\\n ss << decode_param(tp, data, pos);\\n\\n }\\n\\n ss << ']';\\n\\n return ss.str();\\n\\n } else if (t.s_array_type == dynamic) {\\n\\n int64_t len = t.array_len;\\n\\n if (len == 0) {\\n\\n std::string s = data.substr(pos, 32);\\n\\n len = u256_to_u64(s);\\n\\n pos += 32;\\n\\n }\\n\\n std::stringstream ss;\\n\\n ss << '[';\\n\\n auto tp = extract_array_type(t.str);\\n\\n if (tp.s_array_type == no_array && (tp.s_type == numerical || tp.s_type == fixed_size_bytes)) {\\n\\n for (int32_t i = 0; i < len - 1; ++i) {\\n\\n ss << decode_param(tp, data, pos) << \\\",\\\";\\n\\n pos += 32;\\n\\n }\\n\\n ss << decode_param(tp, data, pos);\\n\\n } else if (tp.s_array_type == fixed) {\\n\\n for (int32_t i = 0; i < len - 1; ++i) {\\n\\n ss << decode_param(tp, data, pos) << \\\",\\\";\\n\\n pos += calculate_offset({tp.str});\\n\\n }\\n\\n ss << decode_param(tp, data, pos);\\n\\n } else if (tp.s_type == string || tp.s_type == dynamic_size_bytes || tp.s_array_type == dynamic) {\\n\\n for (int32_t i = 0; i < len - 1; ++i) {\\n\\n std::string s = data.substr(pos + (32 * i), 32);\\n\\n uint64_t offset = u256_to_u64(s);\\n\\n ss << decode_param(tp, data, pos + offset) << \\\",\\\";\\n\\n }\\n\\n std::string s = data.substr(pos + (32 * (len - 1)), 32);\\n\\n uint64_t offset = u256_to_u64(s);\\n\\n ss << decode_param(tp, data, pos + offset);\\n\\n } else {\\n\\n LOG(_ERROR) << \\\"Invalid type!\\\";\\n\\n return \\\"\\\";\\n\\n }\\n\\n ss << ']';\\n\\n return ss.str();\\n\\n } else if (t.s_type == dynamic_size_bytes || t.s_type == string) {\\n\\n std::string s = data.substr(pos, 32);\\n\\n int64_t len = u256_to_u64(s);\\n\\n pos += 32;\\n\\n std::string res = data.substr(pos, len);\\n\\n if (t.s_type == string) {\\n\\n return '\\\"' + res + '\\\"';\\n\\n }\\n\\n return '\\\"' + bin2hex(res) + '\\\"';\\n\\n } else if (t.s_type == numerical) {\\n\\n std::string res = data.substr(pos, 32);\\n\\n if (t.str == \\\"bool\\\") {\\n\\n uint64_t k = u256_to_u64(res);\\n\\n return k > 0 ? \\\"true\\\" : \\\"false\\\";\\n\\n } else if (t.str.find(\\\"int\\\") >= 0) {\\n\\n bool is_signed = t.str[0] != 'u';\\n\\n return '\\\"' + i256_to_dec(is_signed, res) + '\\\"';\\n\\n } else if (t.str.find(\\\"fixed\\\") >= 0) {\\n\\n LOG(_ERROR) << \\\"Unsuported data type double!\\\";\\n\\n return \\\"\\\\\\\"\\\\\\\"\\\";\\n\\n }\\n\\n return \\\"\\\";\\n\\n } else if (t.s_type == fixed_size_bytes) {\\n\\n if (t.str == \\\"address\\\") {\\n\\n std::string res = data.substr(pos, 32);\\n\\n return '\\\"' + bin2hex(res.substr(12, 20)) + '\\\"';\\n\\n }\\n\\n std::regex rgx_sim(\\\"bytes(\\\\\\\\d+)\\\");\\n\\n std::smatch match;\\n\\n const std::string sig = t.str;\\n\\n uint32_t k = 32;\\n\\n if (t.str == \\\"function\\\") {\\n\\n k = 24;\\n\\n } else if (std::regex_match(sig.begin(), sig.end(), match, rgx_sim) && match.size() == 2) {\\n\\n k = std::stoul(match[1]);\\n\\n }\\n\\n std::string res = data.substr(pos, k);\\n\\n return '\\\"' + bin2hex(res) + '\\\"';\\n\\n } else {\\n\\n LOG(_ERROR) << \\\"Undefined type: \\\" << t.s_type;\\n\\n }\\n\\n return \\\"\\\";\\n\\n}\\n\\n\\n\\nstatic std::string decode(const std::string& signatures_json, const std::string& data) {\\n\\n json j_sigs, j_params;\\n\\n try {\\n\\n std::stringstream sigs(signatures_json);\\n\\n sigs >> j_sigs;\\n\\n } catch (const std::exception& e) {\\n\\n LOG(_ERROR) << \\\"Json error: \\\" << e.what();\\n\\n return \\\"\\\";\\n\\n }\\n\\n\\n\\n std::stringstream ss;\\n\\n std::string signature;\\n\\n ss << '[';\\n\\n uint64_t pos = 0;\\n\\n for (auto s_it = j_sigs.begin(); s_it != j_sigs.end();) {\\n\\n signature = (*s_it).get<std::string>();\\n\\n type t = get_type(signature);\\n\\n if (t.s_type == dynamic_size_bytes || t.s_type == string || t.s_array_type == dynamic) {\\n\\n std::string s = data.substr(pos, 32);\\n\\n uint64_t offset = u256_to_u64(s);\\n\\n ss << decode_param(t, data, offset);\\n\\n } else {\\n\\n ss << decode_param(t, data, pos);\\n\\n }\\n\\n if (++s_it != j_sigs.end()) {\\n\\n ss << ',';\\n\\n }\\n\\n if (t.s_array_type == fixed) {\\n\\n pos += calculate_offset({t.str});\\n\\n } else {\\n\\n pos += 32;\\n\\n }\\n\\n }\\n\\n ss << ']';\\n\\n return ss.str();\\n\\n}\\n\\n\\n\\n} // namespace ethereum\\n\\n} // namespace interop\\n\",\n \"file_path\": \"src/automaton/core/interop/ethereum/eth_helper_functions.h\",\n \"rank\": 40,\n \"score\": 84633.63705223227\n },\n {\n \"content\": \"function chat_node(id)\\n\\n local n = node(id, \\\"automaton/examples/smartproto/chat/\\\")\\n\\n\\n\\n _G[id] = {\\n\\n node_type = \\\"chat\\\",\\n\\n }\\n\\n\\n\\n return n\\n\\nend\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/chat/init.lua\",\n \"rank\": 41,\n \"score\": 78261.6856954901\n },\n {\n \"content\": \"function blockchain_node(id)\\n\\n local n = node(id, \\\"automaton/examples/smartproto/blockchain/\\\")\\n\\n\\n\\n -- print(id)\\n\\n _G[id] = {\\n\\n node_type = \\\"blockchain\\\",\\n\\n\\n\\n set_mining_power = function(x)\\n\\n n:script(\\\"MINE_ATTEMPTS=\\\" .. x .. \\\" return ''\\\")\\n\\n end,\\n\\n\\n\\n get_mining_power = function()\\n\\n n:script(\\\"return tostring(MINE_ATTEMPTS)\\\");\\n\\n end,\\n\\n\\n\\n get_stats = function()\\n\\n return n:script(\\\"return node_stats()\\\")\\n\\n end,\\n\\n\\n\\n disconnect_all = function()\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/blockchain/init.lua\",\n \"rank\": 42,\n \"score\": 78261.6856954901\n },\n {\n \"content\": \"class blockchain_cpp_node : public automaton::core::node::node {\\n\\n public:\\n\\n blockchain_cpp_node(const std::string& id, const std::string& proto_id);\\n\\n\\n\\n ~blockchain_cpp_node();\\n\\n\\n\\n void init();\\n\\n\\n\\n void script(const std::string& command, std::promise<std::string>* result) {}\\n\\n\\n\\n std::string process_cmd(const std::string& cmd, const std::string& params);\\n\\n\\n\\n std::string node_stats(uint32_t last_blocks);\\n\\n\\n\\n block get_blockchain_top();\\n\\n\\n\\n uint32_t get_blocks_size() {\\n\\n return blocks.size();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/automaton/examples/node/blockchain_cpp_node/blockchain_cpp_node.h\",\n \"rank\": 43,\n \"score\": 77876.32672979373\n },\n {\n \"content\": \"function reservation_system_node(id)\\n\\n local n = node(id, \\\"automaton/examples/smartproto/reservationsystem/\\\")\\n\\n\\n\\n -- print(id)\\n\\n _G[id] = {\\n\\n node_type = \\\"reservation_system_node\\\",\\n\\n\\n\\n connect = function(peer_id)\\n\\n n:call(\\\"connect(\\\"..tostring(peer_id)..\\\")\\\")\\n\\n end,\\n\\n\\n\\n reserve = function(room_id, start_day, end_day)\\n\\n n:call(\\\"reserve(\\\" .. tostring(room_id) .. \\\",\\\"\\n\\n .. tostring(start_day) .. \\\",\\\"\\n\\n .. tostring(end_day) .. \\\")\\\")\\n\\n end,\\n\\n\\n\\n cancel = function(room_id, start_day, end_day)\\n\\n n:call(\\\"cancel(\\\" .. tostring(room_id) .. \\\",\\\"\\n\\n .. tostring(start_day) .. \\\",\\\"\\n\\n .. tostring(end_day) .. \\\")\\\")\\n\\n end\\n\\n }\\n\\n return n\\n\\nend\\n\\n\\n\\n-- test network functions\\n\\n\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/reservationsystem/init.lua\",\n \"rank\": 44,\n \"score\": 77233.76974964066\n },\n {\n \"content\": \"function testnet(discovery, node_factory, num_nodes, num_peers, path)\\n\\n return discovery(node_factory, num_nodes, num_peers, path)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/common/network.lua\",\n \"rank\": 45,\n \"score\": 62659.26343585753\n },\n {\n \"content\": \" uint32_t number_nodes, std::unordered_map<uint32_t, std::vector<uint32_t> > peer_list) {\\n\\n bool success = false;\\n\\n if (ntype == \\\"simulation\\\") {\\n\\n success = testnet::create_testnet(\\\"lua\\\", id, smart_protocol_id, testnet::network_protocol_type::simulation,\\n\\n number_nodes, peer_list);\\n\\n } else if (ntype == \\\"localhost\\\") {\\n\\n success = testnet::create_testnet(\\\"lua\\\", id, smart_protocol_id, testnet::network_protocol_type::localhost,\\n\\n number_nodes, peer_list);\\n\\n }\\n\\n if (!success) {\\n\\n throw std::runtime_error(\\\"Testnet creation failed!\\\");\\n\\n }\\n\\n std::shared_ptr<testnet> net = testnet::get_testnet(id);\\n\\n for (auto nid : net->list_nodes()) {\\n\\n updater->add_node(nid);\\n\\n }\\n\\n });\\n\\n\\n\\n script.set(\\\"testnet_destroy\\\", &testnet::destroy_testnet);\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 46,\n \"score\": 60032.74038196619\n },\n {\n \"content\": \" script.set(\\\"testnet_list_all\\\", &testnet::list_testnets);\\n\\n\\n\\n script.set_function(\\\"connect_testnet_nodes\\\",\\n\\n [&](std::string id, std::unordered_map<uint32_t, std::vector<uint32_t> > peers_list) {\\n\\n auto net = testnet::get_testnet(id);\\n\\n if (net == nullptr) {\\n\\n LOG(ERROR) << \\\"No testnet with id \\\" << id;\\n\\n } else {\\n\\n net->connect(peers_list);\\n\\n }\\n\\n });\\n\\n\\n\\n script.set_function(\\\"list_testnet_nodes\\\", [&](std::string id) {\\n\\n auto net = testnet::get_testnet(id);\\n\\n if (net == nullptr) {\\n\\n LOG(ERROR) << \\\"No testnet with id \\\" << id;\\n\\n } else {\\n\\n return net->list_nodes();\\n\\n }\\n\\n return std::vector<std::string>();\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 47,\n \"score\": 60028.3096206236\n },\n {\n \"content\": \" });\\n\\n\\n\\n script.set_function(\\\"get_testnet_node_id\\\", [&](std::string testnet_id, uint32_t index) -> std::string {\\n\\n auto net = testnet::get_testnet(testnet_id);\\n\\n if (net == nullptr) {\\n\\n LOG(ERROR) << \\\"No testnet with id \\\" << testnet_id;\\n\\n return \\\"\\\";\\n\\n }\\n\\n std::vector<std::string> nodes = net->list_nodes();\\n\\n if (index < 1 || index > nodes.size()) {\\n\\n LOG(ERROR) << \\\"No node with index \\\" << index;\\n\\n return \\\"\\\";\\n\\n }\\n\\n return nodes[index - 1];\\n\\n });\\n\\n\\n\\n // end of testnet functions\\n\\n\\n\\n script.set_function(\\\"history_add\\\", [&](std::string cmd){\\n\\n cli.history_add(cmd.c_str());\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 48,\n \"score\": 60025.548640974164\n },\n {\n \"content\": \"#include \\\"automaton/core/node/node.h\\\"\\n\\n#include \\\"automaton/core/node/node_updater.h\\\"\\n\\n#include \\\"automaton/core/script/engine.h\\\"\\n\\n#include \\\"automaton/core/smartproto/smart_protocol.h\\\"\\n\\n#include \\\"automaton/core/testnet/testnet.h\\\"\\n\\n\\n\\n#include \\\"automaton/core/io/io.h\\\" // IO needs to be included after boost\\n\\n\\n\\nusing automaton::core::data::factory;\\n\\nusing automaton::core::data::protobuf::protobuf_factory;\\n\\nusing automaton::core::data::protobuf::protobuf_schema;\\n\\nusing automaton::core::data::schema;\\n\\nusing automaton::core::io::get_file_contents;\\n\\nusing automaton::core::network::http_server;\\n\\nusing automaton::core::node::luanode::lua_node;\\n\\nusing automaton::core::node::node;\\n\\nusing automaton::core::node::default_node_updater;\\n\\nusing automaton::core::script::engine;\\n\\nusing automaton::core::smartproto::smart_protocol;\\n\\nusing automaton::core::testnet::testnet;\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 49,\n \"score\": 60023.917746297084\n },\n {\n \"content\": \" curl_global_init(CURL_GLOBAL_DEFAULT);\\n\\n\\n\\n automaton::core::io::init_logger();\\n\\n automaton::core::cli::cli cli;\\n\\n engine script(core_factory);\\n\\n script.bind_core();\\n\\n\\n\\n // Bind node::node class\\n\\n auto node_type = script.create_simple_usertype<lua_node>();\\n\\n\\n\\n node_type.set(sol::call_constructor,\\n\\n sol::factories(\\n\\n [&](const std::string& id, std::string proto) -> std::shared_ptr<lua_node> {\\n\\n return std::dynamic_pointer_cast<lua_node>(node::create(\\\"lua\\\", id, proto));\\n\\n }));\\n\\n\\n\\n // Bind this node to its own Lua state.\\n\\n node_type.set(\\\"add_peer\\\", &lua_node::add_peer);\\n\\n node_type.set(\\\"remove_peer\\\", &lua_node::remove_peer);\\n\\n node_type.set(\\\"connect\\\", &lua_node::connect);\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 50,\n \"score\": 60021.50317361124\n },\n {\n \"content\": \" script.set_function(\\\"list_nodes_as_table\\\", [&](){\\n\\n return sol::as_table(node::list_nodes());\\n\\n });\\n\\n\\n\\n script.set_function(\\\"get_node\\\", [&](const std::string& node_id) -> std::shared_ptr<lua_node> {\\n\\n return std::dynamic_pointer_cast<lua_node>(node::get_node(node_id));\\n\\n });\\n\\n\\n\\n script.set_function(\\\"launch_node\\\", [&](std::string node_id, std::string protocol_id, std::string address) {\\n\\n LOG(INFO) << \\\"launching node ... \\\" << node_id << \\\" on \\\" << protocol_id << \\\" @ \\\" << address;\\n\\n node::launch_node(\\\"lua\\\", node_id, protocol_id, address);\\n\\n updater->add_node(node_id);\\n\\n return \\\"\\\";\\n\\n });\\n\\n\\n\\n script.set_function(\\\"remove_node\\\", &node::remove_node);\\n\\n\\n\\n // Bind testnet static functions\\n\\n\\n\\n script.set(\\\"testnet_create\\\", [&](std::string id, std::string smart_protocol_id, std::string ntype,\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 51,\n \"score\": 60021.47559042056\n },\n {\n \"content\": \" });\\n\\n\\n\\n script.set_function(\\\"hints_add\\\", [&](std::string cmd){\\n\\n cli.hints_add(cmd.c_str());\\n\\n });\\n\\n\\n\\n script.set_function(\\\"hints_clear\\\", [&](){\\n\\n cli.hints_clear();\\n\\n });\\n\\n\\n\\n script.set_function(\\\"load_protocol\\\", [&](std::string proto_id, std::string path){\\n\\n smart_protocol::load(proto_id, path);\\n\\n });\\n\\n\\n\\n automaton::core::network::tcp_init();\\n\\n\\n\\n std::shared_ptr<automaton::core::network::simulation> sim = automaton::core::network::simulation::get_simulator();\\n\\n sim->simulation_start(100);\\n\\n cli.print(automaton_ascii_logo.c_str());\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 52,\n \"score\": 60020.37181057663\n },\n {\n \"content\": \"#include <curl/curl.h>\\n\\n#include <cryptopp/base64.h>\\n\\n#include <cryptopp/filters.h>\\n\\n\\n\\n#include <future>\\n\\n#include <fstream>\\n\\n#include <iostream>\\n\\n#include <regex>\\n\\n#include <string>\\n\\n\\n\\n#include <json.hpp>\\n\\n\\n\\n#include \\\"automaton/core/cli/cli.h\\\"\\n\\n#include \\\"automaton/core/data/factory.h\\\"\\n\\n#include \\\"automaton/core/data/protobuf/protobuf_factory.h\\\"\\n\\n#include \\\"automaton/core/data/protobuf/protobuf_schema.h\\\"\\n\\n#include \\\"automaton/core/network/http_server.h\\\"\\n\\n#include \\\"automaton/core/network/simulated_connection.h\\\"\\n\\n#include \\\"automaton/core/network/tcp_implementation.h\\\"\\n\\n#include \\\"automaton/core/node/lua_node/lua_node.h\\\"\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 53,\n \"score\": 60019.10394696151\n },\n {\n \"content\": \" LOG(ERROR) << \\\"Status code variable is missing\\\";\\n\\n }\\n\\n std::string encoded;\\n\\n CryptoPP::StringSource ss(reinterpret_cast<const unsigned char*>(result.c_str()), result.size(), true,\\n\\n new CryptoPP::Base64Encoder(new CryptoPP::StringSink(encoded)));\\n\\n return encoded;\\n\\n }\\n\\n};\\n\\n\\n\\nint main(int argc, char* argv[]) {\\n\\n string automaton_ascii_logo(automaton_ascii_logo_cstr);\\n\\n string_replace(&automaton_ascii_logo, \\\"@\\\", \\\"\\\\x1b[38;5;\\\");\\n\\n auto core_factory = std::make_shared<protobuf_factory>();\\n\\n node::register_node_type(\\\"lua\\\", [](const std::string& id, const std::string& proto_id)->std::shared_ptr<node> {\\n\\n return std::shared_ptr<node>(new lua_node(id, proto_id));\\n\\n });\\n\\n\\n\\n default_node_updater* updater;\\n\\n{\\n\\n // TODO(asen): Get rid of this, it is temporary to verify libcurl works across all platforms.\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 54,\n \"score\": 60015.55257799395\n },\n {\n \"content\": \" node_type.set(\\\"get_address\\\", [](lua_node& n) -> std::string {\\n\\n std::shared_ptr<automaton::core::network::acceptor> a = n.get_acceptor();\\n\\n if (a) {\\n\\n return a->get_address();\\n\\n }\\n\\n return \\\"\\\";\\n\\n });\\n\\n\\n\\n node_type.set(\\\"process_cmd\\\", &lua_node::process_cmd);\\n\\n\\n\\n node_type.set(\\\"process_update\\\", &lua_node::process_update);\\n\\n\\n\\n node_type.set(\\\"get_time_to_update\\\", &lua_node::get_time_to_update);\\n\\n\\n\\n node_type.set(\\\"call\\\", [](lua_node& n, std::string command) {\\n\\n n.script(command, nullptr);\\n\\n });\\n\\n\\n\\n node_type.set(\\\"known_peers\\\", [](lua_node& n) {\\n\\n LOG(DBUG) << \\\"getting known peers... \\\" << &n;\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 55,\n \"score\": 60012.66084536088\n },\n {\n \"content\": \" node_type.set(\\\"disconnect\\\", &lua_node::disconnect);\\n\\n node_type.set(\\\"send\\\", &lua_node::send_message);\\n\\n node_type.set(\\\"listen\\\", &lua_node::set_acceptor);\\n\\n\\n\\n node_type.set(\\\"msg_id\\\", &lua_node::find_message_id);\\n\\n node_type.set(\\\"new_msg\\\", &lua_node::create_msg_by_id);\\n\\n node_type.set(\\\"send\\\", &lua_node::send_message);\\n\\n\\n\\n node_type.set(\\\"dump_logs\\\", &lua_node::dump_logs);\\n\\n\\n\\n node_type.set(\\\"script\\\", [](lua_node& n, std::string command) -> std::string {\\n\\n std::promise<std::string> prom;\\n\\n std::future<std::string> fut = prom.get_future();\\n\\n n.script(command, &prom);\\n\\n std::string result = fut.get();\\n\\n return result;\\n\\n });\\n\\n\\n\\n node_type.set(\\\"get_id\\\", &lua_node::get_id);\\n\\n node_type.set(\\\"get_protocol_id\\\", &lua_node::get_protocol_id);\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 56,\n \"score\": 60012.14519883586\n },\n {\n \"content\": \"history_add(\\\"testnet_get_node_id()\\\")\\n\\nhints_add(\\\"testnet_get_node_id()\\\")\\n\\nhistory_add(\\\"testnet_destroy()\\\")\\n\\nhints_add(\\\"testnet_destroy()\\\")\\n\\n\\n\\nhistory_add(\\\"start_testnet()\\\")\\n\\nhints_add(\\\"start_testnet()\\\")\\n\\n\\n\\nhistory_add(\\\"history_add()\\\")\\n\\nhints_add(\\\"history_add()\\\")\\n\\nhistory_add(\\\"hints_add()\\\")\\n\\nhints_add(\\\"hints_add()\\\")\\n\\nhistory_add(\\\"hints_clear()\\\")\\n\\nhints_add(\\\"hints_clear()\\\")\\n\\n\\n\\n-- PROTOCOLS RPC --\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 57,\n \"score\": 60011.42975041688\n },\n {\n \"content\": \" }\\n\\n logger_mutex.unlock();\\n\\n }\\n\\n });\\n\\n\\n\\n std::shared_ptr<automaton::core::network::http_server::server_handler> s_handler(new rpc_server_handler(&script));\\n\\n http_server rpc_server(rpc_port, s_handler);\\n\\n rpc_server.run();\\n\\n\\n\\n while (1) {\\n\\n auto input = cli.input(\\\"\\\\x1b[38;5;15m\\\\x1b[1m|A|\\\\x1b[0m \\\");\\n\\n if (input == nullptr) {\\n\\n cli.print(\\\"\\\\n\\\");\\n\\n break;\\n\\n }\\n\\n\\n\\n string cmd{input};\\n\\n cli.history_add(cmd.c_str());\\n\\n\\n\\n logger_mutex.lock();\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 58,\n \"score\": 60011.37089950824\n },\n {\n \"content\": \" script.safe_script(get_file_contents(\\\"automaton/examples/smartproto/common/names.lua\\\"));\\n\\n script.safe_script(get_file_contents(\\\"automaton/examples/smartproto/common/dump.lua\\\"));\\n\\n script.safe_script(get_file_contents(\\\"automaton/examples/smartproto/common/network.lua\\\"));\\n\\n script.safe_script(get_file_contents(\\\"automaton/examples/smartproto/common/connections_graph.lua\\\"));\\n\\n script.safe_script(get_file_contents(\\\"automaton/examples/smartproto/common/show_states.lua\\\"));\\n\\n\\n\\n std::unordered_map<std::string, std::pair<std::string, std::string> > rpc_commands;\\n\\n uint32_t rpc_port = 0;\\n\\n uint32_t updater_workers_number = 0;\\n\\n uint32_t updater_workers_sleep_time = 0;\\n\\n\\n\\n std::ifstream i(\\\"automaton/core/coreinit.json\\\");\\n\\n if (!i.is_open()) {\\n\\n LOG(ERROR) << \\\"coreinit.json could not be opened\\\";\\n\\n } else {\\n\\n nlohmann::json j;\\n\\n i >> j;\\n\\n i.close();\\n\\n std::vector<std::vector<std::string>> protocols = j[\\\"protocols\\\"];\\n\\n for (auto& p : protocols) {\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 59,\n \"score\": 60011.22935354277\n },\n {\n \"content\": \" std::vector<std::string> rpc_luas = j[\\\"command_implementations\\\"];\\n\\n for (auto& p : rpc_luas) {\\n\\n script.safe_script(get_file_contents(p.c_str()));\\n\\n }\\n\\n for (auto& c : j[\\\"commands\\\"]) {\\n\\n rpc_commands[c[\\\"cmd\\\"]] = std::make_pair(c[\\\"input\\\"], c[\\\"output\\\"]);\\n\\n }\\n\\n rpc_port = j[\\\"rpc_config\\\"][\\\"default_port\\\"];\\n\\n\\n\\n updater_workers_number = j[\\\"updater_config\\\"][\\\"workers_number\\\"];\\n\\n updater_workers_sleep_time = j[\\\"updater_config\\\"][\\\"workers_sleep_time\\\"];\\n\\n }\\n\\n i.close();\\n\\n updater = new default_node_updater(updater_workers_number, updater_workers_sleep_time, std::set<std::string>());\\n\\n updater->start();\\n\\n\\n\\n // Start dump_logs thread.\\n\\n std::mutex logger_mutex;\\n\\n bool stop_logger = false;\\n\\n std::thread logger([&]() {\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 60,\n \"score\": 60010.90861951198\n },\n {\n \"content\": \" std::string pid = p[0];\\n\\n std::string path = p[1];\\n\\n script.safe_script(get_file_contents((path + \\\"init.lua\\\").c_str()));\\n\\n smart_protocol::load(pid, path);\\n\\n }\\n\\n script.set_function(\\\"get_core_supported_protocols\\\", [&](){\\n\\n std::unordered_map<std::string, std::unordered_map<std::string, std::string> > protocols;\\n\\n for (std::string proto : smart_protocol::list_protocols()) {\\n\\n auto p = smart_protocol::get_protocol(proto);\\n\\n protocols[proto] = p->get_msgs_definitions();\\n\\n protocols[proto][\\\"config\\\"] = p->get_configuration_file();\\n\\n }\\n\\n return sol::as_table(protocols);\\n\\n });\\n\\n\\n\\n std::vector<std::string> rpc_protos = j[\\\"command_definitions\\\"];\\n\\n for (auto& p : rpc_protos) {\\n\\n schema* rpc_schema = new protobuf_schema(get_file_contents(p.c_str()));\\n\\n script.import_schema(rpc_schema);\\n\\n }\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 61,\n \"score\": 60010.344319513315\n },\n {\n \"content\": \"}\\n\\n\\n\\n LOG(DBUG) << \\\"tcp_release\\\";\\n\\n\\n\\n automaton::core::network::tcp_release();\\n\\n\\n\\n LOG(DBUG) << \\\"tcp_release done.\\\";\\n\\n\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 62,\n \"score\": 60009.998278515945\n },\n {\n \"content\": \" // TODO(asen): need STL support for logger\\n\\n // LOG(DBUG) << n.list_known_peers();\\n\\n return sol::as_table(n.list_known_peers());\\n\\n });\\n\\n\\n\\n node_type.set(\\\"peers\\\", [](lua_node& n) {\\n\\n LOG(DBUG) << \\\"getting peers... \\\" << &n;\\n\\n // TODO(asen): need STL support for logger\\n\\n // LOG(DBUG) << n.list_connected_peers();\\n\\n return sol::as_table(n.list_connected_peers());\\n\\n });\\n\\n\\n\\n node_type.set(\\\"get_peer_address\\\", [](lua_node& n, uint32_t pid) {\\n\\n return n.get_peer_info(pid).address;\\n\\n });\\n\\n\\n\\n script.set_usertype(\\\"node\\\", node_type);\\n\\n\\n\\n // Bind node static functions\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 63,\n \"score\": 60009.03724070865\n },\n {\n \"content\": \"\\n\\nusing json = nlohmann::json;\\n\\n\\n\\nusing std::make_unique;\\n\\nusing std::string;\\n\\nusing std::unique_ptr;\\n\\nusing std::vector;\\n\\n\\n\\nvoid string_replace(string* str,\\n\\n const string& oldStr,\\n\\n const string& newStr) {\\n\\n string::size_type pos = 0u;\\n\\n while ((pos = str->find(oldStr, pos)) != string::npos) {\\n\\n str->replace(pos, oldStr.length(), newStr);\\n\\n pos += newStr.length();\\n\\n }\\n\\n}\\n\\n\\n\\nstatic const char* automaton_ascii_logo_cstr =\\n\\n \\\"\\\\n\\\\x1b[40m\\\\x1b[1m\\\"\\n\\n \\\" \\\" \\\"\\\\x1b[0m\\\\n\\\\x1b[40m\\\\x1b[1m\\\"\\n\\n \\\" \\\" \\\"\\\\x1b[0m\\\\n\\\\x1b[40m\\\\x1b[1m\\\"\\n\\n \\\" @197m█▀▀▀█ @39m█ █ █ @11m▀▀█▀▀ @129m█▀▀▀█ @47m█▀█▀█ @9m█▀▀▀█ @27m▀▀█▀▀ @154m█▀▀▀█ @13m█▀█ █ \\\" \\\"\\\\x1b[0m\\\\n\\\\x1b[40m\\\\x1b[1m\\\" // NOLINT\\n\\n \\\" @197m█▀▀▀█ @39m█ ▀ █ @11m█ █ █ @129m█ ▀ █ @47m█ ▀ █ @9m█▀▀▀█ @27m█ █ █ @154m█ ▀ █ @13m█ █ █ @15mCORE \\\" \\\"\\\\x1b[0m\\\\n\\\\x1b[40m\\\\x1b[1m\\\" // NOLINT\\n\\n \\\" @197m▀ ▀ ▀ @39m▀▀▀▀▀ @11m▀ ▀ ▀ @129m▀▀▀▀▀ @47m▀ ▀ ▀ @9m▀ ▀ ▀ @27m▀ ▀ ▀ @154m▀▀▀▀▀ @13m▀ ▀▀▀ @15mv0.0.1 \\\" \\\"\\\\x1b[0m\\\\n\\\\x1b[40m\\\\x1b[1m\\\" // NOLINT\\n\\n \\\" \\\" \\\"\\\\x1b[0m\\\\n@0m\\\"\\n\\n \\\"▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀\\\" \\\"\\\\x1b[0m\\\\n\\\";\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 64,\n \"score\": 60008.60095139311\n },\n {\n \"content\": \" LOG(INFO) << \\\"Server received command: \\\" << cmd << \\\" -> \\\" << automaton::core::io::bin2hex(msg);\\n\\n if (msg.size() > 0) {\\n\\n CryptoPP::StringSource ss(msg, true, new CryptoPP::Base64Decoder(new CryptoPP::StringSink(params)));\\n\\n }\\n\\n if ((*script)[cmd] == nullptr) {\\n\\n LOG(ERROR) << \\\"ERROR in rpc server handler: Invalid request\\\";\\n\\n *s = http_server::status_code::BAD_REQUEST;\\n\\n return \\\"\\\";\\n\\n }\\n\\n sol::protected_function_result pfr = (*script)[cmd](params);\\n\\n if (!pfr.valid()) {\\n\\n sol::error err = pfr;\\n\\n LOG(ERROR) << \\\"ERROR in rpc server handler: \\\" << err.what();\\n\\n *s = http_server::status_code::INTERNAL_SERVER_ERROR;\\n\\n return \\\"\\\";\\n\\n }\\n\\n std::string result = pfr;\\n\\n if (s != nullptr) {\\n\\n *s = http_server::status_code::OK;\\n\\n } else {\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 65,\n \"score\": 60006.569943505136\n },\n {\n \"content\": \"\\n\\nhistory_add(\\\"add_peers()\\\")\\n\\nhints_add(\\\"add_peers()\\\")\\n\\nhistory_add(\\\"remove_peers()\\\")\\n\\nhints_add(\\\"remove_peers()\\\")\\n\\nhistory_add(\\\"list_known_peers()\\\")\\n\\nhints_add(\\\"list_known_peers()\\\")\\n\\nhistory_add(\\\"list_connected_peers()\\\")\\n\\nhints_add(\\\"list_connected_peers()\\\")\\n\\nhistory_add(\\\"get_peers()\\\")\\n\\nhints_add(\\\"get_peers()\\\")\\n\\nhistory_add(\\\"connect()\\\")\\n\\nhints_add(\\\"connect()\\\")\\n\\nhistory_add(\\\"disconnect()\\\")\\n\\nhints_add(\\\"disconnect()\\\")\\n\\nhistory_add(\\\"process_cmd()\\\")\\n\\nhints_add(\\\"process_cmd()\\\")\\n\\n\\n\\nhistory_add(\\\"testnet_create()\\\")\\n\\nhints_add(\\\"testnet_create()\\\")\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 66,\n \"score\": 60005.1849412731\n },\n {\n \"content\": \"-- core.lua\\n\\n\\n\\n-- add rpc/core commands to cli history/hints\\n\\nhistory_add(\\\"list_supported_protocols()\\\")\\n\\nhints_add(\\\"list_supported_protocols()\\\")\\n\\nhistory_add(\\\"list_running_protocols()\\\")\\n\\nhints_add(\\\"list_running_protocols()\\\")\\n\\nhistory_add(\\\"get_protocols()\\\")\\n\\nhints_add(\\\"get_protocols()\\\")\\n\\nhistory_add(\\\"load_protocol()\\\")\\n\\nhints_add(\\\"load_protocol()\\\")\\n\\n\\n\\nhistory_add(\\\"launch_node()\\\")\\n\\nhints_add(\\\"launch_node()\\\")\\n\\nhistory_add(\\\"list_nodes()\\\")\\n\\nhints_add(\\\"list_nodes()\\\")\\n\\nhistory_add(\\\"get_node()\\\")\\n\\nhints_add(\\\"get_node()\\\")\\n\\nhistory_add(\\\"remove_node()\\\")\\n\\nhints_add(\\\"remove_node()\\\")\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 67,\n \"score\": 60004.942561872005\n },\n {\n \"content\": \" sol::protected_function_result pfr = script.safe_script(cmd, &sol::script_pass_on_error);\\n\\n logger_mutex.unlock();\\n\\n\\n\\n if (!pfr.valid()) {\\n\\n sol::error err = pfr;\\n\\n LOG(ERROR) << \\\"Error while executing command: \\\" << err.what();\\n\\n }\\n\\n }\\n\\n\\n\\n rpc_server.stop();\\n\\n\\n\\n updater->stop();\\n\\n delete updater;\\n\\n\\n\\n stop_logger = true;\\n\\n logger.join();\\n\\n\\n\\n LOG(DBUG) << \\\"Destroying lua state & objects\\\";\\n\\n\\n\\n sim->simulation_stop();\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 68,\n \"score\": 60000.730238236814\n },\n {\n \"content\": \"end\\n\\n-----------------\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 69,\n \"score\": 60000.730238236814\n },\n {\n \"content\": \" while (!stop_logger) {\\n\\n // Dump logs once per second.\\n\\n std::this_thread::sleep_for(std::chrono::milliseconds(1500));\\n\\n logger_mutex.lock();\\n\\n try {\\n\\n sol::protected_function_result pfr;\\n\\n pfr = script.safe_script(\\n\\n R\\\"(for k,v in pairs(networks) do\\n\\n dump_logs(k)\\n\\n end\\n\\n )\\\");\\n\\n if (!pfr.valid()) {\\n\\n sol::error err = pfr;\\n\\n std::cout << \\\"\\\\n\\\" << err.what() << \\\"\\\\n\\\";\\n\\n break;\\n\\n }\\n\\n } catch (std::exception& e) {\\n\\n LOG(FATAL) << \\\"Exception in logger: \\\" << e.what();\\n\\n } catch (...) {\\n\\n LOG(FATAL) << \\\"Exception in logger\\\";\\n\",\n \"file_path\": \"src/automaton/core/core.cc\",\n \"rank\": 70,\n \"score\": 60000.730238236814\n },\n {\n \"content\": \"function sent(peer_id, msg_id)\\n\\nend\\n\\n\\n\\nMIN_LAG = 0\\n\\nMAX_LAG = 0\\n\\nlag = 0\\n\\nd_blocks = {}\\n\\ncurrent_message_id = 0\\n\\n\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/blockchain/connections.lua\",\n \"rank\": 71,\n \"score\": 59140.89621652327\n },\n {\n \"content\": \"function sent(peer_id, msg_id, success)\\n\\n -- log(\\\"sent\\\",\\n\\n -- string.format(\\\"Sent to %s (%d), success: %s\\\", peers[peer_id].name, msg_id, tostring(success))\\n\\n -- )\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/chat/chat.lua\",\n \"rank\": 72,\n \"score\": 58341.32782408651\n },\n {\n \"content\": \"function sent(peer_id, msg_id, success)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/examples/smartproto/reservationsystem/reservationsystem.lua\",\n \"rank\": 73,\n \"score\": 58341.32782408651\n },\n {\n \"content\": \"function list_nodes()\\n\\n local res = NodeIdsList()\\n\\n for _,id in ipairs(list_nodes_as_table()) do\\n\\n res.node_ids = id\\n\\n end\\n\\n return res:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 74,\n \"score\": 58214.18348942617\n },\n {\n \"content\": \"function rpc_disconnect(m)\\n\\n local request = PeerIdsList()\\n\\n request:deserialize(m)\\n\\n return disconnect(request.node_id, request.peer_ids)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 75,\n \"score\": 58214.18348942617\n },\n {\n \"content\": \"function rpc_connect(m)\\n\\n local request = PeerIdsList()\\n\\n request:deserialize(m)\\n\\n return connect(request.node_id, request.peer_ids)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 76,\n \"score\": 58214.18348942617\n },\n {\n \"content\": \"#include <memory>\\n\\n#include <string>\\n\\n\\n\\n#include \\\"automaton/core/network/tcp_implementation.h\\\"\\n\\n\\n\\nstatic const char* SERVER_ADDRESS = \\\"127.0.0.1:33777\\\";\\n\\nusing namespace automaton::core::network; // NOLINT\\n\\n\\n\\nstd::shared_ptr<connection> connection_c;\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/rpc_server_core_test.cc\",\n \"rank\": 77,\n \"score\": 57386.562634860435\n },\n {\n \"content\": \" std::stringstream ss;\\n\\n ss << \\\"GET /hello.htm HTTP/1.1\\\\r\\\\n\\\";\\n\\n ss << \\\"User-Agent: Mozilla/4.0 (compatible; MSIE5.01; Windows NT)\\\\r\\\\n\\\";\\n\\n ss << \\\"Host: localhost\\\\r\\\\n\\\";\\n\\n ss << \\\"Accept-Language: en-us\\\\r\\\\n\\\";\\n\\n ss << \\\"Accept-Encoding: gzip, deflate\\\\r\\\\n\\\";\\n\\n ss << \\\"Content-Length: \\\" << input.size() << \\\"\\\\r\\\\n\\\";\\n\\n ss << \\\"Connection: Keep-Alive\\\\r\\\\n\\\";\\n\\n ss << \\\"\\\\r\\\\n\\\" << input;\\n\\n\\n\\n connection_c -> async_send(ss.str(), 0);\\n\\n }\\n\\n connection_c -> disconnect();\\n\\n } else {\\n\\n std::cout << \\\"Connection init failed!\\\" << std::endl;\\n\\n }\\n\\n}\\n\\n\\n\\nint main(int argc, char* argv[]) {\\n\\n automaton::core::network::tcp_init();\\n\\n client();\\n\\n automaton::core::network::tcp_release();\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"src/automaton/core/rpc_server_core_test.cc\",\n \"rank\": 78,\n \"score\": 57373.54285717968\n },\n {\n \"content\": \" void on_connection_error(connection_id c, const automaton::core::common::status& s) {\\n\\n if (s.code == automaton::core::common::status::OK) {\\n\\n return;\\n\\n }\\n\\n std::cout << s << std::endl;\\n\\n }\\n\\n};\\n\\n\\n\\nstd::shared_ptr<char> buffer_c = std::shared_ptr<char>(new char[256], std::default_delete<char[]>());\\n\\n\\n\\nstd::shared_ptr<client_handler> handler_c;\\n\\n\\n\\nvoid client() {\\n\\n connection_c = connection::create(\\\"tcp\\\", 1, SERVER_ADDRESS, std::move(handler_c));\\n\\n if (connection_c->init()) {\\n\\n std::cout << \\\"Connection init was successful!\\\" << std::endl;\\n\\n connection_c -> connect();\\n\\n connection_c -> async_read(buffer_c, 256, 0, 0);\\n\\n std::string input;\\n\\n while (std::getline(std::cin, input)) {\\n\",\n \"file_path\": \"src/automaton/core/rpc_server_core_test.cc\",\n \"rank\": 79,\n \"score\": 57373.31224076798\n },\n {\n \"content\": \"function rpc_process_cmd(m)\\n\\n local request = NodeCmdRequest()\\n\\n request:deserialize(m)\\n\\n return process_cmd(request.node_id, request.cmd, request.params)\\n\\nend\\n\\n\\n\\n-- TESTNET --\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 80,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_list_nodes()\\n\\n return list_nodes()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 81,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_get_protocols(m)\\n\\n local request = ProtocolIDsList()\\n\\n request:deserialize(m)\\n\\n return get_protocols(request.protocol_ids)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 82,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_launch_node(m)\\n\\n local msg = Node()\\n\\n msg:deserialize(m)\\n\\n return launch_node(msg.id, msg.protocol_id, msg.address) -- implemented in core.cc\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 83,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function list_supported_protocols()\\n\\n local m = ProtocolIDsList()\\n\\n for k,_ in pairs(get_core_supported_protocols()) do\\n\\n m.protocol_ids = k\\n\\n end\\n\\n return m:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 84,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_get_nodes(m)\\n\\n local request = NodeIdsList()\\n\\n request:deserialize(m)\\n\\n return get_nodes(request.node_ids)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 85,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_load_protocols(m)\\n\\n local request = ProtocolsList()\\n\\n request:deserialize(m)\\n\\n local protocol_list = {}\\n\\n for _,p in ipairs(request.protocols) do\\n\\n protocol_list[p.protocol_id] = p.path\\n\\n end\\n\\n return load_protocols(protocol_list)\\n\\nend\\n\\n\\n\\n-- NODE RPC COMMON --\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 86,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_remove_peers(m)\\n\\n local request = PeerIdsList()\\n\\n request:deserialize(m)\\n\\n return remove_peers(request.node_id, request.peer_ids)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 87,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_remove_nodes(m)\\n\\n\\n\\nend\\n\\n\\n\\n-- NODE RPC --\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 88,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_get_peers(m)\\n\\n local request = PeerIdsList()\\n\\n request:deserialize(m)\\n\\n return get_peers(request.node_id, request.peer_ids)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 89,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_add_peers(m)\\n\\n local request = PeerAddressesList()\\n\\n request:deserialize(m)\\n\\n return add_peers(request.node_id, request.peer_addresses)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 90,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function list_running_protocols()\\n\\n -- local response = ListProtocolsResponse()\\n\\n -- need to store and get info\\n\\n print(\\\"This function is not yet supported\\\")\\n\\n return \\\"\\\"\\n\\n -- return response:serialize()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 91,\n \"score\": 57361.6041668068\n },\n {\n \"content\": \"function rpc_list_supported_protocols()\\n\\n return list_supported_protocols()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 92,\n \"score\": 56534.45904601318\n },\n {\n \"content\": \"function rpc_list_connected_peers(m)\\n\\n local request = NodeId()\\n\\n request:deserialize(m)\\n\\n return list_connected_peers(request.node_id)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 93,\n \"score\": 56534.45904601318\n },\n {\n \"content\": \"function rpc_list_known_peers(m)\\n\\n local request = NodeId()\\n\\n request:deserialize(m)\\n\\n return list_known_peers(request.node_id)\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 94,\n \"score\": 56534.45904601318\n },\n {\n \"content\": \"function rpc_list_running_protocols()\\n\\n return list_running_protocols()\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 95,\n \"score\": 56534.45904601318\n },\n {\n \"content\": \"function load_protocols(protocol_list)\\n\\n for pid, path in pairs(protocol_list) do\\n\\n load_protocol(pid, path)\\n\\n end\\n\\n return \\\"\\\"\\n\\nend\\n\\n\\n\",\n \"file_path\": \"src/automaton/core/core.lua\",\n \"rank\": 96,\n \"score\": 56534.45904601318\n },\n {\n \"content\": \" return std::shared_ptr<node>(new lua_node(id, proto_id));\\n\\n });\\n\\n\\n\\n EXPECT_EQ(smart_protocol::load(\\\"chat\\\", \\\"automaton/tests/testnet/testproto/\\\"), true);\\n\\n\\n\\n std::shared_ptr<automaton::core::network::simulation> sim = automaton::core::network::simulation::get_simulator();\\n\\n sim->simulation_start(50);\\n\\n\\n\\n EXPECT_EQ(testnet::create_testnet(\\\"lua\\\", \\\"testnet\\\", \\\"chat\\\", testnet::network_protocol_type::simulation, 5,\\n\\n {\\n\\n {1, {2, 3}}, {2, {4, 5}}\\n\\n }),\\n\\n true);\\n\\n\\n\\n auto net = testnet::get_testnet(\\\"testnet\\\");\\n\\n std::vector<std::string> ids = net->list_nodes();\\n\\n\\n\\n default_node_updater updater(1, 20, std::set<std::string>(ids.begin(), ids.end()));\\n\\n updater.start();\\n\\n\\n\",\n \"file_path\": \"src/automaton/tests/testnet/test_simulation.cc\",\n \"rank\": 97,\n \"score\": 53121.353129425195\n },\n {\n \"content\": \" return std::shared_ptr<node>(new lua_node(id, proto_id));\\n\\n });\\n\\n\\n\\n EXPECT_EQ(smart_protocol::load(\\\"chat\\\", \\\"automaton/tests/testnet/testproto/\\\"), true);\\n\\n\\n\\n automaton::core::network::tcp_init();\\n\\n\\n\\n EXPECT_EQ(testnet::create_testnet(\\\"lua\\\", \\\"testnet\\\", \\\"chat\\\", testnet::network_protocol_type::localhost, 5,\\n\\n {\\n\\n {1, {2, 3}}, {2, {4, 5}}\\n\\n }),\\n\\n true);\\n\\n\\n\\n auto net = testnet::get_testnet(\\\"testnet\\\");\\n\\n std::vector<std::string> ids = net->list_nodes();\\n\\n\\n\\n default_node_updater updater(1, 20, std::set<std::string>(ids.begin(), ids.end()));\\n\\n updater.start();\\n\\n\\n\\n auto msg_factory = smart_protocol::get_protocol(\\\"chat\\\")->get_factory();\\n\",\n \"file_path\": \"src/automaton/tests/testnet/test_localhost.cc\",\n \"rank\": 98,\n \"score\": 53120.95427097712\n },\n {\n \"content\": \"#include \\\"automaton/core/data/factory.h\\\"\\n\\n#include \\\"automaton/core/data/protobuf/protobuf_factory.h\\\"\\n\\n#include \\\"automaton/core/data/protobuf/protobuf_schema.h\\\"\\n\\n#include \\\"automaton/core/network/simulated_connection.h\\\"\\n\\n#include \\\"automaton/core/node/node.h\\\"\\n\\n#include \\\"automaton/core/node/node_updater.h\\\"\\n\\n#include \\\"automaton/core/node/lua_node/lua_node.h\\\"\\n\\n#include \\\"automaton/core/smartproto/smart_protocol.h\\\"\\n\\n#include \\\"automaton/core/testnet/testnet.h\\\"\\n\\n\\n\\n#include \\\"gtest/gtest.h\\\"\\n\\n\\n\\nusing automaton::core::node::node;\\n\\nusing automaton::core::node::default_node_updater;\\n\\nusing automaton::core::node::luanode::lua_node;\\n\\nusing automaton::core::smartproto::smart_protocol;\\n\\nusing automaton::core::testnet::testnet;\\n\\n\\n\\nTEST(testnet, test_all) {\\n\\n node::register_node_type(\\\"lua\\\", [](const std::string& id, const std::string& proto_id)->std::shared_ptr<node> {\\n\",\n \"file_path\": \"src/automaton/tests/testnet/test_simulation.cc\",\n \"rank\": 99,\n \"score\": 53117.742079269316\n }\n]","isConversational":false}}},{"rowIdx":286,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"include/SctpSocket.hpp"},"repo_name":{"kind":"string","value":"GaborTimko/lsctp"},"commit":{"kind":"string","value":"cdc89010b1afcc2ed9cd811a61256749938a54dd"},"file_code":{"kind":"string","value":"#ifndef LSSOCKET_HPP\n#define LSSOCKET_HPP\n\n#include <vector>\n#include <cstring>\n#include <cerrno>\n#include <type_traits>\n\n#include <sys/socket.h>\n#include <netinet/in.h>\n#include <netinet/sctp.h>\n#include <arpa/inet.h>\n#include <unistd.h>\n#include <fcntl.h>\n\n#include \"Lua/Lua.hpp\"\n\nnamespace Sctp {\n\nnamespace Socket {\n\ntemplate<int IPVersion>\nclass Base {\n static_assert(IPVersion == 4 or IPVersion == 6, \"\");\npublic:\n using SockAddrType = std::conditional_t<IPVersion == 4, sockaddr_in, sockaddr_in6>;\n using AddressArray = std::vector<SockAddrType>;\n static constexpr int IPv = IPVersion;\nprotected:\n int fd;\n bool haveBoundAddresses;\n AddressArray boundAddresses;\npublic:\n Base() noexcept;\n Base(int sock) noexcept;\n ~Base();\npublic:\n auto create() noexcept -> bool;\n auto bind(Lua::State*) noexcept -> int;\n auto close(Lua::State*) noexcept -> int;\n auto setNonBlocking(Lua::State*) noexcept -> int;\nprotected:\n auto loadAddresses(Lua::State*, AddressArray&) noexcept -> int;\nprivate:\n auto bindFirst(Lua::State*) noexcept -> int;\n auto pushIPAddress(Lua::State*, AddressArray&, const char* ip, uint16_t port, int idx) noexcept -> int;\n auto checkIPConversionResult(Lua::State*, const char* ip, int result) noexcept -> int;\n};\n\ntemplate<int IPVersion>\nBase<IPVersion>::Base() noexcept : haveBoundAddresses(false) {}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::create() noexcept -> bool {\n fd = ::socket(IPVersion == 4 ? AF_INET : AF_INET6, SOCK_STREAM, IPPROTO_SCTP);\n if(fd == -1) {\n return false;\n }\n int True = 1;\n setsockopt(fd, IPPROTO_SCTP, SO_REUSEADDR, &True, sizeof(int));\n return true;\n}\n\ntemplate<int IPVersion>\nBase<IPVersion>::Base(int sock) noexcept : fd(sock), haveBoundAddresses(false) {}\n\ntemplate<int IPVersion>\nBase<IPVersion>::~Base() {\n ::close(fd);\n}\n\ntemplate<int IPVersion>\n auto Base<IPVersion>::setNonBlocking(Lua::State* L) noexcept -> int {\n int flags = fcntl(fd, F_GETFL);\n if(flags < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"fcntl(get): %s\", std::strerror(errno));\n return 2;\n }\n flags = fcntl(fd, F_SETFL, flags | O_NONBLOCK);\n if(flags < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"fcntl(set): %s\", std::strerror(errno));\n return 2;\n }\n Lua::PushBoolean(L, true);\n return 1;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::bind(Lua::State* L) noexcept -> int {\n int loadAddrResult = loadAddresses(L, boundAddresses);\n std::size_t addrCount = boundAddresses.size();\n if(loadAddrResult > 0) {\n return loadAddrResult;\n }\n\n int retVal = bindFirst(L);\n if(retVal > 0) {\n return retVal;\n }\n\n if(addrCount > 1) {\n if(::sctp_bindx(fd, reinterpret_cast<sockaddr*>(boundAddresses.data() + 1), addrCount - 1, SCTP_BINDX_ADD_ADDR) < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"sctp_bindx: %s\", std::strerror(errno));\n return 2;\n }\n }\n\n haveBoundAddresses = true;\n Lua::PushBoolean(L, true);\n return 1;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::loadAddresses(Lua::State* L, AddressArray& addrs) noexcept -> int {\n uint16_t port = htons(Lua::ToInteger(L, 2));\n int stackSize = Lua::GetTop(L);\n std::size_t addrCount = stackSize - 2;\n if(addrCount < 1) {\n Lua::PushBoolean(L, false);\n Lua::PushString(L, \"No addresses were given\");\n return 2;\n }\n addrs.clear();\n addrs.resize(addrCount);\n std::memset(addrs.data(), 0, sizeof(SockAddrType) * addrCount);\n for(int i = 3; i <= stackSize; i++) {\n int idx = i - 3;\n auto addrI = Lua::ToString(L, i);\n int pushResult = pushIPAddress(L, addrs, addrI, port, idx);\n if(pushResult > 0) {\n return pushResult;\n }\n }\n return 0;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::bindFirst(Lua::State* L) noexcept -> int {\n int bindRes = ::bind(fd, reinterpret_cast<sockaddr*>(boundAddresses.data()), sizeof(SockAddrType));\n\n if(bindRes < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"bind: %s\", std::strerror(errno));\n return 2;\n }\n return bindRes;\n}\n\ntemplate<>\ninline auto Base<4>::pushIPAddress(Lua::State* L, AddressArray& addrs, const char* ip, uint16_t port, int idx) noexcept -> int {\n addrs[idx].sin_family = AF_INET;\n addrs[idx].sin_port = port;\n int conversion = ::inet_pton(AF_INET, ip, &addrs[idx].sin_addr);\n return checkIPConversionResult(L, ip, conversion);\n}\n\ntemplate<>\ninline auto Base<6>::pushIPAddress(Lua::State* L, AddressArray& addrs, const char* ip, uint16_t port, int idx) noexcept -> int {\n addrs[idx].sin6_family = AF_INET6;\n addrs[idx].sin6_port = port;\n int conversion = ::inet_pton(AF_INET6, ip, &addrs[idx].sin6_addr);\n return checkIPConversionResult(L, ip, conversion);\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::checkIPConversionResult(Lua::State* L, const char* ip, int result) noexcept -> int {\n if(result == 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"inet_pton: invalid IP: %s\", ip);\n return 2;\n } else if (result < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"inet_pton: %s\", std::strerror(errno));\n return 2;\n }\n return 0;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::close(Lua::State* L) noexcept -> int {\n if(fd > -1 and ::close(fd) < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"close: %s\", std::strerror(errno));\n fd = -1;\n return 2;\n }\n fd = -1;\n boundAddresses.clear();\n Lua::PushBoolean(L, true);\n return 1;\n}\n\n} \n\ntemplate<class Type>\nstruct IsSctpSocket : public std::integral_constant<bool,\n std::is_same<Type, Socket::Base<4>>::value or\n std::is_same<Type, Socket::Base<6>>::value or\n std::is_base_of<Socket::Base<4>, Type>::value or\n std::is_base_of<Socket::Base<6>, Type>::value> {\n};\n\n} \n\n#endif \n\n"},"prefix":{"kind":"string","value":"#ifndef LSSOCKET_HPP\n#define LSSOCKET_HPP\n\n#include <vector>\n#include <cstring>\n#include <cerrno>\n#include <type_traits>\n\n#include <sys/socket.h>\n#include <netinet/in.h>\n#include <netinet/sctp.h>\n#include <arpa/inet.h>\n#include <unistd.h>\n#include <fcntl.h>\n\n#include \"Lua/Lua.hpp\"\n\nnamespace Sctp {\n\nnamespace Socket {\n\ntemplate<int IPVersion>\nclass Base {\n static_assert(IPVersion == 4 or IPVersion == 6, \"\");\npublic:\n using SockAddrType = std::conditional_t<IPVersion == 4, sockaddr_in, sockaddr_in6>;\n using AddressArray = std::vector<SockAddrType>;\n static constexpr int IPv = IPVersion;\nprotected:\n int fd;\n bool haveBoundAddresses;\n AddressArray boundAddresses;\npublic:\n Base() noexcept;\n Base(int sock) noexcept;\n ~Base();\npublic:\n auto create() noexcept -> bool;\n auto bind(Lua::State*) noexcept -> int;\n auto close(Lua::State*) noexcept -> int;\n auto setNonBlocking(Lua::State*) noexcept -> int;\nprotected:\n auto loadAddresses(Lua::State*, AddressArray&) noexcept -> int;\nprivate:\n auto bindFirst(Lua::State*) noexcept -> int;\n auto pushIPAddress(Lua::State*, AddressArray&, const char* ip, uint16_t port, int idx) noexcept -> int;\n auto checkIPConversionResult(Lua::State*, const char* ip, int result) noexcept -> int;\n};\n\ntemplate<int IPVersion>\nBase<IPVersion>::Base() noexcept : haveBoundAddresses(false) {}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::create() noexcept -> bool {\n fd = ::socket(IPVersion == 4 ? AF_INET : AF_INET6, SOCK_STREAM, IPPROTO_SCTP);\n if(fd == -1) {\n return false;\n }\n int True = 1;\n setsockopt(fd, IPPROTO_SCTP, SO_REUSEADDR, &True, sizeof(int));\n return true;\n}\n\ntemplate<int IPVersion>\nBase<IPVersion>::Base(int sock) noexcept : fd(sock), haveBoundAddresses(false) {}\n\ntemplate<int IPVersion>\nBase<IPVersion>::~Base() {\n ::close(fd);\n}\n\ntemplate<int IPVersion>\n auto Base<IPVersion>::setNonBlocking(Lua::State* L) noexcept -> int {\n int flags = fcntl(fd, F_GETFL);\n if(flags < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"fcntl(get): %s\", std::strerror(errno));\n return 2;\n }\n flags = fcntl(fd, F_SETFL, flags | O_NONBLOCK);\n if(flags < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"fcntl(set): %s\", std::strerror(errno));\n return 2;\n }\n Lua::PushBoolean(L, true);\n return 1;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::bind(Lua::State* L) noexcept -> int {\n int loadAddrResult = loadAddresses(L, boundAddresses);\n std::size_t addrCount = boundAddresses.size();\n if(loadAddrResult > 0) {\n return loadAddrResult;\n }\n\n int retVal = bindFirst(L);\n if(retVal > 0) {\n return retVal;\n }\n\n if(addrCount > 1) {\n if(::sctp_bindx(fd, reinterpret_cast<sockaddr*>(boundAddresses.data() + 1), addrCount - 1, SCTP_BINDX_ADD_ADDR) < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"sctp_bindx: %s\", std::strerror(errno));\n return 2;\n }\n }\n\n haveBoundAddresses = true;\n Lua::PushBoolean(L, true);\n return 1;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::loadAddresses(Lua::State* L, AddressArray& addrs) noexcept -> int {\n uint16_t port = htons(Lua::ToInteger(L, 2));\n int stackSize = Lua::GetTop(L);\n std::size_t addrCount = stackSize - 2;\n if(addrCount < 1) {\n Lua::PushBoolean(L, false);\n Lua::PushString(L, \"No addresses were given\");\n return 2;\n }\n addrs.clear();\n addrs.resize(addrCount);\n std::memset(addrs.data(), 0, sizeof(SockAddrType) * addrCount);\n for(int i = 3; i <= stackSize; i++) {\n int idx = i - 3;\n auto addrI = Lua::ToString(L, i);\n int pushResult = pushIPAddress(L, addrs, addrI, port, idx);\n if(pushResult > 0) {\n return pushResult;\n }\n }\n return 0;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::bindFirst(Lua::State* L) noexcept -> int {\n int bindRes = ::bind(fd, reinterpret_cast<sockaddr*>(boundAddresses.data()), sizeof(SockAddrType));\n\n if(bindRes < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"bind: %s\", std::strerror(errno));\n return 2;\n }\n return bindRes;\n}\n\ntemplate<>\n"},"suffix":{"kind":"string","value":"\n\ntemplate<>\ninline auto Base<6>::pushIPAddress(Lua::State* L, AddressArray& addrs, const char* ip, uint16_t port, int idx) noexcept -> int {\n addrs[idx].sin6_family = AF_INET6;\n addrs[idx].sin6_port = port;\n int conversion = ::inet_pton(AF_INET6, ip, &addrs[idx].sin6_addr);\n return checkIPConversionResult(L, ip, conversion);\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::checkIPConversionResult(Lua::State* L, const char* ip, int result) noexcept -> int {\n if(result == 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"inet_pton: invalid IP: %s\", ip);\n return 2;\n } else if (result < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"inet_pton: %s\", std::strerror(errno));\n return 2;\n }\n return 0;\n}\n\ntemplate<int IPVersion>\nauto Base<IPVersion>::close(Lua::State* L) noexcept -> int {\n if(fd > -1 and ::close(fd) < 0) {\n Lua::PushBoolean(L, false);\n Lua::PushFString(L, \"close: %s\", std::strerror(errno));\n fd = -1;\n return 2;\n }\n fd = -1;\n boundAddresses.clear();\n Lua::PushBoolean(L, true);\n return 1;\n}\n\n} \n\ntemplate<class Type>\nstruct IsSctpSocket : public std::integral_constant<bool,\n std::is_same<Type, Socket::Base<4>>::value or\n std::is_same<Type, Socket::Base<6>>::value or\n std::is_base_of<Socket::Base<4>, Type>::value or\n std::is_base_of<Socket::Base<6>, Type>::value> {\n};\n\n} \n\n#endif \n\n"},"middle":{"kind":"string","value":"inline auto Base<4>::pushIPAddress(Lua::State* L, AddressArray& addrs, const char* ip, uint16_t port, int idx) noexcept -> int {\n addrs[idx].sin_family = AF_INET;\n addrs[idx].sin_port = port;\n int conversion = ::inet_pton(AF_INET, ip, &addrs[idx].sin_addr);\n return checkIPConversionResult(L, ip, conversion);\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"class Server final : public Base<IPVersion> {\n\npublic:\n\n static constexpr int DefaultBackLogSize = 1000;\n\n static const char* MetaTableName;\n\npublic:\n\n Server() : Base<IPVersion>() {}\n\npublic:\n\n auto listen(Lua::State*) noexcept -> int;\n\n auto accept(Lua::State*) noexcept -> int;\n\n};\n\n\n\ntemplate<int IPVersion>\n\nauto Server<IPVersion>::listen(Lua::State* L) noexcept -> int {\n\n int backLogSize = Lua::Aux::OptInteger(L, 2, Server<IPVersion>::DefaultBackLogSize);\n\n int result = ::listen(this->fd, backLogSize);\n\n if(result < 0) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, \"listen: %s\", std::strerror(errno));\n\n return 2;\n\n }\n","file_path":"include/SctpServerSocket.hpp","rank":0,"score":343239.04808772984},{"content":"class Client final : public Base<IPVersion> {\n\npublic:\n\n static const char* MetaTableName;\n\n static const std::size_t MaxRecvBufferSize = 5000;\n\nprivate:\n\n char recvBuffer[MaxRecvBufferSize];\n\npublic:\n\n Client() : Base<IPVersion>() {}\n\n Client(int sock);\n\npublic:\n\n auto connect(Lua::State*) noexcept -> int;\n\n auto sendmsg(Lua::State*) noexcept -> int;\n\n auto recvmsg(Lua::State*) noexcept -> int;\n\n};\n\n\n\ntemplate<int IPVersion>\n\nClient<IPVersion>::Client(int sock) : Base<IPVersion>(sock) {}\n\n\n\ntemplate<int IPVersion>\n\nauto Client<IPVersion>::connect(Lua::State* L) noexcept -> int {\n","file_path":"include/SctpClientSocket.hpp","rank":1,"score":343239.04808772984},{"content":" typename Base<IPVersion>::AddressArray peerAddresses;\n\n int loadAddrResult = this->loadAddresses(L, peerAddresses);\n\n if(loadAddrResult > 0) {\n\n return loadAddrResult;\n\n }\n\n\n\n if(::sctp_connectx(this->fd, reinterpret_cast<sockaddr*>(peerAddresses.data()), peerAddresses.size(), nullptr) < 0) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, \"sctp_connectx: %s\", std::strerror(errno));\n\n return 2;\n\n }\n\n\n\n Lua::PushBoolean(L, true);\n\n return 1;\n\n}\n\n\n\ntemplate<int IPVersion>\n\nauto Client<IPVersion>::sendmsg(Lua::State* L) noexcept -> int {\n\n std::size_t bufferLength;\n\n auto buffer = Lua::Aux::CheckLString(L, -1, bufferLength);\n","file_path":"include/SctpClientSocket.hpp","rank":13,"score":149133.79724916868},{"content":"#ifndef SCTPSERVERSOCKET_HPP\n\n#define SCTPSERVERSOCKET_HPP\n\n\n\n#include \"SctpSocket.hpp\"\n\n#include \"SctpClientSocket.hpp\"\n\n\n\nnamespace Sctp {\n\n\n\nnamespace Socket {\n\n\n\ntemplate<int IPVersion>\n","file_path":"include/SctpServerSocket.hpp","rank":14,"score":149131.08434680558},{"content":"#ifndef SCTPCLIENTSOCKET_HPP\n\n#define SCTPCLIENTSOCKET_HPP\n\n\n\n#include \"SctpSocket.hpp\"\n\n\n\nnamespace Sctp {\n\n\n\nnamespace Socket {\n\n\n\ntemplate<int IPVersion>\n","file_path":"include/SctpClientSocket.hpp","rank":15,"score":149130.85856605924},{"content":" Lua::PushBoolean(L, true);\n\n return 1;\n\n}\n\n\n\ntemplate<int IPVersion>\n\nauto Server<IPVersion>::accept(Lua::State* L) noexcept -> int {\n\n int newFD = ::accept(this->fd, nullptr, nullptr);\n\n if(newFD < 0 and (errno == EAGAIN or errno == EWOULDBLOCK)) {\n\n //Non-blocking socket is being used, nothing to do\n\n Lua::PushBoolean(L, false);\n\n Lua::PushString(L, \"EAGAIN/EWOULDBLOCK\");\n\n return 2;\n\n } else if(newFD < 0) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, \"accept() failed: %s\", std::strerror(errno));\n\n return 2;\n\n }\n\n auto connSock = Lua::NewUserData<Sctp::Socket::Client<IPVersion>>(L);\n\n if(connSock == nullptr) {\n\n Lua::PushNil(L);\n","file_path":"include/SctpServerSocket.hpp","rank":16,"score":149130.20075423576},{"content":" Lua::PushString(L, \"Socket userdata allocation failed\");\n\n return 2;\n\n }\n\n\n\n new (connSock) Sctp::Socket::Client<IPVersion>(newFD);\n\n\n\n Lua::Aux::GetMetaTable(L, Sctp::Socket::Client<IPVersion>::MetaTableName);\n\n Lua::SetMetaTable(L, -2);\n\n return 1;\n\n}\n\n\n\n} //namespace Socket\n\n\n\n} //namespace Sctp\n\n\n\n\n\n#endif /* SCTPSERVERSOCKET_HPP */\n\n\n","file_path":"include/SctpServerSocket.hpp","rank":17,"score":149127.49328594562},{"content":"\n\n// sctp_sndrcvinfo info;\n\n// std::memset(&info, 0, sizeof(sctp_sndrcvinfo));\n\n\n\n //TODO: Add support for choosing at least ppid, stream number and flags\n\n ssize_t numBytesSent = ::sctp_sendmsg(this->fd, buffer, bufferLength, nullptr, 0, 0, 0, 0, 0, 0);\n\n if(numBytesSent < 0) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, (errno == EAGAIN ? \"EAGAIN\" : \"sctp_sendmsg: %s\"), std::strerror(errno));\n\n return 2;\n\n }\n\n Lua::PushInteger(L, numBytesSent);\n\n return 1;\n\n}\n\n\n\ntemplate<int IPVersion>\n\nauto Client<IPVersion>::recvmsg(Lua::State* L) noexcept -> int {\n\n// sctp_sndrcvinfo info;\n\n// std::memset(&info, 0, sizeof(sctp_sndrcvinfo));\n\n\n","file_path":"include/SctpClientSocket.hpp","rank":18,"score":149123.7412056626},{"content":" //TODO: Add support for filling sctp_sndrcvinfo and flags\n\n std::memset(&recvBuffer, 0, sizeof(recvBuffer));\n\n ssize_t numBytesReceived = ::sctp_recvmsg(this->fd, recvBuffer, MaxRecvBufferSize, nullptr, nullptr, nullptr, nullptr);\n\n if(numBytesReceived < 0) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, (errno == EAGAIN or errno == EWOULDBLOCK ? \"EAGAIN/EWOULDBLOCK\" : \"sctp_recvmsg: %s\"), std::strerror(errno));\n\n return 2;\n\n }\n\n Lua::PushInteger(L, numBytesReceived);\n\n Lua::PushLString(L, recvBuffer, numBytesReceived);\n\n return 2;\n\n}\n\n\n\n} //namespace Socket\n\n\n\n} //namespace Sctp\n\n\n\n#endif /* SCTPCLIENTSOCKET_HPP */\n\n\n","file_path":"include/SctpClientSocket.hpp","rank":19,"score":149119.52590539312},{"content":"enum class Types {\n\n None = LUA_TNONE,\n\n Nil = LUA_TNIL,\n\n Boolean = LUA_TBOOLEAN,\n\n LightUserData = LUA_TLIGHTUSERDATA,\n\n Number = LUA_TNUMBER,\n\n String = LUA_TSTRING,\n\n Table = LUA_TTABLE,\n\n Function = LUA_TFUNCTION,\n\n UserData = LUA_TUSERDATA,\n\n Thread = LUA_TTHREAD,\n\n NumTags = LUA_NUMTAGS\n\n};\n\n\n\n\n\ntemplate<class ConstType>\n\nconstexpr ConstType MinStack = ConstType(LUA_MINSTACK);\n\n\n\n\n","file_path":"include/Lua/Lua.hpp","rank":20,"score":117023.18663559256},{"content":"enum class Hooks {\n\n Call = LUA_HOOKCALL,\n\n Return = LUA_HOOKRET,\n\n Line = LUA_HOOKLINE,\n\n Count = LUA_HOOKCOUNT,\n\n TailCall = LUA_HOOKTAILCALL\n\n};\n\n\n","file_path":"include/Lua/Lua.hpp","rank":21,"score":117023.18663559256},{"content":"enum class Statuses {\n\n OK = LUA_OK,\n\n Yield = LUA_YIELD,\n\n RuntimeError = LUA_ERRRUN,\n\n SyntaxError = LUA_ERRSYNTAX,\n\n MemAllocError = LUA_ERRMEM,\n\n GCMethaMError = LUA_ERRGCMM,\n\n MsgHandlerError = LUA_ERRERR,\n\n FileError = LUA_ERRFILE\n\n};\n\n\n\nusing State = detail::lua_State;\n\n\n","file_path":"include/Lua/Lua.hpp","rank":22,"score":117023.18663559256},{"content":"enum class HookMasks {\n\n Call = LUA_MASKCALL,\n\n Return = LUA_MASKRET,\n\n Line = LUA_MASKLINE,\n\n Count = LUA_MASKCOUNT\n\n};\n\n\n\n\n\nusing Debug = detail::lua_Debug;\n\n\n\nusing Hook = detail::lua_Hook;\n\n\n\n\n\ninline bool GetStack(State* L, int level, Debug* ar) {\n\n return static_cast<bool>(detail::lua_getstack(L, level, ar));\n\n}\n\ninline int GetInfo(State* L, const char* what, Debug* ar) {\n\n return detail::lua_getinfo(L, what, ar);\n\n}\n\ninline const char* GetLocal(State* L, const Debug* ar, int n) {\n","file_path":"include/Lua/Lua.hpp","rank":23,"score":114945.578801029},{"content":"//TODO::Consider later if it's possible to do this all\n\n//arithmetic, with operator overloading\n\nenum class ArithmeticOperators {\n\n Add = LUA_OPADD,\n\n Sub = LUA_OPSUB,\n\n Mul = LUA_OPMUL,\n\n Mod = LUA_OPMOD,\n\n Pow = LUA_OPPOW,\n\n FloatDiv = LUA_OPDIV,\n\n FloorDiv = LUA_OPIDIV,\n\n BitwiseAnd = LUA_OPBAND,\n\n BitwiseOr = LUA_OPBOR,\n\n BitwiseXor = LUA_OPBXOR,\n\n ShiftLeft = LUA_OPSHL,\n\n ShiftRight = LUA_OPSHR,\n\n UnaryNegation = LUA_OPUNM,\n\n BitwiseNot = LUA_OPBNOT,\n\n};\n\n\n","file_path":"include/Lua/Lua.hpp","rank":24,"score":114945.578801029},{"content":"enum class RelationalOperators {\n\n Equals = LUA_OPEQ,\n\n LessThan = LUA_OPLT,\n\n LessOrEqual = LUA_OPLE\n\n};\n\n\n\ninline void Arith(State* L, ArithmeticOperators op) {\n\n detail::lua_arith(L, static_cast<int>(op));\n\n}\n\n//TODO: should these 2 functions return bool?\n\ninline bool RawEqual(State* L, int idx1, int idx2) {\n\n return static_cast<bool>(detail::lua_rawequal(L, idx1, idx2));\n\n}\n\ninline bool Compare(State* L, int idx1, int idx2, RelationalOperators op) {\n\n return static_cast<bool>(detail::lua_compare(L, idx1, idx2, static_cast<int>(op)));\n\n}\n\n\n\n\n\n//TODO: check for possibility of function overloading (+type_traits)\n\ninline void PushNil(State* L) {\n","file_path":"include/Lua/Lua.hpp","rank":25,"score":114945.578801029},{"content":"enum class RidX {\n\n MainThread = LUA_RIDX_MAINTHREAD,\n\n Globals = LUA_RIDX_GLOBALS,\n\n Last = RidX::Globals\n\n};\n\n\n\nusing Number = detail::lua_Number;\n\nusing Integer = detail::lua_Integer;\n\nusing Unsigned = detail::lua_Unsigned;\n\nusing KContext = detail::lua_KContext;\n\n\n\nusing CFunction = detail::lua_CFunction;\n\nusing KFunction = detail::lua_KFunction;\n\nusing Reader = detail::lua_Reader;\n\nusing Writer = detail::lua_Writer;\n\nusing Alloc = detail::lua_Alloc;\n\n\n\n//auto Ident = detail::lua_ident;\n\n\n\ninline State* NewState(Alloc f, void* ud) {\n","file_path":"include/Lua/Lua.hpp","rank":26,"score":114945.578801029},{"content":"enum class GarbageCollectionOpts {\n\n Stop = LUA_GCSTOP,\n\n Restart = LUA_GCRESTART,\n\n Collect = LUA_GCCOLLECT,\n\n Count = LUA_GCCOUNT,\n\n CountB = LUA_GCCOUNTB,\n\n Step = LUA_GCSTEP,\n\n SetPause = LUA_GCSETPAUSE,\n\n SetStupMul = LUA_GCSETSTEPMUL,\n\n IsRunning = LUA_GCISRUNNING\n\n};\n\n\n\ninline int GC(State* L, GarbageCollectionOpts what, int data) {\n\n return detail::lua_gc(L, static_cast<int>(what), data);\n\n}\n\n\n\n\n\ninline int Error(State* L) {\n\n return detail::lua_error(L);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":27,"score":112954.91953362757},{"content":"LUALIB_API void luaL_pushresult (luaL_Buffer *B) {\n\n lua_State *L = B->L;\n\n lua_pushlstring(L, B->b, B->n);\n\n if (buffonstack(B)) {\n\n resizebox(L, -2, 0); /* delete old buffer */\n\n lua_remove(L, -2); /* remove its header from the stack */\n\n }\n","file_path":"subprojects/lua/src/lauxlib.c","rank":28,"score":87725.50148733547},{"content":" lu_byte idx; /* index of upvalue (in stack or in outer function's list) */\n","file_path":"subprojects/lua/src/lobject.h","rank":29,"score":80840.32941658188},{"content":" short idx; /* variable index in stack */\n","file_path":"subprojects/lua/src/lparser.h","rank":30,"score":80840.32941658188},{"content":" StkId base; /* base for this function */\n","file_path":"subprojects/lua/src/lstate.h","rank":31,"score":80823.32422003653},{"content":" struct lua_State *L;\n","file_path":"subprojects/lua/src/llex.h","rank":32,"score":80633.44798611967},{"content":" lua_State *L;\n","file_path":"subprojects/lua/src/lauxlib.h","rank":33,"score":80633.44798611967},{"content":" lua_State *L;\n","file_path":"subprojects/lua/src/ldump.c","rank":34,"score":80633.44798611967},{"content":" lua_State *L;\n","file_path":"subprojects/lua/src/lundump.c","rank":35,"score":80633.44798611967},{"content":" lua_State *L;\n","file_path":"subprojects/lua/src/lstrlib.c","rank":36,"score":80633.44798611967},{"content":" lua_State *L;\t\t\t/* Lua state (for reader) */\n","file_path":"subprojects/lua/src/lzio.h","rank":37,"score":80633.44798611967},{"content":"LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname);\n","file_path":"subprojects/lua/src/lauxlib.h","rank":38,"score":80453.84854638053},{"content":"LUAMOD_API int (luaopen_debug) (lua_State *L);\n","file_path":"subprojects/lua/src/lualib.h","rank":39,"score":80453.84854638053},{"content":"LUA_API int (lua_gethookcount) (lua_State *L);\n","file_path":"subprojects/lua/src/lua.h","rank":40,"score":80453.84854638053},{"content":" return 2;\n\n }\n\n new (sock) SocketType();\n\n if (not sock->create()) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, \"socket(): %s\", std::strerror(errno));\n\n return 2;\n\n }\n\n\n\n Lua::Aux::GetMetaTable(L, SocketType::MetaTableName);\n\n Lua::SetMetaTable(L, -2);\n\n return 1;\n\n}\n\n\n\ntemplate<int IPVersion, template<int> class SocketType = Sctp::Socket::Base>\n\nusing MemberFuncType = int (SocketType<IPVersion>::*)(Lua::State*);\n\n\n\ntemplate<int IPVersion, template<int> class SocketType, MemberFuncType<IPVersion, SocketType> fn>\n\nauto CallMemberFunction(Lua::State* L) -> int {\n\n static_assert(Sctp::IsSctpSocket<SocketType<IPVersion>>::value, \"\");\n","file_path":"src/lsctp.cpp","rank":41,"score":25.51902882688075},{"content":"\n\n} //namespace Sctp\n\n\n\nnamespace {\n\n\n\ntemplate<class SocketType>\n\nauto UserDataToSocket(Lua::State* L, int idx) -> SocketType* {\n\n static_assert(Sctp::IsSctpSocket<SocketType>::value, \"\");\n\n\n\n return Lua::Aux::TestUData<SocketType>(L, idx, SocketType::MetaTableName);\n\n}\n\n\n\ntemplate<class SocketType>\n\nauto New(Lua::State* L) -> int {\n\n static_assert(Sctp::IsSctpSocket<SocketType>::value, \"\");\n\n\n\n auto sock = Lua::NewUserData<SocketType>(L);\n\n if(sock == nullptr) {\n\n Lua::PushNil(L);\n\n Lua::PushString(L, \"Socket userdata allocation failed\");\n","file_path":"src/lsctp.cpp","rank":42,"score":25.499793753932018},{"content":"sctp = {\n\n --[[\n\n returns a userdata (Sctp::Socket)\n\n ]]\n\n socket(),\n\n \n\n --[[\n\n Calls bind() and sctp_bindx() internally. No IP version mixing\n\n sock: contains the address family.\n\n port: every given address will use this port number\n\n addr1: at least 1 address is mandatory\n\n ...: no limit for multihoming\n\n ]]\n\n bind(sock, port, addr1, ...),\n\n listen(),\n\n accept(),\n\n \n\n --[[\n\n Should it be connect or connectx?\n\n ]]\n","file_path":"plan.lua","rank":43,"score":24.78407578231151},{"content":" auto basePtr = static_cast<Sctp::Socket::Base<IPVersion>*>(sock);\n\n return (basePtr->*fn)(L);\n\n}\n\n\n\ntemplate<class SocketType>\n\nauto DestroySocket(Lua::State* L) noexcept -> int {\n\n static_assert(Sctp::IsSctpSocket<SocketType>::value, \"\");\n\n\n\n auto sock = UserDataToSocket<SocketType>(L, 1);\n\n sock->SocketType::~SocketType();\n\n return 0;\n\n}\n\n\n\n//I haven't found a way yet to keep array of structures in the format below\n\n//So for now, clang-format is off-limits\n\n// clang-format off\n\nconst Lua::Aux::Reg ServerSocketMetaTable4[] = {\n\n { \"bind\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::bind> },\n\n { \"close\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::close> },\n\n { \"listen\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::listen> },\n","file_path":"src/lsctp.cpp","rank":44,"score":24.241510993377187},{"content":"\n\n auto sock = UserDataToSocket<SocketType<IPVersion>>(L, 1);\n\n if (sock == nullptr) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, \"Can\\'t call function, pointer is nil.\");\n\n return 2;\n\n }\n\n return (sock->*fn)(L);\n\n}\n\n\n\ntemplate<int IPVersion, template<int> class SocketType, MemberFuncType<IPVersion> fn>\n\nauto CallMemberFunction(Lua::State* L) -> int {\n\n static_assert(Sctp::IsSctpSocket<SocketType<IPVersion>>::value, \"\");\n\n\n\n auto sock = UserDataToSocket<SocketType<IPVersion>>(L, 1);\n\n if (sock == nullptr) {\n\n Lua::PushBoolean(L, false);\n\n Lua::PushFString(L, \"Can\\'t call function, pointer is nil.\");\n\n return 2;\n\n }\n","file_path":"src/lsctp.cpp","rank":45,"score":23.277176002609387},{"content":"#include <type_traits>\n\n\n\n#include \"Lua/Lua.hpp\"\n\n#include \"SctpSocket.hpp\"\n\n#include \"SctpServerSocket.hpp\"\n\n#include \"SctpClientSocket.hpp\"\n\n\n\nnamespace Sctp {\n\n\n\nnamespace Socket {\n\n\n\ntemplate<> const char* Server<4>::MetaTableName = \"ServerSocketMeta4\";\n\n\n\ntemplate<> const char* Server<6>::MetaTableName = \"ServerSocketMeta6\";\n\n\n\ntemplate<> const char* Client<4>::MetaTableName = \"ClientSocketMeta4\";\n\n\n\ntemplate<> const char* Client<6>::MetaTableName = \"ClientSocketMeta6\";\n\n\n\n} //namespace Socket\n","file_path":"src/lsctp.cpp","rank":46,"score":21.07689011714052},{"content":"inline void XMove(State* from, State* to, int n) {\n\n detail::lua_xmove(from, to, n);\n\n}\n\n\n\n\n\ninline bool IsString(State* L, int idx) {\n\n return static_cast<bool>(detail::lua_isstring(L, idx));\n\n}\n\ninline bool IsCFunction(State* L, int idx) {\n\n return static_cast<bool>(detail::lua_iscfunction(L, idx));\n\n}\n\ninline bool IsInteger(State* L, int idx) {\n\n return static_cast<bool>(detail::lua_isinteger(L, idx));\n\n}\n\ninline bool IsUserData(State* L, int idx) {\n\n return static_cast<bool>(detail::lua_isuserdata(L, idx));\n\n}\n\ninline Types Type(State* L, int idx) {\n\n return static_cast<Types>(detail::lua_type(L, idx));\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":47,"score":19.051388971640893},{"content":"}\n\ninline bool IsNone(State* L, int idx) {\n\n return Type(L, idx) == Types::None;\n\n}\n\ninline bool IsNoneOrNil(State* L, int idx) {\n\n return static_cast<int>(Type(L, idx)) <= 0;\n\n}\n\ninline const char* PushLiteral(State* L, const char* s) {\n\n return PushString(L, s);\n\n}\n\n//TODO: Check RawGet's input params and convert macro to const\n\ninline void PushGlobalTable(State* L) {\n\n RawGet(L, RegistryIndex, static_cast<int>(RidX::Globals));\n\n}\n\ninline const char* ToString(State* L, int idx) {\n\n return ToLString(L, idx, nullptr);\n\n}\n\ninline void Insert(State* L, int idx) {\n\n Rotate(L, idx, 1);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":48,"score":18.192991345873924},{"content":"inline const char* GSub(State* L, const char* s, const char* p, const char* r) {\n\n return detail::luaL_gsub(L, s, p, r);\n\n}\n\ninline void SetFuncs(State* L, const Reg* l, int nup) {\n\n detail::luaL_setfuncs(L, l, nup);\n\n}\n\ninline bool GetSubTable(State* L, int idx, const char* fname) {\n\n return static_cast<bool>(detail::luaL_getsubtable(L, idx, fname));\n\n}\n\ninline void TraceBack(State* L, State* L1, const char* msg, int level) {\n\n detail::luaL_traceback(L, L1, msg, level);\n\n}\n\ninline void RequiRef(State* L, const char* modname, CFunction openf, bool glb) {\n\n detail::luaL_requiref(L, modname, openf, static_cast<int>(glb));\n\n}\n\n\n\ntemplate<size_t N>\n\ninline void NewLibTable(State* L, const Reg (&l)[N]) {\n\n CreateTable(L, 0, sizeof(l)/sizeof(l[0]) - 1);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":49,"score":17.14468228704644},{"content":"inline const char* TypeName(State* L, Types tp) {\n\n return detail::lua_typename(L, static_cast<int>(tp));\n\n}\n\ninline Number ToNumberX(State* L, int idx, int* isNum) {\n\n return detail::lua_tonumberx(L, idx, isNum);\n\n}\n\ninline Integer ToIntegerX(State* L, int idx, int* isNum) {\n\n return detail::lua_tointegerx(L, idx, isNum);\n\n}\n\ninline bool ToBoolean(State* L, int idx) {\n\n return static_cast<bool>(detail::lua_toboolean(L, idx));\n\n}\n\ninline const char* ToLString(State* L, int idx, std::size_t* len) {\n\n return detail::lua_tolstring(L, idx, len);\n\n}\n\ninline std::size_t RawLen(State* L, int idx) {\n\n return detail::lua_rawlen(L, idx);\n\n}\n\ninline CFunction ToCFunction(State* L, int idx) {\n\n return detail::lua_tocfunction(L, idx);\n","file_path":"include/Lua/Lua.hpp","rank":50,"score":17.119412881810902},{"content":" return static_cast<Types>(detail::lua_gettable(L, idx));\n\n}\n\ninline Types GetField(State* L, int idx, const char* k) {\n\n return static_cast<Types>(detail::lua_getfield(L, idx, k));\n\n}\n\ninline Types Geti(State* L, int idx, Integer n) {\n\n return static_cast<Types>(detail::lua_geti(L, idx, n));\n\n}\n\ninline Types RawGet(State* L, int idx) {\n\n return static_cast<Types>(detail::lua_rawget(L, idx));\n\n}\n\ninline Types RawGet(State* L, int idx, Integer n) {\n\n return static_cast<Types>(detail::lua_rawgeti(L, idx, n));\n\n}\n\ninline Types RawGet(State* L, int idx, const void* p) {\n\n return static_cast<Types>(detail::lua_rawgetp(L, idx, p));\n\n}\n\ninline void CreateTable(State* L, int narr, int nrec) {\n\n detail::lua_createtable(L, narr, nrec);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":51,"score":16.717529067209448},{"content":" PushCFunction(L, fn);\n\n SetGlobal(L, name);\n\n}\n\ninline bool IsFunction(State* L, int idx) {\n\n return Type(L, idx) == Types::Function;\n\n}\n\ninline bool IsTable(State* L, int idx) {\n\n return Type(L, idx) == Types::Table;\n\n}\n\ninline bool IsLightUserData(State* L, int idx) {\n\n return Type(L, idx) == Types::LightUserData;\n\n}\n\ninline bool IsNil(State* L, int idx) {\n\n return Type(L, idx) == Types::Nil;\n\n}\n\ninline bool IsBoolean(State* L, int idx) {\n\n return Type(L, idx) == Types::Boolean;\n\n}\n\ninline bool IsThread(State* L, int idx) {\n\n return Type(L, idx) == Types::Thread;\n","file_path":"include/Lua/Lua.hpp","rank":52,"score":16.342414826675643},{"content":" return detail::lua_absindex(L, idx);\n\n}\n\ninline int GetTop(State* L) {\n\n return detail::lua_gettop(L);\n\n}\n\ninline void SetTop(State* L, int idx) {\n\n detail::lua_settop(L, idx);\n\n}\n\ninline void PushValue(State* L, int idx) {\n\n detail::lua_pushvalue(L, idx);\n\n}\n\ninline void Rotate(State* L, int idx, int n) {\n\n detail::lua_rotate(L, idx, n);\n\n}\n\ninline void Copy(State* L, int fromIdx, int toIdx) {\n\n detail::lua_copy(L, fromIdx, toIdx);\n\n}\n\ninline bool CheckStack(State* L, int n) {\n\n return static_cast<bool>(detail::lua_checkstack(L, n));\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":53,"score":16.026457083100613},{"content":"template<class Type>\n\ninline Type* NewUserData(State* L) {\n\n return static_cast<Type*>(detail::lua_newuserdata(L, sizeof(Type)));\n\n}\n\ninline Types GetMetaTable(State* L, int objindex) {\n\n return static_cast<Types>(detail::lua_getmetatable(L, objindex));\n\n}\n\ninline Types GetUserValue(State* L, int idx) {\n\n return static_cast<Types>(detail::lua_getuservalue(L, idx));\n\n}\n\n\n\ninline void SetGlobal(State* L, const char* name) {\n\n detail::lua_setglobal(L, name);\n\n}\n\ninline void SetTable(State* L, int idx) {\n\n detail::lua_settable(L, idx);\n\n}\n\ninline void SetField(State* L, int idx, const char* k) {\n\n detail::lua_setfield(L, idx, k);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":54,"score":15.49242232440698},{"content":"}\n\ninline int ExecResult(State* L, int stat) {\n\n return detail::luaL_execresult(L, stat);\n\n}\n\n\n\n\n\n\n\nconstexpr auto Noref = LUA_NOREF;\n\nconstexpr auto Refnil = LUA_REFNIL;\n\n\n\ninline int Ref(State* L, int t) {\n\n return detail::luaL_ref(L, t);\n\n}\n\ninline void UnRef(State* L, int t, int ref) {\n\n return detail::luaL_unref(L, t, ref);\n\n}\n\ntemplate<size_t N>\n\ninline Statuses LoadFileX(State* L, const char* filename, const char (&mode)[N]) {\n\n static_assert(::detail::LoadModeChecker(mode), R\"(Load mode can only be \"b\", \"t\", \"bt\" or null pointer)\");\n\n return static_cast<Statuses>(detail::luaL_loadfilex(L, filename, mode));\n","file_path":"include/Lua/Lua.hpp","rank":55,"score":15.18046820434199},{"content":"inline Type* TestUData(State* L, int ud, const char* tname) {\n\n return static_cast<Type*>(detail::luaL_testudata(L, ud, tname));\n\n}\n\ntemplate<class Type>\n\ninline Type* CheckUData(State* L, int ud, const char* tname) {\n\n return static_cast<Type*>(detail::luaL_checkudata(L, ud, tname));\n\n}\n\ninline void Where(State* L, int lvl) {\n\n detail::luaL_where(L, lvl);\n\n}\n\ntemplate<class ...VarArgs>\n\ninline int Error(State* L, const char* fmt, VarArgs&&... args) {\n\n return detail::luaL_error(L, fmt, args...);\n\n}\n\ntemplate<size_t N>\n\ninline int CheckOption(State* L, int arg, const char* def, const char* const (&lst)[N]) {\n\n return detail::luaL_checkoption(L, arg, def, lst);\n\n}\n\ninline int FileTesult(State* L, int stat, const char* fname) {\n\n return detail::luaL_fileresult(L, stat, fname);\n","file_path":"include/Lua/Lua.hpp","rank":56,"score":14.688046827984765},{"content":"\n\nusing Reg = detail::luaL_Reg;\n\n\n\nconstexpr auto NumSizes = (sizeof(Integer) * 16) + sizeof(Number);\n\n\n\ninline void CheckVersion(State* L, Number ver, size_t sz) {\n\n detail::luaL_checkversion_(L, ver, sz);\n\n}\n\ninline void CheckVersion(State* L) {\n\n CheckVersion(L, VersionNumber, NumSizes);\n\n}\n\n\n\n\n\n\n\ninline Types GetMetaField(State* L, int obj, const char* e) {\n\n return static_cast<Types>(detail::luaL_getmetafield(L, obj, e));\n\n}\n\ninline bool CallMeta(State* L, int obj, const char* e) {\n\n return static_cast<bool>(detail::luaL_callmeta(L, obj, e));\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":57,"score":14.265906050961044},{"content":"inline Hook GetHook(State* L) {\n\n return detail::lua_gethook(L);\n\n}\n\ninline HookMasks GetHookMask(State* L) {\n\n return static_cast<HookMasks>(detail::lua_gethookmask(L));\n\n}\n\ninline int GetHookCount(State* L) {\n\n return detail::lua_gethookcount(L);\n\n}\n\n\n\n\n\n//TODO: What should be done about lualib.h?\n\nnamespace Lib {\n\n\n\nnamespace Open {\n\n\n\ninline int Base(State* L) {\n\n return detail::luaopen_base(L);\n\n}\n\ninline int Coroutine(State* L) {\n","file_path":"include/Lua/Lua.hpp","rank":58,"score":13.598832587130484},{"content":" return ::Lua::TypeName(L, Type(L, index));\n\n}\n\n\n\ninline bool DoFile(State* L, const char* filename) {\n\n return LoadFile(L, filename) == Statuses::OK ? (PCall(L, 0, MultiReturn, 0) == Statuses::OK ? false : true) : true;\n\n}\n\n\n\ninline bool DoString(State* L, const char* str) {\n\n return LoadString(L, str) == Statuses::OK ? (PCall(L, 0, MultiReturn, 0) == Statuses::OK ? false : true) : true;\n\n}\n\n\n\ninline Types GetMetaTable(State* L, const char* tname) {\n\n return GetField(L, RegistryIndex, tname);\n\n}\n\n\n\n//TODO: Don't miss this\n\n#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))\n\n\n\ninline Statuses LoadBuffer(State* L, const char* buff, size_t sz, const char* name) {\n\n return LoadBufferX(L, buff, sz, name, nullptr);\n","file_path":"include/Lua/Lua.hpp","rank":59,"score":13.478691705172412},{"content":" return detail::lua_newstate(f, ud);\n\n}\n\ninline void Close(State* L) {\n\n detail::lua_close(L);\n\n}\n\ninline State* NewThread(State* L) {\n\n return detail::lua_newthread(L);\n\n}\n\ninline CFunction AtPanic(State* L, CFunction panicf) {\n\n return detail::lua_atpanic(L, panicf);\n\n}\n\ninline const Number* Version(State* L) {\n\n return detail::lua_version(L);\n\n}\n\ninline bool IsNumber(State* L, int idx) {\n\n return static_cast<bool>(detail::lua_isnumber(L, idx));\n\n}\n\n\n\n\n\ninline int AbsIndex(State* L, int idx) {\n","file_path":"include/Lua/Lua.hpp","rank":60,"score":13.368108187316427},{"content":"inline void* GetExtraSpace(State* L) {\n\n return lua_getextraspace(L);\n\n}\n\ninline Number ToNumber(State* L, int idx){\n\n return ToNumberX(L, idx, nullptr);\n\n}\n\ninline Integer ToInteger(State* L,int idx) {\n\n return ToIntegerX(L, idx, nullptr);\n\n}\n\ninline void Pop(State* L, int idx) {\n\n SetTop(L, -idx-1);\n\n}\n\ninline void Newtable(State* L) {\n\n CreateTable(L, 0, 0);\n\n}\n\ninline void PushCFunction(State* L, CFunction fn) {\n\n PushCClosure(L, fn, 0);\n\n}\n\n\n\ninline void Register(State* L, const char* name, CFunction fn) {\n","file_path":"include/Lua/Lua.hpp","rank":61,"score":13.352878787140988},{"content":"template<size_t N>\n\ninline void NewLib(State* L, const Reg (&l)[N]) {\n\n CheckVersion(L);\n\n NewLibTable(L, l);\n\n SetFuncs(L, l, 0);\n\n}\n\n\n\ninline void ArgCheck(State* L, bool cond, int arg, const char *extramsg) {\n\n if(not cond) {\n\n ArgError(L, arg, extramsg);\n\n }\n\n}\n\ninline const char* CheckString(State* L, int arg) {\n\n return detail::luaL_checklstring(L, arg, nullptr);\n\n}\n\ninline const char* OptString(State* L, int arg, const char* d) {\n\n return detail::luaL_optlstring(L, arg, d, nullptr);\n\n}\n\n\n\ninline const char* TypeName(State* L, int index) {\n","file_path":"include/Lua/Lua.hpp","rank":62,"score":13.277981043945267},{"content":"}\n\ninline Statuses LoadFileX(State* L, const char* filename, const char* mode) {\n\n return static_cast<Statuses>(detail::luaL_loadfilex(L, filename, mode));\n\n}\n\ninline Statuses LoadFile(State* L, const char* filename) {\n\n return static_cast<Statuses>(LoadFileX(L, filename, nullptr));\n\n}\n\n\n\ninline Statuses LoadBufferX(State* L, const char* buff, size_t sz, const char* name, const char* mode) {\n\n return static_cast<Statuses>(detail::luaL_loadbufferx(L, buff, sz, name, mode));\n\n}\n\ninline Statuses LoadString(State* L, const char* s) {\n\n return static_cast<Statuses>(detail::luaL_loadstring(L, s));\n\n}\n\ninline State* NewState() {\n\n return detail::luaL_newstate();\n\n}\n\ninline Integer Len(State* L, int idx) {\n\n return detail::luaL_len(L, idx);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":63,"score":13.19255727104671},{"content":"inline void Remove(State* L, int idx) {\n\n Rotate(L, idx, (-1));\n\n Pop(L, 1);\n\n}\n\ninline void Replace(State* L, int idx) {\n\n Copy(L, -1, idx);\n\n Pop(L, 1);\n\n}\n\n\n\n\n","file_path":"include/Lua/Lua.hpp","rank":64,"score":13.189570501045935},{"content":"\n\ninline Statuses Load(State* L, Reader reader, void* dt, const char* chunkname, const char* mode) {\n\n return static_cast<Statuses>(detail::lua_load(L, reader, dt, chunkname, mode));\n\n}\n\ninline int Dump(State* L, Writer writer, void* data, int strip) {\n\n return detail::lua_dump(L, writer, data, strip);\n\n}\n\n\n\n\n\ninline int YieldK(State* L, int nresults, KContext ctx, KFunction k) {\n\n return detail::lua_yieldk(L, nresults, ctx, k);\n\n}\n\ninline Statuses Resume(State* L, State* from, int narg) {\n\n return static_cast<Statuses>(detail::lua_resume(L, from, narg));\n\n}\n\ninline Statuses Status(State* L) {\n\n return static_cast<Statuses>(detail::lua_status(L));\n\n}\n\ninline bool IsYieldable(State* L) {\n\n return static_cast<bool>(detail::lua_isyieldable(L));\n\n}\n\ninline int Yield(State* L,int nresults) {\n\n return YieldK(L, nresults, 0, nullptr);\n\n}\n\n\n\n\n","file_path":"include/Lua/Lua.hpp","rank":65,"score":13.040231040458186},{"content":"inline const char* ToLString(State* L, int idx, size_t& len) {\n\n return detail::luaL_tolstring(L, idx, &len);\n\n}\n\ninline int ArgError(State* L, int arg, const char* extramsg) {\n\n return detail::luaL_argerror(L, arg, extramsg);\n\n}\n\ninline const char* CheckLString(State* L, int arg, size_t& l) {\n\n return detail::luaL_checklstring(L, arg, &l);\n\n}\n\ninline const char* OptLString(State* L, int arg, const char* def, size_t& l) {\n\n return detail::luaL_optlstring(L, arg, def, &l);\n\n}\n\ninline Number CheckNumber(State* L, int arg) {\n\n return detail::luaL_checknumber(L, arg);\n\n}\n\ninline Number OptNumber(State* L, int arg, Number def) {\n\n return detail::luaL_optnumber(L, arg, def);\n\n}\n\ninline Integer CheckInteger(State* L, int arg) {\n\n return detail::luaL_checkinteger(L, arg);\n","file_path":"include/Lua/Lua.hpp","rank":66,"score":12.943742915153086},{"content":"}\n\ninline void* ToUserData(State* L, int idx) {\n\n return detail::lua_touserdata(L, idx);\n\n}\n\ninline State* ToThread(State* L, int idx) {\n\n return detail::lua_tothread(L, idx);\n\n}\n\ninline const void* ToPointer(State* L, int idx) {\n\n return detail::lua_topointer(L, idx);\n\n}\n\n\n\n\n","file_path":"include/Lua/Lua.hpp","rank":67,"score":12.850118281241182},{"content":"}\n\ninline void PushCClosure(State* L, CFunction fn, int n) {\n\n detail::lua_pushcclosure(L, fn, n);\n\n}\n\ninline void PushBoolean(State* L, bool b) {\n\n detail::lua_pushboolean(L, static_cast<int>(b));\n\n}\n\ninline void PushLightUserData(State* L, void* p) {\n\n detail::lua_pushlightuserdata(L, p);\n\n}\n\ninline int PushThread(State* L) {\n\n return detail::lua_pushthread(L);\n\n}\n\n\n\n\n\n//TODO: function overloading\n\ninline Types GetGlobal(State* L, const char* name) {\n\n return static_cast<Types>(detail::lua_getglobal(L, name));\n\n}\n\ninline Types GetTable(State* L, int idx) {\n","file_path":"include/Lua/Lua.hpp","rank":68,"score":12.77856624729492},{"content":"inline void Seti(State* L, int idx, Integer n) {\n\n detail::lua_seti(L, idx, n);\n\n}\n\ninline void RawSet(State* L, int idx) {\n\n detail::lua_rawset(L, idx);\n\n}\n\ninline void RawSet(State* L, int idx, Integer n) {\n\n detail::lua_rawseti(L, idx, n);\n\n}\n\ninline void RawSet(State* L, int idx, const void* p) {\n\n detail::lua_rawsetp(L, idx, p);\n\n}\n\ninline int SetMetaTable(State* L, int objindex) {\n\n return detail::lua_setmetatable(L, objindex);\n\n}\n\ninline void SetUserValue(State* L, int idx) {\n\n detail::lua_setuservalue(L, idx);\n\n}\n\n\n\n\n","file_path":"include/Lua/Lua.hpp","rank":69,"score":12.69964356390427},{"content":"inline int Next(State* L, int idx) {\n\n return detail::lua_next(L, idx);\n\n}\n\ninline void Concat(State* L, int n) {\n\n detail::lua_concat(L, n);\n\n}\n\ninline void Len(State* L, int idx) {\n\n detail::lua_len(L, idx);\n\n}\n\ninline std::size_t StringToNumber(State* L, const char* s) {\n\n return detail::lua_stringtonumber(L, s);\n\n}\n\ninline Alloc GetAllocF(State* L, void** ud) {\n\n return detail::lua_getallocf(L, ud);\n\n}\n\ninline void SetAllocF(State* L, Alloc f, void* ud) {\n\n detail::lua_setallocf(L, f, ud);\n\n}\n\n\n\n\n","file_path":"include/Lua/Lua.hpp","rank":70,"score":11.88652076210818},{"content":"constexpr auto Release = LUA_RELEASE;\n\nconstexpr auto CopyRight = LUA_COPYRIGHT;\n\nconstexpr auto Authors = LUA_AUTHORS;\n\n\n\nconstexpr auto Signature = LUA_SIGNATURE;\n\nconstexpr auto MultiReturn = LUA_MULTRET;\n\nconstexpr auto RegistryIndex = LUA_REGISTRYINDEX;\n\n\n\ntemplate<class IdxType>\n\nconstexpr auto UpvalueIndex(const IdxType i) -> decltype(lua_upvalueindex(-1)) {\n\n static_assert(std::is_arithmetic<IdxType>::value, \"\");\n\n return RegistryIndex - i;\n\n}\n\n\n","file_path":"include/Lua/Lua.hpp","rank":71,"score":11.883256550546049},{"content":" { \"accept\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::accept> },\n\n { \"setnonblocking\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::setNonBlocking> },\n\n { \"__gc\", DestroySocket<Sctp::Socket::Server<4>> },\n\n { nullptr, nullptr }\n\n};\n\n\n\nconst Lua::Aux::Reg ServerSocketMetaTable6[] = {\n\n { \"bind\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::bind> },\n\n { \"close\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::close> },\n\n { \"listen\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::listen> },\n\n { \"accept\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::accept> },\n\n { \"setnonblocking\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::setNonBlocking> },\n\n { \"__gc\", DestroySocket<Sctp::Socket::Server<6>> },\n\n { nullptr, nullptr }\n\n};\n\n\n\nconst Lua::Aux::Reg ClientSocketMetaTable4[] = {\n\n { \"bind\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::bind> },\n\n { \"connect\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::connect> },\n\n { \"send\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::sendmsg> },\n","file_path":"src/lsctp.cpp","rank":72,"score":11.692924077176585},{"content":" { \"recv\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::recvmsg> },\n\n { \"close\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::close> },\n\n { \"setnonblocking\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::setNonBlocking> },\n\n { \"__gc\", DestroySocket<Sctp::Socket::Client<4>> },\n\n { nullptr, nullptr }\n\n};\n\n\n\nconst Lua::Aux::Reg ClientSocketMetaTable6[] = {\n\n { \"bind\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::bind> },\n\n { \"connect\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::connect> },\n\n { \"send\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::sendmsg> },\n\n { \"recv\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::recvmsg> },\n\n { \"close\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::close> },\n\n { \"setnonblocking\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::setNonBlocking> },\n\n { \"__gc\", DestroySocket<Sctp::Socket::Client<6>> },\n\n { nullptr, nullptr }\n\n};\n\n// clang-format on\n\n\n\n} //anonymous namespace\n","file_path":"src/lsctp.cpp","rank":73,"score":11.670484716151195},{"content":"}\n\ninline Integer OptInteger(State* L, int arg, Integer def) {\n\n return detail::luaL_optinteger(L, arg, def);\n\n}\n\ninline void CheckStack(State* L, int sz, const char* msg) {\n\n detail::luaL_checkstack(L, sz, msg);\n\n}\n\ninline void CheckType(State* L, int arg, int t) {\n\n detail::luaL_checktype(L, arg, t);\n\n}\n\ninline void CheckAny(State* L, int arg) {\n\n detail::luaL_checkany(L, arg);\n\n}\n\ninline int NewMetaTable(State* L, const char* tname) {\n\n return detail::luaL_newmetatable(L, tname);\n\n}\n\ninline void SetMetaTable(State* L, const char* tname) {\n\n detail::luaL_setmetatable(L, tname);\n\n}\n\ntemplate<class Type>\n","file_path":"include/Lua/Lua.hpp","rank":74,"score":11.568357447931916},{"content":"\n\ninline void CallK(State* L, int nargs, int nresults, KContext ctx, KFunction k) {\n\n detail::lua_callk(L, nargs, nresults, ctx, k);\n\n}\n\ninline void Call(State* L, int nargs, int nresults) {\n\n CallK(L, nargs, nresults, 0, nullptr);\n\n}\n\n\n\ninline Statuses PCallK(State* L, int nargs, int nresults, int errfunc, KContext ctx, KFunction k) {\n\n return static_cast <Statuses>(detail::lua_pcallk(L, nargs, nresults, errfunc, ctx, k));\n\n}\n\ninline Statuses PCall(State* L,int nargs, int nresults, int errfunc) {\n\n return static_cast<Statuses>(PCallK(L, nargs, nresults, errfunc, 0, nullptr));\n\n}\n\n\n\ntemplate<size_t N>\n\ninline Statuses Load(State* L, Reader reader, void* dt, const char* chunkname, const char (&mode)[N]) {\n\n static_assert(::detail::LoadModeChecker(mode), R\"(Load mode can only be \"b\", \"t\", \"bt\" or null pointer)\");\n\n return static_cast<Statuses>(detail::lua_load(L, reader, dt, chunkname, mode));\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":75,"score":11.541677332441203},{"content":"printResult(sock6 ~= nil and type(sock6) == \"userdata\", error)\n\n\n\nio.write(\"bind(ipv6SH): \")\n\nlocal success, error = sock6:bind(12345, \"::1\")\n\nprintResult(success, error)\n\nsock6:close()\n\n\n\n--[[io.write(\"bind(ipv6MH): \")\n\nlocal success, error = sock6:bind(12345, \"::1\", \"::2\")\n\nprintResult(success, error)]]\n\n\n\n--I really should create/use a testing framework\n\nio.write(\"send/receive: \")\n\nlocal server = sctp.server.socket4()\n\nserver:bind(12345, \"127.1.1.1\", \"127.3.3.3\")\n\nserver:listen()\n\n\n\nlocal client = sctp.client.socket4()\n\nclient:bind(12345, \"127.2.2.2\", \"127.4.4.4\")\n\nclient:connect(12345, \"127.1.1.1\", \"127.3.3.3\")\n","file_path":"tst/lua/socket.lua","rank":76,"score":11.524527758517618},{"content":"#ifndef LUA_HPP\n\n#define LUA_HPP\n\n\n\n#include <type_traits>\n\n#include <cstddef>\n\n#include <cstdarg>\n\n#include <cstdio>\n\n\n\nnamespace detail {\n\n\n\nextern \"C\" {\n\n#include \"lua.h\"\n\n#include \"lualib.h\"\n\n#include \"lauxlib.h\"\n\n}\n\n\n\nconstexpr bool LoadModeChecker(const char* c) {\n\n return c == nullptr or\n\n (c[0] == 't' and c[1] == '\\0') or\n\n (c[0] == 'b' and c[1] == '\\0') or\n","file_path":"include/Lua/Lua.hpp","rank":77,"score":11.408185844643699},{"content":"\n\nextern \"C\" int luaopen_sctp(Lua::State* L) {\n\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Server<4>::MetaTableName);\n\n Lua::PushValue(L, -1);\n\n Lua::SetField(L, -2, \"__index\");\n\n Lua::Aux::SetFuncs(L, ServerSocketMetaTable4, 0);\n\n\n\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Server<6>::MetaTableName);\n\n Lua::PushValue(L, -1);\n\n Lua::SetField(L, -2, \"__index\");\n\n Lua::Aux::SetFuncs(L, ServerSocketMetaTable6, 0);\n\n\n\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Client<4>::MetaTableName);\n\n Lua::PushValue(L, -1);\n\n Lua::SetField(L, -2, \"__index\");\n\n Lua::Aux::SetFuncs(L, ClientSocketMetaTable4, 0);\n\n\n\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Client<6>::MetaTableName);\n\n Lua::PushValue(L, -1);\n\n Lua::SetField(L, -2, \"__index\");\n","file_path":"src/lsctp.cpp","rank":78,"score":11.197900779331864},{"content":"int luaK_exp2anyreg (FuncState *fs, expdesc *e) {\n\n luaK_dischargevars(fs, e);\n\n if (e->k == VNONRELOC) { /* expression already has a register? */\n\n if (!hasjumps(e)) /* no jumps? */\n\n return e->u.info; /* result is already in a register */\n\n if (e->u.info >= fs->nactvar) { /* reg. is not a local? */\n\n exp2reg(fs, e, e->u.info); /* put final result in it */\n\n return e->u.info;\n\n }\n\n }\n\n luaK_exp2nextreg(fs, e); /* otherwise, use next available register */\n\n return e->u.info;\n","file_path":"subprojects/lua/src/lcode.c","rank":79,"score":11.167742520678704},{"content":" return detail::lua_getlocal(L, ar, n);\n\n}\n\ninline const char* SetLocal(State* L, const Debug* ar, int n) {\n\n return detail::lua_setlocal(L, ar, n);\n\n}\n\ninline const char* GetUpvalue(State* L, int funcindex, int n) {\n\n return detail::lua_getupvalue(L, funcindex, n);\n\n}\n\ninline const char* SetUpvalue(State* L, int funcindex, int n) {\n\n return detail::lua_setupvalue(L, funcindex, n);\n\n}\n\ninline void* UpvalueID(State* L, int fidx, int n) {\n\n return detail::lua_upvalueid(L, fidx, n);\n\n}\n\ninline void UpvalueJoin(State* L, int fidx1, int n1, int fidx2, int n2) {\n\n return detail::lua_upvaluejoin(L, fidx1, n1, fidx2, n2);\n\n}\n\ninline void SetHook(State* L, Hook func, int mask, int count) {\n\n return detail::lua_sethook(L, func, mask, count);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":80,"score":11.010122842500133},{"content":"inline int Math(State* L) {\n\n return detail::luaopen_math(L);\n\n}\n\ninline int Debug(State* L) {\n\n return detail::luaopen_debug(L);\n\n}\n\ninline int Package(State* L) {\n\n return detail::luaopen_package(L);\n\n}\n\n//Not sure it's the right place for this function since it's an auxiliary\n\n//function, but declared in lualib.h\n\ninline void Libs(State* L) {\n\n detail::luaL_openlibs(L);\n\n}\n\n\n\n} //Namespace Open\n\n\n\n} //Namespace Lib\n\n\n\nnamespace Aux {\n","file_path":"include/Lua/Lua.hpp","rank":81,"score":10.96071563375165},{"content":"static int luaB_xpcall (lua_State *L) {\n\n int status;\n\n int n = lua_gettop(L);\n\n luaL_checktype(L, 2, LUA_TFUNCTION); /* check error function */\n\n lua_pushboolean(L, 1); /* first result */\n\n lua_pushvalue(L, 1); /* function */\n\n lua_rotate(L, 3, 2); /* move them below function's arguments */\n\n status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall);\n\n return finishpcall(L, status, 2);\n","file_path":"subprojects/lua/src/lbaselib.c","rank":82,"score":10.884724030644609},{"content":" Lua::Aux::SetFuncs(L, ClientSocketMetaTable6, 0);\n\n\n\n const Lua::Aux::Reg SocketFuncs[] = { { nullptr, nullptr } };\n\n Lua::Aux::NewLib(L, SocketFuncs);\n\n\n\n Lua::Newtable(L);\n\n Lua::PushCFunction(L, New<Sctp::Socket::Server<4>>);\n\n Lua::SetField(L, -2, \"socket4\");\n\n Lua::PushCFunction(L, New<Sctp::Socket::Server<6>>);\n\n Lua::SetField(L, -2, \"socket6\");\n\n Lua::SetField(L, -2, \"server\");\n\n\n\n Lua::Newtable(L);\n\n Lua::PushCFunction(L, New<Sctp::Socket::Client<4>>);\n\n Lua::SetField(L, -2, \"socket4\");\n\n Lua::PushCFunction(L, New<Sctp::Socket::Client<6>>);\n\n Lua::SetField(L, -2, \"socket6\");\n\n Lua::SetField(L, -2, \"client\");\n\n\n\n return 1;\n\n}\n","file_path":"src/lsctp.cpp","rank":83,"score":10.84917153962978},{"content":"void luaK_setoneret (FuncState *fs, expdesc *e) {\n\n if (e->k == VCALL) { /* expression is an open function call? */\n\n /* already returns 1 value */\n\n lua_assert(GETARG_C(getinstruction(fs, e)) == 2);\n\n e->k = VNONRELOC; /* result has fixed position */\n\n e->u.info = GETARG_A(getinstruction(fs, e));\n\n }\n\n else if (e->k == VVARARG) {\n\n SETARG_B(getinstruction(fs, e), 2);\n\n e->k = VRELOCABLE; /* can relocate its simple result */\n\n }\n","file_path":"subprojects/lua/src/lcode.c","rank":84,"score":10.658761331721664},{"content":" but that would prevent the other tests to run\n\n]]\n\n\n\nio.write(\"socket(ipv4): \")\n\nlocal sock4, error = sctp.server.socket4()\n\nprintResult(sock4 ~= nil and type(sock4) == \"userdata\", error)\n\n\n\nio.write(\"bind(ipv4SH): \")\n\nlocal success, error = sock4:bind(12345, \"127.0.0.1\")\n\nprintResult(success, error)\n\nsock4:close()\n\n\n\nlocal sock4MH = sctp.server.socket4()\n\nio.write(\"bind(ipv4MH): \")\n\nlocal success, error = sock4MH:bind(12345, \"127.0.0.1\", \"127.0.0.2\", \"127.1.1.1\")\n\nprintResult(success, error)\n\nsock4MH:close()\n\n\n\nio.write(\"socket(ipv6): \")\n\nlocal sock6, error = sctp.server.socket6()\n","file_path":"tst/lua/socket.lua","rank":85,"score":10.54536527745663},{"content":" detail::lua_pushnil(L);\n\n}\n\ninline void PushNumber(State* L, Number n) {\n\n detail::lua_pushnumber(L, n);\n\n}\n\ninline void PushInteger(State* L, Integer n) {\n\n detail::lua_pushinteger(L, n);\n\n}\n\ninline const char* PushLString(State* L, const char* s, std::size_t len) {\n\n return detail::lua_pushlstring(L, s, len);\n\n}\n\ninline const char* PushString(State* L, const char* s) {\n\n return detail::lua_pushstring(L, s);\n\n}\n\ninline const char* PushVFString(State* L, const char* fmt, va_list argp) {\n\n return detail::lua_pushvfstring(L, fmt, argp);\n\n}\n\ntemplate<class ...VarArgs>\n\ninline const char* PushFString(State* L, const char* fmt, VarArgs&&... args) {\n\n return detail::lua_pushfstring(L, fmt, args...);\n","file_path":"include/Lua/Lua.hpp","rank":86,"score":9.457614957293085},{"content":"}\n\ninline void AddValue(Buffer& B) {\n\n detail::luaL_addvalue(&B);\n\n}\n\ninline void PushResult(Buffer& B) {\n\n detail::luaL_pushresult(&B);\n\n}\n\ninline void PushResultSize(Buffer& B, size_t sz) {\n\n detail::luaL_pushresultsize(&B, sz);\n\n}\n\ninline char* BuffInitSize(State* L, Buffer& B, size_t sz) {\n\n return detail::luaL_buffinitsize(L, &B, sz);\n\n}\n\n\n\n//#define luaL_prepbuffsize(B, sz) PrepBuffSize(*B, sz)\n\ninline void AddChar(Buffer& B, char c) {\n\n luaL_addchar(&B, c);\n\n //B.n < B.size || PrepBuffSize(B, 1), B.b[B.n++] = c;\n\n}\n\n\n","file_path":"include/Lua/Lua.hpp","rank":87,"score":9.128178870002944},{"content":" return detail::luaopen_coroutine(L);\n\n}\n\ninline int Table(State* L) {\n\n return detail::luaopen_table(L);\n\n}\n\ninline int IO(State* L) {\n\n return detail::luaopen_io(L);\n\n}\n\ninline int OS(State* L) {\n\n return detail::luaopen_os(L);\n\n}\n\ninline int String(State* L) {\n\n return detail::luaopen_string(L);\n\n}\n\ninline int Utf8(State* L) {\n\n return detail::luaopen_utf8(L);\n\n}\n\ninline int Bit32(State* L) {\n\n return detail::luaopen_bit32(L);\n\n}\n","file_path":"include/Lua/Lua.hpp","rank":88,"score":9.10607574635613},{"content":"static void settabss (lua_State *L, const char *k, const char *v) {\n\n lua_pushstring(L, v);\n\n lua_setfield(L, -2, k);\n","file_path":"subprojects/lua/src/ldblib.c","rank":89,"score":9.067385165854153},{"content":"TString *luaS_new (lua_State *L, const char *str) {\n\n unsigned int i = point2uint(str) % STRCACHE_N; /* hash */\n\n int j;\n\n TString **p = G(L)->strcache[i];\n\n for (j = 0; j < STRCACHE_M; j++) {\n\n if (strcmp(str, getstr(p[j])) == 0) /* hit? */\n\n return p[j]; /* that is it */\n\n }\n\n /* normal route */\n\n for (j = STRCACHE_M - 1; j > 0; j--)\n\n p[j] = p[j - 1]; /* move out last element */\n\n /* new element is first in the list */\n\n p[0] = luaS_newlstr(L, str, strlen(str));\n\n return p[0];\n","file_path":"subprojects/lua/src/lstring.c","rank":90,"score":8.564880373665204},{"content":"# lsctp\n\nA simple Lua module that binds some features of the SCTP api.\n\n\n\nLimitations:\n\n- One-to-one sockets only\n\n- Mixing IPv4 and IPv6 addresses are not supported\n\n- Usage of deprecated sctp_sendmsg() and sctp_recvmsg() functions (because of lksctp-tools)\n\n\n\nExample usage:\n\n```lua\n\nsctp = require \"sctp\"\n\n\n\nlocal server = sctp.server.socket4()\n\nserver:bind(12345, \"127.0.0.1\")\n\nserver:listen()\n\n\n\nlocal client = sctp.client.socket4()\n\nclient:connect(12345, \"127.0.0.1\")\n\n\n\nlocal peer = server:accept()\n\n\n\nclient:send(string.pack(\"iii\", 1, 2, 3))\n\nlocal size, msg = peer:recv()\n\n\n\nprint(string.unpack(\"iii\", msg))\n\n\n\npeer:close()\n\nclient:close()\n\nserver:close()\n\n\n\n```\n","file_path":"README.md","rank":91,"score":8.365179254265},{"content":"static int checkupval (lua_State *L, int argf, int argnup) {\n\n int nup = (int)luaL_checkinteger(L, argnup); /* upvalue index */\n\n luaL_checktype(L, argf, LUA_TFUNCTION); /* closure */\n\n luaL_argcheck(L, (lua_getupvalue(L, argf, nup) != NULL), argnup,\n\n \"invalid upvalue index\");\n\n return nup;\n","file_path":"subprojects/lua/src/ldblib.c","rank":92,"score":8.198772678703804},{"content":"static const char *get_prompt (lua_State *L, int firstline) {\n\n const char *p;\n\n lua_getglobal(L, firstline ? \"_PROMPT\" : \"_PROMPT2\");\n\n p = lua_tostring(L, -1);\n\n if (p == NULL) p = (firstline ? LUA_PROMPT : LUA_PROMPT2);\n\n return p;\n","file_path":"subprojects/lua/src/lua.c","rank":93,"score":8.162816266821402},{"content":"}\n\n\n\n\n\nusing Buffer = detail::luaL_Buffer;\n\n\n\ninline void AddSize(Buffer& B, size_t n) {\n\n luaL_addsize(&B, n);\n\n}\n\n\n\ninline void BuffInit(State* L, Buffer& B) {\n\n detail::luaL_buffinit(L, &B);\n\n}\n\ninline char* PrepBuffSize(Buffer& B, size_t sz) {\n\n return detail::luaL_prepbuffsize(&B, sz);\n\n}\n\ninline void AddLString(Buffer& B, const char* s, size_t l) {\n\n detail::luaL_addlstring(&B, s, l);\n\n}\n\ninline void AddString(Buffer& B, const char* s) {\n\n detail::luaL_addstring(&B, s);\n","file_path":"include/Lua/Lua.hpp","rank":94,"score":8.160194375290773},{"content":"static int luaB_ipairs (lua_State *L) {\n\n#if defined(LUA_COMPAT_IPAIRS)\n\n return pairsmeta(L, \"__ipairs\", 1, ipairsaux);\n\n#else\n\n luaL_checkany(L, 1);\n\n lua_pushcfunction(L, ipairsaux); /* iteration function */\n\n lua_pushvalue(L, 1); /* state */\n\n lua_pushinteger(L, 0); /* initial value */\n\n return 3;\n\n#endif\n","file_path":"subprojects/lua/src/lbaselib.c","rank":95,"score":7.996607489444553},{"content":"void luaK_exp2nextreg (FuncState *fs, expdesc *e) {\n\n luaK_dischargevars(fs, e);\n\n freeexp(fs, e);\n\n luaK_reserveregs(fs, 1);\n\n exp2reg(fs, e, fs->freereg - 1);\n","file_path":"subprojects/lua/src/lcode.c","rank":96,"score":7.825387211621011},{"content":" (c[0] == 'b' and c[1] == 't');\n\n}\n\n\n\n} //Namespace detail\n\n\n\nnamespace Lua {\n\n\n\nnamespace Conf {\n\n\n\nconstexpr auto ExtraSpace = LUA_EXTRASPACE;\n\n\n\n} //namespace Conf\n\n\n\nconstexpr auto VersionMajor = LUA_VERSION_MAJOR;\n\nconstexpr auto VersionMinor = LUA_VERSION_MINOR;\n\nconstexpr auto VersionNumber = LUA_VERSION_NUM;\n\nconstexpr auto VersionRelease = LUA_VERSION_RELEASE;\n\n\n\n//Version renamed to prevent name clash with the function Version\n\nconstexpr auto VersionStr = LUA_VERSION;\n","file_path":"include/Lua/Lua.hpp","rank":97,"score":7.65218168666935},{"content":"void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {\n\n lua_assert(!hasjumps(t) && (vkisinreg(t->k) || t->k == VUPVAL));\n\n t->u.ind.t = t->u.info; /* register or upvalue index */\n\n t->u.ind.idx = luaK_exp2RK(fs, k); /* R/K index for key */\n\n t->u.ind.vt = (t->k == VUPVAL) ? VUPVAL : VLOCAL;\n\n t->k = VINDEXED;\n","file_path":"subprojects/lua/src/lcode.c","rank":98,"score":7.401123782567147},{"content":"static int moveresults (lua_State *L, const TValue *firstResult, StkId res,\n\n int nres, int wanted) {\n\n switch (wanted) { /* handle typical cases separately */\n\n case 0: break; /* nothing to move */\n\n case 1: { /* one result needed */\n\n if (nres == 0) /* no results? */\n\n firstResult = luaO_nilobject; /* adjust with nil */\n\n setobjs2s(L, res, firstResult); /* move it to proper place */\n\n break;\n\n }\n\n case LUA_MULTRET: {\n\n int i;\n\n for (i = 0; i < nres; i++) /* move all results to correct place */\n\n setobjs2s(L, res + i, firstResult + i);\n\n L->top = res + nres;\n\n return 0; /* wanted == LUA_MULTRET */\n\n }\n\n default: {\n\n int i;\n\n if (wanted <= nres) { /* enough results? */\n\n for (i = 0; i < wanted; i++) /* move wanted results to correct place */\n\n setobjs2s(L, res + i, firstResult + i);\n\n }\n\n else { /* not enough results; use all of them plus nils */\n\n for (i = 0; i < nres; i++) /* move all results to correct place */\n\n setobjs2s(L, res + i, firstResult + i);\n\n for (; i < wanted; i++) /* complete wanted number of results */\n\n setnilvalue(res + i);\n\n }\n\n break;\n\n }\n\n }\n\n L->top = res + wanted; /* top points after the last result */\n\n return 1;\n","file_path":"subprojects/lua/src/ldo.c","rank":99,"score":7.3077081771281955}],"string":"[\n {\n \"content\": \"class Server final : public Base<IPVersion> {\\n\\npublic:\\n\\n static constexpr int DefaultBackLogSize = 1000;\\n\\n static const char* MetaTableName;\\n\\npublic:\\n\\n Server() : Base<IPVersion>() {}\\n\\npublic:\\n\\n auto listen(Lua::State*) noexcept -> int;\\n\\n auto accept(Lua::State*) noexcept -> int;\\n\\n};\\n\\n\\n\\ntemplate<int IPVersion>\\n\\nauto Server<IPVersion>::listen(Lua::State* L) noexcept -> int {\\n\\n int backLogSize = Lua::Aux::OptInteger(L, 2, Server<IPVersion>::DefaultBackLogSize);\\n\\n int result = ::listen(this->fd, backLogSize);\\n\\n if(result < 0) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, \\\"listen: %s\\\", std::strerror(errno));\\n\\n return 2;\\n\\n }\\n\",\n \"file_path\": \"include/SctpServerSocket.hpp\",\n \"rank\": 0,\n \"score\": 343239.04808772984\n },\n {\n \"content\": \"class Client final : public Base<IPVersion> {\\n\\npublic:\\n\\n static const char* MetaTableName;\\n\\n static const std::size_t MaxRecvBufferSize = 5000;\\n\\nprivate:\\n\\n char recvBuffer[MaxRecvBufferSize];\\n\\npublic:\\n\\n Client() : Base<IPVersion>() {}\\n\\n Client(int sock);\\n\\npublic:\\n\\n auto connect(Lua::State*) noexcept -> int;\\n\\n auto sendmsg(Lua::State*) noexcept -> int;\\n\\n auto recvmsg(Lua::State*) noexcept -> int;\\n\\n};\\n\\n\\n\\ntemplate<int IPVersion>\\n\\nClient<IPVersion>::Client(int sock) : Base<IPVersion>(sock) {}\\n\\n\\n\\ntemplate<int IPVersion>\\n\\nauto Client<IPVersion>::connect(Lua::State* L) noexcept -> int {\\n\",\n \"file_path\": \"include/SctpClientSocket.hpp\",\n \"rank\": 1,\n \"score\": 343239.04808772984\n },\n {\n \"content\": \" typename Base<IPVersion>::AddressArray peerAddresses;\\n\\n int loadAddrResult = this->loadAddresses(L, peerAddresses);\\n\\n if(loadAddrResult > 0) {\\n\\n return loadAddrResult;\\n\\n }\\n\\n\\n\\n if(::sctp_connectx(this->fd, reinterpret_cast<sockaddr*>(peerAddresses.data()), peerAddresses.size(), nullptr) < 0) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, \\\"sctp_connectx: %s\\\", std::strerror(errno));\\n\\n return 2;\\n\\n }\\n\\n\\n\\n Lua::PushBoolean(L, true);\\n\\n return 1;\\n\\n}\\n\\n\\n\\ntemplate<int IPVersion>\\n\\nauto Client<IPVersion>::sendmsg(Lua::State* L) noexcept -> int {\\n\\n std::size_t bufferLength;\\n\\n auto buffer = Lua::Aux::CheckLString(L, -1, bufferLength);\\n\",\n \"file_path\": \"include/SctpClientSocket.hpp\",\n \"rank\": 13,\n \"score\": 149133.79724916868\n },\n {\n \"content\": \"#ifndef SCTPSERVERSOCKET_HPP\\n\\n#define SCTPSERVERSOCKET_HPP\\n\\n\\n\\n#include \\\"SctpSocket.hpp\\\"\\n\\n#include \\\"SctpClientSocket.hpp\\\"\\n\\n\\n\\nnamespace Sctp {\\n\\n\\n\\nnamespace Socket {\\n\\n\\n\\ntemplate<int IPVersion>\\n\",\n \"file_path\": \"include/SctpServerSocket.hpp\",\n \"rank\": 14,\n \"score\": 149131.08434680558\n },\n {\n \"content\": \"#ifndef SCTPCLIENTSOCKET_HPP\\n\\n#define SCTPCLIENTSOCKET_HPP\\n\\n\\n\\n#include \\\"SctpSocket.hpp\\\"\\n\\n\\n\\nnamespace Sctp {\\n\\n\\n\\nnamespace Socket {\\n\\n\\n\\ntemplate<int IPVersion>\\n\",\n \"file_path\": \"include/SctpClientSocket.hpp\",\n \"rank\": 15,\n \"score\": 149130.85856605924\n },\n {\n \"content\": \" Lua::PushBoolean(L, true);\\n\\n return 1;\\n\\n}\\n\\n\\n\\ntemplate<int IPVersion>\\n\\nauto Server<IPVersion>::accept(Lua::State* L) noexcept -> int {\\n\\n int newFD = ::accept(this->fd, nullptr, nullptr);\\n\\n if(newFD < 0 and (errno == EAGAIN or errno == EWOULDBLOCK)) {\\n\\n //Non-blocking socket is being used, nothing to do\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushString(L, \\\"EAGAIN/EWOULDBLOCK\\\");\\n\\n return 2;\\n\\n } else if(newFD < 0) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, \\\"accept() failed: %s\\\", std::strerror(errno));\\n\\n return 2;\\n\\n }\\n\\n auto connSock = Lua::NewUserData<Sctp::Socket::Client<IPVersion>>(L);\\n\\n if(connSock == nullptr) {\\n\\n Lua::PushNil(L);\\n\",\n \"file_path\": \"include/SctpServerSocket.hpp\",\n \"rank\": 16,\n \"score\": 149130.20075423576\n },\n {\n \"content\": \" Lua::PushString(L, \\\"Socket userdata allocation failed\\\");\\n\\n return 2;\\n\\n }\\n\\n\\n\\n new (connSock) Sctp::Socket::Client<IPVersion>(newFD);\\n\\n\\n\\n Lua::Aux::GetMetaTable(L, Sctp::Socket::Client<IPVersion>::MetaTableName);\\n\\n Lua::SetMetaTable(L, -2);\\n\\n return 1;\\n\\n}\\n\\n\\n\\n} //namespace Socket\\n\\n\\n\\n} //namespace Sctp\\n\\n\\n\\n\\n\\n#endif /* SCTPSERVERSOCKET_HPP */\\n\\n\\n\",\n \"file_path\": \"include/SctpServerSocket.hpp\",\n \"rank\": 17,\n \"score\": 149127.49328594562\n },\n {\n \"content\": \"\\n\\n// sctp_sndrcvinfo info;\\n\\n// std::memset(&info, 0, sizeof(sctp_sndrcvinfo));\\n\\n\\n\\n //TODO: Add support for choosing at least ppid, stream number and flags\\n\\n ssize_t numBytesSent = ::sctp_sendmsg(this->fd, buffer, bufferLength, nullptr, 0, 0, 0, 0, 0, 0);\\n\\n if(numBytesSent < 0) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, (errno == EAGAIN ? \\\"EAGAIN\\\" : \\\"sctp_sendmsg: %s\\\"), std::strerror(errno));\\n\\n return 2;\\n\\n }\\n\\n Lua::PushInteger(L, numBytesSent);\\n\\n return 1;\\n\\n}\\n\\n\\n\\ntemplate<int IPVersion>\\n\\nauto Client<IPVersion>::recvmsg(Lua::State* L) noexcept -> int {\\n\\n// sctp_sndrcvinfo info;\\n\\n// std::memset(&info, 0, sizeof(sctp_sndrcvinfo));\\n\\n\\n\",\n \"file_path\": \"include/SctpClientSocket.hpp\",\n \"rank\": 18,\n \"score\": 149123.7412056626\n },\n {\n \"content\": \" //TODO: Add support for filling sctp_sndrcvinfo and flags\\n\\n std::memset(&recvBuffer, 0, sizeof(recvBuffer));\\n\\n ssize_t numBytesReceived = ::sctp_recvmsg(this->fd, recvBuffer, MaxRecvBufferSize, nullptr, nullptr, nullptr, nullptr);\\n\\n if(numBytesReceived < 0) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, (errno == EAGAIN or errno == EWOULDBLOCK ? \\\"EAGAIN/EWOULDBLOCK\\\" : \\\"sctp_recvmsg: %s\\\"), std::strerror(errno));\\n\\n return 2;\\n\\n }\\n\\n Lua::PushInteger(L, numBytesReceived);\\n\\n Lua::PushLString(L, recvBuffer, numBytesReceived);\\n\\n return 2;\\n\\n}\\n\\n\\n\\n} //namespace Socket\\n\\n\\n\\n} //namespace Sctp\\n\\n\\n\\n#endif /* SCTPCLIENTSOCKET_HPP */\\n\\n\\n\",\n \"file_path\": \"include/SctpClientSocket.hpp\",\n \"rank\": 19,\n \"score\": 149119.52590539312\n },\n {\n \"content\": \"enum class Types {\\n\\n None = LUA_TNONE,\\n\\n Nil = LUA_TNIL,\\n\\n Boolean = LUA_TBOOLEAN,\\n\\n LightUserData = LUA_TLIGHTUSERDATA,\\n\\n Number = LUA_TNUMBER,\\n\\n String = LUA_TSTRING,\\n\\n Table = LUA_TTABLE,\\n\\n Function = LUA_TFUNCTION,\\n\\n UserData = LUA_TUSERDATA,\\n\\n Thread = LUA_TTHREAD,\\n\\n NumTags = LUA_NUMTAGS\\n\\n};\\n\\n\\n\\n\\n\\ntemplate<class ConstType>\\n\\nconstexpr ConstType MinStack = ConstType(LUA_MINSTACK);\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 20,\n \"score\": 117023.18663559256\n },\n {\n \"content\": \"enum class Hooks {\\n\\n Call = LUA_HOOKCALL,\\n\\n Return = LUA_HOOKRET,\\n\\n Line = LUA_HOOKLINE,\\n\\n Count = LUA_HOOKCOUNT,\\n\\n TailCall = LUA_HOOKTAILCALL\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 21,\n \"score\": 117023.18663559256\n },\n {\n \"content\": \"enum class Statuses {\\n\\n OK = LUA_OK,\\n\\n Yield = LUA_YIELD,\\n\\n RuntimeError = LUA_ERRRUN,\\n\\n SyntaxError = LUA_ERRSYNTAX,\\n\\n MemAllocError = LUA_ERRMEM,\\n\\n GCMethaMError = LUA_ERRGCMM,\\n\\n MsgHandlerError = LUA_ERRERR,\\n\\n FileError = LUA_ERRFILE\\n\\n};\\n\\n\\n\\nusing State = detail::lua_State;\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 22,\n \"score\": 117023.18663559256\n },\n {\n \"content\": \"enum class HookMasks {\\n\\n Call = LUA_MASKCALL,\\n\\n Return = LUA_MASKRET,\\n\\n Line = LUA_MASKLINE,\\n\\n Count = LUA_MASKCOUNT\\n\\n};\\n\\n\\n\\n\\n\\nusing Debug = detail::lua_Debug;\\n\\n\\n\\nusing Hook = detail::lua_Hook;\\n\\n\\n\\n\\n\\ninline bool GetStack(State* L, int level, Debug* ar) {\\n\\n return static_cast<bool>(detail::lua_getstack(L, level, ar));\\n\\n}\\n\\ninline int GetInfo(State* L, const char* what, Debug* ar) {\\n\\n return detail::lua_getinfo(L, what, ar);\\n\\n}\\n\\ninline const char* GetLocal(State* L, const Debug* ar, int n) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 23,\n \"score\": 114945.578801029\n },\n {\n \"content\": \"//TODO::Consider later if it's possible to do this all\\n\\n//arithmetic, with operator overloading\\n\\nenum class ArithmeticOperators {\\n\\n Add = LUA_OPADD,\\n\\n Sub = LUA_OPSUB,\\n\\n Mul = LUA_OPMUL,\\n\\n Mod = LUA_OPMOD,\\n\\n Pow = LUA_OPPOW,\\n\\n FloatDiv = LUA_OPDIV,\\n\\n FloorDiv = LUA_OPIDIV,\\n\\n BitwiseAnd = LUA_OPBAND,\\n\\n BitwiseOr = LUA_OPBOR,\\n\\n BitwiseXor = LUA_OPBXOR,\\n\\n ShiftLeft = LUA_OPSHL,\\n\\n ShiftRight = LUA_OPSHR,\\n\\n UnaryNegation = LUA_OPUNM,\\n\\n BitwiseNot = LUA_OPBNOT,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 24,\n \"score\": 114945.578801029\n },\n {\n \"content\": \"enum class RelationalOperators {\\n\\n Equals = LUA_OPEQ,\\n\\n LessThan = LUA_OPLT,\\n\\n LessOrEqual = LUA_OPLE\\n\\n};\\n\\n\\n\\ninline void Arith(State* L, ArithmeticOperators op) {\\n\\n detail::lua_arith(L, static_cast<int>(op));\\n\\n}\\n\\n//TODO: should these 2 functions return bool?\\n\\ninline bool RawEqual(State* L, int idx1, int idx2) {\\n\\n return static_cast<bool>(detail::lua_rawequal(L, idx1, idx2));\\n\\n}\\n\\ninline bool Compare(State* L, int idx1, int idx2, RelationalOperators op) {\\n\\n return static_cast<bool>(detail::lua_compare(L, idx1, idx2, static_cast<int>(op)));\\n\\n}\\n\\n\\n\\n\\n\\n//TODO: check for possibility of function overloading (+type_traits)\\n\\ninline void PushNil(State* L) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 25,\n \"score\": 114945.578801029\n },\n {\n \"content\": \"enum class RidX {\\n\\n MainThread = LUA_RIDX_MAINTHREAD,\\n\\n Globals = LUA_RIDX_GLOBALS,\\n\\n Last = RidX::Globals\\n\\n};\\n\\n\\n\\nusing Number = detail::lua_Number;\\n\\nusing Integer = detail::lua_Integer;\\n\\nusing Unsigned = detail::lua_Unsigned;\\n\\nusing KContext = detail::lua_KContext;\\n\\n\\n\\nusing CFunction = detail::lua_CFunction;\\n\\nusing KFunction = detail::lua_KFunction;\\n\\nusing Reader = detail::lua_Reader;\\n\\nusing Writer = detail::lua_Writer;\\n\\nusing Alloc = detail::lua_Alloc;\\n\\n\\n\\n//auto Ident = detail::lua_ident;\\n\\n\\n\\ninline State* NewState(Alloc f, void* ud) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 26,\n \"score\": 114945.578801029\n },\n {\n \"content\": \"enum class GarbageCollectionOpts {\\n\\n Stop = LUA_GCSTOP,\\n\\n Restart = LUA_GCRESTART,\\n\\n Collect = LUA_GCCOLLECT,\\n\\n Count = LUA_GCCOUNT,\\n\\n CountB = LUA_GCCOUNTB,\\n\\n Step = LUA_GCSTEP,\\n\\n SetPause = LUA_GCSETPAUSE,\\n\\n SetStupMul = LUA_GCSETSTEPMUL,\\n\\n IsRunning = LUA_GCISRUNNING\\n\\n};\\n\\n\\n\\ninline int GC(State* L, GarbageCollectionOpts what, int data) {\\n\\n return detail::lua_gc(L, static_cast<int>(what), data);\\n\\n}\\n\\n\\n\\n\\n\\ninline int Error(State* L) {\\n\\n return detail::lua_error(L);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 27,\n \"score\": 112954.91953362757\n },\n {\n \"content\": \"LUALIB_API void luaL_pushresult (luaL_Buffer *B) {\\n\\n lua_State *L = B->L;\\n\\n lua_pushlstring(L, B->b, B->n);\\n\\n if (buffonstack(B)) {\\n\\n resizebox(L, -2, 0); /* delete old buffer */\\n\\n lua_remove(L, -2); /* remove its header from the stack */\\n\\n }\\n\",\n \"file_path\": \"subprojects/lua/src/lauxlib.c\",\n \"rank\": 28,\n \"score\": 87725.50148733547\n },\n {\n \"content\": \" lu_byte idx; /* index of upvalue (in stack or in outer function's list) */\\n\",\n \"file_path\": \"subprojects/lua/src/lobject.h\",\n \"rank\": 29,\n \"score\": 80840.32941658188\n },\n {\n \"content\": \" short idx; /* variable index in stack */\\n\",\n \"file_path\": \"subprojects/lua/src/lparser.h\",\n \"rank\": 30,\n \"score\": 80840.32941658188\n },\n {\n \"content\": \" StkId base; /* base for this function */\\n\",\n \"file_path\": \"subprojects/lua/src/lstate.h\",\n \"rank\": 31,\n \"score\": 80823.32422003653\n },\n {\n \"content\": \" struct lua_State *L;\\n\",\n \"file_path\": \"subprojects/lua/src/llex.h\",\n \"rank\": 32,\n \"score\": 80633.44798611967\n },\n {\n \"content\": \" lua_State *L;\\n\",\n \"file_path\": \"subprojects/lua/src/lauxlib.h\",\n \"rank\": 33,\n \"score\": 80633.44798611967\n },\n {\n \"content\": \" lua_State *L;\\n\",\n \"file_path\": \"subprojects/lua/src/ldump.c\",\n \"rank\": 34,\n \"score\": 80633.44798611967\n },\n {\n \"content\": \" lua_State *L;\\n\",\n \"file_path\": \"subprojects/lua/src/lundump.c\",\n \"rank\": 35,\n \"score\": 80633.44798611967\n },\n {\n \"content\": \" lua_State *L;\\n\",\n \"file_path\": \"subprojects/lua/src/lstrlib.c\",\n \"rank\": 36,\n \"score\": 80633.44798611967\n },\n {\n \"content\": \" lua_State *L;\\t\\t\\t/* Lua state (for reader) */\\n\",\n \"file_path\": \"subprojects/lua/src/lzio.h\",\n \"rank\": 37,\n \"score\": 80633.44798611967\n },\n {\n \"content\": \"LUALIB_API int (luaL_getsubtable) (lua_State *L, int idx, const char *fname);\\n\",\n \"file_path\": \"subprojects/lua/src/lauxlib.h\",\n \"rank\": 38,\n \"score\": 80453.84854638053\n },\n {\n \"content\": \"LUAMOD_API int (luaopen_debug) (lua_State *L);\\n\",\n \"file_path\": \"subprojects/lua/src/lualib.h\",\n \"rank\": 39,\n \"score\": 80453.84854638053\n },\n {\n \"content\": \"LUA_API int (lua_gethookcount) (lua_State *L);\\n\",\n \"file_path\": \"subprojects/lua/src/lua.h\",\n \"rank\": 40,\n \"score\": 80453.84854638053\n },\n {\n \"content\": \" return 2;\\n\\n }\\n\\n new (sock) SocketType();\\n\\n if (not sock->create()) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, \\\"socket(): %s\\\", std::strerror(errno));\\n\\n return 2;\\n\\n }\\n\\n\\n\\n Lua::Aux::GetMetaTable(L, SocketType::MetaTableName);\\n\\n Lua::SetMetaTable(L, -2);\\n\\n return 1;\\n\\n}\\n\\n\\n\\ntemplate<int IPVersion, template<int> class SocketType = Sctp::Socket::Base>\\n\\nusing MemberFuncType = int (SocketType<IPVersion>::*)(Lua::State*);\\n\\n\\n\\ntemplate<int IPVersion, template<int> class SocketType, MemberFuncType<IPVersion, SocketType> fn>\\n\\nauto CallMemberFunction(Lua::State* L) -> int {\\n\\n static_assert(Sctp::IsSctpSocket<SocketType<IPVersion>>::value, \\\"\\\");\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 41,\n \"score\": 25.51902882688075\n },\n {\n \"content\": \"\\n\\n} //namespace Sctp\\n\\n\\n\\nnamespace {\\n\\n\\n\\ntemplate<class SocketType>\\n\\nauto UserDataToSocket(Lua::State* L, int idx) -> SocketType* {\\n\\n static_assert(Sctp::IsSctpSocket<SocketType>::value, \\\"\\\");\\n\\n\\n\\n return Lua::Aux::TestUData<SocketType>(L, idx, SocketType::MetaTableName);\\n\\n}\\n\\n\\n\\ntemplate<class SocketType>\\n\\nauto New(Lua::State* L) -> int {\\n\\n static_assert(Sctp::IsSctpSocket<SocketType>::value, \\\"\\\");\\n\\n\\n\\n auto sock = Lua::NewUserData<SocketType>(L);\\n\\n if(sock == nullptr) {\\n\\n Lua::PushNil(L);\\n\\n Lua::PushString(L, \\\"Socket userdata allocation failed\\\");\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 42,\n \"score\": 25.499793753932018\n },\n {\n \"content\": \"sctp = {\\n\\n --[[\\n\\n returns a userdata (Sctp::Socket)\\n\\n ]]\\n\\n socket(),\\n\\n \\n\\n --[[\\n\\n Calls bind() and sctp_bindx() internally. No IP version mixing\\n\\n sock: contains the address family.\\n\\n port: every given address will use this port number\\n\\n addr1: at least 1 address is mandatory\\n\\n ...: no limit for multihoming\\n\\n ]]\\n\\n bind(sock, port, addr1, ...),\\n\\n listen(),\\n\\n accept(),\\n\\n \\n\\n --[[\\n\\n Should it be connect or connectx?\\n\\n ]]\\n\",\n \"file_path\": \"plan.lua\",\n \"rank\": 43,\n \"score\": 24.78407578231151\n },\n {\n \"content\": \" auto basePtr = static_cast<Sctp::Socket::Base<IPVersion>*>(sock);\\n\\n return (basePtr->*fn)(L);\\n\\n}\\n\\n\\n\\ntemplate<class SocketType>\\n\\nauto DestroySocket(Lua::State* L) noexcept -> int {\\n\\n static_assert(Sctp::IsSctpSocket<SocketType>::value, \\\"\\\");\\n\\n\\n\\n auto sock = UserDataToSocket<SocketType>(L, 1);\\n\\n sock->SocketType::~SocketType();\\n\\n return 0;\\n\\n}\\n\\n\\n\\n//I haven't found a way yet to keep array of structures in the format below\\n\\n//So for now, clang-format is off-limits\\n\\n// clang-format off\\n\\nconst Lua::Aux::Reg ServerSocketMetaTable4[] = {\\n\\n { \\\"bind\\\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::bind> },\\n\\n { \\\"close\\\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::close> },\\n\\n { \\\"listen\\\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::listen> },\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 44,\n \"score\": 24.241510993377187\n },\n {\n \"content\": \"\\n\\n auto sock = UserDataToSocket<SocketType<IPVersion>>(L, 1);\\n\\n if (sock == nullptr) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, \\\"Can\\\\'t call function, pointer is nil.\\\");\\n\\n return 2;\\n\\n }\\n\\n return (sock->*fn)(L);\\n\\n}\\n\\n\\n\\ntemplate<int IPVersion, template<int> class SocketType, MemberFuncType<IPVersion> fn>\\n\\nauto CallMemberFunction(Lua::State* L) -> int {\\n\\n static_assert(Sctp::IsSctpSocket<SocketType<IPVersion>>::value, \\\"\\\");\\n\\n\\n\\n auto sock = UserDataToSocket<SocketType<IPVersion>>(L, 1);\\n\\n if (sock == nullptr) {\\n\\n Lua::PushBoolean(L, false);\\n\\n Lua::PushFString(L, \\\"Can\\\\'t call function, pointer is nil.\\\");\\n\\n return 2;\\n\\n }\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 45,\n \"score\": 23.277176002609387\n },\n {\n \"content\": \"#include <type_traits>\\n\\n\\n\\n#include \\\"Lua/Lua.hpp\\\"\\n\\n#include \\\"SctpSocket.hpp\\\"\\n\\n#include \\\"SctpServerSocket.hpp\\\"\\n\\n#include \\\"SctpClientSocket.hpp\\\"\\n\\n\\n\\nnamespace Sctp {\\n\\n\\n\\nnamespace Socket {\\n\\n\\n\\ntemplate<> const char* Server<4>::MetaTableName = \\\"ServerSocketMeta4\\\";\\n\\n\\n\\ntemplate<> const char* Server<6>::MetaTableName = \\\"ServerSocketMeta6\\\";\\n\\n\\n\\ntemplate<> const char* Client<4>::MetaTableName = \\\"ClientSocketMeta4\\\";\\n\\n\\n\\ntemplate<> const char* Client<6>::MetaTableName = \\\"ClientSocketMeta6\\\";\\n\\n\\n\\n} //namespace Socket\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 46,\n \"score\": 21.07689011714052\n },\n {\n \"content\": \"inline void XMove(State* from, State* to, int n) {\\n\\n detail::lua_xmove(from, to, n);\\n\\n}\\n\\n\\n\\n\\n\\ninline bool IsString(State* L, int idx) {\\n\\n return static_cast<bool>(detail::lua_isstring(L, idx));\\n\\n}\\n\\ninline bool IsCFunction(State* L, int idx) {\\n\\n return static_cast<bool>(detail::lua_iscfunction(L, idx));\\n\\n}\\n\\ninline bool IsInteger(State* L, int idx) {\\n\\n return static_cast<bool>(detail::lua_isinteger(L, idx));\\n\\n}\\n\\ninline bool IsUserData(State* L, int idx) {\\n\\n return static_cast<bool>(detail::lua_isuserdata(L, idx));\\n\\n}\\n\\ninline Types Type(State* L, int idx) {\\n\\n return static_cast<Types>(detail::lua_type(L, idx));\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 47,\n \"score\": 19.051388971640893\n },\n {\n \"content\": \"}\\n\\ninline bool IsNone(State* L, int idx) {\\n\\n return Type(L, idx) == Types::None;\\n\\n}\\n\\ninline bool IsNoneOrNil(State* L, int idx) {\\n\\n return static_cast<int>(Type(L, idx)) <= 0;\\n\\n}\\n\\ninline const char* PushLiteral(State* L, const char* s) {\\n\\n return PushString(L, s);\\n\\n}\\n\\n//TODO: Check RawGet's input params and convert macro to const\\n\\ninline void PushGlobalTable(State* L) {\\n\\n RawGet(L, RegistryIndex, static_cast<int>(RidX::Globals));\\n\\n}\\n\\ninline const char* ToString(State* L, int idx) {\\n\\n return ToLString(L, idx, nullptr);\\n\\n}\\n\\ninline void Insert(State* L, int idx) {\\n\\n Rotate(L, idx, 1);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 48,\n \"score\": 18.192991345873924\n },\n {\n \"content\": \"inline const char* GSub(State* L, const char* s, const char* p, const char* r) {\\n\\n return detail::luaL_gsub(L, s, p, r);\\n\\n}\\n\\ninline void SetFuncs(State* L, const Reg* l, int nup) {\\n\\n detail::luaL_setfuncs(L, l, nup);\\n\\n}\\n\\ninline bool GetSubTable(State* L, int idx, const char* fname) {\\n\\n return static_cast<bool>(detail::luaL_getsubtable(L, idx, fname));\\n\\n}\\n\\ninline void TraceBack(State* L, State* L1, const char* msg, int level) {\\n\\n detail::luaL_traceback(L, L1, msg, level);\\n\\n}\\n\\ninline void RequiRef(State* L, const char* modname, CFunction openf, bool glb) {\\n\\n detail::luaL_requiref(L, modname, openf, static_cast<int>(glb));\\n\\n}\\n\\n\\n\\ntemplate<size_t N>\\n\\ninline void NewLibTable(State* L, const Reg (&l)[N]) {\\n\\n CreateTable(L, 0, sizeof(l)/sizeof(l[0]) - 1);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 49,\n \"score\": 17.14468228704644\n },\n {\n \"content\": \"inline const char* TypeName(State* L, Types tp) {\\n\\n return detail::lua_typename(L, static_cast<int>(tp));\\n\\n}\\n\\ninline Number ToNumberX(State* L, int idx, int* isNum) {\\n\\n return detail::lua_tonumberx(L, idx, isNum);\\n\\n}\\n\\ninline Integer ToIntegerX(State* L, int idx, int* isNum) {\\n\\n return detail::lua_tointegerx(L, idx, isNum);\\n\\n}\\n\\ninline bool ToBoolean(State* L, int idx) {\\n\\n return static_cast<bool>(detail::lua_toboolean(L, idx));\\n\\n}\\n\\ninline const char* ToLString(State* L, int idx, std::size_t* len) {\\n\\n return detail::lua_tolstring(L, idx, len);\\n\\n}\\n\\ninline std::size_t RawLen(State* L, int idx) {\\n\\n return detail::lua_rawlen(L, idx);\\n\\n}\\n\\ninline CFunction ToCFunction(State* L, int idx) {\\n\\n return detail::lua_tocfunction(L, idx);\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 50,\n \"score\": 17.119412881810902\n },\n {\n \"content\": \" return static_cast<Types>(detail::lua_gettable(L, idx));\\n\\n}\\n\\ninline Types GetField(State* L, int idx, const char* k) {\\n\\n return static_cast<Types>(detail::lua_getfield(L, idx, k));\\n\\n}\\n\\ninline Types Geti(State* L, int idx, Integer n) {\\n\\n return static_cast<Types>(detail::lua_geti(L, idx, n));\\n\\n}\\n\\ninline Types RawGet(State* L, int idx) {\\n\\n return static_cast<Types>(detail::lua_rawget(L, idx));\\n\\n}\\n\\ninline Types RawGet(State* L, int idx, Integer n) {\\n\\n return static_cast<Types>(detail::lua_rawgeti(L, idx, n));\\n\\n}\\n\\ninline Types RawGet(State* L, int idx, const void* p) {\\n\\n return static_cast<Types>(detail::lua_rawgetp(L, idx, p));\\n\\n}\\n\\ninline void CreateTable(State* L, int narr, int nrec) {\\n\\n detail::lua_createtable(L, narr, nrec);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 51,\n \"score\": 16.717529067209448\n },\n {\n \"content\": \" PushCFunction(L, fn);\\n\\n SetGlobal(L, name);\\n\\n}\\n\\ninline bool IsFunction(State* L, int idx) {\\n\\n return Type(L, idx) == Types::Function;\\n\\n}\\n\\ninline bool IsTable(State* L, int idx) {\\n\\n return Type(L, idx) == Types::Table;\\n\\n}\\n\\ninline bool IsLightUserData(State* L, int idx) {\\n\\n return Type(L, idx) == Types::LightUserData;\\n\\n}\\n\\ninline bool IsNil(State* L, int idx) {\\n\\n return Type(L, idx) == Types::Nil;\\n\\n}\\n\\ninline bool IsBoolean(State* L, int idx) {\\n\\n return Type(L, idx) == Types::Boolean;\\n\\n}\\n\\ninline bool IsThread(State* L, int idx) {\\n\\n return Type(L, idx) == Types::Thread;\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 52,\n \"score\": 16.342414826675643\n },\n {\n \"content\": \" return detail::lua_absindex(L, idx);\\n\\n}\\n\\ninline int GetTop(State* L) {\\n\\n return detail::lua_gettop(L);\\n\\n}\\n\\ninline void SetTop(State* L, int idx) {\\n\\n detail::lua_settop(L, idx);\\n\\n}\\n\\ninline void PushValue(State* L, int idx) {\\n\\n detail::lua_pushvalue(L, idx);\\n\\n}\\n\\ninline void Rotate(State* L, int idx, int n) {\\n\\n detail::lua_rotate(L, idx, n);\\n\\n}\\n\\ninline void Copy(State* L, int fromIdx, int toIdx) {\\n\\n detail::lua_copy(L, fromIdx, toIdx);\\n\\n}\\n\\ninline bool CheckStack(State* L, int n) {\\n\\n return static_cast<bool>(detail::lua_checkstack(L, n));\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 53,\n \"score\": 16.026457083100613\n },\n {\n \"content\": \"template<class Type>\\n\\ninline Type* NewUserData(State* L) {\\n\\n return static_cast<Type*>(detail::lua_newuserdata(L, sizeof(Type)));\\n\\n}\\n\\ninline Types GetMetaTable(State* L, int objindex) {\\n\\n return static_cast<Types>(detail::lua_getmetatable(L, objindex));\\n\\n}\\n\\ninline Types GetUserValue(State* L, int idx) {\\n\\n return static_cast<Types>(detail::lua_getuservalue(L, idx));\\n\\n}\\n\\n\\n\\ninline void SetGlobal(State* L, const char* name) {\\n\\n detail::lua_setglobal(L, name);\\n\\n}\\n\\ninline void SetTable(State* L, int idx) {\\n\\n detail::lua_settable(L, idx);\\n\\n}\\n\\ninline void SetField(State* L, int idx, const char* k) {\\n\\n detail::lua_setfield(L, idx, k);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 54,\n \"score\": 15.49242232440698\n },\n {\n \"content\": \"}\\n\\ninline int ExecResult(State* L, int stat) {\\n\\n return detail::luaL_execresult(L, stat);\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\nconstexpr auto Noref = LUA_NOREF;\\n\\nconstexpr auto Refnil = LUA_REFNIL;\\n\\n\\n\\ninline int Ref(State* L, int t) {\\n\\n return detail::luaL_ref(L, t);\\n\\n}\\n\\ninline void UnRef(State* L, int t, int ref) {\\n\\n return detail::luaL_unref(L, t, ref);\\n\\n}\\n\\ntemplate<size_t N>\\n\\ninline Statuses LoadFileX(State* L, const char* filename, const char (&mode)[N]) {\\n\\n static_assert(::detail::LoadModeChecker(mode), R\\\"(Load mode can only be \\\"b\\\", \\\"t\\\", \\\"bt\\\" or null pointer)\\\");\\n\\n return static_cast<Statuses>(detail::luaL_loadfilex(L, filename, mode));\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 55,\n \"score\": 15.18046820434199\n },\n {\n \"content\": \"inline Type* TestUData(State* L, int ud, const char* tname) {\\n\\n return static_cast<Type*>(detail::luaL_testudata(L, ud, tname));\\n\\n}\\n\\ntemplate<class Type>\\n\\ninline Type* CheckUData(State* L, int ud, const char* tname) {\\n\\n return static_cast<Type*>(detail::luaL_checkudata(L, ud, tname));\\n\\n}\\n\\ninline void Where(State* L, int lvl) {\\n\\n detail::luaL_where(L, lvl);\\n\\n}\\n\\ntemplate<class ...VarArgs>\\n\\ninline int Error(State* L, const char* fmt, VarArgs&&... args) {\\n\\n return detail::luaL_error(L, fmt, args...);\\n\\n}\\n\\ntemplate<size_t N>\\n\\ninline int CheckOption(State* L, int arg, const char* def, const char* const (&lst)[N]) {\\n\\n return detail::luaL_checkoption(L, arg, def, lst);\\n\\n}\\n\\ninline int FileTesult(State* L, int stat, const char* fname) {\\n\\n return detail::luaL_fileresult(L, stat, fname);\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 56,\n \"score\": 14.688046827984765\n },\n {\n \"content\": \"\\n\\nusing Reg = detail::luaL_Reg;\\n\\n\\n\\nconstexpr auto NumSizes = (sizeof(Integer) * 16) + sizeof(Number);\\n\\n\\n\\ninline void CheckVersion(State* L, Number ver, size_t sz) {\\n\\n detail::luaL_checkversion_(L, ver, sz);\\n\\n}\\n\\ninline void CheckVersion(State* L) {\\n\\n CheckVersion(L, VersionNumber, NumSizes);\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\ninline Types GetMetaField(State* L, int obj, const char* e) {\\n\\n return static_cast<Types>(detail::luaL_getmetafield(L, obj, e));\\n\\n}\\n\\ninline bool CallMeta(State* L, int obj, const char* e) {\\n\\n return static_cast<bool>(detail::luaL_callmeta(L, obj, e));\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 57,\n \"score\": 14.265906050961044\n },\n {\n \"content\": \"inline Hook GetHook(State* L) {\\n\\n return detail::lua_gethook(L);\\n\\n}\\n\\ninline HookMasks GetHookMask(State* L) {\\n\\n return static_cast<HookMasks>(detail::lua_gethookmask(L));\\n\\n}\\n\\ninline int GetHookCount(State* L) {\\n\\n return detail::lua_gethookcount(L);\\n\\n}\\n\\n\\n\\n\\n\\n//TODO: What should be done about lualib.h?\\n\\nnamespace Lib {\\n\\n\\n\\nnamespace Open {\\n\\n\\n\\ninline int Base(State* L) {\\n\\n return detail::luaopen_base(L);\\n\\n}\\n\\ninline int Coroutine(State* L) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 58,\n \"score\": 13.598832587130484\n },\n {\n \"content\": \" return ::Lua::TypeName(L, Type(L, index));\\n\\n}\\n\\n\\n\\ninline bool DoFile(State* L, const char* filename) {\\n\\n return LoadFile(L, filename) == Statuses::OK ? (PCall(L, 0, MultiReturn, 0) == Statuses::OK ? false : true) : true;\\n\\n}\\n\\n\\n\\ninline bool DoString(State* L, const char* str) {\\n\\n return LoadString(L, str) == Statuses::OK ? (PCall(L, 0, MultiReturn, 0) == Statuses::OK ? false : true) : true;\\n\\n}\\n\\n\\n\\ninline Types GetMetaTable(State* L, const char* tname) {\\n\\n return GetField(L, RegistryIndex, tname);\\n\\n}\\n\\n\\n\\n//TODO: Don't miss this\\n\\n#define luaL_opt(L,f,n,d) (lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))\\n\\n\\n\\ninline Statuses LoadBuffer(State* L, const char* buff, size_t sz, const char* name) {\\n\\n return LoadBufferX(L, buff, sz, name, nullptr);\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 59,\n \"score\": 13.478691705172412\n },\n {\n \"content\": \" return detail::lua_newstate(f, ud);\\n\\n}\\n\\ninline void Close(State* L) {\\n\\n detail::lua_close(L);\\n\\n}\\n\\ninline State* NewThread(State* L) {\\n\\n return detail::lua_newthread(L);\\n\\n}\\n\\ninline CFunction AtPanic(State* L, CFunction panicf) {\\n\\n return detail::lua_atpanic(L, panicf);\\n\\n}\\n\\ninline const Number* Version(State* L) {\\n\\n return detail::lua_version(L);\\n\\n}\\n\\ninline bool IsNumber(State* L, int idx) {\\n\\n return static_cast<bool>(detail::lua_isnumber(L, idx));\\n\\n}\\n\\n\\n\\n\\n\\ninline int AbsIndex(State* L, int idx) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 60,\n \"score\": 13.368108187316427\n },\n {\n \"content\": \"inline void* GetExtraSpace(State* L) {\\n\\n return lua_getextraspace(L);\\n\\n}\\n\\ninline Number ToNumber(State* L, int idx){\\n\\n return ToNumberX(L, idx, nullptr);\\n\\n}\\n\\ninline Integer ToInteger(State* L,int idx) {\\n\\n return ToIntegerX(L, idx, nullptr);\\n\\n}\\n\\ninline void Pop(State* L, int idx) {\\n\\n SetTop(L, -idx-1);\\n\\n}\\n\\ninline void Newtable(State* L) {\\n\\n CreateTable(L, 0, 0);\\n\\n}\\n\\ninline void PushCFunction(State* L, CFunction fn) {\\n\\n PushCClosure(L, fn, 0);\\n\\n}\\n\\n\\n\\ninline void Register(State* L, const char* name, CFunction fn) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 61,\n \"score\": 13.352878787140988\n },\n {\n \"content\": \"template<size_t N>\\n\\ninline void NewLib(State* L, const Reg (&l)[N]) {\\n\\n CheckVersion(L);\\n\\n NewLibTable(L, l);\\n\\n SetFuncs(L, l, 0);\\n\\n}\\n\\n\\n\\ninline void ArgCheck(State* L, bool cond, int arg, const char *extramsg) {\\n\\n if(not cond) {\\n\\n ArgError(L, arg, extramsg);\\n\\n }\\n\\n}\\n\\ninline const char* CheckString(State* L, int arg) {\\n\\n return detail::luaL_checklstring(L, arg, nullptr);\\n\\n}\\n\\ninline const char* OptString(State* L, int arg, const char* d) {\\n\\n return detail::luaL_optlstring(L, arg, d, nullptr);\\n\\n}\\n\\n\\n\\ninline const char* TypeName(State* L, int index) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 62,\n \"score\": 13.277981043945267\n },\n {\n \"content\": \"}\\n\\ninline Statuses LoadFileX(State* L, const char* filename, const char* mode) {\\n\\n return static_cast<Statuses>(detail::luaL_loadfilex(L, filename, mode));\\n\\n}\\n\\ninline Statuses LoadFile(State* L, const char* filename) {\\n\\n return static_cast<Statuses>(LoadFileX(L, filename, nullptr));\\n\\n}\\n\\n\\n\\ninline Statuses LoadBufferX(State* L, const char* buff, size_t sz, const char* name, const char* mode) {\\n\\n return static_cast<Statuses>(detail::luaL_loadbufferx(L, buff, sz, name, mode));\\n\\n}\\n\\ninline Statuses LoadString(State* L, const char* s) {\\n\\n return static_cast<Statuses>(detail::luaL_loadstring(L, s));\\n\\n}\\n\\ninline State* NewState() {\\n\\n return detail::luaL_newstate();\\n\\n}\\n\\ninline Integer Len(State* L, int idx) {\\n\\n return detail::luaL_len(L, idx);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 63,\n \"score\": 13.19255727104671\n },\n {\n \"content\": \"inline void Remove(State* L, int idx) {\\n\\n Rotate(L, idx, (-1));\\n\\n Pop(L, 1);\\n\\n}\\n\\ninline void Replace(State* L, int idx) {\\n\\n Copy(L, -1, idx);\\n\\n Pop(L, 1);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 64,\n \"score\": 13.189570501045935\n },\n {\n \"content\": \"\\n\\ninline Statuses Load(State* L, Reader reader, void* dt, const char* chunkname, const char* mode) {\\n\\n return static_cast<Statuses>(detail::lua_load(L, reader, dt, chunkname, mode));\\n\\n}\\n\\ninline int Dump(State* L, Writer writer, void* data, int strip) {\\n\\n return detail::lua_dump(L, writer, data, strip);\\n\\n}\\n\\n\\n\\n\\n\\ninline int YieldK(State* L, int nresults, KContext ctx, KFunction k) {\\n\\n return detail::lua_yieldk(L, nresults, ctx, k);\\n\\n}\\n\\ninline Statuses Resume(State* L, State* from, int narg) {\\n\\n return static_cast<Statuses>(detail::lua_resume(L, from, narg));\\n\\n}\\n\\ninline Statuses Status(State* L) {\\n\\n return static_cast<Statuses>(detail::lua_status(L));\\n\\n}\\n\\ninline bool IsYieldable(State* L) {\\n\\n return static_cast<bool>(detail::lua_isyieldable(L));\\n\\n}\\n\\ninline int Yield(State* L,int nresults) {\\n\\n return YieldK(L, nresults, 0, nullptr);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 65,\n \"score\": 13.040231040458186\n },\n {\n \"content\": \"inline const char* ToLString(State* L, int idx, size_t& len) {\\n\\n return detail::luaL_tolstring(L, idx, &len);\\n\\n}\\n\\ninline int ArgError(State* L, int arg, const char* extramsg) {\\n\\n return detail::luaL_argerror(L, arg, extramsg);\\n\\n}\\n\\ninline const char* CheckLString(State* L, int arg, size_t& l) {\\n\\n return detail::luaL_checklstring(L, arg, &l);\\n\\n}\\n\\ninline const char* OptLString(State* L, int arg, const char* def, size_t& l) {\\n\\n return detail::luaL_optlstring(L, arg, def, &l);\\n\\n}\\n\\ninline Number CheckNumber(State* L, int arg) {\\n\\n return detail::luaL_checknumber(L, arg);\\n\\n}\\n\\ninline Number OptNumber(State* L, int arg, Number def) {\\n\\n return detail::luaL_optnumber(L, arg, def);\\n\\n}\\n\\ninline Integer CheckInteger(State* L, int arg) {\\n\\n return detail::luaL_checkinteger(L, arg);\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 66,\n \"score\": 12.943742915153086\n },\n {\n \"content\": \"}\\n\\ninline void* ToUserData(State* L, int idx) {\\n\\n return detail::lua_touserdata(L, idx);\\n\\n}\\n\\ninline State* ToThread(State* L, int idx) {\\n\\n return detail::lua_tothread(L, idx);\\n\\n}\\n\\ninline const void* ToPointer(State* L, int idx) {\\n\\n return detail::lua_topointer(L, idx);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 67,\n \"score\": 12.850118281241182\n },\n {\n \"content\": \"}\\n\\ninline void PushCClosure(State* L, CFunction fn, int n) {\\n\\n detail::lua_pushcclosure(L, fn, n);\\n\\n}\\n\\ninline void PushBoolean(State* L, bool b) {\\n\\n detail::lua_pushboolean(L, static_cast<int>(b));\\n\\n}\\n\\ninline void PushLightUserData(State* L, void* p) {\\n\\n detail::lua_pushlightuserdata(L, p);\\n\\n}\\n\\ninline int PushThread(State* L) {\\n\\n return detail::lua_pushthread(L);\\n\\n}\\n\\n\\n\\n\\n\\n//TODO: function overloading\\n\\ninline Types GetGlobal(State* L, const char* name) {\\n\\n return static_cast<Types>(detail::lua_getglobal(L, name));\\n\\n}\\n\\ninline Types GetTable(State* L, int idx) {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 68,\n \"score\": 12.77856624729492\n },\n {\n \"content\": \"inline void Seti(State* L, int idx, Integer n) {\\n\\n detail::lua_seti(L, idx, n);\\n\\n}\\n\\ninline void RawSet(State* L, int idx) {\\n\\n detail::lua_rawset(L, idx);\\n\\n}\\n\\ninline void RawSet(State* L, int idx, Integer n) {\\n\\n detail::lua_rawseti(L, idx, n);\\n\\n}\\n\\ninline void RawSet(State* L, int idx, const void* p) {\\n\\n detail::lua_rawsetp(L, idx, p);\\n\\n}\\n\\ninline int SetMetaTable(State* L, int objindex) {\\n\\n return detail::lua_setmetatable(L, objindex);\\n\\n}\\n\\ninline void SetUserValue(State* L, int idx) {\\n\\n detail::lua_setuservalue(L, idx);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 69,\n \"score\": 12.69964356390427\n },\n {\n \"content\": \"inline int Next(State* L, int idx) {\\n\\n return detail::lua_next(L, idx);\\n\\n}\\n\\ninline void Concat(State* L, int n) {\\n\\n detail::lua_concat(L, n);\\n\\n}\\n\\ninline void Len(State* L, int idx) {\\n\\n detail::lua_len(L, idx);\\n\\n}\\n\\ninline std::size_t StringToNumber(State* L, const char* s) {\\n\\n return detail::lua_stringtonumber(L, s);\\n\\n}\\n\\ninline Alloc GetAllocF(State* L, void** ud) {\\n\\n return detail::lua_getallocf(L, ud);\\n\\n}\\n\\ninline void SetAllocF(State* L, Alloc f, void* ud) {\\n\\n detail::lua_setallocf(L, f, ud);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 70,\n \"score\": 11.88652076210818\n },\n {\n \"content\": \"constexpr auto Release = LUA_RELEASE;\\n\\nconstexpr auto CopyRight = LUA_COPYRIGHT;\\n\\nconstexpr auto Authors = LUA_AUTHORS;\\n\\n\\n\\nconstexpr auto Signature = LUA_SIGNATURE;\\n\\nconstexpr auto MultiReturn = LUA_MULTRET;\\n\\nconstexpr auto RegistryIndex = LUA_REGISTRYINDEX;\\n\\n\\n\\ntemplate<class IdxType>\\n\\nconstexpr auto UpvalueIndex(const IdxType i) -> decltype(lua_upvalueindex(-1)) {\\n\\n static_assert(std::is_arithmetic<IdxType>::value, \\\"\\\");\\n\\n return RegistryIndex - i;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 71,\n \"score\": 11.883256550546049\n },\n {\n \"content\": \" { \\\"accept\\\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::accept> },\\n\\n { \\\"setnonblocking\\\", CallMemberFunction<4, Sctp::Socket::Server, &Sctp::Socket::Server<4>::setNonBlocking> },\\n\\n { \\\"__gc\\\", DestroySocket<Sctp::Socket::Server<4>> },\\n\\n { nullptr, nullptr }\\n\\n};\\n\\n\\n\\nconst Lua::Aux::Reg ServerSocketMetaTable6[] = {\\n\\n { \\\"bind\\\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::bind> },\\n\\n { \\\"close\\\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::close> },\\n\\n { \\\"listen\\\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::listen> },\\n\\n { \\\"accept\\\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::accept> },\\n\\n { \\\"setnonblocking\\\", CallMemberFunction<6, Sctp::Socket::Server, &Sctp::Socket::Server<6>::setNonBlocking> },\\n\\n { \\\"__gc\\\", DestroySocket<Sctp::Socket::Server<6>> },\\n\\n { nullptr, nullptr }\\n\\n};\\n\\n\\n\\nconst Lua::Aux::Reg ClientSocketMetaTable4[] = {\\n\\n { \\\"bind\\\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::bind> },\\n\\n { \\\"connect\\\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::connect> },\\n\\n { \\\"send\\\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::sendmsg> },\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 72,\n \"score\": 11.692924077176585\n },\n {\n \"content\": \" { \\\"recv\\\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::recvmsg> },\\n\\n { \\\"close\\\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::close> },\\n\\n { \\\"setnonblocking\\\", CallMemberFunction<4, Sctp::Socket::Client, &Sctp::Socket::Client<4>::setNonBlocking> },\\n\\n { \\\"__gc\\\", DestroySocket<Sctp::Socket::Client<4>> },\\n\\n { nullptr, nullptr }\\n\\n};\\n\\n\\n\\nconst Lua::Aux::Reg ClientSocketMetaTable6[] = {\\n\\n { \\\"bind\\\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::bind> },\\n\\n { \\\"connect\\\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::connect> },\\n\\n { \\\"send\\\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::sendmsg> },\\n\\n { \\\"recv\\\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::recvmsg> },\\n\\n { \\\"close\\\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::close> },\\n\\n { \\\"setnonblocking\\\", CallMemberFunction<6, Sctp::Socket::Client, &Sctp::Socket::Client<6>::setNonBlocking> },\\n\\n { \\\"__gc\\\", DestroySocket<Sctp::Socket::Client<6>> },\\n\\n { nullptr, nullptr }\\n\\n};\\n\\n// clang-format on\\n\\n\\n\\n} //anonymous namespace\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 73,\n \"score\": 11.670484716151195\n },\n {\n \"content\": \"}\\n\\ninline Integer OptInteger(State* L, int arg, Integer def) {\\n\\n return detail::luaL_optinteger(L, arg, def);\\n\\n}\\n\\ninline void CheckStack(State* L, int sz, const char* msg) {\\n\\n detail::luaL_checkstack(L, sz, msg);\\n\\n}\\n\\ninline void CheckType(State* L, int arg, int t) {\\n\\n detail::luaL_checktype(L, arg, t);\\n\\n}\\n\\ninline void CheckAny(State* L, int arg) {\\n\\n detail::luaL_checkany(L, arg);\\n\\n}\\n\\ninline int NewMetaTable(State* L, const char* tname) {\\n\\n return detail::luaL_newmetatable(L, tname);\\n\\n}\\n\\ninline void SetMetaTable(State* L, const char* tname) {\\n\\n detail::luaL_setmetatable(L, tname);\\n\\n}\\n\\ntemplate<class Type>\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 74,\n \"score\": 11.568357447931916\n },\n {\n \"content\": \"\\n\\ninline void CallK(State* L, int nargs, int nresults, KContext ctx, KFunction k) {\\n\\n detail::lua_callk(L, nargs, nresults, ctx, k);\\n\\n}\\n\\ninline void Call(State* L, int nargs, int nresults) {\\n\\n CallK(L, nargs, nresults, 0, nullptr);\\n\\n}\\n\\n\\n\\ninline Statuses PCallK(State* L, int nargs, int nresults, int errfunc, KContext ctx, KFunction k) {\\n\\n return static_cast <Statuses>(detail::lua_pcallk(L, nargs, nresults, errfunc, ctx, k));\\n\\n}\\n\\ninline Statuses PCall(State* L,int nargs, int nresults, int errfunc) {\\n\\n return static_cast<Statuses>(PCallK(L, nargs, nresults, errfunc, 0, nullptr));\\n\\n}\\n\\n\\n\\ntemplate<size_t N>\\n\\ninline Statuses Load(State* L, Reader reader, void* dt, const char* chunkname, const char (&mode)[N]) {\\n\\n static_assert(::detail::LoadModeChecker(mode), R\\\"(Load mode can only be \\\"b\\\", \\\"t\\\", \\\"bt\\\" or null pointer)\\\");\\n\\n return static_cast<Statuses>(detail::lua_load(L, reader, dt, chunkname, mode));\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 75,\n \"score\": 11.541677332441203\n },\n {\n \"content\": \"printResult(sock6 ~= nil and type(sock6) == \\\"userdata\\\", error)\\n\\n\\n\\nio.write(\\\"bind(ipv6SH): \\\")\\n\\nlocal success, error = sock6:bind(12345, \\\"::1\\\")\\n\\nprintResult(success, error)\\n\\nsock6:close()\\n\\n\\n\\n--[[io.write(\\\"bind(ipv6MH): \\\")\\n\\nlocal success, error = sock6:bind(12345, \\\"::1\\\", \\\"::2\\\")\\n\\nprintResult(success, error)]]\\n\\n\\n\\n--I really should create/use a testing framework\\n\\nio.write(\\\"send/receive: \\\")\\n\\nlocal server = sctp.server.socket4()\\n\\nserver:bind(12345, \\\"127.1.1.1\\\", \\\"127.3.3.3\\\")\\n\\nserver:listen()\\n\\n\\n\\nlocal client = sctp.client.socket4()\\n\\nclient:bind(12345, \\\"127.2.2.2\\\", \\\"127.4.4.4\\\")\\n\\nclient:connect(12345, \\\"127.1.1.1\\\", \\\"127.3.3.3\\\")\\n\",\n \"file_path\": \"tst/lua/socket.lua\",\n \"rank\": 76,\n \"score\": 11.524527758517618\n },\n {\n \"content\": \"#ifndef LUA_HPP\\n\\n#define LUA_HPP\\n\\n\\n\\n#include <type_traits>\\n\\n#include <cstddef>\\n\\n#include <cstdarg>\\n\\n#include <cstdio>\\n\\n\\n\\nnamespace detail {\\n\\n\\n\\nextern \\\"C\\\" {\\n\\n#include \\\"lua.h\\\"\\n\\n#include \\\"lualib.h\\\"\\n\\n#include \\\"lauxlib.h\\\"\\n\\n}\\n\\n\\n\\nconstexpr bool LoadModeChecker(const char* c) {\\n\\n return c == nullptr or\\n\\n (c[0] == 't' and c[1] == '\\\\0') or\\n\\n (c[0] == 'b' and c[1] == '\\\\0') or\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 77,\n \"score\": 11.408185844643699\n },\n {\n \"content\": \"\\n\\nextern \\\"C\\\" int luaopen_sctp(Lua::State* L) {\\n\\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Server<4>::MetaTableName);\\n\\n Lua::PushValue(L, -1);\\n\\n Lua::SetField(L, -2, \\\"__index\\\");\\n\\n Lua::Aux::SetFuncs(L, ServerSocketMetaTable4, 0);\\n\\n\\n\\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Server<6>::MetaTableName);\\n\\n Lua::PushValue(L, -1);\\n\\n Lua::SetField(L, -2, \\\"__index\\\");\\n\\n Lua::Aux::SetFuncs(L, ServerSocketMetaTable6, 0);\\n\\n\\n\\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Client<4>::MetaTableName);\\n\\n Lua::PushValue(L, -1);\\n\\n Lua::SetField(L, -2, \\\"__index\\\");\\n\\n Lua::Aux::SetFuncs(L, ClientSocketMetaTable4, 0);\\n\\n\\n\\n Lua::Aux::NewMetaTable(L, Sctp::Socket::Client<6>::MetaTableName);\\n\\n Lua::PushValue(L, -1);\\n\\n Lua::SetField(L, -2, \\\"__index\\\");\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 78,\n \"score\": 11.197900779331864\n },\n {\n \"content\": \"int luaK_exp2anyreg (FuncState *fs, expdesc *e) {\\n\\n luaK_dischargevars(fs, e);\\n\\n if (e->k == VNONRELOC) { /* expression already has a register? */\\n\\n if (!hasjumps(e)) /* no jumps? */\\n\\n return e->u.info; /* result is already in a register */\\n\\n if (e->u.info >= fs->nactvar) { /* reg. is not a local? */\\n\\n exp2reg(fs, e, e->u.info); /* put final result in it */\\n\\n return e->u.info;\\n\\n }\\n\\n }\\n\\n luaK_exp2nextreg(fs, e); /* otherwise, use next available register */\\n\\n return e->u.info;\\n\",\n \"file_path\": \"subprojects/lua/src/lcode.c\",\n \"rank\": 79,\n \"score\": 11.167742520678704\n },\n {\n \"content\": \" return detail::lua_getlocal(L, ar, n);\\n\\n}\\n\\ninline const char* SetLocal(State* L, const Debug* ar, int n) {\\n\\n return detail::lua_setlocal(L, ar, n);\\n\\n}\\n\\ninline const char* GetUpvalue(State* L, int funcindex, int n) {\\n\\n return detail::lua_getupvalue(L, funcindex, n);\\n\\n}\\n\\ninline const char* SetUpvalue(State* L, int funcindex, int n) {\\n\\n return detail::lua_setupvalue(L, funcindex, n);\\n\\n}\\n\\ninline void* UpvalueID(State* L, int fidx, int n) {\\n\\n return detail::lua_upvalueid(L, fidx, n);\\n\\n}\\n\\ninline void UpvalueJoin(State* L, int fidx1, int n1, int fidx2, int n2) {\\n\\n return detail::lua_upvaluejoin(L, fidx1, n1, fidx2, n2);\\n\\n}\\n\\ninline void SetHook(State* L, Hook func, int mask, int count) {\\n\\n return detail::lua_sethook(L, func, mask, count);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 80,\n \"score\": 11.010122842500133\n },\n {\n \"content\": \"inline int Math(State* L) {\\n\\n return detail::luaopen_math(L);\\n\\n}\\n\\ninline int Debug(State* L) {\\n\\n return detail::luaopen_debug(L);\\n\\n}\\n\\ninline int Package(State* L) {\\n\\n return detail::luaopen_package(L);\\n\\n}\\n\\n//Not sure it's the right place for this function since it's an auxiliary\\n\\n//function, but declared in lualib.h\\n\\ninline void Libs(State* L) {\\n\\n detail::luaL_openlibs(L);\\n\\n}\\n\\n\\n\\n} //Namespace Open\\n\\n\\n\\n} //Namespace Lib\\n\\n\\n\\nnamespace Aux {\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 81,\n \"score\": 10.96071563375165\n },\n {\n \"content\": \"static int luaB_xpcall (lua_State *L) {\\n\\n int status;\\n\\n int n = lua_gettop(L);\\n\\n luaL_checktype(L, 2, LUA_TFUNCTION); /* check error function */\\n\\n lua_pushboolean(L, 1); /* first result */\\n\\n lua_pushvalue(L, 1); /* function */\\n\\n lua_rotate(L, 3, 2); /* move them below function's arguments */\\n\\n status = lua_pcallk(L, n - 2, LUA_MULTRET, 2, 2, finishpcall);\\n\\n return finishpcall(L, status, 2);\\n\",\n \"file_path\": \"subprojects/lua/src/lbaselib.c\",\n \"rank\": 82,\n \"score\": 10.884724030644609\n },\n {\n \"content\": \" Lua::Aux::SetFuncs(L, ClientSocketMetaTable6, 0);\\n\\n\\n\\n const Lua::Aux::Reg SocketFuncs[] = { { nullptr, nullptr } };\\n\\n Lua::Aux::NewLib(L, SocketFuncs);\\n\\n\\n\\n Lua::Newtable(L);\\n\\n Lua::PushCFunction(L, New<Sctp::Socket::Server<4>>);\\n\\n Lua::SetField(L, -2, \\\"socket4\\\");\\n\\n Lua::PushCFunction(L, New<Sctp::Socket::Server<6>>);\\n\\n Lua::SetField(L, -2, \\\"socket6\\\");\\n\\n Lua::SetField(L, -2, \\\"server\\\");\\n\\n\\n\\n Lua::Newtable(L);\\n\\n Lua::PushCFunction(L, New<Sctp::Socket::Client<4>>);\\n\\n Lua::SetField(L, -2, \\\"socket4\\\");\\n\\n Lua::PushCFunction(L, New<Sctp::Socket::Client<6>>);\\n\\n Lua::SetField(L, -2, \\\"socket6\\\");\\n\\n Lua::SetField(L, -2, \\\"client\\\");\\n\\n\\n\\n return 1;\\n\\n}\\n\",\n \"file_path\": \"src/lsctp.cpp\",\n \"rank\": 83,\n \"score\": 10.84917153962978\n },\n {\n \"content\": \"void luaK_setoneret (FuncState *fs, expdesc *e) {\\n\\n if (e->k == VCALL) { /* expression is an open function call? */\\n\\n /* already returns 1 value */\\n\\n lua_assert(GETARG_C(getinstruction(fs, e)) == 2);\\n\\n e->k = VNONRELOC; /* result has fixed position */\\n\\n e->u.info = GETARG_A(getinstruction(fs, e));\\n\\n }\\n\\n else if (e->k == VVARARG) {\\n\\n SETARG_B(getinstruction(fs, e), 2);\\n\\n e->k = VRELOCABLE; /* can relocate its simple result */\\n\\n }\\n\",\n \"file_path\": \"subprojects/lua/src/lcode.c\",\n \"rank\": 84,\n \"score\": 10.658761331721664\n },\n {\n \"content\": \" but that would prevent the other tests to run\\n\\n]]\\n\\n\\n\\nio.write(\\\"socket(ipv4): \\\")\\n\\nlocal sock4, error = sctp.server.socket4()\\n\\nprintResult(sock4 ~= nil and type(sock4) == \\\"userdata\\\", error)\\n\\n\\n\\nio.write(\\\"bind(ipv4SH): \\\")\\n\\nlocal success, error = sock4:bind(12345, \\\"127.0.0.1\\\")\\n\\nprintResult(success, error)\\n\\nsock4:close()\\n\\n\\n\\nlocal sock4MH = sctp.server.socket4()\\n\\nio.write(\\\"bind(ipv4MH): \\\")\\n\\nlocal success, error = sock4MH:bind(12345, \\\"127.0.0.1\\\", \\\"127.0.0.2\\\", \\\"127.1.1.1\\\")\\n\\nprintResult(success, error)\\n\\nsock4MH:close()\\n\\n\\n\\nio.write(\\\"socket(ipv6): \\\")\\n\\nlocal sock6, error = sctp.server.socket6()\\n\",\n \"file_path\": \"tst/lua/socket.lua\",\n \"rank\": 85,\n \"score\": 10.54536527745663\n },\n {\n \"content\": \" detail::lua_pushnil(L);\\n\\n}\\n\\ninline void PushNumber(State* L, Number n) {\\n\\n detail::lua_pushnumber(L, n);\\n\\n}\\n\\ninline void PushInteger(State* L, Integer n) {\\n\\n detail::lua_pushinteger(L, n);\\n\\n}\\n\\ninline const char* PushLString(State* L, const char* s, std::size_t len) {\\n\\n return detail::lua_pushlstring(L, s, len);\\n\\n}\\n\\ninline const char* PushString(State* L, const char* s) {\\n\\n return detail::lua_pushstring(L, s);\\n\\n}\\n\\ninline const char* PushVFString(State* L, const char* fmt, va_list argp) {\\n\\n return detail::lua_pushvfstring(L, fmt, argp);\\n\\n}\\n\\ntemplate<class ...VarArgs>\\n\\ninline const char* PushFString(State* L, const char* fmt, VarArgs&&... args) {\\n\\n return detail::lua_pushfstring(L, fmt, args...);\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 86,\n \"score\": 9.457614957293085\n },\n {\n \"content\": \"}\\n\\ninline void AddValue(Buffer& B) {\\n\\n detail::luaL_addvalue(&B);\\n\\n}\\n\\ninline void PushResult(Buffer& B) {\\n\\n detail::luaL_pushresult(&B);\\n\\n}\\n\\ninline void PushResultSize(Buffer& B, size_t sz) {\\n\\n detail::luaL_pushresultsize(&B, sz);\\n\\n}\\n\\ninline char* BuffInitSize(State* L, Buffer& B, size_t sz) {\\n\\n return detail::luaL_buffinitsize(L, &B, sz);\\n\\n}\\n\\n\\n\\n//#define luaL_prepbuffsize(B, sz) PrepBuffSize(*B, sz)\\n\\ninline void AddChar(Buffer& B, char c) {\\n\\n luaL_addchar(&B, c);\\n\\n //B.n < B.size || PrepBuffSize(B, 1), B.b[B.n++] = c;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 87,\n \"score\": 9.128178870002944\n },\n {\n \"content\": \" return detail::luaopen_coroutine(L);\\n\\n}\\n\\ninline int Table(State* L) {\\n\\n return detail::luaopen_table(L);\\n\\n}\\n\\ninline int IO(State* L) {\\n\\n return detail::luaopen_io(L);\\n\\n}\\n\\ninline int OS(State* L) {\\n\\n return detail::luaopen_os(L);\\n\\n}\\n\\ninline int String(State* L) {\\n\\n return detail::luaopen_string(L);\\n\\n}\\n\\ninline int Utf8(State* L) {\\n\\n return detail::luaopen_utf8(L);\\n\\n}\\n\\ninline int Bit32(State* L) {\\n\\n return detail::luaopen_bit32(L);\\n\\n}\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 88,\n \"score\": 9.10607574635613\n },\n {\n \"content\": \"static void settabss (lua_State *L, const char *k, const char *v) {\\n\\n lua_pushstring(L, v);\\n\\n lua_setfield(L, -2, k);\\n\",\n \"file_path\": \"subprojects/lua/src/ldblib.c\",\n \"rank\": 89,\n \"score\": 9.067385165854153\n },\n {\n \"content\": \"TString *luaS_new (lua_State *L, const char *str) {\\n\\n unsigned int i = point2uint(str) % STRCACHE_N; /* hash */\\n\\n int j;\\n\\n TString **p = G(L)->strcache[i];\\n\\n for (j = 0; j < STRCACHE_M; j++) {\\n\\n if (strcmp(str, getstr(p[j])) == 0) /* hit? */\\n\\n return p[j]; /* that is it */\\n\\n }\\n\\n /* normal route */\\n\\n for (j = STRCACHE_M - 1; j > 0; j--)\\n\\n p[j] = p[j - 1]; /* move out last element */\\n\\n /* new element is first in the list */\\n\\n p[0] = luaS_newlstr(L, str, strlen(str));\\n\\n return p[0];\\n\",\n \"file_path\": \"subprojects/lua/src/lstring.c\",\n \"rank\": 90,\n \"score\": 8.564880373665204\n },\n {\n \"content\": \"# lsctp\\n\\nA simple Lua module that binds some features of the SCTP api.\\n\\n\\n\\nLimitations:\\n\\n- One-to-one sockets only\\n\\n- Mixing IPv4 and IPv6 addresses are not supported\\n\\n- Usage of deprecated sctp_sendmsg() and sctp_recvmsg() functions (because of lksctp-tools)\\n\\n\\n\\nExample usage:\\n\\n```lua\\n\\nsctp = require \\\"sctp\\\"\\n\\n\\n\\nlocal server = sctp.server.socket4()\\n\\nserver:bind(12345, \\\"127.0.0.1\\\")\\n\\nserver:listen()\\n\\n\\n\\nlocal client = sctp.client.socket4()\\n\\nclient:connect(12345, \\\"127.0.0.1\\\")\\n\\n\\n\\nlocal peer = server:accept()\\n\\n\\n\\nclient:send(string.pack(\\\"iii\\\", 1, 2, 3))\\n\\nlocal size, msg = peer:recv()\\n\\n\\n\\nprint(string.unpack(\\\"iii\\\", msg))\\n\\n\\n\\npeer:close()\\n\\nclient:close()\\n\\nserver:close()\\n\\n\\n\\n```\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 91,\n \"score\": 8.365179254265\n },\n {\n \"content\": \"static int checkupval (lua_State *L, int argf, int argnup) {\\n\\n int nup = (int)luaL_checkinteger(L, argnup); /* upvalue index */\\n\\n luaL_checktype(L, argf, LUA_TFUNCTION); /* closure */\\n\\n luaL_argcheck(L, (lua_getupvalue(L, argf, nup) != NULL), argnup,\\n\\n \\\"invalid upvalue index\\\");\\n\\n return nup;\\n\",\n \"file_path\": \"subprojects/lua/src/ldblib.c\",\n \"rank\": 92,\n \"score\": 8.198772678703804\n },\n {\n \"content\": \"static const char *get_prompt (lua_State *L, int firstline) {\\n\\n const char *p;\\n\\n lua_getglobal(L, firstline ? \\\"_PROMPT\\\" : \\\"_PROMPT2\\\");\\n\\n p = lua_tostring(L, -1);\\n\\n if (p == NULL) p = (firstline ? LUA_PROMPT : LUA_PROMPT2);\\n\\n return p;\\n\",\n \"file_path\": \"subprojects/lua/src/lua.c\",\n \"rank\": 93,\n \"score\": 8.162816266821402\n },\n {\n \"content\": \"}\\n\\n\\n\\n\\n\\nusing Buffer = detail::luaL_Buffer;\\n\\n\\n\\ninline void AddSize(Buffer& B, size_t n) {\\n\\n luaL_addsize(&B, n);\\n\\n}\\n\\n\\n\\ninline void BuffInit(State* L, Buffer& B) {\\n\\n detail::luaL_buffinit(L, &B);\\n\\n}\\n\\ninline char* PrepBuffSize(Buffer& B, size_t sz) {\\n\\n return detail::luaL_prepbuffsize(&B, sz);\\n\\n}\\n\\ninline void AddLString(Buffer& B, const char* s, size_t l) {\\n\\n detail::luaL_addlstring(&B, s, l);\\n\\n}\\n\\ninline void AddString(Buffer& B, const char* s) {\\n\\n detail::luaL_addstring(&B, s);\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 94,\n \"score\": 8.160194375290773\n },\n {\n \"content\": \"static int luaB_ipairs (lua_State *L) {\\n\\n#if defined(LUA_COMPAT_IPAIRS)\\n\\n return pairsmeta(L, \\\"__ipairs\\\", 1, ipairsaux);\\n\\n#else\\n\\n luaL_checkany(L, 1);\\n\\n lua_pushcfunction(L, ipairsaux); /* iteration function */\\n\\n lua_pushvalue(L, 1); /* state */\\n\\n lua_pushinteger(L, 0); /* initial value */\\n\\n return 3;\\n\\n#endif\\n\",\n \"file_path\": \"subprojects/lua/src/lbaselib.c\",\n \"rank\": 95,\n \"score\": 7.996607489444553\n },\n {\n \"content\": \"void luaK_exp2nextreg (FuncState *fs, expdesc *e) {\\n\\n luaK_dischargevars(fs, e);\\n\\n freeexp(fs, e);\\n\\n luaK_reserveregs(fs, 1);\\n\\n exp2reg(fs, e, fs->freereg - 1);\\n\",\n \"file_path\": \"subprojects/lua/src/lcode.c\",\n \"rank\": 96,\n \"score\": 7.825387211621011\n },\n {\n \"content\": \" (c[0] == 'b' and c[1] == 't');\\n\\n}\\n\\n\\n\\n} //Namespace detail\\n\\n\\n\\nnamespace Lua {\\n\\n\\n\\nnamespace Conf {\\n\\n\\n\\nconstexpr auto ExtraSpace = LUA_EXTRASPACE;\\n\\n\\n\\n} //namespace Conf\\n\\n\\n\\nconstexpr auto VersionMajor = LUA_VERSION_MAJOR;\\n\\nconstexpr auto VersionMinor = LUA_VERSION_MINOR;\\n\\nconstexpr auto VersionNumber = LUA_VERSION_NUM;\\n\\nconstexpr auto VersionRelease = LUA_VERSION_RELEASE;\\n\\n\\n\\n//Version renamed to prevent name clash with the function Version\\n\\nconstexpr auto VersionStr = LUA_VERSION;\\n\",\n \"file_path\": \"include/Lua/Lua.hpp\",\n \"rank\": 97,\n \"score\": 7.65218168666935\n },\n {\n \"content\": \"void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {\\n\\n lua_assert(!hasjumps(t) && (vkisinreg(t->k) || t->k == VUPVAL));\\n\\n t->u.ind.t = t->u.info; /* register or upvalue index */\\n\\n t->u.ind.idx = luaK_exp2RK(fs, k); /* R/K index for key */\\n\\n t->u.ind.vt = (t->k == VUPVAL) ? VUPVAL : VLOCAL;\\n\\n t->k = VINDEXED;\\n\",\n \"file_path\": \"subprojects/lua/src/lcode.c\",\n \"rank\": 98,\n \"score\": 7.401123782567147\n },\n {\n \"content\": \"static int moveresults (lua_State *L, const TValue *firstResult, StkId res,\\n\\n int nres, int wanted) {\\n\\n switch (wanted) { /* handle typical cases separately */\\n\\n case 0: break; /* nothing to move */\\n\\n case 1: { /* one result needed */\\n\\n if (nres == 0) /* no results? */\\n\\n firstResult = luaO_nilobject; /* adjust with nil */\\n\\n setobjs2s(L, res, firstResult); /* move it to proper place */\\n\\n break;\\n\\n }\\n\\n case LUA_MULTRET: {\\n\\n int i;\\n\\n for (i = 0; i < nres; i++) /* move all results to correct place */\\n\\n setobjs2s(L, res + i, firstResult + i);\\n\\n L->top = res + nres;\\n\\n return 0; /* wanted == LUA_MULTRET */\\n\\n }\\n\\n default: {\\n\\n int i;\\n\\n if (wanted <= nres) { /* enough results? */\\n\\n for (i = 0; i < wanted; i++) /* move wanted results to correct place */\\n\\n setobjs2s(L, res + i, firstResult + i);\\n\\n }\\n\\n else { /* not enough results; use all of them plus nils */\\n\\n for (i = 0; i < nres; i++) /* move all results to correct place */\\n\\n setobjs2s(L, res + i, firstResult + i);\\n\\n for (; i < wanted; i++) /* complete wanted number of results */\\n\\n setnilvalue(res + i);\\n\\n }\\n\\n break;\\n\\n }\\n\\n }\\n\\n L->top = res + wanted; /* top points after the last result */\\n\\n return 1;\\n\",\n \"file_path\": \"subprojects/lua/src/ldo.c\",\n \"rank\": 99,\n \"score\": 7.3077081771281955\n }\n]","isConversational":false}}},{"rowIdx":287,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"SM_RayIntersect.cpp"},"repo_name":{"kind":"string","value":"xzrunner/sm"},"commit":{"kind":"string","value":"e31351c4fcd4470efa4dbec5bb6ee02c21ae42f8"},"file_code":{"kind":"string","value":"#include \"SM_RayIntersect.h\"\n\nnamespace sm\n{\n\nbool ray_ray_intersect(const Ray& ray0, const Ray& ray1, vec3* cross)\n{\n\tauto& da = ray0.dir;\n\tauto& db = ray1.dir;\n\tauto dc = ray1.origin - ray0.origin;\n\tauto cross_ab = da.Cross(db);\n\tif (fabs(dc.Dot(cross_ab)) > SM_LARGE_EPSILON) {\n\t\treturn false;\n\t}\n\tfloat d = cross_ab.LengthSquared();\n\t\n\tif (d < std::numeric_limits<float>::epsilon()) {\n\t\treturn false;\n\t}\n\tauto s = dc.Cross(db).Dot(cross_ab) / d;\n\tauto t = dc.Cross(da).Dot(cross_ab) / d;\n\t\n\t\n\t\n\t\n\tif (s >= 0 && t >= 0) {\n\t\t*cross = ray0.origin + ray0.dir * s;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool line_line_intersect(const sm::vec3& p1, const sm::vec3& p2,\n\t const sm::vec3& p3, const sm::vec3& p4,\n\t sm::vec3* pa, sm::vec3* pb, float* mua, float* mub)\n{\n\tsm::vec3 p13,p43,p21;\n\tfloat d1343,d4321,d1321,d4343,d2121;\n\tfloat numer,denom;\n\n\tfloat EPS = std::numeric_limits<float>::epsilon();\n\n\tp13.x = p1.x - p3.x;\n\tp13.y = p1.y - p3.y;\n\tp13.z = p1.z - p3.z;\n\tp43.x = p4.x - p3.x;\n\tp43.y = p4.y - p3.y;\n\tp43.z = p4.z - p3.z;\n\tif (fabs(p43.x) < EPS && fabs(p43.y) < EPS && fabs(p43.z) < EPS)\n\t\treturn false;\n\tp21.x = p2.x - p1.x;\n\tp21.y = p2.y - p1.y;\n\tp21.z = p2.z - p1.z;\n\tif (fabs(p21.x) < EPS && fabs(p21.y) < EPS && fabs(p21.z) < EPS)\n\t\treturn false;\n\n\td1343 = p13.x * p43.x + p13.y * p43.y + p13.z * p43.z;\n\td4321 = p43.x * p21.x + p43.y * p21.y + p43.z * p21.z;\n\td1321 = p13.x * p21.x + p13.y * p21.y + p13.z * p21.z;\n\td4343 = p43.x * p43.x + p43.y * p43.y + p43.z * p43.z;\n\td2121 = p21.x * p21.x + p21.y * p21.y + p21.z * p21.z;\n\n\tdenom = d2121 * d4343 - d4321 * d4321;\n\tif (fabs(denom) < EPS)\n\t\treturn false;\n\tnumer = d1343 * d4321 - d1321 * d4343;\n\n\t*mua = numer / denom;\n\t*mub = (d1343 + d4321 * (*mua)) / d4343;\n\n\tpa->x = p1.x + *mua * p21.x;\n\tpa->y = p1.y + *mua * p21.y;\n\tpa->z = p1.z + *mua * p21.z;\n\tpb->x = p3.x + *mub * p43.x;\n\tpb->y = p3.y + *mub * p43.y;\n\tpb->z = p3.z + *mub * p43.z;\n\n\treturn true;\n}\n\n#define NUMDIM\t3\n#define RIGHT\t0\n#define LEFT\t1\n#define MIDDLE\t2\n\nbool ray_aabb_intersect(const cube& aabb, const Ray& ray, vec3* _cross)\n{\n\tvec3 cross;\n\n\tchar quadrant[3];\n\tfloat candidate_plane[3];\n\tbool inside = true;\n\n\t\n\tfor (int i = 0; i < 3; ++i)\n\t{\n\t\tif (ray.origin[i] < aabb.Min()[i]) {\n\t\t\tquadrant[i] = LEFT;\n\t\t\tcandidate_plane[i] = aabb.Min()[i];\n\t\t\tinside = false;\n\t\t} else if (ray.origin[i] > aabb.Max()[i]) {\n\t\t\tquadrant[i] = RIGHT;\n\t\t\tcandidate_plane[i] = aabb.Max()[i];\n\t\t\tinside = false;\n\t\t} else {\n\t\t\tquadrant[i] = MIDDLE;\n\t\t}\n\t}\n\n\t\n\tif (inside) {\n\t\tcross = ray.origin;\n\t\treturn true;\n\t}\n\n\tfloat max_t[3];\n\t\n\tfor (int i = 0; i < 3; ++i) {\n\t\tif (quadrant[i] != MIDDLE && ray.dir[i] != 0) {\n\t\t\tmax_t[i] = (candidate_plane[i]-ray.origin[i])/ray.dir[i];\n\t\t} else {\n\t\t\tmax_t[i] = -1;\n\t\t}\n\t}\n\n\t\n\tint which_plane = 0;\n\tfor (int i = 1; i < 3; ++i) {\n\t\tif (max_t[which_plane] < max_t[i]) {\n\t\t\twhich_plane = i;\n\t\t}\n\t}\n\n\t\n\tif (max_t[which_plane] < 0) {\n\t\treturn false;\n\t}\n\tfor (int i = 0; i < 3; ++i) {\n\t\tif (which_plane != i) {\n\t\t\tcross[i] = ray.origin[i] + max_t[which_plane] * ray.dir[i];\n\t\t\tif (cross[i] < aabb.Min()[i] || cross[i] > aabb.Max()[i]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t} else {\n\t\t\tcross[i] = candidate_plane[i];\n\t\t}\n\t}\n\n\tif (_cross) {\n\t\t*_cross = cross;\n\t}\n\n\treturn true;\n}\n\nbool ray_obb_intersect(const cube& aabb, const vec3& pos, const Quaternion& angle,\n\t const vec3& scale, const Ray& ray, vec3* cross)\n{\n\tmat4 rot_mat(-angle);\n\n\tvec3 start = rot_mat * (ray.origin - pos);\n\tvec3 dir = rot_mat * ray.dir;\n\tRay ray_fix(start, dir);\n\n\tauto aabb_scaled = aabb;\n\taabb_scaled.Scale(scale);\n\n\treturn ray_aabb_intersect(aabb_scaled, ray_fix, cross);\n}\n\nbool ray_plane_intersect(const Ray& ray, const Plane& plane, vec3* cross)\n{\n\tfloat d = ray.dir.Dot(plane.normal);\n\tif (d < -std::numeric_limits<float>::epsilon()) {\n\t\tfloat dist = -(ray.origin.Dot(plane.normal) + plane.dist) / d;\n\t\t*cross = ray.origin + ray.dir * dist;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool ray_plane_intersect_both_faces(const Ray& ray, const Plane& plane, vec3* cross)\n{\n\tfloat d = ray.dir.Dot(plane.normal);\n\tif (d < -std::numeric_limits<float>::epsilon() ||\n\t\td > std::numeric_limits<float>::epsilon()) {\n\t\tfloat dist = -(ray.origin.Dot(plane.normal) + plane.dist) / d;\n\t\t*cross = ray.origin + ray.dir * dist;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool ray_triangle_intersect(const mat4& mat, const vec3& v0, const vec3& v1,\n\t const vec3& v2, const Ray& ray, vec3* cross)\n{\n\tauto _v0 = mat * v0;\n\tauto _v1 = mat * v1;\n\tauto _v2 = mat * v2;\n\n\tauto e1 = _v1 - _v0;\n\tauto e2 = _v2 - _v0;\n\n\tauto p = ray.dir.Cross(e2);;\n\tauto a = e1.Dot(p);\n\n\tauto epsilon = std::numeric_limits<float>::epsilon();\n\tif (a < epsilon) {\n\t\treturn false;\n\t}\n\n\tfloat f = 1.0f / a;\n\n\tauto s = ray.origin - _v0;\n\tcross->x = f * s.Dot(p);\n\tif (cross->x < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\tauto q = s.Cross(e1);\n\tcross->y = f * ray.dir.Dot(q);\n\tif (cross->y < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->y + cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\tcross->z = f * e2.Dot(q);\n\n\treturn cross->z >= 0.0f;\n}\n\nbool ray_triangle_intersect_both_faces(const mat4& mat, const vec3& v0, const vec3& v1,\n\t const vec3& v2, const Ray& ray, vec3* cross)\n{\n\tauto _v0 = mat * v0;\n\tauto _v1 = mat * v1;\n\tauto _v2 = mat * v2;\n\n\tauto e1 = _v1 - _v0;\n\tauto e2 = _v2 - _v0;\n\n\tauto p = ray.dir.Cross(e2);;\n\tauto a = e1.Dot(p);\n\n\tfloat f = 1.0f / a;\n\n\tauto s = ray.origin - _v0;\n\tcross->x = f * s.Dot(p);\n\tif (cross->x < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\tauto q = s.Cross(e1);\n\tcross->y = f * ray.dir.Dot(q);\n\tif (cross->y < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->y + cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\tcross->z = f * e2.Dot(q);\n\n\treturn cross->z >= 0.0f;\n}\n\nbool ray_polygon_intersect(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross)\n{\n\tfor (size_t i = 1; i < polygon_n - 1; ++i) {\n\t\tif (ray_triangle_intersect(mat, polygon[0], polygon[i], polygon[i + 1], ray, cross)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool ray_polygon_intersect_both_faces(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross)\n{\n\tfor (size_t i = 1; i < polygon_n - 1; ++i) {\n\t\tif (ray_triangle_intersect_both_faces(mat, polygon[0], polygon[i], polygon[i + 1], ray, cross)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n}"},"prefix":{"kind":"string","value":"#include \"SM_RayIntersect.h\"\n\nnamespace sm\n{\n\nbool ray_ray_intersect(const Ray& ray0, const Ray& ray1, vec3* cross)\n{\n\tauto& da = ray0.dir;\n\tauto& db = ray1.dir;\n\tauto dc = ray1.origin - ray0.origin;\n\tauto cross_ab = da.Cross(db);\n\tif (fabs(dc.Dot(cross_ab)) > SM_LARGE_EPSILON) {\n\t\treturn false;\n\t}\n\tfloat d = cross_ab.LengthSquared();\n\t\n\tif (d < std::numeric_limits<float>::epsilon()) {\n\t\treturn false;\n\t}\n\tauto s = dc.Cross(db).Dot(cross_ab) / d;\n\tauto t = dc.Cross(da).Dot(cross_ab) / d;\n\t\n\t\n\t\n\t\n\tif (s >= 0 && t >= 0) {\n\t\t*cross = ray0.origin + ray0.dir * s;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool line_line_intersect(const sm::vec3& p1, const sm::vec3& p2,\n\t const sm::vec3& p3, const sm::vec3& p4,\n\t sm::vec3* pa, sm::vec3* pb, float* mua, float* mub)\n{\n\tsm::vec3 p13,p43,p21;\n\tfloat d1343,d4321,d1321,d4343,d2121;\n\tfloat numer,denom;\n\n\tfloat EPS = std::numeric_limits<float>::epsilon();\n\n\tp13.x = p1.x - p3.x;\n\tp13.y = p1.y - p3.y;\n\tp13.z = p1.z - p3.z;\n\tp43.x = p4.x - p3.x;\n\tp43.y = p4.y - p3.y;\n\tp43.z = p4.z - p3.z;\n\tif (fabs(p43.x) < EPS && fabs(p43.y) < EPS && fabs(p43.z) < EPS)\n\t\treturn false;\n\tp21.x = p2.x - p1.x;\n\tp21.y = p2.y - p1.y;\n\tp21.z = p2.z - p1.z;\n\tif (fabs(p21.x) < EPS && fabs(p21.y) < EPS && fabs(p21.z) < EPS)\n\t\treturn false;\n\n\td1343 = p13.x * p43.x + p13.y * p43.y + p13.z * p43.z;\n\td4321 = p43.x * p21.x + p43.y * p21.y + p43.z * p21.z;\n\td1321 = p13.x * p21.x + p13.y * p21.y + p13.z * p21.z;\n\td4343 = p43.x * p43.x + p43.y * p43.y + p43.z * p43.z;\n\td2121 = p21.x * p21.x + p21.y * p21.y + p21.z * p21.z;\n\n\tdenom = d2121 * d4343 - d4321 * d4321;\n\tif (fabs(denom) < EPS)\n\t\treturn false;\n\tnumer = d1343 * d4321 - d1321 * d4343;\n\n\t*mua = numer / denom;\n\t*mub = (d1343 + d4321 * (*mua)) / d4343;\n\n\tpa->x = p1.x + *mua * p21.x;\n\tpa->y = p1.y + *mua * p21.y;\n\tpa->z = p1.z + *mua * p21.z;\n\tpb->x = p3.x + *mub * p43.x;\n\tpb->y = p3.y + *mub * p43.y;\n\tpb->z = p3.z + *mub * p43.z;\n\n\treturn true;\n}\n\n#define NUMDIM\t3\n#define RIGHT\t0\n#define LEFT\t1\n#define MIDDLE\t2\n\nbool ray_aabb_intersect(const cube& aabb, const Ray& ray, vec3* _cross)\n{\n\tvec3 cross;\n\n\tchar quadrant[3];\n\tfloat candidate_plane[3];\n\tbool inside = true;\n\n\t\n\tfor (int i = 0; i < 3; ++i)\n\t{\n\t\tif (ray.origin[i] < aabb.Min()[i]) {\n\t\t\tquadrant[i] = LEFT;\n\t\t\tcandidate_plane[i] = aabb.Min()[i];\n\t\t\tinside = false;\n\t\t} else if (ray.origin[i] > aabb.Max()[i]) {\n\t\t\tquadrant[i] = RIGHT;\n\t\t\tcandidate_plane[i] = aabb.Max()[i];\n\t\t\tinside = false;\n\t\t} else {\n\t\t\tquadrant[i] = MIDDLE;\n\t\t}\n\t}\n\n\t\n\tif (inside) {\n\t\tcross = ray.origin;\n\t\treturn true;\n\t}\n\n\tfloat max_t[3];\n\t\n\tfor (int i = 0; i < 3; ++i) {\n\t\tif (quadrant[i] != MIDDLE && ray.dir[i] != 0) {\n\t\t\tmax_t[i] = (candidate_plane[i]-ray.origin[i])/ray.dir[i];\n\t\t} else {\n\t\t\tmax_t[i] = -1;\n\t\t}\n\t}\n\n\t\n\tint which_plane = 0;\n\tfor (int i = 1; i < 3; ++i) {\n\t\tif (max_t[which_plane] < max_t[i]) {\n\t\t\twhich_plane = i;\n\t\t}\n\t}\n\n\t\n\tif (max_t[which_plane] < 0) {\n\t\treturn false;\n\t}\n\tfor (int i = 0; i < 3; ++i) {\n\t\tif (which_plane != i) {\n\t\t\tcross[i] = ray.origin[i] + max_t[which_plane] * ray.dir[i];\n\t\t\tif (cross[i] < aabb.Min()[i] || cross[i] > aabb.Max()[i]) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t} else {\n\t\t\tcross[i] = candidate_plane[i];\n\t\t}\n\t}\n\n\tif (_cross) {\n\t\t*_cross = cross;\n\t}\n\n\treturn true;\n}\n\nbool ray_obb_intersect(const cube& aabb, const vec3& pos, const Quaternion& angle,\n\t const vec3& scale, const Ray& ray, vec3* cross)\n{\n\tmat4 rot_mat(-angle);\n\n\tvec3 start = rot_mat * (ray.origin - pos);\n\tvec3 dir = rot_mat * ray.dir;\n\tRay ray_fix(start, dir);\n\n\tauto aabb_scaled = aabb;\n\taabb_scaled.Scale(scale);\n\n\treturn ray_aabb_intersect(aabb_scaled, ray_fix, cross);\n}\n\nbool ray_plane_intersect(const Ray& ray, const Plane& plane, vec3* cross)\n{\n\tfloat d = ray.dir.Dot(plane.normal);\n\tif (d < -std::numeric_limits<float>::epsilon()) {\n\t\tfloat dist = -(ray.origin.Dot(plane.normal) + plane.dist) / d;\n\t\t*cross = ray.origin + ray.dir * dist;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool ray_plane_intersect_both_faces(const Ray& ray, const Plane& plane, vec3* cross)\n{\n\tfloat d = ray.dir.Dot(plane.normal);\n\tif (d < -std::numeric_limits<float>::epsilon() ||\n\t\td > std::numeric_limits<float>::epsilon()) {\n\t\tfloat dist = -(ray.origin.Dot(plane.normal) + plane.dist) / d;\n\t\t*cross = ray.origin + ray.dir * dist;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nbool ray_triangle_intersect(const mat4& mat, const vec3& v0, const vec3& v1,\n\t const vec3& v2, const Ray& ray, vec3* cross)\n{\n\tauto _v0 = mat * v0;\n\tauto _v1 = mat * v1;\n\tauto _v2 = mat * v2;\n\n\tauto e1 = _v1 - _v0;\n\tauto e2 = _v2 - _v0;\n\n\tauto p = ray.dir.Cross(e2);;\n\tauto a = e1.Dot(p);\n\n\tauto epsilon = std::numeric_limits<float>::epsilon();\n\tif (a < epsilon) {\n\t\treturn false;\n\t}\n\n\tfloat f = 1.0f / a;\n\n\tauto s = ray.origin - _v0;\n\tcross->x = f * s.Dot(p);\n\tif (cross->x < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\t"},"suffix":{"kind":"string","value":"\n\nbool ray_triangle_intersect_both_faces(const mat4& mat, const vec3& v0, const vec3& v1,\n\t const vec3& v2, const Ray& ray, vec3* cross)\n{\n\tauto _v0 = mat * v0;\n\tauto _v1 = mat * v1;\n\tauto _v2 = mat * v2;\n\n\tauto e1 = _v1 - _v0;\n\tauto e2 = _v2 - _v0;\n\n\tauto p = ray.dir.Cross(e2);;\n\tauto a = e1.Dot(p);\n\n\tfloat f = 1.0f / a;\n\n\tauto s = ray.origin - _v0;\n\tcross->x = f * s.Dot(p);\n\tif (cross->x < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\tauto q = s.Cross(e1);\n\tcross->y = f * ray.dir.Dot(q);\n\tif (cross->y < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->y + cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\tcross->z = f * e2.Dot(q);\n\n\treturn cross->z >= 0.0f;\n}\n\nbool ray_polygon_intersect(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross)\n{\n\tfor (size_t i = 1; i < polygon_n - 1; ++i) {\n\t\tif (ray_triangle_intersect(mat, polygon[0], polygon[i], polygon[i + 1], ray, cross)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool ray_polygon_intersect_both_faces(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross)\n{\n\tfor (size_t i = 1; i < polygon_n - 1; ++i) {\n\t\tif (ray_triangle_intersect_both_faces(mat, polygon[0], polygon[i], polygon[i + 1], ray, cross)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n}"},"middle":{"kind":"string","value":"auto q = s.Cross(e1);\n\tcross->y = f * ray.dir.Dot(q);\n\tif (cross->y < 0.0f) {\n\t\treturn false;\n\t}\n\tif (cross->y + cross->x > 1.0f) {\n\t\treturn false;\n\t}\n\n\tcross->z = f * e2.Dot(q);\n\n\treturn cross->z >= 0.0f;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"struct sm_vec3* sm_vec3_vector(struct sm_vec3* v, const struct sm_vec3* p1, const struct sm_vec3* p2)\n\n{\n\n\t*(vec3*)v = (*(const vec3*)p1) - (*(const vec3*)p2);\n\n\treturn v;\n\n}\n\n\n\nextern \"C\"\n","file_path":"sm_c_vector.cpp","rank":0,"score":127451.4694807237},{"content":"struct sm_vec3* sm_vec3_cross(struct sm_vec3* v, const struct sm_vec3* a, const struct sm_vec3* b)\n\n{\n\n\t*(vec3*)v = (*(const vec3*)a).Cross(*(const vec3*)b);\n\n\treturn v;\n\n}\n\n\n\nextern \"C\"\n","file_path":"sm_c_vector.cpp","rank":1,"score":99254.79997200954},{"content":"struct sm_vec2* sm_vec2_add(struct sm_vec2* v, const struct sm_vec2* p1, const struct sm_vec2* p2)\n\n{\n\n\t*(vec2*)v = (*(const vec2*)p1) + (*(const vec2*)p2);\n\n\treturn v;\n\n}\n\n\n\nextern \"C\"\n","file_path":"sm_c_vector.cpp","rank":2,"score":90633.57182052534},{"content":"struct sm_vec2* sm_vec2_vector(struct sm_vec2* v, const struct sm_vec2* p1, const struct sm_vec2* p2)\n\n{\n\n\t*(vec2*)v = (*(const vec2*)p1) - (*(const vec2*)p2);\n\n\treturn v;\n\n}\n\n\n\nextern \"C\"\n","file_path":"sm_c_vector.cpp","rank":3,"score":90633.57182052534},{"content":"struct sm_vec3* sm_vec3_mul(struct sm_vec3* v, const union sm_mat4* m)\n\n{\n\n\t*(vec3*)v = *((mat4*)m) * (*(vec3*)v);\n\n\treturn v;\n\n}\n\n\n\n}","file_path":"sm_c_matrix.cpp","rank":4,"score":88395.97956415084},{"content":"class Cube\n\n{\n\npublic:\n\n\tunion\n\n\t{\n\n\t\tstruct\n\n\t\t{\n\n\t\t\tT xmin;\n\n\t\t\tT ymin;\n\n\t\t\tT zmin;\n\n\n\n\t\t\tT xmax;\n\n\t\t\tT ymax;\n\n\t\t\tT zmax;\n\n\t\t};\n\n\n\n\t\tstruct\n\n\t\t{\n\n\t\t\tT min[3];\n\n\t\t\tT max[3];\n","file_path":"SM_Cube.h","rank":5,"score":64890.40767913923},{"content":"namespace sm\n\n{\n\n\n\nbool ray_ray_intersect(const Ray& ray0, const Ray& ray1, vec3* cross);\n\nbool line_line_intersect(const sm::vec3& p1, const sm::vec3& p2,\n\n\t const sm::vec3& p3, const sm::vec3& p4,\n\n\t sm::vec3* pa, sm::vec3* pb, float* mua, float* mub);\n\n\n\nbool ray_aabb_intersect(const cube& aabb, const Ray& ray, vec3* cross);\n\nbool ray_obb_intersect(const cube& aabb, const vec3& pos, const Quaternion& angle, const vec3& scale, const Ray& ray, vec3* cross);\n\n\n\nbool ray_plane_intersect(const Ray& ray, const Plane& plane, vec3* cross);\n\nbool ray_plane_intersect_both_faces(const Ray& ray, const Plane& plane, vec3* cross);\n\n\n\nbool ray_triangle_intersect(const mat4& mat, const vec3& v0, const vec3& v1, const vec3& v2, const Ray& ray, vec3* cross);\n\nbool ray_triangle_intersect_both_faces(const mat4& mat, const vec3& v0, const vec3& v1, const vec3& v2, const Ray& ray, vec3* cross);\n\n\n\nbool ray_polygon_intersect(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross);\n\nbool ray_polygon_intersect_both_faces(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross);\n\n\n","file_path":"SM_RayIntersect.h","rank":6,"score":55230.392108289256},{"content":"class PlaneT\n\n{\n\npublic:\n\n\tPlaneT() : dist(0) {}\n\n\tPlaneT(const Vector3<T>& normal, T d);\n\n\tPlaneT(const Vector3<T>& normal, const Vector3<T>& v0);\n\n\tPlaneT(const Vector3<T>& v0, const Vector3<T>& v1, const Vector3<T>& v2);\n\n\n\n T GetDistance(const Vector3<T>& v) const;\n\n\n\n\tvoid Build(const Vector3<T>& normal, T d);\n\n\tvoid Build(const Vector3<T>& normal, const Vector3<T>& v);\n\n\tvoid Build(const Vector3<T>& v0, const Vector3<T>& v1, const Vector3<T>& v2);\n\n\n\n void Flip();\n\n\n\npublic:\n\n\tVector3<T> normal;\n\n\tT dist;\n\n\n\n}; // PlaneT\n\n\n\ntypedef PlaneT<float> Plane;\n\n\n\n}\n\n\n\n#include \"SM_Plane.inl\"\n\n\n\n#endif // _SPATIAL_MATH_PLANE_H_","file_path":"SM_Plane.h","rank":7,"score":42761.786856540326},{"content":"class QuaternionT\n\n{\n\npublic:\n\n\tQuaternionT();\n\n\tQuaternionT(T x, T y, T z);\n\n\tQuaternionT(T x, T y, T z, T w);\n\n\tQuaternionT(const Vector4<T>& vec4);\n\n\n\n\tbool operator == (const QuaternionT<T>& q) const;\n\n\tbool operator != (const QuaternionT<T>& q) const;\n\n\n\n\tQuaternionT<T> operator - () const;\n\n\n\n\tQuaternionT<T> operator + (const QuaternionT<T>& q) const;\n\n\tQuaternionT<T> operator - (const QuaternionT<T>& q) const;\n\n\tQuaternionT<T> operator * (const QuaternionT<T>& q) const;\n\n\n\n\tvoid Normalize();\n\n\tT Dot(const QuaternionT<T>& q) const;\n\n\n","file_path":"SM_Quaternion.h","rank":8,"score":42680.34130678028},{"content":"class RayT\n\n{\n\npublic:\n\n\tRayT() {}\n\n\tRayT(const Vector3<T>& origin, const Vector3<T>& dir)\n\n\t\t: origin(origin), dir(dir) {}\n\n\n\npublic:\n\n\tVector3<T> origin;\n\n\tVector3<T> dir;\n\n\n\n}; // RayT\n\n\n\ntypedef RayT<float> Ray;\n\n\n\n}","file_path":"SM_Ray.h","rank":9,"score":42106.3964685321},{"content":"struct sm_vec3* sm_vec3_normalize(struct sm_vec3* v)\n\n{\n\n\t((vec3*)v)->Normalize();\n\n\treturn v;\n\n}\n\n\n\n}","file_path":"sm_c_vector.cpp","rank":10,"score":41888.922732299216},{"content":"#ifndef _SPATIAL_MATH_PLANE_H_\n\n#define _SPATIAL_MATH_PLANE_H_\n\n\n\n#include \"SM_Vector.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\ntemplate <typename T>\n","file_path":"SM_Plane.h","rank":11,"score":38422.97512379597},{"content":"\tbool Combine(const Vector3<T>& v);\n\n\tbool Combine(const Cube<T>& r);\n\n\n\n\tT Width() const;\n\n\tT Height() const;\n\n\tT Depth() const;\n\n\n\n\tVector3<T> Size() const;\n\n\tVector3<T> Center() const;\n\n\n\n\tvoid Translate(const Vector3<T>& trans);\n\n\tvoid Scale(const Vector3<T>& scale);\n\n\n\n\tconst T* Max() const { return max; }\n\n\tconst T* Min() const { return min; }\n\n\n\n}; // Cube\n\n\n\ntypedef Cube<int16_t> i16_cube;\n\n\n\ntypedef Cube<float> cube;\n\n\n\n}\n\n\n\n#include \"SM_Cube.inl\"\n\n\n\n#endif // _SPATIAL_MATH_CUBE_H_","file_path":"SM_Cube.h","rank":12,"score":38353.45963225734},{"content":"#ifndef _SPATIAL_MATH_CUBE_H_\n\n#define _SPATIAL_MATH_CUBE_H_\n\n\n\n#include \"SM_Vector.h\"\n\n\n\n#include <stdint.h>\n\n\n\nnamespace sm\n\n{\n\n\n\ntemplate <typename T>\n","file_path":"SM_Cube.h","rank":13,"score":38352.09533464624},{"content":"#ifndef _SPATIAL_MATH_QUATERNION_H_\n\n#define _SPATIAL_MATH_QUATERNION_H_\n\n\n\n#include \"SM_Vector.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\ntemplate <typename T>\n","file_path":"SM_Quaternion.h","rank":14,"score":38351.61433448528},{"content":"\n\npublic:\n\n\tT x;\n\n\tT y;\n\n\tT z;\n\n\tT w;\n\n\n\n}; // QuaternionT\n\n\n\ntypedef QuaternionT<float> Quaternion;\n\n\n\n}\n\n\n\n#include \"SM_Quaternion.inl\"\n\n\n\n#endif // _SPATIAL_MATH_QUATERNION_H_","file_path":"SM_Quaternion.h","rank":15,"score":38351.3000097533},{"content":"\tvoid Slerp(const QuaternionT<T>& a, const QuaternionT<T>& b, T t);\n\n\tvoid NSlerp(const QuaternionT<T>& a, const QuaternionT<T>& b, T t);\n\n\n\n\tvoid Inverted();\n\n\n\n\tvoid Rotate(const QuaternionT<T>& q);\n\n\tvoid Scale(T scale);\n\n\n\n\tQuaternionT<T> Rotated(const QuaternionT<T>& b) const;\n\n\tQuaternionT<T> Scaled(T scale) const;\n\n\n\n\tVector4<T> ToVector() const;\n\n\t//// use Matrix4's QuaternionT ctor\n\n\t//Matrix3<T> ToMatrix() const;\n\n\n\n\tstatic QuaternionT<T> CreateFromVectors(const Vector3<T>& v0, const Vector3<T>& v1);\n\n\tstatic QuaternionT<T> CreateFromAxisAngle(const Vector3<T>& axis, T radians);\n\n\tstatic QuaternionT<T> CreateFromEulerAngle(T roll, T pitch, T yaw);\n\n\n\n\tstatic void TransToEulerAngle(const QuaternionT<T>& q, T& roll, T& pitch, T& yaw);\n","file_path":"SM_Quaternion.h","rank":16,"score":38350.75317877065},{"content":"\t\t};\n\n\t};\n\n\n\n\n\n\n\npublic:\n\n\tCube();\n\n\tCube(T width, T height, T depth);\n\n\tCube(const Vector3<T>& center, T width, T height, T depth);\n\n\tCube(const Vector3<T>& v0, const Vector3<T>& v1);\n\n\tCube(T xmin, T ymin, T zmin, T xmax, T ymax, T zmax);\n\n\n\n\tbool operator == (const Cube& r) const;\n\n\tbool operator != (const Cube& r) const;\n\n\n\n\tvoid Build(T width, T height, T depth);\n\n\n\n\tvoid MakeEmpty();\n\n\tbool IsValid() const;\n\n\n","file_path":"SM_Cube.h","rank":17,"score":38349.62870225958},{"content":"#pragma once\n\n\n\n#include \"SM_Vector.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\ntemplate <typename T>\n","file_path":"SM_Ray.h","rank":18,"score":37846.23547243927},{"content":"namespace sm\n\n{\n\n\n\nfloat sin(float x);\n\nfloat cos(float x);\n\n\n\nfloat sin_fast(float x);\n\nfloat cos_fast(float x);\n\n\n\nint next_p2(int a);\n\nbool is_power_of_two(int x);\n\n\n","file_path":"SM_Math.h","rank":34,"score":29005.409210771355},{"content":"namespace sm\n\n{\n\n\n\n/**\n\n * @brief\n\n * float\n\n */\n\n\n\n/**\n\n * @brief\n\n * To check if test at middle of bound0 and bound1\n\n */\n\nbool is_between(float bound0, float bound1, float test);\n\n\n\n/**\n\n * @brief\n\n * point\n\n */\n\n\n\n/**\n\n * @note\n\n * It can't handle the point on segment.\n\n *\t Before use it must make sure the point is not on the segment.\n\n */\n\nbool is_point_at_line_left(const vec2& v, const vec2& s, const vec2& e);\n\nbool is_point_in_rect(const vec2& v, const rect& r);\n\nbool is_point_on_rect(const vec2& v, const rect& r);\n\nbool is_point_in_area(const vec2& v, const std::vector<vec2>& area);\n\nbool is_point_in_circle(const vec2& v, const vec2& center, float radius);\n\nbool is_point_in_convex(const vec2& pos, const std::vector<vec2>& convex);\n\nbool is_point_in_convex(const vec2& pos, const vec2* convex, size_t num);\n\nbool is_point_intersect_polyline(const vec2& point, const std::vector<vec2>& polyline);\n\n\n\n/**\n\n * @brief\n\n * segment\n\n */\n\nbool is_segment_intersect_segment(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1);\n\nbool is_segment_intersect_polyline(const vec2& s, const vec2& e, const std::vector<vec2>& poly);\n\n\n\nbool is_two_line_parallel(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1);\n\n\n\n/**\n\n * @brief\n\n * rect\n\n */\n\nbool is_rect_contain_point(const rect& r, const vec2& v);\n\nbool is_rect_contain_rect(const rect& outer, const rect& inner);\n\nbool is_rect_intersect_rect(const rect& r0, const rect& r1);\n\nbool is_rect_intersect_segment(const rect& r, const vec2& s, const vec2& e);\n\nbool is_rect_intersect_polyline(const rect& r, const std::vector<vec2>& poly, bool loop);\n\nbool is_rect_intersect_polygon(const rect& r, const std::vector<vec2>& poly);\n\n\n\n/**\n\n * @brief\n\n * convex\n\n */\n\nbool is_polygon_convex(const std::vector<vec2>& poly);\n\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1);\n\n\n\n/**\n\n * @brief\n\n * polygon\n\n */\n\nbool is_polygon_intersect_polygon(const std::vector<vec2>& poly0, const std::vector<vec2>& poly1);\n\nbool is_polygon_in_polygon(const std::vector<vec2>& in, const std::vector<vec2>& out);\n\nbool is_polygon_clockwise(const std::vector<vec2>& poly);\n\n\n","file_path":"SM_Test.h","rank":35,"score":29005.409210771355},{"content":"namespace sm\n\n{\n\n\n\nenum TriangulateConstrained\n\n{\n\n\tTC_CONSTRAINED,\n\n\tTC_CONFORMING,\n\n\tTC_CONSTRAINED_CONFORMING_ANGLE,\n\n\tTC_CONSTRAINED_CONFORMING_AREA,\n\n\tTC_CONSTRAINED_CONFORMING_COUNT\n\n};\n\n\n\nvoid triangulate_normal(const std::vector<vec2>& bound,\n\n\t\t\t\t\t\tstd::vector<vec2>& result,\n\n\t\t\t\t\t\tTriangulateConstrained tc = TC_CONSTRAINED);\n\n\n\nvoid triangulate_holes(const std::vector<vec2>& bound,\n\n\t\t\t\t\t const std::vector<std::vector<vec2>>& holes,\n\n\t\t\t\t\t std::vector<vec2>& result,\n\n\t\t\t\t\t TriangulateConstrained tc = TC_CONSTRAINED);\n\n\n\nvoid triangulate_points(const std::vector<vec2>& bound,\n\n\t\t\t\t\t\tconst std::vector<vec2>& points,\n\n\t\t\t\t\t\tstd::vector<vec2>& result,\n\n\t\t\t\t\t\tTriangulateConstrained tc = TC_CONSTRAINED);\n\nvoid triangulate_points(const std::vector<vec2>& bound,\n\n\t\t\t\t\t\tconst std::vector<vec2>& points,\n\n\t\t\t\t\t\tstd::vector<vec2>& out_vertices,\n\n\t\t\t\t\t\tstd::vector<int>& out_triangles,\n\n\t\t\t\t\t\tTriangulateConstrained tc = TC_CONSTRAINED);\n\n\n\nvoid triangulate_lines(const std::vector<vec2>& bound,\n\n\t\t\t\t\t const std::vector<vec2>& lines,\n\n\t\t\t\t\t std::vector<vec2>& result,\n\n\t\t\t\t\t TriangulateConstrained tc = TC_CONSTRAINED);\n\n\n\nvoid triangulate_points_and_lines(const std::vector<vec2>& bound,\n\n\t\t\t\t\t\t\t\t const std::vector<vec2>& points,\n\n\t\t\t\t\t\t\t\t const std::vector<vec2>& lines,\n\n\t\t\t\t\t\t\t\t std::vector<vec2>& result,\n\n\t\t\t\t\t\t\t\t TriangulateConstrained tc = TC_CONSTRAINED);\n\n\n\nvoid triangulate_lines_and_loops(const std::vector<vec2>& bound,\n\n\t\t\t\t\t\t\t\t const std::vector<vec2>& lines,\n\n\t\t\t\t\t\t\t\t const std::vector<std::vector<vec2> >& loops,\n\n\t\t\t\t\t\t\t\t std::vector<vec2>& result,\n\n\t\t\t\t\t\t\t\t TriangulateConstrained tc = TC_CONSTRAINED);\n\n\n","file_path":"SM_Triangulation.h","rank":36,"score":29005.409210771355},{"content":"namespace sm\n\n{\n\n\n\ninline\n\nfloat linear(float t)\n\n{\n\n\treturn t;\n\n}\n\n\n\ninline\n\nfloat in_quad(float t)\n\n{\n\n\treturn t * t;\n\n}\n\n\n\ninline\n\nfloat out_quad(float t)\n\n{\n\n\treturn -t * (t - 2);\n\n}\n\n\n\ninline\n\nfloat in_out_quad(float t)\n\n{\n\n\tif (t < 0.5f) {\n\n\t\treturn 2 * t * t;\n\n\t} else {\n\n\t\tt = 2 * t - 1;\n\n\t\treturn -0.5f * (t*(t-2) - 1);\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_cubic(float t)\n\n{\n\n\treturn t * t * t;\n\n}\n\n\n\ninline\n\nfloat out_cubic(float t)\n\n{\n\n\tt -= 1;\n\n\treturn t*t*t + 1;\n\n}\n\n\n\ninline\n\nfloat in_out_cubic(float t)\n\n{\n\n\tt *= 2;\n\n\tif (t < 1) {\n\n\t\treturn 0.5f * t * t * t;\n\n\t} else {\n\n\t\tt -= 2;\n\n\t\treturn 0.5f * (t*t*t + 2);\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_quart(float t)\n\n{\n\n\treturn t * t * t * t;\n\n}\n\n\n\ninline\n\nfloat out_quart(float t)\n\n{\n\n\tt -= 1;\n\n\treturn -(t*t*t*t - 1);\n\n}\n\n\n\ninline\n\nfloat in_out_quart(float t)\n\n{\n\n\tt *= 2;\n\n\tif (t < 1) {\n\n\t\treturn 0.5f * t * t * t * t;\n\n\t} else {\n\n\t\tt -= 2;\n\n\t\treturn -0.5f * (t*t*t*t - 2);\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_quint(float t)\n\n{\n\n\treturn t * t * t * t * t;\n\n}\n\n\n\ninline\n\nfloat out_quint(float t)\n\n{\n\n\tt -= 1;\n\n\treturn t*t*t*t*t + 1;\n\n}\n\n\n\ninline\n\nfloat in_out_quint(float t)\n\n{\n\n\tt *= 2;\n\n\tif (t < 1) {\n\n\t\treturn 0.5f * t * t * t * t * t;\n\n\t} else {\n\n\t\tt -= 2;\n\n\t\treturn 0.5f * (t*t*t*t*t + 2);\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_sine(float t)\n\n{\n\n\treturn -1 * cosf(t * SM_PI / 2) + 1;\n\n}\n\n\n\ninline\n\nfloat out_sine(float t)\n\n{\n\n\treturn sinf(t * SM_PI / 2);\n\n}\n\n\n\ninline\n\nfloat in_out_sine(float t)\n\n{\n\n\treturn -0.5f * (cosf(SM_PI * t) - 1);\n\n}\n\n\n\ninline\n\nfloat in_expo(float t)\n\n{\n\n\tif (t == 0) {\n\n\t\treturn 0;\n\n\t} else {\n\n\t\treturn powf(2, 10*(t-1));\n\n\t}\n\n}\n\n\n\ninline\n\nfloat out_expo(float t)\n\n{\n\n\tif (t == 1) {\n\n\t\treturn 1;\n\n\t} else {\n\n\t\treturn 1 - powf(2, -10*t);\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_out_expo(float t)\n\n{\n\n\tif (t == 0) {\n\n\t\treturn 0;\n\n\t} else if (t == 1) {\n\n\t\treturn 1;\n\n\t} else {\n\n\t\tif (t < 0.5f) {\n\n\t\t\treturn 0.5f * powf(2, (20*t)-10);\n\n\t\t} else {\n\n\t\t\treturn 1 - 0.5f * powf(2, (-20*t)+10);\n\n\t\t}\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_circ(float t)\n\n{\n\n\treturn -1 * (sqrtf(1-t*t) - 1);\n\n}\n\n\n\ninline\n\nfloat out_circ(float t)\n\n{\n\n\tt -= 1;\n\n\treturn sqrtf(1 - (t * t));\n\n}\n\n\n\ninline\n\nfloat in_out_circ(float t)\n\n{\n\n\tt *= 2;\n\n\tif (t < 1) {\n\n\t\treturn -0.5f * (sqrtf(1-t*t) - 1);\n\n\t} else {\n\n\t\tt = t - 2;\n\n\t\treturn 0.5f * (sqrtf(1-t*t) + 1);\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_elastic_function(float t)\n\n{\n\n\tconst float p = 0.5f;\n\n\tt -= 1;\n\n\treturn -1 * (powf(2, 10*t) * sinf((t-p/4)*(2*SM_PI)/p));\n\n}\n\n\n\ninline\n\nfloat out_elastic_function(float t)\n\n{\n\n\tconst float p = 0.5f;\n\n\treturn powf(2, -10*t) * sinf((t-p/4)*(2*SM_PI/p)) + 1;\n\n}\n\n\n\ninline\n\nfloat in_out_elastic_function(float t)\n\n{\n\n\tconst float p = 0.5f;\n\n\tt *= 2;\n\n\tif (t < 1) {\n\n\t\tt -= 1;\n\n\t\treturn -0.5f * (powf(2, 10*t) * sinf((t-p/4)*2*SM_PI/p));\n\n\t} else {\n\n\t\tt -= 1;\n\n\t\treturn powf(2, -10*t)*sinf((t-p/4)*2*SM_PI/p)*0.5f + 1;\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_elastic(float t)\n\n{\n\n\treturn in_elastic_function(0.5f);\n\n}\n\n\n\ninline\n\nfloat out_elastic(float t)\n\n{\n\n\treturn out_elastic_function(0.5f);\n\n}\n\n\n\ninline\n\nfloat in_out_elastic(float t)\n\n{\n\n\treturn in_out_elastic_function(t);\n\n}\n\n\n\ninline\n\nfloat in_back(float t)\n\n{\n\n\tfloat s = 1.70158f;\n\n\treturn t * t * ((s+1)*t - s);\n\n}\n\n\n\ninline\n\nfloat out_back(float t)\n\n{\n\n\tfloat s = 1.70158f;\n\n\tt -= 1;\n\n\treturn t*t*((s+1)*t+s) + 1;\n\n}\n\n\n\ninline\n\nfloat in_out_back(float t)\n\n{\n\n\tfloat s = 1.70158f;\n\n\tt *= 2;\n\n\tif (t < 1) {\n\n\t\ts *= 1.525f;\n\n\t\treturn 0.5f * (t * t * ((s+1)*t - s));\n\n\t} else {\n\n\t\tt -= 2;\n\n\t\ts *= 1.525f;\n\n\t\treturn 0.5f * (t*t*((s+1)*t+s) + 2);\n\n\t}\n\n}\n\n\n\ninline\n\nfloat out_bounce(float t)\n\n{\n\n\tif (t < 4/11.0f) {\n\n\t\treturn (121 * t * t) / 16.0f;\n\n\t} else if (t < 8/11.0f) {\n\n\t\treturn (363 / 40.0f * t * t) - (99 / 10.0f * t) + 17/5.0f;\n\n\t} else if (t < 9/10.0f) {\n\n\t\treturn (4356 / 361.0f * t * t) - (35442 / 1805.0f * t) + 16061/1805.0f;\n\n\t} else {\n\n\t\treturn (54 / 5.0f * t * t) - (513 / 25.0f * t) + 268/25.0f;\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_bounce(float t)\n\n{\n\n\treturn 1 - out_bounce(1-t);\n\n}\n\n\n\ninline\n\nfloat in_out_bounce(float t)\n\n{\n\n\tif (t < 0.5f) {\n\n\t\treturn in_bounce(2*t) * 0.5f;\n\n\t} else {\n\n\t\treturn out_bounce(2*t-1)*0.5f + 0.5f;\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_square(float t)\n\n{\n\n\tif (t < 1) {\n\n\t\treturn 0;\n\n\t} else {\n\n\t\treturn 1;\n\n\t}\n\n}\n\n\n\ninline\n\nfloat out_square(float t)\n\n{\n\n\tif (t > 0) {\n\n\t\treturn 1;\n\n\t} else {\n\n\t\treturn 0;\n\n\t}\n\n}\n\n\n\ninline\n\nfloat in_out_square(float t)\n\n{\n\n\tif (t < 0.5f) {\n\n\t\treturn 0;\n\n\t} else {\n\n\t\treturn 1;\n\n\t}\n\n}\n\n\n","file_path":"SM_Ease.h","rank":37,"score":29005.409210771355},{"content":"namespace sm\n\n{\n\n\n\nvoid douglas_peucker(const std::vector<vec2>& line,\n\n\t\t\t\t\t float precision,\n\n\t\t\t\t\t std::vector<vec2>& dst);\n\n\n","file_path":"SM_DouglasPeucker.h","rank":38,"score":28893.595509987532},{"content":"namespace sm\n\n{\n\n\n\nvoid convex_hull(const std::vector<vec2>& points,\n\n\t\t\t\t std::vector<vec2>& convex_hull);\n\n\n","file_path":"SM_ConvexHull.h","rank":39,"score":28893.595509987532},{"content":"namespace sm\n\n{\n\n\n\nvoid cosine_smooth(const std::vector<vec2>& src,\n\n\t\t\t\t float sampling_width,\n\n\t\t\t\t std::vector<vec2>& dst);\n\n\n","file_path":"SM_CosineSmooth.h","rank":40,"score":28893.595509987532},{"content":"struct sm_vec2* sm_vec2_normalize(struct sm_vec2* v)\n\n{\n\n\t((vec2*)v)->Normalize();\n\n\treturn v;\n\n}\n\n\n\nextern \"C\"\n","file_path":"sm_c_vector.cpp","rank":41,"score":5252.6894885384},{"content":"\tfloat x, y, z, w;\n","file_path":"sm_c_vector.h","rank":42,"score":4970.711533571934},{"content":"*/\n\nfloat get_polygon_perimeter(const std::vector<sm::vec2>& poly);\n\n\n\n/**\n\n* @brief\n\n* Get the cross point of three planes.\n\n*/\n\nbool intersect_planes(const Plane& p0, const Plane& p1, const Plane& p2, vec3* cross);\n\n\n\nsm::vec3 calc_plane_mirror(const Plane& plane, const sm::vec3& pos);\n\n\n\n}\n\n\n\n#include \"SM_Calc.inl\"\n\n\n\n#endif // _SPATIAL_MATH_CALC_H_","file_path":"SM_Calc.h","rank":43,"score":4511.767917447597},{"content":"float dis_pos3_to_pos3(const vec3& v0, const vec3& v1);\n\nfloat dis_square_pos3_to_pos3(const vec3& v0, const vec3& v1);\n\nfloat distance_aabb(const vec3& pos, const vec3& aabb_min, const vec3& aabb_max);\n\n\n\n/**\n\n * @brief\n\n * Get the cross point of two segment.\n\n * If they are not crossed, direct return false withnot compute the cross point.\n\n */\n\nbool intersect_line_line(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1, vec2* cross);\n\nbool intersect_segment_segment(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1, vec2* cross);\n\n\n\n/**\n\n * @brief\n\n * Get the foot of out at line(s, e).\n\n * Is return -1 the foot is outside the line(s, e), return 0 the foot on the line(s, e).\n\n */\n\nint get_foot_of_perpendicular(const vec2& s, const vec2& e, const vec2& out, vec2* foot);\n\nint get_foot_of_perpendicular(const vec3& s, const vec3& e, const vec3& out, vec3* foot);\n\n\n","file_path":"SM_Calc.h","rank":44,"score":4510.130204144008},{"content":"bool is_acute_angle(const vec2& a, const vec2& center, const vec2& b);\n\n\n\n/**\n\n * @brief\n\n * To check angle a-center-b turn left or right.\n\n */\n\nbool is_turn_left(const vec2& a, const vec2& center, const vec2& b);\n\nbool is_turn_right(const vec2& a, const vec2& center, const vec2& b);\n\n\n\n/**\n\n * @brief\n\n * distance position to ...\n\n */\n\nfloat dis_pos_to_pos(const vec2& v0, const vec2& v1);\n\nfloat dis_square_pos_to_pos(const vec2& v0, const vec2& v1);\n\nfloat dis_pos_to_multi_pos(const vec2& pos, const std::vector<vec2>& multi_pos, int* nearest_idx = NULL);\n\nfloat dis_pos_to_seg(const vec2& v, const vec2& s0, const vec2& s1);\n\nfloat dis_pos_to_polyline(const vec2& pos, const std::vector<vec2>& polyline, int* nearest_idx = NULL);\n\nfloat dis_pos_to_polygon(const vec2& pos, const std::vector<vec2>& polygon, int* nearest_idx = NULL);\n\n\n","file_path":"SM_Calc.h","rank":45,"score":4505.934705035493},{"content":"/**\n\n * @brief\n\n * triangle\n\n */\n\nvec2 get_tri_gravity_center(const vec2& p0, const vec2& p1, const vec2& p2);\n\n\n\n/**\n\n* @brief\n\n* area\n\n*/\n\nfloat get_polygon_area(const std::vector<sm::vec2>& polygon);\n\nfloat get_polygon_area(const std::vector<sm::vec3>& polygon);\n\nfloat get_triangle_area(const sm::vec2& p0, const sm::vec2& p1, const sm::vec2& p2);\n\n\n\nsm::vec3 calc_unit_normal(const sm::vec3& a, const sm::vec3& b, const sm::vec3& c);\n\nsm::vec3 calc_face_normal(const std::vector<sm::vec3>& polygon);\n\n\n\n/**\n\n* @brief\n\n* perimeter\n","file_path":"SM_Calc.h","rank":46,"score":4503.704845433337},{"content":"\tT Dot(const Vector4& v) const;\n\n\n\n}; // Vector4\n\n\n\ntypedef Vector2<bool> bvec2;\n\ntypedef Vector3<bool> bvec3;\n\ntypedef Vector4<bool> bvec4;\n\n\n\ntypedef Vector2<uint16_t> i16_vec2;\n\ntypedef Vector3<uint16_t> i16_vec3;\n\ntypedef Vector4<uint16_t> i16_vec4;\n\n\n\ntypedef Vector2<int> ivec2;\n\ntypedef Vector3<int> ivec3;\n\ntypedef Vector4<int> ivec4;\n\n\n\ntypedef Vector2<float> vec2;\n\ntypedef Vector3<float> vec3;\n\ntypedef Vector4<float> vec4;\n\n\n\n}\n\n\n\n#include \"SM_Vector.inl\"\n\n\n\n#endif // _SPATIAL_MATH_VECTOR_H_\n","file_path":"SM_Vector.h","rank":47,"score":4502.4674948716365},{"content":"#ifndef _SPATIAL_MATH_CALC_H_\n\n#define _SPATIAL_MATH_CALC_H_\n\n\n\n#include \"SM_Vector.h\"\n\n#include \"SM_Plane.h\"\n\n\n\n#include <vector>\n\n\n\nnamespace sm\n\n{\n\n\n","file_path":"SM_Calc.h","rank":48,"score":4501.388998164068},{"content":"#ifndef _SPATIAL_MATH_MATRIX_H_\n\n#define _SPATIAL_MATH_MATRIX_H_\n\n\n\n#include \"SM_Vector.h\"\n\n#include \"SM_Quaternion.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\n/**\n\n * @brief\n\n * matrix2\n\n */\n\ntemplate <typename T>\n","file_path":"SM_Matrix.h","rank":49,"score":4500.6326890933},{"content":"\tbool IsValid() const;\n\n\n\n\tbool Combine(const Vector2<T>& v);\n\n\tbool Combine(const Rect<T>& r);\n\n\n\n\tT Width() const;\n\n\tT Height() const;\n\n\tVector2<T> Size() const;\n\n\tVector2<T> Center() const;\n\n\n\n\tvoid Translate(const Vector2<T>& trans);\n\n\tvoid Scale(const Vector2<T>& scale);\n\n\tvoid Shear(const Vector2<T>& shear);\n\n\n\n}; // Rect\n\n\n\ntypedef Rect<int> irect;\n\ntypedef Rect<int16_t> i16_rect;\n\n\n\ntypedef Rect<float> rect;\n\n\n\n}\n\n\n\n#include \"SM_Rect.inl\"\n\n\n\n#endif // _SPATIAL_MATH_RECT_H_","file_path":"SM_Rect.h","rank":50,"score":4500.565969793508},{"content":"#ifndef _SPATIAL_MATH_VECTOR_H_\n\n#define _SPATIAL_MATH_VECTOR_H_\n\n\n\n#include <float.h>\n\n#include <stdint.h>\n\n\n\nnamespace sm\n\n{\n\n\n\n/**\n\n * @brief\n\n * vector2\n\n */\n\ntemplate <typename T>\n","file_path":"SM_Vector.h","rank":51,"score":4499.528333776571},{"content":"#ifndef _SPATIAL_MATH_PROCESS_H_\n\n#define _SPATIAL_MATH_PROCESS_H_\n\n\n\n#include \"SM_Vector.h\"\n\n\n\n#include <vector>\n\n\n\nnamespace sm\n\n{\n\n\n","file_path":"SM_Process.h","rank":52,"score":4498.31268876575},{"content":"#ifndef _SPATIAL_MATH_RECT_H_\n\n#define _SPATIAL_MATH_RECT_H_\n\n\n\n#include \"SM_Vector.h\"\n\n\n\n#include <stdint.h>\n\n\n\nnamespace sm\n\n{\n\n\n\ntemplate <typename T>\n","file_path":"SM_Rect.h","rank":53,"score":4497.990179156728},{"content":"\tVector3<T> GetTranslate() const;\n\n\tVector3<T> GetScale() const;\n\n\tvoid Decompose(Vector3<T>& trans, Vector3<T>& rot, Vector3<T>& scale) const;\n\n\n\n\tstatic Matrix4<T> Translated(T x, T y, T z);\n\n\tstatic Matrix4<T> Scaled(T x, T y, T z);\n\n\tstatic Matrix4<T> Rotated(T x, T y, T z);\n\n\tstatic Matrix4<T> RotatedX(T degrees);\n\n\tstatic Matrix4<T> RotatedY(T degrees);\n\n\tstatic Matrix4<T> RotatedZ(T degrees);\n\n\tstatic Matrix4<T> RotatedAxis(const Vector3<T>& axis, T angle);\n\n\tstatic Matrix4<T> Sheared(T kx, T ky);\n\n\tstatic Matrix4<T> SkewY(T sx, T sz);\n\n\n\n\tstatic Matrix4<T> Perspective(T fovy, T aspect, T znear, T zfar);\n\n\tstatic Matrix4<T> Orthographic(T left, T right, T bottom, T top, T znear, T zfar);\n\n static Matrix4<T> LookAt(const Vector3<T>& eye, const Vector3<T>& center, const Vector3<T>& up);\n\n\n\n}; // Matrix4\n\n\n\ntypedef Matrix2<float> mat2;\n\ntypedef Matrix3<float> mat3;\n\ntypedef Matrix4<float> mat4;\n\n\n\n}\n\n\n\n#include \"SM_Matrix.inl\"\n\n\n\n#endif // _SPATIAL_MATH_MATRIX_H_","file_path":"SM_Matrix.h","rank":54,"score":4497.896384758305},{"content":"\t* @param sx Scale along x-axis.\n\n\t* @param sy Scale along y-axis.\n\n\t* @param ox The offset for rotation along the x-axis.\n\n\t* @param oy The offset for rotation along the y-axis.\n\n\t* @param kx Shear along x-axis\n\n\t* @param ky Shear along y-axis\n\n\t**/\n\n\tvoid SetTransformation(T x, T y, T angle, T sx, T sy, T ox, T oy, T kx, T ky);\n\n\n\n\tvoid SetTransformation(const Vector3<T>& scale, const Vector3<T>& rotation_origin,\n\n\t\tconst Vector4<T>& rotation_quaternion, const Vector3<T>& translation);\n\n\n\n\tMatrix4<T> FastMul43(const Matrix4<T>& b);\n\n\n\n Matrix4<T> Transposed() const;\n\n\tT Determinant() const;\n\n\tMatrix4<T> Inverted() const;\n\n\n\n\tQuaternionT<T> ToQuaternion() const;\n\n\n","file_path":"SM_Matrix.h","rank":55,"score":4495.265115354299},{"content":"\tbool operator == (const Matrix4<T>& b) const;\n\n\tbool operator != (const Matrix4<T>& b) const;\n\n\n\n Matrix4<T> operator * (const Matrix4<T>& b) const;\n\n\n\n\tVector2<T> operator * (const Vector2<T>& v) const;\n\n\tVector3<T> operator * (const Vector3<T>& v) const;\n\n\tVector4<T> operator * (const Vector4<T>& v) const;\n\n\n\n\tvoid Identity();\n\n\n\n\tvoid Translate(T x, T y, T z);\n\n\tvoid Scale(T x, T y, T z);\n\n\tvoid Shear(T kx, T ky);\n\n\tvoid RotateZ(T degrees);\n\n\n\n\t/**\n\n\t* @param x The translation along the x-axis.\n\n\t* @param y The translation along the y-axis.\n\n\t* @param angle The rotation (rad) around the center with offset (ox,oy).\n","file_path":"SM_Matrix.h","rank":56,"score":4494.053861959175},{"content":"\n\n\tT operator[](size_t i) const;\n\n\tT& operator[](size_t i);\n\n\n\n\tVector3& operator = (const Vector3& v);\n\n\tvoid Set(T x, T y, T z);\n\n\n\n\tvoid MakeInvalid();\n\n\tbool IsValid() const;\n\n\n\n\tbool operator == (const Vector3& v) const;\n\n\tbool operator != (const Vector3& v) const;\n\n\n\n bool operator < (const Vector3& v) const;\n\n bool operator > (const Vector3& v) const;\n\n\n\n\tVector3 operator - () const;\n\n\n\n\tvoid operator += (const Vector3& v);\n\n\tvoid operator -= (const Vector3& v);\n","file_path":"SM_Vector.h","rank":57,"score":4492.452281913595},{"content":"\tvoid Set(T x, T y);\n\n\n\n\tvoid MakeInvalid();\n\n\tbool IsValid() const;\n\n\n\n\tbool operator == (const Vector2& v) const;\n\n\tbool operator != (const Vector2& v) const;\n\n\n\n bool operator < (const Vector2& v) const;\n\n\n\n\tVector2<T> operator - () const;\n\n\n\n\tvoid operator += (const Vector2& v);\n\n\tvoid operator -= (const Vector2& v);\n\n\tvoid operator *= (const Vector2& v);\n\n\tvoid operator /= (const Vector2& v);\n\n\tvoid operator *= (T f);\n\n\tvoid operator /= (T f);\n\n\n\n\tVector2 operator + (const Vector2& v) const;\n","file_path":"SM_Vector.h","rank":58,"score":4492.209250656513},{"content":"\n\n\tT operator[](size_t i) const;\n\n\tT& operator[](size_t i);\n\n\n\n\tVector4& operator = (const Vector4& v);\n\n\tvoid Assign(T x, T y, T z, T w);\n\n\n\n\tbool operator == (const Vector4& v) const;\n\n\tbool operator != (const Vector4& v) const;\n\n\n\n\tvoid operator += (const Vector4& v);\n\n\tvoid operator -= (const Vector4& v);\n\n\tvoid operator *= (T f);\n\n\tvoid operator /= (T f);\n\n\n\n\tVector4 operator + (const Vector4& v) const;\n\n\tVector4 operator - (const Vector4& v) const;\n\n\tVector4 operator * (T f) const;\n\n\tVector4 operator / (T f) const;\n\n\n","file_path":"SM_Vector.h","rank":59,"score":4491.416992807099},{"content":"\tVector2 operator - (const Vector2& v) const;\n\n\tVector2 operator * (const Vector2& v) const;\n\n\tVector2 operator / (const Vector2& v) const;\n\n\tVector2 operator * (T f) const;\n\n\tVector2 operator / (T f) const;\n\n\n\n\tT Length() const;\n\n\tT LengthSquared() const;\n\n\tvoid Normalize();\n\n\tVector2 Normalized() const;\n\n\n\n\tT Cross(const Vector2& v) const;\n\n\tT Dot(const Vector2& v) const;\n\n\n\n}; // Vector2\n\n\n","file_path":"SM_Vector.h","rank":60,"score":4490.992019877361},{"content":"\tvoid operator *= (T f);\n\n\tvoid operator /= (T f);\n\n\n\n\tVector3 operator + (const Vector3& v) const;\n\n\tVector3 operator - (const Vector3& v) const;\n\n Vector3 operator * (const Vector3& v) const;\n\n\tVector3 operator * (T f) const;\n\n\tVector3 operator / (T f) const;\n\n\n\n\tT Length() const;\n\n\tT LengthSquared() const;\n\n\tvoid Normalize();\n\n\tVector3 Normalized() const;\n\n\n\n\tVector3 Cross(const Vector3& v) const;\n\n\tT Dot(const Vector3& v) const;\n\n\n\n}; // Vector3\n\n\n","file_path":"SM_Vector.h","rank":61,"score":4490.832724495314},{"content":"#include \"SM_Calc.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\nsm::vec3 calc_plane_mirror(const Plane& plane, const sm::vec3& pos)\n\n{\n\n\tfloat len_s = plane.normal.LengthSquared();\n\n\tauto v1 = pos;\n\n\tfloat k = (-plane.normal.Dot(v1) - plane.dist) / len_s;\n\n\tauto v2 = plane.normal * k + v1;\n\n\treturn v2 * 2 - v1;\n\n}\n\n\n\n}","file_path":"SM_Calc.cpp","rank":62,"score":4290.698852654579},{"content":"#include \"SM_Calc.h\"\n\n#include \"SM_Vector.h\"\n\n#include \"sm_c_vector.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\nextern \"C\"\n\nvoid sm_rotate_vector_right_angle(const struct sm_vec2* v, bool turn_left, struct sm_vec2* ret)\n\n{\n\n\tvec2 r = rotate_vector_right_angle(*(vec2*)v, turn_left);\n\n\tret->x = r.x;\n\n\tret->y = r.y;\n\n}\n\n\n\nextern \"C\"\n\nfloat sm_get_line_angle(struct sm_vec2* s, struct sm_vec2* e)\n\n{\n\n\treturn get_line_angle(*(vec2*)s, *(vec2*)e);\n\n}\n","file_path":"sm_c_calc.cpp","rank":63,"score":4282.509793156569},{"content":"\t\t}\n\n\t\tidx0 = next_idx0;\n\n\t}\n\n\n\n\treturn true;\n\n}\n\n\n\n//bool is_polygon_clockwise(const std::vector<vec2>& poly)\n\n//{\n\n// float cross_sum = 0.0f;\n\n// for (size_t i = 0, n = poly.size(); i < n; ++i)\n\n// {\n\n// auto& p0 = poly[i];\n\n// auto& p1 = poly[(i + 1) % n];\n\n// auto& p2 = poly[(i + 2) % n];\n\n// cross_sum += (p1 - p0).Cross(p2 - p1);\n\n// }\n\n// return cross_sum < 0;\n\n//}\n\n\n","file_path":"SM_Test.cpp","rank":64,"score":4281.650977946331},{"content":"#include \"SM_Test.h\"\n\n#include \"SM_Calc.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\nbool is_rect_intersect_segment(const rect& r, const vec2& s, const vec2& e)\n\n{\n\n\tunsigned char type_s, type_e;\n\n\ttype_s = type_e = 0;\n\n\tif (s.x < r.xmin) // left: 1000\n\n\t\ttype_s |= 0x8;\n\n\telse if (s.x > r.xmax) // right: 0100\n\n\t\ttype_s |= 0x4;\n\n\tif (s.y < r.ymin) // down: 0001\n\n\t\ttype_s |= 0x1;\n\n\telse if (s.y > r.ymax) // up: 0010\n\n\t\ttype_s |= 0x2;\n\n\n\n\tif (e.x < r.xmin) // left: 1000\n","file_path":"SM_Test.cpp","rank":65,"score":4280.575312387531},{"content":" }\n\n\n\n size_t n_positive = 0, n_negative = 0;\n\n for (size_t i = 0, n = poly.size(); i < n; ++i)\n\n {\n\n auto& p0 = poly[(i + n - 1) % n];\n\n auto& p1 = poly[i];\n\n auto& p2 = poly[(i + 1) % n];\n\n auto cross = (p1 - p0).Cross(p2 - p1);\n\n if (cross > 0) {\n\n ++n_positive;\n\n } else if (cross < 0) {\n\n ++n_positive;\n\n }\n\n }\n\n return n_positive == 0 || n_negative == 0;\n\n}\n\n\n\nbool is_polygon_in_polygon(const std::vector<vec2>& in, const std::vector<vec2>& out)\n\n{\n","file_path":"SM_Test.cpp","rank":66,"score":4277.589118438845},{"content":"\t\t\t\tfloat angle = get_angle(start, end, start_prev);\n\n\t\t\t\tif (angle > get_angle(start, end, e) ||\n\n\t\t\t\t\tangle > get_angle(start, end, s)) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t} else if (is_two_points_same(end, cross)) {\n\n\t\t\t\tconst vec2& end_next = poly[get_next_idx_in_ring(sz, end_idx, 1)];\n\n\t\t\t\tfloat angle = get_angle(end, end_next, start);\n\n\t\t\t\tif (angle > get_angle(end, end_next, e) ||\n\n\t\t\t\t\tangle > get_angle(end, end_next, s)) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\n\n\t\t\t} else {\n\n\t\t\t\treturn true;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\treturn false;\n","file_path":"SM_Test.cpp","rank":67,"score":4277.584787873817},{"content":"static inline\n\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1, const vec2& v0, const vec2& v1)\n\n{\n\n\tfloat angle = SM_PI * 0.5f - atan2(v1.y - v0.y, v1.x - v0.x);\n\n\treturn is_convex_intersect_convex(c0, c1, angle);\n\n}\n\n\n\nstatic inline\n\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1, const std::vector<vec2>& proj)\n\n{\n\n\tfor (int i = 0, n = c0.size() - 1; i < n; ++i) {\n\n\t\tif (!is_convex_intersect_convex(c0, c1, proj[i], proj[i+1])) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t}\n\n\tif (!is_convex_intersect_convex(c0, c1, proj[c0.size() - 1], proj[0])) {\n\n\t\treturn false;\n\n\t}\n\n\treturn true;\n\n}\n","file_path":"SM_Test.cpp","rank":68,"score":4277.434580182571},{"content":"\t\ttype_e |= 0x8;\n\n\telse if (e.x > r.xmax) // right: 0100\n\n\t\ttype_e |= 0x4;\n\n\tif (e.y < r.ymin) // down: 0001\n\n\t\ttype_e |= 0x1;\n\n\telse if (e.y > r.ymax) // up: 0010\n\n\t\ttype_e |= 0x2;\n\n\n\n\tunsigned char comp;\n\n\tcomp = type_s & type_e;\n\n\tif (comp != 0)\t\t// must be outside, so must intersect\n\n\t\treturn false;\n\n\tcomp = type_s | type_e;\n\n\tif (comp == 0)\t\t// must be inside, so must not intersect\n\n\t\treturn true;\n\n\n\n\t// test each edge\n\n\tif (comp & 0x8)\t\t// 1000, left edge\n\n\t{\n\n\t\tfloat cross_y;\n","file_path":"SM_Test.cpp","rank":69,"score":4277.016277704861},{"content":"#include \"SM_Matrix.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\nextern \"C\"\n\nunion sm_mat4* sm_mat4_mul(union sm_mat4* m, const union sm_mat4* m1, const union sm_mat4* m2)\n\n{\n\n\t*(mat4*)m = (*(mat4*)m1) * (*(mat4*)m2);\n\n\treturn m;\n\n}\n\n\n\nextern \"C\"\n\nunion sm_mat4* sm_mat4_rotxmat(union sm_mat4* m, float degrees)\n\n{\n\n\t*(mat4*)m = ((mat4*)m)->RotatedX(degrees);\n\n\treturn m;\n\n}\n\n\n\nextern \"C\"\n","file_path":"sm_c_matrix.cpp","rank":70,"score":4275.590584440552},{"content":"{\n\n\treturn (curr + sz + step) % sz;\n\n}\n\n\n\nstatic inline\n\nbool is_two_points_same(const vec2& p0, const vec2& p1)\n\n{\n\n\treturn fabs(p0.x - p1.x) < SM_LARGE_EPSILON\n\n\t\t&& fabs(p0.y - p1.y) < SM_LARGE_EPSILON;\n\n}\n\n\n\nbool is_segment_intersect_polyline(const vec2& s, const vec2& e, const std::vector<vec2>& poly)\n\n{\n\n\tif (poly.size() < 2) {\n\n\t\treturn false;\n\n\t} else if (poly.size() < 3) {\n\n\t\tvec2 cross;\n\n\t\tif (intersect_segment_segment(s, e, poly[0], poly[1], &cross)) {\n\n\t\t\tif (!is_two_points_same(s, cross) && !is_two_points_same(e, cross) &&\n\n\t\t\t\t!is_two_points_same(poly[0], cross) && !is_two_points_same(poly[1], cross)) {\n","file_path":"SM_Test.cpp","rank":71,"score":4275.531084272151},{"content":"\t\tfloat cross_x;\n\n\t\tcross_x = find_x_on_seg(s, e, r.ymax);\n\n\t\tif (cross_x >= r.xmin && cross_x <= r.xmax)\n\n\t\t\treturn true;\n\n\t}\n\n\n\n\treturn false;\n\n}\n\n\n\nstatic inline\n\nvoid project_convex(const std::vector<vec2>& c, float angle, float* min, float* max)\n\n{\n\n\t*min = FLT_MAX;\n\n\t*max = -FLT_MAX;\n\n\tfor (int i = 0, n = c.size(); i < n; ++i) {\n\n\t\tvec2 v = rotate_vector(c[i], angle);\n\n\t\tif (v.x < *min) {\n\n\t\t\t*min = v.x;\n\n\t\t}\n\n\t\tif (v.x > *max) {\n","file_path":"SM_Test.cpp","rank":72,"score":4275.402879893704},{"content":"\n\nextern \"C\"\n\nbool sm_intersect_line_line(const struct sm_vec2* s0, const struct sm_vec2* e0, const struct sm_vec2* s1, const struct sm_vec2* e1, struct sm_vec2* cross)\n\n{\n\n\tvec2 _cross;\n\n\tbool ret = intersect_line_line(*(vec2*)s0, *(vec2*)e0, *(vec2*)s1, *(vec2*)e1, &_cross);\n\n\tcross->x = _cross.x;\n\n\tcross->y = _cross.y;\n\n\treturn ret;\n\n}\n\n\n\n}","file_path":"sm_c_calc.cpp","rank":73,"score":4275.0999772166},{"content":"\t\tcross_y = find_y_on_seg(s, e, r.xmin);\n\n\t\tif (cross_y >= r.ymin && cross_y <= r.ymax)\n\n\t\t\treturn true;\n\n\t}\n\n\tif (comp & 0x4)\t\t// 0100, right edge\n\n\t{\n\n\t\tfloat cross_y;\n\n\t\tcross_y = find_y_on_seg(s, e, r.xmax);\n\n\t\tif (cross_y >= r.ymin && cross_y <= r.ymax)\n\n\t\t\treturn true;\n\n\t}\n\n\tif (comp & 0x1)\t\t// 0001, down edge\n\n\t{\n\n\t\tfloat cross_x;\n\n\t\tcross_x = find_x_on_seg(s, e, r.ymin);\n\n\t\tif (cross_x >= r.xmin && cross_x <= r.xmax)\n\n\t\t\treturn true;\n\n\t}\n\n\tif (comp & 0x2)\t\t// 0010, up edge\n\n\t{\n","file_path":"SM_Test.cpp","rank":74,"score":4273.9713495408405},{"content":"\n\n\tvoid Identity();\n\n\n\n\tMatrixFix Inverted() const;\n\n\n\n\tvoid Translate(float x, float y);\n\n\tvoid Scale(float sx, float sy);\n\n\tvoid Rotate(float angle);\n\n\n\n\tvoid SetTransformation(float x, float y, float angle, float sx, float sy, float ox, float oy, float kx, float ky);\n\n\t\n\n}; // MatrixFix\n\n\n\n}\n\n\n\n#include \"SM_MatrixFix.inl\"\n\n\n\n#endif // _SPATIAL_MATH_FIX_MATH_H_","file_path":"SM_MatrixFix.h","rank":75,"score":4273.858935469699},{"content":"\t\t\t\t\treturn true;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn false;\n\n\t}\n\n\n\n\tint sz = poly.size();\n\n\tfor (int i = 0; i < sz; ++i)\n\n\t{\n\n\t\tconst vec2& start = poly[i];\n\n\t\tint end_idx = get_next_idx_in_ring(sz, i, 1);\n\n\t\tconst vec2& end = poly[end_idx];\n\n\t\tvec2 cross;\n\n\t\tif (intersect_segment_segment(s, e, start, end, &cross)) {\n\n\t\t\tif (is_two_points_same(s, cross) || is_two_points_same(e, cross)) {\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n\n\n\n\t\t\tif (is_two_points_same(start, cross)) {\n\n\t\t\t\tconst vec2& start_prev = poly[get_next_idx_in_ring(sz, i, -1)];\n","file_path":"SM_Test.cpp","rank":76,"score":4273.789608013801},{"content":"union sm_mat4* sm_mat4_identity(union sm_mat4* m)\n\n{\n\n\t((mat4*)m)->Identity();\n\n\treturn m;\n\n}\n\n\n\nextern \"C\"\n\nunion sm_mat4* sm_mat4_trans(union sm_mat4* m, float x, float y, float z)\n\n{\n\n\t((mat4*)m)->Translate(x, y, z);\n\n\treturn m;\n\n}\n\n\n\nextern \"C\"\n\nunion sm_mat4* sm_mat4_perspective(union sm_mat4* m, float fovy, float aspect, float znear, float zfar)\n\n{\n\n\t*(mat4*)m = ((mat4*)m)->Perspective(fovy, aspect, znear, zfar);\n\n\treturn m;\n\n}\n\n\n\nextern \"C\"\n","file_path":"sm_c_matrix.cpp","rank":77,"score":4273.708481889627},{"content":"\t\t\tconst vec2& start1 = poly1[idx1];\n\n\t\t\tint next_idx1 = get_next_idx_in_ring(sz1, idx1, step1);\n\n\t\t\tconst vec2& end1 = poly1[next_idx1];\n\n\n\n\t\t\tvec2 cross;\n\n\t\t\tif (intersect_segment_segment(start0, end0, start1, end1, &cross)) {\n\n\t\t\t\t// test if cross is end\n\n\t\t\t\tbool is_cross0 = is_two_points_same(cross, end0),\n\n\t\t\t\t\t is_cross1 = is_two_points_same(cross, end1);\n\n\t\t\t\tif (is_cross0 && is_cross1) {\n\n\t\t\t\t\tconst vec2& end_next0 = poly0[get_next_idx_in_ring(sz0, next_idx0, step0)];\n\n\t\t\t\t\tconst vec2& end_next1 = poly1[get_next_idx_in_ring(sz1, next_idx1, step1)];\n\n\t\t\t\t\tfloat angle0 = get_angle(end0, end_next0, start0);\n\n\t\t\t\t\tif (angle0 > get_angle(end0, end_next0, start1) ||\n\n\t\t\t\t\t\tangle0 > get_angle(end0, end_next0, end_next1)) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tfloat angle1 = get_angle(end1, end_next1, start1);\n\n\t\t\t\t\tif (angle1 > get_angle(end1, end_next1, start0) ||\n\n\t\t\t\t\t\tangle1 > get_angle(end1, end_next1, end_next0)) {\n","file_path":"SM_Test.cpp","rank":78,"score":4273.610172782884},{"content":"bool is_polygon_clockwise(const std::vector<vec2>& poly)\n\n{\n\n float sum = 0.0f;\n\n for (size_t i = 0, n = poly.size(); i < n; ++i)\n\n {\n\n auto& p0 = poly[i];\n\n auto& p1 = poly[(i + 1) % n];\n\n sum += (p1.x - p0.x) * (p1.y + p0.y);\n\n }\n\n return sum > 0;\n\n}\n\n\n\n}","file_path":"SM_Test.cpp","rank":79,"score":4273.607846401534},{"content":"\tvoid Scale(float sx, float sy);\n\n\tvoid Rotate(float angle);\n\n\tvoid Translate(float x, float y);\n\n\n\n\tvoid SetTransformation(float x, float y, float angle, float sx, float sy, float ox, float oy, float kx, float ky);\n\n\n\n\tvoid Decompose(sm::vec2& scale, float& rotate, sm::vec2& translate) const;\n\n\n\n\tstatic void Mul(const Matrix2D& m0, const Matrix2D& m1, Matrix2D& out);\n\n\n\n}; // Matrix2D\n\n\n\n#define SM_MAT2D_MUL(m0, m1, out) \\\n\n\tout[0] = m0[0] * m1[0] + m0[1] * m1[2]; \\\n\n\tout[1] = m0[0] * m1[1] + m0[1] * m1[3]; \\\n\n\tout[2] = m0[2] * m1[0] + m0[3] * m1[2]; \\\n\n\tout[3] = m0[2] * m1[1] + m0[3] * m1[3]; \\\n\n\tout[4] = m0[4] * m1[0] + m0[5] * m1[2] + m1[4]; \\\n\n\tout[5] = m0[4] * m1[1] + m0[5] * m1[3] + m1[5]; \\\n\n\n\n}\n\n\n\n#include \"SM_Matrix2D.inl\"\n\n\n\n#endif // _SPATIAL_MATH_MATRIX_2D_H_","file_path":"SM_Matrix2D.h","rank":80,"score":4273.349604494869},{"content":"\n\n\tfloat left = FLT_MAX;\n\n\tint left_idx = 0;\n\n\tint sz = poly.size();\n\n\tfor (int i = 0; i < sz; ++i) {\n\n\t\tif (poly[i].x < left) {\n\n\t\t\tleft = poly[i].x;\n\n\t\t\tleft_idx = i;\n\n\t\t}\n\n\t}\n\n\n\n\tconst vec2& curr = poly[left_idx];\n\n\tconst vec2& next = poly[(left_idx+1)%sz];\n\n\tconst vec2& prev = poly[(left_idx+sz-1)%sz];\n\n\tvec2 up(curr.x, curr.y + 1);\n\n\treturn get_angle(curr, up, next) < get_angle(curr, up, prev);\n\n}\n\n\n\nstatic inline\n\nint get_next_idx_in_ring(int sz, int curr, int step)\n","file_path":"SM_Test.cpp","rank":81,"score":4273.313105672091},{"content":"\t\tconst vec2& start0 = in[idx0];\n\n\t\tint next_idx0 = get_next_idx_in_ring(sz0, idx0, step0);\n\n\t\tconst vec2& end0 = in[next_idx0];\n\n\t\tfor (int j = 0; j < sz1; ++j) {\n\n\t\t\tconst vec2& start1 = out[idx1];\n\n\t\t\tint next_idx1 = get_next_idx_in_ring(sz1, idx1, step1);\n\n\t\t\tconst vec2& end1 = out[next_idx1];\n\n\n\n\t\t\tvec2 cross;\n\n\t\t\tif (intersect_segment_segment(start0, end0, start1, end1, &cross)) {\n\n\t\t\t\t// test if cross is end\n\n\t\t\t\tbool is_cross0 = is_two_points_same(cross, end0),\n\n\t\t\t\t\tis_cross1 = is_two_points_same(cross, end1);\n\n\t\t\t\tif (is_cross0 && is_cross1) {\n\n\t\t\t\t\tconst vec2& end_next0 = in[get_next_idx_in_ring(sz0, next_idx0, step0)];\n\n\t\t\t\t\tconst vec2& end_next1 = out[get_next_idx_in_ring(sz1, next_idx1, step1)];\n\n\t\t\t\t\tfloat angle0 = get_angle(end0, end_next0, start0);\n\n\n\n\t\t\t\t\tfloat angle_start1 = get_angle(end0, end_next0, start1),\n\n\t\t\t\t\t\tangle_end_next1 = get_angle(end0, end_next0, end_next1);\n","file_path":"SM_Test.cpp","rank":82,"score":4273.269045797124},{"content":"#include \"SM_Vector.h\"\n\n\n\nnamespace sm\n\n{\n\n\n\nextern \"C\"\n","file_path":"sm_c_vector.cpp","rank":83,"score":4272.050129353312},{"content":"#include \"SM_Triangulation.h\"\n\n#include \"SM_Calc.h\"\n\n#include \"SM_Test.h\"\n\n\n\n#include \"external/triangle/triangle.cpp\"\n\n\n\n#include <iterator>\n\n\n\n#include <assert.h>\n\n\n\nnamespace sm\n\n{\n\n\n\nstatic void init(struct triangulateio& in, struct triangulateio& out)\n\n{\n\n\tin.pointlist = NULL;\n\n\tin.pointattributelist = NULL;\n\n\tin.pointmarkerlist = NULL;\n\n\tin.trianglelist = NULL;\n\n\tin.triangleattributelist = NULL;\n","file_path":"SM_Triangulation.cpp","rank":84,"score":4271.479468050824},{"content":"#ifndef _SPATIAL_MATH_MATRIX_2D_H_\n\n#define _SPATIAL_MATH_MATRIX_2D_H_\n\n\n\n#include \"SM_Vector.h\"\n\n#include \"SM_Matrix.h\"\n\n\n\nnamespace sm\n\n{\n\n\n","file_path":"SM_Matrix2D.h","rank":85,"score":4271.4542170356435},{"content":"\t\t\t*max = v.x;\n\n\t\t}\n\n\t}\n\n}\n\n\n\nstatic inline\n\nbool is_project_intersect(float min0, float max0, float min1, float max1)\n\n{\n\n\treturn !(max1 <= min0 || min1 >= max0);\n\n}\n\n\n\nstatic inline\n\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1, float angle)\n\n{\n\n\tfloat min0, max0, min1, max1;\n\n\tproject_convex(c0, angle, &min0, &max0);\n\n\tproject_convex(c1, angle, &min1, &max1);\n\n\treturn is_project_intersect(min0, max0, min1, max1);\n\n}\n\n\n","file_path":"SM_Test.cpp","rank":86,"score":4270.720649442901},{"content":"\t\t\t\t\t// \t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t// \t\t\t\t\t}\n\n\t\t\t\t} else if (is_cross0) {\n\n\t\t\t\t\tconst vec2& end_next0 = poly0[get_next_idx_in_ring(sz0, next_idx0, step0)];\n\n\t\t\t\t\tif (is_turn_left(end_next0, end0, end1)) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else if (is_cross1) {\n\n\t\t\t\t\tconst vec2& end_next1 = poly0[get_next_idx_in_ring(sz1, next_idx1, step1)];\n\n\t\t\t\t\tif (is_turn_left(end_next1, end1, end0)) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else if (!is_two_points_same(cross, start0)\n\n\t\t\t\t\t&& !is_two_points_same(cross, start1)) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tidx1 = next_idx1;\n\n\t\t}\n\n\t\tidx0 = next_idx0;\n","file_path":"SM_Test.cpp","rank":87,"score":4270.667355884127},{"content":"#ifndef _SPATIAL_MATH_FIX_MATH_H_\n\n#define _SPATIAL_MATH_FIX_MATH_H_\n\n\n\n#include \"SM_Vector.h\"\n\n\n\nnamespace sm\n\n{\n\n\n","file_path":"SM_MatrixFix.h","rank":88,"score":4270.661742977758},{"content":"\t\t\t\t\tif ((angle0 > angle_start1 && angle_start1) != 0 ||\n\n\t\t\t\t\t\t(angle0 > angle_end_next1 && angle_end_next1 != 0)) {\n\n\t\t\t\t\t\t\treturn false;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else if (is_cross0) {\n\n\t\t\t\t\tconst vec2& end_next0 = in[get_next_idx_in_ring(sz0, next_idx0, step0)];\n\n\t\t\t\t\tif (is_turn_left(end_next0, end0, end1)) {\n\n\t\t\t\t\t\treturn false;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else if (is_cross1) {\n\n\t\t\t\t\tconst vec2& end_next1 = in[get_next_idx_in_ring(sz1, next_idx1, step1)];\n\n\t\t\t\t\tif (is_turn_left(end_next1, end1, end0)) {\n\n\t\t\t\t\t\treturn false;\n\n\t\t\t\t\t}\n\n\t\t\t\t} else if (!is_two_points_same(cross, start0)\n\n\t\t\t\t\t&& !is_two_points_same(cross, start1)) {\n\n\t\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tidx1 = next_idx1;\n","file_path":"SM_Test.cpp","rank":89,"score":4270.295255269406},{"content":"\t\tin.pointlist[ptr_p++] = p.x;\n\n\t\tin.pointlist[ptr_p++] = p.y;\n\n\t}\n\n for (auto& hole : holes_fixed) {\n\n for (auto& p : hole) {\n\n in.pointlist[ptr_p++] = p.x;\n\n in.pointlist[ptr_p++] = p.y;\n\n }\n\n }\n\n\n\n\tin.numberofsegments = in.numberofpoints;\n\n\tin.segmentlist = (int *) malloc(in.numberofsegments * 2 * sizeof(int));\n\n\tsize_t ptr_s = 0;\n\n size_t start_p_idx = 0;\n\n size_t curr_p_idx = 0;\n\n\tfor (size_t i = 0; i < bound_fixed.size() - 1; ++i)\n\n {\n\n\t\tin.segmentlist[ptr_s++] = curr_p_idx;\n\n\t\tin.segmentlist[ptr_s++] = curr_p_idx + 1;\n\n ++curr_p_idx;\n","file_path":"SM_Triangulation.cpp","rank":90,"score":4269.201959248575},{"content":"\t\tif (is_point_in_area(center, bound))\n\n {\n\n bool in_hole = false;\n\n for (auto& hole : holes)\n\n {\n\n if (is_point_in_area(center, hole)) {\n\n in_hole = true;\n\n break;\n\n }\n\n }\n\n\n\n if (!in_hole) {\n\n copy(tri.begin(), tri.end(), back_inserter(result));\n\n }\n\n\t\t}\n\n\t}\n\n\n\n\tfinish(in, out);\n\n}\n\n\n","file_path":"SM_Triangulation.cpp","rank":91,"score":4269.009487008918},{"content":"\t}\n\n\n\n\tfor (int i = 0; i < sz0; ++i) {\n\n\t\tif (is_point_intersect_polyline(poly0[i], poly1)) { continue; }\n\n\t\treturn is_point_in_area(poly0[i], poly1);\n\n\t}\n\n\tfor (int i = 0; i < sz1; ++i) {\n\n\t\tif (is_point_intersect_polyline(poly1[i], poly0)) { continue; }\n\n\t\treturn is_point_in_area(poly1[i], poly0);\n\n\t}\n\n\treturn false;\n\n}\n\n\n\nbool is_polygon_convex(const std::vector<vec2>& poly)\n\n{\n\n if (poly.size() < 2) {\n\n return false;\n\n }\n\n if (poly.size() == 3) {\n\n return true;\n","file_path":"SM_Test.cpp","rank":92,"score":4268.625797210231},{"content":"\t\t\t skip = true;\n\n\t\t\t break;\n\n\t\t }\n\n\t }\n\n\t if (skip) {\n\n\t\t continue;\n\n\t }\n\n\t dst.push_back(src[i]);\n\n }\n\n}\n\n\n\nstatic void verify_inner(const std::vector<vec2>& outer, std::vector<vec2>& inner)\n\n{\n\n\tstd::vector<vec2>::iterator itr = inner.begin();\n\n\tfor ( ; itr != inner.end(); )\n\n\t{\n\n\t\tbool find = false;\n\n\t\tfor (int i = 0, n = outer.size(); i < n; ++i) {\n\n\t\t\tif (*itr == outer[i]) {\n\n\t\t\t\tfind = true;\n","file_path":"SM_Triangulation.cpp","rank":93,"score":4268.537920147126},{"content":"\t}\n\n\tin.segmentlist[ptr_s++] = curr_p_idx;\n\n\tin.segmentlist[ptr_s++] = start_p_idx;\n\n ++curr_p_idx;\n\n start_p_idx = curr_p_idx;\n\n\n\n for (auto& hole : holes_fixed)\n\n {\n\n\t for (size_t i = 0; i < hole.size() - 1; ++i)\n\n {\n\n\t\t in.segmentlist[ptr_s++] = curr_p_idx;\n\n\t\t in.segmentlist[ptr_s++] = curr_p_idx + 1;\n\n ++curr_p_idx;\n\n\t }\n\n\t in.segmentlist[ptr_s++] = curr_p_idx;\n\n\t in.segmentlist[ptr_s++] = start_p_idx;\n\n ++curr_p_idx;\n\n start_p_idx = curr_p_idx;\n\n }\n\n\n","file_path":"SM_Triangulation.cpp","rank":94,"score":4267.367902920074},{"content":"\t\tin.segmentlist[index++] = start;\n\n\t\t++loopIndex;\n\n\t}\n\n\n\n\tin.segmentmarkerlist = (int *) NULL;\n\n\n\n\tin.numberofholes = 0;\n\n\tin.numberofregions = 0;\n\n\n\n\timplement(in, out, tc);\n\n\tfinish(in, out, bound_fixed, result);\n\n}\n\n\n\n}","file_path":"SM_Triangulation.cpp","rank":95,"score":4267.321745967001},{"content":"static void finish(struct triangulateio& in,\n\n struct triangulateio& out,\n\n\t\t\t\t const std::vector<vec2>& bound,\n\n\t\t\t\t std::vector<vec2>& out_vertices,\n\n\t\t\t\t std::vector<int>& out_triangles)\n\n{\n\n\tout_vertices.reserve(out.numberofpoints);\n\n\tint ptr = 0;\n\n\tfor (int i = 0; i < out.numberofpoints; ++i)\n\n\t{\n\n\t\tfloat x = out.pointlist[ptr++],\n\n\t\t\t y = out.pointlist[ptr++];\n\n\t\tout_vertices.push_back(vec2(x, y));\n\n\t}\n\n\n\n\tint index = 0;\n\n\tout_triangles.reserve(out.numberoftriangles);\n\n\tfor (int i = 0; i < out.numberoftriangles; ++i)\n\n\t{\n\n\t\tstd::vector<int> tri;\n","file_path":"SM_Triangulation.cpp","rank":96,"score":4267.295163996944},{"content":"#include \"SM_DouglasPeucker.h\"\n\n#include \"SM_Calc.h\"\n\n\n\n#include <float.h>\n\n\n\nnamespace sm\n\n{\n\n\n\nstatic inline\n\nvoid points_reduction(const std::vector<vec2>& line,\n\n\t\t\t\t\t float precision,\n\n\t\t\t\t\t std::vector<bool>& flag,\n\n\t\t\t\t\t int begin,\n\n\t\t\t\t\t int end)\n\n{\n\n\tif (begin > end)\n\n\t\treturn;\n\n\n\n\tif (begin == end)\n\n\t{\n","file_path":"SM_DouglasPeucker.cpp","rank":97,"score":16.95288831341636},{"content":"// code from https://github.com/ejoy/ejoy2d/blob/master/lib/matrix.c\n\n\n\n#include \"SM_MatrixFix.h\"\n\n#include \"sm_const.h\"\n\n\n\n#include <string.h>\n\n#include <stdint.h>\n\n\n\nnamespace sm\n\n{\n\n\n\nconst float MatrixFix::SCALE_INV = 1.0f / SCALE;\n\nconst float MatrixFix::TRANSLATE_SCALE_INV = 1.0f / TRANSLATE_SCALE;\n\n\n\nMatrixFix::MatrixFix()\n\n{\n\n\tIdentity();\n\n}\n\n\n\nMatrixFix::MatrixFix(const MatrixFix& mt)\n","file_path":"SM_MatrixFix.cpp","rank":98,"score":15.96545991536301},{"content":"\t\t\tis_other_dir = b;\n\n\t\t}\n\n\t}\n\n\tbool b = TextOtherDir(hull, hull[0], hull[hull.size()-1], area_min, bounding);\n\n\tif (b) {\n\n\t\tis_other_dir = b;\n\n\t}\n\n\n\n\tassert(is_turn_right(bounding[0], bounding[1], bounding[2]));\n\n\n\n\treturn b;\n\n}\n\n\n\nbool MinBoundingBox::TextOtherDir(const CU_VEC<vec2>& points, \n\n\t\t\t\t\t\t\t\t const vec2& start, const vec2& end,\n\n\t\t\t\t\t\t\t\t float& min_area, vec2 bounding[4])\n\n{\n\n\tfloat dx = start.x - end.x,\n\n\t\t dy = start.y - end.y;\n\n\tif (fabs(dx) < FLT_EPSILON ||\n","file_path":"SM_MinBoundingBox.cpp","rank":99,"score":15.77004440691335}],"string":"[\n {\n \"content\": \"struct sm_vec3* sm_vec3_vector(struct sm_vec3* v, const struct sm_vec3* p1, const struct sm_vec3* p2)\\n\\n{\\n\\n\\t*(vec3*)v = (*(const vec3*)p1) - (*(const vec3*)p2);\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_vector.cpp\",\n \"rank\": 0,\n \"score\": 127451.4694807237\n },\n {\n \"content\": \"struct sm_vec3* sm_vec3_cross(struct sm_vec3* v, const struct sm_vec3* a, const struct sm_vec3* b)\\n\\n{\\n\\n\\t*(vec3*)v = (*(const vec3*)a).Cross(*(const vec3*)b);\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_vector.cpp\",\n \"rank\": 1,\n \"score\": 99254.79997200954\n },\n {\n \"content\": \"struct sm_vec2* sm_vec2_add(struct sm_vec2* v, const struct sm_vec2* p1, const struct sm_vec2* p2)\\n\\n{\\n\\n\\t*(vec2*)v = (*(const vec2*)p1) + (*(const vec2*)p2);\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_vector.cpp\",\n \"rank\": 2,\n \"score\": 90633.57182052534\n },\n {\n \"content\": \"struct sm_vec2* sm_vec2_vector(struct sm_vec2* v, const struct sm_vec2* p1, const struct sm_vec2* p2)\\n\\n{\\n\\n\\t*(vec2*)v = (*(const vec2*)p1) - (*(const vec2*)p2);\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_vector.cpp\",\n \"rank\": 3,\n \"score\": 90633.57182052534\n },\n {\n \"content\": \"struct sm_vec3* sm_vec3_mul(struct sm_vec3* v, const union sm_mat4* m)\\n\\n{\\n\\n\\t*(vec3*)v = *((mat4*)m) * (*(vec3*)v);\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\n}\",\n \"file_path\": \"sm_c_matrix.cpp\",\n \"rank\": 4,\n \"score\": 88395.97956415084\n },\n {\n \"content\": \"class Cube\\n\\n{\\n\\npublic:\\n\\n\\tunion\\n\\n\\t{\\n\\n\\t\\tstruct\\n\\n\\t\\t{\\n\\n\\t\\t\\tT xmin;\\n\\n\\t\\t\\tT ymin;\\n\\n\\t\\t\\tT zmin;\\n\\n\\n\\n\\t\\t\\tT xmax;\\n\\n\\t\\t\\tT ymax;\\n\\n\\t\\t\\tT zmax;\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tstruct\\n\\n\\t\\t{\\n\\n\\t\\t\\tT min[3];\\n\\n\\t\\t\\tT max[3];\\n\",\n \"file_path\": \"SM_Cube.h\",\n \"rank\": 5,\n \"score\": 64890.40767913923\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\nbool ray_ray_intersect(const Ray& ray0, const Ray& ray1, vec3* cross);\\n\\nbool line_line_intersect(const sm::vec3& p1, const sm::vec3& p2,\\n\\n\\t const sm::vec3& p3, const sm::vec3& p4,\\n\\n\\t sm::vec3* pa, sm::vec3* pb, float* mua, float* mub);\\n\\n\\n\\nbool ray_aabb_intersect(const cube& aabb, const Ray& ray, vec3* cross);\\n\\nbool ray_obb_intersect(const cube& aabb, const vec3& pos, const Quaternion& angle, const vec3& scale, const Ray& ray, vec3* cross);\\n\\n\\n\\nbool ray_plane_intersect(const Ray& ray, const Plane& plane, vec3* cross);\\n\\nbool ray_plane_intersect_both_faces(const Ray& ray, const Plane& plane, vec3* cross);\\n\\n\\n\\nbool ray_triangle_intersect(const mat4& mat, const vec3& v0, const vec3& v1, const vec3& v2, const Ray& ray, vec3* cross);\\n\\nbool ray_triangle_intersect_both_faces(const mat4& mat, const vec3& v0, const vec3& v1, const vec3& v2, const Ray& ray, vec3* cross);\\n\\n\\n\\nbool ray_polygon_intersect(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross);\\n\\nbool ray_polygon_intersect_both_faces(const mat4& mat, const vec3* polygon, size_t polygon_n, const Ray& ray, vec3* cross);\\n\\n\\n\",\n \"file_path\": \"SM_RayIntersect.h\",\n \"rank\": 6,\n \"score\": 55230.392108289256\n },\n {\n \"content\": \"class PlaneT\\n\\n{\\n\\npublic:\\n\\n\\tPlaneT() : dist(0) {}\\n\\n\\tPlaneT(const Vector3<T>& normal, T d);\\n\\n\\tPlaneT(const Vector3<T>& normal, const Vector3<T>& v0);\\n\\n\\tPlaneT(const Vector3<T>& v0, const Vector3<T>& v1, const Vector3<T>& v2);\\n\\n\\n\\n T GetDistance(const Vector3<T>& v) const;\\n\\n\\n\\n\\tvoid Build(const Vector3<T>& normal, T d);\\n\\n\\tvoid Build(const Vector3<T>& normal, const Vector3<T>& v);\\n\\n\\tvoid Build(const Vector3<T>& v0, const Vector3<T>& v1, const Vector3<T>& v2);\\n\\n\\n\\n void Flip();\\n\\n\\n\\npublic:\\n\\n\\tVector3<T> normal;\\n\\n\\tT dist;\\n\\n\\n\\n}; // PlaneT\\n\\n\\n\\ntypedef PlaneT<float> Plane;\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Plane.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_PLANE_H_\",\n \"file_path\": \"SM_Plane.h\",\n \"rank\": 7,\n \"score\": 42761.786856540326\n },\n {\n \"content\": \"class QuaternionT\\n\\n{\\n\\npublic:\\n\\n\\tQuaternionT();\\n\\n\\tQuaternionT(T x, T y, T z);\\n\\n\\tQuaternionT(T x, T y, T z, T w);\\n\\n\\tQuaternionT(const Vector4<T>& vec4);\\n\\n\\n\\n\\tbool operator == (const QuaternionT<T>& q) const;\\n\\n\\tbool operator != (const QuaternionT<T>& q) const;\\n\\n\\n\\n\\tQuaternionT<T> operator - () const;\\n\\n\\n\\n\\tQuaternionT<T> operator + (const QuaternionT<T>& q) const;\\n\\n\\tQuaternionT<T> operator - (const QuaternionT<T>& q) const;\\n\\n\\tQuaternionT<T> operator * (const QuaternionT<T>& q) const;\\n\\n\\n\\n\\tvoid Normalize();\\n\\n\\tT Dot(const QuaternionT<T>& q) const;\\n\\n\\n\",\n \"file_path\": \"SM_Quaternion.h\",\n \"rank\": 8,\n \"score\": 42680.34130678028\n },\n {\n \"content\": \"class RayT\\n\\n{\\n\\npublic:\\n\\n\\tRayT() {}\\n\\n\\tRayT(const Vector3<T>& origin, const Vector3<T>& dir)\\n\\n\\t\\t: origin(origin), dir(dir) {}\\n\\n\\n\\npublic:\\n\\n\\tVector3<T> origin;\\n\\n\\tVector3<T> dir;\\n\\n\\n\\n}; // RayT\\n\\n\\n\\ntypedef RayT<float> Ray;\\n\\n\\n\\n}\",\n \"file_path\": \"SM_Ray.h\",\n \"rank\": 9,\n \"score\": 42106.3964685321\n },\n {\n \"content\": \"struct sm_vec3* sm_vec3_normalize(struct sm_vec3* v)\\n\\n{\\n\\n\\t((vec3*)v)->Normalize();\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\n}\",\n \"file_path\": \"sm_c_vector.cpp\",\n \"rank\": 10,\n \"score\": 41888.922732299216\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_PLANE_H_\\n\\n#define _SPATIAL_MATH_PLANE_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"SM_Plane.h\",\n \"rank\": 11,\n \"score\": 38422.97512379597\n },\n {\n \"content\": \"\\tbool Combine(const Vector3<T>& v);\\n\\n\\tbool Combine(const Cube<T>& r);\\n\\n\\n\\n\\tT Width() const;\\n\\n\\tT Height() const;\\n\\n\\tT Depth() const;\\n\\n\\n\\n\\tVector3<T> Size() const;\\n\\n\\tVector3<T> Center() const;\\n\\n\\n\\n\\tvoid Translate(const Vector3<T>& trans);\\n\\n\\tvoid Scale(const Vector3<T>& scale);\\n\\n\\n\\n\\tconst T* Max() const { return max; }\\n\\n\\tconst T* Min() const { return min; }\\n\\n\\n\\n}; // Cube\\n\\n\\n\\ntypedef Cube<int16_t> i16_cube;\\n\\n\\n\\ntypedef Cube<float> cube;\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Cube.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_CUBE_H_\",\n \"file_path\": \"SM_Cube.h\",\n \"rank\": 12,\n \"score\": 38353.45963225734\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_CUBE_H_\\n\\n#define _SPATIAL_MATH_CUBE_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n\\n\\n#include <stdint.h>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"SM_Cube.h\",\n \"rank\": 13,\n \"score\": 38352.09533464624\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_QUATERNION_H_\\n\\n#define _SPATIAL_MATH_QUATERNION_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"SM_Quaternion.h\",\n \"rank\": 14,\n \"score\": 38351.61433448528\n },\n {\n \"content\": \"\\n\\npublic:\\n\\n\\tT x;\\n\\n\\tT y;\\n\\n\\tT z;\\n\\n\\tT w;\\n\\n\\n\\n}; // QuaternionT\\n\\n\\n\\ntypedef QuaternionT<float> Quaternion;\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Quaternion.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_QUATERNION_H_\",\n \"file_path\": \"SM_Quaternion.h\",\n \"rank\": 15,\n \"score\": 38351.3000097533\n },\n {\n \"content\": \"\\tvoid Slerp(const QuaternionT<T>& a, const QuaternionT<T>& b, T t);\\n\\n\\tvoid NSlerp(const QuaternionT<T>& a, const QuaternionT<T>& b, T t);\\n\\n\\n\\n\\tvoid Inverted();\\n\\n\\n\\n\\tvoid Rotate(const QuaternionT<T>& q);\\n\\n\\tvoid Scale(T scale);\\n\\n\\n\\n\\tQuaternionT<T> Rotated(const QuaternionT<T>& b) const;\\n\\n\\tQuaternionT<T> Scaled(T scale) const;\\n\\n\\n\\n\\tVector4<T> ToVector() const;\\n\\n\\t//// use Matrix4's QuaternionT ctor\\n\\n\\t//Matrix3<T> ToMatrix() const;\\n\\n\\n\\n\\tstatic QuaternionT<T> CreateFromVectors(const Vector3<T>& v0, const Vector3<T>& v1);\\n\\n\\tstatic QuaternionT<T> CreateFromAxisAngle(const Vector3<T>& axis, T radians);\\n\\n\\tstatic QuaternionT<T> CreateFromEulerAngle(T roll, T pitch, T yaw);\\n\\n\\n\\n\\tstatic void TransToEulerAngle(const QuaternionT<T>& q, T& roll, T& pitch, T& yaw);\\n\",\n \"file_path\": \"SM_Quaternion.h\",\n \"rank\": 16,\n \"score\": 38350.75317877065\n },\n {\n \"content\": \"\\t\\t};\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\npublic:\\n\\n\\tCube();\\n\\n\\tCube(T width, T height, T depth);\\n\\n\\tCube(const Vector3<T>& center, T width, T height, T depth);\\n\\n\\tCube(const Vector3<T>& v0, const Vector3<T>& v1);\\n\\n\\tCube(T xmin, T ymin, T zmin, T xmax, T ymax, T zmax);\\n\\n\\n\\n\\tbool operator == (const Cube& r) const;\\n\\n\\tbool operator != (const Cube& r) const;\\n\\n\\n\\n\\tvoid Build(T width, T height, T depth);\\n\\n\\n\\n\\tvoid MakeEmpty();\\n\\n\\tbool IsValid() const;\\n\\n\\n\",\n \"file_path\": \"SM_Cube.h\",\n \"rank\": 17,\n \"score\": 38349.62870225958\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"SM_Ray.h\",\n \"rank\": 18,\n \"score\": 37846.23547243927\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\nfloat sin(float x);\\n\\nfloat cos(float x);\\n\\n\\n\\nfloat sin_fast(float x);\\n\\nfloat cos_fast(float x);\\n\\n\\n\\nint next_p2(int a);\\n\\nbool is_power_of_two(int x);\\n\\n\\n\",\n \"file_path\": \"SM_Math.h\",\n \"rank\": 34,\n \"score\": 29005.409210771355\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * float\\n\\n */\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * To check if test at middle of bound0 and bound1\\n\\n */\\n\\nbool is_between(float bound0, float bound1, float test);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * point\\n\\n */\\n\\n\\n\\n/**\\n\\n * @note\\n\\n * It can't handle the point on segment.\\n\\n *\\t Before use it must make sure the point is not on the segment.\\n\\n */\\n\\nbool is_point_at_line_left(const vec2& v, const vec2& s, const vec2& e);\\n\\nbool is_point_in_rect(const vec2& v, const rect& r);\\n\\nbool is_point_on_rect(const vec2& v, const rect& r);\\n\\nbool is_point_in_area(const vec2& v, const std::vector<vec2>& area);\\n\\nbool is_point_in_circle(const vec2& v, const vec2& center, float radius);\\n\\nbool is_point_in_convex(const vec2& pos, const std::vector<vec2>& convex);\\n\\nbool is_point_in_convex(const vec2& pos, const vec2* convex, size_t num);\\n\\nbool is_point_intersect_polyline(const vec2& point, const std::vector<vec2>& polyline);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * segment\\n\\n */\\n\\nbool is_segment_intersect_segment(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1);\\n\\nbool is_segment_intersect_polyline(const vec2& s, const vec2& e, const std::vector<vec2>& poly);\\n\\n\\n\\nbool is_two_line_parallel(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * rect\\n\\n */\\n\\nbool is_rect_contain_point(const rect& r, const vec2& v);\\n\\nbool is_rect_contain_rect(const rect& outer, const rect& inner);\\n\\nbool is_rect_intersect_rect(const rect& r0, const rect& r1);\\n\\nbool is_rect_intersect_segment(const rect& r, const vec2& s, const vec2& e);\\n\\nbool is_rect_intersect_polyline(const rect& r, const std::vector<vec2>& poly, bool loop);\\n\\nbool is_rect_intersect_polygon(const rect& r, const std::vector<vec2>& poly);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * convex\\n\\n */\\n\\nbool is_polygon_convex(const std::vector<vec2>& poly);\\n\\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * polygon\\n\\n */\\n\\nbool is_polygon_intersect_polygon(const std::vector<vec2>& poly0, const std::vector<vec2>& poly1);\\n\\nbool is_polygon_in_polygon(const std::vector<vec2>& in, const std::vector<vec2>& out);\\n\\nbool is_polygon_clockwise(const std::vector<vec2>& poly);\\n\\n\\n\",\n \"file_path\": \"SM_Test.h\",\n \"rank\": 35,\n \"score\": 29005.409210771355\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\nenum TriangulateConstrained\\n\\n{\\n\\n\\tTC_CONSTRAINED,\\n\\n\\tTC_CONFORMING,\\n\\n\\tTC_CONSTRAINED_CONFORMING_ANGLE,\\n\\n\\tTC_CONSTRAINED_CONFORMING_AREA,\\n\\n\\tTC_CONSTRAINED_CONFORMING_COUNT\\n\\n};\\n\\n\\n\\nvoid triangulate_normal(const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t\\t\\tstd::vector<vec2>& result,\\n\\n\\t\\t\\t\\t\\t\\tTriangulateConstrained tc = TC_CONSTRAINED);\\n\\n\\n\\nvoid triangulate_holes(const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t\\t const std::vector<std::vector<vec2>>& holes,\\n\\n\\t\\t\\t\\t\\t std::vector<vec2>& result,\\n\\n\\t\\t\\t\\t\\t TriangulateConstrained tc = TC_CONSTRAINED);\\n\\n\\n\\nvoid triangulate_points(const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t\\t\\tconst std::vector<vec2>& points,\\n\\n\\t\\t\\t\\t\\t\\tstd::vector<vec2>& result,\\n\\n\\t\\t\\t\\t\\t\\tTriangulateConstrained tc = TC_CONSTRAINED);\\n\\nvoid triangulate_points(const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t\\t\\tconst std::vector<vec2>& points,\\n\\n\\t\\t\\t\\t\\t\\tstd::vector<vec2>& out_vertices,\\n\\n\\t\\t\\t\\t\\t\\tstd::vector<int>& out_triangles,\\n\\n\\t\\t\\t\\t\\t\\tTriangulateConstrained tc = TC_CONSTRAINED);\\n\\n\\n\\nvoid triangulate_lines(const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t\\t const std::vector<vec2>& lines,\\n\\n\\t\\t\\t\\t\\t std::vector<vec2>& result,\\n\\n\\t\\t\\t\\t\\t TriangulateConstrained tc = TC_CONSTRAINED);\\n\\n\\n\\nvoid triangulate_points_and_lines(const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t const std::vector<vec2>& points,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t const std::vector<vec2>& lines,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t std::vector<vec2>& result,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t TriangulateConstrained tc = TC_CONSTRAINED);\\n\\n\\n\\nvoid triangulate_lines_and_loops(const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t const std::vector<vec2>& lines,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t const std::vector<std::vector<vec2> >& loops,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t std::vector<vec2>& result,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t TriangulateConstrained tc = TC_CONSTRAINED);\\n\\n\\n\",\n \"file_path\": \"SM_Triangulation.h\",\n \"rank\": 36,\n \"score\": 29005.409210771355\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\ninline\\n\\nfloat linear(float t)\\n\\n{\\n\\n\\treturn t;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_quad(float t)\\n\\n{\\n\\n\\treturn t * t;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_quad(float t)\\n\\n{\\n\\n\\treturn -t * (t - 2);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_quad(float t)\\n\\n{\\n\\n\\tif (t < 0.5f) {\\n\\n\\t\\treturn 2 * t * t;\\n\\n\\t} else {\\n\\n\\t\\tt = 2 * t - 1;\\n\\n\\t\\treturn -0.5f * (t*(t-2) - 1);\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_cubic(float t)\\n\\n{\\n\\n\\treturn t * t * t;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_cubic(float t)\\n\\n{\\n\\n\\tt -= 1;\\n\\n\\treturn t*t*t + 1;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_cubic(float t)\\n\\n{\\n\\n\\tt *= 2;\\n\\n\\tif (t < 1) {\\n\\n\\t\\treturn 0.5f * t * t * t;\\n\\n\\t} else {\\n\\n\\t\\tt -= 2;\\n\\n\\t\\treturn 0.5f * (t*t*t + 2);\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_quart(float t)\\n\\n{\\n\\n\\treturn t * t * t * t;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_quart(float t)\\n\\n{\\n\\n\\tt -= 1;\\n\\n\\treturn -(t*t*t*t - 1);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_quart(float t)\\n\\n{\\n\\n\\tt *= 2;\\n\\n\\tif (t < 1) {\\n\\n\\t\\treturn 0.5f * t * t * t * t;\\n\\n\\t} else {\\n\\n\\t\\tt -= 2;\\n\\n\\t\\treturn -0.5f * (t*t*t*t - 2);\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_quint(float t)\\n\\n{\\n\\n\\treturn t * t * t * t * t;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_quint(float t)\\n\\n{\\n\\n\\tt -= 1;\\n\\n\\treturn t*t*t*t*t + 1;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_quint(float t)\\n\\n{\\n\\n\\tt *= 2;\\n\\n\\tif (t < 1) {\\n\\n\\t\\treturn 0.5f * t * t * t * t * t;\\n\\n\\t} else {\\n\\n\\t\\tt -= 2;\\n\\n\\t\\treturn 0.5f * (t*t*t*t*t + 2);\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_sine(float t)\\n\\n{\\n\\n\\treturn -1 * cosf(t * SM_PI / 2) + 1;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_sine(float t)\\n\\n{\\n\\n\\treturn sinf(t * SM_PI / 2);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_sine(float t)\\n\\n{\\n\\n\\treturn -0.5f * (cosf(SM_PI * t) - 1);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_expo(float t)\\n\\n{\\n\\n\\tif (t == 0) {\\n\\n\\t\\treturn 0;\\n\\n\\t} else {\\n\\n\\t\\treturn powf(2, 10*(t-1));\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_expo(float t)\\n\\n{\\n\\n\\tif (t == 1) {\\n\\n\\t\\treturn 1;\\n\\n\\t} else {\\n\\n\\t\\treturn 1 - powf(2, -10*t);\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_expo(float t)\\n\\n{\\n\\n\\tif (t == 0) {\\n\\n\\t\\treturn 0;\\n\\n\\t} else if (t == 1) {\\n\\n\\t\\treturn 1;\\n\\n\\t} else {\\n\\n\\t\\tif (t < 0.5f) {\\n\\n\\t\\t\\treturn 0.5f * powf(2, (20*t)-10);\\n\\n\\t\\t} else {\\n\\n\\t\\t\\treturn 1 - 0.5f * powf(2, (-20*t)+10);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_circ(float t)\\n\\n{\\n\\n\\treturn -1 * (sqrtf(1-t*t) - 1);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_circ(float t)\\n\\n{\\n\\n\\tt -= 1;\\n\\n\\treturn sqrtf(1 - (t * t));\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_circ(float t)\\n\\n{\\n\\n\\tt *= 2;\\n\\n\\tif (t < 1) {\\n\\n\\t\\treturn -0.5f * (sqrtf(1-t*t) - 1);\\n\\n\\t} else {\\n\\n\\t\\tt = t - 2;\\n\\n\\t\\treturn 0.5f * (sqrtf(1-t*t) + 1);\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_elastic_function(float t)\\n\\n{\\n\\n\\tconst float p = 0.5f;\\n\\n\\tt -= 1;\\n\\n\\treturn -1 * (powf(2, 10*t) * sinf((t-p/4)*(2*SM_PI)/p));\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_elastic_function(float t)\\n\\n{\\n\\n\\tconst float p = 0.5f;\\n\\n\\treturn powf(2, -10*t) * sinf((t-p/4)*(2*SM_PI/p)) + 1;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_elastic_function(float t)\\n\\n{\\n\\n\\tconst float p = 0.5f;\\n\\n\\tt *= 2;\\n\\n\\tif (t < 1) {\\n\\n\\t\\tt -= 1;\\n\\n\\t\\treturn -0.5f * (powf(2, 10*t) * sinf((t-p/4)*2*SM_PI/p));\\n\\n\\t} else {\\n\\n\\t\\tt -= 1;\\n\\n\\t\\treturn powf(2, -10*t)*sinf((t-p/4)*2*SM_PI/p)*0.5f + 1;\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_elastic(float t)\\n\\n{\\n\\n\\treturn in_elastic_function(0.5f);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_elastic(float t)\\n\\n{\\n\\n\\treturn out_elastic_function(0.5f);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_elastic(float t)\\n\\n{\\n\\n\\treturn in_out_elastic_function(t);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_back(float t)\\n\\n{\\n\\n\\tfloat s = 1.70158f;\\n\\n\\treturn t * t * ((s+1)*t - s);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_back(float t)\\n\\n{\\n\\n\\tfloat s = 1.70158f;\\n\\n\\tt -= 1;\\n\\n\\treturn t*t*((s+1)*t+s) + 1;\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_back(float t)\\n\\n{\\n\\n\\tfloat s = 1.70158f;\\n\\n\\tt *= 2;\\n\\n\\tif (t < 1) {\\n\\n\\t\\ts *= 1.525f;\\n\\n\\t\\treturn 0.5f * (t * t * ((s+1)*t - s));\\n\\n\\t} else {\\n\\n\\t\\tt -= 2;\\n\\n\\t\\ts *= 1.525f;\\n\\n\\t\\treturn 0.5f * (t*t*((s+1)*t+s) + 2);\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_bounce(float t)\\n\\n{\\n\\n\\tif (t < 4/11.0f) {\\n\\n\\t\\treturn (121 * t * t) / 16.0f;\\n\\n\\t} else if (t < 8/11.0f) {\\n\\n\\t\\treturn (363 / 40.0f * t * t) - (99 / 10.0f * t) + 17/5.0f;\\n\\n\\t} else if (t < 9/10.0f) {\\n\\n\\t\\treturn (4356 / 361.0f * t * t) - (35442 / 1805.0f * t) + 16061/1805.0f;\\n\\n\\t} else {\\n\\n\\t\\treturn (54 / 5.0f * t * t) - (513 / 25.0f * t) + 268/25.0f;\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_bounce(float t)\\n\\n{\\n\\n\\treturn 1 - out_bounce(1-t);\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_bounce(float t)\\n\\n{\\n\\n\\tif (t < 0.5f) {\\n\\n\\t\\treturn in_bounce(2*t) * 0.5f;\\n\\n\\t} else {\\n\\n\\t\\treturn out_bounce(2*t-1)*0.5f + 0.5f;\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_square(float t)\\n\\n{\\n\\n\\tif (t < 1) {\\n\\n\\t\\treturn 0;\\n\\n\\t} else {\\n\\n\\t\\treturn 1;\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat out_square(float t)\\n\\n{\\n\\n\\tif (t > 0) {\\n\\n\\t\\treturn 1;\\n\\n\\t} else {\\n\\n\\t\\treturn 0;\\n\\n\\t}\\n\\n}\\n\\n\\n\\ninline\\n\\nfloat in_out_square(float t)\\n\\n{\\n\\n\\tif (t < 0.5f) {\\n\\n\\t\\treturn 0;\\n\\n\\t} else {\\n\\n\\t\\treturn 1;\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"SM_Ease.h\",\n \"rank\": 37,\n \"score\": 29005.409210771355\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\nvoid douglas_peucker(const std::vector<vec2>& line,\\n\\n\\t\\t\\t\\t\\t float precision,\\n\\n\\t\\t\\t\\t\\t std::vector<vec2>& dst);\\n\\n\\n\",\n \"file_path\": \"SM_DouglasPeucker.h\",\n \"rank\": 38,\n \"score\": 28893.595509987532\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\nvoid convex_hull(const std::vector<vec2>& points,\\n\\n\\t\\t\\t\\t std::vector<vec2>& convex_hull);\\n\\n\\n\",\n \"file_path\": \"SM_ConvexHull.h\",\n \"rank\": 39,\n \"score\": 28893.595509987532\n },\n {\n \"content\": \"namespace sm\\n\\n{\\n\\n\\n\\nvoid cosine_smooth(const std::vector<vec2>& src,\\n\\n\\t\\t\\t\\t float sampling_width,\\n\\n\\t\\t\\t\\t std::vector<vec2>& dst);\\n\\n\\n\",\n \"file_path\": \"SM_CosineSmooth.h\",\n \"rank\": 40,\n \"score\": 28893.595509987532\n },\n {\n \"content\": \"struct sm_vec2* sm_vec2_normalize(struct sm_vec2* v)\\n\\n{\\n\\n\\t((vec2*)v)->Normalize();\\n\\n\\treturn v;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_vector.cpp\",\n \"rank\": 41,\n \"score\": 5252.6894885384\n },\n {\n \"content\": \"\\tfloat x, y, z, w;\\n\",\n \"file_path\": \"sm_c_vector.h\",\n \"rank\": 42,\n \"score\": 4970.711533571934\n },\n {\n \"content\": \"*/\\n\\nfloat get_polygon_perimeter(const std::vector<sm::vec2>& poly);\\n\\n\\n\\n/**\\n\\n* @brief\\n\\n* Get the cross point of three planes.\\n\\n*/\\n\\nbool intersect_planes(const Plane& p0, const Plane& p1, const Plane& p2, vec3* cross);\\n\\n\\n\\nsm::vec3 calc_plane_mirror(const Plane& plane, const sm::vec3& pos);\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Calc.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_CALC_H_\",\n \"file_path\": \"SM_Calc.h\",\n \"rank\": 43,\n \"score\": 4511.767917447597\n },\n {\n \"content\": \"float dis_pos3_to_pos3(const vec3& v0, const vec3& v1);\\n\\nfloat dis_square_pos3_to_pos3(const vec3& v0, const vec3& v1);\\n\\nfloat distance_aabb(const vec3& pos, const vec3& aabb_min, const vec3& aabb_max);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * Get the cross point of two segment.\\n\\n * If they are not crossed, direct return false withnot compute the cross point.\\n\\n */\\n\\nbool intersect_line_line(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1, vec2* cross);\\n\\nbool intersect_segment_segment(const vec2& s0, const vec2& e0, const vec2& s1, const vec2& e1, vec2* cross);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * Get the foot of out at line(s, e).\\n\\n * Is return -1 the foot is outside the line(s, e), return 0 the foot on the line(s, e).\\n\\n */\\n\\nint get_foot_of_perpendicular(const vec2& s, const vec2& e, const vec2& out, vec2* foot);\\n\\nint get_foot_of_perpendicular(const vec3& s, const vec3& e, const vec3& out, vec3* foot);\\n\\n\\n\",\n \"file_path\": \"SM_Calc.h\",\n \"rank\": 44,\n \"score\": 4510.130204144008\n },\n {\n \"content\": \"bool is_acute_angle(const vec2& a, const vec2& center, const vec2& b);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * To check angle a-center-b turn left or right.\\n\\n */\\n\\nbool is_turn_left(const vec2& a, const vec2& center, const vec2& b);\\n\\nbool is_turn_right(const vec2& a, const vec2& center, const vec2& b);\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * distance position to ...\\n\\n */\\n\\nfloat dis_pos_to_pos(const vec2& v0, const vec2& v1);\\n\\nfloat dis_square_pos_to_pos(const vec2& v0, const vec2& v1);\\n\\nfloat dis_pos_to_multi_pos(const vec2& pos, const std::vector<vec2>& multi_pos, int* nearest_idx = NULL);\\n\\nfloat dis_pos_to_seg(const vec2& v, const vec2& s0, const vec2& s1);\\n\\nfloat dis_pos_to_polyline(const vec2& pos, const std::vector<vec2>& polyline, int* nearest_idx = NULL);\\n\\nfloat dis_pos_to_polygon(const vec2& pos, const std::vector<vec2>& polygon, int* nearest_idx = NULL);\\n\\n\\n\",\n \"file_path\": \"SM_Calc.h\",\n \"rank\": 45,\n \"score\": 4505.934705035493\n },\n {\n \"content\": \"/**\\n\\n * @brief\\n\\n * triangle\\n\\n */\\n\\nvec2 get_tri_gravity_center(const vec2& p0, const vec2& p1, const vec2& p2);\\n\\n\\n\\n/**\\n\\n* @brief\\n\\n* area\\n\\n*/\\n\\nfloat get_polygon_area(const std::vector<sm::vec2>& polygon);\\n\\nfloat get_polygon_area(const std::vector<sm::vec3>& polygon);\\n\\nfloat get_triangle_area(const sm::vec2& p0, const sm::vec2& p1, const sm::vec2& p2);\\n\\n\\n\\nsm::vec3 calc_unit_normal(const sm::vec3& a, const sm::vec3& b, const sm::vec3& c);\\n\\nsm::vec3 calc_face_normal(const std::vector<sm::vec3>& polygon);\\n\\n\\n\\n/**\\n\\n* @brief\\n\\n* perimeter\\n\",\n \"file_path\": \"SM_Calc.h\",\n \"rank\": 46,\n \"score\": 4503.704845433337\n },\n {\n \"content\": \"\\tT Dot(const Vector4& v) const;\\n\\n\\n\\n}; // Vector4\\n\\n\\n\\ntypedef Vector2<bool> bvec2;\\n\\ntypedef Vector3<bool> bvec3;\\n\\ntypedef Vector4<bool> bvec4;\\n\\n\\n\\ntypedef Vector2<uint16_t> i16_vec2;\\n\\ntypedef Vector3<uint16_t> i16_vec3;\\n\\ntypedef Vector4<uint16_t> i16_vec4;\\n\\n\\n\\ntypedef Vector2<int> ivec2;\\n\\ntypedef Vector3<int> ivec3;\\n\\ntypedef Vector4<int> ivec4;\\n\\n\\n\\ntypedef Vector2<float> vec2;\\n\\ntypedef Vector3<float> vec3;\\n\\ntypedef Vector4<float> vec4;\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Vector.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_VECTOR_H_\\n\",\n \"file_path\": \"SM_Vector.h\",\n \"rank\": 47,\n \"score\": 4502.4674948716365\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_CALC_H_\\n\\n#define _SPATIAL_MATH_CALC_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n#include \\\"SM_Plane.h\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\",\n \"file_path\": \"SM_Calc.h\",\n \"rank\": 48,\n \"score\": 4501.388998164068\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_MATRIX_H_\\n\\n#define _SPATIAL_MATH_MATRIX_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n#include \\\"SM_Quaternion.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * matrix2\\n\\n */\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"SM_Matrix.h\",\n \"rank\": 49,\n \"score\": 4500.6326890933\n },\n {\n \"content\": \"\\tbool IsValid() const;\\n\\n\\n\\n\\tbool Combine(const Vector2<T>& v);\\n\\n\\tbool Combine(const Rect<T>& r);\\n\\n\\n\\n\\tT Width() const;\\n\\n\\tT Height() const;\\n\\n\\tVector2<T> Size() const;\\n\\n\\tVector2<T> Center() const;\\n\\n\\n\\n\\tvoid Translate(const Vector2<T>& trans);\\n\\n\\tvoid Scale(const Vector2<T>& scale);\\n\\n\\tvoid Shear(const Vector2<T>& shear);\\n\\n\\n\\n}; // Rect\\n\\n\\n\\ntypedef Rect<int> irect;\\n\\ntypedef Rect<int16_t> i16_rect;\\n\\n\\n\\ntypedef Rect<float> rect;\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Rect.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_RECT_H_\",\n \"file_path\": \"SM_Rect.h\",\n \"rank\": 50,\n \"score\": 4500.565969793508\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_VECTOR_H_\\n\\n#define _SPATIAL_MATH_VECTOR_H_\\n\\n\\n\\n#include <float.h>\\n\\n#include <stdint.h>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\n/**\\n\\n * @brief\\n\\n * vector2\\n\\n */\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"SM_Vector.h\",\n \"rank\": 51,\n \"score\": 4499.528333776571\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_PROCESS_H_\\n\\n#define _SPATIAL_MATH_PROCESS_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\",\n \"file_path\": \"SM_Process.h\",\n \"rank\": 52,\n \"score\": 4498.31268876575\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_RECT_H_\\n\\n#define _SPATIAL_MATH_RECT_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n\\n\\n#include <stdint.h>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"SM_Rect.h\",\n \"rank\": 53,\n \"score\": 4497.990179156728\n },\n {\n \"content\": \"\\tVector3<T> GetTranslate() const;\\n\\n\\tVector3<T> GetScale() const;\\n\\n\\tvoid Decompose(Vector3<T>& trans, Vector3<T>& rot, Vector3<T>& scale) const;\\n\\n\\n\\n\\tstatic Matrix4<T> Translated(T x, T y, T z);\\n\\n\\tstatic Matrix4<T> Scaled(T x, T y, T z);\\n\\n\\tstatic Matrix4<T> Rotated(T x, T y, T z);\\n\\n\\tstatic Matrix4<T> RotatedX(T degrees);\\n\\n\\tstatic Matrix4<T> RotatedY(T degrees);\\n\\n\\tstatic Matrix4<T> RotatedZ(T degrees);\\n\\n\\tstatic Matrix4<T> RotatedAxis(const Vector3<T>& axis, T angle);\\n\\n\\tstatic Matrix4<T> Sheared(T kx, T ky);\\n\\n\\tstatic Matrix4<T> SkewY(T sx, T sz);\\n\\n\\n\\n\\tstatic Matrix4<T> Perspective(T fovy, T aspect, T znear, T zfar);\\n\\n\\tstatic Matrix4<T> Orthographic(T left, T right, T bottom, T top, T znear, T zfar);\\n\\n static Matrix4<T> LookAt(const Vector3<T>& eye, const Vector3<T>& center, const Vector3<T>& up);\\n\\n\\n\\n}; // Matrix4\\n\\n\\n\\ntypedef Matrix2<float> mat2;\\n\\ntypedef Matrix3<float> mat3;\\n\\ntypedef Matrix4<float> mat4;\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Matrix.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_MATRIX_H_\",\n \"file_path\": \"SM_Matrix.h\",\n \"rank\": 54,\n \"score\": 4497.896384758305\n },\n {\n \"content\": \"\\t* @param sx Scale along x-axis.\\n\\n\\t* @param sy Scale along y-axis.\\n\\n\\t* @param ox The offset for rotation along the x-axis.\\n\\n\\t* @param oy The offset for rotation along the y-axis.\\n\\n\\t* @param kx Shear along x-axis\\n\\n\\t* @param ky Shear along y-axis\\n\\n\\t**/\\n\\n\\tvoid SetTransformation(T x, T y, T angle, T sx, T sy, T ox, T oy, T kx, T ky);\\n\\n\\n\\n\\tvoid SetTransformation(const Vector3<T>& scale, const Vector3<T>& rotation_origin,\\n\\n\\t\\tconst Vector4<T>& rotation_quaternion, const Vector3<T>& translation);\\n\\n\\n\\n\\tMatrix4<T> FastMul43(const Matrix4<T>& b);\\n\\n\\n\\n Matrix4<T> Transposed() const;\\n\\n\\tT Determinant() const;\\n\\n\\tMatrix4<T> Inverted() const;\\n\\n\\n\\n\\tQuaternionT<T> ToQuaternion() const;\\n\\n\\n\",\n \"file_path\": \"SM_Matrix.h\",\n \"rank\": 55,\n \"score\": 4495.265115354299\n },\n {\n \"content\": \"\\tbool operator == (const Matrix4<T>& b) const;\\n\\n\\tbool operator != (const Matrix4<T>& b) const;\\n\\n\\n\\n Matrix4<T> operator * (const Matrix4<T>& b) const;\\n\\n\\n\\n\\tVector2<T> operator * (const Vector2<T>& v) const;\\n\\n\\tVector3<T> operator * (const Vector3<T>& v) const;\\n\\n\\tVector4<T> operator * (const Vector4<T>& v) const;\\n\\n\\n\\n\\tvoid Identity();\\n\\n\\n\\n\\tvoid Translate(T x, T y, T z);\\n\\n\\tvoid Scale(T x, T y, T z);\\n\\n\\tvoid Shear(T kx, T ky);\\n\\n\\tvoid RotateZ(T degrees);\\n\\n\\n\\n\\t/**\\n\\n\\t* @param x The translation along the x-axis.\\n\\n\\t* @param y The translation along the y-axis.\\n\\n\\t* @param angle The rotation (rad) around the center with offset (ox,oy).\\n\",\n \"file_path\": \"SM_Matrix.h\",\n \"rank\": 56,\n \"score\": 4494.053861959175\n },\n {\n \"content\": \"\\n\\n\\tT operator[](size_t i) const;\\n\\n\\tT& operator[](size_t i);\\n\\n\\n\\n\\tVector3& operator = (const Vector3& v);\\n\\n\\tvoid Set(T x, T y, T z);\\n\\n\\n\\n\\tvoid MakeInvalid();\\n\\n\\tbool IsValid() const;\\n\\n\\n\\n\\tbool operator == (const Vector3& v) const;\\n\\n\\tbool operator != (const Vector3& v) const;\\n\\n\\n\\n bool operator < (const Vector3& v) const;\\n\\n bool operator > (const Vector3& v) const;\\n\\n\\n\\n\\tVector3 operator - () const;\\n\\n\\n\\n\\tvoid operator += (const Vector3& v);\\n\\n\\tvoid operator -= (const Vector3& v);\\n\",\n \"file_path\": \"SM_Vector.h\",\n \"rank\": 57,\n \"score\": 4492.452281913595\n },\n {\n \"content\": \"\\tvoid Set(T x, T y);\\n\\n\\n\\n\\tvoid MakeInvalid();\\n\\n\\tbool IsValid() const;\\n\\n\\n\\n\\tbool operator == (const Vector2& v) const;\\n\\n\\tbool operator != (const Vector2& v) const;\\n\\n\\n\\n bool operator < (const Vector2& v) const;\\n\\n\\n\\n\\tVector2<T> operator - () const;\\n\\n\\n\\n\\tvoid operator += (const Vector2& v);\\n\\n\\tvoid operator -= (const Vector2& v);\\n\\n\\tvoid operator *= (const Vector2& v);\\n\\n\\tvoid operator /= (const Vector2& v);\\n\\n\\tvoid operator *= (T f);\\n\\n\\tvoid operator /= (T f);\\n\\n\\n\\n\\tVector2 operator + (const Vector2& v) const;\\n\",\n \"file_path\": \"SM_Vector.h\",\n \"rank\": 58,\n \"score\": 4492.209250656513\n },\n {\n \"content\": \"\\n\\n\\tT operator[](size_t i) const;\\n\\n\\tT& operator[](size_t i);\\n\\n\\n\\n\\tVector4& operator = (const Vector4& v);\\n\\n\\tvoid Assign(T x, T y, T z, T w);\\n\\n\\n\\n\\tbool operator == (const Vector4& v) const;\\n\\n\\tbool operator != (const Vector4& v) const;\\n\\n\\n\\n\\tvoid operator += (const Vector4& v);\\n\\n\\tvoid operator -= (const Vector4& v);\\n\\n\\tvoid operator *= (T f);\\n\\n\\tvoid operator /= (T f);\\n\\n\\n\\n\\tVector4 operator + (const Vector4& v) const;\\n\\n\\tVector4 operator - (const Vector4& v) const;\\n\\n\\tVector4 operator * (T f) const;\\n\\n\\tVector4 operator / (T f) const;\\n\\n\\n\",\n \"file_path\": \"SM_Vector.h\",\n \"rank\": 59,\n \"score\": 4491.416992807099\n },\n {\n \"content\": \"\\tVector2 operator - (const Vector2& v) const;\\n\\n\\tVector2 operator * (const Vector2& v) const;\\n\\n\\tVector2 operator / (const Vector2& v) const;\\n\\n\\tVector2 operator * (T f) const;\\n\\n\\tVector2 operator / (T f) const;\\n\\n\\n\\n\\tT Length() const;\\n\\n\\tT LengthSquared() const;\\n\\n\\tvoid Normalize();\\n\\n\\tVector2 Normalized() const;\\n\\n\\n\\n\\tT Cross(const Vector2& v) const;\\n\\n\\tT Dot(const Vector2& v) const;\\n\\n\\n\\n}; // Vector2\\n\\n\\n\",\n \"file_path\": \"SM_Vector.h\",\n \"rank\": 60,\n \"score\": 4490.992019877361\n },\n {\n \"content\": \"\\tvoid operator *= (T f);\\n\\n\\tvoid operator /= (T f);\\n\\n\\n\\n\\tVector3 operator + (const Vector3& v) const;\\n\\n\\tVector3 operator - (const Vector3& v) const;\\n\\n Vector3 operator * (const Vector3& v) const;\\n\\n\\tVector3 operator * (T f) const;\\n\\n\\tVector3 operator / (T f) const;\\n\\n\\n\\n\\tT Length() const;\\n\\n\\tT LengthSquared() const;\\n\\n\\tvoid Normalize();\\n\\n\\tVector3 Normalized() const;\\n\\n\\n\\n\\tVector3 Cross(const Vector3& v) const;\\n\\n\\tT Dot(const Vector3& v) const;\\n\\n\\n\\n}; // Vector3\\n\\n\\n\",\n \"file_path\": \"SM_Vector.h\",\n \"rank\": 61,\n \"score\": 4490.832724495314\n },\n {\n \"content\": \"#include \\\"SM_Calc.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nsm::vec3 calc_plane_mirror(const Plane& plane, const sm::vec3& pos)\\n\\n{\\n\\n\\tfloat len_s = plane.normal.LengthSquared();\\n\\n\\tauto v1 = pos;\\n\\n\\tfloat k = (-plane.normal.Dot(v1) - plane.dist) / len_s;\\n\\n\\tauto v2 = plane.normal * k + v1;\\n\\n\\treturn v2 * 2 - v1;\\n\\n}\\n\\n\\n\\n}\",\n \"file_path\": \"SM_Calc.cpp\",\n \"rank\": 62,\n \"score\": 4290.698852654579\n },\n {\n \"content\": \"#include \\\"SM_Calc.h\\\"\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n#include \\\"sm_c_vector.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nextern \\\"C\\\"\\n\\nvoid sm_rotate_vector_right_angle(const struct sm_vec2* v, bool turn_left, struct sm_vec2* ret)\\n\\n{\\n\\n\\tvec2 r = rotate_vector_right_angle(*(vec2*)v, turn_left);\\n\\n\\tret->x = r.x;\\n\\n\\tret->y = r.y;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\\nfloat sm_get_line_angle(struct sm_vec2* s, struct sm_vec2* e)\\n\\n{\\n\\n\\treturn get_line_angle(*(vec2*)s, *(vec2*)e);\\n\\n}\\n\",\n \"file_path\": \"sm_c_calc.cpp\",\n \"rank\": 63,\n \"score\": 4282.509793156569\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t\\tidx0 = next_idx0;\\n\\n\\t}\\n\\n\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\n//bool is_polygon_clockwise(const std::vector<vec2>& poly)\\n\\n//{\\n\\n// float cross_sum = 0.0f;\\n\\n// for (size_t i = 0, n = poly.size(); i < n; ++i)\\n\\n// {\\n\\n// auto& p0 = poly[i];\\n\\n// auto& p1 = poly[(i + 1) % n];\\n\\n// auto& p2 = poly[(i + 2) % n];\\n\\n// cross_sum += (p1 - p0).Cross(p2 - p1);\\n\\n// }\\n\\n// return cross_sum < 0;\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 64,\n \"score\": 4281.650977946331\n },\n {\n \"content\": \"#include \\\"SM_Test.h\\\"\\n\\n#include \\\"SM_Calc.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nbool is_rect_intersect_segment(const rect& r, const vec2& s, const vec2& e)\\n\\n{\\n\\n\\tunsigned char type_s, type_e;\\n\\n\\ttype_s = type_e = 0;\\n\\n\\tif (s.x < r.xmin) // left: 1000\\n\\n\\t\\ttype_s |= 0x8;\\n\\n\\telse if (s.x > r.xmax) // right: 0100\\n\\n\\t\\ttype_s |= 0x4;\\n\\n\\tif (s.y < r.ymin) // down: 0001\\n\\n\\t\\ttype_s |= 0x1;\\n\\n\\telse if (s.y > r.ymax) // up: 0010\\n\\n\\t\\ttype_s |= 0x2;\\n\\n\\n\\n\\tif (e.x < r.xmin) // left: 1000\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 65,\n \"score\": 4280.575312387531\n },\n {\n \"content\": \" }\\n\\n\\n\\n size_t n_positive = 0, n_negative = 0;\\n\\n for (size_t i = 0, n = poly.size(); i < n; ++i)\\n\\n {\\n\\n auto& p0 = poly[(i + n - 1) % n];\\n\\n auto& p1 = poly[i];\\n\\n auto& p2 = poly[(i + 1) % n];\\n\\n auto cross = (p1 - p0).Cross(p2 - p1);\\n\\n if (cross > 0) {\\n\\n ++n_positive;\\n\\n } else if (cross < 0) {\\n\\n ++n_positive;\\n\\n }\\n\\n }\\n\\n return n_positive == 0 || n_negative == 0;\\n\\n}\\n\\n\\n\\nbool is_polygon_in_polygon(const std::vector<vec2>& in, const std::vector<vec2>& out)\\n\\n{\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 66,\n \"score\": 4277.589118438845\n },\n {\n \"content\": \"\\t\\t\\t\\tfloat angle = get_angle(start, end, start_prev);\\n\\n\\t\\t\\t\\tif (angle > get_angle(start, end, e) ||\\n\\n\\t\\t\\t\\t\\tangle > get_angle(start, end, s)) {\\n\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t} else if (is_two_points_same(end, cross)) {\\n\\n\\t\\t\\t\\tconst vec2& end_next = poly[get_next_idx_in_ring(sz, end_idx, 1)];\\n\\n\\t\\t\\t\\tfloat angle = get_angle(end, end_next, start);\\n\\n\\t\\t\\t\\tif (angle > get_angle(end, end_next, e) ||\\n\\n\\t\\t\\t\\t\\tangle > get_angle(end, end_next, s)) {\\n\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t} else {\\n\\n\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\treturn false;\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 67,\n \"score\": 4277.584787873817\n },\n {\n \"content\": \"static inline\\n\\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1, const vec2& v0, const vec2& v1)\\n\\n{\\n\\n\\tfloat angle = SM_PI * 0.5f - atan2(v1.y - v0.y, v1.x - v0.x);\\n\\n\\treturn is_convex_intersect_convex(c0, c1, angle);\\n\\n}\\n\\n\\n\\nstatic inline\\n\\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1, const std::vector<vec2>& proj)\\n\\n{\\n\\n\\tfor (int i = 0, n = c0.size() - 1; i < n; ++i) {\\n\\n\\t\\tif (!is_convex_intersect_convex(c0, c1, proj[i], proj[i+1])) {\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tif (!is_convex_intersect_convex(c0, c1, proj[c0.size() - 1], proj[0])) {\\n\\n\\t\\treturn false;\\n\\n\\t}\\n\\n\\treturn true;\\n\\n}\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 68,\n \"score\": 4277.434580182571\n },\n {\n \"content\": \"\\t\\ttype_e |= 0x8;\\n\\n\\telse if (e.x > r.xmax) // right: 0100\\n\\n\\t\\ttype_e |= 0x4;\\n\\n\\tif (e.y < r.ymin) // down: 0001\\n\\n\\t\\ttype_e |= 0x1;\\n\\n\\telse if (e.y > r.ymax) // up: 0010\\n\\n\\t\\ttype_e |= 0x2;\\n\\n\\n\\n\\tunsigned char comp;\\n\\n\\tcomp = type_s & type_e;\\n\\n\\tif (comp != 0)\\t\\t// must be outside, so must intersect\\n\\n\\t\\treturn false;\\n\\n\\tcomp = type_s | type_e;\\n\\n\\tif (comp == 0)\\t\\t// must be inside, so must not intersect\\n\\n\\t\\treturn true;\\n\\n\\n\\n\\t// test each edge\\n\\n\\tif (comp & 0x8)\\t\\t// 1000, left edge\\n\\n\\t{\\n\\n\\t\\tfloat cross_y;\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 69,\n \"score\": 4277.016277704861\n },\n {\n \"content\": \"#include \\\"SM_Matrix.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nextern \\\"C\\\"\\n\\nunion sm_mat4* sm_mat4_mul(union sm_mat4* m, const union sm_mat4* m1, const union sm_mat4* m2)\\n\\n{\\n\\n\\t*(mat4*)m = (*(mat4*)m1) * (*(mat4*)m2);\\n\\n\\treturn m;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\\nunion sm_mat4* sm_mat4_rotxmat(union sm_mat4* m, float degrees)\\n\\n{\\n\\n\\t*(mat4*)m = ((mat4*)m)->RotatedX(degrees);\\n\\n\\treturn m;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_matrix.cpp\",\n \"rank\": 70,\n \"score\": 4275.590584440552\n },\n {\n \"content\": \"{\\n\\n\\treturn (curr + sz + step) % sz;\\n\\n}\\n\\n\\n\\nstatic inline\\n\\nbool is_two_points_same(const vec2& p0, const vec2& p1)\\n\\n{\\n\\n\\treturn fabs(p0.x - p1.x) < SM_LARGE_EPSILON\\n\\n\\t\\t&& fabs(p0.y - p1.y) < SM_LARGE_EPSILON;\\n\\n}\\n\\n\\n\\nbool is_segment_intersect_polyline(const vec2& s, const vec2& e, const std::vector<vec2>& poly)\\n\\n{\\n\\n\\tif (poly.size() < 2) {\\n\\n\\t\\treturn false;\\n\\n\\t} else if (poly.size() < 3) {\\n\\n\\t\\tvec2 cross;\\n\\n\\t\\tif (intersect_segment_segment(s, e, poly[0], poly[1], &cross)) {\\n\\n\\t\\t\\tif (!is_two_points_same(s, cross) && !is_two_points_same(e, cross) &&\\n\\n\\t\\t\\t\\t!is_two_points_same(poly[0], cross) && !is_two_points_same(poly[1], cross)) {\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 71,\n \"score\": 4275.531084272151\n },\n {\n \"content\": \"\\t\\tfloat cross_x;\\n\\n\\t\\tcross_x = find_x_on_seg(s, e, r.ymax);\\n\\n\\t\\tif (cross_x >= r.xmin && cross_x <= r.xmax)\\n\\n\\t\\t\\treturn true;\\n\\n\\t}\\n\\n\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\nstatic inline\\n\\nvoid project_convex(const std::vector<vec2>& c, float angle, float* min, float* max)\\n\\n{\\n\\n\\t*min = FLT_MAX;\\n\\n\\t*max = -FLT_MAX;\\n\\n\\tfor (int i = 0, n = c.size(); i < n; ++i) {\\n\\n\\t\\tvec2 v = rotate_vector(c[i], angle);\\n\\n\\t\\tif (v.x < *min) {\\n\\n\\t\\t\\t*min = v.x;\\n\\n\\t\\t}\\n\\n\\t\\tif (v.x > *max) {\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 72,\n \"score\": 4275.402879893704\n },\n {\n \"content\": \"\\n\\nextern \\\"C\\\"\\n\\nbool sm_intersect_line_line(const struct sm_vec2* s0, const struct sm_vec2* e0, const struct sm_vec2* s1, const struct sm_vec2* e1, struct sm_vec2* cross)\\n\\n{\\n\\n\\tvec2 _cross;\\n\\n\\tbool ret = intersect_line_line(*(vec2*)s0, *(vec2*)e0, *(vec2*)s1, *(vec2*)e1, &_cross);\\n\\n\\tcross->x = _cross.x;\\n\\n\\tcross->y = _cross.y;\\n\\n\\treturn ret;\\n\\n}\\n\\n\\n\\n}\",\n \"file_path\": \"sm_c_calc.cpp\",\n \"rank\": 73,\n \"score\": 4275.0999772166\n },\n {\n \"content\": \"\\t\\tcross_y = find_y_on_seg(s, e, r.xmin);\\n\\n\\t\\tif (cross_y >= r.ymin && cross_y <= r.ymax)\\n\\n\\t\\t\\treturn true;\\n\\n\\t}\\n\\n\\tif (comp & 0x4)\\t\\t// 0100, right edge\\n\\n\\t{\\n\\n\\t\\tfloat cross_y;\\n\\n\\t\\tcross_y = find_y_on_seg(s, e, r.xmax);\\n\\n\\t\\tif (cross_y >= r.ymin && cross_y <= r.ymax)\\n\\n\\t\\t\\treturn true;\\n\\n\\t}\\n\\n\\tif (comp & 0x1)\\t\\t// 0001, down edge\\n\\n\\t{\\n\\n\\t\\tfloat cross_x;\\n\\n\\t\\tcross_x = find_x_on_seg(s, e, r.ymin);\\n\\n\\t\\tif (cross_x >= r.xmin && cross_x <= r.xmax)\\n\\n\\t\\t\\treturn true;\\n\\n\\t}\\n\\n\\tif (comp & 0x2)\\t\\t// 0010, up edge\\n\\n\\t{\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 74,\n \"score\": 4273.9713495408405\n },\n {\n \"content\": \"\\n\\n\\tvoid Identity();\\n\\n\\n\\n\\tMatrixFix Inverted() const;\\n\\n\\n\\n\\tvoid Translate(float x, float y);\\n\\n\\tvoid Scale(float sx, float sy);\\n\\n\\tvoid Rotate(float angle);\\n\\n\\n\\n\\tvoid SetTransformation(float x, float y, float angle, float sx, float sy, float ox, float oy, float kx, float ky);\\n\\n\\t\\n\\n}; // MatrixFix\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_MatrixFix.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_FIX_MATH_H_\",\n \"file_path\": \"SM_MatrixFix.h\",\n \"rank\": 75,\n \"score\": 4273.858935469699\n },\n {\n \"content\": \"\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\n\\t}\\n\\n\\n\\n\\tint sz = poly.size();\\n\\n\\tfor (int i = 0; i < sz; ++i)\\n\\n\\t{\\n\\n\\t\\tconst vec2& start = poly[i];\\n\\n\\t\\tint end_idx = get_next_idx_in_ring(sz, i, 1);\\n\\n\\t\\tconst vec2& end = poly[end_idx];\\n\\n\\t\\tvec2 cross;\\n\\n\\t\\tif (intersect_segment_segment(s, e, start, end, &cross)) {\\n\\n\\t\\t\\tif (is_two_points_same(s, cross) || is_two_points_same(e, cross)) {\\n\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tif (is_two_points_same(start, cross)) {\\n\\n\\t\\t\\t\\tconst vec2& start_prev = poly[get_next_idx_in_ring(sz, i, -1)];\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 76,\n \"score\": 4273.789608013801\n },\n {\n \"content\": \"union sm_mat4* sm_mat4_identity(union sm_mat4* m)\\n\\n{\\n\\n\\t((mat4*)m)->Identity();\\n\\n\\treturn m;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\\nunion sm_mat4* sm_mat4_trans(union sm_mat4* m, float x, float y, float z)\\n\\n{\\n\\n\\t((mat4*)m)->Translate(x, y, z);\\n\\n\\treturn m;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\\nunion sm_mat4* sm_mat4_perspective(union sm_mat4* m, float fovy, float aspect, float znear, float zfar)\\n\\n{\\n\\n\\t*(mat4*)m = ((mat4*)m)->Perspective(fovy, aspect, znear, zfar);\\n\\n\\treturn m;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_matrix.cpp\",\n \"rank\": 77,\n \"score\": 4273.708481889627\n },\n {\n \"content\": \"\\t\\t\\tconst vec2& start1 = poly1[idx1];\\n\\n\\t\\t\\tint next_idx1 = get_next_idx_in_ring(sz1, idx1, step1);\\n\\n\\t\\t\\tconst vec2& end1 = poly1[next_idx1];\\n\\n\\n\\n\\t\\t\\tvec2 cross;\\n\\n\\t\\t\\tif (intersect_segment_segment(start0, end0, start1, end1, &cross)) {\\n\\n\\t\\t\\t\\t// test if cross is end\\n\\n\\t\\t\\t\\tbool is_cross0 = is_two_points_same(cross, end0),\\n\\n\\t\\t\\t\\t\\t is_cross1 = is_two_points_same(cross, end1);\\n\\n\\t\\t\\t\\tif (is_cross0 && is_cross1) {\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next0 = poly0[get_next_idx_in_ring(sz0, next_idx0, step0)];\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next1 = poly1[get_next_idx_in_ring(sz1, next_idx1, step1)];\\n\\n\\t\\t\\t\\t\\tfloat angle0 = get_angle(end0, end_next0, start0);\\n\\n\\t\\t\\t\\t\\tif (angle0 > get_angle(end0, end_next0, start1) ||\\n\\n\\t\\t\\t\\t\\t\\tangle0 > get_angle(end0, end_next0, end_next1)) {\\n\\n\\t\\t\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tfloat angle1 = get_angle(end1, end_next1, start1);\\n\\n\\t\\t\\t\\t\\tif (angle1 > get_angle(end1, end_next1, start0) ||\\n\\n\\t\\t\\t\\t\\t\\tangle1 > get_angle(end1, end_next1, end_next0)) {\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 78,\n \"score\": 4273.610172782884\n },\n {\n \"content\": \"bool is_polygon_clockwise(const std::vector<vec2>& poly)\\n\\n{\\n\\n float sum = 0.0f;\\n\\n for (size_t i = 0, n = poly.size(); i < n; ++i)\\n\\n {\\n\\n auto& p0 = poly[i];\\n\\n auto& p1 = poly[(i + 1) % n];\\n\\n sum += (p1.x - p0.x) * (p1.y + p0.y);\\n\\n }\\n\\n return sum > 0;\\n\\n}\\n\\n\\n\\n}\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 79,\n \"score\": 4273.607846401534\n },\n {\n \"content\": \"\\tvoid Scale(float sx, float sy);\\n\\n\\tvoid Rotate(float angle);\\n\\n\\tvoid Translate(float x, float y);\\n\\n\\n\\n\\tvoid SetTransformation(float x, float y, float angle, float sx, float sy, float ox, float oy, float kx, float ky);\\n\\n\\n\\n\\tvoid Decompose(sm::vec2& scale, float& rotate, sm::vec2& translate) const;\\n\\n\\n\\n\\tstatic void Mul(const Matrix2D& m0, const Matrix2D& m1, Matrix2D& out);\\n\\n\\n\\n}; // Matrix2D\\n\\n\\n\\n#define SM_MAT2D_MUL(m0, m1, out) \\\\\\n\\n\\tout[0] = m0[0] * m1[0] + m0[1] * m1[2]; \\\\\\n\\n\\tout[1] = m0[0] * m1[1] + m0[1] * m1[3]; \\\\\\n\\n\\tout[2] = m0[2] * m1[0] + m0[3] * m1[2]; \\\\\\n\\n\\tout[3] = m0[2] * m1[1] + m0[3] * m1[3]; \\\\\\n\\n\\tout[4] = m0[4] * m1[0] + m0[5] * m1[2] + m1[4]; \\\\\\n\\n\\tout[5] = m0[4] * m1[1] + m0[5] * m1[3] + m1[5]; \\\\\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"SM_Matrix2D.inl\\\"\\n\\n\\n\\n#endif // _SPATIAL_MATH_MATRIX_2D_H_\",\n \"file_path\": \"SM_Matrix2D.h\",\n \"rank\": 80,\n \"score\": 4273.349604494869\n },\n {\n \"content\": \"\\n\\n\\tfloat left = FLT_MAX;\\n\\n\\tint left_idx = 0;\\n\\n\\tint sz = poly.size();\\n\\n\\tfor (int i = 0; i < sz; ++i) {\\n\\n\\t\\tif (poly[i].x < left) {\\n\\n\\t\\t\\tleft = poly[i].x;\\n\\n\\t\\t\\tleft_idx = i;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tconst vec2& curr = poly[left_idx];\\n\\n\\tconst vec2& next = poly[(left_idx+1)%sz];\\n\\n\\tconst vec2& prev = poly[(left_idx+sz-1)%sz];\\n\\n\\tvec2 up(curr.x, curr.y + 1);\\n\\n\\treturn get_angle(curr, up, next) < get_angle(curr, up, prev);\\n\\n}\\n\\n\\n\\nstatic inline\\n\\nint get_next_idx_in_ring(int sz, int curr, int step)\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 81,\n \"score\": 4273.313105672091\n },\n {\n \"content\": \"\\t\\tconst vec2& start0 = in[idx0];\\n\\n\\t\\tint next_idx0 = get_next_idx_in_ring(sz0, idx0, step0);\\n\\n\\t\\tconst vec2& end0 = in[next_idx0];\\n\\n\\t\\tfor (int j = 0; j < sz1; ++j) {\\n\\n\\t\\t\\tconst vec2& start1 = out[idx1];\\n\\n\\t\\t\\tint next_idx1 = get_next_idx_in_ring(sz1, idx1, step1);\\n\\n\\t\\t\\tconst vec2& end1 = out[next_idx1];\\n\\n\\n\\n\\t\\t\\tvec2 cross;\\n\\n\\t\\t\\tif (intersect_segment_segment(start0, end0, start1, end1, &cross)) {\\n\\n\\t\\t\\t\\t// test if cross is end\\n\\n\\t\\t\\t\\tbool is_cross0 = is_two_points_same(cross, end0),\\n\\n\\t\\t\\t\\t\\tis_cross1 = is_two_points_same(cross, end1);\\n\\n\\t\\t\\t\\tif (is_cross0 && is_cross1) {\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next0 = in[get_next_idx_in_ring(sz0, next_idx0, step0)];\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next1 = out[get_next_idx_in_ring(sz1, next_idx1, step1)];\\n\\n\\t\\t\\t\\t\\tfloat angle0 = get_angle(end0, end_next0, start0);\\n\\n\\n\\n\\t\\t\\t\\t\\tfloat angle_start1 = get_angle(end0, end_next0, start1),\\n\\n\\t\\t\\t\\t\\t\\tangle_end_next1 = get_angle(end0, end_next0, end_next1);\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 82,\n \"score\": 4273.269045797124\n },\n {\n \"content\": \"#include \\\"SM_Vector.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nextern \\\"C\\\"\\n\",\n \"file_path\": \"sm_c_vector.cpp\",\n \"rank\": 83,\n \"score\": 4272.050129353312\n },\n {\n \"content\": \"#include \\\"SM_Triangulation.h\\\"\\n\\n#include \\\"SM_Calc.h\\\"\\n\\n#include \\\"SM_Test.h\\\"\\n\\n\\n\\n#include \\\"external/triangle/triangle.cpp\\\"\\n\\n\\n\\n#include <iterator>\\n\\n\\n\\n#include <assert.h>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nstatic void init(struct triangulateio& in, struct triangulateio& out)\\n\\n{\\n\\n\\tin.pointlist = NULL;\\n\\n\\tin.pointattributelist = NULL;\\n\\n\\tin.pointmarkerlist = NULL;\\n\\n\\tin.trianglelist = NULL;\\n\\n\\tin.triangleattributelist = NULL;\\n\",\n \"file_path\": \"SM_Triangulation.cpp\",\n \"rank\": 84,\n \"score\": 4271.479468050824\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_MATRIX_2D_H_\\n\\n#define _SPATIAL_MATH_MATRIX_2D_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n#include \\\"SM_Matrix.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\",\n \"file_path\": \"SM_Matrix2D.h\",\n \"rank\": 85,\n \"score\": 4271.4542170356435\n },\n {\n \"content\": \"\\t\\t\\t*max = v.x;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\\n\\n\\nstatic inline\\n\\nbool is_project_intersect(float min0, float max0, float min1, float max1)\\n\\n{\\n\\n\\treturn !(max1 <= min0 || min1 >= max0);\\n\\n}\\n\\n\\n\\nstatic inline\\n\\nbool is_convex_intersect_convex(const std::vector<vec2>& c0, const std::vector<vec2>& c1, float angle)\\n\\n{\\n\\n\\tfloat min0, max0, min1, max1;\\n\\n\\tproject_convex(c0, angle, &min0, &max0);\\n\\n\\tproject_convex(c1, angle, &min1, &max1);\\n\\n\\treturn is_project_intersect(min0, max0, min1, max1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 86,\n \"score\": 4270.720649442901\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t// \\t\\t\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t\\t\\t// \\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t} else if (is_cross0) {\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next0 = poly0[get_next_idx_in_ring(sz0, next_idx0, step0)];\\n\\n\\t\\t\\t\\t\\tif (is_turn_left(end_next0, end0, end1)) {\\n\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t} else if (is_cross1) {\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next1 = poly0[get_next_idx_in_ring(sz1, next_idx1, step1)];\\n\\n\\t\\t\\t\\t\\tif (is_turn_left(end_next1, end1, end0)) {\\n\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t} else if (!is_two_points_same(cross, start0)\\n\\n\\t\\t\\t\\t\\t&& !is_two_points_same(cross, start1)) {\\n\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tidx1 = next_idx1;\\n\\n\\t\\t}\\n\\n\\t\\tidx0 = next_idx0;\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 87,\n \"score\": 4270.667355884127\n },\n {\n \"content\": \"#ifndef _SPATIAL_MATH_FIX_MATH_H_\\n\\n#define _SPATIAL_MATH_FIX_MATH_H_\\n\\n\\n\\n#include \\\"SM_Vector.h\\\"\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\",\n \"file_path\": \"SM_MatrixFix.h\",\n \"rank\": 88,\n \"score\": 4270.661742977758\n },\n {\n \"content\": \"\\t\\t\\t\\t\\tif ((angle0 > angle_start1 && angle_start1) != 0 ||\\n\\n\\t\\t\\t\\t\\t\\t(angle0 > angle_end_next1 && angle_end_next1 != 0)) {\\n\\n\\t\\t\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t} else if (is_cross0) {\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next0 = in[get_next_idx_in_ring(sz0, next_idx0, step0)];\\n\\n\\t\\t\\t\\t\\tif (is_turn_left(end_next0, end0, end1)) {\\n\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t} else if (is_cross1) {\\n\\n\\t\\t\\t\\t\\tconst vec2& end_next1 = in[get_next_idx_in_ring(sz1, next_idx1, step1)];\\n\\n\\t\\t\\t\\t\\tif (is_turn_left(end_next1, end1, end0)) {\\n\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t} else if (!is_two_points_same(cross, start0)\\n\\n\\t\\t\\t\\t\\t&& !is_two_points_same(cross, start1)) {\\n\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tidx1 = next_idx1;\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 89,\n \"score\": 4270.295255269406\n },\n {\n \"content\": \"\\t\\tin.pointlist[ptr_p++] = p.x;\\n\\n\\t\\tin.pointlist[ptr_p++] = p.y;\\n\\n\\t}\\n\\n for (auto& hole : holes_fixed) {\\n\\n for (auto& p : hole) {\\n\\n in.pointlist[ptr_p++] = p.x;\\n\\n in.pointlist[ptr_p++] = p.y;\\n\\n }\\n\\n }\\n\\n\\n\\n\\tin.numberofsegments = in.numberofpoints;\\n\\n\\tin.segmentlist = (int *) malloc(in.numberofsegments * 2 * sizeof(int));\\n\\n\\tsize_t ptr_s = 0;\\n\\n size_t start_p_idx = 0;\\n\\n size_t curr_p_idx = 0;\\n\\n\\tfor (size_t i = 0; i < bound_fixed.size() - 1; ++i)\\n\\n {\\n\\n\\t\\tin.segmentlist[ptr_s++] = curr_p_idx;\\n\\n\\t\\tin.segmentlist[ptr_s++] = curr_p_idx + 1;\\n\\n ++curr_p_idx;\\n\",\n \"file_path\": \"SM_Triangulation.cpp\",\n \"rank\": 90,\n \"score\": 4269.201959248575\n },\n {\n \"content\": \"\\t\\tif (is_point_in_area(center, bound))\\n\\n {\\n\\n bool in_hole = false;\\n\\n for (auto& hole : holes)\\n\\n {\\n\\n if (is_point_in_area(center, hole)) {\\n\\n in_hole = true;\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n if (!in_hole) {\\n\\n copy(tri.begin(), tri.end(), back_inserter(result));\\n\\n }\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfinish(in, out);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"SM_Triangulation.cpp\",\n \"rank\": 91,\n \"score\": 4269.009487008918\n },\n {\n \"content\": \"\\t}\\n\\n\\n\\n\\tfor (int i = 0; i < sz0; ++i) {\\n\\n\\t\\tif (is_point_intersect_polyline(poly0[i], poly1)) { continue; }\\n\\n\\t\\treturn is_point_in_area(poly0[i], poly1);\\n\\n\\t}\\n\\n\\tfor (int i = 0; i < sz1; ++i) {\\n\\n\\t\\tif (is_point_intersect_polyline(poly1[i], poly0)) { continue; }\\n\\n\\t\\treturn is_point_in_area(poly1[i], poly0);\\n\\n\\t}\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\nbool is_polygon_convex(const std::vector<vec2>& poly)\\n\\n{\\n\\n if (poly.size() < 2) {\\n\\n return false;\\n\\n }\\n\\n if (poly.size() == 3) {\\n\\n return true;\\n\",\n \"file_path\": \"SM_Test.cpp\",\n \"rank\": 92,\n \"score\": 4268.625797210231\n },\n {\n \"content\": \"\\t\\t\\t skip = true;\\n\\n\\t\\t\\t break;\\n\\n\\t\\t }\\n\\n\\t }\\n\\n\\t if (skip) {\\n\\n\\t\\t continue;\\n\\n\\t }\\n\\n\\t dst.push_back(src[i]);\\n\\n }\\n\\n}\\n\\n\\n\\nstatic void verify_inner(const std::vector<vec2>& outer, std::vector<vec2>& inner)\\n\\n{\\n\\n\\tstd::vector<vec2>::iterator itr = inner.begin();\\n\\n\\tfor ( ; itr != inner.end(); )\\n\\n\\t{\\n\\n\\t\\tbool find = false;\\n\\n\\t\\tfor (int i = 0, n = outer.size(); i < n; ++i) {\\n\\n\\t\\t\\tif (*itr == outer[i]) {\\n\\n\\t\\t\\t\\tfind = true;\\n\",\n \"file_path\": \"SM_Triangulation.cpp\",\n \"rank\": 93,\n \"score\": 4268.537920147126\n },\n {\n \"content\": \"\\t}\\n\\n\\tin.segmentlist[ptr_s++] = curr_p_idx;\\n\\n\\tin.segmentlist[ptr_s++] = start_p_idx;\\n\\n ++curr_p_idx;\\n\\n start_p_idx = curr_p_idx;\\n\\n\\n\\n for (auto& hole : holes_fixed)\\n\\n {\\n\\n\\t for (size_t i = 0; i < hole.size() - 1; ++i)\\n\\n {\\n\\n\\t\\t in.segmentlist[ptr_s++] = curr_p_idx;\\n\\n\\t\\t in.segmentlist[ptr_s++] = curr_p_idx + 1;\\n\\n ++curr_p_idx;\\n\\n\\t }\\n\\n\\t in.segmentlist[ptr_s++] = curr_p_idx;\\n\\n\\t in.segmentlist[ptr_s++] = start_p_idx;\\n\\n ++curr_p_idx;\\n\\n start_p_idx = curr_p_idx;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"SM_Triangulation.cpp\",\n \"rank\": 94,\n \"score\": 4267.367902920074\n },\n {\n \"content\": \"\\t\\tin.segmentlist[index++] = start;\\n\\n\\t\\t++loopIndex;\\n\\n\\t}\\n\\n\\n\\n\\tin.segmentmarkerlist = (int *) NULL;\\n\\n\\n\\n\\tin.numberofholes = 0;\\n\\n\\tin.numberofregions = 0;\\n\\n\\n\\n\\timplement(in, out, tc);\\n\\n\\tfinish(in, out, bound_fixed, result);\\n\\n}\\n\\n\\n\\n}\",\n \"file_path\": \"SM_Triangulation.cpp\",\n \"rank\": 95,\n \"score\": 4267.321745967001\n },\n {\n \"content\": \"static void finish(struct triangulateio& in,\\n\\n struct triangulateio& out,\\n\\n\\t\\t\\t\\t const std::vector<vec2>& bound,\\n\\n\\t\\t\\t\\t std::vector<vec2>& out_vertices,\\n\\n\\t\\t\\t\\t std::vector<int>& out_triangles)\\n\\n{\\n\\n\\tout_vertices.reserve(out.numberofpoints);\\n\\n\\tint ptr = 0;\\n\\n\\tfor (int i = 0; i < out.numberofpoints; ++i)\\n\\n\\t{\\n\\n\\t\\tfloat x = out.pointlist[ptr++],\\n\\n\\t\\t\\t y = out.pointlist[ptr++];\\n\\n\\t\\tout_vertices.push_back(vec2(x, y));\\n\\n\\t}\\n\\n\\n\\n\\tint index = 0;\\n\\n\\tout_triangles.reserve(out.numberoftriangles);\\n\\n\\tfor (int i = 0; i < out.numberoftriangles; ++i)\\n\\n\\t{\\n\\n\\t\\tstd::vector<int> tri;\\n\",\n \"file_path\": \"SM_Triangulation.cpp\",\n \"rank\": 96,\n \"score\": 4267.295163996944\n },\n {\n \"content\": \"#include \\\"SM_DouglasPeucker.h\\\"\\n\\n#include \\\"SM_Calc.h\\\"\\n\\n\\n\\n#include <float.h>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nstatic inline\\n\\nvoid points_reduction(const std::vector<vec2>& line,\\n\\n\\t\\t\\t\\t\\t float precision,\\n\\n\\t\\t\\t\\t\\t std::vector<bool>& flag,\\n\\n\\t\\t\\t\\t\\t int begin,\\n\\n\\t\\t\\t\\t\\t int end)\\n\\n{\\n\\n\\tif (begin > end)\\n\\n\\t\\treturn;\\n\\n\\n\\n\\tif (begin == end)\\n\\n\\t{\\n\",\n \"file_path\": \"SM_DouglasPeucker.cpp\",\n \"rank\": 97,\n \"score\": 16.95288831341636\n },\n {\n \"content\": \"// code from https://github.com/ejoy/ejoy2d/blob/master/lib/matrix.c\\n\\n\\n\\n#include \\\"SM_MatrixFix.h\\\"\\n\\n#include \\\"sm_const.h\\\"\\n\\n\\n\\n#include <string.h>\\n\\n#include <stdint.h>\\n\\n\\n\\nnamespace sm\\n\\n{\\n\\n\\n\\nconst float MatrixFix::SCALE_INV = 1.0f / SCALE;\\n\\nconst float MatrixFix::TRANSLATE_SCALE_INV = 1.0f / TRANSLATE_SCALE;\\n\\n\\n\\nMatrixFix::MatrixFix()\\n\\n{\\n\\n\\tIdentity();\\n\\n}\\n\\n\\n\\nMatrixFix::MatrixFix(const MatrixFix& mt)\\n\",\n \"file_path\": \"SM_MatrixFix.cpp\",\n \"rank\": 98,\n \"score\": 15.96545991536301\n },\n {\n \"content\": \"\\t\\t\\tis_other_dir = b;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tbool b = TextOtherDir(hull, hull[0], hull[hull.size()-1], area_min, bounding);\\n\\n\\tif (b) {\\n\\n\\t\\tis_other_dir = b;\\n\\n\\t}\\n\\n\\n\\n\\tassert(is_turn_right(bounding[0], bounding[1], bounding[2]));\\n\\n\\n\\n\\treturn b;\\n\\n}\\n\\n\\n\\nbool MinBoundingBox::TextOtherDir(const CU_VEC<vec2>& points, \\n\\n\\t\\t\\t\\t\\t\\t\\t\\t const vec2& start, const vec2& end,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t float& min_area, vec2 bounding[4])\\n\\n{\\n\\n\\tfloat dx = start.x - end.x,\\n\\n\\t\\t dy = start.y - end.y;\\n\\n\\tif (fabs(dx) < FLT_EPSILON ||\\n\",\n \"file_path\": \"SM_MinBoundingBox.cpp\",\n \"rank\": 99,\n \"score\": 15.77004440691335\n }\n]","isConversational":false}}},{"rowIdx":288,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Source/VoxelWorld/World/Chunk/ChunkLoader.cpp"},"repo_name":{"kind":"string","value":"AirGuanZ/VoxelWorld"},"commit":{"kind":"string","value":"8defdee9e2b8fb20607d33ba0f3a316b95273693"},"file_code":{"kind":"string","value":"\n#include <algorithm>\n#include <cassert>\n\n#include <Utility\\HelperFunctions.h>\n\n#include <World\\Land\\V0\\LandGenerator_V0.h>\n#include <World\\Land\\V1\\LandGenerator_V1.h>\n#include <World\\Land\\V2\\LandGenerator_V2.h>\n#include <World\\Land\\V3\\LandGenerator_V3.h>\n\n#include \"ChunkLoader.h\"\n#include \"ChunkManager.h\"\n#include \"ChunkModelBuilder.h\"\n\nChunkLoader::ChunkLoader(size_t ckPoolSize)\n : ckPool_(ckPoolSize), landGen_(std::make_unique<LandGenerator_V0::LandGenerator>(4792539))\n{\n\n}\n\nChunkLoader::~ChunkLoader(void)\n{\n Destroy();\n}\n\nvoid ChunkLoader::Initialize(int threadNum)\n{\n assert(threads_.empty());\n if(threadNum <= 0)\n threadNum = (std::max)(4u, std::thread::hardware_concurrency()) - 2;\n\n running_ = true;\n while(threadNum-- > 0)\n threads_.emplace_back(&ChunkLoader::TaskThreadEntry, this);\n}\n\nvoid ChunkLoader::Destroy(void)\n{\n running_ = false;\n for(std::thread &th : threads_)\n {\n if(th.joinable())\n th.join();\n }\n threads_.clear();\n\n loaderTasks_.ForEach([](ChunkLoaderTask *t) { Helper::SafeDeleteObjects(t); });\n loaderTasks_.Clear();\n\n ckPool_.Destroy();\n}\n\nvoid ChunkLoader::AddTask(ChunkLoaderTask *task)\n{\n assert(task != nullptr);\n\n std::lock_guard<std::mutex> lk(taskQueueMutex_);\n loaderTasks_.PushFront(task->GetPosition(), task);\n}\n\nvoid ChunkLoader::AddMsg(ChunkLoaderMessage *msg)\n{\n assert(msg != nullptr);\n\n std::lock_guard<std::mutex> lk(msgQueueMutex_);\n loaderMsgs_.push(msg);\n}\n\nChunkLoaderMessage *ChunkLoader::FetchMsg(void)\n{\n std::lock_guard<std::mutex> lk(msgQueueMutex_);\n\n if(loaderMsgs_.empty())\n return nullptr;\n\n ChunkLoaderMessage *rt = loaderMsgs_.front();\n loaderMsgs_.pop();\n return rt;\n}\n\nstd::queue<ChunkLoaderMessage*> ChunkLoader::FetchAllMsgs(void)\n{\n std::lock_guard<std::mutex> lk(msgQueueMutex_);\n return std::move(loaderMsgs_);\n}\n\nvoid ChunkLoader::TaskThreadEntry(void)\n{\n while(running_)\n {\n ChunkLoaderTask *task = nullptr;\n\n {\n std::lock_guard<std::mutex> lk(taskQueueMutex_);\n if(loaderTasks_.Size())\n {\n task = loaderTasks_.Back();\n loaderTasks_.PopBack();\n }\n }\n\n if(task)\n {\n task->Run(this);\n Helper::SafeDeleteObjects(task);\n }\n else\n std::this_thread::sleep_for(std::chrono::milliseconds(2));\n }\n}\n\nChunkLoaderTask::ChunkLoaderTask(Chunk *ck)\n : ck_(ck)\n{\n assert(ck != nullptr);\n}\n\nvoid ChunkLoaderTask::Run(ChunkLoader *loader)\n{\n assert(loader != nullptr);\n\n std::vector<IntVector3> lightUpdates;\n loader->LoadChunkData(ck_);\n\n ChunkLoaderMessage *msg = new ChunkLoaderMessage;\n msg->type = ChunkLoaderMessage::ChunkLoaded;\n msg->ckLoaded = ck_;\n ck_ = nullptr;\n loader->AddMsg(msg);\n}\n\nChunkLoaderTask::~ChunkLoaderTask(void)\n{\n Helper::SafeDeleteObjects(ck_);\n}\n\nnamespace\n{\n inline bool OutOfBound(int x, int y, int z)\n {\n return (x | y | z | (3 * CHUNK_SECTION_SIZE - 1 - x) |\n (3 * CHUNK_SECTION_SIZE - 1 - z) |\n (CHUNK_MAX_HEIGHT - 1 - y)) < 0;\n }\n\n inline BlockLight GetLight(Chunk *(&cks)[3][3], int x, int y, int z)\n {\n if(OutOfBound(x, y, z))\n return LIGHT_ALL_MAX;\n return cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->GetBlockLight(x % CHUNK_SECTION_SIZE, y, z % CHUNK_SECTION_SIZE);\n }\n\n inline int GetHeight(Chunk *(&cks)[3][3], int x, int z)\n {\n if(OutOfBound(x, 0, z))\n return 0;\n return cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->GetHeight(x % CHUNK_SECTION_SIZE, z % CHUNK_SECTION_SIZE);\n }\n\n inline BlockType GetType(Chunk *(&cks)[3][3], int x, int y, int z)\n {\n if(OutOfBound(x, y, z))\n return BlockType::Air;\n return cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->GetBlockType(x % CHUNK_SECTION_SIZE, y, z % CHUNK_SECTION_SIZE);\n }\n\n inline void SetLight(Chunk *(&cks)[3][3], int x, int y, int z, BlockLight light)\n {\n if(OutOfBound(x, y, z))\n return;\n cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->SetBlockLight(x % CHUNK_SECTION_SIZE, y, z % CHUNK_SECTION_SIZE, light);\n }\n\n void LightProg(Chunk *(&cks)[3][3])\n {\n BlockInfoManager &infoMgr = BlockInfoManager::GetInstance();\n std::deque<IntVector3> progQueue;\n\n auto DirectionalUpdate = [&](BlockLight cenLight, int ax, int ay, int az) -> void\n {\n BlockLight nX = GetLight(cks, ax, ay, az);\n BlockLight newNX = BlockLightMax(nX, BlockLightMinus(\n cenLight, infoMgr.GetBlockInfo(GetType(cks, ax, ay, az)).lightDec));\n if(newNX != nX)\n {\n SetLight(cks, ax, ay, az, newNX);\n if(!OutOfBound(ax, ay, az))\n progQueue.push_back({ ax, ay, az });\n }\n };\n\n auto TryAsSource = [&](int x, int y, int z)\n {\n if(!OutOfBound(x, y, z) && GetLight(cks, x, y, z) != LIGHT_ALL_MIN)\n {\n progQueue.push_back({ x, y, z });\n while(progQueue.size())\n {\n auto [x, y, z] = progQueue.front();\n progQueue.pop_front();\n\n BlockLight cenLight = GetLight(cks, x, y, z);\n\n DirectionalUpdate(cenLight, x - 1, y, z);\n DirectionalUpdate(cenLight, x + 1, y, z);\n DirectionalUpdate(cenLight, x, y - 1, z);\n DirectionalUpdate(cenLight, x, y + 1, z);\n DirectionalUpdate(cenLight, x, y, z - 1);\n DirectionalUpdate(cenLight, x, y, z + 1);\n }\n }\n };\n\n for(int x = 0; x < 3 * CHUNK_SECTION_SIZE; ++x)\n {\n for(int z = 0; z < 3 * CHUNK_SECTION_SIZE; ++z)\n {\n int H = GetHeight(cks, x, z);\n for(int y = 0; y <= H; ++y)\n {\n if(infoMgr.GetBlockInfo(GetType(cks, x, y, z)).lightDec < LIGHT_COMPONENT_MAX)\n {\n TryAsSource(x - 1, y, z);\n TryAsSource(x + 1, y, z);\n TryAsSource(x, y - 1, z);\n TryAsSource(x, y + 1, z);\n TryAsSource(x, y, z - 1);\n TryAsSource(x, y, z + 1);\n }\n }\n }\n }\n }\n}\n\nvoid ChunkLoader::LoadChunkData(Chunk *ck)\n{\n IntVectorXZ ckPos = ck->GetPosition();\n Chunk *neis = new Chunk[8]\n {\n { ck->GetChunkManager(), { ckPos.x - 1, ckPos.z } }, \n { ck->GetChunkManager(), { ckPos.x + 1, ckPos.z } }, \n { ck->GetChunkManager(), { ckPos.x, ckPos.z - 1 } }, \n { ck->GetChunkManager(), { ckPos.x, ckPos.z + 1 } }, \n { ck->GetChunkManager(), { ckPos.x - 1, ckPos.z - 1 } }, \n { ck->GetChunkManager(), { ckPos.x - 1, ckPos.z + 1 } }, \n { ck->GetChunkManager(), { ckPos.x + 1, ckPos.z - 1 } }, \n { ck->GetChunkManager(), { ckPos.x + 1, ckPos.z + 1 } }, \n };\n\n for(int i = 0; i != 8; ++i)\n {\n Chunk &dst = neis[i];\n if(!ckPool_.GetChunk(dst))\n {\n landGen_->GenerateLand(&dst);\n\n Chunk *addedCk = new Chunk(dst.GetChunkManager(), dst.GetPosition());\n CopyChunkData(*addedCk, dst);\n ckPool_.AddChunk(addedCk);\n }\n }\n\n if(!ckPool_.GetChunk(*ck))\n {\n landGen_->GenerateLand(ck);\n\n Chunk *addedCk = new Chunk(ck->GetChunkManager(), ck->GetPosition());\n CopyChunkData(*addedCk, *ck);\n ckPool_.AddChunk(addedCk);\n }\n \n Chunk *cks[3][3] =\n {\n { neis + 4, neis + 0, neis + 5 },\n { neis + 2, ck, neis + 3 },\n { neis + 6, neis + 1, neis + 7 }\n };\n\n LightProg(cks);\n \n for(int section = 0; section != CHUNK_SECTION_NUM; ++section)\n ck->SetModels(section, BackgroundChunkModelBuilder().Build(cks, section));\n\n delete[] neis;\n}\n\nvoid ChunkLoader::TryAddLoadingTask(ChunkManager *ckMgr, int x, int z)\n{\n assert(ckMgr != nullptr);\n std::lock_guard<std::mutex> lk(taskQueueMutex_);\n ChunkLoaderTask *oldTask = nullptr;\n if(!loaderTasks_.Exists({ x, z }))\n {\n loaderTasks_.PushFront(\n IntVectorXZ{ x, z }, new ChunkLoaderTask(new Chunk(ckMgr, { x, z })));\n }\n}\n"},"prefix":{"kind":"string","value":"\n#include <algorithm>\n#include <cassert>\n\n#include <Utility\\HelperFunctions.h>\n\n#include <World\\Land\\V0\\LandGenerator_V0.h>\n#include <World\\Land\\V1\\LandGenerator_V1.h>\n#include <World\\Land\\V2\\LandGenerator_V2.h>\n#include <World\\Land\\V3\\LandGenerator_V3.h>\n\n#include \"ChunkLoader.h\"\n#include \"ChunkManager.h\"\n#include \"ChunkModelBuilder.h\"\n\nChunkLoader::ChunkLoader(size_t ckPoolSize)\n : ckPool_(ckPoolSize), landGen_(std::make_unique<LandGenerator_V0::LandGenerator>(4792539))\n{\n\n}\n\nChunkLoader::~ChunkLoader(void)\n{\n Destroy();\n}\n\nvoid ChunkLoader::Initialize(int threadNum)\n{\n assert(threads_.empty());\n if(threadNum <= 0)\n threadNum = (std::max)(4u, std::thread::hardware_concurrency()) - 2;\n\n running_ = true;\n while(threadNum-- > 0)\n threads_.emplace_back(&ChunkLoader::TaskThreadEntry, this);\n}\n\nvoid ChunkLoader::Destroy(void)\n{\n running_ = false;\n for(std::thread &th : threads_)\n {\n if(th.joinable())\n th.join();\n }\n threads_.clear();\n\n loaderTasks_.ForEach([](ChunkLoaderTask *t) { Helper::SafeDeleteObjects(t); });\n loaderTasks_.Clear();\n\n ckPool_.Destroy();\n}\n\nvoid ChunkLoader::AddTask(ChunkLoaderTask *task)\n{\n assert(task != nullptr);\n\n std::lock_guard<std::mutex> lk(taskQueueMutex_);\n loaderTasks_.PushFront(task->GetPosition(), task);\n}\n\nvoid ChunkLoader::AddMsg(ChunkLoaderMessage *msg)\n{\n assert(msg != nullptr);\n\n std::lock_guard<std::mutex> lk(msgQueueMutex_);\n loaderMsgs_.push(msg);\n}\n\nChunkLoaderMessage *ChunkLoader::FetchMsg(void)\n{\n std::lock_guard<std::mutex> lk(msgQueueMutex_);\n\n if(loaderMsgs_.empty())\n return nullptr;\n\n ChunkLoaderMessage *rt = loaderMsgs_.front();\n loaderMsgs_.pop();\n return rt;\n}\n\nstd::queue<ChunkLoaderMessage*> ChunkLoader::FetchAllMsgs(void)\n{\n std::lock_guard<std::mutex> lk(msgQueueMutex_);\n return std::move(loaderMsgs_);\n}\n\nvoid ChunkLoade"},"suffix":{"kind":"string","value":" {\n if(infoMgr.GetBlockInfo(GetType(cks, x, y, z)).lightDec < LIGHT_COMPONENT_MAX)\n {\n TryAsSource(x - 1, y, z);\n TryAsSource(x + 1, y, z);\n TryAsSource(x, y - 1, z);\n TryAsSource(x, y + 1, z);\n TryAsSource(x, y, z - 1);\n TryAsSource(x, y, z + 1);\n }\n }\n }\n }\n }\n}\n\nvoid ChunkLoader::LoadChunkData(Chunk *ck)\n{\n IntVectorXZ ckPos = ck->GetPosition();\n Chunk *neis = new Chunk[8]\n {\n { ck->GetChunkManager(), { ckPos.x - 1, ckPos.z } }, \n { ck->GetChunkManager(), { ckPos.x + 1, ckPos.z } }, \n { ck->GetChunkManager(), { ckPos.x, ckPos.z - 1 } }, \n { ck->GetChunkManager(), { ckPos.x, ckPos.z + 1 } }, \n { ck->GetChunkManager(), { ckPos.x - 1, ckPos.z - 1 } }, \n { ck->GetChunkManager(), { ckPos.x - 1, ckPos.z + 1 } }, \n { ck->GetChunkManager(), { ckPos.x + 1, ckPos.z - 1 } }, \n { ck->GetChunkManager(), { ckPos.x + 1, ckPos.z + 1 } }, \n };\n\n for(int i = 0; i != 8; ++i)\n {\n Chunk &dst = neis[i];\n if(!ckPool_.GetChunk(dst))\n {\n landGen_->GenerateLand(&dst);\n\n Chunk *addedCk = new Chunk(dst.GetChunkManager(), dst.GetPosition());\n CopyChunkData(*addedCk, dst);\n ckPool_.AddChunk(addedCk);\n }\n }\n\n if(!ckPool_.GetChunk(*ck))\n {\n landGen_->GenerateLand(ck);\n\n Chunk *addedCk = new Chunk(ck->GetChunkManager(), ck->GetPosition());\n CopyChunkData(*addedCk, *ck);\n ckPool_.AddChunk(addedCk);\n }\n \n Chunk *cks[3][3] =\n {\n { neis + 4, neis + 0, neis + 5 },\n { neis + 2, ck, neis + 3 },\n { neis + 6, neis + 1, neis + 7 }\n };\n\n LightProg(cks);\n \n for(int section = 0; section != CHUNK_SECTION_NUM; ++section)\n ck->SetModels(section, BackgroundChunkModelBuilder().Build(cks, section));\n\n delete[] neis;\n}\n\nvoid ChunkLoader::TryAddLoadingTask(ChunkManager *ckMgr, int x, int z)\n{\n assert(ckMgr != nullptr);\n std::lock_guard<std::mutex> lk(taskQueueMutex_);\n ChunkLoaderTask *oldTask = nullptr;\n if(!loaderTasks_.Exists({ x, z }))\n {\n loaderTasks_.PushFront(\n IntVectorXZ{ x, z }, new ChunkLoaderTask(new Chunk(ckMgr, { x, z })));\n }\n}\n"},"middle":{"kind":"string","value":"r::TaskThreadEntry(void)\n{\n while(running_)\n {\n ChunkLoaderTask *task = nullptr;\n\n {\n std::lock_guard<std::mutex> lk(taskQueueMutex_);\n if(loaderTasks_.Size())\n {\n task = loaderTasks_.Back();\n loaderTasks_.PopBack();\n }\n }\n\n if(task)\n {\n task->Run(this);\n Helper::SafeDeleteObjects(task);\n }\n else\n std::this_thread::sleep_for(std::chrono::milliseconds(2));\n }\n}\n\nChunkLoaderTask::ChunkLoaderTask(Chunk *ck)\n : ck_(ck)\n{\n assert(ck != nullptr);\n}\n\nvoid ChunkLoaderTask::Run(ChunkLoader *loader)\n{\n assert(loader != nullptr);\n\n std::vector<IntVector3> lightUpdates;\n loader->LoadChunkData(ck_);\n\n ChunkLoaderMessage *msg = new ChunkLoaderMessage;\n msg->type = ChunkLoaderMessage::ChunkLoaded;\n msg->ckLoaded = ck_;\n ck_ = nullptr;\n loader->AddMsg(msg);\n}\n\nChunkLoaderTask::~ChunkLoaderTask(void)\n{\n Helper::SafeDeleteObjects(ck_);\n}\n\nnamespace\n{\n inline bool OutOfBound(int x, int y, int z)\n {\n return (x | y | z | (3 * CHUNK_SECTION_SIZE - 1 - x) |\n (3 * CHUNK_SECTION_SIZE - 1 - z) |\n (CHUNK_MAX_HEIGHT - 1 - y)) < 0;\n }\n\n inline BlockLight GetLight(Chunk *(&cks)[3][3], int x, int y, int z)\n {\n if(OutOfBound(x, y, z))\n return LIGHT_ALL_MAX;\n return cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->GetBlockLight(x % CHUNK_SECTION_SIZE, y, z % CHUNK_SECTION_SIZE);\n }\n\n inline int GetHeight(Chunk *(&cks)[3][3], int x, int z)\n {\n if(OutOfBound(x, 0, z))\n return 0;\n return cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->GetHeight(x % CHUNK_SECTION_SIZE, z % CHUNK_SECTION_SIZE);\n }\n\n inline BlockType GetType(Chunk *(&cks)[3][3], int x, int y, int z)\n {\n if(OutOfBound(x, y, z))\n return BlockType::Air;\n return cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->GetBlockType(x % CHUNK_SECTION_SIZE, y, z % CHUNK_SECTION_SIZE);\n }\n\n inline void SetLight(Chunk *(&cks)[3][3], int x, int y, int z, BlockLight light)\n {\n if(OutOfBound(x, y, z))\n return;\n cks[x / CHUNK_SECTION_SIZE][z / CHUNK_SECTION_SIZE]\n ->SetBlockLight(x % CHUNK_SECTION_SIZE, y, z % CHUNK_SECTION_SIZE, light);\n }\n\n void LightProg(Chunk *(&cks)[3][3])\n {\n BlockInfoManager &infoMgr = BlockInfoManager::GetInstance();\n std::deque<IntVector3> progQueue;\n\n auto DirectionalUpdate = [&](BlockLight cenLight, int ax, int ay, int az) -> void\n {\n BlockLight nX = GetLight(cks, ax, ay, az);\n BlockLight newNX = BlockLightMax(nX, BlockLightMinus(\n cenLight, infoMgr.GetBlockInfo(GetType(cks, ax, ay, az)).lightDec));\n if(newNX != nX)\n {\n SetLight(cks, ax, ay, az, newNX);\n if(!OutOfBound(ax, ay, az))\n progQueue.push_back({ ax, ay, az });\n }\n };\n\n auto TryAsSource = [&](int x, int y, int z)\n {\n if(!OutOfBound(x, y, z) && GetLight(cks, x, y, z) != LIGHT_ALL_MIN)\n {\n progQueue.push_back({ x, y, z });\n while(progQueue.size())\n {\n auto [x, y, z] = progQueue.front();\n progQueue.pop_front();\n\n BlockLight cenLight = GetLight(cks, x, y, z);\n\n DirectionalUpdate(cenLight, x - 1, y, z);\n DirectionalUpdate(cenLight, x + 1, y, z);\n DirectionalUpdate(cenLight, x, y - 1, z);\n DirectionalUpdate(cenLight, x, y + 1, z);\n DirectionalUpdate(cenLight, x, y, z - 1);\n DirectionalUpdate(cenLight, x, y, z + 1);\n }\n }\n };\n\n for(int x = 0; x < 3 * CHUNK_SECTION_SIZE; ++x)\n {\n for(int z = 0; z < 3 * CHUNK_SECTION_SIZE; ++z)\n {\n int H = GetHeight(cks, x, z);\n for(int y = 0; y <= H; ++y)\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class BasicBufferSetter<true> : public BasicBufferView\n\n{\n\npublic:\n\n bool SetData(const void *data, int byteSize)\n\n {\n\n assert(data && byteSize > 0);\n\n\n\n D3D11_MAPPED_SUBRESOURCE rsc;\n\n HRESULT hr = Window::GetInstance().GetD3DDeviceContext()\n\n ->Map(buf_, 0, D3D11_MAP_WRITE_DISCARD, 0, &rsc);\n\n if(FAILED(hr))\n\n return false;\n\n\n\n std::memcpy(rsc.pData, data, byteSize);\n\n Window::GetInstance().GetD3DDeviceContext()\n\n ->Unmap(buf_, 0);\n\n return true;\n\n }\n\n};\n\n\n\ntemplate<>\n","file_path":"Source/Components/WinFramework/D3DObject/BasicBuffer.h","rank":0,"score":57176.0980323595},{"content":" class ConstantBufferObject<BufferType_, _StageSelector, true>\n\n : public ConstantBufferAttributes<BufferType_, _StageSelector, true>,\n\n public ConstantBufferObjectBase<_StageSelector>,\n\n public Uncopiable\n\n {\n\n public:\n\n void SetBufferData(ID3D11DeviceContext *devCon, const BufferType_ &data)\n\n {\n\n assert(devCon != nullptr && buf_ != nullptr);\n\n D3D11_MAPPED_SUBRESOURCE mappedRsc;\n\n devCon->Map(buf_, 0, D3D11_MAP_WRITE_DISCARD, 0, &mappedRsc);\n\n std::memcpy(mappedRsc.pData, &data, sizeof(BufferType_));\n\n devCon->Unmap(buf_, 0);\n\n }\n\n\n\n private:\n\n friend class ConstantBufferManager<_StageSelector>;\n\n\n\n ConstantBufferObject(void)\n\n : ConstantBufferObjectBase(0, nullptr)\n","file_path":"Library/OWE/Src/OWEShader/OWEShaderConstantBuffer.h","rank":1,"score":57176.0980323595},{"content":"","file_path":"Source/VoxelWorld/World/Chunk/ChunkLoader.h","rank":2,"score":44103.48510240957},{"content":"struct VMECmdMsg\n\n{\n\n Color color;\n\n std::string msg;\n\n\n\n static const Color ERROR_COLOR;\n\n static const Color NORMAL_COLOR;\n\n};\n\n\n\nusing VMECmdMsgQueue = std::queue<VMECmdMsg>;\n\n\n","file_path":"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommandWindow.h","rank":3,"score":38404.21818430002},{"content":"","file_path":"Source/VoxelWorld/World/World.cpp","rank":7,"score":19.711699406668604},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":9,"score":19.309345241452707},{"content":"","file_path":"Source/VoxelWorld/World/Actor/ActorModel.cpp","rank":10,"score":18.832287901593926},{"content":"/*================================================================\n\nFilename: Texture2D.cpp\n\nDate: 2018.1.14\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n#include <utility>\n\n\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Window\\Window.h>\n\n#include \"Texture2D.h\"\n\n#include \"TextureFile.h\"\n\n\n\nTexture2D::Texture2D(void)\n\n : tex_(nullptr), SRV_(nullptr)\n\n{\n\n\n\n}\n\n\n","file_path":"Source/Components/WinFramework/Texture/Texture2D.cpp","rank":11,"score":18.795856732912256},{"content":"","file_path":"Source/Components/WinFramework/Screen/GUISystem.cpp","rank":12,"score":18.727367612401075},{"content":"","file_path":"Source/Components/WinFramework/D3DObject/FrameBuffer.cpp","rank":13,"score":18.38356497331864},{"content":"","file_path":"Library/OWE/Src/OWEShader/OWEShaderStage.h","rank":14,"score":18.29671654038274},{"content":"","file_path":"Library/OWE/Src/OWEShader/OWEShaderStage.h","rank":15,"score":18.296716540382736},{"content":"","file_path":"Library/OWE/Src/OWEShader/OWEShaderStage.h","rank":16,"score":18.29671654038274},{"content":"bool LiquidRenderer::Initialize(std::string &errMsg)\n\n{\n\n if(!basic_.Initialize(errMsg))\n\n return false;\n\n\n\n raster_ = std::make_unique<RasterState>(D3D11_FILL_SOLID, D3D11_CULL_NONE);\n\n blend_ = std::make_unique<BlendState>();\n\n depth_ = std::make_unique<DepthStencilState>(true, false);\n\n\n\n if(!raster_ || !blend_ || !depth_)\n\n {\n\n Destroy();\n\n return false;\n\n }\n\n\n\n return true;\n\n}\n\n\n\nvoid LiquidRenderer::Destroy(void)\n\n{\n","file_path":"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp","rank":17,"score":17.95935252806238},{"content":"{\n\n Destroy();\n\n}\n\n\n\nvoid ChunkDataPool::Destroy(void)\n\n{\n\n std::lock_guard<std::mutex> lk(mapMutex_);\n\n map_.ForEach([](Chunk *ck) { Helper::SafeDeleteObjects(ck); });\n\n map_.Clear();\n\n}\n\n\n\nbool ChunkDataPool::GetChunk(Chunk &ck)\n\n{\n\n IntVectorXZ pos = ck.GetPosition();\n\n std::lock_guard<std::mutex> lk(mapMutex_);\n\n Chunk *rt = nullptr;\n\n if(map_.FindAndErase({ pos.x, pos.z }, rt))\n\n {\n\n assert(rt != nullptr);\n\n\n","file_path":"Source/VoxelWorld/World/Chunk/ChunkDataPool.cpp","rank":18,"score":17.732728312431867},{"content":" assert(byteCode != nullptr && length > 0);\n\n assert(Window::GetInstance().IsD3DAvailable());\n\n\n\n ID3D11InputLayout *rt = nullptr;\n\n HRESULT hr = Window::GetInstance().GetD3DDevice()->CreateInputLayout(\n\n desc, static_cast<UINT>(num), byteCode, static_cast<SIZE_T>(length), &rt);\n\n return FAILED(hr) ? nullptr : rt;\n\n }\n\n}\n\n\n\nBasicRenderer::BasicRenderer(void)\n\n : inputLayout_(nullptr)\n\n{\n\n\n\n}\n\n\n\nBasicRenderer::~BasicRenderer(void)\n\n{\n\n Destroy();\n\n}\n","file_path":"Source/VoxelWorld/World/Chunk/BasicRenderer.cpp","rank":19,"score":17.613000026026015},{"content":"","file_path":"Source/Components/SkeletonAnimation/SkeletonData.cpp","rank":20,"score":17.38980933233488},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":21,"score":17.233813754884896},{"content":" errMsg = \"Bone \" + modelBindings[i] + \" not found\";\n\n Clear();\n\n return false;\n\n }\n\n modelToBone_[i] = it->second;\n\n }\n\n\n\n return true;\n\n}\n\n\n\nvoid VoxelModelAnimationDisplayer::Clear(void)\n\n{\n\n models_.clear();\n\n modelToBone_.clear();\n\n skeleton_ = nullptr;\n\n\n\n curAniName_ = \"\";\n\n curAni_ = nullptr;\n\n aniTime_ = 0.0f;\n\n aniLoop_ = false;\n","file_path":"Source/VoxelWorld/VoxelModel/VoxelModelAnimationDisplayer.cpp","rank":22,"score":16.971324559927794},{"content":" return true;\n\n}\n\n\n\nvoid ImmediateScreen2D::Destroy(void)\n\n{\n\n norShader_.Destroy();\n\n norUniforms_.reset();\n\n quadVtxBuf_.Destroy();\n\n}\n\n\n\nbool ImmediateScreen2D::IsAvailable(void) const\n\n{\n\n return norShader_.IsAllStagesAvailable();\n\n}\n\n\n\nvoid ImmediateScreen2D::DrawRectangle(const Vector2 &LB, const Vector2 &RT, Texture2D tex)\n\n{\n\n ID3D11Device *dev = Window::GetInstance().GetD3DDevice();\n\n ID3D11DeviceContext *DC = Window::GetInstance().GetD3DDeviceContext();\n\n\n","file_path":"Source/Components/WinFramework/Screen/ImmediateScreen2D.cpp","rank":23,"score":16.30861114474451},{"content":" {\n\n Destroy();\n\n return false;\n\n }\n\n\n\n return true;\n\n}\n\n\n\nvoid BasicRenderer::Destroy(void)\n\n{\n\n Helper::ReleaseCOMObjects(inputLayout_);\n\n shader_.Destroy();\n\n}\n\n\n\nbool BasicRenderer::IsAvailable(void) const\n\n{\n\n return inputLayout_ && shader_.IsAllStagesAvailable();\n\n}\n\n\n\nvoid BasicRenderer::Begin(void)\n","file_path":"Source/VoxelWorld/World/Chunk/BasicRenderer.cpp","rank":24,"score":15.703950689856628},{"content":"/*================================================================\n\nFilename: VoxelModelAnimationDisplayer.cpp\n\nDate: 2018.3.3\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n#include <string>\n\n\n\n#include <Utility\\FileSystem.h>\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Resource\\ResourceNameManager.h>\n\n#include <Window\\Window.h>\n\n#include \"VoxelModelAnimationDisplayer.h\"\n\n\n\nVoxelModelAnimationDisplayer::VoxelModelAnimationDisplayer(void)\n\n{\n\n curAni_ = nullptr;\n\n aniTime_ = 0.0f;\n\n aniLoop_ = false;\n","file_path":"Source/VoxelWorld/VoxelModel/VoxelModelAnimationDisplayer.cpp","rank":25,"score":15.680306771537236},{"content":"","file_path":"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommandWindow.cpp","rank":26,"score":15.455315034562929},{"content":"/*================================================================\n\nFilename: Application/Common.cpp\n\nDate: 2018.2.27\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Window\\Window.h>\n\n\n\n#include \"Common.h\"\n\n\n\nvoid ShowErrMsgBox(const std::string &errMsg)\n\n{\n\n Window::GetInstance().ErrMsgBox(errMsg);\n\n}\n","file_path":"Source/VoxelWorld/Application/Common.cpp","rank":27,"score":14.99715948690695},{"content":" return TextureFile::GetInstance().LoadTexture2D(filename, tex_, SRV_);\n\n}\n\n\n\nvoid Texture2D::Destroy(void)\n\n{\n\n Helper::ReleaseCOMObjects(tex_, SRV_);\n\n}\n\n\n\nbool Texture2D::IsAvailable(void) const\n\n{\n\n assert((tex_ != nullptr) == (SRV_ != nullptr));\n\n return tex_ != nullptr;\n\n}\n","file_path":"Source/Components/WinFramework/Texture/Texture2D.cpp","rank":28,"score":14.986061980504285},{"content":" CopyChunkData(ck, *rt);\n\n\n\n map_.PushFront(pos, rt);\n\n return true;\n\n }\n\n return false;\n\n}\n\n\n\nvoid ChunkDataPool::AddChunk(Chunk *ck)\n\n{\n\n assert(ck != nullptr);\n\n IntVectorXZ pos = ck->GetPosition();\n\n std::lock_guard<std::mutex> lk(mapMutex_);\n\n\n\n Chunk *existed = nullptr;\n\n if(map_.FindAndErase(pos, existed))\n\n {\n\n map_.PushFront(pos, ck);\n\n Helper::SafeDeleteObjects(existed);\n\n return;\n","file_path":"Source/VoxelWorld/World/Chunk/ChunkDataPool.cpp","rank":29,"score":14.812046147538268},{"content":" return false;\n\n }\n\n\n\n raster_ = std::make_unique<RasterState>(D3D11_FILL_SOLID, D3D11_CULL_NONE);\n\n\n\n return true;\n\n}\n\n\n\nvoid CarveRenderer::Destroy(void)\n\n{\n\n inputLayout_.Destroy();\n\n shader_.Destroy();\n\n raster_.reset();\n\n}\n\n\n\nbool CarveRenderer::IsAvailable(void) const\n\n{\n\n return inputLayout_.IsAvailable();\n\n}\n\n\n","file_path":"Source/VoxelWorld/World/Chunk/CarveRenderer.cpp","rank":30,"score":14.74683268757731},{"content":" return true;\n\n}\n\n\n\nbool VoxelModel::Initialize(const std::vector<VoxelModelVertex> &vtx, const std::vector<UINT16> &idx)\n\n{\n\n Destroy();\n\n if(!vtxBuf_.Initialize(vtx.data(), sizeof(Vertex) * vtx.size()) ||\n\n !idxBuf_.Initialize(idx.data(), sizeof(UINT16) * idx.size()))\n\n {\n\n Destroy();\n\n return false;\n\n }\n\n idxCount_ = idx.size();\n\n return true;\n\n}\n\n\n\nvoid VoxelModel::Destroy(void)\n\n{\n\n vtxBuf_.Destroy();\n\n idxBuf_.Destroy();\n","file_path":"Source/VoxelWorld/VoxelModel/VoxelModel.cpp","rank":31,"score":14.67786667214256},{"content":"/*================================================================\n\nFilename: TransparentRenderer.cpp\n\nDate: 2018.1.27\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Resource\\ResourceNameManager.h>\n\n#include \"LiquidRenderer.h\"\n\n\n\nLiquidRenderer::LiquidRenderer(void)\n\n{\n\n\n\n}\n\n\n\nLiquidRenderer::~LiquidRenderer(void)\n\n{\n\n Destroy();\n\n}\n\n\n","file_path":"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp","rank":32,"score":14.475330454368807},{"content":"/*================================================================\n\nFilename: CarveRenderer.cpp\n\nDate: 2018.1.22\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Utility\\FileSystem.h>\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Resource\\ResourceNameManager.h>\n\n#include \"CarveRenderer.h\"\n\n\n\nCarveRenderer::CarveRenderer(void)\n\n{\n\n\n\n}\n\n\n\nCarveRenderer::~CarveRenderer(void)\n\n{\n\n Destroy();\n\n}\n","file_path":"Source/VoxelWorld/World/Chunk/CarveRenderer.cpp","rank":33,"score":14.456092382053328},{"content":"/*================================================================\n\nFilename: V1/LandGenerator.cpp\n\nDate: 2018.1.30\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n#include <cstdlib>\n\n\n\n#include \"..\\V0\\OakGenerator_V0.h\"\n\n#include \"Biome_V1.h\"\n\n#include \"LandGenerator_V1.h\"\n\n#include \"PalmGenerator_V1.h\"\n\n\n\nvoid ::LandGenerator_V1::LandGenerator::GenerateLand(Chunk *ck)\n\n{\n\n assert(ck != nullptr);\n\n auto[ckX, ckZ] = ck->GetPosition();\n\n int xBase = ck->GetXPosBase();\n\n int zBase = ck->GetZPosBase();\n\n\n","file_path":"Source/VoxelWorld/World/Land/V1/LandGenerator_V1.cpp","rank":34,"score":14.44464118768655},{"content":"\n\n if(!vtxBuf_.Initialize(vtxData, vtxCnt) || !idxBuf_.Initialize(idxData, idxCnt))\n\n {\n\n Destroy();\n\n return false;\n\n }\n\n idxCnt_ = idxCnt;\n\n\n\n return true;\n\n }\n\n\n\n bool IsAvailable(void) const\n\n {\n\n assert(vtxBuf_.IsAvailable() == idxBuf_.IsAvailable());\n\n return vtxBuf_.IsAvailable();\n\n }\n\n\n\n void Destroy(void)\n\n {\n\n vtxBuf_.Destroy();\n","file_path":"Source/Components/WinFramework/D3DObject/SingleBufferMesh.h","rank":35,"score":14.297180290780382},{"content":"/*================================================================\n\nFilename: VoxelModelEditorView.cpp\n\nDate: 2018.3.14\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Utility\\FileSystem.h>\n\n\n\n#include <Screen\\GUISystem.h>\n\n#include <Window\\Window.h>\n\n#include \"VoxelModelEditorCommand.h\"\n\n#include \"VoxelModelEditorCore.h\"\n\n#include \"VoxelModelEditorView.h\"\n\n\n\nVMEView::VMEView(void)\n\n{\n\n showConsole_ = true;\n\n showBindingAttributes_ = true;\n\n showComponentView_ = true;\n\n}\n\n\n","file_path":"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorView.cpp","rank":36,"score":14.230819300740928},{"content":"/*================================================================\n\nFilename: ChunkRendererManager.cpp\n\nDate: 2018.2.25\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Resource\\ResourceNameManager.h>\n\n#include <Window\\Window.h>\n\n\n\n#include \"ChunkRendererManager.h\"\n\n\n\nChunkRendererManager::ChunkRendererManager(void)\n\n : sampler_(D3DObj_Noinit())\n\n{\n\n DC_ = nullptr;\n\n\n\n basicUniform_Trans_ = nullptr;\n\n basicUniform_Sunlight_ = nullptr;\n\n basicUniform_Fog_ = nullptr;\n\n basicUniform_Tex_ = nullptr;\n\n\n","file_path":"Source/VoxelWorld/Application/Game/ChunkRendererManager.cpp","rank":37,"score":14.163359983402337},{"content":"","file_path":"Source/Components/WinFramework/Screen/GUISystem.cpp","rank":39,"score":13.879540726199254},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":40,"score":13.68593332829586},{"content":"/*================================================================\n\nFilename: V3/LandGenerator.cpp\n\nDate: 2018.4.16\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n\n\n#include <World\\Land\\V3\\LandGenerator_V3.h>\n\n\n\nvoid ::LandGenerator_V3::LandGenerator::GenerateLand(Chunk *ck)\n\n{\n\n assert(ck != nullptr);\n\n\n\n for(int x = 0; x != CHUNK_SECTION_SIZE; ++x)\n\n {\n\n for(int z = 0; z != CHUNK_SECTION_SIZE; ++z)\n\n {\n\n for(int y = 0; y != 10; ++y)\n\n ck->SetBlockType(x, y, z, BlockType::Dirt);\n\n ck->SetBlockType(x, 10, z, BlockType::GrassBox);\n","file_path":"Source/VoxelWorld/World/Land/V3/LandGenerator_V3.cpp","rank":41,"score":13.541434991676716},{"content":"/*================================================================\n\nFilename: ConfigFile.cpp\n\nDate: 2018.1.17\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <algorithm>\n\n#include <cassert>\n\n#include <cctype>\n\n#include <fstream>\n\n\n\n#include \"ConfigFile.h\"\n\n\n\nnamespace\n\n{\n\n const std::string EMPTY_STR;\n\n}\n\n\n\nconst std::string &ConfigFileSection::operator[](const std::string &key) const\n\n{\n\n auto it = data_.find(key);\n","file_path":"Source/Components/Utility/ConfigFile.cpp","rank":42,"score":13.521670774442512},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":43,"score":13.384907242519054},{"content":"","file_path":"Source/VoxelWorld/World/Chunk/BasicModel.cpp","rank":44,"score":13.358004687486403},{"content":"","file_path":"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorComponentView.cpp","rank":45,"score":13.153433347284668},{"content":"","file_path":"Source/VoxelWorld/World/Chunk/ChunkLoader.h","rank":46,"score":13.129407433067543},{"content":" return *this;\n\n }\n\n\n\n ~InputLayout(void)\n\n {\n\n Helper::ReleaseCOMObjects(inputLayout_);\n\n }\n\n\n\n bool IsAvailable(void) const\n\n {\n\n return inputLayout_ != nullptr;\n\n }\n\n\n\n void Destroy(void)\n\n {\n\n Helper::ReleaseCOMObjects(inputLayout_);\n\n }\n\n\n\n template<int N>\n\n bool Initialize(const D3D11_INPUT_ELEMENT_DESC (&desc)[N], const void *byteCode, UINT length)\n","file_path":"Source/Components/WinFramework/D3DObject/InputLayout.h","rank":47,"score":12.963057497051055},{"content":"\n\n shader_.Destroy();\n\n uniforms_.reset();\n\n inputLayout_.Destroy();\n\n}\n\n\n\nvoid VoxelModelAnimationDisplayer::SetModel(size_t idx, VoxelModel *model)\n\n{\n\n assert(idx < models_.size() && model != nullptr);\n\n models_[idx] = model;\n\n}\n\n\n\nbool VoxelModelAnimationDisplayer::SetCurrentAnimation(const std::string &aniName, bool loop)\n\n{\n\n if(!(curAni_ = skeleton_->GetAniClip(aniName)))\n\n return false;\n\n aniLoop_ = loop;\n\n aniTime_ = 0.0f;\n\n curAniName_ = aniName;\n\n return true;\n","file_path":"Source/VoxelWorld/VoxelModel/VoxelModelAnimationDisplayer.cpp","rank":48,"score":12.926460781291683},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":49,"score":12.901217321979766},{"content":" carveUniform_Trans_ = nullptr;\n\n carveUniform_Sunlight_ = nullptr;\n\n carveUniform_Fog_ = nullptr;\n\n carveUniform_Tex_ = nullptr;\n\n\n\n liquidUniform_Trans_ = nullptr;\n\n liquidUniform_Sunlight_ = nullptr;\n\n liquidUniform_Fog_ = nullptr;\n\n liquidUniform_Tex_ = nullptr;\n\n}\n\n\n\nbool ChunkRendererManager::Initialize(std::string &errMsg)\n\n{\n\n RscNameMgr &rscMgr = RscNameMgr::GetInstance();\n\n DC_ = Window::GetInstance().GetD3DDeviceContext();\n\n ID3D11Device *dev = Window::GetInstance().GetD3DDevice();\n\n\n\n if(!basicRenderer_.Initialize(errMsg))\n\n {\n\n Destroy();\n","file_path":"Source/VoxelWorld/Application/Game/ChunkRendererManager.cpp","rank":50,"score":12.73045418904458},{"content":"\n\n core.needRefreshDisplay_ = true;\n\n}\n\n\n\nVMECmd_UnloadBinding::VMECmd_UnloadBinding(bool showMsg)\n\n{\n\n showMsg_ = showMsg;\n\n}\n\n\n\nvoid VMECmd_UnloadBinding::Execute(VoxelModelEditorCore &core, VMECmdMsgQueue &cmdMsgs)\n\n{\n\n if(core.model_)\n\n {\n\n if(showMsg_)\n\n {\n\n cmdMsgs.push({ VMECmdMsg::NORMAL_COLOR,\n\n \"Binding file unloaded: \" + ConstructBindingPath(core.model_->GetName()) });\n\n }\n\n core.model_.reset();\n\n core.needRefreshDisplay_ = true;\n","file_path":"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommand.cpp","rank":51,"score":12.688514197841751},{"content":"/*================================================================\n\nFilename: VoxelModelEditor.cpp\n\nDate: 2018.3.5\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n#include <filesystem>\n\n#include <map>\n\n\n\n#include <Utility/HelperFunctions.h>\n\n\n\n#include \"VoxelModelBinding.h\"\n\n#include \"VoxelModelEditor.h\"\n\n#include \"VoxelModelEditorCommand.h\"\n\n#include \"VoxelModelEditorCommandWindow.h\"\n\n\n\nVoxelModelEditor::VoxelModelEditor(void)\n\n : VoxelModelEditorCore(), display_(cmdQueue_)\n\n{\n\n\n","file_path":"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditor.cpp","rank":52,"score":12.63697522338802},{"content":"/*================================================================\n\nFilename: ChunkDataPool.cpp\n\nDate: 2018.1.29\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n#include <cstring>\n\n#include <type_traits>\n\n\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include \"ChunkDataPool.h\"\n\n\n\nChunkDataPool::ChunkDataPool(size_t maxDataCnt)\n\n : maxDataCnt_(maxDataCnt)\n\n{\n\n\n\n}\n\n\n\nChunkDataPool::~ChunkDataPool(void)\n","file_path":"Source/VoxelWorld/World/Chunk/ChunkDataPool.cpp","rank":53,"score":12.569826036215392},{"content":" for(size_t i = 0; i < conf.fonts.size(); ++i)\n\n {\n\n conf.fonts[i].ttfFilename = rM.AsString(\"ImFont\", \"TTFName[\" + std::to_string(i) + \"]\");\n\n conf.fonts[i].pixelSize = std::stof(rM.AsString(\"ImFont\", \"PixelSize[\" + std::to_string(i) + \"]\"));\n\n }\n\n }\n\n catch(const std::exception&)\n\n {\n\n return false;\n\n }\n\n\n\n return true;\n\n }\n\n}\n\n\n\nvoid Application::Run(void)\n\n{\n\n std::string errMsg;\n\n if(!Initialize(errMsg))\n\n {\n","file_path":"Source/VoxelWorld/Application/Application.cpp","rank":54,"score":12.544589766212175},{"content":"/*================================================================\n\nFilename: ImmediateScreen2D.cpp\n\nDate: 2018.1.23\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n#include <string>\n\n\n\n#include <Utility\\FileSystem.h>\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Resource\\ResourceNameManager.h>\n\n#include <Window\\Window.h>\n\n#include \"ImmediateScreen2D.h\"\n\n\n\nImmediateScreen2D::ImmediateScreen2D(void)\n\n : norDepthStencilState_(D3DObj_Noinit()),\n\n norSampler_(D3DObj_Noinit())\n\n{\n\n\n","file_path":"Source/Components/WinFramework/Screen/ImmediateScreen2D.cpp","rank":55,"score":12.505583123965625},{"content":"/*================================================================\n\nFilename: Crosshair.cpp\n\nDate: 2018.1.23\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Resource\\ResourceNameManager.h>\n\n#include <Window\\Window.h>\n\n#include \"Crosshair.h\"\n\n\n\nbool Crosshair::Initialize(void)\n\n{\n\n if(!tex_.IsAvailable())\n\n return tex_.LoadFromFile(RscNameMgr::GetInstance()(\"Crosshair\", \"Texture\"));\n\n return true;\n\n}\n\n\n\nvoid Crosshair::Draw(ImmediateScreen2D *imScr2D)\n\n{\n\n assert(imScr2D != nullptr);\n\n Window &win = Window::GetInstance();\n\n\n\n constexpr float CROSSHAIR_PIXEL_SIZE = 35.0f;\n\n float XSize = 0.5f * CROSSHAIR_PIXEL_SIZE / win.GetClientWidth();\n\n float YSize = 0.5f * CROSSHAIR_PIXEL_SIZE / win.GetClientHeight();\n\n\n\n imScr2D->DrawRectangle({ -XSize, -YSize }, { XSize, YSize }, tex_);\n\n}\n","file_path":"Source/VoxelWorld/Application/Game/Crosshair.cpp","rank":56,"score":12.48295041538595},{"content":" ResultType *rtObj = new ResultType;\n\n if(!rtObj->Initialize(dev, rec.slot, data))\n\n {\n\n delete rtObj;\n\n#ifdef OWE_NO_EXCEPTION\n\n return nullptr;\n\n#else\n\n throw OWEShaderError(\"Failed to initialize constant buffer object: \" + name);\n\n#endif\n\n }\n\n rec.obj = rtObj;\n\n return rtObj;\n\n }\n\n\n\n void Bind(ID3D11DeviceContext *DC)\n\n {\n\n for(auto it : CBs_)\n\n {\n\n if(it.second.obj)\n\n it.second.obj->Bind(DC);\n","file_path":"Library/OWE/Src/OWEShader/OWEShaderConstantBuffer.h","rank":57,"score":12.381108995255794},{"content":"/*================================================================\n\nFilename: BasicRenderer.cpp\n\nDate: 2018.1.13\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <vector>\n\n\n\n#include <Utility\\FileSystem.h>\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Resource\\ResourceNameManager.h>\n\n#include <Window\\Window.h>\n\n#include \"BasicRenderer.h\"\n\n\n\nnamespace\n\n{\n\n ID3D11InputLayout *CreateInputLayout(const D3D11_INPUT_ELEMENT_DESC *desc,\n\n int num, const void *byteCode, size_t length)\n\n {\n\n assert(desc != nullptr && num > 0);\n","file_path":"Source/VoxelWorld/World/Chunk/BasicRenderer.cpp","rank":59,"score":12.247592307495701},{"content":"/*================================================================\n\nFilename: VoxelModel.cpp\n\nDate: 2018.3.3\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#define _CRT_SECURE_NO_WARNINGS\n\n\n\n#include <cassert>\n\n#include <cstdio>\n\n#include <fstream>\n\n\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include \"VoxelModel.h\"\n\n\n\nInputLayout VoxelModel::CreateInputLayout(const void *shaderByteCode, UINT length)\n\n{\n\n static const D3D11_INPUT_ELEMENT_DESC desc[] =\n\n {\n\n { \"POSITION\", 0, DXGI_FORMAT_R32G32B32_FLOAT, 0,\n","file_path":"Source/VoxelWorld/VoxelModel/VoxelModel.cpp","rank":60,"score":12.11911049470179},{"content":" {\n\n\n\n }\n\n\n\n bool Initialize(ID3D11Device *dev, UINT slot, const BufferType_ *data = nullptr)\n\n {\n\n assert(dev);\n\n slot_ = slot;\n\n if(data)\n\n {\n\n D3D11_SUBRESOURCE_DATA dataDesc = { &data, 0, 0 };\n\n buf_ = GenConstantBuffer(dev, sizeof(BufferType_), true, &dataDesc);\n\n }\n\n else\n\n buf_ = GenConstantBuffer(dev, sizeof(BufferType_), true, nullptr);\n\n return buf_ != nullptr;\n\n }\n\n\n\n ~ConstantBufferObject(void)\n\n {\n\n ReleaseCOMObjects(buf_);\n\n }\n\n };\n\n\n\n template<ShaderStageSelector StageSelector>\n","file_path":"Library/OWE/Src/OWEShader/OWEShaderConstantBuffer.h","rank":61,"score":12.089360772958445},{"content":"","file_path":"Source/VoxelWorld/World/Chunk/BasicModel.cpp","rank":63,"score":11.892766875024646},{"content":"/*================================================================\n\nFilename: HelperFunctions.cpp\n\nDate: 2018.1.13\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <fstream>\n\n#include <iterator>\n\n#include <string>\n\n#include <vector>\n\n\n\n#include <Windows.h>\n\n\n\n#include \"D3D11Header.h\"\n\n#include \"HelperFunctions.h\"\n\n\n\nstd::string Helper::ToStr(const std::wstring &wstr)\n\n{\n\n int size = WideCharToMultiByte(CP_UTF8, 0, wstr.c_str(), -1, nullptr, 0, nullptr, nullptr);\n\n char *chs = new char[size];\n\n WideCharToMultiByte(CP_UTF8, 0, wstr.c_str(), -1, chs, size, nullptr, nullptr);\n","file_path":"Source/Components/Utility/HelperFunctions.cpp","rank":64,"score":11.857366367517463},{"content":"/*================================================================\n\nFilename: OWEShaderUniforms.h\n\nDate: 2017.12.18\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#ifndef OWESHADER_UNIFORMS_H\n\n#define OWESHADER_UNIFORMS_H\n\n\n\n#include <cassert>\n\n\n\n#include \"OWEShaderStage.h\"\n\n\n\nnamespace OWEShaderAux\n\n{\n\n struct ShaderStageUniformsBinder\n\n {\n\n template<typename T>\n\n void operator()(T &ref)\n\n {\n\n ref.Bind(DC);\n","file_path":"Library/OWE/Src/OWEShader/OWEShaderUniforms.h","rank":65,"score":11.736644264666797},{"content":"","file_path":"Source/VoxelWorld/World/Land/V0/LandGenerator_V0.cpp","rank":66,"score":11.684802860979296},{"content":" return true;\n\n }\n\n\n\n SSObj *GetShaderSamplerObject(const std::string &name)\n\n {\n\n auto it = SSs_.find(name);\n\n if(it == SSs_.end())\n\n {\n\n#ifdef OWE_NO_EXCEPTION\n\n return nullptr;\n\n#else\n\n throw OWEShaderError((\"Shader sampler not found: \" + name).c_str());\n\n#endif\n\n }\n\n\n\n assert(it->second.obj != nullptr);\n\n return it->second.obj;\n\n }\n\n\n\n void Bind(ID3D11DeviceContext *DC)\n","file_path":"Library/OWE/Src/OWEShader/OWEShaderSampler.h","rank":67,"score":11.675519359789124},{"content":"","file_path":"Source/VoxelWorld/World/Chunk/BasicModel.cpp","rank":68,"score":11.631073194123498},{"content":"/*================================================================\n\nFilename: VoxelModelEditorCommand.cpp\n\nDate: 2018.3.14\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <cassert>\n\n\n\n#include <Utility\\FileSystem.h>\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Resource\\ResourceNameManager.h>\n\n#include <Window\\Window.h>\n\n#include \"VoxelModelEditorCommand.h\"\n\n#include \"VoxelModelEditorConsole.h\"\n\n#include \"VoxelModelEditorCore.h\"\n\n#include \"VoxelModelEditorView.h\"\n\n\n\nvoid VMECmd_LoadBinding::Execute(VMECore &core, VMEViewRefreshConfig &refresh, VMEConsole &console)\n\n{\n\n auto &rM = RscNameMgr::GetInstance();\n","file_path":"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorCommand.cpp","rank":69,"score":11.58991105612775},{"content":"","file_path":"Source/Components/WinFramework/Screen/GUISystem.cpp","rank":70,"score":11.582181443098996},{"content":"/*================================================================\n\nFilename: Model.cpp\n\nDate: 2018.1.13\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Window\\Window.h>\n\n#include \"Model.h\"\n\n\n\nconst std::vector<ID3D11Buffer*> Model::emptyVtxBufs_(\n\n D3D11_IA_VERTEX_INPUT_RESOURCE_SLOT_COUNT, nullptr);\n\n\n\nbool Model::IsAvailable(void) const\n\n{\n\n assert(vtxBufBinding_.startSlot < 0 ||\n\n vtxBufBinding_.startSlot + vtxBufBinding_.bufs.size()\n\n <= D3D11_IA_VERTEX_INPUT_RESOURCE_SLOT_COUNT);\n\n return vtxBufBinding_.bufs.size() > 0;\n\n}\n\n\n\nvoid Model::Draw(void) const\n","file_path":"Source/VoxelWorld/World/Chunk/Model.cpp","rank":71,"score":11.579115536952035},{"content":"","file_path":"Source/VoxelWorld/Application/Game/Game.cpp","rank":72,"score":11.567779410057781},{"content":" boneMaps.clear();\n\n return false;\n\n }\n\n }\n\n\n\n return true;\n\n}\n\n\n\nint main(void)\n\n{\n\n try\n\n {\n\n std::string errMsg;\n\n std::wstring confFilename;\n\n\n\n std::cout << \"Enter configure: \";\n\n std::wcin >> confFilename;\n\n\n\n std::vector<InputUnit> files;\n\n float timeFactor;\n","file_path":"Source/Components/SkeletonAnimationConvertor/Main.cpp","rank":73,"score":11.3826414031038},{"content":"","file_path":"Source/Components/WinFramework/D3DObject/FrameBuffer.cpp","rank":74,"score":11.371741135070312},{"content":" filenames);\n\n for(auto &it : filenames)\n\n core.bindingNames_.push_back(it.first);\n\n\n\n if(showMsg_)\n\n cmdMsgs.push({ VMECmdMsg::NORMAL_COLOR, \"Binding list reloaded\" });\n\n core.needRefreshDisplay_ = true;\n\n\n\n VMECmd_SelectBindingName(0).Execute(core, cmdMsgs);\n\n}\n\n\n\nVMECmd_SelectBindingName::VMECmd_SelectBindingName(int selected)\n\n : selected_(selected)\n\n{\n\n\n\n}\n\n\n\nvoid VMECmd_SelectBindingName::Execute(VoxelModelEditorCore &core, VMECmdMsgQueue &cmdMsgs)\n\n{\n\n core.needRefreshDisplay_ = true;\n","file_path":"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommand.cpp","rank":75,"score":11.261967938987098},{"content":"","file_path":"Source/Components/WinFramework/D3DObject/FrameBuffer.cpp","rank":76,"score":11.243790190027099},{"content":" basic_.Destroy();\n\n blend_.reset();\n\n raster_.reset();\n\n depth_.reset();\n\n}\n\n\n\nbool LiquidRenderer::IsAvailable(void) const\n\n{\n\n return basic_.IsAvailable();\n\n}\n\n\n\nvoid LiquidRenderer::Begin(void)\n\n{\n\n ID3D11DeviceContext *DC = Window::GetInstance().GetD3DDeviceContext();\n\n\n\n basic_.Begin();\n\n DC->OMSetBlendState(*blend_, nullptr, 0xFFFFFFFF);\n\n DC->RSSetState(*raster_);\n\n DC->OMSetDepthStencilState(*depth_, 0);\n\n}\n","file_path":"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp","rank":77,"score":11.22666058949465},{"content":"","file_path":"Source/VoxelWorld/World/Chunk/BasicModel.cpp","rank":78,"score":11.161358532334434},{"content":"","file_path":"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorConsole.cpp","rank":79,"score":11.096198081243841},{"content":"/*================================================================\n\nFilename: FPSCounter.h\n\nDate: 2018.1.27\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#pragma once\n\n\n\n#include <cassert>\n\n\n\n#include \"Clock.h\"\n\n#include \"Uncopiable.h\"\n\n\n","file_path":"Source/Components/Utility/FPSCounter.h","rank":80,"score":10.980292111041923},{"content":"","file_path":"Source/VoxelWorld/World/Chunk/ChunkLoader.h","rank":81,"score":10.979243217965871},{"content":" idxBuf_.Destroy();\n\n idxCnt_ = 0;\n\n }\n\n\n\n void Bind(ID3D11DeviceContext *DC)\n\n {\n\n assert(IsAvailable() && DC != nullptr);\n\n static const UINT stride = sizeof(Vertex), offset = 0;\n\n ID3D11Buffer *vtxBuf = vtxBuf_.GetBuffer();\n\n DC->IASetVertexBuffers(0, 1, &vtxBuf, &stride, &offset);\n\n DC->IASetIndexBuffer(idxBuf_.GetBuffer(), DXGI_FORMAT_R16_UINT, 0);\n\n }\n\n\n\n void Unbind(ID3D11DeviceContext *DC)\n\n {\n\n assert(IsAvailable() && DC != nullptr);\n\n static const UINT stride = 0, offset = 0;\n\n static const ID3D11Buffer *vtxBuf = nullptr;\n\n DC->IASetVertexBuffers(0, 1, &vtxBuf, &stride, &offset);\n\n DC->IASetIndexBuffer(nullptr, DXGI_FORMAT_UNKNOWN, 0);\n","file_path":"Source/Components/WinFramework/D3DObject/SingleBufferMesh.h","rank":82,"score":10.88895143093471},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":83,"score":10.879606805219925},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":84,"score":10.878566890750065},{"content":" IMGUI_API void AddGlyph(ImWchar c, float x0, float y0, float x1, float y1, float u0, float v0, float u1, float v1, float advance_x);\n\n IMGUI_API void AddRemapChar(ImWchar dst, ImWchar src, bool overwrite_dst = true); // Makes 'dst' character/glyph points to 'src' character/glyph. Currently needs to be called AFTER fonts have been built.\n\n\n\n#ifndef IMGUI_DISABLE_OBSOLETE_FUNCTIONS\n\n typedef ImFontGlyph Glyph; // OBSOLETE 1.52+\n\n#endif\n\n};\n\n\n\n#if defined(__clang__)\n\n#pragma clang diagnostic pop\n\n#endif\n\n\n\n// Include imgui_user.h at the end of imgui.h (convenient for user to only explicitly include vanilla imgui.h)\n\n#ifdef IMGUI_INCLUDE_IMGUI_USER_H\n\n#include \"imgui_user.h\"\n\n#endif\n","file_path":"Source/Components/WinFramework/Screen/imgui/imgui.h","rank":85,"score":10.77193638914004},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":86,"score":10.71971574513881},{"content":"","file_path":"Source/Components/SkeletonAnimation/SkeletonDataLoader.cpp","rank":87,"score":10.700620827814202},{"content":"\n\nvoid LiquidRenderer::End(void)\n\n{\n\n ID3D11DeviceContext *DC = Window::GetInstance().GetD3DDeviceContext();\n\n\n\n DC->OMSetBlendState(nullptr, nullptr, 0xFFFFFFFF);\n\n DC->RSSetState(nullptr);\n\n DC->OMSetDepthStencilState(nullptr, 0);\n\n basic_.End();\n\n}\n\n\n\nLiquidRenderer::ShaderType &LiquidRenderer::GetShader(void)\n\n{\n\n return basic_.GetShader();\n\n}\n","file_path":"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp","rank":88,"score":10.636605706260841},{"content":"/*================================================================\n\nFilename: Clock.cpp\n\nDate: 2017.10.16\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#include <Windows.h>\n\n\n\n#include \"Clock.h\"\n\n\n\nClock::Clock(void)\n\n{\n\n LARGE_INTEGER freq;\n\n QueryPerformanceFrequency(&freq);\n\n ratio_ = 1000.0f / freq.QuadPart;\n\n\n\n Restart();\n\n}\n\n\n\nvoid Clock::Restart(void)\n\n{\n","file_path":"Source/Components/Utility/Clock.cpp","rank":89,"score":10.62690468657603},{"content":"/*================================================================\n\nFilename: BasicBuffer.h\n\nDate: 2018.1.23\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#pragma once\n\n\n\n#include <cassert>\n\n\n\n#include <Utility\\D3D11Header.h>\n\n#include <Utility\\HelperFunctions.h>\n\n\n\n#include <Window\\Window.h>\n\n\n","file_path":"Source/Components/WinFramework/D3DObject/BasicBuffer.h","rank":90,"score":10.597581721085588},{"content":"\n\nvoid ChunkRendererManager::Destroy(void)\n\n{\n\n basicRenderer_.Destroy();\n\n for(Texture2D &tex : basicRendererTextures_)\n\n tex.Destroy();\n\n basicUniforms_.reset();\n\n\n\n carveRenderer_.Destroy();\n\n for(Texture2D &tex : carveRendererTextures_)\n\n tex.Destroy();\n\n carveUniforms_.reset();\n\n\n\n liquidRenderer_.Destroy();\n\n for(Texture2D &tex : liquidRendererTextures_)\n\n tex.Destroy();\n\n liquidUniforms_.reset();\n\n\n\n sampler_ = Sampler(D3DObj_Noinit());\n\n\n","file_path":"Source/VoxelWorld/Application/Game/ChunkRendererManager.cpp","rank":91,"score":10.55761434574319},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":93,"score":10.455681231094307},{"content":"/*================================================================\n\nFilename: SingleBufferMesh.h\n\nDate: 2018.3.19\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#pragma once\n\n\n\n#include <cassert>\n\n#include <vector>\n\n\n\n#include <Utility\\D3D11Header.h>\n\n#include <Utility\\Uncopiable.h>\n\n\n\n#include \"BasicBuffer.h\"\n\n\n\ntemplate<typename _vertexType>\n","file_path":"Source/Components/WinFramework/D3DObject/SingleBufferMesh.h","rank":94,"score":10.395747161695738},{"content":"/*================================================================\n\nFilename: V2/Biome_V2.h\n\nDate: 2018.2.3\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#pragma once\n\n\n\n#include <cassert>\n\n\n\n#include <World\\Chunk\\Chunk.h>\n\n#include \"Area_V2.h\"\n\n#include \"Common_V2.h\"\n\n\n\nnamespace LandGenerator_V2\n\n{\n","file_path":"Source/VoxelWorld/World/Land/V2/Biome_V2.h","rank":95,"score":10.375297389745548},{"content":"/*================================================================\n\nFilename: LinkedMap.h\n\nDate: 2018.1.29\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#pragma once\n\n\n\n#include <algorithm>\n\n#include <list>\n\n#include <map>\n\n\n\ntemplate<typename KeyType, typename ValueType>\n","file_path":"Source/Components/Utility/LinkedMap.h","rank":96,"score":10.366333807669399},{"content":"","file_path":"Source/Components/WinFramework/Window/Window.cpp","rank":97,"score":10.347523836311467},{"content":"/*================================================================\n\nFilename: PerlinNoise2D.h\n\nDate: 2018.1.31\n\nCreated by AirGuanZ\n\n================================================================*/\n\n#pragma once\n\n\n\n#include <cmath>\n\n#include <random>\n\n\n\ntemplate<typename RT>\n","file_path":"Source/VoxelWorld/World/Land/PerlinNoise/PerlinNoise2D.h","rank":98,"score":10.292864818243347},{"content":"","file_path":"Source/VoxelWorld/World/Block/BlockInfoManager.cpp","rank":99,"score":10.2052068517044}],"string":"[\n {\n \"content\": \"class BasicBufferSetter<true> : public BasicBufferView\\n\\n{\\n\\npublic:\\n\\n bool SetData(const void *data, int byteSize)\\n\\n {\\n\\n assert(data && byteSize > 0);\\n\\n\\n\\n D3D11_MAPPED_SUBRESOURCE rsc;\\n\\n HRESULT hr = Window::GetInstance().GetD3DDeviceContext()\\n\\n ->Map(buf_, 0, D3D11_MAP_WRITE_DISCARD, 0, &rsc);\\n\\n if(FAILED(hr))\\n\\n return false;\\n\\n\\n\\n std::memcpy(rsc.pData, data, byteSize);\\n\\n Window::GetInstance().GetD3DDeviceContext()\\n\\n ->Unmap(buf_, 0);\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/BasicBuffer.h\",\n \"rank\": 0,\n \"score\": 57176.0980323595\n },\n {\n \"content\": \" class ConstantBufferObject<BufferType_, _StageSelector, true>\\n\\n : public ConstantBufferAttributes<BufferType_, _StageSelector, true>,\\n\\n public ConstantBufferObjectBase<_StageSelector>,\\n\\n public Uncopiable\\n\\n {\\n\\n public:\\n\\n void SetBufferData(ID3D11DeviceContext *devCon, const BufferType_ &data)\\n\\n {\\n\\n assert(devCon != nullptr && buf_ != nullptr);\\n\\n D3D11_MAPPED_SUBRESOURCE mappedRsc;\\n\\n devCon->Map(buf_, 0, D3D11_MAP_WRITE_DISCARD, 0, &mappedRsc);\\n\\n std::memcpy(mappedRsc.pData, &data, sizeof(BufferType_));\\n\\n devCon->Unmap(buf_, 0);\\n\\n }\\n\\n\\n\\n private:\\n\\n friend class ConstantBufferManager<_StageSelector>;\\n\\n\\n\\n ConstantBufferObject(void)\\n\\n : ConstantBufferObjectBase(0, nullptr)\\n\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderConstantBuffer.h\",\n \"rank\": 1,\n \"score\": 57176.0980323595\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/ChunkLoader.h\",\n \"rank\": 2,\n \"score\": 44103.48510240957\n },\n {\n \"content\": \"struct VMECmdMsg\\n\\n{\\n\\n Color color;\\n\\n std::string msg;\\n\\n\\n\\n static const Color ERROR_COLOR;\\n\\n static const Color NORMAL_COLOR;\\n\\n};\\n\\n\\n\\nusing VMECmdMsgQueue = std::queue<VMECmdMsg>;\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommandWindow.h\",\n \"rank\": 3,\n \"score\": 38404.21818430002\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/World.cpp\",\n \"rank\": 7,\n \"score\": 19.711699406668604\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 9,\n \"score\": 19.309345241452707\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Actor/ActorModel.cpp\",\n \"rank\": 10,\n \"score\": 18.832287901593926\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: Texture2D.cpp\\n\\nDate: 2018.1.14\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n#include <utility>\\n\\n\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"Texture2D.h\\\"\\n\\n#include \\\"TextureFile.h\\\"\\n\\n\\n\\nTexture2D::Texture2D(void)\\n\\n : tex_(nullptr), SRV_(nullptr)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/Components/WinFramework/Texture/Texture2D.cpp\",\n \"rank\": 11,\n \"score\": 18.795856732912256\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Screen/GUISystem.cpp\",\n \"rank\": 12,\n \"score\": 18.727367612401075\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/FrameBuffer.cpp\",\n \"rank\": 13,\n \"score\": 18.38356497331864\n },\n {\n \"content\": \"\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderStage.h\",\n \"rank\": 14,\n \"score\": 18.29671654038274\n },\n {\n \"content\": \"\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderStage.h\",\n \"rank\": 15,\n \"score\": 18.296716540382736\n },\n {\n \"content\": \"\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderStage.h\",\n \"rank\": 16,\n \"score\": 18.29671654038274\n },\n {\n \"content\": \"bool LiquidRenderer::Initialize(std::string &errMsg)\\n\\n{\\n\\n if(!basic_.Initialize(errMsg))\\n\\n return false;\\n\\n\\n\\n raster_ = std::make_unique<RasterState>(D3D11_FILL_SOLID, D3D11_CULL_NONE);\\n\\n blend_ = std::make_unique<BlendState>();\\n\\n depth_ = std::make_unique<DepthStencilState>(true, false);\\n\\n\\n\\n if(!raster_ || !blend_ || !depth_)\\n\\n {\\n\\n Destroy();\\n\\n return false;\\n\\n }\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid LiquidRenderer::Destroy(void)\\n\\n{\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp\",\n \"rank\": 17,\n \"score\": 17.95935252806238\n },\n {\n \"content\": \"{\\n\\n Destroy();\\n\\n}\\n\\n\\n\\nvoid ChunkDataPool::Destroy(void)\\n\\n{\\n\\n std::lock_guard<std::mutex> lk(mapMutex_);\\n\\n map_.ForEach([](Chunk *ck) { Helper::SafeDeleteObjects(ck); });\\n\\n map_.Clear();\\n\\n}\\n\\n\\n\\nbool ChunkDataPool::GetChunk(Chunk &ck)\\n\\n{\\n\\n IntVectorXZ pos = ck.GetPosition();\\n\\n std::lock_guard<std::mutex> lk(mapMutex_);\\n\\n Chunk *rt = nullptr;\\n\\n if(map_.FindAndErase({ pos.x, pos.z }, rt))\\n\\n {\\n\\n assert(rt != nullptr);\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/ChunkDataPool.cpp\",\n \"rank\": 18,\n \"score\": 17.732728312431867\n },\n {\n \"content\": \" assert(byteCode != nullptr && length > 0);\\n\\n assert(Window::GetInstance().IsD3DAvailable());\\n\\n\\n\\n ID3D11InputLayout *rt = nullptr;\\n\\n HRESULT hr = Window::GetInstance().GetD3DDevice()->CreateInputLayout(\\n\\n desc, static_cast<UINT>(num), byteCode, static_cast<SIZE_T>(length), &rt);\\n\\n return FAILED(hr) ? nullptr : rt;\\n\\n }\\n\\n}\\n\\n\\n\\nBasicRenderer::BasicRenderer(void)\\n\\n : inputLayout_(nullptr)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nBasicRenderer::~BasicRenderer(void)\\n\\n{\\n\\n Destroy();\\n\\n}\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/BasicRenderer.cpp\",\n \"rank\": 19,\n \"score\": 17.613000026026015\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/SkeletonAnimation/SkeletonData.cpp\",\n \"rank\": 20,\n \"score\": 17.38980933233488\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 21,\n \"score\": 17.233813754884896\n },\n {\n \"content\": \" errMsg = \\\"Bone \\\" + modelBindings[i] + \\\" not found\\\";\\n\\n Clear();\\n\\n return false;\\n\\n }\\n\\n modelToBone_[i] = it->second;\\n\\n }\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid VoxelModelAnimationDisplayer::Clear(void)\\n\\n{\\n\\n models_.clear();\\n\\n modelToBone_.clear();\\n\\n skeleton_ = nullptr;\\n\\n\\n\\n curAniName_ = \\\"\\\";\\n\\n curAni_ = nullptr;\\n\\n aniTime_ = 0.0f;\\n\\n aniLoop_ = false;\\n\",\n \"file_path\": \"Source/VoxelWorld/VoxelModel/VoxelModelAnimationDisplayer.cpp\",\n \"rank\": 22,\n \"score\": 16.971324559927794\n },\n {\n \"content\": \" return true;\\n\\n}\\n\\n\\n\\nvoid ImmediateScreen2D::Destroy(void)\\n\\n{\\n\\n norShader_.Destroy();\\n\\n norUniforms_.reset();\\n\\n quadVtxBuf_.Destroy();\\n\\n}\\n\\n\\n\\nbool ImmediateScreen2D::IsAvailable(void) const\\n\\n{\\n\\n return norShader_.IsAllStagesAvailable();\\n\\n}\\n\\n\\n\\nvoid ImmediateScreen2D::DrawRectangle(const Vector2 &LB, const Vector2 &RT, Texture2D tex)\\n\\n{\\n\\n ID3D11Device *dev = Window::GetInstance().GetD3DDevice();\\n\\n ID3D11DeviceContext *DC = Window::GetInstance().GetD3DDeviceContext();\\n\\n\\n\",\n \"file_path\": \"Source/Components/WinFramework/Screen/ImmediateScreen2D.cpp\",\n \"rank\": 23,\n \"score\": 16.30861114474451\n },\n {\n \"content\": \" {\\n\\n Destroy();\\n\\n return false;\\n\\n }\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid BasicRenderer::Destroy(void)\\n\\n{\\n\\n Helper::ReleaseCOMObjects(inputLayout_);\\n\\n shader_.Destroy();\\n\\n}\\n\\n\\n\\nbool BasicRenderer::IsAvailable(void) const\\n\\n{\\n\\n return inputLayout_ && shader_.IsAllStagesAvailable();\\n\\n}\\n\\n\\n\\nvoid BasicRenderer::Begin(void)\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/BasicRenderer.cpp\",\n \"rank\": 24,\n \"score\": 15.703950689856628\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: VoxelModelAnimationDisplayer.cpp\\n\\nDate: 2018.3.3\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n#include <string>\\n\\n\\n\\n#include <Utility\\\\FileSystem.h>\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"VoxelModelAnimationDisplayer.h\\\"\\n\\n\\n\\nVoxelModelAnimationDisplayer::VoxelModelAnimationDisplayer(void)\\n\\n{\\n\\n curAni_ = nullptr;\\n\\n aniTime_ = 0.0f;\\n\\n aniLoop_ = false;\\n\",\n \"file_path\": \"Source/VoxelWorld/VoxelModel/VoxelModelAnimationDisplayer.cpp\",\n \"rank\": 25,\n \"score\": 15.680306771537236\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommandWindow.cpp\",\n \"rank\": 26,\n \"score\": 15.455315034562929\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: Application/Common.cpp\\n\\nDate: 2018.2.27\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Window\\\\Window.h>\\n\\n\\n\\n#include \\\"Common.h\\\"\\n\\n\\n\\nvoid ShowErrMsgBox(const std::string &errMsg)\\n\\n{\\n\\n Window::GetInstance().ErrMsgBox(errMsg);\\n\\n}\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/Common.cpp\",\n \"rank\": 27,\n \"score\": 14.99715948690695\n },\n {\n \"content\": \" return TextureFile::GetInstance().LoadTexture2D(filename, tex_, SRV_);\\n\\n}\\n\\n\\n\\nvoid Texture2D::Destroy(void)\\n\\n{\\n\\n Helper::ReleaseCOMObjects(tex_, SRV_);\\n\\n}\\n\\n\\n\\nbool Texture2D::IsAvailable(void) const\\n\\n{\\n\\n assert((tex_ != nullptr) == (SRV_ != nullptr));\\n\\n return tex_ != nullptr;\\n\\n}\\n\",\n \"file_path\": \"Source/Components/WinFramework/Texture/Texture2D.cpp\",\n \"rank\": 28,\n \"score\": 14.986061980504285\n },\n {\n \"content\": \" CopyChunkData(ck, *rt);\\n\\n\\n\\n map_.PushFront(pos, rt);\\n\\n return true;\\n\\n }\\n\\n return false;\\n\\n}\\n\\n\\n\\nvoid ChunkDataPool::AddChunk(Chunk *ck)\\n\\n{\\n\\n assert(ck != nullptr);\\n\\n IntVectorXZ pos = ck->GetPosition();\\n\\n std::lock_guard<std::mutex> lk(mapMutex_);\\n\\n\\n\\n Chunk *existed = nullptr;\\n\\n if(map_.FindAndErase(pos, existed))\\n\\n {\\n\\n map_.PushFront(pos, ck);\\n\\n Helper::SafeDeleteObjects(existed);\\n\\n return;\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/ChunkDataPool.cpp\",\n \"rank\": 29,\n \"score\": 14.812046147538268\n },\n {\n \"content\": \" return false;\\n\\n }\\n\\n\\n\\n raster_ = std::make_unique<RasterState>(D3D11_FILL_SOLID, D3D11_CULL_NONE);\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid CarveRenderer::Destroy(void)\\n\\n{\\n\\n inputLayout_.Destroy();\\n\\n shader_.Destroy();\\n\\n raster_.reset();\\n\\n}\\n\\n\\n\\nbool CarveRenderer::IsAvailable(void) const\\n\\n{\\n\\n return inputLayout_.IsAvailable();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/CarveRenderer.cpp\",\n \"rank\": 30,\n \"score\": 14.74683268757731\n },\n {\n \"content\": \" return true;\\n\\n}\\n\\n\\n\\nbool VoxelModel::Initialize(const std::vector<VoxelModelVertex> &vtx, const std::vector<UINT16> &idx)\\n\\n{\\n\\n Destroy();\\n\\n if(!vtxBuf_.Initialize(vtx.data(), sizeof(Vertex) * vtx.size()) ||\\n\\n !idxBuf_.Initialize(idx.data(), sizeof(UINT16) * idx.size()))\\n\\n {\\n\\n Destroy();\\n\\n return false;\\n\\n }\\n\\n idxCount_ = idx.size();\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid VoxelModel::Destroy(void)\\n\\n{\\n\\n vtxBuf_.Destroy();\\n\\n idxBuf_.Destroy();\\n\",\n \"file_path\": \"Source/VoxelWorld/VoxelModel/VoxelModel.cpp\",\n \"rank\": 31,\n \"score\": 14.67786667214256\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: TransparentRenderer.cpp\\n\\nDate: 2018.1.27\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include \\\"LiquidRenderer.h\\\"\\n\\n\\n\\nLiquidRenderer::LiquidRenderer(void)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nLiquidRenderer::~LiquidRenderer(void)\\n\\n{\\n\\n Destroy();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp\",\n \"rank\": 32,\n \"score\": 14.475330454368807\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: CarveRenderer.cpp\\n\\nDate: 2018.1.22\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Utility\\\\FileSystem.h>\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include \\\"CarveRenderer.h\\\"\\n\\n\\n\\nCarveRenderer::CarveRenderer(void)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nCarveRenderer::~CarveRenderer(void)\\n\\n{\\n\\n Destroy();\\n\\n}\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/CarveRenderer.cpp\",\n \"rank\": 33,\n \"score\": 14.456092382053328\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: V1/LandGenerator.cpp\\n\\nDate: 2018.1.30\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n#include <cstdlib>\\n\\n\\n\\n#include \\\"..\\\\V0\\\\OakGenerator_V0.h\\\"\\n\\n#include \\\"Biome_V1.h\\\"\\n\\n#include \\\"LandGenerator_V1.h\\\"\\n\\n#include \\\"PalmGenerator_V1.h\\\"\\n\\n\\n\\nvoid ::LandGenerator_V1::LandGenerator::GenerateLand(Chunk *ck)\\n\\n{\\n\\n assert(ck != nullptr);\\n\\n auto[ckX, ckZ] = ck->GetPosition();\\n\\n int xBase = ck->GetXPosBase();\\n\\n int zBase = ck->GetZPosBase();\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Land/V1/LandGenerator_V1.cpp\",\n \"rank\": 34,\n \"score\": 14.44464118768655\n },\n {\n \"content\": \"\\n\\n if(!vtxBuf_.Initialize(vtxData, vtxCnt) || !idxBuf_.Initialize(idxData, idxCnt))\\n\\n {\\n\\n Destroy();\\n\\n return false;\\n\\n }\\n\\n idxCnt_ = idxCnt;\\n\\n\\n\\n return true;\\n\\n }\\n\\n\\n\\n bool IsAvailable(void) const\\n\\n {\\n\\n assert(vtxBuf_.IsAvailable() == idxBuf_.IsAvailable());\\n\\n return vtxBuf_.IsAvailable();\\n\\n }\\n\\n\\n\\n void Destroy(void)\\n\\n {\\n\\n vtxBuf_.Destroy();\\n\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/SingleBufferMesh.h\",\n \"rank\": 35,\n \"score\": 14.297180290780382\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: VoxelModelEditorView.cpp\\n\\nDate: 2018.3.14\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Utility\\\\FileSystem.h>\\n\\n\\n\\n#include <Screen\\\\GUISystem.h>\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"VoxelModelEditorCommand.h\\\"\\n\\n#include \\\"VoxelModelEditorCore.h\\\"\\n\\n#include \\\"VoxelModelEditorView.h\\\"\\n\\n\\n\\nVMEView::VMEView(void)\\n\\n{\\n\\n showConsole_ = true;\\n\\n showBindingAttributes_ = true;\\n\\n showComponentView_ = true;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorView.cpp\",\n \"rank\": 36,\n \"score\": 14.230819300740928\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: ChunkRendererManager.cpp\\n\\nDate: 2018.2.25\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include <Window\\\\Window.h>\\n\\n\\n\\n#include \\\"ChunkRendererManager.h\\\"\\n\\n\\n\\nChunkRendererManager::ChunkRendererManager(void)\\n\\n : sampler_(D3DObj_Noinit())\\n\\n{\\n\\n DC_ = nullptr;\\n\\n\\n\\n basicUniform_Trans_ = nullptr;\\n\\n basicUniform_Sunlight_ = nullptr;\\n\\n basicUniform_Fog_ = nullptr;\\n\\n basicUniform_Tex_ = nullptr;\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/Game/ChunkRendererManager.cpp\",\n \"rank\": 37,\n \"score\": 14.163359983402337\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Screen/GUISystem.cpp\",\n \"rank\": 39,\n \"score\": 13.879540726199254\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 40,\n \"score\": 13.68593332829586\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: V3/LandGenerator.cpp\\n\\nDate: 2018.4.16\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n\\n\\n#include <World\\\\Land\\\\V3\\\\LandGenerator_V3.h>\\n\\n\\n\\nvoid ::LandGenerator_V3::LandGenerator::GenerateLand(Chunk *ck)\\n\\n{\\n\\n assert(ck != nullptr);\\n\\n\\n\\n for(int x = 0; x != CHUNK_SECTION_SIZE; ++x)\\n\\n {\\n\\n for(int z = 0; z != CHUNK_SECTION_SIZE; ++z)\\n\\n {\\n\\n for(int y = 0; y != 10; ++y)\\n\\n ck->SetBlockType(x, y, z, BlockType::Dirt);\\n\\n ck->SetBlockType(x, 10, z, BlockType::GrassBox);\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Land/V3/LandGenerator_V3.cpp\",\n \"rank\": 41,\n \"score\": 13.541434991676716\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: ConfigFile.cpp\\n\\nDate: 2018.1.17\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <algorithm>\\n\\n#include <cassert>\\n\\n#include <cctype>\\n\\n#include <fstream>\\n\\n\\n\\n#include \\\"ConfigFile.h\\\"\\n\\n\\n\\nnamespace\\n\\n{\\n\\n const std::string EMPTY_STR;\\n\\n}\\n\\n\\n\\nconst std::string &ConfigFileSection::operator[](const std::string &key) const\\n\\n{\\n\\n auto it = data_.find(key);\\n\",\n \"file_path\": \"Source/Components/Utility/ConfigFile.cpp\",\n \"rank\": 42,\n \"score\": 13.521670774442512\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 43,\n \"score\": 13.384907242519054\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/BasicModel.cpp\",\n \"rank\": 44,\n \"score\": 13.358004687486403\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorComponentView.cpp\",\n \"rank\": 45,\n \"score\": 13.153433347284668\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/ChunkLoader.h\",\n \"rank\": 46,\n \"score\": 13.129407433067543\n },\n {\n \"content\": \" return *this;\\n\\n }\\n\\n\\n\\n ~InputLayout(void)\\n\\n {\\n\\n Helper::ReleaseCOMObjects(inputLayout_);\\n\\n }\\n\\n\\n\\n bool IsAvailable(void) const\\n\\n {\\n\\n return inputLayout_ != nullptr;\\n\\n }\\n\\n\\n\\n void Destroy(void)\\n\\n {\\n\\n Helper::ReleaseCOMObjects(inputLayout_);\\n\\n }\\n\\n\\n\\n template<int N>\\n\\n bool Initialize(const D3D11_INPUT_ELEMENT_DESC (&desc)[N], const void *byteCode, UINT length)\\n\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/InputLayout.h\",\n \"rank\": 47,\n \"score\": 12.963057497051055\n },\n {\n \"content\": \"\\n\\n shader_.Destroy();\\n\\n uniforms_.reset();\\n\\n inputLayout_.Destroy();\\n\\n}\\n\\n\\n\\nvoid VoxelModelAnimationDisplayer::SetModel(size_t idx, VoxelModel *model)\\n\\n{\\n\\n assert(idx < models_.size() && model != nullptr);\\n\\n models_[idx] = model;\\n\\n}\\n\\n\\n\\nbool VoxelModelAnimationDisplayer::SetCurrentAnimation(const std::string &aniName, bool loop)\\n\\n{\\n\\n if(!(curAni_ = skeleton_->GetAniClip(aniName)))\\n\\n return false;\\n\\n aniLoop_ = loop;\\n\\n aniTime_ = 0.0f;\\n\\n curAniName_ = aniName;\\n\\n return true;\\n\",\n \"file_path\": \"Source/VoxelWorld/VoxelModel/VoxelModelAnimationDisplayer.cpp\",\n \"rank\": 48,\n \"score\": 12.926460781291683\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 49,\n \"score\": 12.901217321979766\n },\n {\n \"content\": \" carveUniform_Trans_ = nullptr;\\n\\n carveUniform_Sunlight_ = nullptr;\\n\\n carveUniform_Fog_ = nullptr;\\n\\n carveUniform_Tex_ = nullptr;\\n\\n\\n\\n liquidUniform_Trans_ = nullptr;\\n\\n liquidUniform_Sunlight_ = nullptr;\\n\\n liquidUniform_Fog_ = nullptr;\\n\\n liquidUniform_Tex_ = nullptr;\\n\\n}\\n\\n\\n\\nbool ChunkRendererManager::Initialize(std::string &errMsg)\\n\\n{\\n\\n RscNameMgr &rscMgr = RscNameMgr::GetInstance();\\n\\n DC_ = Window::GetInstance().GetD3DDeviceContext();\\n\\n ID3D11Device *dev = Window::GetInstance().GetD3DDevice();\\n\\n\\n\\n if(!basicRenderer_.Initialize(errMsg))\\n\\n {\\n\\n Destroy();\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/Game/ChunkRendererManager.cpp\",\n \"rank\": 50,\n \"score\": 12.73045418904458\n },\n {\n \"content\": \"\\n\\n core.needRefreshDisplay_ = true;\\n\\n}\\n\\n\\n\\nVMECmd_UnloadBinding::VMECmd_UnloadBinding(bool showMsg)\\n\\n{\\n\\n showMsg_ = showMsg;\\n\\n}\\n\\n\\n\\nvoid VMECmd_UnloadBinding::Execute(VoxelModelEditorCore &core, VMECmdMsgQueue &cmdMsgs)\\n\\n{\\n\\n if(core.model_)\\n\\n {\\n\\n if(showMsg_)\\n\\n {\\n\\n cmdMsgs.push({ VMECmdMsg::NORMAL_COLOR,\\n\\n \\\"Binding file unloaded: \\\" + ConstructBindingPath(core.model_->GetName()) });\\n\\n }\\n\\n core.model_.reset();\\n\\n core.needRefreshDisplay_ = true;\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommand.cpp\",\n \"rank\": 51,\n \"score\": 12.688514197841751\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: VoxelModelEditor.cpp\\n\\nDate: 2018.3.5\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n#include <filesystem>\\n\\n#include <map>\\n\\n\\n\\n#include <Utility/HelperFunctions.h>\\n\\n\\n\\n#include \\\"VoxelModelBinding.h\\\"\\n\\n#include \\\"VoxelModelEditor.h\\\"\\n\\n#include \\\"VoxelModelEditorCommand.h\\\"\\n\\n#include \\\"VoxelModelEditorCommandWindow.h\\\"\\n\\n\\n\\nVoxelModelEditor::VoxelModelEditor(void)\\n\\n : VoxelModelEditorCore(), display_(cmdQueue_)\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditor.cpp\",\n \"rank\": 52,\n \"score\": 12.63697522338802\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: ChunkDataPool.cpp\\n\\nDate: 2018.1.29\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n#include <cstring>\\n\\n#include <type_traits>\\n\\n\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include \\\"ChunkDataPool.h\\\"\\n\\n\\n\\nChunkDataPool::ChunkDataPool(size_t maxDataCnt)\\n\\n : maxDataCnt_(maxDataCnt)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nChunkDataPool::~ChunkDataPool(void)\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/ChunkDataPool.cpp\",\n \"rank\": 53,\n \"score\": 12.569826036215392\n },\n {\n \"content\": \" for(size_t i = 0; i < conf.fonts.size(); ++i)\\n\\n {\\n\\n conf.fonts[i].ttfFilename = rM.AsString(\\\"ImFont\\\", \\\"TTFName[\\\" + std::to_string(i) + \\\"]\\\");\\n\\n conf.fonts[i].pixelSize = std::stof(rM.AsString(\\\"ImFont\\\", \\\"PixelSize[\\\" + std::to_string(i) + \\\"]\\\"));\\n\\n }\\n\\n }\\n\\n catch(const std::exception&)\\n\\n {\\n\\n return false;\\n\\n }\\n\\n\\n\\n return true;\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Application::Run(void)\\n\\n{\\n\\n std::string errMsg;\\n\\n if(!Initialize(errMsg))\\n\\n {\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/Application.cpp\",\n \"rank\": 54,\n \"score\": 12.544589766212175\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: ImmediateScreen2D.cpp\\n\\nDate: 2018.1.23\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n#include <string>\\n\\n\\n\\n#include <Utility\\\\FileSystem.h>\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"ImmediateScreen2D.h\\\"\\n\\n\\n\\nImmediateScreen2D::ImmediateScreen2D(void)\\n\\n : norDepthStencilState_(D3DObj_Noinit()),\\n\\n norSampler_(D3DObj_Noinit())\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Source/Components/WinFramework/Screen/ImmediateScreen2D.cpp\",\n \"rank\": 55,\n \"score\": 12.505583123965625\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: Crosshair.cpp\\n\\nDate: 2018.1.23\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"Crosshair.h\\\"\\n\\n\\n\\nbool Crosshair::Initialize(void)\\n\\n{\\n\\n if(!tex_.IsAvailable())\\n\\n return tex_.LoadFromFile(RscNameMgr::GetInstance()(\\\"Crosshair\\\", \\\"Texture\\\"));\\n\\n return true;\\n\\n}\\n\\n\\n\\nvoid Crosshair::Draw(ImmediateScreen2D *imScr2D)\\n\\n{\\n\\n assert(imScr2D != nullptr);\\n\\n Window &win = Window::GetInstance();\\n\\n\\n\\n constexpr float CROSSHAIR_PIXEL_SIZE = 35.0f;\\n\\n float XSize = 0.5f * CROSSHAIR_PIXEL_SIZE / win.GetClientWidth();\\n\\n float YSize = 0.5f * CROSSHAIR_PIXEL_SIZE / win.GetClientHeight();\\n\\n\\n\\n imScr2D->DrawRectangle({ -XSize, -YSize }, { XSize, YSize }, tex_);\\n\\n}\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/Game/Crosshair.cpp\",\n \"rank\": 56,\n \"score\": 12.48295041538595\n },\n {\n \"content\": \" ResultType *rtObj = new ResultType;\\n\\n if(!rtObj->Initialize(dev, rec.slot, data))\\n\\n {\\n\\n delete rtObj;\\n\\n#ifdef OWE_NO_EXCEPTION\\n\\n return nullptr;\\n\\n#else\\n\\n throw OWEShaderError(\\\"Failed to initialize constant buffer object: \\\" + name);\\n\\n#endif\\n\\n }\\n\\n rec.obj = rtObj;\\n\\n return rtObj;\\n\\n }\\n\\n\\n\\n void Bind(ID3D11DeviceContext *DC)\\n\\n {\\n\\n for(auto it : CBs_)\\n\\n {\\n\\n if(it.second.obj)\\n\\n it.second.obj->Bind(DC);\\n\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderConstantBuffer.h\",\n \"rank\": 57,\n \"score\": 12.381108995255794\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: BasicRenderer.cpp\\n\\nDate: 2018.1.13\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <vector>\\n\\n\\n\\n#include <Utility\\\\FileSystem.h>\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"BasicRenderer.h\\\"\\n\\n\\n\\nnamespace\\n\\n{\\n\\n ID3D11InputLayout *CreateInputLayout(const D3D11_INPUT_ELEMENT_DESC *desc,\\n\\n int num, const void *byteCode, size_t length)\\n\\n {\\n\\n assert(desc != nullptr && num > 0);\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/BasicRenderer.cpp\",\n \"rank\": 59,\n \"score\": 12.247592307495701\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: VoxelModel.cpp\\n\\nDate: 2018.3.3\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n\\n\\n#include <cassert>\\n\\n#include <cstdio>\\n\\n#include <fstream>\\n\\n\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include \\\"VoxelModel.h\\\"\\n\\n\\n\\nInputLayout VoxelModel::CreateInputLayout(const void *shaderByteCode, UINT length)\\n\\n{\\n\\n static const D3D11_INPUT_ELEMENT_DESC desc[] =\\n\\n {\\n\\n { \\\"POSITION\\\", 0, DXGI_FORMAT_R32G32B32_FLOAT, 0,\\n\",\n \"file_path\": \"Source/VoxelWorld/VoxelModel/VoxelModel.cpp\",\n \"rank\": 60,\n \"score\": 12.11911049470179\n },\n {\n \"content\": \" {\\n\\n\\n\\n }\\n\\n\\n\\n bool Initialize(ID3D11Device *dev, UINT slot, const BufferType_ *data = nullptr)\\n\\n {\\n\\n assert(dev);\\n\\n slot_ = slot;\\n\\n if(data)\\n\\n {\\n\\n D3D11_SUBRESOURCE_DATA dataDesc = { &data, 0, 0 };\\n\\n buf_ = GenConstantBuffer(dev, sizeof(BufferType_), true, &dataDesc);\\n\\n }\\n\\n else\\n\\n buf_ = GenConstantBuffer(dev, sizeof(BufferType_), true, nullptr);\\n\\n return buf_ != nullptr;\\n\\n }\\n\\n\\n\\n ~ConstantBufferObject(void)\\n\\n {\\n\\n ReleaseCOMObjects(buf_);\\n\\n }\\n\\n };\\n\\n\\n\\n template<ShaderStageSelector StageSelector>\\n\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderConstantBuffer.h\",\n \"rank\": 61,\n \"score\": 12.089360772958445\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/BasicModel.cpp\",\n \"rank\": 63,\n \"score\": 11.892766875024646\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: HelperFunctions.cpp\\n\\nDate: 2018.1.13\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <fstream>\\n\\n#include <iterator>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n#include <Windows.h>\\n\\n\\n\\n#include \\\"D3D11Header.h\\\"\\n\\n#include \\\"HelperFunctions.h\\\"\\n\\n\\n\\nstd::string Helper::ToStr(const std::wstring &wstr)\\n\\n{\\n\\n int size = WideCharToMultiByte(CP_UTF8, 0, wstr.c_str(), -1, nullptr, 0, nullptr, nullptr);\\n\\n char *chs = new char[size];\\n\\n WideCharToMultiByte(CP_UTF8, 0, wstr.c_str(), -1, chs, size, nullptr, nullptr);\\n\",\n \"file_path\": \"Source/Components/Utility/HelperFunctions.cpp\",\n \"rank\": 64,\n \"score\": 11.857366367517463\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: OWEShaderUniforms.h\\n\\nDate: 2017.12.18\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#ifndef OWESHADER_UNIFORMS_H\\n\\n#define OWESHADER_UNIFORMS_H\\n\\n\\n\\n#include <cassert>\\n\\n\\n\\n#include \\\"OWEShaderStage.h\\\"\\n\\n\\n\\nnamespace OWEShaderAux\\n\\n{\\n\\n struct ShaderStageUniformsBinder\\n\\n {\\n\\n template<typename T>\\n\\n void operator()(T &ref)\\n\\n {\\n\\n ref.Bind(DC);\\n\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderUniforms.h\",\n \"rank\": 65,\n \"score\": 11.736644264666797\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Land/V0/LandGenerator_V0.cpp\",\n \"rank\": 66,\n \"score\": 11.684802860979296\n },\n {\n \"content\": \" return true;\\n\\n }\\n\\n\\n\\n SSObj *GetShaderSamplerObject(const std::string &name)\\n\\n {\\n\\n auto it = SSs_.find(name);\\n\\n if(it == SSs_.end())\\n\\n {\\n\\n#ifdef OWE_NO_EXCEPTION\\n\\n return nullptr;\\n\\n#else\\n\\n throw OWEShaderError((\\\"Shader sampler not found: \\\" + name).c_str());\\n\\n#endif\\n\\n }\\n\\n\\n\\n assert(it->second.obj != nullptr);\\n\\n return it->second.obj;\\n\\n }\\n\\n\\n\\n void Bind(ID3D11DeviceContext *DC)\\n\",\n \"file_path\": \"Library/OWE/Src/OWEShader/OWEShaderSampler.h\",\n \"rank\": 67,\n \"score\": 11.675519359789124\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/BasicModel.cpp\",\n \"rank\": 68,\n \"score\": 11.631073194123498\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: VoxelModelEditorCommand.cpp\\n\\nDate: 2018.3.14\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <cassert>\\n\\n\\n\\n#include <Utility\\\\FileSystem.h>\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Resource\\\\ResourceNameManager.h>\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"VoxelModelEditorCommand.h\\\"\\n\\n#include \\\"VoxelModelEditorConsole.h\\\"\\n\\n#include \\\"VoxelModelEditorCore.h\\\"\\n\\n#include \\\"VoxelModelEditorView.h\\\"\\n\\n\\n\\nvoid VMECmd_LoadBinding::Execute(VMECore &core, VMEViewRefreshConfig &refresh, VMEConsole &console)\\n\\n{\\n\\n auto &rM = RscNameMgr::GetInstance();\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorCommand.cpp\",\n \"rank\": 69,\n \"score\": 11.58991105612775\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Screen/GUISystem.cpp\",\n \"rank\": 70,\n \"score\": 11.582181443098996\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: Model.cpp\\n\\nDate: 2018.1.13\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Window\\\\Window.h>\\n\\n#include \\\"Model.h\\\"\\n\\n\\n\\nconst std::vector<ID3D11Buffer*> Model::emptyVtxBufs_(\\n\\n D3D11_IA_VERTEX_INPUT_RESOURCE_SLOT_COUNT, nullptr);\\n\\n\\n\\nbool Model::IsAvailable(void) const\\n\\n{\\n\\n assert(vtxBufBinding_.startSlot < 0 ||\\n\\n vtxBufBinding_.startSlot + vtxBufBinding_.bufs.size()\\n\\n <= D3D11_IA_VERTEX_INPUT_RESOURCE_SLOT_COUNT);\\n\\n return vtxBufBinding_.bufs.size() > 0;\\n\\n}\\n\\n\\n\\nvoid Model::Draw(void) const\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/Model.cpp\",\n \"rank\": 71,\n \"score\": 11.579115536952035\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/Application/Game/Game.cpp\",\n \"rank\": 72,\n \"score\": 11.567779410057781\n },\n {\n \"content\": \" boneMaps.clear();\\n\\n return false;\\n\\n }\\n\\n }\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nint main(void)\\n\\n{\\n\\n try\\n\\n {\\n\\n std::string errMsg;\\n\\n std::wstring confFilename;\\n\\n\\n\\n std::cout << \\\"Enter configure: \\\";\\n\\n std::wcin >> confFilename;\\n\\n\\n\\n std::vector<InputUnit> files;\\n\\n float timeFactor;\\n\",\n \"file_path\": \"Source/Components/SkeletonAnimationConvertor/Main.cpp\",\n \"rank\": 73,\n \"score\": 11.3826414031038\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/FrameBuffer.cpp\",\n \"rank\": 74,\n \"score\": 11.371741135070312\n },\n {\n \"content\": \" filenames);\\n\\n for(auto &it : filenames)\\n\\n core.bindingNames_.push_back(it.first);\\n\\n\\n\\n if(showMsg_)\\n\\n cmdMsgs.push({ VMECmdMsg::NORMAL_COLOR, \\\"Binding list reloaded\\\" });\\n\\n core.needRefreshDisplay_ = true;\\n\\n\\n\\n VMECmd_SelectBindingName(0).Execute(core, cmdMsgs);\\n\\n}\\n\\n\\n\\nVMECmd_SelectBindingName::VMECmd_SelectBindingName(int selected)\\n\\n : selected_(selected)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\nvoid VMECmd_SelectBindingName::Execute(VoxelModelEditorCore &core, VMECmdMsgQueue &cmdMsgs)\\n\\n{\\n\\n core.needRefreshDisplay_ = true;\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditorBak/VoxelModelEditorCommand.cpp\",\n \"rank\": 75,\n \"score\": 11.261967938987098\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/FrameBuffer.cpp\",\n \"rank\": 76,\n \"score\": 11.243790190027099\n },\n {\n \"content\": \" basic_.Destroy();\\n\\n blend_.reset();\\n\\n raster_.reset();\\n\\n depth_.reset();\\n\\n}\\n\\n\\n\\nbool LiquidRenderer::IsAvailable(void) const\\n\\n{\\n\\n return basic_.IsAvailable();\\n\\n}\\n\\n\\n\\nvoid LiquidRenderer::Begin(void)\\n\\n{\\n\\n ID3D11DeviceContext *DC = Window::GetInstance().GetD3DDeviceContext();\\n\\n\\n\\n basic_.Begin();\\n\\n DC->OMSetBlendState(*blend_, nullptr, 0xFFFFFFFF);\\n\\n DC->RSSetState(*raster_);\\n\\n DC->OMSetDepthStencilState(*depth_, 0);\\n\\n}\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp\",\n \"rank\": 77,\n \"score\": 11.22666058949465\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/BasicModel.cpp\",\n \"rank\": 78,\n \"score\": 11.161358532334434\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/Application/VoxelModelEditor/VoxelModelEditorConsole.cpp\",\n \"rank\": 79,\n \"score\": 11.096198081243841\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: FPSCounter.h\\n\\nDate: 2018.1.27\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#pragma once\\n\\n\\n\\n#include <cassert>\\n\\n\\n\\n#include \\\"Clock.h\\\"\\n\\n#include \\\"Uncopiable.h\\\"\\n\\n\\n\",\n \"file_path\": \"Source/Components/Utility/FPSCounter.h\",\n \"rank\": 80,\n \"score\": 10.980292111041923\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/ChunkLoader.h\",\n \"rank\": 81,\n \"score\": 10.979243217965871\n },\n {\n \"content\": \" idxBuf_.Destroy();\\n\\n idxCnt_ = 0;\\n\\n }\\n\\n\\n\\n void Bind(ID3D11DeviceContext *DC)\\n\\n {\\n\\n assert(IsAvailable() && DC != nullptr);\\n\\n static const UINT stride = sizeof(Vertex), offset = 0;\\n\\n ID3D11Buffer *vtxBuf = vtxBuf_.GetBuffer();\\n\\n DC->IASetVertexBuffers(0, 1, &vtxBuf, &stride, &offset);\\n\\n DC->IASetIndexBuffer(idxBuf_.GetBuffer(), DXGI_FORMAT_R16_UINT, 0);\\n\\n }\\n\\n\\n\\n void Unbind(ID3D11DeviceContext *DC)\\n\\n {\\n\\n assert(IsAvailable() && DC != nullptr);\\n\\n static const UINT stride = 0, offset = 0;\\n\\n static const ID3D11Buffer *vtxBuf = nullptr;\\n\\n DC->IASetVertexBuffers(0, 1, &vtxBuf, &stride, &offset);\\n\\n DC->IASetIndexBuffer(nullptr, DXGI_FORMAT_UNKNOWN, 0);\\n\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/SingleBufferMesh.h\",\n \"rank\": 82,\n \"score\": 10.88895143093471\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 83,\n \"score\": 10.879606805219925\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 84,\n \"score\": 10.878566890750065\n },\n {\n \"content\": \" IMGUI_API void AddGlyph(ImWchar c, float x0, float y0, float x1, float y1, float u0, float v0, float u1, float v1, float advance_x);\\n\\n IMGUI_API void AddRemapChar(ImWchar dst, ImWchar src, bool overwrite_dst = true); // Makes 'dst' character/glyph points to 'src' character/glyph. Currently needs to be called AFTER fonts have been built.\\n\\n\\n\\n#ifndef IMGUI_DISABLE_OBSOLETE_FUNCTIONS\\n\\n typedef ImFontGlyph Glyph; // OBSOLETE 1.52+\\n\\n#endif\\n\\n};\\n\\n\\n\\n#if defined(__clang__)\\n\\n#pragma clang diagnostic pop\\n\\n#endif\\n\\n\\n\\n// Include imgui_user.h at the end of imgui.h (convenient for user to only explicitly include vanilla imgui.h)\\n\\n#ifdef IMGUI_INCLUDE_IMGUI_USER_H\\n\\n#include \\\"imgui_user.h\\\"\\n\\n#endif\\n\",\n \"file_path\": \"Source/Components/WinFramework/Screen/imgui/imgui.h\",\n \"rank\": 85,\n \"score\": 10.77193638914004\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 86,\n \"score\": 10.71971574513881\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/SkeletonAnimation/SkeletonDataLoader.cpp\",\n \"rank\": 87,\n \"score\": 10.700620827814202\n },\n {\n \"content\": \"\\n\\nvoid LiquidRenderer::End(void)\\n\\n{\\n\\n ID3D11DeviceContext *DC = Window::GetInstance().GetD3DDeviceContext();\\n\\n\\n\\n DC->OMSetBlendState(nullptr, nullptr, 0xFFFFFFFF);\\n\\n DC->RSSetState(nullptr);\\n\\n DC->OMSetDepthStencilState(nullptr, 0);\\n\\n basic_.End();\\n\\n}\\n\\n\\n\\nLiquidRenderer::ShaderType &LiquidRenderer::GetShader(void)\\n\\n{\\n\\n return basic_.GetShader();\\n\\n}\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Chunk/LiquidRenderer.cpp\",\n \"rank\": 88,\n \"score\": 10.636605706260841\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: Clock.cpp\\n\\nDate: 2017.10.16\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#include <Windows.h>\\n\\n\\n\\n#include \\\"Clock.h\\\"\\n\\n\\n\\nClock::Clock(void)\\n\\n{\\n\\n LARGE_INTEGER freq;\\n\\n QueryPerformanceFrequency(&freq);\\n\\n ratio_ = 1000.0f / freq.QuadPart;\\n\\n\\n\\n Restart();\\n\\n}\\n\\n\\n\\nvoid Clock::Restart(void)\\n\\n{\\n\",\n \"file_path\": \"Source/Components/Utility/Clock.cpp\",\n \"rank\": 89,\n \"score\": 10.62690468657603\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: BasicBuffer.h\\n\\nDate: 2018.1.23\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#pragma once\\n\\n\\n\\n#include <cassert>\\n\\n\\n\\n#include <Utility\\\\D3D11Header.h>\\n\\n#include <Utility\\\\HelperFunctions.h>\\n\\n\\n\\n#include <Window\\\\Window.h>\\n\\n\\n\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/BasicBuffer.h\",\n \"rank\": 90,\n \"score\": 10.597581721085588\n },\n {\n \"content\": \"\\n\\nvoid ChunkRendererManager::Destroy(void)\\n\\n{\\n\\n basicRenderer_.Destroy();\\n\\n for(Texture2D &tex : basicRendererTextures_)\\n\\n tex.Destroy();\\n\\n basicUniforms_.reset();\\n\\n\\n\\n carveRenderer_.Destroy();\\n\\n for(Texture2D &tex : carveRendererTextures_)\\n\\n tex.Destroy();\\n\\n carveUniforms_.reset();\\n\\n\\n\\n liquidRenderer_.Destroy();\\n\\n for(Texture2D &tex : liquidRendererTextures_)\\n\\n tex.Destroy();\\n\\n liquidUniforms_.reset();\\n\\n\\n\\n sampler_ = Sampler(D3DObj_Noinit());\\n\\n\\n\",\n \"file_path\": \"Source/VoxelWorld/Application/Game/ChunkRendererManager.cpp\",\n \"rank\": 91,\n \"score\": 10.55761434574319\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 93,\n \"score\": 10.455681231094307\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: SingleBufferMesh.h\\n\\nDate: 2018.3.19\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#pragma once\\n\\n\\n\\n#include <cassert>\\n\\n#include <vector>\\n\\n\\n\\n#include <Utility\\\\D3D11Header.h>\\n\\n#include <Utility\\\\Uncopiable.h>\\n\\n\\n\\n#include \\\"BasicBuffer.h\\\"\\n\\n\\n\\ntemplate<typename _vertexType>\\n\",\n \"file_path\": \"Source/Components/WinFramework/D3DObject/SingleBufferMesh.h\",\n \"rank\": 94,\n \"score\": 10.395747161695738\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: V2/Biome_V2.h\\n\\nDate: 2018.2.3\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#pragma once\\n\\n\\n\\n#include <cassert>\\n\\n\\n\\n#include <World\\\\Chunk\\\\Chunk.h>\\n\\n#include \\\"Area_V2.h\\\"\\n\\n#include \\\"Common_V2.h\\\"\\n\\n\\n\\nnamespace LandGenerator_V2\\n\\n{\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Land/V2/Biome_V2.h\",\n \"rank\": 95,\n \"score\": 10.375297389745548\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: LinkedMap.h\\n\\nDate: 2018.1.29\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#pragma once\\n\\n\\n\\n#include <algorithm>\\n\\n#include <list>\\n\\n#include <map>\\n\\n\\n\\ntemplate<typename KeyType, typename ValueType>\\n\",\n \"file_path\": \"Source/Components/Utility/LinkedMap.h\",\n \"rank\": 96,\n \"score\": 10.366333807669399\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/Components/WinFramework/Window/Window.cpp\",\n \"rank\": 97,\n \"score\": 10.347523836311467\n },\n {\n \"content\": \"/*================================================================\\n\\nFilename: PerlinNoise2D.h\\n\\nDate: 2018.1.31\\n\\nCreated by AirGuanZ\\n\\n================================================================*/\\n\\n#pragma once\\n\\n\\n\\n#include <cmath>\\n\\n#include <random>\\n\\n\\n\\ntemplate<typename RT>\\n\",\n \"file_path\": \"Source/VoxelWorld/World/Land/PerlinNoise/PerlinNoise2D.h\",\n \"rank\": 98,\n \"score\": 10.292864818243347\n },\n {\n \"content\": \"\",\n \"file_path\": \"Source/VoxelWorld/World/Block/BlockInfoManager.cpp\",\n \"rank\": 99,\n \"score\": 10.2052068517044\n }\n]","isConversational":false}}},{"rowIdx":289,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/classical/aig.hpp"},"repo_name":{"kind":"string","value":"eletesta/cirkit"},"commit":{"kind":"string","value":"6d0939798ea25cecf92306ce796be154139b94f5"},"file_code":{"kind":"string","value":"\n\n#ifndef AIG_HPP\n#define AIG_HPP\n\n#include <iostream>\n#include <map>\n#include <vector>\n\n#include <boost/dynamic_bitset.hpp>\n#include <boost/graph/adjacency_list.hpp>\n#include <boost/property_map/property_map.hpp>\n\n#include <core/properties.hpp>\n#include <core/utils/graph_utils.hpp>\n#include <classical/traits.hpp>\n\nnamespace cirkit\n{\n\nnamespace detail\n{\n using traits_t = boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS>;\n}\n\nstruct aig_function\n{\n detail::traits_t::vertex_descriptor node;\n bool complemented;\n\n inline aig_function operator!() const\n {\n return {node, !complemented};\n }\n\n inline bool operator==( const aig_function& other ) const\n {\n return node == other.node && complemented == other.complemented;\n }\n\n inline bool operator!=( const aig_function& other ) const\n {\n return !( this->operator==(other) );\n }\n\n inline bool operator<( const aig_function& other ) const\n {\n return node < other.node || ( node == other.node && complemented < other.complemented );\n }\n\n inline aig_function operator^( bool value ) const\n {\n return {node, complemented != value };\n }\n};\n\nnamespace detail\n{\nusing node_pair = std::pair<traits_t::vertex_descriptor, traits_t::vertex_descriptor>;\n}\n\nstruct aig_graph_info\n{\n std::string model_name;\n detail::traits_t::vertex_descriptor constant;\n bool constant_used = false;\n bool enable_strashing = true;\n bool enable_local_optimization = true;\n std::map<detail::traits_t::vertex_descriptor, std::string> node_names;\n std::vector<std::pair<aig_function, std::string> > outputs;\n std::vector<detail::traits_t::vertex_descriptor> inputs;\n std::vector<aig_function> cos;\n std::vector<detail::traits_t::vertex_descriptor> cis;\n std::map<std::pair<aig_function, aig_function>, aig_function> strash;\n std::map<aig_function, aig_function> latch;\n boost::dynamic_bitset<> unateness;\n std::vector<detail::node_pair> input_symmetries;\n std::vector<std::vector<detail::traits_t::vertex_descriptor>> trans_words;\n};\n\nnamespace detail\n{\n\nusing vertex_properties_t = boost::property<boost::vertex_name_t, unsigned,\n boost::property<boost::vertex_annotation_t, std::map<std::string, std::string>>>;\nusing edge_properties_t = boost::property<boost::edge_complement_t, bool>;\nusing graph_properties_t = boost::property<boost::graph_name_t, aig_graph_info>;\n\n}\n\nusing aig_graph = digraph_t<detail::vertex_properties_t,\n detail::edge_properties_t,\n detail::graph_properties_t>;\n\nusing aig_node = vertex_t<aig_graph>;\nusing aig_edge = edge_t<aig_graph>;\n\nvoid aig_initialize( aig_graph& aig, const std::string& model_name = std::string() );\naig_function aig_get_constant( aig_graph& aig, bool value );\nbool aig_is_constant_used( const aig_graph& aig );\naig_function aig_create_pi( aig_graph& aig, const std::string& name );\nvoid aig_create_po( aig_graph& aig, const aig_function& f, const std::string& name );\nvoid aig_remove_po( aig_graph& aig );\naig_function aig_create_ci( aig_graph& aig, const std::string& name );\nvoid aig_create_co( aig_graph& aig, const aig_function& f );\naig_function aig_create_and( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_nand( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_or( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_nor( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_xor( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_ite( aig_graph& aig, const aig_function& cond, const aig_function& t, const aig_function& e );\naig_function aig_create_implies( aig_graph& aig, const aig_function& a, const aig_function& b );\naig_function aig_create_maj( aig_graph& aig, const aig_function& a, const aig_function& b, const aig_function& c );\naig_function aig_create_lat( aig_graph& aig, const aig_function& in, const std::string& name );\n\naig_function aig_create_nary_and( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_nand( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_or( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_nor( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_xor( aig_graph& aig, const std::vector< aig_function >& v );\n\nvoid write_dot( const aig_graph& aig, std::ostream& os, const properties::ptr& settings = properties::ptr() );\nvoid write_dot( const aig_graph& aig, const std::string& filename, const properties::ptr& settings = properties::ptr() );\n\nunsigned aig_to_literal( const aig_graph& aig, const aig_function& f );\nunsigned aig_to_literal( const aig_graph& aig, const aig_node& node );\naig_function aig_to_function( const aig_graph& aig, const aig_edge& edge );\n\nstd::ostream& operator<<( std::ostream& os, const aig_function &f );\n\ntemplate<>\nstruct circuit_traits<aig_graph>\n{\n using node = aig_node;\n using edge = aig_edge;\n using node_color_map = std::map<aig_node, boost::default_color_type>;\n};\n\n}\n\n#endif\n\n"},"prefix":{"kind":"string","value":"\n\n#ifndef AIG_HPP\n#define AIG_HPP\n\n#include <iostream>\n#include <map>\n#include <vector>\n\n#include <boost/dynamic_bitset.hpp>\n#include <boost/graph/adjacency_list.hpp>\n#include <boost/property_map/property_map.hpp>\n\n#include <core/properties.hpp>\n#include <core/utils/graph_utils.hpp>\n#include <classical/traits.hpp>\n\nnamespace cirkit\n{\n\nnamespace detail\n{\n using traits_t = boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS>;\n}\n\nstruct aig_function\n{\n detail::traits_t::vertex_descriptor node;\n bool complemented;\n\n inline aig_function operator!() const\n {\n return {node, !complemented};\n }\n\n inline bool operator==( const aig_function& other ) const\n {\n return node == other.node && complemented == other.complemented;\n }\n\n inline bool operator!=( const aig_function& other ) const\n {\n return !( this->operator==(other) );\n }\n\n inline bool operator<( const aig_function& other ) const\n {\n return node < other.node || ( node == other.node && complemented < other.complemented );\n }\n\n inline aig_function operator^( bool value ) const\n {\n return {node, complemented != value };\n }\n};\n\nnamespace detail\n{\nusing node_pair = std::pair<traits_t::vertex_descriptor, traits_t::vertex_descriptor>;\n}\n\nstruct aig_graph_info\n{\n std::string model_name;\n detail::traits_t::vertex_descriptor constant;\n bool constant_used = false;\n bool enable_strashing = true;\n bool enable_local_optimization = true;\n std::map<detail::traits_t::vertex_descriptor, std::string> node_names;\n std::vector<std::pair<aig_function, std::string> > outputs;\n std::vector<detail::traits_t::vertex_descriptor> inputs;\n std::vector<aig_function> cos;\n std::vector<detail::traits_t::vertex_descriptor> cis;\n std::map<std::pair<aig_function, aig_function>, aig_function> strash;\n std::map<aig_function, aig_function> latch;\n boost::dynamic_bitset<> unateness;\n std::vector<detail::node_pair> input_symmetries;\n std::vector<std::vector<detail::traits_t::vertex_descriptor>> trans_words;\n};\n\nnamespace detail\n{\n\nusing vertex_properties_t = boost::property<boost::vertex_name_t, unsigned,\n boost::property<boost::vertex_annotation_t, std::map<std::string, std::string>>>;\nusing edge_properties_t = boost::property<boost::edge_complement_t, bool>;\nusing graph_properties_t = boost::property<boost::graph_name_t, aig_graph_info>;\n\n}\n\nusing aig_graph = digraph_t<detail::vertex_properties_t,\n "},"suffix":{"kind":"string","value":"onst std::string& name );\nvoid aig_remove_po( aig_graph& aig );\naig_function aig_create_ci( aig_graph& aig, const std::string& name );\nvoid aig_create_co( aig_graph& aig, const aig_function& f );\naig_function aig_create_and( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_nand( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_or( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_nor( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_xor( aig_graph& aig, const aig_function& left, const aig_function& right );\naig_function aig_create_ite( aig_graph& aig, const aig_function& cond, const aig_function& t, const aig_function& e );\naig_function aig_create_implies( aig_graph& aig, const aig_function& a, const aig_function& b );\naig_function aig_create_maj( aig_graph& aig, const aig_function& a, const aig_function& b, const aig_function& c );\naig_function aig_create_lat( aig_graph& aig, const aig_function& in, const std::string& name );\n\naig_function aig_create_nary_and( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_nand( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_or( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_nor( aig_graph& aig, const std::vector< aig_function >& v );\naig_function aig_create_nary_xor( aig_graph& aig, const std::vector< aig_function >& v );\n\nvoid write_dot( const aig_graph& aig, std::ostream& os, const properties::ptr& settings = properties::ptr() );\nvoid write_dot( const aig_graph& aig, const std::string& filename, const properties::ptr& settings = properties::ptr() );\n\nunsigned aig_to_literal( const aig_graph& aig, const aig_function& f );\nunsigned aig_to_literal( const aig_graph& aig, const aig_node& node );\naig_function aig_to_function( const aig_graph& aig, const aig_edge& edge );\n\nstd::ostream& operator<<( std::ostream& os, const aig_function &f );\n\ntemplate<>\nstruct circuit_traits<aig_graph>\n{\n using node = aig_node;\n using edge = aig_edge;\n using node_color_map = std::map<aig_node, boost::default_color_type>;\n};\n\n}\n\n#endif\n\n"},"middle":{"kind":"string","value":" detail::edge_properties_t,\n detail::graph_properties_t>;\n\nusing aig_node = vertex_t<aig_graph>;\nusing aig_edge = edge_t<aig_graph>;\n\nvoid aig_initialize( aig_graph& aig, const std::string& model_name = std::string() );\naig_function aig_get_constant( aig_graph& aig, bool value );\nbool aig_is_constant_used( const aig_graph& aig );\naig_function aig_create_pi( aig_graph& aig, const std::string& name );\nvoid aig_create_po( aig_graph& aig, const aig_function& f, c"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"struct store_info<std::vector<aig_node>>\n\n{\n\n static constexpr const char* key = \"gates\";\n\n static constexpr const char* option = \"gate\";\n\n static constexpr const char* mnemonic = \"\";\n\n static constexpr const char* name = \"gate\";\n\n static constexpr const char* name_plural = \"gates\";\n\n};\n\n\n\ntemplate<>\n\nstd::string store_entry_to_string<std::vector<aig_node>>( const std::vector<aig_node>& g );\n\n\n\ntemplate<>\n\nvoid print_store_entry<std::vector<aig_node>>( std::ostream& os, const std::vector<aig_node>& g );\n\n\n\n/******************************************************************************\n\n * tt *\n\n ******************************************************************************/\n\n\n\ntemplate<>\n","file_path":"src/cli/stores.hpp","rank":0,"score":209246.71412900373},{"content":"struct value_traits<unsigned>\n\n{\n\n static const unsigned null_value = 0u;\n\n};\n\n\n\n/******************************************************************************\n\n * index_map *\n\n ******************************************************************************/\n\n\n\ntemplate<typename IndexType, typename ValueType>\n","file_path":"src/core/utils/index.hpp","rank":1,"score":203014.05879441692},{"content":"struct stg_map_esop_params\n\n{\n\n bool optimize_postesop = false; /* post-optimize ESOP cover */\n\n exorcism_script script = exorcism_script::def_wo4; /* optimize ESOP synthesized circuit */\n\n\n\n bool progress = false; /* show progress line */\n\n\n\n bool nocollapse = false; /* DEBUG: do not collapse (useful with dumpfile parameter) */\n\n std::string dumpfile; /* DEBUG: dump ESOP and AIG files for each ESOP cover and LUT */\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_esop.hpp","rank":2,"score":191562.50185482664},{"content":"struct stg_map_luts_stats\n\n{\n\n stg_map_luts_stats()\n\n : own_sub_stats( true ),\n\n map_esop_stats( new stg_map_esop_stats() ),\n\n map_precomp_stats( new stg_map_precomp_stats() )\n\n {\n\n }\n\n\n\n stg_map_luts_stats( stg_map_esop_stats& map_esop_stats,\n\n stg_map_precomp_stats& map_precomp_stats )\n\n : own_sub_stats( false ),\n\n map_esop_stats( &map_esop_stats ),\n\n map_precomp_stats( &map_precomp_stats )\n\n {\n\n }\n\n\n\n ~stg_map_luts_stats()\n\n {\n\n if ( own_sub_stats )\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_luts.hpp","rank":3,"score":191562.50185482664},{"content":"struct stg_map_precomp_params\n\n{\n\n unsigned class_method = 0u; /* classification method: 0u: spectral, 1u: affine */\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_precomp.hpp","rank":4,"score":191562.50185482664},{"content":"struct stg_map_precomp_stats\n\n{\n\n stg_map_precomp_stats()\n\n : class_counter( 4u ),\n\n class_hash( 4u )\n\n {\n\n class_counter[0u].resize( 3u );\n\n class_counter[1u].resize( 6u );\n\n class_counter[2u].resize( 18u );\n\n class_counter[3u].resize( 48u );\n\n }\n\n\n\n double class_runtime = 0.0;\n\n\n\n std::vector<std::vector<unsigned>> class_counter;\n\n\n\n std::vector<std::unordered_map<uint64_t, uint64_t>> class_hash;\n\n};\n\n\n\nvoid stg_map_precomp( circuit& circ, uint64_t function, unsigned num_vars,\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_precomp.hpp","rank":5,"score":191562.50185482664},{"content":"struct stg_map_esop_stats\n\n{\n\n double cover_runtime = 0.0;\n\n double exorcism_runtime = 0.0;\n\n unsigned dumpfile_counter = 0u;\n\n};\n\n\n\nvoid stg_map_esop( circuit& circ, const xmg_graph& function,\n\n const std::vector<unsigned>& line_map,\n\n const stg_map_esop_params& params,\n\n stg_map_esop_stats& stats );\n\n\n\n}\n\n\n\n#endif\n\n\n\n// Local Variables:\n\n// c-basic-offset: 2\n\n// eval: (c-set-offset 'substatement-open 0)\n\n// eval: (c-set-offset 'innamespace 0)\n\n// End:\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_esop.hpp","rank":6,"score":191562.50185482664},{"content":"struct stg_map_shannon_stats\n\n{\n\n stg_map_shannon_stats()\n\n : own_sub_stats( true ),\n\n map_luts_stats( new stg_map_luts_stats() )\n\n {\n\n }\n\n\n\n stg_map_shannon_stats( stg_map_luts_stats& map_luts_stats )\n\n : own_sub_stats( false ),\n\n map_luts_stats( &map_luts_stats )\n\n {\n\n }\n\n\n\n ~stg_map_shannon_stats()\n\n {\n\n if ( own_sub_stats )\n\n {\n\n delete map_luts_stats;\n\n }\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_shannon.hpp","rank":7,"score":191562.50185482664},{"content":"struct stg_map_shannon_params\n\n{\n\n stg_map_shannon_params()\n\n : own_sub_params( true ),\n\n map_luts_params( new stg_map_luts_params() )\n\n {\n\n }\n\n\n\n stg_map_shannon_params( const stg_map_luts_params& map_luts_params )\n\n : own_sub_params( false ),\n\n map_luts_params( &map_luts_params )\n\n {\n\n }\n\n\n\n ~stg_map_shannon_params()\n\n {\n\n if ( own_sub_params )\n\n {\n\n delete map_luts_params;\n\n }\n\n }\n\n\n\n bool own_sub_params = false;\n\n\n\n stg_map_luts_params const* map_luts_params = nullptr;\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_shannon.hpp","rank":8,"score":191562.50185482664},{"content":"struct stg_map_luts_params\n\n{\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_luts.hpp","rank":9,"score":191562.50185482664},{"content":"struct stg_map_shannon_stats\n\n{\n\n stg_map_shannon_stats()\n\n : own_sub_stats( true ),\n\n map_luts_stats( new stg_map_luts_stats() )\n\n {\n\n }\n\n\n\n stg_map_shannon_stats( stg_map_luts_stats& map_luts_stats )\n\n : own_sub_stats( false ),\n\n map_luts_stats( &map_luts_stats )\n\n {\n\n }\n\n\n\n ~stg_map_shannon_stats()\n\n {\n\n if ( own_sub_stats )\n\n {\n\n delete map_luts_stats;\n\n }\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_shannon.hpp","rank":10,"score":188747.12247965336},{"content":"struct stg_map_esop_stats\n\n{\n\n double cover_runtime = 0.0;\n\n double exorcism_runtime = 0.0;\n\n unsigned dumpfile_counter = 0u;\n\n};\n\n\n\nvoid stg_map_esop( circuit& circ, const gia_graph& function,\n\n const std::vector<unsigned>& line_map,\n\n const stg_map_esop_params& params,\n\n stg_map_esop_stats& stats );\n\n\n\n}\n\n\n\n}\n\n\n\n#endif\n\n\n\n// Local Variables:\n\n// c-basic-offset: 2\n\n// eval: (c-set-offset 'substatement-open 0)\n\n// eval: (c-set-offset 'innamespace 0)\n\n// End:\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_esop.hpp","rank":11,"score":188747.12247965336},{"content":"struct stg_map_shannon_params\n\n{\n\n stg_map_shannon_params()\n\n : own_sub_params( true ),\n\n map_luts_params( new stg_map_luts_params() )\n\n {\n\n }\n\n\n\n stg_map_shannon_params( const stg_map_luts_params& map_luts_params )\n\n : own_sub_params( false ),\n\n map_luts_params( &map_luts_params )\n\n {\n\n }\n\n\n\n ~stg_map_shannon_params()\n\n {\n\n if ( own_sub_params )\n\n {\n\n delete map_luts_params;\n\n }\n\n }\n\n\n\n bool own_sub_params = false;\n\n\n\n stg_map_luts_params const* map_luts_params = nullptr;\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_shannon.hpp","rank":12,"score":188747.12247965336},{"content":"struct stg_map_precomp_params\n\n{\n\n unsigned class_method = 0u; /* classification method: 0u: spectral, 1u: affine */\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_precomp.hpp","rank":13,"score":188747.12247965336},{"content":"struct stg_map_luts_stats\n\n{\n\n stg_map_luts_stats()\n\n : own_sub_stats( true ),\n\n map_esop_stats( new stg_map_esop_stats() ),\n\n map_precomp_stats( new stg_map_precomp_stats() )\n\n {\n\n }\n\n\n\n stg_map_luts_stats( stg_map_esop_stats& map_esop_stats,\n\n stg_map_precomp_stats& map_precomp_stats )\n\n : own_sub_stats( false ),\n\n map_esop_stats( &map_esop_stats ),\n\n map_precomp_stats( &map_precomp_stats )\n\n {\n\n }\n\n\n\n ~stg_map_luts_stats()\n\n {\n\n if ( own_sub_stats )\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_luts.hpp","rank":14,"score":188747.12247965336},{"content":"struct stg_map_luts_params\n\n{\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_luts.hpp","rank":15,"score":188747.12247965336},{"content":"struct stg_map_precomp_stats\n\n{\n\n stg_map_precomp_stats()\n\n : class_counter( 4u ),\n\n class_hash( 4u )\n\n {\n\n class_counter[0u].resize( 3u );\n\n class_counter[1u].resize( 6u );\n\n class_counter[2u].resize( 18u );\n\n class_counter[3u].resize( 48u );\n\n }\n\n\n\n double class_runtime = 0.0;\n\n\n\n std::vector<std::vector<unsigned>> class_counter;\n\n\n\n std::vector<std::unordered_map<uint64_t, uint64_t>> class_hash;\n\n};\n\n\n\nvoid stg_map_precomp( circuit& circ, uint64_t function, unsigned num_vars,\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_precomp.hpp","rank":16,"score":188747.12247965336},{"content":"struct stg_map_esop_params\n\n{\n\n gia_graph::esop_cover_method cover_method = gia_graph::esop_cover_method::aig_threshold; /* method to extract initial ESOP cover */\n\n bool optimize_postesop = false; /* post-optimize ESOP cover */\n\n exorcism_script script = exorcism_script::def_wo4; /* optimize ESOP synthesized circuit */\n\n\n\n bool progress = false; /* show progress line */\n\n\n\n bool nocollapse = false; /* DEBUG: do not collapse (useful with dumpfile parameter) */\n\n std::string dumpfile; /* DEBUG: dump ESOP and AIG files for each ESOP cover and LUT */\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_esop.hpp","rank":17,"score":188747.12247965336},{"content":"struct transform_to_constants\n\n{\n\n constant operator()( const char& c ) const\n\n {\n\n switch ( c ) {\n\n case '-':\n\n return constant();\n\n break;\n\n\n\n case '0':\n\n case '1':\n\n return constant( c == '1' );\n\n break;\n\n\n\n default:\n\n assert( false );\n\n return constant();\n\n break;\n\n }\n\n }\n\n};\n\n\n\n// CODE move to utils\n\ntemplate<typename Map>\n","file_path":"addons/cirkit-addon-reversible/src/reversible/io/revlib_parser.cpp","rank":18,"score":188240.41343450002},{"content":"struct map_access_functor\n\n{\n\n explicit map_access_functor( Map& map )\n\n : _map( map )\n\n {\n\n }\n\n\n\n const typename Map::mapped_type& operator()( const typename Map::key_type& key ) const\n\n {\n\n return _map.find( key )->second;\n\n }\n\n\n\nprivate:\n\n Map& _map;\n\n};\n\n\n\ntemplate<typename Map>\n\nmap_access_functor<Map> make_map_access_functor( Map& map )\n\n{\n\n return map_access_functor<Map>( map );\n\n}\n\n\n\nbool parse_string_list( const std::string& line, std::vector<std::string>& params )\n\n{\n","file_path":"addons/cirkit-addon-reversible/src/reversible/io/revlib_parser.cpp","rank":19,"score":184722.17307116368},{"content":"struct symmetric_variables_visitor : public boost::static_visitor<std::vector<std::pair<unsigned, unsigned>>>\n\n{\n\n std::vector<std::pair<unsigned, unsigned>> operator()( const tt& spec ) const\n\n {\n\n std::vector<std::pair<unsigned, unsigned>> pairs;\n\n\n\n const auto n = tt_num_vars( spec );\n\n\n\n for ( auto j = 1u; j < n; ++j )\n\n {\n\n for ( auto i = 0u; i < j; ++i )\n\n {\n\n if ( tt_permute( spec, i, j ) == spec )\n\n {\n\n pairs.push_back( {i, j} );\n\n }\n\n }\n\n }\n\n\n\n return pairs;\n\n }\n\n\n\n std::vector<std::pair<unsigned, unsigned>> operator()( const mig_graph& spec ) const\n\n {\n\n return {};\n\n }\n\n};\n\n\n","file_path":"src/classical/utils/spec_representation.cpp","rank":20,"score":176340.65777762025},{"content":"struct make_one_setting<const char*>\n\n{\n\n static void impl( const properties::ptr& settings, const char* s )\n\n {\n\n settings->set( s, true );\n\n }\n\n};\n\n\n\n}\n\n\n\nvoid make_settings_rec( const properties::ptr& settings );\n\n\n\ntemplate<class T, class... Ts>\n\nvoid make_settings_rec( const properties::ptr& settings, T value, Ts... rest )\n\n{\n\n detail::make_one_setting<T>::impl( settings, value );\n\n make_settings_rec( settings, rest... );\n\n}\n\n\n\ntemplate<class... Ts>\n","file_path":"src/core/properties.hpp","rank":21,"score":164037.57979882613},{"content":"struct is_trivial_visitor : public boost::static_visitor<boost::optional<std::pair<unsigned, bool>>>\n\n{\n\n boost::optional<std::pair<unsigned, bool>> operator()( const tt& spec ) const\n\n {\n\n /* terminal cases */\n\n if ( ( ~spec ).none() || spec.none() )\n\n {\n\n return std::make_pair( 0u, spec.test( 0u ) );\n\n }\n\n\n\n /* single variable */\n\n tt spec_copy = spec;\n\n tt_extend( spec_copy, 6u );\n\n\n\n const auto nvars = tt_num_vars( spec_copy );\n\n\n\n if ( nvars == 6u )\n\n {\n\n for ( auto i = 0u; i < 6u; ++i )\n\n {\n","file_path":"src/classical/utils/spec_representation.cpp","rank":22,"score":162493.1282355422},{"content":"struct hash<cirkit::cube2>\n\n{\n\n std::size_t operator()( cirkit::cube2 const& c ) const\n\n {\n\n return c.value;\n\n }\n\n};\n\n\n\n}\n\n\n\n#endif\n\n\n\n// Local Variables:\n\n// c-basic-offset: 2\n\n// eval: (c-set-offset 'substatement-open 0)\n\n// eval: (c-set-offset 'innamespace 0)\n\n// End:\n","file_path":"src/classical/utils/cube2.hpp","rank":23,"score":161416.54556464902},{"content":"struct iterator_extractor<T const>\n\n{\n\n using type = typename T::const_iterator;\n\n};\n\n\n\ntemplate<typename T>\n","file_path":"src/core/utils/range_utils.hpp","rank":24,"score":161275.38696004282},{"content":" class BA = std::allocator<bool>,\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xtensor_forward.hpp","rank":25,"score":161059.64024199478},{"content":" class xiterator : detail::shape_storage<S>\n\n {\n\n public:\n\n\n\n using self_type = xiterator<It, S, L>;\n\n\n\n using subiterator_type = It;\n\n using value_type = typename subiterator_type::value_type;\n\n using reference = typename subiterator_type::reference;\n\n using pointer = typename subiterator_type::pointer;\n\n using difference_type = typename subiterator_type::difference_type;\n\n using size_type = typename subiterator_type::size_type;\n\n using iterator_category = std::bidirectional_iterator_tag;\n\n\n\n using private_base = detail::shape_storage<S>;\n\n using shape_type = typename private_base::shape_type;\n\n using shape_param_type = typename private_base::param_type;\n\n using index_type = xindex_type_t<shape_type>;\n\n\n\n xiterator() = default;\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xiterator.hpp","rank":26,"score":161057.10066448618},{"content":"struct hash<cirkit::xmg_function>\n\n{\n\n inline std::size_t operator()( const cirkit::xmg_function& f ) const\n\n {\n\n return ( f.node << 1u ) + static_cast<int>( f.complemented );\n\n }\n\n};\n\n\n\n}\n\n\n\nnamespace cirkit\n\n{\n\n\n","file_path":"src/classical/xmg/xmg.hpp","rank":27,"score":158650.47298331925},{"content":" class slice_vector : private std::vector<std::array<long int, 3>>\n\n {\n\n\n\n public:\n\n using index_type = long int;\n\n using base_type = std::vector<std::array<index_type, 3>>;\n\n\n\n // propagating interface\n\n using base_type::begin;\n\n using base_type::cbegin;\n\n using base_type::end;\n\n using base_type::cend;\n\n using base_type::size;\n\n using base_type::operator[];\n\n using base_type::push_back;\n\n\n\n inline slice_vector() = default;\n\n\n\n template <class E, class... Args>\n\n inline slice_vector(const xexpression<E>& e, Args... args)\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xstridedview.hpp","rank":28,"score":157603.67981844526},{"content":"struct mig_functional_hashing_constants\n\n{\n\n static const std::unordered_map<unsigned, std::tuple<unsigned, unsigned, std::map<char, unsigned>, std::string>> min_mig_sizes;\n\n static const std::unordered_map<unsigned, std::tuple<unsigned, unsigned, std::map<char, unsigned>, std::string>> min_depth_mig_sizes;\n\n};\n\n\n\n}\n\n\n\n#endif\n\n\n\n// Local Variables:\n\n// c-basic-offset: 2\n\n// eval: (c-set-offset 'substatement-open 0)\n\n// eval: (c-set-offset 'innamespace 0)\n\n// End:\n","file_path":"src/classical/mig/mig_functional_hashing_constants.hpp","rank":29,"score":156904.2178180312},{"content":"struct hash<cirkit::mig_function>\n\n{\n\n std::size_t operator()( const cirkit::mig_function& f ) const\n\n {\n\n return std::hash<unsigned>()( ( f.node << 1u ) | f.complemented );\n\n }\n\n};\n\n\n\n}\n\n\n\nnamespace cirkit\n\n{\n\n\n\n/******************************************************************************\n\n * Public functions *\n\n ******************************************************************************/\n\n\n\nplim_program\n\ncompile_for_plim( const mig_graph& mig,\n\n const properties::ptr& settings,\n","file_path":"src/classical/plim/plim_compiler.cpp","rank":30,"score":156020.6613811803},{"content":"DdNode * Extra_VectorSupport( DdManager * dd, DdNode * pbFuncs[], int nFuncs )\n\n{\n\n DdNode ** pbFuncsNew;\n\n DdNode * bVars;\n\n int i, Counter;\n\n\n\n Counter = 0;\n\n pbFuncsNew = ALLOC( DdNode *, nFuncs );\n\n // collect the non-zero functions into an array\n\n for ( i = 0; i < nFuncs; i++ )\n\n if ( pbFuncs[i] )\n\n pbFuncsNew[ Counter++ ] = pbFuncs[i];\n\n bVars = Cudd_VectorSupport( dd, pbFuncsNew, Counter ); \n\n\n\n free( pbFuncsNew );\n\n return bVars; \n","file_path":"lib/extra/extraBddUnate.c","rank":31,"score":155080.45774310204},{"content":"struct value_traits\n\n{\n\n static const T null_value;\n\n};\n\n\n\ntemplate<typename T>\n\nconst T value_traits<T>::null_value = T();\n\n\n\ntemplate<>\n","file_path":"src/core/utils/index.hpp","rank":32,"score":154961.79840943636},{"content":"struct remove_constant_if_unused\n\n{\n\n remove_constant_if_unused() {}\n\n remove_constant_if_unused( const aig_graph& aig ) : aig( &aig ) {}\n\n\n\n template <typename Vertex>\n\n bool operator()( const Vertex& v ) const\n\n {\n\n const auto& graph_info = boost::get_property( *aig, boost::graph_name );\n\n\n\n return ( v != graph_info.constant ) || graph_info.constant_used;\n\n }\n\n\n\nprivate:\n\n aig_graph const* aig = nullptr;\n\n};\n\n\n\n/******************************************************************************\n\n * Public functions *\n\n ******************************************************************************/\n","file_path":"src/classical/aig.cpp","rank":33,"score":154947.7583652048},{"content":"struct names_map\n\n{\n\n std::string operator()( const unsigned id )\n\n {\n\n const std::string name = (boost::format(\"var_%d\") % id).str();\n\n auto it = name_map.find( id );\n\n if ( it == name_map.end() )\n\n {\n\n return name;\n\n }\n\n return it->second;\n\n }\n\n\n\n void insert( const unsigned id, const std::string& s )\n\n {\n\n std::string na;\n\n unsigned idx;\n\n if ( split_name( na, idx, s ) )\n\n {\n\n const std::string&& format_string = (boost::format(\"%s_%s\") % na % idx).str();\n","file_path":"programs/classical/aig_to_smt2.cpp","rank":34,"score":154894.50445100773},{"content":"struct hash<std::vector<T>>\n\n{\n\n std::size_t operator()( std::vector<T> const& c ) const\n\n {\n\n std::size_t seed = 0;\n\n for ( const auto& v : c )\n\n {\n\n hash_combine( seed, v );\n\n }\n\n return seed;\n\n }\n\n};\n\n\n\n}\n\n\n\n#endif\n\n\n\n// Local Variables:\n\n// c-basic-offset: 2\n\n// eval: (c-set-offset 'substatement-open 0)\n\n// eval: (c-set-offset 'innamespace 0)\n\n// End:\n","file_path":"src/core/utils/hash_utils.hpp","rank":35,"score":154543.67982999008},{"content":"struct mighty_operation_t\n\n{\n","file_path":"src/classical/mig/mig_verilog.cpp","rank":36,"score":151889.53776433688},{"content":"struct dd_node\n\n{\n\n unsigned var;\n\n unsigned high;\n\n unsigned low;\n\n\n\n bool operator==( const dd_node& other ) const\n\n {\n\n return var == other.var && high == other.high && low == other.low;\n\n }\n\n};\n\n\n\nstd::ostream& operator<<( std::ostream& os, const dd_node& z );\n\n\n","file_path":"src/classical/dd/dd_manager.hpp","rank":37,"score":151880.98191305745},{"content":" class vector;\n\nRANGES_END_NAMESPACE_STD\n\n#else\n\n#include <vector>\n\n#endif\n\n\n\nnamespace ranges\n\n{\n\n inline namespace v3\n\n {\n\n /// \\cond\n\n namespace detail\n\n {\n\n template<typename Rng, typename Cont, typename I = range_common_iterator_t<Rng>>\n\n using ConvertibleToContainer = meta::strict_and<\n\n Range<Cont>,\n\n meta::not_<View<Cont>>,\n\n Movable<Cont>,\n\n ConvertibleTo<range_value_t<Rng>, range_value_t<Cont>>,\n\n Constructible<Cont, I, I>>;\n","file_path":"ext/include/range/v3/to_container.hpp","rank":38,"score":151495.1185621253},{"content":"extern void Extra_WriteBlifNodeUsingGates( FILE * pFile, DdManager * dd, DdNode * Func, char * pInputNames[], char * pOutputName, int fCascade );\n","file_path":"lib/extra/extra.h","rank":39,"score":151443.58561126588},{"content":"DdNode *\n\nExtra_ConstCofVars(\n\n DdManager * dd, /* the manager */\n\n DdNode * Func, /* the function whose constant cofactor variables are computed */\n\n int fCofValue ) /* the flag which shows which constant we are interested in */\n\n{\n\n DdNode * zRes;\n\n DdNode * bSupp;\n\n bSupp = Cudd_Support( dd, Func ); Cudd_Ref( bSupp );\n\n zRes = Extra_ConstCofVarsSupport( dd, Func, bSupp, fCofValue ); Cudd_Ref( zRes );\n\n Cudd_RecursiveDeref( dd, bSupp );\n\n Cudd_Deref( zRes );\n\n return zRes;\n","file_path":"lib/extra/extraBddUnate.c","rank":40,"score":151436.20201134076},{"content":"struct hash_value_impl\n\n{\n\n static void apply( std::size_t& seed, const Tuple& tuple )\n\n {\n\n hash_value_impl<Tuple, Index - 1>::apply( seed, tuple );\n\n hash_combine( seed, std::get<Index>( tuple ) );\n\n }\n\n};\n\n\n\ntemplate<class Tuple>\n","file_path":"src/core/utils/hash_utils.hpp","rank":41,"score":148996.43787576997},{"content":"struct mig_remove_constant_if_unused\n\n{\n\n mig_remove_constant_if_unused() {}\n\n mig_remove_constant_if_unused( const mig_graph& mig ) : mig( &mig ) {}\n\n\n\n template <typename Vertex>\n\n bool operator()( const Vertex& v ) const\n\n {\n\n const auto& graph_info = boost::get_property( *mig, boost::graph_name );\n\n\n\n return ( v != graph_info.constant ) || graph_info.constant_used;\n\n }\n\n\n\nprivate:\n\n mig_graph const* mig = nullptr;\n\n};\n\n\n\n/******************************************************************************\n\n * Public functions *\n\n ******************************************************************************/\n","file_path":"src/classical/mig/mig.cpp","rank":42,"score":148983.10693132997},{"content":" class xoptional_vector;\n\n\n\n template <class T, class A, class BA>\n\n struct xoptional_sequence_inner_types<xoptional_vector<T, A, BA>>\n\n {\n\n using base_container_type = std::vector<T, A>;\n\n using flag_container_type = std::vector<bool, BA>;\n\n };\n\n\n\n /*****************************************************\n\n * xoptional_vector and xoptional_array declarations *\n\n *****************************************************/\n\n\n\n template <class T, std::size_t I>\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xmissing.hpp","rank":43,"score":148170.60298256885},{"content":"int\n\nextraConstCofVarsVerify( \n\n DdManager * dd, /* the manager */\n\n DdNode * bFunc, /* the function whose symmetries are computed */\n\n int fCofValue, /* const cof value */\n\n DdNode * zConstCofVar ) /* the set of unate variables */\n\n{\n\n DdNode * bSupp;\n\n DdNode * zTemp;\n\n DdNode * bF0, * bF1;\n\n int flag;\n\n\n\n flag = 1;\n\n bSupp = Cudd_Support( dd, bFunc ); Cudd_Ref( bSupp );\n\n for ( zTemp = zConstCofVar; zTemp != z0; zTemp = cuddE(zTemp) )\n\n {\n\n// if ( !Cudd_bddLeq( dd, bSupp, dd->vars[zTemp->index/2] ) )\n\n// flag = 0;\n\n\n\n bF0 = Cudd_Cofactor( dd, bFunc, Cudd_Not(dd->vars[zTemp->index/2]) ); Cudd_Ref( bF0 );\n\n bF1 = Cudd_Cofactor( dd, bFunc, dd->vars[zTemp->index/2] ); Cudd_Ref( bF1 );\n\n\n\n if ( zTemp->index%2 == 0 )\n\n {\n\n if ( fCofValue == 0 )\n\n {\n\n if ( bF1 != b0 )\n\n flag = 0;\n\n } \n\n else // if ( fCofValue == 1 )\n\n {\n\n if ( bF1 != b1 )\n\n flag = 0;\n\n }\n\n }\n\n if ( zTemp->index%2 == 1 )\n\n {\n\n if ( fCofValue == 0 )\n\n {\n\n if ( bF0 != b0 )\n\n flag = 0;\n\n } \n\n else // if ( fCofValue == 1 )\n\n {\n\n if ( bF0 != b1 )\n\n flag = 0;\n\n }\n\n }\n\n\n\n Cudd_RecursiveDeref( dd, bF0 );\n\n Cudd_RecursiveDeref( dd, bF1 );\n\n\n\n if ( flag == 0 )\n\n break;\n\n\n\n }\n\n Cudd_RecursiveDeref( dd, bSupp );\n\n return flag;\n","file_path":"lib/extra/extraBddUnate.c","rank":44,"score":147969.15629563318},{"content":"DdNode * Extra_ConstCofVarsSharing( \n\n DdManager * dd, /* the manager */\n\n DdNode * pbFuncs[], /* the functions whose constant cofactor variables are computed */\n\n int nFuncs, /* the number of functions */\n\n int fCofValue ) /* the flag which shows which constant we are interested in */\n\n{\n\n DdNode * zRes, * zTemp, * zConstCofVars;\n\n DdNode * bVars;\n\n int i;\n\n\n\n assert( nFuncs > 0 );\n\n\n\n// bVars = Cudd_VectorSupport( dd, pbFuncs, nFuncs ); Cudd_Ref( bVars );\n\n bVars = Extra_VectorSupport( dd, pbFuncs, nFuncs ); Cudd_Ref( bVars );\n\n\n\n zRes = NULL;\n\n for ( i = 0; i < nFuncs; i++ )\n\n if ( pbFuncs[i] )\n\n {\n\n zConstCofVars = Extra_ConstCofVarsSupport( dd, pbFuncs[i], bVars, fCofValue ); Cudd_Ref( zConstCofVars );\n\n if ( zRes == NULL )\n\n zRes = zConstCofVars; // takes ref\n\n else\n\n {\n\n zRes = Cudd_zddIntersect( dd, zTemp = zRes, zConstCofVars ); Cudd_Ref( zRes );\n\n Cudd_RecursiveDerefZdd( dd, zTemp );\n\n Cudd_RecursiveDerefZdd( dd, zConstCofVars );\n\n }\n\n if ( zRes == z0 )\n\n break;\n\n }\n\n Cudd_RecursiveDeref( dd, bVars );\n\n Cudd_Deref(zRes);\n\n return zRes;\n","file_path":"lib/extra/extraBddUnate.c","rank":45,"score":147963.00895696066},{"content":"DdNode *\n\nExtra_ConstCofVarsSupport(\n\n DdManager * dd, /* the manager */\n\n DdNode * Func, /* the function whose constant cofactor variables are computed */\n\n DdNode * bSupp, /* the given support */\n\n int fCofValue ) /* the flag which shows which constant we are interested in */\n\n{\n\n DdNode * zRes;\n\n do {\n\n dd->reordered = 0;\n\n if ( fCofValue == 0 )\n\n zRes = extraConst0CofVars( dd, Func, bSupp );\n\n else\n\n zRes = extraConst1CofVars( dd, Func, bSupp );\n\n } while (dd->reordered == 1);\n\n Cudd_Ref( zRes );\n\n assert( extraConstCofVarsVerify(dd, Func, fCofValue, zRes) );\n\n Cudd_Deref( zRes );\n\n return zRes;\n","file_path":"lib/extra/extraBddUnate.c","rank":46,"score":147956.73455090827},{"content":"struct less<std::vector<boost::tribool>>\n\n{\n\n bool operator()( const std::vector<boost::tribool>& v1, const std::vector<boost::tribool>& v2 ) const\n\n {\n\n assert( v1.size() == v2.size() );\n\n\n\n auto i = 0u;\n\n while ( i < v1.size() )\n\n {\n\n const auto& t1 = v1[i];\n\n const auto& t2 = v2[i];\n\n\n\n if ( t1 != t2 )\n\n {\n\n if ( boost::indeterminate( t1 ) ) { return true; }\n\n if ( boost::indeterminate( t2 ) ) { return false; }\n\n return !t1 && t2;\n\n }\n\n\n\n ++i;\n","file_path":"src/classical/dd/visit_solutions.cpp","rank":47,"score":146732.56820602648},{"content":" class xoptional_vector;\n\n\n\n /**\n\n * @typedef xarray_optional\n\n * Alias template on xarray_container for handling missing values\n\n *\n\n * @tparam T The value type of the elements.\n\n * @tparam L The layout_type of the container (default: row_major).\n\n * @tparam A The allocator of the container holding the elements.\n\n * @tparam BA The allocator of the container holding the missing flags.\n\n * @tparam SA The allocator of the containers holding the shape and the strides.\n\n */\n\n template <class T, layout_type L = DEFAULT_LAYOUT,\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xtensor_forward.hpp","rank":48,"score":144772.16571669516},{"content":"void Extra_WriteBlifNodeUsingGates( FILE * pFile, DdManager * dd, DdNode * Func, char * pInputNames[], char * pOutputName, int fCascade )\n\n{\n\n DdNode * zCover;\n\n // create the ZDD cover\n\n if ( Extra_WithComplementedEdges(Func) )\n\n {\n\n zCover = Extra_zddIsopCover( dd, Func, Func ); Cudd_Ref( zCover );\n\n extraWriteBlifNodeUsingGates( pFile, dd, zCover, pInputNames, pOutputName, fCascade );\n\n Cudd_RecursiveDerefZdd( dd, zCover );\n\n }\n\n else\n\n extraWriteBlifNodeUsingGates( pFile, dd, Func, pInputNames, pOutputName, fCascade );\n","file_path":"lib/extra/extraDdPrint.c","rank":49,"score":144670.74032101617},{"content":"static void extraWriteBlifNodeUsingGates( FILE * pFile, DdManager * dd, DdNode * zCover, char * pInputNames[], char * pOutputName, int fCascade );\n","file_path":"lib/extra/extraDdPrint.c","rank":50,"score":144652.3368948362},{"content":" class xoptional_vector : public xoptional_sequence<xoptional_vector<T, A, BA>>\n\n {\n\n public:\n\n\n\n using self_type = xoptional_vector;\n\n using base_type = xoptional_sequence<self_type>;\n\n using base_value_type = typename base_type::base_value_type;\n\n\n\n using value_type = typename base_type::value_type;\n\n using size_type = typename base_type::size_type;\n\n using difference_type = typename base_type::difference_type;\n\n using reference = typename base_type::reference;\n\n using const_reference = typename base_type::const_reference;\n\n using pointer = typename base_type::pointer;\n\n using const_pointer = typename base_type::const_pointer;\n\n\n\n using iterator = typename base_type::iterator;\n\n using const_iterator = typename base_type::const_iterator;\n\n using reverse_iterator = typename base_type::reverse_iterator;\n\n using const_reverse_iterator = typename base_type::const_reverse_iterator;\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xmissing.hpp","rank":51,"score":143864.81056976088},{"content":" class xbuffer_adaptor : private detail::buffer_storage_t<T, A, O>\n\n {\n\n public:\n\n\n\n using base_type = detail::buffer_storage_t<T, A, O>;\n\n using allocator_type = typename base_type::allocator_type;\n\n using value_type = typename base_type::value_type;\n\n using reference = typename base_type::reference;\n\n using const_reference = typename base_type::const_reference;\n\n using pointer = typename base_type::pointer;\n\n using const_pointer = typename base_type::const_pointer;\n\n\n\n using size_type = typename base_type::size_type;\n\n using difference_type = typename base_type::difference_type;\n\n\n\n using iterator = pointer;\n\n using const_iterator = const_pointer;\n\n using reverse_iterator = std::reverse_iterator<iterator>;\n\n using const_reverse_iterator = std::reverse_iterator<const_iterator>;\n\n\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xbuffer_adaptor.hpp","rank":52,"score":143555.0726091149},{"content":"struct is_explicit_visitor : public boost::static_visitor<bool>\n\n{\n\n bool operator()( const tt& spec ) const\n\n {\n\n return true;\n\n }\n\n\n\n bool operator()( const mig_graph& spec ) const\n\n {\n\n return false;\n\n }\n\n};\n\n\n","file_path":"src/classical/utils/spec_representation.cpp","rank":53,"score":141830.90009251123},{"content":"struct is_normal_visitor : public boost::static_visitor<bool>\n\n{\n\n bool operator()( const tt& spec ) const\n\n {\n\n return !spec[0];\n\n }\n\n\n\n bool operator()( const mig_graph& spec ) const\n\n {\n\n mig_simple_assignment_simulator::mig_name_value_map m;\n\n const auto r = simulate_mig( spec, mig_simple_assignment_simulator( m ) );\n\n\n\n return !r.at( mig_info( spec ).outputs[0u].first );\n\n }\n\n};\n\n\n","file_path":"src/classical/utils/spec_representation.cpp","rank":54,"score":141830.90009251123},{"content":"struct t_costs {\n\n cost_t operator()(const gate& g, unsigned lines) const;\n\n};\n\n\n\n/**\n\n * @brief H cost from Barenco:1995 based on the Clifford+T Library\n\n *\n\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\n\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\n\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\n\n * Elementary gates for quantum computation\n\n * Physical Review A, 1995\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":55,"score":140988.33030453918},{"content":"struct h_costs {\n\n cost_t operator()(const gate& g, unsigned lines) const;\n\n};\n\n\n\n/**\n\n * @brief Calculates the costs of a circuit by a given cost function\n\n *\n\n * With this function the costs for a circuit can be calculated.\n\n * Thereby this functions is generic and calls a cost_function for determine the costs.\n\n * The costs function can either be derived from costs_by_circuit, whereby\n\n * the costs are calculated on base by the whole circuit or it can be\n\n * derived from costs_by_gate, whereby the costs are of each gate are calculated\n\n * and the sum is returned.\n\n *\n\n * @param circ Circuit\n\n * @param f Cost function\n\n *\n\n * @return The costs for the circuit in respect to the given cost function\n\n *\n\n * @sa \\ref sub_cost_functions\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":56,"score":140988.33030453918},{"content":"class _LIBCPP_TYPE_VIS_ONLY vector;\n\ntemplate <class, class>\n","file_path":"ext/include/meta/meta.hpp","rank":57,"score":139233.60898120014},{"content":"class _LIBCPP_TYPE_VIS_ONLY map;\n\ntemplate <class, class, class, class>\n","file_path":"ext/include/meta/meta.hpp","rank":58,"score":139182.1058852118},{"content":"struct _LIBCPP_TYPE_VIS_ONLY equal_to;\n\ntemplate <class>\n","file_path":"ext/include/meta/meta.hpp","rank":59,"score":139014.74574546036},{"content":"struct _LIBCPP_TYPE_VIS_ONLY pair;\n\ntemplate <class>\n","file_path":"ext/include/meta/meta.hpp","rank":60,"score":139014.74574546036},{"content":"struct _LIBCPP_TYPE_VIS_ONLY hash;\n\ntemplate <class>\n","file_path":"ext/include/meta/meta.hpp","rank":61,"score":139014.74574546036},{"content":"struct _LIBCPP_TYPE_VIS_ONLY less;\n\ntemplate <class>\n","file_path":"ext/include/meta/meta.hpp","rank":62,"score":139014.74574546036},{"content":"struct line_costs\n\n{\n\n /**\n\n * @brief Returns the number of lines\n\n *\n\n * @param circ Circuit\n\n *\n\n * @return Number of lines\n\n *\n\n * @since 1.0\n\n */\n\n cost_t operator()( const circuit& circ ) const;\n\n};\n\n\n\n/**\n\n * @brief Calculates the transistor costs\n\n *\n\n * This class calculates the so called transistor\n\n * costs for a gate. They are the number of\n\n * control lines multiplied by 8.\n\n *\n\n * @sa \\ref sub_cost_functions\n\n *\n\n * @since 1.0\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":63,"score":138484.95308096363},{"content":"struct stg_tag\n\n{\n\n stg_tag() {}\n\n stg_tag( const boost::dynamic_bitset<>& function ) : function( function ) {}\n\n\n\n boost::dynamic_bitset<> function;\n\n boost::dynamic_bitset<> affine_class;\n\n};\n\n\n\n/**\n\n * @brief Compares type of a boost::any variable\n\n *\n\n * This method is called by is_\\em gate functions\n\n * like is_toffoli().\n\n *\n\n * @param operand A variable of type boost::any\n\n * @return true, if \\p operand is of type \\p T.\n\n *\n\n * @since 1.0\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp","rank":64,"score":138484.95308096363},{"content":"struct depth_costs\n\n{\n\n cost_t operator()( const circuit& circ ) const;\n\n};\n\n\n\n/**\n\n * @brief Quantum costs from SK:2013\n\n *\n\n * Reference: Marek Szyprowski and Pawel Kerntopf, Low quantum\n\n * cost realization of generalized peres and toffoli gates with\n\n * multiple-control signals, IEEE Nano 2013, 802--807.\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":65,"score":138484.95308096363},{"content":"struct pauli_tag\n\n{\n\n pauli_tag() {}\n\n\n\n pauli_tag( pauli_axis axis, unsigned root = 1u, bool adjoint = false )\n\n : axis( axis ),\n\n root( root ),\n\n adjoint( adjoint )\n\n {\n\n }\n\n\n\n /**\n\n * @brief Axis of Pauli gate\n\n */\n\n pauli_axis axis = pauli_axis::X;\n\n\n\n /**\n\n * @brief root, i.e., U^{1/root}\n\n */\n\n unsigned root = 1u;\n","file_path":"addons/cirkit-addon-reversible/src/reversible/pauli_tags.hpp","rank":66,"score":138484.95308096363},{"content":"struct fredkin_tag {};\n\n\n\n/**\n\n * @brief Target Tag for Peres gates.\n\n *\n\n * @sa \\ref sub_target_tags\n\n *\n\n * @since 1.0\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp","rank":67,"score":138484.95308096363},{"content":"struct peres_tag {};\n\n\n\n/**\n\n * @brief Target Tag for Modules\n\n *\n\n * @sa \\ref sub_target_tags\n\n *\n\n * @since 1.1\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp","rank":68,"score":138484.95308096363},{"content":"struct hadamard_tag {};\n\n\n\nbool is_hadamard( const gate& g );\n\n\n\ngate& append_hadamard( circuit& circ, unsigned target );\n\ngate& prepend_hadamard( circuit& circ, unsigned target );\n\ngate& insert_hadamard( circuit& circ, unsigned n, unsigned target );\n\n\n\n}\n\n\n\n#endif\n\n\n\n// Local Variables:\n\n// c-basic-offset: 2\n\n// eval: (c-set-offset 'substatement-open 0)\n\n// eval: (c-set-offset 'innamespace 0)\n\n// End:\n","file_path":"addons/cirkit-addon-reversible/src/reversible/pauli_tags.hpp","rank":69,"score":138484.95308096363},{"content":"struct t_depth_costs {\n\n cost_t operator()(const gate& g, unsigned lines) const;\n\n};\n\n\n\n/**\n\n * @brief T cost from Barenco:1995 based on the Clifford+T Library\n\n *\n\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\n\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\n\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\n\n * Elementary gates for quantum computation\n\n * Physical Review A, 1995\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":70,"score":138484.95308096363},{"content":"struct module_tag\n\n{\n\n /**\n\n * @brief Name of the module\n\n *\n\n * @since 1.1\n\n */\n\n std::string name;\n\n\n\n /**\n\n * @brief Reference to the circuit\n\n *\n\n * Usually the circuit is inside of the\n\n * circuit modules list.\n\n *\n\n * @since 1.1\n\n */\n\n std::shared_ptr<circuit> reference;\n\n};\n\n\n\n/**\n\n * @brief Single target tag\n\n *\n\n * @sa \\ref sub_target_tags\n\n *\n\n * @since 2.3\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp","rank":71,"score":138484.95308096363},{"content":"struct toffoli_tag {};\n\n\n\n/**\n\n * @brief Target Tag for Fredkin gates.\n\n *\n\n * @sa \\ref sub_target_tags\n\n *\n\n * @since 1.0\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp","rank":72,"score":138484.95308096363},{"content":"struct transistor_costs\n\n{\n\n /**\n\n * @brief Returns the transistor costs for gate \\p g\n\n *\n\n * @param g Gate\n\n * @param lines Number of lines in the circuit\n\n *\n\n * @return Transistor Costs for gate \\p g\n\n *\n\n * @since 1.0\n\n */\n\n cost_t operator()( const gate& g, unsigned lines ) const;\n\n};\n\n\n\n/**\n\n * @brief Returns the depth of the rev. circuit\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":73,"score":138484.95308096363},{"content":"struct gate_costs\n\n{\n\n /**\n\n * @brief Returns the number of gates\n\n *\n\n * @param circ Circuit\n\n *\n\n * @return Number of gates\n\n *\n\n * @since 1.0\n\n */\n\n cost_t operator()( const circuit& circ ) const;\n\n};\n\n\n\n/**\n\n * @brief Calculates the line costs\n\n *\n\n * This costs class is basically a wrapper around lines()\n\n * and is given for convenience use with other cost\n\n * functions.\n\n *\n\n * @sa \\ref sub_cost_functions\n\n *\n\n * @since 1.0\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":74,"score":138484.95308096363},{"content":" class SA = std::allocator<typename std::vector<T, A>::size_type>>\n\n using xarray_optional = xarray_container<xoptional_vector<T, A, BA>, L, DEFAULT_SHAPE_CONTAINER(T, A, SA)>;\n\n\n\n /**\n\n * @typedef xtensor_optional\n\n * Alias template on xtensor_container for handling missing values\n\n *\n\n * @tparam T The value type of the elements.\n\n * @tparam N The dimension of the tensor.\n\n * @tparam L The layout_type of the container (default: row_major).\n\n * @tparam A The allocator of the containers holding the elements.\n\n * @tparam BA The allocator of the container holding the missing flags.\n\n */\n\n template <class T, std::size_t N, layout_type L = DEFAULT_LAYOUT, class A = std::allocator<T>, class BA = std::allocator<bool>>\n\n using xtensor_optional = xtensor_container<xoptional_vector<T, A, BA>, N, L>;\n\n\n\n namespace check_policy\n\n {\n\n struct none\n\n {\n\n };\n\n struct full\n\n {\n\n };\n\n }\n\n}\n\n\n\n#endif\n","file_path":"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xtensor_forward.hpp","rank":75,"score":138483.11804434698},{"content":"struct _LIBCPP_TYPE_VIS_ONLY char_traits;\n\ntemplate <class, class>\n","file_path":"ext/include/meta/meta.hpp","rank":76,"score":136339.53086817384},{"content":"struct io_projectq_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":77,"score":136099.106328871},{"content":"struct io_liquid_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":78,"score":136099.106328871},{"content":"struct weighted_reordering\n\n{\n\n /**\n\n * @brief Standard constructor\n\n *\n\n * Initializes default values\n\n *\n\n * @since 1.0\n\n */\n\n weighted_reordering();\n\n\n\n /**\n\n * @brief Constructor for adjusting the parameters\n\n *\n\n * In this parameters the values for \\p alpha and \\p beta can\n\n * be set directly.\n\n *\n\n * @param alpha Control variable for the weight of the variable frequency term\n\n * @param beta Control variable for the weight of the balanced variable term\n\n *\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/esop_synthesis.hpp","rank":79,"score":136099.106328871},{"content":"struct io_qpic_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":80,"score":136099.106328871},{"content":"struct io_qcode_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":81,"score":136099.106328871},{"content":"struct garbage_manager\n\n{\n\npublic:\n\n garbage_manager( const rcbdd& cf ) : cf( cf )\n\n {\n\n std::vector<BDD> garbage;\n\n\n\n for ( auto i = cf.num_outputs(); i < cf.num_vars(); ++i )\n\n {\n\n garbage += cf.y(i);\n\n }\n\n\n\n store += garbage;\n\n }\n\n\n\n const std::vector<BDD>& operator[]( unsigned index )\n\n {\n\n if ( index >= store.size() )\n\n {\n\n for ( auto i = store.size(); i <= index; ++i )\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/embed_bdd.cpp","rank":82,"score":136099.106328871},{"content":"struct io_qsharp_tag_t {};\n\n\n\n/******************************************************************************\n\n * circuit *\n\n ******************************************************************************/\n\n\n\ntemplate<>\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":83,"score":136099.106328871},{"content":"struct cube_sort\n\n{\n\n explicit cube_sort( unsigned var ) : var( var ) {}\n\n\n\n bool operator()( const cubes_type::value_type& cube1, const cubes_type::value_type& cube2 ) const\n\n {\n\n return !cube_is_negative( var )( cube1 ) && cube_is_negative( var)( cube2 );\n\n }\n\n\n\nprivate:\n\n unsigned var;\n\n};\n\n\n\nweighted_reordering::weighted_reordering()\n\n : alpha( 0.5 ), beta( 0.5 ) {}\n\n\n\nweighted_reordering::weighted_reordering( float alpha, float beta )\n\n : alpha( alpha ), beta( beta ) {}\n\n\n\nvoid weighted_reordering::reorder( cubes_type::iterator begin, cubes_type::iterator end, const std::vector<unsigned>& vars ) const\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/esop_synthesis.cpp","rank":84,"score":136099.106328871},{"content":"struct cube_is_negative\n\n{\n\n explicit cube_is_negative( unsigned var ) : var( var ) {}\n\n\n\n bool operator()( const cubes_type::value_type& cube ) const\n\n {\n\n return !( cube.first.at( var ) && *cube.first.at( var ) );\n\n }\n\n\n\nprivate:\n\n unsigned var;\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/synthesis/esop_synthesis.cpp","rank":85,"score":136099.106328871},{"content":"struct io_tikz_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":86,"score":136099.106328871},{"content":"struct io_qc_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":87,"score":136099.106328871},{"content":"struct ncv_quantum_costs {\n\n cost_t operator()(const gate& g, unsigned lines) const;\n\n};\n\n\n\n/**\n\n * @brief Quantum costs from Barenco:1995 based on the Clifford+T Library\n\n *\n\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\n\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\n\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\n\n * Elementary gates for quantum computation\n\n * Physical Review A, 1995\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":88,"score":136099.106328871},{"content":"struct sk2013_quantum_costs\n\n{\n\n cost_t operator()( const gate& g, unsigned lines ) const;\n\n};\n\n\n\n/**\n\n * @brief Quantum costs from Barenco:1995 based on the NCV Library\n\n *\n\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\n\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\n\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\n\n * Elementary gates for quantum computation\n\n * Physical Review A, 1995\n\n *\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":89,"score":136099.106328871},{"content":"struct io_spec_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":90,"score":136099.106328871},{"content":"struct io_quipper_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":91,"score":136099.106328871},{"content":"struct feature\n\n{\n\n uint16_t control = 0u;\n\n uint16_t polarity = 0u;\n\n\n\n feature( gate& g );\n\n feature();\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/optimization/esop_post_optimization.cpp","rank":92,"score":136099.106328871},{"content":"struct pair\n\n{\n\n gate f;\n\n gate s;\n\n feature a;\n\n feature b;\n\n circuit const* c = nullptr;\n\n circuit equivalent;\n\n\n\n pair( const gate& f, const gate& s, const circuit& c, feature& a, feature& b );\n\n pair();\n\n\n\n bool computequivalence( unsigned& c1, unsigned& c2, double* t1, double* t2 );\n\n\n\n unsigned long long get_cost();\n\n\n\nprivate:\n\n std::pair<gate, unsigned> single_control{f, 0u};\n\n};\n\n\n","file_path":"addons/cirkit-addon-reversible/src/reversible/optimization/esop_post_optimization.cpp","rank":93,"score":136099.106328871},{"content":"struct io_numpy_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":94,"score":136099.106328871},{"content":"struct clifford_t_quantum_costs {\n\n cost_t operator()(const gate& g, unsigned lines) const;\n\n};\n\n\n\n/**\n\n * @brief T depth from Barenco:1995 based on the Clifford+T Library\n\n *\n\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\n\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\n\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\n\n * Elementary gates for quantum computation\n\n * Physical Review A, 1995\n\n */\n","file_path":"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp","rank":95,"score":136099.106328871},{"content":"struct io_real_tag_t {};\n","file_path":"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp","rank":96,"score":136099.106328871},{"content":"#include <gmpxx.h>\n\n\n\nusing namespace boost::assign;\n\n\n\nnamespace cirkit\n\n{\n\n\n\nvoid count_output_pattern_recurse( DdManager* mgr, DdNode* node, unsigned num_inputs, unsigned num_outputs,\n\n const std::string& pattern, unsigned depth,\n\n std::vector<mpz_class>& counts, std::vector<std::string>& patterns,\n\n bool verbose )\n\n{\n\n if ( Cudd_IsConstant( node ) ) { return; }\n\n\n\n if ( depth == num_outputs )\n\n {\n\n if ( verbose )\n\n {\n\n std::cout << pattern << \" has \" << Cudd_CountMinterm( mgr, node, num_inputs ) << std::endl;\n\n }\n","file_path":"addons/cirkit-addon-reversible/src/reversible/functions/calculate_additional_lines.cpp","rank":97,"score":59.832802568007025},{"content":" using maj_strash_key_t = std::tuple<xmg_function, xmg_function, xmg_function>;\n\n using xor_strash_key_t = std::pair<xmg_function, xmg_function>;\n\n std::unordered_map<maj_strash_key_t, node_t, hash<maj_strash_key_t>> maj_strash;\n\n std::unordered_map<xor_strash_key_t, node_t, hash<xor_strash_key_t>> xor_strash;\n\n\n\n complement_property_map_t _complement;\n\n\n\n /* additional network information */\n\n dirty<std::vector<unsigned>> fanout;\n\n dirty<std::vector<std::vector<node_t>>> parentss;\n\n dirty<std::vector<unsigned>> levels;\n\n\n\n /* network settings and stats */\n\n bool _native_xor = true;\n\n bool _enable_structural_hashing = true;\n\n bool _enable_inverter_propagation = true;\n\n unsigned _num_maj = 0u;\n\n unsigned _num_xor = 0u;\n\n\n\n /* cover */\n","file_path":"src/classical/xmg/xmg.hpp","rank":99,"score":54.98194654906311}],"string":"[\n {\n \"content\": \"struct store_info<std::vector<aig_node>>\\n\\n{\\n\\n static constexpr const char* key = \\\"gates\\\";\\n\\n static constexpr const char* option = \\\"gate\\\";\\n\\n static constexpr const char* mnemonic = \\\"\\\";\\n\\n static constexpr const char* name = \\\"gate\\\";\\n\\n static constexpr const char* name_plural = \\\"gates\\\";\\n\\n};\\n\\n\\n\\ntemplate<>\\n\\nstd::string store_entry_to_string<std::vector<aig_node>>( const std::vector<aig_node>& g );\\n\\n\\n\\ntemplate<>\\n\\nvoid print_store_entry<std::vector<aig_node>>( std::ostream& os, const std::vector<aig_node>& g );\\n\\n\\n\\n/******************************************************************************\\n\\n * tt *\\n\\n ******************************************************************************/\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"src/cli/stores.hpp\",\n \"rank\": 0,\n \"score\": 209246.71412900373\n },\n {\n \"content\": \"struct value_traits<unsigned>\\n\\n{\\n\\n static const unsigned null_value = 0u;\\n\\n};\\n\\n\\n\\n/******************************************************************************\\n\\n * index_map *\\n\\n ******************************************************************************/\\n\\n\\n\\ntemplate<typename IndexType, typename ValueType>\\n\",\n \"file_path\": \"src/core/utils/index.hpp\",\n \"rank\": 1,\n \"score\": 203014.05879441692\n },\n {\n \"content\": \"struct stg_map_esop_params\\n\\n{\\n\\n bool optimize_postesop = false; /* post-optimize ESOP cover */\\n\\n exorcism_script script = exorcism_script::def_wo4; /* optimize ESOP synthesized circuit */\\n\\n\\n\\n bool progress = false; /* show progress line */\\n\\n\\n\\n bool nocollapse = false; /* DEBUG: do not collapse (useful with dumpfile parameter) */\\n\\n std::string dumpfile; /* DEBUG: dump ESOP and AIG files for each ESOP cover and LUT */\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_esop.hpp\",\n \"rank\": 2,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_luts_stats\\n\\n{\\n\\n stg_map_luts_stats()\\n\\n : own_sub_stats( true ),\\n\\n map_esop_stats( new stg_map_esop_stats() ),\\n\\n map_precomp_stats( new stg_map_precomp_stats() )\\n\\n {\\n\\n }\\n\\n\\n\\n stg_map_luts_stats( stg_map_esop_stats& map_esop_stats,\\n\\n stg_map_precomp_stats& map_precomp_stats )\\n\\n : own_sub_stats( false ),\\n\\n map_esop_stats( &map_esop_stats ),\\n\\n map_precomp_stats( &map_precomp_stats )\\n\\n {\\n\\n }\\n\\n\\n\\n ~stg_map_luts_stats()\\n\\n {\\n\\n if ( own_sub_stats )\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_luts.hpp\",\n \"rank\": 3,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_precomp_params\\n\\n{\\n\\n unsigned class_method = 0u; /* classification method: 0u: spectral, 1u: affine */\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_precomp.hpp\",\n \"rank\": 4,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_precomp_stats\\n\\n{\\n\\n stg_map_precomp_stats()\\n\\n : class_counter( 4u ),\\n\\n class_hash( 4u )\\n\\n {\\n\\n class_counter[0u].resize( 3u );\\n\\n class_counter[1u].resize( 6u );\\n\\n class_counter[2u].resize( 18u );\\n\\n class_counter[3u].resize( 48u );\\n\\n }\\n\\n\\n\\n double class_runtime = 0.0;\\n\\n\\n\\n std::vector<std::vector<unsigned>> class_counter;\\n\\n\\n\\n std::vector<std::unordered_map<uint64_t, uint64_t>> class_hash;\\n\\n};\\n\\n\\n\\nvoid stg_map_precomp( circuit& circ, uint64_t function, unsigned num_vars,\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_precomp.hpp\",\n \"rank\": 5,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_esop_stats\\n\\n{\\n\\n double cover_runtime = 0.0;\\n\\n double exorcism_runtime = 0.0;\\n\\n unsigned dumpfile_counter = 0u;\\n\\n};\\n\\n\\n\\nvoid stg_map_esop( circuit& circ, const xmg_graph& function,\\n\\n const std::vector<unsigned>& line_map,\\n\\n const stg_map_esop_params& params,\\n\\n stg_map_esop_stats& stats );\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\\n\\n\\n// Local Variables:\\n\\n// c-basic-offset: 2\\n\\n// eval: (c-set-offset 'substatement-open 0)\\n\\n// eval: (c-set-offset 'innamespace 0)\\n\\n// End:\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_esop.hpp\",\n \"rank\": 6,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_shannon_stats\\n\\n{\\n\\n stg_map_shannon_stats()\\n\\n : own_sub_stats( true ),\\n\\n map_luts_stats( new stg_map_luts_stats() )\\n\\n {\\n\\n }\\n\\n\\n\\n stg_map_shannon_stats( stg_map_luts_stats& map_luts_stats )\\n\\n : own_sub_stats( false ),\\n\\n map_luts_stats( &map_luts_stats )\\n\\n {\\n\\n }\\n\\n\\n\\n ~stg_map_shannon_stats()\\n\\n {\\n\\n if ( own_sub_stats )\\n\\n {\\n\\n delete map_luts_stats;\\n\\n }\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_shannon.hpp\",\n \"rank\": 7,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_shannon_params\\n\\n{\\n\\n stg_map_shannon_params()\\n\\n : own_sub_params( true ),\\n\\n map_luts_params( new stg_map_luts_params() )\\n\\n {\\n\\n }\\n\\n\\n\\n stg_map_shannon_params( const stg_map_luts_params& map_luts_params )\\n\\n : own_sub_params( false ),\\n\\n map_luts_params( &map_luts_params )\\n\\n {\\n\\n }\\n\\n\\n\\n ~stg_map_shannon_params()\\n\\n {\\n\\n if ( own_sub_params )\\n\\n {\\n\\n delete map_luts_params;\\n\\n }\\n\\n }\\n\\n\\n\\n bool own_sub_params = false;\\n\\n\\n\\n stg_map_luts_params const* map_luts_params = nullptr;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_shannon.hpp\",\n \"rank\": 8,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_luts_params\\n\\n{\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/stg_map_luts.hpp\",\n \"rank\": 9,\n \"score\": 191562.50185482664\n },\n {\n \"content\": \"struct stg_map_shannon_stats\\n\\n{\\n\\n stg_map_shannon_stats()\\n\\n : own_sub_stats( true ),\\n\\n map_luts_stats( new stg_map_luts_stats() )\\n\\n {\\n\\n }\\n\\n\\n\\n stg_map_shannon_stats( stg_map_luts_stats& map_luts_stats )\\n\\n : own_sub_stats( false ),\\n\\n map_luts_stats( &map_luts_stats )\\n\\n {\\n\\n }\\n\\n\\n\\n ~stg_map_shannon_stats()\\n\\n {\\n\\n if ( own_sub_stats )\\n\\n {\\n\\n delete map_luts_stats;\\n\\n }\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_shannon.hpp\",\n \"rank\": 10,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct stg_map_esop_stats\\n\\n{\\n\\n double cover_runtime = 0.0;\\n\\n double exorcism_runtime = 0.0;\\n\\n unsigned dumpfile_counter = 0u;\\n\\n};\\n\\n\\n\\nvoid stg_map_esop( circuit& circ, const gia_graph& function,\\n\\n const std::vector<unsigned>& line_map,\\n\\n const stg_map_esop_params& params,\\n\\n stg_map_esop_stats& stats );\\n\\n\\n\\n}\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\\n\\n\\n// Local Variables:\\n\\n// c-basic-offset: 2\\n\\n// eval: (c-set-offset 'substatement-open 0)\\n\\n// eval: (c-set-offset 'innamespace 0)\\n\\n// End:\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_esop.hpp\",\n \"rank\": 11,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct stg_map_shannon_params\\n\\n{\\n\\n stg_map_shannon_params()\\n\\n : own_sub_params( true ),\\n\\n map_luts_params( new stg_map_luts_params() )\\n\\n {\\n\\n }\\n\\n\\n\\n stg_map_shannon_params( const stg_map_luts_params& map_luts_params )\\n\\n : own_sub_params( false ),\\n\\n map_luts_params( &map_luts_params )\\n\\n {\\n\\n }\\n\\n\\n\\n ~stg_map_shannon_params()\\n\\n {\\n\\n if ( own_sub_params )\\n\\n {\\n\\n delete map_luts_params;\\n\\n }\\n\\n }\\n\\n\\n\\n bool own_sub_params = false;\\n\\n\\n\\n stg_map_luts_params const* map_luts_params = nullptr;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_shannon.hpp\",\n \"rank\": 12,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct stg_map_precomp_params\\n\\n{\\n\\n unsigned class_method = 0u; /* classification method: 0u: spectral, 1u: affine */\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_precomp.hpp\",\n \"rank\": 13,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct stg_map_luts_stats\\n\\n{\\n\\n stg_map_luts_stats()\\n\\n : own_sub_stats( true ),\\n\\n map_esop_stats( new stg_map_esop_stats() ),\\n\\n map_precomp_stats( new stg_map_precomp_stats() )\\n\\n {\\n\\n }\\n\\n\\n\\n stg_map_luts_stats( stg_map_esop_stats& map_esop_stats,\\n\\n stg_map_precomp_stats& map_precomp_stats )\\n\\n : own_sub_stats( false ),\\n\\n map_esop_stats( &map_esop_stats ),\\n\\n map_precomp_stats( &map_precomp_stats )\\n\\n {\\n\\n }\\n\\n\\n\\n ~stg_map_luts_stats()\\n\\n {\\n\\n if ( own_sub_stats )\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_luts.hpp\",\n \"rank\": 14,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct stg_map_luts_params\\n\\n{\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_luts.hpp\",\n \"rank\": 15,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct stg_map_precomp_stats\\n\\n{\\n\\n stg_map_precomp_stats()\\n\\n : class_counter( 4u ),\\n\\n class_hash( 4u )\\n\\n {\\n\\n class_counter[0u].resize( 3u );\\n\\n class_counter[1u].resize( 6u );\\n\\n class_counter[2u].resize( 18u );\\n\\n class_counter[3u].resize( 48u );\\n\\n }\\n\\n\\n\\n double class_runtime = 0.0;\\n\\n\\n\\n std::vector<std::vector<unsigned>> class_counter;\\n\\n\\n\\n std::vector<std::unordered_map<uint64_t, uint64_t>> class_hash;\\n\\n};\\n\\n\\n\\nvoid stg_map_precomp( circuit& circ, uint64_t function, unsigned num_vars,\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_precomp.hpp\",\n \"rank\": 16,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct stg_map_esop_params\\n\\n{\\n\\n gia_graph::esop_cover_method cover_method = gia_graph::esop_cover_method::aig_threshold; /* method to extract initial ESOP cover */\\n\\n bool optimize_postesop = false; /* post-optimize ESOP cover */\\n\\n exorcism_script script = exorcism_script::def_wo4; /* optimize ESOP synthesized circuit */\\n\\n\\n\\n bool progress = false; /* show progress line */\\n\\n\\n\\n bool nocollapse = false; /* DEBUG: do not collapse (useful with dumpfile parameter) */\\n\\n std::string dumpfile; /* DEBUG: dump ESOP and AIG files for each ESOP cover and LUT */\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/lhrs/legacy/stg_map_esop.hpp\",\n \"rank\": 17,\n \"score\": 188747.12247965336\n },\n {\n \"content\": \"struct transform_to_constants\\n\\n{\\n\\n constant operator()( const char& c ) const\\n\\n {\\n\\n switch ( c ) {\\n\\n case '-':\\n\\n return constant();\\n\\n break;\\n\\n\\n\\n case '0':\\n\\n case '1':\\n\\n return constant( c == '1' );\\n\\n break;\\n\\n\\n\\n default:\\n\\n assert( false );\\n\\n return constant();\\n\\n break;\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\n// CODE move to utils\\n\\ntemplate<typename Map>\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/io/revlib_parser.cpp\",\n \"rank\": 18,\n \"score\": 188240.41343450002\n },\n {\n \"content\": \"struct map_access_functor\\n\\n{\\n\\n explicit map_access_functor( Map& map )\\n\\n : _map( map )\\n\\n {\\n\\n }\\n\\n\\n\\n const typename Map::mapped_type& operator()( const typename Map::key_type& key ) const\\n\\n {\\n\\n return _map.find( key )->second;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n Map& _map;\\n\\n};\\n\\n\\n\\ntemplate<typename Map>\\n\\nmap_access_functor<Map> make_map_access_functor( Map& map )\\n\\n{\\n\\n return map_access_functor<Map>( map );\\n\\n}\\n\\n\\n\\nbool parse_string_list( const std::string& line, std::vector<std::string>& params )\\n\\n{\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/io/revlib_parser.cpp\",\n \"rank\": 19,\n \"score\": 184722.17307116368\n },\n {\n \"content\": \"struct symmetric_variables_visitor : public boost::static_visitor<std::vector<std::pair<unsigned, unsigned>>>\\n\\n{\\n\\n std::vector<std::pair<unsigned, unsigned>> operator()( const tt& spec ) const\\n\\n {\\n\\n std::vector<std::pair<unsigned, unsigned>> pairs;\\n\\n\\n\\n const auto n = tt_num_vars( spec );\\n\\n\\n\\n for ( auto j = 1u; j < n; ++j )\\n\\n {\\n\\n for ( auto i = 0u; i < j; ++i )\\n\\n {\\n\\n if ( tt_permute( spec, i, j ) == spec )\\n\\n {\\n\\n pairs.push_back( {i, j} );\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n return pairs;\\n\\n }\\n\\n\\n\\n std::vector<std::pair<unsigned, unsigned>> operator()( const mig_graph& spec ) const\\n\\n {\\n\\n return {};\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/classical/utils/spec_representation.cpp\",\n \"rank\": 20,\n \"score\": 176340.65777762025\n },\n {\n \"content\": \"struct make_one_setting<const char*>\\n\\n{\\n\\n static void impl( const properties::ptr& settings, const char* s )\\n\\n {\\n\\n settings->set( s, true );\\n\\n }\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\nvoid make_settings_rec( const properties::ptr& settings );\\n\\n\\n\\ntemplate<class T, class... Ts>\\n\\nvoid make_settings_rec( const properties::ptr& settings, T value, Ts... rest )\\n\\n{\\n\\n detail::make_one_setting<T>::impl( settings, value );\\n\\n make_settings_rec( settings, rest... );\\n\\n}\\n\\n\\n\\ntemplate<class... Ts>\\n\",\n \"file_path\": \"src/core/properties.hpp\",\n \"rank\": 21,\n \"score\": 164037.57979882613\n },\n {\n \"content\": \"struct is_trivial_visitor : public boost::static_visitor<boost::optional<std::pair<unsigned, bool>>>\\n\\n{\\n\\n boost::optional<std::pair<unsigned, bool>> operator()( const tt& spec ) const\\n\\n {\\n\\n /* terminal cases */\\n\\n if ( ( ~spec ).none() || spec.none() )\\n\\n {\\n\\n return std::make_pair( 0u, spec.test( 0u ) );\\n\\n }\\n\\n\\n\\n /* single variable */\\n\\n tt spec_copy = spec;\\n\\n tt_extend( spec_copy, 6u );\\n\\n\\n\\n const auto nvars = tt_num_vars( spec_copy );\\n\\n\\n\\n if ( nvars == 6u )\\n\\n {\\n\\n for ( auto i = 0u; i < 6u; ++i )\\n\\n {\\n\",\n \"file_path\": \"src/classical/utils/spec_representation.cpp\",\n \"rank\": 22,\n \"score\": 162493.1282355422\n },\n {\n \"content\": \"struct hash<cirkit::cube2>\\n\\n{\\n\\n std::size_t operator()( cirkit::cube2 const& c ) const\\n\\n {\\n\\n return c.value;\\n\\n }\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\\n\\n\\n// Local Variables:\\n\\n// c-basic-offset: 2\\n\\n// eval: (c-set-offset 'substatement-open 0)\\n\\n// eval: (c-set-offset 'innamespace 0)\\n\\n// End:\\n\",\n \"file_path\": \"src/classical/utils/cube2.hpp\",\n \"rank\": 23,\n \"score\": 161416.54556464902\n },\n {\n \"content\": \"struct iterator_extractor<T const>\\n\\n{\\n\\n using type = typename T::const_iterator;\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\",\n \"file_path\": \"src/core/utils/range_utils.hpp\",\n \"rank\": 24,\n \"score\": 161275.38696004282\n },\n {\n \"content\": \" class BA = std::allocator<bool>,\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xtensor_forward.hpp\",\n \"rank\": 25,\n \"score\": 161059.64024199478\n },\n {\n \"content\": \" class xiterator : detail::shape_storage<S>\\n\\n {\\n\\n public:\\n\\n\\n\\n using self_type = xiterator<It, S, L>;\\n\\n\\n\\n using subiterator_type = It;\\n\\n using value_type = typename subiterator_type::value_type;\\n\\n using reference = typename subiterator_type::reference;\\n\\n using pointer = typename subiterator_type::pointer;\\n\\n using difference_type = typename subiterator_type::difference_type;\\n\\n using size_type = typename subiterator_type::size_type;\\n\\n using iterator_category = std::bidirectional_iterator_tag;\\n\\n\\n\\n using private_base = detail::shape_storage<S>;\\n\\n using shape_type = typename private_base::shape_type;\\n\\n using shape_param_type = typename private_base::param_type;\\n\\n using index_type = xindex_type_t<shape_type>;\\n\\n\\n\\n xiterator() = default;\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xiterator.hpp\",\n \"rank\": 26,\n \"score\": 161057.10066448618\n },\n {\n \"content\": \"struct hash<cirkit::xmg_function>\\n\\n{\\n\\n inline std::size_t operator()( const cirkit::xmg_function& f ) const\\n\\n {\\n\\n return ( f.node << 1u ) + static_cast<int>( f.complemented );\\n\\n }\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\nnamespace cirkit\\n\\n{\\n\\n\\n\",\n \"file_path\": \"src/classical/xmg/xmg.hpp\",\n \"rank\": 27,\n \"score\": 158650.47298331925\n },\n {\n \"content\": \" class slice_vector : private std::vector<std::array<long int, 3>>\\n\\n {\\n\\n\\n\\n public:\\n\\n using index_type = long int;\\n\\n using base_type = std::vector<std::array<index_type, 3>>;\\n\\n\\n\\n // propagating interface\\n\\n using base_type::begin;\\n\\n using base_type::cbegin;\\n\\n using base_type::end;\\n\\n using base_type::cend;\\n\\n using base_type::size;\\n\\n using base_type::operator[];\\n\\n using base_type::push_back;\\n\\n\\n\\n inline slice_vector() = default;\\n\\n\\n\\n template <class E, class... Args>\\n\\n inline slice_vector(const xexpression<E>& e, Args... args)\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xstridedview.hpp\",\n \"rank\": 28,\n \"score\": 157603.67981844526\n },\n {\n \"content\": \"struct mig_functional_hashing_constants\\n\\n{\\n\\n static const std::unordered_map<unsigned, std::tuple<unsigned, unsigned, std::map<char, unsigned>, std::string>> min_mig_sizes;\\n\\n static const std::unordered_map<unsigned, std::tuple<unsigned, unsigned, std::map<char, unsigned>, std::string>> min_depth_mig_sizes;\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\\n\\n\\n// Local Variables:\\n\\n// c-basic-offset: 2\\n\\n// eval: (c-set-offset 'substatement-open 0)\\n\\n// eval: (c-set-offset 'innamespace 0)\\n\\n// End:\\n\",\n \"file_path\": \"src/classical/mig/mig_functional_hashing_constants.hpp\",\n \"rank\": 29,\n \"score\": 156904.2178180312\n },\n {\n \"content\": \"struct hash<cirkit::mig_function>\\n\\n{\\n\\n std::size_t operator()( const cirkit::mig_function& f ) const\\n\\n {\\n\\n return std::hash<unsigned>()( ( f.node << 1u ) | f.complemented );\\n\\n }\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\nnamespace cirkit\\n\\n{\\n\\n\\n\\n/******************************************************************************\\n\\n * Public functions *\\n\\n ******************************************************************************/\\n\\n\\n\\nplim_program\\n\\ncompile_for_plim( const mig_graph& mig,\\n\\n const properties::ptr& settings,\\n\",\n \"file_path\": \"src/classical/plim/plim_compiler.cpp\",\n \"rank\": 30,\n \"score\": 156020.6613811803\n },\n {\n \"content\": \"DdNode * Extra_VectorSupport( DdManager * dd, DdNode * pbFuncs[], int nFuncs )\\n\\n{\\n\\n DdNode ** pbFuncsNew;\\n\\n DdNode * bVars;\\n\\n int i, Counter;\\n\\n\\n\\n Counter = 0;\\n\\n pbFuncsNew = ALLOC( DdNode *, nFuncs );\\n\\n // collect the non-zero functions into an array\\n\\n for ( i = 0; i < nFuncs; i++ )\\n\\n if ( pbFuncs[i] )\\n\\n pbFuncsNew[ Counter++ ] = pbFuncs[i];\\n\\n bVars = Cudd_VectorSupport( dd, pbFuncsNew, Counter ); \\n\\n\\n\\n free( pbFuncsNew );\\n\\n return bVars; \\n\",\n \"file_path\": \"lib/extra/extraBddUnate.c\",\n \"rank\": 31,\n \"score\": 155080.45774310204\n },\n {\n \"content\": \"struct value_traits\\n\\n{\\n\\n static const T null_value;\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\\nconst T value_traits<T>::null_value = T();\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"src/core/utils/index.hpp\",\n \"rank\": 32,\n \"score\": 154961.79840943636\n },\n {\n \"content\": \"struct remove_constant_if_unused\\n\\n{\\n\\n remove_constant_if_unused() {}\\n\\n remove_constant_if_unused( const aig_graph& aig ) : aig( &aig ) {}\\n\\n\\n\\n template <typename Vertex>\\n\\n bool operator()( const Vertex& v ) const\\n\\n {\\n\\n const auto& graph_info = boost::get_property( *aig, boost::graph_name );\\n\\n\\n\\n return ( v != graph_info.constant ) || graph_info.constant_used;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n aig_graph const* aig = nullptr;\\n\\n};\\n\\n\\n\\n/******************************************************************************\\n\\n * Public functions *\\n\\n ******************************************************************************/\\n\",\n \"file_path\": \"src/classical/aig.cpp\",\n \"rank\": 33,\n \"score\": 154947.7583652048\n },\n {\n \"content\": \"struct names_map\\n\\n{\\n\\n std::string operator()( const unsigned id )\\n\\n {\\n\\n const std::string name = (boost::format(\\\"var_%d\\\") % id).str();\\n\\n auto it = name_map.find( id );\\n\\n if ( it == name_map.end() )\\n\\n {\\n\\n return name;\\n\\n }\\n\\n return it->second;\\n\\n }\\n\\n\\n\\n void insert( const unsigned id, const std::string& s )\\n\\n {\\n\\n std::string na;\\n\\n unsigned idx;\\n\\n if ( split_name( na, idx, s ) )\\n\\n {\\n\\n const std::string&& format_string = (boost::format(\\\"%s_%s\\\") % na % idx).str();\\n\",\n \"file_path\": \"programs/classical/aig_to_smt2.cpp\",\n \"rank\": 34,\n \"score\": 154894.50445100773\n },\n {\n \"content\": \"struct hash<std::vector<T>>\\n\\n{\\n\\n std::size_t operator()( std::vector<T> const& c ) const\\n\\n {\\n\\n std::size_t seed = 0;\\n\\n for ( const auto& v : c )\\n\\n {\\n\\n hash_combine( seed, v );\\n\\n }\\n\\n return seed;\\n\\n }\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\\n\\n\\n// Local Variables:\\n\\n// c-basic-offset: 2\\n\\n// eval: (c-set-offset 'substatement-open 0)\\n\\n// eval: (c-set-offset 'innamespace 0)\\n\\n// End:\\n\",\n \"file_path\": \"src/core/utils/hash_utils.hpp\",\n \"rank\": 35,\n \"score\": 154543.67982999008\n },\n {\n \"content\": \"struct mighty_operation_t\\n\\n{\\n\",\n \"file_path\": \"src/classical/mig/mig_verilog.cpp\",\n \"rank\": 36,\n \"score\": 151889.53776433688\n },\n {\n \"content\": \"struct dd_node\\n\\n{\\n\\n unsigned var;\\n\\n unsigned high;\\n\\n unsigned low;\\n\\n\\n\\n bool operator==( const dd_node& other ) const\\n\\n {\\n\\n return var == other.var && high == other.high && low == other.low;\\n\\n }\\n\\n};\\n\\n\\n\\nstd::ostream& operator<<( std::ostream& os, const dd_node& z );\\n\\n\\n\",\n \"file_path\": \"src/classical/dd/dd_manager.hpp\",\n \"rank\": 37,\n \"score\": 151880.98191305745\n },\n {\n \"content\": \" class vector;\\n\\nRANGES_END_NAMESPACE_STD\\n\\n#else\\n\\n#include <vector>\\n\\n#endif\\n\\n\\n\\nnamespace ranges\\n\\n{\\n\\n inline namespace v3\\n\\n {\\n\\n /// \\\\cond\\n\\n namespace detail\\n\\n {\\n\\n template<typename Rng, typename Cont, typename I = range_common_iterator_t<Rng>>\\n\\n using ConvertibleToContainer = meta::strict_and<\\n\\n Range<Cont>,\\n\\n meta::not_<View<Cont>>,\\n\\n Movable<Cont>,\\n\\n ConvertibleTo<range_value_t<Rng>, range_value_t<Cont>>,\\n\\n Constructible<Cont, I, I>>;\\n\",\n \"file_path\": \"ext/include/range/v3/to_container.hpp\",\n \"rank\": 38,\n \"score\": 151495.1185621253\n },\n {\n \"content\": \"extern void Extra_WriteBlifNodeUsingGates( FILE * pFile, DdManager * dd, DdNode * Func, char * pInputNames[], char * pOutputName, int fCascade );\\n\",\n \"file_path\": \"lib/extra/extra.h\",\n \"rank\": 39,\n \"score\": 151443.58561126588\n },\n {\n \"content\": \"DdNode *\\n\\nExtra_ConstCofVars(\\n\\n DdManager * dd, /* the manager */\\n\\n DdNode * Func, /* the function whose constant cofactor variables are computed */\\n\\n int fCofValue ) /* the flag which shows which constant we are interested in */\\n\\n{\\n\\n DdNode * zRes;\\n\\n DdNode * bSupp;\\n\\n bSupp = Cudd_Support( dd, Func ); Cudd_Ref( bSupp );\\n\\n zRes = Extra_ConstCofVarsSupport( dd, Func, bSupp, fCofValue ); Cudd_Ref( zRes );\\n\\n Cudd_RecursiveDeref( dd, bSupp );\\n\\n Cudd_Deref( zRes );\\n\\n return zRes;\\n\",\n \"file_path\": \"lib/extra/extraBddUnate.c\",\n \"rank\": 40,\n \"score\": 151436.20201134076\n },\n {\n \"content\": \"struct hash_value_impl\\n\\n{\\n\\n static void apply( std::size_t& seed, const Tuple& tuple )\\n\\n {\\n\\n hash_value_impl<Tuple, Index - 1>::apply( seed, tuple );\\n\\n hash_combine( seed, std::get<Index>( tuple ) );\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<class Tuple>\\n\",\n \"file_path\": \"src/core/utils/hash_utils.hpp\",\n \"rank\": 41,\n \"score\": 148996.43787576997\n },\n {\n \"content\": \"struct mig_remove_constant_if_unused\\n\\n{\\n\\n mig_remove_constant_if_unused() {}\\n\\n mig_remove_constant_if_unused( const mig_graph& mig ) : mig( &mig ) {}\\n\\n\\n\\n template <typename Vertex>\\n\\n bool operator()( const Vertex& v ) const\\n\\n {\\n\\n const auto& graph_info = boost::get_property( *mig, boost::graph_name );\\n\\n\\n\\n return ( v != graph_info.constant ) || graph_info.constant_used;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n mig_graph const* mig = nullptr;\\n\\n};\\n\\n\\n\\n/******************************************************************************\\n\\n * Public functions *\\n\\n ******************************************************************************/\\n\",\n \"file_path\": \"src/classical/mig/mig.cpp\",\n \"rank\": 42,\n \"score\": 148983.10693132997\n },\n {\n \"content\": \" class xoptional_vector;\\n\\n\\n\\n template <class T, class A, class BA>\\n\\n struct xoptional_sequence_inner_types<xoptional_vector<T, A, BA>>\\n\\n {\\n\\n using base_container_type = std::vector<T, A>;\\n\\n using flag_container_type = std::vector<bool, BA>;\\n\\n };\\n\\n\\n\\n /*****************************************************\\n\\n * xoptional_vector and xoptional_array declarations *\\n\\n *****************************************************/\\n\\n\\n\\n template <class T, std::size_t I>\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xmissing.hpp\",\n \"rank\": 43,\n \"score\": 148170.60298256885\n },\n {\n \"content\": \"int\\n\\nextraConstCofVarsVerify( \\n\\n DdManager * dd, /* the manager */\\n\\n DdNode * bFunc, /* the function whose symmetries are computed */\\n\\n int fCofValue, /* const cof value */\\n\\n DdNode * zConstCofVar ) /* the set of unate variables */\\n\\n{\\n\\n DdNode * bSupp;\\n\\n DdNode * zTemp;\\n\\n DdNode * bF0, * bF1;\\n\\n int flag;\\n\\n\\n\\n flag = 1;\\n\\n bSupp = Cudd_Support( dd, bFunc ); Cudd_Ref( bSupp );\\n\\n for ( zTemp = zConstCofVar; zTemp != z0; zTemp = cuddE(zTemp) )\\n\\n {\\n\\n// if ( !Cudd_bddLeq( dd, bSupp, dd->vars[zTemp->index/2] ) )\\n\\n// flag = 0;\\n\\n\\n\\n bF0 = Cudd_Cofactor( dd, bFunc, Cudd_Not(dd->vars[zTemp->index/2]) ); Cudd_Ref( bF0 );\\n\\n bF1 = Cudd_Cofactor( dd, bFunc, dd->vars[zTemp->index/2] ); Cudd_Ref( bF1 );\\n\\n\\n\\n if ( zTemp->index%2 == 0 )\\n\\n {\\n\\n if ( fCofValue == 0 )\\n\\n {\\n\\n if ( bF1 != b0 )\\n\\n flag = 0;\\n\\n } \\n\\n else // if ( fCofValue == 1 )\\n\\n {\\n\\n if ( bF1 != b1 )\\n\\n flag = 0;\\n\\n }\\n\\n }\\n\\n if ( zTemp->index%2 == 1 )\\n\\n {\\n\\n if ( fCofValue == 0 )\\n\\n {\\n\\n if ( bF0 != b0 )\\n\\n flag = 0;\\n\\n } \\n\\n else // if ( fCofValue == 1 )\\n\\n {\\n\\n if ( bF0 != b1 )\\n\\n flag = 0;\\n\\n }\\n\\n }\\n\\n\\n\\n Cudd_RecursiveDeref( dd, bF0 );\\n\\n Cudd_RecursiveDeref( dd, bF1 );\\n\\n\\n\\n if ( flag == 0 )\\n\\n break;\\n\\n\\n\\n }\\n\\n Cudd_RecursiveDeref( dd, bSupp );\\n\\n return flag;\\n\",\n \"file_path\": \"lib/extra/extraBddUnate.c\",\n \"rank\": 44,\n \"score\": 147969.15629563318\n },\n {\n \"content\": \"DdNode * Extra_ConstCofVarsSharing( \\n\\n DdManager * dd, /* the manager */\\n\\n DdNode * pbFuncs[], /* the functions whose constant cofactor variables are computed */\\n\\n int nFuncs, /* the number of functions */\\n\\n int fCofValue ) /* the flag which shows which constant we are interested in */\\n\\n{\\n\\n DdNode * zRes, * zTemp, * zConstCofVars;\\n\\n DdNode * bVars;\\n\\n int i;\\n\\n\\n\\n assert( nFuncs > 0 );\\n\\n\\n\\n// bVars = Cudd_VectorSupport( dd, pbFuncs, nFuncs ); Cudd_Ref( bVars );\\n\\n bVars = Extra_VectorSupport( dd, pbFuncs, nFuncs ); Cudd_Ref( bVars );\\n\\n\\n\\n zRes = NULL;\\n\\n for ( i = 0; i < nFuncs; i++ )\\n\\n if ( pbFuncs[i] )\\n\\n {\\n\\n zConstCofVars = Extra_ConstCofVarsSupport( dd, pbFuncs[i], bVars, fCofValue ); Cudd_Ref( zConstCofVars );\\n\\n if ( zRes == NULL )\\n\\n zRes = zConstCofVars; // takes ref\\n\\n else\\n\\n {\\n\\n zRes = Cudd_zddIntersect( dd, zTemp = zRes, zConstCofVars ); Cudd_Ref( zRes );\\n\\n Cudd_RecursiveDerefZdd( dd, zTemp );\\n\\n Cudd_RecursiveDerefZdd( dd, zConstCofVars );\\n\\n }\\n\\n if ( zRes == z0 )\\n\\n break;\\n\\n }\\n\\n Cudd_RecursiveDeref( dd, bVars );\\n\\n Cudd_Deref(zRes);\\n\\n return zRes;\\n\",\n \"file_path\": \"lib/extra/extraBddUnate.c\",\n \"rank\": 45,\n \"score\": 147963.00895696066\n },\n {\n \"content\": \"DdNode *\\n\\nExtra_ConstCofVarsSupport(\\n\\n DdManager * dd, /* the manager */\\n\\n DdNode * Func, /* the function whose constant cofactor variables are computed */\\n\\n DdNode * bSupp, /* the given support */\\n\\n int fCofValue ) /* the flag which shows which constant we are interested in */\\n\\n{\\n\\n DdNode * zRes;\\n\\n do {\\n\\n dd->reordered = 0;\\n\\n if ( fCofValue == 0 )\\n\\n zRes = extraConst0CofVars( dd, Func, bSupp );\\n\\n else\\n\\n zRes = extraConst1CofVars( dd, Func, bSupp );\\n\\n } while (dd->reordered == 1);\\n\\n Cudd_Ref( zRes );\\n\\n assert( extraConstCofVarsVerify(dd, Func, fCofValue, zRes) );\\n\\n Cudd_Deref( zRes );\\n\\n return zRes;\\n\",\n \"file_path\": \"lib/extra/extraBddUnate.c\",\n \"rank\": 46,\n \"score\": 147956.73455090827\n },\n {\n \"content\": \"struct less<std::vector<boost::tribool>>\\n\\n{\\n\\n bool operator()( const std::vector<boost::tribool>& v1, const std::vector<boost::tribool>& v2 ) const\\n\\n {\\n\\n assert( v1.size() == v2.size() );\\n\\n\\n\\n auto i = 0u;\\n\\n while ( i < v1.size() )\\n\\n {\\n\\n const auto& t1 = v1[i];\\n\\n const auto& t2 = v2[i];\\n\\n\\n\\n if ( t1 != t2 )\\n\\n {\\n\\n if ( boost::indeterminate( t1 ) ) { return true; }\\n\\n if ( boost::indeterminate( t2 ) ) { return false; }\\n\\n return !t1 && t2;\\n\\n }\\n\\n\\n\\n ++i;\\n\",\n \"file_path\": \"src/classical/dd/visit_solutions.cpp\",\n \"rank\": 47,\n \"score\": 146732.56820602648\n },\n {\n \"content\": \" class xoptional_vector;\\n\\n\\n\\n /**\\n\\n * @typedef xarray_optional\\n\\n * Alias template on xarray_container for handling missing values\\n\\n *\\n\\n * @tparam T The value type of the elements.\\n\\n * @tparam L The layout_type of the container (default: row_major).\\n\\n * @tparam A The allocator of the container holding the elements.\\n\\n * @tparam BA The allocator of the container holding the missing flags.\\n\\n * @tparam SA The allocator of the containers holding the shape and the strides.\\n\\n */\\n\\n template <class T, layout_type L = DEFAULT_LAYOUT,\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xtensor_forward.hpp\",\n \"rank\": 48,\n \"score\": 144772.16571669516\n },\n {\n \"content\": \"void Extra_WriteBlifNodeUsingGates( FILE * pFile, DdManager * dd, DdNode * Func, char * pInputNames[], char * pOutputName, int fCascade )\\n\\n{\\n\\n DdNode * zCover;\\n\\n // create the ZDD cover\\n\\n if ( Extra_WithComplementedEdges(Func) )\\n\\n {\\n\\n zCover = Extra_zddIsopCover( dd, Func, Func ); Cudd_Ref( zCover );\\n\\n extraWriteBlifNodeUsingGates( pFile, dd, zCover, pInputNames, pOutputName, fCascade );\\n\\n Cudd_RecursiveDerefZdd( dd, zCover );\\n\\n }\\n\\n else\\n\\n extraWriteBlifNodeUsingGates( pFile, dd, Func, pInputNames, pOutputName, fCascade );\\n\",\n \"file_path\": \"lib/extra/extraDdPrint.c\",\n \"rank\": 49,\n \"score\": 144670.74032101617\n },\n {\n \"content\": \"static void extraWriteBlifNodeUsingGates( FILE * pFile, DdManager * dd, DdNode * zCover, char * pInputNames[], char * pOutputName, int fCascade );\\n\",\n \"file_path\": \"lib/extra/extraDdPrint.c\",\n \"rank\": 50,\n \"score\": 144652.3368948362\n },\n {\n \"content\": \" class xoptional_vector : public xoptional_sequence<xoptional_vector<T, A, BA>>\\n\\n {\\n\\n public:\\n\\n\\n\\n using self_type = xoptional_vector;\\n\\n using base_type = xoptional_sequence<self_type>;\\n\\n using base_value_type = typename base_type::base_value_type;\\n\\n\\n\\n using value_type = typename base_type::value_type;\\n\\n using size_type = typename base_type::size_type;\\n\\n using difference_type = typename base_type::difference_type;\\n\\n using reference = typename base_type::reference;\\n\\n using const_reference = typename base_type::const_reference;\\n\\n using pointer = typename base_type::pointer;\\n\\n using const_pointer = typename base_type::const_pointer;\\n\\n\\n\\n using iterator = typename base_type::iterator;\\n\\n using const_iterator = typename base_type::const_iterator;\\n\\n using reverse_iterator = typename base_type::reverse_iterator;\\n\\n using const_reverse_iterator = typename base_type::const_reverse_iterator;\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xmissing.hpp\",\n \"rank\": 51,\n \"score\": 143864.81056976088\n },\n {\n \"content\": \" class xbuffer_adaptor : private detail::buffer_storage_t<T, A, O>\\n\\n {\\n\\n public:\\n\\n\\n\\n using base_type = detail::buffer_storage_t<T, A, O>;\\n\\n using allocator_type = typename base_type::allocator_type;\\n\\n using value_type = typename base_type::value_type;\\n\\n using reference = typename base_type::reference;\\n\\n using const_reference = typename base_type::const_reference;\\n\\n using pointer = typename base_type::pointer;\\n\\n using const_pointer = typename base_type::const_pointer;\\n\\n\\n\\n using size_type = typename base_type::size_type;\\n\\n using difference_type = typename base_type::difference_type;\\n\\n\\n\\n using iterator = pointer;\\n\\n using const_iterator = const_pointer;\\n\\n using reverse_iterator = std::reverse_iterator<iterator>;\\n\\n using const_reverse_iterator = std::reverse_iterator<const_iterator>;\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xbuffer_adaptor.hpp\",\n \"rank\": 52,\n \"score\": 143555.0726091149\n },\n {\n \"content\": \"struct is_explicit_visitor : public boost::static_visitor<bool>\\n\\n{\\n\\n bool operator()( const tt& spec ) const\\n\\n {\\n\\n return true;\\n\\n }\\n\\n\\n\\n bool operator()( const mig_graph& spec ) const\\n\\n {\\n\\n return false;\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/classical/utils/spec_representation.cpp\",\n \"rank\": 53,\n \"score\": 141830.90009251123\n },\n {\n \"content\": \"struct is_normal_visitor : public boost::static_visitor<bool>\\n\\n{\\n\\n bool operator()( const tt& spec ) const\\n\\n {\\n\\n return !spec[0];\\n\\n }\\n\\n\\n\\n bool operator()( const mig_graph& spec ) const\\n\\n {\\n\\n mig_simple_assignment_simulator::mig_name_value_map m;\\n\\n const auto r = simulate_mig( spec, mig_simple_assignment_simulator( m ) );\\n\\n\\n\\n return !r.at( mig_info( spec ).outputs[0u].first );\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/classical/utils/spec_representation.cpp\",\n \"rank\": 54,\n \"score\": 141830.90009251123\n },\n {\n \"content\": \"struct t_costs {\\n\\n cost_t operator()(const gate& g, unsigned lines) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief H cost from Barenco:1995 based on the Clifford+T Library\\n\\n *\\n\\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\\n\\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\\n\\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\\n\\n * Elementary gates for quantum computation\\n\\n * Physical Review A, 1995\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 55,\n \"score\": 140988.33030453918\n },\n {\n \"content\": \"struct h_costs {\\n\\n cost_t operator()(const gate& g, unsigned lines) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Calculates the costs of a circuit by a given cost function\\n\\n *\\n\\n * With this function the costs for a circuit can be calculated.\\n\\n * Thereby this functions is generic and calls a cost_function for determine the costs.\\n\\n * The costs function can either be derived from costs_by_circuit, whereby\\n\\n * the costs are calculated on base by the whole circuit or it can be\\n\\n * derived from costs_by_gate, whereby the costs are of each gate are calculated\\n\\n * and the sum is returned.\\n\\n *\\n\\n * @param circ Circuit\\n\\n * @param f Cost function\\n\\n *\\n\\n * @return The costs for the circuit in respect to the given cost function\\n\\n *\\n\\n * @sa \\\\ref sub_cost_functions\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 56,\n \"score\": 140988.33030453918\n },\n {\n \"content\": \"class _LIBCPP_TYPE_VIS_ONLY vector;\\n\\ntemplate <class, class>\\n\",\n \"file_path\": \"ext/include/meta/meta.hpp\",\n \"rank\": 57,\n \"score\": 139233.60898120014\n },\n {\n \"content\": \"class _LIBCPP_TYPE_VIS_ONLY map;\\n\\ntemplate <class, class, class, class>\\n\",\n \"file_path\": \"ext/include/meta/meta.hpp\",\n \"rank\": 58,\n \"score\": 139182.1058852118\n },\n {\n \"content\": \"struct _LIBCPP_TYPE_VIS_ONLY equal_to;\\n\\ntemplate <class>\\n\",\n \"file_path\": \"ext/include/meta/meta.hpp\",\n \"rank\": 59,\n \"score\": 139014.74574546036\n },\n {\n \"content\": \"struct _LIBCPP_TYPE_VIS_ONLY pair;\\n\\ntemplate <class>\\n\",\n \"file_path\": \"ext/include/meta/meta.hpp\",\n \"rank\": 60,\n \"score\": 139014.74574546036\n },\n {\n \"content\": \"struct _LIBCPP_TYPE_VIS_ONLY hash;\\n\\ntemplate <class>\\n\",\n \"file_path\": \"ext/include/meta/meta.hpp\",\n \"rank\": 61,\n \"score\": 139014.74574546036\n },\n {\n \"content\": \"struct _LIBCPP_TYPE_VIS_ONLY less;\\n\\ntemplate <class>\\n\",\n \"file_path\": \"ext/include/meta/meta.hpp\",\n \"rank\": 62,\n \"score\": 139014.74574546036\n },\n {\n \"content\": \"struct line_costs\\n\\n{\\n\\n /**\\n\\n * @brief Returns the number of lines\\n\\n *\\n\\n * @param circ Circuit\\n\\n *\\n\\n * @return Number of lines\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\\n cost_t operator()( const circuit& circ ) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Calculates the transistor costs\\n\\n *\\n\\n * This class calculates the so called transistor\\n\\n * costs for a gate. They are the number of\\n\\n * control lines multiplied by 8.\\n\\n *\\n\\n * @sa \\\\ref sub_cost_functions\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 63,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct stg_tag\\n\\n{\\n\\n stg_tag() {}\\n\\n stg_tag( const boost::dynamic_bitset<>& function ) : function( function ) {}\\n\\n\\n\\n boost::dynamic_bitset<> function;\\n\\n boost::dynamic_bitset<> affine_class;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Compares type of a boost::any variable\\n\\n *\\n\\n * This method is called by is_\\\\em gate functions\\n\\n * like is_toffoli().\\n\\n *\\n\\n * @param operand A variable of type boost::any\\n\\n * @return true, if \\\\p operand is of type \\\\p T.\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp\",\n \"rank\": 64,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct depth_costs\\n\\n{\\n\\n cost_t operator()( const circuit& circ ) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Quantum costs from SK:2013\\n\\n *\\n\\n * Reference: Marek Szyprowski and Pawel Kerntopf, Low quantum\\n\\n * cost realization of generalized peres and toffoli gates with\\n\\n * multiple-control signals, IEEE Nano 2013, 802--807.\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 65,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct pauli_tag\\n\\n{\\n\\n pauli_tag() {}\\n\\n\\n\\n pauli_tag( pauli_axis axis, unsigned root = 1u, bool adjoint = false )\\n\\n : axis( axis ),\\n\\n root( root ),\\n\\n adjoint( adjoint )\\n\\n {\\n\\n }\\n\\n\\n\\n /**\\n\\n * @brief Axis of Pauli gate\\n\\n */\\n\\n pauli_axis axis = pauli_axis::X;\\n\\n\\n\\n /**\\n\\n * @brief root, i.e., U^{1/root}\\n\\n */\\n\\n unsigned root = 1u;\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/pauli_tags.hpp\",\n \"rank\": 66,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct fredkin_tag {};\\n\\n\\n\\n/**\\n\\n * @brief Target Tag for Peres gates.\\n\\n *\\n\\n * @sa \\\\ref sub_target_tags\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp\",\n \"rank\": 67,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct peres_tag {};\\n\\n\\n\\n/**\\n\\n * @brief Target Tag for Modules\\n\\n *\\n\\n * @sa \\\\ref sub_target_tags\\n\\n *\\n\\n * @since 1.1\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp\",\n \"rank\": 68,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct hadamard_tag {};\\n\\n\\n\\nbool is_hadamard( const gate& g );\\n\\n\\n\\ngate& append_hadamard( circuit& circ, unsigned target );\\n\\ngate& prepend_hadamard( circuit& circ, unsigned target );\\n\\ngate& insert_hadamard( circuit& circ, unsigned n, unsigned target );\\n\\n\\n\\n}\\n\\n\\n\\n#endif\\n\\n\\n\\n// Local Variables:\\n\\n// c-basic-offset: 2\\n\\n// eval: (c-set-offset 'substatement-open 0)\\n\\n// eval: (c-set-offset 'innamespace 0)\\n\\n// End:\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/pauli_tags.hpp\",\n \"rank\": 69,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct t_depth_costs {\\n\\n cost_t operator()(const gate& g, unsigned lines) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief T cost from Barenco:1995 based on the Clifford+T Library\\n\\n *\\n\\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\\n\\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\\n\\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\\n\\n * Elementary gates for quantum computation\\n\\n * Physical Review A, 1995\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 70,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct module_tag\\n\\n{\\n\\n /**\\n\\n * @brief Name of the module\\n\\n *\\n\\n * @since 1.1\\n\\n */\\n\\n std::string name;\\n\\n\\n\\n /**\\n\\n * @brief Reference to the circuit\\n\\n *\\n\\n * Usually the circuit is inside of the\\n\\n * circuit modules list.\\n\\n *\\n\\n * @since 1.1\\n\\n */\\n\\n std::shared_ptr<circuit> reference;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Single target tag\\n\\n *\\n\\n * @sa \\\\ref sub_target_tags\\n\\n *\\n\\n * @since 2.3\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp\",\n \"rank\": 71,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct toffoli_tag {};\\n\\n\\n\\n/**\\n\\n * @brief Target Tag for Fredkin gates.\\n\\n *\\n\\n * @sa \\\\ref sub_target_tags\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/target_tags.hpp\",\n \"rank\": 72,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct transistor_costs\\n\\n{\\n\\n /**\\n\\n * @brief Returns the transistor costs for gate \\\\p g\\n\\n *\\n\\n * @param g Gate\\n\\n * @param lines Number of lines in the circuit\\n\\n *\\n\\n * @return Transistor Costs for gate \\\\p g\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\\n cost_t operator()( const gate& g, unsigned lines ) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Returns the depth of the rev. circuit\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 73,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \"struct gate_costs\\n\\n{\\n\\n /**\\n\\n * @brief Returns the number of gates\\n\\n *\\n\\n * @param circ Circuit\\n\\n *\\n\\n * @return Number of gates\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\\n cost_t operator()( const circuit& circ ) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Calculates the line costs\\n\\n *\\n\\n * This costs class is basically a wrapper around lines()\\n\\n * and is given for convenience use with other cost\\n\\n * functions.\\n\\n *\\n\\n * @sa \\\\ref sub_cost_functions\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 74,\n \"score\": 138484.95308096363\n },\n {\n \"content\": \" class SA = std::allocator<typename std::vector<T, A>::size_type>>\\n\\n using xarray_optional = xarray_container<xoptional_vector<T, A, BA>, L, DEFAULT_SHAPE_CONTAINER(T, A, SA)>;\\n\\n\\n\\n /**\\n\\n * @typedef xtensor_optional\\n\\n * Alias template on xtensor_container for handling missing values\\n\\n *\\n\\n * @tparam T The value type of the elements.\\n\\n * @tparam N The dimension of the tensor.\\n\\n * @tparam L The layout_type of the container (default: row_major).\\n\\n * @tparam A The allocator of the containers holding the elements.\\n\\n * @tparam BA The allocator of the container holding the missing flags.\\n\\n */\\n\\n template <class T, std::size_t N, layout_type L = DEFAULT_LAYOUT, class A = std::allocator<T>, class BA = std::allocator<bool>>\\n\\n using xtensor_optional = xtensor_container<xoptional_vector<T, A, BA>, N, L>;\\n\\n\\n\\n namespace check_policy\\n\\n {\\n\\n struct none\\n\\n {\\n\\n };\\n\\n struct full\\n\\n {\\n\\n };\\n\\n }\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/lib/xtensor-0.10.9/include/xtensor/xtensor_forward.hpp\",\n \"rank\": 75,\n \"score\": 138483.11804434698\n },\n {\n \"content\": \"struct _LIBCPP_TYPE_VIS_ONLY char_traits;\\n\\ntemplate <class, class>\\n\",\n \"file_path\": \"ext/include/meta/meta.hpp\",\n \"rank\": 76,\n \"score\": 136339.53086817384\n },\n {\n \"content\": \"struct io_projectq_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 77,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_liquid_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 78,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct weighted_reordering\\n\\n{\\n\\n /**\\n\\n * @brief Standard constructor\\n\\n *\\n\\n * Initializes default values\\n\\n *\\n\\n * @since 1.0\\n\\n */\\n\\n weighted_reordering();\\n\\n\\n\\n /**\\n\\n * @brief Constructor for adjusting the parameters\\n\\n *\\n\\n * In this parameters the values for \\\\p alpha and \\\\p beta can\\n\\n * be set directly.\\n\\n *\\n\\n * @param alpha Control variable for the weight of the variable frequency term\\n\\n * @param beta Control variable for the weight of the balanced variable term\\n\\n *\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/esop_synthesis.hpp\",\n \"rank\": 79,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_qpic_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 80,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_qcode_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 81,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct garbage_manager\\n\\n{\\n\\npublic:\\n\\n garbage_manager( const rcbdd& cf ) : cf( cf )\\n\\n {\\n\\n std::vector<BDD> garbage;\\n\\n\\n\\n for ( auto i = cf.num_outputs(); i < cf.num_vars(); ++i )\\n\\n {\\n\\n garbage += cf.y(i);\\n\\n }\\n\\n\\n\\n store += garbage;\\n\\n }\\n\\n\\n\\n const std::vector<BDD>& operator[]( unsigned index )\\n\\n {\\n\\n if ( index >= store.size() )\\n\\n {\\n\\n for ( auto i = store.size(); i <= index; ++i )\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/embed_bdd.cpp\",\n \"rank\": 82,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_qsharp_tag_t {};\\n\\n\\n\\n/******************************************************************************\\n\\n * circuit *\\n\\n ******************************************************************************/\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 83,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct cube_sort\\n\\n{\\n\\n explicit cube_sort( unsigned var ) : var( var ) {}\\n\\n\\n\\n bool operator()( const cubes_type::value_type& cube1, const cubes_type::value_type& cube2 ) const\\n\\n {\\n\\n return !cube_is_negative( var )( cube1 ) && cube_is_negative( var)( cube2 );\\n\\n }\\n\\n\\n\\nprivate:\\n\\n unsigned var;\\n\\n};\\n\\n\\n\\nweighted_reordering::weighted_reordering()\\n\\n : alpha( 0.5 ), beta( 0.5 ) {}\\n\\n\\n\\nweighted_reordering::weighted_reordering( float alpha, float beta )\\n\\n : alpha( alpha ), beta( beta ) {}\\n\\n\\n\\nvoid weighted_reordering::reorder( cubes_type::iterator begin, cubes_type::iterator end, const std::vector<unsigned>& vars ) const\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/esop_synthesis.cpp\",\n \"rank\": 84,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct cube_is_negative\\n\\n{\\n\\n explicit cube_is_negative( unsigned var ) : var( var ) {}\\n\\n\\n\\n bool operator()( const cubes_type::value_type& cube ) const\\n\\n {\\n\\n return !( cube.first.at( var ) && *cube.first.at( var ) );\\n\\n }\\n\\n\\n\\nprivate:\\n\\n unsigned var;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/synthesis/esop_synthesis.cpp\",\n \"rank\": 85,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_tikz_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 86,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_qc_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 87,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct ncv_quantum_costs {\\n\\n cost_t operator()(const gate& g, unsigned lines) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Quantum costs from Barenco:1995 based on the Clifford+T Library\\n\\n *\\n\\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\\n\\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\\n\\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\\n\\n * Elementary gates for quantum computation\\n\\n * Physical Review A, 1995\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 88,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct sk2013_quantum_costs\\n\\n{\\n\\n cost_t operator()( const gate& g, unsigned lines ) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief Quantum costs from Barenco:1995 based on the NCV Library\\n\\n *\\n\\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\\n\\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\\n\\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\\n\\n * Elementary gates for quantum computation\\n\\n * Physical Review A, 1995\\n\\n *\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 89,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_spec_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 90,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_quipper_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 91,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct feature\\n\\n{\\n\\n uint16_t control = 0u;\\n\\n uint16_t polarity = 0u;\\n\\n\\n\\n feature( gate& g );\\n\\n feature();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/optimization/esop_post_optimization.cpp\",\n \"rank\": 92,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct pair\\n\\n{\\n\\n gate f;\\n\\n gate s;\\n\\n feature a;\\n\\n feature b;\\n\\n circuit const* c = nullptr;\\n\\n circuit equivalent;\\n\\n\\n\\n pair( const gate& f, const gate& s, const circuit& c, feature& a, feature& b );\\n\\n pair();\\n\\n\\n\\n bool computequivalence( unsigned& c1, unsigned& c2, double* t1, double* t2 );\\n\\n\\n\\n unsigned long long get_cost();\\n\\n\\n\\nprivate:\\n\\n std::pair<gate, unsigned> single_control{f, 0u};\\n\\n};\\n\\n\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/optimization/esop_post_optimization.cpp\",\n \"rank\": 93,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_numpy_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 94,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct clifford_t_quantum_costs {\\n\\n cost_t operator()(const gate& g, unsigned lines) const;\\n\\n};\\n\\n\\n\\n/**\\n\\n * @brief T depth from Barenco:1995 based on the Clifford+T Library\\n\\n *\\n\\n * Reference: {Barenco, Adriano and Bennett, Charles H and Cleve, Richard\\n\\n * and DiVincenzo, David P and Margolus, Norman and Shor, Peter\\n\\n * and Sleator, Tycho and Smolin, John A and Weinfurter, Harald\\n\\n * Elementary gates for quantum computation\\n\\n * Physical Review A, 1995\\n\\n */\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/utils/costs.hpp\",\n \"rank\": 95,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"struct io_real_tag_t {};\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/cli/reversible_stores.hpp\",\n \"rank\": 96,\n \"score\": 136099.106328871\n },\n {\n \"content\": \"#include <gmpxx.h>\\n\\n\\n\\nusing namespace boost::assign;\\n\\n\\n\\nnamespace cirkit\\n\\n{\\n\\n\\n\\nvoid count_output_pattern_recurse( DdManager* mgr, DdNode* node, unsigned num_inputs, unsigned num_outputs,\\n\\n const std::string& pattern, unsigned depth,\\n\\n std::vector<mpz_class>& counts, std::vector<std::string>& patterns,\\n\\n bool verbose )\\n\\n{\\n\\n if ( Cudd_IsConstant( node ) ) { return; }\\n\\n\\n\\n if ( depth == num_outputs )\\n\\n {\\n\\n if ( verbose )\\n\\n {\\n\\n std::cout << pattern << \\\" has \\\" << Cudd_CountMinterm( mgr, node, num_inputs ) << std::endl;\\n\\n }\\n\",\n \"file_path\": \"addons/cirkit-addon-reversible/src/reversible/functions/calculate_additional_lines.cpp\",\n \"rank\": 97,\n \"score\": 59.832802568007025\n },\n {\n \"content\": \" using maj_strash_key_t = std::tuple<xmg_function, xmg_function, xmg_function>;\\n\\n using xor_strash_key_t = std::pair<xmg_function, xmg_function>;\\n\\n std::unordered_map<maj_strash_key_t, node_t, hash<maj_strash_key_t>> maj_strash;\\n\\n std::unordered_map<xor_strash_key_t, node_t, hash<xor_strash_key_t>> xor_strash;\\n\\n\\n\\n complement_property_map_t _complement;\\n\\n\\n\\n /* additional network information */\\n\\n dirty<std::vector<unsigned>> fanout;\\n\\n dirty<std::vector<std::vector<node_t>>> parentss;\\n\\n dirty<std::vector<unsigned>> levels;\\n\\n\\n\\n /* network settings and stats */\\n\\n bool _native_xor = true;\\n\\n bool _enable_structural_hashing = true;\\n\\n bool _enable_inverter_propagation = true;\\n\\n unsigned _num_maj = 0u;\\n\\n unsigned _num_xor = 0u;\\n\\n\\n\\n /* cover */\\n\",\n \"file_path\": \"src/classical/xmg/xmg.hpp\",\n \"rank\": 99,\n \"score\": 54.98194654906311\n }\n]","isConversational":false}}},{"rowIdx":290,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/orbital/software/self.cpp"},"repo_name":{"kind":"string","value":"Klern28/orbital"},"commit":{"kind":"string","value":"3e0a669e550e1d9a36eef24c9e77f40782bc5381"},"file_code":{"kind":"string","value":"\n\n#include \"self.h\"\n#include <orbital/crypto_ps4.h>\n\n#include <zlib.h>\n\n#include <stdexcept>\n\nconstexpr U32 SELF_MAGIC = '\\x4F\\x15\\x3D\\x1D';\n\nenum SelfEndian {\n LITTLE = 1,\n};\n\nenum ProgramAuthID : U64 {\n PAID_KERNEL = UINT64_C(0x3C00000000000001),\n};\n\nenum ProgramType : U64 {\n PTYPE_FAKE = 0x1,\n PTYPE_NPDRM_EXEC = 0x4,\n PTYPE_NPDRM_DYNLIB = 0x5,\n PTYPE_SYSTEM_EXEC = 0x8,\n PTYPE_SYSTEM_DYNLIB = 0x9,\n PTYPE_HOST_KERNEL = 0xC,\n PTYPE_SECURE_MODULE = 0xE,\n PTYPE_SECURE_KERNEL = 0xF,\n};\n\nstatic Key getKey(const SelfInfo& info) {\n const auto& crypto = ps4Crypto();\n\n switch (info.paid) {\n case PAID_KERNEL:\n if (info.version_app >= 0x00000900'00000000) {\n return crypto.get(\"self.80010002.900\");\n } else if (info.version_app >= 0x00000850'00000000) { \n return crypto.get(\"self.80010002.8xx\");\n } else if (info.version_app >= 0x00000800'00000000) {\n return crypto.get(\"self.80010002.800\");\n } else if (info.version_app >= 0x00000750'00000000) { \n return crypto.get(\"self.80010002.7xx\");\n } else if (info.version_app >= 0x00000700'00000000) {\n return crypto.get(\"self.80010002.700\");\n } else if (info.version_app >= 0x00000650'00000000) { \n return crypto.get(\"self.80010002.6xx\");\n } else if (info.version_app >= 0x00000600'00000000) {\n return crypto.get(\"self.80010002.600\");\n } else if (info.version_app >= 0x00000550'00000000) {\n return crypto.get(\"self.80010002.550\");\n } else if (info.version_app >= 0x00000500'00000000) {\n return crypto.get(\"self.80010002.500\");\n } else if (info.version_app >= 0x00000450'00000000) {\n return crypto.get(\"self.80010002.450\");\n } else if (info.version_app >= 0x00000406'00000000) {\n return crypto.get(\"self.80010002.406\");\n } else if (info.version_app >= 0x00000400'00000000) {\n return crypto.get(\"self.80010002.400\");\n } else if (info.version_app >= 0x00000350'00000000) {\n return crypto.get(\"self.80010002.350\");\n } else if (info.version_app >= 0x00000150'00000000) { \n return crypto.get(\"self.80010002.1xx\");\n } else {\n throw std::runtime_error(\"Unsupported\");\n }\n break;\n default:\n throw std::runtime_error(\"Unsupported\");\n }\n}\n\nSelfParser::SelfParser(Stream& s) : CfParser(s) {\n const auto& crypto = ps4Crypto();\n\n \n s.seek(0, StreamSeek::Set);\n header = s.read_t<SelfHeader>();\n assert(header.magic == SELF_MAGIC);\n assert(header.version == 0);\n assert(header.mode == 1);\n assert(header.endian == SelfEndian::LITTLE);\n assert(header.attr == 0x12);\n\n \n segments.resize(header.segment_count);\n s.read(sizeof(SelfSegment) * segments.size(), segments.data());\n\n \n const auto elf_offset = s.tell();\n elf = std::make_unique<ElfParser>(s);\n const auto ehdr = elf->get_ehdr();\n\n \n const auto info_offset = elf_offset + ehdr.e_phoff + ehdr.e_phentsize * ehdr.e_phnum;\n s.seek(align(info_offset, 16), StreamSeek::Set);\n info = s.read_t<SelfInfo>();\n assert(s.tell() == header.header_size, \"NPDRM Control Blocks are unsupported\");\n\n \n Buffer buffer(header.meta_size);\n s.read(buffer.size(), buffer.data());\n crypto.decrypt(buffer.data(), buffer.size(), getKey(info));\n auto* meta_entries = reinterpret_cast<const SelfMeta*>(&buffer[0]);\n metas.clear();\n for (size_t i = 0; i < header.segment_count; i++) {\n metas.push_back(meta_entries[i]);\n }\n}\n\nSelfParser::~SelfParser() {\n}\n\nElf_Ehdr<> SelfParser::get_ehdr() {\n return elf->get_ehdr();\n}\n\nElf_Phdr<> SelfParser::get_phdr(size_t i) {\n return elf->get_phdr(i);\n}\n\nBuffer SelfParser::get_pdata(size_t i) {\n \n const auto segment_idx = find_segment(i);\n if (segments[segment_idx].has_blocks()) {\n return get_segment_blocked(i);\n } else {\n return get_segment_nonblocked(i);\n }\n}\n\nU64 SelfParser::find_segment(U64 phdr_idx) const {\n for (size_t i = 0; i < header.segment_count; i++) {\n if (segments[i].id() == phdr_idx) {\n return i;\n }\n }\n throw std::out_of_range(\"SELF segment not found\");\n}\n\nBuffer SelfParser::get_segment_blocked(U64 index) {\n throw std::runtime_error(\"Unimplemented\");\n}\n\nBuffer SelfParser::get_segment_nonblocked(U64 index) {\n const auto segment_idx = find_segment(index);\n const auto& segment = segments[segment_idx];\n const auto& meta = metas[segment_idx];\n\n s.seek(segment.offset, StreamSeek::Set);\n Buffer buffer = s.read_b(segment.mem_size);\n if (segment.is_encrypted()) {\n decrypt(buffer, meta);\n }\n if (segment.is_compressed()) {\n const auto size = segment.mem_size;\n unsigned long cur_zsize = (size & ~0xF) - (size & 0xF);\n unsigned long cur_usize = segment.file_size;\n\n Buffer result(segment.file_size);\n int zerr = uncompress(result.data(), &cur_usize, buffer.data(), cur_zsize);\n assert(zerr == 0);\n buffer = std::move(result);\n }\n return buffer;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"self.h\"\n#include <orbital/crypto_ps4.h>\n\n#include <zlib.h>\n\n#include <stdexcept>\n\nconstexpr U32 SELF_MAGIC = '\\x4F\\x15\\x3D\\x1D';\n\nenum SelfEndian {\n LITTLE = 1,\n};\n\nenum ProgramAuthID : U64 {\n PAID_KERNEL = UINT64_C(0x3C00000000000001),\n};\n\nenum ProgramType : U64 {\n PTYPE_FAKE = 0x1,\n PTYPE_NPDRM_EXEC = 0x4,\n PTYPE_NPDRM_DYNLIB = 0x5,\n PTYPE_SYSTEM_EXEC = 0x8,\n PTYPE_SYSTEM_DYNLIB = 0x9,\n PTYPE_HOST_KERNEL = 0xC,\n PTYPE_SECURE_MODULE = 0xE,\n PTYPE_SECURE_KERNEL = 0xF,\n};\n\nstatic Key getKey(const SelfInfo& info) {\n const auto& crypto = ps4Crypto();\n\n switch (info.paid) {\n case PAID_KERNEL:\n if (info.version_app >= 0x00000900'00000000) {\n return crypto.get(\"self.80010002.900\");\n } else if (info.version_app >= 0x00000850'00000000) { \n return crypto.get(\"self.80010002.8xx\");\n } else if (info.version_app >= 0x00000800'00000000) {\n return crypto.get(\"self.80010002.800\");\n } else if (info.version_app >= 0x00000750'00000000) { \n return crypto.get(\"self.80010002.7xx\");\n } else if (info.version_app >= 0x00000700'00000000) {\n return crypto.get(\"self.80010002.700\");\n } else if (info.version_app >= 0x00000650'00000000) { \n return crypto.get(\"self.80010002.6xx\");\n } else if (info.version_app >= 0x00000600'00000000) {\n return crypto.get(\"self.80010002.600\");\n } else if (info.version_app >= 0x00000550'00000000) {\n return crypto.get(\"self.80010002.550\");\n } else if (info.version_app >= 0x00000500'00000000) {\n return crypto.get(\"self.80010002.500\");\n } else if (info.version_app >= 0x00000450'00000000) {\n return crypto.get(\"self.80010002.450\");\n } else if (info.version_app >= 0x00000406'00000000) {\n return crypto.get(\"self.80010002.406\");\n } else if (info.version_app >= 0x00000400'00000000) {\n return crypto.get(\"self.80010002.400\");\n } else if (info.version_app >= 0x00000350'00000000) {\n return crypto.get(\"self.80010002.350\");\n } else if (info.version_app >= 0x00000150'00000000) { \n return crypto.get(\"self.80010002.1xx\");\n } else {\n throw std::runtime_error(\"Unsupported\");\n }\n break;\n default:\n throw std::runtime_error(\"Unsupported\");\n }\n}\n\nSelfParser::SelfParser(Stream& s) : CfParser(s) {\n const auto& cryp"},"suffix":{"kind":"string","value":"d_segment(index);\n const auto& segment = segments[segment_idx];\n const auto& meta = metas[segment_idx];\n\n s.seek(segment.offset, StreamSeek::Set);\n Buffer buffer = s.read_b(segment.mem_size);\n if (segment.is_encrypted()) {\n decrypt(buffer, meta);\n }\n if (segment.is_compressed()) {\n const auto size = segment.mem_size;\n unsigned long cur_zsize = (size & ~0xF) - (size & 0xF);\n unsigned long cur_usize = segment.file_size;\n\n Buffer result(segment.file_size);\n int zerr = uncompress(result.data(), &cur_usize, buffer.data(), cur_zsize);\n assert(zerr == 0);\n buffer = std::move(result);\n }\n return buffer;\n}\n"},"middle":{"kind":"string","value":"to = ps4Crypto();\n\n \n s.seek(0, StreamSeek::Set);\n header = s.read_t<SelfHeader>();\n assert(header.magic == SELF_MAGIC);\n assert(header.version == 0);\n assert(header.mode == 1);\n assert(header.endian == SelfEndian::LITTLE);\n assert(header.attr == 0x12);\n\n \n segments.resize(header.segment_count);\n s.read(sizeof(SelfSegment) * segments.size(), segments.data());\n\n \n const auto elf_offset = s.tell();\n elf = std::make_unique<ElfParser>(s);\n const auto ehdr = elf->get_ehdr();\n\n \n const auto info_offset = elf_offset + ehdr.e_phoff + ehdr.e_phentsize * ehdr.e_phnum;\n s.seek(align(info_offset, 16), StreamSeek::Set);\n info = s.read_t<SelfInfo>();\n assert(s.tell() == header.header_size, \"NPDRM Control Blocks are unsupported\");\n\n \n Buffer buffer(header.meta_size);\n s.read(buffer.size(), buffer.data());\n crypto.decrypt(buffer.data(), buffer.size(), getKey(info));\n auto* meta_entries = reinterpret_cast<const SelfMeta*>(&buffer[0]);\n metas.clear();\n for (size_t i = 0; i < header.segment_count; i++) {\n metas.push_back(meta_entries[i]);\n }\n}\n\nSelfParser::~SelfParser() {\n}\n\nElf_Ehdr<> SelfParser::get_ehdr() {\n return elf->get_ehdr();\n}\n\nElf_Phdr<> SelfParser::get_phdr(size_t i) {\n return elf->get_phdr(i);\n}\n\nBuffer SelfParser::get_pdata(size_t i) {\n \n const auto segment_idx = find_segment(i);\n if (segments[segment_idx].has_blocks()) {\n return get_segment_blocked(i);\n } else {\n return get_segment_nonblocked(i);\n }\n}\n\nU64 SelfParser::find_segment(U64 phdr_idx) const {\n for (size_t i = 0; i < header.segment_count; i++) {\n if (segments[i].id() == phdr_idx) {\n return i;\n }\n }\n throw std::out_of_range(\"SELF segment not found\");\n}\n\nBuffer SelfParser::get_segment_blocked(U64 index) {\n throw std::runtime_error(\"Unimplemented\");\n}\n\nBuffer SelfParser::get_segment_nonblocked(U64 index) {\n const auto segment_idx = fin"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"struct Key {\n\n enum Type {\n\n NONE,\n\n AES_128_EBC,\n\n AES_128_CBC,\n\n } type;\n\n\n\n Botan::SymmetricKey key;\n\n Botan::InitializationVector iv;\n\n\n\n Key() : type(NONE) {}\n\n Key(Type type, const void* key_buf, size_t key_len, const void* iv_buf, size_t iv_len)\n\n : type(type), key((const U8*)key_buf, key_len), iv((const U8*)iv_buf, iv_len) {\n\n }\n\n Key(Type type, std::string_view key, std::string_view iv)\n\n : type(type), key(std::string(key)), iv(std::string(iv)) {\n\n }\n\n};\n\n\n","file_path":"src/orbital/crypto.h","rank":2,"score":126619.02313683904},{"content":"const Crypto& ps4Crypto();\n","file_path":"src/orbital/crypto_ps4.h","rank":4,"score":91847.0847283303},{"content":"struct OffsetRange {\n\n uint64_t base;\n\n uint64_t size;\n\n\n\n constexpr OffsetRange(uint64_t base, uint64_t size)\n\n : base(base), size(size) {\n\n }\n\n constexpr bool contains(uint64_t off) const noexcept {\n\n return (base <= off) && (off < base + size);\n\n }\n","file_path":"src/orbital/offset_range.h","rank":5,"score":81730.7374976328},{"content":"class Crypto : public CryptoVault {\n\npublic:\n\n /**\n\n * Decrypt typed data with specified key.\n\n * @tparam T Type of the data to decrypt\n\n * @param[in] value Typed value to decrypt\n\n * @param[in] key Unique identifier of key in vault\n\n */\n\n template <typename T>\n\n T decrypt(const T& value, std::string_view key) const {\n\n return decrypt<T>(value, get(key));\n\n }\n\n\n\n /**\n\n * Read and decrypt typed data with specified key.\n\n * @tparam T Type of the data to decrypt\n\n * @param[in] s Stream to read encrypted typed data from\n\n * @param[in] key Unique identifier of key in vault\n\n */\n\n template <typename T>\n","file_path":"src/orbital/crypto.h","rank":6,"score":80792.43718746952},{"content":" uint8_t key[0x10];\n","file_path":"tools/dumper/source/ksdk_sbl.h","rank":7,"score":80662.50707856947},{"content":" Bitrange<U64, 0, 16> offset;\n","file_path":"src/orbital/hardware/liverpool/gca/pm4.h","rank":8,"score":79656.17924586838},{"content":"struct AeoliaNVS {\n\n union {\n\n U08 data[0x400];\n\n union {\n\n // [0x9B330, 0x9B34F]\n\n NVS_RANGE(0x000, 0x20) OsBootParameter;\n\n // [0x9B350, 0x9B38F]\n\n NVS_RANGE(0x000, 0x40) LsiBootParameter;\n\n // [0x9B390, 0x9B48F]\n\n NVS_RANGE(0x300, 0x100) BiosConfig;\n\n // [0x9B6E4, 0x9B743]\n\n NVS_RANGE(0x200, 0x60) EapPartitionKey;\n\n // 0x9B6DD\n\n NVS_RANGE(0x065, 0x1) CsBackupMode;\n\n // 0x9B6DE\n\n NVS_RANGE(0x0C0, 0x2) TempSlewRate;\n\n };\n\n };\n\n\n\n AeoliaNVS() {\n\n memset(data, 0, sizeof(data));\n\n\n\n OsBootParameter.data[0x18] = 2; // sceKernelHwHasWlanBt second bit as 1 for none\n\n BiosConfig.data[0] = 0xF0; // verbose ubios boot\n\n }\n\n\n","file_path":"src/orbital/hardware/aeolia/nvs/aeolia_nvs.h","rank":9,"score":78718.43502368708},{"content":"struct SelfInfo {\n\n LE<U64> paid; // Program Authority ID\n\n LE<U64> ptype; // Program Type\n\n LE<U64> version_app; // Application Version\n\n LE<U64> version_fw; // Firmware Version\n\n U08 digest[0x20];\n\n};\n\n\n","file_path":"src/orbital/software/self.h","rank":10,"score":75479.71197644131},{"content":"enum PupEndian {\n\n LITTLE = 1,\n\n};\n\n\n","file_path":"src/orbital/software/pup.cpp","rank":11,"score":74316.43692397267},{"content":"enum PupFlags {\n\n JIG = 1,\n\n};\n\n\n\n// PUP parser\n\nPupParser::PupParser(Stream& s, bool verify) : CfParser(s) {\n\n Buffer buffer;\n\n const auto& crypto = ps4Crypto();\n\n\n\n // Read and verify PUP header\n\n s.seek(0, StreamSeek::Set);\n\n header = s.read_t<PupHeader>();\n\n assert(header.magic == PUP_MAGIC);\n\n assert(header.version == 0);\n\n assert(header.mode == 1);\n\n assert(header.endian == PupEndian::LITTLE);\n\n assert(header.attr == 0x12);\n\n\n\n // Discard unsupported flags\n\n assert((header.flags & PupFlags::JIG) == 0, \"Unsupported JIG flag\");\n","file_path":"src/orbital/software/pup.cpp","rank":12,"score":74316.43692397267},{"content":"enum VulkanManagerMode {\n\n VULKAN_MANAGER_CREATE,\n\n VULKAN_MANAGER_REUSE,\n\n};\n\n\n","file_path":"src/orbital/host/graphics/vulkan.h","rank":13,"score":73211.84188991266},{"content":"enum HPETGeneralReg {\n\n HPET_REG_CAP = 0x00,\n\n HPET_REG_CFG = 0x10,\n\n HPET_REG_IS = 0x20,\n\n HPET_REG_CNT = 0xF0,\n\n};\n\n\n","file_path":"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp","rank":14,"score":70201.4872298204},{"content":"enum HPETTimerReg {\n\n HPET_REG_TNCFG_0 = 0x00,\n\n HPET_REG_TNCFG_1 = 0x04,\n\n HPET_REG_TNCMP_0 = 0x08,\n\n HPET_REG_TNCMP_1 = 0x0C,\n\n HPET_REG_TNROUTE_0 = 0x10,\n\n HPET_REG_TNROUTE_1 = 0x14,\n\n};\n\n\n\nAeoliaHpet::AeoliaHpet(ContainerSpace* mem, const AeoliaHpetConfig& config)\n\n : Device(nullptr, config), mem(mem) {\n\n // Initialize MMIO\n\n mmio = new MemorySpace(this, 0x1000, {\n\n static_cast<MemorySpaceReadOp>(&AeoliaHpet::mmio_read),\n\n static_cast<MemorySpaceWriteOp>(&AeoliaHpet::mmio_write),\n\n });\n\n mem->addSubspace(mmio, config.base);\n\n\n\n // Create timers\n\n assert_true(config.count >= 3);\n","file_path":"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp","rank":15,"score":70201.4872298204},{"content":"// ELF conversion\n\nenum class ElfType {\n\n LE_32,\n\n BE_32,\n\n LE_64,\n\n BE_64,\n\n};\n\n\n","file_path":"src/orbital/software/elf.h","rank":16,"score":68951.77951778917},{"content":"class CryptoVault {\n\n std::map<std::string, Key> keys;\n\n\n\npublic:\n\n /**\n\n * Add named key to the vault.\n\n * @param[in] name Unique key identifier\n\n * @param[in] key Key data\n\n */\n\n void add(std::string_view name, Key key) {\n\n std::string k(name);\n\n keys[k] = key;\n\n }\n\n\n\n /**\n\n * Get key by name.\n\n * @param[in] name Unique key identifier\n\n */\n\n const Key& get(std::string_view name) const {\n\n std::string k(name);\n","file_path":"src/orbital/crypto.h","rank":17,"score":57439.591720265824},{"content":"class CryptoStream : public Stream {\n\n Stream& s;\n\n Key key;\n\n\n\npublic:\n\n CryptoStream(Stream& s, const Key& key) : s(s), key(key) {}\n\n\n\n // Interface\n\n virtual U64 read(U64 size, void* buffer) override;\n\n virtual U64 write(U64 size, const void* buffer) override;\n\n virtual void seek(U64 offset, StreamSeek mode) override;\n\n virtual U64 tell() const override;\n\n};\n\n\n","file_path":"src/orbital/crypto.h","rank":18,"score":55646.1962063667},{"content":" * @param[in] key Decryption key\n\n */\n\n static void decrypt(const void* input_buf, size_t input_len,\n\n void* output_buf, size_t output_len, Key key);\n\n\n\n /**\n\n * Decrypt buffer with specified key.\n\n */\n\n static Buffer decrypt(const Buffer& buffer, Key key);\n\n\n\n /**\n\n * Decrypt stream with specified key.\n\n */\n\n static CryptoStream decrypt(Stream& s, Key key);\n\n};\n","file_path":"src/orbital/crypto.h","rank":19,"score":49958.49752462618},{"content":" T decrypt(Stream& s, std::string_view key) const {\n\n return decrypt<T>(s, get(key));\n\n }\n\n\n\n // Static methods\n\n\n\n /**\n\n * Decrypt typed data with specified key.\n\n */\n\n template <typename T>\n\n static T decrypt(const T& value, Key key) {\n\n T output = {};\n\n decrypt(&value, sizeof(T), &output, sizeof(T), key);\n\n return output;\n\n }\n\n\n\n /**\n\n * Read and decrypt typed data with specified key.\n\n */\n\n template <typename T>\n","file_path":"src/orbital/crypto.h","rank":20,"score":49954.61093128656},{"content":" static T decrypt(Stream& s, Key key) {\n\n T output = s.read_t<T>();\n\n decrypt(&output, sizeof(T), key);\n\n return output;\n\n }\n\n\n\n /**\n\n * Decrypt buffer in-place with specified key.\n\n * @param[in,out] buf Pointer to input/output data\n\n * @param[in,out] len Input/Output length in bytes\n\n * @param[in] key Decryption key\n\n */\n\n static void decrypt(void* buf, size_t len, Key key);\n\n\n\n /**\n\n * Decrypt buffer with specified key.\n\n * @param[in] input_buf Pointer to input data\n\n * @param[in] input_len Input length in bytes\n\n * @param[out] output_buf Pointer to output data\n\n * @param[out] output_len Output length in bytes\n","file_path":"src/orbital/crypto.h","rank":21,"score":49953.88725728598},{"content":" return keys.at(k);\n\n }\n\n\n\n /**\n\n * Remove key by name.\n\n * @param[in] name Unique key identifier\n\n */\n\n void remove(std::string_view name) {\n\n std::string k(name);\n\n keys.erase(k);\n\n }\n\n\n\n /**\n\n * Number of keys in the vault.\n\n */\n\n size_t size() const {\n\n return keys.size();\n\n }\n\n};\n\n\n","file_path":"src/orbital/crypto.h","rank":22,"score":49950.87753506528},{"content":"/**\n\n * Cryptography.\n\n *\n\n * Copyright 2017-2021. Orbital project.\n\n * Released under MIT license. Read LICENSE for more details.\n\n *\n\n * Authors:\n\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\n\n */\n\n \n\n#pragma once\n\n\n\n#include <orbital/core.h>\n\n\n\n#include <botan/botan.h>\n\n\n\n#include <filesystem>\n\n#include <string>\n\n#include <string_view>\n\n#include <unordered_map>\n\n\n","file_path":"src/orbital/crypto.h","rank":23,"score":49950.66583054152},{"content":"}\n\n\n\nvoid CryptoStream::seek(U64 offset, StreamSeek mode) {\n\n s.seek(offset, mode);\n\n}\n\n\n\nU64 CryptoStream::tell() const {\n\n return s.tell();\n\n}\n\n\n\nvoid Crypto::decrypt(void* buf, size_t len, Key key) {\n\n Crypto::decrypt(buf, len, buf, len, key);\n\n}\n\n\n\nvoid Crypto::decrypt(const void* input_buf, size_t input_len,\n\n void* output_buf, size_t output_len, Key key) {\n\n const char* algo;\n\n switch (key.type) {\n\n case Key::AES_128_EBC:\n\n algo = \"AES-128/EBC\";\n","file_path":"src/orbital/crypto.cpp","rank":24,"score":48602.41007807528},{"content":"/**\n\n * Cryptography.\n\n *\n\n * Copyright 2017-2021. Orbital project.\n\n * Released under MIT license. Read LICENSE for more details.\n\n *\n\n * Authors:\n\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\n\n */\n\n\n\n#include \"crypto.h\"\n\n\n\n#include <stdexcept>\n\n\n\nU64 CryptoStream::read(U64 size, void* buffer) {\n\n return 0;\n\n}\n\n\n\nU64 CryptoStream::write(U64 size, const void* buffer) {\n\n return 0;\n","file_path":"src/orbital/crypto.cpp","rank":25,"score":48600.801010046096},{"content":" break;\n\n case Key::AES_128_CBC:\n\n algo = \"AES-128/CBC/CTS\";\n\n break;\n\n default:\n\n throw std::invalid_argument(\"Unrecognized key type\");\n\n }\n\n auto cipher = Botan::get_cipher(algo, key.key, key.iv, Botan::Cipher_Dir::DECRYPTION);\n\n Botan::Pipe pipe(cipher);\n\n pipe.start_msg();\n\n pipe.write((const uint8_t*)input_buf, input_len);\n\n pipe.end_msg();\n\n pipe.read((uint8_t*)output_buf, output_len);\n\n}\n\n\n\nBuffer Crypto::decrypt(const Buffer& buffer, Key key) {\n\n Buffer output(buffer.size());\n\n decrypt(buffer.data(), buffer.size(), output.data(), output.size(), key);\n\n return output;\n\n}\n\n\n\nCryptoStream Crypto::decrypt(Stream& s, Key key) {\n\n return CryptoStream(s, key);\n\n}\n","file_path":"src/orbital/crypto.cpp","rank":26,"score":48600.59428595044},{"content":"/**\n\n * PS4 cryptography.\n\n *\n\n * Copyright 2017-2021. Orbital project.\n\n * Released under MIT license. Read LICENSE for more details.\n\n *\n\n * Authors:\n\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\n\n */\n\n\n\n#include \"crypto.h\"\n\n\n\n#include <rapidjson/document.h>\n\n#include <rapidjson/istreamwrapper.h>\n\n\n\n#include <fstream>\n\n#include <stdexcept>\n\n\n\nstatic Crypto g_ps4Crypto;\n\n\n","file_path":"src/orbital/crypto_ps4.cpp","rank":27,"score":47311.02203661777},{"content":"static Key parseAesKey(Key::Type type, const rapidjson::Value& value) {\n\n auto key = value[\"aes_key\"].GetString();\n\n auto iv = value[\"aes_iv\"].GetString();\n\n return Key(type, key, iv);\n\n}\n\n\n\nconst Crypto& ps4Crypto() {\n\n if (g_ps4Crypto.size() > 0) {\n\n return g_ps4Crypto;\n\n }\n\n\n\n // Parse keys from hardcoded file\n\n std::ifstream ifs(\"crypto/keys.json\");\n\n rapidjson::IStreamWrapper isw(ifs);\n\n rapidjson::Document document;\n\n document.ParseStream(isw);\n\n\n\n // Add individual keys\n\n g_ps4Crypto.add(\"pup.hdr\",\n\n parseAesKey(Key::AES_128_CBC, document[\"pup\"][\"hdr\"]));\n","file_path":"src/orbital/crypto_ps4.cpp","rank":28,"score":47310.68383057247},{"content":" g_ps4Crypto.add(\"pup.root_key\",\n\n parseAesKey(Key::AES_128_CBC, document[\"pup\"][\"root_key\"]));\n\n\n\n for (const auto& m : document[\"self\"][\"80010002\"].GetObject()) {\n\n std::string name = \"self.80010002.\";\n\n g_ps4Crypto.add(name + m.name.GetString(), parseAesKey(Key::AES_128_CBC, m.value));\n\n }\n\n\n\n return g_ps4Crypto;\n\n}\n","file_path":"src/orbital/crypto_ps4.cpp","rank":29,"score":47307.66440379626},{"content":"\tElf64_Xword\tr_info;\t\t/* Relocation type and symbol index. */\n","file_path":"tools/dumper/source/elf64.h","rank":30,"score":43803.05591974685},{"content":"\tElf64_Xword \tm_info;\t\t/* size + index */\n","file_path":"tools/dumper/source/elf64.h","rank":31,"score":43803.05591974685},{"content":"\tElf32_Word\tr_info;\t\t/* Relocation type and symbol index. */\n","file_path":"tools/dumper/source/elf32.h","rank":32,"score":43803.05591974685},{"content":"\tElf32_Word \tm_info;\t\t/* size + index */\n","file_path":"tools/dumper/source/elf32.h","rank":33,"score":43803.05591974685},{"content":"\tunsigned char\tst_info;\t/* Type and binding information. */\n","file_path":"tools/dumper/source/elf32.h","rank":34,"score":42752.226785497165},{"content":"\tunsigned char\tst_info;\t/* Type and binding information. */\n","file_path":"tools/dumper/source/elf64.h","rank":35,"score":42752.226785497165},{"content":"\tElf32_Word\tsh_info;\t/* Depends on section type. */\n","file_path":"tools/dumper/source/elf32.h","rank":36,"score":42752.226785497165},{"content":"\tElf64_Word\tsh_info;\t/* Depends on section type. */\n","file_path":"tools/dumper/source/elf64.h","rank":37,"score":42752.226785497165},{"content":" uint32_t key_type;\n","file_path":"tools/dumper/source/self_decrypter.h","rank":38,"score":41792.59279867457},{"content":" uint32_t key_id;\n","file_path":"tools/dumper/source/ksdk_sbl.h","rank":39,"score":41792.59279867457},{"content":" struct self_auth_info_t auth_info;\n","file_path":"tools/dumper/source/self_decrypter.h","rank":40,"score":41750.63494108576},{"content":"#define SELF_KEY_SIZE 0x10\n","file_path":"tools/dumper/source/self_decrypter.c","rank":41,"score":40835.89641388528},{"content":"#ifndef SELF_DECRYPTER_H\n\n#define SELF_DECRYPTER_H\n\n\n\n#include \"ksdk.h\"\n\n\n\n#include \"elf32.h\"\n\n#include \"elf64.h\"\n\n\n\n// Format\n\ntypedef struct self_entry_t {\n\n uint32_t props;\n\n uint32_t reserved;\n\n uint64_t offset;\n\n uint64_t filesz;\n\n uint64_t memsz;\n\n} self_entry_t;\n\n\n\ntypedef struct self_header_t {\n\n uint32_t magic;\n\n uint8_t version;\n\n uint8_t mode;\n\n uint8_t endian;\n\n uint8_t attr;\n\n uint32_t key_type;\n\n uint16_t header_size;\n\n uint16_t meta_size;\n\n uint64_t file_size;\n\n uint16_t num_entries;\n\n uint16_t flags;\n\n uint32_t reserved;\n\n self_entry_t entries[0];\n\n} self_header_t;\n\n\n\n// Context\n\nstruct self_auth_info_t {\n\n uint8_t buf[0x88];\n\n};\n\n\n\ntypedef struct self_t {\n\n int fd;\n\n char *file_path;\n\n size_t file_size;\n\n size_t entries_size;\n\n size_t data_offset;\n\n size_t data_size;\n\n /* contents */\n\n struct self_header_t header;\n\n struct self_entry_t *entries;\n\n uint8_t *data;\n\n /* kernel */\n\n struct self_auth_info_t auth_info;\n\n struct self_context_t *ctx;\n\n int auth_ctx_id;\n\n int ctx_id;\n\n int svc_id;\n\n int verified;\n\n /* blobs */\n\n struct blob_t *blobs;\n\n} self_t;\n\n\n\n/* functions */\n\nself_t* self_open(const char *file);\n\nint self_verify_header(self_t *self);\n\nint self_load_segments(self_t *self);\n\nvoid self_close(self_t *self);\n\n\n","file_path":"tools/dumper/source/self_decrypter.h","rank":42,"score":40794.89903584515},{"content":" uint64_t auth_info_addr;\n","file_path":"tools/dumper/source/ksdk_sbl.h","rank":43,"score":40794.89903584515},{"content":"#define SELF_AUTH_INFO_SIZE 0x88\n","file_path":"tools/dumper/source/self_decrypter.c","rank":44,"score":39881.94040727142},{"content":"static void self_get_block_info(self_t *self, unsigned int target_entry_idx, self_block_info_t *info)\n\n{\n\n struct self_entry_t* table_segment;\n\n struct self_entry_t* target_segment;\n\n struct self_block_extent_t* extents;\n\n const uint8_t* segment_data;\n\n unsigned int target_num_blocks;\n\n unsigned int i;\n\n\n\n memset(&info->digest, 0, sizeof(info->digest));\n\n memset(&info->extent, 0, sizeof(info->extent));\n\n\n\n for (i = 0; i < self->header.num_entries; ++i) {\n\n table_segment = &self->entries[i];\n\n if (!EXTRACT(table_segment->props, SELF_PROPS_HAS_DIGESTS) &&\n\n !EXTRACT(table_segment->props, SELF_PROPS_HAS_EXTENTS))\n\n continue;\n\n if (EXTRACT(table_segment->props, SELF_PROPS_SEGMENT_INDEX) != target_entry_idx)\n\n continue;\n\n\n\n target_segment = &self->entries[target_entry_idx];\n\n target_num_blocks = (target_segment->memsz + (info->size - 1)) / info->size;\n\n segment_data = &self->data[table_segment->offset];\n\n if (EXTRACT(table_segment->props, SELF_PROPS_HAS_DIGESTS)) {\n\n memcpy(&info->digest, &segment_data[info->index * sizeof(info->digest)], sizeof(info->digest));\n\n }\n\n if (EXTRACT(table_segment->props, SELF_PROPS_HAS_EXTENTS)) {\n\n if (EXTRACT(table_segment->props, SELF_PROPS_HAS_DIGESTS))\n\n extents = (void*)(&segment_data[target_num_blocks * sizeof(info->digest)]);\n\n else\n\n extents = (void*)(&segment_data[0]);\n\n memcpy(&info->extent, &extents[info->index], sizeof(info->extent));\n\n }\n\n return;\n\n }\n","file_path":"tools/dumper/source/self_decrypter.c","rank":45,"score":39881.94040727142},{"content":"#define CCP_FLAG_SLOT_KEY 0x40000\n","file_path":"src/orbital/hardware/liverpool/sam/ccp.h","rank":46,"score":39048.1525174442},{"content":" static void* EndianessCopyLittleEndian(void* _dst, void* _src, size_t s, int is_little_endian)\n\n {\n\n if (is_little_endian)\n\n {\n\n return memcpy(_dst, _src, s);\n\n }\n\n else\n\n {\n\n uint8_t* dst = (uint8_t*)_dst;\n\n uint8_t* src = (uint8_t*)_src + s - 1;\n\n for (int i = 0, n = (int)s; i < n; ++i)\n\n memcpy(dst++, src--, 1);\n\n return _dst;\n\n }\n","file_path":"src/orbital/ui/imgui/widgets/imgui_memory_editor.h","rank":47,"score":37428.14614714086},{"content":"struct ImGui_ImplVulkan_InitInfo\n\n{\n\n VkInstance Instance;\n\n VkPhysicalDevice PhysicalDevice;\n\n VkDevice Device;\n\n uint32_t QueueFamily;\n\n VkQueue Queue;\n\n VkPipelineCache PipelineCache;\n\n VkDescriptorPool DescriptorPool;\n\n uint32_t Subpass;\n\n uint32_t MinImageCount; // >= 2\n\n uint32_t ImageCount; // >= MinImageCount\n\n VkSampleCountFlagBits MSAASamples; // >= VK_SAMPLE_COUNT_1_BIT\n\n const VkAllocationCallbacks* Allocator;\n\n void (*CheckVkResultFn)(VkResult err);\n","file_path":"src/orbital/ui/imgui/imgui_impl_vulkan.h","rank":48,"score":36605.158631800165},{"content":"class CfParser {\n\nprotected:\n\n Stream& s;\n\n\n\npublic:\n\n CfParser(Stream& s) : s(s) {}\n\n\n\n static void decrypt(Buffer& data, const CfMeta& meta);\n\n};\n","file_path":"src/orbital/software/cf.h","rank":49,"score":29402.72158890154},{"content":"class SelfParser : public CfParser {\n\n SelfHeader header;\n\n SelfInfo info;\n\n std::vector<SelfSegment> segments;\n\n std::vector<SelfMeta> metas;\n\n std::unique_ptr<ElfParser> elf;\n\n\n\npublic:\n\n SelfParser(Stream& s);\n\n ~SelfParser();\n\n\n\n // ELF parser interface\n\n Elf_Ehdr<> get_ehdr();\n\n\n\n Elf_Phdr<> get_phdr(size_t i);\n\n\n\n Buffer get_pdata(size_t i);\n\n\n\nprivate:\n\n /**\n","file_path":"src/orbital/software/self.h","rank":50,"score":20322.18115527322},{"content":"class PupParser : public CfParser {\n\n PupHeader header;\n\n PupHeaderEx headerEx;\n\n std::vector<PupSegmentEntry> segEntries;\n\n std::vector<PupSegmentMeta> segMetas;\n\n\n\npublic:\n\n /**\n\n * Create PUP parser. \n\n * @param[in] verify Verify digital signatures.\n\n */\n\n PupParser(Stream& s, bool verify=false);\n\n ~PupParser();\n\n\n\n /**\n\n * Get PUP segment by identifier.\n\n * @param[in] id Segment identifier (44-bits).\n\n */\n\n Buffer get(U64 id);\n\n\n","file_path":"src/orbital/software/pup.h","rank":51,"score":20322.18115527322},{"content":" }\n\n }\n\n else {\n\n /* Timer-N access */\n\n const U64 index = (addr - 0x100) / 0x20;\n\n const U64 offset = addr % 0x20;\n\n assert_true(index < timers.size());\n\n const auto& timer = timers[index];\n\n\n\n switch (offset) {\n\n case HPET_REG_TNCFG_0:\n\n value = timer.config.value_lo;\n\n break;\n\n case HPET_REG_TNCFG_1:\n\n value = timer.config.value_hi;\n\n break;\n\n case HPET_REG_TNCMP_0:\n\n value = timer.comparator;\n\n break;\n\n case HPET_REG_TNCMP_1:\n","file_path":"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp","rank":52,"score":17.800756468411777},{"content":" value = timer.comparator >> 32;\n\n break;\n\n case HPET_REG_TNROUTE_0:\n\n value = timer.fsb.int_val;\n\n break;\n\n case HPET_REG_TNROUTE_1:\n\n value = timer.fsb.int_addr;\n\n break;\n\n default:\n\n assert_always(\"Invalid register access\");\n\n }\n\n }\n\n return static_cast<U32>(value);\n\n}\n\n\n\nvoid AeoliaHpet::mmio_write(U64 addr, U64 value, U64 size) {\n\n // Sanity checks\n\n assert_true(size == 4);\n\n\n\n if (addr < 0x100) {\n","file_path":"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp","rank":53,"score":17.755988829271743},{"content":" // Ignored accesses\n\n case HPET_REG_CAP + 0:\n\n break;\n\n\n\n default:\n\n assert_always(\"Invalid register access\");\n\n }\n\n }\n\n else {\n\n // Timer-N access\n\n const U64 index = (addr - 0x100) / 0x20;\n\n const U64 offset = addr % 0x20;\n\n assert_true(index < timers.size());\n\n auto& tn = timers[index];\n\n\n\n switch (offset) {\n\n case HPET_REG_TNCFG_0:\n\n tn.config.value_lo = value;\n\n break;\n\n case HPET_REG_TNROUTE_0:\n","file_path":"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp","rank":54,"score":17.38329099349554},{"content":"U32 SmuDevice::mmio_read(U32 index) {\n\n U32 value = 0;\n\n\n\n switch (index) {\n\n case mmSMC_IND_INDEX:\n\n value = smc_ix;\n\n break;\n\n case mmSMC_IND_DATA:\n\n value = smc_read(smc_ix);\n\n break;\n\n default:\n\n assert_always(\"Unimplemented\");\n\n }\n\n\n\n return value;\n\n}\n\n\n\nvoid SmuDevice::mmio_write(U32 index, U32 value) {\n\n switch (index) {\n\n case mmSMC_IND_INDEX:\n","file_path":"src/orbital/hardware/liverpool/smu/smu.cpp","rank":55,"score":16.834625942029366},{"content":" s.seek(base + offset, StreamSeek::Set);\n\n size = std::min<U32>(size, this->size - offset);\n\n\n\n U64 nbytes = s.read(size, buffer);\n\n offset += nbytes;\n\n return nbytes;\n\n}\n\n\n\nU64 BlsStream::write(U64 size, const void* buffer) {\n\n throw std::runtime_error(\"Unsupported method\");\n\n}\n\n\n\nvoid BlsStream::seek(U64 offset, StreamSeek mode) {\n\n switch (mode) {\n\n case StreamSeek::Set:\n\n this->offset = offset;\n\n break;\n\n case StreamSeek::Cur:\n\n this->offset += offset;\n\n break;\n","file_path":"src/orbital/software/bls.cpp","rank":56,"score":16.790604910472105},{"content":" smc_ix = value;\n\n break;\n\n case mmSMC_IND_DATA:\n\n smc_write(smc_ix, value);\n\n break;\n\n default:\n\n assert_always(\"Unimplemented\");\n\n }\n\n}\n\n\n\nU32 SmuDevice::smc_read(U32 index) {\n\n U32 value = 0;\n\n\n\n switch (index) {\n\n // Clocks\n\n case ixCG_SCLK_STATUS:\n\n value = 0x1;\n\n break;\n\n case ixCG_LCLK_STATUS:\n\n value = 0x1;\n","file_path":"src/orbital/hardware/liverpool/smu/smu.cpp","rank":57,"score":16.228077502766517},{"content":" (U32&)config_mask[0xE4] = ~0xFF;\n\n}\n\n\n\nvoid LiverpoolRCDevice::config_write(U32 offset, U64 value, size_t size) {\n\n U32 smc_ix;\n\n switch (offset) {\n\n case D0F0xBC:\n\n assert(size == 4);\n\n smc_ix = (U32&)config_data[D0F0xB8];\n\n smu->smc_write(smc_ix, value);\n\n break;\n\n default:\n\n PCIDevice::config_write(offset, value, size);\n\n }\n\n}\n\n\n\nU64 LiverpoolRCDevice::config_read(U32 offset, size_t size) {\n\n U64 value = 0;\n\n\n\n U32 smc_ix;\n","file_path":"src/orbital/hardware/liverpool/liverpool_rc.cpp","rank":58,"score":16.14756881677502},{"content":" return;\n\n }\n\n\n\n auto data = func_data[func];\n\n switch (func) {\n\n case 0:\n\n assert(sub < 4);\n\n data |= func0_data_lo[sub];\n\n break;\n\n case 1:\n\n assert(sub < 4);\n\n data |= func1_data_lo[sub];\n\n break;\n\n case 2:\n\n assert(sub < 4);\n\n data |= func2_data_lo[sub];\n\n break;\n\n case 3:\n\n assert(sub < 4);\n\n data |= func3_data_lo[sub];\n","file_path":"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp","rank":59,"score":16.031932182851097},{"content":" advfault_cntl = 0;\n\n}\n\n\n\nU32 IhDevice::mmio_read(U32 index) {\n\n U32 value = 0;\n\n\n\n switch (index) {\n\n case mmIH_RB_BASE:\n\n value = rb_base;\n\n break;\n\n case mmIH_RB_WPTR:\n\n value = rb_wptr;\n\n break;\n\n case mmIH_RB_WPTR_ADDR_LO:\n\n value = rb_wptr_addr_lo;\n\n break;\n\n case mmIH_RB_WPTR_ADDR_HI:\n\n value = rb_wptr_addr_hi;\n\n break;\n\n case mmIH_STATUS:\n","file_path":"src/orbital/hardware/liverpool/oss/ih.cpp","rank":60,"score":16.01304746288052},{"content":" value = status;\n\n break;\n\n default:\n\n assert_always(\"Unimplemented\");\n\n }\n\n\n\n return value;\n\n}\n\n\n\nvoid IhDevice::mmio_write(U32 index, U32 value) {\n\n switch (index) {\n\n case mmIH_RB_CNTL:\n\n rb_cntl = value;\n\n break;\n\n case mmIH_RB_BASE:\n\n rb_base = value;\n\n break;\n\n case mmIH_RB_WPTR:\n\n rb_wptr = value;\n\n break;\n","file_path":"src/orbital/hardware/liverpool/oss/ih.cpp","rank":61,"score":16.005481664149414},{"content":"}\n\n\n\nvoid AeoliaPCIeDevice::bar0_write(U64 addr, U64 value, U64 size) {\n\n assert_always(\"Unimplemented\");\n\n}\n\n\n\nU64 AeoliaPCIeDevice::bar2_read(U64 addr, U64 size) {\n\n U64 value = 0;\n\n switch (addr) {\n\n case APCIE_RTC_STATUS:\n\n value = 0\n\n | APCIE_RTC_STATUS__BATTERY_OK\n\n | APCIE_RTC_STATUS__CLOCK_OK;\n\n break;\n\n case 0x210:\n\n value = 0x18080; /* check 0xFFFFFFFF82833286 @ 5.00 */\n\n break;\n\n case APCIE_CHIP_ID0:\n\n value = 0x41B30130;\n\n break;\n","file_path":"src/orbital/hardware/aeolia/aeolia_pcie.cpp","rank":62,"score":15.942134007623423},{"content":" // TODO\n\n}\n\n\n\nU64 AeoliaHpet::mmio_read(U64 addr, U64 size) {\n\n U64 value = 0;\n\n\n\n // Sanity checks\n\n assert_true(size == 4);\n\n\n\n if (addr < 0x100) {\n\n /* General access */\n\n switch (addr) {\n\n case HPET_REG_CAP + 0:\n\n value = s.cap.value_lo;\n\n break;\n\n case HPET_REG_CAP + 4:\n\n value = s.cap.value_hi;\n\n break;\n\n case HPET_REG_CFG + 0:\n\n value = s.config.value;\n","file_path":"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp","rank":63,"score":15.851602920029741},{"content":" break;\n\n default:\n\n assert_always(\"Unimplemented\");\n\n }\n\n\n\n return value;\n\n}\n\n\n\nvoid SamDevice::mmio_write(U32 index, U32 value) {\n\n switch (index) {\n\n case mmSAM_IX_INDEX:\n\n ix_index = value;\n\n break;\n\n case mmSAM_IX_DATA:\n\n switch (ix_index) {\n\n case ixSAM_IH_CPU_AM32_INT:\n\n handle_request(value);\n\n break;\n\n case ixSAM_IH_CPU_AM32_INT_CTX_HIGH:\n\n ih_cpu_am32_int_ctx_high = value;\n","file_path":"src/orbital/hardware/liverpool/sam/sam.cpp","rank":64,"score":15.820750029780257},{"content":" switch (index) {\n\n case mmCP_RB0_BASE:\n\n cp_rb[0].base = U64(value) << 8;\n\n break;\n\n case mmCP_RB1_BASE:\n\n cp_rb[1].base = U64(value) << 8;\n\n break;\n\n case mmCP_RB0_CNTL:\n\n cp_rb[0].cntl = value;\n\n break;\n\n case mmCP_RB1_CNTL:\n\n cp_rb[1].cntl = value;\n\n break;\n\n case mmCP_RB0_RPTR:\n\n cp_rb[0].rptr = value;\n\n break;\n\n case mmCP_RB1_RPTR:\n\n cp_rb[1].rptr = value;\n\n break;\n\n case mmCP_RB0_WPTR:\n","file_path":"src/orbital/hardware/liverpool/gca/gfx.cpp","rank":65,"score":15.729147611557407},{"content":" break;\n\n default:\n\n assert_always(\"Unknown register\");\n\n }\n\n\n\ndone:\n\n return value;\n\n}\n\n\n\nvoid AeoliaUARTDevice::io_write(U64 addr, U64 rawval, U64 size) {\n\n U8 diff;\n\n U8 value = static_cast<U8>(rawval);\n\n\n\n // Sanity checks\n\n assert_true(size == 1);\n\n assert_true(addr < 0x8);\n\n\n\n if (s.lcr & LCR_DLAB) {\n\n switch (addr) {\n\n case UART_REG_DLL:\n","file_path":"src/orbital/hardware/aeolia/uart/aeolia_uart.cpp","rank":66,"score":15.714308015566692},{"content":" if (e.type == SDL_WINDOWEVENT || e.window.windowID == SDL_GetWindowID(window)) {\n\n switch (e.window.event) {\n\n case SDL_WINDOWEVENT_CLOSE:\n\n is_quitting = true;\n\n return;\n\n case SDL_WINDOWEVENT_MINIMIZED:\n\n is_minimized = false;\n\n break;\n\n case SDL_WINDOWEVENT_MAXIMIZED:\n\n is_minimized = false;\n\n break;\n\n case SDL_WINDOWEVENT_EXPOSED:\n\n is_resized = true;\n\n break;\n\n case SDL_WINDOWEVENT_RESIZED:\n\n w = static_cast<int>(e.window.data1);\n\n h = static_cast<int>(e.window.data2);\n\n is_resized = true;\n\n break;\n\n }\n","file_path":"src/orbital/ui.cpp","rank":67,"score":15.711647235222888},{"content":"}\n\n\n\nvoid LiverpoolHDACDevice::reset() {\n\n // PCI Configuration Space\n\n auto& header = config_header();\n\n header.command = PCI_COMMAND_MEMORY; // TODO: Is this needed?\n\n header.header_type |= PCI_HEADER_TYPE_MULTI_FUNCTION;\n\n header.intr_line = 0xFF;\n\n header.intr_pin = 0x02;\n\n msi_enable(1, true);\n\n}\n\n\n\nU64 LiverpoolHDACDevice::mmio_read(U64 addr, U64 size) {\n\n U64 value = 0;\n\n\n\n switch (addr) {\n\n case HDAC_UNK08:\n\n value = 0;\n\n break;\n\n case HDAC_UNK68:\n","file_path":"src/orbital/hardware/liverpool/liverpool_hdac.cpp","rank":68,"score":15.58802685965836},{"content":" case APCIE_CHIP_ID1:\n\n value = 0x52024D44;\n\n break;\n\n case APCIE_CHIP_REV:\n\n value = 0x00000300;\n\n break;\n\n default:\n\n assert_always(\"Unimplemented\");\n\n }\n\n return value;\n\n}\n\n\n\nvoid AeoliaPCIeDevice::bar2_write(U64 addr, U64 value, U64 size) {\n\n assert_always(\"Unimplemented\");\n\n}\n\n\n\nU64 AeoliaPCIeDevice::peripherals_read(U64 addr, U64 size) {\n\n U64 value = 0;\n\n\n\n switch (addr) {\n","file_path":"src/orbital/hardware/aeolia/aeolia_pcie.cpp","rank":69,"score":15.582563148009939},{"content":" const U32 vmid = 8 + index - mmVM_CONTEXT8_PAGE_TABLE_BASE_ADDR;\n\n return vm_contexts[vmid].base >> 12;\n\n }\n\n\n\n U32 value = 0;\n\n switch (index) {\n\n // VM\n\n case mmVM_INVALIDATE_RESPONSE:\n\n value = vm_invalidate_response;\n\n break;\n\n\n\n // MC\n\n case mmMC_BIST_MISMATCH_ADDR:\n\n value = mc_bist_mismatch_addr;\n\n break;\n\n\n\n default:\n\n //assert_always(\"Unimplemented\");\n\n break;\n\n }\n","file_path":"src/orbital/hardware/liverpool/gmc/gmc.cpp","rank":70,"score":14.960976664085884},{"content":" cp_handle_pm4_type0(cp, pm4.type0);\n\n break;\n\n case PM4_PACKET_TYPE1:\n\n cp_handle_pm4_type1(cp, pm4.type1);\n\n break;\n\n case PM4_PACKET_TYPE2:\n\n cp_handle_pm4_type2(cp, pm4.type2);\n\n break;\n\n case PM4_PACKET_TYPE3:\n\n cp_handle_pm4_type3(cp, pm4.type3);\n\n break;\n\n }\n\n}\n\n\n\nvoid GfxDevice::cp_handle_pm4_type0(CpBuffer& cp, PM4Packet::Type0 p) {\n\n const auto size = p.count + 1;\n\n const auto data = cp_read(cp, size);\n\n\n\n U32 index = p.reg;\n\n for (auto reg : data) {\n","file_path":"src/orbital/hardware/liverpool/gca/gfx.cpp","rank":71,"score":14.795237271497497},{"content":" value = 0;\n\n break;\n\n default:\n\n assert_always(\"Unimplemented\");\n\n // TODO: Previous implementation was memory-like.\n\n }\n\n return value;\n\n}\n\n\n\nvoid LiverpoolHDACDevice::mmio_write(U64 addr, U64 value, U64 size) {\n\n switch (addr) {\n\n case HDAC_UNK08:\n\n break;\n\n default:\n\n assert_always(\"Unimplemented\");\n\n // TODO: Previous implementation was memory-like.\n\n }\n\n}\n","file_path":"src/orbital/hardware/liverpool/liverpool_hdac.cpp","rank":72,"score":14.743410537169472},{"content":"\n\n // Determine ELF-type at runtime\n\n switch (e_ident[EI_CLASS]) {\n\n case ELFCLASS32:\n\n switch (e_ident[EI_DATA]) {\n\n case ELFDATA2LSB:\n\n type = ElfType::LE_32;\n\n break;\n\n case ELFDATA2MSB:\n\n type = ElfType::BE_32;\n\n break;\n\n default:\n\n throw std::runtime_error(\"Unimplemented\");\n\n }\n\n break;\n\n case ELFCLASS64:\n\n switch (e_ident[EI_DATA]) {\n\n case ELFDATA2LSB:\n\n type = ElfType::LE_64;\n\n break;\n","file_path":"src/orbital/software/elf.cpp","rank":73,"score":14.654789293084036},{"content":" case CPUBreakpoint::Prot::RWX:\n\n return \"RWX\";\n\n default:\n\n return \"---\";\n\n }\n\n}\n\n\n\nstatic const char* bp_type(CPUBreakpoint::Type type) {\n\n switch (type) {\n\n case CPUBreakpoint::Type::HW:\n\n return \"HW\";\n\n case CPUBreakpoint::Type::SW:\n\n return \"SW\";\n\n case CPUBreakpoint::Type::HV:\n\n return \"HV\";\n\n default:\n\n return \"Auto\";\n\n }\n\n}\n\n\n","file_path":"src/orbital/ui/tab_cpu.cpp","rank":74,"score":14.434372431440945},{"content":"/**\n\n * PUP format.\n\n *\n\n * Copyright 2017-2021. Orbital project.\n\n * Released under MIT license. Read LICENSE for more details.\n\n *\n\n * Authors:\n\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\n\n */\n\n\n\n#include \"pup.h\"\n\n#include <orbital/crypto_ps4.h>\n\n\n\n#include <zlib.h>\n\n\n\n#include <stdexcept>\n\n\n\nconstexpr U32 PUP_MAGIC = 0x1D3D154F;\n\n\n","file_path":"src/orbital/software/pup.cpp","rank":75,"score":14.421966548927236},{"content":" case 0xC0107074:\n\n case 0xC0107078:\n\n case 0xC010707C:\n\n case 0xC0107080:\n\n case 0xC0107084:\n\n break;\n\n\n\n // Unknown EFUSE registers (Kernel)\n\n case 0xC0104068:\n\n break;\n\n\n\n default:\n\n assert_always(\"Unimplemented\");\n\n break;\n\n }\n\n\n\n return value;\n\n}\n\n\n\nvoid SmuDevice::smc_write(U32 index, U32 value) {\n","file_path":"src/orbital/hardware/liverpool/smu/smu.cpp","rank":76,"score":14.421290924910322},{"content":" value = data_lo[data_lo_index];\n\n }\n\n }\n\n return value;\n\n}\n\n\n\nvoid AeoliaMsic::mmio_write(U32 offset, U32 value) {\n\n U32 data_lo_index;\n\n\n\n switch (offset) {\n\n // Handle global control/status\n\n case REG_MSI_CONTROL:\n\n case REG_MSI_UNK004:\n\n case REG_MSI_UNK008:\n\n break;\n\n\n\n // Handle regular function-specific registers\n\n CASE_FUNCS(W, ADDR, func_addr);\n\n CASE_FUNCS(W, MASK, func_mask);\n\n CASE_FUNCS(W, DATA, func_data);\n","file_path":"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp","rank":77,"score":14.257850766096562},{"content":"}\n\n\n\nvoid AeoliaPCIeDevice::peripherals_write(U64 addr, U64 value, U64 size) {\n\n switch (addr) {\n\n case APCIE_ICC_REG_DOORBELL:\n\n icc_doorbell |= value;\n\n update_icc();\n\n break;\n\n case APCIE_ICC_REG_STATUS:\n\n icc_status &= ~value;\n\n break;\n\n case APCIE_ICC_REG_UNK820:\n\n case APCIE_ICC_REG_IRQ_MASK:\n\n fprintf(stderr, \"AeoliaPCIeDevice::peripherals_write: addr=0x%llX, value=0x%llX, size=0x%llX\\n\", addr, value, size);\n\n break;\n\n default:\n\n if (range_wdt.contains(addr)) {\n\n assert_always(\"Unimplemented\");\n\n }\n\n else if (range_unk1.contains(addr)) {\n","file_path":"src/orbital/hardware/aeolia/aeolia_pcie.cpp","rank":79,"score":14.103989836098757},{"content":"void SamDevice::reset() {\n\n gpr.fill(0);\n\n ih_cpu_am32_int_ctx = 0;\n\n ih_cpu_am32_int_status = 0;\n\n ih_am32_cpu_int_ctx = 0;\n\n\n\n ix_data.fill(0);\n\n sab_ix_data.fill(0);\n\n}\n\n\n\nU32 SamDevice::mmio_read(U32 index) {\n\n U32 value = 0;\n\n\n\n switch (index) {\n\n case mmSAM_IX_INDEX:\n\n value = ix_index;\n\n break;\n\n case mmSAM_IX_DATA:\n\n switch (ix_index) {\n\n case ixSAM_IH_CPU_AM32_INT_CTX_HIGH:\n","file_path":"src/orbital/hardware/liverpool/sam/sam.cpp","rank":80,"score":14.019935192519963},{"content":" const auto& state = c->state();\n\n const auto& space = c->space();\n\n\n\n // Read stack contents\n\n Buffer buf(0x100);\n\n const auto rsp = state.get_linear_rsp();\n\n try {\n\n space->read(rsp, buf.size(), buf.data());\n\n } catch (std::runtime_error& e) {\n\n g_error(\"Error: {}\", e.what());\n\n return;\n\n }\n\n\n\n // Adjust stack view width\n\n switch (c->mode()) {\n\n case X86CPUMode::REAL:\n\n case X86CPUMode::PROTECTED:\n\n case X86CPUMode::LONG_COMPATIBILITY:\n\n me_stack.Cols = 4;\n\n break;\n","file_path":"src/orbital/ui/tab_cpu.cpp","rank":81,"score":13.713127535275113},{"content":"/**\n\n * BLS format.\n\n *\n\n * Copyright 2017-2021. Orbital project.\n\n * Released under MIT license. Read LICENSE for more details.\n\n *\n\n * Authors:\n\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\n\n */\n\n\n\n#include \"bls.h\"\n\n\n\n#include <stdexcept>\n\n\n\nconstexpr U32 BLS_MAGIC = '2BLS';\n\nconstexpr U64 BLS_BLOCK = 0x200;\n\n\n\nU64 BlsStream::read(U64 size, void* buffer) {\n\n std::unique_lock<std::mutex> lock(bls->mtx);\n\n Stream& s = bls->s;\n","file_path":"src/orbital/software/bls.cpp","rank":83,"score":13.660183767635491},{"content":"#include \"smu/smu.h\"\n\n\n\n#include <array>\n\n#include <memory>\n\n\n\nconstexpr auto LIVERPOOL_GC_DEV = 0x1;\n\nconstexpr auto LIVERPOOL_GC_FNC = 0x0;\n\nconstexpr auto LIVERPOOL_GC_VID = static_cast<PCIVendorId>(0x1002);\n\nconstexpr auto LIVERPOOL_GC_DID = static_cast<PCIDeviceId>(0x9920);\n\n\n","file_path":"src/orbital/hardware/liverpool/liverpool_gc.h","rank":84,"score":13.641520557605553},{"content":"#include <string>\n\n\n\nstatic std::string cpu_name(size_t index) {\n\n return \"CPU #\" + std::to_string(index);\n\n}\n\n\n\nstatic const char* bp_prot(CPUBreakpoint::Prot prot) {\n\n switch (prot) {\n\n case CPUBreakpoint::Prot::R:\n\n return \"R--\";\n\n case CPUBreakpoint::Prot::W:\n\n return \"-W-\";\n\n case CPUBreakpoint::Prot::X:\n\n return \"--X\";\n\n case CPUBreakpoint::Prot::RW:\n\n return \"RW-\";\n\n case CPUBreakpoint::Prot::RX:\n\n return \"R-X\";\n\n case CPUBreakpoint::Prot::WX:\n\n return \"-WX\";\n","file_path":"src/orbital/ui/tab_cpu.cpp","rank":85,"score":13.578977648530632},{"content":" value = 0; // TODO\n\n break;\n\n case mmCP_HQD_ACTIVE:\n\n value = 0; // TODO\n\n break;\n\n\n\n // Ignored access\n\n case mmCP_MEM_SLP_CNTL:\n\n case mmCP_IQ_WAIT_TIME1:\n\n break;\n\n\n\n default:\n\n //assert_always(\"Unimplemented\");\n\n break;\n\n }\n\n\n\n return value;\n\n}\n\n\n\nvoid GfxDevice::mmio_write(U32 index, U32 value) {\n","file_path":"src/orbital/hardware/liverpool/gca/gfx.cpp","rank":86,"score":13.532558738875471},{"content":" value = 0xBD;\n\n break;\n\n case AGBE_DEVICE_REV:\n\n assert(size == 1);\n\n value = 0x00; // TODO\n\n break;\n\n case AGBE_UNK2880:\n\n assert(size == 2);\n\n value = 0x10; // TODO\n\n break;\n\n }\n\n return value;\n\n}\n\n\n\nvoid AeoliaGBEDevice::mmio_write(U64 addr, U64 value, U64 size) {\n\n assert_always(\"Unimplemented\");\n\n}\n","file_path":"src/orbital/hardware/aeolia/aeolia_gbe.cpp","rank":87,"score":13.442715173722865},{"content":"/**\n\n * AMD PM4 packets.\n\n *\n\n * Copyright 2017-2021. Orbital project.\n\n * Released under MIT license. Read LICENSE for more details.\n\n *\n\n * Authors:\n\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\n\n */\n\n\n\n#include \"pm4.h\"\n\n\n\nconst char* pm4_itop_name(U32 itop) {\n\n#define CASE(itop) case PM4_IT_##itop: return #itop\n\n switch (itop) {\n\n CASE(NOP);\n\n CASE(SET_BASE);\n\n CASE(CLEAR_STATE);\n\n CASE(INDEX_BUFFER_SIZE);\n\n CASE(DISPATCH_DIRECT);\n","file_path":"src/orbital/hardware/liverpool/gca/pm4.cpp","rank":88,"score":13.344752807146818},{"content":" U32 data_lo_index;\n\n U32 value;\n\n\n\n value = 0;\n\n switch (offset) {\n\n // Handle global control/status\n\n case REG_MSI_CONTROL:\n\n case REG_MSI_UNK004:\n\n case REG_MSI_UNK008:\n\n break;\n\n\n\n // Handle regular function-specific registers\n\n CASE_FUNCS(R, ADDR, func_addr);\n\n CASE_FUNCS(R, MASK, func_mask);\n\n CASE_FUNCS(R, DATA, func_data);\n\n\n\n // Handle irregular function-specific registers\n\n default:\n\n data_lo_index = (offset - REG_MSI_FNC0_DATA_LO(0)) >> 2;\n\n if (data_lo_index < 48) {\n","file_path":"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp","rank":89,"score":13.26402099402677},{"content":" mmio_write(index++, reg);\n\n }\n\n}\n\n\n\nvoid GfxDevice::cp_handle_pm4_type1(CpBuffer& cp, PM4Packet::Type1 p) {\n\n assert_always(\"Unsupported packet type\");\n\n}\n\n\n\nvoid GfxDevice::cp_handle_pm4_type2(CpBuffer& cp, PM4Packet::Type2 p) {\n\n assert_always(\"Unsupported packet type\");\n\n}\n\n\n\nvoid GfxDevice::cp_handle_pm4_type3(CpBuffer& cp, PM4Packet::Type3 p) {\n\n const auto rptr_old = cp.rptr;\n\n\n\n switch (p.itop) {\n\n case PM4_IT_INDIRECT_BUFFER_CONST:\n\n cp_handle_pm4_it_indirect_buffer_const(cp);\n\n break;\n\n case PM4_IT_INDIRECT_BUFFER:\n","file_path":"src/orbital/hardware/liverpool/gca/gfx.cpp","rank":90,"score":13.195346836515228},{"content":" cp_handle_pm4_it_indirect_buffer(cp);\n\n break;\n\n case PM4_IT_SET_CONFIG_REG:\n\n case PM4_IT_SET_CONTEXT_REG:\n\n case PM4_IT_SET_SH_REG:\n\n case PM4_IT_SET_UCONFIG_REG:\n\n cp_handle_pm4_it_set_reg(cp, p);\n\n break;\n\n\n\n // Ignored commands\n\n case PM4_IT_PREAMBLE_CNTL:\n\n case PM4_IT_CONTEXT_CONTROL:\n\n case PM4_IT_CLEAR_STATE:\n\n case PM4_IT_SET_BASE:\n\n break;\n\n#if 0\n\n case PM4_IT_DRAW_INDEX_AUTO:\n\n cp_handle_pm4_it_draw_index_auto(s, vmid, packet);\n\n break;\n\n case PM4_IT_EVENT_WRITE_EOP:\n","file_path":"src/orbital/hardware/liverpool/gca/gfx.cpp","rank":91,"score":13.06823571010183},{"content":"}\n\n\n\nvoid GfxDevice::cp_read(CpBuffer& cp, U32* dwords, U32 count) {\n\n auto vm = gmc.get(cp.vmid);\n\n auto va = cp.base | cp.rptr;\n\n const auto size = count * sizeof(U32);\n\n vm.read(va, size, dwords);\n\n cp.rptr += size;\n\n}\n\n\n\nstd::vector<U32> GfxDevice::cp_read(CpBuffer& cp, U32 count) {\n\n std::vector<U32> dwords(count);\n\n cp_read(cp, dwords.data(), dwords.size());\n\n return dwords;\n\n}\n\n\n\nvoid GfxDevice::cp_handle_pm4(CpBuffer& cp) {\n\n auto pm4 = cp_read<PM4Packet>(cp);\n\n switch (pm4.type) {\n\n case PM4_PACKET_TYPE0:\n","file_path":"src/orbital/hardware/liverpool/gca/gfx.cpp","rank":92,"score":13.059170751965308},{"content":" switch (offset) {\n\n case D0F0xBC:\n\n assert(size == 4);\n\n smc_ix = (U32&)config_data[D0F0xB8];\n\n value = smu->smc_read(smc_ix);\n\n break;\n\n default:\n\n value = PCIDevice::config_read(offset, size);\n\n }\n\n\n\n return value;\n\n}\n","file_path":"src/orbital/hardware/liverpool/liverpool_rc.cpp","rank":93,"score":12.888455928611155},{"content":" break;\n\n case 4:\n\n assert(sub < 24);\n\n data |= func4_data_lo[sub];\n\n break;\n\n case 5:\n\n assert(sub < 2);\n\n data |= func5_data_lo[sub];\n\n break;\n\n case 6:\n\n assert(sub < 2);\n\n data |= func6_data_lo[sub];\n\n break;\n\n case 7:\n\n assert(sub < 4);\n\n data |= func7_data_lo[sub];\n\n break;\n\n default:\n\n fprintf(stderr, \"%s: Function #%u out of range!\", __FUNCTION__, func);\n\n return;\n\n }\n\n mem->write<U32>(func_addr[func], data);\n\n}\n","file_path":"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp","rank":94,"score":12.825965770662467},{"content":" case 0x619:\n\n case 0x61B:\n\n case 0x3BD3:\n\n case 0x3BD4:\n\n case 0x3BD5:\n\n break;\n\n\n\n default:\n\n DPRINTF(\"index=0x%llX, size=0x%llX\", index, size);\n\n assert_always(\"Unimplemented\");\n\n value = mmio[index];\n\n }\n\n\n\n return value;\n\n}\n\n\n\nvoid LiverpoolGCDevice::mmio_write(U64 addr, U64 value, U64 size) {\n\n U64 index = addr >> 2;\n\n U64 index_ix = 0;\n\n\n","file_path":"src/orbital/hardware/liverpool/liverpool_gc.cpp","rank":95,"score":12.743228126634138},{"content":" ImGui::Text(\"DCP%d\", i);\n\n ImGui::NextColumn();\n\n }\n\n ImGui::Separator();\n\n for (const auto& attr : dcp_attrs) {\n\n ImGui::Text(\"%s\", attr.name);\n\n ImGui::NextColumn();\n\n for (int i = 0; i < DCP_COUNT; i++) {\n\n int mm_index = attr.mmio_indices[i];\n\n snprintf(tag, sizeof(tag), \"##dcp%d_%s\", i, attr.name);\n\n switch (attr.type) {\n\n case ATTR_U32_DEC:\n\n ImGui::PushItemWidth(-1);\n\n ImGui::InputScalar(tag, ImGuiDataType_U32, &mmio[mm_index], &u32_one, NULL, \"%d\",\n\n ImGuiInputTextFlags_CharsDecimal |\n\n ImGuiInputTextFlags_ReadOnly);\n\n ImGui::PopItemWidth();\n\n break;\n\n case ATTR_U32_HEX:\n\n ImGui::PushItemWidth(-1);\n","file_path":"src/orbital/ui/tab_gpu.cpp","rank":96,"score":12.728347672521194},{"content":" // General access\n\n switch (addr) {\n\n case HPET_REG_CNT + 0:\n\n s.counter.lo = value;\n\n break;\n\n case HPET_REG_CNT + 4:\n\n s.counter.hi = value;\n\n break;\n\n case HPET_REG_CFG + 0:\n\n s.config.value = value;\n\n break;\n\n case HPET_REG_IS + 0:\n\n value &= s.isr.value_lo;\n\n for (int i = 0; i < timers.size(); i++) {\n\n if (value & (1 << i)) {\n\n update_irq(timers[i], i);\n\n }\n\n }\n\n break;\n\n\n","file_path":"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp","rank":97,"score":12.670608287724466},{"content":" const auto& crypto = ps4Crypto();\n\n\n\n // Get target segment\n\n const PupSegmentEntry& entry = segEntries[index];\n\n const PupSegmentMeta& meta = segMetas[index];\n\n const auto block_size = entry.block_size();\n\n const auto block_count = entry.block_count();\n\n\n\n // Get information segment\n\n const auto info_index = find_info(index);\n\n const PupSegmentEntry& info_entry = segEntries[info_index];\n\n const PupSegmentMeta& info_meta = segMetas[info_index];\n\n\n\n // Read and process information segment data\n\n Buffer info_buffer(info_entry.file_size);\n\n s.seek(info_entry.offset, StreamSeek::Set);\n\n s.read(info_buffer.size(), info_buffer.data());\n\n if (info_entry.is_encrypted()) {\n\n decrypt(info_buffer, info_meta);\n\n }\n","file_path":"src/orbital/software/pup.cpp","rank":98,"score":12.576344674880698},{"content":" // Add PCIe capability\n\n // TODO: Refactor this code\n\n const auto cap_off = add_capability(PCI_CAP_ID_EXP, 0x14 /* V1 */);\n\n (U16&)config_data[cap_off + 2 /*PCI_EXP_FLAGS*/ ] = 0x0001;\n\n (U32&)config_data[cap_off + 4 /*PCI_EXP_DEVCAP*/] = 0;\n\n (U16&)config_data[cap_off + 8 /*PCI_EXP_DEVCTL*/] = 0;\n\n (U16&)config_data[cap_off + 10 /*PCI_EXP_DEVSTA*/] = 0;\n\n (U32&)config_data[cap_off + 12 /*PCI_EXP_LNKCAP*/] = 0;\n\n (U16&)config_data[cap_off + 16 /*PCI_EXP_LNKCTL*/] = 0;\n\n (U16&)config_data[cap_off + 18 /*PCI_EXP_LNKSTA*/] = 0;\n\n}\n\n\n\nU64 AeoliaGBEDevice::mmio_read(U64 addr, U64 size) {\n\n U64 value = 0;\n\n assert_always(\"Unimplemented\");\n\n\n\n DPRINTF(\"addr=0x%llX, size=0x%llX\\n\", addr, size);\n\n switch (addr) {\n\n case AGBE_DEVICE_ID:\n\n assert(size == 1);\n","file_path":"src/orbital/hardware/aeolia/aeolia_gbe.cpp","rank":99,"score":12.509224652278615}],"string":"[\n {\n \"content\": \"struct Key {\\n\\n enum Type {\\n\\n NONE,\\n\\n AES_128_EBC,\\n\\n AES_128_CBC,\\n\\n } type;\\n\\n\\n\\n Botan::SymmetricKey key;\\n\\n Botan::InitializationVector iv;\\n\\n\\n\\n Key() : type(NONE) {}\\n\\n Key(Type type, const void* key_buf, size_t key_len, const void* iv_buf, size_t iv_len)\\n\\n : type(type), key((const U8*)key_buf, key_len), iv((const U8*)iv_buf, iv_len) {\\n\\n }\\n\\n Key(Type type, std::string_view key, std::string_view iv)\\n\\n : type(type), key(std::string(key)), iv(std::string(iv)) {\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 2,\n \"score\": 126619.02313683904\n },\n {\n \"content\": \"const Crypto& ps4Crypto();\\n\",\n \"file_path\": \"src/orbital/crypto_ps4.h\",\n \"rank\": 4,\n \"score\": 91847.0847283303\n },\n {\n \"content\": \"struct OffsetRange {\\n\\n uint64_t base;\\n\\n uint64_t size;\\n\\n\\n\\n constexpr OffsetRange(uint64_t base, uint64_t size)\\n\\n : base(base), size(size) {\\n\\n }\\n\\n constexpr bool contains(uint64_t off) const noexcept {\\n\\n return (base <= off) && (off < base + size);\\n\\n }\\n\",\n \"file_path\": \"src/orbital/offset_range.h\",\n \"rank\": 5,\n \"score\": 81730.7374976328\n },\n {\n \"content\": \"class Crypto : public CryptoVault {\\n\\npublic:\\n\\n /**\\n\\n * Decrypt typed data with specified key.\\n\\n * @tparam T Type of the data to decrypt\\n\\n * @param[in] value Typed value to decrypt\\n\\n * @param[in] key Unique identifier of key in vault\\n\\n */\\n\\n template <typename T>\\n\\n T decrypt(const T& value, std::string_view key) const {\\n\\n return decrypt<T>(value, get(key));\\n\\n }\\n\\n\\n\\n /**\\n\\n * Read and decrypt typed data with specified key.\\n\\n * @tparam T Type of the data to decrypt\\n\\n * @param[in] s Stream to read encrypted typed data from\\n\\n * @param[in] key Unique identifier of key in vault\\n\\n */\\n\\n template <typename T>\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 6,\n \"score\": 80792.43718746952\n },\n {\n \"content\": \" uint8_t key[0x10];\\n\",\n \"file_path\": \"tools/dumper/source/ksdk_sbl.h\",\n \"rank\": 7,\n \"score\": 80662.50707856947\n },\n {\n \"content\": \" Bitrange<U64, 0, 16> offset;\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/pm4.h\",\n \"rank\": 8,\n \"score\": 79656.17924586838\n },\n {\n \"content\": \"struct AeoliaNVS {\\n\\n union {\\n\\n U08 data[0x400];\\n\\n union {\\n\\n // [0x9B330, 0x9B34F]\\n\\n NVS_RANGE(0x000, 0x20) OsBootParameter;\\n\\n // [0x9B350, 0x9B38F]\\n\\n NVS_RANGE(0x000, 0x40) LsiBootParameter;\\n\\n // [0x9B390, 0x9B48F]\\n\\n NVS_RANGE(0x300, 0x100) BiosConfig;\\n\\n // [0x9B6E4, 0x9B743]\\n\\n NVS_RANGE(0x200, 0x60) EapPartitionKey;\\n\\n // 0x9B6DD\\n\\n NVS_RANGE(0x065, 0x1) CsBackupMode;\\n\\n // 0x9B6DE\\n\\n NVS_RANGE(0x0C0, 0x2) TempSlewRate;\\n\\n };\\n\\n };\\n\\n\\n\\n AeoliaNVS() {\\n\\n memset(data, 0, sizeof(data));\\n\\n\\n\\n OsBootParameter.data[0x18] = 2; // sceKernelHwHasWlanBt second bit as 1 for none\\n\\n BiosConfig.data[0] = 0xF0; // verbose ubios boot\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/nvs/aeolia_nvs.h\",\n \"rank\": 9,\n \"score\": 78718.43502368708\n },\n {\n \"content\": \"struct SelfInfo {\\n\\n LE<U64> paid; // Program Authority ID\\n\\n LE<U64> ptype; // Program Type\\n\\n LE<U64> version_app; // Application Version\\n\\n LE<U64> version_fw; // Firmware Version\\n\\n U08 digest[0x20];\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/software/self.h\",\n \"rank\": 10,\n \"score\": 75479.71197644131\n },\n {\n \"content\": \"enum PupEndian {\\n\\n LITTLE = 1,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/software/pup.cpp\",\n \"rank\": 11,\n \"score\": 74316.43692397267\n },\n {\n \"content\": \"enum PupFlags {\\n\\n JIG = 1,\\n\\n};\\n\\n\\n\\n// PUP parser\\n\\nPupParser::PupParser(Stream& s, bool verify) : CfParser(s) {\\n\\n Buffer buffer;\\n\\n const auto& crypto = ps4Crypto();\\n\\n\\n\\n // Read and verify PUP header\\n\\n s.seek(0, StreamSeek::Set);\\n\\n header = s.read_t<PupHeader>();\\n\\n assert(header.magic == PUP_MAGIC);\\n\\n assert(header.version == 0);\\n\\n assert(header.mode == 1);\\n\\n assert(header.endian == PupEndian::LITTLE);\\n\\n assert(header.attr == 0x12);\\n\\n\\n\\n // Discard unsupported flags\\n\\n assert((header.flags & PupFlags::JIG) == 0, \\\"Unsupported JIG flag\\\");\\n\",\n \"file_path\": \"src/orbital/software/pup.cpp\",\n \"rank\": 12,\n \"score\": 74316.43692397267\n },\n {\n \"content\": \"enum VulkanManagerMode {\\n\\n VULKAN_MANAGER_CREATE,\\n\\n VULKAN_MANAGER_REUSE,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/host/graphics/vulkan.h\",\n \"rank\": 13,\n \"score\": 73211.84188991266\n },\n {\n \"content\": \"enum HPETGeneralReg {\\n\\n HPET_REG_CAP = 0x00,\\n\\n HPET_REG_CFG = 0x10,\\n\\n HPET_REG_IS = 0x20,\\n\\n HPET_REG_CNT = 0xF0,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp\",\n \"rank\": 14,\n \"score\": 70201.4872298204\n },\n {\n \"content\": \"enum HPETTimerReg {\\n\\n HPET_REG_TNCFG_0 = 0x00,\\n\\n HPET_REG_TNCFG_1 = 0x04,\\n\\n HPET_REG_TNCMP_0 = 0x08,\\n\\n HPET_REG_TNCMP_1 = 0x0C,\\n\\n HPET_REG_TNROUTE_0 = 0x10,\\n\\n HPET_REG_TNROUTE_1 = 0x14,\\n\\n};\\n\\n\\n\\nAeoliaHpet::AeoliaHpet(ContainerSpace* mem, const AeoliaHpetConfig& config)\\n\\n : Device(nullptr, config), mem(mem) {\\n\\n // Initialize MMIO\\n\\n mmio = new MemorySpace(this, 0x1000, {\\n\\n static_cast<MemorySpaceReadOp>(&AeoliaHpet::mmio_read),\\n\\n static_cast<MemorySpaceWriteOp>(&AeoliaHpet::mmio_write),\\n\\n });\\n\\n mem->addSubspace(mmio, config.base);\\n\\n\\n\\n // Create timers\\n\\n assert_true(config.count >= 3);\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp\",\n \"rank\": 15,\n \"score\": 70201.4872298204\n },\n {\n \"content\": \"// ELF conversion\\n\\nenum class ElfType {\\n\\n LE_32,\\n\\n BE_32,\\n\\n LE_64,\\n\\n BE_64,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/software/elf.h\",\n \"rank\": 16,\n \"score\": 68951.77951778917\n },\n {\n \"content\": \"class CryptoVault {\\n\\n std::map<std::string, Key> keys;\\n\\n\\n\\npublic:\\n\\n /**\\n\\n * Add named key to the vault.\\n\\n * @param[in] name Unique key identifier\\n\\n * @param[in] key Key data\\n\\n */\\n\\n void add(std::string_view name, Key key) {\\n\\n std::string k(name);\\n\\n keys[k] = key;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Get key by name.\\n\\n * @param[in] name Unique key identifier\\n\\n */\\n\\n const Key& get(std::string_view name) const {\\n\\n std::string k(name);\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 17,\n \"score\": 57439.591720265824\n },\n {\n \"content\": \"class CryptoStream : public Stream {\\n\\n Stream& s;\\n\\n Key key;\\n\\n\\n\\npublic:\\n\\n CryptoStream(Stream& s, const Key& key) : s(s), key(key) {}\\n\\n\\n\\n // Interface\\n\\n virtual U64 read(U64 size, void* buffer) override;\\n\\n virtual U64 write(U64 size, const void* buffer) override;\\n\\n virtual void seek(U64 offset, StreamSeek mode) override;\\n\\n virtual U64 tell() const override;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 18,\n \"score\": 55646.1962063667\n },\n {\n \"content\": \" * @param[in] key Decryption key\\n\\n */\\n\\n static void decrypt(const void* input_buf, size_t input_len,\\n\\n void* output_buf, size_t output_len, Key key);\\n\\n\\n\\n /**\\n\\n * Decrypt buffer with specified key.\\n\\n */\\n\\n static Buffer decrypt(const Buffer& buffer, Key key);\\n\\n\\n\\n /**\\n\\n * Decrypt stream with specified key.\\n\\n */\\n\\n static CryptoStream decrypt(Stream& s, Key key);\\n\\n};\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 19,\n \"score\": 49958.49752462618\n },\n {\n \"content\": \" T decrypt(Stream& s, std::string_view key) const {\\n\\n return decrypt<T>(s, get(key));\\n\\n }\\n\\n\\n\\n // Static methods\\n\\n\\n\\n /**\\n\\n * Decrypt typed data with specified key.\\n\\n */\\n\\n template <typename T>\\n\\n static T decrypt(const T& value, Key key) {\\n\\n T output = {};\\n\\n decrypt(&value, sizeof(T), &output, sizeof(T), key);\\n\\n return output;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Read and decrypt typed data with specified key.\\n\\n */\\n\\n template <typename T>\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 20,\n \"score\": 49954.61093128656\n },\n {\n \"content\": \" static T decrypt(Stream& s, Key key) {\\n\\n T output = s.read_t<T>();\\n\\n decrypt(&output, sizeof(T), key);\\n\\n return output;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Decrypt buffer in-place with specified key.\\n\\n * @param[in,out] buf Pointer to input/output data\\n\\n * @param[in,out] len Input/Output length in bytes\\n\\n * @param[in] key Decryption key\\n\\n */\\n\\n static void decrypt(void* buf, size_t len, Key key);\\n\\n\\n\\n /**\\n\\n * Decrypt buffer with specified key.\\n\\n * @param[in] input_buf Pointer to input data\\n\\n * @param[in] input_len Input length in bytes\\n\\n * @param[out] output_buf Pointer to output data\\n\\n * @param[out] output_len Output length in bytes\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 21,\n \"score\": 49953.88725728598\n },\n {\n \"content\": \" return keys.at(k);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Remove key by name.\\n\\n * @param[in] name Unique key identifier\\n\\n */\\n\\n void remove(std::string_view name) {\\n\\n std::string k(name);\\n\\n keys.erase(k);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Number of keys in the vault.\\n\\n */\\n\\n size_t size() const {\\n\\n return keys.size();\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 22,\n \"score\": 49950.87753506528\n },\n {\n \"content\": \"/**\\n\\n * Cryptography.\\n\\n *\\n\\n * Copyright 2017-2021. Orbital project.\\n\\n * Released under MIT license. Read LICENSE for more details.\\n\\n *\\n\\n * Authors:\\n\\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\\n\\n */\\n\\n \\n\\n#pragma once\\n\\n\\n\\n#include <orbital/core.h>\\n\\n\\n\\n#include <botan/botan.h>\\n\\n\\n\\n#include <filesystem>\\n\\n#include <string>\\n\\n#include <string_view>\\n\\n#include <unordered_map>\\n\\n\\n\",\n \"file_path\": \"src/orbital/crypto.h\",\n \"rank\": 23,\n \"score\": 49950.66583054152\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid CryptoStream::seek(U64 offset, StreamSeek mode) {\\n\\n s.seek(offset, mode);\\n\\n}\\n\\n\\n\\nU64 CryptoStream::tell() const {\\n\\n return s.tell();\\n\\n}\\n\\n\\n\\nvoid Crypto::decrypt(void* buf, size_t len, Key key) {\\n\\n Crypto::decrypt(buf, len, buf, len, key);\\n\\n}\\n\\n\\n\\nvoid Crypto::decrypt(const void* input_buf, size_t input_len,\\n\\n void* output_buf, size_t output_len, Key key) {\\n\\n const char* algo;\\n\\n switch (key.type) {\\n\\n case Key::AES_128_EBC:\\n\\n algo = \\\"AES-128/EBC\\\";\\n\",\n \"file_path\": \"src/orbital/crypto.cpp\",\n \"rank\": 24,\n \"score\": 48602.41007807528\n },\n {\n \"content\": \"/**\\n\\n * Cryptography.\\n\\n *\\n\\n * Copyright 2017-2021. Orbital project.\\n\\n * Released under MIT license. Read LICENSE for more details.\\n\\n *\\n\\n * Authors:\\n\\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\\n\\n */\\n\\n\\n\\n#include \\\"crypto.h\\\"\\n\\n\\n\\n#include <stdexcept>\\n\\n\\n\\nU64 CryptoStream::read(U64 size, void* buffer) {\\n\\n return 0;\\n\\n}\\n\\n\\n\\nU64 CryptoStream::write(U64 size, const void* buffer) {\\n\\n return 0;\\n\",\n \"file_path\": \"src/orbital/crypto.cpp\",\n \"rank\": 25,\n \"score\": 48600.801010046096\n },\n {\n \"content\": \" break;\\n\\n case Key::AES_128_CBC:\\n\\n algo = \\\"AES-128/CBC/CTS\\\";\\n\\n break;\\n\\n default:\\n\\n throw std::invalid_argument(\\\"Unrecognized key type\\\");\\n\\n }\\n\\n auto cipher = Botan::get_cipher(algo, key.key, key.iv, Botan::Cipher_Dir::DECRYPTION);\\n\\n Botan::Pipe pipe(cipher);\\n\\n pipe.start_msg();\\n\\n pipe.write((const uint8_t*)input_buf, input_len);\\n\\n pipe.end_msg();\\n\\n pipe.read((uint8_t*)output_buf, output_len);\\n\\n}\\n\\n\\n\\nBuffer Crypto::decrypt(const Buffer& buffer, Key key) {\\n\\n Buffer output(buffer.size());\\n\\n decrypt(buffer.data(), buffer.size(), output.data(), output.size(), key);\\n\\n return output;\\n\\n}\\n\\n\\n\\nCryptoStream Crypto::decrypt(Stream& s, Key key) {\\n\\n return CryptoStream(s, key);\\n\\n}\\n\",\n \"file_path\": \"src/orbital/crypto.cpp\",\n \"rank\": 26,\n \"score\": 48600.59428595044\n },\n {\n \"content\": \"/**\\n\\n * PS4 cryptography.\\n\\n *\\n\\n * Copyright 2017-2021. Orbital project.\\n\\n * Released under MIT license. Read LICENSE for more details.\\n\\n *\\n\\n * Authors:\\n\\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\\n\\n */\\n\\n\\n\\n#include \\\"crypto.h\\\"\\n\\n\\n\\n#include <rapidjson/document.h>\\n\\n#include <rapidjson/istreamwrapper.h>\\n\\n\\n\\n#include <fstream>\\n\\n#include <stdexcept>\\n\\n\\n\\nstatic Crypto g_ps4Crypto;\\n\\n\\n\",\n \"file_path\": \"src/orbital/crypto_ps4.cpp\",\n \"rank\": 27,\n \"score\": 47311.02203661777\n },\n {\n \"content\": \"static Key parseAesKey(Key::Type type, const rapidjson::Value& value) {\\n\\n auto key = value[\\\"aes_key\\\"].GetString();\\n\\n auto iv = value[\\\"aes_iv\\\"].GetString();\\n\\n return Key(type, key, iv);\\n\\n}\\n\\n\\n\\nconst Crypto& ps4Crypto() {\\n\\n if (g_ps4Crypto.size() > 0) {\\n\\n return g_ps4Crypto;\\n\\n }\\n\\n\\n\\n // Parse keys from hardcoded file\\n\\n std::ifstream ifs(\\\"crypto/keys.json\\\");\\n\\n rapidjson::IStreamWrapper isw(ifs);\\n\\n rapidjson::Document document;\\n\\n document.ParseStream(isw);\\n\\n\\n\\n // Add individual keys\\n\\n g_ps4Crypto.add(\\\"pup.hdr\\\",\\n\\n parseAesKey(Key::AES_128_CBC, document[\\\"pup\\\"][\\\"hdr\\\"]));\\n\",\n \"file_path\": \"src/orbital/crypto_ps4.cpp\",\n \"rank\": 28,\n \"score\": 47310.68383057247\n },\n {\n \"content\": \" g_ps4Crypto.add(\\\"pup.root_key\\\",\\n\\n parseAesKey(Key::AES_128_CBC, document[\\\"pup\\\"][\\\"root_key\\\"]));\\n\\n\\n\\n for (const auto& m : document[\\\"self\\\"][\\\"80010002\\\"].GetObject()) {\\n\\n std::string name = \\\"self.80010002.\\\";\\n\\n g_ps4Crypto.add(name + m.name.GetString(), parseAesKey(Key::AES_128_CBC, m.value));\\n\\n }\\n\\n\\n\\n return g_ps4Crypto;\\n\\n}\\n\",\n \"file_path\": \"src/orbital/crypto_ps4.cpp\",\n \"rank\": 29,\n \"score\": 47307.66440379626\n },\n {\n \"content\": \"\\tElf64_Xword\\tr_info;\\t\\t/* Relocation type and symbol index. */\\n\",\n \"file_path\": \"tools/dumper/source/elf64.h\",\n \"rank\": 30,\n \"score\": 43803.05591974685\n },\n {\n \"content\": \"\\tElf64_Xword \\tm_info;\\t\\t/* size + index */\\n\",\n \"file_path\": \"tools/dumper/source/elf64.h\",\n \"rank\": 31,\n \"score\": 43803.05591974685\n },\n {\n \"content\": \"\\tElf32_Word\\tr_info;\\t\\t/* Relocation type and symbol index. */\\n\",\n \"file_path\": \"tools/dumper/source/elf32.h\",\n \"rank\": 32,\n \"score\": 43803.05591974685\n },\n {\n \"content\": \"\\tElf32_Word \\tm_info;\\t\\t/* size + index */\\n\",\n \"file_path\": \"tools/dumper/source/elf32.h\",\n \"rank\": 33,\n \"score\": 43803.05591974685\n },\n {\n \"content\": \"\\tunsigned char\\tst_info;\\t/* Type and binding information. */\\n\",\n \"file_path\": \"tools/dumper/source/elf32.h\",\n \"rank\": 34,\n \"score\": 42752.226785497165\n },\n {\n \"content\": \"\\tunsigned char\\tst_info;\\t/* Type and binding information. */\\n\",\n \"file_path\": \"tools/dumper/source/elf64.h\",\n \"rank\": 35,\n \"score\": 42752.226785497165\n },\n {\n \"content\": \"\\tElf32_Word\\tsh_info;\\t/* Depends on section type. */\\n\",\n \"file_path\": \"tools/dumper/source/elf32.h\",\n \"rank\": 36,\n \"score\": 42752.226785497165\n },\n {\n \"content\": \"\\tElf64_Word\\tsh_info;\\t/* Depends on section type. */\\n\",\n \"file_path\": \"tools/dumper/source/elf64.h\",\n \"rank\": 37,\n \"score\": 42752.226785497165\n },\n {\n \"content\": \" uint32_t key_type;\\n\",\n \"file_path\": \"tools/dumper/source/self_decrypter.h\",\n \"rank\": 38,\n \"score\": 41792.59279867457\n },\n {\n \"content\": \" uint32_t key_id;\\n\",\n \"file_path\": \"tools/dumper/source/ksdk_sbl.h\",\n \"rank\": 39,\n \"score\": 41792.59279867457\n },\n {\n \"content\": \" struct self_auth_info_t auth_info;\\n\",\n \"file_path\": \"tools/dumper/source/self_decrypter.h\",\n \"rank\": 40,\n \"score\": 41750.63494108576\n },\n {\n \"content\": \"#define SELF_KEY_SIZE 0x10\\n\",\n \"file_path\": \"tools/dumper/source/self_decrypter.c\",\n \"rank\": 41,\n \"score\": 40835.89641388528\n },\n {\n \"content\": \"#ifndef SELF_DECRYPTER_H\\n\\n#define SELF_DECRYPTER_H\\n\\n\\n\\n#include \\\"ksdk.h\\\"\\n\\n\\n\\n#include \\\"elf32.h\\\"\\n\\n#include \\\"elf64.h\\\"\\n\\n\\n\\n// Format\\n\\ntypedef struct self_entry_t {\\n\\n uint32_t props;\\n\\n uint32_t reserved;\\n\\n uint64_t offset;\\n\\n uint64_t filesz;\\n\\n uint64_t memsz;\\n\\n} self_entry_t;\\n\\n\\n\\ntypedef struct self_header_t {\\n\\n uint32_t magic;\\n\\n uint8_t version;\\n\\n uint8_t mode;\\n\\n uint8_t endian;\\n\\n uint8_t attr;\\n\\n uint32_t key_type;\\n\\n uint16_t header_size;\\n\\n uint16_t meta_size;\\n\\n uint64_t file_size;\\n\\n uint16_t num_entries;\\n\\n uint16_t flags;\\n\\n uint32_t reserved;\\n\\n self_entry_t entries[0];\\n\\n} self_header_t;\\n\\n\\n\\n// Context\\n\\nstruct self_auth_info_t {\\n\\n uint8_t buf[0x88];\\n\\n};\\n\\n\\n\\ntypedef struct self_t {\\n\\n int fd;\\n\\n char *file_path;\\n\\n size_t file_size;\\n\\n size_t entries_size;\\n\\n size_t data_offset;\\n\\n size_t data_size;\\n\\n /* contents */\\n\\n struct self_header_t header;\\n\\n struct self_entry_t *entries;\\n\\n uint8_t *data;\\n\\n /* kernel */\\n\\n struct self_auth_info_t auth_info;\\n\\n struct self_context_t *ctx;\\n\\n int auth_ctx_id;\\n\\n int ctx_id;\\n\\n int svc_id;\\n\\n int verified;\\n\\n /* blobs */\\n\\n struct blob_t *blobs;\\n\\n} self_t;\\n\\n\\n\\n/* functions */\\n\\nself_t* self_open(const char *file);\\n\\nint self_verify_header(self_t *self);\\n\\nint self_load_segments(self_t *self);\\n\\nvoid self_close(self_t *self);\\n\\n\\n\",\n \"file_path\": \"tools/dumper/source/self_decrypter.h\",\n \"rank\": 42,\n \"score\": 40794.89903584515\n },\n {\n \"content\": \" uint64_t auth_info_addr;\\n\",\n \"file_path\": \"tools/dumper/source/ksdk_sbl.h\",\n \"rank\": 43,\n \"score\": 40794.89903584515\n },\n {\n \"content\": \"#define SELF_AUTH_INFO_SIZE 0x88\\n\",\n \"file_path\": \"tools/dumper/source/self_decrypter.c\",\n \"rank\": 44,\n \"score\": 39881.94040727142\n },\n {\n \"content\": \"static void self_get_block_info(self_t *self, unsigned int target_entry_idx, self_block_info_t *info)\\n\\n{\\n\\n struct self_entry_t* table_segment;\\n\\n struct self_entry_t* target_segment;\\n\\n struct self_block_extent_t* extents;\\n\\n const uint8_t* segment_data;\\n\\n unsigned int target_num_blocks;\\n\\n unsigned int i;\\n\\n\\n\\n memset(&info->digest, 0, sizeof(info->digest));\\n\\n memset(&info->extent, 0, sizeof(info->extent));\\n\\n\\n\\n for (i = 0; i < self->header.num_entries; ++i) {\\n\\n table_segment = &self->entries[i];\\n\\n if (!EXTRACT(table_segment->props, SELF_PROPS_HAS_DIGESTS) &&\\n\\n !EXTRACT(table_segment->props, SELF_PROPS_HAS_EXTENTS))\\n\\n continue;\\n\\n if (EXTRACT(table_segment->props, SELF_PROPS_SEGMENT_INDEX) != target_entry_idx)\\n\\n continue;\\n\\n\\n\\n target_segment = &self->entries[target_entry_idx];\\n\\n target_num_blocks = (target_segment->memsz + (info->size - 1)) / info->size;\\n\\n segment_data = &self->data[table_segment->offset];\\n\\n if (EXTRACT(table_segment->props, SELF_PROPS_HAS_DIGESTS)) {\\n\\n memcpy(&info->digest, &segment_data[info->index * sizeof(info->digest)], sizeof(info->digest));\\n\\n }\\n\\n if (EXTRACT(table_segment->props, SELF_PROPS_HAS_EXTENTS)) {\\n\\n if (EXTRACT(table_segment->props, SELF_PROPS_HAS_DIGESTS))\\n\\n extents = (void*)(&segment_data[target_num_blocks * sizeof(info->digest)]);\\n\\n else\\n\\n extents = (void*)(&segment_data[0]);\\n\\n memcpy(&info->extent, &extents[info->index], sizeof(info->extent));\\n\\n }\\n\\n return;\\n\\n }\\n\",\n \"file_path\": \"tools/dumper/source/self_decrypter.c\",\n \"rank\": 45,\n \"score\": 39881.94040727142\n },\n {\n \"content\": \"#define CCP_FLAG_SLOT_KEY 0x40000\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/sam/ccp.h\",\n \"rank\": 46,\n \"score\": 39048.1525174442\n },\n {\n \"content\": \" static void* EndianessCopyLittleEndian(void* _dst, void* _src, size_t s, int is_little_endian)\\n\\n {\\n\\n if (is_little_endian)\\n\\n {\\n\\n return memcpy(_dst, _src, s);\\n\\n }\\n\\n else\\n\\n {\\n\\n uint8_t* dst = (uint8_t*)_dst;\\n\\n uint8_t* src = (uint8_t*)_src + s - 1;\\n\\n for (int i = 0, n = (int)s; i < n; ++i)\\n\\n memcpy(dst++, src--, 1);\\n\\n return _dst;\\n\\n }\\n\",\n \"file_path\": \"src/orbital/ui/imgui/widgets/imgui_memory_editor.h\",\n \"rank\": 47,\n \"score\": 37428.14614714086\n },\n {\n \"content\": \"struct ImGui_ImplVulkan_InitInfo\\n\\n{\\n\\n VkInstance Instance;\\n\\n VkPhysicalDevice PhysicalDevice;\\n\\n VkDevice Device;\\n\\n uint32_t QueueFamily;\\n\\n VkQueue Queue;\\n\\n VkPipelineCache PipelineCache;\\n\\n VkDescriptorPool DescriptorPool;\\n\\n uint32_t Subpass;\\n\\n uint32_t MinImageCount; // >= 2\\n\\n uint32_t ImageCount; // >= MinImageCount\\n\\n VkSampleCountFlagBits MSAASamples; // >= VK_SAMPLE_COUNT_1_BIT\\n\\n const VkAllocationCallbacks* Allocator;\\n\\n void (*CheckVkResultFn)(VkResult err);\\n\",\n \"file_path\": \"src/orbital/ui/imgui/imgui_impl_vulkan.h\",\n \"rank\": 48,\n \"score\": 36605.158631800165\n },\n {\n \"content\": \"class CfParser {\\n\\nprotected:\\n\\n Stream& s;\\n\\n\\n\\npublic:\\n\\n CfParser(Stream& s) : s(s) {}\\n\\n\\n\\n static void decrypt(Buffer& data, const CfMeta& meta);\\n\\n};\\n\",\n \"file_path\": \"src/orbital/software/cf.h\",\n \"rank\": 49,\n \"score\": 29402.72158890154\n },\n {\n \"content\": \"class SelfParser : public CfParser {\\n\\n SelfHeader header;\\n\\n SelfInfo info;\\n\\n std::vector<SelfSegment> segments;\\n\\n std::vector<SelfMeta> metas;\\n\\n std::unique_ptr<ElfParser> elf;\\n\\n\\n\\npublic:\\n\\n SelfParser(Stream& s);\\n\\n ~SelfParser();\\n\\n\\n\\n // ELF parser interface\\n\\n Elf_Ehdr<> get_ehdr();\\n\\n\\n\\n Elf_Phdr<> get_phdr(size_t i);\\n\\n\\n\\n Buffer get_pdata(size_t i);\\n\\n\\n\\nprivate:\\n\\n /**\\n\",\n \"file_path\": \"src/orbital/software/self.h\",\n \"rank\": 50,\n \"score\": 20322.18115527322\n },\n {\n \"content\": \"class PupParser : public CfParser {\\n\\n PupHeader header;\\n\\n PupHeaderEx headerEx;\\n\\n std::vector<PupSegmentEntry> segEntries;\\n\\n std::vector<PupSegmentMeta> segMetas;\\n\\n\\n\\npublic:\\n\\n /**\\n\\n * Create PUP parser. \\n\\n * @param[in] verify Verify digital signatures.\\n\\n */\\n\\n PupParser(Stream& s, bool verify=false);\\n\\n ~PupParser();\\n\\n\\n\\n /**\\n\\n * Get PUP segment by identifier.\\n\\n * @param[in] id Segment identifier (44-bits).\\n\\n */\\n\\n Buffer get(U64 id);\\n\\n\\n\",\n \"file_path\": \"src/orbital/software/pup.h\",\n \"rank\": 51,\n \"score\": 20322.18115527322\n },\n {\n \"content\": \" }\\n\\n }\\n\\n else {\\n\\n /* Timer-N access */\\n\\n const U64 index = (addr - 0x100) / 0x20;\\n\\n const U64 offset = addr % 0x20;\\n\\n assert_true(index < timers.size());\\n\\n const auto& timer = timers[index];\\n\\n\\n\\n switch (offset) {\\n\\n case HPET_REG_TNCFG_0:\\n\\n value = timer.config.value_lo;\\n\\n break;\\n\\n case HPET_REG_TNCFG_1:\\n\\n value = timer.config.value_hi;\\n\\n break;\\n\\n case HPET_REG_TNCMP_0:\\n\\n value = timer.comparator;\\n\\n break;\\n\\n case HPET_REG_TNCMP_1:\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp\",\n \"rank\": 52,\n \"score\": 17.800756468411777\n },\n {\n \"content\": \" value = timer.comparator >> 32;\\n\\n break;\\n\\n case HPET_REG_TNROUTE_0:\\n\\n value = timer.fsb.int_val;\\n\\n break;\\n\\n case HPET_REG_TNROUTE_1:\\n\\n value = timer.fsb.int_addr;\\n\\n break;\\n\\n default:\\n\\n assert_always(\\\"Invalid register access\\\");\\n\\n }\\n\\n }\\n\\n return static_cast<U32>(value);\\n\\n}\\n\\n\\n\\nvoid AeoliaHpet::mmio_write(U64 addr, U64 value, U64 size) {\\n\\n // Sanity checks\\n\\n assert_true(size == 4);\\n\\n\\n\\n if (addr < 0x100) {\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp\",\n \"rank\": 53,\n \"score\": 17.755988829271743\n },\n {\n \"content\": \" // Ignored accesses\\n\\n case HPET_REG_CAP + 0:\\n\\n break;\\n\\n\\n\\n default:\\n\\n assert_always(\\\"Invalid register access\\\");\\n\\n }\\n\\n }\\n\\n else {\\n\\n // Timer-N access\\n\\n const U64 index = (addr - 0x100) / 0x20;\\n\\n const U64 offset = addr % 0x20;\\n\\n assert_true(index < timers.size());\\n\\n auto& tn = timers[index];\\n\\n\\n\\n switch (offset) {\\n\\n case HPET_REG_TNCFG_0:\\n\\n tn.config.value_lo = value;\\n\\n break;\\n\\n case HPET_REG_TNROUTE_0:\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp\",\n \"rank\": 54,\n \"score\": 17.38329099349554\n },\n {\n \"content\": \"U32 SmuDevice::mmio_read(U32 index) {\\n\\n U32 value = 0;\\n\\n\\n\\n switch (index) {\\n\\n case mmSMC_IND_INDEX:\\n\\n value = smc_ix;\\n\\n break;\\n\\n case mmSMC_IND_DATA:\\n\\n value = smc_read(smc_ix);\\n\\n break;\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n }\\n\\n\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid SmuDevice::mmio_write(U32 index, U32 value) {\\n\\n switch (index) {\\n\\n case mmSMC_IND_INDEX:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/smu/smu.cpp\",\n \"rank\": 55,\n \"score\": 16.834625942029366\n },\n {\n \"content\": \" s.seek(base + offset, StreamSeek::Set);\\n\\n size = std::min<U32>(size, this->size - offset);\\n\\n\\n\\n U64 nbytes = s.read(size, buffer);\\n\\n offset += nbytes;\\n\\n return nbytes;\\n\\n}\\n\\n\\n\\nU64 BlsStream::write(U64 size, const void* buffer) {\\n\\n throw std::runtime_error(\\\"Unsupported method\\\");\\n\\n}\\n\\n\\n\\nvoid BlsStream::seek(U64 offset, StreamSeek mode) {\\n\\n switch (mode) {\\n\\n case StreamSeek::Set:\\n\\n this->offset = offset;\\n\\n break;\\n\\n case StreamSeek::Cur:\\n\\n this->offset += offset;\\n\\n break;\\n\",\n \"file_path\": \"src/orbital/software/bls.cpp\",\n \"rank\": 56,\n \"score\": 16.790604910472105\n },\n {\n \"content\": \" smc_ix = value;\\n\\n break;\\n\\n case mmSMC_IND_DATA:\\n\\n smc_write(smc_ix, value);\\n\\n break;\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n }\\n\\n}\\n\\n\\n\\nU32 SmuDevice::smc_read(U32 index) {\\n\\n U32 value = 0;\\n\\n\\n\\n switch (index) {\\n\\n // Clocks\\n\\n case ixCG_SCLK_STATUS:\\n\\n value = 0x1;\\n\\n break;\\n\\n case ixCG_LCLK_STATUS:\\n\\n value = 0x1;\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/smu/smu.cpp\",\n \"rank\": 57,\n \"score\": 16.228077502766517\n },\n {\n \"content\": \" (U32&)config_mask[0xE4] = ~0xFF;\\n\\n}\\n\\n\\n\\nvoid LiverpoolRCDevice::config_write(U32 offset, U64 value, size_t size) {\\n\\n U32 smc_ix;\\n\\n switch (offset) {\\n\\n case D0F0xBC:\\n\\n assert(size == 4);\\n\\n smc_ix = (U32&)config_data[D0F0xB8];\\n\\n smu->smc_write(smc_ix, value);\\n\\n break;\\n\\n default:\\n\\n PCIDevice::config_write(offset, value, size);\\n\\n }\\n\\n}\\n\\n\\n\\nU64 LiverpoolRCDevice::config_read(U32 offset, size_t size) {\\n\\n U64 value = 0;\\n\\n\\n\\n U32 smc_ix;\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/liverpool_rc.cpp\",\n \"rank\": 58,\n \"score\": 16.14756881677502\n },\n {\n \"content\": \" return;\\n\\n }\\n\\n\\n\\n auto data = func_data[func];\\n\\n switch (func) {\\n\\n case 0:\\n\\n assert(sub < 4);\\n\\n data |= func0_data_lo[sub];\\n\\n break;\\n\\n case 1:\\n\\n assert(sub < 4);\\n\\n data |= func1_data_lo[sub];\\n\\n break;\\n\\n case 2:\\n\\n assert(sub < 4);\\n\\n data |= func2_data_lo[sub];\\n\\n break;\\n\\n case 3:\\n\\n assert(sub < 4);\\n\\n data |= func3_data_lo[sub];\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp\",\n \"rank\": 59,\n \"score\": 16.031932182851097\n },\n {\n \"content\": \" advfault_cntl = 0;\\n\\n}\\n\\n\\n\\nU32 IhDevice::mmio_read(U32 index) {\\n\\n U32 value = 0;\\n\\n\\n\\n switch (index) {\\n\\n case mmIH_RB_BASE:\\n\\n value = rb_base;\\n\\n break;\\n\\n case mmIH_RB_WPTR:\\n\\n value = rb_wptr;\\n\\n break;\\n\\n case mmIH_RB_WPTR_ADDR_LO:\\n\\n value = rb_wptr_addr_lo;\\n\\n break;\\n\\n case mmIH_RB_WPTR_ADDR_HI:\\n\\n value = rb_wptr_addr_hi;\\n\\n break;\\n\\n case mmIH_STATUS:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/oss/ih.cpp\",\n \"rank\": 60,\n \"score\": 16.01304746288052\n },\n {\n \"content\": \" value = status;\\n\\n break;\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n }\\n\\n\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid IhDevice::mmio_write(U32 index, U32 value) {\\n\\n switch (index) {\\n\\n case mmIH_RB_CNTL:\\n\\n rb_cntl = value;\\n\\n break;\\n\\n case mmIH_RB_BASE:\\n\\n rb_base = value;\\n\\n break;\\n\\n case mmIH_RB_WPTR:\\n\\n rb_wptr = value;\\n\\n break;\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/oss/ih.cpp\",\n \"rank\": 61,\n \"score\": 16.005481664149414\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid AeoliaPCIeDevice::bar0_write(U64 addr, U64 value, U64 size) {\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n}\\n\\n\\n\\nU64 AeoliaPCIeDevice::bar2_read(U64 addr, U64 size) {\\n\\n U64 value = 0;\\n\\n switch (addr) {\\n\\n case APCIE_RTC_STATUS:\\n\\n value = 0\\n\\n | APCIE_RTC_STATUS__BATTERY_OK\\n\\n | APCIE_RTC_STATUS__CLOCK_OK;\\n\\n break;\\n\\n case 0x210:\\n\\n value = 0x18080; /* check 0xFFFFFFFF82833286 @ 5.00 */\\n\\n break;\\n\\n case APCIE_CHIP_ID0:\\n\\n value = 0x41B30130;\\n\\n break;\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/aeolia_pcie.cpp\",\n \"rank\": 62,\n \"score\": 15.942134007623423\n },\n {\n \"content\": \" // TODO\\n\\n}\\n\\n\\n\\nU64 AeoliaHpet::mmio_read(U64 addr, U64 size) {\\n\\n U64 value = 0;\\n\\n\\n\\n // Sanity checks\\n\\n assert_true(size == 4);\\n\\n\\n\\n if (addr < 0x100) {\\n\\n /* General access */\\n\\n switch (addr) {\\n\\n case HPET_REG_CAP + 0:\\n\\n value = s.cap.value_lo;\\n\\n break;\\n\\n case HPET_REG_CAP + 4:\\n\\n value = s.cap.value_hi;\\n\\n break;\\n\\n case HPET_REG_CFG + 0:\\n\\n value = s.config.value;\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp\",\n \"rank\": 63,\n \"score\": 15.851602920029741\n },\n {\n \"content\": \" break;\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n }\\n\\n\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid SamDevice::mmio_write(U32 index, U32 value) {\\n\\n switch (index) {\\n\\n case mmSAM_IX_INDEX:\\n\\n ix_index = value;\\n\\n break;\\n\\n case mmSAM_IX_DATA:\\n\\n switch (ix_index) {\\n\\n case ixSAM_IH_CPU_AM32_INT:\\n\\n handle_request(value);\\n\\n break;\\n\\n case ixSAM_IH_CPU_AM32_INT_CTX_HIGH:\\n\\n ih_cpu_am32_int_ctx_high = value;\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/sam/sam.cpp\",\n \"rank\": 64,\n \"score\": 15.820750029780257\n },\n {\n \"content\": \" switch (index) {\\n\\n case mmCP_RB0_BASE:\\n\\n cp_rb[0].base = U64(value) << 8;\\n\\n break;\\n\\n case mmCP_RB1_BASE:\\n\\n cp_rb[1].base = U64(value) << 8;\\n\\n break;\\n\\n case mmCP_RB0_CNTL:\\n\\n cp_rb[0].cntl = value;\\n\\n break;\\n\\n case mmCP_RB1_CNTL:\\n\\n cp_rb[1].cntl = value;\\n\\n break;\\n\\n case mmCP_RB0_RPTR:\\n\\n cp_rb[0].rptr = value;\\n\\n break;\\n\\n case mmCP_RB1_RPTR:\\n\\n cp_rb[1].rptr = value;\\n\\n break;\\n\\n case mmCP_RB0_WPTR:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/gfx.cpp\",\n \"rank\": 65,\n \"score\": 15.729147611557407\n },\n {\n \"content\": \" break;\\n\\n default:\\n\\n assert_always(\\\"Unknown register\\\");\\n\\n }\\n\\n\\n\\ndone:\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid AeoliaUARTDevice::io_write(U64 addr, U64 rawval, U64 size) {\\n\\n U8 diff;\\n\\n U8 value = static_cast<U8>(rawval);\\n\\n\\n\\n // Sanity checks\\n\\n assert_true(size == 1);\\n\\n assert_true(addr < 0x8);\\n\\n\\n\\n if (s.lcr & LCR_DLAB) {\\n\\n switch (addr) {\\n\\n case UART_REG_DLL:\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/uart/aeolia_uart.cpp\",\n \"rank\": 66,\n \"score\": 15.714308015566692\n },\n {\n \"content\": \" if (e.type == SDL_WINDOWEVENT || e.window.windowID == SDL_GetWindowID(window)) {\\n\\n switch (e.window.event) {\\n\\n case SDL_WINDOWEVENT_CLOSE:\\n\\n is_quitting = true;\\n\\n return;\\n\\n case SDL_WINDOWEVENT_MINIMIZED:\\n\\n is_minimized = false;\\n\\n break;\\n\\n case SDL_WINDOWEVENT_MAXIMIZED:\\n\\n is_minimized = false;\\n\\n break;\\n\\n case SDL_WINDOWEVENT_EXPOSED:\\n\\n is_resized = true;\\n\\n break;\\n\\n case SDL_WINDOWEVENT_RESIZED:\\n\\n w = static_cast<int>(e.window.data1);\\n\\n h = static_cast<int>(e.window.data2);\\n\\n is_resized = true;\\n\\n break;\\n\\n }\\n\",\n \"file_path\": \"src/orbital/ui.cpp\",\n \"rank\": 67,\n \"score\": 15.711647235222888\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid LiverpoolHDACDevice::reset() {\\n\\n // PCI Configuration Space\\n\\n auto& header = config_header();\\n\\n header.command = PCI_COMMAND_MEMORY; // TODO: Is this needed?\\n\\n header.header_type |= PCI_HEADER_TYPE_MULTI_FUNCTION;\\n\\n header.intr_line = 0xFF;\\n\\n header.intr_pin = 0x02;\\n\\n msi_enable(1, true);\\n\\n}\\n\\n\\n\\nU64 LiverpoolHDACDevice::mmio_read(U64 addr, U64 size) {\\n\\n U64 value = 0;\\n\\n\\n\\n switch (addr) {\\n\\n case HDAC_UNK08:\\n\\n value = 0;\\n\\n break;\\n\\n case HDAC_UNK68:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/liverpool_hdac.cpp\",\n \"rank\": 68,\n \"score\": 15.58802685965836\n },\n {\n \"content\": \" case APCIE_CHIP_ID1:\\n\\n value = 0x52024D44;\\n\\n break;\\n\\n case APCIE_CHIP_REV:\\n\\n value = 0x00000300;\\n\\n break;\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n }\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid AeoliaPCIeDevice::bar2_write(U64 addr, U64 value, U64 size) {\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n}\\n\\n\\n\\nU64 AeoliaPCIeDevice::peripherals_read(U64 addr, U64 size) {\\n\\n U64 value = 0;\\n\\n\\n\\n switch (addr) {\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/aeolia_pcie.cpp\",\n \"rank\": 69,\n \"score\": 15.582563148009939\n },\n {\n \"content\": \" const U32 vmid = 8 + index - mmVM_CONTEXT8_PAGE_TABLE_BASE_ADDR;\\n\\n return vm_contexts[vmid].base >> 12;\\n\\n }\\n\\n\\n\\n U32 value = 0;\\n\\n switch (index) {\\n\\n // VM\\n\\n case mmVM_INVALIDATE_RESPONSE:\\n\\n value = vm_invalidate_response;\\n\\n break;\\n\\n\\n\\n // MC\\n\\n case mmMC_BIST_MISMATCH_ADDR:\\n\\n value = mc_bist_mismatch_addr;\\n\\n break;\\n\\n\\n\\n default:\\n\\n //assert_always(\\\"Unimplemented\\\");\\n\\n break;\\n\\n }\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gmc/gmc.cpp\",\n \"rank\": 70,\n \"score\": 14.960976664085884\n },\n {\n \"content\": \" cp_handle_pm4_type0(cp, pm4.type0);\\n\\n break;\\n\\n case PM4_PACKET_TYPE1:\\n\\n cp_handle_pm4_type1(cp, pm4.type1);\\n\\n break;\\n\\n case PM4_PACKET_TYPE2:\\n\\n cp_handle_pm4_type2(cp, pm4.type2);\\n\\n break;\\n\\n case PM4_PACKET_TYPE3:\\n\\n cp_handle_pm4_type3(cp, pm4.type3);\\n\\n break;\\n\\n }\\n\\n}\\n\\n\\n\\nvoid GfxDevice::cp_handle_pm4_type0(CpBuffer& cp, PM4Packet::Type0 p) {\\n\\n const auto size = p.count + 1;\\n\\n const auto data = cp_read(cp, size);\\n\\n\\n\\n U32 index = p.reg;\\n\\n for (auto reg : data) {\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/gfx.cpp\",\n \"rank\": 71,\n \"score\": 14.795237271497497\n },\n {\n \"content\": \" value = 0;\\n\\n break;\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n // TODO: Previous implementation was memory-like.\\n\\n }\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid LiverpoolHDACDevice::mmio_write(U64 addr, U64 value, U64 size) {\\n\\n switch (addr) {\\n\\n case HDAC_UNK08:\\n\\n break;\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n // TODO: Previous implementation was memory-like.\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/liverpool_hdac.cpp\",\n \"rank\": 72,\n \"score\": 14.743410537169472\n },\n {\n \"content\": \"\\n\\n // Determine ELF-type at runtime\\n\\n switch (e_ident[EI_CLASS]) {\\n\\n case ELFCLASS32:\\n\\n switch (e_ident[EI_DATA]) {\\n\\n case ELFDATA2LSB:\\n\\n type = ElfType::LE_32;\\n\\n break;\\n\\n case ELFDATA2MSB:\\n\\n type = ElfType::BE_32;\\n\\n break;\\n\\n default:\\n\\n throw std::runtime_error(\\\"Unimplemented\\\");\\n\\n }\\n\\n break;\\n\\n case ELFCLASS64:\\n\\n switch (e_ident[EI_DATA]) {\\n\\n case ELFDATA2LSB:\\n\\n type = ElfType::LE_64;\\n\\n break;\\n\",\n \"file_path\": \"src/orbital/software/elf.cpp\",\n \"rank\": 73,\n \"score\": 14.654789293084036\n },\n {\n \"content\": \" case CPUBreakpoint::Prot::RWX:\\n\\n return \\\"RWX\\\";\\n\\n default:\\n\\n return \\\"---\\\";\\n\\n }\\n\\n}\\n\\n\\n\\nstatic const char* bp_type(CPUBreakpoint::Type type) {\\n\\n switch (type) {\\n\\n case CPUBreakpoint::Type::HW:\\n\\n return \\\"HW\\\";\\n\\n case CPUBreakpoint::Type::SW:\\n\\n return \\\"SW\\\";\\n\\n case CPUBreakpoint::Type::HV:\\n\\n return \\\"HV\\\";\\n\\n default:\\n\\n return \\\"Auto\\\";\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/orbital/ui/tab_cpu.cpp\",\n \"rank\": 74,\n \"score\": 14.434372431440945\n },\n {\n \"content\": \"/**\\n\\n * PUP format.\\n\\n *\\n\\n * Copyright 2017-2021. Orbital project.\\n\\n * Released under MIT license. Read LICENSE for more details.\\n\\n *\\n\\n * Authors:\\n\\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\\n\\n */\\n\\n\\n\\n#include \\\"pup.h\\\"\\n\\n#include <orbital/crypto_ps4.h>\\n\\n\\n\\n#include <zlib.h>\\n\\n\\n\\n#include <stdexcept>\\n\\n\\n\\nconstexpr U32 PUP_MAGIC = 0x1D3D154F;\\n\\n\\n\",\n \"file_path\": \"src/orbital/software/pup.cpp\",\n \"rank\": 75,\n \"score\": 14.421966548927236\n },\n {\n \"content\": \" case 0xC0107074:\\n\\n case 0xC0107078:\\n\\n case 0xC010707C:\\n\\n case 0xC0107080:\\n\\n case 0xC0107084:\\n\\n break;\\n\\n\\n\\n // Unknown EFUSE registers (Kernel)\\n\\n case 0xC0104068:\\n\\n break;\\n\\n\\n\\n default:\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n break;\\n\\n }\\n\\n\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid SmuDevice::smc_write(U32 index, U32 value) {\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/smu/smu.cpp\",\n \"rank\": 76,\n \"score\": 14.421290924910322\n },\n {\n \"content\": \" value = data_lo[data_lo_index];\\n\\n }\\n\\n }\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid AeoliaMsic::mmio_write(U32 offset, U32 value) {\\n\\n U32 data_lo_index;\\n\\n\\n\\n switch (offset) {\\n\\n // Handle global control/status\\n\\n case REG_MSI_CONTROL:\\n\\n case REG_MSI_UNK004:\\n\\n case REG_MSI_UNK008:\\n\\n break;\\n\\n\\n\\n // Handle regular function-specific registers\\n\\n CASE_FUNCS(W, ADDR, func_addr);\\n\\n CASE_FUNCS(W, MASK, func_mask);\\n\\n CASE_FUNCS(W, DATA, func_data);\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp\",\n \"rank\": 77,\n \"score\": 14.257850766096562\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid AeoliaPCIeDevice::peripherals_write(U64 addr, U64 value, U64 size) {\\n\\n switch (addr) {\\n\\n case APCIE_ICC_REG_DOORBELL:\\n\\n icc_doorbell |= value;\\n\\n update_icc();\\n\\n break;\\n\\n case APCIE_ICC_REG_STATUS:\\n\\n icc_status &= ~value;\\n\\n break;\\n\\n case APCIE_ICC_REG_UNK820:\\n\\n case APCIE_ICC_REG_IRQ_MASK:\\n\\n fprintf(stderr, \\\"AeoliaPCIeDevice::peripherals_write: addr=0x%llX, value=0x%llX, size=0x%llX\\\\n\\\", addr, value, size);\\n\\n break;\\n\\n default:\\n\\n if (range_wdt.contains(addr)) {\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n }\\n\\n else if (range_unk1.contains(addr)) {\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/aeolia_pcie.cpp\",\n \"rank\": 79,\n \"score\": 14.103989836098757\n },\n {\n \"content\": \"void SamDevice::reset() {\\n\\n gpr.fill(0);\\n\\n ih_cpu_am32_int_ctx = 0;\\n\\n ih_cpu_am32_int_status = 0;\\n\\n ih_am32_cpu_int_ctx = 0;\\n\\n\\n\\n ix_data.fill(0);\\n\\n sab_ix_data.fill(0);\\n\\n}\\n\\n\\n\\nU32 SamDevice::mmio_read(U32 index) {\\n\\n U32 value = 0;\\n\\n\\n\\n switch (index) {\\n\\n case mmSAM_IX_INDEX:\\n\\n value = ix_index;\\n\\n break;\\n\\n case mmSAM_IX_DATA:\\n\\n switch (ix_index) {\\n\\n case ixSAM_IH_CPU_AM32_INT_CTX_HIGH:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/sam/sam.cpp\",\n \"rank\": 80,\n \"score\": 14.019935192519963\n },\n {\n \"content\": \" const auto& state = c->state();\\n\\n const auto& space = c->space();\\n\\n\\n\\n // Read stack contents\\n\\n Buffer buf(0x100);\\n\\n const auto rsp = state.get_linear_rsp();\\n\\n try {\\n\\n space->read(rsp, buf.size(), buf.data());\\n\\n } catch (std::runtime_error& e) {\\n\\n g_error(\\\"Error: {}\\\", e.what());\\n\\n return;\\n\\n }\\n\\n\\n\\n // Adjust stack view width\\n\\n switch (c->mode()) {\\n\\n case X86CPUMode::REAL:\\n\\n case X86CPUMode::PROTECTED:\\n\\n case X86CPUMode::LONG_COMPATIBILITY:\\n\\n me_stack.Cols = 4;\\n\\n break;\\n\",\n \"file_path\": \"src/orbital/ui/tab_cpu.cpp\",\n \"rank\": 81,\n \"score\": 13.713127535275113\n },\n {\n \"content\": \"/**\\n\\n * BLS format.\\n\\n *\\n\\n * Copyright 2017-2021. Orbital project.\\n\\n * Released under MIT license. Read LICENSE for more details.\\n\\n *\\n\\n * Authors:\\n\\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\\n\\n */\\n\\n\\n\\n#include \\\"bls.h\\\"\\n\\n\\n\\n#include <stdexcept>\\n\\n\\n\\nconstexpr U32 BLS_MAGIC = '2BLS';\\n\\nconstexpr U64 BLS_BLOCK = 0x200;\\n\\n\\n\\nU64 BlsStream::read(U64 size, void* buffer) {\\n\\n std::unique_lock<std::mutex> lock(bls->mtx);\\n\\n Stream& s = bls->s;\\n\",\n \"file_path\": \"src/orbital/software/bls.cpp\",\n \"rank\": 83,\n \"score\": 13.660183767635491\n },\n {\n \"content\": \"#include \\\"smu/smu.h\\\"\\n\\n\\n\\n#include <array>\\n\\n#include <memory>\\n\\n\\n\\nconstexpr auto LIVERPOOL_GC_DEV = 0x1;\\n\\nconstexpr auto LIVERPOOL_GC_FNC = 0x0;\\n\\nconstexpr auto LIVERPOOL_GC_VID = static_cast<PCIVendorId>(0x1002);\\n\\nconstexpr auto LIVERPOOL_GC_DID = static_cast<PCIDeviceId>(0x9920);\\n\\n\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/liverpool_gc.h\",\n \"rank\": 84,\n \"score\": 13.641520557605553\n },\n {\n \"content\": \"#include <string>\\n\\n\\n\\nstatic std::string cpu_name(size_t index) {\\n\\n return \\\"CPU #\\\" + std::to_string(index);\\n\\n}\\n\\n\\n\\nstatic const char* bp_prot(CPUBreakpoint::Prot prot) {\\n\\n switch (prot) {\\n\\n case CPUBreakpoint::Prot::R:\\n\\n return \\\"R--\\\";\\n\\n case CPUBreakpoint::Prot::W:\\n\\n return \\\"-W-\\\";\\n\\n case CPUBreakpoint::Prot::X:\\n\\n return \\\"--X\\\";\\n\\n case CPUBreakpoint::Prot::RW:\\n\\n return \\\"RW-\\\";\\n\\n case CPUBreakpoint::Prot::RX:\\n\\n return \\\"R-X\\\";\\n\\n case CPUBreakpoint::Prot::WX:\\n\\n return \\\"-WX\\\";\\n\",\n \"file_path\": \"src/orbital/ui/tab_cpu.cpp\",\n \"rank\": 85,\n \"score\": 13.578977648530632\n },\n {\n \"content\": \" value = 0; // TODO\\n\\n break;\\n\\n case mmCP_HQD_ACTIVE:\\n\\n value = 0; // TODO\\n\\n break;\\n\\n\\n\\n // Ignored access\\n\\n case mmCP_MEM_SLP_CNTL:\\n\\n case mmCP_IQ_WAIT_TIME1:\\n\\n break;\\n\\n\\n\\n default:\\n\\n //assert_always(\\\"Unimplemented\\\");\\n\\n break;\\n\\n }\\n\\n\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid GfxDevice::mmio_write(U32 index, U32 value) {\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/gfx.cpp\",\n \"rank\": 86,\n \"score\": 13.532558738875471\n },\n {\n \"content\": \" value = 0xBD;\\n\\n break;\\n\\n case AGBE_DEVICE_REV:\\n\\n assert(size == 1);\\n\\n value = 0x00; // TODO\\n\\n break;\\n\\n case AGBE_UNK2880:\\n\\n assert(size == 2);\\n\\n value = 0x10; // TODO\\n\\n break;\\n\\n }\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid AeoliaGBEDevice::mmio_write(U64 addr, U64 value, U64 size) {\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n}\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/aeolia_gbe.cpp\",\n \"rank\": 87,\n \"score\": 13.442715173722865\n },\n {\n \"content\": \"/**\\n\\n * AMD PM4 packets.\\n\\n *\\n\\n * Copyright 2017-2021. Orbital project.\\n\\n * Released under MIT license. Read LICENSE for more details.\\n\\n *\\n\\n * Authors:\\n\\n * - Alexandro Sanchez Bach <alexandro@phi.nz>\\n\\n */\\n\\n\\n\\n#include \\\"pm4.h\\\"\\n\\n\\n\\nconst char* pm4_itop_name(U32 itop) {\\n\\n#define CASE(itop) case PM4_IT_##itop: return #itop\\n\\n switch (itop) {\\n\\n CASE(NOP);\\n\\n CASE(SET_BASE);\\n\\n CASE(CLEAR_STATE);\\n\\n CASE(INDEX_BUFFER_SIZE);\\n\\n CASE(DISPATCH_DIRECT);\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/pm4.cpp\",\n \"rank\": 88,\n \"score\": 13.344752807146818\n },\n {\n \"content\": \" U32 data_lo_index;\\n\\n U32 value;\\n\\n\\n\\n value = 0;\\n\\n switch (offset) {\\n\\n // Handle global control/status\\n\\n case REG_MSI_CONTROL:\\n\\n case REG_MSI_UNK004:\\n\\n case REG_MSI_UNK008:\\n\\n break;\\n\\n\\n\\n // Handle regular function-specific registers\\n\\n CASE_FUNCS(R, ADDR, func_addr);\\n\\n CASE_FUNCS(R, MASK, func_mask);\\n\\n CASE_FUNCS(R, DATA, func_data);\\n\\n\\n\\n // Handle irregular function-specific registers\\n\\n default:\\n\\n data_lo_index = (offset - REG_MSI_FNC0_DATA_LO(0)) >> 2;\\n\\n if (data_lo_index < 48) {\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp\",\n \"rank\": 89,\n \"score\": 13.26402099402677\n },\n {\n \"content\": \" mmio_write(index++, reg);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid GfxDevice::cp_handle_pm4_type1(CpBuffer& cp, PM4Packet::Type1 p) {\\n\\n assert_always(\\\"Unsupported packet type\\\");\\n\\n}\\n\\n\\n\\nvoid GfxDevice::cp_handle_pm4_type2(CpBuffer& cp, PM4Packet::Type2 p) {\\n\\n assert_always(\\\"Unsupported packet type\\\");\\n\\n}\\n\\n\\n\\nvoid GfxDevice::cp_handle_pm4_type3(CpBuffer& cp, PM4Packet::Type3 p) {\\n\\n const auto rptr_old = cp.rptr;\\n\\n\\n\\n switch (p.itop) {\\n\\n case PM4_IT_INDIRECT_BUFFER_CONST:\\n\\n cp_handle_pm4_it_indirect_buffer_const(cp);\\n\\n break;\\n\\n case PM4_IT_INDIRECT_BUFFER:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/gfx.cpp\",\n \"rank\": 90,\n \"score\": 13.195346836515228\n },\n {\n \"content\": \" cp_handle_pm4_it_indirect_buffer(cp);\\n\\n break;\\n\\n case PM4_IT_SET_CONFIG_REG:\\n\\n case PM4_IT_SET_CONTEXT_REG:\\n\\n case PM4_IT_SET_SH_REG:\\n\\n case PM4_IT_SET_UCONFIG_REG:\\n\\n cp_handle_pm4_it_set_reg(cp, p);\\n\\n break;\\n\\n\\n\\n // Ignored commands\\n\\n case PM4_IT_PREAMBLE_CNTL:\\n\\n case PM4_IT_CONTEXT_CONTROL:\\n\\n case PM4_IT_CLEAR_STATE:\\n\\n case PM4_IT_SET_BASE:\\n\\n break;\\n\\n#if 0\\n\\n case PM4_IT_DRAW_INDEX_AUTO:\\n\\n cp_handle_pm4_it_draw_index_auto(s, vmid, packet);\\n\\n break;\\n\\n case PM4_IT_EVENT_WRITE_EOP:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/gfx.cpp\",\n \"rank\": 91,\n \"score\": 13.06823571010183\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid GfxDevice::cp_read(CpBuffer& cp, U32* dwords, U32 count) {\\n\\n auto vm = gmc.get(cp.vmid);\\n\\n auto va = cp.base | cp.rptr;\\n\\n const auto size = count * sizeof(U32);\\n\\n vm.read(va, size, dwords);\\n\\n cp.rptr += size;\\n\\n}\\n\\n\\n\\nstd::vector<U32> GfxDevice::cp_read(CpBuffer& cp, U32 count) {\\n\\n std::vector<U32> dwords(count);\\n\\n cp_read(cp, dwords.data(), dwords.size());\\n\\n return dwords;\\n\\n}\\n\\n\\n\\nvoid GfxDevice::cp_handle_pm4(CpBuffer& cp) {\\n\\n auto pm4 = cp_read<PM4Packet>(cp);\\n\\n switch (pm4.type) {\\n\\n case PM4_PACKET_TYPE0:\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/gca/gfx.cpp\",\n \"rank\": 92,\n \"score\": 13.059170751965308\n },\n {\n \"content\": \" switch (offset) {\\n\\n case D0F0xBC:\\n\\n assert(size == 4);\\n\\n smc_ix = (U32&)config_data[D0F0xB8];\\n\\n value = smu->smc_read(smc_ix);\\n\\n break;\\n\\n default:\\n\\n value = PCIDevice::config_read(offset, size);\\n\\n }\\n\\n\\n\\n return value;\\n\\n}\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/liverpool_rc.cpp\",\n \"rank\": 93,\n \"score\": 12.888455928611155\n },\n {\n \"content\": \" break;\\n\\n case 4:\\n\\n assert(sub < 24);\\n\\n data |= func4_data_lo[sub];\\n\\n break;\\n\\n case 5:\\n\\n assert(sub < 2);\\n\\n data |= func5_data_lo[sub];\\n\\n break;\\n\\n case 6:\\n\\n assert(sub < 2);\\n\\n data |= func6_data_lo[sub];\\n\\n break;\\n\\n case 7:\\n\\n assert(sub < 4);\\n\\n data |= func7_data_lo[sub];\\n\\n break;\\n\\n default:\\n\\n fprintf(stderr, \\\"%s: Function #%u out of range!\\\", __FUNCTION__, func);\\n\\n return;\\n\\n }\\n\\n mem->write<U32>(func_addr[func], data);\\n\\n}\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/msic/aeolia_msic.cpp\",\n \"rank\": 94,\n \"score\": 12.825965770662467\n },\n {\n \"content\": \" case 0x619:\\n\\n case 0x61B:\\n\\n case 0x3BD3:\\n\\n case 0x3BD4:\\n\\n case 0x3BD5:\\n\\n break;\\n\\n\\n\\n default:\\n\\n DPRINTF(\\\"index=0x%llX, size=0x%llX\\\", index, size);\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n value = mmio[index];\\n\\n }\\n\\n\\n\\n return value;\\n\\n}\\n\\n\\n\\nvoid LiverpoolGCDevice::mmio_write(U64 addr, U64 value, U64 size) {\\n\\n U64 index = addr >> 2;\\n\\n U64 index_ix = 0;\\n\\n\\n\",\n \"file_path\": \"src/orbital/hardware/liverpool/liverpool_gc.cpp\",\n \"rank\": 95,\n \"score\": 12.743228126634138\n },\n {\n \"content\": \" ImGui::Text(\\\"DCP%d\\\", i);\\n\\n ImGui::NextColumn();\\n\\n }\\n\\n ImGui::Separator();\\n\\n for (const auto& attr : dcp_attrs) {\\n\\n ImGui::Text(\\\"%s\\\", attr.name);\\n\\n ImGui::NextColumn();\\n\\n for (int i = 0; i < DCP_COUNT; i++) {\\n\\n int mm_index = attr.mmio_indices[i];\\n\\n snprintf(tag, sizeof(tag), \\\"##dcp%d_%s\\\", i, attr.name);\\n\\n switch (attr.type) {\\n\\n case ATTR_U32_DEC:\\n\\n ImGui::PushItemWidth(-1);\\n\\n ImGui::InputScalar(tag, ImGuiDataType_U32, &mmio[mm_index], &u32_one, NULL, \\\"%d\\\",\\n\\n ImGuiInputTextFlags_CharsDecimal |\\n\\n ImGuiInputTextFlags_ReadOnly);\\n\\n ImGui::PopItemWidth();\\n\\n break;\\n\\n case ATTR_U32_HEX:\\n\\n ImGui::PushItemWidth(-1);\\n\",\n \"file_path\": \"src/orbital/ui/tab_gpu.cpp\",\n \"rank\": 96,\n \"score\": 12.728347672521194\n },\n {\n \"content\": \" // General access\\n\\n switch (addr) {\\n\\n case HPET_REG_CNT + 0:\\n\\n s.counter.lo = value;\\n\\n break;\\n\\n case HPET_REG_CNT + 4:\\n\\n s.counter.hi = value;\\n\\n break;\\n\\n case HPET_REG_CFG + 0:\\n\\n s.config.value = value;\\n\\n break;\\n\\n case HPET_REG_IS + 0:\\n\\n value &= s.isr.value_lo;\\n\\n for (int i = 0; i < timers.size(); i++) {\\n\\n if (value & (1 << i)) {\\n\\n update_irq(timers[i], i);\\n\\n }\\n\\n }\\n\\n break;\\n\\n\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/hpet/aeolia_hpet.cpp\",\n \"rank\": 97,\n \"score\": 12.670608287724466\n },\n {\n \"content\": \" const auto& crypto = ps4Crypto();\\n\\n\\n\\n // Get target segment\\n\\n const PupSegmentEntry& entry = segEntries[index];\\n\\n const PupSegmentMeta& meta = segMetas[index];\\n\\n const auto block_size = entry.block_size();\\n\\n const auto block_count = entry.block_count();\\n\\n\\n\\n // Get information segment\\n\\n const auto info_index = find_info(index);\\n\\n const PupSegmentEntry& info_entry = segEntries[info_index];\\n\\n const PupSegmentMeta& info_meta = segMetas[info_index];\\n\\n\\n\\n // Read and process information segment data\\n\\n Buffer info_buffer(info_entry.file_size);\\n\\n s.seek(info_entry.offset, StreamSeek::Set);\\n\\n s.read(info_buffer.size(), info_buffer.data());\\n\\n if (info_entry.is_encrypted()) {\\n\\n decrypt(info_buffer, info_meta);\\n\\n }\\n\",\n \"file_path\": \"src/orbital/software/pup.cpp\",\n \"rank\": 98,\n \"score\": 12.576344674880698\n },\n {\n \"content\": \" // Add PCIe capability\\n\\n // TODO: Refactor this code\\n\\n const auto cap_off = add_capability(PCI_CAP_ID_EXP, 0x14 /* V1 */);\\n\\n (U16&)config_data[cap_off + 2 /*PCI_EXP_FLAGS*/ ] = 0x0001;\\n\\n (U32&)config_data[cap_off + 4 /*PCI_EXP_DEVCAP*/] = 0;\\n\\n (U16&)config_data[cap_off + 8 /*PCI_EXP_DEVCTL*/] = 0;\\n\\n (U16&)config_data[cap_off + 10 /*PCI_EXP_DEVSTA*/] = 0;\\n\\n (U32&)config_data[cap_off + 12 /*PCI_EXP_LNKCAP*/] = 0;\\n\\n (U16&)config_data[cap_off + 16 /*PCI_EXP_LNKCTL*/] = 0;\\n\\n (U16&)config_data[cap_off + 18 /*PCI_EXP_LNKSTA*/] = 0;\\n\\n}\\n\\n\\n\\nU64 AeoliaGBEDevice::mmio_read(U64 addr, U64 size) {\\n\\n U64 value = 0;\\n\\n assert_always(\\\"Unimplemented\\\");\\n\\n\\n\\n DPRINTF(\\\"addr=0x%llX, size=0x%llX\\\\n\\\", addr, size);\\n\\n switch (addr) {\\n\\n case AGBE_DEVICE_ID:\\n\\n assert(size == 1);\\n\",\n \"file_path\": \"src/orbital/hardware/aeolia/aeolia_gbe.cpp\",\n \"rank\": 99,\n \"score\": 12.509224652278615\n }\n]","isConversational":false}}},{"rowIdx":291,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"include/svg_reader.hpp"},"repo_name":{"kind":"string","value":"phonxvzf/svg2scad"},"commit":{"kind":"string","value":"eb458df6cee6a65fbabbe5a5600f50551532adb4"},"file_code":{"kind":"string","value":"#ifndef SVG_READER_HPP\n#define SVG_READER_HPP\n\n#include <string>\n#include <memory>\n\n#include \"svgpp/svgpp.hpp\"\n#include \"rapidxml_ns/rapidxml_ns_utils.hpp\"\n#include \"svgpp/policy/xml/rapidxml_ns.hpp\"\n#include \"math/util.hpp\"\n\nnamespace svg {\n\n using namespace math;\n\n namespace action {\n enum type {\n ACTION_MOVE_TO,\n ACTION_LINE_TO,\n ACTION_QUAD_BEZIER_TO,\n ACTION_CUBIC_BEZIER_TO,\n ACTION_ELLIPTIC_ARC_TO,\n ACTION_UNKNOWN\n };\n\n struct base {\n virtual ~base() {}\n };\n\n struct move_to : base {\n union { vector2f p1, dst; };\n\n move_to() = delete;\n move_to(const vector2f& _p1) : p1(_p1) {}\n };\n\n struct line_to : base {\n union { vector2f p1, dst; };\n\n line_to() = delete;\n line_to(const vector2f& _p1) : p1(_p1) {}\n };\n\n struct quadratic_bezier_to : base {\n vector2f p1;\n union { vector2f p2, dst; };\n\n quadratic_bezier_to() = delete;\n quadratic_bezier_to(const vector2f& _p1, const vector2f& _p2) : p1(_p1), p2(_p2) {}\n };\n\n struct cubic_bezier_to : base {\n vector2f p1, p2;\n union { vector2f p3, dst; };\n\n cubic_bezier_to() = delete;\n cubic_bezier_to(const vector2f& _p1, const vector2f& _p2, const vector2f& _p3)\n : p1(_p1), p2(_p2), p3(_p3) {}\n };\n\n struct elliptic_arc_to : base {\n vector2f r;\n float x_axis_rotation;\n union { vector2f p1, dst; }; \n bool large_arc;\n bool sweep;\n\n elliptic_arc_to() = delete;\n elliptic_arc_to(\n const vector2f& _r,\n float _x_axis_rotation,\n const vector2f& _p1,\n bool _large_arc,\n bool _sweep)\n : r(_r), x_axis_rotation(_x_axis_rotation), p1(_p1), large_arc(_large_arc), sweep(_sweep) {}\n };\n\n inline type get_type(const std::shared_ptr<base>& action) {\n base* base_ptr = action.get();\n if (dynamic_cast<move_to*>(base_ptr)) return ACTION_MOVE_TO;\n if (dynamic_cast<line_to*>(base_ptr)) return ACTION_LINE_TO;\n if (dynamic_cast<quadratic_bezier_to*>(base_ptr)) return ACTION_QUAD_BEZIER_TO;\n if (dynamic_cast<cubic_bezier_to*>(base_ptr)) return ACTION_CUBIC_BEZIER_TO;\n if (dynamic_cast<elliptic_arc_to*>(base_ptr)) return ACTION_ELLIPTIC_ARC_TO;\n return ACTION_UNKNOWN;\n }\n } \n\n class reader {\n private:\n class context {\n private:\n std::vector<std::shared_ptr<action::base>> m_actions;\n\n public:\n context() = default;\n ~context();\n\n const std::vector<std::shared_ptr<action::base>>& actions() const;\n\n \n void path_move_to(float x, float y, svgpp::tag::coordinate::absolute);\n void path_line_to(float x, float y, svgpp::tag::coordinate::absolute);\n void path_quadratic_bezier_to(\n float x1, float y1,\n float x, float y,\n svgpp::tag::coordinate::absolute);\n void path_cubic_bezier_to(\n float x1, float y1,\n float x2, float y2,\n float x, float y,\n svgpp::tag::coordinate::absolute);\n void path_elliptical_arc_to(\n float rx, float ry, float x_axis_rotation,\n bool large_arc_flag, bool sweep_flag,\n float x, float y,\n svgpp::tag::coordinate::absolute);\n void path_close_subpath();\n void path_exit();\n\n \n void on_enter_element(svgpp::tag::element::any);\n void on_exit_element();\n\n static const bool convert_only_rounded_rect_to_path = false;\n } m_context;\n\n float m_width = 0.0f;\n float m_height = 0.0f;\n\n public:\n reader();\n reader(const std::string& fpath);\n ~reader();\n\n const std::vector<std::shared_ptr<action::base>>& actions() const;\n const std::vector<std::shared_ptr<action::base>>& load_file(const std::string& fpath);\n float width() const;\n float height() const;\n }; \n\n using processed_element_t = boost::mpl::set<\n svgpp::tag::element::svg,\n svgpp::tag::element::g,\n svgpp::tag::element::circle,\n svgpp::tag::element::ellipse,\n svgpp::tag::element::line,\n svgpp::tag::element::path,\n svgpp::tag::element::polygon,\n svgpp::tag::element::polyline,\n svgpp::tag::element::rect\n >;\n} \n\n#endif \n"},"prefix":{"kind":"string","value":"#ifndef SVG_READER_HPP\n#define SVG_READER_HPP\n\n#include <string>\n#include <memory>\n\n#include \"svgpp/svgpp.hpp\"\n#include \"rapidxml_ns/rapidxml_ns_utils.hpp\"\n#include \"svgpp/policy/xml/rapidxml_ns.hpp\"\n#include \"math/util.hpp\"\n\nnamespace svg {\n\n using namespace math;\n\n namespace action {\n enum type {\n ACTION_MOVE_TO,\n ACTION_LINE_TO,\n ACTION_QUAD_BEZIER_TO,\n ACTION_CUBIC_BEZIER_TO,\n ACTION_ELLIPTIC_ARC_TO,\n ACTION_UNKNOWN\n };\n\n struct base {\n virtual ~base() {}\n };\n\n struct move_to : base {\n union { vector2f p1, dst; };\n\n move_to() = delete;\n move_to(const vector2f& _p1) : p1(_p1) {}\n };\n\n struct line_to : base {\n union { vector2f p1, dst; };\n\n line_to() = delete;\n line_to(const vector2f& _p1) : p1(_p1) {}\n };\n\n struct quadratic_bezier_to : base {\n vector2f p1;\n union { vector2f p2, dst; };\n\n quadratic_bezier_to() = delete;\n quadratic_bezier_to(const vector2f& _p1, const vector2f& _p2) : p1(_p1), p2(_p2) {}\n };\n\n struct cubic_bezier_to : base {\n vector2f p1, p2;\n union { vector2f p3, dst; };\n\n cubic_bezier_to() = delete;\n cubic_bezier_to(const vector2f& _p1, const vector2f& _p2, const vector2f& _p3)\n : p1(_p1), p2(_p2), p3(_p3) {}\n };\n\n struct elliptic_arc_to : base {\n vector2f r;\n float x_axis_rotation;\n union { vector2f p1, dst; }; \n bool large_arc;\n bool sweep;\n\n elliptic_arc_to() = delete;\n elliptic_arc_to(\n const vector2f& _r,\n float _x_axis_rotation,\n const vector2f& _p1,\n bool _large_arc,\n bool _sweep)\n : r(_r), x_axis_rotation(_x_axis_rotation), p1(_p1), large_arc(_large_arc), sweep(_sweep) {}\n };\n\n inline type get_type(const std::shared_ptr<base>& action) {\n base* base_ptr = action.get();\n if (dynamic_cast<move_to*>(base_ptr)) return ACTION_MOVE_T"},"suffix":{"kind":"string","value":"\n } \n\n class reader {\n private:\n class context {\n private:\n std::vector<std::shared_ptr<action::base>> m_actions;\n\n public:\n context() = default;\n ~context();\n\n const std::vector<std::shared_ptr<action::base>>& actions() const;\n\n \n void path_move_to(float x, float y, svgpp::tag::coordinate::absolute);\n void path_line_to(float x, float y, svgpp::tag::coordinate::absolute);\n void path_quadratic_bezier_to(\n float x1, float y1,\n float x, float y,\n svgpp::tag::coordinate::absolute);\n void path_cubic_bezier_to(\n float x1, float y1,\n float x2, float y2,\n float x, float y,\n svgpp::tag::coordinate::absolute);\n void path_elliptical_arc_to(\n float rx, float ry, float x_axis_rotation,\n bool large_arc_flag, bool sweep_flag,\n float x, float y,\n svgpp::tag::coordinate::absolute);\n void path_close_subpath();\n void path_exit();\n\n \n void on_enter_element(svgpp::tag::element::any);\n void on_exit_element();\n\n static const bool convert_only_rounded_rect_to_path = false;\n } m_context;\n\n float m_width = 0.0f;\n float m_height = 0.0f;\n\n public:\n reader();\n reader(const std::string& fpath);\n ~reader();\n\n const std::vector<std::shared_ptr<action::base>>& actions() const;\n const std::vector<std::shared_ptr<action::base>>& load_file(const std::string& fpath);\n float width() const;\n float height() const;\n }; \n\n using processed_element_t = boost::mpl::set<\n svgpp::tag::element::svg,\n svgpp::tag::element::g,\n svgpp::tag::element::circle,\n svgpp::tag::element::ellipse,\n svgpp::tag::element::line,\n svgpp::tag::element::path,\n svgpp::tag::element::polygon,\n svgpp::tag::element::polyline,\n svgpp::tag::element::rect\n >;\n} \n\n#endif \n"},"middle":{"kind":"string","value":"O;\n if (dynamic_cast<line_to*>(base_ptr)) return ACTION_LINE_TO;\n if (dynamic_cast<quadratic_bezier_to*>(base_ptr)) return ACTION_QUAD_BEZIER_TO;\n if (dynamic_cast<cubic_bezier_to*>(base_ptr)) return ACTION_CUBIC_BEZIER_TO;\n if (dynamic_cast<elliptic_arc_to*>(base_ptr)) return ACTION_ELLIPTIC_ARC_TO;\n return ACTION_UNKNOWN;\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"struct value_parser<tag::type::string, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, attribute_value);\n\n return true;\n\n }\n\n};\n\n\n\n}","file_path":"include/svgpp/parser/string.hpp","rank":0,"score":236280.6541854153},{"content":"struct get_viewport_size_source<tag::element::use_, tag::element::svg>\n\n{\n\n typedef tag::viewport_size_source::reference_override_own type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/adapter/viewport.hpp","rank":1,"score":184513.20181909585},{"content":"struct skip_inherit: Base\n\n{\n\n using Base::set;\n\n\n\n template<class AttributeTag>\n\n static void set(Context &, AttributeTag, tag::source::any const &, tag::value::inherit,\n\n typename boost::enable_if<traits::inherited_property<AttributeTag> >::type * = NULL)\n\n {}\n\n\n\n template<class AttributeTag>\n\n static void set(Context &, AttributeTag, tag::source::any const &, tag::value::inherit, tag::source::attribute,\n\n typename boost::enable_if<traits::inherited_property<AttributeTag> >::type * = NULL)\n\n {}\n\n\n\n template<class AttributeTag>\n\n static void set(Context &, AttributeTag, tag::source::any const &, tag::value::inherit, tag::source::css,\n\n typename boost::enable_if<traits::inherited_property<AttributeTag> >::type * = NULL)\n\n {}\n\n};\n\n\n\ntemplate<class Context>\n","file_path":"include/svgpp/policy/value_events.hpp","rank":2,"score":179816.56954977656},{"content":"struct svg_attribute_name_to_id: dictionary_base<attribute_id>\n\n{\n\n template<class Ch>\n\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\n\n};\n\n\n","file_path":"include/svgpp/detail/names_dictionary.hpp","rank":3,"score":168827.10899653847},{"content":"struct element_name_to_id: dictionary_base<element_type_id>\n\n{\n\n template<class Ch>\n\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\n\n};\n\n\n","file_path":"include/svgpp/detail/names_dictionary.hpp","rank":4,"score":168677.9461959993},{"content":"struct element_iterator<xercesc::DOMNode const *>\n\n : xerces_detail::string_policy\n\n{\n\n typedef xercesc::DOMNode const * iterator_type;\n\n typedef const XMLCh * element_name_type;\n\n typedef const XMLCh * element_text_type;\n\n typedef xerces_detail::attribute_iterator attribute_enumerator_type;\n\n\n\n static void advance_element(iterator_type & xml_node)\n\n {\n\n find_next<false, false>(xml_node);\n\n }\n\n\n\n static void advance_element_or_text(iterator_type & xml_node)\n\n {\n\n find_next<false, true>(xml_node);\n\n }\n\n\n\n static bool is_end(iterator_type xml_node)\n\n {\n","file_path":"include/svgpp/policy/xml/xerces.hpp","rank":5,"score":162039.5161215817},{"content":"struct element_iterator<xercesc::DOMElement const *>\n\n : element_iterator<xercesc::DOMNode const *>\n\n{};\n\n\n\n}}}\n","file_path":"include/svgpp/policy/xml/xerces.hpp","rank":6,"score":162039.5161215817},{"content":"struct value_parser<tag::type::list_of<tag::type::length>, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n typedef typename traits::length_dimension_by_attribute<AttributeTag>::type direction_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n return parseT<\n\n detail::length_grammar_tag,\n\n AttributeTag, Context, AttributeValue, PropertySource, direction_t>\n\n (tag, context, attribute_value, property_source);\n\n }\n\n\n\nprotected:\n\n template<class LengthGrammarTag, class AttributeTag, class Context, class AttributeValue, class PropertySource, class Direction>\n\n static bool parseT(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n","file_path":"include/svgpp/parser/length.hpp","rank":7,"score":161882.61139255483},{"content":"struct value_parser<tag::type::list_of<tag::type::number>, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename args_t::number_type coordinate_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef qi::real_parser<coordinate_t, detail::number_policies<coordinate_t, PropertySource> > grammar_t;\n\n typedef detail::comma_wsp_rule_no_skip<iterator_t> separator_t;\n\n typedef detail::parse_list_iterator<coordinate_t, iterator_t, grammar_t, separator_t> parse_list_iterator_t;\n\n typedef detail::finite_function_iterator<parse_list_iterator_t> output_iterator_t;\n\n\n\n SVGPP_STATIC_IF_SAFE const grammar_t number_grammar;\n\n SVGPP_STATIC_IF_SAFE const separator_t separator_grammar;\n\n parse_list_iterator_t parse_list(\n\n boost::begin(attribute_value), boost::end(attribute_value), \n","file_path":"include/svgpp/parser/number.hpp","rank":8,"score":161882.61139255483},{"content":"struct attribute_type\n\n{\n\n // By default type is specific to attribute\n\n typedef Attribute type;\n\n};\n\n\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::x1 > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::y1 > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::x2 > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::y2 > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::width > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::height > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::r > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::rx > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::ry > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::cx > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::cy > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::refX > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::refY > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::markerWidth > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::markerHeight > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::fx > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::fy > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::startOffset > { typedef tag::type::length type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::textLength > { typedef tag::type::length type; };\n\n\n\ntemplate<class ElementTag, class AttributeTag>\n","file_path":"include/svgpp/traits/attribute_type.hpp","rank":9,"score":160396.7319435013},{"content":"struct value_parser<tag::type::list_of<tag::type::percentage_or_length>, SVGPP_TEMPLATE_ARGS_PASS>\n\n : value_parser<tag::type::list_of<tag::type::length>, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n typedef value_parser<tag::type::list_of<tag::type::length>, SVGPP_TEMPLATE_ARGS_PASS> base_type;\n\n\n\n using base_type::parse;\n\n\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n tag::source::css property_source)\n\n {\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n return base_type::template parseT<\n\n detail::percentage_or_length_grammar_tag,\n\n AttributeTag, Context, AttributeValue, \n\n tag::source::css, \n\n tag::length_dimension::not_width_nor_height>\n\n (tag, context, attribute_value, property_source);\n\n }\n\n};\n\n\n\n}","file_path":"include/svgpp/parser/percentage_or_length.hpp","rank":10,"score":158384.2906277508},{"content":"struct get_viewport_size_source<void, tag::element::svg>\n\n{\n\n typedef tag::viewport_size_source::use_own type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/adapter/viewport.hpp","rank":11,"score":155669.69674172247},{"content":"struct child_element_types;\n\n\n\ntemplate<class ElementTag>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":12,"score":155439.386393058},{"content":"struct get_char_type<WCharType, typename boost::enable_if_c<sizeof(WCharType) == 2>::type>\n\n{\n\n typedef wchar_t type;\n\n};\n\n\n","file_path":"include/svgpp/policy/xml/xerces.hpp","rank":13,"score":154585.52348393877},{"content":"struct value_parser<tag::type::integer, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n\n\n\n int value;\n\n if (qi::parse(it, end, qi::int_, value) && it == end)\n\n {\n\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, value);\n\n return true;\n\n }\n\n else\n\n {\n\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\n\n }\n\n }\n\n};\n\n\n\ntemplate<SVGPP_TEMPLATE_ARGS>\n","file_path":"include/svgpp/parser/misc.hpp","rank":14,"score":153161.57706227465},{"content":"struct value_parser<tag::type::funciri, SVGPP_TEMPLATE_ARGS_PASS>\n\n : detail::iri_value_parser<boost::mpl::quote2<funciri_grammar>, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n};\n\n\n\n}","file_path":"include/svgpp/parser/iri.hpp","rank":15,"score":153161.57706227462},{"content":"struct value_parser<tag::type::angle, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource source)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::angle_factory>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef typename detail::unwrap_context<Context, tag::angle_factory>::template bind<args2_t>::type angle_factory_t;\n\n\n\n SVGPP_STATIC_IF_SAFE const angle_grammar<PropertySource, iterator_t, angle_factory_t, typename args_t::number_type> grammar;\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n\n typename angle_factory_t::angle_type value;\n\n if (boost::spirit::qi::parse(it, end, grammar, value) \n\n && it == end)\n","file_path":"include/svgpp/parser/angle.hpp","rank":16,"score":153161.57706227462},{"content":"struct value_parser<tag::type::number, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename args_t::number_type coordinate_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n\n SVGPP_STATIC_IF_SAFE const qi::real_parser<coordinate_t, detail::number_policies<coordinate_t, PropertySource> > number;\n\n coordinate_t value;\n\n if (qi::parse(it, end, number, value) && it == end)\n\n {\n\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, value);\n\n return true;\n\n }\n\n else\n\n {\n\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\n\n }\n\n }\n\n};\n\n\n\ntemplate<SVGPP_TEMPLATE_ARGS>\n","file_path":"include/svgpp/parser/number.hpp","rank":17,"score":153161.57706227462},{"content":"struct value_parser<tag::type::paint, SVGPP_TEMPLATE_ARGS_PASS>\n\n {\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::color_factory>,\n\n boost::parameter::optional<tag::icc_color_policy>,\n\n boost::parameter::optional<tag::iri_policy>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef typename detail::unwrap_context<Context, tag::color_factory>::template bind<args2_t>::type color_factory_t;\n\n typedef detail::unwrap_context<Context, tag::icc_color_policy> icc_color_context_t;\n\n typedef typename icc_color_context_t::template bind<args2_t>::type icc_color_policy_t;\n\n typedef typename icc_color_policy_t::icc_color_factory_type icc_color_factory_t;\n\n typedef typename detail::unwrap_context<Context, tag::iri_policy>::template bind<args2_t>::type iri_policy_t;\n\n typedef typename args_t::value_events_policy value_events_policy_t;\n\n typename args_t::value_events_context::type & value_events_context = args_t::value_events_context::get(context);\n","file_path":"include/svgpp/parser/paint.hpp","rank":18,"score":153161.57706227462},{"content":"struct value_parser<tag::type::color, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::color_factory>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef typename detail::unwrap_context<Context, tag::color_factory>::template bind<args2_t>::type color_factory_t;\n\n\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n\n typename color_factory_t::color_type color;\n\n if (detail::parse_color<color_factory_t>(it, end, property_source, color) && it == end)\n\n {\n\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, color);\n\n return true;\n\n }\n\n else\n\n {\n\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\n\n }\n\n }\n\n};\n\n\n\ntemplate<SVGPP_TEMPLATE_ARGS>\n","file_path":"include/svgpp/parser/color.hpp","rank":19,"score":153161.57706227462},{"content":"struct value_parser<tag::type::iri, SVGPP_TEMPLATE_ARGS_PASS>\n\n : detail::iri_value_parser<boost::mpl::bind1<boost::mpl::quote1<iri_grammar>, boost::mpl::_2>, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n};\n\n\n\ntemplate<SVGPP_TEMPLATE_ARGS>\n","file_path":"include/svgpp/parser/iri.hpp","rank":20,"score":153161.57706227462},{"content":"struct value_parser<tag::type::length, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource source)\n\n {\n\n typedef typename traits::length_dimension_by_attribute<AttributeTag>::type direction_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::length_policy>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef typename detail::unwrap_context<Context, tag::length_policy> length_policy_context;\n\n typedef typename length_policy_context::template bind<args2_t>::type length_policy_t;\n\n\n\n typename length_policy_t::length_factory_type & length_factory \n\n = length_policy_t::length_factory(length_policy_context::get(context));\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n\n typename length_policy_t::length_factory_type::length_type value;\n\n if (detail::parse_length<direction_t, PropertySource>(length_factory, it, end, value)\n","file_path":"include/svgpp/parser/length.hpp","rank":21,"score":153161.57706227462},{"content":"struct is_context_inexpensively_copyable<const Context>: is_context_inexpensively_copyable<Context>\n\n{};\n\n\n\ntemplate<class Context, class Enable = void>\n","file_path":"include/svgpp/detail/adapt_context.hpp","rank":22,"score":151389.91213971173},{"content":"struct attribute_iterator<rapidxml_ns::xml_attribute<Ch> const *>\n\n{\n\n typedef rapidxml_ns::xml_attribute<Ch> const * iterator_type;\n\n typedef boost::iterator_range<Ch const *> string_type;\n\n typedef string_type attribute_name_type;\n\n typedef string_type attribute_value_type;\n\n typedef string_type saved_value_type;\n\n\n\n static string_type get_string_range(string_type const & str)\n\n { \n\n return str;\n\n }\n\n\n\n static void advance(iterator_type & xml_attribute)\n\n {\n\n xml_attribute = xml_attribute->next_attribute();\n\n }\n\n\n\n static bool is_end(iterator_type xml_attribute)\n\n {\n","file_path":"include/svgpp/policy/xml/rapidxml_ns.hpp","rank":23,"score":151389.91213971173},{"content":"struct element_iterator<rapidxml_ns::xml_node<Ch> const *>\n\n{\n\n typedef rapidxml_ns::xml_node<Ch> const * iterator_type;\n\n typedef boost::iterator_range<Ch const *> string_type;\n\n typedef boost::iterator_range<Ch const *> element_name_type;\n\n typedef boost::iterator_range<Ch const *> element_text_type;\n\n typedef rapidxml_ns::xml_attribute<Ch> const * attribute_enumerator_type;\n\n\n\n static string_type get_string_range(string_type const & str)\n\n { \n\n return str;\n\n }\n\n\n\n static void advance_element(iterator_type & xml_element)\n\n {\n\n xml_element = xml_element->next_sibling(); \n\n find_next<false>(xml_element);\n\n }\n\n\n\n static void advance_element_or_text(iterator_type & xml_element)\n","file_path":"include/svgpp/policy/xml/rapidxml_ns.hpp","rank":24,"score":151389.91213971173},{"content":"struct value_parser<tag::type::clock_value, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n tag::source::attribute source)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n\n // TODO: own type for clock_value\n\n SVGPP_STATIC_IF_SAFE const clock_value_grammar<iterator_t, typename args_t::number_type> grammar;\n\n typename args_t::number_type value;\n\n if (qi::parse(it, end, grammar, value) && it == end)\n\n {\n\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, source, value);\n\n return true;\n\n }\n\n else\n\n {\n\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\n\n }\n\n return true;\n\n }\n\n};\n\n\n\n}\n","file_path":"include/svgpp/parser/animation.hpp","rank":25,"score":151067.43682089794},{"content":"struct value_parser<tag::type::transform_list, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n tag::source::attribute)\n\n {\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::transform_events_policy>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef detail::bind_context_parameters_wrapper<Context, args2_t> context_t;\n\n typedef typename detail::unwrap_context<context_t, tag::transform_events_policy> transform_events_context;\n\n typedef typename transform_events_context::policy transform_events_policy;\n\n typedef detail::transform_adapter_if_needed<context_t> adapted_context_t; \n\n typedef \n\n typename detail::unwrap_context<typename adapted_context_t::adapted_context, tag::transform_events_policy>::policy\n\n adapted_transform_events_policy;\n\n\n\n context_t bound_context(context);\n","file_path":"include/svgpp/parser/transform_list.hpp","rank":26,"score":149061.32925492615},{"content":"struct value_parser<tag::type::path_data, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n tag::source::attribute)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename args_t::number_type coordinate_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::path_events_policy>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef detail::bind_context_parameters_wrapper<Context, args2_t> context_t;\n\n typedef typename detail::unwrap_context<context_t, tag::path_events_policy> path_events_context;\n\n typedef detail::path_adapter_if_needed<context_t> adapted_context_t; \n\n\n\n context_t bound_context(context);\n","file_path":"include/svgpp/parser/path_data.hpp","rank":27,"score":149061.32925492615},{"content":"struct value_parser<tag::type::percentage_or_length, SVGPP_TEMPLATE_ARGS_PASS>\n\n : value_parser<tag::type::length, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n using value_parser<tag::type::length, SVGPP_TEMPLATE_ARGS_PASS>::parse;\n\n\n\n template<class AttributeTag, class Context, class AttributeValue>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n tag::source::css property_source)\n\n {\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::length_policy>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef typename detail::unwrap_context<Context, tag::length_policy> length_policy_context;\n\n typedef typename length_policy_context::template bind<args2_t>::type length_policy_t;\n\n\n\n typename length_policy_t::length_factory_type & length_factory \n\n = length_policy_t::length_factory(length_policy_context::get(context));\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n","file_path":"include/svgpp/parser/percentage_or_length.hpp","rank":28,"score":149061.32925492615},{"content":"struct value_parser<tag::type::number_optional_number, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n tag::source::attribute property_source)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n namespace phx = boost::phoenix;\n\n using qi::_1;\n\n\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename args_t::number_type coordinate_t;\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n\n\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\n\n SVGPP_STATIC_IF_SAFE const qi::real_parser<coordinate_t, detail::number_policies<coordinate_t, tag::source::attribute> > number;\n\n SVGPP_STATIC_IF_SAFE const detail::comma_wsp_rule_no_skip<iterator_t> comma_wsp;\n\n coordinate_t value1, value2;\n\n bool two_values = false;\n\n if (qi::parse(it, end, \n","file_path":"include/svgpp/parser/number.hpp","rank":29,"score":149061.32925492615},{"content":"struct string_policy\n\n{\n\nprotected:\n\n typedef get_char_type<>::type char_type;\n\n\n\npublic:\n\n typedef boost::iterator_range<char_type const *> string_type;\n\n\n\n static string_type get_string_range(XMLCh const * str)\n\n {\n\n return string_type(\n\n reinterpret_cast<char_type const *>(str),\n\n reinterpret_cast<char_type const *>(str) + xercesc::XMLString::stringLen(str));\n\n }\n\n};\n\n\n","file_path":"include/svgpp/policy/xml/xerces.hpp","rank":30,"score":148737.55684773612},{"content":"struct transform_adapter_base\n\n{\n\n typedef typename boost::mpl::if_c<\n\n TransformPolicy::join_transforms,\n\n matrix_only_transform_adapter<\n\n join_transform_adapter<Context, Number, EventsPolicy> \n\n >,\n\n typename boost::mpl::if_c<\n\n TransformPolicy::only_matrix_transform,\n\n matrix_only_transform_adapter<\n\n passthrough_transform_adapter<Context, Number, EventsPolicy> \n\n >,\n\n passthrough_transform_adapter<Context, Number, EventsPolicy>\n\n >::type\n\n >::type type;\n\n};\n\n\n\n} // namespace detail\n\n\n\ntemplate<\n","file_path":"include/svgpp/adapter/transform.hpp","rank":31,"score":148685.6351310892},{"content":"struct dictionary_base\n\n{\n\n typedef MappedType mapped_type;\n\n\n\n template<class Ch> struct value_type\n\n {\n\n Ch const * key;\n\n size_t key_length;\n\n mapped_type value;\n\n };\n\n};\n\n\n","file_path":"include/svgpp/detail/names_dictionary.hpp","rank":32,"score":148685.6351310892},{"content":"struct integer_base\n\n{\n\n typedef Value color_type;\n\n\n\n static color_type create(unsigned char r, unsigned char g, unsigned char b)\n\n {\n\n return Policy::preset_bits \n\n | (static_cast<color_type>(r) << Policy::r_offset)\n\n | (static_cast<color_type>(g) << Policy::g_offset)\n\n | (static_cast<color_type>(b) << Policy::b_offset);\n\n }\n\n};\n\n\n\ntemplate<\n","file_path":"include/svgpp/factory/integer_color.hpp","rank":33,"score":148685.6351310892},{"content":"struct value_parser<\n\n tag::type::type_or_literal<InnerType, Value, BOOST_PP_ENUM_PARAMS(SVGPP_TYPE_OR_LITERAL_ARITY, Value)>, \n\n SVGPP_TEMPLATE_ARGS_PASS\n\n>\n\n{\n\n typedef value_parser<InnerType, SVGPP_TEMPLATE_ARGS_PASS> inner_parser;\n\n\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, \n\n AttributeValue const & attribute_value, PropertySource property_source)\n\n {\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef detail::literal_values_dictionary<typename boost::range_value<AttributeValue>::type> dictionary;\n\n typedef boost::mpl::vector<Value, BOOST_PP_ENUM_PARAMS(SVGPP_TYPE_OR_LITERAL_ARITY, Value)> tag_list;\n\n\n\n detail::literal_enumeration_type_visitor<\n\n dictionary, \n\n AttributeTag, \n\n typename args_t::value_events_context::type, \n\n typename args_t::value_events_policy,\n","file_path":"include/svgpp/parser/type_or_literal.hpp","rank":34,"score":148529.6895148574},{"content":"struct value_parser<tag::type::color_optional_icc_color, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n PropertySource property_source)\n\n {\n\n namespace qi = boost::spirit::qi;\n\n\n\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef typename boost::parameter::parameters<\n\n boost::parameter::optional<tag::color_factory>,\n\n boost::parameter::optional<tag::icc_color_policy>\n\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\n\n typedef typename detail::unwrap_context<Context, tag::color_factory>::template bind<args2_t>::type color_factory_t;\n\n typedef detail::unwrap_context<Context, tag::icc_color_policy> icc_color_context_t;\n\n typedef typename icc_color_context_t::template bind<args2_t>::type icc_color_policy_t;\n\n typedef typename icc_color_policy_t::icc_color_factory_type icc_color_factory_t;\n\n\n\n icc_color_factory_t & icc_color_factory = icc_color_policy_t::icc_color_factory(icc_color_context_t::get(context));\n","file_path":"include/svgpp/parser/color.hpp","rank":35,"score":147137.81761196136},{"content":"struct get_char_type\n\n{\n\n typedef char16_t type;\n\n};\n\n\n\ntemplate<class WCharType>\n","file_path":"include/svgpp/policy/xml/xerces.hpp","rank":36,"score":145761.46180531703},{"content":"struct attribute_type<ElementTag, AttributeTag,\n\n typename boost::enable_if_c<\n\n boost::mpl::has_key<animation_event_attributes, AttributeTag>::value\n\n || boost::mpl::has_key<graphical_event_attributes, AttributeTag>::value\n\n || boost::mpl::has_key<document_event_attributes, AttributeTag>::value \n\n >::type>\n\n{\n\n typedef tag::type::string type;\n\n};\n\n\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::baseProfile > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::class_ > { typedef tag::type::string type; }; // TODO: parse list of strings\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::contentScriptType > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::contentStyleType > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::id > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::attributeName > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::font_family > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::format > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::glyphRef > { typedef tag::type::string type; };\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::lang > { typedef tag::type::string type; };\n","file_path":"include/svgpp/traits/attribute_type.hpp","rank":37,"score":145183.9040680698},{"content":"struct get_viewport_size_source<tag::element::image, tag::element::svg>\n\n{\n\n typedef tag::viewport_size_source::use_reference type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/adapter/viewport.hpp","rank":38,"score":144704.82526996266},{"content":"struct unwrap_context<const bind_context_parameters_wrapper<Context, Parameters>, PolicyTag>\n\n : unwrap_context<bind_context_parameters_wrapper<Context, Parameters>, PolicyTag>\n\n{};\n\n\n\ntemplate<class OriginalContext, class AdaptedPolicyTag, class AdaptedPolicy>\n","file_path":"include/svgpp/detail/adapt_context.hpp","rank":39,"score":143903.93014754},{"content":"struct length_dimension_by_attribute{ typedef tag::length_dimension::not_width_nor_height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::x> { typedef tag::length_dimension::width type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::y> { typedef tag::length_dimension::height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::x1> { typedef tag::length_dimension::width type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::y1> { typedef tag::length_dimension::height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::x2> { typedef tag::length_dimension::width type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::y2> { typedef tag::length_dimension::height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::width> { typedef tag::length_dimension::width type; }; \n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::height> { typedef tag::length_dimension::height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::rx> { typedef tag::length_dimension::width type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::ry> { typedef tag::length_dimension::height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::cx> { typedef tag::length_dimension::width type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::cy> { typedef tag::length_dimension::height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::refX> { typedef tag::length_dimension::width type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::refY> { typedef tag::length_dimension::height type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::markerWidth> { typedef tag::length_dimension::width type; };\n\ntemplate<> struct length_dimension_by_attribute<tag::attribute::markerHeight> { typedef tag::length_dimension::height type; };\n\n\n\n}}","file_path":"include/svgpp/traits/length_dimension_by_attribute.hpp","rank":40,"score":143598.0084792959},{"content":"class exception_base: public virtual boost::exception, public virtual std::exception\n\n{};\n\n\n","file_path":"include/svgpp/policy/error.hpp","rank":41,"score":143422.71029771632},{"content":"struct value_parser<tag::type::literal_enumeration<LiteralsList>, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class ValueRange, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, ValueRange const & attribute_value, PropertySource)\n\n {\n\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\n\n typedef detail::literal_values_dictionary<typename boost::range_value<ValueRange>::type> dictionary_t;\n\n\n\n detail::literal_enumeration_type_visitor<\n\n dictionary_t, \n\n AttributeTag, \n\n typename args_t::value_events_context::type, \n\n typename args_t::value_events_policy,\n\n ValueRange,\n\n PropertySource\n\n > fn(args_t::value_events_context::get(context), attribute_value);\n\n\n\n boost::mpl::for_each<LiteralsList>(boost::ref(fn));\n\n if (fn.found())\n\n return true;\n\n else\n\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\n\n }\n\n};\n\n\n\n}","file_path":"include/svgpp/parser/literal_enumeration.hpp","rank":42,"score":141752.09466315803},{"content":"struct percentage_adapter: BaseFactory\n\n{\n\n typedef double percentage_type;\n\n \n\n static typename BaseFactory::color_type create_from_percent(percentage_type r, percentage_type g, percentage_type b)\n\n {\n\n return BaseFactory::create(cast_percent(r), cast_percent(g), cast_percent(b));\n\n }\n\n\n\nprivate:\n\n static unsigned char cast_percent(percentage_type c)\n\n {\n\n if (c > 100)\n\n c = 100;\n\n else if (c < 0)\n\n c = 0;\n\n return static_cast<unsigned char>(c * 2.55 + 0.0049);\n\n }\n\n};\n\n\n","file_path":"include/svgpp/factory/integer_color.hpp","rank":43,"score":140184.06284386222},{"content":"struct get_viewport_size_source; // Shouldn't be called for anything other than 'svg' and 'symbol',\n\n // referenced by 'use' or 'image'\n\n // 'symbol' must only be used while referenced by 'use'\n\n\n\ntemplate<>\n","file_path":"include/svgpp/adapter/viewport.hpp","rank":44,"score":137317.6062054354},{"content":"struct child_element_types<tag::element::tref, void>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n traits::descriptive_elements,\n\n boost::mpl::set3<\n\n tag::element::animate,\n\n tag::element::animateColor,\n\n tag::element::set\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":45,"score":136826.44223462878},{"content":"struct child_element_types<tag::element::font, void>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n traits::descriptive_elements,\n\n boost::mpl::set5<\n\n tag::element::font_face,\n\n tag::element::glyph,\n\n tag::element::hkern,\n\n tag::element::missing_glyph,\n\n tag::element::vkern\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":46,"score":136826.44223462878},{"content":"struct child_element_types<tag::element::filter, void>\n\n{\n\n typedef\n\n boost::mpl::fold<\n\n boost::mpl::joint_view<\n\n traits::filter_primitive_elements,\n\n traits::descriptive_elements>,\n\n boost::mpl::set2<\n\n tag::element::animate,\n\n tag::element::set\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":47,"score":136826.44223462878},{"content":"struct child_element_types<tag::element::stop, void>\n\n{\n\n typedef \n\n boost::mpl::set3<\n\n tag::element::animate,\n\n tag::element::animateColor,\n\n tag::element::set\n\n > type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":48,"score":136826.44223462878},{"content":"struct child_element_types<tag::element::text, void>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n boost::mpl::joint_view<\n\n traits::animation_elements,\n\n traits::descriptive_elements>,\n\n boost::mpl::set6<\n\n tag::element::altGlyph,\n\n tag::element::textPath,\n\n tag::element::tref,\n\n tag::element::tspan,\n\n tag::element::a,\n\n tag::text_content\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<class ElementTag>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":49,"score":136826.44223462878},{"content":"struct child_element_types<tag::element::switch_, void>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n boost::mpl::joint_view<\n\n boost::mpl::joint_view<\n\n traits::animation_elements,\n\n traits::descriptive_elements>,\n\n traits::shape_elements>,\n\n boost::mpl::set8<\n\n tag::element::a,\n\n tag::element::foreignObject,\n\n tag::element::g,\n\n tag::element::image,\n\n tag::element::svg,\n\n tag::element::switch_,\n\n tag::element::text,\n\n tag::element::use_\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<class ElementTag>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":50,"score":136826.44223462878},{"content":"struct child_element_types<tag::element::feMerge, void>\n\n{\n\n typedef \n\n boost::mpl::set1<\n\n tag::element::feMergeNode\n\n > type;\n\n};\n\n\n\n}}\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":51,"score":134839.62705868192},{"content":"struct child_element_types<tag::element::font_face, void>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n traits::descriptive_elements,\n\n boost::mpl::set1<\n\n tag::element::font_face_src\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":52,"score":134839.62705868192},{"content":"struct child_element_types<tag::element::feImage, void>\n\n{\n\n typedef \n\n boost::mpl::set3<\n\n tag::element::animate,\n\n tag::element::animateTransform,\n\n tag::element::set\n\n > type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":53,"score":134839.62705868192},{"content":"struct child_element_types<tag::element::feFlood, void>\n\n{\n\n typedef \n\n boost::mpl::set3<\n\n tag::element::animate,\n\n tag::element::animateColor,\n\n tag::element::set\n\n > type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":54,"score":134839.62705868192},{"content":"struct child_element_types<tag::element::clipPath, void>\n\n{\n\n typedef\n\n boost::mpl::fold<\n\n boost::mpl::joint_view<\n\n boost::mpl::joint_view<\n\n traits::animation_elements,\n\n traits::descriptive_elements>,\n\n traits::shape_elements>,\n\n boost::mpl::set2<\n\n tag::element::text,\n\n tag::element::use_\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<class ElementTag>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":55,"score":134839.62705868192},{"content":"struct child_element_types<tag::element::animateMotion, void>\n\n{\n\n typedef\n\n boost::mpl::fold<\n\n traits::descriptive_elements,\n\n boost::mpl::set1<\n\n tag::element::mpath\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":56,"score":134839.62705868192},{"content":"struct attribute_type<tag::element::stop, tag::attribute::offset> \n\n{\n\n typedef boost::mpl::pair<tag::element::stop, tag::attribute::offset> type;\n\n};\n\n\n\ntemplate<class Element> struct attribute_type<Element, tag::attribute::font> \n\n{ \n\n typedef tag::type::type_or_literal<tag::attribute::font, \n\n tag::value::inherit,\n\n tag::value::caption,\n\n tag::value::icon,\n\n tag::value::menu,\n\n tag::value::message_box,\n\n tag::value::small_caption,\n\n tag::value::status_bar\n\n > type; \n\n};\n\n\n\n/*\n\n'font-face' element attributes:\n","file_path":"include/svgpp/traits/attribute_type.hpp","rank":57,"score":133671.87280812915},{"content":"struct child_element_types<tag::element::font_face_uri, void>\n\n{\n\n typedef boost::mpl::set1<tag::element::font_face_format> type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":58,"score":132925.73417646406},{"content":"struct child_element_types<tag::element::altGlyphDef, void>\n\n{\n\n typedef\n\n boost::mpl::set2<\n\n tag::element::altGlyphItem,\n\n tag::element::glyphRef\n\n >\n\n type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":59,"score":132925.73417646406},{"content":"struct child_element_types<tag::element::font_face_src, void>\n\n{\n\n typedef boost::mpl::set2<\n\n tag::element::font_face_name,\n\n tag::element::font_face_uri\n\n > type;\n\n};\n\n\n\ntemplate<class ElementTag>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":60,"score":132925.73417646406},{"content":"struct child_element_types<tag::element::feDiffuseLighting, void>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n traits::light_source_elements,\n\n traits::descriptive_elements,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":61,"score":132925.73417646406},{"content":"struct child_element_types<tag::element::feComponentTransfer, void>\n\n{\n\n typedef \n\n boost::mpl::set4<\n\n svgpp::tag::element::feFuncA,\n\n svgpp::tag::element::feFuncB,\n\n svgpp::tag::element::feFuncG,\n\n svgpp::tag::element::feFuncR\n\n > type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":62,"score":132925.73417646406},{"content":"struct child_element_types<tag::element::altGlyphItem, void>\n\n{\n\n typedef\n\n boost::mpl::set1<\n\n tag::element::glyphRef\n\n >\n\n type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":63,"score":132925.73417646406},{"content":"struct child_element_types<tag::element::feSpecularLighting, void>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n traits::light_source_elements,\n\n traits::descriptive_elements,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":64,"score":132925.73417646406},{"content":"struct need_path_adapter: boost::mpl::bool_<\n\n PathPolicy::absolute_coordinates_only \n\n || PathPolicy::no_ortho_line_to\n\n || PathPolicy::no_quadratic_bezier_shorthand \n\n || PathPolicy::no_cubic_bezier_shorthand \n\n || PathPolicy::quadratic_bezier_as_cubic>\n\n{};\n\n\n\ntemplate<class OriginalContext, class Enabled = void>\n","file_path":"include/svgpp/adapter/path.hpp","rank":65,"score":132903.40714729435},{"content":"struct literal_enumeration_type_visitor: boost::noncopyable\n\n{\n\n literal_enumeration_type_visitor(Context & context, ValueRange const & range)\n\n : context_(context)\n\n , range_(range)\n\n , found_(false)\n\n {}\n\n\n\n template<class T>\n\n void operator ()(T value_tag) \n\n {\n\n if (!found_ && boost::algorithm::equals(range_, Dictionary::template get_name<T>(), \n\n typename boost::mpl::if_<\n\n boost::is_same<PropertySource, tag::source::attribute>, \n\n boost::algorithm::is_equal, \n\n boost::algorithm::is_iequal\n\n >::type()))\n\n {\n\n ValueEventsPolicy::set(context_, AttributeTag(), PropertySource(), value_tag);\n\n found_ = true;\n","file_path":"include/svgpp/parser/literal_enumeration.hpp","rank":66,"score":132523.73807810855},{"content":"struct unwrap_context<const adapted_policy_context_wrapper<OriginalContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\n\n : unwrap_context<adapted_policy_context_wrapper<OriginalContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\n\n{};\n\n\n\ntemplate<class OriginalContext, class AdaptedContext, class AdaptedPolicyTag, class AdaptedPolicy>\n","file_path":"include/svgpp/detail/adapt_context.hpp","rank":67,"score":132223.23106259044},{"content":"struct literal_values_dictionary<SVGPP_ITER_CHAR_TYPE>\n\n : property_values_dictionary<SVGPP_ITER_CHAR_TYPE> \n\n{ \n\n template<class ValueTag>\n\n static string_type get_name();\n\n};\n\n\n\n#define SVGPP_ON_VALUE(name) SVGPP_ON_VALUE2(name, name)\n\n#define SVGPP_ON_VALUE2(name, string) \\\n\n template<> \\\n\n inline literal_values_dictionary<SVGPP_ITER_CHAR_TYPE>::string_type \\\n\n literal_values_dictionary<SVGPP_ITER_CHAR_TYPE>::get_name<tag::value::name>() \\\n\n { static const SVGPP_ITER_CHAR_TYPE value[] = BOOST_PP_CAT(SVGPP_ITER_STRINGIZE, #string); \\\n\n return string_type(value, value + sizeof(value)/sizeof(value[0]) - 1); }\n\n#include <svgpp/detail/dict/enumerate_literal_values.inc>\n\n#undef SVGPP_ON_VALUE\n\n#undef SVGPP_ON_VALUE2\n\n\n\n#undef SVGPP_ITER_CHAR_TYPE\n\n#undef SVGPP_ITER_STRINGIZE\n\n\n\n#endif // !BOOST_PP_IS_ITERATING","file_path":"include/svgpp/detail/literal_values_dictionary.hpp","rank":68,"score":130651.68896057134},{"content":"struct element_iterator<SVGPP_MSXML_NAMESPACE::IXMLDOMNode *>\n\n : element_iterator<msxml_detail::node_ptr>\n\n{};\n\n\n\n}}}\n","file_path":"include/svgpp/policy/xml/msxml.hpp","rank":69,"score":130415.75886835743},{"content":"struct element_iterator<SVGPP_MSXML_NAMESPACE::IXMLDOMElement *>\n\n : element_iterator<msxml_detail::node_ptr>\n\n{};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/policy/xml/msxml.hpp","rank":70,"score":130415.75886835743},{"content":"struct css_property_name_to_id: dictionary_base<attribute_id>\n\n{\n\n struct lower_case_values;\n\n\n\n template<class Ch>\n\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\n\n};\n\n\n\ntemplate<class ValuesHolder, typename ValuesHolder::mapped_type NotFoundValue>\n","file_path":"include/svgpp/detail/names_dictionary.hpp","rank":71,"score":128182.53313251302},{"content":"struct xlink_attribute_name_to_id: dictionary_base<attribute_id>\n\n{\n\n template<class Ch>\n\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\n\n};\n\n\n","file_path":"include/svgpp/detail/names_dictionary.hpp","rank":72,"score":128182.53313251302},{"content":"struct xml_attribute_name_to_id: dictionary_base<attribute_id>\n\n{\n\n template<class Ch>\n\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\n\n};\n\n\n","file_path":"include/svgpp/detail/names_dictionary.hpp","rank":73,"score":128182.53313251302},{"content":"struct unwrap_context<const adapted_context_wrapper<OriginalContext, AdaptedContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\n\n : unwrap_context<adapted_context_wrapper<OriginalContext, AdaptedContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\n\n{};\n\n\n\n}}","file_path":"include/svgpp/detail/adapt_context.hpp","rank":74,"score":127928.46535649474},{"content":"struct svg_real_policies: real_policies_without_inf_nan<Number>\n\n{\n\n static bool const allow_trailing_dot = false;\n\n};\n\n\n\ntemplate<class Number, class PropertySource>\n","file_path":"include/svgpp/parser/detail/common.hpp","rank":75,"score":126098.93730845791},{"content":"#ifndef MATH_FLOAT_HPP\n\n#define MATH_FLOAT_HPP\n\n\n\n#include <cmath>\n\n#include <algorithm>\n\n\n\n#ifdef USE_DOUBLE_AS_FLOAT\n\n #error Using double precision float is currently not supported.\n\n typedef double Float;\n\n#else\n\n typedef float Float;\n\n#endif\n\n\n\nextern const Float FLOAT_TOLERANT;\n\nextern const Float ONE_MINUS_FLOAT_TOLERANT;\n\n\n\nnamespace math {\n\n inline bool COMPARE_EQ(Float x, Float y) {\n\n return std::abs(x - y) < FLOAT_TOLERANT;\n\n }\n","file_path":"include/math/float.hpp","rank":76,"score":125859.19827426758},{"content":"\n\n inline bool COMPARE_EQ(Float x, Float y, Float eps) {\n\n return std::abs(x - y) < eps;\n\n }\n\n\n\n inline bool COMPARE_LEQ(Float x, Float y) {\n\n return COMPARE_EQ(x, y) || (x < y);\n\n }\n\n\n\n inline bool COMPARE_GEQ(Float x, Float y) {\n\n return COMPARE_EQ(x, y) || (x > y);\n\n }\n\n\n\n inline Float lerp(Float t, Float a, Float b) {\n\n return (1 - t) * a + t * b;\n\n }\n\n\n\n template <typename T>\n\n inline T clamp(T x, T min, T max) {\n\n return std::min(max, std::max(min, x));\n\n }\n\n}\n\n\n\n#endif /* MATH_FLOAT_HPP */\n","file_path":"include/math/float.hpp","rank":77,"score":125847.97754558577},{"content":"struct get_default_policy<Context, tag::number_type>\n\n{\n\n typedef typename number_type_by_context<Context>::type type;\n\n};\n\n\n\ntemplate<class Context>\n","file_path":"include/svgpp/policy/detail/default_policies.hpp","rank":78,"score":125822.39129056528},{"content":"struct get_viewport_size_source<tag::element::use_, tag::element::symbol>\n\n{\n\n typedef tag::viewport_size_source::use_reference type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/adapter/viewport.hpp","rank":79,"score":118833.7582090087},{"content":"struct number_policies<Number, tag::source::css>: svg_real_policies<Number>\n\n{\n\n template <typename Iterator>\n\n static BOOST_CONSTEXPR bool parse_exp(Iterator &, Iterator const &)\n\n {\n\n return false;\n\n }\n\n};\n\n\n\ntemplate<class Iterator>\n","file_path":"include/svgpp/parser/detail/common.hpp","rank":80,"score":116788.13948415243},{"content":"struct number_policies<Number, tag::source::attribute>: svg_real_policies<Number>\n\n{\n\n template <typename Iterator>\n\n static bool parse_exp(Iterator & first, Iterator const & last)\n\n {\n\n // Check that \"e\" is followed by integer to be able to parse something like \"4em\" correctly\n\n Iterator it = first;\n\n if (svg_real_policies<Number>::parse_exp(it, last))\n\n {\n\n // Do some prefetch before accepting \"e\" as start of the exponent part\n\n Iterator it2 = it;\n\n int exp_val;\n\n if (svg_real_policies<Number>::parse_exp_n(it2, last, exp_val))\n\n {\n\n first = it;\n\n return true;\n\n }\n\n }\n\n return false;\n\n }\n\n};\n\n\n\ntemplate<class Number>\n","file_path":"include/svgpp/parser/detail/common.hpp","rank":81,"score":116788.13948415243},{"content":"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set10<\n\n tag::element::svg, tag::element::g, tag::element::glyph, tag::element::a, tag::element::defs, tag::element::symbol,\n\n tag::element::marker, tag::element::mask, tag::element::missing_glyph, tag::element::pattern>, ElementTag> >::type>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n boost::mpl::joint_view<\n\n boost::mpl::joint_view<\n\n boost::mpl::joint_view<\n\n boost::mpl::joint_view<\n\n traits::animation_elements,\n\n traits::descriptive_elements>,\n\n traits::shape_elements>,\n\n traits::structural_elements>,\n\n traits::gradient_elements\n\n >,\n\n boost::mpl::set18<\n\n tag::element::a,\n\n tag::element::altGlyphDef,\n\n tag::element::clipPath,\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":82,"score":116681.51076671021},{"content":"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set6<\n\n tag::element::altGlyph, tag::element::desc, tag::element::metadata, \n\n tag::element::script, tag::element::style, tag::element::title\n\n>, ElementTag> >::type>\n\n{\n\n typedef boost::mpl::set1<tag::text_content> type;\n\n};\n\n\n\ntemplate<class ElementTag>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":83,"score":116681.51076671021},{"content":"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set8<\n\n tag::element::animate, tag::element::animateColor, tag::element::animateTransform, \n\n tag::element::color_profile, tag::element::cursor, tag::element::mpath, tag::element::set,\n\n tag::element::view>, ElementTag> >::type>\n\n{\n\n typedef traits::descriptive_elements type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":84,"score":116681.51076671021},{"content":"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set9<\n\n tag::element::rect, tag::element::circle, tag::element::ellipse, tag::element::line, \n\n tag::element::polygon, tag::element::polyline, tag::element::path, tag::element::image,\n\n tag::element::use_>, ElementTag> >::type>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n traits::animation_elements,\n\n traits::descriptive_elements,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":85,"score":116681.51076671021},{"content":"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set14<\n\n tag::element::feBlend, tag::element::feColorMatrix, tag::element::feComposite, tag::element::feConvolveMatrix, \n\n tag::element::feDisplacementMap, tag::element::feDistantLight, tag::element::feGaussianBlur, tag::element::feMergeNode,\n\n tag::element::feMorphology, tag::element::feOffset, tag::element::fePointLight, tag::element::feSpotLight,\n\n tag::element::feTile, tag::element::feTurbulence>, ElementTag> >::type>\n\n{\n\n typedef \n\n boost::mpl::set2<\n\n tag::element::animate,\n\n tag::element::set\n\n > type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":86,"score":116681.51076671021},{"content":"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set2<\n\n tag::element::linearGradient, tag::element::radialGradient>, ElementTag> >::type>\n\n{\n\n typedef \n\n boost::mpl::fold<\n\n traits::descriptive_elements,\n\n boost::mpl::set4<\n\n tag::element::animate,\n\n tag::element::animateTransform,\n\n tag::element::set,\n\n tag::element::stop\n\n >,\n\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\n\n >::type type;\n\n};\n\n\n\ntemplate<>\n","file_path":"include/svgpp/traits/child_element_types.hpp","rank":87,"score":116681.51076671021},{"content":"struct text_content; // Used in child element sequences together with tag::element::* tags to\n\n // mark elements that should handle character data content\n\n\n\n}} // namespace tag\n","file_path":"include/svgpp/definitions.hpp","rank":88,"score":115587.86296808199},{"content":"struct mid_tag {};\n","file_path":"include/svgpp/definitions.hpp","rank":89,"score":105391.29778536694},{"content":"struct by_context\n\n{\n\n typedef default_policy type;\n\n};\n\n\n\n}}}","file_path":"include/svgpp/policy/transform.hpp","rank":90,"score":105391.29778536694},{"content":"struct matrix\n\n{\n\n static const bool join_transforms = true;\n\n static const bool no_rotate_about_point = false;\n\n static const bool no_shorthands = false; \n\n static const bool only_matrix_transform = false;\n\n};\n\n\n\ntypedef matrix default_policy;\n\n\n\ntemplate<class Context>\n","file_path":"include/svgpp/policy/transform.hpp","rank":91,"score":105391.29778536694},{"content":"struct max_tag {};\n\n\n\nnamespace value \n\n{\n\n#define SVGPP_ON_VALUE(tag) struct tag {};\n\n#define SVGPP_ON_VALUE2(tag, string) SVGPP_ON_VALUE(tag)\n\n#include <svgpp/detail/dict/enumerate_literal_values.inc>\n\n#undef SVGPP_ON_VALUE\n\n#undef SVGPP_ON_VALUE2\n\n\n\n struct rect {}; // Used as shape in 'clip' property\n\n struct underline {};\n\n struct overline {};\n\n struct line_through {};\n\n struct blink {};\n\n\n\n struct meet {};\n\n struct slice {};\n\n struct xMinYMin { typedef min_tag x; typedef min_tag y; };\n\n struct xMidYMin { typedef mid_tag x; typedef min_tag y; };\n","file_path":"include/svgpp/definitions.hpp","rank":92,"score":105391.29778536694},{"content":"struct raw\n\n{\n\n static const bool join_transforms = false;\n\n static const bool no_rotate_about_point = false;\n\n static const bool no_shorthands = false; // Replace translate(tx) with translate(tx 0) and scale(scale) with scale(scale scale)\n\n static const bool only_matrix_transform = false;\n\n};\n\n\n","file_path":"include/svgpp/policy/transform.hpp","rank":93,"score":105391.29778536694},{"content":"struct minimal\n\n{\n\n static const bool join_transforms = false;\n\n static const bool no_rotate_about_point = true;\n\n static const bool no_shorthands = true;\n\n static const bool only_matrix_transform = false;\n\n};\n\n\n","file_path":"include/svgpp/policy/transform.hpp","rank":94,"score":105391.29778536694},{"content":"// helper tags\n\nstruct min_tag {};\n","file_path":"include/svgpp/definitions.hpp","rank":95,"score":105391.29778536694},{"content":"#ifndef BEZIER_HPP\n\n#define BEZIER_HPP\n\n\n\n#include <vector>\n\n#include \"math/vector.hpp\"\n\n\n\nnamespace bezier {\n\n using namespace math;\n\n\n\n vector2f curve(std::vector<vector2f> points, float t);\n\n\n\n vector2f elliptical_curve(\n\n const vector2f& p0,\n\n const vector2f& p1,\n\n const vector2f& r,\n\n bool large_arc_flag,\n\n bool sweep_flag,\n\n float x_axis_rotation,\n\n float t\n\n );\n","file_path":"include/bezier.hpp","rank":99,"score":44.71567927973513}],"string":"[\n {\n \"content\": \"struct value_parser<tag::type::string, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, attribute_value);\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\n}\",\n \"file_path\": \"include/svgpp/parser/string.hpp\",\n \"rank\": 0,\n \"score\": 236280.6541854153\n },\n {\n \"content\": \"struct get_viewport_size_source<tag::element::use_, tag::element::svg>\\n\\n{\\n\\n typedef tag::viewport_size_source::reference_override_own type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/adapter/viewport.hpp\",\n \"rank\": 1,\n \"score\": 184513.20181909585\n },\n {\n \"content\": \"struct skip_inherit: Base\\n\\n{\\n\\n using Base::set;\\n\\n\\n\\n template<class AttributeTag>\\n\\n static void set(Context &, AttributeTag, tag::source::any const &, tag::value::inherit,\\n\\n typename boost::enable_if<traits::inherited_property<AttributeTag> >::type * = NULL)\\n\\n {}\\n\\n\\n\\n template<class AttributeTag>\\n\\n static void set(Context &, AttributeTag, tag::source::any const &, tag::value::inherit, tag::source::attribute,\\n\\n typename boost::enable_if<traits::inherited_property<AttributeTag> >::type * = NULL)\\n\\n {}\\n\\n\\n\\n template<class AttributeTag>\\n\\n static void set(Context &, AttributeTag, tag::source::any const &, tag::value::inherit, tag::source::css,\\n\\n typename boost::enable_if<traits::inherited_property<AttributeTag> >::type * = NULL)\\n\\n {}\\n\\n};\\n\\n\\n\\ntemplate<class Context>\\n\",\n \"file_path\": \"include/svgpp/policy/value_events.hpp\",\n \"rank\": 2,\n \"score\": 179816.56954977656\n },\n {\n \"content\": \"struct svg_attribute_name_to_id: dictionary_base<attribute_id>\\n\\n{\\n\\n template<class Ch>\\n\\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/detail/names_dictionary.hpp\",\n \"rank\": 3,\n \"score\": 168827.10899653847\n },\n {\n \"content\": \"struct element_name_to_id: dictionary_base<element_type_id>\\n\\n{\\n\\n template<class Ch>\\n\\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/detail/names_dictionary.hpp\",\n \"rank\": 4,\n \"score\": 168677.9461959993\n },\n {\n \"content\": \"struct element_iterator<xercesc::DOMNode const *>\\n\\n : xerces_detail::string_policy\\n\\n{\\n\\n typedef xercesc::DOMNode const * iterator_type;\\n\\n typedef const XMLCh * element_name_type;\\n\\n typedef const XMLCh * element_text_type;\\n\\n typedef xerces_detail::attribute_iterator attribute_enumerator_type;\\n\\n\\n\\n static void advance_element(iterator_type & xml_node)\\n\\n {\\n\\n find_next<false, false>(xml_node);\\n\\n }\\n\\n\\n\\n static void advance_element_or_text(iterator_type & xml_node)\\n\\n {\\n\\n find_next<false, true>(xml_node);\\n\\n }\\n\\n\\n\\n static bool is_end(iterator_type xml_node)\\n\\n {\\n\",\n \"file_path\": \"include/svgpp/policy/xml/xerces.hpp\",\n \"rank\": 5,\n \"score\": 162039.5161215817\n },\n {\n \"content\": \"struct element_iterator<xercesc::DOMElement const *>\\n\\n : element_iterator<xercesc::DOMNode const *>\\n\\n{};\\n\\n\\n\\n}}}\\n\",\n \"file_path\": \"include/svgpp/policy/xml/xerces.hpp\",\n \"rank\": 6,\n \"score\": 162039.5161215817\n },\n {\n \"content\": \"struct value_parser<tag::type::list_of<tag::type::length>, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n typedef typename traits::length_dimension_by_attribute<AttributeTag>::type direction_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n return parseT<\\n\\n detail::length_grammar_tag,\\n\\n AttributeTag, Context, AttributeValue, PropertySource, direction_t>\\n\\n (tag, context, attribute_value, property_source);\\n\\n }\\n\\n\\n\\nprotected:\\n\\n template<class LengthGrammarTag, class AttributeTag, class Context, class AttributeValue, class PropertySource, class Direction>\\n\\n static bool parseT(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\",\n \"file_path\": \"include/svgpp/parser/length.hpp\",\n \"rank\": 7,\n \"score\": 161882.61139255483\n },\n {\n \"content\": \"struct value_parser<tag::type::list_of<tag::type::number>, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename args_t::number_type coordinate_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef qi::real_parser<coordinate_t, detail::number_policies<coordinate_t, PropertySource> > grammar_t;\\n\\n typedef detail::comma_wsp_rule_no_skip<iterator_t> separator_t;\\n\\n typedef detail::parse_list_iterator<coordinate_t, iterator_t, grammar_t, separator_t> parse_list_iterator_t;\\n\\n typedef detail::finite_function_iterator<parse_list_iterator_t> output_iterator_t;\\n\\n\\n\\n SVGPP_STATIC_IF_SAFE const grammar_t number_grammar;\\n\\n SVGPP_STATIC_IF_SAFE const separator_t separator_grammar;\\n\\n parse_list_iterator_t parse_list(\\n\\n boost::begin(attribute_value), boost::end(attribute_value), \\n\",\n \"file_path\": \"include/svgpp/parser/number.hpp\",\n \"rank\": 8,\n \"score\": 161882.61139255483\n },\n {\n \"content\": \"struct attribute_type\\n\\n{\\n\\n // By default type is specific to attribute\\n\\n typedef Attribute type;\\n\\n};\\n\\n\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::x1 > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::y1 > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::x2 > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::y2 > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::width > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::height > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::r > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::rx > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::ry > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::cx > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::cy > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::refX > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::refY > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::markerWidth > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::markerHeight > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::fx > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::fy > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::startOffset > { typedef tag::type::length type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::textLength > { typedef tag::type::length type; };\\n\\n\\n\\ntemplate<class ElementTag, class AttributeTag>\\n\",\n \"file_path\": \"include/svgpp/traits/attribute_type.hpp\",\n \"rank\": 9,\n \"score\": 160396.7319435013\n },\n {\n \"content\": \"struct value_parser<tag::type::list_of<tag::type::percentage_or_length>, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n : value_parser<tag::type::list_of<tag::type::length>, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n typedef value_parser<tag::type::list_of<tag::type::length>, SVGPP_TEMPLATE_ARGS_PASS> base_type;\\n\\n\\n\\n using base_type::parse;\\n\\n\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n tag::source::css property_source)\\n\\n {\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n return base_type::template parseT<\\n\\n detail::percentage_or_length_grammar_tag,\\n\\n AttributeTag, Context, AttributeValue, \\n\\n tag::source::css, \\n\\n tag::length_dimension::not_width_nor_height>\\n\\n (tag, context, attribute_value, property_source);\\n\\n }\\n\\n};\\n\\n\\n\\n}\",\n \"file_path\": \"include/svgpp/parser/percentage_or_length.hpp\",\n \"rank\": 10,\n \"score\": 158384.2906277508\n },\n {\n \"content\": \"struct get_viewport_size_source<void, tag::element::svg>\\n\\n{\\n\\n typedef tag::viewport_size_source::use_own type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/adapter/viewport.hpp\",\n \"rank\": 11,\n \"score\": 155669.69674172247\n },\n {\n \"content\": \"struct child_element_types;\\n\\n\\n\\ntemplate<class ElementTag>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 12,\n \"score\": 155439.386393058\n },\n {\n \"content\": \"struct get_char_type<WCharType, typename boost::enable_if_c<sizeof(WCharType) == 2>::type>\\n\\n{\\n\\n typedef wchar_t type;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/policy/xml/xerces.hpp\",\n \"rank\": 13,\n \"score\": 154585.52348393877\n },\n {\n \"content\": \"struct value_parser<tag::type::integer, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\\n\\n\\n int value;\\n\\n if (qi::parse(it, end, qi::int_, value) && it == end)\\n\\n {\\n\\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, value);\\n\\n return true;\\n\\n }\\n\\n else\\n\\n {\\n\\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<SVGPP_TEMPLATE_ARGS>\\n\",\n \"file_path\": \"include/svgpp/parser/misc.hpp\",\n \"rank\": 14,\n \"score\": 153161.57706227465\n },\n {\n \"content\": \"struct value_parser<tag::type::funciri, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n : detail::iri_value_parser<boost::mpl::quote2<funciri_grammar>, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n};\\n\\n\\n\\n}\",\n \"file_path\": \"include/svgpp/parser/iri.hpp\",\n \"rank\": 15,\n \"score\": 153161.57706227462\n },\n {\n \"content\": \"struct value_parser<tag::type::angle, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource source)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::angle_factory>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef typename detail::unwrap_context<Context, tag::angle_factory>::template bind<args2_t>::type angle_factory_t;\\n\\n\\n\\n SVGPP_STATIC_IF_SAFE const angle_grammar<PropertySource, iterator_t, angle_factory_t, typename args_t::number_type> grammar;\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\\n typename angle_factory_t::angle_type value;\\n\\n if (boost::spirit::qi::parse(it, end, grammar, value) \\n\\n && it == end)\\n\",\n \"file_path\": \"include/svgpp/parser/angle.hpp\",\n \"rank\": 16,\n \"score\": 153161.57706227462\n },\n {\n \"content\": \"struct value_parser<tag::type::number, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename args_t::number_type coordinate_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\\n SVGPP_STATIC_IF_SAFE const qi::real_parser<coordinate_t, detail::number_policies<coordinate_t, PropertySource> > number;\\n\\n coordinate_t value;\\n\\n if (qi::parse(it, end, number, value) && it == end)\\n\\n {\\n\\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, value);\\n\\n return true;\\n\\n }\\n\\n else\\n\\n {\\n\\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<SVGPP_TEMPLATE_ARGS>\\n\",\n \"file_path\": \"include/svgpp/parser/number.hpp\",\n \"rank\": 17,\n \"score\": 153161.57706227462\n },\n {\n \"content\": \"struct value_parser<tag::type::paint, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n {\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::color_factory>,\\n\\n boost::parameter::optional<tag::icc_color_policy>,\\n\\n boost::parameter::optional<tag::iri_policy>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef typename detail::unwrap_context<Context, tag::color_factory>::template bind<args2_t>::type color_factory_t;\\n\\n typedef detail::unwrap_context<Context, tag::icc_color_policy> icc_color_context_t;\\n\\n typedef typename icc_color_context_t::template bind<args2_t>::type icc_color_policy_t;\\n\\n typedef typename icc_color_policy_t::icc_color_factory_type icc_color_factory_t;\\n\\n typedef typename detail::unwrap_context<Context, tag::iri_policy>::template bind<args2_t>::type iri_policy_t;\\n\\n typedef typename args_t::value_events_policy value_events_policy_t;\\n\\n typename args_t::value_events_context::type & value_events_context = args_t::value_events_context::get(context);\\n\",\n \"file_path\": \"include/svgpp/parser/paint.hpp\",\n \"rank\": 18,\n \"score\": 153161.57706227462\n },\n {\n \"content\": \"struct value_parser<tag::type::color, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::color_factory>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef typename detail::unwrap_context<Context, tag::color_factory>::template bind<args2_t>::type color_factory_t;\\n\\n\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\\n typename color_factory_t::color_type color;\\n\\n if (detail::parse_color<color_factory_t>(it, end, property_source, color) && it == end)\\n\\n {\\n\\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, property_source, color);\\n\\n return true;\\n\\n }\\n\\n else\\n\\n {\\n\\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<SVGPP_TEMPLATE_ARGS>\\n\",\n \"file_path\": \"include/svgpp/parser/color.hpp\",\n \"rank\": 19,\n \"score\": 153161.57706227462\n },\n {\n \"content\": \"struct value_parser<tag::type::iri, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n : detail::iri_value_parser<boost::mpl::bind1<boost::mpl::quote1<iri_grammar>, boost::mpl::_2>, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n};\\n\\n\\n\\ntemplate<SVGPP_TEMPLATE_ARGS>\\n\",\n \"file_path\": \"include/svgpp/parser/iri.hpp\",\n \"rank\": 20,\n \"score\": 153161.57706227462\n },\n {\n \"content\": \"struct value_parser<tag::type::length, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource source)\\n\\n {\\n\\n typedef typename traits::length_dimension_by_attribute<AttributeTag>::type direction_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::length_policy>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef typename detail::unwrap_context<Context, tag::length_policy> length_policy_context;\\n\\n typedef typename length_policy_context::template bind<args2_t>::type length_policy_t;\\n\\n\\n\\n typename length_policy_t::length_factory_type & length_factory \\n\\n = length_policy_t::length_factory(length_policy_context::get(context));\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\\n typename length_policy_t::length_factory_type::length_type value;\\n\\n if (detail::parse_length<direction_t, PropertySource>(length_factory, it, end, value)\\n\",\n \"file_path\": \"include/svgpp/parser/length.hpp\",\n \"rank\": 21,\n \"score\": 153161.57706227462\n },\n {\n \"content\": \"struct is_context_inexpensively_copyable<const Context>: is_context_inexpensively_copyable<Context>\\n\\n{};\\n\\n\\n\\ntemplate<class Context, class Enable = void>\\n\",\n \"file_path\": \"include/svgpp/detail/adapt_context.hpp\",\n \"rank\": 22,\n \"score\": 151389.91213971173\n },\n {\n \"content\": \"struct attribute_iterator<rapidxml_ns::xml_attribute<Ch> const *>\\n\\n{\\n\\n typedef rapidxml_ns::xml_attribute<Ch> const * iterator_type;\\n\\n typedef boost::iterator_range<Ch const *> string_type;\\n\\n typedef string_type attribute_name_type;\\n\\n typedef string_type attribute_value_type;\\n\\n typedef string_type saved_value_type;\\n\\n\\n\\n static string_type get_string_range(string_type const & str)\\n\\n { \\n\\n return str;\\n\\n }\\n\\n\\n\\n static void advance(iterator_type & xml_attribute)\\n\\n {\\n\\n xml_attribute = xml_attribute->next_attribute();\\n\\n }\\n\\n\\n\\n static bool is_end(iterator_type xml_attribute)\\n\\n {\\n\",\n \"file_path\": \"include/svgpp/policy/xml/rapidxml_ns.hpp\",\n \"rank\": 23,\n \"score\": 151389.91213971173\n },\n {\n \"content\": \"struct element_iterator<rapidxml_ns::xml_node<Ch> const *>\\n\\n{\\n\\n typedef rapidxml_ns::xml_node<Ch> const * iterator_type;\\n\\n typedef boost::iterator_range<Ch const *> string_type;\\n\\n typedef boost::iterator_range<Ch const *> element_name_type;\\n\\n typedef boost::iterator_range<Ch const *> element_text_type;\\n\\n typedef rapidxml_ns::xml_attribute<Ch> const * attribute_enumerator_type;\\n\\n\\n\\n static string_type get_string_range(string_type const & str)\\n\\n { \\n\\n return str;\\n\\n }\\n\\n\\n\\n static void advance_element(iterator_type & xml_element)\\n\\n {\\n\\n xml_element = xml_element->next_sibling(); \\n\\n find_next<false>(xml_element);\\n\\n }\\n\\n\\n\\n static void advance_element_or_text(iterator_type & xml_element)\\n\",\n \"file_path\": \"include/svgpp/policy/xml/rapidxml_ns.hpp\",\n \"rank\": 24,\n \"score\": 151389.91213971173\n },\n {\n \"content\": \"struct value_parser<tag::type::clock_value, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n tag::source::attribute source)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\\n // TODO: own type for clock_value\\n\\n SVGPP_STATIC_IF_SAFE const clock_value_grammar<iterator_t, typename args_t::number_type> grammar;\\n\\n typename args_t::number_type value;\\n\\n if (qi::parse(it, end, grammar, value) && it == end)\\n\\n {\\n\\n args_t::value_events_policy::set(args_t::value_events_context::get(context), tag, source, value);\\n\\n return true;\\n\\n }\\n\\n else\\n\\n {\\n\\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\\n\\n }\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"include/svgpp/parser/animation.hpp\",\n \"rank\": 25,\n \"score\": 151067.43682089794\n },\n {\n \"content\": \"struct value_parser<tag::type::transform_list, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n tag::source::attribute)\\n\\n {\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::transform_events_policy>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef detail::bind_context_parameters_wrapper<Context, args2_t> context_t;\\n\\n typedef typename detail::unwrap_context<context_t, tag::transform_events_policy> transform_events_context;\\n\\n typedef typename transform_events_context::policy transform_events_policy;\\n\\n typedef detail::transform_adapter_if_needed<context_t> adapted_context_t; \\n\\n typedef \\n\\n typename detail::unwrap_context<typename adapted_context_t::adapted_context, tag::transform_events_policy>::policy\\n\\n adapted_transform_events_policy;\\n\\n\\n\\n context_t bound_context(context);\\n\",\n \"file_path\": \"include/svgpp/parser/transform_list.hpp\",\n \"rank\": 26,\n \"score\": 149061.32925492615\n },\n {\n \"content\": \"struct value_parser<tag::type::path_data, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n tag::source::attribute)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename args_t::number_type coordinate_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::path_events_policy>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef detail::bind_context_parameters_wrapper<Context, args2_t> context_t;\\n\\n typedef typename detail::unwrap_context<context_t, tag::path_events_policy> path_events_context;\\n\\n typedef detail::path_adapter_if_needed<context_t> adapted_context_t; \\n\\n\\n\\n context_t bound_context(context);\\n\",\n \"file_path\": \"include/svgpp/parser/path_data.hpp\",\n \"rank\": 27,\n \"score\": 149061.32925492615\n },\n {\n \"content\": \"struct value_parser<tag::type::percentage_or_length, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n : value_parser<tag::type::length, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n using value_parser<tag::type::length, SVGPP_TEMPLATE_ARGS_PASS>::parse;\\n\\n\\n\\n template<class AttributeTag, class Context, class AttributeValue>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n tag::source::css property_source)\\n\\n {\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::length_policy>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef typename detail::unwrap_context<Context, tag::length_policy> length_policy_context;\\n\\n typedef typename length_policy_context::template bind<args2_t>::type length_policy_t;\\n\\n\\n\\n typename length_policy_t::length_factory_type & length_factory \\n\\n = length_policy_t::length_factory(length_policy_context::get(context));\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\",\n \"file_path\": \"include/svgpp/parser/percentage_or_length.hpp\",\n \"rank\": 28,\n \"score\": 149061.32925492615\n },\n {\n \"content\": \"struct value_parser<tag::type::number_optional_number, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n tag::source::attribute property_source)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n namespace phx = boost::phoenix;\\n\\n using qi::_1;\\n\\n\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename args_t::number_type coordinate_t;\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n\\n\\n iterator_t it = boost::begin(attribute_value), end = boost::end(attribute_value);\\n\\n SVGPP_STATIC_IF_SAFE const qi::real_parser<coordinate_t, detail::number_policies<coordinate_t, tag::source::attribute> > number;\\n\\n SVGPP_STATIC_IF_SAFE const detail::comma_wsp_rule_no_skip<iterator_t> comma_wsp;\\n\\n coordinate_t value1, value2;\\n\\n bool two_values = false;\\n\\n if (qi::parse(it, end, \\n\",\n \"file_path\": \"include/svgpp/parser/number.hpp\",\n \"rank\": 29,\n \"score\": 149061.32925492615\n },\n {\n \"content\": \"struct string_policy\\n\\n{\\n\\nprotected:\\n\\n typedef get_char_type<>::type char_type;\\n\\n\\n\\npublic:\\n\\n typedef boost::iterator_range<char_type const *> string_type;\\n\\n\\n\\n static string_type get_string_range(XMLCh const * str)\\n\\n {\\n\\n return string_type(\\n\\n reinterpret_cast<char_type const *>(str),\\n\\n reinterpret_cast<char_type const *>(str) + xercesc::XMLString::stringLen(str));\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/policy/xml/xerces.hpp\",\n \"rank\": 30,\n \"score\": 148737.55684773612\n },\n {\n \"content\": \"struct transform_adapter_base\\n\\n{\\n\\n typedef typename boost::mpl::if_c<\\n\\n TransformPolicy::join_transforms,\\n\\n matrix_only_transform_adapter<\\n\\n join_transform_adapter<Context, Number, EventsPolicy> \\n\\n >,\\n\\n typename boost::mpl::if_c<\\n\\n TransformPolicy::only_matrix_transform,\\n\\n matrix_only_transform_adapter<\\n\\n passthrough_transform_adapter<Context, Number, EventsPolicy> \\n\\n >,\\n\\n passthrough_transform_adapter<Context, Number, EventsPolicy>\\n\\n >::type\\n\\n >::type type;\\n\\n};\\n\\n\\n\\n} // namespace detail\\n\\n\\n\\ntemplate<\\n\",\n \"file_path\": \"include/svgpp/adapter/transform.hpp\",\n \"rank\": 31,\n \"score\": 148685.6351310892\n },\n {\n \"content\": \"struct dictionary_base\\n\\n{\\n\\n typedef MappedType mapped_type;\\n\\n\\n\\n template<class Ch> struct value_type\\n\\n {\\n\\n Ch const * key;\\n\\n size_t key_length;\\n\\n mapped_type value;\\n\\n };\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/detail/names_dictionary.hpp\",\n \"rank\": 32,\n \"score\": 148685.6351310892\n },\n {\n \"content\": \"struct integer_base\\n\\n{\\n\\n typedef Value color_type;\\n\\n\\n\\n static color_type create(unsigned char r, unsigned char g, unsigned char b)\\n\\n {\\n\\n return Policy::preset_bits \\n\\n | (static_cast<color_type>(r) << Policy::r_offset)\\n\\n | (static_cast<color_type>(g) << Policy::g_offset)\\n\\n | (static_cast<color_type>(b) << Policy::b_offset);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<\\n\",\n \"file_path\": \"include/svgpp/factory/integer_color.hpp\",\n \"rank\": 33,\n \"score\": 148685.6351310892\n },\n {\n \"content\": \"struct value_parser<\\n\\n tag::type::type_or_literal<InnerType, Value, BOOST_PP_ENUM_PARAMS(SVGPP_TYPE_OR_LITERAL_ARITY, Value)>, \\n\\n SVGPP_TEMPLATE_ARGS_PASS\\n\\n>\\n\\n{\\n\\n typedef value_parser<InnerType, SVGPP_TEMPLATE_ARGS_PASS> inner_parser;\\n\\n\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, \\n\\n AttributeValue const & attribute_value, PropertySource property_source)\\n\\n {\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef detail::literal_values_dictionary<typename boost::range_value<AttributeValue>::type> dictionary;\\n\\n typedef boost::mpl::vector<Value, BOOST_PP_ENUM_PARAMS(SVGPP_TYPE_OR_LITERAL_ARITY, Value)> tag_list;\\n\\n\\n\\n detail::literal_enumeration_type_visitor<\\n\\n dictionary, \\n\\n AttributeTag, \\n\\n typename args_t::value_events_context::type, \\n\\n typename args_t::value_events_policy,\\n\",\n \"file_path\": \"include/svgpp/parser/type_or_literal.hpp\",\n \"rank\": 34,\n \"score\": 148529.6895148574\n },\n {\n \"content\": \"struct value_parser<tag::type::color_optional_icc_color, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \\n\\n PropertySource property_source)\\n\\n {\\n\\n namespace qi = boost::spirit::qi;\\n\\n\\n\\n typedef typename boost::range_const_iterator<AttributeValue>::type iterator_t;\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef typename boost::parameter::parameters<\\n\\n boost::parameter::optional<tag::color_factory>,\\n\\n boost::parameter::optional<tag::icc_color_policy>\\n\\n >::template bind<SVGPP_TEMPLATE_ARGS_PASS>::type args2_t;\\n\\n typedef typename detail::unwrap_context<Context, tag::color_factory>::template bind<args2_t>::type color_factory_t;\\n\\n typedef detail::unwrap_context<Context, tag::icc_color_policy> icc_color_context_t;\\n\\n typedef typename icc_color_context_t::template bind<args2_t>::type icc_color_policy_t;\\n\\n typedef typename icc_color_policy_t::icc_color_factory_type icc_color_factory_t;\\n\\n\\n\\n icc_color_factory_t & icc_color_factory = icc_color_policy_t::icc_color_factory(icc_color_context_t::get(context));\\n\",\n \"file_path\": \"include/svgpp/parser/color.hpp\",\n \"rank\": 35,\n \"score\": 147137.81761196136\n },\n {\n \"content\": \"struct get_char_type\\n\\n{\\n\\n typedef char16_t type;\\n\\n};\\n\\n\\n\\ntemplate<class WCharType>\\n\",\n \"file_path\": \"include/svgpp/policy/xml/xerces.hpp\",\n \"rank\": 36,\n \"score\": 145761.46180531703\n },\n {\n \"content\": \"struct attribute_type<ElementTag, AttributeTag,\\n\\n typename boost::enable_if_c<\\n\\n boost::mpl::has_key<animation_event_attributes, AttributeTag>::value\\n\\n || boost::mpl::has_key<graphical_event_attributes, AttributeTag>::value\\n\\n || boost::mpl::has_key<document_event_attributes, AttributeTag>::value \\n\\n >::type>\\n\\n{\\n\\n typedef tag::type::string type;\\n\\n};\\n\\n\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::baseProfile > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::class_ > { typedef tag::type::string type; }; // TODO: parse list of strings\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::contentScriptType > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::contentStyleType > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::id > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::attributeName > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::font_family > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::format > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::glyphRef > { typedef tag::type::string type; };\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::lang > { typedef tag::type::string type; };\\n\",\n \"file_path\": \"include/svgpp/traits/attribute_type.hpp\",\n \"rank\": 37,\n \"score\": 145183.9040680698\n },\n {\n \"content\": \"struct get_viewport_size_source<tag::element::image, tag::element::svg>\\n\\n{\\n\\n typedef tag::viewport_size_source::use_reference type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/adapter/viewport.hpp\",\n \"rank\": 38,\n \"score\": 144704.82526996266\n },\n {\n \"content\": \"struct unwrap_context<const bind_context_parameters_wrapper<Context, Parameters>, PolicyTag>\\n\\n : unwrap_context<bind_context_parameters_wrapper<Context, Parameters>, PolicyTag>\\n\\n{};\\n\\n\\n\\ntemplate<class OriginalContext, class AdaptedPolicyTag, class AdaptedPolicy>\\n\",\n \"file_path\": \"include/svgpp/detail/adapt_context.hpp\",\n \"rank\": 39,\n \"score\": 143903.93014754\n },\n {\n \"content\": \"struct length_dimension_by_attribute{ typedef tag::length_dimension::not_width_nor_height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::x> { typedef tag::length_dimension::width type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::y> { typedef tag::length_dimension::height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::x1> { typedef tag::length_dimension::width type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::y1> { typedef tag::length_dimension::height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::x2> { typedef tag::length_dimension::width type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::y2> { typedef tag::length_dimension::height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::width> { typedef tag::length_dimension::width type; }; \\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::height> { typedef tag::length_dimension::height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::rx> { typedef tag::length_dimension::width type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::ry> { typedef tag::length_dimension::height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::cx> { typedef tag::length_dimension::width type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::cy> { typedef tag::length_dimension::height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::refX> { typedef tag::length_dimension::width type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::refY> { typedef tag::length_dimension::height type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::markerWidth> { typedef tag::length_dimension::width type; };\\n\\ntemplate<> struct length_dimension_by_attribute<tag::attribute::markerHeight> { typedef tag::length_dimension::height type; };\\n\\n\\n\\n}}\",\n \"file_path\": \"include/svgpp/traits/length_dimension_by_attribute.hpp\",\n \"rank\": 40,\n \"score\": 143598.0084792959\n },\n {\n \"content\": \"class exception_base: public virtual boost::exception, public virtual std::exception\\n\\n{};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/policy/error.hpp\",\n \"rank\": 41,\n \"score\": 143422.71029771632\n },\n {\n \"content\": \"struct value_parser<tag::type::literal_enumeration<LiteralsList>, SVGPP_TEMPLATE_ARGS_PASS>\\n\\n{\\n\\n template<class AttributeTag, class Context, class ValueRange, class PropertySource>\\n\\n static bool parse(AttributeTag tag, Context & context, ValueRange const & attribute_value, PropertySource)\\n\\n {\\n\\n typedef detail::value_parser_parameters<Context, SVGPP_TEMPLATE_ARGS_PASS> args_t;\\n\\n typedef detail::literal_values_dictionary<typename boost::range_value<ValueRange>::type> dictionary_t;\\n\\n\\n\\n detail::literal_enumeration_type_visitor<\\n\\n dictionary_t, \\n\\n AttributeTag, \\n\\n typename args_t::value_events_context::type, \\n\\n typename args_t::value_events_policy,\\n\\n ValueRange,\\n\\n PropertySource\\n\\n > fn(args_t::value_events_context::get(context), attribute_value);\\n\\n\\n\\n boost::mpl::for_each<LiteralsList>(boost::ref(fn));\\n\\n if (fn.found())\\n\\n return true;\\n\\n else\\n\\n return args_t::error_policy::parse_failed(args_t::error_policy_context::get(context), tag, attribute_value);\\n\\n }\\n\\n};\\n\\n\\n\\n}\",\n \"file_path\": \"include/svgpp/parser/literal_enumeration.hpp\",\n \"rank\": 42,\n \"score\": 141752.09466315803\n },\n {\n \"content\": \"struct percentage_adapter: BaseFactory\\n\\n{\\n\\n typedef double percentage_type;\\n\\n \\n\\n static typename BaseFactory::color_type create_from_percent(percentage_type r, percentage_type g, percentage_type b)\\n\\n {\\n\\n return BaseFactory::create(cast_percent(r), cast_percent(g), cast_percent(b));\\n\\n }\\n\\n\\n\\nprivate:\\n\\n static unsigned char cast_percent(percentage_type c)\\n\\n {\\n\\n if (c > 100)\\n\\n c = 100;\\n\\n else if (c < 0)\\n\\n c = 0;\\n\\n return static_cast<unsigned char>(c * 2.55 + 0.0049);\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/factory/integer_color.hpp\",\n \"rank\": 43,\n \"score\": 140184.06284386222\n },\n {\n \"content\": \"struct get_viewport_size_source; // Shouldn't be called for anything other than 'svg' and 'symbol',\\n\\n // referenced by 'use' or 'image'\\n\\n // 'symbol' must only be used while referenced by 'use'\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/adapter/viewport.hpp\",\n \"rank\": 44,\n \"score\": 137317.6062054354\n },\n {\n \"content\": \"struct child_element_types<tag::element::tref, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::set3<\\n\\n tag::element::animate,\\n\\n tag::element::animateColor,\\n\\n tag::element::set\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 45,\n \"score\": 136826.44223462878\n },\n {\n \"content\": \"struct child_element_types<tag::element::font, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::set5<\\n\\n tag::element::font_face,\\n\\n tag::element::glyph,\\n\\n tag::element::hkern,\\n\\n tag::element::missing_glyph,\\n\\n tag::element::vkern\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 46,\n \"score\": 136826.44223462878\n },\n {\n \"content\": \"struct child_element_types<tag::element::filter, void>\\n\\n{\\n\\n typedef\\n\\n boost::mpl::fold<\\n\\n boost::mpl::joint_view<\\n\\n traits::filter_primitive_elements,\\n\\n traits::descriptive_elements>,\\n\\n boost::mpl::set2<\\n\\n tag::element::animate,\\n\\n tag::element::set\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 47,\n \"score\": 136826.44223462878\n },\n {\n \"content\": \"struct child_element_types<tag::element::stop, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::set3<\\n\\n tag::element::animate,\\n\\n tag::element::animateColor,\\n\\n tag::element::set\\n\\n > type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 48,\n \"score\": 136826.44223462878\n },\n {\n \"content\": \"struct child_element_types<tag::element::text, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n boost::mpl::joint_view<\\n\\n traits::animation_elements,\\n\\n traits::descriptive_elements>,\\n\\n boost::mpl::set6<\\n\\n tag::element::altGlyph,\\n\\n tag::element::textPath,\\n\\n tag::element::tref,\\n\\n tag::element::tspan,\\n\\n tag::element::a,\\n\\n tag::text_content\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<class ElementTag>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 49,\n \"score\": 136826.44223462878\n },\n {\n \"content\": \"struct child_element_types<tag::element::switch_, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n boost::mpl::joint_view<\\n\\n boost::mpl::joint_view<\\n\\n traits::animation_elements,\\n\\n traits::descriptive_elements>,\\n\\n traits::shape_elements>,\\n\\n boost::mpl::set8<\\n\\n tag::element::a,\\n\\n tag::element::foreignObject,\\n\\n tag::element::g,\\n\\n tag::element::image,\\n\\n tag::element::svg,\\n\\n tag::element::switch_,\\n\\n tag::element::text,\\n\\n tag::element::use_\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<class ElementTag>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 50,\n \"score\": 136826.44223462878\n },\n {\n \"content\": \"struct child_element_types<tag::element::feMerge, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::set1<\\n\\n tag::element::feMergeNode\\n\\n > type;\\n\\n};\\n\\n\\n\\n}}\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 51,\n \"score\": 134839.62705868192\n },\n {\n \"content\": \"struct child_element_types<tag::element::font_face, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::set1<\\n\\n tag::element::font_face_src\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 52,\n \"score\": 134839.62705868192\n },\n {\n \"content\": \"struct child_element_types<tag::element::feImage, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::set3<\\n\\n tag::element::animate,\\n\\n tag::element::animateTransform,\\n\\n tag::element::set\\n\\n > type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 53,\n \"score\": 134839.62705868192\n },\n {\n \"content\": \"struct child_element_types<tag::element::feFlood, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::set3<\\n\\n tag::element::animate,\\n\\n tag::element::animateColor,\\n\\n tag::element::set\\n\\n > type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 54,\n \"score\": 134839.62705868192\n },\n {\n \"content\": \"struct child_element_types<tag::element::clipPath, void>\\n\\n{\\n\\n typedef\\n\\n boost::mpl::fold<\\n\\n boost::mpl::joint_view<\\n\\n boost::mpl::joint_view<\\n\\n traits::animation_elements,\\n\\n traits::descriptive_elements>,\\n\\n traits::shape_elements>,\\n\\n boost::mpl::set2<\\n\\n tag::element::text,\\n\\n tag::element::use_\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<class ElementTag>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 55,\n \"score\": 134839.62705868192\n },\n {\n \"content\": \"struct child_element_types<tag::element::animateMotion, void>\\n\\n{\\n\\n typedef\\n\\n boost::mpl::fold<\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::set1<\\n\\n tag::element::mpath\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 56,\n \"score\": 134839.62705868192\n },\n {\n \"content\": \"struct attribute_type<tag::element::stop, tag::attribute::offset> \\n\\n{\\n\\n typedef boost::mpl::pair<tag::element::stop, tag::attribute::offset> type;\\n\\n};\\n\\n\\n\\ntemplate<class Element> struct attribute_type<Element, tag::attribute::font> \\n\\n{ \\n\\n typedef tag::type::type_or_literal<tag::attribute::font, \\n\\n tag::value::inherit,\\n\\n tag::value::caption,\\n\\n tag::value::icon,\\n\\n tag::value::menu,\\n\\n tag::value::message_box,\\n\\n tag::value::small_caption,\\n\\n tag::value::status_bar\\n\\n > type; \\n\\n};\\n\\n\\n\\n/*\\n\\n'font-face' element attributes:\\n\",\n \"file_path\": \"include/svgpp/traits/attribute_type.hpp\",\n \"rank\": 57,\n \"score\": 133671.87280812915\n },\n {\n \"content\": \"struct child_element_types<tag::element::font_face_uri, void>\\n\\n{\\n\\n typedef boost::mpl::set1<tag::element::font_face_format> type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 58,\n \"score\": 132925.73417646406\n },\n {\n \"content\": \"struct child_element_types<tag::element::altGlyphDef, void>\\n\\n{\\n\\n typedef\\n\\n boost::mpl::set2<\\n\\n tag::element::altGlyphItem,\\n\\n tag::element::glyphRef\\n\\n >\\n\\n type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 59,\n \"score\": 132925.73417646406\n },\n {\n \"content\": \"struct child_element_types<tag::element::font_face_src, void>\\n\\n{\\n\\n typedef boost::mpl::set2<\\n\\n tag::element::font_face_name,\\n\\n tag::element::font_face_uri\\n\\n > type;\\n\\n};\\n\\n\\n\\ntemplate<class ElementTag>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 60,\n \"score\": 132925.73417646406\n },\n {\n \"content\": \"struct child_element_types<tag::element::feDiffuseLighting, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n traits::light_source_elements,\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 61,\n \"score\": 132925.73417646406\n },\n {\n \"content\": \"struct child_element_types<tag::element::feComponentTransfer, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::set4<\\n\\n svgpp::tag::element::feFuncA,\\n\\n svgpp::tag::element::feFuncB,\\n\\n svgpp::tag::element::feFuncG,\\n\\n svgpp::tag::element::feFuncR\\n\\n > type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 62,\n \"score\": 132925.73417646406\n },\n {\n \"content\": \"struct child_element_types<tag::element::altGlyphItem, void>\\n\\n{\\n\\n typedef\\n\\n boost::mpl::set1<\\n\\n tag::element::glyphRef\\n\\n >\\n\\n type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 63,\n \"score\": 132925.73417646406\n },\n {\n \"content\": \"struct child_element_types<tag::element::feSpecularLighting, void>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n traits::light_source_elements,\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 64,\n \"score\": 132925.73417646406\n },\n {\n \"content\": \"struct need_path_adapter: boost::mpl::bool_<\\n\\n PathPolicy::absolute_coordinates_only \\n\\n || PathPolicy::no_ortho_line_to\\n\\n || PathPolicy::no_quadratic_bezier_shorthand \\n\\n || PathPolicy::no_cubic_bezier_shorthand \\n\\n || PathPolicy::quadratic_bezier_as_cubic>\\n\\n{};\\n\\n\\n\\ntemplate<class OriginalContext, class Enabled = void>\\n\",\n \"file_path\": \"include/svgpp/adapter/path.hpp\",\n \"rank\": 65,\n \"score\": 132903.40714729435\n },\n {\n \"content\": \"struct literal_enumeration_type_visitor: boost::noncopyable\\n\\n{\\n\\n literal_enumeration_type_visitor(Context & context, ValueRange const & range)\\n\\n : context_(context)\\n\\n , range_(range)\\n\\n , found_(false)\\n\\n {}\\n\\n\\n\\n template<class T>\\n\\n void operator ()(T value_tag) \\n\\n {\\n\\n if (!found_ && boost::algorithm::equals(range_, Dictionary::template get_name<T>(), \\n\\n typename boost::mpl::if_<\\n\\n boost::is_same<PropertySource, tag::source::attribute>, \\n\\n boost::algorithm::is_equal, \\n\\n boost::algorithm::is_iequal\\n\\n >::type()))\\n\\n {\\n\\n ValueEventsPolicy::set(context_, AttributeTag(), PropertySource(), value_tag);\\n\\n found_ = true;\\n\",\n \"file_path\": \"include/svgpp/parser/literal_enumeration.hpp\",\n \"rank\": 66,\n \"score\": 132523.73807810855\n },\n {\n \"content\": \"struct unwrap_context<const adapted_policy_context_wrapper<OriginalContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\\n\\n : unwrap_context<adapted_policy_context_wrapper<OriginalContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\\n\\n{};\\n\\n\\n\\ntemplate<class OriginalContext, class AdaptedContext, class AdaptedPolicyTag, class AdaptedPolicy>\\n\",\n \"file_path\": \"include/svgpp/detail/adapt_context.hpp\",\n \"rank\": 67,\n \"score\": 132223.23106259044\n },\n {\n \"content\": \"struct literal_values_dictionary<SVGPP_ITER_CHAR_TYPE>\\n\\n : property_values_dictionary<SVGPP_ITER_CHAR_TYPE> \\n\\n{ \\n\\n template<class ValueTag>\\n\\n static string_type get_name();\\n\\n};\\n\\n\\n\\n#define SVGPP_ON_VALUE(name) SVGPP_ON_VALUE2(name, name)\\n\\n#define SVGPP_ON_VALUE2(name, string) \\\\\\n\\n template<> \\\\\\n\\n inline literal_values_dictionary<SVGPP_ITER_CHAR_TYPE>::string_type \\\\\\n\\n literal_values_dictionary<SVGPP_ITER_CHAR_TYPE>::get_name<tag::value::name>() \\\\\\n\\n { static const SVGPP_ITER_CHAR_TYPE value[] = BOOST_PP_CAT(SVGPP_ITER_STRINGIZE, #string); \\\\\\n\\n return string_type(value, value + sizeof(value)/sizeof(value[0]) - 1); }\\n\\n#include <svgpp/detail/dict/enumerate_literal_values.inc>\\n\\n#undef SVGPP_ON_VALUE\\n\\n#undef SVGPP_ON_VALUE2\\n\\n\\n\\n#undef SVGPP_ITER_CHAR_TYPE\\n\\n#undef SVGPP_ITER_STRINGIZE\\n\\n\\n\\n#endif // !BOOST_PP_IS_ITERATING\",\n \"file_path\": \"include/svgpp/detail/literal_values_dictionary.hpp\",\n \"rank\": 68,\n \"score\": 130651.68896057134\n },\n {\n \"content\": \"struct element_iterator<SVGPP_MSXML_NAMESPACE::IXMLDOMNode *>\\n\\n : element_iterator<msxml_detail::node_ptr>\\n\\n{};\\n\\n\\n\\n}}}\\n\",\n \"file_path\": \"include/svgpp/policy/xml/msxml.hpp\",\n \"rank\": 69,\n \"score\": 130415.75886835743\n },\n {\n \"content\": \"struct element_iterator<SVGPP_MSXML_NAMESPACE::IXMLDOMElement *>\\n\\n : element_iterator<msxml_detail::node_ptr>\\n\\n{};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/policy/xml/msxml.hpp\",\n \"rank\": 70,\n \"score\": 130415.75886835743\n },\n {\n \"content\": \"struct css_property_name_to_id: dictionary_base<attribute_id>\\n\\n{\\n\\n struct lower_case_values;\\n\\n\\n\\n template<class Ch>\\n\\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\\n\\n};\\n\\n\\n\\ntemplate<class ValuesHolder, typename ValuesHolder::mapped_type NotFoundValue>\\n\",\n \"file_path\": \"include/svgpp/detail/names_dictionary.hpp\",\n \"rank\": 71,\n \"score\": 128182.53313251302\n },\n {\n \"content\": \"struct xlink_attribute_name_to_id: dictionary_base<attribute_id>\\n\\n{\\n\\n template<class Ch>\\n\\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/detail/names_dictionary.hpp\",\n \"rank\": 72,\n \"score\": 128182.53313251302\n },\n {\n \"content\": \"struct xml_attribute_name_to_id: dictionary_base<attribute_id>\\n\\n{\\n\\n template<class Ch>\\n\\n inline static boost::iterator_range<value_type<Ch> const *> const & get_map();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/detail/names_dictionary.hpp\",\n \"rank\": 73,\n \"score\": 128182.53313251302\n },\n {\n \"content\": \"struct unwrap_context<const adapted_context_wrapper<OriginalContext, AdaptedContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\\n\\n : unwrap_context<adapted_context_wrapper<OriginalContext, AdaptedContext, AdaptedPolicyTag, AdaptedPolicy>, PolicyTag>\\n\\n{};\\n\\n\\n\\n}}\",\n \"file_path\": \"include/svgpp/detail/adapt_context.hpp\",\n \"rank\": 74,\n \"score\": 127928.46535649474\n },\n {\n \"content\": \"struct svg_real_policies: real_policies_without_inf_nan<Number>\\n\\n{\\n\\n static bool const allow_trailing_dot = false;\\n\\n};\\n\\n\\n\\ntemplate<class Number, class PropertySource>\\n\",\n \"file_path\": \"include/svgpp/parser/detail/common.hpp\",\n \"rank\": 75,\n \"score\": 126098.93730845791\n },\n {\n \"content\": \"#ifndef MATH_FLOAT_HPP\\n\\n#define MATH_FLOAT_HPP\\n\\n\\n\\n#include <cmath>\\n\\n#include <algorithm>\\n\\n\\n\\n#ifdef USE_DOUBLE_AS_FLOAT\\n\\n #error Using double precision float is currently not supported.\\n\\n typedef double Float;\\n\\n#else\\n\\n typedef float Float;\\n\\n#endif\\n\\n\\n\\nextern const Float FLOAT_TOLERANT;\\n\\nextern const Float ONE_MINUS_FLOAT_TOLERANT;\\n\\n\\n\\nnamespace math {\\n\\n inline bool COMPARE_EQ(Float x, Float y) {\\n\\n return std::abs(x - y) < FLOAT_TOLERANT;\\n\\n }\\n\",\n \"file_path\": \"include/math/float.hpp\",\n \"rank\": 76,\n \"score\": 125859.19827426758\n },\n {\n \"content\": \"\\n\\n inline bool COMPARE_EQ(Float x, Float y, Float eps) {\\n\\n return std::abs(x - y) < eps;\\n\\n }\\n\\n\\n\\n inline bool COMPARE_LEQ(Float x, Float y) {\\n\\n return COMPARE_EQ(x, y) || (x < y);\\n\\n }\\n\\n\\n\\n inline bool COMPARE_GEQ(Float x, Float y) {\\n\\n return COMPARE_EQ(x, y) || (x > y);\\n\\n }\\n\\n\\n\\n inline Float lerp(Float t, Float a, Float b) {\\n\\n return (1 - t) * a + t * b;\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n inline T clamp(T x, T min, T max) {\\n\\n return std::min(max, std::max(min, x));\\n\\n }\\n\\n}\\n\\n\\n\\n#endif /* MATH_FLOAT_HPP */\\n\",\n \"file_path\": \"include/math/float.hpp\",\n \"rank\": 77,\n \"score\": 125847.97754558577\n },\n {\n \"content\": \"struct get_default_policy<Context, tag::number_type>\\n\\n{\\n\\n typedef typename number_type_by_context<Context>::type type;\\n\\n};\\n\\n\\n\\ntemplate<class Context>\\n\",\n \"file_path\": \"include/svgpp/policy/detail/default_policies.hpp\",\n \"rank\": 78,\n \"score\": 125822.39129056528\n },\n {\n \"content\": \"struct get_viewport_size_source<tag::element::use_, tag::element::symbol>\\n\\n{\\n\\n typedef tag::viewport_size_source::use_reference type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/adapter/viewport.hpp\",\n \"rank\": 79,\n \"score\": 118833.7582090087\n },\n {\n \"content\": \"struct number_policies<Number, tag::source::css>: svg_real_policies<Number>\\n\\n{\\n\\n template <typename Iterator>\\n\\n static BOOST_CONSTEXPR bool parse_exp(Iterator &, Iterator const &)\\n\\n {\\n\\n return false;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<class Iterator>\\n\",\n \"file_path\": \"include/svgpp/parser/detail/common.hpp\",\n \"rank\": 80,\n \"score\": 116788.13948415243\n },\n {\n \"content\": \"struct number_policies<Number, tag::source::attribute>: svg_real_policies<Number>\\n\\n{\\n\\n template <typename Iterator>\\n\\n static bool parse_exp(Iterator & first, Iterator const & last)\\n\\n {\\n\\n // Check that \\\"e\\\" is followed by integer to be able to parse something like \\\"4em\\\" correctly\\n\\n Iterator it = first;\\n\\n if (svg_real_policies<Number>::parse_exp(it, last))\\n\\n {\\n\\n // Do some prefetch before accepting \\\"e\\\" as start of the exponent part\\n\\n Iterator it2 = it;\\n\\n int exp_val;\\n\\n if (svg_real_policies<Number>::parse_exp_n(it2, last, exp_val))\\n\\n {\\n\\n first = it;\\n\\n return true;\\n\\n }\\n\\n }\\n\\n return false;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<class Number>\\n\",\n \"file_path\": \"include/svgpp/parser/detail/common.hpp\",\n \"rank\": 81,\n \"score\": 116788.13948415243\n },\n {\n \"content\": \"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set10<\\n\\n tag::element::svg, tag::element::g, tag::element::glyph, tag::element::a, tag::element::defs, tag::element::symbol,\\n\\n tag::element::marker, tag::element::mask, tag::element::missing_glyph, tag::element::pattern>, ElementTag> >::type>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n boost::mpl::joint_view<\\n\\n boost::mpl::joint_view<\\n\\n boost::mpl::joint_view<\\n\\n boost::mpl::joint_view<\\n\\n traits::animation_elements,\\n\\n traits::descriptive_elements>,\\n\\n traits::shape_elements>,\\n\\n traits::structural_elements>,\\n\\n traits::gradient_elements\\n\\n >,\\n\\n boost::mpl::set18<\\n\\n tag::element::a,\\n\\n tag::element::altGlyphDef,\\n\\n tag::element::clipPath,\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 82,\n \"score\": 116681.51076671021\n },\n {\n \"content\": \"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set6<\\n\\n tag::element::altGlyph, tag::element::desc, tag::element::metadata, \\n\\n tag::element::script, tag::element::style, tag::element::title\\n\\n>, ElementTag> >::type>\\n\\n{\\n\\n typedef boost::mpl::set1<tag::text_content> type;\\n\\n};\\n\\n\\n\\ntemplate<class ElementTag>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 83,\n \"score\": 116681.51076671021\n },\n {\n \"content\": \"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set8<\\n\\n tag::element::animate, tag::element::animateColor, tag::element::animateTransform, \\n\\n tag::element::color_profile, tag::element::cursor, tag::element::mpath, tag::element::set,\\n\\n tag::element::view>, ElementTag> >::type>\\n\\n{\\n\\n typedef traits::descriptive_elements type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 84,\n \"score\": 116681.51076671021\n },\n {\n \"content\": \"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set9<\\n\\n tag::element::rect, tag::element::circle, tag::element::ellipse, tag::element::line, \\n\\n tag::element::polygon, tag::element::polyline, tag::element::path, tag::element::image,\\n\\n tag::element::use_>, ElementTag> >::type>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n traits::animation_elements,\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 85,\n \"score\": 116681.51076671021\n },\n {\n \"content\": \"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set14<\\n\\n tag::element::feBlend, tag::element::feColorMatrix, tag::element::feComposite, tag::element::feConvolveMatrix, \\n\\n tag::element::feDisplacementMap, tag::element::feDistantLight, tag::element::feGaussianBlur, tag::element::feMergeNode,\\n\\n tag::element::feMorphology, tag::element::feOffset, tag::element::fePointLight, tag::element::feSpotLight,\\n\\n tag::element::feTile, tag::element::feTurbulence>, ElementTag> >::type>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::set2<\\n\\n tag::element::animate,\\n\\n tag::element::set\\n\\n > type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 86,\n \"score\": 116681.51076671021\n },\n {\n \"content\": \"struct child_element_types<ElementTag, typename boost::enable_if<boost::mpl::has_key<boost::mpl::set2<\\n\\n tag::element::linearGradient, tag::element::radialGradient>, ElementTag> >::type>\\n\\n{\\n\\n typedef \\n\\n boost::mpl::fold<\\n\\n traits::descriptive_elements,\\n\\n boost::mpl::set4<\\n\\n tag::element::animate,\\n\\n tag::element::animateTransform,\\n\\n tag::element::set,\\n\\n tag::element::stop\\n\\n >,\\n\\n boost::mpl::insert<boost::mpl::_1, boost::mpl::_2>\\n\\n >::type type;\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"include/svgpp/traits/child_element_types.hpp\",\n \"rank\": 87,\n \"score\": 116681.51076671021\n },\n {\n \"content\": \"struct text_content; // Used in child element sequences together with tag::element::* tags to\\n\\n // mark elements that should handle character data content\\n\\n\\n\\n}} // namespace tag\\n\",\n \"file_path\": \"include/svgpp/definitions.hpp\",\n \"rank\": 88,\n \"score\": 115587.86296808199\n },\n {\n \"content\": \"struct mid_tag {};\\n\",\n \"file_path\": \"include/svgpp/definitions.hpp\",\n \"rank\": 89,\n \"score\": 105391.29778536694\n },\n {\n \"content\": \"struct by_context\\n\\n{\\n\\n typedef default_policy type;\\n\\n};\\n\\n\\n\\n}}}\",\n \"file_path\": \"include/svgpp/policy/transform.hpp\",\n \"rank\": 90,\n \"score\": 105391.29778536694\n },\n {\n \"content\": \"struct matrix\\n\\n{\\n\\n static const bool join_transforms = true;\\n\\n static const bool no_rotate_about_point = false;\\n\\n static const bool no_shorthands = false; \\n\\n static const bool only_matrix_transform = false;\\n\\n};\\n\\n\\n\\ntypedef matrix default_policy;\\n\\n\\n\\ntemplate<class Context>\\n\",\n \"file_path\": \"include/svgpp/policy/transform.hpp\",\n \"rank\": 91,\n \"score\": 105391.29778536694\n },\n {\n \"content\": \"struct max_tag {};\\n\\n\\n\\nnamespace value \\n\\n{\\n\\n#define SVGPP_ON_VALUE(tag) struct tag {};\\n\\n#define SVGPP_ON_VALUE2(tag, string) SVGPP_ON_VALUE(tag)\\n\\n#include <svgpp/detail/dict/enumerate_literal_values.inc>\\n\\n#undef SVGPP_ON_VALUE\\n\\n#undef SVGPP_ON_VALUE2\\n\\n\\n\\n struct rect {}; // Used as shape in 'clip' property\\n\\n struct underline {};\\n\\n struct overline {};\\n\\n struct line_through {};\\n\\n struct blink {};\\n\\n\\n\\n struct meet {};\\n\\n struct slice {};\\n\\n struct xMinYMin { typedef min_tag x; typedef min_tag y; };\\n\\n struct xMidYMin { typedef mid_tag x; typedef min_tag y; };\\n\",\n \"file_path\": \"include/svgpp/definitions.hpp\",\n \"rank\": 92,\n \"score\": 105391.29778536694\n },\n {\n \"content\": \"struct raw\\n\\n{\\n\\n static const bool join_transforms = false;\\n\\n static const bool no_rotate_about_point = false;\\n\\n static const bool no_shorthands = false; // Replace translate(tx) with translate(tx 0) and scale(scale) with scale(scale scale)\\n\\n static const bool only_matrix_transform = false;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/policy/transform.hpp\",\n \"rank\": 93,\n \"score\": 105391.29778536694\n },\n {\n \"content\": \"struct minimal\\n\\n{\\n\\n static const bool join_transforms = false;\\n\\n static const bool no_rotate_about_point = true;\\n\\n static const bool no_shorthands = true;\\n\\n static const bool only_matrix_transform = false;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/svgpp/policy/transform.hpp\",\n \"rank\": 94,\n \"score\": 105391.29778536694\n },\n {\n \"content\": \"// helper tags\\n\\nstruct min_tag {};\\n\",\n \"file_path\": \"include/svgpp/definitions.hpp\",\n \"rank\": 95,\n \"score\": 105391.29778536694\n },\n {\n \"content\": \"#ifndef BEZIER_HPP\\n\\n#define BEZIER_HPP\\n\\n\\n\\n#include <vector>\\n\\n#include \\\"math/vector.hpp\\\"\\n\\n\\n\\nnamespace bezier {\\n\\n using namespace math;\\n\\n\\n\\n vector2f curve(std::vector<vector2f> points, float t);\\n\\n\\n\\n vector2f elliptical_curve(\\n\\n const vector2f& p0,\\n\\n const vector2f& p1,\\n\\n const vector2f& r,\\n\\n bool large_arc_flag,\\n\\n bool sweep_flag,\\n\\n float x_axis_rotation,\\n\\n float t\\n\\n );\\n\",\n \"file_path\": \"include/bezier.hpp\",\n \"rank\": 99,\n \"score\": 44.71567927973513\n }\n]","isConversational":false}}},{"rowIdx":292,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/graphics/examples/vkproto/cmd-buf-benchmark/main.cc"},"repo_name":{"kind":"string","value":"allansrc/fuchsia"},"commit":{"kind":"string","value":"a2c235b33fc4305044d496354a08775f30cdcf37"},"file_code":{"kind":"string","value":"\n\n#include <unistd.h>\n\n#include <memory>\n#include <vector>\n\n#include \"src/graphics/examples/vkproto/common/command_buffers.h\"\n#include \"src/graphics/examples/vkproto/common/command_pool.h\"\n#include \"src/graphics/examples/vkproto/common/debug_utils_messenger.h\"\n#include \"src/graphics/examples/vkproto/common/device.h\"\n#include \"src/graphics/examples/vkproto/common/framebuffers.h\"\n#include \"src/graphics/examples/vkproto/common/graphics_pipeline.h\"\n#include \"src/graphics/examples/vkproto/common/image_view.h\"\n#include \"src/graphics/examples/vkproto/common/instance.h\"\n#include \"src/graphics/examples/vkproto/common/physical_device.h\"\n#include \"src/graphics/examples/vkproto/common/render_pass.h\"\n#include \"src/graphics/examples/vkproto/common/swapchain.h\"\n#include \"src/graphics/examples/vkproto/common/utils.h\"\n\n#include <vulkan/vulkan.hpp>\n\nstatic bool DrawAllFrames(const vkp::Device& vkp_device,\n const vkp::CommandBuffers& vkp_command_buffers);\n\nint main(int argc, char* argv[]) {\n\n#ifndef NDEBUG\n printf(\"Warning - benchmarking debug build.\\n\");\n const bool kEnableValidation = true;\n#else\n const bool kEnableValidation = false;\n#endif\n vkp::Instance vkp_instance(kEnableValidation);\n RTN_IF_MSG(1, !vkp_instance.Init(), \"Instance Initialization Failed.\\n\");\n\n \n if (kEnableValidation) {\n vkp::DebugUtilsMessenger vkp_debug_messenger(vkp_instance.shared());\n RTN_IF_MSG(1, !vkp_debug_messenger.Init(), \"Debug Messenger Initialization Failed.\\n\");\n }\n\n \n vkp::PhysicalDevice vkp_physical_device(vkp_instance.shared());\n RTN_IF_MSG(1, !vkp_physical_device.Init(), \"Phys Device Initialization Failed.\\n\");\n\n \n vkp::Device vkp_device(vkp_physical_device.get());\n RTN_IF_MSG(1, !vkp_device.Init(), \"Logical Device Initialization Failed.\\n\");\n std::shared_ptr<vk::Device> device = vkp_device.shared();\n\n vk::Format image_format;\n vk::Extent2D extent;\n\n \n \n \n std::vector<std::shared_ptr<vkp::ImageView>> vkp_image_views;\n std::vector<vk::ImageView> image_views;\n constexpr uint32_t kCommandBufferCount = 100;\n for (uint32_t i = 0; i < kCommandBufferCount; i++) {\n \n auto vkp_offscreen_image_view =\n std::make_shared<vkp::ImageView>(device, vkp_physical_device.get(), vk::Extent2D{64, 64});\n\n RTN_IF_MSG(1, !vkp_offscreen_image_view->Init(), \"Image View Initialization Failed.\\n\");\n image_format = vkp_offscreen_image_view->format();\n extent = vkp_offscreen_image_view->extent();\n image_views.emplace_back(vkp_offscreen_image_view->get());\n vkp_image_views.emplace_back(std::move(vkp_offscreen_image_view));\n }\n\n \n auto vkp_render_pass = std::make_shared<vkp::RenderPass>(device, image_format, true);\n RTN_IF_MSG(1, !vkp_render_pass->Init(), \"Render Pass Initialization Failed.\\n\");\n\n \n auto vkp_pipeline = std::make_unique<vkp::GraphicsPipeline>(device, extent, vkp_render_pass);\n RTN_IF_MSG(1, !vkp_pipeline->Init(), \"Graphics Pipeline Initialization Failed.\\n\");\n\n \n auto vkp_framebuffer =\n std::make_unique<vkp::Framebuffers>(device, extent, vkp_render_pass->get(), image_views);\n RTN_IF_MSG(1, !vkp_framebuffer->Init(), \"Framebuffers Initialization Failed.\\n\");\n\n \n auto vkp_command_pool =\n std::make_shared<vkp::CommandPool>(device, vkp_device.queue_family_index());\n RTN_IF_MSG(1, !vkp_command_pool->Init(), \"Command Pool Initialization Failed.\\n\");\n\n \n auto vkp_command_buffers = std::make_unique<vkp::CommandBuffers>(\n device, vkp_command_pool, vkp_framebuffer->framebuffers(), vkp_pipeline->get(),\n vkp_render_pass->get(), extent);\n RTN_IF_MSG(1, !vkp_command_buffers->Init(), \"Command Buffer Initialization Failed.\\n\");\n\n sleep(1);\n\n \n if (!DrawAllFrames(vkp_device, *vkp_command_buffers)) {\n RTN_MSG(1, \"First DrawAllFrames Failed.\\n\");\n }\n\n device->waitIdle();\n\n auto start_time = std::chrono::steady_clock::now();\n\n if (!DrawAllFrames(vkp_device, *vkp_command_buffers)) {\n RTN_MSG(1, \"Second DrawAllFrames Failed.\\n\");\n }\n device->waitIdle();\n auto end_time = std::chrono::steady_clock::now();\n\n fprintf(stderr, \"End time: %lld\\n\",\n std::chrono::duration_cast<std::chrono::microseconds>(end_time - start_time).count());\n\n return 0;\n}\n\nbool DrawAllFrames(const vkp::Device& device, const vkp::CommandBuffers& command_buffers) {\n vk::SubmitInfo submit_info;\n submit_info.commandBufferCount = static_cast<uint32_t>(command_buffers.command_buffers().size());\n std::vector<vk::CommandBuffer> command_buffer(submit_info.commandBufferCount);\n for (uint32_t i = 0; i < submit_info.commandBufferCount; i++) {\n command_buffer[i] = command_buffers.command_buffers()[i].get();\n }\n submit_info.pCommandBuffers = command_buffer.data();\n\n if (device.queue().submit(1, &submit_info, vk::Fence()) != vk::Result::eSuccess) {\n RTN_MSG(false, \"Failed to submit draw command buffer.\\n\");\n }\n return true;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <unistd.h>\n\n#include <memory>\n#include <vector>\n\n#include \"src/graphics/examples/vkproto/common/command_buffers.h\"\n#include \"src/graphics/examples/vkproto/common/command_pool.h\"\n#include \"src/graphics/examples/vkproto/common/debug_utils_messenger.h\"\n#include \"src/graphics/examples/vkproto/common/device.h\"\n#include \"src/graphics/examples/vkproto/common/framebuffers.h\"\n#include \"src/graphics/examples/vkproto/common/graphics_pipeline.h\"\n#include \"src/graphics/examples/vkproto/common/image_view.h\"\n#include \"src/graphics/examples/vkproto/common/instance.h\"\n#include \"src/graphics/examples/vkproto/common/physical_device.h\"\n#include \"src/graphics/examples/vkproto/common/render_pass.h\"\n#include \"src/graphics/examples/vkproto/common/swapchain.h\"\n#include \"src/graphics/examples/vkproto/common/utils.h\"\n\n#include <vulkan/vulkan.hpp>\n\nstatic bool DrawAllFrames(const vkp::Device& vkp_device,\n const vkp::CommandBuffers& vkp_command_buffers);\n\nint main(int argc, char* argv[]) {\n\n#ifndef NDEBUG\n printf(\"Warning - benchmarking debug build.\\n\");\n const bool kEnableValidation = true;\n#else\n const bool kEnableValidation = false;\n#endif\n vkp::Instance vkp_instance(kEnableValidation);\n RTN_IF_MSG(1, !vkp_instance.Init(), \"Instance Initialization Failed.\\n\");\n\n \n "},"suffix":{"kind":"string","value":"\n\n \n vkp::PhysicalDevice vkp_physical_device(vkp_instance.shared());\n RTN_IF_MSG(1, !vkp_physical_device.Init(), \"Phys Device Initialization Failed.\\n\");\n\n \n vkp::Device vkp_device(vkp_physical_device.get());\n RTN_IF_MSG(1, !vkp_device.Init(), \"Logical Device Initialization Failed.\\n\");\n std::shared_ptr<vk::Device> device = vkp_device.shared();\n\n vk::Format image_format;\n vk::Extent2D extent;\n\n \n \n \n std::vector<std::shared_ptr<vkp::ImageView>> vkp_image_views;\n std::vector<vk::ImageView> image_views;\n constexpr uint32_t kCommandBufferCount = 100;\n for (uint32_t i = 0; i < kCommandBufferCount; i++) {\n \n auto vkp_offscreen_image_view =\n std::make_shared<vkp::ImageView>(device, vkp_physical_device.get(), vk::Extent2D{64, 64});\n\n RTN_IF_MSG(1, !vkp_offscreen_image_view->Init(), \"Image View Initialization Failed.\\n\");\n image_format = vkp_offscreen_image_view->format();\n extent = vkp_offscreen_image_view->extent();\n image_views.emplace_back(vkp_offscreen_image_view->get());\n vkp_image_views.emplace_back(std::move(vkp_offscreen_image_view));\n }\n\n \n auto vkp_render_pass = std::make_shared<vkp::RenderPass>(device, image_format, true);\n RTN_IF_MSG(1, !vkp_render_pass->Init(), \"Render Pass Initialization Failed.\\n\");\n\n \n auto vkp_pipeline = std::make_unique<vkp::GraphicsPipeline>(device, extent, vkp_render_pass);\n RTN_IF_MSG(1, !vkp_pipeline->Init(), \"Graphics Pipeline Initialization Failed.\\n\");\n\n \n auto vkp_framebuffer =\n std::make_unique<vkp::Framebuffers>(device, extent, vkp_render_pass->get(), image_views);\n RTN_IF_MSG(1, !vkp_framebuffer->Init(), \"Framebuffers Initialization Failed.\\n\");\n\n \n auto vkp_command_pool =\n std::make_shared<vkp::CommandPool>(device, vkp_device.queue_family_index());\n RTN_IF_MSG(1, !vkp_command_pool->Init(), \"Command Pool Initialization Failed.\\n\");\n\n \n auto vkp_command_buffers = std::make_unique<vkp::CommandBuffers>(\n device, vkp_command_pool, vkp_framebuffer->framebuffers(), vkp_pipeline->get(),\n vkp_render_pass->get(), extent);\n RTN_IF_MSG(1, !vkp_command_buffers->Init(), \"Command Buffer Initialization Failed.\\n\");\n\n sleep(1);\n\n \n if (!DrawAllFrames(vkp_device, *vkp_command_buffers)) {\n RTN_MSG(1, \"First DrawAllFrames Failed.\\n\");\n }\n\n device->waitIdle();\n\n auto start_time = std::chrono::steady_clock::now();\n\n if (!DrawAllFrames(vkp_device, *vkp_command_buffers)) {\n RTN_MSG(1, \"Second DrawAllFrames Failed.\\n\");\n }\n device->waitIdle();\n auto end_time = std::chrono::steady_clock::now();\n\n fprintf(stderr, \"End time: %lld\\n\",\n std::chrono::duration_cast<std::chrono::microseconds>(end_time - start_time).count());\n\n return 0;\n}\n\nbool DrawAllFrames(const vkp::Device& device, const vkp::CommandBuffers& command_buffers) {\n vk::SubmitInfo submit_info;\n submit_info.commandBufferCount = static_cast<uint32_t>(command_buffers.command_buffers().size());\n std::vector<vk::CommandBuffer> command_buffer(submit_info.commandBufferCount);\n for (uint32_t i = 0; i < submit_info.commandBufferCount; i++) {\n command_buffer[i] = command_buffers.command_buffers()[i].get();\n }\n submit_info.pCommandBuffers = command_buffer.data();\n\n if (device.queue().submit(1, &submit_info, vk::Fence()) != vk::Result::eSuccess) {\n RTN_MSG(false, \"Failed to submit draw command buffer.\\n\");\n }\n return true;\n}\n"},"middle":{"kind":"string","value":"if (kEnableValidation) {\n vkp::DebugUtilsMessenger vkp_debug_messenger(vkp_instance.shared());\n RTN_IF_MSG(1, !vkp_debug_messenger.Init(), \"Debug Messenger Initialization Failed.\\n\");\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":293,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/resources/track.hpp"},"repo_name":{"kind":"string","value":"mnewhouse/tselements"},"commit":{"kind":"string","value":"bd1c6724018e862156948a680bb1bc70dd28bef6"},"file_code":{"kind":"string","value":"\n\n#pragma once\n\n#include \"tile_library.hpp\"\n#include \"terrain_library.hpp\"\n#include \"texture_library.hpp\"\n#include \"path_library.hpp\"\n#include \"track_layer.hpp\"\n#include \"start_point.hpp\"\n#include \"control_point.hpp\"\n#include \"track_path.hpp\"\n\n#include \"utility/vector2.hpp\"\n\n#include <boost/range/iterator_range.hpp>\n#include <boost/iterator/transform_iterator.hpp>\n#include <boost/iterator/indirect_iterator.hpp>\n\n#include <vector>\n#include <list>\n#include <memory>\n#include <string>\n#include <cstdint>\n#include <cstddef>\n#include <map>\n\nnamespace ts\n{\n namespace resources\n {\n namespace detail\n {\n struct ConstPathRangeTransform\n {\n const resources::TrackPath* operator()(const std::unique_ptr<TrackPath>& p) const\n {\n return p.get();\n }\n };\n\n struct PathRangeTransform\n {\n resources::TrackPath* operator()(const std::unique_ptr<TrackPath>& p) const\n {\n return p.get();\n }\n }; \n }\n\n \n \n \n class Track\n {\n public:\n Track() = default;\n\n Track(const Track&) = default;\n Track& operator=(const Track&) = default;\n\n Track(Track&&) = default;\n Track& operator=(Track&&) = default;\n\n void set_path(const std::string& path);\n const std::string& path() const noexcept;\n\n void set_author(std::string author);\n const std::string& author() const noexcept;\n\n Vector2i size() const;\n void set_size(const Vector2i& size);\n\n void set_height_level_count(std::int32_t height_levels) noexcept;\n std::int32_t height_level_count() const noexcept;\n\n TileLibrary& tile_library() noexcept;\n const TileLibrary& tile_library() const noexcept;\n\n TextureLibrary& texture_library() noexcept;\n const TextureLibrary& texture_library() const noexcept;\n\n TerrainLibrary& terrain_library() noexcept;\n const TerrainLibrary& terrain_library() const noexcept;\n\n PathLibrary& path_library() noexcept;\n const PathLibrary& path_library() const noexcept;\n\n using LayerId = std::uint32_t;\n TrackLayer* create_layer(TrackLayerType type, std::string layer_name, std::uint32_t level);\n\n void deactivate_layer(TrackLayer* layer);\n void activate_layer(TrackLayer* layer); \n\n std::size_t layer_count() const noexcept;\n\n void set_layer_level(TrackLayer* layer, std::uint32_t level);\n std::int32_t shift_towards_front(const TrackLayer* layer, std::int32_t amount = 1);\n std::int32_t shift_towards_back(const TrackLayer* layer, std::int32_t amount = 1);\n\n using LayerOrderInterface = boost::iterator_range<boost::indirect_iterator<TrackLayer* const*>>;\n using ConstLayerOrderInterface = boost::iterator_range<boost::indirect_iterator<const TrackLayer* const*>>;\n\n LayerOrderInterface layers();\n ConstLayerOrderInterface layers() const; \n\n void add_control_point(const ControlPoint& point);\n void add_control_point(const ControlPoint& point, std::size_t idx);\n const std::vector<ControlPoint>& control_points() const;\n void remove_control_point(std::size_t idx);\n void update_control_point(std::size_t idx, const ControlPoint& cp);\n\n void add_start_point(const StartPoint& point);\n const std::vector<StartPoint>& custom_start_points() const;\n\n const std::vector<StartPoint>& start_points() const;\n\n void add_asset(const std::string& path);\n const std::vector<std::string>& assets() const;\n\n private:\n void insert_layer(TrackLayer* layer);\n void update_z_index();\n\n std::string path_;\n std::string author_;\n\n Vector2i size_ = {};\n std::int32_t height_level_count_ = 1;\n\n TileLibrary tile_library_;\n TerrainLibrary terrain_library_;\n TextureLibrary texture_library_;\n PathLibrary path_library_;\n\n std::vector<std::string> assets_;\n\n std::map<LayerId, TrackLayer> layers_;\n std::vector<TrackLayer*> layer_order_;\n\n std::vector<ControlPoint> control_points_;\n std::vector<StartPoint> custom_start_points_;\n mutable std::vector<StartPoint> start_points_;\n };\n\n template<typename LayerType>\n struct LayerOrderInterface\n {\n private:\n friend Track;\n explicit LayerOrderInterface(LayerType** begin, LayerType** end);\n\n LayerType** begin_;\n LayerType** end_;\n };\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#pragma once\n\n#include \"tile_library.hpp\"\n#include \"terrain_library.hpp\"\n#include \"texture_library.hpp\"\n#include \"path_library.hpp\"\n#include \"track_layer.hpp\"\n#include \"start_point.hpp\"\n#include \"control_point.hpp\"\n#include \"track_path.hpp\"\n\n#include \"utility/vector2.hpp\"\n\n#include <boost/range/iterator_range.hpp>\n#include <boost/iterator/transform_iterator.hpp>\n#include <boost/iterator/indirect_iterator.hpp>\n\n#include <vector>\n#include <list>\n#include <memory>\n#include <string>\n#include <"},"suffix":{"kind":"string","value":"ult;\n Track& operator=(const Track&) = default;\n\n Track(Track&&) = default;\n Track& operator=(Track&&) = default;\n\n void set_path(const std::string& path);\n const std::string& path() const noexcept;\n\n void set_author(std::string author);\n const std::string& author() const noexcept;\n\n Vector2i size() const;\n void set_size(const Vector2i& size);\n\n void set_height_level_count(std::int32_t height_levels) noexcept;\n std::int32_t height_level_count() const noexcept;\n\n TileLibrary& tile_library() noexcept;\n const TileLibrary& tile_library() const noexcept;\n\n TextureLibrary& texture_library() noexcept;\n const TextureLibrary& texture_library() const noexcept;\n\n TerrainLibrary& terrain_library() noexcept;\n const TerrainLibrary& terrain_library() const noexcept;\n\n PathLibrary& path_library() noexcept;\n const PathLibrary& path_library() const noexcept;\n\n using LayerId = std::uint32_t;\n TrackLayer* create_layer(TrackLayerType type, std::string layer_name, std::uint32_t level);\n\n void deactivate_layer(TrackLayer* layer);\n void activate_layer(TrackLayer* layer); \n\n std::size_t layer_count() const noexcept;\n\n void set_layer_level(TrackLayer* layer, std::uint32_t level);\n std::int32_t shift_towards_front(const TrackLayer* layer, std::int32_t amount = 1);\n std::int32_t shift_towards_back(const TrackLayer* layer, std::int32_t amount = 1);\n\n using LayerOrderInterface = boost::iterator_range<boost::indirect_iterator<TrackLayer* const*>>;\n using ConstLayerOrderInterface = boost::iterator_range<boost::indirect_iterator<const TrackLayer* const*>>;\n\n LayerOrderInterface layers();\n ConstLayerOrderInterface layers() const; \n\n void add_control_point(const ControlPoint& point);\n void add_control_point(const ControlPoint& point, std::size_t idx);\n const std::vector<ControlPoint>& control_points() const;\n void remove_control_point(std::size_t idx);\n void update_control_point(std::size_t idx, const ControlPoint& cp);\n\n void add_start_point(const StartPoint& point);\n const std::vector<StartPoint>& custom_start_points() const;\n\n const std::vector<StartPoint>& start_points() const;\n\n void add_asset(const std::string& path);\n const std::vector<std::string>& assets() const;\n\n private:\n void insert_layer(TrackLayer* layer);\n void update_z_index();\n\n std::string path_;\n std::string author_;\n\n Vector2i size_ = {};\n std::int32_t height_level_count_ = 1;\n\n TileLibrary tile_library_;\n TerrainLibrary terrain_library_;\n TextureLibrary texture_library_;\n PathLibrary path_library_;\n\n std::vector<std::string> assets_;\n\n std::map<LayerId, TrackLayer> layers_;\n std::vector<TrackLayer*> layer_order_;\n\n std::vector<ControlPoint> control_points_;\n std::vector<StartPoint> custom_start_points_;\n mutable std::vector<StartPoint> start_points_;\n };\n\n template<typename LayerType>\n struct LayerOrderInterface\n {\n private:\n friend Track;\n explicit LayerOrderInterface(LayerType** begin, LayerType** end);\n\n LayerType** begin_;\n LayerType** end_;\n };\n }\n}\n"},"middle":{"kind":"string","value":"cstdint>\n#include <cstddef>\n#include <map>\n\nnamespace ts\n{\n namespace resources\n {\n namespace detail\n {\n struct ConstPathRangeTransform\n {\n const resources::TrackPath* operator()(const std::unique_ptr<TrackPath>& p) const\n {\n return p.get();\n }\n };\n\n struct PathRangeTransform\n {\n resources::TrackPath* operator()(const std::unique_ptr<TrackPath>& p) const\n {\n return p.get();\n }\n }; \n }\n\n \n \n \n class Track\n {\n public:\n Track() = default;\n\n Track(const Track&) = defa"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/*\n\n * Created by Phil on 5/11/2010.\n\n * Copyright 2010 Two Blue Cubes Ltd. All rights reserved.\n\n *\n\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\n\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n */\n\n#ifndef TWOBLUECUBES_CATCH_LIST_HPP_INCLUDED\n\n#define TWOBLUECUBES_CATCH_LIST_HPP_INCLUDED\n\n\n\n#include \"catch_commandline.hpp\"\n\n#include \"catch_text.h\"\n\n#include \"catch_console_colour.hpp\"\n\n#include \"catch_interfaces_reporter.h\"\n\n#include \"catch_test_spec_parser.hpp\"\n\n\n\n#include <limits>\n\n#include <algorithm>\n\n\n\nnamespace Catch {\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":0,"score":106285.11305512878},{"content":" return factories.size();\n\n }\n\n\n\n inline Option<std::size_t> list( Config const& config ) {\n\n Option<std::size_t> listedCount;\n\n if( config.listTests() )\n\n listedCount = listedCount.valueOr(0) + listTests( config );\n\n if( config.listTestNamesOnly() )\n\n listedCount = listedCount.valueOr(0) + listTestsNamesOnly( config );\n\n if( config.listTags() )\n\n listedCount = listedCount.valueOr(0) + listTags( config );\n\n if( config.listReporters() )\n\n listedCount = listedCount.valueOr(0) + listReporters( config );\n\n return listedCount;\n\n }\n\n\n\n} // end namespace Catch\n\n\n\n#endif // TWOBLUECUBES_CATCH_LIST_HPP_INCLUDED\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":1,"score":106284.04172676249},{"content":" ++count;\n\n spellings.insert( spelling );\n\n }\n\n std::string all() const {\n\n std::string out;\n\n for( std::set<std::string>::const_iterator it = spellings.begin(), itEnd = spellings.end();\n\n it != itEnd;\n\n ++it )\n\n out += \"[\" + *it + \"]\";\n\n return out;\n\n }\n\n std::set<std::string> spellings;\n\n std::size_t count;\n\n };\n\n\n\n inline std::size_t listTags( Config const& config ) {\n\n TestSpec testSpec = config.testSpec();\n\n if( config.testSpec().hasFilters() )\n\n Catch::cout() << \"Tags for matching test cases:\\n\";\n\n else {\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":2,"score":106283.11018546503},{"content":" inline std::size_t listTestsNamesOnly( Config const& config ) {\n\n TestSpec testSpec = config.testSpec();\n\n if( !config.testSpec().hasFilters() )\n\n testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( \"*\" ).testSpec();\n\n std::size_t matchedTests = 0;\n\n std::vector<TestCase> matchedTestCases;\n\n getRegistryHub().getTestCaseRegistry().getFilteredTests( testSpec, config, matchedTestCases );\n\n for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end();\n\n it != itEnd;\n\n ++it ) {\n\n matchedTests++;\n\n TestCaseInfo const& testCaseInfo = it->getTestCaseInfo();\n\n Catch::cout() << testCaseInfo.name << std::endl;\n\n }\n\n return matchedTests;\n\n }\n\n\n\n struct TagInfo {\n\n TagInfo() : count ( 0 ) {}\n\n void add( std::string const& spelling ) {\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":3,"score":106281.95762104508},{"content":" Catch::cout() << \"All available tags:\\n\";\n\n testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( \"*\" ).testSpec();\n\n }\n\n\n\n std::map<std::string, TagInfo> tagCounts;\n\n\n\n std::vector<TestCase> matchedTestCases;\n\n getRegistryHub().getTestCaseRegistry().getFilteredTests( testSpec, config, matchedTestCases );\n\n for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end();\n\n it != itEnd;\n\n ++it ) {\n\n for( std::set<std::string>::const_iterator tagIt = it->getTestCaseInfo().tags.begin(),\n\n tagItEnd = it->getTestCaseInfo().tags.end();\n\n tagIt != tagItEnd;\n\n ++tagIt ) {\n\n std::string tagName = *tagIt;\n\n std::string lcaseTagName = toLower( tagName );\n\n std::map<std::string, TagInfo>::iterator countIt = tagCounts.find( lcaseTagName );\n\n if( countIt == tagCounts.end() )\n\n countIt = tagCounts.insert( std::make_pair( lcaseTagName, TagInfo() ) ).first;\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":4,"score":106281.91109259009},{"content":"\n\n inline std::size_t listTests( Config const& config ) {\n\n\n\n TestSpec testSpec = config.testSpec();\n\n if( config.testSpec().hasFilters() )\n\n Catch::cout() << \"Matching test cases:\\n\";\n\n else {\n\n Catch::cout() << \"All available test cases:\\n\";\n\n testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( \"*\" ).testSpec();\n\n }\n\n\n\n std::size_t matchedTests = 0;\n\n TextAttributes nameAttr, tagsAttr;\n\n nameAttr.setInitialIndent( 2 ).setIndent( 4 );\n\n tagsAttr.setIndent( 6 );\n\n\n\n std::vector<TestCase> matchedTestCases;\n\n getRegistryHub().getTestCaseRegistry().getFilteredTests( testSpec, config, matchedTestCases );\n\n for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end();\n\n it != itEnd;\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":5,"score":106279.49501884238},{"content":" inline std::size_t listReporters( Config const& /*config*/ ) {\n\n Catch::cout() << \"Available reporters:\\n\";\n\n IReporterRegistry::FactoryMap const& factories = getRegistryHub().getReporterRegistry().getFactories();\n\n IReporterRegistry::FactoryMap::const_iterator itBegin = factories.begin(), itEnd = factories.end(), it;\n\n std::size_t maxNameLen = 0;\n\n for(it = itBegin; it != itEnd; ++it )\n\n maxNameLen = (std::max)( maxNameLen, it->first.size() );\n\n\n\n for(it = itBegin; it != itEnd; ++it ) {\n\n Text wrapper( it->second->getDescription(), TextAttributes()\n\n .setInitialIndent( 0 )\n\n .setIndent( 7+maxNameLen )\n\n .setWidth( CATCH_CONFIG_CONSOLE_WIDTH - maxNameLen-8 ) );\n\n Catch::cout() << \" \"\n\n << it->first\n\n << \":\"\n\n << std::string( maxNameLen - it->first.size() + 2, ' ' )\n\n << wrapper << \"\\n\";\n\n }\n\n Catch::cout() << std::endl;\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":6,"score":106278.3007672196},{"content":" countIt->second.add( tagName );\n\n }\n\n }\n\n\n\n for( std::map<std::string, TagInfo>::const_iterator countIt = tagCounts.begin(),\n\n countItEnd = tagCounts.end();\n\n countIt != countItEnd;\n\n ++countIt ) {\n\n std::ostringstream oss;\n\n oss << \" \" << std::setw(2) << countIt->second.count << \" \";\n\n Text wrapper( countIt->second.all(), TextAttributes()\n\n .setInitialIndent( 0 )\n\n .setIndent( oss.str().size() )\n\n .setWidth( CATCH_CONFIG_CONSOLE_WIDTH-10 ) );\n\n Catch::cout() << oss.str() << wrapper << \"\\n\";\n\n }\n\n Catch::cout() << pluralise( tagCounts.size(), \"tag\" ) << \"\\n\" << std::endl;\n\n return tagCounts.size();\n\n }\n\n\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":7,"score":106275.8980097289},{"content":" ++it ) {\n\n matchedTests++;\n\n TestCaseInfo const& testCaseInfo = it->getTestCaseInfo();\n\n Colour::Code colour = testCaseInfo.isHidden()\n\n ? Colour::SecondaryText\n\n : Colour::None;\n\n Colour colourGuard( colour );\n\n\n\n Catch::cout() << Text( testCaseInfo.name, nameAttr ) << std::endl;\n\n if( !testCaseInfo.tags.empty() )\n\n Catch::cout() << Text( testCaseInfo.tagsAsString, tagsAttr ) << std::endl;\n\n }\n\n\n\n if( !config.testSpec().hasFilters() )\n\n Catch::cout() << pluralise( matchedTests, \"test case\" ) << \"\\n\" << std::endl;\n\n else\n\n Catch::cout() << pluralise( matchedTests, \"matching test case\" ) << \"\\n\" << std::endl;\n\n return matchedTests;\n\n }\n\n\n","file_path":"dependencies/catch/include/internal/catch_list.hpp","rank":8,"score":106275.71357107938},{"content":"#include \"catch.hpp\"\n\n#include <vector>\n\n\n\n\n\n// vedctor\n\nTEST_CASE( \"vector<int> -> toString\", \"[toString][vector]\" )\n\n{\n\n std::vector<int> vv;\n\n REQUIRE( Catch::toString(vv) == \"{ }\" );\n\n vv.push_back( 42 );\n\n REQUIRE( Catch::toString(vv) == \"{ 42 }\" );\n\n vv.push_back( 250 );\n\n REQUIRE( Catch::toString(vv) == \"{ 42, 250 }\" );\n\n}\n\n\n\nTEST_CASE( \"vector<string> -> toString\", \"[toString][vector]\" )\n\n{\n\n std::vector<std::string> vv;\n\n REQUIRE( Catch::toString(vv) == \"{ }\" );\n\n vv.push_back( \"hello\" );\n","file_path":"dependencies/catch/projects/SelfTest/ToStringVector.cpp","rank":9,"score":104656.754491409},{"content":" REQUIRE( Catch::toString(vv) == \"{ 42, 250 }\" );\n\n}\n\n\n\nTEST_CASE( \"vec<vec<string,alloc>> -> toString\", \"[toString][vector,allocator]\" ) {\n\n typedef std::vector<std::string,minimal_allocator<std::string> > inner;\n\n typedef std::vector<inner> vector;\n\n vector v;\n\n REQUIRE( Catch::toString(v) == \"{ }\" );\n\n v.push_back( inner { \"hello\" } );\n\n v.push_back( inner { \"world\" } );\n\n REQUIRE( Catch::toString(v) == \"{ { \\\"hello\\\" }, { \\\"world\\\" } }\" );\n\n}\n\n\n\n#ifdef __clang__\n\n#pragma clang diagnostic pop\n\n#endif\n\n#endif // CATCH_CPP11_OR_GREATER\n","file_path":"dependencies/catch/projects/SelfTest/ToStringVector.cpp","rank":10,"score":104654.56610708775},{"content":" typedef std::size_t size_type;\n\n T *allocate( size_type n ) {\n\n return static_cast<T *>( ::operator new( n * sizeof(T) ) );\n\n }\n\n void deallocate( T *p, size_type /*n*/ ) {\n\n ::operator delete( static_cast<void *>(p) );\n\n }\n\n template<typename U>\n\n bool operator==( const minimal_allocator<U>& ) const { return true; }\n\n template<typename U>\n\n bool operator!=( const minimal_allocator<U>& ) const { return false; }\n\n };\n\n}\n\n\n\nTEST_CASE( \"vector<int,allocator> -> toString\", \"[toString][vector,allocator]\" ) {\n\n std::vector<int,minimal_allocator<int> > vv;\n\n REQUIRE( Catch::toString(vv) == \"{ }\" );\n\n vv.push_back( 42 );\n\n REQUIRE( Catch::toString(vv) == \"{ 42 }\" );\n\n vv.push_back( 250 );\n","file_path":"dependencies/catch/projects/SelfTest/ToStringVector.cpp","rank":11,"score":104648.14493087585},{"content":" REQUIRE( Catch::toString(vv) == \"{ \\\"hello\\\" }\" );\n\n vv.push_back( \"world\" );\n\n REQUIRE( Catch::toString(vv) == \"{ \\\"hello\\\", \\\"world\\\" }\" );\n\n}\n\n\n\n#if defined(CATCH_CPP11_OR_GREATER)\n\n#ifdef __clang__\n\n#pragma clang diagnostic push\n\n#pragma clang diagnostic ignored \"-Wc++98-compat\"\n\n#endif\n\n\n\n/*\n\n Note: These tests *can* be made to work with C++ < 11, but the\n\n allocator is a lot more work...\n\n*/\n\nnamespace {\n\n /* Minimal Allocator */\n\n template<typename T>\n\n struct minimal_allocator {\n\n typedef T value_type;\n","file_path":"dependencies/catch/projects/SelfTest/ToStringVector.cpp","rank":12,"score":104647.09308975127},{"content":"struct StringMaker :\n\n Detail::StringMakerBase<Detail::IsStreamInsertable<T>::value> {};\n\n\n\ntemplate<typename T>\n","file_path":"dependencies/catch/single_include/catch.hpp","rank":13,"score":102943.81152685128},{"content":"struct StringMaker<T*> {\n\n template<typename U>\n\n static std::string convert( U* p ) {\n\n if( !p )\n\n return INTERNAL_CATCH_STRINGIFY( NULL );\n\n else\n\n return Detail::rawMemoryToString( p );\n\n }\n\n};\n\n\n\ntemplate<typename R, typename C>\n","file_path":"dependencies/catch/single_include/catch.hpp","rank":14,"score":99827.84109724201},{"content":" struct point *list; /* allocated list */\n","file_path":"dependencies/zlib-1.2.8/examples/zran.c","rank":15,"score":97027.0703027005},{"content":"std::string toString( T const& value ) {\n\n return StringMaker<T>::convert( value );\n","file_path":"dependencies/catch/include/internal/catch_tostring.h","rank":16,"score":96894.96121409806},{"content":"struct StringMaker<R C::*> {\n\n static std::string convert( R C::* p ) {\n\n if( !p )\n\n return INTERNAL_CATCH_STRINGIFY( NULL );\n\n else\n\n return Detail::rawMemoryToString( p );\n\n }\n\n};\n\n\n\nnamespace Detail {\n\n template<typename InputIterator>\n\n std::string rangeToString( InputIterator first, InputIterator last );\n\n}\n\n\n\n//template<typename T, typename Allocator>\n\n//struct StringMaker<std::vector<T, Allocator> > {\n\n// static std::string convert( std::vector<T,Allocator> const& v ) {\n\n// return Detail::rangeToString( v.begin(), v.end() );\n\n// }\n\n//};\n","file_path":"dependencies/catch/single_include/catch.hpp","rank":17,"score":96894.96121409806},{"content":"\tcpConstraint *constraintList;\n","file_path":"dependencies/chipmunk-7.0.2/include/chipmunk/chipmunk_structs.h","rank":18,"score":94140.14914889622},{"content":"\tcpArbiter *arbiterList;\n","file_path":"dependencies/chipmunk-7.0.2/include/chipmunk/chipmunk_structs.h","rank":19,"score":94140.14914889622},{"content":"\tcpShape *shapeList;\n","file_path":"dependencies/chipmunk-7.0.2/include/chipmunk/chipmunk_structs.h","rank":20,"score":94140.14914889622},{"content":"struct StringMaker<std::tuple<Types...>> {\n\n\n\n static std::string convert( const std::tuple<Types...>& tuple )\n\n {\n\n std::ostringstream os;\n\n os << '{';\n\n TupleDetail::ElementPrinter<std::tuple<Types...>>::print( tuple, os );\n\n os << \" }\";\n\n return os.str();\n\n }\n\n};\n\n#endif // CATCH_CONFIG_CPP11_TUPLE\n\n\n\nnamespace Detail {\n\n template<typename T>\n\n std::string makeString( T const& value ) {\n\n return StringMaker<T>::convert( value );\n\n }\n\n} // end namespace Detail\n\n\n","file_path":"dependencies/catch/single_include/catch.hpp","rank":21,"score":94129.49518961307},{"content":" CHAR DeviceString[128]; \n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/wglew.h","rank":22,"score":91517.50637859157},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_AMD_pinned_memory;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":23,"score":86724.79632590723},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_SUN_triangle_list;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":24,"score":86715.3553509698},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_list_priority;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":25,"score":86715.3553509698},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_specular_vector;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":26,"score":86712.08613964343},{"content":"WGLEW_VAR_EXPORT GLboolean __WGLEW_EXT_extensions_string;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/wglew.h","rank":27,"score":86705.541664955},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_GREMEDY_string_marker;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":28,"score":86705.541664955},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_REGAL_error_string;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":29,"score":86705.541664955},{"content":"WGLEW_VAR_EXPORT GLboolean __WGLEW_ARB_extensions_string;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/wglew.h","rank":30,"score":86705.541664955},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_AMD_pinned_memory;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":31,"score":84503.21860697691},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_NVX_gpu_memory_info;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":32,"score":84503.21860697691},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_IBM_vertex_array_lists;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":33,"score":84494.01947590022},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_SUN_triangle_list;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":34,"score":84494.01947590022},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_list_priority;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":35,"score":84494.01947590022},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_specular_vector;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":36,"score":84490.83401002325},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_GREMEDY_string_marker;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":37,"score":84484.45718126498},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_REGAL_error_string;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":38,"score":84484.45718126498},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_NVX_gpu_memory_info;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":39,"score":82392.61578981737},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_NV_vertex_buffer_unified_memory;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":40,"score":82392.61578981737},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_IBM_vertex_array_lists;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":41,"score":82383.64642172825},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_NV_vertex_buffer_unified_memory;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":42,"score":80384.875175908},{"content":"struct ImGuiListClipper; // Helper to manually clip large list of items\n","file_path":"src/imgui/imgui.h","rank":43,"score":71992.0353780674},{"content":"struct ImDrawList; // A single draw command list (generally one per window)\n","file_path":"src/imgui/imgui.h","rank":44,"score":70056.62963776068},{"content":"struct has_toString { };\n","file_path":"dependencies/catch/projects/SelfTest/ToStringWhich.cpp","rank":45,"score":67366.04175752998},{"content":"struct has_maker_and_toString {};\n\n\n\nnamespace Catch {\n\n inline std::string toString( const has_toString& ) {\n\n return \"toString( has_toString )\";\n\n }\n\n inline std::string toString( const has_maker_and_toString& ) {\n\n return \"toString( has_maker_and_toString )\";\n\n }\n\n template<>\n\n struct StringMaker<has_maker> {\n\n static std::string convert( const has_maker& ) {\n\n return \"StringMaker<has_maker>\";\n\n }\n\n };\n\n template<>\n\n struct StringMaker<has_maker_and_toString> {\n\n static std::string convert( const has_maker_and_toString& ) {\n\n return \"StringMaker<has_maker_and_toString>\";\n\n }\n","file_path":"dependencies/catch/projects/SelfTest/ToStringWhich.cpp","rank":46,"score":66038.85746424063},{"content":"/*\n\n* TS Elements\n\n* Copyright 2015-2018 M. Newhouse\n\n* Released under the MIT license.\n\n*/\n\n\n\n#pragma once\n\n\n\n#include <algorithm>\n\n#include <cctype>\n\n#include <iterator>\n\n\n\n#include <boost/utility/string_ref.hpp>\n\n#include <boost/functional/hash.hpp>\n\n\n\n#include \"caseless_string_compare.hpp\"\n\n\n\nnamespace ts\n\n{\n\n // This function template splits a block of memory by newlines. \n","file_path":"src/utility/string_utilities.hpp","rank":47,"score":57740.87699236288},{"content":"/*\n\n* TS Elements\n\n* Copyright 2015-2018 M. Newhouse\n\n* Released under the MIT license.\n\n*/\n\n\n\n#include \"string_utilities.hpp\"\n\n\n\n#include <iostream>\n\n\n\nnamespace ts\n\n{\n\n}","file_path":"src/utility/string_utilities.cpp","rank":48,"score":57731.30341313457},{"content":"class ImVector\n\n{\n\npublic:\n\n int Size;\n\n int Capacity;\n\n T* Data;\n\n\n\n typedef T value_type;\n\n typedef value_type* iterator;\n\n typedef const value_type* const_iterator;\n\n\n\n ImVector() { Size = Capacity = 0; Data = NULL; }\n\n ~ImVector() { if (Data) ImGui::MemFree(Data); }\n\n\n\n inline bool empty() const { return Size == 0; }\n\n inline int size() const { return Size; }\n\n inline int capacity() const { return Capacity; }\n\n\n\n inline value_type& operator[](int i) { IM_ASSERT(i < Size); return Data[i]; }\n\n inline const value_type& operator[](int i) const { IM_ASSERT(i < Size); return Data[i]; }\n","file_path":"src/imgui/imgui.h","rank":49,"score":57727.78906196238},{"content":" // OutputIt must be dereferencable and then assignable from a brace-init-list\n\n // containing a const char* and a std::size_t.\n\n // For example, a (back_)insert_iterator for a container holding strings or string_refs.\n\n template <typename OutputIt>\n\n std::size_t split_by_line(const char* data, std::size_t data_size, OutputIt out)\n\n {\n\n std::size_t count = 0;\n\n for (auto end = data + data_size; data != end; ++count)\n\n {\n\n const char* line_end = std::find(data, end, '\\n');\n\n std::size_t line_size = std::distance(data, line_end);\n\n\n\n *out = { data, line_size }; ++out;\n\n\n\n data = std::find_if(line_end, end, [](char ch) { return ch != '\\n'; });\n\n }\n\n\n\n return count;\n\n }\n\n\n","file_path":"src/utility/string_utilities.hpp","rank":50,"score":57727.29339691259},{"content":" if (new_size == boost::string_ref::npos) new_size = string.size();\n\n\n\n return boost::string_ref(string.data(), new_size);\n\n }\n\n\n\n\n\n template <typename String>\n\n inline void primitive_tolower(String& string)\n\n {\n\n using std::begin;\n\n using std::end;\n\n\n\n std::transform(begin(string), end(string), begin(string), [](auto ch) { return std::tolower(ch); });\n\n }\n\n\n\n struct StringRefHasher\n\n {\n\n auto operator()(boost::string_ref string) const\n\n {\n\n return boost::hash_range(string.begin(), string.end());\n\n }\n\n };\n\n}\n","file_path":"src/utility/string_utilities.hpp","rank":51,"score":57727.214206387434},{"content":" inline boost::string_ref make_string_ref(const char* data, const char* end)\n\n {\n\n return boost::string_ref(data, std::distance(data, end));\n\n }\n\n\n\n inline boost::string_ref remove_leading_spaces(boost::string_ref string, const char* spaces = \" \\t\\r\\n\")\n\n {\n\n auto pos = string.find_first_not_of(spaces);\n\n if (pos == std::string::npos) pos = string.size();\n\n\n\n string.remove_prefix(pos);\n\n return string;\n\n }\n\n\n\n inline boost::string_ref extract_word(boost::string_ref string)\n\n {\n\n const char spaces[] = \" \\t\\r\\n\";\n\n string = remove_leading_spaces(string, spaces);\n\n\n\n auto new_size = string.find_first_of(spaces);\n","file_path":"src/utility/string_utilities.hpp","rank":52,"score":57727.178707422354},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_ARB_shading_language_include;\n","file_path":"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h","rank":53,"score":57155.71522148998},{"content":"GLEW_VAR_EXPORT GLboolean __GLEW_ARB_shading_language_include;\n","file_path":"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h","rank":54,"score":56166.15355421444},{"content":"/*\n\n* TS Elements\n\n* Copyright 2015-2018 M. Newhouse\n\n* Released under the MIT license.\n\n*/\n\n\n\n#pragma once\n\n\n\n#include <string>\n\n#include <initializer_list>\n\n\n\n#include <boost/utility/string_ref.hpp>\n\n#include <boost/filesystem/path.hpp>\n\n\n\nnamespace ts\n\n{\n\n namespace resources\n\n {\n\n // These are utility functions that take a file name and a list of search directories, \n\n // iterating over these directories until the specified file name is found in one of them.\n\n // find_include_directory returns only the directory, find_include_path returns the full path.\n\n // If the file is not found, an empty-state object is returned.\n\n // Paths are expected to be UTF-8 encoded.\n\n\n\n boost::string_ref find_include_directory(boost::string_ref file_name, std::initializer_list<boost::string_ref> search_paths);\n\n boost::filesystem::path find_include_path(boost::string_ref file_name, std::initializer_list<boost::string_ref> search_paths);\n\n }\n\n}\n","file_path":"src/resources/include_path.hpp","rank":55,"score":55881.96144167202},{"content":"/*\n\n* TS Elements\n\n* Copyright 2015-2018 M. Newhouse\n\n* Released under the MIT license.\n\n*/\n\n\n\n\n\n#include \"include_path.hpp\"\n\n\n\n#include <boost/filesystem/convenience.hpp>\n\n\n\nnamespace ts\n\n{\n\n namespace resources\n\n {\n\n namespace bfs = boost::filesystem;\n\n\n\n bfs::path find_include_path(boost::string_ref file_name,\n\n std::initializer_list<boost::string_ref> search_paths)\n\n {\n","file_path":"src/resources/include_path.cpp","rank":56,"score":55876.6744837734},{"content":" _stream << \"\\n\";\n\n _stream << *it;\n\n }\n\n return _stream;\n\n }\n\n\n\n private:\n\n std::string str;\n\n TextAttributes attr;\n\n std::vector<std::string> lines;\n\n };\n\n\n\n} // end namespace Tbc\n\n\n\n#ifdef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE\n\n} // end outer namespace\n\n#endif\n\n\n\n#endif // TBC_TEXT_FORMAT_H_INCLUDED\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":57,"score":55875.53000111851},{"content":"#define STITCH_TBC_TEXT_FORMAT_OPEN_NAMESPACE STITCH_CLARA_OPEN_NAMESPACE\n\n\n\n// ----------- #included from tbc_text_format.h -----------\n\n\n\n/*\n\n * Created by Phil on 18/4/2013.\n\n * Copyright 2013 Two Blue Cubes Ltd. All rights reserved.\n\n *\n\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\n\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n */\n\n// Only use header guard if we are not using an outer namespace\n\n#if !defined(TBC_TEXT_FORMAT_H_INCLUDED) || defined(STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE)\n\n#ifndef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE\n\n#define TBC_TEXT_FORMAT_H_INCLUDED\n\n#endif\n\n\n\n#include <string>\n\n#include <vector>\n\n#include <sstream>\n","file_path":"dependencies/catch/include/external/clara.h","rank":58,"score":55873.01179513845},{"content":" bfs::path full_path;\n\n for (boost::string_ref path : search_paths)\n\n {\n\n full_path.assign(path.begin(), path.end());\n\n full_path.append(file_name.begin(), file_name.end());\n\n\n\n if (boost::filesystem::is_regular_file(full_path)) return full_path;\n\n }\n\n\n\n full_path.clear();\n\n return full_path;\n\n }\n\n\n\n boost::string_ref find_include_directory(boost::string_ref file_name,\n\n std::initializer_list<boost::string_ref> search_paths)\n\n {\n\n bfs::path full_path;\n\n for (boost::string_ref path : search_paths)\n\n {\n\n full_path.assign(path.begin(), path.end());\n\n full_path.append(file_name.begin(), file_name.end());\n\n\n\n if (boost::filesystem::is_regular_file(full_path)) return path;\n\n }\n\n\n\n return boost::string_ref();\n\n }\n\n }\n\n}","file_path":"src/resources/include_path.cpp","rank":59,"score":55872.448492608855},{"content":"// ----------- end of #include from tbc_text_format.h -----------\n\n// ........... back in /Users/philnash/Dev/OSS/Clara/srcs/clara.h\n\n\n\n#undef STITCH_TBC_TEXT_FORMAT_OPEN_NAMESPACE\n\n\n\n\n\n#include <map>\n\n#include <algorithm>\n\n#include <stdexcept>\n\n#include <memory>\n\n\n\n// Use optional outer namespace\n\n#ifdef STITCH_CLARA_OPEN_NAMESPACE\n\nSTITCH_CLARA_OPEN_NAMESPACE\n\n#endif\n\n\n\nnamespace Clara {\n\n\n\n struct UnpositionalTag {};\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":60,"score":55871.36334788559},{"content":"\n\n struct Parser {\n\n Parser() : separators( \" \\t=:\" ) {}\n\n\n\n struct Token {\n\n enum Type { Positional, ShortOpt, LongOpt };\n\n Token( Type _type, std::string const& _data ) : type( _type ), data( _data ) {}\n\n Type type;\n\n std::string data;\n\n };\n\n\n\n void parseIntoTokens( int argc, char const * const * argv, std::vector<Parser::Token>& tokens ) const {\n\n const std::string doubleDash = \"--\";\n\n for( int i = 1; i < argc && argv[i] != doubleDash; ++i )\n\n parseIntoTokens( argv[i] , tokens);\n\n }\n\n void parseIntoTokens( std::string arg, std::vector<Parser::Token>& tokens ) const {\n\n while( !arg.empty() ) {\n\n Parser::Token token( Parser::Token::Positional, arg );\n\n arg = \"\";\n","file_path":"dependencies/catch/include/external/clara.h","rank":61,"score":55871.21285230026},{"content":"/*\n\n * Created by Phil on 22/10/2010.\n\n * Copyright 2010 Two Blue Cubes Ltd\n\n *\n\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\n\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n */\n\n\n\n#ifndef TWOBLUECUBES_CATCH_HPP_INCLUDED\n\n#define TWOBLUECUBES_CATCH_HPP_INCLUDED\n\n\n\n#ifdef __clang__\n\n# pragma clang system_header\n\n#elif defined __GNUC__\n\n# pragma GCC system_header\n\n#endif\n\n\n\n#include \"internal/catch_suppress_warnings.h\"\n\n\n\n#if defined(CATCH_CONFIG_MAIN) || defined(CATCH_CONFIG_RUNNER)\n","file_path":"dependencies/catch/include/catch.hpp","rank":62,"score":55871.1577613205},{"content":" _remainder = _remainder.substr( _pos );\n\n }\n\n\n\n typedef std::vector<std::string>::const_iterator const_iterator;\n\n\n\n const_iterator begin() const { return lines.begin(); }\n\n const_iterator end() const { return lines.end(); }\n\n std::string const& last() const { return lines.back(); }\n\n std::size_t size() const { return lines.size(); }\n\n std::string const& operator[]( std::size_t _index ) const { return lines[_index]; }\n\n std::string toString() const {\n\n std::ostringstream oss;\n\n oss << *this;\n\n return oss.str();\n\n }\n\n\n\n inline friend std::ostream& operator << ( std::ostream& _stream, Text const& _text ) {\n\n for( Text::const_iterator it = _text.begin(), itEnd = _text.end();\n\n it != itEnd; ++it ) {\n\n if( it != _text.begin() )\n","file_path":"dependencies/catch/include/external/clara.h","rank":63,"score":55870.37347780317},{"content":" ConfigT parse( int argc, char const * const * argv ) const {\n\n ConfigT config;\n\n parseInto( argc, argv, config );\n\n return config;\n\n }\n\n\n\n std::vector<Parser::Token> parseInto( int argc, char const * const * argv, ConfigT& config ) const {\n\n std::string processName = argv[0];\n\n std::size_t lastSlash = processName.find_last_of( \"/\\\\\" );\n\n if( lastSlash != std::string::npos )\n\n processName = processName.substr( lastSlash+1 );\n\n m_boundProcessName.set( config, processName );\n\n std::vector<Parser::Token> tokens;\n\n Parser parser;\n\n parser.parseIntoTokens( argc, argv, tokens );\n\n return populate( tokens, config );\n\n }\n\n\n\n std::vector<Parser::Token> populate( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\n\n validate();\n","file_path":"dependencies/catch/include/external/clara.h","rank":64,"score":55870.346277313736},{"content":" }\n\n if( !errors.empty() ) {\n\n std::ostringstream oss;\n\n for( std::vector<std::string>::const_iterator it = errors.begin(), itEnd = errors.end();\n\n it != itEnd;\n\n ++it ) {\n\n if( it != errors.begin() )\n\n oss << \"\\n\";\n\n oss << *it;\n\n }\n\n throw std::runtime_error( oss.str() );\n\n }\n\n return unusedTokens;\n\n }\n\n std::vector<Parser::Token> populateFixedArgs( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\n\n std::vector<Parser::Token> unusedTokens;\n\n int position = 1;\n\n for( std::size_t i = 0; i < tokens.size(); ++i ) {\n\n Parser::Token const& token = tokens[i];\n\n typename std::map<int, Arg>::const_iterator it = m_positionalArgs.find( position );\n","file_path":"dependencies/catch/include/external/clara.h","rank":65,"score":55869.81297989231},{"content":" throw std::logic_error( \"option not bound\" );\n\n }\n\n };\n\n struct OptionArgProperties {\n\n std::vector<std::string> shortNames;\n\n std::string longName;\n\n\n\n bool hasShortName( std::string const& shortName ) const {\n\n return std::find( shortNames.begin(), shortNames.end(), shortName ) != shortNames.end();\n\n }\n\n bool hasLongName( std::string const& _longName ) const {\n\n return _longName == longName;\n\n }\n\n };\n\n struct PositionalArgProperties {\n\n PositionalArgProperties() : position( -1 ) {}\n\n int position; // -1 means non-positional (floating)\n\n\n\n bool isFixedPositional() const {\n\n return position != -1;\n\n }\n\n };\n\n\n\n template<typename ConfigT>\n","file_path":"dependencies/catch/include/external/clara.h","rank":66,"score":55869.76202114379},{"content":" std::vector<Parser::Token> unusedTokens = populateOptions( tokens, config );\n\n unusedTokens = populateFixedArgs( unusedTokens, config );\n\n unusedTokens = populateFloatingArgs( unusedTokens, config );\n\n return unusedTokens;\n\n }\n\n\n\n std::vector<Parser::Token> populateOptions( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\n\n std::vector<Parser::Token> unusedTokens;\n\n std::vector<std::string> errors;\n\n for( std::size_t i = 0; i < tokens.size(); ++i ) {\n\n Parser::Token const& token = tokens[i];\n\n typename std::vector<Arg>::const_iterator it = m_options.begin(), itEnd = m_options.end();\n\n for(; it != itEnd; ++it ) {\n\n Arg const& arg = *it;\n\n\n\n try {\n\n if( ( token.type == Parser::Token::ShortOpt && arg.hasShortName( token.data ) ) ||\n\n ( token.type == Parser::Token::LongOpt && arg.hasLongName( token.data ) ) ) {\n\n if( arg.takesArg() ) {\n\n if( i == tokens.size()-1 || tokens[i+1].type != Parser::Token::Positional )\n","file_path":"dependencies/catch/include/external/clara.h","rank":67,"score":55869.20645410334},{"content":"# define CATCH_IMPL\n\n#endif\n\n\n\n#ifdef CATCH_IMPL\n\n# ifndef CLARA_CONFIG_MAIN\n\n# define CLARA_CONFIG_MAIN_NOT_DEFINED\n\n# define CLARA_CONFIG_MAIN\n\n# endif\n\n#endif\n\n\n\n#include \"internal/catch_notimplemented_exception.h\"\n\n#include \"internal/catch_context.h\"\n\n#include \"internal/catch_test_registry.hpp\"\n\n#include \"internal/catch_capture.hpp\"\n\n#include \"internal/catch_section.h\"\n\n#include \"internal/catch_generators.hpp\"\n\n#include \"internal/catch_interfaces_exception.h\"\n\n#include \"internal/catch_approx.hpp\"\n\n#include \"internal/catch_matchers.hpp\"\n\n#include \"internal/catch_compiler_capabilities.h\"\n","file_path":"dependencies/catch/include/catch.hpp","rank":68,"score":55867.81637342835},{"content":"#include \"internal/catch_interfaces_tag_alias_registry.h\"\n\n\n\n// These files are included here so the single_include script doesn't put them\n\n// in the conditionally compiled sections\n\n#include \"internal/catch_test_case_info.h\"\n\n#include \"internal/catch_interfaces_runner.h\"\n\n\n\n#ifdef __OBJC__\n\n#include \"internal/catch_objc.hpp\"\n\n#endif\n\n\n\n#ifdef CATCH_IMPL\n\n#include \"internal/catch_impl.hpp\"\n\n#endif\n\n\n\n#ifdef CATCH_CONFIG_MAIN\n\n#include \"internal/catch_default_main.hpp\"\n\n#endif\n\n\n\n\n","file_path":"dependencies/catch/include/catch.hpp","rank":69,"score":55867.757168767384},{"content":" virtual void set( C& p, std::string const& stringValue ) const {\n\n convertInto( stringValue, p.*member );\n\n }\n\n virtual void setFlag( C& p ) const {\n\n convertInto( true, p.*member );\n\n }\n\n virtual bool takesArg() const { return !IsBool<M>::value; }\n\n virtual IArgFunction<C>* clone() const { return new BoundDataMember( *this ); }\n\n M C::* member;\n\n };\n\n template<typename C, typename M>\n\n struct BoundUnaryMethod : IArgFunction<C>{\n\n BoundUnaryMethod( void (C::*_member)( M ) ) : member( _member ) {}\n\n virtual void set( C& p, std::string const& stringValue ) const {\n\n typename RemoveConstRef<M>::type value;\n\n convertInto( stringValue, value );\n\n (p.*member)( value );\n\n }\n\n virtual void setFlag( C& p ) const {\n\n typename RemoveConstRef<M>::type value;\n","file_path":"dependencies/catch/include/external/clara.h","rank":70,"score":55866.72855319066},{"content":"\n\n // Bind a free function taking a single argument - the object to operate on (requires a placeholder string)\n\n template<typename C, typename T>\n\n void bind( void (* binaryFunction)( C&, T ), std::string const& placeholder ) {\n\n m_arg->boundField = new Detail::BoundBinaryFunction<C, T>( binaryFunction );\n\n m_arg->placeholder = placeholder;\n\n }\n\n\n\n ArgBuilder& describe( std::string const& description ) {\n\n m_arg->description = description;\n\n return *this;\n\n }\n\n ArgBuilder& detail( std::string const& detail ) {\n\n m_arg->detail = detail;\n\n return *this;\n\n }\n\n\n\n protected:\n\n Arg* m_arg;\n\n };\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":71,"score":55866.609553619586},{"content":" }\n\n }\n\n std::string separators;\n\n };\n\n\n\n template<typename ConfigT>\n\n struct CommonArgProperties {\n\n CommonArgProperties() {}\n\n CommonArgProperties( Detail::BoundArgFunction<ConfigT> const& _boundField ) : boundField( _boundField ) {}\n\n\n\n Detail::BoundArgFunction<ConfigT> boundField;\n\n std::string description;\n\n std::string detail;\n\n std::string placeholder; // Only value if boundField takes an arg\n\n\n\n bool takesArg() const {\n\n return !placeholder.empty();\n\n }\n\n void validate() const {\n\n if( !boundField.isSet() )\n","file_path":"dependencies/catch/include/external/clara.h","rank":72,"score":55866.609553619586},{"content":" pos = remainder.find_last_of( wrappableChars, width );\n\n if( pos != std::string::npos && pos > 0 ) {\n\n spliceLine( indent, remainder, pos );\n\n if( remainder[0] == ' ' )\n\n remainder = remainder.substr( 1 );\n\n }\n\n else {\n\n spliceLine( indent, remainder, width-1 );\n\n lines.back() += \"-\";\n\n }\n\n if( lines.size() == 1 )\n\n indent = _attr.indent;\n\n if( tabPos != std::string::npos )\n\n indent += tabPos;\n\n }\n\n }\n\n }\n\n\n\n void spliceLine( std::size_t _indent, std::string& _remainder, std::size_t _pos ) {\n\n lines.push_back( std::string( _indent, ' ' ) + _remainder.substr( 0, _pos ) );\n","file_path":"dependencies/catch/include/external/clara.h","rank":73,"score":55866.56399660906},{"content":" argSynopsis( oss );\n\n return oss.str();\n\n }\n\n\n\n void usage( std::ostream& os, std::string const& procName ) const {\n\n validate();\n\n os << \"usage:\\n \" << procName << \" \";\n\n argSynopsis( os );\n\n if( !m_options.empty() ) {\n\n os << \" [options]\\n\\nwhere options are: \\n\";\n\n optUsage( os, 2 );\n\n }\n\n os << \"\\n\";\n\n }\n\n std::string usage( std::string const& procName ) const {\n\n std::ostringstream oss;\n\n usage( oss, procName );\n\n return oss.str();\n\n }\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":74,"score":55866.407543056834},{"content":" .setWidth( width - maxWidth - 3 ) );\n\n\n\n for( std::size_t i = 0; i < (std::max)( usage.size(), desc.size() ); ++i ) {\n\n std::string usageCol = i < usage.size() ? usage[i] : \"\";\n\n os << usageCol;\n\n\n\n if( i < desc.size() && !desc[i].empty() )\n\n os << std::string( indent + 2 + maxWidth - usageCol.size(), ' ' )\n\n << desc[i];\n\n os << \"\\n\";\n\n }\n\n }\n\n }\n\n std::string optUsage() const {\n\n std::ostringstream oss;\n\n optUsage( oss );\n\n return oss.str();\n\n }\n\n\n\n void argSynopsis( std::ostream& os ) const {\n","file_path":"dependencies/catch/include/external/clara.h","rank":75,"score":55866.18622971891},{"content":" template<typename T> struct RemoveConstRef{ typedef T type; };\n\n template<typename T> struct RemoveConstRef<T&>{ typedef T type; };\n\n template<typename T> struct RemoveConstRef<T const&>{ typedef T type; };\n\n template<typename T> struct RemoveConstRef<T const>{ typedef T type; };\n\n\n\n template<typename T> struct IsBool { static const bool value = false; };\n\n template<> struct IsBool<bool> { static const bool value = true; };\n\n\n\n template<typename T>\n\n void convertInto( std::string const& _source, T& _dest ) {\n\n std::stringstream ss;\n\n ss << _source;\n\n ss >> _dest;\n\n if( ss.fail() )\n\n throw std::runtime_error( \"Unable to convert \" + _source + \" to destination type\" );\n\n }\n\n inline void convertInto( std::string const& _source, std::string& _dest ) {\n\n _dest = _source;\n\n }\n\n inline void convertInto( std::string const& _source, bool& _dest ) {\n","file_path":"dependencies/catch/include/external/clara.h","rank":76,"score":55865.89610102517},{"content":" convertInto( true, value );\n\n (p.*member)( value );\n\n }\n\n virtual bool takesArg() const { return !IsBool<M>::value; }\n\n virtual IArgFunction<C>* clone() const { return new BoundUnaryMethod( *this ); }\n\n void (C::*member)( M );\n\n };\n\n template<typename C>\n\n struct BoundNullaryMethod : IArgFunction<C>{\n\n BoundNullaryMethod( void (C::*_member)() ) : member( _member ) {}\n\n virtual void set( C& p, std::string const& stringValue ) const {\n\n bool value;\n\n convertInto( stringValue, value );\n\n if( value )\n\n (p.*member)();\n\n }\n\n virtual void setFlag( C& p ) const {\n\n (p.*member)();\n\n }\n\n virtual bool takesArg() const { return false; }\n","file_path":"dependencies/catch/include/external/clara.h","rank":77,"score":55865.858455544156},{"content":" virtual IArgFunction<C>* clone() const { return new BoundNullaryMethod( *this ); }\n\n void (C::*member)();\n\n };\n\n\n\n template<typename C>\n\n struct BoundUnaryFunction : IArgFunction<C>{\n\n BoundUnaryFunction( void (*_function)( C& ) ) : function( _function ) {}\n\n virtual void set( C& obj, std::string const& stringValue ) const {\n\n bool value;\n\n convertInto( stringValue, value );\n\n if( value )\n\n function( obj );\n\n }\n\n virtual void setFlag( C& p ) const {\n\n function( p );\n\n }\n\n virtual bool takesArg() const { return false; }\n\n virtual IArgFunction<C>* clone() const { return new BoundUnaryFunction( *this ); }\n\n void (*function)( C& );\n\n };\n","file_path":"dependencies/catch/include/external/clara.h","rank":78,"score":55865.83472499425},{"content":" if( it != m_positionalArgs.end() )\n\n it->second.boundField.set( config, token.data );\n\n else\n\n unusedTokens.push_back( token );\n\n if( token.type == Parser::Token::Positional )\n\n position++;\n\n }\n\n return unusedTokens;\n\n }\n\n std::vector<Parser::Token> populateFloatingArgs( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\n\n if( !m_floatingArg.get() )\n\n return tokens;\n\n std::vector<Parser::Token> unusedTokens;\n\n for( std::size_t i = 0; i < tokens.size(); ++i ) {\n\n Parser::Token const& token = tokens[i];\n\n if( token.type == Parser::Token::Positional )\n\n m_floatingArg->boundField.set( config, token.data );\n\n else\n\n unusedTokens.push_back( token );\n\n }\n","file_path":"dependencies/catch/include/external/clara.h","rank":79,"score":55865.819319091366},{"content":" extern UnpositionalTag _;\n\n\n\n#ifdef CLARA_CONFIG_MAIN\n\n UnpositionalTag _;\n\n#endif\n\n\n\n namespace Detail {\n\n\n\n#ifdef CLARA_CONSOLE_WIDTH\n\n const unsigned int consoleWidth = CLARA_CONFIG_CONSOLE_WIDTH;\n\n#else\n\n const unsigned int consoleWidth = 80;\n\n#endif\n\n\n\n using namespace Tbc;\n\n\n\n inline bool startsWith( std::string const& str, std::string const& prefix ) {\n\n return str.size() >= prefix.size() && str.substr( 0, prefix.size() ) == prefix;\n\n }\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":80,"score":55865.615822273714},{"content":"\n\n template<typename C, typename T>\n\n struct BoundBinaryFunction : IArgFunction<C>{\n\n BoundBinaryFunction( void (*_function)( C&, T ) ) : function( _function ) {}\n\n virtual void set( C& obj, std::string const& stringValue ) const {\n\n typename RemoveConstRef<T>::type value;\n\n convertInto( stringValue, value );\n\n function( obj, value );\n\n }\n\n virtual void setFlag( C& obj ) const {\n\n typename RemoveConstRef<T>::type value;\n\n convertInto( true, value );\n\n function( obj, value );\n\n }\n\n virtual bool takesArg() const { return !IsBool<T>::value; }\n\n virtual IArgFunction<C>* clone() const { return new BoundBinaryFunction( *this ); }\n\n void (*function)( C&, T );\n\n };\n\n\n\n } // namespace Detail\n","file_path":"dependencies/catch/include/external/clara.h","rank":81,"score":55865.5647634745},{"content":" return unusedTokens;\n\n }\n\n\n\n void validate() const\n\n {\n\n if( m_options.empty() && m_positionalArgs.empty() && !m_floatingArg.get() )\n\n throw std::logic_error( \"No options or arguments specified\" );\n\n\n\n for( typename std::vector<Arg>::const_iterator it = m_options.begin(),\n\n itEnd = m_options.end();\n\n it != itEnd; ++it )\n\n it->validate();\n\n }\n\n\n\n private:\n\n Detail::BoundArgFunction<ConfigT> m_boundProcessName;\n\n std::vector<Arg> m_options;\n\n std::map<int, Arg> m_positionalArgs;\n\n ArgAutoPtr m_floatingArg;\n\n int m_highestSpecifiedArgPosition;\n","file_path":"dependencies/catch/include/external/clara.h","rank":82,"score":55865.31450083142},{"content":" bool m_throwOnUnrecognisedTokens;\n\n };\n\n\n\n} // end namespace Clara\n\n\n\n\n\nSTITCH_CLARA_CLOSE_NAMESPACE\n\n#undef STITCH_CLARA_OPEN_NAMESPACE\n\n#undef STITCH_CLARA_CLOSE_NAMESPACE\n\n\n\n\n\n#endif // TWOBLUECUBES_CLARA_H_INCLUDED\n","file_path":"dependencies/catch/include/external/clara.h","rank":83,"score":55865.12197911819},{"content":"/*\n\n * Created by Phil on 25/05/2013.\n\n * Copyright 2013 Two Blue Cubes Ltd. All rights reserved.\n\n *\n\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\n\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n */\n\n\n\n// Only use header guard if we are not using an outer namespace\n\n#if !defined(TWOBLUECUBES_CLARA_H_INCLUDED) || defined(STITCH_CLARA_OPEN_NAMESPACE)\n\n\n\n#ifndef STITCH_CLARA_OPEN_NAMESPACE\n\n#define TWOBLUECUBES_CLARA_H_INCLUDED\n\n#define STITCH_CLARA_OPEN_NAMESPACE\n\n#define STITCH_CLARA_CLOSE_NAMESPACE\n\n#else\n\n#define STITCH_CLARA_CLOSE_NAMESPACE }\n\n#endif\n\n\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":84,"score":55865.0226476791},{"content":" if( token.data[0] == '-' ) {\n\n if( token.data.size() > 1 && token.data[1] == '-' ) {\n\n token = Parser::Token( Parser::Token::LongOpt, token.data.substr( 2 ) );\n\n }\n\n else {\n\n token = Parser::Token( Parser::Token::ShortOpt, token.data.substr( 1 ) );\n\n if( token.data.size() > 1 && separators.find( token.data[1] ) == std::string::npos ) {\n\n arg = \"-\" + token.data.substr( 1 );\n\n token.data = token.data.substr( 0, 1 );\n\n }\n\n }\n\n }\n\n if( token.type != Parser::Token::Positional ) {\n\n std::size_t pos = token.data.find_first_of( separators );\n\n if( pos != std::string::npos ) {\n\n arg = token.data.substr( pos+1 );\n\n token.data = token.data.substr( 0, pos );\n\n }\n\n }\n\n tokens.push_back( token );\n","file_path":"dependencies/catch/include/external/clara.h","rank":85,"score":55864.8081709475},{"content":" m_arg->placeholder = placeholder;\n\n }\n\n\n\n // Bind a method taking a single, boolean argument (no placeholder string required)\n\n template<typename C>\n\n void bind( void (C::* unaryMethod)( bool ) ) {\n\n m_arg->boundField = new Detail::BoundUnaryMethod<C,bool>( unaryMethod );\n\n }\n\n\n\n // Bind a method that takes no arguments (will be called if opt is present)\n\n template<typename C>\n\n void bind( void (C::* nullaryMethod)() ) {\n\n m_arg->boundField = new Detail::BoundNullaryMethod<C>( nullaryMethod );\n\n }\n\n\n\n // Bind a free function taking a single argument - the object to operate on (no placeholder string required)\n\n template<typename C>\n\n void bind( void (* unaryFunction)( C& ) ) {\n\n m_arg->boundField = new Detail::BoundUnaryFunction<C>( unaryFunction );\n\n }\n","file_path":"dependencies/catch/include/external/clara.h","rank":86,"score":55864.478315762484},{"content":"# ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS\n\n IArgFunction() = default;\n\n IArgFunction( IArgFunction const& ) = default;\n\n# endif\n\n virtual void set( ConfigT& config, std::string const& value ) const = 0;\n\n virtual void setFlag( ConfigT& config ) const = 0;\n\n virtual bool takesArg() const = 0;\n\n virtual IArgFunction* clone() const = 0;\n\n };\n\n\n\n template<typename ConfigT>\n","file_path":"dependencies/catch/include/external/clara.h","rank":87,"score":55864.334765368876},{"content":"#define GENERATE( expr) INTERNAL_CATCH_GENERATE( expr )\n\n\n\n#endif\n\n\n\n#define CATCH_TRANSLATE_EXCEPTION( signature ) INTERNAL_CATCH_TRANSLATE_EXCEPTION( signature )\n\n\n\n// \"BDD-style\" convenience wrappers\n\n#ifdef CATCH_CONFIG_VARIADIC_MACROS\n\n#define SCENARIO( ... ) TEST_CASE( \"Scenario: \" __VA_ARGS__ )\n\n#define SCENARIO_METHOD( className, ... ) INTERNAL_CATCH_TEST_CASE_METHOD( className, \"Scenario: \" __VA_ARGS__ )\n\n#else\n\n#define SCENARIO( name, tags ) TEST_CASE( \"Scenario: \" name, tags )\n\n#define SCENARIO_METHOD( className, name, tags ) INTERNAL_CATCH_TEST_CASE_METHOD( className, \"Scenario: \" name, tags )\n\n#endif\n\n#define GIVEN( desc ) SECTION( \" Given: \" desc, \"\" )\n\n#define WHEN( desc ) SECTION( \" When: \" desc, \"\" )\n\n#define AND_WHEN( desc ) SECTION( \"And when: \" desc, \"\" )\n\n#define THEN( desc ) SECTION( \" Then: \" desc, \"\" )\n\n#define AND_THEN( desc ) SECTION( \" And: \" desc, \"\" )\n\n\n\nusing Catch::Detail::Approx;\n\n\n\n#include \"internal/catch_reenable_warnings.h\"\n\n\n\n#endif // TWOBLUECUBES_CATCH_HPP_INCLUDED\n","file_path":"dependencies/catch/include/catch.hpp","rank":88,"score":55864.217272092836},{"content":" width = pos;\n\n }\n\n pos = remainder.find_last_of( _attr.tabChar, width );\n\n if( pos != std::string::npos ) {\n\n tabPos = pos;\n\n if( remainder[width] == '\\n' )\n\n width--;\n\n remainder = remainder.substr( 0, tabPos ) + remainder.substr( tabPos+1 );\n\n }\n\n\n\n if( width == remainder.size() ) {\n\n spliceLine( indent, remainder, width );\n\n }\n\n else if( remainder[width] == '\\n' ) {\n\n spliceLine( indent, remainder, width );\n\n if( width <= 1 || remainder.size() != 1 )\n\n remainder = remainder.substr( 1 );\n\n indent = _attr.indent;\n\n }\n\n else {\n","file_path":"dependencies/catch/include/external/clara.h","rank":89,"score":55863.95407635165},{"content":"\n\n// Use optional outer namespace\n\n#ifdef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE\n\nnamespace STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE {\n\n#endif\n\n\n\nnamespace Tbc {\n\n\n\n#ifdef TBC_TEXT_FORMAT_CONSOLE_WIDTH\n\n const unsigned int consoleWidth = TBC_TEXT_FORMAT_CONSOLE_WIDTH;\n\n#else\n\n const unsigned int consoleWidth = 80;\n\n#endif\n\n\n\n struct TextAttributes {\n\n TextAttributes()\n\n : initialIndent( std::string::npos ),\n\n indent( 0 ),\n\n width( consoleWidth-1 ),\n\n tabChar( '\\t' )\n","file_path":"dependencies/catch/include/external/clara.h","rank":90,"score":55863.922923300284},{"content":" errors.push_back( \"Expected argument to option: \" + token.data );\n\n else\n\n arg.boundField.set( config, tokens[++i].data );\n\n }\n\n else {\n\n arg.boundField.setFlag( config );\n\n }\n\n break;\n\n }\n\n }\n\n catch( std::exception& ex ) {\n\n errors.push_back( std::string( ex.what() ) + \"\\n- while parsing: (\" + arg.commands() + \")\" );\n\n }\n\n }\n\n if( it == itEnd ) {\n\n if( token.type == Parser::Token::Positional || !m_throwOnUnrecognisedTokens )\n\n unusedTokens.push_back( token );\n\n else if( errors.empty() && m_throwOnUnrecognisedTokens )\n\n errors.push_back( \"unrecognised option: \" + token.data );\n\n }\n","file_path":"dependencies/catch/include/external/clara.h","rank":91,"score":55863.77462281197},{"content":" for( int i = 1; i <= m_highestSpecifiedArgPosition; ++i ) {\n\n if( i > 1 )\n\n os << \" \";\n\n typename std::map<int, Arg>::const_iterator it = m_positionalArgs.find( i );\n\n if( it != m_positionalArgs.end() )\n\n os << \"<\" << it->second.placeholder << \">\";\n\n else if( m_floatingArg.get() )\n\n os << \"<\" << m_floatingArg->placeholder << \">\";\n\n else\n\n throw std::logic_error( \"non consecutive positional arguments with no floating args\" );\n\n }\n\n // !TBD No indication of mandatory args\n\n if( m_floatingArg.get() ) {\n\n if( m_highestSpecifiedArgPosition > 1 )\n\n os << \" \";\n\n os << \"[<\" << m_floatingArg->placeholder << \"> ...]\";\n\n }\n\n }\n\n std::string argSynopsis() const {\n\n std::ostringstream oss;\n","file_path":"dependencies/catch/include/external/clara.h","rank":92,"score":55863.77462281197},{"content":"\n\n bool isSet() const {\n\n return functionObj != NULL;\n\n }\n\n private:\n\n IArgFunction<ConfigT>* functionObj;\n\n };\n\n\n\n\n\n template<typename C>\n\n struct NullBinder : IArgFunction<C>{\n\n virtual void set( C&, std::string const& ) const {}\n\n virtual void setFlag( C& ) const {}\n\n virtual bool takesArg() const { return true; }\n\n virtual IArgFunction<C>* clone() const { return new NullBinder( *this ); }\n\n };\n\n\n\n template<typename C, typename M>\n\n struct BoundDataMember : IArgFunction<C>{\n\n BoundDataMember( M C::* _member ) : member( _member ) {}\n","file_path":"dependencies/catch/include/external/clara.h","rank":93,"score":55863.691195096726},{"content":" m_options ( other.m_options ),\n\n m_positionalArgs( other.m_positionalArgs ),\n\n m_highestSpecifiedArgPosition( other.m_highestSpecifiedArgPosition ),\n\n m_throwOnUnrecognisedTokens( other.m_throwOnUnrecognisedTokens )\n\n {\n\n if( other.m_floatingArg.get() )\n\n m_floatingArg.reset( new Arg( *other.m_floatingArg ) );\n\n }\n\n\n\n CommandLine& setThrowOnUnrecognisedTokens( bool shouldThrow = true ) {\n\n m_throwOnUnrecognisedTokens = shouldThrow;\n\n return *this;\n\n }\n\n\n\n\n\n OptBuilder operator[]( std::string const& optName ) {\n\n m_options.push_back( Arg() );\n\n addOptName( m_options.back(), optName );\n\n OptBuilder builder( &m_options.back() );\n\n return builder;\n","file_path":"dependencies/catch/include/external/clara.h","rank":94,"score":55863.560500006104},{"content":" {}\n\n\n\n TextAttributes& setInitialIndent( std::size_t _value ) { initialIndent = _value; return *this; }\n\n TextAttributes& setIndent( std::size_t _value ) { indent = _value; return *this; }\n\n TextAttributes& setWidth( std::size_t _value ) { width = _value; return *this; }\n\n TextAttributes& setTabChar( char _value ) { tabChar = _value; return *this; }\n\n\n\n std::size_t initialIndent; // indent of first line, or npos\n\n std::size_t indent; // indent of subsequent lines, or all if initialIndent is npos\n\n std::size_t width; // maximum width of text, including indent. Longer text will wrap\n\n char tabChar; // If this char is seen the indent is changed to current pos\n\n };\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":95,"score":55863.3038058},{"content":" std::string sourceLC = _source;\n\n std::transform( sourceLC.begin(), sourceLC.end(), sourceLC.begin(), ::tolower );\n\n if( sourceLC == \"y\" || sourceLC == \"1\" || sourceLC == \"true\" || sourceLC == \"yes\" || sourceLC == \"on\" )\n\n _dest = true;\n\n else if( sourceLC == \"n\" || sourceLC == \"0\" || sourceLC == \"false\" || sourceLC == \"no\" || sourceLC == \"off\" )\n\n _dest = false;\n\n else\n\n throw std::runtime_error( \"Expected a boolean value but did not recognise:\\n '\" + _source + \"'\" );\n\n }\n\n inline void convertInto( bool _source, bool& _dest ) {\n\n _dest = _source;\n\n }\n\n template<typename T>\n\n inline void convertInto( bool, T& ) {\n\n throw std::runtime_error( \"Invalid conversion\" );\n\n }\n\n\n\n template<typename ConfigT>\n\n struct IArgFunction {\n\n virtual ~IArgFunction() {}\n","file_path":"dependencies/catch/include/external/clara.h","rank":96,"score":55863.22132760569},{"content":"#else\n\n typedef std::auto_ptr<Arg> ArgAutoPtr;\n\n#endif\n\n\n\n friend void addOptName( Arg& arg, std::string const& optName )\n\n {\n\n if( optName.empty() )\n\n return;\n\n if( Detail::startsWith( optName, \"--\" ) ) {\n\n if( !arg.longName.empty() )\n\n throw std::logic_error( \"Only one long opt may be specified. '\"\n\n + arg.longName\n\n + \"' already specified, now attempting to add '\"\n\n + optName + \"'\" );\n\n arg.longName = optName.substr( 2 );\n\n }\n\n else if( Detail::startsWith( optName, \"-\" ) )\n\n arg.shortNames.push_back( optName.substr( 1 ) );\n\n else\n\n throw std::logic_error( \"option must begin with - or --. Option was: '\" + optName + \"'\" );\n\n }\n\n friend void setPositionalArg( Arg& arg, int position )\n\n {\n\n arg.position = position;\n\n }\n\n\n\n\n","file_path":"dependencies/catch/include/external/clara.h","rank":97,"score":55863.12302956673},{"content":" template<typename C, typename M>\n\n void bindProcessName( M C::* field ) {\n\n m_boundProcessName = new Detail::BoundDataMember<C,M>( field );\n\n }\n\n template<typename C, typename M>\n\n void bindProcessName( void (C::*_unaryMethod)( M ) ) {\n\n m_boundProcessName = new Detail::BoundUnaryMethod<C,M>( _unaryMethod );\n\n }\n\n\n\n void optUsage( std::ostream& os, std::size_t indent = 0, std::size_t width = Detail::consoleWidth ) const {\n\n typename std::vector<Arg>::const_iterator itBegin = m_options.begin(), itEnd = m_options.end(), it;\n\n std::size_t maxWidth = 0;\n\n for( it = itBegin; it != itEnd; ++it )\n\n maxWidth = (std::max)( maxWidth, it->commands().size() );\n\n\n\n for( it = itBegin; it != itEnd; ++it ) {\n\n Detail::Text usage( it->commands(), Detail::TextAttributes()\n\n .setWidth( maxWidth+indent )\n\n .setIndent( indent ) );\n\n Detail::Text desc( it->description, Detail::TextAttributes()\n","file_path":"dependencies/catch/include/external/clara.h","rank":98,"score":55862.71791526197},{"content":" if( first )\n\n first = false;\n\n else\n\n oss << \", \";\n\n oss << \"-\" << *it;\n\n }\n\n if( !longName.empty() ) {\n\n if( !first )\n\n oss << \", \";\n\n oss << \"--\" << longName;\n\n }\n\n if( !placeholder.empty() )\n\n oss << \" <\" << placeholder << \">\";\n\n return oss.str();\n\n }\n\n };\n\n\n\n // NOTE: std::auto_ptr is deprecated in c++11/c++0x\n\n#if defined(__cplusplus) && __cplusplus > 199711L\n\n typedef std::unique_ptr<Arg> ArgAutoPtr;\n","file_path":"dependencies/catch/include/external/clara.h","rank":99,"score":55860.209469045345}],"string":"[\n {\n \"content\": \"/*\\n\\n * Created by Phil on 5/11/2010.\\n\\n * Copyright 2010 Two Blue Cubes Ltd. All rights reserved.\\n\\n *\\n\\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\\n\\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\\n\\n */\\n\\n#ifndef TWOBLUECUBES_CATCH_LIST_HPP_INCLUDED\\n\\n#define TWOBLUECUBES_CATCH_LIST_HPP_INCLUDED\\n\\n\\n\\n#include \\\"catch_commandline.hpp\\\"\\n\\n#include \\\"catch_text.h\\\"\\n\\n#include \\\"catch_console_colour.hpp\\\"\\n\\n#include \\\"catch_interfaces_reporter.h\\\"\\n\\n#include \\\"catch_test_spec_parser.hpp\\\"\\n\\n\\n\\n#include <limits>\\n\\n#include <algorithm>\\n\\n\\n\\nnamespace Catch {\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 0,\n \"score\": 106285.11305512878\n },\n {\n \"content\": \" return factories.size();\\n\\n }\\n\\n\\n\\n inline Option<std::size_t> list( Config const& config ) {\\n\\n Option<std::size_t> listedCount;\\n\\n if( config.listTests() )\\n\\n listedCount = listedCount.valueOr(0) + listTests( config );\\n\\n if( config.listTestNamesOnly() )\\n\\n listedCount = listedCount.valueOr(0) + listTestsNamesOnly( config );\\n\\n if( config.listTags() )\\n\\n listedCount = listedCount.valueOr(0) + listTags( config );\\n\\n if( config.listReporters() )\\n\\n listedCount = listedCount.valueOr(0) + listReporters( config );\\n\\n return listedCount;\\n\\n }\\n\\n\\n\\n} // end namespace Catch\\n\\n\\n\\n#endif // TWOBLUECUBES_CATCH_LIST_HPP_INCLUDED\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 1,\n \"score\": 106284.04172676249\n },\n {\n \"content\": \" ++count;\\n\\n spellings.insert( spelling );\\n\\n }\\n\\n std::string all() const {\\n\\n std::string out;\\n\\n for( std::set<std::string>::const_iterator it = spellings.begin(), itEnd = spellings.end();\\n\\n it != itEnd;\\n\\n ++it )\\n\\n out += \\\"[\\\" + *it + \\\"]\\\";\\n\\n return out;\\n\\n }\\n\\n std::set<std::string> spellings;\\n\\n std::size_t count;\\n\\n };\\n\\n\\n\\n inline std::size_t listTags( Config const& config ) {\\n\\n TestSpec testSpec = config.testSpec();\\n\\n if( config.testSpec().hasFilters() )\\n\\n Catch::cout() << \\\"Tags for matching test cases:\\\\n\\\";\\n\\n else {\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 2,\n \"score\": 106283.11018546503\n },\n {\n \"content\": \" inline std::size_t listTestsNamesOnly( Config const& config ) {\\n\\n TestSpec testSpec = config.testSpec();\\n\\n if( !config.testSpec().hasFilters() )\\n\\n testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( \\\"*\\\" ).testSpec();\\n\\n std::size_t matchedTests = 0;\\n\\n std::vector<TestCase> matchedTestCases;\\n\\n getRegistryHub().getTestCaseRegistry().getFilteredTests( testSpec, config, matchedTestCases );\\n\\n for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end();\\n\\n it != itEnd;\\n\\n ++it ) {\\n\\n matchedTests++;\\n\\n TestCaseInfo const& testCaseInfo = it->getTestCaseInfo();\\n\\n Catch::cout() << testCaseInfo.name << std::endl;\\n\\n }\\n\\n return matchedTests;\\n\\n }\\n\\n\\n\\n struct TagInfo {\\n\\n TagInfo() : count ( 0 ) {}\\n\\n void add( std::string const& spelling ) {\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 3,\n \"score\": 106281.95762104508\n },\n {\n \"content\": \" Catch::cout() << \\\"All available tags:\\\\n\\\";\\n\\n testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( \\\"*\\\" ).testSpec();\\n\\n }\\n\\n\\n\\n std::map<std::string, TagInfo> tagCounts;\\n\\n\\n\\n std::vector<TestCase> matchedTestCases;\\n\\n getRegistryHub().getTestCaseRegistry().getFilteredTests( testSpec, config, matchedTestCases );\\n\\n for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end();\\n\\n it != itEnd;\\n\\n ++it ) {\\n\\n for( std::set<std::string>::const_iterator tagIt = it->getTestCaseInfo().tags.begin(),\\n\\n tagItEnd = it->getTestCaseInfo().tags.end();\\n\\n tagIt != tagItEnd;\\n\\n ++tagIt ) {\\n\\n std::string tagName = *tagIt;\\n\\n std::string lcaseTagName = toLower( tagName );\\n\\n std::map<std::string, TagInfo>::iterator countIt = tagCounts.find( lcaseTagName );\\n\\n if( countIt == tagCounts.end() )\\n\\n countIt = tagCounts.insert( std::make_pair( lcaseTagName, TagInfo() ) ).first;\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 4,\n \"score\": 106281.91109259009\n },\n {\n \"content\": \"\\n\\n inline std::size_t listTests( Config const& config ) {\\n\\n\\n\\n TestSpec testSpec = config.testSpec();\\n\\n if( config.testSpec().hasFilters() )\\n\\n Catch::cout() << \\\"Matching test cases:\\\\n\\\";\\n\\n else {\\n\\n Catch::cout() << \\\"All available test cases:\\\\n\\\";\\n\\n testSpec = TestSpecParser( ITagAliasRegistry::get() ).parse( \\\"*\\\" ).testSpec();\\n\\n }\\n\\n\\n\\n std::size_t matchedTests = 0;\\n\\n TextAttributes nameAttr, tagsAttr;\\n\\n nameAttr.setInitialIndent( 2 ).setIndent( 4 );\\n\\n tagsAttr.setIndent( 6 );\\n\\n\\n\\n std::vector<TestCase> matchedTestCases;\\n\\n getRegistryHub().getTestCaseRegistry().getFilteredTests( testSpec, config, matchedTestCases );\\n\\n for( std::vector<TestCase>::const_iterator it = matchedTestCases.begin(), itEnd = matchedTestCases.end();\\n\\n it != itEnd;\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 5,\n \"score\": 106279.49501884238\n },\n {\n \"content\": \" inline std::size_t listReporters( Config const& /*config*/ ) {\\n\\n Catch::cout() << \\\"Available reporters:\\\\n\\\";\\n\\n IReporterRegistry::FactoryMap const& factories = getRegistryHub().getReporterRegistry().getFactories();\\n\\n IReporterRegistry::FactoryMap::const_iterator itBegin = factories.begin(), itEnd = factories.end(), it;\\n\\n std::size_t maxNameLen = 0;\\n\\n for(it = itBegin; it != itEnd; ++it )\\n\\n maxNameLen = (std::max)( maxNameLen, it->first.size() );\\n\\n\\n\\n for(it = itBegin; it != itEnd; ++it ) {\\n\\n Text wrapper( it->second->getDescription(), TextAttributes()\\n\\n .setInitialIndent( 0 )\\n\\n .setIndent( 7+maxNameLen )\\n\\n .setWidth( CATCH_CONFIG_CONSOLE_WIDTH - maxNameLen-8 ) );\\n\\n Catch::cout() << \\\" \\\"\\n\\n << it->first\\n\\n << \\\":\\\"\\n\\n << std::string( maxNameLen - it->first.size() + 2, ' ' )\\n\\n << wrapper << \\\"\\\\n\\\";\\n\\n }\\n\\n Catch::cout() << std::endl;\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 6,\n \"score\": 106278.3007672196\n },\n {\n \"content\": \" countIt->second.add( tagName );\\n\\n }\\n\\n }\\n\\n\\n\\n for( std::map<std::string, TagInfo>::const_iterator countIt = tagCounts.begin(),\\n\\n countItEnd = tagCounts.end();\\n\\n countIt != countItEnd;\\n\\n ++countIt ) {\\n\\n std::ostringstream oss;\\n\\n oss << \\\" \\\" << std::setw(2) << countIt->second.count << \\\" \\\";\\n\\n Text wrapper( countIt->second.all(), TextAttributes()\\n\\n .setInitialIndent( 0 )\\n\\n .setIndent( oss.str().size() )\\n\\n .setWidth( CATCH_CONFIG_CONSOLE_WIDTH-10 ) );\\n\\n Catch::cout() << oss.str() << wrapper << \\\"\\\\n\\\";\\n\\n }\\n\\n Catch::cout() << pluralise( tagCounts.size(), \\\"tag\\\" ) << \\\"\\\\n\\\" << std::endl;\\n\\n return tagCounts.size();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 7,\n \"score\": 106275.8980097289\n },\n {\n \"content\": \" ++it ) {\\n\\n matchedTests++;\\n\\n TestCaseInfo const& testCaseInfo = it->getTestCaseInfo();\\n\\n Colour::Code colour = testCaseInfo.isHidden()\\n\\n ? Colour::SecondaryText\\n\\n : Colour::None;\\n\\n Colour colourGuard( colour );\\n\\n\\n\\n Catch::cout() << Text( testCaseInfo.name, nameAttr ) << std::endl;\\n\\n if( !testCaseInfo.tags.empty() )\\n\\n Catch::cout() << Text( testCaseInfo.tagsAsString, tagsAttr ) << std::endl;\\n\\n }\\n\\n\\n\\n if( !config.testSpec().hasFilters() )\\n\\n Catch::cout() << pluralise( matchedTests, \\\"test case\\\" ) << \\\"\\\\n\\\" << std::endl;\\n\\n else\\n\\n Catch::cout() << pluralise( matchedTests, \\\"matching test case\\\" ) << \\\"\\\\n\\\" << std::endl;\\n\\n return matchedTests;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_list.hpp\",\n \"rank\": 8,\n \"score\": 106275.71357107938\n },\n {\n \"content\": \"#include \\\"catch.hpp\\\"\\n\\n#include <vector>\\n\\n\\n\\n\\n\\n// vedctor\\n\\nTEST_CASE( \\\"vector<int> -> toString\\\", \\\"[toString][vector]\\\" )\\n\\n{\\n\\n std::vector<int> vv;\\n\\n REQUIRE( Catch::toString(vv) == \\\"{ }\\\" );\\n\\n vv.push_back( 42 );\\n\\n REQUIRE( Catch::toString(vv) == \\\"{ 42 }\\\" );\\n\\n vv.push_back( 250 );\\n\\n REQUIRE( Catch::toString(vv) == \\\"{ 42, 250 }\\\" );\\n\\n}\\n\\n\\n\\nTEST_CASE( \\\"vector<string> -> toString\\\", \\\"[toString][vector]\\\" )\\n\\n{\\n\\n std::vector<std::string> vv;\\n\\n REQUIRE( Catch::toString(vv) == \\\"{ }\\\" );\\n\\n vv.push_back( \\\"hello\\\" );\\n\",\n \"file_path\": \"dependencies/catch/projects/SelfTest/ToStringVector.cpp\",\n \"rank\": 9,\n \"score\": 104656.754491409\n },\n {\n \"content\": \" REQUIRE( Catch::toString(vv) == \\\"{ 42, 250 }\\\" );\\n\\n}\\n\\n\\n\\nTEST_CASE( \\\"vec<vec<string,alloc>> -> toString\\\", \\\"[toString][vector,allocator]\\\" ) {\\n\\n typedef std::vector<std::string,minimal_allocator<std::string> > inner;\\n\\n typedef std::vector<inner> vector;\\n\\n vector v;\\n\\n REQUIRE( Catch::toString(v) == \\\"{ }\\\" );\\n\\n v.push_back( inner { \\\"hello\\\" } );\\n\\n v.push_back( inner { \\\"world\\\" } );\\n\\n REQUIRE( Catch::toString(v) == \\\"{ { \\\\\\\"hello\\\\\\\" }, { \\\\\\\"world\\\\\\\" } }\\\" );\\n\\n}\\n\\n\\n\\n#ifdef __clang__\\n\\n#pragma clang diagnostic pop\\n\\n#endif\\n\\n#endif // CATCH_CPP11_OR_GREATER\\n\",\n \"file_path\": \"dependencies/catch/projects/SelfTest/ToStringVector.cpp\",\n \"rank\": 10,\n \"score\": 104654.56610708775\n },\n {\n \"content\": \" typedef std::size_t size_type;\\n\\n T *allocate( size_type n ) {\\n\\n return static_cast<T *>( ::operator new( n * sizeof(T) ) );\\n\\n }\\n\\n void deallocate( T *p, size_type /*n*/ ) {\\n\\n ::operator delete( static_cast<void *>(p) );\\n\\n }\\n\\n template<typename U>\\n\\n bool operator==( const minimal_allocator<U>& ) const { return true; }\\n\\n template<typename U>\\n\\n bool operator!=( const minimal_allocator<U>& ) const { return false; }\\n\\n };\\n\\n}\\n\\n\\n\\nTEST_CASE( \\\"vector<int,allocator> -> toString\\\", \\\"[toString][vector,allocator]\\\" ) {\\n\\n std::vector<int,minimal_allocator<int> > vv;\\n\\n REQUIRE( Catch::toString(vv) == \\\"{ }\\\" );\\n\\n vv.push_back( 42 );\\n\\n REQUIRE( Catch::toString(vv) == \\\"{ 42 }\\\" );\\n\\n vv.push_back( 250 );\\n\",\n \"file_path\": \"dependencies/catch/projects/SelfTest/ToStringVector.cpp\",\n \"rank\": 11,\n \"score\": 104648.14493087585\n },\n {\n \"content\": \" REQUIRE( Catch::toString(vv) == \\\"{ \\\\\\\"hello\\\\\\\" }\\\" );\\n\\n vv.push_back( \\\"world\\\" );\\n\\n REQUIRE( Catch::toString(vv) == \\\"{ \\\\\\\"hello\\\\\\\", \\\\\\\"world\\\\\\\" }\\\" );\\n\\n}\\n\\n\\n\\n#if defined(CATCH_CPP11_OR_GREATER)\\n\\n#ifdef __clang__\\n\\n#pragma clang diagnostic push\\n\\n#pragma clang diagnostic ignored \\\"-Wc++98-compat\\\"\\n\\n#endif\\n\\n\\n\\n/*\\n\\n Note: These tests *can* be made to work with C++ < 11, but the\\n\\n allocator is a lot more work...\\n\\n*/\\n\\nnamespace {\\n\\n /* Minimal Allocator */\\n\\n template<typename T>\\n\\n struct minimal_allocator {\\n\\n typedef T value_type;\\n\",\n \"file_path\": \"dependencies/catch/projects/SelfTest/ToStringVector.cpp\",\n \"rank\": 12,\n \"score\": 104647.09308975127\n },\n {\n \"content\": \"struct StringMaker :\\n\\n Detail::StringMakerBase<Detail::IsStreamInsertable<T>::value> {};\\n\\n\\n\\ntemplate<typename T>\\n\",\n \"file_path\": \"dependencies/catch/single_include/catch.hpp\",\n \"rank\": 13,\n \"score\": 102943.81152685128\n },\n {\n \"content\": \"struct StringMaker<T*> {\\n\\n template<typename U>\\n\\n static std::string convert( U* p ) {\\n\\n if( !p )\\n\\n return INTERNAL_CATCH_STRINGIFY( NULL );\\n\\n else\\n\\n return Detail::rawMemoryToString( p );\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<typename R, typename C>\\n\",\n \"file_path\": \"dependencies/catch/single_include/catch.hpp\",\n \"rank\": 14,\n \"score\": 99827.84109724201\n },\n {\n \"content\": \" struct point *list; /* allocated list */\\n\",\n \"file_path\": \"dependencies/zlib-1.2.8/examples/zran.c\",\n \"rank\": 15,\n \"score\": 97027.0703027005\n },\n {\n \"content\": \"std::string toString( T const& value ) {\\n\\n return StringMaker<T>::convert( value );\\n\",\n \"file_path\": \"dependencies/catch/include/internal/catch_tostring.h\",\n \"rank\": 16,\n \"score\": 96894.96121409806\n },\n {\n \"content\": \"struct StringMaker<R C::*> {\\n\\n static std::string convert( R C::* p ) {\\n\\n if( !p )\\n\\n return INTERNAL_CATCH_STRINGIFY( NULL );\\n\\n else\\n\\n return Detail::rawMemoryToString( p );\\n\\n }\\n\\n};\\n\\n\\n\\nnamespace Detail {\\n\\n template<typename InputIterator>\\n\\n std::string rangeToString( InputIterator first, InputIterator last );\\n\\n}\\n\\n\\n\\n//template<typename T, typename Allocator>\\n\\n//struct StringMaker<std::vector<T, Allocator> > {\\n\\n// static std::string convert( std::vector<T,Allocator> const& v ) {\\n\\n// return Detail::rangeToString( v.begin(), v.end() );\\n\\n// }\\n\\n//};\\n\",\n \"file_path\": \"dependencies/catch/single_include/catch.hpp\",\n \"rank\": 17,\n \"score\": 96894.96121409806\n },\n {\n \"content\": \"\\tcpConstraint *constraintList;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/include/chipmunk/chipmunk_structs.h\",\n \"rank\": 18,\n \"score\": 94140.14914889622\n },\n {\n \"content\": \"\\tcpArbiter *arbiterList;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/include/chipmunk/chipmunk_structs.h\",\n \"rank\": 19,\n \"score\": 94140.14914889622\n },\n {\n \"content\": \"\\tcpShape *shapeList;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/include/chipmunk/chipmunk_structs.h\",\n \"rank\": 20,\n \"score\": 94140.14914889622\n },\n {\n \"content\": \"struct StringMaker<std::tuple<Types...>> {\\n\\n\\n\\n static std::string convert( const std::tuple<Types...>& tuple )\\n\\n {\\n\\n std::ostringstream os;\\n\\n os << '{';\\n\\n TupleDetail::ElementPrinter<std::tuple<Types...>>::print( tuple, os );\\n\\n os << \\\" }\\\";\\n\\n return os.str();\\n\\n }\\n\\n};\\n\\n#endif // CATCH_CONFIG_CPP11_TUPLE\\n\\n\\n\\nnamespace Detail {\\n\\n template<typename T>\\n\\n std::string makeString( T const& value ) {\\n\\n return StringMaker<T>::convert( value );\\n\\n }\\n\\n} // end namespace Detail\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/single_include/catch.hpp\",\n \"rank\": 21,\n \"score\": 94129.49518961307\n },\n {\n \"content\": \" CHAR DeviceString[128]; \\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/wglew.h\",\n \"rank\": 22,\n \"score\": 91517.50637859157\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_AMD_pinned_memory;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 23,\n \"score\": 86724.79632590723\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_SUN_triangle_list;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 24,\n \"score\": 86715.3553509698\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_list_priority;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 25,\n \"score\": 86715.3553509698\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_specular_vector;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 26,\n \"score\": 86712.08613964343\n },\n {\n \"content\": \"WGLEW_VAR_EXPORT GLboolean __WGLEW_EXT_extensions_string;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/wglew.h\",\n \"rank\": 27,\n \"score\": 86705.541664955\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_GREMEDY_string_marker;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 28,\n \"score\": 86705.541664955\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_REGAL_error_string;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 29,\n \"score\": 86705.541664955\n },\n {\n \"content\": \"WGLEW_VAR_EXPORT GLboolean __WGLEW_ARB_extensions_string;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/wglew.h\",\n \"rank\": 30,\n \"score\": 86705.541664955\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_AMD_pinned_memory;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 31,\n \"score\": 84503.21860697691\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_NVX_gpu_memory_info;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 32,\n \"score\": 84503.21860697691\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_IBM_vertex_array_lists;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 33,\n \"score\": 84494.01947590022\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_SUN_triangle_list;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 34,\n \"score\": 84494.01947590022\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_list_priority;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 35,\n \"score\": 84494.01947590022\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_specular_vector;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 36,\n \"score\": 84490.83401002325\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_GREMEDY_string_marker;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 37,\n \"score\": 84484.45718126498\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_REGAL_error_string;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 38,\n \"score\": 84484.45718126498\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_NVX_gpu_memory_info;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 39,\n \"score\": 82392.61578981737\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_NV_vertex_buffer_unified_memory;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 40,\n \"score\": 82392.61578981737\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_IBM_vertex_array_lists;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 41,\n \"score\": 82383.64642172825\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_NV_vertex_buffer_unified_memory;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 42,\n \"score\": 80384.875175908\n },\n {\n \"content\": \"struct ImGuiListClipper; // Helper to manually clip large list of items\\n\",\n \"file_path\": \"src/imgui/imgui.h\",\n \"rank\": 43,\n \"score\": 71992.0353780674\n },\n {\n \"content\": \"struct ImDrawList; // A single draw command list (generally one per window)\\n\",\n \"file_path\": \"src/imgui/imgui.h\",\n \"rank\": 44,\n \"score\": 70056.62963776068\n },\n {\n \"content\": \"struct has_toString { };\\n\",\n \"file_path\": \"dependencies/catch/projects/SelfTest/ToStringWhich.cpp\",\n \"rank\": 45,\n \"score\": 67366.04175752998\n },\n {\n \"content\": \"struct has_maker_and_toString {};\\n\\n\\n\\nnamespace Catch {\\n\\n inline std::string toString( const has_toString& ) {\\n\\n return \\\"toString( has_toString )\\\";\\n\\n }\\n\\n inline std::string toString( const has_maker_and_toString& ) {\\n\\n return \\\"toString( has_maker_and_toString )\\\";\\n\\n }\\n\\n template<>\\n\\n struct StringMaker<has_maker> {\\n\\n static std::string convert( const has_maker& ) {\\n\\n return \\\"StringMaker<has_maker>\\\";\\n\\n }\\n\\n };\\n\\n template<>\\n\\n struct StringMaker<has_maker_and_toString> {\\n\\n static std::string convert( const has_maker_and_toString& ) {\\n\\n return \\\"StringMaker<has_maker_and_toString>\\\";\\n\\n }\\n\",\n \"file_path\": \"dependencies/catch/projects/SelfTest/ToStringWhich.cpp\",\n \"rank\": 46,\n \"score\": 66038.85746424063\n },\n {\n \"content\": \"/*\\n\\n* TS Elements\\n\\n* Copyright 2015-2018 M. Newhouse\\n\\n* Released under the MIT license.\\n\\n*/\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <algorithm>\\n\\n#include <cctype>\\n\\n#include <iterator>\\n\\n\\n\\n#include <boost/utility/string_ref.hpp>\\n\\n#include <boost/functional/hash.hpp>\\n\\n\\n\\n#include \\\"caseless_string_compare.hpp\\\"\\n\\n\\n\\nnamespace ts\\n\\n{\\n\\n // This function template splits a block of memory by newlines. \\n\",\n \"file_path\": \"src/utility/string_utilities.hpp\",\n \"rank\": 47,\n \"score\": 57740.87699236288\n },\n {\n \"content\": \"/*\\n\\n* TS Elements\\n\\n* Copyright 2015-2018 M. Newhouse\\n\\n* Released under the MIT license.\\n\\n*/\\n\\n\\n\\n#include \\\"string_utilities.hpp\\\"\\n\\n\\n\\n#include <iostream>\\n\\n\\n\\nnamespace ts\\n\\n{\\n\\n}\",\n \"file_path\": \"src/utility/string_utilities.cpp\",\n \"rank\": 48,\n \"score\": 57731.30341313457\n },\n {\n \"content\": \"class ImVector\\n\\n{\\n\\npublic:\\n\\n int Size;\\n\\n int Capacity;\\n\\n T* Data;\\n\\n\\n\\n typedef T value_type;\\n\\n typedef value_type* iterator;\\n\\n typedef const value_type* const_iterator;\\n\\n\\n\\n ImVector() { Size = Capacity = 0; Data = NULL; }\\n\\n ~ImVector() { if (Data) ImGui::MemFree(Data); }\\n\\n\\n\\n inline bool empty() const { return Size == 0; }\\n\\n inline int size() const { return Size; }\\n\\n inline int capacity() const { return Capacity; }\\n\\n\\n\\n inline value_type& operator[](int i) { IM_ASSERT(i < Size); return Data[i]; }\\n\\n inline const value_type& operator[](int i) const { IM_ASSERT(i < Size); return Data[i]; }\\n\",\n \"file_path\": \"src/imgui/imgui.h\",\n \"rank\": 49,\n \"score\": 57727.78906196238\n },\n {\n \"content\": \" // OutputIt must be dereferencable and then assignable from a brace-init-list\\n\\n // containing a const char* and a std::size_t.\\n\\n // For example, a (back_)insert_iterator for a container holding strings or string_refs.\\n\\n template <typename OutputIt>\\n\\n std::size_t split_by_line(const char* data, std::size_t data_size, OutputIt out)\\n\\n {\\n\\n std::size_t count = 0;\\n\\n for (auto end = data + data_size; data != end; ++count)\\n\\n {\\n\\n const char* line_end = std::find(data, end, '\\\\n');\\n\\n std::size_t line_size = std::distance(data, line_end);\\n\\n\\n\\n *out = { data, line_size }; ++out;\\n\\n\\n\\n data = std::find_if(line_end, end, [](char ch) { return ch != '\\\\n'; });\\n\\n }\\n\\n\\n\\n return count;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/utility/string_utilities.hpp\",\n \"rank\": 50,\n \"score\": 57727.29339691259\n },\n {\n \"content\": \" if (new_size == boost::string_ref::npos) new_size = string.size();\\n\\n\\n\\n return boost::string_ref(string.data(), new_size);\\n\\n }\\n\\n\\n\\n\\n\\n template <typename String>\\n\\n inline void primitive_tolower(String& string)\\n\\n {\\n\\n using std::begin;\\n\\n using std::end;\\n\\n\\n\\n std::transform(begin(string), end(string), begin(string), [](auto ch) { return std::tolower(ch); });\\n\\n }\\n\\n\\n\\n struct StringRefHasher\\n\\n {\\n\\n auto operator()(boost::string_ref string) const\\n\\n {\\n\\n return boost::hash_range(string.begin(), string.end());\\n\\n }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"src/utility/string_utilities.hpp\",\n \"rank\": 51,\n \"score\": 57727.214206387434\n },\n {\n \"content\": \" inline boost::string_ref make_string_ref(const char* data, const char* end)\\n\\n {\\n\\n return boost::string_ref(data, std::distance(data, end));\\n\\n }\\n\\n\\n\\n inline boost::string_ref remove_leading_spaces(boost::string_ref string, const char* spaces = \\\" \\\\t\\\\r\\\\n\\\")\\n\\n {\\n\\n auto pos = string.find_first_not_of(spaces);\\n\\n if (pos == std::string::npos) pos = string.size();\\n\\n\\n\\n string.remove_prefix(pos);\\n\\n return string;\\n\\n }\\n\\n\\n\\n inline boost::string_ref extract_word(boost::string_ref string)\\n\\n {\\n\\n const char spaces[] = \\\" \\\\t\\\\r\\\\n\\\";\\n\\n string = remove_leading_spaces(string, spaces);\\n\\n\\n\\n auto new_size = string.find_first_of(spaces);\\n\",\n \"file_path\": \"src/utility/string_utilities.hpp\",\n \"rank\": 52,\n \"score\": 57727.178707422354\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_ARB_shading_language_include;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/msvc/glew/include/GL/glew.h\",\n \"rank\": 53,\n \"score\": 57155.71522148998\n },\n {\n \"content\": \"GLEW_VAR_EXPORT GLboolean __GLEW_ARB_shading_language_include;\\n\",\n \"file_path\": \"dependencies/chipmunk-7.0.2/xcode/libGLEW/include/GL/glew.h\",\n \"rank\": 54,\n \"score\": 56166.15355421444\n },\n {\n \"content\": \"/*\\n\\n* TS Elements\\n\\n* Copyright 2015-2018 M. Newhouse\\n\\n* Released under the MIT license.\\n\\n*/\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <string>\\n\\n#include <initializer_list>\\n\\n\\n\\n#include <boost/utility/string_ref.hpp>\\n\\n#include <boost/filesystem/path.hpp>\\n\\n\\n\\nnamespace ts\\n\\n{\\n\\n namespace resources\\n\\n {\\n\\n // These are utility functions that take a file name and a list of search directories, \\n\\n // iterating over these directories until the specified file name is found in one of them.\\n\\n // find_include_directory returns only the directory, find_include_path returns the full path.\\n\\n // If the file is not found, an empty-state object is returned.\\n\\n // Paths are expected to be UTF-8 encoded.\\n\\n\\n\\n boost::string_ref find_include_directory(boost::string_ref file_name, std::initializer_list<boost::string_ref> search_paths);\\n\\n boost::filesystem::path find_include_path(boost::string_ref file_name, std::initializer_list<boost::string_ref> search_paths);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/resources/include_path.hpp\",\n \"rank\": 55,\n \"score\": 55881.96144167202\n },\n {\n \"content\": \"/*\\n\\n* TS Elements\\n\\n* Copyright 2015-2018 M. Newhouse\\n\\n* Released under the MIT license.\\n\\n*/\\n\\n\\n\\n\\n\\n#include \\\"include_path.hpp\\\"\\n\\n\\n\\n#include <boost/filesystem/convenience.hpp>\\n\\n\\n\\nnamespace ts\\n\\n{\\n\\n namespace resources\\n\\n {\\n\\n namespace bfs = boost::filesystem;\\n\\n\\n\\n bfs::path find_include_path(boost::string_ref file_name,\\n\\n std::initializer_list<boost::string_ref> search_paths)\\n\\n {\\n\",\n \"file_path\": \"src/resources/include_path.cpp\",\n \"rank\": 56,\n \"score\": 55876.6744837734\n },\n {\n \"content\": \" _stream << \\\"\\\\n\\\";\\n\\n _stream << *it;\\n\\n }\\n\\n return _stream;\\n\\n }\\n\\n\\n\\n private:\\n\\n std::string str;\\n\\n TextAttributes attr;\\n\\n std::vector<std::string> lines;\\n\\n };\\n\\n\\n\\n} // end namespace Tbc\\n\\n\\n\\n#ifdef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE\\n\\n} // end outer namespace\\n\\n#endif\\n\\n\\n\\n#endif // TBC_TEXT_FORMAT_H_INCLUDED\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 57,\n \"score\": 55875.53000111851\n },\n {\n \"content\": \"#define STITCH_TBC_TEXT_FORMAT_OPEN_NAMESPACE STITCH_CLARA_OPEN_NAMESPACE\\n\\n\\n\\n// ----------- #included from tbc_text_format.h -----------\\n\\n\\n\\n/*\\n\\n * Created by Phil on 18/4/2013.\\n\\n * Copyright 2013 Two Blue Cubes Ltd. All rights reserved.\\n\\n *\\n\\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\\n\\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\\n\\n */\\n\\n// Only use header guard if we are not using an outer namespace\\n\\n#if !defined(TBC_TEXT_FORMAT_H_INCLUDED) || defined(STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE)\\n\\n#ifndef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE\\n\\n#define TBC_TEXT_FORMAT_H_INCLUDED\\n\\n#endif\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n#include <sstream>\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 58,\n \"score\": 55873.01179513845\n },\n {\n \"content\": \" bfs::path full_path;\\n\\n for (boost::string_ref path : search_paths)\\n\\n {\\n\\n full_path.assign(path.begin(), path.end());\\n\\n full_path.append(file_name.begin(), file_name.end());\\n\\n\\n\\n if (boost::filesystem::is_regular_file(full_path)) return full_path;\\n\\n }\\n\\n\\n\\n full_path.clear();\\n\\n return full_path;\\n\\n }\\n\\n\\n\\n boost::string_ref find_include_directory(boost::string_ref file_name,\\n\\n std::initializer_list<boost::string_ref> search_paths)\\n\\n {\\n\\n bfs::path full_path;\\n\\n for (boost::string_ref path : search_paths)\\n\\n {\\n\\n full_path.assign(path.begin(), path.end());\\n\\n full_path.append(file_name.begin(), file_name.end());\\n\\n\\n\\n if (boost::filesystem::is_regular_file(full_path)) return path;\\n\\n }\\n\\n\\n\\n return boost::string_ref();\\n\\n }\\n\\n }\\n\\n}\",\n \"file_path\": \"src/resources/include_path.cpp\",\n \"rank\": 59,\n \"score\": 55872.448492608855\n },\n {\n \"content\": \"// ----------- end of #include from tbc_text_format.h -----------\\n\\n// ........... back in /Users/philnash/Dev/OSS/Clara/srcs/clara.h\\n\\n\\n\\n#undef STITCH_TBC_TEXT_FORMAT_OPEN_NAMESPACE\\n\\n\\n\\n\\n\\n#include <map>\\n\\n#include <algorithm>\\n\\n#include <stdexcept>\\n\\n#include <memory>\\n\\n\\n\\n// Use optional outer namespace\\n\\n#ifdef STITCH_CLARA_OPEN_NAMESPACE\\n\\nSTITCH_CLARA_OPEN_NAMESPACE\\n\\n#endif\\n\\n\\n\\nnamespace Clara {\\n\\n\\n\\n struct UnpositionalTag {};\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 60,\n \"score\": 55871.36334788559\n },\n {\n \"content\": \"\\n\\n struct Parser {\\n\\n Parser() : separators( \\\" \\\\t=:\\\" ) {}\\n\\n\\n\\n struct Token {\\n\\n enum Type { Positional, ShortOpt, LongOpt };\\n\\n Token( Type _type, std::string const& _data ) : type( _type ), data( _data ) {}\\n\\n Type type;\\n\\n std::string data;\\n\\n };\\n\\n\\n\\n void parseIntoTokens( int argc, char const * const * argv, std::vector<Parser::Token>& tokens ) const {\\n\\n const std::string doubleDash = \\\"--\\\";\\n\\n for( int i = 1; i < argc && argv[i] != doubleDash; ++i )\\n\\n parseIntoTokens( argv[i] , tokens);\\n\\n }\\n\\n void parseIntoTokens( std::string arg, std::vector<Parser::Token>& tokens ) const {\\n\\n while( !arg.empty() ) {\\n\\n Parser::Token token( Parser::Token::Positional, arg );\\n\\n arg = \\\"\\\";\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 61,\n \"score\": 55871.21285230026\n },\n {\n \"content\": \"/*\\n\\n * Created by Phil on 22/10/2010.\\n\\n * Copyright 2010 Two Blue Cubes Ltd\\n\\n *\\n\\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\\n\\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\\n\\n */\\n\\n\\n\\n#ifndef TWOBLUECUBES_CATCH_HPP_INCLUDED\\n\\n#define TWOBLUECUBES_CATCH_HPP_INCLUDED\\n\\n\\n\\n#ifdef __clang__\\n\\n# pragma clang system_header\\n\\n#elif defined __GNUC__\\n\\n# pragma GCC system_header\\n\\n#endif\\n\\n\\n\\n#include \\\"internal/catch_suppress_warnings.h\\\"\\n\\n\\n\\n#if defined(CATCH_CONFIG_MAIN) || defined(CATCH_CONFIG_RUNNER)\\n\",\n \"file_path\": \"dependencies/catch/include/catch.hpp\",\n \"rank\": 62,\n \"score\": 55871.1577613205\n },\n {\n \"content\": \" _remainder = _remainder.substr( _pos );\\n\\n }\\n\\n\\n\\n typedef std::vector<std::string>::const_iterator const_iterator;\\n\\n\\n\\n const_iterator begin() const { return lines.begin(); }\\n\\n const_iterator end() const { return lines.end(); }\\n\\n std::string const& last() const { return lines.back(); }\\n\\n std::size_t size() const { return lines.size(); }\\n\\n std::string const& operator[]( std::size_t _index ) const { return lines[_index]; }\\n\\n std::string toString() const {\\n\\n std::ostringstream oss;\\n\\n oss << *this;\\n\\n return oss.str();\\n\\n }\\n\\n\\n\\n inline friend std::ostream& operator << ( std::ostream& _stream, Text const& _text ) {\\n\\n for( Text::const_iterator it = _text.begin(), itEnd = _text.end();\\n\\n it != itEnd; ++it ) {\\n\\n if( it != _text.begin() )\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 63,\n \"score\": 55870.37347780317\n },\n {\n \"content\": \" ConfigT parse( int argc, char const * const * argv ) const {\\n\\n ConfigT config;\\n\\n parseInto( argc, argv, config );\\n\\n return config;\\n\\n }\\n\\n\\n\\n std::vector<Parser::Token> parseInto( int argc, char const * const * argv, ConfigT& config ) const {\\n\\n std::string processName = argv[0];\\n\\n std::size_t lastSlash = processName.find_last_of( \\\"/\\\\\\\\\\\" );\\n\\n if( lastSlash != std::string::npos )\\n\\n processName = processName.substr( lastSlash+1 );\\n\\n m_boundProcessName.set( config, processName );\\n\\n std::vector<Parser::Token> tokens;\\n\\n Parser parser;\\n\\n parser.parseIntoTokens( argc, argv, tokens );\\n\\n return populate( tokens, config );\\n\\n }\\n\\n\\n\\n std::vector<Parser::Token> populate( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\\n\\n validate();\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 64,\n \"score\": 55870.346277313736\n },\n {\n \"content\": \" }\\n\\n if( !errors.empty() ) {\\n\\n std::ostringstream oss;\\n\\n for( std::vector<std::string>::const_iterator it = errors.begin(), itEnd = errors.end();\\n\\n it != itEnd;\\n\\n ++it ) {\\n\\n if( it != errors.begin() )\\n\\n oss << \\\"\\\\n\\\";\\n\\n oss << *it;\\n\\n }\\n\\n throw std::runtime_error( oss.str() );\\n\\n }\\n\\n return unusedTokens;\\n\\n }\\n\\n std::vector<Parser::Token> populateFixedArgs( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\\n\\n std::vector<Parser::Token> unusedTokens;\\n\\n int position = 1;\\n\\n for( std::size_t i = 0; i < tokens.size(); ++i ) {\\n\\n Parser::Token const& token = tokens[i];\\n\\n typename std::map<int, Arg>::const_iterator it = m_positionalArgs.find( position );\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 65,\n \"score\": 55869.81297989231\n },\n {\n \"content\": \" throw std::logic_error( \\\"option not bound\\\" );\\n\\n }\\n\\n };\\n\\n struct OptionArgProperties {\\n\\n std::vector<std::string> shortNames;\\n\\n std::string longName;\\n\\n\\n\\n bool hasShortName( std::string const& shortName ) const {\\n\\n return std::find( shortNames.begin(), shortNames.end(), shortName ) != shortNames.end();\\n\\n }\\n\\n bool hasLongName( std::string const& _longName ) const {\\n\\n return _longName == longName;\\n\\n }\\n\\n };\\n\\n struct PositionalArgProperties {\\n\\n PositionalArgProperties() : position( -1 ) {}\\n\\n int position; // -1 means non-positional (floating)\\n\\n\\n\\n bool isFixedPositional() const {\\n\\n return position != -1;\\n\\n }\\n\\n };\\n\\n\\n\\n template<typename ConfigT>\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 66,\n \"score\": 55869.76202114379\n },\n {\n \"content\": \" std::vector<Parser::Token> unusedTokens = populateOptions( tokens, config );\\n\\n unusedTokens = populateFixedArgs( unusedTokens, config );\\n\\n unusedTokens = populateFloatingArgs( unusedTokens, config );\\n\\n return unusedTokens;\\n\\n }\\n\\n\\n\\n std::vector<Parser::Token> populateOptions( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\\n\\n std::vector<Parser::Token> unusedTokens;\\n\\n std::vector<std::string> errors;\\n\\n for( std::size_t i = 0; i < tokens.size(); ++i ) {\\n\\n Parser::Token const& token = tokens[i];\\n\\n typename std::vector<Arg>::const_iterator it = m_options.begin(), itEnd = m_options.end();\\n\\n for(; it != itEnd; ++it ) {\\n\\n Arg const& arg = *it;\\n\\n\\n\\n try {\\n\\n if( ( token.type == Parser::Token::ShortOpt && arg.hasShortName( token.data ) ) ||\\n\\n ( token.type == Parser::Token::LongOpt && arg.hasLongName( token.data ) ) ) {\\n\\n if( arg.takesArg() ) {\\n\\n if( i == tokens.size()-1 || tokens[i+1].type != Parser::Token::Positional )\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 67,\n \"score\": 55869.20645410334\n },\n {\n \"content\": \"# define CATCH_IMPL\\n\\n#endif\\n\\n\\n\\n#ifdef CATCH_IMPL\\n\\n# ifndef CLARA_CONFIG_MAIN\\n\\n# define CLARA_CONFIG_MAIN_NOT_DEFINED\\n\\n# define CLARA_CONFIG_MAIN\\n\\n# endif\\n\\n#endif\\n\\n\\n\\n#include \\\"internal/catch_notimplemented_exception.h\\\"\\n\\n#include \\\"internal/catch_context.h\\\"\\n\\n#include \\\"internal/catch_test_registry.hpp\\\"\\n\\n#include \\\"internal/catch_capture.hpp\\\"\\n\\n#include \\\"internal/catch_section.h\\\"\\n\\n#include \\\"internal/catch_generators.hpp\\\"\\n\\n#include \\\"internal/catch_interfaces_exception.h\\\"\\n\\n#include \\\"internal/catch_approx.hpp\\\"\\n\\n#include \\\"internal/catch_matchers.hpp\\\"\\n\\n#include \\\"internal/catch_compiler_capabilities.h\\\"\\n\",\n \"file_path\": \"dependencies/catch/include/catch.hpp\",\n \"rank\": 68,\n \"score\": 55867.81637342835\n },\n {\n \"content\": \"#include \\\"internal/catch_interfaces_tag_alias_registry.h\\\"\\n\\n\\n\\n// These files are included here so the single_include script doesn't put them\\n\\n// in the conditionally compiled sections\\n\\n#include \\\"internal/catch_test_case_info.h\\\"\\n\\n#include \\\"internal/catch_interfaces_runner.h\\\"\\n\\n\\n\\n#ifdef __OBJC__\\n\\n#include \\\"internal/catch_objc.hpp\\\"\\n\\n#endif\\n\\n\\n\\n#ifdef CATCH_IMPL\\n\\n#include \\\"internal/catch_impl.hpp\\\"\\n\\n#endif\\n\\n\\n\\n#ifdef CATCH_CONFIG_MAIN\\n\\n#include \\\"internal/catch_default_main.hpp\\\"\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/catch.hpp\",\n \"rank\": 69,\n \"score\": 55867.757168767384\n },\n {\n \"content\": \" virtual void set( C& p, std::string const& stringValue ) const {\\n\\n convertInto( stringValue, p.*member );\\n\\n }\\n\\n virtual void setFlag( C& p ) const {\\n\\n convertInto( true, p.*member );\\n\\n }\\n\\n virtual bool takesArg() const { return !IsBool<M>::value; }\\n\\n virtual IArgFunction<C>* clone() const { return new BoundDataMember( *this ); }\\n\\n M C::* member;\\n\\n };\\n\\n template<typename C, typename M>\\n\\n struct BoundUnaryMethod : IArgFunction<C>{\\n\\n BoundUnaryMethod( void (C::*_member)( M ) ) : member( _member ) {}\\n\\n virtual void set( C& p, std::string const& stringValue ) const {\\n\\n typename RemoveConstRef<M>::type value;\\n\\n convertInto( stringValue, value );\\n\\n (p.*member)( value );\\n\\n }\\n\\n virtual void setFlag( C& p ) const {\\n\\n typename RemoveConstRef<M>::type value;\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 70,\n \"score\": 55866.72855319066\n },\n {\n \"content\": \"\\n\\n // Bind a free function taking a single argument - the object to operate on (requires a placeholder string)\\n\\n template<typename C, typename T>\\n\\n void bind( void (* binaryFunction)( C&, T ), std::string const& placeholder ) {\\n\\n m_arg->boundField = new Detail::BoundBinaryFunction<C, T>( binaryFunction );\\n\\n m_arg->placeholder = placeholder;\\n\\n }\\n\\n\\n\\n ArgBuilder& describe( std::string const& description ) {\\n\\n m_arg->description = description;\\n\\n return *this;\\n\\n }\\n\\n ArgBuilder& detail( std::string const& detail ) {\\n\\n m_arg->detail = detail;\\n\\n return *this;\\n\\n }\\n\\n\\n\\n protected:\\n\\n Arg* m_arg;\\n\\n };\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 71,\n \"score\": 55866.609553619586\n },\n {\n \"content\": \" }\\n\\n }\\n\\n std::string separators;\\n\\n };\\n\\n\\n\\n template<typename ConfigT>\\n\\n struct CommonArgProperties {\\n\\n CommonArgProperties() {}\\n\\n CommonArgProperties( Detail::BoundArgFunction<ConfigT> const& _boundField ) : boundField( _boundField ) {}\\n\\n\\n\\n Detail::BoundArgFunction<ConfigT> boundField;\\n\\n std::string description;\\n\\n std::string detail;\\n\\n std::string placeholder; // Only value if boundField takes an arg\\n\\n\\n\\n bool takesArg() const {\\n\\n return !placeholder.empty();\\n\\n }\\n\\n void validate() const {\\n\\n if( !boundField.isSet() )\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 72,\n \"score\": 55866.609553619586\n },\n {\n \"content\": \" pos = remainder.find_last_of( wrappableChars, width );\\n\\n if( pos != std::string::npos && pos > 0 ) {\\n\\n spliceLine( indent, remainder, pos );\\n\\n if( remainder[0] == ' ' )\\n\\n remainder = remainder.substr( 1 );\\n\\n }\\n\\n else {\\n\\n spliceLine( indent, remainder, width-1 );\\n\\n lines.back() += \\\"-\\\";\\n\\n }\\n\\n if( lines.size() == 1 )\\n\\n indent = _attr.indent;\\n\\n if( tabPos != std::string::npos )\\n\\n indent += tabPos;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n void spliceLine( std::size_t _indent, std::string& _remainder, std::size_t _pos ) {\\n\\n lines.push_back( std::string( _indent, ' ' ) + _remainder.substr( 0, _pos ) );\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 73,\n \"score\": 55866.56399660906\n },\n {\n \"content\": \" argSynopsis( oss );\\n\\n return oss.str();\\n\\n }\\n\\n\\n\\n void usage( std::ostream& os, std::string const& procName ) const {\\n\\n validate();\\n\\n os << \\\"usage:\\\\n \\\" << procName << \\\" \\\";\\n\\n argSynopsis( os );\\n\\n if( !m_options.empty() ) {\\n\\n os << \\\" [options]\\\\n\\\\nwhere options are: \\\\n\\\";\\n\\n optUsage( os, 2 );\\n\\n }\\n\\n os << \\\"\\\\n\\\";\\n\\n }\\n\\n std::string usage( std::string const& procName ) const {\\n\\n std::ostringstream oss;\\n\\n usage( oss, procName );\\n\\n return oss.str();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 74,\n \"score\": 55866.407543056834\n },\n {\n \"content\": \" .setWidth( width - maxWidth - 3 ) );\\n\\n\\n\\n for( std::size_t i = 0; i < (std::max)( usage.size(), desc.size() ); ++i ) {\\n\\n std::string usageCol = i < usage.size() ? usage[i] : \\\"\\\";\\n\\n os << usageCol;\\n\\n\\n\\n if( i < desc.size() && !desc[i].empty() )\\n\\n os << std::string( indent + 2 + maxWidth - usageCol.size(), ' ' )\\n\\n << desc[i];\\n\\n os << \\\"\\\\n\\\";\\n\\n }\\n\\n }\\n\\n }\\n\\n std::string optUsage() const {\\n\\n std::ostringstream oss;\\n\\n optUsage( oss );\\n\\n return oss.str();\\n\\n }\\n\\n\\n\\n void argSynopsis( std::ostream& os ) const {\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 75,\n \"score\": 55866.18622971891\n },\n {\n \"content\": \" template<typename T> struct RemoveConstRef{ typedef T type; };\\n\\n template<typename T> struct RemoveConstRef<T&>{ typedef T type; };\\n\\n template<typename T> struct RemoveConstRef<T const&>{ typedef T type; };\\n\\n template<typename T> struct RemoveConstRef<T const>{ typedef T type; };\\n\\n\\n\\n template<typename T> struct IsBool { static const bool value = false; };\\n\\n template<> struct IsBool<bool> { static const bool value = true; };\\n\\n\\n\\n template<typename T>\\n\\n void convertInto( std::string const& _source, T& _dest ) {\\n\\n std::stringstream ss;\\n\\n ss << _source;\\n\\n ss >> _dest;\\n\\n if( ss.fail() )\\n\\n throw std::runtime_error( \\\"Unable to convert \\\" + _source + \\\" to destination type\\\" );\\n\\n }\\n\\n inline void convertInto( std::string const& _source, std::string& _dest ) {\\n\\n _dest = _source;\\n\\n }\\n\\n inline void convertInto( std::string const& _source, bool& _dest ) {\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 76,\n \"score\": 55865.89610102517\n },\n {\n \"content\": \" convertInto( true, value );\\n\\n (p.*member)( value );\\n\\n }\\n\\n virtual bool takesArg() const { return !IsBool<M>::value; }\\n\\n virtual IArgFunction<C>* clone() const { return new BoundUnaryMethod( *this ); }\\n\\n void (C::*member)( M );\\n\\n };\\n\\n template<typename C>\\n\\n struct BoundNullaryMethod : IArgFunction<C>{\\n\\n BoundNullaryMethod( void (C::*_member)() ) : member( _member ) {}\\n\\n virtual void set( C& p, std::string const& stringValue ) const {\\n\\n bool value;\\n\\n convertInto( stringValue, value );\\n\\n if( value )\\n\\n (p.*member)();\\n\\n }\\n\\n virtual void setFlag( C& p ) const {\\n\\n (p.*member)();\\n\\n }\\n\\n virtual bool takesArg() const { return false; }\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 77,\n \"score\": 55865.858455544156\n },\n {\n \"content\": \" virtual IArgFunction<C>* clone() const { return new BoundNullaryMethod( *this ); }\\n\\n void (C::*member)();\\n\\n };\\n\\n\\n\\n template<typename C>\\n\\n struct BoundUnaryFunction : IArgFunction<C>{\\n\\n BoundUnaryFunction( void (*_function)( C& ) ) : function( _function ) {}\\n\\n virtual void set( C& obj, std::string const& stringValue ) const {\\n\\n bool value;\\n\\n convertInto( stringValue, value );\\n\\n if( value )\\n\\n function( obj );\\n\\n }\\n\\n virtual void setFlag( C& p ) const {\\n\\n function( p );\\n\\n }\\n\\n virtual bool takesArg() const { return false; }\\n\\n virtual IArgFunction<C>* clone() const { return new BoundUnaryFunction( *this ); }\\n\\n void (*function)( C& );\\n\\n };\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 78,\n \"score\": 55865.83472499425\n },\n {\n \"content\": \" if( it != m_positionalArgs.end() )\\n\\n it->second.boundField.set( config, token.data );\\n\\n else\\n\\n unusedTokens.push_back( token );\\n\\n if( token.type == Parser::Token::Positional )\\n\\n position++;\\n\\n }\\n\\n return unusedTokens;\\n\\n }\\n\\n std::vector<Parser::Token> populateFloatingArgs( std::vector<Parser::Token> const& tokens, ConfigT& config ) const {\\n\\n if( !m_floatingArg.get() )\\n\\n return tokens;\\n\\n std::vector<Parser::Token> unusedTokens;\\n\\n for( std::size_t i = 0; i < tokens.size(); ++i ) {\\n\\n Parser::Token const& token = tokens[i];\\n\\n if( token.type == Parser::Token::Positional )\\n\\n m_floatingArg->boundField.set( config, token.data );\\n\\n else\\n\\n unusedTokens.push_back( token );\\n\\n }\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 79,\n \"score\": 55865.819319091366\n },\n {\n \"content\": \" extern UnpositionalTag _;\\n\\n\\n\\n#ifdef CLARA_CONFIG_MAIN\\n\\n UnpositionalTag _;\\n\\n#endif\\n\\n\\n\\n namespace Detail {\\n\\n\\n\\n#ifdef CLARA_CONSOLE_WIDTH\\n\\n const unsigned int consoleWidth = CLARA_CONFIG_CONSOLE_WIDTH;\\n\\n#else\\n\\n const unsigned int consoleWidth = 80;\\n\\n#endif\\n\\n\\n\\n using namespace Tbc;\\n\\n\\n\\n inline bool startsWith( std::string const& str, std::string const& prefix ) {\\n\\n return str.size() >= prefix.size() && str.substr( 0, prefix.size() ) == prefix;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 80,\n \"score\": 55865.615822273714\n },\n {\n \"content\": \"\\n\\n template<typename C, typename T>\\n\\n struct BoundBinaryFunction : IArgFunction<C>{\\n\\n BoundBinaryFunction( void (*_function)( C&, T ) ) : function( _function ) {}\\n\\n virtual void set( C& obj, std::string const& stringValue ) const {\\n\\n typename RemoveConstRef<T>::type value;\\n\\n convertInto( stringValue, value );\\n\\n function( obj, value );\\n\\n }\\n\\n virtual void setFlag( C& obj ) const {\\n\\n typename RemoveConstRef<T>::type value;\\n\\n convertInto( true, value );\\n\\n function( obj, value );\\n\\n }\\n\\n virtual bool takesArg() const { return !IsBool<T>::value; }\\n\\n virtual IArgFunction<C>* clone() const { return new BoundBinaryFunction( *this ); }\\n\\n void (*function)( C&, T );\\n\\n };\\n\\n\\n\\n } // namespace Detail\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 81,\n \"score\": 55865.5647634745\n },\n {\n \"content\": \" return unusedTokens;\\n\\n }\\n\\n\\n\\n void validate() const\\n\\n {\\n\\n if( m_options.empty() && m_positionalArgs.empty() && !m_floatingArg.get() )\\n\\n throw std::logic_error( \\\"No options or arguments specified\\\" );\\n\\n\\n\\n for( typename std::vector<Arg>::const_iterator it = m_options.begin(),\\n\\n itEnd = m_options.end();\\n\\n it != itEnd; ++it )\\n\\n it->validate();\\n\\n }\\n\\n\\n\\n private:\\n\\n Detail::BoundArgFunction<ConfigT> m_boundProcessName;\\n\\n std::vector<Arg> m_options;\\n\\n std::map<int, Arg> m_positionalArgs;\\n\\n ArgAutoPtr m_floatingArg;\\n\\n int m_highestSpecifiedArgPosition;\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 82,\n \"score\": 55865.31450083142\n },\n {\n \"content\": \" bool m_throwOnUnrecognisedTokens;\\n\\n };\\n\\n\\n\\n} // end namespace Clara\\n\\n\\n\\n\\n\\nSTITCH_CLARA_CLOSE_NAMESPACE\\n\\n#undef STITCH_CLARA_OPEN_NAMESPACE\\n\\n#undef STITCH_CLARA_CLOSE_NAMESPACE\\n\\n\\n\\n\\n\\n#endif // TWOBLUECUBES_CLARA_H_INCLUDED\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 83,\n \"score\": 55865.12197911819\n },\n {\n \"content\": \"/*\\n\\n * Created by Phil on 25/05/2013.\\n\\n * Copyright 2013 Two Blue Cubes Ltd. All rights reserved.\\n\\n *\\n\\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\\n\\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\\n\\n */\\n\\n\\n\\n// Only use header guard if we are not using an outer namespace\\n\\n#if !defined(TWOBLUECUBES_CLARA_H_INCLUDED) || defined(STITCH_CLARA_OPEN_NAMESPACE)\\n\\n\\n\\n#ifndef STITCH_CLARA_OPEN_NAMESPACE\\n\\n#define TWOBLUECUBES_CLARA_H_INCLUDED\\n\\n#define STITCH_CLARA_OPEN_NAMESPACE\\n\\n#define STITCH_CLARA_CLOSE_NAMESPACE\\n\\n#else\\n\\n#define STITCH_CLARA_CLOSE_NAMESPACE }\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 84,\n \"score\": 55865.0226476791\n },\n {\n \"content\": \" if( token.data[0] == '-' ) {\\n\\n if( token.data.size() > 1 && token.data[1] == '-' ) {\\n\\n token = Parser::Token( Parser::Token::LongOpt, token.data.substr( 2 ) );\\n\\n }\\n\\n else {\\n\\n token = Parser::Token( Parser::Token::ShortOpt, token.data.substr( 1 ) );\\n\\n if( token.data.size() > 1 && separators.find( token.data[1] ) == std::string::npos ) {\\n\\n arg = \\\"-\\\" + token.data.substr( 1 );\\n\\n token.data = token.data.substr( 0, 1 );\\n\\n }\\n\\n }\\n\\n }\\n\\n if( token.type != Parser::Token::Positional ) {\\n\\n std::size_t pos = token.data.find_first_of( separators );\\n\\n if( pos != std::string::npos ) {\\n\\n arg = token.data.substr( pos+1 );\\n\\n token.data = token.data.substr( 0, pos );\\n\\n }\\n\\n }\\n\\n tokens.push_back( token );\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 85,\n \"score\": 55864.8081709475\n },\n {\n \"content\": \" m_arg->placeholder = placeholder;\\n\\n }\\n\\n\\n\\n // Bind a method taking a single, boolean argument (no placeholder string required)\\n\\n template<typename C>\\n\\n void bind( void (C::* unaryMethod)( bool ) ) {\\n\\n m_arg->boundField = new Detail::BoundUnaryMethod<C,bool>( unaryMethod );\\n\\n }\\n\\n\\n\\n // Bind a method that takes no arguments (will be called if opt is present)\\n\\n template<typename C>\\n\\n void bind( void (C::* nullaryMethod)() ) {\\n\\n m_arg->boundField = new Detail::BoundNullaryMethod<C>( nullaryMethod );\\n\\n }\\n\\n\\n\\n // Bind a free function taking a single argument - the object to operate on (no placeholder string required)\\n\\n template<typename C>\\n\\n void bind( void (* unaryFunction)( C& ) ) {\\n\\n m_arg->boundField = new Detail::BoundUnaryFunction<C>( unaryFunction );\\n\\n }\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 86,\n \"score\": 55864.478315762484\n },\n {\n \"content\": \"# ifdef CATCH_CONFIG_CPP11_GENERATED_METHODS\\n\\n IArgFunction() = default;\\n\\n IArgFunction( IArgFunction const& ) = default;\\n\\n# endif\\n\\n virtual void set( ConfigT& config, std::string const& value ) const = 0;\\n\\n virtual void setFlag( ConfigT& config ) const = 0;\\n\\n virtual bool takesArg() const = 0;\\n\\n virtual IArgFunction* clone() const = 0;\\n\\n };\\n\\n\\n\\n template<typename ConfigT>\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 87,\n \"score\": 55864.334765368876\n },\n {\n \"content\": \"#define GENERATE( expr) INTERNAL_CATCH_GENERATE( expr )\\n\\n\\n\\n#endif\\n\\n\\n\\n#define CATCH_TRANSLATE_EXCEPTION( signature ) INTERNAL_CATCH_TRANSLATE_EXCEPTION( signature )\\n\\n\\n\\n// \\\"BDD-style\\\" convenience wrappers\\n\\n#ifdef CATCH_CONFIG_VARIADIC_MACROS\\n\\n#define SCENARIO( ... ) TEST_CASE( \\\"Scenario: \\\" __VA_ARGS__ )\\n\\n#define SCENARIO_METHOD( className, ... ) INTERNAL_CATCH_TEST_CASE_METHOD( className, \\\"Scenario: \\\" __VA_ARGS__ )\\n\\n#else\\n\\n#define SCENARIO( name, tags ) TEST_CASE( \\\"Scenario: \\\" name, tags )\\n\\n#define SCENARIO_METHOD( className, name, tags ) INTERNAL_CATCH_TEST_CASE_METHOD( className, \\\"Scenario: \\\" name, tags )\\n\\n#endif\\n\\n#define GIVEN( desc ) SECTION( \\\" Given: \\\" desc, \\\"\\\" )\\n\\n#define WHEN( desc ) SECTION( \\\" When: \\\" desc, \\\"\\\" )\\n\\n#define AND_WHEN( desc ) SECTION( \\\"And when: \\\" desc, \\\"\\\" )\\n\\n#define THEN( desc ) SECTION( \\\" Then: \\\" desc, \\\"\\\" )\\n\\n#define AND_THEN( desc ) SECTION( \\\" And: \\\" desc, \\\"\\\" )\\n\\n\\n\\nusing Catch::Detail::Approx;\\n\\n\\n\\n#include \\\"internal/catch_reenable_warnings.h\\\"\\n\\n\\n\\n#endif // TWOBLUECUBES_CATCH_HPP_INCLUDED\\n\",\n \"file_path\": \"dependencies/catch/include/catch.hpp\",\n \"rank\": 88,\n \"score\": 55864.217272092836\n },\n {\n \"content\": \" width = pos;\\n\\n }\\n\\n pos = remainder.find_last_of( _attr.tabChar, width );\\n\\n if( pos != std::string::npos ) {\\n\\n tabPos = pos;\\n\\n if( remainder[width] == '\\\\n' )\\n\\n width--;\\n\\n remainder = remainder.substr( 0, tabPos ) + remainder.substr( tabPos+1 );\\n\\n }\\n\\n\\n\\n if( width == remainder.size() ) {\\n\\n spliceLine( indent, remainder, width );\\n\\n }\\n\\n else if( remainder[width] == '\\\\n' ) {\\n\\n spliceLine( indent, remainder, width );\\n\\n if( width <= 1 || remainder.size() != 1 )\\n\\n remainder = remainder.substr( 1 );\\n\\n indent = _attr.indent;\\n\\n }\\n\\n else {\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 89,\n \"score\": 55863.95407635165\n },\n {\n \"content\": \"\\n\\n// Use optional outer namespace\\n\\n#ifdef STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE\\n\\nnamespace STITCH_TBC_TEXT_FORMAT_OUTER_NAMESPACE {\\n\\n#endif\\n\\n\\n\\nnamespace Tbc {\\n\\n\\n\\n#ifdef TBC_TEXT_FORMAT_CONSOLE_WIDTH\\n\\n const unsigned int consoleWidth = TBC_TEXT_FORMAT_CONSOLE_WIDTH;\\n\\n#else\\n\\n const unsigned int consoleWidth = 80;\\n\\n#endif\\n\\n\\n\\n struct TextAttributes {\\n\\n TextAttributes()\\n\\n : initialIndent( std::string::npos ),\\n\\n indent( 0 ),\\n\\n width( consoleWidth-1 ),\\n\\n tabChar( '\\\\t' )\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 90,\n \"score\": 55863.922923300284\n },\n {\n \"content\": \" errors.push_back( \\\"Expected argument to option: \\\" + token.data );\\n\\n else\\n\\n arg.boundField.set( config, tokens[++i].data );\\n\\n }\\n\\n else {\\n\\n arg.boundField.setFlag( config );\\n\\n }\\n\\n break;\\n\\n }\\n\\n }\\n\\n catch( std::exception& ex ) {\\n\\n errors.push_back( std::string( ex.what() ) + \\\"\\\\n- while parsing: (\\\" + arg.commands() + \\\")\\\" );\\n\\n }\\n\\n }\\n\\n if( it == itEnd ) {\\n\\n if( token.type == Parser::Token::Positional || !m_throwOnUnrecognisedTokens )\\n\\n unusedTokens.push_back( token );\\n\\n else if( errors.empty() && m_throwOnUnrecognisedTokens )\\n\\n errors.push_back( \\\"unrecognised option: \\\" + token.data );\\n\\n }\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 91,\n \"score\": 55863.77462281197\n },\n {\n \"content\": \" for( int i = 1; i <= m_highestSpecifiedArgPosition; ++i ) {\\n\\n if( i > 1 )\\n\\n os << \\\" \\\";\\n\\n typename std::map<int, Arg>::const_iterator it = m_positionalArgs.find( i );\\n\\n if( it != m_positionalArgs.end() )\\n\\n os << \\\"<\\\" << it->second.placeholder << \\\">\\\";\\n\\n else if( m_floatingArg.get() )\\n\\n os << \\\"<\\\" << m_floatingArg->placeholder << \\\">\\\";\\n\\n else\\n\\n throw std::logic_error( \\\"non consecutive positional arguments with no floating args\\\" );\\n\\n }\\n\\n // !TBD No indication of mandatory args\\n\\n if( m_floatingArg.get() ) {\\n\\n if( m_highestSpecifiedArgPosition > 1 )\\n\\n os << \\\" \\\";\\n\\n os << \\\"[<\\\" << m_floatingArg->placeholder << \\\"> ...]\\\";\\n\\n }\\n\\n }\\n\\n std::string argSynopsis() const {\\n\\n std::ostringstream oss;\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 92,\n \"score\": 55863.77462281197\n },\n {\n \"content\": \"\\n\\n bool isSet() const {\\n\\n return functionObj != NULL;\\n\\n }\\n\\n private:\\n\\n IArgFunction<ConfigT>* functionObj;\\n\\n };\\n\\n\\n\\n\\n\\n template<typename C>\\n\\n struct NullBinder : IArgFunction<C>{\\n\\n virtual void set( C&, std::string const& ) const {}\\n\\n virtual void setFlag( C& ) const {}\\n\\n virtual bool takesArg() const { return true; }\\n\\n virtual IArgFunction<C>* clone() const { return new NullBinder( *this ); }\\n\\n };\\n\\n\\n\\n template<typename C, typename M>\\n\\n struct BoundDataMember : IArgFunction<C>{\\n\\n BoundDataMember( M C::* _member ) : member( _member ) {}\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 93,\n \"score\": 55863.691195096726\n },\n {\n \"content\": \" m_options ( other.m_options ),\\n\\n m_positionalArgs( other.m_positionalArgs ),\\n\\n m_highestSpecifiedArgPosition( other.m_highestSpecifiedArgPosition ),\\n\\n m_throwOnUnrecognisedTokens( other.m_throwOnUnrecognisedTokens )\\n\\n {\\n\\n if( other.m_floatingArg.get() )\\n\\n m_floatingArg.reset( new Arg( *other.m_floatingArg ) );\\n\\n }\\n\\n\\n\\n CommandLine& setThrowOnUnrecognisedTokens( bool shouldThrow = true ) {\\n\\n m_throwOnUnrecognisedTokens = shouldThrow;\\n\\n return *this;\\n\\n }\\n\\n\\n\\n\\n\\n OptBuilder operator[]( std::string const& optName ) {\\n\\n m_options.push_back( Arg() );\\n\\n addOptName( m_options.back(), optName );\\n\\n OptBuilder builder( &m_options.back() );\\n\\n return builder;\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 94,\n \"score\": 55863.560500006104\n },\n {\n \"content\": \" {}\\n\\n\\n\\n TextAttributes& setInitialIndent( std::size_t _value ) { initialIndent = _value; return *this; }\\n\\n TextAttributes& setIndent( std::size_t _value ) { indent = _value; return *this; }\\n\\n TextAttributes& setWidth( std::size_t _value ) { width = _value; return *this; }\\n\\n TextAttributes& setTabChar( char _value ) { tabChar = _value; return *this; }\\n\\n\\n\\n std::size_t initialIndent; // indent of first line, or npos\\n\\n std::size_t indent; // indent of subsequent lines, or all if initialIndent is npos\\n\\n std::size_t width; // maximum width of text, including indent. Longer text will wrap\\n\\n char tabChar; // If this char is seen the indent is changed to current pos\\n\\n };\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 95,\n \"score\": 55863.3038058\n },\n {\n \"content\": \" std::string sourceLC = _source;\\n\\n std::transform( sourceLC.begin(), sourceLC.end(), sourceLC.begin(), ::tolower );\\n\\n if( sourceLC == \\\"y\\\" || sourceLC == \\\"1\\\" || sourceLC == \\\"true\\\" || sourceLC == \\\"yes\\\" || sourceLC == \\\"on\\\" )\\n\\n _dest = true;\\n\\n else if( sourceLC == \\\"n\\\" || sourceLC == \\\"0\\\" || sourceLC == \\\"false\\\" || sourceLC == \\\"no\\\" || sourceLC == \\\"off\\\" )\\n\\n _dest = false;\\n\\n else\\n\\n throw std::runtime_error( \\\"Expected a boolean value but did not recognise:\\\\n '\\\" + _source + \\\"'\\\" );\\n\\n }\\n\\n inline void convertInto( bool _source, bool& _dest ) {\\n\\n _dest = _source;\\n\\n }\\n\\n template<typename T>\\n\\n inline void convertInto( bool, T& ) {\\n\\n throw std::runtime_error( \\\"Invalid conversion\\\" );\\n\\n }\\n\\n\\n\\n template<typename ConfigT>\\n\\n struct IArgFunction {\\n\\n virtual ~IArgFunction() {}\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 96,\n \"score\": 55863.22132760569\n },\n {\n \"content\": \"#else\\n\\n typedef std::auto_ptr<Arg> ArgAutoPtr;\\n\\n#endif\\n\\n\\n\\n friend void addOptName( Arg& arg, std::string const& optName )\\n\\n {\\n\\n if( optName.empty() )\\n\\n return;\\n\\n if( Detail::startsWith( optName, \\\"--\\\" ) ) {\\n\\n if( !arg.longName.empty() )\\n\\n throw std::logic_error( \\\"Only one long opt may be specified. '\\\"\\n\\n + arg.longName\\n\\n + \\\"' already specified, now attempting to add '\\\"\\n\\n + optName + \\\"'\\\" );\\n\\n arg.longName = optName.substr( 2 );\\n\\n }\\n\\n else if( Detail::startsWith( optName, \\\"-\\\" ) )\\n\\n arg.shortNames.push_back( optName.substr( 1 ) );\\n\\n else\\n\\n throw std::logic_error( \\\"option must begin with - or --. Option was: '\\\" + optName + \\\"'\\\" );\\n\\n }\\n\\n friend void setPositionalArg( Arg& arg, int position )\\n\\n {\\n\\n arg.position = position;\\n\\n }\\n\\n\\n\\n\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 97,\n \"score\": 55863.12302956673\n },\n {\n \"content\": \" template<typename C, typename M>\\n\\n void bindProcessName( M C::* field ) {\\n\\n m_boundProcessName = new Detail::BoundDataMember<C,M>( field );\\n\\n }\\n\\n template<typename C, typename M>\\n\\n void bindProcessName( void (C::*_unaryMethod)( M ) ) {\\n\\n m_boundProcessName = new Detail::BoundUnaryMethod<C,M>( _unaryMethod );\\n\\n }\\n\\n\\n\\n void optUsage( std::ostream& os, std::size_t indent = 0, std::size_t width = Detail::consoleWidth ) const {\\n\\n typename std::vector<Arg>::const_iterator itBegin = m_options.begin(), itEnd = m_options.end(), it;\\n\\n std::size_t maxWidth = 0;\\n\\n for( it = itBegin; it != itEnd; ++it )\\n\\n maxWidth = (std::max)( maxWidth, it->commands().size() );\\n\\n\\n\\n for( it = itBegin; it != itEnd; ++it ) {\\n\\n Detail::Text usage( it->commands(), Detail::TextAttributes()\\n\\n .setWidth( maxWidth+indent )\\n\\n .setIndent( indent ) );\\n\\n Detail::Text desc( it->description, Detail::TextAttributes()\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 98,\n \"score\": 55862.71791526197\n },\n {\n \"content\": \" if( first )\\n\\n first = false;\\n\\n else\\n\\n oss << \\\", \\\";\\n\\n oss << \\\"-\\\" << *it;\\n\\n }\\n\\n if( !longName.empty() ) {\\n\\n if( !first )\\n\\n oss << \\\", \\\";\\n\\n oss << \\\"--\\\" << longName;\\n\\n }\\n\\n if( !placeholder.empty() )\\n\\n oss << \\\" <\\\" << placeholder << \\\">\\\";\\n\\n return oss.str();\\n\\n }\\n\\n };\\n\\n\\n\\n // NOTE: std::auto_ptr is deprecated in c++11/c++0x\\n\\n#if defined(__cplusplus) && __cplusplus > 199711L\\n\\n typedef std::unique_ptr<Arg> ArgAutoPtr;\\n\",\n \"file_path\": \"dependencies/catch/include/external/clara.h\",\n \"rank\": 99,\n \"score\": 55860.209469045345\n }\n]","isConversational":false}}},{"rowIdx":294,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Samples/cuSolverDn_LinearSolver/cuSolverDn_LinearSolver.cpp"},"repo_name":{"kind":"string","value":"rob-opsi/cuda-samples"},"commit":{"kind":"string","value":"32943424ed7023f9168266d9fb7b76e8566fd054"},"file_code":{"kind":"string","value":"\n\n#include <assert.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <cuda_runtime.h>\n\n#include \"cublas_v2.h\"\n#include \"cusolverDn.h\"\n#include \"helper_cuda.h\"\n\n#include \"helper_cusolver.h\"\n\ntemplate <typename T_ELEM>\nint loadMMSparseMatrix(char *filename, char elem_type, bool csrFormat, int *m,\n int *n, int *nnz, T_ELEM **aVal, int **aRowInd,\n int **aColInd, int extendSymMatrix);\n\nvoid UsageDN(void) {\n printf(\"<options>\\n\");\n printf(\"-h : display this help\\n\");\n printf(\"-R=<name> : choose a linear solver\\n\");\n printf(\" chol (cholesky factorization), this is default\\n\");\n printf(\" qr (QR factorization)\\n\");\n printf(\" lu (LU factorization)\\n\");\n printf(\"-lda=<int> : leading dimension of A , m by default\\n\");\n printf(\"-file=<filename>: filename containing a matrix in MM format\\n\");\n printf(\"-device=<device_id> : <device_id> if want to run on specific GPU\\n\");\n\n exit(0);\n}\n\nint linearSolverCHOL(cusolverDnHandle_t handle, int n, const double *Acopy,\n int lda, const double *b, double *x) {\n int bufferSize = 0;\n int *info = NULL;\n double *buffer = NULL;\n double *A = NULL;\n int h_info = 0;\n double start, stop;\n double time_solve;\n cublasFillMode_t uplo = CUBLAS_FILL_MODE_LOWER;\n\n checkCudaErrors(cusolverDnDpotrf_bufferSize(handle, uplo, n, (double *)Acopy,\n lda, &bufferSize));\n\n checkCudaErrors(cudaMalloc(&info, sizeof(int)));\n checkCudaErrors(cudaMalloc(&buffer, sizeof(double) * bufferSize));\n checkCudaErrors(cudaMalloc(&A, sizeof(double) * lda * n));\n\n \n checkCudaErrors(\n cudaMemcpy(A, Acopy, sizeof(double) * lda * n, cudaMemcpyDeviceToDevice));\n checkCudaErrors(cudaMemset(info, 0, sizeof(int)));\n\n start = second();\n start = second();\n\n checkCudaErrors(\n cusolverDnDpotrf(handle, uplo, n, A, lda, buffer, bufferSize, info));\n\n checkCudaErrors(\n cudaMemcpy(&h_info, info, sizeof(int), cudaMemcpyDeviceToHost));\n\n if (0 != h_info) {\n fprintf(stderr, \"Error: Cholesky factorization failed\\n\");\n }\n\n checkCudaErrors(\n cudaMemcpy(x, b, sizeof(double) * n, cudaMemcpyDeviceToDevice));\n\n checkCudaErrors(cusolverDnDpotrs(handle, uplo, n, 1, A, lda, x, n, info));\n\n checkCudaErrors(cudaDeviceSynchronize());\n stop = second();\n\n time_solve = stop - start;\n fprintf(stdout, \"timing: cholesky = %10.6f sec\\n\", time_solve);\n\n if (info) {\n checkCudaErrors(cudaFree(info));\n }\n if (buffer) {\n checkCudaErrors(cudaFree(buffer));\n }\n if (A) {\n checkCudaErrors(cudaFree(A));\n }\n\n return 0;\n}\n\nint linearSolverLU(cusolverDnHandle_t handle, int n, const double *Acopy,\n int lda, const double *b, double *x) {\n int bufferSize = 0;\n int *info = NULL;\n double *buffer = NULL;\n double *A = NULL;\n int *ipiv = NULL; \n int h_info = 0;\n double start, stop;\n double time_solve;\n\n checkCudaErrors(cusolverDnDgetrf_bufferSize(handle, n, n, (double *)Acopy,\n lda, &bufferSize));\n\n checkCudaErrors(cudaMalloc(&info, sizeof(int)));\n checkCudaErrors(cudaMalloc(&buffer, sizeof(double) * bufferSize));\n checkCudaErrors(cudaMalloc(&A, sizeof(double) * lda * n));\n checkCudaErrors(cudaMalloc(&ipiv, sizeof(int) * n));\n\n \n checkCudaErrors(\n cudaMemcpy(A, Acopy, sizeof(double) * lda * n, cudaMemcpyDeviceToDevice));\n checkCudaErrors(cudaMemset(info, 0, sizeof(int)));\n\n start = second();\n start = second();\n\n checkCudaErrors(cusolverDnDgetrf(handle, n, n, A, lda, buffer, ipiv, info));\n checkCudaErrors(\n cudaMemcpy(&h_info, info, sizeof(int), cudaMemcpyDeviceToHost));\n\n if (0 != h_info) {\n fprintf(stderr, \"Error: LU factorization failed\\n\");\n }\n\n checkCudaErrors(\n cudaMemcpy(x, b, sizeof(double) * n, cudaMemcpyDeviceToDevice));\n checkCudaErrors(\n cusolverDnDgetrs(handle, CUBLAS_OP_N, n, 1, A, lda, ipiv, x, n, info));\n checkCudaErrors(cudaDeviceSynchronize());\n stop = second();\n\n time_solve = stop - start;\n fprintf(stdout, \"timing: LU = %10.6f sec\\n\", time_solve);\n\n if (info) {\n checkCudaErrors(cudaFree(info));\n }\n if (buffer) {\n checkCudaErrors(cudaFree(buffer));\n }\n if (A) {\n checkCudaErrors(cudaFree(A));\n }\n if (ipiv) {\n checkCudaErrors(cudaFree(ipiv));\n }\n\n return 0;\n}\n\nint linearSolverQR(cusolverDnHandle_t handle, int n, const double *Acopy,\n int lda, const double *b, double *x) {\n cublasHandle_t cublasHandle = NULL; \n int bufferSize = 0;\n int bufferSize_geqrf = 0;\n int bufferSize_ormqr = 0;\n int *info = NULL;\n double *buffer = NULL;\n double *A = NULL;\n double *tau = NULL;\n int h_info = 0;\n double start, stop;\n double time_solve;\n const double one = 1.0;\n\n checkCudaErrors(cublasCreate(&cublasHandle));\n\n checkCudaErrors(cusolverDnDgeqrf_bufferSize(handle, n, n, (double *)Acopy,\n lda, &bufferSize_geqrf));\n checkCudaErrors(cusolverDnDormqr_bufferSize(handle, CUBLAS_SIDE_LEFT,\n CUBLAS_OP_T, n, 1, n, A, lda,\n NULL, x, n, &bufferSize_ormqr));\n\n printf(\"buffer_geqrf = %d, buffer_ormqr = %d \\n\", bufferSize_geqrf,\n bufferSize_ormqr);\n\n bufferSize = (bufferSize_geqrf > bufferSize_ormqr) ? bufferSize_geqrf\n : bufferSize_ormqr;\n\n checkCudaErrors(cudaMalloc(&info, sizeof(int)));\n checkCudaErrors(cudaMalloc(&buffer, sizeof(double) * bufferSize));\n checkCudaErrors(cudaMalloc(&A, sizeof(double) * lda * n));\n checkCudaErrors(cudaMalloc((void **)&tau, sizeof(double) * n));\n\n \n checkCudaErrors(\n cudaMemcpy(A, Acopy, sizeof(double) * lda * n, cudaMemcpyDeviceToDevice));\n\n checkCudaErrors(cudaMemset(info, 0, sizeof(int)));\n\n start = second();\n start = second();\n\n \n checkCudaErrors(\n cusolverDnDgeqrf(handle, n, n, A, lda, tau, buffer, bufferSize, info));\n\n checkCudaErrors(\n cudaMemcpy(&h_info, info, sizeof(int), cudaMemcpyDeviceToHost));\n\n if (0 != h_info) {\n fprintf(stderr, \"Error: LU factorization failed\\n\");\n }\n\n checkCudaErrors(\n cudaMemcpy(x, b, sizeof(double) * n, cudaMemcpyDeviceToDevice));\n\n \n checkCudaErrors(cusolverDnDormqr(handle, CUBLAS_SIDE_LEFT, CUBLAS_OP_T, n, 1,\n n, A, lda, tau, x, n, buffer, bufferSize,\n info));\n\n \n checkCudaErrors(cublasDtrsm(cublasHandle, CUBLAS_SIDE_LEFT,\n CUBLAS_FILL_MODE_UPPER, CUBLAS_OP_N,\n CUBLAS_DIAG_NON_UNIT, n, 1, &one, A, lda, x, n));\n checkCudaErrors(cudaDeviceSynchronize());\n stop = second();\n\n time_solve = stop - start;\n fprintf(stdout, \"timing: QR = %10.6f sec\\n\", time_solve);\n\n if (cublasHandle) {\n checkCudaErrors(cublasDestroy(cublasHandle));\n }\n if (info) {\n checkCudaErrors(cudaFree(info));\n }\n if (buffer) {\n checkCudaErrors(cudaFree(buffer));\n }\n if (A) {\n checkCudaErrors(cudaFree(A));\n }\n if (tau) {\n checkCudaErrors(cudaFree(tau));\n }\n\n return 0;\n}\n\nvoid parseCommandLineArguments(int argc, char *argv[], struct testOpts &opts) {\n memset(&opts, 0, sizeof(opts));\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"-h\")) {\n UsageDN();\n }\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"R\")) {\n char *solverType = NULL;\n getCmdLineArgumentString(argc, (const char **)argv, \"R\", &solverType);\n\n if (solverType) {\n if ((STRCASECMP(solverType, \"chol\") != 0) &&\n (STRCASECMP(solverType, \"lu\") != 0) &&\n (STRCASECMP(solverType, \"qr\") != 0)) {\n printf(\"\\nIncorrect argument passed to -R option\\n\");\n UsageDN();\n } else {\n opts.testFunc = solverType;\n }\n }\n }\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"file\")) {\n char *fileName = 0;\n getCmdLineArgumentString(argc, (const char **)argv, \"file\", &fileName);\n\n if (fileName) {\n opts.sparse_mat_filename = fileName;\n } else {\n printf(\"\\nIncorrect filename passed to -file \\n \");\n UsageDN();\n }\n }\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"lda\")) {\n opts.lda = getCmdLineArgumentInt(argc, (const char **)argv, \"lda\");\n }\n}\n\nint main(int argc, char *argv[]) {\n struct testOpts opts;\n cusolverDnHandle_t handle = NULL;\n cublasHandle_t cublasHandle = NULL; \n cudaStream_t stream = NULL;\n\n int rowsA = 0; \n int colsA = 0; \n int nnzA = 0; \n int baseA = 0; \n int lda = 0; \n\n \n int *h_csrRowPtrA = NULL;\n int *h_csrColIndA = NULL;\n double *h_csrValA = NULL;\n\n double *h_A = NULL; \n double *h_x = NULL; \n double *h_b = NULL; \n double *h_r = NULL; \n\n double *d_A = NULL; \n double *d_x = NULL; \n double *d_b = NULL; \n double *d_r = NULL; \n\n \n const double minus_one = -1.0;\n const double one = 1.0;\n\n double x_inf = 0.0;\n double r_inf = 0.0;\n double A_inf = 0.0;\n int errors = 0;\n\n parseCommandLineArguments(argc, argv, opts);\n\n if (NULL == opts.testFunc) {\n opts.testFunc = \"chol\"; \n \n }\n\n findCudaDevice(argc, (const char **)argv);\n\n printf(\"step 1: read matrix market format\\n\");\n\n if (opts.sparse_mat_filename == NULL) {\n opts.sparse_mat_filename = sdkFindFilePath(\"gr_900_900_crg.mtx\", argv[0]);\n if (opts.sparse_mat_filename != NULL)\n printf(\"Using default input file [%s]\\n\", opts.sparse_mat_filename);\n else\n printf(\"Could not find gr_900_900_crg.mtx\\n\");\n } else {\n printf(\"Using input file [%s]\\n\", opts.sparse_mat_filename);\n }\n\n if (opts.sparse_mat_filename == NULL) {\n fprintf(stderr, \"Error: input matrix is not provided\\n\");\n return EXIT_FAILURE;\n }\n\n if (loadMMSparseMatrix<double>(opts.sparse_mat_filename, 'd', true, &rowsA,\n &colsA, &nnzA, &h_csrValA, &h_csrRowPtrA,\n &h_csrColIndA, true)) {\n exit(EXIT_FAILURE);\n }\n baseA = h_csrRowPtrA[0]; \n\n printf(\"sparse matrix A is %d x %d with %d nonzeros, base=%d\\n\", rowsA, colsA,\n nnzA, baseA);\n\n if (rowsA != colsA) {\n fprintf(stderr, \"Error: only support square matrix\\n\");\n exit(EXIT_FAILURE);\n }\n\n printf(\"step 2: convert CSR(A) to dense matrix\\n\");\n\n lda = opts.lda ? opts.lda : rowsA;\n if (lda < rowsA) {\n fprintf(stderr, \"Error: lda must be greater or equal to dimension of A\\n\");\n exit(EXIT_FAILURE);\n }\n\n h_A = (double *)malloc(sizeof(double) * lda * colsA);\n h_x = (double *)malloc(sizeof(double) * colsA);\n h_b = (double *)malloc(sizeof(double) * rowsA);\n h_r = (double *)malloc(sizeof(double) * rowsA);\n assert(NULL != h_A);\n assert(NULL != h_x);\n assert(NULL != h_b);\n assert(NULL != h_r);\n\n memset(h_A, 0, sizeof(double) * lda * colsA);\n\n for (int row = 0; row < rowsA; row++) {\n const int start = h_csrRowPtrA[row] - baseA;\n const int end = h_csrRowPtrA[row + 1] - baseA;\n for (int colidx = start; colidx < end; colidx++) {\n const int col = h_csrColIndA[colidx] - baseA;\n const double Areg = h_csrValA[colidx];\n h_A[row + col * lda] = Areg;\n }\n }\n\n printf(\"step 3: set right hand side vector (b) to 1\\n\");\n for (int row = 0; row < rowsA; row++) {\n h_b[row] = 1.0;\n }\n\n \n if (0 == strcmp(opts.testFunc, \"chol\")) {\n int issym = 1;\n for (int j = 0; j < colsA; j++) {\n for (int i = j; i < rowsA; i++) {\n double Aij = h_A[i + j * lda];\n double Aji = h_A[j + i * lda];\n if (Aij != Aji) {\n issym = 0;\n break;\n }\n }\n }\n if (!issym) {\n printf(\"Error: A has no symmetric pattern, please use LU or QR \\n\");\n exit(EXIT_FAILURE);\n }\n }\n\n checkCudaErrors(cusolverDnCreate(&handle));\n checkCudaErrors(cublasCreate(&cublasHandle));\n checkCudaErrors(cudaStreamCreate(&stream));\n\n checkCudaErrors(cusolverDnSetStream(handle, stream));\n checkCudaErrors(cublasSetStream(cublasHandle, stream));\n\n checkCudaErrors(cudaMalloc((void **)&d_A, sizeof(double) * lda * colsA));\n checkCudaErrors(cudaMalloc((void **)&d_x, sizeof(double) * colsA));\n checkCudaErrors(cudaMalloc((void **)&d_b, sizeof(double) * rowsA));\n checkCudaErrors(cudaMalloc((void **)&d_r, sizeof(double) * rowsA));\n\n printf(\"step 4: prepare data on device\\n\");\n checkCudaErrors(cudaMemcpy(d_A, h_A, sizeof(double) * lda * colsA,\n cudaMemcpyHostToDevice));\n checkCudaErrors(\n cudaMemcpy(d_b, h_b, sizeof(double) * rowsA, cudaMemcpyHostToDevice));\n\n printf(\"step 5: solve A*x = b \\n\");\n \n if (0 == strcmp(opts.testFunc, \"chol\")) {\n linearSolverCHOL(handle, rowsA, d_A, lda, d_b, d_x);\n } else if (0 == strcmp(opts.testFunc, \"lu\")) {\n linearSolverLU(handle, rowsA, d_A, lda, d_b, d_x);\n } else if (0 == strcmp(opts.testFunc, \"qr\")) {\n linearSolverQR(handle, rowsA, d_A, lda, d_b, d_x);\n } else {\n fprintf(stderr, \"Error: %s is unknown function\\n\", opts.testFunc);\n exit(EXIT_FAILURE);\n }\n printf(\"step 6: evaluate residual\\n\");\n checkCudaErrors(\n cudaMemcpy(d_r, d_b, sizeof(double) * rowsA, cudaMemcpyDeviceToDevice));\n\n \n checkCudaErrors(cublasDgemm_v2(cublasHandle, CUBLAS_OP_N, CUBLAS_OP_N, rowsA,\n 1, colsA, &minus_one, d_A, lda, d_x, rowsA,\n &one, d_r, rowsA));\n\n checkCudaErrors(\n cudaMemcpy(h_x, d_x, sizeof(double) * colsA, cudaMemcpyDeviceToHost));\n checkCudaErrors(\n cudaMemcpy(h_r, d_r, sizeof(double) * rowsA, cudaMemcpyDeviceToHost));\n\n x_inf = vec_norminf(colsA, h_x);\n r_inf = vec_norminf(rowsA, h_r);\n A_inf = mat_norminf(rowsA, colsA, h_A, lda);\n\n printf(\"|b - A*x| = %E \\n\", r_inf);\n printf(\"|A| = %E \\n\", A_inf);\n printf(\"|x| = %E \\n\", x_inf);\n printf(\"|b - A*x|/(|A|*|x|) = %E \\n\", r_inf / (A_inf * x_inf));\n\n if (handle) {\n checkCudaErrors(cusolverDnDestroy(handle));\n }\n if (cublasHandle) {\n checkCudaErrors(cublasDestroy(cublasHandle));\n }\n if (stream) {\n checkCudaErrors(cudaStreamDestroy(stream));\n }\n\n if (h_csrValA) {\n free(h_csrValA);\n }\n if (h_csrRowPtrA) {\n free(h_csrRowPtrA);\n }\n if (h_csrColIndA) {\n free(h_csrColIndA);\n }\n\n if (h_A) {\n free(h_A);\n }\n if (h_x) {\n free(h_x);\n }\n if (h_b) {\n free(h_b);\n }\n if (h_r) {\n free(h_r);\n }\n\n if (d_A) {\n checkCudaErrors(cudaFree(d_A));\n }\n if (d_x) {\n checkCudaErrors(cudaFree(d_x));\n }\n if (d_b) {\n checkCudaErrors(cudaFree(d_b));\n }\n if (d_r) {\n checkCudaErrors(cudaFree(d_r));\n }\n\n return 0;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <assert.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <cuda_runtime.h>\n\n#include \"cublas_v2.h\"\n#include \"cusolverDn.h\"\n#include \"helper_cuda.h\"\n\n#include \"helper_cusolver.h\"\n\ntemplate <typename T_ELEM>\nint loadMMSparseMatrix(char *filename, char elem_type, bool csrFormat, int *m,\n int *n, int *nnz, T_ELEM **aVal, int **aRowInd,\n int **aColInd, int extendSymMatrix);\n\nvoid UsageDN(void) {\n printf(\"<options>\\n\");\n printf(\"-h : display this help\\n\");\n printf(\"-R=<name> : choose a linear solver\\n\");\n printf(\" chol (cholesky factorization), this is default\\n\");\n printf(\" qr (QR factorization)\\n\");\n printf(\" lu (LU factorization)\\n\");\n printf(\"-lda=<int> : leading dimension of A , m by default\\n\");\n printf(\"-file=<filename>: filename containing a matrix in MM format\\n\");\n printf(\"-device=<device_id> : <device_id> if want to run on specific GPU\\n\");\n\n exit(0);\n}\n\nint linearSolverCHOL(cusolverDnHandle_t handle, int n, const double *Acopy,\n int lda, const double *b, double *x) {\n int bufferSize = 0;\n int *info = NULL;\n double *buffer = NULL;\n double *A = NULL;\n int h_info = 0;\n double start, stop;\n double time_solve;\n cublasFillMode_t uplo = CUBLAS_FILL_MODE_LOWER;\n\n checkCudaErrors(cusolverDnDpotrf_bufferSize(handle, uplo, n, (double *)Acopy,\n lda, &bufferSize));\n\n checkCudaErrors(cudaMalloc(&info, sizeof(int)));\n checkCudaErrors(cudaMalloc(&buffer, sizeof(double) * bufferSize));\n checkCudaErrors(cudaMalloc(&A, sizeof(double) * lda * n));\n\n \n checkCudaErrors(\n cudaMemcpy(A, Acopy, sizeof(double) * lda * n, cudaMemcpyDeviceToDevice));\n checkCudaErrors(cudaMemset(info, 0, sizeof(int)));\n\n start = second();\n start = second();\n\n checkCudaErrors(\n cusolverDnDpotrf(handle, uplo, n, A, lda, buffer, bufferSize, info));\n\n checkCudaErrors(\n cudaMemcpy(&h_info, info, sizeof(int), cudaMemcpyDeviceToHost));\n\n if (0 != h_info) {\n fprintf(stderr, \"Error: Cholesky factorization failed\\n\");\n }\n\n checkCudaErrors(\n cudaMemcpy(x, b, sizeof(double) * n, cudaMemcpyDeviceToDevice));\n\n checkCudaErrors(cusolverDnDpotrs(handle, uplo, n, 1, A, lda, x, n, info));\n\n checkCudaErrors(cudaDeviceSynchronize());\n stop = second();\n\n time_solve = stop - start;\n fprintf(stdout, \"timing: cholesky = %10.6f sec\\n\", time_solve);\n\n if (info) {\n checkCudaErrors(cudaFree(info));\n }\n if (buffer) {\n checkCudaErrors(cudaFree(buffer));\n }\n if (A) {\n checkCudaErrors(cudaFree(A));\n }\n\n return 0;\n}\n\nint linearSolverLU(cusolverDnHandle_t handle, int n, const double *Acopy,\n int lda, const double *b, double *x) {\n int bufferSize = 0;\n int *info = NULL;\n double *buffer = NULL;\n double *A = NULL;\n int *ipiv = NULL; \n int h_info = 0;\n double start, stop;\n double time_solve;\n\n checkCudaErrors(cusolverDnDgetrf_bufferSize(handle, n, n, (double *)Acopy,\n lda, &bufferSize));\n\n checkCudaErrors(cudaMalloc(&info, sizeof(int)));\n checkCudaErrors(cudaMalloc(&buffer, sizeof(double) * bufferSize));\n checkCudaErrors(cudaMalloc(&A, sizeof(double) * lda * n));\n checkCudaErrors(cudaMalloc(&ipiv, sizeof(int) * n));\n\n \n checkCudaErrors(\n cudaMemcpy(A, Acopy, sizeof(double) * lda * n, cudaMemcpyDeviceToDevice));\n checkCudaErrors(cudaMemset(info, 0, sizeof(int)));\n\n start = second();\n start = second();\n\n checkCudaErrors(cusolverDnDgetrf(handle, n, n, A, lda, buffer, ipiv, info));\n checkCudaErrors(\n cudaMemcpy(&h_info, info, sizeof(int), cudaMemcpyDeviceToHost));\n\n if (0 != h_info) {\n fprintf(stderr, \"Error: LU factorization failed\\n\");\n }\n\n checkCudaErrors(\n cudaMemcpy(x, b, sizeof(double) * n, cudaMemcpyDeviceToDevice));\n checkCudaErrors(\n cusolverDnDgetrs(handle, CUBLAS_OP_N, n, 1, A, lda, ipiv, x, n, info));\n checkCudaErrors(cudaDeviceSynchronize());\n stop = second();\n\n time_solve = stop - start;\n fprintf(stdout, \"timing: LU = %10.6f sec\\n\", time_solve);\n\n if (info) {\n checkCudaErrors(cudaFree(info));\n }\n if (buffer) {\n checkCudaErrors(cudaFree(buffer));\n }\n if (A) {\n checkCudaErrors(cudaFree(A));\n }\n if (ipiv) {\n checkCudaErrors(cudaFree(ipiv));\n }\n\n return 0;\n}\n\nint linearSolverQR(cusolverDnHandle_t handle, int n, const double *Acopy,\n int lda, const double *b, double *x) {\n cublasHandle_t cublasHandle = NULL; \n int bufferSize = 0;\n int bufferSize_geqrf = 0;\n int bufferSize_ormqr = 0;\n int *info = NULL;\n double *buffer = NULL;\n double *A = NULL;\n double *tau = NULL;\n int h_info = 0;\n double start, stop;\n double time_solve;\n const double one = 1.0;\n\n checkCudaErrors(cublasCreate(&cublasHandle));\n\n checkCudaErrors(cusolverDnDgeqrf_bufferSize(handle, n, n, (double *)Acopy,\n lda, &bufferSize_geqrf));\n checkCudaErrors(cusolverDnDormqr_bufferSize(handle, CUBLAS_SIDE_LEFT,\n CUBLAS_OP_T, n, 1, n, A, lda,\n NULL, x, n, &bufferSize_ormqr));\n\n printf(\"buffer_geqrf = %d, buffer_ormqr = %d \\n\", bufferSize_geqrf,\n bufferSize_ormqr);\n\n bufferSize = (bufferSize_geqrf > bufferSize_ormqr) ? bufferSize_geqrf\n : bufferSize_ormqr;\n\n checkCudaErrors(cudaMalloc(&info, sizeof(int)));\n checkCudaErrors(cudaMalloc(&buffer, sizeof(double) * bufferSize));\n checkCudaErrors(cudaMalloc(&A, sizeof(double) * lda * n));\n checkCudaErrors(cudaMalloc((void **)&tau, sizeof(double) * n));\n\n \n checkCudaErrors(\n cudaMemcpy(A, Acopy, sizeof(double) * lda * n, cudaMemcpyDeviceToDevice));\n\n checkCudaErrors(cudaMemset(info, 0, sizeof(int)));\n\n start = second();\n start = second();\n\n \n checkCudaErrors(\n cusolverDnDgeqrf(handle, n, n, A, lda, tau, buffer, bufferSize, info));\n\n checkCudaErrors(\n cudaMemcpy(&h_info, info, sizeof(int), cudaMemcpyDeviceToHost));\n\n if (0 != h_info) {\n fprintf(stderr, \"Error: LU factorization failed\\n\");\n }\n\n checkCudaErrors(\n cudaMemcpy(x, b, sizeof(double) * n, cudaMemcpyDeviceToDevice));\n\n \n checkCudaErrors(cusolverDnDormqr(handle, CUBLAS_SIDE_LEFT, CUBLAS_OP_T, n, 1,\n n, A, lda, tau, x, n, buffer, bufferSize,\n info));\n\n \n checkCudaErrors(cublasDtrsm(cublasHandle, CUBLAS_SIDE_LEFT,\n CUBLAS_FILL_MODE_UPPER, CUBLAS_OP_N,\n CUBLAS_DIAG_NON_UNIT, n, 1, &one, A, lda, x, n));\n checkCudaErrors(cudaDeviceSynchronize());\n stop = second();\n\n time_solve = stop - start;\n fprintf(stdout, \"timing: QR = %10.6f sec\\n\", time_solve);\n\n if (cublasHandle) {\n checkCudaErrors(cublasDestroy(cublasHandle));\n }\n if (info) {\n checkCudaErrors(cudaFree(info));\n }\n if (buffer) {\n checkCudaErrors(cudaFree(buffer));\n }\n if (A) {\n checkCudaErrors(cudaFree(A));\n }\n if (tau) {\n checkCudaErrors(cudaFree(tau));\n }\n\n return 0;\n}\n\nvoid parseCommandLineArguments(int argc, char *argv[], struct testOpts &opts) {\n memset(&opts, 0, sizeof(opts));\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"-h\")) {\n UsageDN();\n }\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"R\")) {\n char *solverType = NULL;\n getCmdLineArgumentString(argc, (const char **)argv, \"R\", &solverType);\n\n if (solverType) {\n if ((STRCASECMP(solverType, \"chol\") != 0) &&\n (STRCASECMP(solverType, \"lu\") != 0) &&\n (STRCASECMP(solverType, \"qr\") != 0)) {\n printf(\"\\nIncorrect argument passed to -R option\\n\");\n UsageDN();\n } else {\n opts.testFunc = solverType;\n }\n }\n }\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"file\")) {\n char *fileName = 0;\n getCmdLineArgumentString(argc, (const char **)argv, \"file\", &fileName);\n\n if (fileName) {\n opts.sparse_mat_filename = fileName;\n } else {\n printf(\"\\nIncorrect filename passed to -file \\n \");\n UsageDN();\n }\n }\n\n if (checkCmdLineFlag(argc, (const char **)argv, \"lda\")) {\n opts.lda = getCmdLineArgumentInt(argc, (const char **)argv, \"lda\");\n }\n}\n\n"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"int main(int argc, char *argv[]) {\n struct testOpts opts;\n cusolverDnHandle_t handle = NULL;\n cublasHandle_t cublasHandle = NULL; \n cudaStream_t stream = NULL;\n\n int rowsA = 0; \n int colsA = 0; \n int nnzA = 0; \n int baseA = 0; \n int lda = 0; \n\n \n int *h_csrRowPtrA = NULL;\n int *h_csrColIndA = NULL;\n double *h_csrValA = NULL;\n\n double *h_A = NULL; \n double *h_x = NULL; \n double *h_b = NULL; \n double *h_r = NULL; \n\n double *d_A = NULL; \n double *d_x = NULL; \n double *d_b = NULL; \n double *d_r = NULL; \n\n \n const double minus_one = -1.0;\n const double one = 1.0;\n\n double x_inf = 0.0;\n double r_inf = 0.0;\n double A_inf = 0.0;\n int errors = 0;\n\n parseCommandLineArguments(argc, argv, opts);\n\n if (NULL == opts.testFunc) {\n opts.testFunc = \"chol\"; \n \n }\n\n findCudaDevice(argc, (const char **)argv);\n\n printf(\"step 1: read matrix market format\\n\");\n\n if (opts.sparse_mat_filename == NULL) {\n opts.sparse_mat_filename = sdkFindFilePath(\"gr_900_900_crg.mtx\", argv[0]);\n if (opts.sparse_mat_filename != NULL)\n printf(\"Using default input file [%s]\\n\", opts.sparse_mat_filename);\n else\n printf(\"Could not find gr_900_900_crg.mtx\\n\");\n } else {\n printf(\"Using input file [%s]\\n\", opts.sparse_mat_filename);\n }\n\n if (opts.sparse_mat_filename == NULL) {\n fprintf(stderr, \"Error: input matrix is not provided\\n\");\n return EXIT_FAILURE;\n }\n\n if (loadMMSparseMatrix<double>(opts.sparse_mat_filename, 'd', true, &rowsA,\n &colsA, &nnzA, &h_csrValA, &h_csrRowPtrA,\n &h_csrColIndA, true)) {\n exit(EXIT_FAILURE);\n }\n baseA = h_csrRowPtrA[0]; \n\n printf(\"sparse matrix A is %d x %d with %d nonzeros, base=%d\\n\", rowsA, colsA,\n nnzA, baseA);\n\n if (rowsA != colsA) {\n fprintf(stderr, \"Error: only support square matrix\\n\");\n exit(EXIT_FAILURE);\n }\n\n printf(\"step 2: convert CSR(A) to dense matrix\\n\");\n\n lda = opts.lda ? opts.lda : rowsA;\n if (lda < rowsA) {\n fprintf(stderr, \"Error: lda must be greater or equal to dimension of A\\n\");\n exit(EXIT_FAILURE);\n }\n\n h_A = (double *)malloc(sizeof(double) * lda * colsA);\n h_x = (double *)malloc(sizeof(double) * colsA);\n h_b = (double *)malloc(sizeof(double) * rowsA);\n h_r = (double *)malloc(sizeof(double) * rowsA);\n assert(NULL != h_A);\n assert(NULL != h_x);\n assert(NULL != h_b);\n assert(NULL != h_r);\n\n memset(h_A, 0, sizeof(double) * lda * colsA);\n\n for (int row = 0; row < rowsA; row++) {\n const int start = h_csrRowPtrA[row] - baseA;\n const int end = h_csrRowPtrA[row + 1] - baseA;\n for (int colidx = start; colidx < end; colidx++) {\n const int col = h_csrColIndA[colidx] - baseA;\n const double Areg = h_csrValA[colidx];\n h_A[row + col * lda] = Areg;\n }\n }\n\n printf(\"step 3: set right hand side vector (b) to 1\\n\");\n for (int row = 0; row < rowsA; row++) {\n h_b[row] = 1.0;\n }\n\n \n if (0 == strcmp(opts.testFunc, \"chol\")) {\n int issym = 1;\n for (int j = 0; j < colsA; j++) {\n for (int i = j; i < rowsA; i++) {\n double Aij = h_A[i + j * lda];\n double Aji = h_A[j + i * lda];\n if (Aij != Aji) {\n issym = 0;\n break;\n }\n }\n }\n if (!issym) {\n printf(\"Error: A has no symmetric pattern, please use LU or QR \\n\");\n exit(EXIT_FAILURE);\n }\n }\n\n checkCudaErrors(cusolverDnCreate(&handle));\n checkCudaErrors(cublasCreate(&cublasHandle));\n checkCudaErrors(cudaStreamCreate(&stream));\n\n checkCudaErrors(cusolverDnSetStream(handle, stream));\n checkCudaErrors(cublasSetStream(cublasHandle, stream));\n\n checkCudaErrors(cudaMalloc((void **)&d_A, sizeof(double) * lda * colsA));\n checkCudaErrors(cudaMalloc((void **)&d_x, sizeof(double) * colsA));\n checkCudaErrors(cudaMalloc((void **)&d_b, sizeof(double) * rowsA));\n checkCudaErrors(cudaMalloc((void **)&d_r, sizeof(double) * rowsA));\n\n printf(\"step 4: prepare data on device\\n\");\n checkCudaErrors(cudaMemcpy(d_A, h_A, sizeof(double) * lda * colsA,\n cudaMemcpyHostToDevice));\n checkCudaErrors(\n cudaMemcpy(d_b, h_b, sizeof(double) * rowsA, cudaMemcpyHostToDevice));\n\n printf(\"step 5: solve A*x = b \\n\");\n \n if (0 == strcmp(opts.testFunc, \"chol\")) {\n linearSolverCHOL(handle, rowsA, d_A, lda, d_b, d_x);\n } else if (0 == strcmp(opts.testFunc, \"lu\")) {\n linearSolverLU(handle, rowsA, d_A, lda, d_b, d_x);\n } else if (0 == strcmp(opts.testFunc, \"qr\")) {\n linearSolverQR(handle, rowsA, d_A, lda, d_b, d_x);\n } else {\n fprintf(stderr, \"Error: %s is unknown function\\n\", opts.testFunc);\n exit(EXIT_FAILURE);\n }\n printf(\"step 6: evaluate residual\\n\");\n checkCudaErrors(\n cudaMemcpy(d_r, d_b, sizeof(double) * rowsA, cudaMemcpyDeviceToDevice));\n\n \n checkCudaErrors(cublasDgemm_v2(cublasHandle, CUBLAS_OP_N, CUBLAS_OP_N, rowsA,\n 1, colsA, &minus_one, d_A, lda, d_x, rowsA,\n &one, d_r, rowsA));\n\n checkCudaErrors(\n cudaMemcpy(h_x, d_x, sizeof(double) * colsA, cudaMemcpyDeviceToHost));\n checkCudaErrors(\n cudaMemcpy(h_r, d_r, sizeof(double) * rowsA, cudaMemcpyDeviceToHost));\n\n x_inf = vec_norminf(colsA, h_x);\n r_inf = vec_norminf(rowsA, h_r);\n A_inf = mat_norminf(rowsA, colsA, h_A, lda);\n\n printf(\"|b - A*x| = %E \\n\", r_inf);\n printf(\"|A| = %E \\n\", A_inf);\n printf(\"|x| = %E \\n\", x_inf);\n printf(\"|b - A*x|/(|A|*|x|) = %E \\n\", r_inf / (A_inf * x_inf));\n\n if (handle) {\n checkCudaErrors(cusolverDnDestroy(handle));\n }\n if (cublasHandle) {\n checkCudaErrors(cublasDestroy(cublasHandle));\n }\n if (stream) {\n checkCudaErrors(cudaStreamDestroy(stream));\n }\n\n if (h_csrValA) {\n free(h_csrValA);\n }\n if (h_csrRowPtrA) {\n free(h_csrRowPtrA);\n }\n if (h_csrColIndA) {\n free(h_csrColIndA);\n }\n\n if (h_A) {\n free(h_A);\n }\n if (h_x) {\n free(h_x);\n }\n if (h_b) {\n free(h_b);\n }\n if (h_r) {\n free(h_r);\n }\n\n if (d_A) {\n checkCudaErrors(cudaFree(d_A));\n }\n if (d_x) {\n checkCudaErrors(cudaFree(d_x));\n }\n if (d_b) {\n checkCudaErrors(cudaFree(d_b));\n }\n if (d_r) {\n checkCudaErrors(cudaFree(d_r));\n }\n\n return 0;\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"// structure defining the properties of a single buffer\n\nstruct bufferConfig {\n\n string name;\n\n GLenum format;\n\n int bits;\n\n};\n\n\n","file_path":"Common/rendercheck_gl.h","rank":0,"score":201948.48625693982},{"content":"class ArrayFileWriter<int> {\n\n public:\n\n bool write(const char *filename, int *data, unsigned int len, float epsilon) {\n\n return sdkWriteFile(filename, data, len, epsilon, false);\n\n }\n\n};\n\n\n\n// Here's the specialization for floats:\n\ntemplate <>\n","file_path":"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp","rank":1,"score":185017.40764760156},{"content":"struct ConstantBuffer {\n\n float vQuadRect[4];\n\n int UseCase;\n\n};\n\n\n\nID3D11VertexShader *g_pVertexShader;\n\nID3D11PixelShader *g_pPixelShader;\n\nID3D11Buffer *g_pConstantBuffer;\n\nID3D11SamplerState *g_pSamplerState;\n\n\n\n#endif\n\n// testing/tracing function used pervasively in tests. if the condition is\n\n// unsatisfied\n\n// then spew and fail the function immediately (doing no cleanup)\n\n#define AssertOrQuit(x) \\\n\n if (!(x)) { \\\n\n fprintf(stdout, \"Assert unsatisfied in %s at %s:%d\\n\", __FUNCTION__, \\\n\n __FILE__, __LINE__); \\\n\n return 1; \\\n\n }\n","file_path":"Samples/simpleD3D11Texture/simpleD3D11Texture.cpp","rank":2,"score":172519.0598137092},{"content":"class ArrayComparator<int> {\n\n public:\n\n bool compare(const int *reference, int *data, unsigned int len) {\n\n return compareData(reference, data, len, 0.15f, 0.0f);\n\n }\n\n};\n\n\n\n// Here's the specialization for floats:\n\ntemplate <>\n","file_path":"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp","rank":3,"score":138370.69183356277},{"content":"struct vec4<double> {\n\n typedef double4 Type;\n\n};\n\n\n","file_path":"Samples/nbody/bodysystem.h","rank":4,"score":138366.70264845793},{"content":"struct vec3<double> {\n\n typedef double3 Type;\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"Samples/nbody/bodysystem.h","rank":5,"score":138366.70264845793},{"content":"////////////////////////////////////////\n\n// Demo Parameters\n\n////////////////////////////////////////\n\nstruct NBodyParams {\n\n float m_timestep;\n\n float m_clusterScale;\n\n float m_velocityScale;\n\n float m_softening;\n\n float m_damping;\n\n float m_pointSize;\n\n float m_x, m_y, m_z;\n\n\n\n void print() {\n\n printf(\"{ %f, %f, %f, %f, %f, %f, %f, %f, %f },\\n\", m_timestep,\n\n m_clusterScale, m_velocityScale, m_softening, m_damping, m_pointSize,\n\n m_x, m_y, m_z);\n\n }\n\n};\n\n\n\nNBodyParams demoParams[] = {\n\n {0.016f, 1.54f, 8.0f, 0.1f, 1.0f, 1.0f, 0, -2, -100},\n\n {0.016f, 0.68f, 20.0f, 0.1f, 1.0f, 0.8f, 0, -2, -30},\n\n {0.0006f, 0.16f, 1000.0f, 1.0f, 1.0f, 0.07f, 0, 0, -1.5f},\n","file_path":"Samples/nbody/nbody.cpp","rank":6,"score":138052.20075445133},{"content":"// Main structure that gets initialized at library load time\n\n// Choose a unique name, or it can clash with other preloaded libraries.\n\nstruct cuHookInfo {\n\n void* handle;\n\n void* preHooks[CU_HOOK_SYMBOLS];\n\n void* postHooks[CU_HOOK_SYMBOLS];\n\n\n\n // Debugging/Stats Info\n\n int bDebugEnabled;\n\n int hookedFunctionCalls[CU_HOOK_SYMBOLS];\n\n\n\n cuHookInfo() {\n\n const char* envHookDebug;\n\n\n\n // Check environment for CU_HOOK_DEBUG to facilitate debugging\n\n envHookDebug = getenv(\"CU_HOOK_DEBUG\");\n\n if (envHookDebug && envHookDebug[0] == '1') {\n\n bDebugEnabled = 1;\n\n fprintf(stderr, \"* %6d >> CUDA HOOK Library loaded.\\n\", getpid());\n\n }\n\n }\n\n\n","file_path":"Samples/cuHook/libcuhook.cpp","rank":7,"score":135132.02661432605},{"content":"struct gemmOpts {\n\n int m;\n\n int n;\n\n int k;\n\n testMethod test_method;\n\n char *elem_type;\n\n int N; // number of multiplications\n\n};\n\n\n\ntemplate <typename T_ELEM>\n","file_path":"Samples/batchCUBLAS/batchCUBLAS.cpp","rank":8,"score":135127.56338398636},{"content":"struct vec4<double> {\n\n typedef double4 Type;\n\n};\n\n\n","file_path":"Samples/nbody_screen/bodysystem.h","rank":9,"score":135085.6652249439},{"content":"struct vec3<double> {\n\n typedef double3 Type;\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"Samples/nbody_screen/bodysystem.h","rank":10,"score":135085.6652249439},{"content":"struct vec3<double> {\n\n typedef double3 Type;\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"Samples/nbody_opengles/bodysystem.h","rank":11,"score":135085.6652249439},{"content":"struct vec4<double> {\n\n typedef double4 Type;\n\n};\n\n\n","file_path":"Samples/nbody_opengles/bodysystem.h","rank":12,"score":135085.6652249439},{"content":"////////////////////////////////////////\n\n// Demo Parameters\n\n////////////////////////////////////////\n\nstruct NBodyParams {\n\n float m_timestep;\n\n float m_clusterScale;\n\n float m_velocityScale;\n\n float m_softening;\n\n float m_damping;\n\n float m_pointSize;\n\n float m_x, m_y, m_z;\n\n\n\n void print() {\n\n printf(\"{ %f, %f, %f, %f, %f, %f, %f, %f, %f },\\n\", m_timestep,\n\n m_clusterScale, m_velocityScale, m_softening, m_damping, m_pointSize,\n\n m_x, m_y, m_z);\n\n }\n\n};\n\n\n\nNBodyParams demoParams[] = {\n\n {0.016f, 1.54f, 8.0f, 0.1f, 1.0f, 1.0f, 0, -2, -100},\n\n {0.016f, 0.68f, 20.0f, 0.1f, 1.0f, 0.8f, 0, -2, -30},\n\n {0.0006f, 0.16f, 1000.0f, 1.0f, 1.0f, 0.07f, 0, 0, -1.5f},\n","file_path":"Samples/nbody_opengles/nbody_opengles.cpp","rank":13,"score":132342.3017808525},{"content":"////////////////////////////////////////\n\n// Demo Parameters\n\n////////////////////////////////////////\n\nstruct NBodyParams {\n\n float m_timestep;\n\n float m_clusterScale;\n\n float m_velocityScale;\n\n float m_softening;\n\n float m_damping;\n\n float m_pointSize;\n\n float m_x, m_y, m_z;\n\n\n\n void print() {\n\n printf(\"{ %f, %f, %f, %f, %f, %f, %f, %f, %f },\\n\", m_timestep,\n\n m_clusterScale, m_velocityScale, m_softening, m_damping, m_pointSize,\n\n m_x, m_y, m_z);\n\n }\n\n};\n\n\n\nNBodyParams demoParams[] = {\n\n {0.016f, 1.54f, 8.0f, 0.1f, 1.0f, 1.0f, 0, -2, -100},\n\n {0.016f, 0.68f, 20.0f, 0.1f, 1.0f, 0.8f, 0, -2, -30},\n\n {0.0006f, 0.16f, 1000.0f, 1.0f, 1.0f, 0.07f, 0, 0, -1.5f},\n","file_path":"Samples/nbody_screen/nbody_screen.cpp","rank":14,"score":132342.3017808525},{"content":"struct cooFormat {\n\n int i ;\n\n int j ;\n\n int p ; // permutation\n\n};\n\n\n\n\n\nint cmp_cooFormat_csr( struct cooFormat *s, struct cooFormat *t)\n\n{\n\n if ( s->i < t->i ){\n\n return -1 ;\n\n }\n\n else if ( s->i > t->i ){\n\n return 1 ;\n\n }\n\n else{\n\n return s->j - t->j ;\n\n }\n\n}\n\n\n","file_path":"Samples/cuSolverSp_LowlevelCholesky/mmio_wrapper.cpp","rank":15,"score":127172.00006336693},{"content":"struct cooFormat {\n\n int i;\n\n int j;\n\n int p; // permutation\n\n};\n\n\n\nint cmp_cooFormat_csr(struct cooFormat *s, struct cooFormat *t) {\n\n if (s->i < t->i) {\n\n return -1;\n\n } else if (s->i > t->i) {\n\n return 1;\n\n } else {\n\n return s->j - t->j;\n\n }\n\n}\n\n\n\nint cmp_cooFormat_csc(struct cooFormat *s, struct cooFormat *t) {\n\n if (s->j < t->j) {\n\n return -1;\n\n } else if (s->j > t->j) {\n","file_path":"Samples/cuSolverSp_LowlevelQR/mmio_wrapper.cpp","rank":16,"score":127170.77208502454},{"content":"struct cooFormat {\n\n int i ;\n\n int j ;\n\n int p ; // permutation\n\n};\n\n\n\n\n\nint cmp_cooFormat_csr( struct cooFormat *s, struct cooFormat *t)\n\n{\n\n if ( s->i < t->i ){\n\n return -1 ;\n\n }\n\n else if ( s->i > t->i ){\n\n return 1 ;\n\n }\n\n else{\n\n return s->j - t->j ;\n\n }\n\n}\n\n\n","file_path":"Samples/cuSolverDn_LinearSolver/mmio_wrapper.cpp","rank":17,"score":127115.22533360074},{"content":"struct cooFormat {\n\n int i ;\n\n int j ;\n\n int p ; // permutation\n\n};\n\n\n\n\n\nint cmp_cooFormat_csr( struct cooFormat *s, struct cooFormat *t)\n\n{\n\n if ( s->i < t->i ){\n\n return -1 ;\n\n }\n\n else if ( s->i > t->i ){\n\n return 1 ;\n\n }\n\n else{\n\n return s->j - t->j ;\n\n }\n\n}\n\n\n","file_path":"Samples/cuSolverSp_LinearSolver/mmio_wrapper.cpp","rank":18,"score":127115.22533360074},{"content":"tcuGraphicsGLRegisterBuffer *cuGraphicsGLRegisterBuffer;\n","file_path":"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c","rank":19,"score":124698.38359298406},{"content":"tcuD3D9RegisterVertexBuffer *cuD3D9RegisterVertexBuffer;\n","file_path":"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c","rank":20,"score":122103.41942374603},{"content":"tcuD3D9UnmapVertexBuffer *cuD3D9UnmapVertexBuffer;\n","file_path":"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c","rank":21,"score":122103.41942374603},{"content":"tcuD3D9MapVertexBuffer *cuD3D9MapVertexBuffer;\n","file_path":"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c","rank":22,"score":122103.41942374603},{"content":"tcuD3D9UnregisterVertexBuffer *cuD3D9UnregisterVertexBuffer;\n","file_path":"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c","rank":23,"score":122103.41942374603},{"content":"","file_path":"Samples/interval/boost/numeric/interval/hw_rounding.hpp","rank":24,"score":121137.939184862},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp","rank":25,"score":118316.04851529331},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/c99_rounding_control.hpp","rank":26,"score":116487.50339655076},{"content":"struct rounding_control<double>:\n\n detail::ia64_rounding_control\n\n{\n\n static const double & force_rounding(const double& r) { return r; }\n\n static double to_int(const double& r) { return rint(r); }\n\n};\n\n\n\ntemplate<>\n","file_path":"Samples/interval/boost/numeric/interval/detail/ia64_rounding_control.hpp","rank":27,"score":116487.50339655076},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/alpha_rounding_control.hpp","rank":28,"score":116487.50339655076},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/ppc_rounding_control.hpp","rank":29,"score":116487.50339655076},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/sparc_rounding_control.hpp","rank":30,"score":116487.50339655076},{"content":"class ArrayFileWriter {\n\n public:\n\n bool write(const char *filename, T *data, unsigned int len, float epsilon) {\n\n fprintf(stderr,\n\n \"Error: no file write function implemented for this type\\n\");\n\n return false;\n\n }\n\n};\n\n\n\n// Here's the specialization for ints:\n\ntemplate <>\n","file_path":"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp","rank":31,"score":114862.81175968467},{"content":"","file_path":"Samples/interval/boost/numeric/interval/hw_rounding.hpp","rank":32,"score":114767.99530169155},{"content":"class ArrayFileWriter<float> {\n\n public:\n\n bool write(const char *filename, float *data, unsigned int len,\n\n float epsilon) {\n\n return sdkWriteFile(filename, data, len, epsilon, false);\n\n }\n\n};\n\n\n\ntemplate <typename T>\n\nCUfunction getKernel(CUmodule in);\n\n\n\ntemplate <>\n\nCUfunction getKernel<int>(CUmodule in) {\n\n CUfunction kernel_addr;\n\n checkCudaErrors(cuModuleGetFunction(&kernel_addr, in, \"testInt\"));\n\n\n\n return kernel_addr;\n\n}\n\n\n\ntemplate <>\n","file_path":"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp","rank":33,"score":112560.33729264894},{"content":"struct rounding_control<long double>:\n\n detail::ia64_rounding_control\n\n{\n\n static const long double & force_rounding(const long double& r) { return r; }\n\n static long double to_int(const long double& r) { return rintl(r); }\n\n};\n\n\n\n} // namespace interval_lib\n\n} // namespace numeric\n\n} // namespace boost\n\n\n\n#undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE\n\n\n\n#endif /* __hpux */\n\n\n\n#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_IA64_ROUNDING_CONTROL_HPP */\n\n\n","file_path":"Samples/interval/boost/numeric/interval/detail/ia64_rounding_control.hpp","rank":34,"score":110336.21863321881},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/c99_rounding_control.hpp","rank":35,"score":110336.21863321881},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp","rank":36,"score":110336.21863321881},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/ppc_rounding_control.hpp","rank":37,"score":110336.21863321881},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/sparc_rounding_control.hpp","rank":38,"score":110336.21863321881},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/alpha_rounding_control.hpp","rank":39,"score":110336.21863321881},{"content":"class CFrameBufferObject {\n\n public:\n\n CFrameBufferObject(unsigned int width, unsigned int height, unsigned int Bpp,\n\n bool bUseFloat, GLenum eTarget)\n\n : m_Width(width),\n\n m_Height(height),\n\n m_bUseFloat(bUseFloat),\n\n m_eGLTarget(eTarget) {\n\n glGenFramebuffersEXT(1, &m_fboData.fb);\n\n\n\n m_fboData.colorTex =\n\n createTexture(m_eGLTarget, width, height,\n\n (bUseFloat ? GL_RGBA32F_ARB : GL_RGBA8), GL_RGBA);\n\n\n\n m_fboData.depthTex = createTexture(\n\n m_eGLTarget, width, height, GL_DEPTH_COMPONENT24, GL_DEPTH_COMPONENT);\n\n\n\n attachTexture(m_eGLTarget, m_fboData.colorTex, GL_COLOR_ATTACHMENT0_EXT);\n\n attachTexture(m_eGLTarget, m_fboData.depthTex, GL_DEPTH_ATTACHMENT_EXT);\n\n\n","file_path":"Common/rendercheck_gl.h","rank":40,"score":108694.75211167293},{"content":"class CheckBackBuffer : public CheckRender {\n\n public:\n\n CheckBackBuffer(unsigned int width, unsigned int height, unsigned int Bpp,\n\n bool bUseOpenGL = true)\n\n : CheckRender(width, height, Bpp, false, false, bUseOpenGL) {}\n\n\n\n virtual ~CheckBackBuffer() {}\n\n\n\n virtual bool checkStatus(const char *zfile, int line, bool silent) {\n\n GLenum nErrorCode = glGetError();\n\n\n\n if (nErrorCode != GL_NO_ERROR) {\n\n if (!silent) {\n\n printf(\"Assertion failed(%s,%d): %s\\n\", zfile, line,\n\n gluErrorString(nErrorCode));\n\n }\n\n }\n\n\n\n return true;\n\n }\n","file_path":"Common/rendercheck_gl.h","rank":41,"score":102982.09225018509},{"content":"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\n\n\n\n// Source image on the host side\n\nuchar4 *h_Src = 0;\n\n\n\n// Destination image on the GPU side\n\nuchar4 *d_dst = NULL;\n\n\n\n// Original image width and height\n\nint imageW = 800, imageH = 600;\n\n\n\n// Starting iteration limit\n\nint crunch = 512;\n\n\n\n// Starting position and scale\n\ndouble xOff = -0.5;\n\ndouble yOff = 0.0;\n\ndouble scale = 3.2;\n\n\n\n// Starting stationary position and scale motion\n","file_path":"Samples/Mandelbrot/Mandelbrot.cpp","rank":42,"score":101715.4787095705},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp","rank":43,"score":101585.6194335104},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp","rank":44,"score":100870.71351249013},{"content":"","file_path":"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp","rank":45,"score":100870.71351249013},{"content":" unsigned int aux_buffer;\n","file_path":"Common/GL/glxew.h","rank":46,"score":100345.17625583387},{"content":" unsigned int buffer_mask;\n","file_path":"Common/GL/glxew.h","rank":47,"score":100345.17625583387},{"content":" unsigned int *g_pos_one;\n","file_path":"Samples/eigenvalues/structs.h","rank":48,"score":100314.82906264688},{"content":" unsigned int *g_num_one;\n","file_path":"Samples/eigenvalues/structs.h","rank":49,"score":100314.82906264688},{"content":" float *g_right_one;\n","file_path":"Samples/eigenvalues/structs.h","rank":50,"score":100302.35755387873},{"content":" float *g_left_one;\n","file_path":"Samples/eigenvalues/structs.h","rank":51,"score":100302.35755387873},{"content":"void display_matrix(int m, int n, int nnzA, const cusparseMatDescr_t descrA,\n\n const double *csrValA, const int *csrRowPtrA,\n\n const int *csrColIndA) {\n\n const int baseA =\n\n (CUSPARSE_INDEX_BASE_ONE == cusparseGetMatIndexBase(descrA)) ? 1 : 0;\n\n\n\n printf(\"m = %d, n = %d, nnz = %d, matlab base-1\\n\", m, n, nnzA);\n\n\n\n for (int row = 0; row < m; row++) {\n\n const int start = csrRowPtrA[row] - baseA;\n\n const int end = csrRowPtrA[row + 1] - baseA;\n\n for (int colidx = start; colidx < end; colidx++) {\n\n const int col = csrColIndA[colidx] - baseA;\n\n double Areg = csrValA[colidx];\n\n printf(\"A(%d, %d) = %20.16E\\n\", row + 1, col + 1, Areg);\n\n }\n\n }\n","file_path":"Common/helper_cusolver.h","rank":52,"score":100093.46807320893},{"content":"","file_path":"Samples/interval/boost/numeric/interval/ext/x86_fast_rounding_control.hpp","rank":53,"score":98046.05412649104},{"content":"struct cudaGraphicsResource *cuda_vbo_resource; // handles OpenGL-CUDA exchange\n\nstatic cData *particles = NULL; // particle positions in host memory\n\nstatic int lastx = 0, lasty = 0;\n\n\n\n// Texture pitch\n\nsize_t tPitch = 0; // Now this is compatible with gcc in 64-bit\n\n\n\nchar *ref_file = NULL;\n\nbool g_bQAAddTestForce = true;\n\nint g_iFrameToCompare = 100;\n\nint g_TotalErrors = 0;\n\n\n\nbool g_bExitESC = false;\n\n\n\n// CheckFBO/BackBuffer class objects\n\nCheckRender *g_CheckRender = NULL;\n\n\n\nvoid autoTest(char **);\n\n\n\nextern \"C\" void addForces(cData *v, int dx, int dy, int spx, int spy, float fx,\n","file_path":"Samples/fluidsGL/fluidsGL.cpp","rank":54,"score":97854.33590273985},{"content":"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\n\nGLuint displayTex = 0;\n\nGLuint bufferTex = 0;\n\nGLuint fprog; // fragment program (shader)\n\n\n\nfloat tx = 9.0f, ty = 10.0f; // image translation\n\nfloat scale = 1.0f / 16.0f; // image scale\n\nfloat cx, cy; // image centre\n\n\n\nvoid display();\n\nvoid initGLBuffers();\n\nvoid runBenchmark(int iterations);\n\nvoid cleanup();\n\n\n\n#define GL_TEXTURE_TYPE GL_TEXTURE_RECTANGLE_ARB\n\n//#define GL_TEXTURE_TYPE GL_TEXTURE_2D\n\n\n\nextern \"C\" void initGL(int *argc, char **argv);\n\nextern \"C\" void loadImageData(int argc, char **argv);\n\n\n","file_path":"Samples/bicubicTexture/bicubicTexture.cpp","rank":55,"score":97854.33590273985},{"content":"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\n\nGLuint texid; // Texture\n\nGLuint shader;\n\n\n\nStopWatchInterface *timer = NULL, *kernel_timer = NULL;\n\n\n\n// Auto-Verification Code\n\nint fpsCount = 0; // FPS count for averaging\n\nint fpsLimit = 8; // FPS limit for sampling\n\nint g_Index = 0;\n\nint g_nFilterSign = 1;\n\nfloat avgFPS = 0.0f;\n\nunsigned int frameCount = 0;\n\nunsigned int g_TotalErrors = 0;\n\nbool g_bInteractive = false;\n\n\n\nint *pArgc = NULL;\n\nchar **pArgv = NULL;\n\n\n\nextern \"C\" int runSingleTest(char *ref_file, char *exec_path);\n","file_path":"Samples/boxFilter/boxFilter.cpp","rank":56,"score":97854.33590273985},{"content":"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\n\nGLuint texid; // texture\n\nGLuint shader;\n\n\n\nint *pArgc = NULL;\n\nchar **pArgv = NULL;\n\n\n\nStopWatchInterface *timer = NULL;\n\nStopWatchInterface *kernel_timer = NULL;\n\n\n\n// Auto-Verification Code\n\nconst int frameCheckNumber = 4;\n\nint fpsCount = 0; // FPS count for averaging\n\nint fpsLimit = 1; // FPS limit for sampling\n\nunsigned int g_TotalErrors = 0;\n\nbool g_bInteractive = false;\n\n\n\n//#define GL_TEXTURE_TYPE GL_TEXTURE_RECTANGLE_ARB\n\n#define GL_TEXTURE_TYPE GL_TEXTURE_2D\n\n\n","file_path":"Samples/bilateralFilter/bilateralFilter.cpp","rank":57,"score":97854.33590273985},{"content":"struct cudaGraphicsResource *cuda_vbo_resource; // handles OpenGLES-CUDA exchange\n\nstatic cData *particles = NULL; // particle positions in host memory\n\nstatic int lastx = 0, lasty = 0;\n\n\n\n// Texture pitch\n\nsize_t tPitch = 0; // Now this is compatible with gcc in 64-bit\n\n\n\nchar *ref_file = NULL;\n\nbool g_bQAAddTestForce = true;\n\nint g_iFrameToCompare = 100;\n\nint g_TotalErrors = 0;\n\n\n\nbool g_bExitESC = false;\n\n\n\nconst unsigned int window_width = 512;\n\nconst unsigned int window_height = 512;\n\n\n\n// CheckFBO/BackBuffer class objects\n\nCheckRender *g_CheckRender = NULL;\n\n\n","file_path":"Samples/fluidsGLES/fluidsGLES.cpp","rank":58,"score":97854.33590273985},{"content":"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\n\n// Source image on the host side\n\nuchar4 *h_Src;\n\nint imageW, imageH;\n\nGLuint shader;\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\n// Main program\n\n////////////////////////////////////////////////////////////////////////////////\n\nint g_Kernel = 0;\n\nbool g_FPS = false;\n\nbool g_Diag = false;\n\nStopWatchInterface *timer = NULL;\n\n\n\n// Algorithms global parameters\n\nconst float noiseStep = 0.025f;\n\nconst float lerpStep = 0.025f;\n\nstatic float knnNoise = 0.32f;\n\nstatic float nlmNoise = 1.45f;\n\nstatic float lerpC = 0.2f;\n","file_path":"Samples/imageDenoising/imageDenoisingGL.cpp","rank":59,"score":96046.85106745653},{"content":"enum ReduceType { REDUCE_INT, REDUCE_FLOAT, REDUCE_DOUBLE };\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\n// declaration, forward\n\ntemplate <class T>\n\nbool runTest(int argc, char **argv, ReduceType datatype);\n\n\n\n#define MAX_BLOCK_DIM_SIZE 65535\n\n\n\n#ifdef WIN32\n\n#define strcasecmp strcmpi\n\n#endif\n\n\n\nextern \"C\" bool isPow2(unsigned int x) { return ((x & (x - 1)) == 0); }\n\n\n\nconst char *getReduceTypeString(const ReduceType type) {\n\n switch (type) {\n\n case REDUCE_INT:\n\n return \"int\";\n\n case REDUCE_FLOAT:\n","file_path":"Samples/reduction/reduction.cpp","rank":60,"score":95514.12384134177},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_KTX_buffer_region;\n","file_path":"Common/GL/glew.h","rank":61,"score":95456.72692457867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_MESA_resize_buffers;\n","file_path":"Common/GL/glew.h","rank":62,"score":95456.72692457867},{"content":" WGLEW_EXPORT GLboolean __WGLEW_ARB_buffer_region;\n","file_path":"Common/GL/wglew.h","rank":63,"score":95456.72692457867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_pixel_buffer;\n","file_path":"Common/GL/glew.h","rank":64,"score":95456.72692457867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_draw_buffers;\n","file_path":"Common/GL/glew.h","rank":65,"score":95456.72692457867},{"content":" WGLEW_EXPORT GLboolean __WGLEW_NV_float_buffer;\n","file_path":"Common/GL/wglew.h","rank":66,"score":95456.72692457867},{"content":" GLXEW_EXPORT GLboolean __GLXEW_NV_float_buffer;\n","file_path":"Common/GL/glxew.h","rank":67,"score":95456.72692457867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_NV_float_buffer;\n","file_path":"Common/GL/glew.h","rank":68,"score":95456.72692457867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_copy_buffer;\n","file_path":"Common/GL/glew.h","rank":69,"score":95456.72692457867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ATI_draw_buffers;\n","file_path":"Common/GL/glew.h","rank":70,"score":95456.72692457867},{"content":" GLXEW_EXPORT GLboolean __GLXEW_MESA_release_buffers;\n","file_path":"Common/GL/glxew.h","rank":71,"score":95456.72692457867},{"content":"struct cudaGraphicsResource *cuda_VB_resource; // handles D3D10-CUDA exchange\n\n\n\n// testing/tracing function used pervasively in tests. if the condition is\n\n// unsatisfied then spew and fail the function immediately (doing no cleanup)\n\n#define AssertOrQuit(x) \\\n\n if (!(x)) { \\\n\n fprintf(stdout, \"Assert unsatisfied in %s at %s:%d\\n\", __FUNCTION__, \\\n\n __FILE__, __LINE__); \\\n\n return 1; \\\n\n }\n\n\n","file_path":"Samples/simpleD3D10/simpleD3D10.cpp","rank":72,"score":94314.59348450573},{"content":"struct cudaGraphicsResource *cuda_VB_resource; // handles D3D9-CUDA exchange\n\n\n\nHRESULT InitD3D9(HWND hWnd);\n\nHRESULT InitD3D9RenderState();\n\nHRESULT InitCUDA();\n\nHRESULT InitCUFFT();\n\nHRESULT InitVertexBuffer();\n\nHRESULT FreeVertexBuffer();\n\nHRESULT InitPointTexture();\n\nHRESULT RestoreContextResources();\n\n\n\n#define D3DFVF_CUSTOMVERTEX (D3DFVF_XYZ | D3DFVF_DIFFUSE)\n\nvoid updateVB(void);\n\nvoid initParticles(cData *p, int dx, int dy);\n\n\n\n// CUFFT plan handle\n\nstatic cufftHandle g_planr2c;\n\nstatic cufftHandle g_planc2r;\n\nstatic cData *g_vxfield = NULL;\n\nstatic cData *g_vyfield = NULL;\n","file_path":"Samples/fluidsD3D9/fluidsD3D9.cpp","rank":73,"score":94314.59348450573},{"content":"struct cudaGraphicsResource *cuda_VB_resource; // handles D3D9-CUDA exchange\n\n\n\nD3DDISPLAYMODEEX g_d3ddm;\n\nD3DPRESENT_PARAMETERS g_d3dpp;\n\n\n\nbool g_bWindowed = true;\n\nbool g_bDeviceLost = false;\n\nbool g_bPassed = true;\n\n\n","file_path":"Samples/simpleD3D9/simpleD3D9.cpp","rank":74,"score":94314.59348450573},{"content":"","file_path":"Samples/interval/boost/numeric/interval/ext/x86_fast_rounding_control.hpp","rank":75,"score":94278.9785139519},{"content":"inline int getCmdLineArgumentInt(const int argc, const char **argv,\n\n const char *string_ref) {\n\n bool bFound = false;\n\n int value = -1;\n\n\n\n if (argc >= 1) {\n\n for (int i = 1; i < argc; i++) {\n\n int string_start = stringRemoveDelimiter('-', argv[i]);\n\n const char *string_argv = &argv[i][string_start];\n\n int length = static_cast<int>(strlen(string_ref));\n\n\n\n if (!STRNCASECMP(string_argv, string_ref, length)) {\n\n if (length + 1 <= static_cast<int>(strlen(string_argv))) {\n\n int auto_inc = (string_argv[length] == '=') ? 1 : 0;\n\n value = atoi(&string_argv[length + auto_inc]);\n\n } else {\n\n value = 0;\n\n }\n\n\n\n bFound = true;\n\n continue;\n\n }\n\n }\n\n }\n\n\n\n if (bFound) {\n\n return value;\n\n } else {\n\n return 0;\n\n }\n","file_path":"Common/helper_string.h","rank":76,"score":93255.74362049146},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_NV_shader_buffer_load;\n","file_path":"Common/GL/glew.h","rank":77,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_texture_multi_buffer;\n","file_path":"Common/GL/glew.h","rank":78,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_AMD_draw_buffers_blend;\n","file_path":"Common/GL/glew.h","rank":79,"score":93186.8655929867},{"content":" BYTE SOBuffers;\n","file_path":"Samples/simpleD3D11Texture/d3dx11effect/d3dx11effect.h","rank":80,"score":93186.8655929867},{"content":"void graphics_swap_buffers() { eglSwapBuffers(eglDisplay, eglSurface); }\n","file_path":"Samples/fluidsGLES/graphics_interface.h","rank":81,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_NV_parameter_buffer_object;\n","file_path":"Common/GL/glew.h","rank":82,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_EXT_pixel_buffer_object;\n","file_path":"Common/GL/glew.h","rank":83,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_draw_buffers_blend;\n","file_path":"Common/GL/glew.h","rank":84,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_map_buffer_range;\n","file_path":"Common/GL/glew.h","rank":85,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_EXT_texture_buffer_object;\n","file_path":"Common/GL/glew.h","rank":86,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_NV_parameter_buffer_object2;\n","file_path":"Common/GL/glew.h","rank":87,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_pixel_buffer_object;\n","file_path":"Common/GL/glew.h","rank":88,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_tag_sample_buffer;\n","file_path":"Common/GL/glew.h","rank":89,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_texture_buffer_object;\n","file_path":"Common/GL/glew.h","rank":90,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_color_buffer_float;\n","file_path":"Common/GL/glew.h","rank":91,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_NV_depth_buffer_float;\n","file_path":"Common/GL/glew.h","rank":92,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ATI_map_object_buffer;\n","file_path":"Common/GL/glew.h","rank":93,"score":93186.8655929867},{"content":" GLXEW_EXPORT GLboolean __GLXEW_MESA_copy_sub_buffer;\n","file_path":"Common/GL/glxew.h","rank":94,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_depth_buffer_float;\n","file_path":"Common/GL/glew.h","rank":95,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_uniform_buffer_object;\n","file_path":"Common/GL/glew.h","rank":96,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_flush_buffer_range;\n","file_path":"Common/GL/glew.h","rank":97,"score":93186.8655929867},{"content":" WGLEW_EXPORT GLboolean __WGLEW_I3D_image_buffer;\n","file_path":"Common/GL/wglew.h","rank":98,"score":93186.8655929867},{"content":" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_vertex_buffer_object;\n","file_path":"Common/GL/glew.h","rank":99,"score":93186.8655929867}],"string":"[\n {\n \"content\": \"// structure defining the properties of a single buffer\\n\\nstruct bufferConfig {\\n\\n string name;\\n\\n GLenum format;\\n\\n int bits;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Common/rendercheck_gl.h\",\n \"rank\": 0,\n \"score\": 201948.48625693982\n },\n {\n \"content\": \"class ArrayFileWriter<int> {\\n\\n public:\\n\\n bool write(const char *filename, int *data, unsigned int len, float epsilon) {\\n\\n return sdkWriteFile(filename, data, len, epsilon, false);\\n\\n }\\n\\n};\\n\\n\\n\\n// Here's the specialization for floats:\\n\\ntemplate <>\\n\",\n \"file_path\": \"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp\",\n \"rank\": 1,\n \"score\": 185017.40764760156\n },\n {\n \"content\": \"struct ConstantBuffer {\\n\\n float vQuadRect[4];\\n\\n int UseCase;\\n\\n};\\n\\n\\n\\nID3D11VertexShader *g_pVertexShader;\\n\\nID3D11PixelShader *g_pPixelShader;\\n\\nID3D11Buffer *g_pConstantBuffer;\\n\\nID3D11SamplerState *g_pSamplerState;\\n\\n\\n\\n#endif\\n\\n// testing/tracing function used pervasively in tests. if the condition is\\n\\n// unsatisfied\\n\\n// then spew and fail the function immediately (doing no cleanup)\\n\\n#define AssertOrQuit(x) \\\\\\n\\n if (!(x)) { \\\\\\n\\n fprintf(stdout, \\\"Assert unsatisfied in %s at %s:%d\\\\n\\\", __FUNCTION__, \\\\\\n\\n __FILE__, __LINE__); \\\\\\n\\n return 1; \\\\\\n\\n }\\n\",\n \"file_path\": \"Samples/simpleD3D11Texture/simpleD3D11Texture.cpp\",\n \"rank\": 2,\n \"score\": 172519.0598137092\n },\n {\n \"content\": \"class ArrayComparator<int> {\\n\\n public:\\n\\n bool compare(const int *reference, int *data, unsigned int len) {\\n\\n return compareData(reference, data, len, 0.15f, 0.0f);\\n\\n }\\n\\n};\\n\\n\\n\\n// Here's the specialization for floats:\\n\\ntemplate <>\\n\",\n \"file_path\": \"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp\",\n \"rank\": 3,\n \"score\": 138370.69183356277\n },\n {\n \"content\": \"struct vec4<double> {\\n\\n typedef double4 Type;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Samples/nbody/bodysystem.h\",\n \"rank\": 4,\n \"score\": 138366.70264845793\n },\n {\n \"content\": \"struct vec3<double> {\\n\\n typedef double3 Type;\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"Samples/nbody/bodysystem.h\",\n \"rank\": 5,\n \"score\": 138366.70264845793\n },\n {\n \"content\": \"////////////////////////////////////////\\n\\n// Demo Parameters\\n\\n////////////////////////////////////////\\n\\nstruct NBodyParams {\\n\\n float m_timestep;\\n\\n float m_clusterScale;\\n\\n float m_velocityScale;\\n\\n float m_softening;\\n\\n float m_damping;\\n\\n float m_pointSize;\\n\\n float m_x, m_y, m_z;\\n\\n\\n\\n void print() {\\n\\n printf(\\\"{ %f, %f, %f, %f, %f, %f, %f, %f, %f },\\\\n\\\", m_timestep,\\n\\n m_clusterScale, m_velocityScale, m_softening, m_damping, m_pointSize,\\n\\n m_x, m_y, m_z);\\n\\n }\\n\\n};\\n\\n\\n\\nNBodyParams demoParams[] = {\\n\\n {0.016f, 1.54f, 8.0f, 0.1f, 1.0f, 1.0f, 0, -2, -100},\\n\\n {0.016f, 0.68f, 20.0f, 0.1f, 1.0f, 0.8f, 0, -2, -30},\\n\\n {0.0006f, 0.16f, 1000.0f, 1.0f, 1.0f, 0.07f, 0, 0, -1.5f},\\n\",\n \"file_path\": \"Samples/nbody/nbody.cpp\",\n \"rank\": 6,\n \"score\": 138052.20075445133\n },\n {\n \"content\": \"// Main structure that gets initialized at library load time\\n\\n// Choose a unique name, or it can clash with other preloaded libraries.\\n\\nstruct cuHookInfo {\\n\\n void* handle;\\n\\n void* preHooks[CU_HOOK_SYMBOLS];\\n\\n void* postHooks[CU_HOOK_SYMBOLS];\\n\\n\\n\\n // Debugging/Stats Info\\n\\n int bDebugEnabled;\\n\\n int hookedFunctionCalls[CU_HOOK_SYMBOLS];\\n\\n\\n\\n cuHookInfo() {\\n\\n const char* envHookDebug;\\n\\n\\n\\n // Check environment for CU_HOOK_DEBUG to facilitate debugging\\n\\n envHookDebug = getenv(\\\"CU_HOOK_DEBUG\\\");\\n\\n if (envHookDebug && envHookDebug[0] == '1') {\\n\\n bDebugEnabled = 1;\\n\\n fprintf(stderr, \\\"* %6d >> CUDA HOOK Library loaded.\\\\n\\\", getpid());\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Samples/cuHook/libcuhook.cpp\",\n \"rank\": 7,\n \"score\": 135132.02661432605\n },\n {\n \"content\": \"struct gemmOpts {\\n\\n int m;\\n\\n int n;\\n\\n int k;\\n\\n testMethod test_method;\\n\\n char *elem_type;\\n\\n int N; // number of multiplications\\n\\n};\\n\\n\\n\\ntemplate <typename T_ELEM>\\n\",\n \"file_path\": \"Samples/batchCUBLAS/batchCUBLAS.cpp\",\n \"rank\": 8,\n \"score\": 135127.56338398636\n },\n {\n \"content\": \"struct vec4<double> {\\n\\n typedef double4 Type;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Samples/nbody_screen/bodysystem.h\",\n \"rank\": 9,\n \"score\": 135085.6652249439\n },\n {\n \"content\": \"struct vec3<double> {\\n\\n typedef double3 Type;\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"Samples/nbody_screen/bodysystem.h\",\n \"rank\": 10,\n \"score\": 135085.6652249439\n },\n {\n \"content\": \"struct vec3<double> {\\n\\n typedef double3 Type;\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"Samples/nbody_opengles/bodysystem.h\",\n \"rank\": 11,\n \"score\": 135085.6652249439\n },\n {\n \"content\": \"struct vec4<double> {\\n\\n typedef double4 Type;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Samples/nbody_opengles/bodysystem.h\",\n \"rank\": 12,\n \"score\": 135085.6652249439\n },\n {\n \"content\": \"////////////////////////////////////////\\n\\n// Demo Parameters\\n\\n////////////////////////////////////////\\n\\nstruct NBodyParams {\\n\\n float m_timestep;\\n\\n float m_clusterScale;\\n\\n float m_velocityScale;\\n\\n float m_softening;\\n\\n float m_damping;\\n\\n float m_pointSize;\\n\\n float m_x, m_y, m_z;\\n\\n\\n\\n void print() {\\n\\n printf(\\\"{ %f, %f, %f, %f, %f, %f, %f, %f, %f },\\\\n\\\", m_timestep,\\n\\n m_clusterScale, m_velocityScale, m_softening, m_damping, m_pointSize,\\n\\n m_x, m_y, m_z);\\n\\n }\\n\\n};\\n\\n\\n\\nNBodyParams demoParams[] = {\\n\\n {0.016f, 1.54f, 8.0f, 0.1f, 1.0f, 1.0f, 0, -2, -100},\\n\\n {0.016f, 0.68f, 20.0f, 0.1f, 1.0f, 0.8f, 0, -2, -30},\\n\\n {0.0006f, 0.16f, 1000.0f, 1.0f, 1.0f, 0.07f, 0, 0, -1.5f},\\n\",\n \"file_path\": \"Samples/nbody_opengles/nbody_opengles.cpp\",\n \"rank\": 13,\n \"score\": 132342.3017808525\n },\n {\n \"content\": \"////////////////////////////////////////\\n\\n// Demo Parameters\\n\\n////////////////////////////////////////\\n\\nstruct NBodyParams {\\n\\n float m_timestep;\\n\\n float m_clusterScale;\\n\\n float m_velocityScale;\\n\\n float m_softening;\\n\\n float m_damping;\\n\\n float m_pointSize;\\n\\n float m_x, m_y, m_z;\\n\\n\\n\\n void print() {\\n\\n printf(\\\"{ %f, %f, %f, %f, %f, %f, %f, %f, %f },\\\\n\\\", m_timestep,\\n\\n m_clusterScale, m_velocityScale, m_softening, m_damping, m_pointSize,\\n\\n m_x, m_y, m_z);\\n\\n }\\n\\n};\\n\\n\\n\\nNBodyParams demoParams[] = {\\n\\n {0.016f, 1.54f, 8.0f, 0.1f, 1.0f, 1.0f, 0, -2, -100},\\n\\n {0.016f, 0.68f, 20.0f, 0.1f, 1.0f, 0.8f, 0, -2, -30},\\n\\n {0.0006f, 0.16f, 1000.0f, 1.0f, 1.0f, 0.07f, 0, 0, -1.5f},\\n\",\n \"file_path\": \"Samples/nbody_screen/nbody_screen.cpp\",\n \"rank\": 14,\n \"score\": 132342.3017808525\n },\n {\n \"content\": \"struct cooFormat {\\n\\n int i ;\\n\\n int j ;\\n\\n int p ; // permutation\\n\\n};\\n\\n\\n\\n\\n\\nint cmp_cooFormat_csr( struct cooFormat *s, struct cooFormat *t)\\n\\n{\\n\\n if ( s->i < t->i ){\\n\\n return -1 ;\\n\\n }\\n\\n else if ( s->i > t->i ){\\n\\n return 1 ;\\n\\n }\\n\\n else{\\n\\n return s->j - t->j ;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Samples/cuSolverSp_LowlevelCholesky/mmio_wrapper.cpp\",\n \"rank\": 15,\n \"score\": 127172.00006336693\n },\n {\n \"content\": \"struct cooFormat {\\n\\n int i;\\n\\n int j;\\n\\n int p; // permutation\\n\\n};\\n\\n\\n\\nint cmp_cooFormat_csr(struct cooFormat *s, struct cooFormat *t) {\\n\\n if (s->i < t->i) {\\n\\n return -1;\\n\\n } else if (s->i > t->i) {\\n\\n return 1;\\n\\n } else {\\n\\n return s->j - t->j;\\n\\n }\\n\\n}\\n\\n\\n\\nint cmp_cooFormat_csc(struct cooFormat *s, struct cooFormat *t) {\\n\\n if (s->j < t->j) {\\n\\n return -1;\\n\\n } else if (s->j > t->j) {\\n\",\n \"file_path\": \"Samples/cuSolverSp_LowlevelQR/mmio_wrapper.cpp\",\n \"rank\": 16,\n \"score\": 127170.77208502454\n },\n {\n \"content\": \"struct cooFormat {\\n\\n int i ;\\n\\n int j ;\\n\\n int p ; // permutation\\n\\n};\\n\\n\\n\\n\\n\\nint cmp_cooFormat_csr( struct cooFormat *s, struct cooFormat *t)\\n\\n{\\n\\n if ( s->i < t->i ){\\n\\n return -1 ;\\n\\n }\\n\\n else if ( s->i > t->i ){\\n\\n return 1 ;\\n\\n }\\n\\n else{\\n\\n return s->j - t->j ;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Samples/cuSolverDn_LinearSolver/mmio_wrapper.cpp\",\n \"rank\": 17,\n \"score\": 127115.22533360074\n },\n {\n \"content\": \"struct cooFormat {\\n\\n int i ;\\n\\n int j ;\\n\\n int p ; // permutation\\n\\n};\\n\\n\\n\\n\\n\\nint cmp_cooFormat_csr( struct cooFormat *s, struct cooFormat *t)\\n\\n{\\n\\n if ( s->i < t->i ){\\n\\n return -1 ;\\n\\n }\\n\\n else if ( s->i > t->i ){\\n\\n return 1 ;\\n\\n }\\n\\n else{\\n\\n return s->j - t->j ;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Samples/cuSolverSp_LinearSolver/mmio_wrapper.cpp\",\n \"rank\": 18,\n \"score\": 127115.22533360074\n },\n {\n \"content\": \"tcuGraphicsGLRegisterBuffer *cuGraphicsGLRegisterBuffer;\\n\",\n \"file_path\": \"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c\",\n \"rank\": 19,\n \"score\": 124698.38359298406\n },\n {\n \"content\": \"tcuD3D9RegisterVertexBuffer *cuD3D9RegisterVertexBuffer;\\n\",\n \"file_path\": \"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c\",\n \"rank\": 20,\n \"score\": 122103.41942374603\n },\n {\n \"content\": \"tcuD3D9UnmapVertexBuffer *cuD3D9UnmapVertexBuffer;\\n\",\n \"file_path\": \"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c\",\n \"rank\": 21,\n \"score\": 122103.41942374603\n },\n {\n \"content\": \"tcuD3D9MapVertexBuffer *cuD3D9MapVertexBuffer;\\n\",\n \"file_path\": \"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c\",\n \"rank\": 22,\n \"score\": 122103.41942374603\n },\n {\n \"content\": \"tcuD3D9UnregisterVertexBuffer *cuD3D9UnregisterVertexBuffer;\\n\",\n \"file_path\": \"Samples/matrixMulDynlinkJIT/cuda_drvapi_dynlink.c\",\n \"rank\": 23,\n \"score\": 122103.41942374603\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/hw_rounding.hpp\",\n \"rank\": 24,\n \"score\": 121137.939184862\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp\",\n \"rank\": 25,\n \"score\": 118316.04851529331\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/c99_rounding_control.hpp\",\n \"rank\": 26,\n \"score\": 116487.50339655076\n },\n {\n \"content\": \"struct rounding_control<double>:\\n\\n detail::ia64_rounding_control\\n\\n{\\n\\n static const double & force_rounding(const double& r) { return r; }\\n\\n static double to_int(const double& r) { return rint(r); }\\n\\n};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/ia64_rounding_control.hpp\",\n \"rank\": 27,\n \"score\": 116487.50339655076\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/alpha_rounding_control.hpp\",\n \"rank\": 28,\n \"score\": 116487.50339655076\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/ppc_rounding_control.hpp\",\n \"rank\": 29,\n \"score\": 116487.50339655076\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/sparc_rounding_control.hpp\",\n \"rank\": 30,\n \"score\": 116487.50339655076\n },\n {\n \"content\": \"class ArrayFileWriter {\\n\\n public:\\n\\n bool write(const char *filename, T *data, unsigned int len, float epsilon) {\\n\\n fprintf(stderr,\\n\\n \\\"Error: no file write function implemented for this type\\\\n\\\");\\n\\n return false;\\n\\n }\\n\\n};\\n\\n\\n\\n// Here's the specialization for ints:\\n\\ntemplate <>\\n\",\n \"file_path\": \"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp\",\n \"rank\": 31,\n \"score\": 114862.81175968467\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/hw_rounding.hpp\",\n \"rank\": 32,\n \"score\": 114767.99530169155\n },\n {\n \"content\": \"class ArrayFileWriter<float> {\\n\\n public:\\n\\n bool write(const char *filename, float *data, unsigned int len,\\n\\n float epsilon) {\\n\\n return sdkWriteFile(filename, data, len, epsilon, false);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\nCUfunction getKernel(CUmodule in);\\n\\n\\n\\ntemplate <>\\n\\nCUfunction getKernel<int>(CUmodule in) {\\n\\n CUfunction kernel_addr;\\n\\n checkCudaErrors(cuModuleGetFunction(&kernel_addr, in, \\\"testInt\\\"));\\n\\n\\n\\n return kernel_addr;\\n\\n}\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"Samples/simpleTemplates_nvrtc/simpleTemplates.cpp\",\n \"rank\": 33,\n \"score\": 112560.33729264894\n },\n {\n \"content\": \"struct rounding_control<long double>:\\n\\n detail::ia64_rounding_control\\n\\n{\\n\\n static const long double & force_rounding(const long double& r) { return r; }\\n\\n static long double to_int(const long double& r) { return rintl(r); }\\n\\n};\\n\\n\\n\\n} // namespace interval_lib\\n\\n} // namespace numeric\\n\\n} // namespace boost\\n\\n\\n\\n#undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE\\n\\n\\n\\n#endif /* __hpux */\\n\\n\\n\\n#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_IA64_ROUNDING_CONTROL_HPP */\\n\\n\\n\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/ia64_rounding_control.hpp\",\n \"rank\": 34,\n \"score\": 110336.21863321881\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/c99_rounding_control.hpp\",\n \"rank\": 35,\n \"score\": 110336.21863321881\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp\",\n \"rank\": 36,\n \"score\": 110336.21863321881\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/ppc_rounding_control.hpp\",\n \"rank\": 37,\n \"score\": 110336.21863321881\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/sparc_rounding_control.hpp\",\n \"rank\": 38,\n \"score\": 110336.21863321881\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/alpha_rounding_control.hpp\",\n \"rank\": 39,\n \"score\": 110336.21863321881\n },\n {\n \"content\": \"class CFrameBufferObject {\\n\\n public:\\n\\n CFrameBufferObject(unsigned int width, unsigned int height, unsigned int Bpp,\\n\\n bool bUseFloat, GLenum eTarget)\\n\\n : m_Width(width),\\n\\n m_Height(height),\\n\\n m_bUseFloat(bUseFloat),\\n\\n m_eGLTarget(eTarget) {\\n\\n glGenFramebuffersEXT(1, &m_fboData.fb);\\n\\n\\n\\n m_fboData.colorTex =\\n\\n createTexture(m_eGLTarget, width, height,\\n\\n (bUseFloat ? GL_RGBA32F_ARB : GL_RGBA8), GL_RGBA);\\n\\n\\n\\n m_fboData.depthTex = createTexture(\\n\\n m_eGLTarget, width, height, GL_DEPTH_COMPONENT24, GL_DEPTH_COMPONENT);\\n\\n\\n\\n attachTexture(m_eGLTarget, m_fboData.colorTex, GL_COLOR_ATTACHMENT0_EXT);\\n\\n attachTexture(m_eGLTarget, m_fboData.depthTex, GL_DEPTH_ATTACHMENT_EXT);\\n\\n\\n\",\n \"file_path\": \"Common/rendercheck_gl.h\",\n \"rank\": 40,\n \"score\": 108694.75211167293\n },\n {\n \"content\": \"class CheckBackBuffer : public CheckRender {\\n\\n public:\\n\\n CheckBackBuffer(unsigned int width, unsigned int height, unsigned int Bpp,\\n\\n bool bUseOpenGL = true)\\n\\n : CheckRender(width, height, Bpp, false, false, bUseOpenGL) {}\\n\\n\\n\\n virtual ~CheckBackBuffer() {}\\n\\n\\n\\n virtual bool checkStatus(const char *zfile, int line, bool silent) {\\n\\n GLenum nErrorCode = glGetError();\\n\\n\\n\\n if (nErrorCode != GL_NO_ERROR) {\\n\\n if (!silent) {\\n\\n printf(\\\"Assertion failed(%s,%d): %s\\\\n\\\", zfile, line,\\n\\n gluErrorString(nErrorCode));\\n\\n }\\n\\n }\\n\\n\\n\\n return true;\\n\\n }\\n\",\n \"file_path\": \"Common/rendercheck_gl.h\",\n \"rank\": 41,\n \"score\": 102982.09225018509\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\\n\\n\\n\\n// Source image on the host side\\n\\nuchar4 *h_Src = 0;\\n\\n\\n\\n// Destination image on the GPU side\\n\\nuchar4 *d_dst = NULL;\\n\\n\\n\\n// Original image width and height\\n\\nint imageW = 800, imageH = 600;\\n\\n\\n\\n// Starting iteration limit\\n\\nint crunch = 512;\\n\\n\\n\\n// Starting position and scale\\n\\ndouble xOff = -0.5;\\n\\ndouble yOff = 0.0;\\n\\ndouble scale = 3.2;\\n\\n\\n\\n// Starting stationary position and scale motion\\n\",\n \"file_path\": \"Samples/Mandelbrot/Mandelbrot.cpp\",\n \"rank\": 42,\n \"score\": 101715.4787095705\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp\",\n \"rank\": 43,\n \"score\": 101585.6194335104\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp\",\n \"rank\": 44,\n \"score\": 100870.71351249013\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/detail/x86_rounding_control.hpp\",\n \"rank\": 45,\n \"score\": 100870.71351249013\n },\n {\n \"content\": \" unsigned int aux_buffer;\\n\",\n \"file_path\": \"Common/GL/glxew.h\",\n \"rank\": 46,\n \"score\": 100345.17625583387\n },\n {\n \"content\": \" unsigned int buffer_mask;\\n\",\n \"file_path\": \"Common/GL/glxew.h\",\n \"rank\": 47,\n \"score\": 100345.17625583387\n },\n {\n \"content\": \" unsigned int *g_pos_one;\\n\",\n \"file_path\": \"Samples/eigenvalues/structs.h\",\n \"rank\": 48,\n \"score\": 100314.82906264688\n },\n {\n \"content\": \" unsigned int *g_num_one;\\n\",\n \"file_path\": \"Samples/eigenvalues/structs.h\",\n \"rank\": 49,\n \"score\": 100314.82906264688\n },\n {\n \"content\": \" float *g_right_one;\\n\",\n \"file_path\": \"Samples/eigenvalues/structs.h\",\n \"rank\": 50,\n \"score\": 100302.35755387873\n },\n {\n \"content\": \" float *g_left_one;\\n\",\n \"file_path\": \"Samples/eigenvalues/structs.h\",\n \"rank\": 51,\n \"score\": 100302.35755387873\n },\n {\n \"content\": \"void display_matrix(int m, int n, int nnzA, const cusparseMatDescr_t descrA,\\n\\n const double *csrValA, const int *csrRowPtrA,\\n\\n const int *csrColIndA) {\\n\\n const int baseA =\\n\\n (CUSPARSE_INDEX_BASE_ONE == cusparseGetMatIndexBase(descrA)) ? 1 : 0;\\n\\n\\n\\n printf(\\\"m = %d, n = %d, nnz = %d, matlab base-1\\\\n\\\", m, n, nnzA);\\n\\n\\n\\n for (int row = 0; row < m; row++) {\\n\\n const int start = csrRowPtrA[row] - baseA;\\n\\n const int end = csrRowPtrA[row + 1] - baseA;\\n\\n for (int colidx = start; colidx < end; colidx++) {\\n\\n const int col = csrColIndA[colidx] - baseA;\\n\\n double Areg = csrValA[colidx];\\n\\n printf(\\\"A(%d, %d) = %20.16E\\\\n\\\", row + 1, col + 1, Areg);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"Common/helper_cusolver.h\",\n \"rank\": 52,\n \"score\": 100093.46807320893\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/ext/x86_fast_rounding_control.hpp\",\n \"rank\": 53,\n \"score\": 98046.05412649104\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_vbo_resource; // handles OpenGL-CUDA exchange\\n\\nstatic cData *particles = NULL; // particle positions in host memory\\n\\nstatic int lastx = 0, lasty = 0;\\n\\n\\n\\n// Texture pitch\\n\\nsize_t tPitch = 0; // Now this is compatible with gcc in 64-bit\\n\\n\\n\\nchar *ref_file = NULL;\\n\\nbool g_bQAAddTestForce = true;\\n\\nint g_iFrameToCompare = 100;\\n\\nint g_TotalErrors = 0;\\n\\n\\n\\nbool g_bExitESC = false;\\n\\n\\n\\n// CheckFBO/BackBuffer class objects\\n\\nCheckRender *g_CheckRender = NULL;\\n\\n\\n\\nvoid autoTest(char **);\\n\\n\\n\\nextern \\\"C\\\" void addForces(cData *v, int dx, int dy, int spx, int spy, float fx,\\n\",\n \"file_path\": \"Samples/fluidsGL/fluidsGL.cpp\",\n \"rank\": 54,\n \"score\": 97854.33590273985\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\\n\\nGLuint displayTex = 0;\\n\\nGLuint bufferTex = 0;\\n\\nGLuint fprog; // fragment program (shader)\\n\\n\\n\\nfloat tx = 9.0f, ty = 10.0f; // image translation\\n\\nfloat scale = 1.0f / 16.0f; // image scale\\n\\nfloat cx, cy; // image centre\\n\\n\\n\\nvoid display();\\n\\nvoid initGLBuffers();\\n\\nvoid runBenchmark(int iterations);\\n\\nvoid cleanup();\\n\\n\\n\\n#define GL_TEXTURE_TYPE GL_TEXTURE_RECTANGLE_ARB\\n\\n//#define GL_TEXTURE_TYPE GL_TEXTURE_2D\\n\\n\\n\\nextern \\\"C\\\" void initGL(int *argc, char **argv);\\n\\nextern \\\"C\\\" void loadImageData(int argc, char **argv);\\n\\n\\n\",\n \"file_path\": \"Samples/bicubicTexture/bicubicTexture.cpp\",\n \"rank\": 55,\n \"score\": 97854.33590273985\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\\n\\nGLuint texid; // Texture\\n\\nGLuint shader;\\n\\n\\n\\nStopWatchInterface *timer = NULL, *kernel_timer = NULL;\\n\\n\\n\\n// Auto-Verification Code\\n\\nint fpsCount = 0; // FPS count for averaging\\n\\nint fpsLimit = 8; // FPS limit for sampling\\n\\nint g_Index = 0;\\n\\nint g_nFilterSign = 1;\\n\\nfloat avgFPS = 0.0f;\\n\\nunsigned int frameCount = 0;\\n\\nunsigned int g_TotalErrors = 0;\\n\\nbool g_bInteractive = false;\\n\\n\\n\\nint *pArgc = NULL;\\n\\nchar **pArgv = NULL;\\n\\n\\n\\nextern \\\"C\\\" int runSingleTest(char *ref_file, char *exec_path);\\n\",\n \"file_path\": \"Samples/boxFilter/boxFilter.cpp\",\n \"rank\": 56,\n \"score\": 97854.33590273985\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\\n\\nGLuint texid; // texture\\n\\nGLuint shader;\\n\\n\\n\\nint *pArgc = NULL;\\n\\nchar **pArgv = NULL;\\n\\n\\n\\nStopWatchInterface *timer = NULL;\\n\\nStopWatchInterface *kernel_timer = NULL;\\n\\n\\n\\n// Auto-Verification Code\\n\\nconst int frameCheckNumber = 4;\\n\\nint fpsCount = 0; // FPS count for averaging\\n\\nint fpsLimit = 1; // FPS limit for sampling\\n\\nunsigned int g_TotalErrors = 0;\\n\\nbool g_bInteractive = false;\\n\\n\\n\\n//#define GL_TEXTURE_TYPE GL_TEXTURE_RECTANGLE_ARB\\n\\n#define GL_TEXTURE_TYPE GL_TEXTURE_2D\\n\\n\\n\",\n \"file_path\": \"Samples/bilateralFilter/bilateralFilter.cpp\",\n \"rank\": 57,\n \"score\": 97854.33590273985\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_vbo_resource; // handles OpenGLES-CUDA exchange\\n\\nstatic cData *particles = NULL; // particle positions in host memory\\n\\nstatic int lastx = 0, lasty = 0;\\n\\n\\n\\n// Texture pitch\\n\\nsize_t tPitch = 0; // Now this is compatible with gcc in 64-bit\\n\\n\\n\\nchar *ref_file = NULL;\\n\\nbool g_bQAAddTestForce = true;\\n\\nint g_iFrameToCompare = 100;\\n\\nint g_TotalErrors = 0;\\n\\n\\n\\nbool g_bExitESC = false;\\n\\n\\n\\nconst unsigned int window_width = 512;\\n\\nconst unsigned int window_height = 512;\\n\\n\\n\\n// CheckFBO/BackBuffer class objects\\n\\nCheckRender *g_CheckRender = NULL;\\n\\n\\n\",\n \"file_path\": \"Samples/fluidsGLES/fluidsGLES.cpp\",\n \"rank\": 58,\n \"score\": 97854.33590273985\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_pbo_resource; // handles OpenGL-CUDA exchange\\n\\n// Source image on the host side\\n\\nuchar4 *h_Src;\\n\\nint imageW, imageH;\\n\\nGLuint shader;\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\n// Main program\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nint g_Kernel = 0;\\n\\nbool g_FPS = false;\\n\\nbool g_Diag = false;\\n\\nStopWatchInterface *timer = NULL;\\n\\n\\n\\n// Algorithms global parameters\\n\\nconst float noiseStep = 0.025f;\\n\\nconst float lerpStep = 0.025f;\\n\\nstatic float knnNoise = 0.32f;\\n\\nstatic float nlmNoise = 1.45f;\\n\\nstatic float lerpC = 0.2f;\\n\",\n \"file_path\": \"Samples/imageDenoising/imageDenoisingGL.cpp\",\n \"rank\": 59,\n \"score\": 96046.85106745653\n },\n {\n \"content\": \"enum ReduceType { REDUCE_INT, REDUCE_FLOAT, REDUCE_DOUBLE };\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\n// declaration, forward\\n\\ntemplate <class T>\\n\\nbool runTest(int argc, char **argv, ReduceType datatype);\\n\\n\\n\\n#define MAX_BLOCK_DIM_SIZE 65535\\n\\n\\n\\n#ifdef WIN32\\n\\n#define strcasecmp strcmpi\\n\\n#endif\\n\\n\\n\\nextern \\\"C\\\" bool isPow2(unsigned int x) { return ((x & (x - 1)) == 0); }\\n\\n\\n\\nconst char *getReduceTypeString(const ReduceType type) {\\n\\n switch (type) {\\n\\n case REDUCE_INT:\\n\\n return \\\"int\\\";\\n\\n case REDUCE_FLOAT:\\n\",\n \"file_path\": \"Samples/reduction/reduction.cpp\",\n \"rank\": 60,\n \"score\": 95514.12384134177\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_KTX_buffer_region;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 61,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_MESA_resize_buffers;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 62,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" WGLEW_EXPORT GLboolean __WGLEW_ARB_buffer_region;\\n\",\n \"file_path\": \"Common/GL/wglew.h\",\n \"rank\": 63,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_pixel_buffer;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 64,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_draw_buffers;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 65,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" WGLEW_EXPORT GLboolean __WGLEW_NV_float_buffer;\\n\",\n \"file_path\": \"Common/GL/wglew.h\",\n \"rank\": 66,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLXEW_EXPORT GLboolean __GLXEW_NV_float_buffer;\\n\",\n \"file_path\": \"Common/GL/glxew.h\",\n \"rank\": 67,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_NV_float_buffer;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 68,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_copy_buffer;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 69,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ATI_draw_buffers;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 70,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \" GLXEW_EXPORT GLboolean __GLXEW_MESA_release_buffers;\\n\",\n \"file_path\": \"Common/GL/glxew.h\",\n \"rank\": 71,\n \"score\": 95456.72692457867\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_VB_resource; // handles D3D10-CUDA exchange\\n\\n\\n\\n// testing/tracing function used pervasively in tests. if the condition is\\n\\n// unsatisfied then spew and fail the function immediately (doing no cleanup)\\n\\n#define AssertOrQuit(x) \\\\\\n\\n if (!(x)) { \\\\\\n\\n fprintf(stdout, \\\"Assert unsatisfied in %s at %s:%d\\\\n\\\", __FUNCTION__, \\\\\\n\\n __FILE__, __LINE__); \\\\\\n\\n return 1; \\\\\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Samples/simpleD3D10/simpleD3D10.cpp\",\n \"rank\": 72,\n \"score\": 94314.59348450573\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_VB_resource; // handles D3D9-CUDA exchange\\n\\n\\n\\nHRESULT InitD3D9(HWND hWnd);\\n\\nHRESULT InitD3D9RenderState();\\n\\nHRESULT InitCUDA();\\n\\nHRESULT InitCUFFT();\\n\\nHRESULT InitVertexBuffer();\\n\\nHRESULT FreeVertexBuffer();\\n\\nHRESULT InitPointTexture();\\n\\nHRESULT RestoreContextResources();\\n\\n\\n\\n#define D3DFVF_CUSTOMVERTEX (D3DFVF_XYZ | D3DFVF_DIFFUSE)\\n\\nvoid updateVB(void);\\n\\nvoid initParticles(cData *p, int dx, int dy);\\n\\n\\n\\n// CUFFT plan handle\\n\\nstatic cufftHandle g_planr2c;\\n\\nstatic cufftHandle g_planc2r;\\n\\nstatic cData *g_vxfield = NULL;\\n\\nstatic cData *g_vyfield = NULL;\\n\",\n \"file_path\": \"Samples/fluidsD3D9/fluidsD3D9.cpp\",\n \"rank\": 73,\n \"score\": 94314.59348450573\n },\n {\n \"content\": \"struct cudaGraphicsResource *cuda_VB_resource; // handles D3D9-CUDA exchange\\n\\n\\n\\nD3DDISPLAYMODEEX g_d3ddm;\\n\\nD3DPRESENT_PARAMETERS g_d3dpp;\\n\\n\\n\\nbool g_bWindowed = true;\\n\\nbool g_bDeviceLost = false;\\n\\nbool g_bPassed = true;\\n\\n\\n\",\n \"file_path\": \"Samples/simpleD3D9/simpleD3D9.cpp\",\n \"rank\": 74,\n \"score\": 94314.59348450573\n },\n {\n \"content\": \"\",\n \"file_path\": \"Samples/interval/boost/numeric/interval/ext/x86_fast_rounding_control.hpp\",\n \"rank\": 75,\n \"score\": 94278.9785139519\n },\n {\n \"content\": \"inline int getCmdLineArgumentInt(const int argc, const char **argv,\\n\\n const char *string_ref) {\\n\\n bool bFound = false;\\n\\n int value = -1;\\n\\n\\n\\n if (argc >= 1) {\\n\\n for (int i = 1; i < argc; i++) {\\n\\n int string_start = stringRemoveDelimiter('-', argv[i]);\\n\\n const char *string_argv = &argv[i][string_start];\\n\\n int length = static_cast<int>(strlen(string_ref));\\n\\n\\n\\n if (!STRNCASECMP(string_argv, string_ref, length)) {\\n\\n if (length + 1 <= static_cast<int>(strlen(string_argv))) {\\n\\n int auto_inc = (string_argv[length] == '=') ? 1 : 0;\\n\\n value = atoi(&string_argv[length + auto_inc]);\\n\\n } else {\\n\\n value = 0;\\n\\n }\\n\\n\\n\\n bFound = true;\\n\\n continue;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n if (bFound) {\\n\\n return value;\\n\\n } else {\\n\\n return 0;\\n\\n }\\n\",\n \"file_path\": \"Common/helper_string.h\",\n \"rank\": 76,\n \"score\": 93255.74362049146\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_NV_shader_buffer_load;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 77,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_texture_multi_buffer;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 78,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_AMD_draw_buffers_blend;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 79,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" BYTE SOBuffers;\\n\",\n \"file_path\": \"Samples/simpleD3D11Texture/d3dx11effect/d3dx11effect.h\",\n \"rank\": 80,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \"void graphics_swap_buffers() { eglSwapBuffers(eglDisplay, eglSurface); }\\n\",\n \"file_path\": \"Samples/fluidsGLES/graphics_interface.h\",\n \"rank\": 81,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_NV_parameter_buffer_object;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 82,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_EXT_pixel_buffer_object;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 83,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_draw_buffers_blend;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 84,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_map_buffer_range;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 85,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_EXT_texture_buffer_object;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 86,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_NV_parameter_buffer_object2;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 87,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_pixel_buffer_object;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 88,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_SGIX_tag_sample_buffer;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 89,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_texture_buffer_object;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 90,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_color_buffer_float;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 91,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_NV_depth_buffer_float;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 92,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ATI_map_object_buffer;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 93,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLXEW_EXPORT GLboolean __GLXEW_MESA_copy_sub_buffer;\\n\",\n \"file_path\": \"Common/GL/glxew.h\",\n \"rank\": 94,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_depth_buffer_float;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 95,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_uniform_buffer_object;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 96,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_APPLE_flush_buffer_range;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 97,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" WGLEW_EXPORT GLboolean __WGLEW_I3D_image_buffer;\\n\",\n \"file_path\": \"Common/GL/wglew.h\",\n \"rank\": 98,\n \"score\": 93186.8655929867\n },\n {\n \"content\": \" GLEW_VAR_EXPORT GLboolean __GLEW_ARB_vertex_buffer_object;\\n\",\n \"file_path\": \"Common/GL/glew.h\",\n \"rank\": 99,\n \"score\": 93186.8655929867\n }\n]","isConversational":false}}},{"rowIdx":295,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"common/sockets.cpp"},"repo_name":{"kind":"string","value":"kkamagui/TPM2.0-TSS"},"commit":{"kind":"string","value":"106e914dd285f1b152c127f1cad564744596cf2f"},"file_code":{"kind":"string","value":"#include <tcti/tcti_socket.h>\n#include \"debug.h\"\n#include \"sockets.h\"\n\n#ifndef _WIN32\nvoid WSACleanup() {}\nint WSAGetLastError() { return errno; }\n#endif\n\nvoid CloseSockets( SOCKET otherSock, SOCKET tpmSock)\n{\n closesocket(otherSock);\n closesocket(tpmSock);\n}\n\nTSS2_RC recvBytes( SOCKET tpmSock, unsigned char *data, int len )\n{\n int iResult = 0;\n int length;\n int bytesRead;\n\n for( bytesRead = 0, length = len; bytesRead != len; length -= iResult, bytesRead += iResult )\n {\n iResult = recv( tpmSock, (char *)&( data[bytesRead] ), length, 0);\n if ((iResult == SOCKET_ERROR) || (!iResult))\n return TSS2_TCTI_RC_IO_ERROR;\n }\n\n return TSS2_RC_SUCCESS;\n}\n\nTSS2_RC sendBytes( SOCKET tpmSock, const unsigned char *data, int len )\n{\n int iResult = 0;\n int sentLength = 0;\n\n for( sentLength = 0; sentLength < len; len -= iResult, sentLength += iResult )\n {\n iResult = send( tpmSock, (char *)data, len, MSG_NOSIGNAL );\n if (iResult == SOCKET_ERROR)\n return TSS2_TCTI_RC_IO_ERROR;\n }\n\n return TSS2_RC_SUCCESS;\n}\n\n#define SAFE_CALL(func, ...) (func != NULL) ? func(__VA_ARGS__) : 0\nint\nInitSockets( const char *hostName,\n UINT16 port,\n UINT8 serverSockets,\n SOCKET *otherSock,\n SOCKET *tpmSock,\n TCTI_LOG_CALLBACK debugfunc,\n void* data )\n{\n sockaddr_in otherService;\n sockaddr_in tpmService;\n int iResult = 0; \n\n#ifdef _WIN32\n WSADATA wsaData = {0};\n static UINT8 socketsEnabled = 0;\n\n if( socketsEnabled == 0 )\n {\n \n iResult = WSAStartup(MAKEWORD(2, 2), &wsaData);\n if (iResult != 0) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"WSAStartup failed: %d\\n\", iResult);\n return 1;\n }\n socketsEnabled = 1;\n }\n#endif\n *otherSock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n if (*otherSock == INVALID_SOCKET)\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket creation failed with error = %d\\n\", WSAGetLastError() );\n return(1);\n }\n else {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket created: 0x%x\\n\", *otherSock );\n otherService.sin_family = AF_INET;\n otherService.sin_addr.s_addr = inet_addr( hostName );\n otherService.sin_port = htons(port + 1);\n\n if( serverSockets )\n {\n \n iResult = bind(*otherSock, (SOCKADDR *) &otherService, sizeof (otherService));\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"bind failed with error %u\\n\", WSAGetLastError());\n closesocket(*otherSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"bind to IP address:port: %s:%d\\n\", hostName, port + 1 );\n }\n\n iResult = listen( *otherSock, 4 );\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"listen failed with error %u\\n\", WSAGetLastError());\n closesocket(*otherSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"Other CMD server listening to socket: 0x%x\\n\", *otherSock );\n }\n }\n }\n\n *tpmSock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n if (*tpmSock == INVALID_SOCKET)\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket creation failed with error = %d\\n\", WSAGetLastError() );\n closesocket( *otherSock );\n return(1);\n }\n else {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket created: 0x%x\\n\", *tpmSock );\n tpmService.sin_family = AF_INET;\n tpmService.sin_addr.s_addr = inet_addr( hostName );\n tpmService.sin_port = htons( port );\n\n if( serverSockets )\n {\n \n iResult = bind(*tpmSock, (SOCKADDR *) &tpmService, sizeof (tpmService));\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"bind failed with error %u\\n\", WSAGetLastError());\n closesocket(*tpmSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"bind to IP address:port: %s:%d\\n\", hostName, port );\n }\n\n iResult = listen( *tpmSock, 4 );\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"listen failed with error %u\\n\", WSAGetLastError());\n closesocket(*tpmSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"TPM CMD server listening to socket: 0x%x\\n\", *tpmSock );\n }\n }\n }\n\n if( !serverSockets )\n {\n \n iResult = connect(*otherSock, (SOCKADDR *) &otherService, sizeof (otherService));\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"connect function failed with error: %d\\n\", WSAGetLastError() );\n iResult = closesocket(*otherSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"Client connected to server on port: %d\\n\", port + 1 );\n }\n\n \n iResult = connect(*tpmSock, (SOCKADDR *) &tpmService, sizeof (tpmService));\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"connect function failed with error: %d\\n\", WSAGetLastError() );\n iResult = closesocket(*otherSock);\n if (iResult == SOCKET_ERROR)\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"closesocket function failed with error: %d\\n\", WSAGetLastError() );\n }\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"Client connected to server on port: %d\\n\", port );\n }\n }\n\n return 0;\n}\n"},"prefix":{"kind":"string","value":"#include <tcti/tcti_socket.h>\n#include \"debug.h\"\n#include \"sockets.h\"\n\n#ifndef _WIN32\nvoid WSACleanup() {}\nint WSAGetLastError() { return errno; }\n#endif\n\nvoid CloseSockets( SOCKET otherSock, SOCKET tpmSock)\n{\n closesocket(otherSock);\n closesocket(tpmSock);\n}\n\nTSS2_RC recvBytes( SOCKET tpmSock, unsigned char *data, int len )\n{\n int iResult = 0;\n int length;\n int bytesRead;\n\n for( bytesRead = 0, length = len; bytesRead != len; length -= iResult, bytesRead += iResult )\n {\n iResult = recv( tpmSock, (char *)&( data[bytesRead] ), length, 0);\n if ((iResult == SOCKET_ERROR) || (!iResult))\n return TSS2_TCTI_RC_IO_ERROR;\n }\n\n return TSS2_RC_SUCCESS;\n}\n\nTSS2_RC sendBytes( SOCKET tpmSock, const unsigned char *data, int len )\n{\n int iResult = 0;\n int sentLength = 0;\n\n for( sentLength = 0; sentLength < len; len -= iResult, sentLength += iResult )\n {\n iResult = send( tpmSock, (char *)data, len, MSG_NOSIGNAL );\n if (iResult == SOCKET_ERROR)\n return TSS2_TCTI_RC_IO_ERROR;\n }\n\n return TSS2_RC_SUCCESS;\n}\n\n#define SAFE_CALL(func, ...) (func != NULL) ? func(__VA_ARGS__) : 0\nint\nInitSockets( const char *hostName,\n UINT16 port,\n UINT8 serverSockets,\n SOCKET *otherSock,\n SOCKET *tpmSock,\n TCTI_LOG_CALLBACK debugfunc,\n void* data )\n{\n sockaddr_in otherService;\n sockaddr_in tpmService;\n int iResult = 0; \n\n#ifdef _WIN32\n WSADATA wsaData = {0};\n static UINT8 socketsEnabled = 0;\n\n if( socketsEnabled == 0 )\n {\n \n iResult = WSAStartup(MAKEWORD(2, 2), &wsaData);\n if (iResult != 0) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"WSAStartup failed: %d\\n\", iResult);\n return 1;\n }\n socketsEnabled = 1;\n }\n#endif\n *otherSock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n if (*otherSock == INVALID_SOCKET)\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket creation failed with error = %d\\n\", WSAGetLastError() );\n return(1);\n }\n else {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket created: 0x%x\\n\", *otherSock );\n otherService.sin_family = AF_INET;\n otherService.sin_addr.s_addr = inet_addr( hostName );\n otherService.sin_port = htons(port + 1);\n\n if( serverSockets )\n {\n \n iResult = bind(*otherSock, (SOCKADDR *) &otherService, sizeof (otherService));\n "},"suffix":{"kind":"string","value":"bind to IP address:port: %s:%d\\n\", hostName, port + 1 );\n }\n\n iResult = listen( *otherSock, 4 );\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"listen failed with error %u\\n\", WSAGetLastError());\n closesocket(*otherSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"Other CMD server listening to socket: 0x%x\\n\", *otherSock );\n }\n }\n }\n\n *tpmSock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n if (*tpmSock == INVALID_SOCKET)\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket creation failed with error = %d\\n\", WSAGetLastError() );\n closesocket( *otherSock );\n return(1);\n }\n else {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"socket created: 0x%x\\n\", *tpmSock );\n tpmService.sin_family = AF_INET;\n tpmService.sin_addr.s_addr = inet_addr( hostName );\n tpmService.sin_port = htons( port );\n\n if( serverSockets )\n {\n \n iResult = bind(*tpmSock, (SOCKADDR *) &tpmService, sizeof (tpmService));\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"bind failed with error %u\\n\", WSAGetLastError());\n closesocket(*tpmSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"bind to IP address:port: %s:%d\\n\", hostName, port );\n }\n\n iResult = listen( *tpmSock, 4 );\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"listen failed with error %u\\n\", WSAGetLastError());\n closesocket(*tpmSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"TPM CMD server listening to socket: 0x%x\\n\", *tpmSock );\n }\n }\n }\n\n if( !serverSockets )\n {\n \n iResult = connect(*otherSock, (SOCKADDR *) &otherService, sizeof (otherService));\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"connect function failed with error: %d\\n\", WSAGetLastError() );\n iResult = closesocket(*otherSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"Client connected to server on port: %d\\n\", port + 1 );\n }\n\n \n iResult = connect(*tpmSock, (SOCKADDR *) &tpmService, sizeof (tpmService));\n if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"connect function failed with error: %d\\n\", WSAGetLastError() );\n iResult = closesocket(*otherSock);\n if (iResult == SOCKET_ERROR)\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"closesocket function failed with error: %d\\n\", WSAGetLastError() );\n }\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"Client connected to server on port: %d\\n\", port );\n }\n }\n\n return 0;\n}\n"},"middle":{"kind":"string","value":" if (iResult == SOCKET_ERROR) {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \"bind failed with error %u\\n\", WSAGetLastError());\n closesocket(*otherSock);\n WSACleanup();\n return 1;\n }\n else\n {\n SAFE_CALL( debugfunc, data, NO_PREFIX, \""},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":" uint16_t port;\n","file_path":"include/tcti/tcti_socket.h","rank":0,"score":158306.02717439883},{"content":" const char *hostname;\n","file_path":"include/tcti/tcti_socket.h","rank":1,"score":127279.91855985833},{"content":" void *logData;\n","file_path":"include/tcti/tcti_socket.h","rank":2,"score":123489.09362518475},{"content":"\tTPM2B_SENSITIVE_DATA\tdata;\t /* data to be sealed */\n","file_path":"include/sapi/tss2_tpm2_types.h","rank":3,"score":112435.98324259827},{"content":"void Unmarshal_TPM2B_CREATION_DATA(\n\n\tTSS2_SYS_CONTEXT *sysContext,\n\n\tTPM2B_CREATION_DATA *creationData\n","file_path":"sysapi/include/sys_api_marshalUnmarshal.h","rank":4,"score":110970.98984524261},{"content":"void Unmarshal_TPMS_CREATION_DATA(\n\n\tTSS2_SYS_CONTEXT *sysContext,\n\n\tTPMS_CREATION_DATA *creationData\n","file_path":"sysapi/include/sys_api_marshalUnmarshal.h","rank":5,"score":110970.98984524261},{"content":"void Unmarshal_TPMS_CREATION_DATA(\n\n\tTSS2_SYS_CONTEXT *sysContext,\n\n\tTPMS_CREATION_DATA *creationData\n\n\t)\n\n{\n\n\tif( SYS_CONTEXT->rval != TSS2_RC_SUCCESS )\n\n\t\treturn;\n\n\n\n\tif( creationData == 0 )\n\n\t\treturn;\n\n\n\n\tUnmarshal_TPML_PCR_SELECTION( sysContext, &creationData->pcrSelect );\n\n\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->pcrDigest );\n\n\tUnmarshal_TPMA_LOCALITY( sysContext, &creationData->locality );\n\n\tUnmarshal_UINT16( SYS_CONTEXT->tpmOutBuffPtr, SYS_CONTEXT->maxResponseSize, &(SYS_CONTEXT->nextData), &creationData->parentNameAlg, &( SYS_CONTEXT->rval ) );\n\n\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->parentName );\n\n\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->parentQualifiedName );\n\n\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->outsideInfo );\n\n\n\n\treturn;\n","file_path":"sysapi/sysapi_util/Unmarshal_TPMS_CREATION_DATA.c","rank":6,"score":100637.13076407637},{"content":"void Unmarshal_TPM2B_CREATION_DATA(\n\n\tTSS2_SYS_CONTEXT *sysContext,\n\n\tTPM2B_CREATION_DATA *creationData\n\n\t)\n\n{\n\n\tif( SYS_CONTEXT->rval != TSS2_RC_SUCCESS )\n\n\t\treturn;\n\n\n\n\tif( creationData == 0 )\n\n\t\treturn;\n\n\n\n\tif( creationData->t.size != 0 )\n\n\t\tSYS_CONTEXT->rval = TSS2_SYS_RC_BAD_VALUE;\n\n\n\n\tUnmarshal_UINT16( SYS_CONTEXT->tpmOutBuffPtr, SYS_CONTEXT->maxResponseSize, &(SYS_CONTEXT->nextData), &creationData->t.size, &( SYS_CONTEXT->rval ) );\n\n\tUnmarshal_TPMS_CREATION_DATA( sysContext, &creationData->t.creationData );\n\n\n\n\treturn;\n","file_path":"sysapi/sysapi_util/Unmarshal_TPM2B_CREATION_DATA.c","rank":7,"score":100637.13076407637},{"content":"TPM2B_AUTH nullSessionHmac;\n","file_path":"test/common/sample/CreateNullSession.c","rank":8,"score":91025.12208684918},{"content":"void InitNullSession( TPMS_AUTH_COMMAND *nullSessionData )\n\n{\n\n if( nullSessionData )\n\n {\n\n\n\n nullSessionData->sessionHandle = TPM_RS_PW;\n\n\n\n // Init nonce.\n\n nullSessionData->nonce.t.size = 0;\n\n\n\n // init hmac\n\n nullSessionData->hmac.t.size = 0;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&( nullSessionData->sessionAttributes ) ) ) = 0;\n\n }\n","file_path":"test/common/sample/CreateNullSession.c","rank":9,"score":91025.12208684918},{"content":"TPM2B_NONCE nullSessionNonce;\n","file_path":"test/common/sample/CreateNullSession.c","rank":10,"score":91025.12208684918},{"content":"void\n\nmarshal_UINT16_rc_previous_fail (void **state)\n\n{\n\n /* Set 'rc' to an error condition. */\n\n TSS2_RC rc = TSS2_SYS_RC_BAD_SIZE;\n\n /* 'rc' is checked first, all other parameters can be NULL.*/\n\n Marshal_UINT16 (NULL, 0, NULL, 0, &rc);\n\n assert_int_equal (rc, TSS2_SYS_RC_BAD_SIZE);\n","file_path":"test/marshal-UINT16_unit.c","rank":11,"score":91020.97647783147},{"content":"void\n\nCheckDataPointers_null_nextData (void **state)\n\n{\n\n TSS2_RC rc;\n\n UINT8 *buffer = (UINT8*)5, *nextData = NULL;\n\n\n\n rc = CheckDataPointers (buffer, &nextData);\n\n assert_int_equal (rc, TSS2_SYS_RC_BAD_REFERENCE);\n","file_path":"test/CheckOverflow_unit.c","rank":12,"score":88953.41097364799},{"content":"void\n\nCheckDataPointers_null_nextData_ptr (void **state)\n\n{\n\n TSS2_RC rc;\n\n UINT8 *buffer = (UINT8*)5, **nextData = NULL;\n\n\n\n rc = CheckDataPointers (buffer, nextData);\n\n assert_int_equal (rc, TSS2_SYS_RC_BAD_REFERENCE);\n","file_path":"test/CheckOverflow_unit.c","rank":13,"score":87149.04724357736},{"content":"#define HOSTNAME_LENGTH 200\n\n\n","file_path":"tcti/tcti_device.c","rank":14,"score":86767.19747441878},{"content":"static UINT8 rmErrorDuringSend = 0;\n","file_path":"resourcemgr/resourcemgr.c","rank":15,"score":86751.25225012747},{"content":"void SendErrorResponse( SOCKET sock )\n\n{\n\n UINT32 numBytes = CHANGE_ENDIAN_DWORD( sizeof( TPM20_ErrorResponse ) );\n\n UINT32 trash = 0;\n\n\n\n rmSendBytes( sock, (unsigned char *)&numBytes, 4 );\n\n rmSendBytes( sock, (unsigned char *)&errorResponse, sizeof( TPM20_ErrorResponse ) );\n\n rmSendBytes( sock, (unsigned char *)&trash, 4 );\n","file_path":"resourcemgr/resourcemgr.c","rank":16,"score":86751.25225012747},{"content":"void CreateErrorResponse( TSS2_RC responseCode )\n\n{\n\n errorResponse.tag = CHANGE_ENDIAN_WORD( TPM_ST_NO_SESSIONS );\n\n errorResponse.responseSize = CHANGE_ENDIAN_DWORD( sizeof( TPM20_ErrorResponse ) );\n\n errorResponse.responseCode = CHANGE_ENDIAN_DWORD( responseCode );\n","file_path":"resourcemgr/resourcemgr.c","rank":17,"score":86722.4424288969},{"content":" uint16_t data_net;\n","file_path":"test/unmarshal-UINT16_unit.c","rank":18,"score":84076.44483446282},{"content":" uint16_t data_net;\n","file_path":"test/marshal-UINT16_unit.c","rank":19,"score":84076.44483446282},{"content":" uint16_t data_host;\n","file_path":"test/unmarshal-UINT16_unit.c","rank":20,"score":84076.44483446282},{"content":" uint16_t data_host;\n","file_path":"test/marshal-UINT16_unit.c","rank":21,"score":84076.44483446282},{"content":" UINT8 otherData;\n","file_path":"sysapi/include/sysapi_util.h","rank":22,"score":83786.04376025357},{"content":" UINT16 decryptNull:1; // Indicates that the decrypt param was NULL at _Prepare call.\n","file_path":"sysapi/include/sysapi_util.h","rank":23,"score":81589.13267512654},{"content":" TCTI_LOG_CALLBACK logCallback;\n","file_path":"include/tcti/tcti_socket.h","rank":24,"score":81521.83512387738},{"content":" UINT8 *nextData;\n","file_path":"sysapi/include/sysapi_util.h","rank":25,"score":81418.31787172599},{"content":"\tUINT8 otherData;\n","file_path":"include/sapi/sys_api_part3.h","rank":26,"score":81413.63278204601},{"content":" void *logData;\n","file_path":"sysapi/include/tcti_util.h","rank":27,"score":81413.63278204601},{"content":" void *logData;\n","file_path":"include/tcti/tcti_device.h","rank":28,"score":81413.63278204601},{"content":"\tUINT8\tsizeofSelect;\t /* the size in octets of the pcrSelect array */\n","file_path":"include/sapi/tss2_tpm2_types.h","rank":29,"score":79351.70351821468},{"content":"\tTPM2B_DIGEST\tcreationHash;\t /* creationHash */\n","file_path":"include/sapi/tss2_tpm2_types.h","rank":30,"score":79326.2234453517},{"content":" TCTI_LOG_BUFFER_CALLBACK logBufferCallback;\n","file_path":"include/tcti/tcti_socket.h","rank":31,"score":79277.09550779907},{"content":"\tUINT16\tdataSize;\t /* the size of the data areaThe maximum size is implementationdependent. The minimum maximum size is platformspecific. */\n","file_path":"include/sapi/tss2_tpm2_types.h","rank":32,"score":79171.87256508075},{"content":"\tTPM2B_DATA\textraData;\t /* external information supplied by callerNOTE\tA TPM2B_DATA structure provides room for a digest and a method indicator to indicate the components of the digest. The definition of this method indicator is outside the scope of this specification. */\n","file_path":"include/sapi/tss2_tpm2_types.h","rank":33,"score":79171.87256508075},{"content":"void\n\nCheckDataPointers_null_buffer (void **state)\n\n{\n\n TSS2_RC rc;\n\n UINT8 *buffer = NULL, *nextData = (UINT8*)5;\n\n\n\n rc = CheckDataPointers (buffer, &nextData);\n\n assert_int_equal (rc, TSS2_SYS_RC_BAD_REFERENCE);\n","file_path":"test/CheckOverflow_unit.c","rank":34,"score":77543.43393211071},{"content":"void Marshal_UINT8( UINT8 *inBuffPtr, UINT32 maxCommandSize, UINT8 **nextData, UINT8 value, TSS2_RC *rval );\n","file_path":"sysapi/include/sys_api_marshalUnmarshal.h","rank":35,"score":77223.46315242487},{"content":"void Unmarshal_UINT8( UINT8 *outBuffPtr, UINT32 maxResponseSize, UINT8 **nextData, UINT8 *value, TSS2_RC *rval );\n","file_path":"sysapi/include/sys_api_marshalUnmarshal.h","rank":36,"score":77223.46315242487},{"content":"TPM_RC Tss2_Sys_Create(\n\n TSS2_SYS_CONTEXT *sysContext,\n\n TPMI_DH_OBJECT\tparentHandle,\n\n TSS2_SYS_CMD_AUTHS const *cmdAuthsArray,\n\n TPM2B_SENSITIVE_CREATE\t*inSensitive,\n\n TPM2B_PUBLIC\t*inPublic,\n\n TPM2B_DATA\t*outsideInfo,\n\n TPML_PCR_SELECTION\t*creationPCR,\n\n TPM2B_PRIVATE\t*outPrivate,\n\n TPM2B_PUBLIC\t*outPublic,\n\n TPM2B_CREATION_DATA\t*creationData,\n\n TPM2B_DIGEST\t*creationHash,\n\n TPMT_TK_CREATION\t*creationTicket,\n\n TSS2_SYS_RSP_AUTHS *rspAuthsArray\n","file_path":"include/sapi/sys_api_part3.h","rank":37,"score":77195.18050723374},{"content":"void Unmarshal_UINT16( UINT8 *outBuffPtr, UINT32 maxResponseSize, UINT8 **nextData, UINT16 *value, TSS2_RC *rval );\n","file_path":"sysapi/include/sys_api_marshalUnmarshal.h","rank":38,"score":77184.58093877167},{"content":"void Marshal_UINT16( UINT8 *inBuffPtr, UINT32 maxCommandSize, UINT8 **nextData, UINT16 value, TSS2_RC *rval );\n","file_path":"sysapi/include/sys_api_marshalUnmarshal.h","rank":39,"score":77184.58093877167},{"content":"\tunsigned int sensitiveDataOrigin : 1;\t/* SET 1 Indicates that when the object was created with TPM2_Create or TPM2_CreatePrimary the TPM generated all of the sensitive data other than the authValue.CLEAR 0 A portion of the sensitive data other than the authValue was provided by the caller. */\n","file_path":"include/sapi/tss2_tpm2_types.h","rank":40,"score":77050.25974543695},{"content":"TPM_RC Tss2_Sys_CertifyCreation(\n\n TSS2_SYS_CONTEXT *sysContext,\n\n TPMI_DH_OBJECT\tsignHandle,\n\n TPMI_DH_OBJECT\tobjectHandle,\n\n TSS2_SYS_CMD_AUTHS const *cmdAuthsArray,\n\n TPM2B_DATA\t*qualifyingData,\n\n TPM2B_DIGEST\t*creationHash,\n\n TPMT_SIG_SCHEME\t*inScheme,\n\n TPMT_TK_CREATION\t*creationTicket,\n\n TPM2B_ATTEST\t*certifyInfo,\n\n TPMT_SIGNATURE\t*signature,\n\n TSS2_SYS_RSP_AUTHS *rspAuthsArray\n","file_path":"include/sapi/sys_api_part3.h","rank":41,"score":75185.68175743902},{"content":"TPM_RC Tss2_Sys_Create_Prepare(\n\n TSS2_SYS_CONTEXT *sysContext,\n\n TPMI_DH_OBJECT\tparentHandle,\n\n TPM2B_SENSITIVE_CREATE\t*inSensitive,\n\n TPM2B_PUBLIC\t*inPublic,\n\n TPM2B_DATA\t*outsideInfo,\n\n TPML_PCR_SELECTION\t*creationPCR\n","file_path":"include/sapi/sys_api_part3.h","rank":42,"score":75180.52602657302},{"content":"\n\nstatic TSS2_RC tctiRecvBytes( TSS2_TCTI_CONTEXT *tctiContext, SOCKET sock, unsigned char *data, int len )\n\n{\n\n TSS2_RC result = 0;\n\n result = recvBytes( sock, data, len);\n\n if ( (INT32)result == SOCKET_ERROR) {\n\n TCTI_LOG( tctiContext, NO_PREFIX, \"In recvBytes, recv failed (socket: 0x%x) with error: %d\\n\", sock, WSAGetLastError() );\n\n return TSS2_TCTI_RC_IO_ERROR;\n\n }\n\n#ifdef DEBUG_SOCKETS\n\n TCTI_LOG( tctiContext, NO_PREFIX, \"Receive Bytes from socket #0x%x: \\n\", sock );\n\n TCTI_LOG_BUFFER( tctiContext, NO_PREFIX, data, len );\n\n#endif\n\n\n\n return TSS2_RC_SUCCESS;\n\n}\n\n\n\nstatic TSS2_RC tctiSendBytes( TSS2_TCTI_CONTEXT *tctiContext, SOCKET sock, const unsigned char *data, int len )\n\n{\n\n TSS2_RC ret = TSS2_RC_SUCCESS;\n","file_path":"tcti/tcti_socket.cpp","rank":46,"score":45.435858222377185},{"content":"\n\n#ifdef DEBUG_SOCKETS\n\n TCTI_LOG( tctiContext, NO_PREFIX, \"Send Bytes to socket #0x%x: \\n\", sock );\n\n TCTI_LOG_BUFFER( tctiContext, NO_PREFIX, (UINT8 *)data, len );\n\n#endif\n\n\n\n ret = sendBytes( sock, data, len);\n\n if (ret != TSS2_RC_SUCCESS)\n\n TCTI_LOG( tctiContext, NO_PREFIX, \"In recvBytes, recv failed (socket: 0x%x) with error: %d\\n\", sock, WSAGetLastError() );\n\n return ret;\n\n}\n\n\n\nTSS2_RC SendSessionEndSocketTcti(\n\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\n\n UINT8 tpmCmdServer )\n\n{\n\n UINT32 tpmSendCommand = TPM_SESSION_END; // Value for \"send command\" to MS simulator.\n\n SOCKET sock;\n\n TSS2_RC rval = TSS2_RC_SUCCESS;\n\n\n","file_path":"tcti/tcti_socket.cpp","rank":51,"score":33.568600447719675},{"content":" return -3;\n\n }\n\n\n\n fclose(f);\n\n return 0;\n\n}\n\n\n\nvoid\n\nhexdump (unsigned long bse, UINT8 *buf, int len)\n\n{\n\n int pos;\n\n char line[80];\n\n\n\n while (len > 0)\n\n {\n\n int cnt, i;\n\n\n\n pos = snprintf (line, sizeof (line), \"%08lx \", bse);\n\n cnt = 16;\n\n if (cnt > len)\n","file_path":"test/tpmtcticlient/tpmtcticlient.cpp","rank":54,"score":32.415037983973754},{"content":"#endif\n\n\n\nextern TSS2_RC SocketSendTpmCommand(\n\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\n\n size_t command_size, /* in */\n\n uint8_t *command_buffer /* in */\n\n );\n\n\n\nTSS2_RC SocketReceiveTpmResponse(\n\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\n\n size_t *response_size, /* out */\n\n unsigned char *response_buffer, /* in */\n\n int32_t timeout\n\n );\n\n\n\nvoid TestCreate1()\n\n{\n\n UINT32 rval;\n\n TPM2B_SENSITIVE_CREATE inSensitive = { { sizeof( TPM2B_SENSITIVE_CREATE ) - 2, } };\n\n TPM2B_PUBLIC inPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\n","file_path":"test/tpmclient/tpmclient.cpp","rank":55,"score":30.182724943348088},{"content":" *size += count;\n\n left -= count;\n\n buf += count;\n\n }\n\n\n\n if( *size == 0 )\n\n {\n\n printf(\"File read error\\n\");\n\n fclose(f);\n\n return -3;\n\n }\n\n fclose(f);\n\n return 0;\n\n}\n\n\n\nint saveDataToFile(const char *fileName, UINT8 *buf, UINT16 size)\n\n{\n\n FILE *f;\n\n UINT16 count = 1;\n\n if( fileName == NULL || buf == NULL || size == 0 )\n","file_path":"test/tpmtcticlient/tpmtcticlient.cpp","rank":56,"score":29.72870968494607},{"content":"\n\nint loadDataFromFile(const char *fileName, UINT8 *buf, UINT16 *size)\n\n{\n\n UINT16 count = 1, left;\n\n FILE *f;\n\n if ( size == NULL || buf == NULL || fileName == NULL )\n\n return -1;\n\n\n\n f = fopen(fileName, \"rb+\");\n\n if( f == NULL )\n\n {\n\n printf(\"File(%s) open error.\\n\", fileName);\n\n return -2;\n\n }\n\n\n\n left = *size;\n\n *size = 0;\n\n while( left > 0 && count > 0 )\n\n {\n\n count = fread(buf, 1, left, f);\n","file_path":"test/tpmtcticlient/tpmtcticlient.cpp","rank":58,"score":28.832633248682853},{"content":" hashCheck.digest.t.size = 0;\n\n\n\n char SignMsg[]= \"try to get sign with this msg!\";\n\n UINT16 length = sizeof(SignMsg);\n\n BYTE *buffer = NULL;\n\n UINT8 numBuffers = 0;\n\n UINT16 cpLength = 0;\n\n\n\n buffer = (BYTE*)malloc(length*sizeof(BYTE));\n\n memset(buffer, 0, length*sizeof(BYTE));\n\n memcpy (buffer, SignMsg, length);\n\n if(length%(MAX_DIGEST_BUFFER) != 0)\n\n numBuffers = length/(MAX_DIGEST_BUFFER) + 1;\n\n else\n\n numBuffers = length/(MAX_DIGEST_BUFFER);\n\n\n\n TPM2B_DIGEST *bufferList[numBuffers];\n\n for(UINT8 i = 0; i < numBuffers; i++)\n\n {\n\n (bufferList)[i] = (TPM2B_DIGEST *)calloc(1,sizeof(TPM2B_DIGEST));\n","file_path":"test/tpmtest/tpmtest.cpp","rank":59,"score":25.795603977177784},{"content":" &creationHash, &creationTicket, &sessionsDataOut );\n\n CheckPassed( rval );\n\n printf( \"Name of created key: \" );\n\n PrintSizedBuffer( (TPM2B *)&name );\n\n\n\n rval = Tss2_Sys_Load ( sysContext, handle2048rsa, &sessionsData, &outPrivate, &outPublic,\n\n &loadedSha1KeyHandle, &name, &sessionsDataOut);\n\n CheckPassed( rval );\n\n\n\n printf( \"Name of loading key: \" );\n\n PrintSizedBuffer( (TPM2B *)&name );\n\n\n\n inScheme.scheme = TPM_ALG_RSASSA;\n\n inScheme.details.rsassa.hashAlg = TPM_ALG_SHA1;\n\n hashCheck.tag = TPM_ST_HASHCHECK;\n\n hashCheck.hierarchy = TPM_RH_NULL;\n\n hashCheck.digest.t.size = 0;\n\n\n\n char SignMsg[]= \"try to get sign with this msg!\";\n\n UINT16 length = sizeof(SignMsg);\n","file_path":"test/tpmtest/tpmtest.cpp","rank":60,"score":24.74464451935264},{"content":" DebugPrintf( NO_PREFIX, \"\\nLoaded key handle: %8.8x\\n\", loadedSha1KeyHandle );\n\n}\n\n\n\nvoid TestEvict()\n\n{\n\n TPM_RC rval = TPM_RC_SUCCESS;\n\n TPM2B_SENSITIVE_CREATE inSensitive = { { sizeof( TPM2B_SENSITIVE_CREATE ) - 2, } };\n\n TPM2B_DATA outsideInfo = { { sizeof( TPM2B_DATA ) - 2, } };\n\n TPML_PCR_SELECTION creationPCR;\n\n TPMS_AUTH_COMMAND sessionData;\n\n TPMS_AUTH_RESPONSE sessionDataOut;\n\n TSS2_SYS_CMD_AUTHS sessionsData;\n\n TSS2_SYS_RSP_AUTHS sessionsDataOut;\n\n\n\n TPM2B_PRIVATE outPrivate = { { sizeof( TPM2B_PRIVATE ) - 2, } };\n\n TPM2B_PUBLIC outPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\n\n TPM2B_CREATION_DATA creationData = { { sizeof( TPM2B_CREATION_DATA ) - 2, } };\n\n\tTPM2B_DIGEST creationHash = { { sizeof( TPM2B_DIGEST ) - 2, } };\n\n\tTPMT_TK_CREATION creationTicket = { 0, 0, { { sizeof( TPM2B_DIGEST ) - 2, } } };\n\n\n","file_path":"test/tpmclient/tpmclient.cpp","rank":61,"score":23.157465977308117},{"content":" BYTE *buffer = NULL;\n\n UINT8 numBuffers = 0;\n\n UINT16 cpLength = 0;\n\n\n\n buffer = (BYTE*)malloc(length*sizeof(BYTE));\n\n memset(buffer, 0, length*sizeof(BYTE));\n\n memcpy (buffer, SignMsg, length);\n\n\n\n if(length%(MAX_DIGEST_BUFFER) != 0)\n\n numBuffers = length/(MAX_DIGEST_BUFFER) + 1;\n\n else\n\n numBuffers = length/(MAX_DIGEST_BUFFER);\n\n\n\n TPM2B_DIGEST *bufferList[numBuffers];\n\n for(UINT8 i = 0; i < numBuffers; i++)\n\n {\n\n (bufferList)[i] = (TPM2B_DIGEST *)calloc(1,sizeof(TPM2B_DIGEST));\n\n if(i < numBuffers-1)\n\n {\n\n for( UINT16 m = 0; m < MAX_DIGEST_BUFFER; m++)\n","file_path":"test/tpmtest/tpmtest.cpp","rank":62,"score":22.99614400043099},{"content":"TSS2_SYS_CMD_AUTHS nullSessionsData = { 1, &nullSessionDataArray[0] };\n\nTSS2_SYS_RSP_AUTHS nullSessionsDataOut = { 1, &nullSessionDataOutArray[0] };\n\nTPM2B_NONCE nullSessionNonce, nullSessionNonceOut;\n\nTPM2B_AUTH nullSessionHmac;\n\n\n\nvoid CheckFailed( UINT32 rval, UINT32 expectedTpmErrorCode )\n\n{\n\n DebugPrintf( NO_PREFIX, \"\\tfailing case: \" );\n\n if ( rval != expectedTpmErrorCode) {\n\n ErrorHandler( rval);\n\n DebugPrintf( NO_PREFIX, \"\\tFAILED! Ret code s/b: %x, but was: %x\\n\", expectedTpmErrorCode, rval );\n\n Cleanup();\n\n }\n\n else\n\n {\n\n DebugPrintf( NO_PREFIX, \"\\tPASSED!\\n\" );\n\n }\n\n Delay(demoDelay);\n\n}\n\n\n","file_path":"test/tpmtest/tpmtest.cpp","rank":63,"score":22.77868735648474},{"content":" uint8_t responseBuffer[20];\n\n size_t responseSize;\n\n size_t expectedResponseSize;\n\n SOCKET savedTpmSock = 0;\n\n SOCKET savedOtherSock = 0;\n\n int savedDevFile = 0;\n\n uint64_t savedMagic;\n\n uint32_t savedVersion;\n\n uint8_t goodResponseBuffer[] = { 0x80, 0x01, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n uint8_t goodResponseBuffer1[] = { 0x80, 0x01, 0x00, 0x00, 0x00, 0x18, 0x00, 0x00, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00,\n\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\n\n uint8_t *goodRspBuffer;\n\n\n\n int responseBufferError = 0;\n\n unsigned int i;\n\n char *typeString;\n\n char typeRMString[] = \"RM\";\n\n char typeLocalString[] = \"Local TPM\";\n\n\n\n TSS2_RC rval = TSS2_RC_SUCCESS;\n","file_path":"test/tpmclient/tpmclient.cpp","rank":64,"score":22.69424306578029},{"content":"TPMS_AUTH_COMMAND nullSessionData;\n\nTPMS_AUTH_RESPONSE nullSessionDataOut;\n\nTPMS_AUTH_COMMAND *nullSessionDataArray[1] = { &nullSessionData };\n\nTPMS_AUTH_RESPONSE *nullSessionDataOutArray[1] = { &nullSessionDataOut };\n\nTSS2_SYS_CMD_AUTHS nullSessionsData = { 1, &nullSessionDataArray[0] };\n\nTSS2_SYS_RSP_AUTHS nullSessionsDataOut = { 1, &nullSessionDataOutArray[0] };\n\nTPM2B_NONCE nullSessionNonce, nullSessionNonceOut;\n\nTPM2B_AUTH nullSessionHmac;\n\n\n\nvoid CheckFailed( UINT32 rval, UINT32 expectedTpmErrorCode )\n\n{\n\n DebugPrintf( NO_PREFIX, \"\\tfailing case: \" );\n\n if ( rval != expectedTpmErrorCode) {\n\n ErrorHandler( rval);\n\n DebugPrintf( NO_PREFIX, \"\\tFAILED! Ret code s/b: %x, but was: %x\\n\", expectedTpmErrorCode, rval );\n\n Cleanup();\n\n }\n\n else\n\n {\n\n DebugPrintf( NO_PREFIX, \"\\tPASSED!\\n\" );\n","file_path":"test/tpmclient/tpmclient.cpp","rank":65,"score":22.53375884229746},{"content":" // init hmac\n\n sessionData.hmac.t.size = 0;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n sessionsData.cmdAuthsCount = 1;\n\n sessionsData.cmdAuths[0] = &sessionData;\n\n\n\n inPublic.t.publicArea.parameters.rsaDetail.keyBits = 2048;\n\n\n\n outPublic.t.size = 0;\n\n creationData.t.size = 0;\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_PLATFORM, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n\tprintf(\"\\nerrorcode: 0x%x\\n\", rval);\n\n CheckPassed( rval );\n\n}\n\nvoid TPM2Create()\n","file_path":"test/tpmtest/tpmtest.cpp","rank":66,"score":22.26102650798692},{"content":"### Changed\n\n- Fixed bug in CreatePrimary and Create: for one-call and decrypt session\n\ncase, they were copying first parameter from incorrect pointer.\n\n- For CopyCreationDataOut, CopyECCPointOut, CopyNvPublicOut, CopyPublicOut\n\nadded placeholder for return code if size != 0 when called. To be filled in\n\nwhen TSS WG decides on error code.\n\n- Fixed bugs in CopySensitiveCreateIn and CopySensitiveIn: they shouldn't look\n\nat the size.\n\n- Fixed bugs in CopyECCPointIn, CopyNvPublicIn, CopyPublicIn, CopySensitiveIn,\n\nand CopySensitiveCreateIn: not handling NULL outpul parameters correctly.\n\n- Changes all instances of calls to ExecuteFinish to a timeout that works for\n\nall cases including communicating with the simulator over the network.\n\n- Fixed call to LoadExternal in TestUnseal--needed to pass in a NULL pointer\n\nfor the inSensitive parameter.\n\n- Fixed bug in CreatePrimary: not passing correct pointer for inSensitive.\n\n- Fixed timeouts for all ExecuteFinish calls in test application.\n\n- Fixed bugs in RM: cases where I wasn't handling errors and then parsing data\n\nthat hadn't been received. Caused seg faults under Linux.\n\n- Fixed timeout for async Startup test.\n\n- Fixed SocketReceiveTpmResponse for blocking case.\n\n- Fixed bug in ExecuteFinish: BAD_SEQUENCE error generated early in function\n\nwas getting overwritten by INSUFFICENT_RESPONSE error.\n\n- Fixed bug in ExecuteFinish: it was always setting timeout to 0 instead of\n\nTSS2_TCTI_TIMEOUT_BLOCK.\n\n- Fixed bug in resource manager: error level for non-TPM errors was getting\n\noverwritten with resource manager error level.\n\n- Replace Implementation.h with implementation.h.\n\n- Changed name of TPMB.h tpmb.h\n\n- GetCapability with bad property returns different error code.\n\n- Shutdown with bad value for shutdownValue causes TPM to go into failure\n\nmode.\n\n- Fixed overlap in error codes: TSS2_BASE_RC_NOT_SUPPORTED and\n\nTSS2_BASE_RC_BAD_TCTI_STRUCTURE had same value.\n\n- Cleaned up all app level error codes.\n\n- Fixed bug with ordering of -startAuthSessionTest command line parameter: if\n\nit was not the last option, tpmclient would fail.\n\n- Fixed bugs related to ContextLoad.\n\n- Fixed bug in EvictContext: it was updating lastSessionSequenceNum even if\n\nthe ContextSave command failed.\n\n- Fixed handling of RM errors that occur during command send.\n\n- Fixed bug in simDriver init function. A second TCTI context being\n\ninitialized was re-initing the whole driver.\n\n- Updated to latest 1.19 header files.\n\n- Fixed bugs in resource manager:\n\n- FindOldestSession wasn't working correctly—it was just finding the first\n\none.\n\n- HandleGap needed to un-gap all the session contexts from the older interval.\n\nIt wasn't doing that.\n\n- Fixed bug in handling of command line options—specifying none would cause\n\nprogram to error out.\n\n- Fixed issues in cleanup of TestStartAuthSession test. It was leaving some\n\nsessions alive.\n\n- Updated copyright notices on all files.\n\n- Changed test app to use linked list of session structures instead of fixed\n\narray. This fixed a host of issues.\n\n- Fixed bugs in Certify, CertifyCreation, Commit, Create, CreatePrimary, and\n\nGetCapability: if null used for return parameters, the function would fail.\n\n- Fixed bug in SimpleHmacOrPolicyTest where it was re-creating the global\n\nsysContext causing failures in later tests because the context was too small.\n\n- Fixed a bug in ExecuteFinish. If response is too small, code was just using\n\nthe command buffer as the response buffer instead of returning an error.\n\n- Fixed some places in test app where I wasn't deleting entries from the\n\nsessions table.\n\n- Fixed build warnings related to size mismatch of connectionId.\n\n- Changed TeardownSysContext to zero out freed context pointer.\n\n- This helps prevent double free errors.\n\n- Fixed bug in EncryptDecryptXOR: wasn't setting the size of the outputData\n\nbuffer.\n","file_path":"CHANGELOG.md","rank":67,"score":22.24370271498811},{"content":"#endif\n\n , version, DEFAULT_HOSTNAME, DEFAULT_RESMGR_TPM_PORT );\n\n}\n\n\n\nint main(int argc, char* argv[])\n\n{\n\n int count;\n\n TSS2_RC rval;\n\n\n\n setvbuf (stdout, NULL, _IONBF, BUFSIZ);\n\n#ifdef SHARED_OUT_FILE\n\n if( argc > 12 )\n\n#else\n\n if( argc > 10 )\n\n#endif\n\n {\n\n PrintHelp();\n\n return 1;\n\n }\n\n else\n","file_path":"test/tpmclient/tpmclient.cpp","rank":68,"score":22.06915869818419},{"content":" &creationTicket, &name, &sessionsDataOut );\n\n CheckFailed( rval, TSS2_SYS_RC_BAD_VALUE );\n\n\n\n outPublic.t.size = 0;\n\n creationData.t.size = 0;\n\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\n\n INIT_SIMPLE_TPM2B_SIZE( name );\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n CheckPassed( rval );\n\n\n\n printf( \"\\nNew key successfully created in owner hierarchy (RSA 2048). Handle: 0x%8.8x\\n\",\n\n handle2048rsa );\n\n printf( \"Name of created primary key: \" );\n\n PrintSizedBuffer( (TPM2B *)&name );\n\n\n\n char buffer1contents[] = \"test\";\n\n //char buffer2contents[] = \"string\";\n\n\n","file_path":"test/tpmclient/tpmclient.cpp","rank":69,"score":22.056793526882135},{"content":" (pcrSelection).sizeofSelect = size;\n\n\n\nTPM_CC currentCommandCode;\n\nTPM_CC *currentCommandCodePtr = ¤tCommandCode;\n\n\n\n#define errorStringSize 200\n\nchar errorString[errorStringSize];\n\n\n\nUINT8 simulator = 1;\n\n\n\n#if __linux || __unix\n\nUINT8 testLocalTcti = 0;\n\n#endif\n\n\n\nUINT32 tpmMaxResponseLen = TPMBUF_LEN;\n\n\n\nUINT8 resMgrInitialized = 0;\n\n\n\nUINT8 pcrAfterExtend[20];\n\nTPM_HANDLE loadedRsaKeyHandle;\n","file_path":"test/tpmclient/tpmclient.cpp","rank":70,"score":21.856336634694713},{"content":"\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n sessionsData.cmdAuthsCount = 1;\n\n sessionsData.cmdAuths[0] = &sessionData;\n\n\n\n printf( \"\\nVERIFICATION on CREATED KEY TESTS:\\n\" );\n\n\n\n outPublic.t.size = 0;\n\n creationData.t.size = 0;\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n CheckPassed( rval );\n\n\n\n printf( \"\\nNew key successfully created in owner hierarchy (RSA 2048). Handle: 0x%8.8x\\n\",\n\n handle2048rsa );\n\n printf( \"Name of created primary key: \" );\n\n PrintSizedBuffer( (TPM2B *)&name );\n","file_path":"test/tpmtest/tpmtest.cpp","rank":71,"score":21.635365193570994},{"content":"void TestCreate()\n\n{\n\n UINT32 rval;\n\n TPM2B_SENSITIVE_CREATE inSensitive;\n\n TPM2B_PUBLIC inPublic;\n\n TPM2B_DATA outsideInfo;\n\n TPML_PCR_SELECTION creationPCR;\n\n TPMS_AUTH_COMMAND sessionData;\n\n TPMS_AUTH_RESPONSE sessionDataOut;\n\n TSS2_SYS_CMD_AUTHS sessionsData;\n\n\n\n TSS2_SYS_RSP_AUTHS sessionsDataOut;\n\n TPM2B_NAME name;\n\n TPM2B_NAME name1;\n\n TPM2B_PRIVATE outPrivate;\n\n TPM2B_PUBLIC outPublic;\n\n TPM2B_CREATION_DATA creationData;\n\n TPM2B_DIGEST creationHash;\n\n TPMT_TK_CREATION creationTicket = { 0, 0, { { sizeof( TPM2B_DIGEST ) - 2, } } };\n\n\n","file_path":"test/tpmtest/tpmtest.cpp","rank":72,"score":21.38676163365247},{"content":" // Do SAPI test for non-zero sized outPublic\n\n outPublic.t.size = 0xff;\n\n creationData.t.size = 0;\n\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\n\n INIT_SIMPLE_TPM2B_SIZE( name );\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_NULL, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n CheckFailed( rval, TSS2_SYS_RC_BAD_VALUE );\n\n\n\n#if 0\n\n // Do SAPI test for non-zero sized creationData\n\n outPublic.t.size = 0;\n\n creationData.t.size = 0x10;\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_PLATFORM, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n CheckFailed( rval, TSS2_SYS_RC_INSUFFICIENT_BUFFER );\n\n#endif\n\n\n","file_path":"test/tpmtest/tpmtest.cpp","rank":73,"score":21.071331155212324},{"content":" nvAuxSessionData.sessionHandle = TPM_RS_PW;\n\n\n\n // Init nonce.\n\n nvAuxSessionData.nonce.t.size = 0;\n\n\n\n // init hmac\n\n nvAuxSessionData.hmac.t.size = 0;\n\n\n\n // init nvAuth\n\n nvAuth.t.size = 0;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&nvAuxSessionData.sessionAttributes ) ) = 0;\n\n\n\n nvAuxSessionsData.cmdAuthsCount = 1;\n\n nvAuxSessionsData.cmdAuths[0] = &nvAuxSessionData;\n\n\n\n publicInfo.t.size = sizeof( TPMI_RH_NV_INDEX ) +\n\n sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\n\n sizeof( UINT16 );\n","file_path":"test/tpmtest/tpmtest.cpp","rank":74,"score":20.864931298901286},{"content":"{\n\n DebugPrintf( NO_PREFIX, \"\\tpassing case: \" );\n\n if ( rval != TPM_RC_SUCCESS) {\n\n ErrorHandler( rval);\n\n// printf( \"\\tFAILED! %s\\n\", errorString );\n\n\t\tDebugPrintf( NO_PREFIX, \"\\tFAILED! %s\\n\", errorString );\n\n Cleanup();\n\n }\n\n else\n\n {\n\n printf( \"\\tPASSED!\\n\" );\n\n }\n\n\n\n Delay(demoDelay);\n\n}\n\n\n\nTPMS_AUTH_COMMAND nullSessionData;\n\nTPMS_AUTH_RESPONSE nullSessionDataOut;\n\nTPMS_AUTH_COMMAND *nullSessionDataArray[1] = { &nullSessionData };\n\nTPMS_AUTH_RESPONSE *nullSessionDataOutArray[1] = { &nullSessionDataOut };\n","file_path":"test/tpmtest/tpmtest.cpp","rank":75,"score":20.755205188235205},{"content":" *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n sessionsDataOut.rspAuthsCount = 1;\n\n\n\n sessionsData.cmdAuthsCount = 1;\n\n sessionsData.cmdAuths[0] = &sessionData;\n\n\n\n nvAuth.t.size = strlen( password );\n\n for( i = 0; i < nvAuth.t.size; i++ )\n\n nvAuth.t.buffer[i] = password[i];\n\n\n\n\tpublicInfo.t.size = sizeof( TPMI_RH_NV_INDEX ) +\n\n sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\n\n sizeof( UINT16 );\n\n publicInfo.t.nvPublic.nvIndex = nvIndex;\n\n publicInfo.t.nvPublic.nameAlg = TPM_ALG_SHA1;\n\n\n\n // First zero out attributes.\n\n *(UINT32 *)&( publicInfo.t.nvPublic.attributes ) = 0;\n\n\n","file_path":"test/tpmtest/tpmtest.cpp","rank":76,"score":20.67895423472946},{"content":"TPM_HANDLE loadedSha1KeyHandle;\n\n\n\nTPM2B_AUTH loadedSha1KeyAuth;\n\n\n\nTPM_HANDLE handle1024, handle2048sha1, handle2048rsa;\n\n\n\nUINT32 passCount = 1;\n\nUINT32 demoDelay = 0;\n\nint debugLevel = 0;\n\nUINT8 indent = 0;\n\n\n\nTSS2_SYS_CONTEXT *sysContext;\n\n\n\nTCTI_SOCKET_CONF rmInterfaceConfig = {\n\n DEFAULT_HOSTNAME,\n\n DEFAULT_RESMGR_TPM_PORT,\n\n DebugPrintfCallback,\n\n DebugPrintBufferCallback,\n\n NULL\n\n};\n","file_path":"test/tpmclient/tpmclient.cpp","rank":77,"score":20.593002850429254},{"content":" TPM2B_PRIVATE outPrivate = { { sizeof( TPM2B_PRIVATE ) - 2, } };\n\n TPM2B_PUBLIC outPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\n\n TPM2B_CREATION_DATA creationData = { { sizeof( TPM2B_CREATION_DATA ) - 2, } };\n\n\tTPM2B_DIGEST creationHash = { { sizeof( TPM2B_DIGEST ) - 2, } };\n\n\tTPMT_TK_CREATION creationTicket = { 0, 0, { { sizeof( TPM2B_DIGEST ) - 2, } } };\n\n\n\n TPMS_AUTH_COMMAND *sessionDataArray[1];\n\n TPMS_AUTH_RESPONSE *sessionDataOutArray[1];\n\n\n\n sessionDataArray[0] = &sessionData;\n\n sessionDataOutArray[0] = &sessionDataOut;\n\n\n\n sessionsDataOut.rspAuths = &sessionDataOutArray[0];\n\n sessionsData.cmdAuths = &sessionDataArray[0];\n\n\n\n sessionsDataOut.rspAuthsCount = 1;\n\n\n\n DebugPrintf( NO_PREFIX, \"\\nCREATE, CREATE PRIMARY, and LOAD TESTS:\\n\" );\n\n\n\n inSensitive.t.sensitive.userAuth = loadedSha1KeyAuth;\n","file_path":"test/tpmclient/tpmclient.cpp","rank":78,"score":20.49705406113036},{"content":"\n\n writeData.t.size = sizeof( writeDataString );\n\n memcpy( (void *)&writeData.t.buffer, (void *)&writeDataString,\n\n sizeof( writeDataString ) );\n\n\n\n\n\n // Create NV index with empty auth value.\n\n *(UINT32 *)( (void *)&nvAttributes ) = 0;\n\n nvAttributes.TPMA_NV_AUTHREAD = 1;\n\n nvAttributes.TPMA_NV_AUTHWRITE = 1;\n\n nvAttributes.TPMA_NV_PLATFORMCREATE = 1;\n\n\n\n // No authorization required.\n\n authPolicy.t.size = 0;\n\n nvAuth.t.size = 0;\n\n rval = DefineNvIndex( TPM_RH_PLATFORM, TPM_RS_PW,\n\n &nvAuth, &authPolicy, TPM20_INDEX_TEST1,\n\n TPM_ALG_SHA1, nvAttributes,\n\n sizeof( writeDataString ) );\n\n\n","file_path":"test/tpmclient/tpmclient.cpp","rank":79,"score":20.45287633428048},{"content":" CopySizedByteBuffer( &publicInfo.t.nvPublic.authPolicy.b, &authPolicy->b );\n\n publicInfo.t.nvPublic.dataSize = size;\n\n publicInfo.t.size = sizeof( TPMI_RH_NV_INDEX ) +\n\n sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\n\n sizeof( UINT16 );\n\n publicInfo.t.nvPublic.nvIndex = nvIndex;\n\n publicInfo.t.nvPublic.nameAlg = nameAlg;\n\n\n\n // Create the index\n\n rval = Tss2_Sys_NV_DefineSpace( sysContext, authHandle, &sessionsData, auth, &publicInfo, &sessionsDataOut );\n\n\n\n return rval;\n\n}\n\n\n\ntypedef struct {\n\n char name[50];\n\n TPM_RC (*buildPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *trialPolicySession, TPM2B_DIGEST *policyDigest );\n\n TPM_RC (*createObjectFn )( TSS2_SYS_CONTEXT *sysContext, SESSION **policySession, TPM2B_DIGEST *policyDigest );\n\n TPM_RC (*testPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *policySession );\n\n} POLICY_TEST_SETUP;\n","file_path":"test/tpmclient/tpmclient.cpp","rank":80,"score":20.446472996623328},{"content":"\n\n // Now undefine the index so that next run will work correctly.\n\n rval = Tss2_Sys_NV_UndefineSpace( sysContext, TPM_RH_PLATFORM, TPM20_INDEX_TEST1, &sessionsData, 0 );\n\n CheckPassed( rval );\n\n}\n\n\n\nTPM2B_PUBLIC inPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\n\n\n\nvoid TestCreate(){\n\n UINT32 rval;\n\n TPM2B_SENSITIVE_CREATE inSensitive = { { sizeof( TPM2B_SENSITIVE_CREATE ) - 2, } };\n\n TPM2B_DATA outsideInfo = { { sizeof( TPM2B_DATA ) - 2, } };\n\n TPML_PCR_SELECTION creationPCR;\n\n TPMS_AUTH_COMMAND sessionData;\n\n TPMS_AUTH_RESPONSE sessionDataOut;\n\n TSS2_SYS_CMD_AUTHS sessionsData;\n\n\n\n TSS2_SYS_RSP_AUTHS sessionsDataOut;\n\n\tTPM2B_NAME name = { { sizeof( TPM2B_NAME ) - 2, } };\n\n\tTPM2B_NAME name1 = { { sizeof( TPM2B_NAME ) - 2, } };\n","file_path":"test/tpmclient/tpmclient.cpp","rank":81,"score":20.442432409706278},{"content":" outPublic.t.size = 0;\n\n creationData.t.size = 0;\n\n creationPCR.count = 0;\n\n //outPublic.t.publicArea.authPolicy.t.size = sizeof( TPM2B_DIGEST ) - 2;\n\n //outPublic.t.publicArea.unique.keyedHash.t.size = sizeof( TPM2B_DIGEST ) - 2;\n\n //INIT_SIMPLE_TPM2B_SIZE( creationHash );\n\n //INIT_SIMPLE_TPM2B_SIZE( name );\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_NULL, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n CheckPassed( rval );\n\n\n\n printf( \"\\nNew key successfully created (RSA 2048). Handle: 0x%8.8x\\n\",\n\n handle2048rsa );\n\n\n\n rval = Tss2_Sys_ContextSave(sysContext, handle2048rsa, &context);\n\n CheckPassed(rval);\n\n\n\n rval = Tss2_Sys_ContextLoad(sysContext, &context, &symHandle);\n\n CheckPassed(rval);\n","file_path":"test/tpmtest/tpmtest.cpp","rank":82,"score":20.16878952894868},{"content":" }\n\n}\n\nvoid PrintCreateTestDescription()\n\n{\n\n printf(\" CreatePrimary Case(primaryHandle:TPM_RH_PLATFORM,authArray:{1,{sessionHandle:TPM_RS_PW}},outPublic.t.size:0xff,creationData.t.size:0):Failed(0x8000b)\\n\"\n\n \" CreatePrimary Case(primaryHandle:TPM_RH_PLATFORM,authArray:{1,{sessionHandle:TPM_RS_PW}},outPublic.t.size:0,creationData.t.size:0xff):Failed(0x8000b)\\n\"\n\n \" CreatePrimary Case(primaryHandle:TPM_RH_PLATFORM,authArray:{1,{sessionHandle:TPM_RS_PW}},outPublic.t.size:0,creationData.t.size:0):Passed\\n\"\n\n \" Create Case(parentHandle:handle2048rsa,authArray:{1,{sessionHandle:TPM_RS_PW,hmac:{2,{0x00,0xff}}}}):Passed\\n\"\n\n \" Load Case(parentHandle:handle2048rsa,authArray:{1,{sessionHandle:TPM_RS_PW,hmac:{2,{0x00,0xff}}}},&outPrivate, &outPublic):Passed\\n\"\n\n \" HandleToNameFunctionPtr Case(loadedSha1KeyHandle,name1):Passed\\n\"\n\n \" CompareTPM2B Case(name.b,name1.b):Passed\\n\");\n\n}\n\nvoid PrintNVTestDescription()\n\n{\n\n printf(\" NV_Read Case(authHandle:TPM_RH_PLATFORM,nvIndex:0x1500015,Size:32,authArray:{1,{TPM_RS_PW}}):Failed(0x28B)\\n\"\n\n \" NV_DefineSpace Case(authHandle:TPM_RH_PLATFORM,nvAuth:{20,{0,...19}},publicInfo:{nvIndex:0x1500015,\"\n\n \"authPolicy:{0},attribute:0x40014001}):Passed\\n\"\n\n \" NV_ReadPublic Case(nvIndex:0x1500015,nvPublic:0):Passed\\n\"\n\n \" NV_Read Case(auHandle:TPM_RH_PLATFORM,nvIndex:0x1500015,dataSize:32):Failed(0x14A)\\n\"\n\n \" NV_DefineSpace Case(authHandle:TPM_RH_PLATFORM,nvAuth:{20,{0,...19}},publicInfo:{nvIndex:0x1500015,\"\n","file_path":"test/tpmtest/tpmtest.cpp","rank":83,"score":20.16533728660592},{"content":" rval = tctiSendBytes( tctiContext, TCTI_CONTEXT_INTEL->tpmSock, (unsigned char *)&tpmSendCommand, 4 );\n\n if( rval != TSS2_RC_SUCCESS )\n\n goto returnFromSocketSendTpmCommand;\n\n\n\n // Send the locality\n\n locality = (UINT8)( (TSS2_TCTI_CONTEXT_INTEL *)tctiContext)->status.locality;\n\n rval = tctiSendBytes( tctiContext, TCTI_CONTEXT_INTEL->tpmSock, (unsigned char *)&locality, 1 );\n\n if( rval != TSS2_RC_SUCCESS )\n\n goto returnFromSocketSendTpmCommand;\n\n\n\n#ifdef DEBUG\n\n if( ((TSS2_TCTI_CONTEXT_INTEL *)tctiContext )->status.debugMsgEnabled == 1 )\n\n {\n\n TCTI_LOG( tctiContext, rmPrefix, \"Locality = %d\", ( (TSS2_TCTI_CONTEXT_INTEL *)tctiContext)->status.locality );\n\n }\n\n#endif\n\n\n\n // Send number of bytes.\n\n cnt1 = cnt;\n\n cnt = CHANGE_ENDIAN_DWORD(cnt);\n","file_path":"tcti/tcti_socket.cpp","rank":84,"score":19.884049674359552},{"content":"// TCTI_LOG( tctiContext, NO_PREFIX, \"%s sent cancel OFF command:\\n\", interfaceName );\n\n }\n\n\n\nretSocketReceiveTpmResponse:\n\n if( rval == TSS2_RC_SUCCESS &&\n\n\t\tresponse_buffer != NULL )\n\n {\n\n ((TSS2_TCTI_CONTEXT_INTEL *)tctiContext)->previousStage = TCTI_STAGE_RECEIVE_RESPONSE;\n\n }\n\n\n\n return rval;\n\n}\n\n\n\n#ifdef __cplusplus\n\n}\n\n#endif\n\n\n\n#define HOSTNAME_LENGTH 200\n\n#define PORT_LENGTH 4\n\n\n","file_path":"tcti/tcti_socket.cpp","rank":85,"score":19.81422695392105},{"content":" sessionsData.cmdAuthsCount = 1;\n\n sessionsData.cmdAuths[0] = &sessionData;\n\n\n\n printf( \"\\nVERIFICATION on PUBLIC LOADED KEY TESTS:\\n\" );\n\n\n\n outPublic.t.size = 0;\n\n creationData.t.size = 0;\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n CheckPassed( rval );\n\n\n\n printf( \"\\nNew key successfully created in owner hierarchy (RSA 2048). Handle: 0x%8.8x\\n\",\n\n handle2048rsa );\n\n printf( \"Name of created primary key: \" );\n\n PrintSizedBuffer( (TPM2B *)&name );\n\n\n\n outPublic.t.size = 0;\n\n creationData.t.size = sizeof( TPM2B_CREATION_DATA ) - 2;\n\n outPublic.t.publicArea.authPolicy.t.size = sizeof( TPM2B_DIGEST ) - 2;\n","file_path":"test/tpmtest/tpmtest.cpp","rank":86,"score":19.69070732874482},{"content":" if( tpmCmdServer )\n\n {\n\n sock = TCTI_CONTEXT_INTEL->tpmSock;\n\n }\n\n else\n\n {\n\n sock = TCTI_CONTEXT_INTEL->otherSock;\n\n }\n\n\n\n tpmSendCommand = CHANGE_ENDIAN_DWORD(tpmSendCommand);\n\n rval = tctiSendBytes( tctiContext, sock, (char unsigned *)&tpmSendCommand, 4 );\n\n\n\n return( rval );\n\n}\n\n\n\nTSS2_RC SocketSendTpmCommand(\n\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\n\n size_t command_size, /* in */\n\n uint8_t *command_buffer /* in */\n\n )\n","file_path":"tcti/tcti_socket.cpp","rank":87,"score":19.617609749982677},{"content":" const char sensitiveData[] = \"this is sensitive\";\n\n\n\n// printf( \"\\nUNSEAL TEST :\\n\" );\n\n\n\n sessionData.sessionHandle = TPM_RS_PW;\n\n\n\n // Init nonce.\n\n sessionData.nonce.t.size = 0;\n\n\n\n sessionData.hmac.t.size = 2;\n\n sessionData.hmac.t.buffer[0] = 0x00;\n\n sessionData.hmac.t.buffer[1] = 0xff;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n inSensitive.t.sensitive.userAuth.t.size = sizeof( authStr ) - 1;\n\n memcpy( &( inSensitive.t.sensitive.userAuth.t.buffer[0] ), authStr, sizeof( authStr ) - 1 );\n\n inSensitive.t.sensitive.data.t.size = sizeof( sensitiveData ) - 1;\n\n memcpy( &( inSensitive.t.sensitive.data.t.buffer[0] ), sensitiveData, sizeof( sensitiveData ) - 1 );\n","file_path":"test/tpmtest/tpmtest.cpp","rank":88,"score":19.614718056002335},{"content":"TPM_CC currentCommandCode;\n\nTPM_CC *currentCommandCodePtr = ¤tCommandCode;\n\n\n\n//----\n\n//char errorString[200];\n\n//----\n\n\n\n//+++\n\n#define errorStringSize 200\n\nchar errorString[errorStringSize];\n\n\n\nUINT8 simulator = 1;\n\n//+++\n\n\n\nUINT32 tpmMaxResponseLen = TPMBUF_LEN;\n\n\n\nUINT8 pcrAfterExtend[20];\n\nTPM_HANDLE loadedRsaKeyHandle;\n\nTPM_HANDLE loadedSha1KeyHandle;\n\n\n","file_path":"test/tpmtest/tpmtest.cpp","rank":89,"score":19.60744659449611},{"content":" TPM2B_NAME name;\n\n TPM2B_NAME qualifiedName;\n\n UINT8 commandCode[4];\n\n size_t\t\t\t\trpBufferUsedSize;\n\n\tconst uint8_t \t\t*rpBuffer;\n\n\tconst uint8_t \t\tgoodRpBuffer[] = { 0x01, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00,\n\n 0x01, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00,\n\n\t\t\t\t\t\t\t\t\t\t 0x40 };\n\n TPMI_YES_NO moreData;\n\n TPMS_CAPABILITY_DATA\tcapabilityData;\n\n int rpBufferError = 0;\n\n unsigned int i;\n\n UINT32 savedRspSize;\n\n\n\n DebugPrintf( NO_PREFIX, \"\\nSAPI API TESTS:\\n\" );\n\n\n\n //\n\n // First test the one-call interface.\n\n //\n\n rval = Tss2_Sys_GetTestResult( sysContext, 0, &outData, &testResult, 0 );\n","file_path":"test/tpmclient/tpmclient.cpp","rank":90,"score":19.55135387712727},{"content":" sessionData.nonce.t.size = 0;\n\n\n\n // init hmac\n\n sessionData.hmac.t.size = 2;\n\n sessionData.hmac.t.buffer[0] = 0x00;\n\n sessionData.hmac.t.buffer[1] = 0xff;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n qualifyingData.t.size = sizeof( qualDataString );\n\n memcpy( &( qualifyingData.t.buffer[0] ), qualDataString, sizeof( qualDataString ) );\n\n\n\n inScheme.scheme = TPM_ALG_NULL;\n\n\n\n pcrSelection.count = 1;\n\n pcrSelection.pcrSelections[0].hash = TPM_ALG_SHA1;\n\n pcrSelection.pcrSelections[0].sizeofSelect = 3;\n\n\n\n // Clear out PCR select bit field\n","file_path":"test/tpmclient/tpmclient.cpp","rank":91,"score":19.398018350844623},{"content":" sessionData.nonce.t.size = 0;\n\n\n\n // init hmac\n\n sessionData.hmac.t.size = 0;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n sessionsData.cmdAuthsCount = 1;\n\n sessionsData.cmdAuths[0] = &sessionData;\n\n\n\n inPublic.t.publicArea.parameters.rsaDetail.keyBits = 2048;\n\n\n\n // Do SAPI test for non-zero sized outPublic\n\n outPublic.t.size = 0xff;\n\n creationData.t.size = 0;\n\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\n\n INIT_SIMPLE_TPM2B_SIZE( name );\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n","file_path":"test/tpmclient/tpmclient.cpp","rank":92,"score":19.322056245939347},{"content":"\n\n // first way is to use as command parameter.\n\n *(UINT8 *)( (void *)&locality ) = 0;\n\n locality.TPM_LOC_THREE = 1;\n\n rval = Tss2_Sys_PolicyLocality( sysContext, badSessionHandle, 0, locality, 0 );\n\n CheckFailed( rval, TSS2_RESMGRTPM_ERROR_LEVEL + TPM_RC_HANDLE + ( 1 << 8 ) );\n\n\n\n // Second way is to use as handle in session area.\n\n rval = Tss2_Sys_PolicyLocality( sysContext, sessions[0]->sessionHandle, &sessionsDataIn, locality, 0 );\n\n CheckFailed( rval, TSS2_RESMGRTPM_ERROR_LEVEL + TPM_RC_VALUE + TPM_RC_S + ( 1 << 8 ) );\n\n\n\n // clean up the sessions that I don't want here.\n\n#ifdef DEBUG_GAP_HANDLING\n\n for( i = 0; i < ( debugMaxActiveSessions*3); i++ )\n\n#else\n\n for( i = 0; i < ( sizeof(sessions) / sizeof (SESSION *)); i++ )\n\n#endif\n\n {\n\n// DebugPrintf( NO_PREFIX, \"i(2) = 0x%4.4x\\n\", i );\n\n rval = Tss2_Sys_FlushContext( sysContext, sessions[i]->sessionHandle );\n","file_path":"test/tpmclient/tpmclient.cpp","rank":93,"score":19.321718790589944},{"content":" sessionData.hmac.t.size = 2;\n\n sessionData.hmac.t.buffer[0] = 0x00;\n\n sessionData.hmac.t.buffer[1] = 0xff;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n inSensitive.t.sensitive.userAuth.t.size = sizeof( authStr ) - 1;\n\n memcpy( &( inSensitive.t.sensitive.userAuth.t.buffer[0] ), authStr, sizeof( authStr ) - 1 );\n\n inSensitive.t.sensitive.data.t.size = sizeof( sensitiveData ) - 1;\n\n memcpy( &( inSensitive.t.sensitive.data.t.buffer[0] ), sensitiveData, sizeof( sensitiveData ) - 1 );\n\n\n\n inPublic.t.publicArea.authPolicy.t.size = 0;\n\n\n\n inPublic.t.publicArea.unique.keyedHash.t.size = 0;\n\n\n\n outsideInfo.t.size = 0;\n\n creationPCR.count = 0;\n\n\n\n inPublic.t.publicArea.type = TPM_ALG_KEYEDHASH;\n","file_path":"test/tpmtest/tpmtest.cpp","rank":94,"score":19.257582434132676},{"content":" sessionData.hmac.t.buffer[1] = 0xff;\n\n\n\n // Init session attributes\n\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\n\n\n\n inSensitive.t.sensitive.userAuth.t.size = sizeof( authStr ) - 1;\n\n memcpy( &( inSensitive.t.sensitive.userAuth.t.buffer[0] ), authStr, sizeof( authStr ) - 1 );\n\n inSensitive.t.sensitive.data.t.size = sizeof( sensitiveData ) - 1;\n\n memcpy( &( inSensitive.t.sensitive.data.t.buffer[0] ), sensitiveData, sizeof( sensitiveData ) - 1 );\n\n\n\n inPublic.t.publicArea.authPolicy.t.size = 0;\n\n\n\n inPublic.t.publicArea.unique.keyedHash.t.size = 0;\n\n\n\n outsideInfo.t.size = 0;\n\n creationPCR.count = 0;\n\n\n\n inPublic.t.publicArea.type = TPM_ALG_KEYEDHASH;\n\n inPublic.t.publicArea.nameAlg = TPM_ALG_SHA1;\n\n\n","file_path":"test/tpmclient/tpmclient.cpp","rank":95,"score":19.18903555876977},{"content":" sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\n\n sizeof( UINT16 );\n\n publicInfo.t.nvPublic.nvIndex = nvIndex;\n\n publicInfo.t.nvPublic.nameAlg = nameAlg;\n\n\n\n // Create the index\n\n rval = Tss2_Sys_NV_DefineSpace( sysContext, authHandle, &sessionsData, auth, &publicInfo, &sessionsDataOut );\n\n\n\n return rval;\n\n}\n\n\n\ntypedef struct {\n\n char name[50];\n\n TPM_RC (*buildPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *trialPolicySession, TPM2B_DIGEST *policyDigest );\n\n TPM_RC (*createObjectFn )( TSS2_SYS_CONTEXT *sysContext, SESSION **policySession, TPM2B_DIGEST *policyDigest );\n\n TPM_RC (*testPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *policySession );\n\n} POLICY_TEST_SETUP;\n\n\n\nTPM_RC BuildPolicy( TSS2_SYS_CONTEXT *sysContext, SESSION **policySession,\n\n TPM_RC (*buildPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *policySession, TPM2B_DIGEST *policyDigest ),\n","file_path":"test/tpmtest/tpmtest.cpp","rank":96,"score":19.119447482583155},{"content":" &outPrivate, &outPublic, &creationData,\n\n &creationHash, &creationTicket, &sessionsDataOut );\n\n CheckPassed( rval );\n\n printf( \"Name of created key: \" );\n\n PrintSizedBuffer( (TPM2B *)&name );\n\n\n\n rval = Tss2_Sys_Load ( sysContext, handle2048rsa, &sessionsData, &outPrivate, &outPublic,\n\n &loadedSha1KeyHandle, &name, &sessionsDataOut);\n\n CheckPassed( rval );\n\n\n\n printf( \"Name of loading key: \" );\n\n PrintSizedBuffer( (TPM2B *)&name );\n\n\n\n printf( \"\\nLoaded key handle: %8.8x\\n\", loadedSha1KeyHandle );\n\n\n\n char buffer1contents[] = \"test\";\n\n TPMT_RSA_DECRYPT inScheme;\n\n TPM2B_PUBLIC_KEY_RSA message = { { sizeof(TPM2B_PUBLIC_KEY_RSA)-2, } };\n\n TPM2B_PUBLIC_KEY_RSA messageOut = { { sizeof(TPM2B_PUBLIC_KEY_RSA)-2, } };\n\n TPM2B_PUBLIC_KEY_RSA outData = { { sizeof(TPM2B_PUBLIC_KEY_RSA)-2, } };\n","file_path":"test/tpmtest/tpmtest.cpp","rank":97,"score":19.08778264231395},{"content":" inPublic.t.publicArea.parameters.rsaDetail.symmetric.mode.aes = TPM_ALG_CFB;\n\n inPublic.t.publicArea.parameters.rsaDetail.scheme.scheme = TPM_ALG_NULL;\n\n inPublic.t.publicArea.parameters.rsaDetail.keyBits = 2048;\n\n inPublic.t.publicArea.parameters.rsaDetail.exponent = 0;\n\n\n\n inPublic.t.publicArea.unique.rsa.t.size = 0;\n\n\n\n outsideInfo.t.size = 0;\n\n\n\n // This one should fail, because a different context is trying to use the primary object.\n\n outPublic.t.size = 0;\n\n creationData.t.size = 0;\n\n INIT_SIMPLE_TPM2B_SIZE( outPrivate );\n\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\n\n rval = Tss2_Sys_Create( otherSysContext, handle2048rsa, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR,\n\n &outPrivate, &outPublic, &creationData,\n\n &creationHash, &creationTicket, &sessionsDataOut );\n\n CheckFailed( rval, TSS2_RESMGR_UNOWNED_HANDLE );\n\n\n","file_path":"test/tpmtest/tpmtest.cpp","rank":98,"score":19.010453740920124},{"content":" outPublic.t.size = 0;\n\n creationData.t.size = 0;\n\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\n\n INIT_SIMPLE_TPM2B_SIZE( name );\n\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_NULL, &sessionsData, &inSensitive, &inPublic,\n\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\n\n &creationTicket, &name, &sessionsDataOut );\n\n CheckPassed( rval );\n\n\n\n printf( \"\\nNew key successfully created in NULL hierarchy (RSA 2048). Handle: 0x%8.8x\\n\",\n\n handle2048rsa );\n\n\n\n sessionData.hmac.t.size = 2;\n\n sessionData.hmac.t.buffer[0] = 0x00;\n\n sessionData.hmac.t.buffer[1] = 0xff;\n\n\n\n inPublic.t.publicArea.type = TPM_ALG_KEYEDHASH;\n\n inPublic.t.publicArea.objectAttributes.decrypt = 0;\n\n inPublic.t.publicArea.objectAttributes.sign = 1;\n\n\n","file_path":"test/tpmtest/tpmtest.cpp","rank":99,"score":18.883660367005568}],"string":"[\n {\n \"content\": \" uint16_t port;\\n\",\n \"file_path\": \"include/tcti/tcti_socket.h\",\n \"rank\": 0,\n \"score\": 158306.02717439883\n },\n {\n \"content\": \" const char *hostname;\\n\",\n \"file_path\": \"include/tcti/tcti_socket.h\",\n \"rank\": 1,\n \"score\": 127279.91855985833\n },\n {\n \"content\": \" void *logData;\\n\",\n \"file_path\": \"include/tcti/tcti_socket.h\",\n \"rank\": 2,\n \"score\": 123489.09362518475\n },\n {\n \"content\": \"\\tTPM2B_SENSITIVE_DATA\\tdata;\\t /* data to be sealed */\\n\",\n \"file_path\": \"include/sapi/tss2_tpm2_types.h\",\n \"rank\": 3,\n \"score\": 112435.98324259827\n },\n {\n \"content\": \"void Unmarshal_TPM2B_CREATION_DATA(\\n\\n\\tTSS2_SYS_CONTEXT *sysContext,\\n\\n\\tTPM2B_CREATION_DATA *creationData\\n\",\n \"file_path\": \"sysapi/include/sys_api_marshalUnmarshal.h\",\n \"rank\": 4,\n \"score\": 110970.98984524261\n },\n {\n \"content\": \"void Unmarshal_TPMS_CREATION_DATA(\\n\\n\\tTSS2_SYS_CONTEXT *sysContext,\\n\\n\\tTPMS_CREATION_DATA *creationData\\n\",\n \"file_path\": \"sysapi/include/sys_api_marshalUnmarshal.h\",\n \"rank\": 5,\n \"score\": 110970.98984524261\n },\n {\n \"content\": \"void Unmarshal_TPMS_CREATION_DATA(\\n\\n\\tTSS2_SYS_CONTEXT *sysContext,\\n\\n\\tTPMS_CREATION_DATA *creationData\\n\\n\\t)\\n\\n{\\n\\n\\tif( SYS_CONTEXT->rval != TSS2_RC_SUCCESS )\\n\\n\\t\\treturn;\\n\\n\\n\\n\\tif( creationData == 0 )\\n\\n\\t\\treturn;\\n\\n\\n\\n\\tUnmarshal_TPML_PCR_SELECTION( sysContext, &creationData->pcrSelect );\\n\\n\\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->pcrDigest );\\n\\n\\tUnmarshal_TPMA_LOCALITY( sysContext, &creationData->locality );\\n\\n\\tUnmarshal_UINT16( SYS_CONTEXT->tpmOutBuffPtr, SYS_CONTEXT->maxResponseSize, &(SYS_CONTEXT->nextData), &creationData->parentNameAlg, &( SYS_CONTEXT->rval ) );\\n\\n\\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->parentName );\\n\\n\\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->parentQualifiedName );\\n\\n\\tUNMARSHAL_SIMPLE_TPM2B_NO_SIZE_CHECK( sysContext, (TPM2B *)&creationData->outsideInfo );\\n\\n\\n\\n\\treturn;\\n\",\n \"file_path\": \"sysapi/sysapi_util/Unmarshal_TPMS_CREATION_DATA.c\",\n \"rank\": 6,\n \"score\": 100637.13076407637\n },\n {\n \"content\": \"void Unmarshal_TPM2B_CREATION_DATA(\\n\\n\\tTSS2_SYS_CONTEXT *sysContext,\\n\\n\\tTPM2B_CREATION_DATA *creationData\\n\\n\\t)\\n\\n{\\n\\n\\tif( SYS_CONTEXT->rval != TSS2_RC_SUCCESS )\\n\\n\\t\\treturn;\\n\\n\\n\\n\\tif( creationData == 0 )\\n\\n\\t\\treturn;\\n\\n\\n\\n\\tif( creationData->t.size != 0 )\\n\\n\\t\\tSYS_CONTEXT->rval = TSS2_SYS_RC_BAD_VALUE;\\n\\n\\n\\n\\tUnmarshal_UINT16( SYS_CONTEXT->tpmOutBuffPtr, SYS_CONTEXT->maxResponseSize, &(SYS_CONTEXT->nextData), &creationData->t.size, &( SYS_CONTEXT->rval ) );\\n\\n\\tUnmarshal_TPMS_CREATION_DATA( sysContext, &creationData->t.creationData );\\n\\n\\n\\n\\treturn;\\n\",\n \"file_path\": \"sysapi/sysapi_util/Unmarshal_TPM2B_CREATION_DATA.c\",\n \"rank\": 7,\n \"score\": 100637.13076407637\n },\n {\n \"content\": \"TPM2B_AUTH nullSessionHmac;\\n\",\n \"file_path\": \"test/common/sample/CreateNullSession.c\",\n \"rank\": 8,\n \"score\": 91025.12208684918\n },\n {\n \"content\": \"void InitNullSession( TPMS_AUTH_COMMAND *nullSessionData )\\n\\n{\\n\\n if( nullSessionData )\\n\\n {\\n\\n\\n\\n nullSessionData->sessionHandle = TPM_RS_PW;\\n\\n\\n\\n // Init nonce.\\n\\n nullSessionData->nonce.t.size = 0;\\n\\n\\n\\n // init hmac\\n\\n nullSessionData->hmac.t.size = 0;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&( nullSessionData->sessionAttributes ) ) ) = 0;\\n\\n }\\n\",\n \"file_path\": \"test/common/sample/CreateNullSession.c\",\n \"rank\": 9,\n \"score\": 91025.12208684918\n },\n {\n \"content\": \"TPM2B_NONCE nullSessionNonce;\\n\",\n \"file_path\": \"test/common/sample/CreateNullSession.c\",\n \"rank\": 10,\n \"score\": 91025.12208684918\n },\n {\n \"content\": \"void\\n\\nmarshal_UINT16_rc_previous_fail (void **state)\\n\\n{\\n\\n /* Set 'rc' to an error condition. */\\n\\n TSS2_RC rc = TSS2_SYS_RC_BAD_SIZE;\\n\\n /* 'rc' is checked first, all other parameters can be NULL.*/\\n\\n Marshal_UINT16 (NULL, 0, NULL, 0, &rc);\\n\\n assert_int_equal (rc, TSS2_SYS_RC_BAD_SIZE);\\n\",\n \"file_path\": \"test/marshal-UINT16_unit.c\",\n \"rank\": 11,\n \"score\": 91020.97647783147\n },\n {\n \"content\": \"void\\n\\nCheckDataPointers_null_nextData (void **state)\\n\\n{\\n\\n TSS2_RC rc;\\n\\n UINT8 *buffer = (UINT8*)5, *nextData = NULL;\\n\\n\\n\\n rc = CheckDataPointers (buffer, &nextData);\\n\\n assert_int_equal (rc, TSS2_SYS_RC_BAD_REFERENCE);\\n\",\n \"file_path\": \"test/CheckOverflow_unit.c\",\n \"rank\": 12,\n \"score\": 88953.41097364799\n },\n {\n \"content\": \"void\\n\\nCheckDataPointers_null_nextData_ptr (void **state)\\n\\n{\\n\\n TSS2_RC rc;\\n\\n UINT8 *buffer = (UINT8*)5, **nextData = NULL;\\n\\n\\n\\n rc = CheckDataPointers (buffer, nextData);\\n\\n assert_int_equal (rc, TSS2_SYS_RC_BAD_REFERENCE);\\n\",\n \"file_path\": \"test/CheckOverflow_unit.c\",\n \"rank\": 13,\n \"score\": 87149.04724357736\n },\n {\n \"content\": \"#define HOSTNAME_LENGTH 200\\n\\n\\n\",\n \"file_path\": \"tcti/tcti_device.c\",\n \"rank\": 14,\n \"score\": 86767.19747441878\n },\n {\n \"content\": \"static UINT8 rmErrorDuringSend = 0;\\n\",\n \"file_path\": \"resourcemgr/resourcemgr.c\",\n \"rank\": 15,\n \"score\": 86751.25225012747\n },\n {\n \"content\": \"void SendErrorResponse( SOCKET sock )\\n\\n{\\n\\n UINT32 numBytes = CHANGE_ENDIAN_DWORD( sizeof( TPM20_ErrorResponse ) );\\n\\n UINT32 trash = 0;\\n\\n\\n\\n rmSendBytes( sock, (unsigned char *)&numBytes, 4 );\\n\\n rmSendBytes( sock, (unsigned char *)&errorResponse, sizeof( TPM20_ErrorResponse ) );\\n\\n rmSendBytes( sock, (unsigned char *)&trash, 4 );\\n\",\n \"file_path\": \"resourcemgr/resourcemgr.c\",\n \"rank\": 16,\n \"score\": 86751.25225012747\n },\n {\n \"content\": \"void CreateErrorResponse( TSS2_RC responseCode )\\n\\n{\\n\\n errorResponse.tag = CHANGE_ENDIAN_WORD( TPM_ST_NO_SESSIONS );\\n\\n errorResponse.responseSize = CHANGE_ENDIAN_DWORD( sizeof( TPM20_ErrorResponse ) );\\n\\n errorResponse.responseCode = CHANGE_ENDIAN_DWORD( responseCode );\\n\",\n \"file_path\": \"resourcemgr/resourcemgr.c\",\n \"rank\": 17,\n \"score\": 86722.4424288969\n },\n {\n \"content\": \" uint16_t data_net;\\n\",\n \"file_path\": \"test/unmarshal-UINT16_unit.c\",\n \"rank\": 18,\n \"score\": 84076.44483446282\n },\n {\n \"content\": \" uint16_t data_net;\\n\",\n \"file_path\": \"test/marshal-UINT16_unit.c\",\n \"rank\": 19,\n \"score\": 84076.44483446282\n },\n {\n \"content\": \" uint16_t data_host;\\n\",\n \"file_path\": \"test/unmarshal-UINT16_unit.c\",\n \"rank\": 20,\n \"score\": 84076.44483446282\n },\n {\n \"content\": \" uint16_t data_host;\\n\",\n \"file_path\": \"test/marshal-UINT16_unit.c\",\n \"rank\": 21,\n \"score\": 84076.44483446282\n },\n {\n \"content\": \" UINT8 otherData;\\n\",\n \"file_path\": \"sysapi/include/sysapi_util.h\",\n \"rank\": 22,\n \"score\": 83786.04376025357\n },\n {\n \"content\": \" UINT16 decryptNull:1; // Indicates that the decrypt param was NULL at _Prepare call.\\n\",\n \"file_path\": \"sysapi/include/sysapi_util.h\",\n \"rank\": 23,\n \"score\": 81589.13267512654\n },\n {\n \"content\": \" TCTI_LOG_CALLBACK logCallback;\\n\",\n \"file_path\": \"include/tcti/tcti_socket.h\",\n \"rank\": 24,\n \"score\": 81521.83512387738\n },\n {\n \"content\": \" UINT8 *nextData;\\n\",\n \"file_path\": \"sysapi/include/sysapi_util.h\",\n \"rank\": 25,\n \"score\": 81418.31787172599\n },\n {\n \"content\": \"\\tUINT8 otherData;\\n\",\n \"file_path\": \"include/sapi/sys_api_part3.h\",\n \"rank\": 26,\n \"score\": 81413.63278204601\n },\n {\n \"content\": \" void *logData;\\n\",\n \"file_path\": \"sysapi/include/tcti_util.h\",\n \"rank\": 27,\n \"score\": 81413.63278204601\n },\n {\n \"content\": \" void *logData;\\n\",\n \"file_path\": \"include/tcti/tcti_device.h\",\n \"rank\": 28,\n \"score\": 81413.63278204601\n },\n {\n \"content\": \"\\tUINT8\\tsizeofSelect;\\t /* the size in octets of the pcrSelect array */\\n\",\n \"file_path\": \"include/sapi/tss2_tpm2_types.h\",\n \"rank\": 29,\n \"score\": 79351.70351821468\n },\n {\n \"content\": \"\\tTPM2B_DIGEST\\tcreationHash;\\t /* creationHash */\\n\",\n \"file_path\": \"include/sapi/tss2_tpm2_types.h\",\n \"rank\": 30,\n \"score\": 79326.2234453517\n },\n {\n \"content\": \" TCTI_LOG_BUFFER_CALLBACK logBufferCallback;\\n\",\n \"file_path\": \"include/tcti/tcti_socket.h\",\n \"rank\": 31,\n \"score\": 79277.09550779907\n },\n {\n \"content\": \"\\tUINT16\\tdataSize;\\t /* the size of the data areaThe maximum size is implementationdependent. The minimum maximum size is platformspecific. */\\n\",\n \"file_path\": \"include/sapi/tss2_tpm2_types.h\",\n \"rank\": 32,\n \"score\": 79171.87256508075\n },\n {\n \"content\": \"\\tTPM2B_DATA\\textraData;\\t /* external information supplied by callerNOTE\\tA TPM2B_DATA structure provides room for a digest and a method indicator to indicate the components of the digest. The definition of this method indicator is outside the scope of this specification. */\\n\",\n \"file_path\": \"include/sapi/tss2_tpm2_types.h\",\n \"rank\": 33,\n \"score\": 79171.87256508075\n },\n {\n \"content\": \"void\\n\\nCheckDataPointers_null_buffer (void **state)\\n\\n{\\n\\n TSS2_RC rc;\\n\\n UINT8 *buffer = NULL, *nextData = (UINT8*)5;\\n\\n\\n\\n rc = CheckDataPointers (buffer, &nextData);\\n\\n assert_int_equal (rc, TSS2_SYS_RC_BAD_REFERENCE);\\n\",\n \"file_path\": \"test/CheckOverflow_unit.c\",\n \"rank\": 34,\n \"score\": 77543.43393211071\n },\n {\n \"content\": \"void Marshal_UINT8( UINT8 *inBuffPtr, UINT32 maxCommandSize, UINT8 **nextData, UINT8 value, TSS2_RC *rval );\\n\",\n \"file_path\": \"sysapi/include/sys_api_marshalUnmarshal.h\",\n \"rank\": 35,\n \"score\": 77223.46315242487\n },\n {\n \"content\": \"void Unmarshal_UINT8( UINT8 *outBuffPtr, UINT32 maxResponseSize, UINT8 **nextData, UINT8 *value, TSS2_RC *rval );\\n\",\n \"file_path\": \"sysapi/include/sys_api_marshalUnmarshal.h\",\n \"rank\": 36,\n \"score\": 77223.46315242487\n },\n {\n \"content\": \"TPM_RC Tss2_Sys_Create(\\n\\n TSS2_SYS_CONTEXT *sysContext,\\n\\n TPMI_DH_OBJECT\\tparentHandle,\\n\\n TSS2_SYS_CMD_AUTHS const *cmdAuthsArray,\\n\\n TPM2B_SENSITIVE_CREATE\\t*inSensitive,\\n\\n TPM2B_PUBLIC\\t*inPublic,\\n\\n TPM2B_DATA\\t*outsideInfo,\\n\\n TPML_PCR_SELECTION\\t*creationPCR,\\n\\n TPM2B_PRIVATE\\t*outPrivate,\\n\\n TPM2B_PUBLIC\\t*outPublic,\\n\\n TPM2B_CREATION_DATA\\t*creationData,\\n\\n TPM2B_DIGEST\\t*creationHash,\\n\\n TPMT_TK_CREATION\\t*creationTicket,\\n\\n TSS2_SYS_RSP_AUTHS *rspAuthsArray\\n\",\n \"file_path\": \"include/sapi/sys_api_part3.h\",\n \"rank\": 37,\n \"score\": 77195.18050723374\n },\n {\n \"content\": \"void Unmarshal_UINT16( UINT8 *outBuffPtr, UINT32 maxResponseSize, UINT8 **nextData, UINT16 *value, TSS2_RC *rval );\\n\",\n \"file_path\": \"sysapi/include/sys_api_marshalUnmarshal.h\",\n \"rank\": 38,\n \"score\": 77184.58093877167\n },\n {\n \"content\": \"void Marshal_UINT16( UINT8 *inBuffPtr, UINT32 maxCommandSize, UINT8 **nextData, UINT16 value, TSS2_RC *rval );\\n\",\n \"file_path\": \"sysapi/include/sys_api_marshalUnmarshal.h\",\n \"rank\": 39,\n \"score\": 77184.58093877167\n },\n {\n \"content\": \"\\tunsigned int sensitiveDataOrigin : 1;\\t/* SET 1 Indicates that when the object was created with TPM2_Create or TPM2_CreatePrimary the TPM generated all of the sensitive data other than the authValue.CLEAR 0 A portion of the sensitive data other than the authValue was provided by the caller. */\\n\",\n \"file_path\": \"include/sapi/tss2_tpm2_types.h\",\n \"rank\": 40,\n \"score\": 77050.25974543695\n },\n {\n \"content\": \"TPM_RC Tss2_Sys_CertifyCreation(\\n\\n TSS2_SYS_CONTEXT *sysContext,\\n\\n TPMI_DH_OBJECT\\tsignHandle,\\n\\n TPMI_DH_OBJECT\\tobjectHandle,\\n\\n TSS2_SYS_CMD_AUTHS const *cmdAuthsArray,\\n\\n TPM2B_DATA\\t*qualifyingData,\\n\\n TPM2B_DIGEST\\t*creationHash,\\n\\n TPMT_SIG_SCHEME\\t*inScheme,\\n\\n TPMT_TK_CREATION\\t*creationTicket,\\n\\n TPM2B_ATTEST\\t*certifyInfo,\\n\\n TPMT_SIGNATURE\\t*signature,\\n\\n TSS2_SYS_RSP_AUTHS *rspAuthsArray\\n\",\n \"file_path\": \"include/sapi/sys_api_part3.h\",\n \"rank\": 41,\n \"score\": 75185.68175743902\n },\n {\n \"content\": \"TPM_RC Tss2_Sys_Create_Prepare(\\n\\n TSS2_SYS_CONTEXT *sysContext,\\n\\n TPMI_DH_OBJECT\\tparentHandle,\\n\\n TPM2B_SENSITIVE_CREATE\\t*inSensitive,\\n\\n TPM2B_PUBLIC\\t*inPublic,\\n\\n TPM2B_DATA\\t*outsideInfo,\\n\\n TPML_PCR_SELECTION\\t*creationPCR\\n\",\n \"file_path\": \"include/sapi/sys_api_part3.h\",\n \"rank\": 42,\n \"score\": 75180.52602657302\n },\n {\n \"content\": \"\\n\\nstatic TSS2_RC tctiRecvBytes( TSS2_TCTI_CONTEXT *tctiContext, SOCKET sock, unsigned char *data, int len )\\n\\n{\\n\\n TSS2_RC result = 0;\\n\\n result = recvBytes( sock, data, len);\\n\\n if ( (INT32)result == SOCKET_ERROR) {\\n\\n TCTI_LOG( tctiContext, NO_PREFIX, \\\"In recvBytes, recv failed (socket: 0x%x) with error: %d\\\\n\\\", sock, WSAGetLastError() );\\n\\n return TSS2_TCTI_RC_IO_ERROR;\\n\\n }\\n\\n#ifdef DEBUG_SOCKETS\\n\\n TCTI_LOG( tctiContext, NO_PREFIX, \\\"Receive Bytes from socket #0x%x: \\\\n\\\", sock );\\n\\n TCTI_LOG_BUFFER( tctiContext, NO_PREFIX, data, len );\\n\\n#endif\\n\\n\\n\\n return TSS2_RC_SUCCESS;\\n\\n}\\n\\n\\n\\nstatic TSS2_RC tctiSendBytes( TSS2_TCTI_CONTEXT *tctiContext, SOCKET sock, const unsigned char *data, int len )\\n\\n{\\n\\n TSS2_RC ret = TSS2_RC_SUCCESS;\\n\",\n \"file_path\": \"tcti/tcti_socket.cpp\",\n \"rank\": 46,\n \"score\": 45.435858222377185\n },\n {\n \"content\": \"\\n\\n#ifdef DEBUG_SOCKETS\\n\\n TCTI_LOG( tctiContext, NO_PREFIX, \\\"Send Bytes to socket #0x%x: \\\\n\\\", sock );\\n\\n TCTI_LOG_BUFFER( tctiContext, NO_PREFIX, (UINT8 *)data, len );\\n\\n#endif\\n\\n\\n\\n ret = sendBytes( sock, data, len);\\n\\n if (ret != TSS2_RC_SUCCESS)\\n\\n TCTI_LOG( tctiContext, NO_PREFIX, \\\"In recvBytes, recv failed (socket: 0x%x) with error: %d\\\\n\\\", sock, WSAGetLastError() );\\n\\n return ret;\\n\\n}\\n\\n\\n\\nTSS2_RC SendSessionEndSocketTcti(\\n\\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\\n\\n UINT8 tpmCmdServer )\\n\\n{\\n\\n UINT32 tpmSendCommand = TPM_SESSION_END; // Value for \\\"send command\\\" to MS simulator.\\n\\n SOCKET sock;\\n\\n TSS2_RC rval = TSS2_RC_SUCCESS;\\n\\n\\n\",\n \"file_path\": \"tcti/tcti_socket.cpp\",\n \"rank\": 51,\n \"score\": 33.568600447719675\n },\n {\n \"content\": \" return -3;\\n\\n }\\n\\n\\n\\n fclose(f);\\n\\n return 0;\\n\\n}\\n\\n\\n\\nvoid\\n\\nhexdump (unsigned long bse, UINT8 *buf, int len)\\n\\n{\\n\\n int pos;\\n\\n char line[80];\\n\\n\\n\\n while (len > 0)\\n\\n {\\n\\n int cnt, i;\\n\\n\\n\\n pos = snprintf (line, sizeof (line), \\\"%08lx \\\", bse);\\n\\n cnt = 16;\\n\\n if (cnt > len)\\n\",\n \"file_path\": \"test/tpmtcticlient/tpmtcticlient.cpp\",\n \"rank\": 54,\n \"score\": 32.415037983973754\n },\n {\n \"content\": \"#endif\\n\\n\\n\\nextern TSS2_RC SocketSendTpmCommand(\\n\\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\\n\\n size_t command_size, /* in */\\n\\n uint8_t *command_buffer /* in */\\n\\n );\\n\\n\\n\\nTSS2_RC SocketReceiveTpmResponse(\\n\\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\\n\\n size_t *response_size, /* out */\\n\\n unsigned char *response_buffer, /* in */\\n\\n int32_t timeout\\n\\n );\\n\\n\\n\\nvoid TestCreate1()\\n\\n{\\n\\n UINT32 rval;\\n\\n TPM2B_SENSITIVE_CREATE inSensitive = { { sizeof( TPM2B_SENSITIVE_CREATE ) - 2, } };\\n\\n TPM2B_PUBLIC inPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 55,\n \"score\": 30.182724943348088\n },\n {\n \"content\": \" *size += count;\\n\\n left -= count;\\n\\n buf += count;\\n\\n }\\n\\n\\n\\n if( *size == 0 )\\n\\n {\\n\\n printf(\\\"File read error\\\\n\\\");\\n\\n fclose(f);\\n\\n return -3;\\n\\n }\\n\\n fclose(f);\\n\\n return 0;\\n\\n}\\n\\n\\n\\nint saveDataToFile(const char *fileName, UINT8 *buf, UINT16 size)\\n\\n{\\n\\n FILE *f;\\n\\n UINT16 count = 1;\\n\\n if( fileName == NULL || buf == NULL || size == 0 )\\n\",\n \"file_path\": \"test/tpmtcticlient/tpmtcticlient.cpp\",\n \"rank\": 56,\n \"score\": 29.72870968494607\n },\n {\n \"content\": \"\\n\\nint loadDataFromFile(const char *fileName, UINT8 *buf, UINT16 *size)\\n\\n{\\n\\n UINT16 count = 1, left;\\n\\n FILE *f;\\n\\n if ( size == NULL || buf == NULL || fileName == NULL )\\n\\n return -1;\\n\\n\\n\\n f = fopen(fileName, \\\"rb+\\\");\\n\\n if( f == NULL )\\n\\n {\\n\\n printf(\\\"File(%s) open error.\\\\n\\\", fileName);\\n\\n return -2;\\n\\n }\\n\\n\\n\\n left = *size;\\n\\n *size = 0;\\n\\n while( left > 0 && count > 0 )\\n\\n {\\n\\n count = fread(buf, 1, left, f);\\n\",\n \"file_path\": \"test/tpmtcticlient/tpmtcticlient.cpp\",\n \"rank\": 58,\n \"score\": 28.832633248682853\n },\n {\n \"content\": \" hashCheck.digest.t.size = 0;\\n\\n\\n\\n char SignMsg[]= \\\"try to get sign with this msg!\\\";\\n\\n UINT16 length = sizeof(SignMsg);\\n\\n BYTE *buffer = NULL;\\n\\n UINT8 numBuffers = 0;\\n\\n UINT16 cpLength = 0;\\n\\n\\n\\n buffer = (BYTE*)malloc(length*sizeof(BYTE));\\n\\n memset(buffer, 0, length*sizeof(BYTE));\\n\\n memcpy (buffer, SignMsg, length);\\n\\n if(length%(MAX_DIGEST_BUFFER) != 0)\\n\\n numBuffers = length/(MAX_DIGEST_BUFFER) + 1;\\n\\n else\\n\\n numBuffers = length/(MAX_DIGEST_BUFFER);\\n\\n\\n\\n TPM2B_DIGEST *bufferList[numBuffers];\\n\\n for(UINT8 i = 0; i < numBuffers; i++)\\n\\n {\\n\\n (bufferList)[i] = (TPM2B_DIGEST *)calloc(1,sizeof(TPM2B_DIGEST));\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 59,\n \"score\": 25.795603977177784\n },\n {\n \"content\": \" &creationHash, &creationTicket, &sessionsDataOut );\\n\\n CheckPassed( rval );\\n\\n printf( \\\"Name of created key: \\\" );\\n\\n PrintSizedBuffer( (TPM2B *)&name );\\n\\n\\n\\n rval = Tss2_Sys_Load ( sysContext, handle2048rsa, &sessionsData, &outPrivate, &outPublic,\\n\\n &loadedSha1KeyHandle, &name, &sessionsDataOut);\\n\\n CheckPassed( rval );\\n\\n\\n\\n printf( \\\"Name of loading key: \\\" );\\n\\n PrintSizedBuffer( (TPM2B *)&name );\\n\\n\\n\\n inScheme.scheme = TPM_ALG_RSASSA;\\n\\n inScheme.details.rsassa.hashAlg = TPM_ALG_SHA1;\\n\\n hashCheck.tag = TPM_ST_HASHCHECK;\\n\\n hashCheck.hierarchy = TPM_RH_NULL;\\n\\n hashCheck.digest.t.size = 0;\\n\\n\\n\\n char SignMsg[]= \\\"try to get sign with this msg!\\\";\\n\\n UINT16 length = sizeof(SignMsg);\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 60,\n \"score\": 24.74464451935264\n },\n {\n \"content\": \" DebugPrintf( NO_PREFIX, \\\"\\\\nLoaded key handle: %8.8x\\\\n\\\", loadedSha1KeyHandle );\\n\\n}\\n\\n\\n\\nvoid TestEvict()\\n\\n{\\n\\n TPM_RC rval = TPM_RC_SUCCESS;\\n\\n TPM2B_SENSITIVE_CREATE inSensitive = { { sizeof( TPM2B_SENSITIVE_CREATE ) - 2, } };\\n\\n TPM2B_DATA outsideInfo = { { sizeof( TPM2B_DATA ) - 2, } };\\n\\n TPML_PCR_SELECTION creationPCR;\\n\\n TPMS_AUTH_COMMAND sessionData;\\n\\n TPMS_AUTH_RESPONSE sessionDataOut;\\n\\n TSS2_SYS_CMD_AUTHS sessionsData;\\n\\n TSS2_SYS_RSP_AUTHS sessionsDataOut;\\n\\n\\n\\n TPM2B_PRIVATE outPrivate = { { sizeof( TPM2B_PRIVATE ) - 2, } };\\n\\n TPM2B_PUBLIC outPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\\n\\n TPM2B_CREATION_DATA creationData = { { sizeof( TPM2B_CREATION_DATA ) - 2, } };\\n\\n\\tTPM2B_DIGEST creationHash = { { sizeof( TPM2B_DIGEST ) - 2, } };\\n\\n\\tTPMT_TK_CREATION creationTicket = { 0, 0, { { sizeof( TPM2B_DIGEST ) - 2, } } };\\n\\n\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 61,\n \"score\": 23.157465977308117\n },\n {\n \"content\": \" BYTE *buffer = NULL;\\n\\n UINT8 numBuffers = 0;\\n\\n UINT16 cpLength = 0;\\n\\n\\n\\n buffer = (BYTE*)malloc(length*sizeof(BYTE));\\n\\n memset(buffer, 0, length*sizeof(BYTE));\\n\\n memcpy (buffer, SignMsg, length);\\n\\n\\n\\n if(length%(MAX_DIGEST_BUFFER) != 0)\\n\\n numBuffers = length/(MAX_DIGEST_BUFFER) + 1;\\n\\n else\\n\\n numBuffers = length/(MAX_DIGEST_BUFFER);\\n\\n\\n\\n TPM2B_DIGEST *bufferList[numBuffers];\\n\\n for(UINT8 i = 0; i < numBuffers; i++)\\n\\n {\\n\\n (bufferList)[i] = (TPM2B_DIGEST *)calloc(1,sizeof(TPM2B_DIGEST));\\n\\n if(i < numBuffers-1)\\n\\n {\\n\\n for( UINT16 m = 0; m < MAX_DIGEST_BUFFER; m++)\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 62,\n \"score\": 22.99614400043099\n },\n {\n \"content\": \"TSS2_SYS_CMD_AUTHS nullSessionsData = { 1, &nullSessionDataArray[0] };\\n\\nTSS2_SYS_RSP_AUTHS nullSessionsDataOut = { 1, &nullSessionDataOutArray[0] };\\n\\nTPM2B_NONCE nullSessionNonce, nullSessionNonceOut;\\n\\nTPM2B_AUTH nullSessionHmac;\\n\\n\\n\\nvoid CheckFailed( UINT32 rval, UINT32 expectedTpmErrorCode )\\n\\n{\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\tfailing case: \\\" );\\n\\n if ( rval != expectedTpmErrorCode) {\\n\\n ErrorHandler( rval);\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\tFAILED! Ret code s/b: %x, but was: %x\\\\n\\\", expectedTpmErrorCode, rval );\\n\\n Cleanup();\\n\\n }\\n\\n else\\n\\n {\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\tPASSED!\\\\n\\\" );\\n\\n }\\n\\n Delay(demoDelay);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 63,\n \"score\": 22.77868735648474\n },\n {\n \"content\": \" uint8_t responseBuffer[20];\\n\\n size_t responseSize;\\n\\n size_t expectedResponseSize;\\n\\n SOCKET savedTpmSock = 0;\\n\\n SOCKET savedOtherSock = 0;\\n\\n int savedDevFile = 0;\\n\\n uint64_t savedMagic;\\n\\n uint32_t savedVersion;\\n\\n uint8_t goodResponseBuffer[] = { 0x80, 0x01, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n uint8_t goodResponseBuffer1[] = { 0x80, 0x01, 0x00, 0x00, 0x00, 0x18, 0x00, 0x00, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00,\\n\\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\\n\\n uint8_t *goodRspBuffer;\\n\\n\\n\\n int responseBufferError = 0;\\n\\n unsigned int i;\\n\\n char *typeString;\\n\\n char typeRMString[] = \\\"RM\\\";\\n\\n char typeLocalString[] = \\\"Local TPM\\\";\\n\\n\\n\\n TSS2_RC rval = TSS2_RC_SUCCESS;\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 64,\n \"score\": 22.69424306578029\n },\n {\n \"content\": \"TPMS_AUTH_COMMAND nullSessionData;\\n\\nTPMS_AUTH_RESPONSE nullSessionDataOut;\\n\\nTPMS_AUTH_COMMAND *nullSessionDataArray[1] = { &nullSessionData };\\n\\nTPMS_AUTH_RESPONSE *nullSessionDataOutArray[1] = { &nullSessionDataOut };\\n\\nTSS2_SYS_CMD_AUTHS nullSessionsData = { 1, &nullSessionDataArray[0] };\\n\\nTSS2_SYS_RSP_AUTHS nullSessionsDataOut = { 1, &nullSessionDataOutArray[0] };\\n\\nTPM2B_NONCE nullSessionNonce, nullSessionNonceOut;\\n\\nTPM2B_AUTH nullSessionHmac;\\n\\n\\n\\nvoid CheckFailed( UINT32 rval, UINT32 expectedTpmErrorCode )\\n\\n{\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\tfailing case: \\\" );\\n\\n if ( rval != expectedTpmErrorCode) {\\n\\n ErrorHandler( rval);\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\tFAILED! Ret code s/b: %x, but was: %x\\\\n\\\", expectedTpmErrorCode, rval );\\n\\n Cleanup();\\n\\n }\\n\\n else\\n\\n {\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\tPASSED!\\\\n\\\" );\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 65,\n \"score\": 22.53375884229746\n },\n {\n \"content\": \" // init hmac\\n\\n sessionData.hmac.t.size = 0;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n sessionsData.cmdAuthsCount = 1;\\n\\n sessionsData.cmdAuths[0] = &sessionData;\\n\\n\\n\\n inPublic.t.publicArea.parameters.rsaDetail.keyBits = 2048;\\n\\n\\n\\n outPublic.t.size = 0;\\n\\n creationData.t.size = 0;\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_PLATFORM, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n\\tprintf(\\\"\\\\nerrorcode: 0x%x\\\\n\\\", rval);\\n\\n CheckPassed( rval );\\n\\n}\\n\\nvoid TPM2Create()\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 66,\n \"score\": 22.26102650798692\n },\n {\n \"content\": \"### Changed\\n\\n- Fixed bug in CreatePrimary and Create: for one-call and decrypt session\\n\\ncase, they were copying first parameter from incorrect pointer.\\n\\n- For CopyCreationDataOut, CopyECCPointOut, CopyNvPublicOut, CopyPublicOut\\n\\nadded placeholder for return code if size != 0 when called. To be filled in\\n\\nwhen TSS WG decides on error code.\\n\\n- Fixed bugs in CopySensitiveCreateIn and CopySensitiveIn: they shouldn't look\\n\\nat the size.\\n\\n- Fixed bugs in CopyECCPointIn, CopyNvPublicIn, CopyPublicIn, CopySensitiveIn,\\n\\nand CopySensitiveCreateIn: not handling NULL outpul parameters correctly.\\n\\n- Changes all instances of calls to ExecuteFinish to a timeout that works for\\n\\nall cases including communicating with the simulator over the network.\\n\\n- Fixed call to LoadExternal in TestUnseal--needed to pass in a NULL pointer\\n\\nfor the inSensitive parameter.\\n\\n- Fixed bug in CreatePrimary: not passing correct pointer for inSensitive.\\n\\n- Fixed timeouts for all ExecuteFinish calls in test application.\\n\\n- Fixed bugs in RM: cases where I wasn't handling errors and then parsing data\\n\\nthat hadn't been received. Caused seg faults under Linux.\\n\\n- Fixed timeout for async Startup test.\\n\\n- Fixed SocketReceiveTpmResponse for blocking case.\\n\\n- Fixed bug in ExecuteFinish: BAD_SEQUENCE error generated early in function\\n\\nwas getting overwritten by INSUFFICENT_RESPONSE error.\\n\\n- Fixed bug in ExecuteFinish: it was always setting timeout to 0 instead of\\n\\nTSS2_TCTI_TIMEOUT_BLOCK.\\n\\n- Fixed bug in resource manager: error level for non-TPM errors was getting\\n\\noverwritten with resource manager error level.\\n\\n- Replace Implementation.h with implementation.h.\\n\\n- Changed name of TPMB.h tpmb.h\\n\\n- GetCapability with bad property returns different error code.\\n\\n- Shutdown with bad value for shutdownValue causes TPM to go into failure\\n\\nmode.\\n\\n- Fixed overlap in error codes: TSS2_BASE_RC_NOT_SUPPORTED and\\n\\nTSS2_BASE_RC_BAD_TCTI_STRUCTURE had same value.\\n\\n- Cleaned up all app level error codes.\\n\\n- Fixed bug with ordering of -startAuthSessionTest command line parameter: if\\n\\nit was not the last option, tpmclient would fail.\\n\\n- Fixed bugs related to ContextLoad.\\n\\n- Fixed bug in EvictContext: it was updating lastSessionSequenceNum even if\\n\\nthe ContextSave command failed.\\n\\n- Fixed handling of RM errors that occur during command send.\\n\\n- Fixed bug in simDriver init function. A second TCTI context being\\n\\ninitialized was re-initing the whole driver.\\n\\n- Updated to latest 1.19 header files.\\n\\n- Fixed bugs in resource manager:\\n\\n- FindOldestSession wasn't working correctly—it was just finding the first\\n\\none.\\n\\n- HandleGap needed to un-gap all the session contexts from the older interval.\\n\\nIt wasn't doing that.\\n\\n- Fixed bug in handling of command line options—specifying none would cause\\n\\nprogram to error out.\\n\\n- Fixed issues in cleanup of TestStartAuthSession test. It was leaving some\\n\\nsessions alive.\\n\\n- Updated copyright notices on all files.\\n\\n- Changed test app to use linked list of session structures instead of fixed\\n\\narray. This fixed a host of issues.\\n\\n- Fixed bugs in Certify, CertifyCreation, Commit, Create, CreatePrimary, and\\n\\nGetCapability: if null used for return parameters, the function would fail.\\n\\n- Fixed bug in SimpleHmacOrPolicyTest where it was re-creating the global\\n\\nsysContext causing failures in later tests because the context was too small.\\n\\n- Fixed a bug in ExecuteFinish. If response is too small, code was just using\\n\\nthe command buffer as the response buffer instead of returning an error.\\n\\n- Fixed some places in test app where I wasn't deleting entries from the\\n\\nsessions table.\\n\\n- Fixed build warnings related to size mismatch of connectionId.\\n\\n- Changed TeardownSysContext to zero out freed context pointer.\\n\\n- This helps prevent double free errors.\\n\\n- Fixed bug in EncryptDecryptXOR: wasn't setting the size of the outputData\\n\\nbuffer.\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 67,\n \"score\": 22.24370271498811\n },\n {\n \"content\": \"#endif\\n\\n , version, DEFAULT_HOSTNAME, DEFAULT_RESMGR_TPM_PORT );\\n\\n}\\n\\n\\n\\nint main(int argc, char* argv[])\\n\\n{\\n\\n int count;\\n\\n TSS2_RC rval;\\n\\n\\n\\n setvbuf (stdout, NULL, _IONBF, BUFSIZ);\\n\\n#ifdef SHARED_OUT_FILE\\n\\n if( argc > 12 )\\n\\n#else\\n\\n if( argc > 10 )\\n\\n#endif\\n\\n {\\n\\n PrintHelp();\\n\\n return 1;\\n\\n }\\n\\n else\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 68,\n \"score\": 22.06915869818419\n },\n {\n \"content\": \" &creationTicket, &name, &sessionsDataOut );\\n\\n CheckFailed( rval, TSS2_SYS_RC_BAD_VALUE );\\n\\n\\n\\n outPublic.t.size = 0;\\n\\n creationData.t.size = 0;\\n\\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\\n\\n INIT_SIMPLE_TPM2B_SIZE( name );\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n CheckPassed( rval );\\n\\n\\n\\n printf( \\\"\\\\nNew key successfully created in owner hierarchy (RSA 2048). Handle: 0x%8.8x\\\\n\\\",\\n\\n handle2048rsa );\\n\\n printf( \\\"Name of created primary key: \\\" );\\n\\n PrintSizedBuffer( (TPM2B *)&name );\\n\\n\\n\\n char buffer1contents[] = \\\"test\\\";\\n\\n //char buffer2contents[] = \\\"string\\\";\\n\\n\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 69,\n \"score\": 22.056793526882135\n },\n {\n \"content\": \" (pcrSelection).sizeofSelect = size;\\n\\n\\n\\nTPM_CC currentCommandCode;\\n\\nTPM_CC *currentCommandCodePtr = ¤tCommandCode;\\n\\n\\n\\n#define errorStringSize 200\\n\\nchar errorString[errorStringSize];\\n\\n\\n\\nUINT8 simulator = 1;\\n\\n\\n\\n#if __linux || __unix\\n\\nUINT8 testLocalTcti = 0;\\n\\n#endif\\n\\n\\n\\nUINT32 tpmMaxResponseLen = TPMBUF_LEN;\\n\\n\\n\\nUINT8 resMgrInitialized = 0;\\n\\n\\n\\nUINT8 pcrAfterExtend[20];\\n\\nTPM_HANDLE loadedRsaKeyHandle;\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 70,\n \"score\": 21.856336634694713\n },\n {\n \"content\": \"\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n sessionsData.cmdAuthsCount = 1;\\n\\n sessionsData.cmdAuths[0] = &sessionData;\\n\\n\\n\\n printf( \\\"\\\\nVERIFICATION on CREATED KEY TESTS:\\\\n\\\" );\\n\\n\\n\\n outPublic.t.size = 0;\\n\\n creationData.t.size = 0;\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n CheckPassed( rval );\\n\\n\\n\\n printf( \\\"\\\\nNew key successfully created in owner hierarchy (RSA 2048). Handle: 0x%8.8x\\\\n\\\",\\n\\n handle2048rsa );\\n\\n printf( \\\"Name of created primary key: \\\" );\\n\\n PrintSizedBuffer( (TPM2B *)&name );\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 71,\n \"score\": 21.635365193570994\n },\n {\n \"content\": \"void TestCreate()\\n\\n{\\n\\n UINT32 rval;\\n\\n TPM2B_SENSITIVE_CREATE inSensitive;\\n\\n TPM2B_PUBLIC inPublic;\\n\\n TPM2B_DATA outsideInfo;\\n\\n TPML_PCR_SELECTION creationPCR;\\n\\n TPMS_AUTH_COMMAND sessionData;\\n\\n TPMS_AUTH_RESPONSE sessionDataOut;\\n\\n TSS2_SYS_CMD_AUTHS sessionsData;\\n\\n\\n\\n TSS2_SYS_RSP_AUTHS sessionsDataOut;\\n\\n TPM2B_NAME name;\\n\\n TPM2B_NAME name1;\\n\\n TPM2B_PRIVATE outPrivate;\\n\\n TPM2B_PUBLIC outPublic;\\n\\n TPM2B_CREATION_DATA creationData;\\n\\n TPM2B_DIGEST creationHash;\\n\\n TPMT_TK_CREATION creationTicket = { 0, 0, { { sizeof( TPM2B_DIGEST ) - 2, } } };\\n\\n\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 72,\n \"score\": 21.38676163365247\n },\n {\n \"content\": \" // Do SAPI test for non-zero sized outPublic\\n\\n outPublic.t.size = 0xff;\\n\\n creationData.t.size = 0;\\n\\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\\n\\n INIT_SIMPLE_TPM2B_SIZE( name );\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_NULL, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n CheckFailed( rval, TSS2_SYS_RC_BAD_VALUE );\\n\\n\\n\\n#if 0\\n\\n // Do SAPI test for non-zero sized creationData\\n\\n outPublic.t.size = 0;\\n\\n creationData.t.size = 0x10;\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_PLATFORM, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n CheckFailed( rval, TSS2_SYS_RC_INSUFFICIENT_BUFFER );\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 73,\n \"score\": 21.071331155212324\n },\n {\n \"content\": \" nvAuxSessionData.sessionHandle = TPM_RS_PW;\\n\\n\\n\\n // Init nonce.\\n\\n nvAuxSessionData.nonce.t.size = 0;\\n\\n\\n\\n // init hmac\\n\\n nvAuxSessionData.hmac.t.size = 0;\\n\\n\\n\\n // init nvAuth\\n\\n nvAuth.t.size = 0;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&nvAuxSessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n nvAuxSessionsData.cmdAuthsCount = 1;\\n\\n nvAuxSessionsData.cmdAuths[0] = &nvAuxSessionData;\\n\\n\\n\\n publicInfo.t.size = sizeof( TPMI_RH_NV_INDEX ) +\\n\\n sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\\n\\n sizeof( UINT16 );\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 74,\n \"score\": 20.864931298901286\n },\n {\n \"content\": \"{\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\tpassing case: \\\" );\\n\\n if ( rval != TPM_RC_SUCCESS) {\\n\\n ErrorHandler( rval);\\n\\n// printf( \\\"\\\\tFAILED! %s\\\\n\\\", errorString );\\n\\n\\t\\tDebugPrintf( NO_PREFIX, \\\"\\\\tFAILED! %s\\\\n\\\", errorString );\\n\\n Cleanup();\\n\\n }\\n\\n else\\n\\n {\\n\\n printf( \\\"\\\\tPASSED!\\\\n\\\" );\\n\\n }\\n\\n\\n\\n Delay(demoDelay);\\n\\n}\\n\\n\\n\\nTPMS_AUTH_COMMAND nullSessionData;\\n\\nTPMS_AUTH_RESPONSE nullSessionDataOut;\\n\\nTPMS_AUTH_COMMAND *nullSessionDataArray[1] = { &nullSessionData };\\n\\nTPMS_AUTH_RESPONSE *nullSessionDataOutArray[1] = { &nullSessionDataOut };\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 75,\n \"score\": 20.755205188235205\n },\n {\n \"content\": \" *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n sessionsDataOut.rspAuthsCount = 1;\\n\\n\\n\\n sessionsData.cmdAuthsCount = 1;\\n\\n sessionsData.cmdAuths[0] = &sessionData;\\n\\n\\n\\n nvAuth.t.size = strlen( password );\\n\\n for( i = 0; i < nvAuth.t.size; i++ )\\n\\n nvAuth.t.buffer[i] = password[i];\\n\\n\\n\\n\\tpublicInfo.t.size = sizeof( TPMI_RH_NV_INDEX ) +\\n\\n sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\\n\\n sizeof( UINT16 );\\n\\n publicInfo.t.nvPublic.nvIndex = nvIndex;\\n\\n publicInfo.t.nvPublic.nameAlg = TPM_ALG_SHA1;\\n\\n\\n\\n // First zero out attributes.\\n\\n *(UINT32 *)&( publicInfo.t.nvPublic.attributes ) = 0;\\n\\n\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 76,\n \"score\": 20.67895423472946\n },\n {\n \"content\": \"TPM_HANDLE loadedSha1KeyHandle;\\n\\n\\n\\nTPM2B_AUTH loadedSha1KeyAuth;\\n\\n\\n\\nTPM_HANDLE handle1024, handle2048sha1, handle2048rsa;\\n\\n\\n\\nUINT32 passCount = 1;\\n\\nUINT32 demoDelay = 0;\\n\\nint debugLevel = 0;\\n\\nUINT8 indent = 0;\\n\\n\\n\\nTSS2_SYS_CONTEXT *sysContext;\\n\\n\\n\\nTCTI_SOCKET_CONF rmInterfaceConfig = {\\n\\n DEFAULT_HOSTNAME,\\n\\n DEFAULT_RESMGR_TPM_PORT,\\n\\n DebugPrintfCallback,\\n\\n DebugPrintBufferCallback,\\n\\n NULL\\n\\n};\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 77,\n \"score\": 20.593002850429254\n },\n {\n \"content\": \" TPM2B_PRIVATE outPrivate = { { sizeof( TPM2B_PRIVATE ) - 2, } };\\n\\n TPM2B_PUBLIC outPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\\n\\n TPM2B_CREATION_DATA creationData = { { sizeof( TPM2B_CREATION_DATA ) - 2, } };\\n\\n\\tTPM2B_DIGEST creationHash = { { sizeof( TPM2B_DIGEST ) - 2, } };\\n\\n\\tTPMT_TK_CREATION creationTicket = { 0, 0, { { sizeof( TPM2B_DIGEST ) - 2, } } };\\n\\n\\n\\n TPMS_AUTH_COMMAND *sessionDataArray[1];\\n\\n TPMS_AUTH_RESPONSE *sessionDataOutArray[1];\\n\\n\\n\\n sessionDataArray[0] = &sessionData;\\n\\n sessionDataOutArray[0] = &sessionDataOut;\\n\\n\\n\\n sessionsDataOut.rspAuths = &sessionDataOutArray[0];\\n\\n sessionsData.cmdAuths = &sessionDataArray[0];\\n\\n\\n\\n sessionsDataOut.rspAuthsCount = 1;\\n\\n\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\nCREATE, CREATE PRIMARY, and LOAD TESTS:\\\\n\\\" );\\n\\n\\n\\n inSensitive.t.sensitive.userAuth = loadedSha1KeyAuth;\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 78,\n \"score\": 20.49705406113036\n },\n {\n \"content\": \"\\n\\n writeData.t.size = sizeof( writeDataString );\\n\\n memcpy( (void *)&writeData.t.buffer, (void *)&writeDataString,\\n\\n sizeof( writeDataString ) );\\n\\n\\n\\n\\n\\n // Create NV index with empty auth value.\\n\\n *(UINT32 *)( (void *)&nvAttributes ) = 0;\\n\\n nvAttributes.TPMA_NV_AUTHREAD = 1;\\n\\n nvAttributes.TPMA_NV_AUTHWRITE = 1;\\n\\n nvAttributes.TPMA_NV_PLATFORMCREATE = 1;\\n\\n\\n\\n // No authorization required.\\n\\n authPolicy.t.size = 0;\\n\\n nvAuth.t.size = 0;\\n\\n rval = DefineNvIndex( TPM_RH_PLATFORM, TPM_RS_PW,\\n\\n &nvAuth, &authPolicy, TPM20_INDEX_TEST1,\\n\\n TPM_ALG_SHA1, nvAttributes,\\n\\n sizeof( writeDataString ) );\\n\\n\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 79,\n \"score\": 20.45287633428048\n },\n {\n \"content\": \" CopySizedByteBuffer( &publicInfo.t.nvPublic.authPolicy.b, &authPolicy->b );\\n\\n publicInfo.t.nvPublic.dataSize = size;\\n\\n publicInfo.t.size = sizeof( TPMI_RH_NV_INDEX ) +\\n\\n sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\\n\\n sizeof( UINT16 );\\n\\n publicInfo.t.nvPublic.nvIndex = nvIndex;\\n\\n publicInfo.t.nvPublic.nameAlg = nameAlg;\\n\\n\\n\\n // Create the index\\n\\n rval = Tss2_Sys_NV_DefineSpace( sysContext, authHandle, &sessionsData, auth, &publicInfo, &sessionsDataOut );\\n\\n\\n\\n return rval;\\n\\n}\\n\\n\\n\\ntypedef struct {\\n\\n char name[50];\\n\\n TPM_RC (*buildPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *trialPolicySession, TPM2B_DIGEST *policyDigest );\\n\\n TPM_RC (*createObjectFn )( TSS2_SYS_CONTEXT *sysContext, SESSION **policySession, TPM2B_DIGEST *policyDigest );\\n\\n TPM_RC (*testPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *policySession );\\n\\n} POLICY_TEST_SETUP;\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 80,\n \"score\": 20.446472996623328\n },\n {\n \"content\": \"\\n\\n // Now undefine the index so that next run will work correctly.\\n\\n rval = Tss2_Sys_NV_UndefineSpace( sysContext, TPM_RH_PLATFORM, TPM20_INDEX_TEST1, &sessionsData, 0 );\\n\\n CheckPassed( rval );\\n\\n}\\n\\n\\n\\nTPM2B_PUBLIC inPublic = { { sizeof( TPM2B_PUBLIC ) - 2, } };\\n\\n\\n\\nvoid TestCreate(){\\n\\n UINT32 rval;\\n\\n TPM2B_SENSITIVE_CREATE inSensitive = { { sizeof( TPM2B_SENSITIVE_CREATE ) - 2, } };\\n\\n TPM2B_DATA outsideInfo = { { sizeof( TPM2B_DATA ) - 2, } };\\n\\n TPML_PCR_SELECTION creationPCR;\\n\\n TPMS_AUTH_COMMAND sessionData;\\n\\n TPMS_AUTH_RESPONSE sessionDataOut;\\n\\n TSS2_SYS_CMD_AUTHS sessionsData;\\n\\n\\n\\n TSS2_SYS_RSP_AUTHS sessionsDataOut;\\n\\n\\tTPM2B_NAME name = { { sizeof( TPM2B_NAME ) - 2, } };\\n\\n\\tTPM2B_NAME name1 = { { sizeof( TPM2B_NAME ) - 2, } };\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 81,\n \"score\": 20.442432409706278\n },\n {\n \"content\": \" outPublic.t.size = 0;\\n\\n creationData.t.size = 0;\\n\\n creationPCR.count = 0;\\n\\n //outPublic.t.publicArea.authPolicy.t.size = sizeof( TPM2B_DIGEST ) - 2;\\n\\n //outPublic.t.publicArea.unique.keyedHash.t.size = sizeof( TPM2B_DIGEST ) - 2;\\n\\n //INIT_SIMPLE_TPM2B_SIZE( creationHash );\\n\\n //INIT_SIMPLE_TPM2B_SIZE( name );\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_NULL, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n CheckPassed( rval );\\n\\n\\n\\n printf( \\\"\\\\nNew key successfully created (RSA 2048). Handle: 0x%8.8x\\\\n\\\",\\n\\n handle2048rsa );\\n\\n\\n\\n rval = Tss2_Sys_ContextSave(sysContext, handle2048rsa, &context);\\n\\n CheckPassed(rval);\\n\\n\\n\\n rval = Tss2_Sys_ContextLoad(sysContext, &context, &symHandle);\\n\\n CheckPassed(rval);\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 82,\n \"score\": 20.16878952894868\n },\n {\n \"content\": \" }\\n\\n}\\n\\nvoid PrintCreateTestDescription()\\n\\n{\\n\\n printf(\\\" CreatePrimary Case(primaryHandle:TPM_RH_PLATFORM,authArray:{1,{sessionHandle:TPM_RS_PW}},outPublic.t.size:0xff,creationData.t.size:0):Failed(0x8000b)\\\\n\\\"\\n\\n \\\" CreatePrimary Case(primaryHandle:TPM_RH_PLATFORM,authArray:{1,{sessionHandle:TPM_RS_PW}},outPublic.t.size:0,creationData.t.size:0xff):Failed(0x8000b)\\\\n\\\"\\n\\n \\\" CreatePrimary Case(primaryHandle:TPM_RH_PLATFORM,authArray:{1,{sessionHandle:TPM_RS_PW}},outPublic.t.size:0,creationData.t.size:0):Passed\\\\n\\\"\\n\\n \\\" Create Case(parentHandle:handle2048rsa,authArray:{1,{sessionHandle:TPM_RS_PW,hmac:{2,{0x00,0xff}}}}):Passed\\\\n\\\"\\n\\n \\\" Load Case(parentHandle:handle2048rsa,authArray:{1,{sessionHandle:TPM_RS_PW,hmac:{2,{0x00,0xff}}}},&outPrivate, &outPublic):Passed\\\\n\\\"\\n\\n \\\" HandleToNameFunctionPtr Case(loadedSha1KeyHandle,name1):Passed\\\\n\\\"\\n\\n \\\" CompareTPM2B Case(name.b,name1.b):Passed\\\\n\\\");\\n\\n}\\n\\nvoid PrintNVTestDescription()\\n\\n{\\n\\n printf(\\\" NV_Read Case(authHandle:TPM_RH_PLATFORM,nvIndex:0x1500015,Size:32,authArray:{1,{TPM_RS_PW}}):Failed(0x28B)\\\\n\\\"\\n\\n \\\" NV_DefineSpace Case(authHandle:TPM_RH_PLATFORM,nvAuth:{20,{0,...19}},publicInfo:{nvIndex:0x1500015,\\\"\\n\\n \\\"authPolicy:{0},attribute:0x40014001}):Passed\\\\n\\\"\\n\\n \\\" NV_ReadPublic Case(nvIndex:0x1500015,nvPublic:0):Passed\\\\n\\\"\\n\\n \\\" NV_Read Case(auHandle:TPM_RH_PLATFORM,nvIndex:0x1500015,dataSize:32):Failed(0x14A)\\\\n\\\"\\n\\n \\\" NV_DefineSpace Case(authHandle:TPM_RH_PLATFORM,nvAuth:{20,{0,...19}},publicInfo:{nvIndex:0x1500015,\\\"\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 83,\n \"score\": 20.16533728660592\n },\n {\n \"content\": \" rval = tctiSendBytes( tctiContext, TCTI_CONTEXT_INTEL->tpmSock, (unsigned char *)&tpmSendCommand, 4 );\\n\\n if( rval != TSS2_RC_SUCCESS )\\n\\n goto returnFromSocketSendTpmCommand;\\n\\n\\n\\n // Send the locality\\n\\n locality = (UINT8)( (TSS2_TCTI_CONTEXT_INTEL *)tctiContext)->status.locality;\\n\\n rval = tctiSendBytes( tctiContext, TCTI_CONTEXT_INTEL->tpmSock, (unsigned char *)&locality, 1 );\\n\\n if( rval != TSS2_RC_SUCCESS )\\n\\n goto returnFromSocketSendTpmCommand;\\n\\n\\n\\n#ifdef DEBUG\\n\\n if( ((TSS2_TCTI_CONTEXT_INTEL *)tctiContext )->status.debugMsgEnabled == 1 )\\n\\n {\\n\\n TCTI_LOG( tctiContext, rmPrefix, \\\"Locality = %d\\\", ( (TSS2_TCTI_CONTEXT_INTEL *)tctiContext)->status.locality );\\n\\n }\\n\\n#endif\\n\\n\\n\\n // Send number of bytes.\\n\\n cnt1 = cnt;\\n\\n cnt = CHANGE_ENDIAN_DWORD(cnt);\\n\",\n \"file_path\": \"tcti/tcti_socket.cpp\",\n \"rank\": 84,\n \"score\": 19.884049674359552\n },\n {\n \"content\": \"// TCTI_LOG( tctiContext, NO_PREFIX, \\\"%s sent cancel OFF command:\\\\n\\\", interfaceName );\\n\\n }\\n\\n\\n\\nretSocketReceiveTpmResponse:\\n\\n if( rval == TSS2_RC_SUCCESS &&\\n\\n\\t\\tresponse_buffer != NULL )\\n\\n {\\n\\n ((TSS2_TCTI_CONTEXT_INTEL *)tctiContext)->previousStage = TCTI_STAGE_RECEIVE_RESPONSE;\\n\\n }\\n\\n\\n\\n return rval;\\n\\n}\\n\\n\\n\\n#ifdef __cplusplus\\n\\n}\\n\\n#endif\\n\\n\\n\\n#define HOSTNAME_LENGTH 200\\n\\n#define PORT_LENGTH 4\\n\\n\\n\",\n \"file_path\": \"tcti/tcti_socket.cpp\",\n \"rank\": 85,\n \"score\": 19.81422695392105\n },\n {\n \"content\": \" sessionsData.cmdAuthsCount = 1;\\n\\n sessionsData.cmdAuths[0] = &sessionData;\\n\\n\\n\\n printf( \\\"\\\\nVERIFICATION on PUBLIC LOADED KEY TESTS:\\\\n\\\" );\\n\\n\\n\\n outPublic.t.size = 0;\\n\\n creationData.t.size = 0;\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n CheckPassed( rval );\\n\\n\\n\\n printf( \\\"\\\\nNew key successfully created in owner hierarchy (RSA 2048). Handle: 0x%8.8x\\\\n\\\",\\n\\n handle2048rsa );\\n\\n printf( \\\"Name of created primary key: \\\" );\\n\\n PrintSizedBuffer( (TPM2B *)&name );\\n\\n\\n\\n outPublic.t.size = 0;\\n\\n creationData.t.size = sizeof( TPM2B_CREATION_DATA ) - 2;\\n\\n outPublic.t.publicArea.authPolicy.t.size = sizeof( TPM2B_DIGEST ) - 2;\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 86,\n \"score\": 19.69070732874482\n },\n {\n \"content\": \" if( tpmCmdServer )\\n\\n {\\n\\n sock = TCTI_CONTEXT_INTEL->tpmSock;\\n\\n }\\n\\n else\\n\\n {\\n\\n sock = TCTI_CONTEXT_INTEL->otherSock;\\n\\n }\\n\\n\\n\\n tpmSendCommand = CHANGE_ENDIAN_DWORD(tpmSendCommand);\\n\\n rval = tctiSendBytes( tctiContext, sock, (char unsigned *)&tpmSendCommand, 4 );\\n\\n\\n\\n return( rval );\\n\\n}\\n\\n\\n\\nTSS2_RC SocketSendTpmCommand(\\n\\n TSS2_TCTI_CONTEXT *tctiContext, /* in */\\n\\n size_t command_size, /* in */\\n\\n uint8_t *command_buffer /* in */\\n\\n )\\n\",\n \"file_path\": \"tcti/tcti_socket.cpp\",\n \"rank\": 87,\n \"score\": 19.617609749982677\n },\n {\n \"content\": \" const char sensitiveData[] = \\\"this is sensitive\\\";\\n\\n\\n\\n// printf( \\\"\\\\nUNSEAL TEST :\\\\n\\\" );\\n\\n\\n\\n sessionData.sessionHandle = TPM_RS_PW;\\n\\n\\n\\n // Init nonce.\\n\\n sessionData.nonce.t.size = 0;\\n\\n\\n\\n sessionData.hmac.t.size = 2;\\n\\n sessionData.hmac.t.buffer[0] = 0x00;\\n\\n sessionData.hmac.t.buffer[1] = 0xff;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n inSensitive.t.sensitive.userAuth.t.size = sizeof( authStr ) - 1;\\n\\n memcpy( &( inSensitive.t.sensitive.userAuth.t.buffer[0] ), authStr, sizeof( authStr ) - 1 );\\n\\n inSensitive.t.sensitive.data.t.size = sizeof( sensitiveData ) - 1;\\n\\n memcpy( &( inSensitive.t.sensitive.data.t.buffer[0] ), sensitiveData, sizeof( sensitiveData ) - 1 );\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 88,\n \"score\": 19.614718056002335\n },\n {\n \"content\": \"TPM_CC currentCommandCode;\\n\\nTPM_CC *currentCommandCodePtr = ¤tCommandCode;\\n\\n\\n\\n//----\\n\\n//char errorString[200];\\n\\n//----\\n\\n\\n\\n//+++\\n\\n#define errorStringSize 200\\n\\nchar errorString[errorStringSize];\\n\\n\\n\\nUINT8 simulator = 1;\\n\\n//+++\\n\\n\\n\\nUINT32 tpmMaxResponseLen = TPMBUF_LEN;\\n\\n\\n\\nUINT8 pcrAfterExtend[20];\\n\\nTPM_HANDLE loadedRsaKeyHandle;\\n\\nTPM_HANDLE loadedSha1KeyHandle;\\n\\n\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 89,\n \"score\": 19.60744659449611\n },\n {\n \"content\": \" TPM2B_NAME name;\\n\\n TPM2B_NAME qualifiedName;\\n\\n UINT8 commandCode[4];\\n\\n size_t\\t\\t\\t\\trpBufferUsedSize;\\n\\n\\tconst uint8_t \\t\\t*rpBuffer;\\n\\n\\tconst uint8_t \\t\\tgoodRpBuffer[] = { 0x01, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00,\\n\\n 0x01, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t 0x40 };\\n\\n TPMI_YES_NO moreData;\\n\\n TPMS_CAPABILITY_DATA\\tcapabilityData;\\n\\n int rpBufferError = 0;\\n\\n unsigned int i;\\n\\n UINT32 savedRspSize;\\n\\n\\n\\n DebugPrintf( NO_PREFIX, \\\"\\\\nSAPI API TESTS:\\\\n\\\" );\\n\\n\\n\\n //\\n\\n // First test the one-call interface.\\n\\n //\\n\\n rval = Tss2_Sys_GetTestResult( sysContext, 0, &outData, &testResult, 0 );\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 90,\n \"score\": 19.55135387712727\n },\n {\n \"content\": \" sessionData.nonce.t.size = 0;\\n\\n\\n\\n // init hmac\\n\\n sessionData.hmac.t.size = 2;\\n\\n sessionData.hmac.t.buffer[0] = 0x00;\\n\\n sessionData.hmac.t.buffer[1] = 0xff;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n qualifyingData.t.size = sizeof( qualDataString );\\n\\n memcpy( &( qualifyingData.t.buffer[0] ), qualDataString, sizeof( qualDataString ) );\\n\\n\\n\\n inScheme.scheme = TPM_ALG_NULL;\\n\\n\\n\\n pcrSelection.count = 1;\\n\\n pcrSelection.pcrSelections[0].hash = TPM_ALG_SHA1;\\n\\n pcrSelection.pcrSelections[0].sizeofSelect = 3;\\n\\n\\n\\n // Clear out PCR select bit field\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 91,\n \"score\": 19.398018350844623\n },\n {\n \"content\": \" sessionData.nonce.t.size = 0;\\n\\n\\n\\n // init hmac\\n\\n sessionData.hmac.t.size = 0;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n sessionsData.cmdAuthsCount = 1;\\n\\n sessionsData.cmdAuths[0] = &sessionData;\\n\\n\\n\\n inPublic.t.publicArea.parameters.rsaDetail.keyBits = 2048;\\n\\n\\n\\n // Do SAPI test for non-zero sized outPublic\\n\\n outPublic.t.size = 0xff;\\n\\n creationData.t.size = 0;\\n\\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\\n\\n INIT_SIMPLE_TPM2B_SIZE( name );\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_OWNER, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 92,\n \"score\": 19.322056245939347\n },\n {\n \"content\": \"\\n\\n // first way is to use as command parameter.\\n\\n *(UINT8 *)( (void *)&locality ) = 0;\\n\\n locality.TPM_LOC_THREE = 1;\\n\\n rval = Tss2_Sys_PolicyLocality( sysContext, badSessionHandle, 0, locality, 0 );\\n\\n CheckFailed( rval, TSS2_RESMGRTPM_ERROR_LEVEL + TPM_RC_HANDLE + ( 1 << 8 ) );\\n\\n\\n\\n // Second way is to use as handle in session area.\\n\\n rval = Tss2_Sys_PolicyLocality( sysContext, sessions[0]->sessionHandle, &sessionsDataIn, locality, 0 );\\n\\n CheckFailed( rval, TSS2_RESMGRTPM_ERROR_LEVEL + TPM_RC_VALUE + TPM_RC_S + ( 1 << 8 ) );\\n\\n\\n\\n // clean up the sessions that I don't want here.\\n\\n#ifdef DEBUG_GAP_HANDLING\\n\\n for( i = 0; i < ( debugMaxActiveSessions*3); i++ )\\n\\n#else\\n\\n for( i = 0; i < ( sizeof(sessions) / sizeof (SESSION *)); i++ )\\n\\n#endif\\n\\n {\\n\\n// DebugPrintf( NO_PREFIX, \\\"i(2) = 0x%4.4x\\\\n\\\", i );\\n\\n rval = Tss2_Sys_FlushContext( sysContext, sessions[i]->sessionHandle );\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 93,\n \"score\": 19.321718790589944\n },\n {\n \"content\": \" sessionData.hmac.t.size = 2;\\n\\n sessionData.hmac.t.buffer[0] = 0x00;\\n\\n sessionData.hmac.t.buffer[1] = 0xff;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n inSensitive.t.sensitive.userAuth.t.size = sizeof( authStr ) - 1;\\n\\n memcpy( &( inSensitive.t.sensitive.userAuth.t.buffer[0] ), authStr, sizeof( authStr ) - 1 );\\n\\n inSensitive.t.sensitive.data.t.size = sizeof( sensitiveData ) - 1;\\n\\n memcpy( &( inSensitive.t.sensitive.data.t.buffer[0] ), sensitiveData, sizeof( sensitiveData ) - 1 );\\n\\n\\n\\n inPublic.t.publicArea.authPolicy.t.size = 0;\\n\\n\\n\\n inPublic.t.publicArea.unique.keyedHash.t.size = 0;\\n\\n\\n\\n outsideInfo.t.size = 0;\\n\\n creationPCR.count = 0;\\n\\n\\n\\n inPublic.t.publicArea.type = TPM_ALG_KEYEDHASH;\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 94,\n \"score\": 19.257582434132676\n },\n {\n \"content\": \" sessionData.hmac.t.buffer[1] = 0xff;\\n\\n\\n\\n // Init session attributes\\n\\n *( (UINT8 *)((void *)&sessionData.sessionAttributes ) ) = 0;\\n\\n\\n\\n inSensitive.t.sensitive.userAuth.t.size = sizeof( authStr ) - 1;\\n\\n memcpy( &( inSensitive.t.sensitive.userAuth.t.buffer[0] ), authStr, sizeof( authStr ) - 1 );\\n\\n inSensitive.t.sensitive.data.t.size = sizeof( sensitiveData ) - 1;\\n\\n memcpy( &( inSensitive.t.sensitive.data.t.buffer[0] ), sensitiveData, sizeof( sensitiveData ) - 1 );\\n\\n\\n\\n inPublic.t.publicArea.authPolicy.t.size = 0;\\n\\n\\n\\n inPublic.t.publicArea.unique.keyedHash.t.size = 0;\\n\\n\\n\\n outsideInfo.t.size = 0;\\n\\n creationPCR.count = 0;\\n\\n\\n\\n inPublic.t.publicArea.type = TPM_ALG_KEYEDHASH;\\n\\n inPublic.t.publicArea.nameAlg = TPM_ALG_SHA1;\\n\\n\\n\",\n \"file_path\": \"test/tpmclient/tpmclient.cpp\",\n \"rank\": 95,\n \"score\": 19.18903555876977\n },\n {\n \"content\": \" sizeof( TPMI_ALG_HASH ) + sizeof( TPMA_NV ) + sizeof( UINT16) +\\n\\n sizeof( UINT16 );\\n\\n publicInfo.t.nvPublic.nvIndex = nvIndex;\\n\\n publicInfo.t.nvPublic.nameAlg = nameAlg;\\n\\n\\n\\n // Create the index\\n\\n rval = Tss2_Sys_NV_DefineSpace( sysContext, authHandle, &sessionsData, auth, &publicInfo, &sessionsDataOut );\\n\\n\\n\\n return rval;\\n\\n}\\n\\n\\n\\ntypedef struct {\\n\\n char name[50];\\n\\n TPM_RC (*buildPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *trialPolicySession, TPM2B_DIGEST *policyDigest );\\n\\n TPM_RC (*createObjectFn )( TSS2_SYS_CONTEXT *sysContext, SESSION **policySession, TPM2B_DIGEST *policyDigest );\\n\\n TPM_RC (*testPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *policySession );\\n\\n} POLICY_TEST_SETUP;\\n\\n\\n\\nTPM_RC BuildPolicy( TSS2_SYS_CONTEXT *sysContext, SESSION **policySession,\\n\\n TPM_RC (*buildPolicyFn )( TSS2_SYS_CONTEXT *sysContext, SESSION *policySession, TPM2B_DIGEST *policyDigest ),\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 96,\n \"score\": 19.119447482583155\n },\n {\n \"content\": \" &outPrivate, &outPublic, &creationData,\\n\\n &creationHash, &creationTicket, &sessionsDataOut );\\n\\n CheckPassed( rval );\\n\\n printf( \\\"Name of created key: \\\" );\\n\\n PrintSizedBuffer( (TPM2B *)&name );\\n\\n\\n\\n rval = Tss2_Sys_Load ( sysContext, handle2048rsa, &sessionsData, &outPrivate, &outPublic,\\n\\n &loadedSha1KeyHandle, &name, &sessionsDataOut);\\n\\n CheckPassed( rval );\\n\\n\\n\\n printf( \\\"Name of loading key: \\\" );\\n\\n PrintSizedBuffer( (TPM2B *)&name );\\n\\n\\n\\n printf( \\\"\\\\nLoaded key handle: %8.8x\\\\n\\\", loadedSha1KeyHandle );\\n\\n\\n\\n char buffer1contents[] = \\\"test\\\";\\n\\n TPMT_RSA_DECRYPT inScheme;\\n\\n TPM2B_PUBLIC_KEY_RSA message = { { sizeof(TPM2B_PUBLIC_KEY_RSA)-2, } };\\n\\n TPM2B_PUBLIC_KEY_RSA messageOut = { { sizeof(TPM2B_PUBLIC_KEY_RSA)-2, } };\\n\\n TPM2B_PUBLIC_KEY_RSA outData = { { sizeof(TPM2B_PUBLIC_KEY_RSA)-2, } };\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 97,\n \"score\": 19.08778264231395\n },\n {\n \"content\": \" inPublic.t.publicArea.parameters.rsaDetail.symmetric.mode.aes = TPM_ALG_CFB;\\n\\n inPublic.t.publicArea.parameters.rsaDetail.scheme.scheme = TPM_ALG_NULL;\\n\\n inPublic.t.publicArea.parameters.rsaDetail.keyBits = 2048;\\n\\n inPublic.t.publicArea.parameters.rsaDetail.exponent = 0;\\n\\n\\n\\n inPublic.t.publicArea.unique.rsa.t.size = 0;\\n\\n\\n\\n outsideInfo.t.size = 0;\\n\\n\\n\\n // This one should fail, because a different context is trying to use the primary object.\\n\\n outPublic.t.size = 0;\\n\\n creationData.t.size = 0;\\n\\n INIT_SIMPLE_TPM2B_SIZE( outPrivate );\\n\\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\\n\\n rval = Tss2_Sys_Create( otherSysContext, handle2048rsa, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR,\\n\\n &outPrivate, &outPublic, &creationData,\\n\\n &creationHash, &creationTicket, &sessionsDataOut );\\n\\n CheckFailed( rval, TSS2_RESMGR_UNOWNED_HANDLE );\\n\\n\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 98,\n \"score\": 19.010453740920124\n },\n {\n \"content\": \" outPublic.t.size = 0;\\n\\n creationData.t.size = 0;\\n\\n INIT_SIMPLE_TPM2B_SIZE( creationHash );\\n\\n INIT_SIMPLE_TPM2B_SIZE( name );\\n\\n rval = Tss2_Sys_CreatePrimary( sysContext, TPM_RH_NULL, &sessionsData, &inSensitive, &inPublic,\\n\\n &outsideInfo, &creationPCR, &handle2048rsa, &outPublic, &creationData, &creationHash,\\n\\n &creationTicket, &name, &sessionsDataOut );\\n\\n CheckPassed( rval );\\n\\n\\n\\n printf( \\\"\\\\nNew key successfully created in NULL hierarchy (RSA 2048). Handle: 0x%8.8x\\\\n\\\",\\n\\n handle2048rsa );\\n\\n\\n\\n sessionData.hmac.t.size = 2;\\n\\n sessionData.hmac.t.buffer[0] = 0x00;\\n\\n sessionData.hmac.t.buffer[1] = 0xff;\\n\\n\\n\\n inPublic.t.publicArea.type = TPM_ALG_KEYEDHASH;\\n\\n inPublic.t.publicArea.objectAttributes.decrypt = 0;\\n\\n inPublic.t.publicArea.objectAttributes.sign = 1;\\n\\n\\n\",\n \"file_path\": \"test/tpmtest/tpmtest.cpp\",\n \"rank\": 99,\n \"score\": 18.883660367005568\n }\n]","isConversational":false}}},{"rowIdx":296,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/add-ons/media/media-add-ons/dvb/DVBCard.cpp"},"repo_name":{"kind":"string","value":"Kirishikesan/haiku"},"commit":{"kind":"string","value":"835565c55830f2dab01e6e332cc7e2d9c015b51e"},"file_code":{"kind":"string","value":"\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <sys/ioctl.h>\n#include <errno.h> \n#include <OS.h>\n\n#include \"DVBCard.h\"\n\nDVBCard::DVBCard(const char *path)\n :\tfInitStatus(B_OK)\n ,\tfDev(-1)\n{\n\tprintf(\"DVBCard opening %s\\n\", path);\n\n\tfDev = open(path, O_RDWR);\n\tif (fDev < 0) {\n\t\tprintf(\"DVBCard opening %s failed\\n\", path);\n\t\tfInitStatus = B_ERROR;\n\t\treturn;\n\t}\n\t\n\tdvb_frequency_info_t info;\n\tif (do_ioctl(fDev, DVB_GET_FREQUENCY_INFO, &info) < 0) {\n\t\tprintf(\"DVB_GET_FREQUENCY_INFO failed with error %s\\n\", strerror(errno));\n\n\t}\n\n\tfFreqMin = info.frequency_min;\n\tfFreqMax = info.frequency_max;\n\tfFreqStep = info.frequency_step;\n\t\n\tfCaptureActive = false;\n}\n\nDVBCard::~DVBCard()\n{\n\tif (fDev > 0)\n\t\tclose(fDev);\n}\n\nstatus_t\nDVBCard::InitCheck()\n{\n\treturn fInitStatus;\n}\n\t\n\nstatus_t\nDVBCard::GetCardType(dvb_type_t *type)\n{\n\tdvb_interface_info_t info;\n\t\n\tif (do_ioctl(fDev, DVB_GET_INTERFACE_INFO, &info) < 0) {\n\t\tprintf(\"DVB_GET_INTERFACE_INFO failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\n\tif (info.version < 1) {\n\t\tprintf(\"DVBCard::GetCardInfo wrong API version\\n\");\n\t\treturn B_ERROR;\n\t}\n\n\t*type = info.type;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::GetCardInfo(char *_name, int max_name_len, char *_info, int max_info_len)\n{\n\tdvb_interface_info_t info;\n\t\n\tif (do_ioctl(fDev, DVB_GET_INTERFACE_INFO, &info) < 0) {\n\t\tprintf(\"DVB_GET_INTERFACE_INFO failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\t\n\n\tstrcpy(_name, info.name);\n\tstrcpy(_info, info.info);\n\n\tif (info.version < 1) {\n\t\tprintf(\"DVBCard::GetCardInfo wrong API version\\n\");\n\t\treturn B_ERROR;\n\t}\n\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::SetTuningParameter(const dvb_tuning_parameters_t& param)\n{\n\tif (fDev < 0)\n\t\treturn B_NO_INIT;\n\t\t\n\tprintf(\"DVBCard::SetTuningParameter:\\n\");\n\n\tparams = param;\n\t\n\n\tif (ioctl(fDev, DVB_SET_TUNING_PARAMETERS, (void *)(¶m)) < 0) {\n\t\tprintf(\"DVB_SET_TUNING_PARAMETERS failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\t\t\n\t}\n\t\n\tdvb_status_t status;\n\t\n\tbigtime_t start = system_time();\n\tbool has_lock = false;\n\tbool has_signal = false;\n\tbool has_carrier = false;\n\tdo {\n\t\tif (do_ioctl(fDev, DVB_GET_STATUS, &status) < 0) {\n\t\t\tprintf(\"DVB_GET_STATUS failed with error %s\\n\", strerror(errno));\n\t\t\treturn errno;\n\t\t}\n\t\tif (!has_signal && status & DVB_STATUS_SIGNAL) {\n\t\t\thas_signal = true;\n\t\t\tprintf(\"got signal after %.6f\\n\", (system_time() - start) / 1e6);\n\t\t}\n\t\tif (!has_carrier && status & DVB_STATUS_CARRIER) {\n\t\t\thas_carrier = true;\n\t\t\tprintf(\"got carrier after %.6f\\n\", (system_time() - start) / 1e6);\n\t\t}\n\t\tif (!has_lock && status & DVB_STATUS_LOCK) {\n\t\t\thas_lock = true;\n\t\t\tprintf(\"got lock after %.6f\\n\", (system_time() - start) / 1e6);\n\t\t}\n\t\t\n\t\tif ((status & (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK)) == (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK))\n\t\t\tbreak;\n\t\tsnooze(25000);\n\t} while ((system_time() - start) < 5000000);\n\n\tif ((status & (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK)) != (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK)) {\n\t\tprintf(\"DVB tuning failed! need these status flags: DVB_STATUS_SIGNAL, DVB_STATUS_CARRIER, DVB_STATUS_LOCK\\n\");\n\t\treturn B_ERROR;\n\t}\n\t\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::GetTuningParameter(dvb_tuning_parameters_t *param)\n{\n\t\n\t*param = params;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::GetSignalInfo(uint32 *ss, uint32 *ber, uint32 *snr)\n{\n\tif (do_ioctl(fDev, DVB_GET_SS, ss) < 0) {\n\t\tprintf(\"DVB_GET_SS failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\tif (do_ioctl(fDev, DVB_GET_BER, ber) < 0) {\n\t\tprintf(\"DVB_GET_BER failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\tif (do_ioctl(fDev, DVB_GET_SNR, snr) < 0) {\n\t\tprintf(\"DVB_GET_SNR failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\n\tprintf(\"ss %08lx, ber %08lx, snr %08lx\\n\", *ss, *ber, *snr);\n\tprintf(\"ss %lu%%, ber %lu%%, snr %lu%%\\n\", *ss / (0xffffffff / 100), *ber / (0xffffffff / 100), *snr / (0xffffffff / 100));\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::CaptureStart()\n{\n\tprintf(\"DVBCard::CaptureStart\\n\");\n\t\n\tif (fCaptureActive) {\n\t\tprintf(\"CaptureStart already called, doing nothing\\n\");\n\t\treturn B_OK;\n\t}\n\t\n\tif (do_ioctl(fDev, DVB_START_CAPTURE, 0) < 0) {\n\t\tprintf(\"DVB_START_CAPTURE failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\t\n\tfCaptureActive = true;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::CaptureStop()\n{\n\tprintf(\"DVBCard::CaptureStop\\n\");\n\n\tif (!fCaptureActive) {\n\t\tprintf(\"CaptureStop already called, doing nothing\\n\");\n\t\treturn B_OK;\n\t}\n\n\tif (do_ioctl(fDev, DVB_STOP_CAPTURE, 0) < 0) {\n\t\tprintf(\"DVB_STOP_CAPTURE failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\n\tfCaptureActive = false;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::Capture(void **data, size_t *size, bigtime_t *end_time)\n{\n\tdvb_capture_t cap;\n\n\tif (ioctl(fDev, DVB_CAPTURE, &cap) < 0) \n\t\treturn errno;\n\n\t*data\t = cap.data;\n\t*size\t = cap.size;\n\t*end_time = cap.end_time;\n\n\treturn B_OK;\n}\n\nint\nDVBCard::do_ioctl(int fDev, ulong op, void *arg)\n{\n\tint res = 0; \n\tint i;\n\tfor (i = 0; i < 20; i++) {\n\t\tres = ioctl(fDev, op, arg);\n\t\tif (res >= 0)\n\t\t\tbreak;\n\t}\n\tif (i != 0)\tprintf(\"ioctl %lx repeated %d times\\n\", op, i);\n\treturn res;\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <sys/ioctl.h>\n#include <errno.h> \n#include <OS.h>\n\n#include \"DVBCard.h\"\n\nDVBCard::DVBCard(const char *path)\n :\tfInitStatus(B_OK)\n ,\tfDev(-1)\n{\n\tprintf(\"DVBCard opening %s\\n\", path);\n\n\tfDev = open(path, O_RDWR);\n\tif (fDev < 0) {\n\t\tprintf(\"DVBCard opening %s failed\\n\", path);\n\t\tfInitStatus = B_ERROR;\n\t\treturn;\n\t}\n\t\n\tdvb_frequency_info_t info;\n\tif (do_ioctl(fDev, DVB_GET_FREQUENCY_INFO, &info) < 0) {\n\t\tprintf(\"DVB_GET_FREQUENCY_INFO failed with error %s\\n\", strerror(errno));\n\n\t}\n\n\tfFreqMin = info.frequency_min;\n\tfFreqMax = info.frequency_max;\n\tfFreqStep = info.frequency_step;\n\t\n\tfCaptureActive = false;\n}\n\nDVBCard::~DVBCard()\n{\n\tif (fDev > 0)\n\t\tclose(fDev);\n}\n\nstatus_t\nDVBCard::InitCheck()\n{\n\treturn fInitStatus;\n}\n\t\n\nstatus_t\nDVBCard::GetCardType(dvb_type_t *ty"},"suffix":{"kind":"string","value":"\treturn B_OK;\n}\n\nint\nDVBCard::do_ioctl(int fDev, ulong op, void *arg)\n{\n\tint res = 0; \n\tint i;\n\tfor (i = 0; i < 20; i++) {\n\t\tres = ioctl(fDev, op, arg);\n\t\tif (res >= 0)\n\t\t\tbreak;\n\t}\n\tif (i != 0)\tprintf(\"ioctl %lx repeated %d times\\n\", op, i);\n\treturn res;\n}\n"},"middle":{"kind":"string","value":"pe)\n{\n\tdvb_interface_info_t info;\n\t\n\tif (do_ioctl(fDev, DVB_GET_INTERFACE_INFO, &info) < 0) {\n\t\tprintf(\"DVB_GET_INTERFACE_INFO failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\n\tif (info.version < 1) {\n\t\tprintf(\"DVBCard::GetCardInfo wrong API version\\n\");\n\t\treturn B_ERROR;\n\t}\n\n\t*type = info.type;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::GetCardInfo(char *_name, int max_name_len, char *_info, int max_info_len)\n{\n\tdvb_interface_info_t info;\n\t\n\tif (do_ioctl(fDev, DVB_GET_INTERFACE_INFO, &info) < 0) {\n\t\tprintf(\"DVB_GET_INTERFACE_INFO failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\t\n\n\tstrcpy(_name, info.name);\n\tstrcpy(_info, info.info);\n\n\tif (info.version < 1) {\n\t\tprintf(\"DVBCard::GetCardInfo wrong API version\\n\");\n\t\treturn B_ERROR;\n\t}\n\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::SetTuningParameter(const dvb_tuning_parameters_t& param)\n{\n\tif (fDev < 0)\n\t\treturn B_NO_INIT;\n\t\t\n\tprintf(\"DVBCard::SetTuningParameter:\\n\");\n\n\tparams = param;\n\t\n\n\tif (ioctl(fDev, DVB_SET_TUNING_PARAMETERS, (void *)(¶m)) < 0) {\n\t\tprintf(\"DVB_SET_TUNING_PARAMETERS failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\t\t\n\t}\n\t\n\tdvb_status_t status;\n\t\n\tbigtime_t start = system_time();\n\tbool has_lock = false;\n\tbool has_signal = false;\n\tbool has_carrier = false;\n\tdo {\n\t\tif (do_ioctl(fDev, DVB_GET_STATUS, &status) < 0) {\n\t\t\tprintf(\"DVB_GET_STATUS failed with error %s\\n\", strerror(errno));\n\t\t\treturn errno;\n\t\t}\n\t\tif (!has_signal && status & DVB_STATUS_SIGNAL) {\n\t\t\thas_signal = true;\n\t\t\tprintf(\"got signal after %.6f\\n\", (system_time() - start) / 1e6);\n\t\t}\n\t\tif (!has_carrier && status & DVB_STATUS_CARRIER) {\n\t\t\thas_carrier = true;\n\t\t\tprintf(\"got carrier after %.6f\\n\", (system_time() - start) / 1e6);\n\t\t}\n\t\tif (!has_lock && status & DVB_STATUS_LOCK) {\n\t\t\thas_lock = true;\n\t\t\tprintf(\"got lock after %.6f\\n\", (system_time() - start) / 1e6);\n\t\t}\n\t\t\n\t\tif ((status & (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK)) == (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK))\n\t\t\tbreak;\n\t\tsnooze(25000);\n\t} while ((system_time() - start) < 5000000);\n\n\tif ((status & (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK)) != (DVB_STATUS_SIGNAL|DVB_STATUS_CARRIER|DVB_STATUS_LOCK)) {\n\t\tprintf(\"DVB tuning failed! need these status flags: DVB_STATUS_SIGNAL, DVB_STATUS_CARRIER, DVB_STATUS_LOCK\\n\");\n\t\treturn B_ERROR;\n\t}\n\t\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::GetTuningParameter(dvb_tuning_parameters_t *param)\n{\n\t\n\t*param = params;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::GetSignalInfo(uint32 *ss, uint32 *ber, uint32 *snr)\n{\n\tif (do_ioctl(fDev, DVB_GET_SS, ss) < 0) {\n\t\tprintf(\"DVB_GET_SS failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\tif (do_ioctl(fDev, DVB_GET_BER, ber) < 0) {\n\t\tprintf(\"DVB_GET_BER failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\tif (do_ioctl(fDev, DVB_GET_SNR, snr) < 0) {\n\t\tprintf(\"DVB_GET_SNR failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\n\tprintf(\"ss %08lx, ber %08lx, snr %08lx\\n\", *ss, *ber, *snr);\n\tprintf(\"ss %lu%%, ber %lu%%, snr %lu%%\\n\", *ss / (0xffffffff / 100), *ber / (0xffffffff / 100), *snr / (0xffffffff / 100));\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::CaptureStart()\n{\n\tprintf(\"DVBCard::CaptureStart\\n\");\n\t\n\tif (fCaptureActive) {\n\t\tprintf(\"CaptureStart already called, doing nothing\\n\");\n\t\treturn B_OK;\n\t}\n\t\n\tif (do_ioctl(fDev, DVB_START_CAPTURE, 0) < 0) {\n\t\tprintf(\"DVB_START_CAPTURE failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\t\n\tfCaptureActive = true;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::CaptureStop()\n{\n\tprintf(\"DVBCard::CaptureStop\\n\");\n\n\tif (!fCaptureActive) {\n\t\tprintf(\"CaptureStop already called, doing nothing\\n\");\n\t\treturn B_OK;\n\t}\n\n\tif (do_ioctl(fDev, DVB_STOP_CAPTURE, 0) < 0) {\n\t\tprintf(\"DVB_STOP_CAPTURE failed with error %s\\n\", strerror(errno));\n\t\treturn errno;\n\t}\n\n\tfCaptureActive = false;\n\treturn B_OK;\n}\n\nstatus_t\nDVBCard::Capture(void **data, size_t *size, bigtime_t *end_time)\n{\n\tdvb_capture_t cap;\n\n\tif (ioctl(fDev, DVB_CAPTURE, &cap) < 0) \n\t\treturn errno;\n\n\t*data\t = cap.data;\n\t*size\t = cap.size;\n\t*end_time = cap.end_time;\n\n"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":297,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"cpdp/src/v20190820/model/CreateInvoiceItem.cpp"},"repo_name":{"kind":"string","value":"li5ch/tencentcloud-sdk-cpp"},"commit":{"kind":"string","value":"12ebfd75a399ee2791f6ac1220a79ce8a9faf7c4"},"file_code":{"kind":"string","value":"\n\n#include <tencentcloud/cpdp/v20190820/model/CreateInvoiceItem.h>\n\nusing TencentCloud::CoreInternalOutcome;\nusing namespace TencentCloud::Cpdp::V20190820::Model;\nusing namespace rapidjson;\nusing namespace std;\n\nCreateInvoiceItem::CreateInvoiceItem() :\n m_nameHasBeenSet(false),\n m_taxCodeHasBeenSet(false),\n m_totalPriceHasBeenSet(false),\n m_taxRateHasBeenSet(false),\n m_taxAmountHasBeenSet(false),\n m_taxTypeHasBeenSet(false),\n m_modelsHasBeenSet(false),\n m_unitHasBeenSet(false),\n m_totalHasBeenSet(false),\n m_priceHasBeenSet(false),\n m_discountHasBeenSet(false),\n m_preferentialPolicyFlagHasBeenSet(false),\n m_zeroTaxFlagHasBeenSet(false),\n m_vatSpecialManagementHasBeenSet(false)\n{\n}\n\nCoreInternalOutcome CreateInvoiceItem::Deserialize(const Value &value)\n{\n string requestId = \"\";\n\n if (value.HasMember(\"Name\") && !value[\"Name\"].IsNull())\n {\n if (!value[\"Name\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Name` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_name = string(value[\"Name\"].GetString());\n m_nameHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxCode\") && !value[\"TaxCode\"].IsNull())\n {\n if (!value[\"TaxCode\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxCode` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_taxCode = string(value[\"TaxCode\"].GetString());\n m_taxCodeHasBeenSet = true;\n }\n\n if (value.HasMember(\"TotalPrice\") && !value[\"TotalPrice\"].IsNull())\n {\n if (!value[\"TotalPrice\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TotalPrice` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_totalPrice = value[\"TotalPrice\"].GetInt64();\n m_totalPriceHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxRate\") && !value[\"TaxRate\"].IsNull())\n {\n if (!value[\"TaxRate\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxRate` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_taxRate = value[\"TaxRate\"].GetInt64();\n m_taxRateHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxAmount\") && !value[\"TaxAmount\"].IsNull())\n {\n if (!value[\"TaxAmount\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxAmount` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_taxAmount = value[\"TaxAmount\"].GetInt64();\n m_taxAmountHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxType\") && !value[\"TaxType\"].IsNull())\n {\n if (!value[\"TaxType\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxType` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_taxType = string(value[\"TaxType\"].GetString());\n m_taxTypeHasBeenSet = true;\n }\n\n if (value.HasMember(\"Models\") && !value[\"Models\"].IsNull())\n {\n if (!value[\"Models\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Models` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_models = string(value[\"Models\"].GetString());\n m_modelsHasBeenSet = true;\n }\n\n if (value.HasMember(\"Unit\") && !value[\"Unit\"].IsNull())\n {\n if (!value[\"Unit\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Unit` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_unit = string(value[\"Unit\"].GetString());\n m_unitHasBeenSet = true;\n }\n\n if (value.HasMember(\"Total\") && !value[\"Total\"].IsNull())\n {\n if (!value[\"Total\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Total` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_total = string(value[\"Total\"].GetString());\n m_totalHasBeenSet = true;\n }\n\n if (value.HasMember(\"Price\") && !value[\"Price\"].IsNull())\n {\n if (!value[\"Price\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Price` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_price = string(value[\"Price\"].GetString());\n m_priceHasBeenSet = true;\n }\n\n if (value.HasMember(\"Discount\") && !value[\"Discount\"].IsNull())\n {\n if (!value[\"Discount\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Discount` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_discount = value[\"Discount\"].GetInt64();\n m_discountHasBeenSet = true;\n }\n\n if (value.HasMember(\"PreferentialPolicyFlag\") && !value[\"PreferentialPolicyFlag\"].IsNull())\n {\n if (!value[\"PreferentialPolicyFlag\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.PreferentialPolicyFlag` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_preferentialPolicyFlag = string(value[\"PreferentialPolicyFlag\"].GetString());\n m_preferentialPolicyFlagHasBeenSet = true;\n }\n\n if (value.HasMember(\"ZeroTaxFlag\") && !value[\"ZeroTaxFlag\"].IsNull())\n {\n if (!value[\"ZeroTaxFlag\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.ZeroTaxFlag` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_zeroTaxFlag = string(value[\"ZeroTaxFlag\"].GetString());\n m_zeroTaxFlagHasBeenSet = true;\n }\n\n if (value.HasMember(\"VatSpecialManagement\") && !value[\"VatSpecialManagement\"].IsNull())\n {\n if (!value[\"VatSpecialManagement\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.VatSpecialManagement` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_vatSpecialManagement = string(value[\"VatSpecialManagement\"].GetString());\n m_vatSpecialManagementHasBeenSet = true;\n }\n\n return CoreInternalOutcome(true);\n}\n\nvoid CreateInvoiceItem::ToJsonObject(Value &value, Document::AllocatorType& allocator) const\n{\n\n if (m_nameHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Name\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_name.c_str(), allocator).Move(), allocator);\n }\n\n if (m_taxCodeHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxCode\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_taxCode.c_str(), allocator).Move(), allocator);\n }\n\n if (m_totalPriceHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TotalPrice\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_totalPrice, allocator);\n }\n\n if (m_taxRateHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxRate\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_taxRate, allocator);\n }\n\n if (m_taxAmountHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxAmount\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_taxAmount, allocator);\n }\n\n if (m_taxTypeHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxType\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_taxType.c_str(), allocator).Move(), allocator);\n }\n\n if (m_modelsHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Models\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_models.c_str(), allocator).Move(), allocator);\n }\n\n if (m_unitHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Unit\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_unit.c_str(), allocator).Move(), allocator);\n }\n\n if (m_totalHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Total\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_total.c_str(), allocator).Move(), allocator);\n }\n\n if (m_priceHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Price\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_price.c_str(), allocator).Move(), allocator);\n }\n\n if (m_discountHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Discount\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_discount, allocator);\n }\n\n if (m_preferentialPolicyFlagHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"PreferentialPolicyFlag\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_preferentialPolicyFlag.c_str(), allocator).Move(), allocator);\n }\n\n if (m_zeroTaxFlagHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"ZeroTaxFlag\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_zeroTaxFlag.c_str(), allocator).Move(), allocator);\n }\n\n if (m_vatSpecialManagementHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"VatSpecialManagement\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_vatSpecialManagement.c_str(), allocator).Move(), allocator);\n }\n\n}\n\nstring CreateInvoiceItem::GetName() const\n{\n return m_name;\n}\n\nvoid CreateInvoiceItem::SetName(const string& _name)\n{\n m_name = _name;\n m_nameHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::NameHasBeenSet() const\n{\n return m_nameHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetTaxCode() const\n{\n return m_taxCode;\n}\n\nvoid CreateInvoiceItem::SetTaxCode(const string& _taxCode)\n{\n m_taxCode = _taxCode;\n m_taxCodeHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxCodeHasBeenSet() const\n{\n return m_taxCodeHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetTotalPrice() const\n{\n return m_totalPrice;\n}\n\nvoid CreateInvoiceItem::SetTotalPrice(const int64_t& _totalPrice)\n{\n m_totalPrice = _totalPrice;\n m_totalPriceHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TotalPriceHasBeenSet() const\n{\n return m_totalPriceHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetTaxRate() const\n{\n return m_taxRate;\n}\n\nvoid CreateInvoiceItem::SetTaxRate(const int64_t& _taxRate)\n{\n m_taxRate = _taxRate;\n m_taxRateHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxRateHasBeenSet() const\n{\n return m_taxRateHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetTaxAmount() const\n{\n return m_taxAmount;\n}\n\nvoid CreateInvoiceItem::SetTaxAmount(const int64_t& _taxAmount)\n{\n m_taxAmount = _taxAmount;\n m_taxAmountHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxAmountHasBeenSet() const\n{\n return m_taxAmountHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetTaxType() const\n{\n return m_taxType;\n}\n\nvoid CreateInvoiceItem::SetTaxType(const string& _taxType)\n{\n m_taxType = _taxType;\n m_taxTypeHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxTypeHasBeenSet() const\n{\n return m_taxTypeHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetModels() const\n{\n return m_models;\n}\n\nvoid CreateInvoiceItem::SetModels(const string& _models)\n{\n m_models = _models;\n m_modelsHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::ModelsHasBeenSet() const\n{\n return m_modelsHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetUnit() const\n{\n return m_unit;\n}\n\nvoid CreateInvoiceItem::SetUnit(const string& _unit)\n{\n m_unit = _unit;\n m_unitHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::UnitHasBeenSet() const\n{\n return m_unitHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetTotal() const\n{\n return m_total;\n}\n\nvoid CreateInvoiceItem::SetTotal(const string& _total)\n{\n m_total = _total;\n m_totalHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TotalHasBeenSet() const\n{\n return m_totalHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetPrice() const\n{\n return m_price;\n}\n\nvoid CreateInvoiceItem::SetPrice(const string& _price)\n{\n m_price = _price;\n m_priceHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::PriceHasBeenSet() const\n{\n return m_priceHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetDiscount() const\n{\n return m_discount;\n}\n\nvoid CreateInvoiceItem::SetDiscount(const int64_t& _discount)\n{\n m_discount = _discount;\n m_discountHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::DiscountHasBeenSet() const\n{\n return m_discountHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetPreferentialPolicyFlag() const\n{\n return m_preferentialPolicyFlag;\n}\n\nvoid CreateInvoiceItem::SetPreferentialPolicyFlag(const string& _preferentialPolicyFlag)\n{\n m_preferentialPolicyFlag = _preferentialPolicyFlag;\n m_preferentialPolicyFlagHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::PreferentialPolicyFlagHasBeenSet() const\n{\n return m_preferentialPolicyFlagHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetZeroTaxFlag() const\n{\n return m_zeroTaxFlag;\n}\n\nvoid CreateInvoiceItem::SetZeroTaxFlag(const string& _zeroTaxFlag)\n{\n m_zeroTaxFlag = _zeroTaxFlag;\n m_zeroTaxFlagHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::ZeroTaxFlagHasBeenSet() const\n{\n return m_zeroTaxFlagHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetVatSpecialManagement() const\n{\n return m_vatSpecialManagement;\n}\n\nvoid CreateInvoiceItem::SetVatSpecialManagement(const string& _vatSpecialManagement)\n{\n m_vatSpecialManagement = _vatSpecialManagement;\n m_vatSpecialManagementHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::VatSpecialManagementHasBeenSet() const\n{\n return m_vatSpecialManagementHasBeenSet;\n}\n\n"},"prefix":{"kind":"string","value":"\n\n#include <tencentcloud/cpdp/v20190820/model/CreateInvoiceItem.h>\n\nusing TencentCloud::CoreInternalOutcome;\nusing namespace TencentCloud::Cpdp::V20190820::Model;\nusing namespace rapidjson;\nusing namespace std;\n\nCreateInvoiceItem::CreateInvoiceItem() :\n m_nameHasBeenSet(false),\n m_taxCodeHasBeenSet(false),\n m_totalPriceHasBeenSet(false),\n m_taxRateHasBeenSet(false),\n m_taxAmountHasBeenSet(false),\n m_taxTypeHasBeenSet(false),\n m_modelsHasBeenSet(false),\n m_unitHasBeenSet(false),\n m_totalHasBeenSet(false),\n m_priceHasBeenSet(false),\n m_discountHasBeenSet(false),\n m_preferentialPolicyFlagHasBeenSet(false),\n m_zeroTaxFlagHasBeenSet(false),\n m_vatSpecialManagementHasBeenSet(false)\n{\n}\n\n"},"suffix":{"kind":"string","value":"\n\nvoid CreateInvoiceItem::ToJsonObject(Value &value, Document::AllocatorType& allocator) const\n{\n\n if (m_nameHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Name\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_name.c_str(), allocator).Move(), allocator);\n }\n\n if (m_taxCodeHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxCode\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_taxCode.c_str(), allocator).Move(), allocator);\n }\n\n if (m_totalPriceHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TotalPrice\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_totalPrice, allocator);\n }\n\n if (m_taxRateHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxRate\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_taxRate, allocator);\n }\n\n if (m_taxAmountHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxAmount\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_taxAmount, allocator);\n }\n\n if (m_taxTypeHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"TaxType\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_taxType.c_str(), allocator).Move(), allocator);\n }\n\n if (m_modelsHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Models\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_models.c_str(), allocator).Move(), allocator);\n }\n\n if (m_unitHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Unit\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_unit.c_str(), allocator).Move(), allocator);\n }\n\n if (m_totalHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Total\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_total.c_str(), allocator).Move(), allocator);\n }\n\n if (m_priceHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Price\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_price.c_str(), allocator).Move(), allocator);\n }\n\n if (m_discountHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"Discount\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, m_discount, allocator);\n }\n\n if (m_preferentialPolicyFlagHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"PreferentialPolicyFlag\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_preferentialPolicyFlag.c_str(), allocator).Move(), allocator);\n }\n\n if (m_zeroTaxFlagHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"ZeroTaxFlag\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_zeroTaxFlag.c_str(), allocator).Move(), allocator);\n }\n\n if (m_vatSpecialManagementHasBeenSet)\n {\n Value iKey(kStringType);\n string key = \"VatSpecialManagement\";\n iKey.SetString(key.c_str(), allocator);\n value.AddMember(iKey, Value(m_vatSpecialManagement.c_str(), allocator).Move(), allocator);\n }\n\n}\n\nstring CreateInvoiceItem::GetName() const\n{\n return m_name;\n}\n\nvoid CreateInvoiceItem::SetName(const string& _name)\n{\n m_name = _name;\n m_nameHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::NameHasBeenSet() const\n{\n return m_nameHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetTaxCode() const\n{\n return m_taxCode;\n}\n\nvoid CreateInvoiceItem::SetTaxCode(const string& _taxCode)\n{\n m_taxCode = _taxCode;\n m_taxCodeHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxCodeHasBeenSet() const\n{\n return m_taxCodeHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetTotalPrice() const\n{\n return m_totalPrice;\n}\n\nvoid CreateInvoiceItem::SetTotalPrice(const int64_t& _totalPrice)\n{\n m_totalPrice = _totalPrice;\n m_totalPriceHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TotalPriceHasBeenSet() const\n{\n return m_totalPriceHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetTaxRate() const\n{\n return m_taxRate;\n}\n\nvoid CreateInvoiceItem::SetTaxRate(const int64_t& _taxRate)\n{\n m_taxRate = _taxRate;\n m_taxRateHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxRateHasBeenSet() const\n{\n return m_taxRateHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetTaxAmount() const\n{\n return m_taxAmount;\n}\n\nvoid CreateInvoiceItem::SetTaxAmount(const int64_t& _taxAmount)\n{\n m_taxAmount = _taxAmount;\n m_taxAmountHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxAmountHasBeenSet() const\n{\n return m_taxAmountHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetTaxType() const\n{\n return m_taxType;\n}\n\nvoid CreateInvoiceItem::SetTaxType(const string& _taxType)\n{\n m_taxType = _taxType;\n m_taxTypeHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TaxTypeHasBeenSet() const\n{\n return m_taxTypeHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetModels() const\n{\n return m_models;\n}\n\nvoid CreateInvoiceItem::SetModels(const string& _models)\n{\n m_models = _models;\n m_modelsHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::ModelsHasBeenSet() const\n{\n return m_modelsHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetUnit() const\n{\n return m_unit;\n}\n\nvoid CreateInvoiceItem::SetUnit(const string& _unit)\n{\n m_unit = _unit;\n m_unitHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::UnitHasBeenSet() const\n{\n return m_unitHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetTotal() const\n{\n return m_total;\n}\n\nvoid CreateInvoiceItem::SetTotal(const string& _total)\n{\n m_total = _total;\n m_totalHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::TotalHasBeenSet() const\n{\n return m_totalHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetPrice() const\n{\n return m_price;\n}\n\nvoid CreateInvoiceItem::SetPrice(const string& _price)\n{\n m_price = _price;\n m_priceHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::PriceHasBeenSet() const\n{\n return m_priceHasBeenSet;\n}\n\nint64_t CreateInvoiceItem::GetDiscount() const\n{\n return m_discount;\n}\n\nvoid CreateInvoiceItem::SetDiscount(const int64_t& _discount)\n{\n m_discount = _discount;\n m_discountHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::DiscountHasBeenSet() const\n{\n return m_discountHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetPreferentialPolicyFlag() const\n{\n return m_preferentialPolicyFlag;\n}\n\nvoid CreateInvoiceItem::SetPreferentialPolicyFlag(const string& _preferentialPolicyFlag)\n{\n m_preferentialPolicyFlag = _preferentialPolicyFlag;\n m_preferentialPolicyFlagHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::PreferentialPolicyFlagHasBeenSet() const\n{\n return m_preferentialPolicyFlagHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetZeroTaxFlag() const\n{\n return m_zeroTaxFlag;\n}\n\nvoid CreateInvoiceItem::SetZeroTaxFlag(const string& _zeroTaxFlag)\n{\n m_zeroTaxFlag = _zeroTaxFlag;\n m_zeroTaxFlagHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::ZeroTaxFlagHasBeenSet() const\n{\n return m_zeroTaxFlagHasBeenSet;\n}\n\nstring CreateInvoiceItem::GetVatSpecialManagement() const\n{\n return m_vatSpecialManagement;\n}\n\nvoid CreateInvoiceItem::SetVatSpecialManagement(const string& _vatSpecialManagement)\n{\n m_vatSpecialManagement = _vatSpecialManagement;\n m_vatSpecialManagementHasBeenSet = true;\n}\n\nbool CreateInvoiceItem::VatSpecialManagementHasBeenSet() const\n{\n return m_vatSpecialManagementHasBeenSet;\n}\n\n"},"middle":{"kind":"string","value":"CoreInternalOutcome CreateInvoiceItem::Deserialize(const Value &value)\n{\n string requestId = \"\";\n\n if (value.HasMember(\"Name\") && !value[\"Name\"].IsNull())\n {\n if (!value[\"Name\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Name` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_name = string(value[\"Name\"].GetString());\n m_nameHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxCode\") && !value[\"TaxCode\"].IsNull())\n {\n if (!value[\"TaxCode\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxCode` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_taxCode = string(value[\"TaxCode\"].GetString());\n m_taxCodeHasBeenSet = true;\n }\n\n if (value.HasMember(\"TotalPrice\") && !value[\"TotalPrice\"].IsNull())\n {\n if (!value[\"TotalPrice\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TotalPrice` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_totalPrice = value[\"TotalPrice\"].GetInt64();\n m_totalPriceHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxRate\") && !value[\"TaxRate\"].IsNull())\n {\n if (!value[\"TaxRate\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxRate` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_taxRate = value[\"TaxRate\"].GetInt64();\n m_taxRateHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxAmount\") && !value[\"TaxAmount\"].IsNull())\n {\n if (!value[\"TaxAmount\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxAmount` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_taxAmount = value[\"TaxAmount\"].GetInt64();\n m_taxAmountHasBeenSet = true;\n }\n\n if (value.HasMember(\"TaxType\") && !value[\"TaxType\"].IsNull())\n {\n if (!value[\"TaxType\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.TaxType` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_taxType = string(value[\"TaxType\"].GetString());\n m_taxTypeHasBeenSet = true;\n }\n\n if (value.HasMember(\"Models\") && !value[\"Models\"].IsNull())\n {\n if (!value[\"Models\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Models` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_models = string(value[\"Models\"].GetString());\n m_modelsHasBeenSet = true;\n }\n\n if (value.HasMember(\"Unit\") && !value[\"Unit\"].IsNull())\n {\n if (!value[\"Unit\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Unit` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_unit = string(value[\"Unit\"].GetString());\n m_unitHasBeenSet = true;\n }\n\n if (value.HasMember(\"Total\") && !value[\"Total\"].IsNull())\n {\n if (!value[\"Total\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Total` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_total = string(value[\"Total\"].GetString());\n m_totalHasBeenSet = true;\n }\n\n if (value.HasMember(\"Price\") && !value[\"Price\"].IsNull())\n {\n if (!value[\"Price\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Price` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_price = string(value[\"Price\"].GetString());\n m_priceHasBeenSet = true;\n }\n\n if (value.HasMember(\"Discount\") && !value[\"Discount\"].IsNull())\n {\n if (!value[\"Discount\"].IsInt64())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.Discount` IsInt64=false incorrectly\").SetRequestId(requestId));\n }\n m_discount = value[\"Discount\"].GetInt64();\n m_discountHasBeenSet = true;\n }\n\n if (value.HasMember(\"PreferentialPolicyFlag\") && !value[\"PreferentialPolicyFlag\"].IsNull())\n {\n if (!value[\"PreferentialPolicyFlag\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.PreferentialPolicyFlag` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_preferentialPolicyFlag = string(value[\"PreferentialPolicyFlag\"].GetString());\n m_preferentialPolicyFlagHasBeenSet = true;\n }\n\n if (value.HasMember(\"ZeroTaxFlag\") && !value[\"ZeroTaxFlag\"].IsNull())\n {\n if (!value[\"ZeroTaxFlag\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.ZeroTaxFlag` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_zeroTaxFlag = string(value[\"ZeroTaxFlag\"].GetString());\n m_zeroTaxFlagHasBeenSet = true;\n }\n\n if (value.HasMember(\"VatSpecialManagement\") && !value[\"VatSpecialManagement\"].IsNull())\n {\n if (!value[\"VatSpecialManagement\"].IsString())\n {\n return CoreInternalOutcome(Error(\"response `CreateInvoiceItem.VatSpecialManagement` IsString=false incorrectly\").SetRequestId(requestId));\n }\n m_vatSpecialManagement = string(value[\"VatSpecialManagement\"].GetString());\n m_vatSpecialManagementHasBeenSet = true;\n }\n\n return CoreInternalOutcome(true);\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":298,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/tracking/multi_tracker.cpp"},"repo_name":{"kind":"string","value":"PPokorski/laser_object_tracker"},"commit":{"kind":"string","value":"bc967459218b417c7e0e97603464e77f110e25ef"},"file_code":{"kind":"string","value":"\n\n#include \"laser_object_tracker/tracking/multi_tracker.hpp\"\n\n#include <numeric>\n\nnamespace laser_object_tracker {\nnamespace tracking {\nMultiTracker::MultiTracker(DistanceFunctor distance_calculator,\n std::unique_ptr<data_association::BaseDataAssociation> data_association,\n std::unique_ptr<BaseTracking> tracker_prototype,\n std::unique_ptr<BaseTrackerRejection> tracker_rejector_prototype)\n : distance_calculator_(std::move(distance_calculator)),\n data_association_(std::move(data_association)),\n tracker_prototype_(std::move(tracker_prototype)),\n tracker_rejector_prototype_(std::move(tracker_rejector_prototype)) {}\n\nvoid MultiTracker::predict() {\n for (auto& tracker : trackers_) {\n tracker->predict();\n }\n}\n\nvoid MultiTracker::update(const std::vector<Eigen::VectorXd>& measurements) {\n Eigen::MatrixXd cost_matrix = buildCostMatrix(measurements);\n\n Eigen::VectorXi assignment_vector = buildAssignmentVector(cost_matrix);\n\n updateAndInitializeTracks(measurements, assignment_vector);\n\n handleNotUpdatedTracks(assignment_vector);\n\n handleRejectedTracks();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::begin() const {\n return trackers_.begin();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::end() const {\n return trackers_.end();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::cbegin() const {\n return trackers_.cbegin();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::cend() const {\n return trackers_.cend();\n}\n\nconst BaseTracking& MultiTracker::at(int index) const {\n return *trackers_.at(index);\n}\n\nint MultiTracker::size() const {\n return trackers_.size();\n}\n\nEigen::MatrixXd MultiTracker::buildCostMatrix(const std::vector<Eigen::VectorXd>& measurements) {\n Eigen::MatrixXd cost_matrix(trackers_.size(), measurements.size());\n for (int row = 0; row < cost_matrix.rows(); ++row) {\n for (int col = 0; col < cost_matrix.cols(); ++col) {\n cost_matrix(row, col) = distance_calculator_(measurements.at(col), *trackers_.at(row));\n }\n }\n\n return cost_matrix;\n}\n\nEigen::VectorXi MultiTracker::buildAssignmentVector(const Eigen::MatrixXd& cost_matrix) {\n Eigen::VectorXi assignment_vector;\n data_association_->solve(cost_matrix, data_association_->NOT_NEEDED, assignment_vector);\n\n return assignment_vector;\n}\n\nvoid MultiTracker::updateAndInitializeTracks(const std::vector<Eigen::VectorXd>& measurements,\n const Eigen::VectorXi& assignment_vector) {\n for (int i = 0; i < measurements.size(); ++i) {\n if (assignment_vector(i) != data_association_->NO_ASSIGNMENT) {\n int tracker_index = assignment_vector(i);\n trackers_.at(tracker_index)->update(measurements.at(i));\n trackers_rejections_.at(tracker_index)->updated(*trackers_.at(tracker_index));\n } else {\n trackers_.push_back(std::move(tracker_prototype_->clone()));\n trackers_.back()->initFromMeasurement(measurements.at(i));\n trackers_rejections_.push_back(std::move(tracker_rejector_prototype_->clone()));\n }\n }\n}\n\nvoid MultiTracker::handleNotUpdatedTracks(const Eigen::VectorXi& assignment_vector) {\n std::vector<int> trackers_indices(trackers_.size());\n std::iota(trackers_indices.begin(), trackers_indices.end(), 0);\n\n std::vector<int> updated_trackers(assignment_vector.data(), assignment_vector.data() + assignment_vector.size());\n std::sort(updated_trackers.begin(), updated_trackers.end());\n\n std::vector<int> not_updated_trackers;\n not_updated_trackers.reserve(trackers_indices.size());\n std::set_difference(trackers_indices.begin(),\n trackers_indices.end(),\n updated_trackers.begin(),\n updated_trackers.end(),\n std::back_inserter(not_updated_trackers));\n\n for (int index : not_updated_trackers) {\n trackers_rejections_.at(index)->notUpdated(*trackers_.at(index));\n }\n}\n\nvoid MultiTracker::handleRejectedTracks() {\n auto trackers_it = trackers_.cbegin();\n auto rejectors_it = trackers_rejections_.cbegin();\n for (; trackers_it != trackers_.cend(); ) {\n const auto& tracker = **trackers_it;\n const auto& rejector = **rejectors_it;\n if (rejector.invalidate(tracker)) {\n trackers_it = trackers_.erase(trackers_it);\n rejectors_it = trackers_rejections_.erase(rejectors_it);\n } else {\n ++trackers_it;\n ++rejectors_it;\n }\n }\n}\n} \n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"laser_object_tracker/tracking/multi_tracker.hpp\"\n\n#include <numeric>\n\nnamespace laser_object_tracker {\nnamespace tracking {\nMultiTracker::MultiTracker(DistanceFunctor distance_calculator,\n std::unique_ptr<data_association::BaseDataAssociation> data_association,\n std::unique_ptr<BaseTracking> tracker_prototype,\n std::unique_ptr<BaseTrackerRejection> tracker_rejector_prototype)\n : distance_calculator_(std::move(distance_calculator)),\n data_association_(std::move(data_association)),\n tracker_prototype_(std::move(tracker_prototype)),\n tracker_rejector_prototype_(std::move(tracker_rejector_prototype)) {}\n\nvoid MultiTracker::predict() {\n for (auto& tracker : trackers_) {\n tracker->predict();\n }\n}\n\nvoid MultiTracker::update(const std::vector<Eigen::VectorXd>& measurements) {\n Eigen::MatrixXd cost_matrix = buildCostMatrix(measurements);\n\n Eigen::VectorXi assignment_vector = buildAssignmentVector(cost_matrix);\n\n updateAndInitializeTracks(measurements, assignment_vector);\n\n handleNotUpdatedTracks(assignment_vector);\n\n handleRejectedTracks();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::begin() const {\n return trackers_.begin();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::end() const {\n return trackers_.end();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::cbegin() const {\n return trackers_.cbegin();\n}\n\nstd::vector<std::unique_ptr<BaseTracking>>::const_iterator MultiTracker::cend() const {\n return trackers_.cend();\n}\n\nconst BaseTracking& MultiTracker::at(int index) const {\n return *trackers_.at(index);\n}\n\nint MultiTracker::size() const {\n return trackers_.size();\n}\n\nEigen::MatrixXd MultiTracker::buildCostMatrix(const std::vector<Eigen::VectorXd>& measurements) {\n Eigen::MatrixXd cost_matrix(trackers_.size(), measurements.size());\n for (int row = 0; row < cost_matrix.rows(); ++row) {\n for (int col = 0; col < cost_matrix.cols(); ++col) {\n cost_matrix(row, col) = distance_calculator_(measurements.at(col), *trackers_.at(row));\n }\n }\n\n return cost_matrix;\n}\n\nEigen::VectorXi MultiTracker::buildAssignmentVector(const Eigen::MatrixXd& cost_matrix) {\n Eigen::VectorXi assignment_vector;\n data_association_->solve(cost_matrix, data_association_->NOT_NEEDED, assignment_vector);\n\n return assignment_vector;\n}\n\nvoid MultiTracker::updateAndInitializeTracks(const std::vector<Eigen::VectorXd>& measurements,\n const Eigen::VectorXi& assignment_vector) {\n for (int i = 0; i < measurements.size(); ++i) {\n if (assignment_vector(i) != data_association_->NO_ASSIGNMENT) {\n int tracker_index = assignment_vector(i);\n trackers_.at(tracker_index)->update(measurements.at(i));\n trackers_rejections_.at(tracker_index)->updated(*trackers_.at(tracker_index));\n } else {\n trackers_.push_back(std::move(tracker_prototype_->clone()));\n trackers_.back()->initFromMeasurement(measurements.at(i));\n trackers_rejections_.push_back(std::move(tracker_rejector_prototype_->clone()));\n }\n }\n}\n\n"},"suffix":{"kind":"string","value":"\n\nvoid MultiTracker::handleRejectedTracks() {\n auto trackers_it = trackers_.cbegin();\n auto rejectors_it = trackers_rejections_.cbegin();\n for (; trackers_it != trackers_.cend(); ) {\n const auto& tracker = **trackers_it;\n const auto& rejector = **rejectors_it;\n if (rejector.invalidate(tracker)) {\n trackers_it = trackers_.erase(trackers_it);\n rejectors_it = trackers_rejections_.erase(rejectors_it);\n } else {\n ++trackers_it;\n ++rejectors_it;\n }\n }\n}\n} \n} \n"},"middle":{"kind":"string","value":"void MultiTracker::handleNotUpdatedTracks(const Eigen::VectorXi& assignment_vector) {\n std::vector<int> trackers_indices(trackers_.size());\n std::iota(trackers_indices.begin(), trackers_indices.end(), 0);\n\n std::vector<int> updated_trackers(assignment_vector.data(), assignment_vector.data() + assignment_vector.size());\n std::sort(updated_trackers.begin(), updated_trackers.end());\n\n std::vector<int> not_updated_trackers;\n not_updated_trackers.reserve(trackers_indices.size());\n std::set_difference(trackers_indices.begin(),\n trackers_indices.end(),\n updated_trackers.begin(),\n updated_trackers.end(),\n std::back_inserter(not_updated_trackers));\n\n for (int index : not_updated_trackers) {\n trackers_rejections_.at(index)->notUpdated(*trackers_.at(index));\n }\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_TRACKING_HPP\n\n#define LASER_OBJECT_TRACKER_TRACKING_TRACKING_HPP\n\n\n\n#include \"laser_object_tracker/tracking/base_tracker_rejection.hpp\"\n\n#include \"laser_object_tracker/tracking/base_tracking.hpp\"\n\n#include \"laser_object_tracker/tracking/iteration_tracker_rejection.hpp\"\n\n#include \"laser_object_tracker/tracking/kalman_filter.hpp\"\n\n#include \"laser_object_tracker/tracking/multi_tracker.hpp\"\n\n\n\n#endif // LASER_OBJECT_TRACKER_TRACKING_TRACKING_HPP\n","file_path":"include/laser_object_tracker/tracking/tracking.hpp","rank":0,"score":113729.64539441212},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/tracking/tracking.hpp","rank":1,"score":113714.37475258336},{"content":"class BaseTracking {\n\n public:\n\n BaseTracking(int state_dimensions, int measurement_dimensions);\n\n\n\n virtual void initFromState(const Eigen::VectorXd& init_state) = 0;\n\n\n\n virtual void initFromState();\n\n\n\n virtual void initFromMeasurement(const Eigen::VectorXd& measurement) = 0;\n\n\n\n virtual void initFromMeasurement();\n\n\n\n virtual void predict() = 0;\n\n\n\n virtual void update(const Eigen::VectorXd& measurement) = 0;\n\n\n\n virtual Eigen::VectorXd getStateVector() const = 0;\n\n\n\n virtual std::unique_ptr<BaseTracking> clone() const = 0;\n\n\n\n virtual ~BaseTracking() = default;\n\n\n\n protected:\n\n int state_dimensions_, measurement_dimensions_;\n\n};\n\n} // namespace tracking\n\n} // namespace laser_object_tracker\n\n\n\n#endif //LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKING_HPP\n","file_path":"include/laser_object_tracker/tracking/base_tracking.hpp","rank":2,"score":111660.48448213535},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKING_HPP\n\n#define LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKING_HPP\n\n\n\n#include <memory>\n\n\n\n#include <Eigen/Core>\n\n\n\nnamespace laser_object_tracker {\n\nnamespace tracking {\n\n\n","file_path":"include/laser_object_tracker/tracking/base_tracking.hpp","rank":3,"score":111603.92013482649},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/tracking/base_tracking.hpp","rank":4,"score":111585.75436521549},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_MULTI_TRACKER_H\n\n#define LASER_OBJECT_TRACKER_TRACKING_MULTI_TRACKER_H\n\n\n\n#include <vector>\n\n\n\n#include \"laser_object_tracker/data_association/base_data_association.hpp\"\n\n#include \"laser_object_tracker/tracking/base_tracker_rejection.hpp\"\n\n#include \"laser_object_tracker/tracking/base_tracking.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace tracking {\n","file_path":"include/laser_object_tracker/tracking/multi_tracker.hpp","rank":5,"score":110906.09565746282},{"content":" void handleNotUpdatedTracks(const Eigen::VectorXi& assignment_vector);\n\n\n\n void handleRejectedTracks();\n\n\n\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator begin() const;\n\n\n\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator end() const;\n\n\n\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator cbegin() const;\n\n\n\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator cend() const;\n\n\n\n const BaseTracking& at(int index) const;\n\n\n\n int size() const;\n\n\n\n private:\n\n DistanceFunctor distance_calculator_;\n\n std::unique_ptr<data_association::BaseDataAssociation> data_association_;\n\n\n","file_path":"include/laser_object_tracker/tracking/multi_tracker.hpp","rank":6,"score":110904.8190737856},{"content":" std::unique_ptr<BaseTracking> tracker_prototype_;\n\n std::vector<std::unique_ptr<BaseTracking>> trackers_;\n\n\n\n std::unique_ptr<BaseTrackerRejection> tracker_rejector_prototype_;\n\n std::vector<std::unique_ptr<BaseTrackerRejection>> trackers_rejections_;\n\n};\n\n} // namespace tracking\n\n} // namespace laser_object_tracker\n\n\n\n#endif //LASER_OBJECT_TRACKER_TRACKING_MULTI_TRACKER_H\n","file_path":"include/laser_object_tracker/tracking/multi_tracker.hpp","rank":7,"score":110901.83642008188},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/tracking/multi_tracker.hpp","rank":8,"score":110887.37369432811},{"content":"class MultiTracker {\n\n public:\n\n using DistanceFunctor = std::function<double(const Eigen::VectorXd&, const BaseTracking&)>;\n\n\n\n MultiTracker(DistanceFunctor distance_calculator,\n\n std::unique_ptr<data_association::BaseDataAssociation> data_association,\n\n std::unique_ptr<BaseTracking> tracker_prototype,\n\n std::unique_ptr<BaseTrackerRejection> tracker_rejector_prototype);\n\n\n\n void predict();\n\n\n\n void update(const std::vector<Eigen::VectorXd>& measurements);\n\n\n\n Eigen::MatrixXd buildCostMatrix(const std::vector<Eigen::VectorXd>& measurements);\n\n\n\n Eigen::VectorXi buildAssignmentVector(const Eigen::MatrixXd& cost_matrix);\n\n\n\n void updateAndInitializeTracks(const std::vector<Eigen::VectorXd>& measurements,\n\n const Eigen::VectorXi& assignment_vector);\n\n\n","file_path":"include/laser_object_tracker/tracking/multi_tracker.hpp","rank":9,"score":110601.5526987534},{"content":"class MockTrackerRejection : public laser_object_tracker::tracking::BaseTrackerRejection {\n\n MOCK_CONST_METHOD1(invalidate, bool(const laser_object_tracker::tracking::BaseTracking& tracker));\n\n\n\n std::unique_ptr<BaseTrackerRejection> clone() const override {\n\n return std::unique_ptr<BaseTrackerRejection>(new MockTrackerRejection());\n\n }\n\n};\n\n\n\n} // namespace test\n\n\n\n#endif //TEST_TEST_TRACKING_MOCKS_HPP\n","file_path":"test/include/test/tracking/mocks.hpp","rank":10,"score":108880.96727942834},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKER_REJECTION_HPP\n\n#define LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKER_REJECTION_HPP\n\n\n\n#include \"laser_object_tracker/tracking/base_tracking.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace tracking {\n\n\n","file_path":"include/laser_object_tracker/tracking/base_tracker_rejection.hpp","rank":11,"score":108844.52089006154},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_ITERATION_TRACKER_REJECTION_HPP\n\n#define LASER_OBJECT_TRACKER_TRACKING_ITERATION_TRACKER_REJECTION_HPP\n\n\n\n#include \"laser_object_tracker/tracking/base_tracker_rejection.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace tracking {\n\n\n","file_path":"include/laser_object_tracker/tracking/iteration_tracker_rejection.hpp","rank":12,"score":108844.41375443932},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/tracking/base_tracker_rejection.hpp","rank":13,"score":108826.14027406639},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/tracking/iteration_tracker_rejection.hpp","rank":14,"score":108826.14027406642},{"content":"class BaseTrackerRejection {\n\n public:\n\n virtual bool invalidate(const BaseTracking& tracker) const = 0;\n\n\n\n virtual void updated(const BaseTracking& tracker) {}\n\n\n\n virtual void notUpdated(const BaseTracking& tracker) {}\n\n\n\n virtual std::unique_ptr<BaseTrackerRejection> clone() const = 0;\n\n};\n\n\n\n} // namespace tracking\n\n} // namespace laser_object_tracker\n\n\n\n#endif //LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKER_REJECTION_HPP\n","file_path":"include/laser_object_tracker/tracking/base_tracker_rejection.hpp","rank":15,"score":107057.33943102525},{"content":"class MockTracking : public laser_object_tracker::tracking::BaseTracking {\n\n public:\n\n MockTracking() : BaseTracking(0, 0) {}\n\n\n\n MockTracking(int s, int m) : BaseTracking(0, 0) {}\n\n\n\n MOCK_METHOD1(initFromState, void(const Eigen::VectorXd&));\n\n\n\n MOCK_METHOD1(initFromMeasurement, void(const Eigen::VectorXd&));\n\n\n\n MOCK_METHOD0(predict, void());\n\n\n\n MOCK_METHOD1(update, void(const Eigen::VectorXd&));\n\n\n\n MOCK_CONST_METHOD0(getStateVector, Eigen::VectorXd());\n\n\n\n std::unique_ptr<BaseTracking> clone() const override {\n\n return std::unique_ptr<BaseTracking>(new MockTracking());\n\n }\n\n};\n\n\n","file_path":"test/include/test/tracking/mocks.hpp","rank":16,"score":106050.53427492321},{"content":"class IterationTrackerRejection : public BaseTrackerRejection {\n\n public:\n\n explicit IterationTrackerRejection(int max_iterations_without_update);\n\n\n\n bool invalidate(const BaseTracking& tracker) const override;\n\n\n\n void updated(const BaseTracking& tracker) override;\n\n\n\n void notUpdated(const BaseTracking& tracker) override;\n\n\n\n std::unique_ptr<BaseTrackerRejection> clone() const override;\n\n\n\n int getMaxIterationsWithoutUpdate() const;\n\n\n\n void setMaxIterationsWithoutUpdate(int max_iterations_without_update);\n\n private:\n\n int max_iterations_without_update_, iterations_without_update_;\n\n};\n\n\n\n} // namespace tracking\n\n} // namespace laser_object_tracker\n\n\n\n#endif //LASER_OBJECT_TRACKER_TRACKING_ITERATION_TRACKER_REJECTION_HPP\n","file_path":"include/laser_object_tracker/tracking/iteration_tracker_rejection.hpp","rank":17,"score":103223.66338046256},{"content":" void initFromMeasurement(const Eigen::VectorXd& measurement) override;\n\n\n\n void predict() override;\n\n\n\n void update(const Eigen::VectorXd& measurement) override;\n\n\n\n Eigen::VectorXd getStateVector() const override;\n\n\n\n std::unique_ptr<BaseTracking> clone() const override;\n\n\n\nprivate:\n\n void copyMats(const KalmanFilter& other);\n\n\n\n cv::KalmanFilter kalman_filter_;\n\n cv::Mat inverse_measurement_matrix_;\n\n};\n\n} // namespace tracking\n\n} // namespace laser_object_tracker\n\n\n\n#endif //LASER_OBJECT_TRACKER_TRACKING_KALMAN_FILTER_HPP\n","file_path":"include/laser_object_tracker/tracking/kalman_filter.hpp","rank":18,"score":103027.09116375758},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_KALMAN_FILTER_HPP\n\n#define LASER_OBJECT_TRACKER_TRACKING_KALMAN_FILTER_HPP\n\n\n\n#include <opencv2/video/tracking.hpp>\n\n\n\n#include \"laser_object_tracker/tracking/base_tracking.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace tracking {\n","file_path":"include/laser_object_tracker/tracking/kalman_filter.hpp","rank":19,"score":103022.26528416884},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/tracking/kalman_filter.hpp","rank":20,"score":103003.92647213789},{"content":"class KalmanFilter : public BaseTracking {\n\n public:\n\n KalmanFilter(int state_dimensions,\n\n int measurement_dimensions,\n\n const Eigen::MatrixXd& transition_matrix,\n\n const Eigen::MatrixXd& measurement_matrix,\n\n const Eigen::MatrixXd& measurement_noise_covariance,\n\n const Eigen::MatrixXd& initial_state_covariance,\n\n const Eigen::MatrixXd& process_noise_covariance);\n\n\n\n KalmanFilter(const KalmanFilter& other) noexcept;\n\n\n\n KalmanFilter(KalmanFilter&& other) noexcept = default;\n\n\n\n KalmanFilter& operator=(const KalmanFilter& other) noexcept;\n\n\n\n KalmanFilter& operator=(KalmanFilter&& other) noexcept = default;\n\n\n\n void initFromState(const Eigen::VectorXd& init_state) override;\n\n\n","file_path":"include/laser_object_tracker/tracking/kalman_filter.hpp","rank":21,"score":102080.41015656681},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef TEST_TEST_TRACKING_MOCKS_HPP\n\n#define TEST_TEST_TRACKING_MOCKS_HPP\n\n\n\n#include <gmock/gmock.h>\n\n\n\n#include \"laser_object_tracker/tracking/base_tracking.hpp\"\n\n\n\nnamespace test {\n","file_path":"test/include/test/tracking/mocks.hpp","rank":30,"score":73026.00110554376},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"test/include/test/tracking/mocks.hpp","rank":31,"score":73010.04178133917},{"content":" iterations_without_update_(0) {}\n\n\n\nbool IterationTrackerRejection::invalidate(const BaseTracking& tracker) const {\n\n return iterations_without_update_ > max_iterations_without_update_;\n\n}\n\n\n\nvoid IterationTrackerRejection::updated(const BaseTracking& tracker) {\n\n iterations_without_update_ = 0;\n\n}\n\n\n\nvoid IterationTrackerRejection::notUpdated(const BaseTracking& tracker) {\n\n ++iterations_without_update_;\n\n}\n\n\n\nstd::unique_ptr<BaseTrackerRejection> IterationTrackerRejection::clone() const {\n\n return std::unique_ptr<BaseTrackerRejection>(new IterationTrackerRejection(*this));\n\n}\n\n\n\nint IterationTrackerRejection::getMaxIterationsWithoutUpdate() const {\n\n return max_iterations_without_update_;\n\n}\n\n\n\nvoid IterationTrackerRejection::setMaxIterationsWithoutUpdate(int max_iterations_without_update) {\n\n max_iterations_without_update_ = max_iterations_without_update;\n\n}\n\n} // namespace tracking\n\n} // namespace laser_object_tracker\n","file_path":"src/tracking/iteration_tracker_rejection.cpp","rank":32,"score":72605.06829454323},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#include \"laser_object_tracker/tracking/iteration_tracker_rejection.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace tracking {\n\n\n\nIterationTrackerRejection::IterationTrackerRejection(int max_iterations_without_update)\n\n : max_iterations_without_update_(max_iterations_without_update),\n","file_path":"src/tracking/iteration_tracker_rejection.cpp","rank":33,"score":72603.35916499073},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"src/tracking/iteration_tracker_rejection.cpp","rank":34,"score":72582.82411071574},{"content":" void publishAssignments(const tracking::MultiTracker& multi_tracker,\n\n const std::vector<Eigen::VectorXd>& measurements,\n\n const Eigen::MatrixXd& cost_matrix,\n\n const Eigen::VectorXi& assignment_vector);\n\n\n\n private:\n\n void expandToNColors(int colors);\n\n\n\n rviz_visual_tools::RvizVisualToolsPtr rviz_visual_tools_;\n\n ros::Publisher pub_point_cloud_;\n\n ros::Publisher pub_point_clouds_;\n\n\n\n std::vector<float> colours_;\n\n std::vector<std_msgs::ColorRGBA> rgb_colors_;\n\n};\n\n} // namespace visualization\n\n} // namespace laser_object_tracker\n\n\n\n#endif //LASER_OBJECT_TRACKER_VISUALIZATION_LASER_OBJECT_TRACKER_VISUALIZATION_HPP\n","file_path":"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp","rank":35,"score":72235.37632755458},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_VISUALIZATION_LASER_OBJECT_TRACKER_VISUALIZATION_HPP\n\n#define LASER_OBJECT_TRACKER_VISUALIZATION_LASER_OBJECT_TRACKER_VISUALIZATION_HPP\n\n\n\n#include <ros/ros.h>\n\n\n\n#include <pcl_ros/point_cloud.h>\n\n#include <rviz_visual_tools/rviz_visual_tools.h>\n\n\n\n#include \"laser_object_tracker/data_types/definitions.hpp\"\n\n#include \"laser_object_tracker/data_types/laser_scan_fragment.hpp\"\n\n#include \"laser_object_tracker/feature_extraction/features/features.hpp\"\n\n#include \"laser_object_tracker/tracking/multi_tracker.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace visualization {\n","file_path":"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp","rank":36,"score":72228.66981081547},{"content":" }\n\n\n\n void publishPointClouds(const std::vector<data_types::LaserScanFragment>& fragments);\n\n\n\n void publishFeatures(const std::vector<data_types::LaserScanFragment>& fragments);\n\n\n\n void publishSegment(const feature_extraction::features::Segment2D& segment, const std_msgs::ColorRGBA& color);\n\n\n\n void publishSegments(const feature_extraction::features::Segments2D& segments);\n\n\n\n void publishCorner(const feature_extraction::features::Corner2D& corner, const std_msgs::ColorRGBA& color);\n\n\n\n void publishCorners(const feature_extraction::features::Corners2D& corners);\n\n\n\n void publishPoint(const feature_extraction::features::Point2D& point, const std_msgs::ColorRGBA& color);\n\n\n\n void publishTracker(const tracking::BaseTracking& tracker, const std_msgs::ColorRGBA& color);\n\n\n\n void publishMultiTracker(const tracking::MultiTracker& multi_tracker);\n\n\n","file_path":"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp","rank":37,"score":72226.47285401858},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp","rank":38,"score":72212.1925468263},{"content":"class LaserObjectTrackerVisualization {\n\n public:\n\n LaserObjectTrackerVisualization(ros::NodeHandle& pnh, const std::string& base_frame) {\n\n rviz_visual_tools_.reset(new rviz_visual_tools::RvizVisualTools(base_frame, \"visualization/markers\"));\n\n rviz_visual_tools_->setLifetime(0.0);\n\n\n\n pub_point_cloud_ = pnh.advertise<data_types::PointCloudType>(\"visualization/point_cloud\", 1);\n\n pub_point_clouds_ = pnh.advertise<pcl::PointCloud<pcl::PointXYZRGB>>(\"visualization/point_clouds\", 1);\n\n }\n\n\n\n void publishPointCloud(const data_types::LaserScanFragment& fragment) {\n\n pub_point_cloud_.publish(fragment.pointCloud());\n\n }\n\n\n\n void trigger() {\n\n rviz_visual_tools_->trigger();\n\n }\n\n\n\n void clearMarkers() {\n\n rviz_visual_tools_->deleteAllMarkers();\n","file_path":"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp","rank":39,"score":71825.01880690889},{"content":"\n\nTEST(MultiTrackerTest, UpdateAndInitializeTracksTest) {\n\n auto data_association = std::make_unique<test::MockDataAssociation>();\n\n auto tracking = std::make_unique<test::MockTracking>();\n\n auto tracker_rejection = std::make_unique<test::MockTrackerRejection>();\n\n laser_object_tracker::tracking::MultiTracker multi_tracker(\n\n [](const auto& lhs, const auto& rhs) {return 0.0;},\n\n std::move(data_association),\n\n std::move(tracking),\n\n std::move(tracker_rejection));\n\n\n\n static constexpr int NO_ASSIGNMENT = laser_object_tracker::data_association::BaseDataAssociation::NO_ASSIGNMENT;\n\n\n\n std::vector<Eigen::VectorXd> measurements;\n\n Eigen::VectorXi assignment_vector;\n\n\n\n measurements.resize(5);\n\n assignment_vector.setConstant(5, NO_ASSIGNMENT);\n\n multi_tracker.updateAndInitializeTracks(measurements, assignment_vector);\n\n ASSERT_EQ(5, multi_tracker.size());\n","file_path":"test/src/tracking/multi_tracker_test.cpp","rank":40,"score":70966.83760261044},{"content":" // All objects should be unique (with respect to pointer)\n\n for (auto it_1 = multi_tracker.begin(); it_1 != multi_tracker.end(); ++it_1) {\n\n for (auto it_2 = std::next(it_1); it_2 != multi_tracker.end(); ++it_2) {\n\n EXPECT_NE(*it_1, *it_2);\n\n }\n\n }\n\n\n\n measurements.resize(3);\n\n assignment_vector.setConstant(3, NO_ASSIGNMENT);\n\n multi_tracker.updateAndInitializeTracks(measurements, assignment_vector);\n\n ASSERT_EQ(8, multi_tracker.size());\n\n // All objects should be unique (with respect to pointer)\n\n for (auto it_1 = multi_tracker.begin(); it_1 != multi_tracker.end(); ++it_1) {\n\n for (auto it_2 = std::next(it_1); it_2 != multi_tracker.end(); ++it_2) {\n\n EXPECT_NE(*it_1, *it_2);\n\n }\n\n }\n\n\n\n measurements.resize(8);\n\n assignment_vector.resize(8);\n\n assignment_vector << 0, 1, 2, 3, 4, 5, 6, 7;\n\n for (const auto& tracker : multi_tracker) {\n\n auto& cast_tracker = dynamic_cast<test::MockTracking&>(*tracker);\n\n EXPECT_CALL(cast_tracker, update(testing::_));\n\n }\n\n\n\n multi_tracker.updateAndInitializeTracks(measurements, assignment_vector);\n\n}\n","file_path":"test/src/tracking/multi_tracker_test.cpp","rank":41,"score":70963.90063184885},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#include <gtest/gtest.h>\n\n\n\n#include \"laser_object_tracker/tracking/multi_tracker.hpp\"\n\n\n\n#include \"test/utils.hpp\"\n\n#include \"test/data_association/mocks.hpp\"\n\n#include \"test/tracking/mocks.hpp\"\n","file_path":"test/src/tracking/multi_tracker_test.cpp","rank":42,"score":70957.37697471277},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"test/src/tracking/multi_tracker_test.cpp","rank":43,"score":70944.20835354984},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#include <gtest/gtest.h>\n\n\n\n#include \"laser_object_tracker/tracking/iteration_tracker_rejection.hpp\"\n\n\n\n#include \"test/utils.hpp\"\n\n#include \"test/tracking/mocks.hpp\"\n\n\n","file_path":"test/src/tracking/iteration_tracker_rejection_test.cpp","rank":44,"score":69391.14489325396},{"content":"TEST(IterationTrackerRejectionTest, AccessorsTest) {\n\n laser_object_tracker::tracking::IterationTrackerRejection rejection(1);\n\n EXPECT_EQ(1, rejection.getMaxIterationsWithoutUpdate());\n\n\n\n rejection.setMaxIterationsWithoutUpdate(5);\n\n EXPECT_EQ(5, rejection.getMaxIterationsWithoutUpdate());\n\n}\n\n\n\nTEST(IterationTrackerRejectionTest, InvalidationTest) {\n\n laser_object_tracker::tracking::IterationTrackerRejection rejection(3);\n\n\n\n test::MockTracking tracking;\n\n\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n\n\n rejection.updated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n\n\n rejection.notUpdated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n","file_path":"test/src/tracking/iteration_tracker_rejection_test.cpp","rank":45,"score":69388.02744443632},{"content":" rejection.notUpdated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n rejection.notUpdated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n\n\n rejection.updated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n rejection.notUpdated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n\n\n rejection.notUpdated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n rejection.notUpdated(tracking);\n\n EXPECT_FALSE(rejection.invalidate(tracking));\n\n rejection.notUpdated(tracking);\n\n EXPECT_TRUE(rejection.invalidate(tracking));\n\n rejection.notUpdated(tracking);\n\n EXPECT_TRUE(rejection.invalidate(tracking));\n\n}\n","file_path":"test/src/tracking/iteration_tracker_rejection_test.cpp","rank":46,"score":69383.49542294124},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"test/src/tracking/iteration_tracker_rejection_test.cpp","rank":47,"score":69377.94531830397},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_SEGMENTATION_HPP\n\n#define LASER_OBJECT_TRACKER_SEGMENTATION_SEGMENTATION_HPP\n\n\n\n#include \"laser_object_tracker/segmentation/adaptive_breakpoint_detection.hpp\"\n\n#include \"laser_object_tracker/segmentation/base_segmentation.hpp\"\n\n#include \"laser_object_tracker/segmentation/breakpoint_detection.hpp\"\n\n#include \"laser_object_tracker/segmentation/distance_calculation.hpp\"\n\n\n\n#endif // LASER_OBJECT_TRACKER_SEGMENTATION_SEGMENTATION_HPP\n","file_path":"include/laser_object_tracker/segmentation/segmentation.hpp","rank":48,"score":68362.35094905633},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_FILTERING_HPP\n\n#define LASER_OBJECT_TRACKER_FILTERING_FILTERING_HPP\n\n\n\n#include \"laser_object_tracker/filtering/aggregate_segmented_filtering.hpp\"\n\n#include \"laser_object_tracker/filtering/base_segmented_filtering.hpp\"\n\n#include \"laser_object_tracker/filtering/obb_area_filter.hpp\"\n\n#include \"laser_object_tracker/filtering/points_number_filter.hpp\"\n\n\n\n#endif // LASER_OBJECT_TRACKER_FILTERING_FILTERING_HPP\n","file_path":"include/laser_object_tracker/filtering/filtering.hpp","rank":49,"score":68362.33155495749},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_VISUALIZATION_VISUALIZATION_HPP\n\n#define LASER_OBJECT_TRACKER_VISUALIZATION_VISUALIZATION_HPP\n\n\n\n#include \"laser_object_tracker/visualization/laser_object_tracker_visualization.hpp\"\n\n\n\n#endif // LASER_OBJECT_TRACKER_VISUALIZATION_VISUALIZATION_HPP\n","file_path":"include/laser_object_tracker/visualization/visualization.hpp","rank":50,"score":68361.95932379953},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/segmentation/segmentation.hpp","rank":51,"score":68352.65667550865},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/visualization/visualization.hpp","rank":52,"score":68352.65667550865},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/filtering/filtering.hpp","rank":53,"score":68352.65667550865},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_BASE_SEGMENTATION_HPP\n\n#define LASER_OBJECT_TRACKER_SEGMENTATION_BASE_SEGMENTATION_HPP\n\n\n\n#include <vector>\n\n\n\n#include \"laser_object_tracker/data_types/laser_scan_fragment.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace segmentation {\n\n\n","file_path":"include/laser_object_tracker/segmentation/base_segmentation.hpp","rank":54,"score":66856.88081629838},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_DISTANCE_CALCULATION_HPP\n\n#define LASER_OBJECT_TRACKER_SEGMENTATION_DISTANCE_CALCULATION_HPP\n\n\n\n#include \"laser_object_tracker/data_types/definitions.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace segmentation {\n","file_path":"include/laser_object_tracker/segmentation/distance_calculation.hpp","rank":55,"score":66856.78762119141},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_BREAKPOINT_DETECTION_HPP\n\n#define LASER_OBJECT_TRACKER_SEGMENTATION_BREAKPOINT_DETECTION_HPP\n\n\n\n#include \"laser_object_tracker/segmentation/base_segmentation.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace segmentation {\n\n\n","file_path":"include/laser_object_tracker/segmentation/breakpoint_detection.hpp","rank":56,"score":66856.78762119141},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_OCCLUSION_DETECTION_HPP\n\n#define LASER_OBJECT_TRACKER_FILTERING_OCCLUSION_DETECTION_HPP\n\n\n\n#include \"laser_object_tracker/filtering/base_segmented_filtering.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace filtering {\n","file_path":"include/laser_object_tracker/filtering/occlusion_detection.hpp","rank":57,"score":66856.76990575047},{"content":"#include <sensor_msgs/LaserScan.h>\n\n\n\n// PCL\n\n#include <pcl/point_types.h>\n\n#include <pcl/point_cloud.h>\n\n\n\nnamespace laser_object_tracker {\n\nnamespace data_types {\n\n\n\n/**\n\n* @brief Proxy class for bool built-in type, used becuse std::vector<bool> is specialized template container,\n\n* not fully conforming to the standard.\n\n*/\n","file_path":"include/laser_object_tracker/data_types/definitions.hpp","rank":58,"score":66856.52981062968},{"content":"\n\ntemplate<class T>\n\nT distance(const T& one,\n\n const T& two) {\n\n return std::fabs(one - two);\n\n}\n\n\n\ntemplate<class T>\n\nT distanceDirected(const T& one,\n\n const T& two) {\n\n return one - two;\n\n}\n\n} // namespace segmentation\n\n} // namespace laser_object_tracker\n\n\n\n#endif // LASER_OBJECT_TRACKER_SEGMENTATION_DISTANCE_CALCULATION_HPP\n","file_path":"include/laser_object_tracker/segmentation/distance_calculation.hpp","rank":59,"score":66852.36080367761},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_TYPES_DEFINITIONS_HPP\n\n#define LASER_OBJECT_TRACKER_DATA_TYPES_DEFINITIONS_HPP\n\n\n\n// STD\n\n#include <vector>\n\n\n\n// ROS\n","file_path":"include/laser_object_tracker/data_types/definitions.hpp","rank":60,"score":66852.26357441011},{"content":" bool isValid() const {\n\n return !less_than_min_ && !more_than_max_;\n\n }\n\n\n\n bool lessThanMin() const {\n\n return less_than_min_;\n\n }\n\n\n\n bool moreThanMax() const {\n\n return more_than_max_;\n\n }\n\n\n\n private:\n\n double angle_;\n\n LaserScanType::_ranges_type::reference range_;\n\n OcclusionType::reference is_occluded_;\n\n PointCloudType::PointType& point_;\n\n\n\n bool less_than_min_;\n\n bool more_than_max_;\n\n};\n\n} // namespace data_types\n\n} // namespace laser_object_tracker\n\n\n\n#endif // LASER_OBJECT_TRACKER_DATA_TYPES_DEFINITIONS_HPP\n","file_path":"include/laser_object_tracker/data_types/definitions.hpp","rank":61,"score":66852.0908266655},{"content":" return value_;\n\n }\n\n\n\n private:\n\n bool value_;\n\n};\n\n\n\nusing LaserScanType = sensor_msgs::LaserScan;\n\nusing OcclusionType = std::vector<Bool>;\n\nusing PointCloudType = pcl::PointCloud<pcl::PointXYZ>;\n\n\n\n/**\n\n * @brief Proxy class or aggregator for a single element of LaserScanFragment container, e.g. single measurement.\n\n * Each element consists of polar (angle and range members) and cartesian (point member) coordinates\n\n * corresponding to the current measure. Also provides information whether a measurement is occluded or no.\n\n */\n","file_path":"include/laser_object_tracker/data_types/definitions.hpp","rank":62,"score":66848.47399389603},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/segmentation/base_segmentation.hpp","rank":63,"score":66843.60834025659},{"content":" return range_;\n\n }\n\n LaserScanType::_ranges_type::const_reference range() const {\n\n return range_;\n\n }\n\n\n\n OcclusionType::reference isOccluded() {\n\n return is_occluded_;\n\n }\n\n OcclusionType::const_reference isOccluded() const {\n\n return is_occluded_;\n\n }\n\n\n\n PointCloudType::PointType& point() {\n\n return point_;\n\n }\n\n const PointCloudType::PointType& point() const {\n\n return point_;\n\n }\n\n\n","file_path":"include/laser_object_tracker/data_types/definitions.hpp","rank":64,"score":66843.60834025659},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/filtering/occlusion_detection.hpp","rank":65,"score":66843.60834025659},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/segmentation/breakpoint_detection.hpp","rank":66,"score":66843.60834025659},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/data_types/definitions.hpp","rank":67,"score":66843.60834025659},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/segmentation/distance_calculation.hpp","rank":68,"score":66843.60834025659},{"content":" void step2b(const Eigen::MatrixXd& cost_matrix, Eigen::ArrayXXd& cost_matrix_copy, Eigen::VectorXi& assignment);\n\n void step3(const Eigen::MatrixXd& cost_matrix, Eigen::ArrayXXd& cost_matrix_copy, Eigen::VectorXi& assignment);\n\n void step4(const Eigen::MatrixXd& cost_matrix,\n\n Eigen::ArrayXXd& cost_matrix_copy,\n\n Eigen::VectorXi& assignment,\n\n int row,\n\n int column);\n\n void step5(const Eigen::MatrixXd& cost_matrix, Eigen::ArrayXXd& cost_matrix_copy, Eigen::VectorXi& assignment);\n\n\n\n bool isZero(double number, double precision = Eigen::NumTraits<double>::dummy_precision());\n\n\n\n Eigen::ArrayXXb star_matrix_;\n\n Eigen::ArrayXXb new_star_matrix_;\n\n Eigen::ArrayXXb prime_matrix_;\n\n Eigen::RowArrayXb covered_columns_;\n\n Eigen::ArrayXb covered_rows_;\n\n Eigen::Index min_dimension_;\n\n};\n\n} // namespace data_association\n\n} // namespace laser_object_tracker\n\n\n\n#endif //LASER_OBJECT_TRACKER_DATA_ASSOCIATION_HUNGARIAN_ALGORITHM_HPP\n","file_path":"include/laser_object_tracker/data_association/hungarian_algorithm.hpp","rank":69,"score":65422.60678866495},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_HUNGARIAN_ALGORITHM_HPP\n\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_HUNGARIAN_ALGORITHM_HPP\n\n\n\n#include \"laser_object_tracker/data_association/base_data_association.hpp\"\n\n\n\nnamespace Eigen {\n\nusing ArrayXXb = Array<bool, Dynamic, Dynamic>;\n\nusing ArrayXb = Array<bool, Dynamic, 1>;\n\nusing RowArrayXb = Array<bool, 1, Dynamic>;\n\n} // namespace Eigen\n\n\n\nnamespace laser_object_tracker {\n\nnamespace data_association {\n\n\n","file_path":"include/laser_object_tracker/data_association/hungarian_algorithm.hpp","rank":70,"score":65416.169098594284},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURES_FEATURES_HPP\n\n#define LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURES_FEATURES_HPP\n\n\n\nnamespace laser_object_tracker {\n\nnamespace feature_extraction {\n\nnamespace features {\n\n\n","file_path":"include/laser_object_tracker/feature_extraction/features/features.hpp","rank":71,"score":65412.92983030366},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_ADAPTIVE_BREAKPOINT_DETECTION_HPP\n\n#define LASER_OBJECT_TRACKER_SEGMENTATION_ADAPTIVE_BREAKPOINT_DETECTION_HPP\n\n\n\n#include \"laser_object_tracker/segmentation/base_segmentation.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace segmentation {\n\n\n","file_path":"include/laser_object_tracker/segmentation/adaptive_breakpoint_detection.hpp","rank":72,"score":65412.896328118004},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_OBB_AREA_FILTER_HPP\n\n#define LASER_OBJECT_TRACKER_FILTERING_OBB_AREA_FILTER_HPP\n\n\n\n#include \"laser_object_tracker/filtering/base_segmented_filtering.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace filtering {\n\n\n","file_path":"include/laser_object_tracker/filtering/obb_area_filter.hpp","rank":73,"score":65412.87871451743},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_POINTS_NUMBER_FILTER_HPP\n\n#define LASER_OBJECT_TRACKER_FILTERING_POINTS_NUMBER_FILTER_HPP\n\n\n\n#include \"laser_object_tracker/filtering/base_segmented_filtering.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace filtering {\n\n\n","file_path":"include/laser_object_tracker/filtering/points_number_filter.hpp","rank":74,"score":65412.87871451743},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_AGGREGATE_SEGMENTED_FILTERING_HPP\n\n#define LASER_OBJECT_TRACKER_FILTERING_AGGREGATE_SEGMENTED_FILTERING_HPP\n\n\n\n#include \"laser_object_tracker/filtering/base_segmented_filtering.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace filtering {\n\n\n","file_path":"include/laser_object_tracker/filtering/aggregate_segmented_filtering.hpp","rank":75,"score":65412.87871451743},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_BASE_SEGMENTED_FILTERING_HPP\n\n#define LASER_OBJECT_TRACKER_FILTERING_BASE_SEGMENTED_FILTERING_HPP\n\n\n\n#include \"laser_object_tracker/data_types/laser_scan_fragment.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace filtering {\n\n\n","file_path":"include/laser_object_tracker/filtering/base_segmented_filtering.hpp","rank":76,"score":65412.86115148409},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURE_EXTRACTION_HPP\n\n#define LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURE_EXTRACTION_HPP\n\n\n\n#include \"laser_object_tracker/feature_extraction/features/features.hpp\"\n\n#include \"laser_object_tracker/feature_extraction/pcl/sac_model_cross2d.hpp\"\n\n#include \"laser_object_tracker/feature_extraction/base_feature_extraction.hpp\"\n\n#include \"laser_object_tracker/feature_extraction/random_sample_consensus_corner_detection.hpp\"\n\n#include \"laser_object_tracker/feature_extraction/random_sample_consensus_segment_detection.hpp\"\n\n#include \"laser_object_tracker/feature_extraction/search_based_corner_detection.hpp\"\n\n\n\n#endif // LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURE_EXTRACTION_HPP\n","file_path":"include/laser_object_tracker/feature_extraction/feature_extraction.hpp","rank":77,"score":65409.502842355854},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_DATA_ASSOCIATION_HPP\n\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_DATA_ASSOCIATION_HPP\n\n\n\n#include \"laser_object_tracker/data_association/base_data_association.hpp\"\n\n#include \"laser_object_tracker/data_association/hungarian_algorithm.hpp\"\n\n#include \"laser_object_tracker/data_association/naive_linear_assignment.hpp\"\n\n\n\n#endif // LASER_OBJECT_TRACKER_DATA_ASSOCIATION_DATA_ASSOCIATION_HPP\n","file_path":"include/laser_object_tracker/data_association/data_association.hpp","rank":78,"score":65409.250199490605},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_TYPES_DATA_TYPES_HPP\n\n#define LASER_OBJECT_TRACKER_DATA_TYPES_DATA_TYPES_HPP\n\n\n\n#include \"laser_object_tracker/data_types/definitions.hpp\"\n\n#include \"laser_object_tracker/data_types/laser_scan_fragment.hpp\"\n\n\n\n#endif // LASER_OBJECT_TRACKER_DATA_TYPES_DATA_TYPES_HPP\n","file_path":"include/laser_object_tracker/data_types/data_types.hpp","rank":79,"score":65409.096369224426},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/data_types/data_types.hpp","rank":80,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/segmentation/adaptive_breakpoint_detection.hpp","rank":81,"score":65399.75242702672},{"content":"class Bool {\n\n public:\n\n /**\n\n * @brief Implicit conversion c-tor from bool type.\n\n * @param value Value to be initialized to.\n\n */\n\n Bool(bool value) : value_(value) {}\n\n\n\n /**\n\n * @brief Conversion operator to type bool&.\n\n * @return Reference to underlying bool value.\n\n */\n\n operator bool&() {\n\n return value_;\n\n }\n\n /**\n\n * @brief Conversion operator to type const bool&.\n\n * @return Const reference to underlying bool value.\n\n */\n\n operator const bool&() const {\n","file_path":"include/laser_object_tracker/data_types/definitions.hpp","rank":82,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/feature_extraction/feature_extraction.hpp","rank":83,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/data_association/data_association.hpp","rank":84,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/filtering/aggregate_segmented_filtering.hpp","rank":85,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/data_association/hungarian_algorithm.hpp","rank":86,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/feature_extraction/features/features.hpp","rank":87,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/filtering/points_number_filter.hpp","rank":88,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/filtering/obb_area_filter.hpp","rank":89,"score":65399.75242702672},{"content":"/*********************************************************************\n\n*\n\n* BSD 3-Clause License\n\n*\n\n* Copyright (c) 2019, Piotr Pokorski\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* 1. Redistributions of source code must retain the above copyright notice, this\n\n* list of conditions and the following disclaimer.\n\n*\n\n* 2. Redistributions in binary form must reproduce the above copyright notice,\n\n* this list of conditions and the following disclaimer in the documentation\n\n* and/or other materials provided with the distribution.\n\n*\n\n* 3. Neither the name of the copyright holder nor the names of its\n\n* contributors may be used to endorse or promote products derived from\n\n* this software without specific prior written permission.\n","file_path":"include/laser_object_tracker/filtering/base_segmented_filtering.hpp","rank":90,"score":65399.75242702672},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_TYPES_LASER_SCAN_FRAGMENT_HPP\n\n#define LASER_OBJECT_TRACKER_DATA_TYPES_LASER_SCAN_FRAGMENT_HPP\n\n\n\n// ROS\n\n#include <laser_geometry/laser_geometry.h>\n\n\n\n// PROJECT\n\n#include \"laser_object_tracker/data_types/definitions.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace data_types {\n\n\n\n/**\n\n * @brief Container-type class consisting of LaserScan measurement, corresponding PointCloud and Occlusion vector\n\n * informing whether each point is occluded or not by its neighbours.\n\n */\n","file_path":"include/laser_object_tracker/data_types/laser_scan_fragment.hpp","rank":91,"score":64032.85606226058},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_NAIVE_LINEAR_ASSIGNMENT_HPP\n\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_NAIVE_LINEAR_ASSIGNMENT_HPP\n\n\n\n#include \"laser_object_tracker/data_association/base_data_association.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace data_association {\n\n\n","file_path":"include/laser_object_tracker/data_association/naive_linear_assignment.hpp","rank":92,"score":64030.01002729893},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_BASE_FEATURE_EXTRACTION_HPP\n\n#define LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_BASE_FEATURE_EXTRACTION_HPP\n\n\n\n#include \"laser_object_tracker/data_types/laser_scan_fragment.hpp\"\n\n\n\nnamespace laser_object_tracker {\n\nnamespace feature_extraction {\n\n\n","file_path":"include/laser_object_tracker/feature_extraction/base_feature_extraction.hpp","rank":93,"score":64030.01002729893},{"content":"*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_BASE_DATA_ASSOCIATION_HPP\n\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_BASE_DATA_ASSOCIATION_HPP\n\n\n\n#include <Eigen/Core>\n\n\n\nnamespace laser_object_tracker {\n\nnamespace data_association {\n\n\n","file_path":"include/laser_object_tracker/data_association/base_data_association.hpp","rank":94,"score":64029.90355607481},{"content":" Reference at(size_t index);\n\n\n\n ConstReference at(size_t index) const;\n\n\n\n Reference operator[](size_t index);\n\n\n\n ConstReference operator[](size_t index) const;\n\n\n\n Reference front();\n\n\n\n ConstReference front() const;\n\n\n\n Reference back();\n\n\n\n ConstReference back() const;\n\n\n\n /**\n\n *\n\n * @return True if the container is empty, false otherwise\n\n */\n","file_path":"include/laser_object_tracker/data_types/laser_scan_fragment.hpp","rank":95,"score":64027.505424463794},{"content":" * @return Iterator pointing to the first measurement (counting from min to max angle)\n\n */\n\n Iterator begin();\n\n /**\n\n *\n\n * @return Const iterator pointing to the first measurement (counting from min to max angle)\n\n */\n\n ConstIterator cbegin() const;\n\n\n\n /**\n\n *\n\n * @return Iterator pointing to the one measurement beyond last (counting from min to max angle)\n\n */\n\n Iterator end();\n\n /**\n\n *\n\n * @return Const iterator pointing to the one measurement beyond last (counting from min to max angle)\n\n */\n\n ConstIterator cend() const;\n\n\n","file_path":"include/laser_object_tracker/data_types/laser_scan_fragment.hpp","rank":96,"score":64027.2766308965},{"content":" * @param other Prototype container\n\n * @param first First element of the range, included\n\n * @param last Last element of the range, not included\n\n */\n\n LaserScanFragment(const LaserScanFragment& other, long first, long last);\n\n\n\n /**\n\n *\n\n * @return Header of LaserScanType measurement\n\n */\n\n std_msgs::Header getHeader() const {\n\n return laser_scan_.header;\n\n }\n\n\n\n /**\n\n *\n\n * @return Min angle of the measurement (in polar coordinates)\n\n */\n\n double getAngleMin() const {\n\n return laser_scan_.angle_min;\n","file_path":"include/laser_object_tracker/data_types/laser_scan_fragment.hpp","rank":97,"score":64025.90779545393},{"content":" LaserScanType laser_scan_;\n\n OcclusionType occlusion_vector_;\n\n PointCloudType laser_scan_cloud_;\n\n ContainerType elements_;\n\n};\n\n} // namespace data_types\n\n} // namespace laser_object_tracker\n\n\n\n#endif // LASER_OBJECT_TRACKER_DATA_TYPES_LASER_SCAN_FRAGMENT_HPP\n","file_path":"include/laser_object_tracker/data_types/laser_scan_fragment.hpp","rank":98,"score":64025.74345520761},{"content":" }\n\n\n\n /**\n\n *\n\n * @return Max angle of the measurement (in polar coordinates)\n\n */\n\n double getAngleMax() const {\n\n return laser_scan_.angle_max;\n\n }\n\n\n\n /**\n\n *\n\n * @return Angle resolution of the laser scanner\n\n */\n\n double getAngleIncrement() const {\n\n return laser_scan_.angle_increment;\n\n }\n\n\n\n /**\n\n *\n","file_path":"include/laser_object_tracker/data_types/laser_scan_fragment.hpp","rank":99,"score":64021.03211602552}],"string":"[\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_TRACKING_HPP\\n\\n#define LASER_OBJECT_TRACKER_TRACKING_TRACKING_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/tracking/base_tracker_rejection.hpp\\\"\\n\\n#include \\\"laser_object_tracker/tracking/base_tracking.hpp\\\"\\n\\n#include \\\"laser_object_tracker/tracking/iteration_tracker_rejection.hpp\\\"\\n\\n#include \\\"laser_object_tracker/tracking/kalman_filter.hpp\\\"\\n\\n#include \\\"laser_object_tracker/tracking/multi_tracker.hpp\\\"\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_TRACKING_TRACKING_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/tracking.hpp\",\n \"rank\": 0,\n \"score\": 113729.64539441212\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/tracking.hpp\",\n \"rank\": 1,\n \"score\": 113714.37475258336\n },\n {\n \"content\": \"class BaseTracking {\\n\\n public:\\n\\n BaseTracking(int state_dimensions, int measurement_dimensions);\\n\\n\\n\\n virtual void initFromState(const Eigen::VectorXd& init_state) = 0;\\n\\n\\n\\n virtual void initFromState();\\n\\n\\n\\n virtual void initFromMeasurement(const Eigen::VectorXd& measurement) = 0;\\n\\n\\n\\n virtual void initFromMeasurement();\\n\\n\\n\\n virtual void predict() = 0;\\n\\n\\n\\n virtual void update(const Eigen::VectorXd& measurement) = 0;\\n\\n\\n\\n virtual Eigen::VectorXd getStateVector() const = 0;\\n\\n\\n\\n virtual std::unique_ptr<BaseTracking> clone() const = 0;\\n\\n\\n\\n virtual ~BaseTracking() = default;\\n\\n\\n\\n protected:\\n\\n int state_dimensions_, measurement_dimensions_;\\n\\n};\\n\\n} // namespace tracking\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif //LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKING_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/base_tracking.hpp\",\n \"rank\": 2,\n \"score\": 111660.48448213535\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKING_HPP\\n\\n#define LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKING_HPP\\n\\n\\n\\n#include <memory>\\n\\n\\n\\n#include <Eigen/Core>\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace tracking {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/base_tracking.hpp\",\n \"rank\": 3,\n \"score\": 111603.92013482649\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/base_tracking.hpp\",\n \"rank\": 4,\n \"score\": 111585.75436521549\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_MULTI_TRACKER_H\\n\\n#define LASER_OBJECT_TRACKER_TRACKING_MULTI_TRACKER_H\\n\\n\\n\\n#include <vector>\\n\\n\\n\\n#include \\\"laser_object_tracker/data_association/base_data_association.hpp\\\"\\n\\n#include \\\"laser_object_tracker/tracking/base_tracker_rejection.hpp\\\"\\n\\n#include \\\"laser_object_tracker/tracking/base_tracking.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace tracking {\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/multi_tracker.hpp\",\n \"rank\": 5,\n \"score\": 110906.09565746282\n },\n {\n \"content\": \" void handleNotUpdatedTracks(const Eigen::VectorXi& assignment_vector);\\n\\n\\n\\n void handleRejectedTracks();\\n\\n\\n\\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator begin() const;\\n\\n\\n\\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator end() const;\\n\\n\\n\\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator cbegin() const;\\n\\n\\n\\n std::vector<std::unique_ptr<BaseTracking>>::const_iterator cend() const;\\n\\n\\n\\n const BaseTracking& at(int index) const;\\n\\n\\n\\n int size() const;\\n\\n\\n\\n private:\\n\\n DistanceFunctor distance_calculator_;\\n\\n std::unique_ptr<data_association::BaseDataAssociation> data_association_;\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/multi_tracker.hpp\",\n \"rank\": 6,\n \"score\": 110904.8190737856\n },\n {\n \"content\": \" std::unique_ptr<BaseTracking> tracker_prototype_;\\n\\n std::vector<std::unique_ptr<BaseTracking>> trackers_;\\n\\n\\n\\n std::unique_ptr<BaseTrackerRejection> tracker_rejector_prototype_;\\n\\n std::vector<std::unique_ptr<BaseTrackerRejection>> trackers_rejections_;\\n\\n};\\n\\n} // namespace tracking\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif //LASER_OBJECT_TRACKER_TRACKING_MULTI_TRACKER_H\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/multi_tracker.hpp\",\n \"rank\": 7,\n \"score\": 110901.83642008188\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/multi_tracker.hpp\",\n \"rank\": 8,\n \"score\": 110887.37369432811\n },\n {\n \"content\": \"class MultiTracker {\\n\\n public:\\n\\n using DistanceFunctor = std::function<double(const Eigen::VectorXd&, const BaseTracking&)>;\\n\\n\\n\\n MultiTracker(DistanceFunctor distance_calculator,\\n\\n std::unique_ptr<data_association::BaseDataAssociation> data_association,\\n\\n std::unique_ptr<BaseTracking> tracker_prototype,\\n\\n std::unique_ptr<BaseTrackerRejection> tracker_rejector_prototype);\\n\\n\\n\\n void predict();\\n\\n\\n\\n void update(const std::vector<Eigen::VectorXd>& measurements);\\n\\n\\n\\n Eigen::MatrixXd buildCostMatrix(const std::vector<Eigen::VectorXd>& measurements);\\n\\n\\n\\n Eigen::VectorXi buildAssignmentVector(const Eigen::MatrixXd& cost_matrix);\\n\\n\\n\\n void updateAndInitializeTracks(const std::vector<Eigen::VectorXd>& measurements,\\n\\n const Eigen::VectorXi& assignment_vector);\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/multi_tracker.hpp\",\n \"rank\": 9,\n \"score\": 110601.5526987534\n },\n {\n \"content\": \"class MockTrackerRejection : public laser_object_tracker::tracking::BaseTrackerRejection {\\n\\n MOCK_CONST_METHOD1(invalidate, bool(const laser_object_tracker::tracking::BaseTracking& tracker));\\n\\n\\n\\n std::unique_ptr<BaseTrackerRejection> clone() const override {\\n\\n return std::unique_ptr<BaseTrackerRejection>(new MockTrackerRejection());\\n\\n }\\n\\n};\\n\\n\\n\\n} // namespace test\\n\\n\\n\\n#endif //TEST_TEST_TRACKING_MOCKS_HPP\\n\",\n \"file_path\": \"test/include/test/tracking/mocks.hpp\",\n \"rank\": 10,\n \"score\": 108880.96727942834\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKER_REJECTION_HPP\\n\\n#define LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKER_REJECTION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/tracking/base_tracking.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace tracking {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/base_tracker_rejection.hpp\",\n \"rank\": 11,\n \"score\": 108844.52089006154\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_ITERATION_TRACKER_REJECTION_HPP\\n\\n#define LASER_OBJECT_TRACKER_TRACKING_ITERATION_TRACKER_REJECTION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/tracking/base_tracker_rejection.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace tracking {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/iteration_tracker_rejection.hpp\",\n \"rank\": 12,\n \"score\": 108844.41375443932\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/base_tracker_rejection.hpp\",\n \"rank\": 13,\n \"score\": 108826.14027406639\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/iteration_tracker_rejection.hpp\",\n \"rank\": 14,\n \"score\": 108826.14027406642\n },\n {\n \"content\": \"class BaseTrackerRejection {\\n\\n public:\\n\\n virtual bool invalidate(const BaseTracking& tracker) const = 0;\\n\\n\\n\\n virtual void updated(const BaseTracking& tracker) {}\\n\\n\\n\\n virtual void notUpdated(const BaseTracking& tracker) {}\\n\\n\\n\\n virtual std::unique_ptr<BaseTrackerRejection> clone() const = 0;\\n\\n};\\n\\n\\n\\n} // namespace tracking\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif //LASER_OBJECT_TRACKER_TRACKING_BASE_TRACKER_REJECTION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/base_tracker_rejection.hpp\",\n \"rank\": 15,\n \"score\": 107057.33943102525\n },\n {\n \"content\": \"class MockTracking : public laser_object_tracker::tracking::BaseTracking {\\n\\n public:\\n\\n MockTracking() : BaseTracking(0, 0) {}\\n\\n\\n\\n MockTracking(int s, int m) : BaseTracking(0, 0) {}\\n\\n\\n\\n MOCK_METHOD1(initFromState, void(const Eigen::VectorXd&));\\n\\n\\n\\n MOCK_METHOD1(initFromMeasurement, void(const Eigen::VectorXd&));\\n\\n\\n\\n MOCK_METHOD0(predict, void());\\n\\n\\n\\n MOCK_METHOD1(update, void(const Eigen::VectorXd&));\\n\\n\\n\\n MOCK_CONST_METHOD0(getStateVector, Eigen::VectorXd());\\n\\n\\n\\n std::unique_ptr<BaseTracking> clone() const override {\\n\\n return std::unique_ptr<BaseTracking>(new MockTracking());\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"test/include/test/tracking/mocks.hpp\",\n \"rank\": 16,\n \"score\": 106050.53427492321\n },\n {\n \"content\": \"class IterationTrackerRejection : public BaseTrackerRejection {\\n\\n public:\\n\\n explicit IterationTrackerRejection(int max_iterations_without_update);\\n\\n\\n\\n bool invalidate(const BaseTracking& tracker) const override;\\n\\n\\n\\n void updated(const BaseTracking& tracker) override;\\n\\n\\n\\n void notUpdated(const BaseTracking& tracker) override;\\n\\n\\n\\n std::unique_ptr<BaseTrackerRejection> clone() const override;\\n\\n\\n\\n int getMaxIterationsWithoutUpdate() const;\\n\\n\\n\\n void setMaxIterationsWithoutUpdate(int max_iterations_without_update);\\n\\n private:\\n\\n int max_iterations_without_update_, iterations_without_update_;\\n\\n};\\n\\n\\n\\n} // namespace tracking\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif //LASER_OBJECT_TRACKER_TRACKING_ITERATION_TRACKER_REJECTION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/iteration_tracker_rejection.hpp\",\n \"rank\": 17,\n \"score\": 103223.66338046256\n },\n {\n \"content\": \" void initFromMeasurement(const Eigen::VectorXd& measurement) override;\\n\\n\\n\\n void predict() override;\\n\\n\\n\\n void update(const Eigen::VectorXd& measurement) override;\\n\\n\\n\\n Eigen::VectorXd getStateVector() const override;\\n\\n\\n\\n std::unique_ptr<BaseTracking> clone() const override;\\n\\n\\n\\nprivate:\\n\\n void copyMats(const KalmanFilter& other);\\n\\n\\n\\n cv::KalmanFilter kalman_filter_;\\n\\n cv::Mat inverse_measurement_matrix_;\\n\\n};\\n\\n} // namespace tracking\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif //LASER_OBJECT_TRACKER_TRACKING_KALMAN_FILTER_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/kalman_filter.hpp\",\n \"rank\": 18,\n \"score\": 103027.09116375758\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_TRACKING_KALMAN_FILTER_HPP\\n\\n#define LASER_OBJECT_TRACKER_TRACKING_KALMAN_FILTER_HPP\\n\\n\\n\\n#include <opencv2/video/tracking.hpp>\\n\\n\\n\\n#include \\\"laser_object_tracker/tracking/base_tracking.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace tracking {\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/kalman_filter.hpp\",\n \"rank\": 19,\n \"score\": 103022.26528416884\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/kalman_filter.hpp\",\n \"rank\": 20,\n \"score\": 103003.92647213789\n },\n {\n \"content\": \"class KalmanFilter : public BaseTracking {\\n\\n public:\\n\\n KalmanFilter(int state_dimensions,\\n\\n int measurement_dimensions,\\n\\n const Eigen::MatrixXd& transition_matrix,\\n\\n const Eigen::MatrixXd& measurement_matrix,\\n\\n const Eigen::MatrixXd& measurement_noise_covariance,\\n\\n const Eigen::MatrixXd& initial_state_covariance,\\n\\n const Eigen::MatrixXd& process_noise_covariance);\\n\\n\\n\\n KalmanFilter(const KalmanFilter& other) noexcept;\\n\\n\\n\\n KalmanFilter(KalmanFilter&& other) noexcept = default;\\n\\n\\n\\n KalmanFilter& operator=(const KalmanFilter& other) noexcept;\\n\\n\\n\\n KalmanFilter& operator=(KalmanFilter&& other) noexcept = default;\\n\\n\\n\\n void initFromState(const Eigen::VectorXd& init_state) override;\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/tracking/kalman_filter.hpp\",\n \"rank\": 21,\n \"score\": 102080.41015656681\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef TEST_TEST_TRACKING_MOCKS_HPP\\n\\n#define TEST_TEST_TRACKING_MOCKS_HPP\\n\\n\\n\\n#include <gmock/gmock.h>\\n\\n\\n\\n#include \\\"laser_object_tracker/tracking/base_tracking.hpp\\\"\\n\\n\\n\\nnamespace test {\\n\",\n \"file_path\": \"test/include/test/tracking/mocks.hpp\",\n \"rank\": 30,\n \"score\": 73026.00110554376\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"test/include/test/tracking/mocks.hpp\",\n \"rank\": 31,\n \"score\": 73010.04178133917\n },\n {\n \"content\": \" iterations_without_update_(0) {}\\n\\n\\n\\nbool IterationTrackerRejection::invalidate(const BaseTracking& tracker) const {\\n\\n return iterations_without_update_ > max_iterations_without_update_;\\n\\n}\\n\\n\\n\\nvoid IterationTrackerRejection::updated(const BaseTracking& tracker) {\\n\\n iterations_without_update_ = 0;\\n\\n}\\n\\n\\n\\nvoid IterationTrackerRejection::notUpdated(const BaseTracking& tracker) {\\n\\n ++iterations_without_update_;\\n\\n}\\n\\n\\n\\nstd::unique_ptr<BaseTrackerRejection> IterationTrackerRejection::clone() const {\\n\\n return std::unique_ptr<BaseTrackerRejection>(new IterationTrackerRejection(*this));\\n\\n}\\n\\n\\n\\nint IterationTrackerRejection::getMaxIterationsWithoutUpdate() const {\\n\\n return max_iterations_without_update_;\\n\\n}\\n\\n\\n\\nvoid IterationTrackerRejection::setMaxIterationsWithoutUpdate(int max_iterations_without_update) {\\n\\n max_iterations_without_update_ = max_iterations_without_update;\\n\\n}\\n\\n} // namespace tracking\\n\\n} // namespace laser_object_tracker\\n\",\n \"file_path\": \"src/tracking/iteration_tracker_rejection.cpp\",\n \"rank\": 32,\n \"score\": 72605.06829454323\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#include \\\"laser_object_tracker/tracking/iteration_tracker_rejection.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace tracking {\\n\\n\\n\\nIterationTrackerRejection::IterationTrackerRejection(int max_iterations_without_update)\\n\\n : max_iterations_without_update_(max_iterations_without_update),\\n\",\n \"file_path\": \"src/tracking/iteration_tracker_rejection.cpp\",\n \"rank\": 33,\n \"score\": 72603.35916499073\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"src/tracking/iteration_tracker_rejection.cpp\",\n \"rank\": 34,\n \"score\": 72582.82411071574\n },\n {\n \"content\": \" void publishAssignments(const tracking::MultiTracker& multi_tracker,\\n\\n const std::vector<Eigen::VectorXd>& measurements,\\n\\n const Eigen::MatrixXd& cost_matrix,\\n\\n const Eigen::VectorXi& assignment_vector);\\n\\n\\n\\n private:\\n\\n void expandToNColors(int colors);\\n\\n\\n\\n rviz_visual_tools::RvizVisualToolsPtr rviz_visual_tools_;\\n\\n ros::Publisher pub_point_cloud_;\\n\\n ros::Publisher pub_point_clouds_;\\n\\n\\n\\n std::vector<float> colours_;\\n\\n std::vector<std_msgs::ColorRGBA> rgb_colors_;\\n\\n};\\n\\n} // namespace visualization\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif //LASER_OBJECT_TRACKER_VISUALIZATION_LASER_OBJECT_TRACKER_VISUALIZATION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp\",\n \"rank\": 35,\n \"score\": 72235.37632755458\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_VISUALIZATION_LASER_OBJECT_TRACKER_VISUALIZATION_HPP\\n\\n#define LASER_OBJECT_TRACKER_VISUALIZATION_LASER_OBJECT_TRACKER_VISUALIZATION_HPP\\n\\n\\n\\n#include <ros/ros.h>\\n\\n\\n\\n#include <pcl_ros/point_cloud.h>\\n\\n#include <rviz_visual_tools/rviz_visual_tools.h>\\n\\n\\n\\n#include \\\"laser_object_tracker/data_types/definitions.hpp\\\"\\n\\n#include \\\"laser_object_tracker/data_types/laser_scan_fragment.hpp\\\"\\n\\n#include \\\"laser_object_tracker/feature_extraction/features/features.hpp\\\"\\n\\n#include \\\"laser_object_tracker/tracking/multi_tracker.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace visualization {\\n\",\n \"file_path\": \"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp\",\n \"rank\": 36,\n \"score\": 72228.66981081547\n },\n {\n \"content\": \" }\\n\\n\\n\\n void publishPointClouds(const std::vector<data_types::LaserScanFragment>& fragments);\\n\\n\\n\\n void publishFeatures(const std::vector<data_types::LaserScanFragment>& fragments);\\n\\n\\n\\n void publishSegment(const feature_extraction::features::Segment2D& segment, const std_msgs::ColorRGBA& color);\\n\\n\\n\\n void publishSegments(const feature_extraction::features::Segments2D& segments);\\n\\n\\n\\n void publishCorner(const feature_extraction::features::Corner2D& corner, const std_msgs::ColorRGBA& color);\\n\\n\\n\\n void publishCorners(const feature_extraction::features::Corners2D& corners);\\n\\n\\n\\n void publishPoint(const feature_extraction::features::Point2D& point, const std_msgs::ColorRGBA& color);\\n\\n\\n\\n void publishTracker(const tracking::BaseTracking& tracker, const std_msgs::ColorRGBA& color);\\n\\n\\n\\n void publishMultiTracker(const tracking::MultiTracker& multi_tracker);\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp\",\n \"rank\": 37,\n \"score\": 72226.47285401858\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp\",\n \"rank\": 38,\n \"score\": 72212.1925468263\n },\n {\n \"content\": \"class LaserObjectTrackerVisualization {\\n\\n public:\\n\\n LaserObjectTrackerVisualization(ros::NodeHandle& pnh, const std::string& base_frame) {\\n\\n rviz_visual_tools_.reset(new rviz_visual_tools::RvizVisualTools(base_frame, \\\"visualization/markers\\\"));\\n\\n rviz_visual_tools_->setLifetime(0.0);\\n\\n\\n\\n pub_point_cloud_ = pnh.advertise<data_types::PointCloudType>(\\\"visualization/point_cloud\\\", 1);\\n\\n pub_point_clouds_ = pnh.advertise<pcl::PointCloud<pcl::PointXYZRGB>>(\\\"visualization/point_clouds\\\", 1);\\n\\n }\\n\\n\\n\\n void publishPointCloud(const data_types::LaserScanFragment& fragment) {\\n\\n pub_point_cloud_.publish(fragment.pointCloud());\\n\\n }\\n\\n\\n\\n void trigger() {\\n\\n rviz_visual_tools_->trigger();\\n\\n }\\n\\n\\n\\n void clearMarkers() {\\n\\n rviz_visual_tools_->deleteAllMarkers();\\n\",\n \"file_path\": \"include/laser_object_tracker/visualization/laser_object_tracker_visualization.hpp\",\n \"rank\": 39,\n \"score\": 71825.01880690889\n },\n {\n \"content\": \"\\n\\nTEST(MultiTrackerTest, UpdateAndInitializeTracksTest) {\\n\\n auto data_association = std::make_unique<test::MockDataAssociation>();\\n\\n auto tracking = std::make_unique<test::MockTracking>();\\n\\n auto tracker_rejection = std::make_unique<test::MockTrackerRejection>();\\n\\n laser_object_tracker::tracking::MultiTracker multi_tracker(\\n\\n [](const auto& lhs, const auto& rhs) {return 0.0;},\\n\\n std::move(data_association),\\n\\n std::move(tracking),\\n\\n std::move(tracker_rejection));\\n\\n\\n\\n static constexpr int NO_ASSIGNMENT = laser_object_tracker::data_association::BaseDataAssociation::NO_ASSIGNMENT;\\n\\n\\n\\n std::vector<Eigen::VectorXd> measurements;\\n\\n Eigen::VectorXi assignment_vector;\\n\\n\\n\\n measurements.resize(5);\\n\\n assignment_vector.setConstant(5, NO_ASSIGNMENT);\\n\\n multi_tracker.updateAndInitializeTracks(measurements, assignment_vector);\\n\\n ASSERT_EQ(5, multi_tracker.size());\\n\",\n \"file_path\": \"test/src/tracking/multi_tracker_test.cpp\",\n \"rank\": 40,\n \"score\": 70966.83760261044\n },\n {\n \"content\": \" // All objects should be unique (with respect to pointer)\\n\\n for (auto it_1 = multi_tracker.begin(); it_1 != multi_tracker.end(); ++it_1) {\\n\\n for (auto it_2 = std::next(it_1); it_2 != multi_tracker.end(); ++it_2) {\\n\\n EXPECT_NE(*it_1, *it_2);\\n\\n }\\n\\n }\\n\\n\\n\\n measurements.resize(3);\\n\\n assignment_vector.setConstant(3, NO_ASSIGNMENT);\\n\\n multi_tracker.updateAndInitializeTracks(measurements, assignment_vector);\\n\\n ASSERT_EQ(8, multi_tracker.size());\\n\\n // All objects should be unique (with respect to pointer)\\n\\n for (auto it_1 = multi_tracker.begin(); it_1 != multi_tracker.end(); ++it_1) {\\n\\n for (auto it_2 = std::next(it_1); it_2 != multi_tracker.end(); ++it_2) {\\n\\n EXPECT_NE(*it_1, *it_2);\\n\\n }\\n\\n }\\n\\n\\n\\n measurements.resize(8);\\n\\n assignment_vector.resize(8);\\n\\n assignment_vector << 0, 1, 2, 3, 4, 5, 6, 7;\\n\\n for (const auto& tracker : multi_tracker) {\\n\\n auto& cast_tracker = dynamic_cast<test::MockTracking&>(*tracker);\\n\\n EXPECT_CALL(cast_tracker, update(testing::_));\\n\\n }\\n\\n\\n\\n multi_tracker.updateAndInitializeTracks(measurements, assignment_vector);\\n\\n}\\n\",\n \"file_path\": \"test/src/tracking/multi_tracker_test.cpp\",\n \"rank\": 41,\n \"score\": 70963.90063184885\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#include <gtest/gtest.h>\\n\\n\\n\\n#include \\\"laser_object_tracker/tracking/multi_tracker.hpp\\\"\\n\\n\\n\\n#include \\\"test/utils.hpp\\\"\\n\\n#include \\\"test/data_association/mocks.hpp\\\"\\n\\n#include \\\"test/tracking/mocks.hpp\\\"\\n\",\n \"file_path\": \"test/src/tracking/multi_tracker_test.cpp\",\n \"rank\": 42,\n \"score\": 70957.37697471277\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"test/src/tracking/multi_tracker_test.cpp\",\n \"rank\": 43,\n \"score\": 70944.20835354984\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#include <gtest/gtest.h>\\n\\n\\n\\n#include \\\"laser_object_tracker/tracking/iteration_tracker_rejection.hpp\\\"\\n\\n\\n\\n#include \\\"test/utils.hpp\\\"\\n\\n#include \\\"test/tracking/mocks.hpp\\\"\\n\\n\\n\",\n \"file_path\": \"test/src/tracking/iteration_tracker_rejection_test.cpp\",\n \"rank\": 44,\n \"score\": 69391.14489325396\n },\n {\n \"content\": \"TEST(IterationTrackerRejectionTest, AccessorsTest) {\\n\\n laser_object_tracker::tracking::IterationTrackerRejection rejection(1);\\n\\n EXPECT_EQ(1, rejection.getMaxIterationsWithoutUpdate());\\n\\n\\n\\n rejection.setMaxIterationsWithoutUpdate(5);\\n\\n EXPECT_EQ(5, rejection.getMaxIterationsWithoutUpdate());\\n\\n}\\n\\n\\n\\nTEST(IterationTrackerRejectionTest, InvalidationTest) {\\n\\n laser_object_tracker::tracking::IterationTrackerRejection rejection(3);\\n\\n\\n\\n test::MockTracking tracking;\\n\\n\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n\\n\\n rejection.updated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n\\n\\n rejection.notUpdated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\",\n \"file_path\": \"test/src/tracking/iteration_tracker_rejection_test.cpp\",\n \"rank\": 45,\n \"score\": 69388.02744443632\n },\n {\n \"content\": \" rejection.notUpdated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n rejection.notUpdated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n\\n\\n rejection.updated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n rejection.notUpdated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n\\n\\n rejection.notUpdated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n rejection.notUpdated(tracking);\\n\\n EXPECT_FALSE(rejection.invalidate(tracking));\\n\\n rejection.notUpdated(tracking);\\n\\n EXPECT_TRUE(rejection.invalidate(tracking));\\n\\n rejection.notUpdated(tracking);\\n\\n EXPECT_TRUE(rejection.invalidate(tracking));\\n\\n}\\n\",\n \"file_path\": \"test/src/tracking/iteration_tracker_rejection_test.cpp\",\n \"rank\": 46,\n \"score\": 69383.49542294124\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"test/src/tracking/iteration_tracker_rejection_test.cpp\",\n \"rank\": 47,\n \"score\": 69377.94531830397\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_SEGMENTATION_HPP\\n\\n#define LASER_OBJECT_TRACKER_SEGMENTATION_SEGMENTATION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/segmentation/adaptive_breakpoint_detection.hpp\\\"\\n\\n#include \\\"laser_object_tracker/segmentation/base_segmentation.hpp\\\"\\n\\n#include \\\"laser_object_tracker/segmentation/breakpoint_detection.hpp\\\"\\n\\n#include \\\"laser_object_tracker/segmentation/distance_calculation.hpp\\\"\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_SEGMENTATION_SEGMENTATION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/segmentation.hpp\",\n \"rank\": 48,\n \"score\": 68362.35094905633\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_FILTERING_HPP\\n\\n#define LASER_OBJECT_TRACKER_FILTERING_FILTERING_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/filtering/aggregate_segmented_filtering.hpp\\\"\\n\\n#include \\\"laser_object_tracker/filtering/base_segmented_filtering.hpp\\\"\\n\\n#include \\\"laser_object_tracker/filtering/obb_area_filter.hpp\\\"\\n\\n#include \\\"laser_object_tracker/filtering/points_number_filter.hpp\\\"\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_FILTERING_FILTERING_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/filtering.hpp\",\n \"rank\": 49,\n \"score\": 68362.33155495749\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_VISUALIZATION_VISUALIZATION_HPP\\n\\n#define LASER_OBJECT_TRACKER_VISUALIZATION_VISUALIZATION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/visualization/laser_object_tracker_visualization.hpp\\\"\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_VISUALIZATION_VISUALIZATION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/visualization/visualization.hpp\",\n \"rank\": 50,\n \"score\": 68361.95932379953\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/segmentation.hpp\",\n \"rank\": 51,\n \"score\": 68352.65667550865\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/visualization/visualization.hpp\",\n \"rank\": 52,\n \"score\": 68352.65667550865\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/filtering.hpp\",\n \"rank\": 53,\n \"score\": 68352.65667550865\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_BASE_SEGMENTATION_HPP\\n\\n#define LASER_OBJECT_TRACKER_SEGMENTATION_BASE_SEGMENTATION_HPP\\n\\n\\n\\n#include <vector>\\n\\n\\n\\n#include \\\"laser_object_tracker/data_types/laser_scan_fragment.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace segmentation {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/base_segmentation.hpp\",\n \"rank\": 54,\n \"score\": 66856.88081629838\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_DISTANCE_CALCULATION_HPP\\n\\n#define LASER_OBJECT_TRACKER_SEGMENTATION_DISTANCE_CALCULATION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/data_types/definitions.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace segmentation {\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/distance_calculation.hpp\",\n \"rank\": 55,\n \"score\": 66856.78762119141\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_BREAKPOINT_DETECTION_HPP\\n\\n#define LASER_OBJECT_TRACKER_SEGMENTATION_BREAKPOINT_DETECTION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/segmentation/base_segmentation.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace segmentation {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/breakpoint_detection.hpp\",\n \"rank\": 56,\n \"score\": 66856.78762119141\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_OCCLUSION_DETECTION_HPP\\n\\n#define LASER_OBJECT_TRACKER_FILTERING_OCCLUSION_DETECTION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/filtering/base_segmented_filtering.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace filtering {\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/occlusion_detection.hpp\",\n \"rank\": 57,\n \"score\": 66856.76990575047\n },\n {\n \"content\": \"#include <sensor_msgs/LaserScan.h>\\n\\n\\n\\n// PCL\\n\\n#include <pcl/point_types.h>\\n\\n#include <pcl/point_cloud.h>\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace data_types {\\n\\n\\n\\n/**\\n\\n* @brief Proxy class for bool built-in type, used becuse std::vector<bool> is specialized template container,\\n\\n* not fully conforming to the standard.\\n\\n*/\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/definitions.hpp\",\n \"rank\": 58,\n \"score\": 66856.52981062968\n },\n {\n \"content\": \"\\n\\ntemplate<class T>\\n\\nT distance(const T& one,\\n\\n const T& two) {\\n\\n return std::fabs(one - two);\\n\\n}\\n\\n\\n\\ntemplate<class T>\\n\\nT distanceDirected(const T& one,\\n\\n const T& two) {\\n\\n return one - two;\\n\\n}\\n\\n} // namespace segmentation\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_SEGMENTATION_DISTANCE_CALCULATION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/distance_calculation.hpp\",\n \"rank\": 59,\n \"score\": 66852.36080367761\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_TYPES_DEFINITIONS_HPP\\n\\n#define LASER_OBJECT_TRACKER_DATA_TYPES_DEFINITIONS_HPP\\n\\n\\n\\n// STD\\n\\n#include <vector>\\n\\n\\n\\n// ROS\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/definitions.hpp\",\n \"rank\": 60,\n \"score\": 66852.26357441011\n },\n {\n \"content\": \" bool isValid() const {\\n\\n return !less_than_min_ && !more_than_max_;\\n\\n }\\n\\n\\n\\n bool lessThanMin() const {\\n\\n return less_than_min_;\\n\\n }\\n\\n\\n\\n bool moreThanMax() const {\\n\\n return more_than_max_;\\n\\n }\\n\\n\\n\\n private:\\n\\n double angle_;\\n\\n LaserScanType::_ranges_type::reference range_;\\n\\n OcclusionType::reference is_occluded_;\\n\\n PointCloudType::PointType& point_;\\n\\n\\n\\n bool less_than_min_;\\n\\n bool more_than_max_;\\n\\n};\\n\\n} // namespace data_types\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_DATA_TYPES_DEFINITIONS_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/definitions.hpp\",\n \"rank\": 61,\n \"score\": 66852.0908266655\n },\n {\n \"content\": \" return value_;\\n\\n }\\n\\n\\n\\n private:\\n\\n bool value_;\\n\\n};\\n\\n\\n\\nusing LaserScanType = sensor_msgs::LaserScan;\\n\\nusing OcclusionType = std::vector<Bool>;\\n\\nusing PointCloudType = pcl::PointCloud<pcl::PointXYZ>;\\n\\n\\n\\n/**\\n\\n * @brief Proxy class or aggregator for a single element of LaserScanFragment container, e.g. single measurement.\\n\\n * Each element consists of polar (angle and range members) and cartesian (point member) coordinates\\n\\n * corresponding to the current measure. Also provides information whether a measurement is occluded or no.\\n\\n */\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/definitions.hpp\",\n \"rank\": 62,\n \"score\": 66848.47399389603\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/base_segmentation.hpp\",\n \"rank\": 63,\n \"score\": 66843.60834025659\n },\n {\n \"content\": \" return range_;\\n\\n }\\n\\n LaserScanType::_ranges_type::const_reference range() const {\\n\\n return range_;\\n\\n }\\n\\n\\n\\n OcclusionType::reference isOccluded() {\\n\\n return is_occluded_;\\n\\n }\\n\\n OcclusionType::const_reference isOccluded() const {\\n\\n return is_occluded_;\\n\\n }\\n\\n\\n\\n PointCloudType::PointType& point() {\\n\\n return point_;\\n\\n }\\n\\n const PointCloudType::PointType& point() const {\\n\\n return point_;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/definitions.hpp\",\n \"rank\": 64,\n \"score\": 66843.60834025659\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/occlusion_detection.hpp\",\n \"rank\": 65,\n \"score\": 66843.60834025659\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/breakpoint_detection.hpp\",\n \"rank\": 66,\n \"score\": 66843.60834025659\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/definitions.hpp\",\n \"rank\": 67,\n \"score\": 66843.60834025659\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/distance_calculation.hpp\",\n \"rank\": 68,\n \"score\": 66843.60834025659\n },\n {\n \"content\": \" void step2b(const Eigen::MatrixXd& cost_matrix, Eigen::ArrayXXd& cost_matrix_copy, Eigen::VectorXi& assignment);\\n\\n void step3(const Eigen::MatrixXd& cost_matrix, Eigen::ArrayXXd& cost_matrix_copy, Eigen::VectorXi& assignment);\\n\\n void step4(const Eigen::MatrixXd& cost_matrix,\\n\\n Eigen::ArrayXXd& cost_matrix_copy,\\n\\n Eigen::VectorXi& assignment,\\n\\n int row,\\n\\n int column);\\n\\n void step5(const Eigen::MatrixXd& cost_matrix, Eigen::ArrayXXd& cost_matrix_copy, Eigen::VectorXi& assignment);\\n\\n\\n\\n bool isZero(double number, double precision = Eigen::NumTraits<double>::dummy_precision());\\n\\n\\n\\n Eigen::ArrayXXb star_matrix_;\\n\\n Eigen::ArrayXXb new_star_matrix_;\\n\\n Eigen::ArrayXXb prime_matrix_;\\n\\n Eigen::RowArrayXb covered_columns_;\\n\\n Eigen::ArrayXb covered_rows_;\\n\\n Eigen::Index min_dimension_;\\n\\n};\\n\\n} // namespace data_association\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif //LASER_OBJECT_TRACKER_DATA_ASSOCIATION_HUNGARIAN_ALGORITHM_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/data_association/hungarian_algorithm.hpp\",\n \"rank\": 69,\n \"score\": 65422.60678866495\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_HUNGARIAN_ALGORITHM_HPP\\n\\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_HUNGARIAN_ALGORITHM_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/data_association/base_data_association.hpp\\\"\\n\\n\\n\\nnamespace Eigen {\\n\\nusing ArrayXXb = Array<bool, Dynamic, Dynamic>;\\n\\nusing ArrayXb = Array<bool, Dynamic, 1>;\\n\\nusing RowArrayXb = Array<bool, 1, Dynamic>;\\n\\n} // namespace Eigen\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace data_association {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/data_association/hungarian_algorithm.hpp\",\n \"rank\": 70,\n \"score\": 65416.169098594284\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURES_FEATURES_HPP\\n\\n#define LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURES_FEATURES_HPP\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace feature_extraction {\\n\\nnamespace features {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/feature_extraction/features/features.hpp\",\n \"rank\": 71,\n \"score\": 65412.92983030366\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_SEGMENTATION_ADAPTIVE_BREAKPOINT_DETECTION_HPP\\n\\n#define LASER_OBJECT_TRACKER_SEGMENTATION_ADAPTIVE_BREAKPOINT_DETECTION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/segmentation/base_segmentation.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace segmentation {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/adaptive_breakpoint_detection.hpp\",\n \"rank\": 72,\n \"score\": 65412.896328118004\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_OBB_AREA_FILTER_HPP\\n\\n#define LASER_OBJECT_TRACKER_FILTERING_OBB_AREA_FILTER_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/filtering/base_segmented_filtering.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace filtering {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/obb_area_filter.hpp\",\n \"rank\": 73,\n \"score\": 65412.87871451743\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_POINTS_NUMBER_FILTER_HPP\\n\\n#define LASER_OBJECT_TRACKER_FILTERING_POINTS_NUMBER_FILTER_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/filtering/base_segmented_filtering.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace filtering {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/points_number_filter.hpp\",\n \"rank\": 74,\n \"score\": 65412.87871451743\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_AGGREGATE_SEGMENTED_FILTERING_HPP\\n\\n#define LASER_OBJECT_TRACKER_FILTERING_AGGREGATE_SEGMENTED_FILTERING_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/filtering/base_segmented_filtering.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace filtering {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/aggregate_segmented_filtering.hpp\",\n \"rank\": 75,\n \"score\": 65412.87871451743\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FILTERING_BASE_SEGMENTED_FILTERING_HPP\\n\\n#define LASER_OBJECT_TRACKER_FILTERING_BASE_SEGMENTED_FILTERING_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/data_types/laser_scan_fragment.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace filtering {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/base_segmented_filtering.hpp\",\n \"rank\": 76,\n \"score\": 65412.86115148409\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURE_EXTRACTION_HPP\\n\\n#define LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURE_EXTRACTION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/feature_extraction/features/features.hpp\\\"\\n\\n#include \\\"laser_object_tracker/feature_extraction/pcl/sac_model_cross2d.hpp\\\"\\n\\n#include \\\"laser_object_tracker/feature_extraction/base_feature_extraction.hpp\\\"\\n\\n#include \\\"laser_object_tracker/feature_extraction/random_sample_consensus_corner_detection.hpp\\\"\\n\\n#include \\\"laser_object_tracker/feature_extraction/random_sample_consensus_segment_detection.hpp\\\"\\n\\n#include \\\"laser_object_tracker/feature_extraction/search_based_corner_detection.hpp\\\"\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_FEATURE_EXTRACTION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/feature_extraction/feature_extraction.hpp\",\n \"rank\": 77,\n \"score\": 65409.502842355854\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_DATA_ASSOCIATION_HPP\\n\\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_DATA_ASSOCIATION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/data_association/base_data_association.hpp\\\"\\n\\n#include \\\"laser_object_tracker/data_association/hungarian_algorithm.hpp\\\"\\n\\n#include \\\"laser_object_tracker/data_association/naive_linear_assignment.hpp\\\"\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_DATA_ASSOCIATION_DATA_ASSOCIATION_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/data_association/data_association.hpp\",\n \"rank\": 78,\n \"score\": 65409.250199490605\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_TYPES_DATA_TYPES_HPP\\n\\n#define LASER_OBJECT_TRACKER_DATA_TYPES_DATA_TYPES_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/data_types/definitions.hpp\\\"\\n\\n#include \\\"laser_object_tracker/data_types/laser_scan_fragment.hpp\\\"\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_DATA_TYPES_DATA_TYPES_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/data_types.hpp\",\n \"rank\": 79,\n \"score\": 65409.096369224426\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/data_types.hpp\",\n \"rank\": 80,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/segmentation/adaptive_breakpoint_detection.hpp\",\n \"rank\": 81,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"class Bool {\\n\\n public:\\n\\n /**\\n\\n * @brief Implicit conversion c-tor from bool type.\\n\\n * @param value Value to be initialized to.\\n\\n */\\n\\n Bool(bool value) : value_(value) {}\\n\\n\\n\\n /**\\n\\n * @brief Conversion operator to type bool&.\\n\\n * @return Reference to underlying bool value.\\n\\n */\\n\\n operator bool&() {\\n\\n return value_;\\n\\n }\\n\\n /**\\n\\n * @brief Conversion operator to type const bool&.\\n\\n * @return Const reference to underlying bool value.\\n\\n */\\n\\n operator const bool&() const {\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/definitions.hpp\",\n \"rank\": 82,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/feature_extraction/feature_extraction.hpp\",\n \"rank\": 83,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/data_association/data_association.hpp\",\n \"rank\": 84,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/aggregate_segmented_filtering.hpp\",\n \"rank\": 85,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/data_association/hungarian_algorithm.hpp\",\n \"rank\": 86,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/feature_extraction/features/features.hpp\",\n \"rank\": 87,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/points_number_filter.hpp\",\n \"rank\": 88,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/obb_area_filter.hpp\",\n \"rank\": 89,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"/*********************************************************************\\n\\n*\\n\\n* BSD 3-Clause License\\n\\n*\\n\\n* Copyright (c) 2019, Piotr Pokorski\\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* 1. Redistributions of source code must retain the above copyright notice, this\\n\\n* list of conditions and the following disclaimer.\\n\\n*\\n\\n* 2. Redistributions in binary form must reproduce the above copyright notice,\\n\\n* this list of conditions and the following disclaimer in the documentation\\n\\n* and/or other materials provided with the distribution.\\n\\n*\\n\\n* 3. Neither the name of the copyright holder nor the names of its\\n\\n* contributors may be used to endorse or promote products derived from\\n\\n* this software without specific prior written permission.\\n\",\n \"file_path\": \"include/laser_object_tracker/filtering/base_segmented_filtering.hpp\",\n \"rank\": 90,\n \"score\": 65399.75242702672\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_TYPES_LASER_SCAN_FRAGMENT_HPP\\n\\n#define LASER_OBJECT_TRACKER_DATA_TYPES_LASER_SCAN_FRAGMENT_HPP\\n\\n\\n\\n// ROS\\n\\n#include <laser_geometry/laser_geometry.h>\\n\\n\\n\\n// PROJECT\\n\\n#include \\\"laser_object_tracker/data_types/definitions.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace data_types {\\n\\n\\n\\n/**\\n\\n * @brief Container-type class consisting of LaserScan measurement, corresponding PointCloud and Occlusion vector\\n\\n * informing whether each point is occluded or not by its neighbours.\\n\\n */\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/laser_scan_fragment.hpp\",\n \"rank\": 91,\n \"score\": 64032.85606226058\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_NAIVE_LINEAR_ASSIGNMENT_HPP\\n\\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_NAIVE_LINEAR_ASSIGNMENT_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/data_association/base_data_association.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace data_association {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/data_association/naive_linear_assignment.hpp\",\n \"rank\": 92,\n \"score\": 64030.01002729893\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_BASE_FEATURE_EXTRACTION_HPP\\n\\n#define LASER_OBJECT_TRACKER_FEATURE_EXTRACTION_BASE_FEATURE_EXTRACTION_HPP\\n\\n\\n\\n#include \\\"laser_object_tracker/data_types/laser_scan_fragment.hpp\\\"\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace feature_extraction {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/feature_extraction/base_feature_extraction.hpp\",\n \"rank\": 93,\n \"score\": 64030.01002729893\n },\n {\n \"content\": \"*\\n\\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n* OR TORT (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#ifndef LASER_OBJECT_TRACKER_DATA_ASSOCIATION_BASE_DATA_ASSOCIATION_HPP\\n\\n#define LASER_OBJECT_TRACKER_DATA_ASSOCIATION_BASE_DATA_ASSOCIATION_HPP\\n\\n\\n\\n#include <Eigen/Core>\\n\\n\\n\\nnamespace laser_object_tracker {\\n\\nnamespace data_association {\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/data_association/base_data_association.hpp\",\n \"rank\": 94,\n \"score\": 64029.90355607481\n },\n {\n \"content\": \" Reference at(size_t index);\\n\\n\\n\\n ConstReference at(size_t index) const;\\n\\n\\n\\n Reference operator[](size_t index);\\n\\n\\n\\n ConstReference operator[](size_t index) const;\\n\\n\\n\\n Reference front();\\n\\n\\n\\n ConstReference front() const;\\n\\n\\n\\n Reference back();\\n\\n\\n\\n ConstReference back() const;\\n\\n\\n\\n /**\\n\\n *\\n\\n * @return True if the container is empty, false otherwise\\n\\n */\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/laser_scan_fragment.hpp\",\n \"rank\": 95,\n \"score\": 64027.505424463794\n },\n {\n \"content\": \" * @return Iterator pointing to the first measurement (counting from min to max angle)\\n\\n */\\n\\n Iterator begin();\\n\\n /**\\n\\n *\\n\\n * @return Const iterator pointing to the first measurement (counting from min to max angle)\\n\\n */\\n\\n ConstIterator cbegin() const;\\n\\n\\n\\n /**\\n\\n *\\n\\n * @return Iterator pointing to the one measurement beyond last (counting from min to max angle)\\n\\n */\\n\\n Iterator end();\\n\\n /**\\n\\n *\\n\\n * @return Const iterator pointing to the one measurement beyond last (counting from min to max angle)\\n\\n */\\n\\n ConstIterator cend() const;\\n\\n\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/laser_scan_fragment.hpp\",\n \"rank\": 96,\n \"score\": 64027.2766308965\n },\n {\n \"content\": \" * @param other Prototype container\\n\\n * @param first First element of the range, included\\n\\n * @param last Last element of the range, not included\\n\\n */\\n\\n LaserScanFragment(const LaserScanFragment& other, long first, long last);\\n\\n\\n\\n /**\\n\\n *\\n\\n * @return Header of LaserScanType measurement\\n\\n */\\n\\n std_msgs::Header getHeader() const {\\n\\n return laser_scan_.header;\\n\\n }\\n\\n\\n\\n /**\\n\\n *\\n\\n * @return Min angle of the measurement (in polar coordinates)\\n\\n */\\n\\n double getAngleMin() const {\\n\\n return laser_scan_.angle_min;\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/laser_scan_fragment.hpp\",\n \"rank\": 97,\n \"score\": 64025.90779545393\n },\n {\n \"content\": \" LaserScanType laser_scan_;\\n\\n OcclusionType occlusion_vector_;\\n\\n PointCloudType laser_scan_cloud_;\\n\\n ContainerType elements_;\\n\\n};\\n\\n} // namespace data_types\\n\\n} // namespace laser_object_tracker\\n\\n\\n\\n#endif // LASER_OBJECT_TRACKER_DATA_TYPES_LASER_SCAN_FRAGMENT_HPP\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/laser_scan_fragment.hpp\",\n \"rank\": 98,\n \"score\": 64025.74345520761\n },\n {\n \"content\": \" }\\n\\n\\n\\n /**\\n\\n *\\n\\n * @return Max angle of the measurement (in polar coordinates)\\n\\n */\\n\\n double getAngleMax() const {\\n\\n return laser_scan_.angle_max;\\n\\n }\\n\\n\\n\\n /**\\n\\n *\\n\\n * @return Angle resolution of the laser scanner\\n\\n */\\n\\n double getAngleIncrement() const {\\n\\n return laser_scan_.angle_increment;\\n\\n }\\n\\n\\n\\n /**\\n\\n *\\n\",\n \"file_path\": \"include/laser_object_tracker/data_types/laser_scan_fragment.hpp\",\n \"rank\": 99,\n \"score\": 64021.03211602552\n }\n]","isConversational":false}}},{"rowIdx":299,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/rendering/ui.cpp"},"repo_name":{"kind":"string","value":"hyp/Arpheg"},"commit":{"kind":"string","value":"78d142c15028da7c0c2ef4503bed6bcfd1ced67d"},"file_code":{"kind":"string","value":"#include <limits>\n#include <string.h>\n#include \"../core/assert.h\"\n#include \"../core/allocatorNew.h\"\n#include \"../core/bufferArray.h\"\n#include \"../services.h\"\n#include \"rendering.h\"\n#include \"ui.h\"\n#include \"../data/font/font.h\"\n#include \"2d.h\"\n#include \"text.h\"\n#include \"opengl/gl.h\"\n\nnamespace rendering {\nnamespace ui {\n\nenum {\n\tNormalGeometry, TextGeometry, OutlinedTextGeometry\n};\n\nBatch::Batch() : verticesSize(0),indicesSize(0),primitive(topology::Triangle),name(\"\") {\n\tlayer=depth = 0;\n}\nstruct BatchImpl {\n\tuint32 layerDepth;\n\tcore::BufferAllocator vertices;\n\tcore::BufferAllocator indices;\n\tuint32 meshId;\n\tuint32 vertexSize;\n\tint pipelineId;\n\tconst data::Font* font;\n\tuint32 textureId;\n\t\n\n\tBatchImpl(const Batch& batch);\n\tBatchImpl(const BatchImpl& other,uint32 layer,uint32 texture);\n\n\tinline bool operator < (const BatchImpl& other){\n\t\treturn this->layerDepth < other.layerDepth;\n\t}\n};\nBatchImpl::BatchImpl(const Batch& batch) : \n\tvertices(batch.verticesSize?batch.verticesSize: 2048,services::threadSafeFrameAllocator(),core::BufferAllocator::GrowOnOverflow),\n\tindices(batch.indicesSize? batch.indicesSize: 1024,services::threadSafeFrameAllocator() ,core::BufferAllocator::GrowOnOverflow) \n{\n\tassert(batch.layer <= Batch::kMaxLayer);\n\tassert(batch.depth <= Batch::kMaxDepth);\n\tlayerDepth = (batch.layer<<8) | batch.depth;\n\tmeshId = 0;\n\tfont = nullptr;\n\ttextureId = 0;\n}\nBatchImpl::BatchImpl(const BatchImpl& other,uint32 layer,uint32 texture) : \n\tvertices(2048,services::threadSafeFrameAllocator(),core::BufferAllocator::GrowOnOverflow),\n\tindices( 1024,services::threadSafeFrameAllocator() ,core::BufferAllocator::GrowOnOverflow)\n{\n\tassert(layer <= Batch::kMaxLayer);\n\tlayerDepth = (layer << 8) | (other.layerDepth & Batch::kMaxDepth);\n\tmeshId = other.meshId;\n\tfont = other.font;\n\ttextureId = texture;\n\tvertexSize = other.vertexSize;\n\tpipelineId = other.pipelineId;\n}\n\nuint32 Service::registerBatch(const Batch& batch,int pipelineId,uint32 meshId ) {\n\tusing namespace core::bufferArray;\n\tauto bimpl = new(batches_.allocate(sizeof(BatchImpl),alignof(BatchImpl))) BatchImpl(batch);\n\tbimpl->meshId = meshId;\n\tbimpl->vertexSize = meshes_[meshId].vertexSize;\n\tbimpl->pipelineId = pipelineId; \n\treturn uint32(length<BatchImpl>(batches_)-1);\n}\nuint32 Service::cloneBatch(uint32 id,uint32 layerId,uint32 textureId) {\n\tusing namespace core::bufferArray;\n\tauto bimpl = new(batches_.allocate(sizeof(BatchImpl),alignof(BatchImpl))) BatchImpl(nth<BatchImpl>(batches_,id),layerId,textureId);\n\treturn uint32(length<BatchImpl>(batches_)-1);\n}\n\nstruct BatchFontMapping {\n\tconst data::Font* key;\n\tuint32 value;\n};\n\nService::UniquePipeline::UniquePipeline(Pipeline pipeline) :matrixConstant(\"matrix\"),texturesConstant(\"textures\") {\n\tthis->pipeline = pipeline;\n}\nuint32 Service::uiPipeline(const rendering::Pipeline& pipeline) {\n\tfor(uint32 i = 0;i<kMaxPipelines;++i){\n\t\tif(pipelines_[i].pipeline == pipeline) return i;\n\t}\n\tfor(uint32 dest = kMaxDefaultPipelines;dest<kMaxPipelines;++dest){\n\t\tif(pipelines_[dest].pipeline == Pipeline::nullPipeline()){\n\t\t\tpipelines_[dest] = UniquePipeline(pipeline);\n\t\t\treturn dest;\n\t\t}\n\t}\n\tassertRelease(false && \"Can't register a new ui pipeline!\");\n\treturn 0;\n}\nuint32 Service::uiTexture (const rendering::Texture2D& texture) {\n\tfor(uint32 i = 0;i<kMaxTextures;++i){\n\t\tif(textures_[i] == texture) return i;\n\t}\n\tfor(uint32 dest = 0;dest<kMaxTextures;++dest){\n\t\tif(textures_[dest] == Texture2D::null()){\n\t\t\ttextures_[dest] = texture;\n\t\t\treturn dest;\n\t\t}\n\t}\n\tassertRelease(false && \"Can't register a new ui texture - need mores storage units!\");\n\treturn 0;\n}\n\nbool Service::loadCorePipeline(int id,const char* name) {\n\tint& pipe = defaultPipelines_[id];\n\tif(pipe == -1){\n\t\tif(auto asset = services::data()->pipeline(services::data()->bundle(\"core\",true),name,true)){\n\t\t\tpipe = id;\n\t\t\tassert(pipelines_[id].pipeline == Pipeline::nullPipeline());\n\t\t\tpipelines_[id] = UniquePipeline(asset->pipeline());\n\t\t} else {\n\t\t\tpipe = -2;\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nuint32 Service::registerFontBatch(const data::Font* font) {\n\tif(font->renderingType() == text::fontType::Outlined) \n\t\tloadCorePipeline(OutlinedTextPipeline,\"rendering.text.outlined.pipeline\");\n\telse\n\t\tloadCorePipeline(TextPipeline,\"rendering.text.pipeline\");\n\n\tBatch batch;\n\tbatch.name = \"font\";\n\tbatch.depth = Batch::kMaxDepth;\n\n\tauto id = registerBatch(batch,\n\t\tfont->renderingType() == text::fontType::Outlined? OutlinedTextPipeline : TextPipeline,\n\t\tfont->renderingType() == text::fontType::Outlined? OutlinedTextGeometry : TextGeometry);\n\tcore::bufferArray::nth<BatchImpl>(batches_,id).font = font;\n\tBatchFontMapping map = {font,id};\n\tcore::bufferArray::add<BatchFontMapping>(fontBatches_,map);\n\treturn id;\n}\n\nBatch::Geometry Service::allocate(uint32 layerId,const data::Font* font,uint32 vertexCount,uint32 indexCount) {\n\t\n\tuint32 batchId = 0xFFFF;\n\tusing namespace core::bufferArray;\n\tfor(const BatchFontMapping* i = begin<BatchFontMapping>(fontBatches_),*e = end<BatchFontMapping>(fontBatches_);i<e;++i){\n\t\tif(i->key == font){\n\t\t\tbatchId = i->value;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(batchId == 0xFFFF) batchId = registerFontBatch(font);\n\treturn allocate(layerId,batchId,0,vertexCount,indexCount);\n}\nBatch::Geometry Service::allocate(uint32 layerId,uint32 batchId,uint32 textureId,uint32 vertexCount,uint32 indexCount) {\n\tassert(batchId < core::bufferArray::length<BatchImpl>(batches_));\n\t\n\tauto batch = core::bufferArray::begin<BatchImpl>(batches_) + batchId;\n\tif(batch->textureId != textureId){\n\t\tbatch = core::bufferArray::begin<BatchImpl>(batches_) + cloneBatch(batchId,layerId,textureId);\n\t}\n\n\tBatch::Geometry result = {\n\t\tbatch->vertices.size()/batch->vertexSize,\n\t\t(float*)batch->vertices.allocate(batch->vertexSize*vertexCount),\n\t\tindexCount? (uint16*)batch->indices.allocate(sizeof(uint16)*indexCount) : nullptr\n\t};\n\treturn result;\n}\n\nstatic VertexDescriptor meshVertexDescriptor(uint32 i){\n\treturn i == NormalGeometry? draw2D::positionInt16::vertexLayout(draw2D::mode::Textured|draw2D::mode::Coloured) : \n\t\t i == TextGeometry? text::vertexLayout(text::fontType::Default) : text::vertexLayout(text::fontType::Outlined) ;\n}\nstatic uint32 vertexSize(uint32 i){\n\tauto layout = meshVertexDescriptor(i);\n\tuint32 sz = 0;\n\tfor(uint32 i = 0;i<layout.count;++i){\n\t\tsz += layout.fields[i].size();\n\t}\n\treturn sz;\n}\n\nvoid Service::prepareRendering() {\n\tusing namespace core::bufferArray;\n\n\t\n\tloadCorePipeline(TexturedColouredPipeline,\"rendering.2d.textured.coloured.pipeline\");\n\tloadCorePipeline(ColouredPipeline,\"rendering.2d.coloured.pipeline\");\n\n\tpointSampler_ = services::data()->sampler(services::data()->bundle(\"core\",true),\"rendering.sampler.point\",true);\n\tfontSampler_ = pointSampler_;\n\t\n\t\n\tauto batchCount = length<BatchImpl>(batches_);\n\tuint32 storage[1024];\n\tif(batchCount > (sizeof(storage)/sizeof(storage[0]))){\n\t\tassert(false && \"Can't sort the ui batches\");\n\t\treturn;\n\t}\n\tfor(size_t i = 0;i<batchCount;++i){\n\t\tstorage[i] = (uint32(i)<<16) | nth<BatchImpl>(batches_,i).layerDepth;\n\t}\n\tstruct Pred{ inline bool operator ()(uint32 a,uint32 b) { return (a&0xFFFF) < (b&0xFFFF); } };\n\tstd::sort(storage,storage+batchCount,Pred());\n\n\t\n}\n\nvoid Service::render(const mat44f& matrix) {\n\n\tauto renderer = services::rendering();\n\t\n\trenderer->bind(blending::alpha());\n\tglDisable(GL_DEPTH_TEST);\n\tglDisable(GL_CULL_FACE);\n\tusing namespace core::bufferArray;\n\n\t\n\tstruct MeshSupport {\n\t\tsize_t requiredVertexSize;\n\t\tsize_t requiredIndexSize;\n\t\tuint32 vertexOffset,indexOffset;\n\t\tBuffer::Mapping vertexMapping,indexMapping;\n\t\tbool justCreated;\n\n\t\tinline uint8* vertices(uint32 vertexSize){ return ((uint8*)vertexMapping.data) + vertexOffset*vertexSize; }\n\t\tinline uint8* indices(){ return ((uint8*)indexMapping.data) + indexOffset*sizeof(uint16); }\n\t};\n\tMeshSupport meshSupport[kMaxGeometries];\n\n\tstruct BatchSupport {\n\t\tbool draw,indexed;\n\t\tuint32 baseVertex;\n\t\tuint32 offset,count;\n\t};\n\t\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tmeshSupport[i].requiredVertexSize = meshSupport[i].requiredIndexSize = 0;\n\t\tmeshSupport[i].justCreated = false;\n\t}\n\tfor(BatchImpl* i = begin<BatchImpl>(batches_),*e = end<BatchImpl>(batches_);i<e;++i){\n\t\tmeshSupport[i->meshId].requiredVertexSize+= i->vertices.size();\n\t\tmeshSupport[i->meshId].requiredIndexSize += i->indices.size();\n\t}\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tauto mesh = meshes_ + i;\n\t\tif(mesh->vbo.isNull()){\n\t\t\tmesh->vbo = renderer->create(rendering::Buffer::Vertex,true,meshSupport[i].requiredVertexSize);\n\t\t\tmesh->ibo = renderer->create(rendering::Buffer::Index,true,meshSupport[i].requiredIndexSize);\n\t\t\tmesh->mesh = renderer->create(mesh->vbo,mesh->ibo,meshVertexDescriptor(i));\n\t\t\tmeshSupport[i].justCreated = true;\n\t\t}\n\t}\n\n\tsize_t batchCount = length<BatchImpl>(batches_);\n\tBatchSupport* batchSupport = (BatchSupport*)services::frameAllocator()->allocate(sizeof(BatchSupport)*batchCount,alignof(BatchSupport));\n\t\n\t\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tauto mesh = meshes_ + i;\n\t\tif(!meshSupport[i].justCreated){\n\t\t\trenderer->recreate(rendering::Buffer::Vertex,mesh->vbo,true,meshSupport[i].requiredVertexSize);\n\t\t\trenderer->recreate(rendering::Buffer::Index,mesh->ibo,true,meshSupport[i].requiredIndexSize);\n\t\t}\n\t\tif(meshSupport[i].requiredVertexSize > 0){\n\t\t\tmeshSupport[i].vertexMapping = renderer->map(rendering::Buffer::Vertex,mesh->vbo);\n\t\t\tmeshSupport[i].vertexOffset = 0;\n\t\t}\n\t\tif(meshSupport[i].requiredIndexSize > 0){\n\t\t\tmeshSupport[i].indexMapping = renderer->map(rendering::Buffer::Index,mesh->ibo);\n\t\t\tmeshSupport[i].indexOffset = 0;\n\t\t}\n\t}\n\tfor(size_t i = 0;i<batchCount;++i){\n\t\tconst BatchImpl* batch = begin<BatchImpl>(batches_) + i;\n\t\tBatchSupport support;\n\t\tsupport.draw = false;\n\t\tif(batch->vertices.size()){\n\t\t\tsupport.baseVertex = meshSupport[batch->meshId].vertexOffset;\n\t\t\tsupport.draw = true;\n\t\t\tmemcpy(meshSupport[batch->meshId].vertices(batch->vertexSize),batch->vertices.bufferBase(),batch->vertices.size());\n\t\t\tsupport.offset = uint32(meshSupport[batch->meshId].vertexOffset);\n\t\t\tuint32 vertexCount = uint32(batch->vertices.size()/batch->vertexSize);\n\t\t\tsupport.count = vertexCount;\n\t\t\tmeshSupport[batch->meshId].vertexOffset+=vertexCount;\n\t\t}\n\t\tif(batch->indices.size()){\n\t\t\tsupport.indexed = true;\n\t\t\tmemcpy(meshSupport[batch->meshId].indices(),batch->indices.bufferBase(),batch->indices.size());\n\t\t\tsupport.offset = uint32(meshSupport[batch->meshId].indexOffset)*sizeof(uint16);\n\t\t\tuint32 indexCount = uint32(batch->indices.size()/sizeof(uint16));\n\t\t\tsupport.count = indexCount;\n\t\t\tmeshSupport[batch->meshId].indexOffset+=indexCount;\n\t\t}\n\t\tbatchSupport[i] = support;\n\t}\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tif(meshSupport[i].requiredVertexSize > 0) renderer->unmap(meshSupport[i].vertexMapping);\n\t\tif(meshSupport[i].requiredIndexSize > 0) renderer->unmap(meshSupport[i].indexMapping);\n\t}\n\n\t\n\tif(!(textures_[0] == Texture2D::null())){\n\t\trenderer->bind(textures_[0],0);\n\t\trenderer->bind(pointSampler_,0);\n\t}\n\n\t\n\tuint32 currentBoundMesh = kMaxGeometries;\n\tPipeline currentBoundPipeline = Pipeline::nullPipeline();\n\tbool constantsBound[kMaxPipelines] = {false};\n\tbool textureUnitsBound[kMaxPipelines] = {false};\n\n\tfor(size_t i = 0;i<batchCount;++i){\n\t\tif(!batchSupport[i].draw) continue;\n\n\t\tconst BatchImpl* batch = begin<BatchImpl>(batches_) + i;\n\n\t\t\n\t\tif(!(pipelines_[batch->pipelineId].pipeline == currentBoundPipeline)){\n\t\t\trenderer->bind(pipelines_[batch->pipelineId].pipeline);\n\t\t\tif(!constantsBound[batch->pipelineId]){\n\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].matrixConstant,matrix);\n\t\t\t\tconstantsBound[batch->pipelineId] = true; \n\t\t\t}\n\t\t\tif(batch->font){\n\t\t\t\tint fontTextureUnit = 2;\n\t\t\t\trenderer->bind(batch->font->pages_[0],fontTextureUnit);\n\t\t\t\trenderer->bind(fontSampler_,fontTextureUnit);\n\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].texturesConstant,&fontTextureUnit);\n\t\t\t} else {\n\t\t\t\tif(batch->textureId != 0){\n\t\t\t\t\tint unit = 1;\n\t\t\t\t\trenderer->bind(textures_[batch->textureId],unit);\n\t\t\t\t\trenderer->bind(pointSampler_,unit);\n\t\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].texturesConstant,&unit);\n\t\t\t\t\ttextureUnitsBound[batch->pipelineId] = false;\n\t\t\t\t} else if(!textureUnitsBound[batch->pipelineId]) {\n\t\t\t\t\tint unit = 0 ;\n\t\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].texturesConstant,&unit);\n\t\t\t\t\ttextureUnitsBound[batch->pipelineId] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\t\t\n\t\tif(currentBoundMesh != batch->meshId){\n\t\t\trenderer->bind(meshes_[batch->meshId].mesh,rendering::topology::Triangle,sizeof(uint16));\n\t\t\tcurrentBoundMesh = batch->meshId;\n\t\t}\n\n\t\tif(batchSupport[i].indexed)\n\t\t\trenderer->drawIndexed(batchSupport[i].offset,batchSupport[i].count,batchSupport[i].baseVertex);\n\t\telse\n\t\t\trenderer->draw(batchSupport[i].offset,batchSupport[i].count);\n\t}\n\n\tglEnable(GL_DEPTH_TEST);\n\trenderer->bind(blending::disabled());\n}\nvoid Service::servicePreStep(){\n\tnew(&fontBatches_) core::BufferAllocator(sizeof(BatchFontMapping)*32,services::frameAllocator(),core::BufferAllocator::GrowOnOverflow);\n\tnew(&batches_) core::BufferAllocator(sizeof(BatchImpl)*64,services::frameAllocator(),core::BufferAllocator::GrowOnOverflow);\n\n\t\n\tfor(uint32 dest = 0;dest<kMaxTextures;++dest){\n\t\ttextures_[dest] = Texture2D::null();\n\t}\n}\nvoid Service::servicePostStep(){\n}\nService::Service() :\nbatches_(128,services::frameAllocator()),\nfontBatches_(128,services::frameAllocator())\n{\n\tfor(uint32 i = 0;i<kMaxDefaultPipelines;++i) defaultPipelines_[i] = -1;\n\n\tfor(uint32 i = 0; i<kMaxGeometries;++i){\n\t\tmeshes_[i].vertexSize = vertexSize(i);\n\t\tmeshes_[i].vbo = meshes_[i].ibo = Buffer::nullBuffer();\n\t}\n}\nService::~Service(){\n\tusing namespace core::bufferArray;\n\tauto renderer = services::rendering();\n\n\tfor(uint32 i = 0; i<kMaxGeometries;++i){\n\t\tif(!meshes_[i].vbo.isNull()){\n\t\t\trenderer->release(meshes_[i].mesh);\n\t\t\trenderer->release(meshes_[i].vbo);\n\t\t\tif(meshes_[i].ibo.isNull()) renderer->release(meshes_[i].ibo);\n\t\t}\n\t}\n}\n\n} }"},"prefix":{"kind":"string","value":"#include <limits>\n#include <string.h>\n#include \"../core/assert.h\"\n#include \"../core/allocatorNew.h\"\n#include \"../core/bufferArray.h\"\n#include \"../services.h\"\n#include \"rendering.h\"\n#include \"ui.h\"\n#include \"../data/font/font.h\"\n#include \"2d.h\"\n#include \"text.h\"\n#include \"opengl/gl.h\"\n\nnamespace rendering {\nnamespace ui {\n\nenum {\n\tNormalGeometry, TextGeometry, OutlinedTextGeometry\n};\n\nBatch::Batch() : verticesSize(0),indicesSize(0),primitive(topology::Triangle),name(\"\") {\n\tlayer=depth = 0;\n}\nstruct BatchImpl {\n\tuint32 layerDepth;\n\tcore::BufferAllocator vertices;\n\tcore::BufferAllocator indices;\n\tuint32 meshId;\n\tuint32 vertexSize;\n\tint pipelineId;\n\tconst data::Font* font;\n\tuint32 textureId;\n\t\n\n\tBatchImpl(const Batch& batch);\n\tBatchImpl(const BatchImpl& other,uint32 layer,uint32 texture);\n\n\tinline bool operator < (const BatchImpl& other){\n\t\treturn this->layerDepth < other.layerDepth;\n\t}\n};\nBatchImpl::BatchImpl(const Batch& batch) : \n\tvertices(batch.verticesSize?batch.verticesSize: 2048,services::threadSafeFrameAllocator(),core::BufferAllocator::GrowOnOverflow),\n\tindices(batch.indicesSize? batch.indicesSize: 1024,services::threadSafeFrameAllocator() ,core::BufferAllocator::GrowOnOverflow) \n{\n\tassert(batch.layer <= Batch::kMaxLayer);\n\tassert(batch.depth <= Batch::kMaxDepth);\n\tlayerDepth = (batch.layer<<8) | batch.depth;\n\tmeshId = 0;\n\tfont = nullptr;\n\ttextureId = 0;\n}\nBatchImpl::BatchImpl(const BatchImpl& other,uint32 layer,uint32 texture) : \n\tvertices(2048,services::threadSafeFrameAllocator(),core::BufferAllocator::GrowOnOverflow),\n\tindices( 1024,services::threadSafeFrameAllocator() ,core::BufferAllocator::GrowOnOverflow)\n{\n\tassert(layer <= Batch::kMaxLayer);\n\tlayerDepth = (layer << 8) | (other.layerDepth & Batch::kMaxDepth);\n\tmeshId = other.meshId;\n\tfont = other.font;\n\ttextureId = texture;\n\tvertexSize = other.vertexSize;\n\tpipelineId = other.pipelineId;\n}\n\nuint32 Service::registerBatch(const Batch& batch,int pipelineId,uint32 meshId ) {\n\tusing namespace core::bufferArray;\n\tauto bimpl = new(batches_.allocate(sizeof(BatchImpl),alignof(BatchImpl))) BatchImpl(batch);\n\tbimpl->meshId = meshId;\n\tbimpl->vertexSize = meshes_[meshId].vertexSize;\n\tbimpl->pipelineId = pipelineId; \n\treturn uint32(length<BatchImpl>(batches_)-1);\n}\nuint32 Service::cloneBatch(uint32 id,uint32 layerId,uint32 textureId) {\n\tusing namespace core::bufferArray;\n\tauto bimpl = new(batches_.allocate(sizeof(BatchImpl),alignof(BatchImpl))) BatchImpl(nth<BatchImpl>(batches_,id),layerId,textureId);\n\treturn uint32(length<BatchImpl>(batches_)-1);\n}\n\nstruct BatchFontMapping {\n\tconst data::Font* key;\n\tuint32 value;\n};\n\nService::UniquePipeline::UniquePipeline(Pipeline pipeline) :matrixConstant(\"matrix\"),texturesConstant(\"textures\") {\n\tthis->pipeline = pipeline;\n}\nuint32 Service::uiPipeline(const rendering::Pipeline& pipeline) {\n\tfor(uint32 i = 0;i<kMaxPipelines;++i){\n\t\tif(pipelines_[i].pipeline == pipeline) return i;\n\t}\n\tfor(uint32 dest = kMaxDefaultPipelines;dest<kMaxPipelines;++dest){\n\t\tif(pipelines_[dest].pipeline == Pipeline::nullPipeline()){\n\t\t\tpipelines_[dest] = UniquePipeline(pipeline);\n\t\t\treturn dest;\n\t\t}\n\t}\n\tassertRelease(false && \"Can't register a new ui pipeline!\");\n\treturn 0;\n}\nuint32 Service::uiTexture (const rendering::Texture2D& texture) {\n\tfor(uint32 i = 0;i<kMaxTextures;++i){\n\t\tif(textures_[i] == texture) return i;\n\t}\n\tfor(uint32 dest = 0;dest<kMaxTextures;++dest){\n\t\tif(textures_[dest] == Texture2D::null()){\n\t\t\ttextures_[dest] = texture;\n\t\t\treturn dest;\n\t\t}\n\t}\n\tassertRelease(false && \"Can't register a new ui texture - need mores storage units!\");\n\treturn 0;\n}\n\nbool Service::loadCorePipeline(int id,const char* name) {\n\tint& pipe = defaultPipelines_[id];\n\tif(pipe == -1){\n\t\tif(auto asset = services::data()->pipeline(services::data()->bundle(\"core\",true),name,true)){\n\t\t\tpipe = id;\n\t\t\tassert(pipelines_[id].pipeline == Pipeline::nullPipeline());\n\t\t\tpipelines_[id] = UniquePipeline(asset->pipeline());\n\t\t} else {\n\t\t\tpipe = -2;\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nuint32 Service::registerFontBatch(const data::Font* font) {\n\tif(font->renderingType() == text::fontType::Outlined) \n\t\tloadCorePipeline(OutlinedTextPipeline,\"rendering.text.outlined.pipeline\");\n\telse\n\t\tloadCorePipeline(TextPipeline,\"rendering.text.pipeline\");\n\n\tBatch batch;\n\tbatch.name = \"font\";\n\tbatch.depth = Batch::kMaxDepth;\n\n\tauto id = "},"suffix":{"kind":"string","value":";\n\tcore::bufferArray::nth<BatchImpl>(batches_,id).font = font;\n\tBatchFontMapping map = {font,id};\n\tcore::bufferArray::add<BatchFontMapping>(fontBatches_,map);\n\treturn id;\n}\n\nBatch::Geometry Service::allocate(uint32 layerId,const data::Font* font,uint32 vertexCount,uint32 indexCount) {\n\t\n\tuint32 batchId = 0xFFFF;\n\tusing namespace core::bufferArray;\n\tfor(const BatchFontMapping* i = begin<BatchFontMapping>(fontBatches_),*e = end<BatchFontMapping>(fontBatches_);i<e;++i){\n\t\tif(i->key == font){\n\t\t\tbatchId = i->value;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(batchId == 0xFFFF) batchId = registerFontBatch(font);\n\treturn allocate(layerId,batchId,0,vertexCount,indexCount);\n}\nBatch::Geometry Service::allocate(uint32 layerId,uint32 batchId,uint32 textureId,uint32 vertexCount,uint32 indexCount) {\n\tassert(batchId < core::bufferArray::length<BatchImpl>(batches_));\n\t\n\tauto batch = core::bufferArray::begin<BatchImpl>(batches_) + batchId;\n\tif(batch->textureId != textureId){\n\t\tbatch = core::bufferArray::begin<BatchImpl>(batches_) + cloneBatch(batchId,layerId,textureId);\n\t}\n\n\tBatch::Geometry result = {\n\t\tbatch->vertices.size()/batch->vertexSize,\n\t\t(float*)batch->vertices.allocate(batch->vertexSize*vertexCount),\n\t\tindexCount? (uint16*)batch->indices.allocate(sizeof(uint16)*indexCount) : nullptr\n\t};\n\treturn result;\n}\n\nstatic VertexDescriptor meshVertexDescriptor(uint32 i){\n\treturn i == NormalGeometry? draw2D::positionInt16::vertexLayout(draw2D::mode::Textured|draw2D::mode::Coloured) : \n\t\t i == TextGeometry? text::vertexLayout(text::fontType::Default) : text::vertexLayout(text::fontType::Outlined) ;\n}\nstatic uint32 vertexSize(uint32 i){\n\tauto layout = meshVertexDescriptor(i);\n\tuint32 sz = 0;\n\tfor(uint32 i = 0;i<layout.count;++i){\n\t\tsz += layout.fields[i].size();\n\t}\n\treturn sz;\n}\n\nvoid Service::prepareRendering() {\n\tusing namespace core::bufferArray;\n\n\t\n\tloadCorePipeline(TexturedColouredPipeline,\"rendering.2d.textured.coloured.pipeline\");\n\tloadCorePipeline(ColouredPipeline,\"rendering.2d.coloured.pipeline\");\n\n\tpointSampler_ = services::data()->sampler(services::data()->bundle(\"core\",true),\"rendering.sampler.point\",true);\n\tfontSampler_ = pointSampler_;\n\t\n\t\n\tauto batchCount = length<BatchImpl>(batches_);\n\tuint32 storage[1024];\n\tif(batchCount > (sizeof(storage)/sizeof(storage[0]))){\n\t\tassert(false && \"Can't sort the ui batches\");\n\t\treturn;\n\t}\n\tfor(size_t i = 0;i<batchCount;++i){\n\t\tstorage[i] = (uint32(i)<<16) | nth<BatchImpl>(batches_,i).layerDepth;\n\t}\n\tstruct Pred{ inline bool operator ()(uint32 a,uint32 b) { return (a&0xFFFF) < (b&0xFFFF); } };\n\tstd::sort(storage,storage+batchCount,Pred());\n\n\t\n}\n\nvoid Service::render(const mat44f& matrix) {\n\n\tauto renderer = services::rendering();\n\t\n\trenderer->bind(blending::alpha());\n\tglDisable(GL_DEPTH_TEST);\n\tglDisable(GL_CULL_FACE);\n\tusing namespace core::bufferArray;\n\n\t\n\tstruct MeshSupport {\n\t\tsize_t requiredVertexSize;\n\t\tsize_t requiredIndexSize;\n\t\tuint32 vertexOffset,indexOffset;\n\t\tBuffer::Mapping vertexMapping,indexMapping;\n\t\tbool justCreated;\n\n\t\tinline uint8* vertices(uint32 vertexSize){ return ((uint8*)vertexMapping.data) + vertexOffset*vertexSize; }\n\t\tinline uint8* indices(){ return ((uint8*)indexMapping.data) + indexOffset*sizeof(uint16); }\n\t};\n\tMeshSupport meshSupport[kMaxGeometries];\n\n\tstruct BatchSupport {\n\t\tbool draw,indexed;\n\t\tuint32 baseVertex;\n\t\tuint32 offset,count;\n\t};\n\t\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tmeshSupport[i].requiredVertexSize = meshSupport[i].requiredIndexSize = 0;\n\t\tmeshSupport[i].justCreated = false;\n\t}\n\tfor(BatchImpl* i = begin<BatchImpl>(batches_),*e = end<BatchImpl>(batches_);i<e;++i){\n\t\tmeshSupport[i->meshId].requiredVertexSize+= i->vertices.size();\n\t\tmeshSupport[i->meshId].requiredIndexSize += i->indices.size();\n\t}\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tauto mesh = meshes_ + i;\n\t\tif(mesh->vbo.isNull()){\n\t\t\tmesh->vbo = renderer->create(rendering::Buffer::Vertex,true,meshSupport[i].requiredVertexSize);\n\t\t\tmesh->ibo = renderer->create(rendering::Buffer::Index,true,meshSupport[i].requiredIndexSize);\n\t\t\tmesh->mesh = renderer->create(mesh->vbo,mesh->ibo,meshVertexDescriptor(i));\n\t\t\tmeshSupport[i].justCreated = true;\n\t\t}\n\t}\n\n\tsize_t batchCount = length<BatchImpl>(batches_);\n\tBatchSupport* batchSupport = (BatchSupport*)services::frameAllocator()->allocate(sizeof(BatchSupport)*batchCount,alignof(BatchSupport));\n\t\n\t\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tauto mesh = meshes_ + i;\n\t\tif(!meshSupport[i].justCreated){\n\t\t\trenderer->recreate(rendering::Buffer::Vertex,mesh->vbo,true,meshSupport[i].requiredVertexSize);\n\t\t\trenderer->recreate(rendering::Buffer::Index,mesh->ibo,true,meshSupport[i].requiredIndexSize);\n\t\t}\n\t\tif(meshSupport[i].requiredVertexSize > 0){\n\t\t\tmeshSupport[i].vertexMapping = renderer->map(rendering::Buffer::Vertex,mesh->vbo);\n\t\t\tmeshSupport[i].vertexOffset = 0;\n\t\t}\n\t\tif(meshSupport[i].requiredIndexSize > 0){\n\t\t\tmeshSupport[i].indexMapping = renderer->map(rendering::Buffer::Index,mesh->ibo);\n\t\t\tmeshSupport[i].indexOffset = 0;\n\t\t}\n\t}\n\tfor(size_t i = 0;i<batchCount;++i){\n\t\tconst BatchImpl* batch = begin<BatchImpl>(batches_) + i;\n\t\tBatchSupport support;\n\t\tsupport.draw = false;\n\t\tif(batch->vertices.size()){\n\t\t\tsupport.baseVertex = meshSupport[batch->meshId].vertexOffset;\n\t\t\tsupport.draw = true;\n\t\t\tmemcpy(meshSupport[batch->meshId].vertices(batch->vertexSize),batch->vertices.bufferBase(),batch->vertices.size());\n\t\t\tsupport.offset = uint32(meshSupport[batch->meshId].vertexOffset);\n\t\t\tuint32 vertexCount = uint32(batch->vertices.size()/batch->vertexSize);\n\t\t\tsupport.count = vertexCount;\n\t\t\tmeshSupport[batch->meshId].vertexOffset+=vertexCount;\n\t\t}\n\t\tif(batch->indices.size()){\n\t\t\tsupport.indexed = true;\n\t\t\tmemcpy(meshSupport[batch->meshId].indices(),batch->indices.bufferBase(),batch->indices.size());\n\t\t\tsupport.offset = uint32(meshSupport[batch->meshId].indexOffset)*sizeof(uint16);\n\t\t\tuint32 indexCount = uint32(batch->indices.size()/sizeof(uint16));\n\t\t\tsupport.count = indexCount;\n\t\t\tmeshSupport[batch->meshId].indexOffset+=indexCount;\n\t\t}\n\t\tbatchSupport[i] = support;\n\t}\n\tfor(uint32 i = 0;i<kMaxGeometries;++i){\n\t\tif(meshSupport[i].requiredVertexSize > 0) renderer->unmap(meshSupport[i].vertexMapping);\n\t\tif(meshSupport[i].requiredIndexSize > 0) renderer->unmap(meshSupport[i].indexMapping);\n\t}\n\n\t\n\tif(!(textures_[0] == Texture2D::null())){\n\t\trenderer->bind(textures_[0],0);\n\t\trenderer->bind(pointSampler_,0);\n\t}\n\n\t\n\tuint32 currentBoundMesh = kMaxGeometries;\n\tPipeline currentBoundPipeline = Pipeline::nullPipeline();\n\tbool constantsBound[kMaxPipelines] = {false};\n\tbool textureUnitsBound[kMaxPipelines] = {false};\n\n\tfor(size_t i = 0;i<batchCount;++i){\n\t\tif(!batchSupport[i].draw) continue;\n\n\t\tconst BatchImpl* batch = begin<BatchImpl>(batches_) + i;\n\n\t\t\n\t\tif(!(pipelines_[batch->pipelineId].pipeline == currentBoundPipeline)){\n\t\t\trenderer->bind(pipelines_[batch->pipelineId].pipeline);\n\t\t\tif(!constantsBound[batch->pipelineId]){\n\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].matrixConstant,matrix);\n\t\t\t\tconstantsBound[batch->pipelineId] = true; \n\t\t\t}\n\t\t\tif(batch->font){\n\t\t\t\tint fontTextureUnit = 2;\n\t\t\t\trenderer->bind(batch->font->pages_[0],fontTextureUnit);\n\t\t\t\trenderer->bind(fontSampler_,fontTextureUnit);\n\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].texturesConstant,&fontTextureUnit);\n\t\t\t} else {\n\t\t\t\tif(batch->textureId != 0){\n\t\t\t\t\tint unit = 1;\n\t\t\t\t\trenderer->bind(textures_[batch->textureId],unit);\n\t\t\t\t\trenderer->bind(pointSampler_,unit);\n\t\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].texturesConstant,&unit);\n\t\t\t\t\ttextureUnitsBound[batch->pipelineId] = false;\n\t\t\t\t} else if(!textureUnitsBound[batch->pipelineId]) {\n\t\t\t\t\tint unit = 0 ;\n\t\t\t\t\trenderer->bind(pipelines_[batch->pipelineId].texturesConstant,&unit);\n\t\t\t\t\ttextureUnitsBound[batch->pipelineId] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\t\t\n\t\tif(currentBoundMesh != batch->meshId){\n\t\t\trenderer->bind(meshes_[batch->meshId].mesh,rendering::topology::Triangle,sizeof(uint16));\n\t\t\tcurrentBoundMesh = batch->meshId;\n\t\t}\n\n\t\tif(batchSupport[i].indexed)\n\t\t\trenderer->drawIndexed(batchSupport[i].offset,batchSupport[i].count,batchSupport[i].baseVertex);\n\t\telse\n\t\t\trenderer->draw(batchSupport[i].offset,batchSupport[i].count);\n\t}\n\n\tglEnable(GL_DEPTH_TEST);\n\trenderer->bind(blending::disabled());\n}\nvoid Service::servicePreStep(){\n\tnew(&fontBatches_) core::BufferAllocator(sizeof(BatchFontMapping)*32,services::frameAllocator(),core::BufferAllocator::GrowOnOverflow);\n\tnew(&batches_) core::BufferAllocator(sizeof(BatchImpl)*64,services::frameAllocator(),core::BufferAllocator::GrowOnOverflow);\n\n\t\n\tfor(uint32 dest = 0;dest<kMaxTextures;++dest){\n\t\ttextures_[dest] = Texture2D::null();\n\t}\n}\nvoid Service::servicePostStep(){\n}\nService::Service() :\nbatches_(128,services::frameAllocator()),\nfontBatches_(128,services::frameAllocator())\n{\n\tfor(uint32 i = 0;i<kMaxDefaultPipelines;++i) defaultPipelines_[i] = -1;\n\n\tfor(uint32 i = 0; i<kMaxGeometries;++i){\n\t\tmeshes_[i].vertexSize = vertexSize(i);\n\t\tmeshes_[i].vbo = meshes_[i].ibo = Buffer::nullBuffer();\n\t}\n}\nService::~Service(){\n\tusing namespace core::bufferArray;\n\tauto renderer = services::rendering();\n\n\tfor(uint32 i = 0; i<kMaxGeometries;++i){\n\t\tif(!meshes_[i].vbo.isNull()){\n\t\t\trenderer->release(meshes_[i].mesh);\n\t\t\trenderer->release(meshes_[i].vbo);\n\t\t\tif(meshes_[i].ibo.isNull()) renderer->release(meshes_[i].ibo);\n\t\t}\n\t}\n}\n\n} }"},"middle":{"kind":"string","value":"registerBatch(batch,\n\t\tfont->renderingType() == text::fontType::Outlined? OutlinedTextPipeline : TextPipeline,\n\t\tfont->renderingType() == text::fontType::Outlined? OutlinedTextGeometry : TextGeometry)"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"struct Batch {\n\n\tenum { kMaxLayer = 0xFF };\n\n\tenum { kMaxDepth = 0xFF };\n\n\n\n\ttypedef batching::Geometry Geometry;\n\n\n\n\tsize_t verticesSize,indicesSize;\n\n\ttopology::Primitive primitive;\n\n\tconst char* name;\n\n\tuint32 layer,depth;//Batches are sorted by depth and layers.\n\n\n\n\tBatch();\n\n};\n\n\n","file_path":"src/rendering/ui.h","rank":0,"score":352725.6525907602},{"content":"struct ScreenSpaceVertex;\n","file_path":"src/rendering/softwareOcclusion/softwareOcclusion.h","rank":3,"score":220950.05525405455},{"content":"struct Key\n\n{\n\n\tKey()\n\n\t\t:\tinter\t(IT_LINE)\n\n\t{}\n\n\n\n\t//! Current time\n\n\tdouble time;\n\n\n\n\t//! Current value\n\n\tfloat value;\n\n\n\n\t//! How to interpolate this key with previous key?\n\n\tInterpolationType inter;\n\n\n\n\t//! Interpolation parameters\n\n\tfloat params[5];\n\n\n\n\n\n\t// for std::find()\n\n\toperator double () {\n\n\t\treturn time;\n\n\t}\n\n};\n\n\n\n// ---------------------------------------------------------------------------\n\n/** \\brief Data structure for a LWO animation envelope\n\n */\n","file_path":"src/dependencies/assimp/code/LWOAnimation.h","rank":4,"score":215414.97951352285},{"content":"struct Key: Event {\n\n\tuint32 key;\n\n};\n","file_path":"src/input/events.h","rank":5,"score":208486.09568461473},{"content":"#include <cppunit/plugin/PlugInParameters.h>\n\nstruct CppUnitTestPlugIn;\n\n\n\nCPPUNIT_NS_BEGIN\n\n\n\n\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/plugin/PlugInManager.h","rank":6,"score":204835.6165781913},{"content":"struct CppUnitTestPlugIn\n\n{\n\n /*! \\brief Called just after loading the dynamic library. \n\n *\n\n * Override this method to add additional suite to the registry, though this\n\n * is preferably done using the macros (CPPUNIT_TEST_SUITE_REGISTRATION...).\n\n * If you are creating a custom listener to extends the plug-in runner,\n\n * you can use this to configure the listener using the \\a parameters.\n\n *\n\n * You could also use the parameters to specify some global parameter, such\n\n * as test datas location, database name...\n\n *\n\n * N.B.: Parameters interface is not define yet, and the plug-in runner does\n\n * not yet support plug-in parameter.\n\n */\n\n virtual void initialize( CPPUNIT_NS::TestFactoryRegistry *registry,\n\n const CPPUNIT_NS::PlugInParameters ¶meters ) =0;\n\n\n\n /*! \\brief Gives a chance to the plug-in to register TestListener.\n\n * \n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/plugin/TestPlugIn.h","rank":7,"score":204829.0124875928},{"content":"class CppUnitMap : public std::map<Key\n\n ,T\n\n ,std::less<Key>\n\n ,CPPUNIT_STD_ALLOCATOR>\n\n{\n\npublic:\n\n};\n\n\n\n#else // CPPUNIT_STD_NEED_ALLOCATOR\n\n\n\n#define CppUnitMap std::map\n\n\n\n#endif\n\n\n\n#endif // CPPUNIT_PORTABILITY_CPPUNITMAP_H\n\n\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/portability/CppUnitMap.h","rank":8,"score":192167.58117668846},{"content":"class AutoRegisterRegistry\n\n{\n\npublic:\n\n AutoRegisterRegistry( const std::string &which,\n\n const std::string &to )\n\n {\n\n TestFactoryRegistry::getRegistry( to ).addRegistry( which );\n\n }\n\n\n\n AutoRegisterRegistry( const std::string &which )\n\n {\n\n TestFactoryRegistry::getRegistry().addRegistry( which );\n\n }\n\n};\n\n\n\n\n\nCPPUNIT_NS_END\n\n\n\n#endif // CPPUNIT_EXTENSIONS_AUTOREGISTERSUITE_H\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h","rank":9,"score":187995.93104576762},{"content":"class AutoRegisterSuite\n\n{\n\npublic:\n\n /** Auto-register the suite factory in the global registry.\n\n */\n\n AutoRegisterSuite()\n\n : m_registry( &TestFactoryRegistry::getRegistry() )\n\n {\n\n m_registry->registerFactory( &m_factory );\n\n }\n\n\n\n /** Auto-register the suite factory in the specified registry.\n\n * \\param name Name of the registry.\n\n */\n\n AutoRegisterSuite( const std::string &name )\n\n : m_registry( &TestFactoryRegistry::getRegistry( name ) )\n\n {\n\n m_registry->registerFactory( &m_factory );\n\n }\n\n\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h","rank":10,"score":187995.93104576762},{"content":"inline uint32 Font::renderingType() const { return renderType_; }\n","file_path":"src/data/font/font.h","rank":11,"score":187916.76094510045},{"content":"class TextureView: public Renderable {\n\npublic:\n\n\tTextureView(rendering::Texture2D texture = rendering::Texture2D::null(),rendering::Pipeline pipeline = rendering::Pipeline::nullPipeline());\n\n\n\n\tvoid draw(Widget* widget,events::Draw& ev);\n\n\n\n\trendering::Pipeline pipeline_;\n\n\trendering::Texture2D texture_;\n\n\tuint32 color_;\n\n};\n","file_path":"src/ui/components.h","rank":12,"score":181336.27772355507},{"content":"\t\tuint8* dest;\n","file_path":"src/rendering/2d.h","rank":13,"score":179159.75141670628},{"content":"\tuint32 layerId;\n","file_path":"src/ui/events.h","rank":14,"score":177855.70013786922},{"content":"\tstruct Pipeline {\n\n\t\tstruct Constant {\n\n\t\t\tint32 location;\n\n\t\t\tuint8 shaderType,coreTypeId;\n\n\t\t\tuint16 count;\n\n\t\t\tconst char* name;\n\n\n\n\t\t\tConstant(const char* name);\n\n\t\t};\n\n\n\n\t\t//GLSL specific extra information for program linking (GLSL 3.3 layout)\n\n\t\tstruct GLSLLayout {\n\n\t\t\tconst char** vertexAttributes;\n\n\t\t\tuint32 vertexAttributeCount;\n\n\t\t\tconst char** pixelAttributes;\n\n\t\t\tuint32 pixelAttributeCount;\n\n\n\n\t\t\tGLSLLayout();\n\n\t\t};\n\n\t\n\n\t\tuint32 id;\n\n\n\n\t\tstatic inline Pipeline nullPipeline() { Pipeline result = { 0 }; return result; }\n","file_path":"src/rendering/opengl/types.h","rank":15,"score":174021.88248831098},{"content":"\t\tuint32 id;\n","file_path":"src/rendering/opengl/types.h","rank":16,"score":173998.76498501786},{"content":"\t\t\tconst char* name;\n","file_path":"src/rendering/opengl/types.h","rank":17,"score":173972.3732611782},{"content":"struct TaskKey;\n\n\n","file_path":"src/application/tasking.h","rank":18,"score":173464.28925531515},{"content":"struct TaskKey {\n\n\tTaskID id;\n\n\tTask* task;\n\n\tTaskKey* next;\n\n};\n","file_path":"src/application/tasking.cpp","rank":19,"score":170715.89288282403},{"content":" char pipeName[GLX_HYPERPIPE_PIPE_NAME_LENGTH_SGIX];\n","file_path":"src/rendering/opengl/gl/glxext.h","rank":20,"score":170519.52410983024},{"content":"struct SkeletalAnimation {\n\n\tenum { kMaxAnimations = 3 };\n\n\n\n\tEntityId entity;\n\n\tuint32 nodeCount;\n\n\tdata::Transformation3D* transformations;\n\n\tdata::Mesh* mesh;\n\n\tstruct Anim {\n\n\t\tfloat time;\n\n\t\tdata::animation::Animation* animation;\n\n\t};\n\n\tAnim anim[kMaxAnimations];\n\n\n\n\tSkeletalAnimation(EntityId id,data::Mesh* m) {\n\n\t\tentity = id;\n\n\t\tmesh = m;\n\n\t\tnodeCount= m->skeletonNodeCount();\n\n\t\ttransformations = (data::Transformation3D*)allocator()->allocate(sizeof(data::Transformation3D)*mesh->skeletonNodeCount(),alignof(vec4f));\n\n\t\tfor(uint32 i = 0;i<kMaxAnimations;++i){\n\n\t\t\tanim[i].time = 0.f;\n","file_path":"src/scene/rendering.cpp","rank":21,"score":170442.737282211},{"content":"struct EntityGrid {\n\n\tEntityGridCell grid[10];\n\n\n\n\tCullId createFrustumCullSphere(const vec4f& sphere,EntityId entity);\n\n\tCullId updateFrustumCullSphere(CullId id,const vec4f& sphere);\n\n\tvoid removeFrustumCullSphere(CullId id);\n\n\tvec4f getFrustumCullSphere(CullId id);\n\n\n\n\tEntityGrid();\n\n};\n\nCullId EntityGrid::createFrustumCullSphere(const vec4f& sphere,EntityId entity){\n\n\tvec4f s = sphere;\n\n\ts.w = -s.w; //NB: frustum culler expects sphere in format center, - radius\n\n\treturn grid[0].createSphere(s,entity);\n\n}\n\nCullId EntityGrid::updateFrustumCullSphere(CullId id,const vec4f& sphere){\n\n\t//grid[0].update(id&kEntityBlockIdMask,sphere);\n\n\treturn id;\n\n}\n\nvoid EntityGrid::removeFrustumCullSphere(CullId id){\n","file_path":"src/scene/rendering.cpp","rank":22,"score":170442.737282211},{"content":"struct VisibleEntity {\n\n\tFrustumMask mask;\n\n\tEntity* entity;\n\n\tuint32 offset,size;\n\n};\n","file_path":"src/scene/rendering.cpp","rank":23,"score":170442.737282211},{"content":"//function loading\n\nstruct Loader {\n\n\tint major,minor;\n\n\tvoid (*onError)(const char*);\n\n\tcore::bufferStringStream::Formatter formatter;\n\n\t\n\n\tvoid* load(const char* name){\n\n#ifdef ARPHEG_PLATFORM_WIN32\n\n\t\tvoid* proc = (void*)wglGetProcAddress(name);\n\n#endif\n\n\t\tif(!proc){\n\n\t\t\tformatter.allocator.reset();\n\n\t\t\tcore::bufferStringStream::printf(formatter,\"Failed to load OpenGL core function '%s' - the application may not behave correctly!\\n Please update your graphics card's drivers.\",name);\n\n\t\t\tservices::logging()->warning(core::bufferStringStream::asCString(formatter));\n\n\t\t}\n\n\t\tif(!proc && onError) onError(name);\n\n\t\treturn proc;\n\n\t}\n\n};\n\n\n\n#define F(f,T) f = (T) loader.load(#f);\n","file_path":"src/rendering/opengl/api.cpp","rank":24,"score":170442.737282211},{"content":"struct aiMeshKey \n\n{\n\n\t/** The time of this key */\n\n\tdouble mTime;\n\n\n\n\t/** Index into the aiMesh::mAnimMeshes array of the \n\n\t * mesh coresponding to the #aiMeshAnim hosting this\n\n\t * key frame. The referenced anim mesh is evaluated\n\n\t * according to the rules defined in the docs for #aiAnimMesh.*/\n\n\tunsigned int mValue;\n\n\n\n#ifdef __cplusplus\n\n\n\n\taiMeshKey() {\n\n\t}\n\n\n\n\t/** Construction from a given time and key value */\n\n\taiMeshKey(double time, const unsigned int value)\n\n\t\t:\tmTime\t(time)\n\n\t\t,\tmValue\t(value)\n\n\t{}\n\n\n\n\ttypedef unsigned int elem_type;\n\n\n\n\t// Comparison operators. For use with std::find();\n\n\tbool operator == (const aiMeshKey& o) const {\n\n\t\treturn o.mValue == this->mValue;\n\n\t}\n\n\tbool operator != (const aiMeshKey& o) const {\n\n\t\treturn o.mValue != this->mValue;\n\n\t}\n\n\n\n\t// Relational operators. For use with std::sort();\n","file_path":"src/dependencies/assimp/include/assimp/anim.h","rank":25,"score":169245.2592724326},{"content":"\tconst char* id; \n","file_path":"src/dependencies/assimp/include/assimp/cexport.h","rank":26,"score":169222.5977103394},{"content":"struct aiScene\n\n{\n\n\n\n\t/** Any combination of the AI_SCENE_FLAGS_XXX flags. By default \n\n\t* this value is 0, no flags are set. Most applications will\n\n\t* want to reject all scenes with the AI_SCENE_FLAGS_INCOMPLETE \n\n\t* bit set.\n\n\t*/\n\n\tunsigned int mFlags;\n\n\n\n\n\n\t/** The root node of the hierarchy. \n\n\t* \n\n\t* There will always be at least the root node if the import\n\n\t* was successful (and no special flags have been set). \n\n\t* Presence of further nodes depends on the format and content \n\n\t* of the imported file.\n\n\t*/\n\n\tC_STRUCT aiNode* mRootNode;\n\n\n\n\n\n\n\n\t/** The number of meshes in the scene. */\n\n\tunsigned int mNumMeshes;\n\n\n\n\t/** The array of meshes. \n\n\t*\n\n\t* Use the indices given in the aiNode structure to access \n\n\t* this array. The array is mNumMeshes in size. If the\n\n\t* AI_SCENE_FLAGS_INCOMPLETE flag is not set there will always \n\n\t* be at least ONE material.\n\n\t*/\n\n\tC_STRUCT aiMesh** mMeshes;\n\n\n\n\n\n\n\n\t/** The number of materials in the scene. */\n\n\tunsigned int mNumMaterials;\n\n\n\n\t/** The array of materials. \n\n\t* \n\n\t* Use the index given in each aiMesh structure to access this\n\n\t* array. The array is mNumMaterials in size. If the\n\n\t* AI_SCENE_FLAGS_INCOMPLETE flag is not set there will always \n\n\t* be at least ONE material.\n\n\t*/\n\n\tC_STRUCT aiMaterial** mMaterials;\n\n\n\n\n\n\n\n\t/** The number of animations in the scene. */\n\n\tunsigned int mNumAnimations; \n\n\n\n\t/** The array of animations. \n\n\t*\n\n\t* All animations imported from the given file are listed here.\n\n\t* The array is mNumAnimations in size.\n\n\t*/\n\n\tC_STRUCT aiAnimation** mAnimations;\n\n\n\n\n\n\n\n\t/** The number of textures embedded into the file */\n\n\tunsigned int mNumTextures;\n\n\n\n\t/** The array of embedded textures.\n\n\t* \n\n\t* Not many file formats embed their textures into the file.\n\n\t* An example is Quake's MDL format (which is also used by\n\n\t* some GameStudio versions)\n\n\t*/\n\n\tC_STRUCT aiTexture** mTextures;\n\n\n\n\n\n\t/** The number of light sources in the scene. Light sources\n\n\t* are fully optional, in most cases this attribute will be 0 \n\n */\n\n\tunsigned int mNumLights;\n\n\n\n\t/** The array of light sources.\n\n\t* \n\n\t* All light sources imported from the given file are\n\n\t* listed here. The array is mNumLights in size.\n\n\t*/\n\n\tC_STRUCT aiLight** mLights;\n\n\n\n\n\n\t/** The number of cameras in the scene. Cameras\n\n\t* are fully optional, in most cases this attribute will be 0 \n\n */\n\n\tunsigned int mNumCameras;\n\n\n\n\t/** The array of cameras.\n\n\t* \n\n\t* All cameras imported from the given file are listed here.\n\n\t* The array is mNumCameras in size. The first camera in the\n\n\t* array (if existing) is the default camera view into\n\n\t* the scene.\n\n\t*/\n\n\tC_STRUCT aiCamera** mCameras;\n\n\n\n#ifdef __cplusplus\n\n\n\n\t//! Default constructor - set everything to 0/NULL\n\n\taiScene();\n\n\n\n\t//! Destructor\n\n\t~aiScene();\n\n\n\n\t//! Check whether the scene contains meshes\n\n\t//! Unless no special scene flags are set this will always be true.\n\n\tinline bool HasMeshes() const \n\n\t\t{ return mMeshes != NULL && mNumMeshes > 0; }\n\n\n\n\t//! Check whether the scene contains materials\n\n\t//! Unless no special scene flags are set this will always be true.\n\n\tinline bool HasMaterials() const \n","file_path":"src/dependencies/assimp/include/assimp/scene.h","rank":27,"score":169201.41527628223},{"content":"struct BatchData;\n\n\n\n// ---------------------------------------------------------------------------\n\n/** FOR IMPORTER PLUGINS ONLY: A helper class to the pleasure of importers \n\n * that need to load many external meshes recursively.\n\n *\n\n * The class uses several threads to load these meshes (or at least it\n\n * could, this has not yet been implemented at the moment).\n\n *\n\n * @note The class may not be used by more than one thread*/\n","file_path":"src/dependencies/assimp/code/Importer.h","rank":28,"score":168089.83153344432},{"content":"//An intermediate pointer mapper, slow, not to be used in final builds.\n\nstruct IDPointerMapper {\n\n\tstruct Obj {\n\n\t\tcore::Bytes key;\n\n\t\tvoid* value;\n\n\t};\n\n\tcore::BufferAllocator objects;\n\n\tcore::Allocator* stringStorage;\n\n\t\n\n\tIDPointerMapper(core::Allocator* allocator);\n\n\t\n\n\tvoid insert(core::Bytes key,void* value);\n\n\tvoid* get(core::Bytes key);\n\n};\n\nIDPointerMapper::IDPointerMapper(core::Allocator* allocator) :\n\n\tobjects(sizeof(IDPointerMapper) * 128,allocator,core::BufferAllocator::GrowOnOverflow)\n\n{ stringStorage = allocator; }\n\nvoid IDPointerMapper::insert(core::Bytes key,void* value){\n\n\t//copy string\n\n\tauto dest = (uint8*)stringStorage->allocate(key.length()+1);\n\n\tmemcpy(dest,key.begin,key.length());\n","file_path":"src/data/data.cpp","rank":29,"score":168086.1108146393},{"content":"struct Vertex\n\n{\n\n\tint32_t X : 11;\n\n\tint32_t Y : 11;\n\n\tint32_t Z : 10;\n\n};\n\n\n\n\t// UNREAL vertex compression\n\ninline void CompressVertex(const aiVector3D& v, uint32_t& out)\n\n{\n\n\tunion {\n\n\t\tVertex n;\n\n\t\tint32_t t;\n\n\t};\n\n\tn.X = (int32_t)v.x;\n\n\tn.Y = (int32_t)v.y;\n\n\tn.Z = (int32_t)v.z;\n\n\tout = t;\n\n}\n\n\n","file_path":"src/dependencies/assimp/code/UnrealLoader.h","rank":30,"score":168056.41334457824},{"content":"struct Vertex\n\n{\n\n\tVertex() : iParentNode(UINT_MAX)\n\n\t {}\n\n\n\n\t//! Vertex position, normal and texture coordinate\n\n\taiVector3D pos,nor,uv;\n\n\n\n\t//! Vertex parent node\n\n\tunsigned int iParentNode;\n\n\n\n\t//! Links to bones: pair.first is the bone index,\n\n\t//! pair.second is the vertex weight.\n\n\t//! WARN: The remaining weight (to reach 1.0f) is assigned\n\n\t//! to the parent node/bone\n\n\tstd::vector<std::pair<unsigned int, float> > aiBoneLinks;\n\n};\n\n\n\n// ---------------------------------------------------------------------------\n\n/** Data structure for a face in a SMD file\n\n*/\n","file_path":"src/dependencies/assimp/code/SMDLoader.h","rank":31,"score":168056.41334457824},{"content":"struct Texture\n\n{\n\n\t//! Default constructor\n\n\tTexture()\n\n\t\t: mOffsetU\t(0.0f)\n\n\t\t, mOffsetV\t(0.0f)\n\n\t\t, mScaleU\t(1.0f)\n\n\t\t, mScaleV\t(1.0f)\n\n\t\t, mRotation\t(0.0f)\n\n\t\t, mMapMode\t(aiTextureMapMode_Wrap)\n\n\t\t, iUVSrc\t(0)\n\n\t{\n\n\t\tmTextureBlend = get_qnan();\n\n\t}\n\n\n\n\t//! Specifies the blend factor for the texture\n\n\tfloat mTextureBlend;\n\n\n\n\t//! Specifies the filename of the texture\n\n\tstd::string mMapName;\n","file_path":"src/dependencies/assimp/code/3DSHelper.h","rank":32,"score":168050.10256881008},{"content":"struct TouchedNodeMask {\n\n\tenum { kSizeofSizetInBits = sizeof(size_t)*8 };\n\n\tsize_t bits[Animator::kMaxNodes/kSizeofSizetInBits];\n\n\n\n\tTouchedNodeMask(){\n\n\t\tfor(size_t i = 0;i<Animator::kMaxNodes/kSizeofSizetInBits;++i) bits[i] = 0;\n\n\t}\n\n\tinline void mark(size_t i){\n\n\t\tsize_t element= i/kSizeofSizetInBits;\n\n\t\tsize_t bit = i%kSizeofSizetInBits;\n\n\t\tbits[element] |= 1<<bit;\n\n\t}\n\n\tinline bool isNotTouched(size_t i){\n\n\t\tsize_t element= i/kSizeofSizetInBits;\n\n\t\tsize_t bit = i%kSizeofSizetInBits;\n\n\t\treturn (bits[element] & (1<<bit)) == 0;\n\n\t}\n\n};\n\n\n\n//Obtain and store the wrapped local time\n","file_path":"src/rendering/animation.cpp","rank":33,"score":167817.15997603053},{"content":"struct VisibleAnimatedEntity {\n\n\tFrustumMask mask;\n\n\tAnimatedEntity* entity;\n\n\tuint32 offset,size;\n\n};\n","file_path":"src/scene/rendering.cpp","rank":34,"score":167817.15997603053},{"content":"struct VisibleCustomEntity {\n\n\tFrustumMask mask;\n\n\tCustomEntity* entity;\n\n};\n","file_path":"src/scene/rendering.cpp","rank":35,"score":167817.15997603053},{"content":"struct VisibleLightEntity {\n\n\tFrustumMask mask;\n\n\tLightEntity* entity;\n\n};\n\n\n\nService::Service(core::Allocator* alloc) :\n\n\tskeletonAnimations_(sizeof(SkeletalAnimation)*1024,allocator(),core::BufferAllocator::GrowOnOverflow),\n\n\tentityConstantStorage(1024*8,allocator(),core::BufferAllocator::GrowOnOverflow)\n\n{\n\n\t//Entity pools.\n\n\tentities_ = ALLOCATOR_NEW(alloc,EntityPool<Entity>) (1024*32,allocator());\n\n\tanimatedEntities_ = ALLOCATOR_NEW(alloc,EntityPool<AnimatedEntity>) (1024*2,allocator());\n\n\tcustomEntities_ = ALLOCATOR_NEW(alloc,EntityPool<CustomEntity>) (1024*2,allocator());\n\n\tlights_ = ALLOCATOR_NEW(alloc,EntityPool<LightEntity>) (1024*2,allocator());\n\n\n\n\tvisibleEntities_ = (core::BufferAllocator*)alloc->allocate(sizeof(core::BufferAllocator)*services::tasking()->threadCount(),alignof(core::BufferAllocator));\n\n\tvisibleAnimatedEntities_ = (core::BufferAllocator*)alloc->allocate(sizeof(core::BufferAllocator)*services::tasking()->threadCount(),alignof(core::BufferAllocator));\n\n\tvisibleLights_ = (core::BufferAllocator*)alloc->allocate(sizeof(core::BufferAllocator)*services::tasking()->threadCount(),alignof(core::BufferAllocator));\n\n\t\n\n\tvisibleEntitiesInited = false;\n","file_path":"src/scene/rendering.cpp","rank":36,"score":167817.15997603053},{"content":"#ifndef CPPUNIT_EXTENSIONS_AUTOREGISTERSUITE_H\n\n#define CPPUNIT_EXTENSIONS_AUTOREGISTERSUITE_H\n\n\n\n#include <cppunit/extensions/TestSuiteFactory.h>\n\n#include <cppunit/extensions/TestFactoryRegistry.h>\n\n#include <string>\n\n\n\nCPPUNIT_NS_BEGIN\n\n\n\n\n\n/*! \\brief (Implementation) Automatically register the test suite of the specified type.\n\n *\n\n * You should not use this class directly. Instead, use the following macros:\n\n * - CPPUNIT_TEST_SUITE_REGISTRATION()\n\n * - CPPUNIT_TEST_SUITE_NAMED_REGISTRATION()\n\n *\n\n * This object will register the test returned by TestCaseType::suite()\n\n * when constructed to the test registry.\n\n *\n\n * This object is intented to be used as a static variable.\n\n *\n\n *\n\n * \\param TestCaseType Type of the test case which suite is registered.\n\n * \\see CPPUNIT_TEST_SUITE_REGISTRATION, CPPUNIT_TEST_SUITE_NAMED_REGISTRATION\n\n * \\see CppUnit::TestFactoryRegistry.\n\n */\n\ntemplate<class TestCaseType>\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h","rank":37,"score":167184.32764964696},{"content":" ~AutoRegisterSuite()\n\n {\n\n if ( TestFactoryRegistry::isValid() )\n\n m_registry->unregisterFactory( &m_factory );\n\n }\n\n\n\nprivate:\n\n TestFactoryRegistry *m_registry;\n\n TestSuiteFactory<TestCaseType> m_factory;\n\n};\n\n\n\n\n\n/*! \\brief (Implementation) Automatically adds a registry into another registry.\n\n *\n\n * Don't use this class. Use the macros CPPUNIT_REGISTRY_ADD() and\n\n * CPPUNIT_REGISTRY_ADD_TO_DEFAULT() instead.\n\n */\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h","rank":38,"score":167173.21386308954},{"content":"\tunsigned int mVertexId;\n","file_path":"src/dependencies/assimp/include/assimp/mesh.h","rank":39,"score":167121.1441121757},{"content":"enum VertexFormat\n\n{\n\n\tVertex_Standard,\n\n\tVertex_Extended\n\n};\n\n\n","file_path":"src/dependencies/assimp/code/M3Importer.h","rank":40,"score":165882.4358405176},{"content":"struct KeyPred {\n\n\tinline bool operator () (const T& a,const T& b){\n\n\t\treturn a.time < b.time;\n\n\t}\n\n};\n\nvoid Scene::importSkeletalAnimationTracks() {\n\n\tfor(uint32 i = 0;i<scene->mNumAnimations;++i){\n\n\t\tauto animation = scene->mAnimations[i];\n\n\t\tanimation::Animation destAnimation;\n\n\t\tdestAnimation.length = scene->mAnimations[i]->mDuration;\n\n\t\tdestAnimation.frequency = scene->mAnimations[i]->mTicksPerSecond == 0.f? 25.f : scene->mAnimations[i]->mTicksPerSecond;\n\n\t\tdestAnimation.trackCount = 0;\n\n\t\tdestAnimation.tracks = nullptr;\n\n\n\n\t\t//Find the track count\n\n\t\tfor(uint32 i = 0;i<animation->mNumChannels;++i){\n\n\t\t\tif(!findSkeletonNode(animation->mChannels[i]->mNodeName)){\n\n\t\t\t\tlogging->warning(\"An animation contains a track which doesn't influence any bone\");\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n","file_path":"src/data/intermediate/mesh/reader.cpp","rank":41,"score":165562.7982199745},{"content":"struct VertexDesc\n\n{\n\n\tVertexDesc()\n\n\t\t: mFirstWeight\t(0)\n\n\t\t, mNumWeights\t(0)\n\n\t{}\n\n\n\n\t//! UV cordinate of the vertex\n\n\taiVector2D mUV;\n\n\n\n\t//! Index of the first weight of the vertex in\n\n\t//! the vertex weight list\n\n\tunsigned int mFirstWeight;\n\n\n\n\t//! Number of weights assigned to this vertex\n\n\tunsigned int mNumWeights;\n\n};\n\n\n\ntypedef std::vector< VertexDesc > VertexList;\n\n\n\n// ---------------------------------------------------------------------------\n\n/** Represents a vertex weight descriptor in a MD5 file\n\n*/\n","file_path":"src/dependencies/assimp/code/MD5Parser.h","rank":42,"score":165535.29579188526},{"content":"struct BoneVertex\n\n{\n\n\t//! Bone and corresponding vertex weight.\n\n\t//! -1 for unrequired bones ....\n\n\tstd::vector<std::pair<int,float> > mBoneWeights;\n\n\n\n\t//! Position of the bone vertex.\n\n\t//! MUST be identical to the vertex position\n\n\t//aiVector3D mPosition;\n\n};\n\n\n\n// ---------------------------------------------------------------------------\n\n/** Helper structure to represent an ASE file animation */\n","file_path":"src/dependencies/assimp/code/ASEParser.h","rank":43,"score":165535.29579188526},{"content":"struct aiTexture;\n","file_path":"src/dependencies/assimp/code/LWOLoader.h","rank":44,"score":165529.116547456},{"content":"struct aiNode;\n\n\n\nnamespace Assimp\t{\n\n\n\n#define AI_TT_UV_IDX_LOCK_TBD\t0xffffffff\n\n#define AI_TT_UV_IDX_LOCK_NONE\t0xeeeeeeee\n\n\n\n\n\n#define AI_TT_ROTATION_EPSILON\t((float)AI_DEG_TO_RAD(0.5))\n\n\n\n// ---------------------------------------------------------------------------\n\n/** Small helper structure representing a shortcut into the material list\n\n * to be able to update some values quickly.\n\n*/\n","file_path":"src/dependencies/assimp/code/TextureTransform.h","rank":45,"score":165529.116547456},{"content":"struct LightAABBXAxis {\n\n\tuint8 firstTile,lastTile;\n\n\tuint16 index;\n\n};\n\n\n\n\n\nstatic inline bool rowIntersect(int32 ty,const TileGrid::LightAABB& lightRect){\n\n\tif(ty > lightRect.min[1]){\n\n\t\tif(lightRect.max[1] <= ty) return false;\n\n\t}\n\n\telse {\n\n\t\tif((ty + kTileSize) <= lightRect.min[1]) return false;\n\n\t}\n\n\treturn true;\n\n}\n\n\n\n// This is a naive tile assignment implementation.\n\nvoid TileGrid::performLightAssignment(const Tiler& tiler) {\n\n\tindexOffset = 0;\n\n\tuint32 idx = 0;\n","file_path":"src/rendering/lighting/tiled.cpp","rank":46,"score":165301.02902356844},{"content":"//A rasterizable triangle.\n\nstruct XY {\n\n\t//struct {\n\n\t\tint32 x, y;\n\n\t//};\n\n\t//uint32 xy;\n\n};\n","file_path":"src/rendering/softwareOcclusion/softwareOcclusion.cpp","rank":47,"score":165301.02902356844},{"content":"struct BinnedTriangle;\n\n\n","file_path":"src/rendering/softwareOcclusion/softwareOcclusion.h","rank":48,"score":165301.02902356844},{"content":"","file_path":"src/dependencies/assimp/include/assimp/matrix3x3.h","rank":49,"score":165258.4689067915},{"content":"","file_path":"src/dependencies/assimp/include/assimp/matrix4x4.h","rank":50,"score":165258.4689067915},{"content":"struct aiQuaternion {\n\n\tfloat w, x, y, z;\t\n\n};\n\n\n\n#endif\n\n\n\n\n\n#endif // AI_QUATERNION_H_INC\n","file_path":"src/dependencies/assimp/include/assimp/quaternion.h","rank":51,"score":165258.4689067915},{"content":"struct auto_any : auto_any_base\n\n{\n\n auto_any(T const& t) : item(t) {}\n\n mutable T item;\n\n};\n\n\n\ntemplate<typename T>\n\nT& auto_any_cast(auto_any_base const& any)\n\n{\n\n return static_cast<auto_any<T> const&>(any).item;\n\n}\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n\n// FOREACH helper function\n\n\n\ntemplate<typename T>\n\nauto_any<typename T::const_iterator> begin(T const& t)\n\n{\n\n return t.begin();\n\n}\n","file_path":"src/dependencies/assimp/code/BoostWorkaround/boost/foreach.hpp","rank":52,"score":165002.77310433466},{"content":"struct aiFloatKey \n\n{\n\n\tdouble mTime; ///< The time of this key\n\n\tfloat mValue;\t///< The value of this key\n\n\n\n#ifdef __cplusplus\n\n\n\n\t// time is not compared\n\n\tbool operator == (const aiFloatKey& o) const\n\n\t\t{return o.mValue == this->mValue;}\n\n\n\n\tbool operator != (const aiFloatKey& o) const\n\n\t\t{return o.mValue != this->mValue;}\n\n\n\n\t// Only time is compared. This operator is defined\n\n\t// for use with std::sort\n\n\tbool operator < (const aiFloatKey& o) const\n\n\t\t{return mTime < o.mTime;}\n\n\n\n\tbool operator > (const aiFloatKey& o) const\n\n\t\t{return mTime < o.mTime;}\n\n\n\n#endif\n\n};\n\n\n\n// ---------------------------------------------------------------------------\n\n/** Helper structure to represent a 3ds file node */\n","file_path":"src/dependencies/assimp/code/3DSHelper.h","rank":53,"score":163144.06549500418},{"content":"struct aiMesh;\n\nnamespace Assimp\t{\n\n\n\n// --------------------------------------------------------------------------------------------\n\n/** @brief The VertexTriangleAdjacency class computes a vertex-triangle\n\n * adjacency map from a given index buffer.\n\n *\n\n * @note Although it is called #VertexTriangleAdjacency, the current version does also\n\n * support arbitrary polygons. */\n","file_path":"src/dependencies/assimp/code/VertexTriangleAdjacency.h","rank":54,"score":163117.124578673},{"content":"struct TTUpdateInfo\n\n{\n\n\tTTUpdateInfo() :\n\n\t\t\tdirectShortcut\t(NULL)\n\n\t\t,\tmat\t\t\t\t(NULL)\n\n\t\t,\tsemantic\t\t(0)\n\n\t\t,\tindex\t\t\t(0)\n\n\t{}\n\n\n\n\t//! Direct shortcut, if available\n\n\tunsigned int* directShortcut;\n\n\n\n\t//! Material \n\n\taiMaterial *mat;\n\n\n\n\t//! Texture type and index\n\n\tunsigned int semantic, index;\n\n};\n\n\n\n\n\n// ---------------------------------------------------------------------------\n\n/** Helper class representing texture coordinate transformations\n\n*/\n","file_path":"src/dependencies/assimp/code/TextureTransform.h","rank":55,"score":163111.0714946828},{"content":"struct aiTexture;\n","file_path":"src/dependencies/assimp/code/ValidateDataStructure.h","rank":56,"score":163111.0714946828},{"content":"","file_path":"src/dependencies/assimp/contrib/clipper/clipper.hpp","rank":57,"score":163107.34360151124},{"content":"struct BinnedTriangle {\n\n\tXY v[3];\n\n\tfloat z[3];\n\n};\n\n\n\nenum {\n\n\tkMaxTrianglesPerTile = 1024*2,\n\n\t\n\n\tkModeDepthFlat = 0, //Depth buffer pixels are stored in rows \n\n\tkModeDepthPackedTiles,//Depth buffer pixels are stored in rows for each tile\n\n\tkModeDepthPackedQuads,//Depth buffer pixels are stored in 2x2 quads ((0,0),(1,0),(0,1),(1,1))\n\n};\n\n\n\nDepthBuffer::DepthBuffer(vec2i size){\n\n\tmode_ = kModeDepthPackedQuads;\n\n\tauto allocator= core::memory::globalAllocator();\n\n\tsize_ = size;\n\n\ttileCount_ = vec2i(4,4);\n\n\n\n\tif(size.y%tileCount_.y){\n","file_path":"src/rendering/softwareOcclusion/softwareOcclusion.cpp","rank":58,"score":162887.64078968109},{"content":"struct ScreenSpaceQuad;\n","file_path":"src/rendering/softwareOcclusion/softwareOcclusion.h","rank":59,"score":162887.64078968109},{"content":"struct aiVector2D {\n\n\tfloat x,y;\n\n};\n\n\n\n#endif // __cplusplus\n\n\n\n#include \"./Compiler/poppack1.h\"\n\n\n\n#endif // AI_VECTOR2D_H_INC\n","file_path":"src/dependencies/assimp/include/assimp/vector2.h","rank":60,"score":162845.94961458148},{"content":"struct aiVector3D {\n\n\n\n\tfloat x,y,z;\n\n} PACK_STRUCT;\n\n\n\n#endif // __cplusplus\n\n\n\n#include \"./Compiler/poppack1.h\"\n\n\n\n#ifdef __cplusplus\n\n\n\n\n\n\n\n#endif // __cplusplus\n\n\n\n#endif // AI_VECTOR3D_H_INC\n","file_path":"src/dependencies/assimp/include/assimp/vector3.h","rank":61,"score":162845.94961458148},{"content":"struct aiScene;\n\n\n","file_path":"src/dependencies/assimp/include/assimp/Importer.hpp","rank":62,"score":162845.94961458148},{"content":"struct Asserter\n\n{\n\n /*! \\brief Throws a Exception with the specified message and location.\n\n */\n\n static void CPPUNIT_API fail( const Message &message, \n\n const SourceLine &sourceLine = SourceLine() );\n\n\n\n /*! \\brief Throws a Exception with the specified message and location.\n\n * \\deprecated Use fail( Message, SourceLine ) instead.\n\n */\n\n static void CPPUNIT_API fail( std::string message, \n\n const SourceLine &sourceLine = SourceLine() );\n\n\n\n /*! \\brief Throws a Exception with the specified message and location.\n\n * \\param shouldFail if \\c true then the exception is thrown. Otherwise\n\n * nothing happen.\n\n * \\param message Message explaining the assertion failiure.\n\n * \\param sourceLine Location of the assertion.\n\n */\n\n static void CPPUNIT_API failIf( bool shouldFail, \n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/Asserter.h","rank":63,"score":162845.94961458148},{"content":"struct aiColor4D {\n\n\tfloat r, g, b, a;\n\n} PACK_STRUCT;\n\n\n\n#endif // __cplusplus\n\n\n\n#include \"./Compiler/poppack1.h\"\n\n\n\n#endif // AI_COLOR4D_H_INC\n","file_path":"src/dependencies/assimp/include/assimp/color4.h","rank":64,"score":162845.94961458148},{"content":"struct aiMesh;\n","file_path":"src/dependencies/assimp/code/LimitBoneWeightsProcess.h","rank":65,"score":160819.39434500068},{"content":"struct ScreenSpaceQuad {\n\n\tvec4f v[4];\n\n};\n","file_path":"src/rendering/softwareOcclusion/softwareOcclusion.cpp","rank":66,"score":160570.82815262617},{"content":"// importerdesc.h\n\nstruct aiImporterDesc;\n\n\n\n/** @namespace Assimp Assimp's CPP-API and all internal APIs */\n\nnamespace Assimp\t{\n\n\n\n// ----------------------------------------------------------------------------------\n\n/** CPP-API: The Importer class forms an C++ interface to the functionality of the \n\n* Open Asset Import Library.\n\n*\n\n* Create an object of this class and call ReadFile() to import a file. \n\n* If the import succeeds, the function returns a pointer to the imported data. \n\n* The data remains property of the object, it is intended to be accessed \n\n* read-only. The imported data will be destroyed along with the Importer \n\n* object. If the import fails, ReadFile() returns a NULL pointer. In this\n\n* case you can retrieve a human-readable error description be calling \n\n* GetErrorString(). You can call ReadFile() multiple times with a single Importer\n\n* instance. Actually, constructing Importer objects involves quite many\n\n* allocations and may take some time, so it's better to reuse them as often as\n\n* possible.\n\n*\n\n* If you need the Importer to do custom file handling to access the files,\n\n* implement IOSystem and IOStream and supply an instance of your custom \n\n* IOSystem implementation by calling SetIOHandler() before calling ReadFile().\n\n* If you do not assign a custion IO handler, a default handler using the \n\n* standard C++ IO logic will be used.\n\n*\n\n* @note One Importer instance is not thread-safe. If you use multiple\n\n* threads for loading, each thread should maintain its own Importer instance.\n\n*/\n","file_path":"src/dependencies/assimp/include/assimp/Importer.hpp","rank":67,"score":160529.97114711054},{"content":"struct auto_any_base\n\n{\n\n operator bool() const { return false; }\n\n};\n\n\n\ntemplate<typename T>\n","file_path":"src/dependencies/assimp/code/BoostWorkaround/boost/foreach.hpp","rank":68,"score":158596.63404461573},{"content":"struct FontParser : core::text::Tokenizer {\n\n\tstruct Common {\n\n\t\tint lineHeight,base,width,height,pages,packed;\n\n\t\tint redChannel,greenChannel,blueChannel,alphaChannel;\n\n\t};\n\n\tstruct Char {\n\n\t\tint id;\n\n\t\tint x,y,width,height;\n\n\t\tint xoffset,yoffset;\n\n\t\tint xadvance;\n\n\t\tint page;\n\n\t\tint channel;\n\n\t};\n\n\n\n\tReader* reader;\n\n\tFont& font;\n\n\tCommon common;\n\n\tint prevCharId;\n\n\n\n\tvoid wildcard(){\n","file_path":"src/data/intermediate/font/reader.cpp","rank":69,"score":158445.8958615713},{"content":"struct LogStreamInfo;\n\n\n\n/** default name of logfile */\n\n#define ASSIMP_DEFAULT_LOG_NAME \"AssimpLog.txt\"\n\n\n\n// ------------------------------------------------------------------------------------\n\n/** @brief CPP-API: Primary logging facility of Assimp. \n\n *\n\n * The library stores its primary #Logger as a static member of this class.\n\n * #get() returns this primary logger. By default the underlying implementation is\n\n * just a #NullLogger which rejects all log messages. By calling #create(), logging\n\n * is turned on. To capture the log output multiple log streams (#LogStream) can be\n\n * attach to the logger. Some default streams for common streaming locations (such as\n\n * a file, std::cout, OutputDebugString()) are also provided.\n\n * \n\n * If you wish to customize the logging at an even deeper level supply your own\n\n * implementation of #Logger to #set().\n\n * @note The whole logging stuff causes a small extra overhead for all imports. */\n","file_path":"src/dependencies/assimp/include/assimp/DefaultLogger.hpp","rank":70,"score":158304.85232153072},{"content":"struct ExceptionSwallower<aiReturn>\t{\n\n\taiReturn operator ()() const {\n\n\t\ttry {\n\n\t\t\tthrow;\n\n\t\t}\n\n\t\tcatch (std::bad_alloc&) {\n\n\t\t\treturn aiReturn_OUTOFMEMORY;\n\n\t\t}\n\n\t\tcatch (...) {\n\n\t\t\treturn aiReturn_FAILURE;\n\n\t\t}\n\n\t}\n\n};\n\n\n\n// ---------------------------------------------------------------------------\n\ntemplate <>\n","file_path":"src/dependencies/assimp/code/Exceptional.h","rank":71,"score":157013.08573015608},{"content":"struct ExpectedExceptionTraits\n\n{\n\n static void expectedException()\n\n {\n\n#if CPPUNIT_USE_TYPEINFO_NAME\n\n throw Exception( Message(\n\n \"expected exception not thrown\",\n\n \"Expected exception type: \" + \n\n TypeInfoHelper::getClassName( typeid( ExceptionType ) ) ) );\n\n#else\n\n throw Exception( \"expected exception not thrown\" );\n\n#endif\n\n }\n\n};\n\n\n\n\n\n/*! \\brief (Implementation) Traits specialization used by TestCaller to \n\n * expect no exception.\n\n *\n\n * This class is an implementation detail. You should never use this class directly.\n\n */\n\ntemplate<>\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/TestCaller.h","rank":72,"score":156165.34914346485},{"content":"// ------------------------------------------------------------------------------------------------\n\n// BatchLoader::pimpl data structure\n\nstruct Assimp::BatchData\n\n{\n\n\tBatchData()\n\n\t\t:\tnext_id(0xffff)\n\n\t{}\n\n\n\n\t// IO system to be used for all imports\n\n\tIOSystem* pIOSystem;\n\n\n\n\t// Importer used to load all meshes\n\n\tImporter* pImporter;\n\n\n\n\t// List of all imports\n\n\tstd::list<LoadRequest> requests;\n\n\n\n\t// Base path\n\n\tstd::string pathBase;\n\n\n\n\t// Id for next item\n\n\tunsigned int next_id;\n","file_path":"src/dependencies/assimp/code/BaseImporter.cpp","rank":73,"score":154694.80721160557},{"content":"struct Vertex // 32 byte\n\n{\n\n\tVec3D pos;\n\n\tuint8 boneWeight[4];\n\n\tuint8 boneIndex[4];\n\n\tuint8 normal[4]; //normal_x = (float)normal[0]/255.0f...\n\n\tint16 uv[2];\n\n\tuint8 tangent[4];\n\n};\n\n\n","file_path":"src/dependencies/assimp/code/M3Importer.h","rank":74,"score":154673.2169321969},{"content":"struct VertexExt // 36 byte\n\n{\n\n\tVec3D pos;\n\n\tuint8 boneWeight[ 4 ];\n\n\tuint8 boneIndex[ 4 ];\n\n\tuint8 normal[ 4 ]; //normal_x = (float)normal[0]/255.0f...\n\n\tint16 uv[ 2 ];\n\n\tuint32 d1;\n\n\tuint8 tangent[ 4 ];\n\n};\n\n\n","file_path":"src/dependencies/assimp/code/M3Importer.h","rank":75,"score":152255.04571898462},{"content":"Open Asset Import Library (assimp)\n\n----------------------------------------------------------------------\n\n\n\nCopyright (c) 2006-2012, assimp team\n\nAll rights reserved.\n\n\n\nRedistribution and use of this software in source and binary forms, \n\nwith or without modification, are permitted provided that the \n\nfollowing conditions are met:\n\n\n\n* Redistributions of source code must retain the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer.\n\n\n\n* Redistributions in binary form must reproduce the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer in the documentation and/or other\n\n materials provided with the distribution.\n\n\n\n* Neither the name of the assimp team, nor the names of its\n","file_path":"src/dependencies/assimp/code/Vertex.h","rank":76,"score":148554.26033793742},{"content":"Open Asset Import Library (assimp)\n\n----------------------------------------------------------------------\n\n\n\nCopyright (c) 2006-2012, assimp team\n\nAll rights reserved.\n\n\n\nRedistribution and use of this software in source and binary forms, \n\nwith or without modification, are permitted provided that the \n\nfollowing conditions are met:\n\n\n\n* Redistributions of source code must retain the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer.\n\n\n\n* Redistributions in binary form must reproduce the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer in the documentation and/or other\n\n materials provided with the distribution.\n\n\n\n* Neither the name of the assimp team, nor the names of its\n","file_path":"src/dependencies/assimp/code/PretransformVertices.h","rank":77,"score":146228.2868903945},{"content":"Open Asset Import Library (assimp)\n\n----------------------------------------------------------------------\n\n\n\nCopyright (c) 2006-2012, assimp team\n\nAll rights reserved.\n\n\n\nRedistribution and use of this software in source and binary forms, \n\nwith or without modification, are permitted provided that the \n\nfollowing conditions are met:\n\n\n\n* Redistributions of source code must retain the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer.\n\n\n\n* Redistributions in binary form must reproduce the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer in the documentation and/or other\n\n materials provided with the distribution.\n\n\n\n* Neither the name of the assimp team, nor the names of its\n","file_path":"src/dependencies/assimp/code/TextureTransform.h","rank":78,"score":146226.4610574569},{"content":"struct ExpectedExceptionTraits<NoExceptionExpected>\n\n{\n\n static void expectedException()\n\n {\n\n }\n\n};\n\n\n\n\n\n#endif\n\n\n\n//*** FIXME: rework this when class Fixture is implemented. ***//\n\n\n\n\n\n/*! \\brief Generate a test case from a fixture method.\n\n * \\ingroup WritingTestFixture\n\n *\n\n * A test caller provides access to a test case method \n\n * on a test fixture class. Test callers are useful when \n\n * you want to run an individual test or add it to a \n\n * suite.\n","file_path":"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/TestCaller.h","rank":79,"score":145985.1639417485},{"content":"Open Asset Import Library (assimp)\n\n----------------------------------------------------------------------\n\n\n\nCopyright (c) 2006-2012, assimp team\n\nAll rights reserved.\n\n\n\nRedistribution and use of this software in source and binary forms, \n\nwith or without modification, are permitted provided that the \n\nfollowing conditions are met:\n\n\n\n* Redistributions of source code must retain the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer.\n\n\n\n* Redistributions in binary form must reproduce the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer in the documentation and/or other\n\n materials provided with the distribution.\n\n\n\n* Neither the name of the assimp team, nor the names of its\n","file_path":"src/dependencies/assimp/include/assimp/quaternion.h","rank":80,"score":145966.6438157566},{"content":"---------------------------------------------------------------------------\n\nOpen Asset Import Library (assimp)\n\n---------------------------------------------------------------------------\n\n\n\nCopyright (c) 2006-2012, assimp team\n\n\n\nAll rights reserved.\n\n\n\nRedistribution and use of this software in source and binary forms, \n\nwith or without modification, are permitted provided that the following \n\nconditions are met:\n\n\n\n* Redistributions of source code must retain the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer.\n\n\n\n* Redistributions in binary form must reproduce the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer in the documentation and/or other\n\n materials provided with the distribution.\n\n\n","file_path":"src/dependencies/assimp/include/assimp/vector2.h","rank":81,"score":145966.6438157566},{"content":"---------------------------------------------------------------------------\n\nOpen Asset Import Library (assimp)\n\n---------------------------------------------------------------------------\n\n\n\nCopyright (c) 2006-2012, assimp team\n\n\n\nAll rights reserved.\n\n\n\nRedistribution and use of this software in source and binary forms, \n\nwith or without modification, are permitted provided that the following \n\nconditions are met:\n\n\n\n* Redistributions of source code must retain the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer.\n\n\n\n* Redistributions in binary form must reproduce the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer in the documentation and/or other\n\n materials provided with the distribution.\n\n\n","file_path":"src/dependencies/assimp/include/assimp/color4.h","rank":82,"score":145966.6438157566},{"content":"","file_path":"src/dependencies/assimp/include/assimp/matrix4x4.h","rank":83,"score":145966.6438157566},{"content":"---------------------------------------------------------------------------\n\nOpen Asset Import Library (assimp)\n\n---------------------------------------------------------------------------\n\n\n\nCopyright (c) 2006-2012, assimp team\n\n\n\nAll rights reserved.\n\n\n\nRedistribution and use of this software in source and binary forms, \n\nwith or without modification, are permitted provided that the following \n\nconditions are met:\n\n\n\n* Redistributions of source code must retain the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer.\n\n\n\n* Redistributions in binary form must reproduce the above\n\n copyright notice, this list of conditions and the\n\n following disclaimer in the documentation and/or other\n\n materials provided with the distribution.\n\n\n","file_path":"src/dependencies/assimp/include/assimp/vector3.h","rank":84,"score":145966.6438157566},{"content":"","file_path":"src/dependencies/assimp/include/assimp/matrix3x3.h","rank":85,"score":145966.6438157566},{"content":"\tService();\n\n\t~Service();\n\nprivate:\n\n\tuint32 cloneBatch(uint32 id,uint32 layerId,uint32 textureId);\n\n\tbool loadCorePipeline(int id,const char* name);\n\n\n\n\tuint32 registerFontBatch(const data::Font* font);\n\n\tcore::BufferAllocator batches_;\n\n\tcore::BufferAllocator fontBatches_;\n\n\n\n\tenum {\n\n\t\tkMaxGeometries = 3\n\n\t};\n\n\tstruct Mesh {\n\n\t\tuint32 vertexSize;\n\n\t\trendering::Buffer vbo;\n\n\t\trendering::Buffer ibo;\n\n\t\trendering::Mesh mesh;\n\n\t};\n\n\tMesh meshes_[kMaxGeometries];\n","file_path":"src/rendering/ui.h","rank":88,"score":78.78206597987672},{"content":"\t\t//Create a new batch for this texture.\n\n\t\trendering::ui::Batch batch;\n\n\t\tbatch.depth = 0;\n\n\t\tbatch.name = \"TextureView\";\n\n\t\tauto pipelineId = ev.renderer->uiPipeline(pipeline_);\n\n\t\tbatchId = ev.renderer->registerBatch(batch,pipelineId);\n\n\t}\n\n\tauto geometry = ev.renderer->allocate(ev.layerId,batchId,ev.renderer->uiTexture(texture_),4,6);\n\n\trendering::draw2D::positionInt16::textured::coloured::quad(geometry,ev.position,ev.position + ev.size,defaultTextureCoords,color_);\t\n\n}\n\n\n\nRectangle::Rectangle(uint32 colour){\n\n\tcolors_[0] = colors_[1] = colors_[2] = colors_[3] = colour;\n\n\tcheckOpaque(colour);\n\n}\n\nvoid Rectangle::makeFlat(uint32 colour) {\n\n\tcolors_[0] = colors_[1] = colors_[2] = colors_[3] = colour;\n\n\tcheckOpaque(colour);\n\n}\n\nvoid Rectangle::makeTopDownGradient(uint32 topColour,uint32 bottomColour){\n","file_path":"src/ui/components.cpp","rank":91,"score":69.18575831451984},{"content":"\trendering::Pipeline::GLSLLayout glslLayout;\n\n\tchar attributeBufferStorage[2048];\n\n\tcore::BufferAllocator attributeBuffer(core::Bytes(attributeBufferStorage,sizeof(attributeBufferStorage)),core::BufferAllocator::GrowOnOverflow);\n\n\tuint32 attributeBufferOffset = 0;\n\n\tif(vertexAttributeCount){\n\n\t\tglslLayout.vertexAttributes = (const char**) attributeBuffer.allocate(vertexAttributeCount * sizeof(char*),alignof(char*));\n\n\t\tglslLayout.vertexAttributeCount = vertexAttributeCount;\n\n\t\tfor(uint32 i = 0;i< vertexAttributeCount;++i){\n\n\t\t\tauto dest = (char*)attributeBuffer.allocate(vertexAttributes[i].length()+1,0);\n\n\t\t\tmemcpy(dest,vertexAttributes[i].begin,vertexAttributes[i].length());\n\n\t\t\tdest[vertexAttributes[i].length()] = '\\0';\n\n\t\t\tglslLayout.vertexAttributes[i] = dest;\n\n\t\t}\n\n\t}\n\n\tauto pipeline = rendering->create(shaders,shaderCount,glslLayout);\n\n#else\n\n\tauto pipeline = rendering->create(shaders,shaderCount);\n\n#endif\n\n\n\n\tauto obj = parser->service->newPipeline();\n\n\tnew(obj) ::data::Pipeline(pipeline);\n\n\tparser->service->mapPointerToID(parser->bundle,obj,id);\n\n\tparser->service->registerPipeline(pipeline);\n\n}\n\n\n\n//\n\n\n","file_path":"src/data/intermediate/bundle/parser.cpp","rank":97,"score":63.59396663842986},{"content":"\t\t\tservice->mapPointerToID(bundle,destMesh,self->id);\n\n\t\t}\n\n\t\tvoid Reader::processMaterial(const char* name,const char** textures,size_t textureCount) {\n\n\t\t\tcore::bufferStringStream::Formatter fmt;\n\n\t\t\tif(!name || !strlen(name)) {\n\n\t\t\t\tusing namespace core::bufferStringStream;\n\n\t\t\t\tname = asCString(fmt.allocator<<self->id<<\".material.\"<<materialId);\n\n\t\t\t}\n\n\n\n\t\t\tauto destMaterial = service->allocateObject<::data::Material>();\n\n\t\t\trendering::Texture2D ts[::data::Material::kMaxTextures];\n\n\t\t\tfor(size_t i = 0;i<textureCount;++i){\n\n\t\t\t\tTexture texture;\n\n\t\t\t\ttexture.parser = parser;\n\n\t\t\t\ttexture.id = core::Bytes(nullptr,nullptr);\n\n\t\t\t\ttexture.mipmapping = true;\n\n\t\t\t\ttexture.path = core::Bytes((void*)textures[i],strlen(textures[i]));\n\n\t\t\t\ttexture.end();\n\n\t\t\t\tts[i] = texture.result;\n\n\t\t\t}\n","file_path":"src/data/intermediate/bundle/parser.cpp","rank":99,"score":58.4321715741477}],"string":"[\n {\n \"content\": \"struct Batch {\\n\\n\\tenum { kMaxLayer = 0xFF };\\n\\n\\tenum { kMaxDepth = 0xFF };\\n\\n\\n\\n\\ttypedef batching::Geometry Geometry;\\n\\n\\n\\n\\tsize_t verticesSize,indicesSize;\\n\\n\\ttopology::Primitive primitive;\\n\\n\\tconst char* name;\\n\\n\\tuint32 layer,depth;//Batches are sorted by depth and layers.\\n\\n\\n\\n\\tBatch();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/rendering/ui.h\",\n \"rank\": 0,\n \"score\": 352725.6525907602\n },\n {\n \"content\": \"struct ScreenSpaceVertex;\\n\",\n \"file_path\": \"src/rendering/softwareOcclusion/softwareOcclusion.h\",\n \"rank\": 3,\n \"score\": 220950.05525405455\n },\n {\n \"content\": \"struct Key\\n\\n{\\n\\n\\tKey()\\n\\n\\t\\t:\\tinter\\t(IT_LINE)\\n\\n\\t{}\\n\\n\\n\\n\\t//! Current time\\n\\n\\tdouble time;\\n\\n\\n\\n\\t//! Current value\\n\\n\\tfloat value;\\n\\n\\n\\n\\t//! How to interpolate this key with previous key?\\n\\n\\tInterpolationType inter;\\n\\n\\n\\n\\t//! Interpolation parameters\\n\\n\\tfloat params[5];\\n\\n\\n\\n\\n\\n\\t// for std::find()\\n\\n\\toperator double () {\\n\\n\\t\\treturn time;\\n\\n\\t}\\n\\n};\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** \\\\brief Data structure for a LWO animation envelope\\n\\n */\\n\",\n \"file_path\": \"src/dependencies/assimp/code/LWOAnimation.h\",\n \"rank\": 4,\n \"score\": 215414.97951352285\n },\n {\n \"content\": \"struct Key: Event {\\n\\n\\tuint32 key;\\n\\n};\\n\",\n \"file_path\": \"src/input/events.h\",\n \"rank\": 5,\n \"score\": 208486.09568461473\n },\n {\n \"content\": \"#include <cppunit/plugin/PlugInParameters.h>\\n\\nstruct CppUnitTestPlugIn;\\n\\n\\n\\nCPPUNIT_NS_BEGIN\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/plugin/PlugInManager.h\",\n \"rank\": 6,\n \"score\": 204835.6165781913\n },\n {\n \"content\": \"struct CppUnitTestPlugIn\\n\\n{\\n\\n /*! \\\\brief Called just after loading the dynamic library. \\n\\n *\\n\\n * Override this method to add additional suite to the registry, though this\\n\\n * is preferably done using the macros (CPPUNIT_TEST_SUITE_REGISTRATION...).\\n\\n * If you are creating a custom listener to extends the plug-in runner,\\n\\n * you can use this to configure the listener using the \\\\a parameters.\\n\\n *\\n\\n * You could also use the parameters to specify some global parameter, such\\n\\n * as test datas location, database name...\\n\\n *\\n\\n * N.B.: Parameters interface is not define yet, and the plug-in runner does\\n\\n * not yet support plug-in parameter.\\n\\n */\\n\\n virtual void initialize( CPPUNIT_NS::TestFactoryRegistry *registry,\\n\\n const CPPUNIT_NS::PlugInParameters ¶meters ) =0;\\n\\n\\n\\n /*! \\\\brief Gives a chance to the plug-in to register TestListener.\\n\\n * \\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/plugin/TestPlugIn.h\",\n \"rank\": 7,\n \"score\": 204829.0124875928\n },\n {\n \"content\": \"class CppUnitMap : public std::map<Key\\n\\n ,T\\n\\n ,std::less<Key>\\n\\n ,CPPUNIT_STD_ALLOCATOR>\\n\\n{\\n\\npublic:\\n\\n};\\n\\n\\n\\n#else // CPPUNIT_STD_NEED_ALLOCATOR\\n\\n\\n\\n#define CppUnitMap std::map\\n\\n\\n\\n#endif\\n\\n\\n\\n#endif // CPPUNIT_PORTABILITY_CPPUNITMAP_H\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/portability/CppUnitMap.h\",\n \"rank\": 8,\n \"score\": 192167.58117668846\n },\n {\n \"content\": \"class AutoRegisterRegistry\\n\\n{\\n\\npublic:\\n\\n AutoRegisterRegistry( const std::string &which,\\n\\n const std::string &to )\\n\\n {\\n\\n TestFactoryRegistry::getRegistry( to ).addRegistry( which );\\n\\n }\\n\\n\\n\\n AutoRegisterRegistry( const std::string &which )\\n\\n {\\n\\n TestFactoryRegistry::getRegistry().addRegistry( which );\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\nCPPUNIT_NS_END\\n\\n\\n\\n#endif // CPPUNIT_EXTENSIONS_AUTOREGISTERSUITE_H\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h\",\n \"rank\": 9,\n \"score\": 187995.93104576762\n },\n {\n \"content\": \"class AutoRegisterSuite\\n\\n{\\n\\npublic:\\n\\n /** Auto-register the suite factory in the global registry.\\n\\n */\\n\\n AutoRegisterSuite()\\n\\n : m_registry( &TestFactoryRegistry::getRegistry() )\\n\\n {\\n\\n m_registry->registerFactory( &m_factory );\\n\\n }\\n\\n\\n\\n /** Auto-register the suite factory in the specified registry.\\n\\n * \\\\param name Name of the registry.\\n\\n */\\n\\n AutoRegisterSuite( const std::string &name )\\n\\n : m_registry( &TestFactoryRegistry::getRegistry( name ) )\\n\\n {\\n\\n m_registry->registerFactory( &m_factory );\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h\",\n \"rank\": 10,\n \"score\": 187995.93104576762\n },\n {\n \"content\": \"inline uint32 Font::renderingType() const { return renderType_; }\\n\",\n \"file_path\": \"src/data/font/font.h\",\n \"rank\": 11,\n \"score\": 187916.76094510045\n },\n {\n \"content\": \"class TextureView: public Renderable {\\n\\npublic:\\n\\n\\tTextureView(rendering::Texture2D texture = rendering::Texture2D::null(),rendering::Pipeline pipeline = rendering::Pipeline::nullPipeline());\\n\\n\\n\\n\\tvoid draw(Widget* widget,events::Draw& ev);\\n\\n\\n\\n\\trendering::Pipeline pipeline_;\\n\\n\\trendering::Texture2D texture_;\\n\\n\\tuint32 color_;\\n\\n};\\n\",\n \"file_path\": \"src/ui/components.h\",\n \"rank\": 12,\n \"score\": 181336.27772355507\n },\n {\n \"content\": \"\\t\\tuint8* dest;\\n\",\n \"file_path\": \"src/rendering/2d.h\",\n \"rank\": 13,\n \"score\": 179159.75141670628\n },\n {\n \"content\": \"\\tuint32 layerId;\\n\",\n \"file_path\": \"src/ui/events.h\",\n \"rank\": 14,\n \"score\": 177855.70013786922\n },\n {\n \"content\": \"\\tstruct Pipeline {\\n\\n\\t\\tstruct Constant {\\n\\n\\t\\t\\tint32 location;\\n\\n\\t\\t\\tuint8 shaderType,coreTypeId;\\n\\n\\t\\t\\tuint16 count;\\n\\n\\t\\t\\tconst char* name;\\n\\n\\n\\n\\t\\t\\tConstant(const char* name);\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\t//GLSL specific extra information for program linking (GLSL 3.3 layout)\\n\\n\\t\\tstruct GLSLLayout {\\n\\n\\t\\t\\tconst char** vertexAttributes;\\n\\n\\t\\t\\tuint32 vertexAttributeCount;\\n\\n\\t\\t\\tconst char** pixelAttributes;\\n\\n\\t\\t\\tuint32 pixelAttributeCount;\\n\\n\\n\\n\\t\\t\\tGLSLLayout();\\n\\n\\t\\t};\\n\\n\\t\\n\\n\\t\\tuint32 id;\\n\\n\\n\\n\\t\\tstatic inline Pipeline nullPipeline() { Pipeline result = { 0 }; return result; }\\n\",\n \"file_path\": \"src/rendering/opengl/types.h\",\n \"rank\": 15,\n \"score\": 174021.88248831098\n },\n {\n \"content\": \"\\t\\tuint32 id;\\n\",\n \"file_path\": \"src/rendering/opengl/types.h\",\n \"rank\": 16,\n \"score\": 173998.76498501786\n },\n {\n \"content\": \"\\t\\t\\tconst char* name;\\n\",\n \"file_path\": \"src/rendering/opengl/types.h\",\n \"rank\": 17,\n \"score\": 173972.3732611782\n },\n {\n \"content\": \"struct TaskKey;\\n\\n\\n\",\n \"file_path\": \"src/application/tasking.h\",\n \"rank\": 18,\n \"score\": 173464.28925531515\n },\n {\n \"content\": \"struct TaskKey {\\n\\n\\tTaskID id;\\n\\n\\tTask* task;\\n\\n\\tTaskKey* next;\\n\\n};\\n\",\n \"file_path\": \"src/application/tasking.cpp\",\n \"rank\": 19,\n \"score\": 170715.89288282403\n },\n {\n \"content\": \" char pipeName[GLX_HYPERPIPE_PIPE_NAME_LENGTH_SGIX];\\n\",\n \"file_path\": \"src/rendering/opengl/gl/glxext.h\",\n \"rank\": 20,\n \"score\": 170519.52410983024\n },\n {\n \"content\": \"struct SkeletalAnimation {\\n\\n\\tenum { kMaxAnimations = 3 };\\n\\n\\n\\n\\tEntityId entity;\\n\\n\\tuint32 nodeCount;\\n\\n\\tdata::Transformation3D* transformations;\\n\\n\\tdata::Mesh* mesh;\\n\\n\\tstruct Anim {\\n\\n\\t\\tfloat time;\\n\\n\\t\\tdata::animation::Animation* animation;\\n\\n\\t};\\n\\n\\tAnim anim[kMaxAnimations];\\n\\n\\n\\n\\tSkeletalAnimation(EntityId id,data::Mesh* m) {\\n\\n\\t\\tentity = id;\\n\\n\\t\\tmesh = m;\\n\\n\\t\\tnodeCount= m->skeletonNodeCount();\\n\\n\\t\\ttransformations = (data::Transformation3D*)allocator()->allocate(sizeof(data::Transformation3D)*mesh->skeletonNodeCount(),alignof(vec4f));\\n\\n\\t\\tfor(uint32 i = 0;i<kMaxAnimations;++i){\\n\\n\\t\\t\\tanim[i].time = 0.f;\\n\",\n \"file_path\": \"src/scene/rendering.cpp\",\n \"rank\": 21,\n \"score\": 170442.737282211\n },\n {\n \"content\": \"struct EntityGrid {\\n\\n\\tEntityGridCell grid[10];\\n\\n\\n\\n\\tCullId createFrustumCullSphere(const vec4f& sphere,EntityId entity);\\n\\n\\tCullId updateFrustumCullSphere(CullId id,const vec4f& sphere);\\n\\n\\tvoid removeFrustumCullSphere(CullId id);\\n\\n\\tvec4f getFrustumCullSphere(CullId id);\\n\\n\\n\\n\\tEntityGrid();\\n\\n};\\n\\nCullId EntityGrid::createFrustumCullSphere(const vec4f& sphere,EntityId entity){\\n\\n\\tvec4f s = sphere;\\n\\n\\ts.w = -s.w; //NB: frustum culler expects sphere in format center, - radius\\n\\n\\treturn grid[0].createSphere(s,entity);\\n\\n}\\n\\nCullId EntityGrid::updateFrustumCullSphere(CullId id,const vec4f& sphere){\\n\\n\\t//grid[0].update(id&kEntityBlockIdMask,sphere);\\n\\n\\treturn id;\\n\\n}\\n\\nvoid EntityGrid::removeFrustumCullSphere(CullId id){\\n\",\n \"file_path\": \"src/scene/rendering.cpp\",\n \"rank\": 22,\n \"score\": 170442.737282211\n },\n {\n \"content\": \"struct VisibleEntity {\\n\\n\\tFrustumMask mask;\\n\\n\\tEntity* entity;\\n\\n\\tuint32 offset,size;\\n\\n};\\n\",\n \"file_path\": \"src/scene/rendering.cpp\",\n \"rank\": 23,\n \"score\": 170442.737282211\n },\n {\n \"content\": \"//function loading\\n\\nstruct Loader {\\n\\n\\tint major,minor;\\n\\n\\tvoid (*onError)(const char*);\\n\\n\\tcore::bufferStringStream::Formatter formatter;\\n\\n\\t\\n\\n\\tvoid* load(const char* name){\\n\\n#ifdef ARPHEG_PLATFORM_WIN32\\n\\n\\t\\tvoid* proc = (void*)wglGetProcAddress(name);\\n\\n#endif\\n\\n\\t\\tif(!proc){\\n\\n\\t\\t\\tformatter.allocator.reset();\\n\\n\\t\\t\\tcore::bufferStringStream::printf(formatter,\\\"Failed to load OpenGL core function '%s' - the application may not behave correctly!\\\\n Please update your graphics card's drivers.\\\",name);\\n\\n\\t\\t\\tservices::logging()->warning(core::bufferStringStream::asCString(formatter));\\n\\n\\t\\t}\\n\\n\\t\\tif(!proc && onError) onError(name);\\n\\n\\t\\treturn proc;\\n\\n\\t}\\n\\n};\\n\\n\\n\\n#define F(f,T) f = (T) loader.load(#f);\\n\",\n \"file_path\": \"src/rendering/opengl/api.cpp\",\n \"rank\": 24,\n \"score\": 170442.737282211\n },\n {\n \"content\": \"struct aiMeshKey \\n\\n{\\n\\n\\t/** The time of this key */\\n\\n\\tdouble mTime;\\n\\n\\n\\n\\t/** Index into the aiMesh::mAnimMeshes array of the \\n\\n\\t * mesh coresponding to the #aiMeshAnim hosting this\\n\\n\\t * key frame. The referenced anim mesh is evaluated\\n\\n\\t * according to the rules defined in the docs for #aiAnimMesh.*/\\n\\n\\tunsigned int mValue;\\n\\n\\n\\n#ifdef __cplusplus\\n\\n\\n\\n\\taiMeshKey() {\\n\\n\\t}\\n\\n\\n\\n\\t/** Construction from a given time and key value */\\n\\n\\taiMeshKey(double time, const unsigned int value)\\n\\n\\t\\t:\\tmTime\\t(time)\\n\\n\\t\\t,\\tmValue\\t(value)\\n\\n\\t{}\\n\\n\\n\\n\\ttypedef unsigned int elem_type;\\n\\n\\n\\n\\t// Comparison operators. For use with std::find();\\n\\n\\tbool operator == (const aiMeshKey& o) const {\\n\\n\\t\\treturn o.mValue == this->mValue;\\n\\n\\t}\\n\\n\\tbool operator != (const aiMeshKey& o) const {\\n\\n\\t\\treturn o.mValue != this->mValue;\\n\\n\\t}\\n\\n\\n\\n\\t// Relational operators. For use with std::sort();\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/anim.h\",\n \"rank\": 25,\n \"score\": 169245.2592724326\n },\n {\n \"content\": \"\\tconst char* id; \\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/cexport.h\",\n \"rank\": 26,\n \"score\": 169222.5977103394\n },\n {\n \"content\": \"struct aiScene\\n\\n{\\n\\n\\n\\n\\t/** Any combination of the AI_SCENE_FLAGS_XXX flags. By default \\n\\n\\t* this value is 0, no flags are set. Most applications will\\n\\n\\t* want to reject all scenes with the AI_SCENE_FLAGS_INCOMPLETE \\n\\n\\t* bit set.\\n\\n\\t*/\\n\\n\\tunsigned int mFlags;\\n\\n\\n\\n\\n\\n\\t/** The root node of the hierarchy. \\n\\n\\t* \\n\\n\\t* There will always be at least the root node if the import\\n\\n\\t* was successful (and no special flags have been set). \\n\\n\\t* Presence of further nodes depends on the format and content \\n\\n\\t* of the imported file.\\n\\n\\t*/\\n\\n\\tC_STRUCT aiNode* mRootNode;\\n\\n\\n\\n\\n\\n\\n\\n\\t/** The number of meshes in the scene. */\\n\\n\\tunsigned int mNumMeshes;\\n\\n\\n\\n\\t/** The array of meshes. \\n\\n\\t*\\n\\n\\t* Use the indices given in the aiNode structure to access \\n\\n\\t* this array. The array is mNumMeshes in size. If the\\n\\n\\t* AI_SCENE_FLAGS_INCOMPLETE flag is not set there will always \\n\\n\\t* be at least ONE material.\\n\\n\\t*/\\n\\n\\tC_STRUCT aiMesh** mMeshes;\\n\\n\\n\\n\\n\\n\\n\\n\\t/** The number of materials in the scene. */\\n\\n\\tunsigned int mNumMaterials;\\n\\n\\n\\n\\t/** The array of materials. \\n\\n\\t* \\n\\n\\t* Use the index given in each aiMesh structure to access this\\n\\n\\t* array. The array is mNumMaterials in size. If the\\n\\n\\t* AI_SCENE_FLAGS_INCOMPLETE flag is not set there will always \\n\\n\\t* be at least ONE material.\\n\\n\\t*/\\n\\n\\tC_STRUCT aiMaterial** mMaterials;\\n\\n\\n\\n\\n\\n\\n\\n\\t/** The number of animations in the scene. */\\n\\n\\tunsigned int mNumAnimations; \\n\\n\\n\\n\\t/** The array of animations. \\n\\n\\t*\\n\\n\\t* All animations imported from the given file are listed here.\\n\\n\\t* The array is mNumAnimations in size.\\n\\n\\t*/\\n\\n\\tC_STRUCT aiAnimation** mAnimations;\\n\\n\\n\\n\\n\\n\\n\\n\\t/** The number of textures embedded into the file */\\n\\n\\tunsigned int mNumTextures;\\n\\n\\n\\n\\t/** The array of embedded textures.\\n\\n\\t* \\n\\n\\t* Not many file formats embed their textures into the file.\\n\\n\\t* An example is Quake's MDL format (which is also used by\\n\\n\\t* some GameStudio versions)\\n\\n\\t*/\\n\\n\\tC_STRUCT aiTexture** mTextures;\\n\\n\\n\\n\\n\\n\\t/** The number of light sources in the scene. Light sources\\n\\n\\t* are fully optional, in most cases this attribute will be 0 \\n\\n */\\n\\n\\tunsigned int mNumLights;\\n\\n\\n\\n\\t/** The array of light sources.\\n\\n\\t* \\n\\n\\t* All light sources imported from the given file are\\n\\n\\t* listed here. The array is mNumLights in size.\\n\\n\\t*/\\n\\n\\tC_STRUCT aiLight** mLights;\\n\\n\\n\\n\\n\\n\\t/** The number of cameras in the scene. Cameras\\n\\n\\t* are fully optional, in most cases this attribute will be 0 \\n\\n */\\n\\n\\tunsigned int mNumCameras;\\n\\n\\n\\n\\t/** The array of cameras.\\n\\n\\t* \\n\\n\\t* All cameras imported from the given file are listed here.\\n\\n\\t* The array is mNumCameras in size. The first camera in the\\n\\n\\t* array (if existing) is the default camera view into\\n\\n\\t* the scene.\\n\\n\\t*/\\n\\n\\tC_STRUCT aiCamera** mCameras;\\n\\n\\n\\n#ifdef __cplusplus\\n\\n\\n\\n\\t//! Default constructor - set everything to 0/NULL\\n\\n\\taiScene();\\n\\n\\n\\n\\t//! Destructor\\n\\n\\t~aiScene();\\n\\n\\n\\n\\t//! Check whether the scene contains meshes\\n\\n\\t//! Unless no special scene flags are set this will always be true.\\n\\n\\tinline bool HasMeshes() const \\n\\n\\t\\t{ return mMeshes != NULL && mNumMeshes > 0; }\\n\\n\\n\\n\\t//! Check whether the scene contains materials\\n\\n\\t//! Unless no special scene flags are set this will always be true.\\n\\n\\tinline bool HasMaterials() const \\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/scene.h\",\n \"rank\": 27,\n \"score\": 169201.41527628223\n },\n {\n \"content\": \"struct BatchData;\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** FOR IMPORTER PLUGINS ONLY: A helper class to the pleasure of importers \\n\\n * that need to load many external meshes recursively.\\n\\n *\\n\\n * The class uses several threads to load these meshes (or at least it\\n\\n * could, this has not yet been implemented at the moment).\\n\\n *\\n\\n * @note The class may not be used by more than one thread*/\\n\",\n \"file_path\": \"src/dependencies/assimp/code/Importer.h\",\n \"rank\": 28,\n \"score\": 168089.83153344432\n },\n {\n \"content\": \"//An intermediate pointer mapper, slow, not to be used in final builds.\\n\\nstruct IDPointerMapper {\\n\\n\\tstruct Obj {\\n\\n\\t\\tcore::Bytes key;\\n\\n\\t\\tvoid* value;\\n\\n\\t};\\n\\n\\tcore::BufferAllocator objects;\\n\\n\\tcore::Allocator* stringStorage;\\n\\n\\t\\n\\n\\tIDPointerMapper(core::Allocator* allocator);\\n\\n\\t\\n\\n\\tvoid insert(core::Bytes key,void* value);\\n\\n\\tvoid* get(core::Bytes key);\\n\\n};\\n\\nIDPointerMapper::IDPointerMapper(core::Allocator* allocator) :\\n\\n\\tobjects(sizeof(IDPointerMapper) * 128,allocator,core::BufferAllocator::GrowOnOverflow)\\n\\n{ stringStorage = allocator; }\\n\\nvoid IDPointerMapper::insert(core::Bytes key,void* value){\\n\\n\\t//copy string\\n\\n\\tauto dest = (uint8*)stringStorage->allocate(key.length()+1);\\n\\n\\tmemcpy(dest,key.begin,key.length());\\n\",\n \"file_path\": \"src/data/data.cpp\",\n \"rank\": 29,\n \"score\": 168086.1108146393\n },\n {\n \"content\": \"struct Vertex\\n\\n{\\n\\n\\tint32_t X : 11;\\n\\n\\tint32_t Y : 11;\\n\\n\\tint32_t Z : 10;\\n\\n};\\n\\n\\n\\n\\t// UNREAL vertex compression\\n\\ninline void CompressVertex(const aiVector3D& v, uint32_t& out)\\n\\n{\\n\\n\\tunion {\\n\\n\\t\\tVertex n;\\n\\n\\t\\tint32_t t;\\n\\n\\t};\\n\\n\\tn.X = (int32_t)v.x;\\n\\n\\tn.Y = (int32_t)v.y;\\n\\n\\tn.Z = (int32_t)v.z;\\n\\n\\tout = t;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/code/UnrealLoader.h\",\n \"rank\": 30,\n \"score\": 168056.41334457824\n },\n {\n \"content\": \"struct Vertex\\n\\n{\\n\\n\\tVertex() : iParentNode(UINT_MAX)\\n\\n\\t {}\\n\\n\\n\\n\\t//! Vertex position, normal and texture coordinate\\n\\n\\taiVector3D pos,nor,uv;\\n\\n\\n\\n\\t//! Vertex parent node\\n\\n\\tunsigned int iParentNode;\\n\\n\\n\\n\\t//! Links to bones: pair.first is the bone index,\\n\\n\\t//! pair.second is the vertex weight.\\n\\n\\t//! WARN: The remaining weight (to reach 1.0f) is assigned\\n\\n\\t//! to the parent node/bone\\n\\n\\tstd::vector<std::pair<unsigned int, float> > aiBoneLinks;\\n\\n};\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** Data structure for a face in a SMD file\\n\\n*/\\n\",\n \"file_path\": \"src/dependencies/assimp/code/SMDLoader.h\",\n \"rank\": 31,\n \"score\": 168056.41334457824\n },\n {\n \"content\": \"struct Texture\\n\\n{\\n\\n\\t//! Default constructor\\n\\n\\tTexture()\\n\\n\\t\\t: mOffsetU\\t(0.0f)\\n\\n\\t\\t, mOffsetV\\t(0.0f)\\n\\n\\t\\t, mScaleU\\t(1.0f)\\n\\n\\t\\t, mScaleV\\t(1.0f)\\n\\n\\t\\t, mRotation\\t(0.0f)\\n\\n\\t\\t, mMapMode\\t(aiTextureMapMode_Wrap)\\n\\n\\t\\t, iUVSrc\\t(0)\\n\\n\\t{\\n\\n\\t\\tmTextureBlend = get_qnan();\\n\\n\\t}\\n\\n\\n\\n\\t//! Specifies the blend factor for the texture\\n\\n\\tfloat mTextureBlend;\\n\\n\\n\\n\\t//! Specifies the filename of the texture\\n\\n\\tstd::string mMapName;\\n\",\n \"file_path\": \"src/dependencies/assimp/code/3DSHelper.h\",\n \"rank\": 32,\n \"score\": 168050.10256881008\n },\n {\n \"content\": \"struct TouchedNodeMask {\\n\\n\\tenum { kSizeofSizetInBits = sizeof(size_t)*8 };\\n\\n\\tsize_t bits[Animator::kMaxNodes/kSizeofSizetInBits];\\n\\n\\n\\n\\tTouchedNodeMask(){\\n\\n\\t\\tfor(size_t i = 0;i<Animator::kMaxNodes/kSizeofSizetInBits;++i) bits[i] = 0;\\n\\n\\t}\\n\\n\\tinline void mark(size_t i){\\n\\n\\t\\tsize_t element= i/kSizeofSizetInBits;\\n\\n\\t\\tsize_t bit = i%kSizeofSizetInBits;\\n\\n\\t\\tbits[element] |= 1<<bit;\\n\\n\\t}\\n\\n\\tinline bool isNotTouched(size_t i){\\n\\n\\t\\tsize_t element= i/kSizeofSizetInBits;\\n\\n\\t\\tsize_t bit = i%kSizeofSizetInBits;\\n\\n\\t\\treturn (bits[element] & (1<<bit)) == 0;\\n\\n\\t}\\n\\n};\\n\\n\\n\\n//Obtain and store the wrapped local time\\n\",\n \"file_path\": \"src/rendering/animation.cpp\",\n \"rank\": 33,\n \"score\": 167817.15997603053\n },\n {\n \"content\": \"struct VisibleAnimatedEntity {\\n\\n\\tFrustumMask mask;\\n\\n\\tAnimatedEntity* entity;\\n\\n\\tuint32 offset,size;\\n\\n};\\n\",\n \"file_path\": \"src/scene/rendering.cpp\",\n \"rank\": 34,\n \"score\": 167817.15997603053\n },\n {\n \"content\": \"struct VisibleCustomEntity {\\n\\n\\tFrustumMask mask;\\n\\n\\tCustomEntity* entity;\\n\\n};\\n\",\n \"file_path\": \"src/scene/rendering.cpp\",\n \"rank\": 35,\n \"score\": 167817.15997603053\n },\n {\n \"content\": \"struct VisibleLightEntity {\\n\\n\\tFrustumMask mask;\\n\\n\\tLightEntity* entity;\\n\\n};\\n\\n\\n\\nService::Service(core::Allocator* alloc) :\\n\\n\\tskeletonAnimations_(sizeof(SkeletalAnimation)*1024,allocator(),core::BufferAllocator::GrowOnOverflow),\\n\\n\\tentityConstantStorage(1024*8,allocator(),core::BufferAllocator::GrowOnOverflow)\\n\\n{\\n\\n\\t//Entity pools.\\n\\n\\tentities_ = ALLOCATOR_NEW(alloc,EntityPool<Entity>) (1024*32,allocator());\\n\\n\\tanimatedEntities_ = ALLOCATOR_NEW(alloc,EntityPool<AnimatedEntity>) (1024*2,allocator());\\n\\n\\tcustomEntities_ = ALLOCATOR_NEW(alloc,EntityPool<CustomEntity>) (1024*2,allocator());\\n\\n\\tlights_ = ALLOCATOR_NEW(alloc,EntityPool<LightEntity>) (1024*2,allocator());\\n\\n\\n\\n\\tvisibleEntities_ = (core::BufferAllocator*)alloc->allocate(sizeof(core::BufferAllocator)*services::tasking()->threadCount(),alignof(core::BufferAllocator));\\n\\n\\tvisibleAnimatedEntities_ = (core::BufferAllocator*)alloc->allocate(sizeof(core::BufferAllocator)*services::tasking()->threadCount(),alignof(core::BufferAllocator));\\n\\n\\tvisibleLights_ = (core::BufferAllocator*)alloc->allocate(sizeof(core::BufferAllocator)*services::tasking()->threadCount(),alignof(core::BufferAllocator));\\n\\n\\t\\n\\n\\tvisibleEntitiesInited = false;\\n\",\n \"file_path\": \"src/scene/rendering.cpp\",\n \"rank\": 36,\n \"score\": 167817.15997603053\n },\n {\n \"content\": \"#ifndef CPPUNIT_EXTENSIONS_AUTOREGISTERSUITE_H\\n\\n#define CPPUNIT_EXTENSIONS_AUTOREGISTERSUITE_H\\n\\n\\n\\n#include <cppunit/extensions/TestSuiteFactory.h>\\n\\n#include <cppunit/extensions/TestFactoryRegistry.h>\\n\\n#include <string>\\n\\n\\n\\nCPPUNIT_NS_BEGIN\\n\\n\\n\\n\\n\\n/*! \\\\brief (Implementation) Automatically register the test suite of the specified type.\\n\\n *\\n\\n * You should not use this class directly. Instead, use the following macros:\\n\\n * - CPPUNIT_TEST_SUITE_REGISTRATION()\\n\\n * - CPPUNIT_TEST_SUITE_NAMED_REGISTRATION()\\n\\n *\\n\\n * This object will register the test returned by TestCaseType::suite()\\n\\n * when constructed to the test registry.\\n\\n *\\n\\n * This object is intented to be used as a static variable.\\n\\n *\\n\\n *\\n\\n * \\\\param TestCaseType Type of the test case which suite is registered.\\n\\n * \\\\see CPPUNIT_TEST_SUITE_REGISTRATION, CPPUNIT_TEST_SUITE_NAMED_REGISTRATION\\n\\n * \\\\see CppUnit::TestFactoryRegistry.\\n\\n */\\n\\ntemplate<class TestCaseType>\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h\",\n \"rank\": 37,\n \"score\": 167184.32764964696\n },\n {\n \"content\": \" ~AutoRegisterSuite()\\n\\n {\\n\\n if ( TestFactoryRegistry::isValid() )\\n\\n m_registry->unregisterFactory( &m_factory );\\n\\n }\\n\\n\\n\\nprivate:\\n\\n TestFactoryRegistry *m_registry;\\n\\n TestSuiteFactory<TestCaseType> m_factory;\\n\\n};\\n\\n\\n\\n\\n\\n/*! \\\\brief (Implementation) Automatically adds a registry into another registry.\\n\\n *\\n\\n * Don't use this class. Use the macros CPPUNIT_REGISTRY_ADD() and\\n\\n * CPPUNIT_REGISTRY_ADD_TO_DEFAULT() instead.\\n\\n */\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/extensions/AutoRegisterSuite.h\",\n \"rank\": 38,\n \"score\": 167173.21386308954\n },\n {\n \"content\": \"\\tunsigned int mVertexId;\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/mesh.h\",\n \"rank\": 39,\n \"score\": 167121.1441121757\n },\n {\n \"content\": \"enum VertexFormat\\n\\n{\\n\\n\\tVertex_Standard,\\n\\n\\tVertex_Extended\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/code/M3Importer.h\",\n \"rank\": 40,\n \"score\": 165882.4358405176\n },\n {\n \"content\": \"struct KeyPred {\\n\\n\\tinline bool operator () (const T& a,const T& b){\\n\\n\\t\\treturn a.time < b.time;\\n\\n\\t}\\n\\n};\\n\\nvoid Scene::importSkeletalAnimationTracks() {\\n\\n\\tfor(uint32 i = 0;i<scene->mNumAnimations;++i){\\n\\n\\t\\tauto animation = scene->mAnimations[i];\\n\\n\\t\\tanimation::Animation destAnimation;\\n\\n\\t\\tdestAnimation.length = scene->mAnimations[i]->mDuration;\\n\\n\\t\\tdestAnimation.frequency = scene->mAnimations[i]->mTicksPerSecond == 0.f? 25.f : scene->mAnimations[i]->mTicksPerSecond;\\n\\n\\t\\tdestAnimation.trackCount = 0;\\n\\n\\t\\tdestAnimation.tracks = nullptr;\\n\\n\\n\\n\\t\\t//Find the track count\\n\\n\\t\\tfor(uint32 i = 0;i<animation->mNumChannels;++i){\\n\\n\\t\\t\\tif(!findSkeletonNode(animation->mChannels[i]->mNodeName)){\\n\\n\\t\\t\\t\\tlogging->warning(\\\"An animation contains a track which doesn't influence any bone\\\");\\n\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t}\\n\",\n \"file_path\": \"src/data/intermediate/mesh/reader.cpp\",\n \"rank\": 41,\n \"score\": 165562.7982199745\n },\n {\n \"content\": \"struct VertexDesc\\n\\n{\\n\\n\\tVertexDesc()\\n\\n\\t\\t: mFirstWeight\\t(0)\\n\\n\\t\\t, mNumWeights\\t(0)\\n\\n\\t{}\\n\\n\\n\\n\\t//! UV cordinate of the vertex\\n\\n\\taiVector2D mUV;\\n\\n\\n\\n\\t//! Index of the first weight of the vertex in\\n\\n\\t//! the vertex weight list\\n\\n\\tunsigned int mFirstWeight;\\n\\n\\n\\n\\t//! Number of weights assigned to this vertex\\n\\n\\tunsigned int mNumWeights;\\n\\n};\\n\\n\\n\\ntypedef std::vector< VertexDesc > VertexList;\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** Represents a vertex weight descriptor in a MD5 file\\n\\n*/\\n\",\n \"file_path\": \"src/dependencies/assimp/code/MD5Parser.h\",\n \"rank\": 42,\n \"score\": 165535.29579188526\n },\n {\n \"content\": \"struct BoneVertex\\n\\n{\\n\\n\\t//! Bone and corresponding vertex weight.\\n\\n\\t//! -1 for unrequired bones ....\\n\\n\\tstd::vector<std::pair<int,float> > mBoneWeights;\\n\\n\\n\\n\\t//! Position of the bone vertex.\\n\\n\\t//! MUST be identical to the vertex position\\n\\n\\t//aiVector3D mPosition;\\n\\n};\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** Helper structure to represent an ASE file animation */\\n\",\n \"file_path\": \"src/dependencies/assimp/code/ASEParser.h\",\n \"rank\": 43,\n \"score\": 165535.29579188526\n },\n {\n \"content\": \"struct aiTexture;\\n\",\n \"file_path\": \"src/dependencies/assimp/code/LWOLoader.h\",\n \"rank\": 44,\n \"score\": 165529.116547456\n },\n {\n \"content\": \"struct aiNode;\\n\\n\\n\\nnamespace Assimp\\t{\\n\\n\\n\\n#define AI_TT_UV_IDX_LOCK_TBD\\t0xffffffff\\n\\n#define AI_TT_UV_IDX_LOCK_NONE\\t0xeeeeeeee\\n\\n\\n\\n\\n\\n#define AI_TT_ROTATION_EPSILON\\t((float)AI_DEG_TO_RAD(0.5))\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** Small helper structure representing a shortcut into the material list\\n\\n * to be able to update some values quickly.\\n\\n*/\\n\",\n \"file_path\": \"src/dependencies/assimp/code/TextureTransform.h\",\n \"rank\": 45,\n \"score\": 165529.116547456\n },\n {\n \"content\": \"struct LightAABBXAxis {\\n\\n\\tuint8 firstTile,lastTile;\\n\\n\\tuint16 index;\\n\\n};\\n\\n\\n\\n\\n\\nstatic inline bool rowIntersect(int32 ty,const TileGrid::LightAABB& lightRect){\\n\\n\\tif(ty > lightRect.min[1]){\\n\\n\\t\\tif(lightRect.max[1] <= ty) return false;\\n\\n\\t}\\n\\n\\telse {\\n\\n\\t\\tif((ty + kTileSize) <= lightRect.min[1]) return false;\\n\\n\\t}\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\n// This is a naive tile assignment implementation.\\n\\nvoid TileGrid::performLightAssignment(const Tiler& tiler) {\\n\\n\\tindexOffset = 0;\\n\\n\\tuint32 idx = 0;\\n\",\n \"file_path\": \"src/rendering/lighting/tiled.cpp\",\n \"rank\": 46,\n \"score\": 165301.02902356844\n },\n {\n \"content\": \"//A rasterizable triangle.\\n\\nstruct XY {\\n\\n\\t//struct {\\n\\n\\t\\tint32 x, y;\\n\\n\\t//};\\n\\n\\t//uint32 xy;\\n\\n};\\n\",\n \"file_path\": \"src/rendering/softwareOcclusion/softwareOcclusion.cpp\",\n \"rank\": 47,\n \"score\": 165301.02902356844\n },\n {\n \"content\": \"struct BinnedTriangle;\\n\\n\\n\",\n \"file_path\": \"src/rendering/softwareOcclusion/softwareOcclusion.h\",\n \"rank\": 48,\n \"score\": 165301.02902356844\n },\n {\n \"content\": \"\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/matrix3x3.h\",\n \"rank\": 49,\n \"score\": 165258.4689067915\n },\n {\n \"content\": \"\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/matrix4x4.h\",\n \"rank\": 50,\n \"score\": 165258.4689067915\n },\n {\n \"content\": \"struct aiQuaternion {\\n\\n\\tfloat w, x, y, z;\\t\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\\n#endif // AI_QUATERNION_H_INC\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/quaternion.h\",\n \"rank\": 51,\n \"score\": 165258.4689067915\n },\n {\n \"content\": \"struct auto_any : auto_any_base\\n\\n{\\n\\n auto_any(T const& t) : item(t) {}\\n\\n mutable T item;\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\\nT& auto_any_cast(auto_any_base const& any)\\n\\n{\\n\\n return static_cast<auto_any<T> const&>(any).item;\\n\\n}\\n\\n\\n\\n///////////////////////////////////////////////////////////////////////////////\\n\\n// FOREACH helper function\\n\\n\\n\\ntemplate<typename T>\\n\\nauto_any<typename T::const_iterator> begin(T const& t)\\n\\n{\\n\\n return t.begin();\\n\\n}\\n\",\n \"file_path\": \"src/dependencies/assimp/code/BoostWorkaround/boost/foreach.hpp\",\n \"rank\": 52,\n \"score\": 165002.77310433466\n },\n {\n \"content\": \"struct aiFloatKey \\n\\n{\\n\\n\\tdouble mTime; ///< The time of this key\\n\\n\\tfloat mValue;\\t///< The value of this key\\n\\n\\n\\n#ifdef __cplusplus\\n\\n\\n\\n\\t// time is not compared\\n\\n\\tbool operator == (const aiFloatKey& o) const\\n\\n\\t\\t{return o.mValue == this->mValue;}\\n\\n\\n\\n\\tbool operator != (const aiFloatKey& o) const\\n\\n\\t\\t{return o.mValue != this->mValue;}\\n\\n\\n\\n\\t// Only time is compared. This operator is defined\\n\\n\\t// for use with std::sort\\n\\n\\tbool operator < (const aiFloatKey& o) const\\n\\n\\t\\t{return mTime < o.mTime;}\\n\\n\\n\\n\\tbool operator > (const aiFloatKey& o) const\\n\\n\\t\\t{return mTime < o.mTime;}\\n\\n\\n\\n#endif\\n\\n};\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** Helper structure to represent a 3ds file node */\\n\",\n \"file_path\": \"src/dependencies/assimp/code/3DSHelper.h\",\n \"rank\": 53,\n \"score\": 163144.06549500418\n },\n {\n \"content\": \"struct aiMesh;\\n\\nnamespace Assimp\\t{\\n\\n\\n\\n// --------------------------------------------------------------------------------------------\\n\\n/** @brief The VertexTriangleAdjacency class computes a vertex-triangle\\n\\n * adjacency map from a given index buffer.\\n\\n *\\n\\n * @note Although it is called #VertexTriangleAdjacency, the current version does also\\n\\n * support arbitrary polygons. */\\n\",\n \"file_path\": \"src/dependencies/assimp/code/VertexTriangleAdjacency.h\",\n \"rank\": 54,\n \"score\": 163117.124578673\n },\n {\n \"content\": \"struct TTUpdateInfo\\n\\n{\\n\\n\\tTTUpdateInfo() :\\n\\n\\t\\t\\tdirectShortcut\\t(NULL)\\n\\n\\t\\t,\\tmat\\t\\t\\t\\t(NULL)\\n\\n\\t\\t,\\tsemantic\\t\\t(0)\\n\\n\\t\\t,\\tindex\\t\\t\\t(0)\\n\\n\\t{}\\n\\n\\n\\n\\t//! Direct shortcut, if available\\n\\n\\tunsigned int* directShortcut;\\n\\n\\n\\n\\t//! Material \\n\\n\\taiMaterial *mat;\\n\\n\\n\\n\\t//! Texture type and index\\n\\n\\tunsigned int semantic, index;\\n\\n};\\n\\n\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\n/** Helper class representing texture coordinate transformations\\n\\n*/\\n\",\n \"file_path\": \"src/dependencies/assimp/code/TextureTransform.h\",\n \"rank\": 55,\n \"score\": 163111.0714946828\n },\n {\n \"content\": \"struct aiTexture;\\n\",\n \"file_path\": \"src/dependencies/assimp/code/ValidateDataStructure.h\",\n \"rank\": 56,\n \"score\": 163111.0714946828\n },\n {\n \"content\": \"\",\n \"file_path\": \"src/dependencies/assimp/contrib/clipper/clipper.hpp\",\n \"rank\": 57,\n \"score\": 163107.34360151124\n },\n {\n \"content\": \"struct BinnedTriangle {\\n\\n\\tXY v[3];\\n\\n\\tfloat z[3];\\n\\n};\\n\\n\\n\\nenum {\\n\\n\\tkMaxTrianglesPerTile = 1024*2,\\n\\n\\t\\n\\n\\tkModeDepthFlat = 0, //Depth buffer pixels are stored in rows \\n\\n\\tkModeDepthPackedTiles,//Depth buffer pixels are stored in rows for each tile\\n\\n\\tkModeDepthPackedQuads,//Depth buffer pixels are stored in 2x2 quads ((0,0),(1,0),(0,1),(1,1))\\n\\n};\\n\\n\\n\\nDepthBuffer::DepthBuffer(vec2i size){\\n\\n\\tmode_ = kModeDepthPackedQuads;\\n\\n\\tauto allocator= core::memory::globalAllocator();\\n\\n\\tsize_ = size;\\n\\n\\ttileCount_ = vec2i(4,4);\\n\\n\\n\\n\\tif(size.y%tileCount_.y){\\n\",\n \"file_path\": \"src/rendering/softwareOcclusion/softwareOcclusion.cpp\",\n \"rank\": 58,\n \"score\": 162887.64078968109\n },\n {\n \"content\": \"struct ScreenSpaceQuad;\\n\",\n \"file_path\": \"src/rendering/softwareOcclusion/softwareOcclusion.h\",\n \"rank\": 59,\n \"score\": 162887.64078968109\n },\n {\n \"content\": \"struct aiVector2D {\\n\\n\\tfloat x,y;\\n\\n};\\n\\n\\n\\n#endif // __cplusplus\\n\\n\\n\\n#include \\\"./Compiler/poppack1.h\\\"\\n\\n\\n\\n#endif // AI_VECTOR2D_H_INC\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/vector2.h\",\n \"rank\": 60,\n \"score\": 162845.94961458148\n },\n {\n \"content\": \"struct aiVector3D {\\n\\n\\n\\n\\tfloat x,y,z;\\n\\n} PACK_STRUCT;\\n\\n\\n\\n#endif // __cplusplus\\n\\n\\n\\n#include \\\"./Compiler/poppack1.h\\\"\\n\\n\\n\\n#ifdef __cplusplus\\n\\n\\n\\n\\n\\n\\n\\n#endif // __cplusplus\\n\\n\\n\\n#endif // AI_VECTOR3D_H_INC\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/vector3.h\",\n \"rank\": 61,\n \"score\": 162845.94961458148\n },\n {\n \"content\": \"struct aiScene;\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/Importer.hpp\",\n \"rank\": 62,\n \"score\": 162845.94961458148\n },\n {\n \"content\": \"struct Asserter\\n\\n{\\n\\n /*! \\\\brief Throws a Exception with the specified message and location.\\n\\n */\\n\\n static void CPPUNIT_API fail( const Message &message, \\n\\n const SourceLine &sourceLine = SourceLine() );\\n\\n\\n\\n /*! \\\\brief Throws a Exception with the specified message and location.\\n\\n * \\\\deprecated Use fail( Message, SourceLine ) instead.\\n\\n */\\n\\n static void CPPUNIT_API fail( std::string message, \\n\\n const SourceLine &sourceLine = SourceLine() );\\n\\n\\n\\n /*! \\\\brief Throws a Exception with the specified message and location.\\n\\n * \\\\param shouldFail if \\\\c true then the exception is thrown. Otherwise\\n\\n * nothing happen.\\n\\n * \\\\param message Message explaining the assertion failiure.\\n\\n * \\\\param sourceLine Location of the assertion.\\n\\n */\\n\\n static void CPPUNIT_API failIf( bool shouldFail, \\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/Asserter.h\",\n \"rank\": 63,\n \"score\": 162845.94961458148\n },\n {\n \"content\": \"struct aiColor4D {\\n\\n\\tfloat r, g, b, a;\\n\\n} PACK_STRUCT;\\n\\n\\n\\n#endif // __cplusplus\\n\\n\\n\\n#include \\\"./Compiler/poppack1.h\\\"\\n\\n\\n\\n#endif // AI_COLOR4D_H_INC\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/color4.h\",\n \"rank\": 64,\n \"score\": 162845.94961458148\n },\n {\n \"content\": \"struct aiMesh;\\n\",\n \"file_path\": \"src/dependencies/assimp/code/LimitBoneWeightsProcess.h\",\n \"rank\": 65,\n \"score\": 160819.39434500068\n },\n {\n \"content\": \"struct ScreenSpaceQuad {\\n\\n\\tvec4f v[4];\\n\\n};\\n\",\n \"file_path\": \"src/rendering/softwareOcclusion/softwareOcclusion.cpp\",\n \"rank\": 66,\n \"score\": 160570.82815262617\n },\n {\n \"content\": \"// importerdesc.h\\n\\nstruct aiImporterDesc;\\n\\n\\n\\n/** @namespace Assimp Assimp's CPP-API and all internal APIs */\\n\\nnamespace Assimp\\t{\\n\\n\\n\\n// ----------------------------------------------------------------------------------\\n\\n/** CPP-API: The Importer class forms an C++ interface to the functionality of the \\n\\n* Open Asset Import Library.\\n\\n*\\n\\n* Create an object of this class and call ReadFile() to import a file. \\n\\n* If the import succeeds, the function returns a pointer to the imported data. \\n\\n* The data remains property of the object, it is intended to be accessed \\n\\n* read-only. The imported data will be destroyed along with the Importer \\n\\n* object. If the import fails, ReadFile() returns a NULL pointer. In this\\n\\n* case you can retrieve a human-readable error description be calling \\n\\n* GetErrorString(). You can call ReadFile() multiple times with a single Importer\\n\\n* instance. Actually, constructing Importer objects involves quite many\\n\\n* allocations and may take some time, so it's better to reuse them as often as\\n\\n* possible.\\n\\n*\\n\\n* If you need the Importer to do custom file handling to access the files,\\n\\n* implement IOSystem and IOStream and supply an instance of your custom \\n\\n* IOSystem implementation by calling SetIOHandler() before calling ReadFile().\\n\\n* If you do not assign a custion IO handler, a default handler using the \\n\\n* standard C++ IO logic will be used.\\n\\n*\\n\\n* @note One Importer instance is not thread-safe. If you use multiple\\n\\n* threads for loading, each thread should maintain its own Importer instance.\\n\\n*/\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/Importer.hpp\",\n \"rank\": 67,\n \"score\": 160529.97114711054\n },\n {\n \"content\": \"struct auto_any_base\\n\\n{\\n\\n operator bool() const { return false; }\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\",\n \"file_path\": \"src/dependencies/assimp/code/BoostWorkaround/boost/foreach.hpp\",\n \"rank\": 68,\n \"score\": 158596.63404461573\n },\n {\n \"content\": \"struct FontParser : core::text::Tokenizer {\\n\\n\\tstruct Common {\\n\\n\\t\\tint lineHeight,base,width,height,pages,packed;\\n\\n\\t\\tint redChannel,greenChannel,blueChannel,alphaChannel;\\n\\n\\t};\\n\\n\\tstruct Char {\\n\\n\\t\\tint id;\\n\\n\\t\\tint x,y,width,height;\\n\\n\\t\\tint xoffset,yoffset;\\n\\n\\t\\tint xadvance;\\n\\n\\t\\tint page;\\n\\n\\t\\tint channel;\\n\\n\\t};\\n\\n\\n\\n\\tReader* reader;\\n\\n\\tFont& font;\\n\\n\\tCommon common;\\n\\n\\tint prevCharId;\\n\\n\\n\\n\\tvoid wildcard(){\\n\",\n \"file_path\": \"src/data/intermediate/font/reader.cpp\",\n \"rank\": 69,\n \"score\": 158445.8958615713\n },\n {\n \"content\": \"struct LogStreamInfo;\\n\\n\\n\\n/** default name of logfile */\\n\\n#define ASSIMP_DEFAULT_LOG_NAME \\\"AssimpLog.txt\\\"\\n\\n\\n\\n// ------------------------------------------------------------------------------------\\n\\n/** @brief CPP-API: Primary logging facility of Assimp. \\n\\n *\\n\\n * The library stores its primary #Logger as a static member of this class.\\n\\n * #get() returns this primary logger. By default the underlying implementation is\\n\\n * just a #NullLogger which rejects all log messages. By calling #create(), logging\\n\\n * is turned on. To capture the log output multiple log streams (#LogStream) can be\\n\\n * attach to the logger. Some default streams for common streaming locations (such as\\n\\n * a file, std::cout, OutputDebugString()) are also provided.\\n\\n * \\n\\n * If you wish to customize the logging at an even deeper level supply your own\\n\\n * implementation of #Logger to #set().\\n\\n * @note The whole logging stuff causes a small extra overhead for all imports. */\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/DefaultLogger.hpp\",\n \"rank\": 70,\n \"score\": 158304.85232153072\n },\n {\n \"content\": \"struct ExceptionSwallower<aiReturn>\\t{\\n\\n\\taiReturn operator ()() const {\\n\\n\\t\\ttry {\\n\\n\\t\\t\\tthrow;\\n\\n\\t\\t}\\n\\n\\t\\tcatch (std::bad_alloc&) {\\n\\n\\t\\t\\treturn aiReturn_OUTOFMEMORY;\\n\\n\\t\\t}\\n\\n\\t\\tcatch (...) {\\n\\n\\t\\t\\treturn aiReturn_FAILURE;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n};\\n\\n\\n\\n// ---------------------------------------------------------------------------\\n\\ntemplate <>\\n\",\n \"file_path\": \"src/dependencies/assimp/code/Exceptional.h\",\n \"rank\": 71,\n \"score\": 157013.08573015608\n },\n {\n \"content\": \"struct ExpectedExceptionTraits\\n\\n{\\n\\n static void expectedException()\\n\\n {\\n\\n#if CPPUNIT_USE_TYPEINFO_NAME\\n\\n throw Exception( Message(\\n\\n \\\"expected exception not thrown\\\",\\n\\n \\\"Expected exception type: \\\" + \\n\\n TypeInfoHelper::getClassName( typeid( ExceptionType ) ) ) );\\n\\n#else\\n\\n throw Exception( \\\"expected exception not thrown\\\" );\\n\\n#endif\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n/*! \\\\brief (Implementation) Traits specialization used by TestCaller to \\n\\n * expect no exception.\\n\\n *\\n\\n * This class is an implementation detail. You should never use this class directly.\\n\\n */\\n\\ntemplate<>\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/TestCaller.h\",\n \"rank\": 72,\n \"score\": 156165.34914346485\n },\n {\n \"content\": \"// ------------------------------------------------------------------------------------------------\\n\\n// BatchLoader::pimpl data structure\\n\\nstruct Assimp::BatchData\\n\\n{\\n\\n\\tBatchData()\\n\\n\\t\\t:\\tnext_id(0xffff)\\n\\n\\t{}\\n\\n\\n\\n\\t// IO system to be used for all imports\\n\\n\\tIOSystem* pIOSystem;\\n\\n\\n\\n\\t// Importer used to load all meshes\\n\\n\\tImporter* pImporter;\\n\\n\\n\\n\\t// List of all imports\\n\\n\\tstd::list<LoadRequest> requests;\\n\\n\\n\\n\\t// Base path\\n\\n\\tstd::string pathBase;\\n\\n\\n\\n\\t// Id for next item\\n\\n\\tunsigned int next_id;\\n\",\n \"file_path\": \"src/dependencies/assimp/code/BaseImporter.cpp\",\n \"rank\": 73,\n \"score\": 154694.80721160557\n },\n {\n \"content\": \"struct Vertex // 32 byte\\n\\n{\\n\\n\\tVec3D pos;\\n\\n\\tuint8 boneWeight[4];\\n\\n\\tuint8 boneIndex[4];\\n\\n\\tuint8 normal[4]; //normal_x = (float)normal[0]/255.0f...\\n\\n\\tint16 uv[2];\\n\\n\\tuint8 tangent[4];\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/code/M3Importer.h\",\n \"rank\": 74,\n \"score\": 154673.2169321969\n },\n {\n \"content\": \"struct VertexExt // 36 byte\\n\\n{\\n\\n\\tVec3D pos;\\n\\n\\tuint8 boneWeight[ 4 ];\\n\\n\\tuint8 boneIndex[ 4 ];\\n\\n\\tuint8 normal[ 4 ]; //normal_x = (float)normal[0]/255.0f...\\n\\n\\tint16 uv[ 2 ];\\n\\n\\tuint32 d1;\\n\\n\\tuint8 tangent[ 4 ];\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/code/M3Importer.h\",\n \"rank\": 75,\n \"score\": 152255.04571898462\n },\n {\n \"content\": \"Open Asset Import Library (assimp)\\n\\n----------------------------------------------------------------------\\n\\n\\n\\nCopyright (c) 2006-2012, assimp team\\n\\nAll rights reserved.\\n\\n\\n\\nRedistribution and use of this software in source and binary forms, \\n\\nwith or without modification, are permitted provided that the \\n\\nfollowing conditions are met:\\n\\n\\n\\n* Redistributions of source code must retain the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer.\\n\\n\\n\\n* Redistributions in binary form must reproduce the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer in the documentation and/or other\\n\\n materials provided with the distribution.\\n\\n\\n\\n* Neither the name of the assimp team, nor the names of its\\n\",\n \"file_path\": \"src/dependencies/assimp/code/Vertex.h\",\n \"rank\": 76,\n \"score\": 148554.26033793742\n },\n {\n \"content\": \"Open Asset Import Library (assimp)\\n\\n----------------------------------------------------------------------\\n\\n\\n\\nCopyright (c) 2006-2012, assimp team\\n\\nAll rights reserved.\\n\\n\\n\\nRedistribution and use of this software in source and binary forms, \\n\\nwith or without modification, are permitted provided that the \\n\\nfollowing conditions are met:\\n\\n\\n\\n* Redistributions of source code must retain the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer.\\n\\n\\n\\n* Redistributions in binary form must reproduce the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer in the documentation and/or other\\n\\n materials provided with the distribution.\\n\\n\\n\\n* Neither the name of the assimp team, nor the names of its\\n\",\n \"file_path\": \"src/dependencies/assimp/code/PretransformVertices.h\",\n \"rank\": 77,\n \"score\": 146228.2868903945\n },\n {\n \"content\": \"Open Asset Import Library (assimp)\\n\\n----------------------------------------------------------------------\\n\\n\\n\\nCopyright (c) 2006-2012, assimp team\\n\\nAll rights reserved.\\n\\n\\n\\nRedistribution and use of this software in source and binary forms, \\n\\nwith or without modification, are permitted provided that the \\n\\nfollowing conditions are met:\\n\\n\\n\\n* Redistributions of source code must retain the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer.\\n\\n\\n\\n* Redistributions in binary form must reproduce the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer in the documentation and/or other\\n\\n materials provided with the distribution.\\n\\n\\n\\n* Neither the name of the assimp team, nor the names of its\\n\",\n \"file_path\": \"src/dependencies/assimp/code/TextureTransform.h\",\n \"rank\": 78,\n \"score\": 146226.4610574569\n },\n {\n \"content\": \"struct ExpectedExceptionTraits<NoExceptionExpected>\\n\\n{\\n\\n static void expectedException()\\n\\n {\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n#endif\\n\\n\\n\\n//*** FIXME: rework this when class Fixture is implemented. ***//\\n\\n\\n\\n\\n\\n/*! \\\\brief Generate a test case from a fixture method.\\n\\n * \\\\ingroup WritingTestFixture\\n\\n *\\n\\n * A test caller provides access to a test case method \\n\\n * on a test fixture class. Test callers are useful when \\n\\n * you want to run an individual test or add it to a \\n\\n * suite.\\n\",\n \"file_path\": \"src/dependencies/assimp/contrib/cppunit-1.12.1/include/cppunit/TestCaller.h\",\n \"rank\": 79,\n \"score\": 145985.1639417485\n },\n {\n \"content\": \"Open Asset Import Library (assimp)\\n\\n----------------------------------------------------------------------\\n\\n\\n\\nCopyright (c) 2006-2012, assimp team\\n\\nAll rights reserved.\\n\\n\\n\\nRedistribution and use of this software in source and binary forms, \\n\\nwith or without modification, are permitted provided that the \\n\\nfollowing conditions are met:\\n\\n\\n\\n* Redistributions of source code must retain the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer.\\n\\n\\n\\n* Redistributions in binary form must reproduce the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer in the documentation and/or other\\n\\n materials provided with the distribution.\\n\\n\\n\\n* Neither the name of the assimp team, nor the names of its\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/quaternion.h\",\n \"rank\": 80,\n \"score\": 145966.6438157566\n },\n {\n \"content\": \"---------------------------------------------------------------------------\\n\\nOpen Asset Import Library (assimp)\\n\\n---------------------------------------------------------------------------\\n\\n\\n\\nCopyright (c) 2006-2012, assimp team\\n\\n\\n\\nAll rights reserved.\\n\\n\\n\\nRedistribution and use of this software in source and binary forms, \\n\\nwith or without modification, are permitted provided that the following \\n\\nconditions are met:\\n\\n\\n\\n* Redistributions of source code must retain the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer.\\n\\n\\n\\n* Redistributions in binary form must reproduce the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer in the documentation and/or other\\n\\n materials provided with the distribution.\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/vector2.h\",\n \"rank\": 81,\n \"score\": 145966.6438157566\n },\n {\n \"content\": \"---------------------------------------------------------------------------\\n\\nOpen Asset Import Library (assimp)\\n\\n---------------------------------------------------------------------------\\n\\n\\n\\nCopyright (c) 2006-2012, assimp team\\n\\n\\n\\nAll rights reserved.\\n\\n\\n\\nRedistribution and use of this software in source and binary forms, \\n\\nwith or without modification, are permitted provided that the following \\n\\nconditions are met:\\n\\n\\n\\n* Redistributions of source code must retain the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer.\\n\\n\\n\\n* Redistributions in binary form must reproduce the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer in the documentation and/or other\\n\\n materials provided with the distribution.\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/color4.h\",\n \"rank\": 82,\n \"score\": 145966.6438157566\n },\n {\n \"content\": \"\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/matrix4x4.h\",\n \"rank\": 83,\n \"score\": 145966.6438157566\n },\n {\n \"content\": \"---------------------------------------------------------------------------\\n\\nOpen Asset Import Library (assimp)\\n\\n---------------------------------------------------------------------------\\n\\n\\n\\nCopyright (c) 2006-2012, assimp team\\n\\n\\n\\nAll rights reserved.\\n\\n\\n\\nRedistribution and use of this software in source and binary forms, \\n\\nwith or without modification, are permitted provided that the following \\n\\nconditions are met:\\n\\n\\n\\n* Redistributions of source code must retain the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer.\\n\\n\\n\\n* Redistributions in binary form must reproduce the above\\n\\n copyright notice, this list of conditions and the\\n\\n following disclaimer in the documentation and/or other\\n\\n materials provided with the distribution.\\n\\n\\n\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/vector3.h\",\n \"rank\": 84,\n \"score\": 145966.6438157566\n },\n {\n \"content\": \"\",\n \"file_path\": \"src/dependencies/assimp/include/assimp/matrix3x3.h\",\n \"rank\": 85,\n \"score\": 145966.6438157566\n },\n {\n \"content\": \"\\tService();\\n\\n\\t~Service();\\n\\nprivate:\\n\\n\\tuint32 cloneBatch(uint32 id,uint32 layerId,uint32 textureId);\\n\\n\\tbool loadCorePipeline(int id,const char* name);\\n\\n\\n\\n\\tuint32 registerFontBatch(const data::Font* font);\\n\\n\\tcore::BufferAllocator batches_;\\n\\n\\tcore::BufferAllocator fontBatches_;\\n\\n\\n\\n\\tenum {\\n\\n\\t\\tkMaxGeometries = 3\\n\\n\\t};\\n\\n\\tstruct Mesh {\\n\\n\\t\\tuint32 vertexSize;\\n\\n\\t\\trendering::Buffer vbo;\\n\\n\\t\\trendering::Buffer ibo;\\n\\n\\t\\trendering::Mesh mesh;\\n\\n\\t};\\n\\n\\tMesh meshes_[kMaxGeometries];\\n\",\n \"file_path\": \"src/rendering/ui.h\",\n \"rank\": 88,\n \"score\": 78.78206597987672\n },\n {\n \"content\": \"\\t\\t//Create a new batch for this texture.\\n\\n\\t\\trendering::ui::Batch batch;\\n\\n\\t\\tbatch.depth = 0;\\n\\n\\t\\tbatch.name = \\\"TextureView\\\";\\n\\n\\t\\tauto pipelineId = ev.renderer->uiPipeline(pipeline_);\\n\\n\\t\\tbatchId = ev.renderer->registerBatch(batch,pipelineId);\\n\\n\\t}\\n\\n\\tauto geometry = ev.renderer->allocate(ev.layerId,batchId,ev.renderer->uiTexture(texture_),4,6);\\n\\n\\trendering::draw2D::positionInt16::textured::coloured::quad(geometry,ev.position,ev.position + ev.size,defaultTextureCoords,color_);\\t\\n\\n}\\n\\n\\n\\nRectangle::Rectangle(uint32 colour){\\n\\n\\tcolors_[0] = colors_[1] = colors_[2] = colors_[3] = colour;\\n\\n\\tcheckOpaque(colour);\\n\\n}\\n\\nvoid Rectangle::makeFlat(uint32 colour) {\\n\\n\\tcolors_[0] = colors_[1] = colors_[2] = colors_[3] = colour;\\n\\n\\tcheckOpaque(colour);\\n\\n}\\n\\nvoid Rectangle::makeTopDownGradient(uint32 topColour,uint32 bottomColour){\\n\",\n \"file_path\": \"src/ui/components.cpp\",\n \"rank\": 91,\n \"score\": 69.18575831451984\n },\n {\n \"content\": \"\\trendering::Pipeline::GLSLLayout glslLayout;\\n\\n\\tchar attributeBufferStorage[2048];\\n\\n\\tcore::BufferAllocator attributeBuffer(core::Bytes(attributeBufferStorage,sizeof(attributeBufferStorage)),core::BufferAllocator::GrowOnOverflow);\\n\\n\\tuint32 attributeBufferOffset = 0;\\n\\n\\tif(vertexAttributeCount){\\n\\n\\t\\tglslLayout.vertexAttributes = (const char**) attributeBuffer.allocate(vertexAttributeCount * sizeof(char*),alignof(char*));\\n\\n\\t\\tglslLayout.vertexAttributeCount = vertexAttributeCount;\\n\\n\\t\\tfor(uint32 i = 0;i< vertexAttributeCount;++i){\\n\\n\\t\\t\\tauto dest = (char*)attributeBuffer.allocate(vertexAttributes[i].length()+1,0);\\n\\n\\t\\t\\tmemcpy(dest,vertexAttributes[i].begin,vertexAttributes[i].length());\\n\\n\\t\\t\\tdest[vertexAttributes[i].length()] = '\\\\0';\\n\\n\\t\\t\\tglslLayout.vertexAttributes[i] = dest;\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tauto pipeline = rendering->create(shaders,shaderCount,glslLayout);\\n\\n#else\\n\\n\\tauto pipeline = rendering->create(shaders,shaderCount);\\n\\n#endif\\n\\n\\n\\n\\tauto obj = parser->service->newPipeline();\\n\\n\\tnew(obj) ::data::Pipeline(pipeline);\\n\\n\\tparser->service->mapPointerToID(parser->bundle,obj,id);\\n\\n\\tparser->service->registerPipeline(pipeline);\\n\\n}\\n\\n\\n\\n//\\n\\n\\n\",\n \"file_path\": \"src/data/intermediate/bundle/parser.cpp\",\n \"rank\": 97,\n \"score\": 63.59396663842986\n },\n {\n \"content\": \"\\t\\t\\tservice->mapPointerToID(bundle,destMesh,self->id);\\n\\n\\t\\t}\\n\\n\\t\\tvoid Reader::processMaterial(const char* name,const char** textures,size_t textureCount) {\\n\\n\\t\\t\\tcore::bufferStringStream::Formatter fmt;\\n\\n\\t\\t\\tif(!name || !strlen(name)) {\\n\\n\\t\\t\\t\\tusing namespace core::bufferStringStream;\\n\\n\\t\\t\\t\\tname = asCString(fmt.allocator<<self->id<<\\\".material.\\\"<<materialId);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tauto destMaterial = service->allocateObject<::data::Material>();\\n\\n\\t\\t\\trendering::Texture2D ts[::data::Material::kMaxTextures];\\n\\n\\t\\t\\tfor(size_t i = 0;i<textureCount;++i){\\n\\n\\t\\t\\t\\tTexture texture;\\n\\n\\t\\t\\t\\ttexture.parser = parser;\\n\\n\\t\\t\\t\\ttexture.id = core::Bytes(nullptr,nullptr);\\n\\n\\t\\t\\t\\ttexture.mipmapping = true;\\n\\n\\t\\t\\t\\ttexture.path = core::Bytes((void*)textures[i],strlen(textures[i]));\\n\\n\\t\\t\\t\\ttexture.end();\\n\\n\\t\\t\\t\\tts[i] = texture.result;\\n\\n\\t\\t\\t}\\n\",\n \"file_path\": \"src/data/intermediate/bundle/parser.cpp\",\n \"rank\": 99,\n \"score\": 58.4321715741477\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":2,"numItemsPerPage":100,"numTotalItems":13489,"offset":200,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTE4MTQ2Miwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3NzkxODUwNjIsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.P1GX6JQtVi9haCHLueIIgeZSShvQZAQUSytxcnD0cDrLiBi7QFvrGwyXOfTt7lLWVi83neWNcrK2cCgBfQAVBg","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/devices/bin/driver_host/driver_host_context.cc | casey/fuchsia | 2b965e9a1e8f2ea346db540f3611a5be16bb4d6b |
#include "driver_host_context.h"
#include <stdio.h>
#include <fbl/auto_lock.h>
#include <fs/vfs.h>
#include "log.h"
void DriverHostContext::PushWorkItem(const fbl::RefPtr<zx_device_t>& dev, Callback callback) {
auto work_item = std::make_unique<WorkItem>(dev, std::move(callback));
fbl::AutoLock al(&lock_);
... |
#include "driver_host_context.h"
#include <stdio.h>
#include <fbl/auto_lock.h>
#include <fs/vfs.h>
| nst zx_packet_signal_t* signal) {
if (status != ZX_OK) {
log(ERROR, "driver_host: event waiter error: %d\n", status);
return;
}
if (signal->observed & ZX_USER_SIGNAL_0) {
event_waiter->InvokeCallback();
BeginWait(std::move(event_waiter), dispatcher);
} else {
printf("%s: invalid signals %x\... | #include "log.h"
void DriverHostContext::PushWorkItem(const fbl::RefPtr<zx_device_t>& dev, Callback callback) {
auto work_item = std::make_unique<WorkItem>(dev, std::move(callback));
fbl::AutoLock al(&lock_);
work_items_.push_back(std::move(work_item));
if (!event_waiter_->signaled()) {
event_waite... | random | [] |
C++ | src/render/MCPT_EL.cc | ppwwyyxx/Ray-Tracing-Engine | af3ec164d6b5e5b592a54a75282432d610423ffb |
#include "render/MCPT_EL.hh"
using namespace std;
Color MCPT_EL::do_trace(const Ray& ray, int depth, int use_emission) const {
if (depth > max_depth) return Color::BLACK;
m_assert(fabs(ray.dir.sqr() - 1) < EPS);
auto first_trace = find_first(ray, true);
if (!first_trace) return Color::BLACK;
Vec norm = firs... |
#include "render/MCPT_EL.hh"
using namespace std;
Color MCPT_EL::do_trace(const Ray& ray, int depth, int use_emission) const {
if (depth > max_depth) return Color::BLACK;
m_assert(fabs(ray.dir.sqr() - 1) < EPS);
auto first_trace = find_first(ray, true);
if (!first_trace) return Color::BLACK;
Vec norm = firs... |
}
real_t r1 = 2 * M_PI * drand48(),
r2 = drand48(),
r2s = sqrt(r2);
Vec u = ((fabs(norm.x) > 0.1 ? Vec(0, 1, 0) : Vec(1, 0, 0)).cross(norm)).get_normalized(),
v = norm.cross(u);
Vec d = ((u * cos(r1)) * r2s + v * sin(r1) * r2s + norm * (sqrt(1 - r2))).get_normalized();
real_t diffuse_weight =... | if (drand48() < max_color_comp)
diffu = diffu * (1.0 / max_color_comp);
else
return surf->emission * use_emission; | if_condition | [
{
"content": "class Color {\n\n\tpublic:\n\n\t\treal_t r = 0, g = 0, b = 0;\n\n\n\n\t\tColor():\n\n\t\t\tColor(EPS, EPS, EPS) { }\n\n\n\n\t\texplicit Color(real_t _r, real_t _g, real_t _b):\n\n\t\t\tr(_r), g(_g), b(_b) {}\n\n\n\n\t\texplicit Color(const Vec& v):\n\n\t\t\tr(v.x), g(v.y), b(v.z) {}\n\n\n\n\t\tsta... |
C++ | src/xcorr_engine.cpp | dev0x13/ust_x | d030ee40462933b645cee417856306f62cf37a28 | #include <xcorr_engine.h>
#include <XCorr.h>
#include <HilbertTransformer.h>
#include <algorithm>
static const size_t defects = 14;
UST::XCorrEngine::XCorrEngine(size_t window_size_axial_, size_t window_size_lateral_, size_t size1_, size_t size2_) :
window_size_axial(window_size_axial_),
window_size_lateral... | #include <xcorr_engine.h>
#include <XCorr.h>
#include <HilbertTransformer.h>
#include <algorithm>
static const size_t defects = 14;
UST::XCorrEngine::XCorrEngine(size_t window_size_axial_, size_t window_size_lateral_, size_t size1_, size_t size2_) :
window_size_axial(window_size_axial_),
window_size_lateral... |
void UST::XCorrEngine::calcShift(
short **sig1,
short **sig2,
double **out)
{
this->out = out;
this->tp.startTaskBlock(numThreads);
for (size_t i = 0; i < numThreads; ++i) {
auto begin = i * pieceSize,
end = begin + pieceSize;
this->tp.runTask(&UST::XCorrEngine::hilbertTask, this, ... | for (long j = (long)n - window_size_by_2_lateral; j < (long)n + window_size_by_2_lateral; ++j) {
for (long k = (long)m - window_size_by_2_axial; k < (long)m + window_size_by_2_axial; ++k) {
auto realJ = std::min((long)size1 - 1, std::max(j, (long)0));
auto realK = std::min((long)size2 - 1, s... | function_block-function_prefix_line | [
{
"content": "struct static_const\n\n{\n\n static constexpr T value{};\n\n};\n\n\n\ntemplate<typename T>\n\nconstexpr T static_const<T>::value;\n\n} // namespace detail\n\n} // namespace nlohmann\n\n\n\n// #include <nlohmann/detail/meta/type_traits.hpp>\n\n\n\n\n\n#include <limits> // numeric_limits\n\n#in... |
C++ | centreon-engine/test/commands/raw_run_async.cc | centreon/centreon-collect | e63fc4d888a120d588a93169e7d36b360616bdee |
#include <cstdlib>
#include <cstring>
#include <exception>
#include "com/centreon/engine/commands/raw.hh"
#include "com/centreon/engine/commands/set.hh"
#include "com/centreon/engine/exceptions/error.hh"
#include "com/centreon/engine/globals.hh"
#include "com/centreon/process.hh"
#include "test/commands/wait_process.... |
#include <cstdlib>
#include <cstring>
#include <exception>
#include "com/centreon/engine/commands/raw.hh"
#include "com/centreon/engine/commands/set.hh"
#include "com/centreon/engine/exceptions/error.hh"
#include "com/centreon/engine/globals.hh"
#include "com/centreon/process.hh"
#include "test/commands/wait_process.... | d::shared_ptr<raw> cmd(
new raw(__func__, "\"./bin_test_run\" \"--timeout\"=\"off\""));
wait_process wait_proc(cmd.get());
set::instance().add_command(cmd);
nagios_macros mac;
unsigned long id(cmd->run(cmd->get_command_line(), mac, 0));
wait_proc.wait();
result const& res = wait_proc.get_resul... | ble_environment_macros(true);
nagios_macros mac;
char const* argv = "default_arg";
mac.argv[0] = new char[strlen(argv) + 1];
strcpy(mac.argv[0], argv);
std::shared_ptr<raw> cmd(new raw(__func__, "./bin_test_run --check_macros"));
wait_process wait_proc(cmd.get());
set::instance().add_command(cmd);... | random | [
{
"content": "class timeout : public std::exception {\n\n public:\n\n timeout() noexcept : std::exception() {}\n\n timeout& operator=(const timeout&) = delete;\n\n};\n\n} // namespace exceptions\n\n\n\nCCB_END()\n\n\n\n#endif // !CCB_EXCEPTIONS_TIMEOUT_HH\n",
"file_path": "centreon-broker/core/inc/com/c... |
C++ | core/indigo-core/molecule/src/molecule_inchi_utils.cpp | khyurri/Indigo | 82f9ef9f43ca605f7265709e7a9256f1ff468d6c |
#include "molecule/molecule_inchi_utils.h"
#include "base_cpp/os_sync_wrapper.h"
#include "molecule/elements.h"
#include "molecule/molecule.h"
#include "molecule/molecule_cis_trans.h"
using namespace indigo;
Array<int> MoleculeInChIUtils::_atom_lables_sorted;
Array<int> MoleculeInChIUtils::_atom_lables_ranks;
IMP... |
#include "molecule/molecule_inchi_utils.h"
#include "base_cpp/os_sync_wrapper.h"
#include "molecule/elements.h"
#include "molecule/molecule.h"
#include "molecule/molecule_cis_trans.h"
using namespace indigo;
Array<int> MoleculeInChIUtils::_atom_lables_sorted;
Array<int> MoleculeInChIUtils::_atom_lables_ranks;
IMP... | _initializeAtomLabels();
}
}
void MoleculeInChIUtils::_initializeAtomLabels()
{
_atom_lables_sorted.reserve(ELEM_MAX);
for (int i = ELEM_MIN; i < ELEM_MAX; i++)
_atom_lables_sorted.push(i);
_atom_lables_sorted.qsort(_compareAtomLabels, NULL);
_atom_lables_ranks.resize(ELEM_MAX);
_a... | eLabelsInitialized()
{
if (_atom_lables_sorted.size() == 0)
{
static ThreadSafeStaticObj<OsLock> lock;
OsLocker locker(lock.ref());
if (_atom_lables_sorted.size() == 0)
| function_block-random_span | [
{
"content": " final Indigo indigo;\n",
"file_path": "api/java/indigo-inchi/src/main/java/com/epam/indigo/IndigoInchi.java",
"rank": 0,
"score": 207685.95766331634
},
{
"content": "char *inchi__strnset( char *s, int val, size_t length )\n\n{\n\n char *ps = s;\n\n while (length-- && ... |
C++ | libcore/include/sirikata/core/trace/Trace.hpp | sirikata/sirikata | 3a0d54a8c4778ad6e25ef031d461b2bc3e264860 |
#ifndef _SIRIKATA_CORE_TRACE_HPP_
#define _SIRIKATA_CORE_TRACE_HPP_
#include <sirikata/core/util/Platform.hpp>
#include <sirikata/core/util/Thread.hpp>
#include <sirikata/core/util/AtomicTypes.hpp>
#include <sirikata/core/network/ObjectMessage.hpp>
#include <sirikata/core/trace/BatchedBuffer.hpp>
namespace Sirikata... |
#ifndef _SIRIKATA_CORE_TRACE_HPP_
#define _SIRIKATA_CORE_TRACE_HPP_
#include <sirikata/core/util/Platform.hpp>
#include <sirikata/core/util/Thread.hpp>
#include <sirikata/core/util/AtomicTypes.hpp>
#include <sirikata/core/network/ObjectMessage.hpp>
#include <sirikata/core/trace/BatchedBuffer.hpp>
namespace Sirikata... | ObjectMessagePort optionalMessageDestPort=0);
CREATE_TRACE_DECL(timestampMessage, const Time&t, uint64 packetId, MessagePath path);
void writeRecord(uint16 type_hint, BatchedBuffer::IOVec* data, uint32 iovcnt);
template<typename T>
void writeRecord(uint16 type_hint, const T& pl) {
i... | DROPPED_DURING_FORWARDING_ROUTING,
DROPPED_AT_SPACE_ENQUEUED,
DROPPED_CSFQ_OVERFLOW,
DROPPED_CSFQ_PROBABILISTIC,
NUM_DROPS
};
uint64 d[NUM_DROPS];
const char*n[NUM_DROPS];
Drops() {
memset(d,0,NUM_DROPS*sizeof(uint64));
memset(n,0,NUM_DROPS*sizeof(cons... | random | [
{
"content": "struct Batch {\n\n static const uint16 max_size = 65535;\n\n uint16 size;\n\n T items[max_size];\n\n\n\n Batch() : size(0) {}\n\n\n\n bool full() const {\n\n return (size >= max_size);\n\n }\n\n\n\n uint32 avail() const {\n\n return max_size - size;\n\n }\n\n}... |
C++ | source/MaterialXContrib/MaterialXMaya/ShadingNodeOverrides.cpp | muenstc/MaterialX | b8365086a738fddae683065d78f65410aacd0dc4 | #include "ShadingNodeOverrides.h"
#include "MaterialXNode.h"
#include "Plugin.h"
#include "MaterialXUtil.h"
#include "MayaUtil.h"
#include <maya/MDGModifier.h>
#include <maya/MGlobal.h>
#include <maya/MShaderManager.h>
#include <maya/MPxShadingNodeOverride.h>
#include <maya/MPxSurfaceShadingNodeOverride.h>
#include <... | #include "ShadingNodeOverrides.h"
#include "MaterialXNode.h"
#include "Plugin.h"
#include "MaterialXUtil.h"
#include "MayaUtil.h"
#include <maya/MDGModifier.h>
#include <maya/MGlobal.h>
#include <maya/MShaderManager.h>
#include <maya/MPxShadingNodeOverride.h>
#include <maya/MPxSurfaceShadingNodeOverride.h>
#include <... |
template class ShadingNodeOverride<MHWRender::MPxShadingNodeOverride>;
template class ShadingNodeOverride<MHWRender::MPxSurfaceShadingNodeOverride>;
MHWRender::MPxSurfaceShadingNodeOverride* SurfaceOverride::creator(const MObject& obj)
{
std::cout.rdbuf(std::cerr.rdbuf());
return new SurfaceOverride(obj);
}
... | xWrap;
if (samplingProperties.vaddressMode != mx::ImageSamplingProperties::AddressMode::UNSPECIFIED)
{
samplerDescription.addressV = addressModes[static_cast<int>(samplingProperties.vaddressMode)];
}
samplerDescripti... | function_block-function_prefixed | [
{
"content": "/// @class FileSearchPath\n\n/// A sequence of file paths, which may be queried to find the first instance\n\n/// of a given filename on the file system.\n\nclass MX_FORMAT_API FileSearchPath\n\n{\n\n public:\n\n using Iterator = FilePathVec::iterator;\n\n using ConstIterator = FilePathVec:... |
C++ | tutorials/Embedding/word2vec.hpp | ChanhyoLee/TextDataset | 397571f476a89ad42ef3ed77b82c76fc19ac3e33 | #include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <ctime>
#include <cstdlib>
#include "../../WICWIU_src/Tensor.hpp"
#include "../../WICWIU_src/DataLoader.hpp"
#define NUMOFWORD 71291 //text8에서 단어의 개수!
using namespace std;
enum OPTION {
TESTING,
TR... | #include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <ctime>
#include <cstdlib>
#include "../../WICWIU_src/Tensor.hpp"
#include "../../WICWIU_src/DataLoader.hpp"
#define NUMOFWORD 71291 //text8에서 단어의 개수!
using namespace std;
enum OPTION {
TESTING,
TR... |
template<typename DTYPE> std::vector<Tensor<DTYPE> *> *TextDataSet<DTYPE>::GetData(int idx) {
std::vector<Tensor<DTYPE> *> *result = new std::vector<Tensor<DTYPE> *>(0, NULL);
Tensor<DTYPE> *image = Tensor<DTYPE>::Zeros(1, 1, 1, 1, m_dimOfInput);
Tensor<DTYPE> *label = Tensor<DTYPE>::Zeros(1,... | i]) {
delete[] m_aaLabel[i];
m_aaLabel[i] = NULL;
}
}
delete m_aaLabel;
m_aaLabel = NULL;
}
} | function_block-function_prefixed | [
{
"content": "class NEG : public LossFunction<DTYPE>{\n\nprivate:\n\n DTYPE m_epsilon = 1e-6f; // for backprop\n\n\n\npublic:\n\n\n\n NEG(Operator<DTYPE> *pOperator, Operator<DTYPE> *pLabel, int epsilon = 1e-6f) : LossFunction<DTYPE>(pOperator, pLabel) {\n\n #ifdef __DEBUG__\n\n std::cout <... |
C++ | include/GafferBindings/SignalBinding.inl | ddesmond/gaffer | 4f25df88103b7893df75865ea919fb035f92bac0 |
#ifndef GAFFERBINDINGS_SIGNALBINDING_INL
#define GAFFERBINDINGS_SIGNALBINDING_INL
#include "IECorePython/ExceptionAlgo.h"
#include "IECorePython/ScopedGILLock.h"
#include "IECorePython/ScopedGILRelease.h"
#include "boost/signals.hpp"
#include "boost/version.hpp"
namespace GafferBindings
{
namespace Detail
{
temp... |
#ifndef GAFFERBINDINGS_SIGNALBINDING_INL
#define GAFFERBINDINGS_SIGNALBINDING_INL
#include "IECorePython/ExceptionAlgo.h"
#include "IECorePython/ScopedGILLock.h"
#include "IECorePython/ScopedGILRelease.h"
#include "boost/signals.hpp"
#include "boost/version.hpp"
namespace GafferBindings
{
namespace Detail
{
temp... |
GAFFERBINDINGS_API boost::python::object pythonConnection( const boost::signals::connection &connection, bool scoped );
template<typename Signal, typename SlotCaller>
boost::python::object connect( Signal &s, boost::python::object &slot, bool scoped )
{
return pythonConnection( s.connect( Slot<Signal, SlotCaller>( ... | t(), weakMethod.ptr() ) )
{
boost::python::object self = boost::python::object( slot.m_slot ).attr( "instance" )();
boost::python::extract<Trackable &> e( self );
if( e.check() )
{
boost::visit_each( visitor, e(), 0 );
}
}
} | function_block-function_prefixed | [] |
C++ | Sandbox2D/src/2dapp.cpp | dovker/Rosewood | 5131a061632732222ce68e5da5a257b8bda36ea5 | #include "Rosewood.h"
#include "Rosewood/Core/EntryPoint.h"
#include "imgui.h"
#include "Sofa.h"
#include "2DCameraController.h"
const std::string Rosewood::FileSystem::ProjectRoot = "../../../Sandbox2D/";
class ExampleLayer : public Rosewood::Layer
{
public:
unsigned int scrWidth = Rosewood::Application::Get().GetW... | #include "Rosewood.h"
#include "Rosewood/Core/EntryPoint.h"
#include "imgui.h"
#include "Sofa.h"
#include "2DCameraController.h"
const std::string Rosewood::FileSystem::ProjectRoot = "../../../Sandbox2D/";
class ExampleLayer : public Rosewood::Layer
{
public:
unsigned int scrWidth = Rosewood::Application::Get().GetW... |
bool OnKeyReleasedEvent(Rosewood::KeyReleasedEvent& e)
{
return false;
}
bool OnWindowResizeEvent(Rosewood::WindowResizeEvent& e)
{
scrWidth = e.GetWidth();
scrHeight = e.GetHeight();
camera.ProcessScreenResize(glm::vec2(scrWidth, scrHeight));
Rosewood::GraphicsCommand::SetViewport(0, 0, scrWidt... | n::Get().GetWindow().LockCursor();
else if (key == KEY_T)
Rosewood::Application::Get().GetWindow().UnlockCursor();
else if (key == KEY_F)
sound->Play();
return false;
} | function_block-function_prefixed | [
{
"content": "\tclass KeyEvent : public Event\n\n\t{\n\n\tpublic:\n\n\t\tinline int GetKeyCode() const { return m_KeyCode; }\n\n\n\n\t\tEVENT_CLASS_CATEGORY(EventCategoryKeyboard | EventCategoryInput)\n\n\tprotected:\n\n\t\tKeyEvent(int keycode)\n\n\t\t\t: m_KeyCode(keycode) {}\n\n\n\n\t\tint m_KeyCode;\n\n\t};... |
C++ | eip_device/src/eip_device_node.cpp | wpmccormick/eip_device | 808628a7ede642eead1ed9b81db34c0c73ff8b5c | #include <stdio.h>
#include <stdlib.h>
#include <signal.h>
#include <sys/capability.h>
#include <sys/capability.h>
extern "C" {
#include "trace.h"
#include "opener_api.h"
#include "cipcommon.h"
#include "trace.h"
#include "POSIX/networkconfig.h"
#include "doublylinkedlist.h"
#include "cipconnectionobject... | #include <stdio.h>
#include <stdlib.h>
#include <signal.h>
#include <sys/capability.h>
#include <sys/capability.h>
extern "C" {
#include "trace.h"
#include "opener_api.h"
#include "cipcommon.h"
#include "trace.h"
#include "POSIX/networkconfig.h"
#include "doublylinkedlist.h"
#include "cipconnectionobject... |
if (-1 == cap_set_proc(capabilities) ) {
cap_free(capabilities);
ROS_ERROR("Could not push CAP_NET_RAW capability to process");
exit(0);
}
if (-1 == cap_free(capabilities) ) {
ROS_ERROR("Could not free capabilites value");
exit(0);
}
DoublyLinkedListInitialize(&connection_list,
... | if (-1 == cap_set_flag(capabilities, CAP_EFFECTIVE, 1, capabilies_list, CAP_SET) ) {
cap_free(capabilities);
ROS_ERROR("Could not set CAP_NET_RAW capability");
exit(0);
} | if_condition | [
{
"content": "#ifndef EIP_DEVICE_H\n\n#define EIP_DEVICE_H\n\n\n\n#define INPUT_ASSEMBLY_BUFFER_SIZE 32\n\n#define OUTPUT_ASSEMBLY_BUFFER_SIZE 32\n\n#define CONFIG_ASSEMBLY_BUFFER_SIZE 10\n\n#define EXPLICIT_ASSEMBLY_BUFFER_SIZE 32\n\n\n\n#include <iostream>\n\n#include <string>\n\n#include<memory>\n\n\n\ne... |
C++ | src/Plugins/TundraLogic/Client.cpp | realXtend/tundra-urho3d | 436d41c3e3dd1a9b629703ee76fd0ef2ee212ef8 |
#include "StableHeaders.h"
#include "Client.h"
#include "UserConnectedResponseData.h"
#include "TundraLogic.h"
#include "KristalliProtocol.h"
#include "SyncManager.h"
#include "SyncState.h"
#include "MsgLogin.h"
#include "MsgLoginReply.h"
#include "Framework.h"
#include "Scene.h"
#include "SceneAPI.h"
#include "Asset... |
#include "StableHeaders.h"
#include "Client.h"
#include "UserConnectedResponseData.h"
#include "TundraLogic.h"
#include "KristalliProtocol.h"
#include "SyncManager.h"
#include "SyncState.h"
#include "MsgLogin.h"
#include "MsgLoginReply.h"
#include "Framework.h"
#include "Scene.h"
#include "SceneAPI.h"
#include "Asset... |
SetLoginProperty("protocol", String(SocketTransportLayerToString(protocol).c_str()).ToLower());
SetLoginProperty("address", address);
SetLoginProperty("port", port);
SetLoginProperty("client-version", "2.5.4.1");
SetLoginProperty("client-name", "Name");
SetLoginProperty("client-organi... | if (protocol == kNet::InvalidTransportLayer)
{
LogInfo("Client::Login: No protocol specified, using the default value.");
protocol = kristalli->defaultTransport;
} | if_condition | [
{
"content": "/// Implements kNet protocol -based server and client functionality.\n\nclass TUNDRALOGIC_API KristalliProtocol : public Object, public kNet::IMessageHandler, public kNet::INetworkServerListener\n\n{\n\n URHO3D_OBJECT(KristalliProtocol, Object);\n\n\n\npublic:\n\n KristalliProtocol(TundraLog... |
C++ | Audio/src/Windows/AudioOutput_WASAPI.cpp | Pants/unnamed-sdvx-clone | 28a4b537e40bfe45a48c63c20f5dc4ae5702feab | #include "stdafx.h"
#include "AudioOutput.hpp"
#include "Shared/Thread.hpp"
#ifdef _WIN32
#include "Audioclient.h"
#include "Mmdeviceapi.h"
#include "comdef.h"
#include "Functiondiscoverykeys_devpkey.h"
#define REFTIME_NS (100)
#define REFTIMES_PER_MICROSEC (1000/REFTIME_NS)
#define REFTIMES_PER_MILLISEC (REFTIMES_PE... | #include "stdafx.h"
#include "AudioOutput.hpp"
#include "Shared/Thread.hpp"
#ifdef _WIN32
#include "Audioclient.h"
#include "Mmdeviceapi.h"
#include "comdef.h"
#include "Functiondiscoverykeys_devpkey.h"
#define REFTIME_NS (100)
#define REFTIMES_PER_MICROSEC (1000/REFTIME_NS)
#define REFTIMES_PER_MILLISEC (REFTIMES_PE... | ;
res = m_audioClient->IsFormatSupported(AUDCLNT_SHAREMODE_EXCLUSIVE, mixFormat, NULL);
attemptingFormat++;
if (attemptingFormat >= allFormats.size())
{
break;
}
}
if (res == S_OK)
Log("Format successful", Logger::Info);
else
Log("No accepted format found", Logger::... | Logf("Attempting exclusive mode format:\nSample Rate: %dhz,\nBit Depth: %dbit,\nFormat: %s\n-----", Logger::Info,
mixFormat->nSamplesPerSec,
mixFormat->wBitsPerSample,
mixFormat->wFormatTag == WAVE_FORMAT_PCM ? "PCM" : "IEEE FLOAT"
) | call_expression | [
{
"content": "struct StaticBinding : public IFunctionBinding<R, A...>\n\n{\n\n\tStaticBinding(R(*func)(A...)) : func(func) {};\n\n\tvirtual R Call(A... args) override\n\n\t{\n\n\t\treturn (*func)(args...);\n\n\t}\n\n\tR(*func)(A...);\n\n};\n\n\n\n/* Lambda function binding */\n\ntemplate<typename T, typename R,... |
C++ | src/local_edge.cc | yjxiong/convnet | f51261942ce5121255c7edd61ce1a589509e76e5 | #include "local_edge.h"
#include "cudamat_conv.cuh"
#include <iostream>
LocalEdge::LocalEdge(const config::Edge& edge_config) :
EdgeWithWeight(edge_config),
kernel_size_(edge_config.kernel_size()),
stride_(edge_config.stride()),
padding_(edge_config.padding()) {}
void LocalEdge::SetTiedTo(Edge* e) {
EdgeWit... | #include "local_edge.h"
#include "cudamat_conv.cuh"
#include <iostream>
LocalEdge::LocalEdge(const config::Edge& edge_config) :
EdgeWithWeight(edge_config),
kernel_size_(edge_config.kernel_size()),
stride_(edge_config.stride()),
padding_(edge_config.padding()) {}
void LocalEdge::SetTiedTo(Edge* e) {
EdgeWit... |
}
void LocalEdge::SetImageSize(int image_size) {
Edge::SetImageSize(image_size);
num_modules_ = (image_size + 2 * padding_ - kernel_size_) / stride_ + 1;
}
void LocalEdge::AllocateMemoryFprop() {
int input_size = kernel_size_ * kernel_size_ * num_input_channels_
* num_modules_ * num_modules_... | if (img_display_ != NULL) {
weights_.CopyToHost();
img_display_->DisplayWeights(weights_.GetHostData(), kernel_size_, num_output_channels_, 250, false);
} | if_condition | [
{
"content": "#include \"conv_edge.h\"\n\n#include \"cudamat_conv.cuh\"\n\n#include <iostream>\n\n\n\nConvEdge::ConvEdge(const config::Edge& edge_config) :\n\n EdgeWithWeight(edge_config),\n\n kernel_size_(edge_config.kernel_size()),\n\n stride_(edge_config.stride()),\n\n padding_(edge_config.padding()),\n\... |
C++ | coursework/os/code/src/emsh/fs/stream.cpp | huaouo/history_code | 475193986caf025c9569fb0690a12bed0cf630b4 | #include <math.h>
#include <string.h>
#include "stream.h"
#include "lnkblk.h"
namespace emsh::fs {
Stream::Stream(const uint16_t iaddr)
: io(IO::get_instance()), fs(FS::get_instance()),
iaddr(iaddr), inode(fs.read_inode(iaddr)), read_pos(0), write_pos(0) {}
bool Stream::truncate(size_t len) {
if (len > ... | #include <math.h>
#include <string.h>
#include "stream.h"
#include "lnkblk.h"
namespace emsh::fs {
Stream::Stream(const uint16_t iaddr)
: io(IO::get_instance()), fs(FS::get_instance()),
iaddr(iaddr), inode(fs.read_inode(iaddr)), read_pos(0), write_pos(0) {}
bool Stream::truncate(size_t len) {
if (len > ... |
memcpy(data + data_pos, (char *) &blk + offset, read_cycle_size);
read_pos += read_cycle_size;
data_pos += read_cycle_size;
}
return data_pos;
}
void Stream::seekw(size_t pos) {
if (pos > inode.size)
pos = inode.size;
write_pos = pos;
}
void Stream::seekr(size_t pos) {
if (pos >= inode.siz... | if (blk_index < INODE_DJADDR_BLK_CNT) {
Blk _j_blk = io.read_block(inode.j_addr);
auto j_blk = (LnkBlk *) &_j_blk;
blk = io.read_block(j_blk->addr[blk_index - INODE_DADDR_BLK_CNT]);
} else {
auto blk_index_remain = static_cast<uint16_t>(blk_index - INODE_DJADDR_BLK_CNT);
auto blk_index... | if_condition | [] |
C++ | example/m5stack/transmitter/src/main.cpp | yukima77/EnOceanModule | c4d2cdf8738890333085980afb66478f499d21aa | #include <M5Stack.h>
#include <SoftwareSerial.h>
#define SYNC 0x55 // SYNC
SoftwareSerial enoceanSerial(21, 22);
const byte CRC8Table[256] = {
0x00, 0x07, 0x0e, 0x09, 0x1c, 0x1b, 0x12, 0x15,
0x38, 0x3f, 0x36, 0x31, 0x24, 0x23, 0x2a, 0x2d,
0x70, 0x77, 0x7e, 0x79, 0x6c, 0x6b, 0x62, 0x65,
0x48,... | #include <M5Stack.h>
#include <SoftwareSerial.h>
#define SYNC 0x55 // SYNC
SoftwareSerial enoceanSerial(21, 22);
const byte CRC8Table[256] = {
0x00, 0x07, 0x0e, 0x09, 0x1c, 0x1b, 0x12, 0x15,
0x38, 0x3f, 0x36, 0x31, 0x24, 0x23, 0x2a, 0x2d,
0x70, 0x77, 0x7e, 0x79, 0x6c, 0x6b, 0x62, 0x65,
0x48,... |
enoceanSerial.write(data, len_raw_data + 2);
byte crc8d = 0;
for (i = 0; i < (len_raw_data + 2); i++)
{
crc8d = CRC8Table[crc8d ^ data[i]];
};
enoceanSerial.write(crc8d);
}
M5.Lcd.setCursor(5, 5);
M5.update();
delay(100);
} | if (data[5] == 0x09)
{
data[5] = 0x08;
Serial.println("Open");
M5.Lcd.clear(BLACK);
M5.Lcd.setTextSize(5);
M5.Lcd.println("Open");
} | if_condition | [
{
"content": "#include <M5Stack.h>\n\n#include <SoftwareSerial.h>\n\n\n\n#define LCDHIGH 240\n\n#define LCDWIDTH 320\n\n\n\n#define TEMPID 0x05002729 // EnOceanモジュールID\n\n#define SYNC 0x55 // SYNCバイト\n\n\n\nSoftwareSerial enoceanSerial(21, 22); // RX, TX\n\n\n\nvoid setup()\n\n{\n\n M5.begin();\n\n\n\n... |
C++ | src/appleseed/foundation/array/meshalgorithm.cpp | jaichhabra/appleseed | bc952ad860ca6f93bfe4cdd2b966acac4cb42e20 |
#include "foundation/array/applyvisitor.h"
#include "foundation/array/array.h"
#include "foundation/array/arrayview.h"
#include "foundation/array/exception.h"
#include "foundation/array/meshalgorithm.h"
#include <algorithm>
#include <cstdint>
namespace foundation
{
namespace
{
struct ComputeBBoxVisitor
{
... |
#include "foundation/array/applyvisitor.h"
#include "foundation/array/array.h"
#include "foundation/array/arrayview.h"
#include "foundation/array/exception.h"
#include "foundation/array/meshalgorithm.h"
#include <algorithm>
#include <cstdint>
namespace foundation
{
namespace
{
struct ComputeBBoxVisitor
{
... |
m_stats.m_max_face_sides = std::max(
m_stats.m_max_face_sides,
static_cast<size_t>(n));
}
}
};
}
AABB3f compute_bounding_box(const Array& vertices)
{
ComputeBBoxVisitor v;
apply_visitor(vertices, v);
return v.m_bbox;
}
AABB3... | if (n < 3) m_stats.m_invalid_count++;
else if (n == 3) m_stats.m_triangle_count++;
else if (n == 4) m_stats.m_quad_count++;
else m_stats.m_ngon_count++; | if_condition | [
{
"content": "class Matrix<T, N, N>\n\n{\n\n public:\n\n // Types.\n\n typedef T ValueType;\n\n typedef Matrix<T, N, N> MatrixType;\n\n\n\n // Dimensions and number of components.\n\n static const size_t Rows = N;\n\n static const size_t Columns = N;\n\n static const size_t Components = N ... |
C++ | apps/vdcwizard/dataholder.cpp | yyr/vapor | cdebac81212ffa3f811064bbd7625ffa9089782e |
#include <stdlib.h>
#include <stdio.h>
#include <sstream>
#include <iterator>
#include <cstdio>
#include <QDebug>
#include <QString>
#include <vapor/WrfVDFcreator.h>
#include <vapor/vdfcreate.h>
#include <vapor/Copy2VDF.h>
#include <vapor/MetadataVDC.h>
#include <vapor/WaveCodecIO.h>
#include <vapor/DCReader.h>
#incl... |
#include <stdlib.h>
#include <stdio.h>
#include <sstream>
#include <iterator>
#include <cstdio>
#include <QDebug>
#include <QString>
#include <vapor/WrfVDFcreator.h>
#include <vapor/vdfcreate.h>
#include <vapor/Copy2VDF.h>
#include <vapor/MetadataVDC.h>
#include <vapor/WaveCodecIO.h>
#include <vapor/DCReader.h>
#incl... |
string DataHolder::getPopDataCmd() {
vector<std::string> argv;
if (getFileType() == "ROMS") argv.push_back("roms2vdf");
else if (getFileType() == "GRIB") argv.push_back("grib2vdf");
else if (getFileType() == "CAM") argv.push_back("cam2vdf");
else if (getFileType() == "WRF") argv.push_back("wrf2vdf");
else argv.... | e()=="WRF") argv.push_back("-vdc2");
if (VDFSBFactor != "") {
argv.push_back("-bs");
argv.push_back(VDFSBFactor);
}
if (VDFcomment != "") {
argv.push_back("-comment");
argv.push_back(VDFcomment);
}
if (VDFcrList != "") {
argv.push_back("-cratios");
argv.push_back(VDFcrList);
}
if (VDFPeriod... | function_block-function_prefixed | [
{
"content": " class DerivedVarElevation : public NetCDFCollection::DerivedVar {\n\n public:\n\n DerivedVarElevation(\n\n NetCDFCollection *ncdfcf, float grav\n\n );\n\n virtual ~DerivedVarElevation();\n\n\n\n virtual int Open(size_t ts);\n\n virtual int ReadSlice(float *slice, int );\n\n virtual int R... |
C++ | TinySTL/set.hpp | syn1w/TinySTL | 04961c8fcec560d23cb99d049d44ff1b88113118 |
#pragma once
#include "rbtree.hpp"
namespace tiny_stl {
template <typename Key, typename Compare = tiny_stl::less<Key>,
typename Alloc = tiny_stl::allocator<Key>>
class set : public RBTree<Key, Compare, Alloc, false> {
public:
using allocator_type = Alloc;
private:
using Base = RBTree<Key, Compa... |
#pragma once
#include "rbtree.hpp"
namespace tiny_stl {
template <typename Key, typename Compare = tiny_stl::less<Key>,
typename Alloc = tiny_stl::allocator<Key>>
class set : public RBTree<Key, Compare, Alloc, false> {
public:
using allocator_type = Alloc;
private:
using Base = RBTree<Key, Compa... | ltiset<Key, Compare, Alloc>& rhs) noexcept(noexcept(lhs.swap(rhs))) {
lhs.swap(rhs);
}
} | l::allocator<Key>>
class multiset : public RBTree<Key, Compare, Alloc, false> {
public:
using allocator_type = Alloc;
private:
using Base = RBTree<Key, Compare, allocator_type, false>;
using AlTraits = allocator_traits<allocator_type>;
using AlNode = typename Base::AlNode;
using AlNodeTraits = typen... | random | [
{
"content": "class unordered_set : public HashTable<Key, Hash, KeyEqual, Alloc, false> {\n\npublic:\n\n using allocator_type = Alloc;\n\nprivate:\n\n using Base = HashTable<Key, Hash, KeyEqual, Alloc, false>;\n\n using AlTraits = allocator_traits<allocator_type>;\n\n\n\npublic:\n\n using key_type =... |
C++ | parallel/SolverConfiguration.cc | jiriklepl/glucose-syrup-4.1 | 3a444d2cde0fbb1538e7965410db67db27940c09 |
#include "glucose/parallel/MultiSolvers.h"
#include "glucose/core/Solver.h"
#include "glucose/parallel/SolverConfiguration.h"
using namespace Glucose;
void SolverConfiguration::configure(MultiSolvers *ms, int nbsolvers) {
for(int i = 1;i<nbsolvers;i++) {
ms->solvers[i]->randomizeFirstDescen... |
#include "glucose/parallel/MultiSolvers.h"
#include "glucose/core/Solver.h"
#include "glucose/parallel/SolverConfiguration.h"
using namespace Glucose;
void SolverConfiguration::configure(MultiSolvers *ms, int nbsolvers) {
for(int i = 1;i<nbsolvers;i++) {
ms->solvers[i]->randomizeFirstDescen... | if (nbsolvers < 11 ) return;
double noisevar_decay = 0.005;
int noiseReduceDB = 50;
for (int i=10;i<nbsolvers;i++) {
ms->solvers[i]-> var_decay = ms->solvers[i%8]->var_decay;
ms->solvers[i]-> max_var_decay = ms->solvers[i%8]->max_var_decay;
ms->solvers[i]-> firstReduceDB= ms->solve... | function_block-function_prefix_line | [
{
"content": "struct IntRange {\n\n int begin;\n\n int end;\n\n IntRange(int b, int e) : begin(b), end(e) {}\n\n};\n\n\n",
"file_path": "utils/Options.h",
"rank": 0,
"score": 30383.65854647451
},
{
"content": "class IntOption : public Option\n\n{\n\n protected:\n\n IntRange range... | |
C++ | aesxx/utils/encrypt_block.cpp | egor-tensin/aesni | 76ae97ff1434941dcf0c6bf1679146dcb28718aa |
#include "block_cmd_parser.hpp"
#include "block_dumper.hpp"
#include "block_input.hpp"
#include <aesxx/all.hpp>
#include <boost/program_options.hpp>
#include <exception>
#include <iostream>
#include <stdexcept>
#include <string>
namespace
{
template <aes::Algorithm algorithm, aes::Mode mode>
void encrypt_... |
#include "block_cmd_parser.hpp"
#include "block_dumper.hpp"
#include "block_input.hpp"
#include <aesxx/all.hpp>
#include <boost/program_options.hpp>
#include <exception>
#include <iostream>
#include <stdexcept>
#include <string>
namespace
{
template <aes::Algorithm algorithm, aes::Mode mode>
void encrypt_... |
}
}
catch (const aes::Error& e)
{
std::cerr << e;
return 1;
}
catch (const std::exception& e)
{
std::cerr << e.what() << "\n";
return 1;
}
return 0;
}
| if (settings.use_boxes)
{
encrypt_using_boxes(
settings.algorithm,
settings.mode,
input);
}
else
{
encrypt_using_cxx_api(
settings.algorithm,
... | if_condition | [
{
"content": " AES_BoxBlock iv;\n",
"file_path": "aes/include/aes/box_data.h",
"rank": 0,
"score": 107986.0012956743
},
{
"content": " const AES_BoxAlgorithmInterface* algorithm;\n",
"file_path": "aes/include/aes/box_data.h",
"rank": 1,
"score": 107862.82410899692
},
{
... |
C++ | src/particle_filter.cpp | siva1729/CarND-Kidnapped-Vehicle-T2P3 | 3021d48321f7c907a0aace54f23ff892e1eea3db |
#include <random>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <math.h>
#include <iostream>
#include <sstream>
#include <string>
#include <iterator>
#include "particle_filter.h"
using namespace std;
#define NUM_PARTICLES 50
#define EPS 0.001
void dbg_pp (Particle &particle) ... |
#include <random>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <math.h>
#include <iostream>
#include <sstream>
#include <string>
#include <iterator>
#include "particle_filter.h"
using namespace std;
#define NUM_PARTICLES 50
#define EPS 0.001
void dbg_pp (Particle &particle) ... |
void ParticleFilter::resample() {
random_device rd;
default_random_engine gen(rd());
vector<Particle> resampled_particles;
resampled_particles.resize(particles.size());
discrete_distribution<int> dist_resample(weights.begin(), weights.end());
for (int i = 0; i < particles.size(); i++) {
resampled_... | d_i, mx, my});
}
}
vector<LandmarkObs> mapped_observations;
for (int j = 0; j < observations.size(); j++) {
double mapx = cos(par_t) * observations[j].x - sin(par_t) * observations[j].y + par_x;
double mapy = sin(par_t) * observations[j].x + cos(par_t) * observations[j].y + par_y;
mapped_observa... | function_block-function_prefixed | [
{
"content": " class iter_impl : public std::iterator<std::random_access_iterator_tag, U>\n\n {\n\n /// allow basic_json to access private members\n\n friend class basic_json;\n\n\n\n // make sure U is basic_json or const basic_json\n\n static_assert(std::is_same<U, basic_json>... |
C++ | source/grid/setup_grid_NG_MPI.cpp | jfbucas/PION | e0a66aa301e4d94d581ba4df078f1a3b82faab99 |
#include "defines/functionality_flags.h"
#include "defines/testing_flags.h"
#include "tools/reporting.h"
#include "tools/command_line_interface.h"
#include "raytracing/raytracer_SC.h"
#include "grid/setup_grid_NG_MPI.h"
#include "grid/uniform_grid.h"
#include "grid/uniform_grid_pllel.h"
#include "spatial_solvers/s... |
#include "defines/functionality_flags.h"
#include "defines/testing_flags.h"
#include "tools/reporting.h"
#include "tools/command_line_interface.h"
#include "raytracing/raytracer_SC.h"
#include "grid/setup_grid_NG_MPI.h"
#include "grid/uniform_grid.h"
#include "grid/uniform_grid_pllel.h"
#include "spatial_solvers/s... |
setup_cell_extra_data(SimPM);
double dx=(SimPM.Xmax[XX]-SimPM.Xmin[XX])/SimPM.NG[XX];
CI.set_nlevels(dx,SimPM.grid_nlevels);
CI.set_ndim(SimPM.ndim);
CI.set_nvar(SimPM.nvar);
CI.set_xmin(SimPM.Xmin);
#ifdef TESTING
cout <<"(setup_grid_NG_MPI::setup_grid) Setting up grid.... | if (SimPM.spOOA==OA2) {SimPM.Nbc = 6; SimPM.Nbc_DD = 4;}
else if (SimPM.spOOA==OA1) {SimPM.Nbc = 4; SimPM.Nbc_DD = 2;}
else
rep.error("unhandles spatial order of accuracy",SimPM.spOOA); | if_condition | [
{
"content": " // Else, make a vector of structs with a list of cells contained\n\n // in each coarse cell (2,4,or 8) of the parent grid. This grid\n\n // is (by design) entirely contained within the parent.\n\n class GridBaseClass *grid = par.levels[l].grid;\n\n int nc=1; // number of fine cel... |
C++ | milk/supervised/_lasso.cpp | aflaxman/milk | 252806fd081dc1b3c7fe34b14f9e7a4b646e0b49 |
#include <iostream>
#include <memory>
#include <cmath>
#include <random>
#include <cassert>
#include <queue>
#include <eigen3/Eigen/Dense>
using namespace Eigen;
extern "C" {
#include <Python.h>
#include <numpy/ndarrayobject.h>
}
namespace {
template <typename T>
int random_int(T& random, const int max) {... |
#include <iostream>
#include <memory>
#include <cmath>
#include <random>
#include <cassert>
#include <queue>
#include <eigen3/Eigen/Dense>
using namespace Eigen;
extern "C" {
#include <Python.h>
#include <numpy/ndarrayobject.h>
}
namespace {
template <typename T>
int random_int(T& random, const int max) {... | - B*X;
} else {
sweep = false;
}
changed = false;
}
if (!sweep && B(i,j) == 0.0) continue;
const float prev = B(i,j);
assert(Y.cols() == W.cols());
ass... | sweep = false;
bool changed = false;
assert(!has_nans(X));
assert(!has_nans(Y));
assert(!has_nans(B));
for (int it = 0; it != max_iter; ++it) {
this->next_coords(i, j);
if (i == 0 && j == 0) {
if (sweep && !changed) {
re... | random | [
{
"content": "struct Kmeans_Exception {\n\n Kmeans_Exception(const char* msg): msg(msg) { }\n\n const char* msg;\n\n\n\n};\n\nvoid assert_type_contiguous(PyArrayObject* array,int type) { \n\n if (!PyArray_Check(array) ||\n\n PyArray_TYPE(array) != type ||\n\n !PyArray_ISCONTIGUOUS(array))... |
C++ | MsgParser.cpp | fri000/MsgParser | edbc48e664416f144e00712d879a45298d8728d2 |
#include <avr/pgmspace.h>
#include <inttypes.h>
#include <string.h>
#include <stdlib.h>
#include "MsgParser.h"
MsgParser::MsgParser()
{
m_BufferWriteIndex = 0;
m_pRead = m_pInputBuffer;
m_pMsgParserCommand = NULL;
m_msgStartByte = '/';
m_msgEndByte ... |
#include <avr/pgmspace.h>
#include <inttypes.h>
#include <string.h>
#include <stdlib.h>
#include "MsgParser.h"
MsgParser::MsgParser()
{
m_BufferWriteIndex = 0;
m_pRead = m_pInputBuffer;
m_pMsgParserCommand = NULL;
m_msgStartByte = '/';
m_msgEndByte ... | e == true)
{
m_state = WAITING_FOR_START_BYTE;
}
else
{
m_state = READING_MESSAGE;
}
}
else
{
}
}
... |
}
}
clearTheBuffer();
}
else
{
m_pInputBuffer[m_BufferWriteIndex] = newByte;
m_BufferWriteIndex++;
if(m_BufferWriteIndex == MSGPARSER_INPUT_BUF... | random | [
{
"content": " const char* pCmdString; //pointer to a null terminated char array\n\n const char* pDescString; //Short help text about this command. Pointer to a null terminated char array\n\n FuncPtr_t pFunc; //pointer to a function\n\n\n\n}FuncEntry_t;\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n",
"file_... |
C++ | ModelsAPI/DependentValues.cpp | FlowsheetSimulation/Dyssol-open | 557d57d959800868e1b3fd161b26cad16481382b |
#include "DependentValues.h"
#include "ContainerFunctions.h"
#include "StringFunctions.h"
#include <ostream>
#include <sstream>
#include <numeric>
CDependentValues::CDependentValues(const std::vector<double>& _params, const std::vector<double>& _values)
{
SetValues(_params, _values);
}
bool CDependentValues::IsEmp... |
#include "DependentValues.h"
#include "ContainerFunctions.h"
#include "StringFunctions.h"
#include <ostream>
#include <sstream>
#include <numeric>
CDependentValues::CDependentValues(const std::vector<double>& _params, const std::vector<double>& _values)
{
SetValues(_params, _values);
}
bool CDependentValues::IsEmp... | irAt(size_t _index)
{
if (_index >= m_values.size()) return;
m_params.erase(m_params.begin() + _index);
m_values.erase(m_values.begin() + _index);
}
std::vector<double> CDependentValues::GetParamsList() const
{
return m_params;
}
std::vector<double> CDependentValues::GetValuesList() const
{
return m_values;
}
v... | gin() + std::distance(m_params.begin(), pos));
m_params.erase(pos);
}
}
double CDependentValues::GetParamAt(size_t _index) const
{
if (_index >= m_params.size()) return {};
return m_params[_index];
}
double CDependentValues::GetValueAt(size_t _index) const
{
if (_index >= m_values.size()) return {};
return m_v... | random | [
{
"content": "// Description of a constant property of a pure compound.\n\nclass CConstProperty : public CBaseProperty\n\n{\n\n\tdouble m_defaultValue;\t// Default value.\n\n\tdouble m_dValue;\t\t// Current value of the constant property.\n\n\n\npublic:\n\n\tCConstProperty(unsigned _nProperty, const std::string... |
C++ | frameworks/base/media/agifencoder/jni/agifencoder_jni.cpp | touxiong88/92_mediatek | 5e96a7bb778fd9d9b335825584664e0c8b5ff2c7 |
#include <jni.h>
#include <utils/Log.h>
#include <stdio.h>
#include <stdlib.h>
#include "SkBitmap.h"
#include "GraphicsJNI.h"
#include "SkPixelRef.h"
#include <cutils/xlog.h>
#define LOG_TAG "AGIF_ENCODER_JNI"
#if 0
#include "SkMovie.h"
#include "SkStream.h"
#include "GraphicsJNI.h"
#include "SkTemplates.h"
#incl... |
#include <jni.h>
#include <utils/Log.h>
#include <stdio.h>
#include <stdlib.h>
#include "SkBitmap.h"
#include "GraphicsJNI.h"
#include "SkPixelRef.h"
#include <cutils/xlog.h>
#define LOG_TAG "AGIF_ENCODER_JNI"
#if 0
#include "SkMovie.h"
#include "SkStream.h"
#include "GraphicsJNI.h"
#include "SkTemplates.h"
#incl... | m;
return true ;
}
return true ;
}
static int agifenc_encodeFrameCount(JNIEnv* env, jobject movie) {
XLOGI("AGIFE::agifenc_encodeFrameCount, go L:%d!!\n", __LINE__);
NPE_CHECK_RETURN_ZERO(env, movie);
AGifEncoder* m = J2AGifEncoder(env, movie);
return m->getGifTo... | ceptionClear();
SkDebugf("--- write:SetByteArrayElements threw an exception\n");
return false;
}
fEnv->CallVoidMethod(fJavaOutputStream, gOutputStream_writeMethodID,
storage, 0, requested);
if (env->ExceptionCheck()) {... | random | [] |
C++ | src/network-container.cc | imonlius/interactive-neurons | da8cbdad8cf5595a2be1b48125ecad5e6c802f2c |
#include "neurons/network-container.h"
#include "neurons/utilities.h"
namespace neurons {
NetworkContainer::NetworkContainer(NodeDeque& nodes,
const std::deque<Link>& links) : links_(links) {
if (!utilities::NodesAndLinksConsistent(nodes, links)) {
throw std::invalid_argument("Passed nodes and links ... |
#include "neurons/network-container.h"
#include "neurons/utilities.h"
namespace neurons {
NetworkContainer::NetworkContainer(NodeDeque& nodes,
const std::deque<Link>& links) : links_(links) {
if (!utilities::NodesAndLinksConsistent(nodes, links)) {
throw std::in |
std::vector<fl::Variable> Add(const std::vector<fl::Variable>& lhs,
const std::vector<fl::Variable>& rhs) {
if (lhs.size() != rhs.size()) {
throw std::invalid_argument("Vector sizes do not match!");
}
std::vector<fl::Variable> result;
for (size_t i = 0; i < lhs.size(); ++i) {
result.push_back(lh... | valid_argument("Passed nodes and links are inconsistent.");
}
if (utilities::CountConnectedComponents(nodes, links) != 1) {
throw std::invalid_argument("Graph does not consist of 1 component.");
}
if (utilities::ContainsDirectedCycle(nodes, links)) {
throw std::invalid_argument("Graph contains a directe... | function_block-function_prefixed | [
{
"content": "class Link {\n\n\n\n public:\n\n\n\n // Public member variables.\n\n std::shared_ptr<Node> input_;\n\n std::shared_ptr<Node> output_;\n\n\n\n // Get link ID.\n\n [[nodiscard]] size_t GetId() const;\n\n\n\n // Public constructor. Pass shared_ptr by value as Links will share ownership.\n\n Li... |
C++ | src/elements/areas/AreaProduction.cpp | FlorianEith/rcll_status_board | 2358ca07d72ad090408c0810071b95c03416b02c |
#include <AreaProduction.h>
rcll_draw::AreaProduction::AreaProduction(){
hp_header = HeaderPanel("LOGISTICS LEAGUE", rcll_draw::NO_TEAM);
thp_team_header_cyan = TeamHeaderPanel();
thp_team_header_magenta = TeamHeaderPanel();
vsp_gameinfo = VStatusPanel(rcll_draw::NO_TEAM);
pi_productinfo_cyan = P... |
#include <AreaProduction.h>
rcll_draw::AreaProduction::AreaProduction(){
hp_header = HeaderPanel("LOGISTICS LEAGUE", rcll_draw::NO_TEAM);
thp_team_header_cyan = TeamHeaderPanel();
thp_team_header_magenta = TeamHeaderPanel();
vsp_gameinfo = VStatusPanel(rcll_draw::NO_TEAM);
pi_productinfo_cyan = P... | , show_element_borders);
mip_machineinfo_magenta.draw(mat, show_element_borders);
gf_gamefield.draw(mat, show_element_borders);
blbl_text.draw(mat);
}
| );
allow_paging_by_move &= !pi_productinfo_cyan.move();
allow_paging_by_move &= !pi_productinfo_magenta.move();
} else {
allow_paging_by_move = true;
ri_robotinfo_cyan.draw(mat, show_element_borders);
ri_robotinfo_magenta.draw(mat, show_element_borders);
}
if (allow_... | function_block-random_span | [
{
"content": " class MachineInfoProduction {\n\n public:\n\n MachineInfoProduction();\n\n MachineInfoProduction(Team team);\n\n ~MachineInfoProduction();\n\n\n\n void setShortDisplay(bool short_display);\n\n void setGeometry(int x, int y, double scale);\n\n\n\n in... |
C++ | WithComments/grid.cc | RootofalleviI/Reversi | e52bf7ead191568114504945b62c7b955a2074a5 | #include <string>
#include <sstream>
#include "grid.h"
using namespace std;
void Grid::init(size_t n) {
dim = n;
if (td) delete td;
td = new TextDisplay(n);
theGrid.clear();
for (size_t i=0; i<dim; ++i) {
theGrid.emplace_back(vector<Cell>());
for (size_t j=0; j<dim; ++j)... | #include <string>
#include <sstream>
#include "grid.h"
using namespace std;
void Grid::init(size_t n) {
dim = n;
if (td) delete td;
td = new TextDisplay(n);
theGrid.clear();
for (size_t i=0; i<dim; ++i) {
theGrid.emplace_back(vector<Cell>());
for (size_t j=0; j<dim; ++j)... |
void Grid::updateCounter() {
stringstream ss;
ss << *td;
string s = ss.str();
black = count(s, 'B');
white = count(s, 'W');
}
void Grid::toggle(size_t r, size_t c) { theGrid[r][c].toggle(); }
bool Grid::isFull() const { return (white+black == dim*dim); }
Grid::~Grid() { delete td; }
Colour Grid:... | int count(string s, char c) {
size_t x = 0, len = s.size();
for (size_t i=0; i<len; ++i) {
if (s[i] == c) ++x;
}
return x;
} | function_block-full_function | [
{
"content": " Colour colour; \n",
"file_path": "state.h",
"rank": 0,
"score": 67877.03442930145
},
{
"content": " Colour colour; \n",
"file_path": "WithComments/state.h",
"rank": 1,
"score": 65354.836290758016
},
{
"content": " Colour colour;\n",
"file_path": ... |
C++ | src/control.hpp | Gypsophino-dev/Gypsophino | 484325bd5db36d99cdc13048646695b94f656111 | #pragma once
#include "const.hpp"
#include "shape.hpp"
#include <array>
#include <raylib.h>
#include <string>
#include <utility>
#include <vector>
namespace gyp {
enum button_status { normal, hover, pressed };
template <class callback_type> class button : public rectangle {
private:
button_status status{};
std:... | #pragma once
#include "const.hpp"
#include "shape.hpp"
#include <array>
#include <raylib.h>
#include <string>
#include <utility>
#include <vector>
namespace gyp {
enum button_status { normal, hover, pressed };
template <class callback_type> class button : public rectangle {
private:
button_status status{};
std:... |
template <class callback_type>
callback_type button<callback_type>::interact(Vector2 mouse) {
int mx = static_cast<int>(mouse.x);
int my = static_cast<int>(mouse.y);
if (mx > x && mx < x + width && my > y && my < y + height) {
status = hover;
for (int i = 0; i <= 2; i++) {
if (IsMouseButtonRe... | void button<callback_type>::draw(button_status stat) {
DrawRectangle(x, y, width, height, color.at(stat));
Vector2 text_size =
MeasureTextEx(font, text.at(stat).c_str(), font_size, spacing);
text_size.x /= -2;
text_size.y /= -2;
text_size.x += x + width / 2;
text_size.y += y + height / 2;
DrawTextEx... | function_block-full_function | [
{
"content": "class playground : public std::vector<track>, public rectangle {\n\nprivate:\n\n // Geometry\n\n int track_number;\n\n\n\n // Playground style\n\n Color outline;\n\n int thick;\n\n\n\n int current_time;\n\n int speed;\n\n const song_map *song;\n\n Music music;\n\n playground_status statu... |
C++ | include/amtrs/.driver/win32-g3d-device-opengl.hpp | isaponsoft/libamtrs | 5adf821ee15592fc3280985658ca8a4b175ffcaa |
#ifndef __libamtrs__g3d__device__win32__opengl__hpp
#define __libamtrs__g3d__device__win32__opengl__hpp
#pragma comment(lib, "user32.lib")
#pragma comment(lib, "gdi32.lib")
#pragma comment(lib, "opengl32.lib")
#include ".api-windows.hpp"
#include <GL/gl.h>
#include <GL/glext.h>
#include <GL/wglext.h>
#include "openg... |
#ifndef __libamtrs__g3d__device__win32__opengl__hpp
#define __libamtrs__g3d__device__win32__opengl__hpp
#pragma comment(lib, "user32.lib")
#pragma comment(lib, "gdi32.lib")
#pragma comment(lib, "opengl32.lib")
#include ".api-windows.hpp"
#include <GL/gl.h>
#include <GL/glext.h>
#include <GL/wglext.h>
#include "openg... | rtExtAPI = false;
};
AMTRS_WIN32_OPENGL_NAMESPACE_END
AMTRS_G3D_NAMESPACE_BEGIN
template<class BitmapT>
inline ref<device> device::create(BitmapT* _bitmap)
{
using namespace os::win32;
class device
: public win32::opengl::device
{
public:
using _base_type = win32::opengl::device;
device(BitmapT* _bmp)
... | ;
if (!mGLRC)
{
throw std::system_error(make_last_error_code(), "wglCreateContext()");
}
wglMakeCurrent(_hdc, mGLRC);
mDC = _hdc;
auto wglCreateContextAttribsARB = (PFNWGLCREATECONTEXTATTRIBSARBPROC)wglGetProcAddress("wglCreateContextAttribsARB");
if (wglCreateContextAttribsARB)
{
static const ... | random | [
{
"content": "// ============================================================================\n\n//! 標準ファイルシステムに対するインターフェース\n\n// ----------------------------------------------------------------------------\n\n//! std::filesystem を仮想化します。\n\n// -------------------------------------------------------------------... |
C++ | CrescentEngine/Models/Mesh.cpp | xRiveria/Crescent-Engine | b6512b6a8dab2d27cf542c562ccc28f21bf2345d | #include "CrescentPCH.h"
#include "Mesh.h"
#include "GL/glew.h"
#include <glm/gtc/type_ptr.hpp>
#include <algorithm>
namespace Crescent
{
Mesh::Mesh()
{
}
Mesh::Mesh(std::vector<glm::vec3> positions, std::vector<unsigned int> indices)
{
m_Positions = positions;
m_Indices = indices;
}
Mesh::Mesh(std::vect... | #include "CrescentPCH.h"
#include "Mesh.h"
#include "GL/glew.h"
#include <glm/gtc/type_ptr.hpp>
#include <algorithm>
namespace Crescent
{
Mesh::Mesh()
{
}
Mesh::Mesh(std::vector<glm::vec3> positions, std::vector<unsigned int> indices)
{
m_Positions = positions;
m_Indices = indices;
}
Mesh::Mesh(std::vect... | ;
auto left_ptr = right_ptr - 1;
float factor = (ticks - left_ptr->mTime) / (right_ptr->mTime - left_ptr->mTime);
return mat4_from_aivector3d(left_ptr->mValue * (1.0f - factor) + right_ptr->mValue * factor);
}
glm::mat4 Mesh::InterpolateRotationMatrix(aiQuatKey* keys, uint32_t n, double ticks)
{
static aut... | std::upper_bound(keys, keys + n, anchor, [](const aiVectorKey& a, const aiVectorKey& b) {
return a.mTime < b.mTime;
}) | call_expression | [
{
"content": "struct aiMeshKey\n\n{\n\n /** The time of this key */\n\n double mTime;\n\n\n\n /** Index into the aiMesh::mAnimMeshes array of the\n\n * mesh corresponding to the #aiMeshAnim hosting this\n\n * key frame. The referenced anim mesh is evaluated\n\n * according to the rules d... |
C++ | src/common/partial.hh | sergeyfilip/objectstore | e2d0c86134c46c77fb143f7198d13fab7f5b1ea5 |
#ifndef COMMON_PARTIAL_HH
#define COMMON_PARTIAL_HH
template <typename R>
class BindBase {
public:
virtual R operator()() const = 0;
virtual ~BindBase() { }
virtual BindBase* clone() const = 0;
};
template <typename R, typename Obj>
class BindBaseM {
public:
virtual R operator()(Obj&) const = 0;
virtual ~... |
#ifndef COMMON_PARTIAL_HH
#define COMMON_PARTIAL_HH
template <typename R>
class BindBase {
public:
virtual R operator()() const = 0;
virtual ~BindBase() { }
virtual BindBase* clone() const = 0;
};
template <typename R, typename Obj>
class BindBaseM {
public:
virtual R operator()(Obj&) const = 0;
virtual ~... | *fun)(bound1,bound2,bound3); }
Closure0B3c<InstanceT,Out,Bound1,Bound2,Bound3>* clone() const {
return new Closure0B3c<InstanceT,Out,Bound1,Bound2,Bound3>(*this);
}
private:
const InstanceT *instance;
Out (InstanceT::*fun)(Bound1,Bound2,Bound3) const;
Bound1 bound1;
Bound2 bound2;
Bound3 bound3;
};
t... | n> papply(Out (Obj::*f)(In), In in)
{
return Bind1M<Out, Obj, In>(f, in);
}
template <class Out, class In1, class In2>
inline Bind2<Out,In1,In2> papply(Out (*f)(In1,In2), In1 in1, In2 in2)
{
return Bind2<Out,In1,In2>(f, in1, in2);
}
template <class Out, class Obj, class In1, class In2>
inline Bind2M<Out, Obj, In1... | random | [] |
C++ | server/modules/routing/binlogrouter/blr_event.cc | tut-blog/MaxScale | cabd6dba0665cb8025c694acf98cffaa68d10de0 |
#include "blr.hh"
#include <inttypes.h>
#include <maxscale/alloc.h>
bool blr_handle_one_event(MXS_ROUTER* instance, REP_HEADER& hdr, uint8_t* ptr, uint32_t len, int semisync)
{
ROUTER_INSTANCE* router = static_cast<ROUTER_INSTANCE*>(instance);
router->lastEventReceived = hdr.event_type;
router->lastEve... |
#include "blr.hh"
#include <inttypes.h>
#include <maxscale/alloc.h>
bool blr_handle_one_event(MXS_ROUTER* instance, REP_HEADER& hdr, uint8_t* ptr, uint32_t len, int semisync)
{
ROUTER_INSTANCE* router = static_cast<ROUTER_INSTANCE*>(instance);
router->lastEventReceived = hdr.event_type;
router->lastEve... |
if (strncmp(statement_sql, "COMMIT", 6) == 0)
{
router->pending_transaction.state = BLRM_COMMIT_SEEN;
}
if (router->pending_transaction.state > BLRM_NO_TRANSACTION
&& router->pending_transaction.standalone)
... | if (strncmp(statement_sql, "BEGIN", 5) == 0)
{
if (router->pending_transaction.state > BLRM_NO_TRANSACTION)
{
MXS_ERROR("A transaction is already open "
"@ %lu and a new one starts @ %lu",
router-... | if_condition | [
{
"content": "#define GTID_MAX_LEN 64\n\n\n",
"file_path": "include/maxscale/mysql_binlog.h",
"rank": 0,
"score": 229626.218827728
},
{
"content": " struct mxs_router* router_instance; /**< The router instance for this\n",
"file_path": "include/maxscale/service.h",
"ra... |
C++ | game/src/main/cpp/game/Particles/Splash.cpp | zorin-egor/PingPongGame | fc4084f4e0efaa8d24605e7ae00b630c2ae984b7 | #include "Splash.h"
Splash::Splash(GLuint count,
GLuint lifeTime,
GLuint programID,
GLuint textureID,
GLuint positionAttr,
GLuint colorStartAttr,
GLuint colorEndAttr,
GLuint deltaAttr,
GLuint sizeUni... | #include "Splash.h"
Splash::Splash(GLuint count,
GLuint lifeTime,
GLuint programID,
GLuint textureID,
GLuint positionAttr,
GLuint colorStartAttr,
GLuint colorEndAttr,
GLuint deltaAttr,
GLuint sizeUni... |
void Splash::setSplashPosition(GLfloat x, GLfloat y) {
m_nLifeTime = TOTAL_LIFE_TIME;
for (int i = 0; i < m_nCount; i++) {
m_pPositionArray[i * 2] = x;
m_pPositionArray[i * 2 + 1] = y;
}
}
void Splash::setValues() {
m_nLifeTime--;
for (int i = 0; i < m_nCount; i++) {
... | void Splash::initArrays() {
m_pPositionArray = new GLfloat[m_nCount * 2];
Methods::fillArray(m_pPositionArray, 0.0f, m_nCount * 2);
m_pDeltaArray = new GLfloat[m_nCount];
m_pColorStartArray = new GLfloat[m_nCount * 4];
Methods::fillArray(m_pColorStartArray, 0.0f, m_nCount * 4);
... | function_block-full_function | [
{
"content": "def APP_CODE = 2\n",
"file_path": "game/build.gradle",
"rank": 0,
"score": 19471.39118875441
},
{
"content": " m_nColorResetTimer = COLOR_INITIAL_TIMER;\n\n m_bIsColorReset = true;\n\n}\n\n\n\nvoid Shape::setParticlesCount(GLuint count) {\n\n m_nCount = count > 5000 &&... |
C++ | media/gpu/chromeos/platform_video_frame_utils.cc | Ron423c/chromium | 2edf7b980065b648f8b2a6e52193d83832fe36b7 |
#include "media/gpu/chromeos/platform_video_frame_utils.h"
#include <drm_fourcc.h>
#include <xf86drm.h>
#include <limits>
#include "base/bind.h"
#include "base/callback_helpers.h"
#include "base/files/file.h"
#include "base/files/file_path.h"
#include "base/files/scoped_file.h"
#include "base/no_destructor.h"
#inc... |
#include "media/gpu/chromeos/platform_video_frame_utils.h"
#include <drm_fourcc.h>
#include <xf86drm.h>
#include <limits>
#include "base/bind.h"
#include "base/callback_helpers.h"
#include "base/files/file.h"
#include "base/files/file_path.h"
#include "base/files/scoped_file.h"
#include "base/no_destructor.h"
#inc... | fx::Size& natural_size,
base::TimeDelta timestamp,
gfx::BufferUsage buffer_usage) {
base::ScopedClosureRunner destroy_cb((base::DoNothing()));
auto gmb_handle =
AllocateGpuMemoryBufferHandle(factory, pixel_format, coded_size,
visible_rect, buffer_usage, destroy_cb);... | Wrapper& operator=(const GbmDeviceWrapper&) = delete;
static GbmDeviceWrapper* Get() {
static base::NoDestructor<GbmDeviceWrapper> gbm_device_wrapper;
return gbm_device_wrapper.get();
}
gfx::GpuMemoryBufferHandle CreateGpuMemoryBuffer(
gfx::BufferFormat format,
const gfx::Size& size,
... | random | [] |
C++ | projects/client/gui/bloom/source/bloom/Garden.cpp | silentorb/mythic-cpp | 97319d158800d77e1a944c47c13523662bc07e08 | #include "Garden.h"
#include "clienting/Mythic_Client.h"
#include "haft/Input_State.h"
#include "lookinglass/Lookinglass_Resources.h"
#include <iostream>
#include <bloom/layout/Axis.h>
#include <bloom/flowers/Group.h>
#include "framing/Frame_Info.h"
#include "bloom/flowers/Flower.h"
#include <bloom/flowers/Roo... | #include "Garden.h"
#include "clienting/Mythic_Client.h"
#include "haft/Input_State.h"
#include "lookinglass/Lookinglass_Resources.h"
#include <iostream>
#include <bloom/layout/Axis.h>
#include <bloom/flowers/Group.h>
#include "framing/Frame_Info.h"
#include "bloom/flowers/Flower.h"
#include <bloom/flowers/Roo... |
void Garden::update_layout() {
auto dimensions = draw.get_frame().get_dimensions();
converter.set_pixel_dimensions(dimensions);
Axis_Values_Old base_axis_values{
converter.get_axis_values<Horizontal_Axis>(),
converter.get_axis_values<Vertical_Axis>()
};
auto pixel_dimens... | void Garden::update_input(haft::Input_State &input_state) {
auto input_result = garden_input.update_input(input_state);
{
flowers::Flower &start = get_event_root();
if (input_result.mouse_click) {
auto &position = input_state.get_position();
if (start.check_event({Events::a... | function_block-full_function | [
{
"content": " class Root;\n\n }\n\n\n",
"file_path": "projects/client/gui/bloom/source/bloom/Garden.h",
"rank": 0,
"score": 198418.698124333
},
{
"content": " class Garden {\n\n// shared_ptr<Style> default_style;\n\n unique_ptr<flowers::Root> root;\n\n unique_ptr<haft::A... |
C++ | ProjectLunarFront/LogSystem.hpp | Edgaru089/ProjectLunarFront | bf59c6dec36e0576082acf3c72abf3c82bc92241 | #pragma once
#include <iostream>
#include <string>
#include <ctime>
#include <cstring>
#include <cstdio>
#include <functional>
#include <vector>
#include <mutex>
#include "StringParser.hpp"
using namespace std;
#define AUTOLOCK(a) lock_guard<mutex> __mutex_lock(a)
#ifndef DISABLE_ALL_LOGS
class Log {
public:
cons... | #pragma once
#include <iostream>
#include <string>
#include <ctime>
#include <cstring>
#include <cstdio>
#include <functional>
#include <vector>
#include <mutex>
#include "StringParser.hpp"
using namespace std;
#define AUTOLOCK(a) lock_guard<mutex> __mutex_lock(a)
#ifndef DISABLE_ALL_LOGS
class Log {
public:
cons... |
template<typename... Args>
void logf(LogLevel level, wstring format, Args... args) {
wchar_t buf[2560];
wsprintf(buf, format.c_str(), args...);
log(wstring(buf), level);
}
void operator() (const wstring& content, LogLevel level = Info) {
log(content, level);
}
void addOutputStream(wostream& output) { ... | void log(const wstring& content, LogLevel level = Info) {
if (level <= ignoreLevel) return;
time_t curtime = time(NULL);
wchar_t buffer[64] = {};
wcsftime(buffer, 63, L"[%T", localtime(&curtime));
wstring final = wstring(buffer) + L" " + logLevelName[level] + L"] " + content + L'\n';
lock.lock();
buffers.... | function_block-full_function | [
{
"content": "class StringDatabase :public Lockable {\n\npublic:\n\n\n\n\tbool initializeWithFolder(const fs::path& dbFolder);\n\n\n\n\tUuid insert(const string& contents);\n\n\tbool remove(Uuid id);\n\n\n\n\tconst StringDBObject& get(Uuid id) {\n\n\t\tlock_guard<Lockable>(*this);\n\n\t\tauto i = objs.find(id);... |
C++ | src/HistTool.cpp | xzf89718/bbtautau-hists | 3f20c9d9cf82149df12aef155c6dd148a367aece | #include "HistTool.h"
#include <exception>
#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
# define FOUR_COLUMN_TABLE(A, B, C, D) \
std::left << setw(36) << A \
<< std::left << setw(15) <... | #include "HistTool.h"
#include <exception>
#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
# define FOUR_COLUMN_TABLE(A, B, C, D) \
std::left << setw(36) << A \
<< std::left << setw(15) <... | oid HistToolHelper::rebinByNRebin(const Config* c)
{
vector<ProcessInfo*>* ps = c->processes->content();
for_each(ps->begin(), ps->end(), [&c](ProcessInfo* p) {
p->histogram->Rebin(c->current_variable->n_rebin);
for (auto& pp : p->systematic_histograms)
{
pp.second->Rebin(c->... | < 1)
{
cerr << "FAIL: empty input\n";
return false;
}
return true;
}
void HistTool::manipulate(Config* c)
{
c->setManipulated(true);
vector<ProcessInfo*>* ps_in_c = c->processes->content();
clog << "INFO: merging\n";
map<eProcess, vector<ProcessInfo*>> procs;
for_each... | random | [
{
"content": "class BasicInfo\n\n{\n\npublic:\n\n BasicInfo(const string& ecm, const string& lumi) noexcept;\n\n\n\npublic:\n\n string ecm;\n\n string luminosity;\n\n};\n\n\n\n\n",
"file_path": "src/Config.h",
"rank": 0,
"score": 76141.76415751204
},
{
"content": "class Config\n\n{\... |
C++ | src/GRCPrinter.cpp | dilawar/cec-esteral | c21ed6dea7392a3c4553d304eeeaaee188a6f567 | #include "GRCPrinter.hpp"
#include <cassert>
namespace GRCDot {
void GRCDP::visit_cfg(GRCNode *n) {
assert(n);
if (reached.find(n) == reached.end()) {
reached.insert(n);
assert(cfgnum.find(n) != cfgnum.end());
mynum = cfgnum[n];
o << 'n' << mynum << ' ';
n->wel... | #include "GRCPrinter.hpp"
#include <cassert>
namespace GRCDot {
void GRCDP::visit_cfg(GRCNode *n) {
assert(n);
if (reached.find(n) == reached.end()) {
reached.insert(n);
assert(cfgnum.find(n) != cfgnum.end());
mynum = cfgnum[n];
o << 'n' << mynum << ' ';
n->wel... |
Status GRCDP::visit(DefineSignal &s){
o << "[label=\"";
if (!clean) o << mynum << " DefS\\n";
o << s.signal->name
<< "\" shape=house orientation=90]\n";
return Status();
}
void GRCDP::visit_st(STNode *n) {
assert(n);
mynum = stnum[n];
o << 'n' << mynum << ' ';
n->welcome(*... | Status GRCDP::visit(Nop &s){
o << "[label=\"";
if (!clean) o << mynum << " ";
if (s.isflowin()) o << "*"; else
if (s.isshortcut()) o << "#";
else o << "\\n" << s.code;
o << "\" shape=circle]\n";
return Status();
} | function_block-function_prefix_line | [
{
"content": " class Sync;\n",
"file_path": "src/AST.hpp",
"rank": 0,
"score": 85744.66952829852
},
{
"content": " class Fork;\n",
"file_path": "src/AST.hpp",
"rank": 1,
"score": 85739.77028225773
},
{
"content": " class Action;\n",
"file_path": "src/AST.hpp",
... |
C++ | src/nlr/LPFormulator.cpp | yuvaljacoby/Marabou-1 | 553b780ef2e2cfe349b3954adc433a27af37a50f |
#include "GurobiWrapper.h"
#include "InfeasibleQueryException.h"
#include "LPFormulator.h"
#include "Layer.h"
#include "MStringf.h"
#include "NLRError.h"
#include "TimeUtils.h"
namespace NLR {
LPFormulator::LPFormulator( LayerOwner *layerOwner )
: _layerOwner( layerOwner )
, _cutoffInUse( false )
, _cut... |
#include "GurobiWrapper.h"
#include "InfeasibleQueryException.h"
#include "LPFormulator.h"
#include "Layer.h"
#include "MStringf.h"
#include "NLRError.h"
#include "TimeUtils.h"
namespace NLR {
LPFormulator::LPFormulator( LayerOwner *layerOwner )
: _layerOwner( layerOwner )
, _cutoffInUse( false )
, _cut... | rapper::Term> terms;
terms.append( GurobiWrapper::Term( 1, Stringf( "x%u", targetVariable ) ) );
gurobi.addEqConstraint( terms, 0 );
}
else
{
List<GurobiWrapper::Term> terms;
terms.appe... | %u", variable );
ub = solveLPRelaxation( layers,
MinOrMax::MAX,
variableName,
layer->getLayerIndex() );
if ( ub < currentUb )
{
if ( FloatUtils::... | random | [
{
"content": "class Stringf : public String\n\n{\n\npublic:\n\n enum {\n\n MAX_STRING_LENGTH = 10000,\n\n };\n\n\n\n Stringf( const char *format, ... )\n\n {\n\n va_list argList;\n\n va_start( argList, format );\n\n\n\n char buffer[MAX_STRING_LENGTH];\n\n\n\n vspri... |
C++ | cpp/meta/typelist.hpp | so61pi/examples | 38e2831cd6517864fc05f499f72fbb4ff6ae27c0 | #ifndef TYPELIST_HPP
#define TYPELIST_HPP
#include <cstddef>
#include <type_traits>
namespace tl {
template<typename... Ts>
struct typelist;
template<typename T, typename... Ts>
struct typelist<T, Ts...> {
using first_type = T;
using next = typelist<Ts...>;
using size = std::integral_constant<std::size... | #ifndef TYPELIST_HPP
#define TYPELIST_HPP
#include <cstddef>
#include <type_traits>
namespace tl {
template<typename... Ts>
struct typelist;
template<typename T, typename... Ts>
struct typelist<T, Ts...> {
using first_type = T;
using next = typelist<Ts...>;
using size = std::integral_constant<std::size... | late<typename Left, typename Right>
struct concat {
TYPELIST_ASSERT(Left)
TYPELIST_ASSERT(Right)
private:
using newLeft = typename push_back<Left, typename Right::first_type>::type;
using newRight = typename Right::next;
public:
using type = typename concat<newLeft, newRight>::type;
};
templa... | :type;
};
template<typename TypeList, typename IntegralIndex>
using remove_t = typename remove<TypeList, IntegralIndex>::type;
template<typename TypeList, std::size_t Index>
using remove_c = remove<TypeList, std::integral_constant<std::size_t, Index>>;
template<typename TypeList, std::size_t Index>
using remove_c_t ... | random | [
{
"content": "struct lambda<std::integral_constant<std::size_t, Index>> {\n\n using type =\n\n struct {\n\n template<typename... Xs>\n\n struct apply {\n\n static_assert(Index < sizeof...(Xs), \"index out of range\");\n\n \n\n using ty... |
C++ | cplusplus/call/src/alignment_functions.cpp | erasmus-center-for-biomics/Nimbus | bbf7ca288d798d8f1c6156ddf45fed31892bd557 |
#include <cstdlib>
#include <string>
#include <sstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <sam.h>
#include <alignment_functions.h>
#include <cigar.h>
#include <sample.h>
namespace nimbus {
std::string alignment_sequence( const bam1_t* alignment, int start, int end ) {
... |
#include <cstdlib>
#include <string>
#include <sstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <sam.h>
#include <alignment_functions.h>
#include <cigar.h>
#include <sample.h>
namespace nimbus {
std::string alignment_sequence( const bam1_t* alignment, int start, int end ) {
... |
std::string Strand( const bam1_t* alignment ) {
return bam_is_rev(alignment) ? "reverse" : "forward" ;
}
std::string Amplicon( const bam1_t* alignment ) {
uint8_t* p = bam_aux_get( alignment, "am" ) ;
if( p ) {
return std::string( bam_aux2Z(p) ) ;
}
return "unknown" ;
}
}
| std::string rval = "unknown" ;
if( label.size() != 2 )
return rval ;
uint8_t* p = bam_aux_get( alignment, label.c_str() ) ;
if( p ) {
rval = std::string( bam_aux2Z(p) ) ;
}
return rval ;
} | function_block-function_prefix_line | [
{
"content": "\tclass CigarOperation {\n\n\t\tchar _operation ;\n\n\t\tstd::size_t _runlength ;\n\n\n\n\tpublic:\n\n\t\tCigarOperation() {\n\n\t\t\t_operation = '?' ;\n\n\t\t\t_runlength = 0 ;\n\n\t\t}\n\n\n\n\t\tCigarOperation( char o, std::size_t n ) {\n\n\t\t\tset( o, n ) ;\n\n\t\t}\n\n\n\n\t\tvoid set( char... |
C++ | software/src/master/src/vca_sample_distribution_server/vca_sample_distribution_server.cpp | c-kuhlman/vision | 46b25f7c0da703c059acc8f0a2eac1d5badf9f6d |
#include "Vk.h"
#include "Vca_VOneAppMain_.h"
#include "Vca_VServerApplication.h"
#include "Vca_VLineGrabber.h"
#include "vca_samples_ipublication.h"
#include "vca_samples_isubscription.h"
namespace VcaSamples {
class ThisApp : public Vca::VServerApplication {
DECLARE_CONCRETE_RTT (ThisApp, Vca::VServerAp... |
#include "Vk.h"
#include "Vca_VOneAppMain_.h"
#include "Vca_VServerApplication.h"
#include "Vca_VLineGrabber.h"
#include "vca_samples_ipublication.h"
#include "vca_samples_isubscription.h"
namespace VcaSamples {
class ThisApp : public Vca::VServerApplication {
DECLARE_CONCRETE_RTT (ThisApp, Vca::VServerAp... |
bool VcaSamples::ThisApp::start_() {
if (!BaseClass::start_())
return false;
if (offerSelf ())
getStandardInput ();
else {
fprintf (stderr, "Usage: No address to offer object.\n");
setExitStatus (ErrorExitValue);
}
return isStarting ();
}
void VcaSamples::ThisApp::onStandardInput (Vca::VB... | void VcaSamples::ThisApp::Subscribe (
IPublication *pRole, ISubscriber *pSubscriber, IRecipient *pRecipient, bool bSuspended
) {
if (pSubscriber) {
Subscription::IRecipient::Reference pMessageReceiver (
dynamic_cast<Subscription::IRecipient*>(pRecipient)
);
if (pMessageReceiver.isNil ())
pSubscribe... | function_block-full_function | [
{
"content": "\t class Property_<void (Container_T::*)(IVReceiver<Value_T>*) const> : public Property {\n\n\tpublic:\n\n\t typedef void (Container_T::*accessor_t)(IVReceiver<Value_T>*) const;\n\n\t typedef Property_<accessor_t> this_t;\n\n\t DECLARE_CONCRETE_RTTLITE (this_t, Property);\n\n\n\n\t// ... |
C++ | nestedtensor/csrc/nested_tensor_impl.cpp | jbschlosser/nestedtensor | 29d58d85ccd2c1b47fc40f2786f08c713f49acc6 | #include <ATen/ATen.h>
#include <ATen/NamedTensorUtils.h>
#include <ATen/WrapDimUtils.h>
#include <ATen/core/op_registration/op_registration.h>
#include <nestedtensor/csrc/nested_tensor_impl.h>
#include <nestedtensor/csrc/utils/nested_node_functions.h>
#include <torch/csrc/jit/runtime/operator.h>
#include <torch/librar... | #include <ATen/ATen.h>
#include <ATen/NamedTensorUtils.h>
#include <ATen/WrapDimUtils.h>
#include <ATen/core/op_registration/op_registration.h>
#include <nestedtensor/csrc/nested_tensor_impl.h>
#include <nestedtensor/csrc/utils/nested_node_functions.h>
#include <torch/csrc/jit/runtime/operator.h>
#include <torch/librar... | },
self);
}
Tensor& NestedTensor_squeeze_(Tensor& self) {
self = _NestedTensor_squeeze_(self, c10::nullopt);
return self;
}
Tensor& NestedTensor_squeeze__dim(Tensor& self, int64_t dim) {
self = _NestedTensor_squeeze_(self, dim);
return self;
}
Tensor NestedTensor_squeeze_dim(const Tensor& self, int64_... | return wrap_buffer(get_buffer(self_cont), get_efficient_nested_size(self), new_strides);
}
TORCH_CHECK(false, "Given memory format ", memory_format, " not supported by NestedTensor_contiguous.");
return self;
}
bool NestedTensor_is_pinned(const Tensor& self, c10::optional<Device> device) {
TORCH_CHECK(
... | random | [
{
"content": " int64_t height() const {\n\n return _height;\n",
"file_path": "nestedtensor/csrc/storage/EfficientSizeNode.h",
"rank": 0,
"score": 146452.20706677216
},
{
"content": " int64_t dim() const {\n\n return _sizes.dim() > 0 ? _height + _sizes.size(1) : _height;\n",
"file... |
C++ | GDADPRG_Courseware/TextureManager.cpp | NeilDG/GDADPRG-GDPARCM_Courseware | 771509ec7b3eb6d6375807819ca9da957dd22641 | #include <stddef.h>
#include <iostream>
#include "TextureManager.h"
TextureManager* TextureManager::sharedInstance = NULL;
TextureManager* TextureManager::getInstance() {
if (sharedInstance == NULL) {
sharedInstance = new TextureManager();
}
return sharedInstance;
}
void TextureManager::loadAll() {
sf::Tex... | #include <stddef.h>
#include <iostream>
#include "TextureManager.h"
TextureManager* TextureManager::sharedInstance = NULL;
TextureManager* TextureManager::getInstance() {
if (sharedInstance == NULL) {
sharedInstance = new TextureManager();
}
return sharedInstance;
}
void TextureManager::loadAll() {
sf::Tex... |
sf::Texture* TextureManager::getTextureAt(TextureManager::AssetType assetType, int index) {
if (!this->textureMap[assetType].empty()) {
return this->textureMap[assetType][index];
}
else {
cout << "No texture found for " << assetType;
return NULL;
}
}
int TextureManager::getTextureLength(TextureManager::Ass... | h_back(texture);
texture = new sf::Texture();
texture->loadFromFile("Media/Textures/coin0005.png");
this->textureMap[Coin].push_back(texture);
texture = new sf::Texture();
texture->loadFromFile("Media/Textures/coin0006.png");
this->textureMap[Coin].push_back(texture);
texture = new sf::Texture();
texture->lo... | function_block-function_prefixed | [
{
"content": "class RenderTexture;\n",
"file_path": "SFML-2.5.1/include/SFML/Graphics/Texture.hpp",
"rank": 0,
"score": 96601.72563755105
},
{
"content": " class RenderTextureImpl;\n\n}\n\n\n",
"file_path": "SFML-2.5.1/include/SFML/Graphics/RenderTexture.hpp",
"rank": 1,
"scor... |
C++ | src/tests/test_fixedindexarray.cpp | P-Sc/Pirateers | 440e477d33bbbcd79d291700c369f74fd0a6cc7d | #include "test_fixedindexarray.h"
#include "utils/fixedindexarray.h"
void Test_FixedIndexArray::test1() {
currentTestCase = 1;
log("Testing: add() and getSize()");
for (unsigned int i = 50; i < 150; i++) {
fixArray1->add(i);
fixArray2->add(i);
}
if (fixArray1->getSize() == 100 && ... | #include "test_fixedindexarray.h"
#include "utils/fixedindexarray.h"
void Test_FixedIndexArray::test1() {
currentTestCase = 1;
log("Testing: add() and getSize()");
for (unsigned int i = 50; i < 150; i++) {
fixArray1->add(i);
fixArray2->add(i);
}
if (fixArray1->getSize() == 100 && ... |
void Test_FixedIndexArray::test3() {
currentTestCase = 3;
log("Testing: get()");
for (unsigned int i = 100; i < 205; i++) {
fixArray1->add(i);
fixArray2->add(i);
}
for (unsigned int i = 0; i < 100; i++) {
if (fixArray1->get(i) != i+100 || fixArray2->get(i) != i+100) {
... | i++) {
fixArray1->add(i);
fixArray2->add(i);
}
for (unsigned int i = 0; i < 250; i++) {
fixArray1->erase(2*i);
fixArray2->erase(2*i);
}
if (fixArray1->getSize() != 250 || fixArray2->getSize() != 250)
reportFailure();
for (unsigned int i = 0; i < 50; i++) {
... | function_block-function_prefixed | [
{
"content": "#include \"fixedindexarray.h\"\n\n#include <stdexcept>\n\n#include <cassert>\n\n\n\nusing std::list;\n\n\n\n/**\n\n * @brief Vergrößert das Array um stepSize (Standard: 100)\n\n */\n\nvoid FixedIndexArray::appendStepSize() {\n\n // unusedPosition anpassen\n\n for (unsigned int i = 0; i < ste... |
C++ | code/tool/edges-master/piotr_toolbox/matlab/private/dijkstra1.cpp | hyliang96/interpretableCNN_matlab | 611e52a1aa25434ab058303c0287634767327da3 |
#if (_MSC_VER >= 1600)
#define __STDC_UTF_16__
typedef unsigned short char16_t;
#endif
#include "mex.h"
#include "fibheap.h"
#define DIJKSTRA_CPP
class HeapNode : public FibHeapNode {
double N;
long int IndexV;
public:
HeapNode() : FibHeapNode() { N = 0; };
virtual void operator =(FibHeapNode& RHS);
... |
#if (_MSC_VER >= 1600)
#define __STDC_UTF_16__
typedef unsigned short char16_t;
#endif
#include "mex.h"
#include "fibheap.h"
#define DIJKSTRA_CPP
class HeapNode : public FibHeapNode {
double N;
long int IndexV;
public:
HeapNode() : FibHeapNode() { N = 0; };
virtual void operator =(FibHeapNode& RHS);
... |
void dijkstra( long int n, long int nSrc, double *sources, double *D, double *P, const mxArray *G ) {
double *Gpr = mxGetPr(G);
mwIndex *Gir = mxGetIr(G);
mwIndex *Gjc = mxGetJc(G);
double *D1 = (double *) mxCalloc( n , sizeof( double ));
double *P1 = (double *) mxCalloc( n , sizeof( double ));
... | void dijkstra1( long int n, long int s, double *D1, double *P1, double *Gpr, mwIndex *Gir, mwIndex *Gjc) {
int finished;
long int i, startInd, endInd, whichNeigh, nDone, closest;
double closestD, arcLength, INF, SMALL, oldDist;
HeapNode *A, *hnMin, hnTmp; FibHeap *heap;
INF=mxGetInf(); SMALL=mxGetEps()... | function_block-full_function | [
{
"content": " class MexContext : public Context\n\n {\n\n public:\n\n MexContext() ;\n\n ~MexContext() ;\n\n\n\n protected:\n\n#if ENABLE_GPU\n\n vl::ErrorCode initGpu() ;\n\n vl::ErrorCode validateGpu() ;\n\n mxArray * canary ; // if it breathes, the GPU state is valid\n\n bool gpuIsInit... |
C++ | ios/samples/hello-ar/hello-ar/FilamentArView/FilamentApp.cpp | andykit/filament | f4f9f331c0882db6b58d1ec5ea2bb42ae9baf1d4 |
#include "FilamentApp.h"
#include <filament/Camera.h>
#include <filament/IndexBuffer.h>
#include <filament/LightManager.h>
#include <filament/Material.h>
#include <filament/TransformManager.h>
#include <filament/VertexBuffer.h>
#include <filament/Viewport.h>
#include <filameshio/MeshReader.h>
#include <geometry/Sur... |
#include "FilamentApp.h"
#include <filament/Camera.h>
#include <filament/IndexBuffer.h>
#include <filament/LightManager.h>
#include <filament/Material.h>
#include <filament/TransformManager.h>
#include <filament/VertexBuffer.h>
#include <filament/Viewport.h>
#include <filameshio/MeshReader.h>
#include <geometry/Sur... |
void FilamentApp::setupMesh() {
MeshReader::Mesh mesh = MeshReader::loadMeshFromBuffer(engine, RESOURCES_CUBE_DATA,
nullptr, nullptr, app.materialInstance);
app.materialInstance->setParameter("baseColor", RgbType::sRGB, {0.71f, 0.0f, 0.0f});
app.renderable = mesh.renderable;
scene->addEnt... | void FilamentApp::setupMaterial() {
app.mat = Material::Builder()
.package(RESOURCES_CLEAR_COAT_DATA, RESOURCES_CLEAR_COAT_SIZE)
.build(*engine);
app.materialInstance = app.mat->createInstance();
} | function_block-full_function | [] |
C++ | ReactNativeFrontend/ios/Pods/boost/boost/contract/detail/decl.hpp | Harshitha91/Tmdb-react-native-node | e06e3f25a7ee6946ef07a1f524fdf62e48424293 |
#ifndef BOOST_CONTRACT_DETAIL_DECL_HPP_
#define BOOST_CONTRACT_DETAIL_DECL_HPP_
#include <boost/contract/detail/tvariadic.hpp>
#if !BOOST_CONTRACT_DETAIL_TVARIADIC
#include <boost/contract/core/config.hpp>
#include <boost/preprocessor/repetition/repeat.hpp>
#include <boost/preprocessor/tuple/elem.hpp>
... |
#ifndef BOOST_CONTRACT_DETAIL_DECL_HPP_
#define BOOST_CONTRACT_DETAIL_DECL_HPP_
#include <boost/contract/detail/tvariadic.hpp>
#if !BOOST_CONTRACT_DETAIL_TVARIADIC
#include <boost/contract/core/config.hpp>
#include <boost/preprocessor/repetition/repeat.hpp>
#include <boost/preprocessor/tuple/elem.hpp>
... | \
BOOST_PP_REPEAT_ ## z( \
BOOST_PP_INC(BOOST_CONTRACT_MAX_ARGS), \
BOOST_CONTRACT_DETAIL_DECL_FRIEND_OVERRIDING_PUBLIC_FUNCTION_, \
( 0, O, VR, F, C, Args, v, r, f, obj, args) \
) \
BOOST_PP_REPEAT_ ## z( \
BOOST_PP_INC(BOOST_CONTRACT_MAX_ARGS), ... | ult_O_R_F_C_Args_v_r_f_obj_args), \
BOOST_PP_TUPLE_ELEM(11, 3, result_O_R_F_C_Args_v_r_f_obj_args), \
BOOST_PP_TUPLE_ELEM(11, 4, result_O_R_F_C_Args_v_r_f_obj_args), \
BOOST_PP_TUPLE_ELEM(11, 5, result_O_R_F_C_Args_v_r_f_obj_args), \
BOOST_PP_TUPLE_ELEM(11, 6, result_O_R_... | random | [] |
C++ | sdk/rms_sdk/Platform/Http/HttpClientQt.cpp | AzureAD/rms-sdk-for-cpp | 0e5d54a030008c5c0f70d8d3d0695fa0722b6ab6 |
#ifdef QTFRAMEWORK
#include "HttpClientQt.h"
#include <QThread>
#include <QMutex>
#include <QEventLoop>
#include <QCoreApplication>
#include <QTimer>
#include <QNetworkProxyFactory>
#include "../Logger/Logger.h"
#include "../../ModernAPI/RMSExceptions.h"
#include "mscertificates.h"
#include "HttpClientQt.h"
using ... |
#ifdef QTFRAMEWORK
#include "HttpClientQt.h"
#include <QThread>
#include <QMutex>
#include <QEventLoop>
#include <QCoreApplication>
#include <QTimer>
#include <QNetworkProxyFactory>
#include "../Logger/Logger.h"
#include "../../ModernAPI/RMSExceptions.h"
#include "mscertificates.h"
#include "HttpClientQt.h"
using ... | ));
QObject::connect(lastReply_, SIGNAL(finished()), &loop, SLOT(quit()));
QObject::connect(lastReply_, &QNetworkReply::sslErrors,
[ = ](QList<QSslError>errorList) {
for (auto& error : errorList) {
Logger::Error("QSslError: %s",
error.errorString().... | shared_ptr<std::atomic<bool> >cancelState)
{
Logger::Info("==> GetWithCoreAppContext %s", url.data());
this->request_.setUrl(QUrl(url.c_str()));
Logger::Hidden("==> Request headers:");
foreach(const QByteArray &hdrName, this->request_.rawHeaderList()) {
QByteArray hdrValue = this->request_.rawHeader(hdrN... | random | [
{
"content": "namespace rmscore { namespace restclients {\n\n\n\nvoid HandleRestClientError(platform::http::StatusCode httpStatusCode, rmscore::common::ByteArray &sResponse);\n\n\n\n} // namespace restclients\n",
"file_path": "sdk/rms_sdk/RestClients/RestClientErrorHandling.h",
"rank": 0,
"score": 1... |
C++ | rocsolver/clients/gtest/getri_gtest.cpp | eidenyoshida/rocSOLVER | 1240759207b63f8aeba51db259873141c72f9735 |
#include "testing_getri.hpp"
using ::testing::Combine;
using ::testing::TestWithParam;
using ::testing::Values;
using ::testing::ValuesIn;
using namespace std;
typedef vector<int> getri_tuple;
const vector<vector<int>> matrix_size_range = {
{0, 1},
{-1, 1}, {20, 5},
{32, 32}, {50, 50}, ... |
#include "testing_getri.hpp"
using ::testing::Combine;
using ::testing::TestWithParam;
using ::testing::Values;
using ::testing::ValuesIn;
using namespace std;
typedef vector<int> getri_tuple;
const vector<vector<int>> matrix_size_range = {
{0, 1},
{-1, 1}, {20, 5},
{32, 32}, {50, 50}, ... |
TEST_P(GETRI, __float_complex) {
Arguments arg = getri_setup_arguments(GetParam());
if (arg.N == 0)
testing_getri_bad_arg<false,false,rocblas_float_complex>();
arg.batch_count = 1;
testing_getri<false,false,rocblas_float_complex>(arg);
}
TEST_P(GETRI, __double_complex) {
Arguments arg =... | TEST_P(GETRI, __double) {
Arguments arg = getri_setup_arguments(GetParam());
if (arg.N == 0)
testing_getri_bad_arg<false,false,double>();
arg.batch_count = 1;
testing_getri<false,false,double>(arg);
} | function_block-full_function | [
{
"content": "class RocBLAS_Test : public testing::TestWithParam<Arguments>\n\n{\n\nprotected:\n\n // This template functor returns true if the type arguments are valid.\n\n // It converts a FILTER specialization to bool to test type matching.\n\n template <typename... T>\n\n struct type_filter_func... |
C++ | Servers/ServerManager/vtkSMNewWidgetRepresentationProxy.cxx | utkarshayachit/ParaView | 7bbb2aa16fdef9cfbcf4a3786cad905d6770771b |
#include "vtkSMNewWidgetRepresentationProxy.h"
#include "vtkAbstractWidget.h"
#include "vtkClientServerInterpreter.h"
#include "vtkCommand.h"
#include "vtkObjectFactory.h"
#include "vtkProcessModule.h"
#include "vtkPVGenericRenderWindowInteractor.h"
#include "vtkSmartPointer.h"
#include "vtkSMDoubleVectorProperty.h"
... |
#include "vtkSMNewWidgetRepresentationProxy.h"
#include "vtkAbstractWidget.h"
#include "vtkClientServerInterpreter.h"
#include "vtkCommand.h"
#include "vtkObjectFactory.h"
#include "vtkProcessModule.h"
#include "vtkPVGenericRenderWindowInteractor.h"
#include "vtkSmartPointer.h"
#include "vtkSMDoubleVectorProperty.h"
... | Prop2D");
}
if (!this->RepresentationProxy)
{
vtkErrorMacro(
"A representation proxy must be defined as a Prop (or Prop2D) sub-proxy");
return;
}
this->RepresentationProxy->SetServers(
vtkProcessModule::RENDER_SERVER | vtkProcessModule::CLIENT);
this->WidgetProxy = this->GetSubProxy... | h"
#include "vtkWeakPointer.h"
#include "vtkWidgetRepresentation.h"
#include <vtkstd/list>
vtkStandardNewMacro(vtkSMNewWidgetRepresentationProxy);
class vtkSMNewWidgetRepresentationObserver : public vtkCommand
{
public:
static vtkSMNewWidgetRepresentationObserver *New()
{ return new vtkSMNewWidgetRepresentati... | random | [
{
"content": "def get_include():\n\n \"\"\"\n\n Return the directory in the package that contains header files.\n\n\n\n Extension modules that need to compile against mpi4py should use\n\n this function to locate the appropriate include directory. Using\n\n Python distutils (or perhaps NumPy dist... |
C++ | torch/lib/THD/master_worker/master/generic/THDStorage.cpp | DavidKo3/mctorch | 53ffe61763059677978b4592c8b2153b0c15428f | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "master_worker/master/generic/THDStorage.cpp"
#else
using namespace thd;
using namespace rpc;
using namespace master;
static THDStorage* THDStorage_(_alloc)() {
THDStorage* new_storage = new THDStorage();
std::memset(reinterpret_cast<void*>(new_storage), 0, sizeof(n... | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "master_worker/master/generic/THDStorage.cpp"
#else
using namespace thd;
using namespace rpc;
using namespace master;
static THDStorage* THDStorage_(_alloc)() {
THDStorage* new_storage = new THDStorage();
std::memset(reinterpret_cast<void*>(new_storage), 0, sizeof(n... |
void THDStorage_(setFlag)(THDStorage *storage, const char flag) {
storage->flag |= flag;
}
void THDStorage_(clearFlag)(THDStorage *storage, const char flag) {
storage->flag &= ~flag;
}
void THDStorage_(retain)(THDStorage *storage) {
if (storage && (storage->flag & TH_STORAGE_REFCOUNTED))
storage->refcount... | 1, real value2, real value3, real value4) {
RPCType type = type_traits<real>::type;
THDStorage *storage = THDStorage_(_alloc)();
storage->size = 4;
masterCommandChannel->sendMessage(
packMessage(
Functions::storageNewWithSize1,
type,
storage,
value1,
value2,
value3,
... | function_block-function_prefixed | [
{
"content": " ptrdiff_t size;\n",
"file_path": "torch/lib/THD/master_worker/master/generic/THDStorage.h",
"rank": 0,
"score": 379224.93917560467
},
{
"content": " ptrdiff_t storageOffset;\n",
"file_path": "torch/lib/THD/master_worker/master/generic/THDTensor.h",
"rank": 1,
"sc... |
C++ | cpp/fntest/pubnub_fntest_runner.cpp | mrtryhard/c-core | 4c3c7009a133bf770c255243a2fc580f1629110e |
#include "pubnub_fntest_basic.hpp"
#include "pubnub_fntest_medium.hpp"
#include <iostream>
#include <functional>
#include <condition_variable>
#include <thread>
#include <cstdlib>
#include <cstring>
#if defined _WIN32
#include "windows/console_subscribe_paint.h"
#else
#include "posix/console_subscribe_paint.h"
#end... |
#include "pubnub_fntest_basic.hpp"
#include "pubnub_fntest_medium.hpp"
#include <iostream>
#include <functional>
#include <condition_variable>
#include <thread>
#include <cstdlib>
#include <cstring>
#if defined _WIN32
#include "windows/console_subscribe_paint.h"
#else
#include "posix/console_subscribe_paint.h"
#end... | ;
notify(aTest[i], TestResult::pass);
}
catch (std::exception &ex) {
std::cout << std::endl;
paint_text_white_with_background_red();
std::cout << " !! " << i+1 << ". test '" << aTest[i... | aTest[i].pf(pubkey.c_str(),
keysub.c_str(),
origin.c_str(),
cannot_do_chan_group) | call_expression | [
{
"content": "enum class TestResult { fail, pass, indeterminate };\n\nQ_DECLARE_METATYPE(TestResult);\n\n\n\nusing TestFN_T =\n\n std::function<void(std::string const&, std::string const&, std::string const&, bool const&)>;\n\n\n",
"file_path": "qt/fntest/pubnub_fntest_runner.cpp",
"rank": 0,
"sc... |
C++ | RecoEgamma/EgammaTools/plugins/HGCalPhotonIDValueMapProducer.cc | nistefan/cmssw | ea13af97f7f2117a4f590a5e654e06ecd9825a5b |
#include <memory>
#include "FWCore/Framework/interface/Frameworkfwd.h"
#include "FWCore/Framework/interface/stream/EDProducer.h"
#include "FWCore/Framework/interface/Event.h"
#include "FWCore/Framework/interface/MakerMacros.h"
#include "FWCore/ParameterSet/interface/ParameterSet.h"
#include "FWCore/Utilities/inter... |
#include <memory>
#include "FWCore/Framework/interface/Frameworkfwd.h"
#include "FWCore/Framework/interface/stream/EDProducer.h"
#include "FWCore/Framework/interface/Event.h"
#include "FWCore/Framework/interface/MakerMacros.h"
#include "FWCore/ParameterSet/interface/ParameterSet.h"
#include "FWCore/Utilities/inter... |
HGCalPhotonIDValueMapProducer::HGCalPhotonIDValueMapProducer(const edm::ParameterSet& iConfig) :
photonsToken_(consumes<edm::View<reco::Photon>>(iConfig.getParameter<edm::InputTag>("photons"))),
radius_(iConfig.getParameter<double>("pcaRadius"))
{
for(const auto& key : valuesProduced_) {
maps_[key] = {};
... | const std::vector<std::string> HGCalPhotonIDValueMapProducer::valuesProduced_ = {
"seedEt",
"seedEnergy",
"seedEnergyEE",
"seedEnergyFH",
"seedEnergyBH",
"pcaEig1",
"pcaEig2",
"pcaEig3",
"pcaSig1",
"pcaSig2",
"pcaSig3",
"sigmaUU",
"sigmaVV",
"sigmaEE",
"sigmaP... | assignment_statement | [] |
C++ | google/cloud/dialogflow_cx/internal/flows_logging_decorator.cc | GoogleCloudPlatform/google-cloud-cpp | c4fc35de9e15f95b1dbf585f1c96de5dba609e2b |
#include "google/cloud/dialogflow_cx/internal/flows_logging_decorator.h"
#include "google/cloud/internal/log_wrapper.h"
#include "google/cloud/status_or.h"
#include <google/cloud/dialogflow/cx/v3/flow.grpc.pb.h>
#include <memory>
namespace google {
namespace cloud {
namespace dialogflow_cx_internal {
GOOGLE_CLOUD_CP... |
#include "google/cloud/dialogflow_cx/internal/flows_logging_decorator.h"
#include "google/cloud/internal/log_wrapper.h"
#include "google/cloud/status_or.h"
#include <google/cloud/dialogflow/cx/v3/flow.grpc.pb.h>
#include <memory>
namespace google {
namespace cloud {
namespace dialogflow_cx_internal {
GOOGLE_CLOUD_CP... | text,
google::cloud::dialogflow::cx::v3::ExportFlowRequest const& request) {
return google::cloud::internal::LogWrapper(
[this](
google::cloud::CompletionQueue& cq,
std::unique_ptr<grpc::ClientContext> context,
google::cloud::dialogflow::cx::v3::ExportFlowRequest const& request... | ntext,
google::cloud::dialogflow::cx::v3::DeleteFlowRequest const& request) {
return google::cloud::internal::LogWrapper(
[this](
grpc::ClientContext& context,
google::cloud::dialogflow::cx::v3::DeleteFlowRequest const& request) {
return child_->DeleteFlow(context, request);
... | random | [
{
"content": "// A generic request. Fields with a \"testonly_\" prefix are used for testing but\n\n// are not used in the real code.\n\nstruct Request {\n\n std::string testonly_page_token;\n\n void set_page_token(std::string token) {\n\n testonly_page_token = std::move(token);\n\n }\n\n};\n\n\n",
"fi... |
C++ | source/XMPFiles/FileHandlers/TIFF_Handler.cpp | maemo-foss/maemo-package-exempi | 684c589c987a1b9f01a1d60114363ce8326c2be5 |
#include "TIFF_Handler.hpp"
#include "TIFF_Support.hpp"
#include "PSIR_Support.hpp"
#include "IPTC_Support.hpp"
#include "ReconcileLegacy.hpp"
#include "MD5.h"
using namespace std;
bool TIFF_CheckFormat ( XMP_FileFormat format,
XMP_StringPtr filePath,
LFA_FileRef f... |
#include "TIFF_Handler.hpp"
#include "TIFF_Support.hpp"
#include "PSIR_Support.hpp"
#include "IPTC_Support.hpp"
#include "ReconcileLegacy.hpp"
#include "MD5.h"
using namespace std;
bool TIFF_CheckFormat ( XMP_FileFormat format,
XMP_StringPtr filePath,
LFA_FileRef f... |
TIFF_MetaHandler::~TIFF_MetaHandler()
{
if ( this->psirMgr != 0 ) delete ( this->psirMgr );
if ( this->iptcMgr != 0 ) delete ( this->iptcMgr );
}
void TIFF_MetaHandler::CacheFileData()
{
LFA_FileRef fileRef = this->parent->fileRef;
XMP_PacketInfo & packetInfo = this->packetInfo;
XMP_AbortProc abor... | TIFF_MetaHandler::TIFF_MetaHandler ( XMPFiles * _parent ) : psirMgr(0), iptcMgr(0)
{
this->parent = _parent;
this->handlerFlags = kTIFF_HandlerFlags;
this->stdCharForm = kXMP_Char8Bit;
} | function_block-full_function | [
{
"content": "\tclass ScanError : public std::logic_error {\n\n\tpublic:\n\n\t\tScanError() throw() : std::logic_error ( \"\" ) {}\n\n\t\texplicit ScanError ( const char * message ) throw() : std::logic_error ( message ) {}\n\n\t\tvirtual ~ScanError() throw() {}\n\n\t};\n\n\n\nprivate:\t// XMPScanner\n\n\t\n",
... |
C++ | tests/test_cases/one_hot_gpu_test.cpp | intel/clDNN | c4ef3bd7b707fc386655cccf90e6c0420d1efec7 |
#include <gtest/gtest.h>
#include <api/CPP/engine.hpp>
#include <api/CPP/input_layout.hpp>
#include <api/CPP/memory.hpp>
#include <api/CPP/one_hot.hpp>
#include <api/CPP/topology.hpp>
#include <api/CPP/network.hpp>
#include "test_utils/test_utils.h"
#include <cstddef>
using namespace cldnn;
using namespace ::test... |
#include <gtest/gtest.h>
#include <api/CPP/engine.hpp>
#include <api/CPP/input_layout.hpp>
#include <api/CPP/memory.hpp>
#include <api/CPP/one_hot.hpp>
#include <api/CPP/topology.hpp>
#include <api/CPP/network.hpp>
#include "test_utils/test_utils.h"
#include <cstddef>
using namespace cldnn;
using namespace ::test... |
TEST(one_hot_error, basic_error_wrong_axis) {
const auto& engine = get_test_engine();
auto input = memory::allocate(engine, { data_types::i32, format::bfyx,{ 1, 1, 1, 1 } });
topology topology;
topology.add(input_layout("input", input.get_layout()));
topology.add(one_hot("output", "input", tenso... | layout()));
topology.add(one_hot("output", "input", tensor(10, 1, 1, 50), 2));
std::string msg_to_find = "Incorrect parameters configuration: input batch size should be equal to 1.";
EXPECT_ANY_THROW(check_exception_massage(engine, topology, msg_to_find));
} | function_block-function_prefixed | [
{
"content": "#include \"api/CPP/scale_grad_input.hpp\"\n\n#include <api/CPP/topology.hpp>\n\n#include <api/CPP/network.hpp>\n\n#include <api/CPP/engine.hpp>\n\n#include \"test_utils/test_utils.h\"\n\n\n\n#include <iostream>\n\n\n\nusing namespace cldnn;\n\nusing namespace tests;\n\n\n\nTEST(scale_grad_input_gp... |
C++ | qt-creator-opensource-src-4.6.1/src/libs/qmljs/qmljsutils.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f |
#include "qmljsutils.h"
#include "parser/qmljsast_p.h"
#include <QColor>
#include <QDir>
#include <QRegularExpression>
using namespace QmlJS;
using namespace QmlJS::AST;
namespace {
class SharedData
{
public:
SharedData()
{
validBuiltinPropertyNames.insert(QLatin1String("action"));
validBu... |
#include "qmljsutils.h"
#include "parser/qmljsast_p.h"
#include <QColor>
#include <QDir>
#include <QRegularExpression>
using namespace QmlJS;
using namespace QmlJS::AST;
namespace {
class SharedData
{
public:
SharedData()
{
validBuiltinPropertyNames.insert(QLatin1String("action"));
validBu... |
for (UiObjectMemberList *iter = initializer->members; iter; iter = iter->next) {
if (UiScriptBinding *script = cast<UiScriptBinding*>(iter->member)) {
if (!script->qualifiedId)
continue;
if (script->qualifiedId->next)
continue;
if (script... | if (!initializer) {
initializer = cast<UiObjectInitializer *>(object);
if (!initializer)
return QString();
} | if_condition | [] |
C++ | MouseToVJoy/cInputDevices.cpp | R1PeR/MouseToVJoy | c5487f6bf6e3db8ac41478a612a6c2642c69b7af | #include "input.h"
void CInputDevices::getData(LPARAM lParam)
{
UINT bufferSize;
GetRawInputData((HRAWINPUT)lParam, RID_INPUT, NULL, &bufferSize, sizeof(RAWINPUTHEADER));
if (bufferSize <= 40)
GetRawInputData((HRAWINPUT)lParam, RID_INPUT, (LPVOID)_buffer, &bufferSize, sizeof(RAWINPUTHEADER));
RAWINPUT *... | #include "input.h"
void CInputDevices::getData(LPARAM lParam)
{
UINT bufferSize;
GetRawInputData((HRAWINPUT)lParam, RID_INPUT, NULL, &bufferSize, sizeof(RAWINPUTHEADER));
if (bufferSize <= 40)
GetRawInputData((HRAWINPUT)lParam, RID_INPUT, (LPVOID)_buffer, &bufferSize, sizeof(RAWINPUTHEADER));
RAWINPUT *... | yState == false)
{
if (isLastKeyState == true)
{
return true;
}
else
{
return true;
}
}
else if (isThisKeyState == true)
{
if (isLastKeyState == false)
{
return false;
}
else
return false;
}
}
| && bStateUp == false)
{
_isLeftMouseButtonPressed = true;
_isKeyboardButtonPressed[0x01] = true;
}
if (bStateUp == true)
{
_isLeftMouseButtonPressed = false;
_isKeyboardButtonPressed[0x01] = false;
}
bool bStateDownTwo = raw->data.mouse.usButtonFlags & RI_MOUSE_RIGHT_BUTTON_DOWN;
bool bStat... | random | [
{
"content": "#include <windows.h>\n\n#include <string>\n\n#include \"forcefeedback.h\"\n\n\n\nusing namespace std;\n\n// Convert Packet type to String\n\nBOOL ForceFeedBack::packetType2Str(FFBPType type, LPTSTR outStr)\n\n{\n\n\tBOOL stat = TRUE;\n\n\tLPTSTR Str = \"\";\n\n\n\n\tswitch (type)\n\n\t{\n\n\tcase ... |
C++ | include/bunsan/config/traits.hpp | sarum9in/bunsan_common | 1d113259e2e53de025ba28bd9df485d75f437921 | #pragma once
#include <boost/unordered_map.hpp>
#include <boost/unordered_set.hpp>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
namespace bunsan {
namespace config {
namespace traits {
temp... | #pragma once
#include <boost/unordered_map.hpp>
#include <boost/unordered_set.hpp>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
namespace bunsan {
namespace config {
namespace traits {
temp... | : std::integral_constant<bool, true> {};
template <typename Key, typename Tp, typename Compare, typename Alloc>
struct is_map<std::multimap<Key, Tp, Compare, Alloc>>
: std::integral_constant<bool, true> {};
template <typename Value, typename Hash, typename Pred, typename Alloc>
struct is_set<std::unordered_set<V... | e Compare, typename Alloc>
struct is_set<std::multiset<Key, Compare, Alloc>>
: std::integral_constant<bool, true> {};
template <typename Key, typename Tp, typename Compare, typename Alloc>
struct is_map<std::map<Key, Tp, Compare, Alloc>>
| random | [
{
"content": "struct load_variant;\n\n\n\n/// Implementation.\n\ntemplate <typename Arg, typename... Args>\n",
"file_path": "include/bunsan/config/input_archive.hpp",
"rank": 22,
"score": 164930.03404454674
},
{
"content": "struct load_variant<> {\n\n template <typename Archive, typename Va... |
C++ | components/agro_mesh/net/resources/app.cpp | rnascunha/agro_mesh | f4d1c49cdbd3d61086c1dcd79143d30ec54d4871 | #include "esp_log.h"
#include <stdio.h>
#include <string.h>
#include "../coap_engine.hpp"
#include "../../modules/app/app.hpp"
extern const char* RESOURCE_TAG;
static char* make_name(char* name, const void* data, unsigned name_size) noexcept
{
std::memcpy(name, data, name_size);
name[name_size] = '\0';
return na... | #include "esp_log.h"
#include <stdio.h>
#include <string.h>
#include "../coap_engine.hpp"
#include "../../modules/app/app.hpp"
extern const char* RESOURCE_TAG;
static char* make_name(char* name, const void* data, unsigned name_size) noexcept
{
std::memcpy(name, data, name_size);
name[name_size] = '\0';
return na... |
static void put_app_handler(engine::message const& request,
engine::response& response, void*) noexcept
{
ESP_LOGD(RESOURCE_TAG, "Called put app handler");
if(!request.payload || !request.payload_len || request.payload_len <= sizeof(std::int32_t))
{
response
.code(CoAP::Message::code::precondition_fa... | n - 32),
static_cast<const std::uint8_t*>(request.payload)))
{
response
.code(CoAP::Message::code::internal_server_error)
.payload("app other loading")
.serialize();
return;
}
response
.code(CoAP::Message::code::changed)
.serialize();
} | function_block-function_prefixed | [
{
"content": "struct app{\n\n\tchar\t\tname[app_max_name_size + 1];\n\n\tunsigned \tsize = 0;\n\n};\n\n\n",
"file_path": "components/agro_mesh/modules/app/app.hpp",
"rank": 0,
"score": 77485.24550976587
},
{
"content": "const char* get_scheduler_status_string(Scheduler::status_t status);\n",... |
C++ | ccl/src/dev/Morpheus_Ccl_DenseVector.hpp | morpheus-org/morpheus-interoperability | 66161199fa1926914e16c1feb02eb910ffef5ed4 |
#ifndef MORPHEUS_CCL_DEV_DENSEVECTOR_HPP
#define MORPHEUS_CCL_DEV_DENSEVECTOR_HPP
#include <Morpheus_Ccl_Types.hpp>
#include <dev/fwd/Morpheus_Ccl_Fwd_DenseVector.hpp>
#ifdef __cplusplus
extern "C" {
#endif
void ccl_dvec_dense_v_create_default(ccl_dvec_dense_v** v);
void ccl_dvec_dense_v_create(ccl_dvec_dense_v*... |
#ifndef MORPHEUS_CCL_DEV_DENSEVECTOR_HPP
#define MORPHEUS_CCL_DEV_DENSEVECTOR_HPP
#include <Morpheus_Ccl_Types.hpp>
#include <dev/fwd/Morpheus_Ccl_Fwd_DenseVector.hpp>
#ifdef __cplusplus
extern "C" {
#endif
void ccl_dvec_dense_v_create_default(ccl_dvec_dense_v** v);
void ccl_dvec_dense_v_create(ccl_dvec_dense_v*... | _dvec_dense_v_hostmirror_values_at(
ccl_dvec_dense_v_hostmirror* v, ccl_index_t i);
void ccl_dvec_dense_v_hostmirror_set_values_at(ccl_dvec_dense_v_hostmirror* v,
ccl_index_t i, ccl_value_t val);
void ccl_dvec_dense_i_hostmirror_create_default(
ccl_dvec_dense_i_h... | ccl_dvec_dense_v** dst);
void ccl_dvec_dense_v_allocate_from_dvec_dense_v(ccl_dvec_dense_v* src,
ccl_dvec_dense_v* dst);
void ccl_dvec_dense_v_assign(ccl_dvec_dense_v* v, ccl_index_t n,
ccl_value_t val);
void ccl_dvec_de... | random | [
{
"content": "#ifdef __cplusplus\n\nextern \"C\" {\n\n#endif\n\n\n\nvoid ccl_initialize(int* argc, char** argv[]);\n\nvoid ccl_initialize_without_args(void);\n\nvoid ccl_finalize(void);\n\nvoid ccl_print_configuration(const char* prepend_name_in,\n\n const char* file_name_in);\n\n\n\... |
C++ | CC2500.cpp | RoXXoR/CC2500 | 7a07566dd2342a1b21bcdc9beb30b0ff3e6cdba6 |
#include "CC2500.h"
CC2500::CC2500() {
CC2500(DEVADDR, CHANNEL);
}
CC2500::CC2500(uint8_t deviceAddress) {
CC2500(deviceAddress, CHANNEL);
}
CC2500::CC2500(uint8_t deviceAddress, uint8_t channel) {
_deviceAddress = deviceAddress;
_channel = channel;
_gdo0 = GDO0;
}
void CC2500::setDeviceAddress(uint8_t device... |
#include "CC2500.h"
CC2500::CC2500() {
CC2500(DEVADDR, CHANNEL);
}
CC2500::CC2500(uint8_t deviceAddress) {
CC2500(deviceAddress, CHANNEL);
}
CC2500::CC2500(uint8_t deviceAddress, uint8_t channel) {
_deviceAddress = deviceAddress;
_channel = channel;
_gdo0 = GDO0;
}
void CC2500::setDeviceAddress(uint8_t device... | 8_t *rxBuffer, uint8_t size) {
uint8_t pktLength;
uint8_t rxInfo[2];
if (readStatusRegister(CC2500_RXBYTES)&CC2500_NUM_RXBYTES) {
pktLength = readRegister(CC2500_RX_FIFO);
if (pktLength <= size) {
readRegisterBurst(CC2500_RX_FIFO, rxBuffer, pktLength);
} else {
readRegisterBurst(CC2500_RX_FIFO, rxBuffer... | IGH);
return recv;
}
void CC2500::readRegisterBurst(uint8_t saddr, uint8_t *data, uint8_t size) {
digitalWrite(SS,LOW);
SPI.transfer(saddr|CC2500_READ_BURST);
while (size > 0) {
*data++ = SPI.transfer(0x00);
size--;
}
digitalWrite(SS,HIGH);
}
void CC2500::execStrobeCommand(uint8_t command) {
digitalWrite(S... | random | [
{
"content": "#define CC2500_ADDR\t\t0x09\t// Device Address\n",
"file_path": "cc2500_defines.h",
"rank": 0,
"score": 19030.082185654213
},
{
"content": "\tvoid writeRegisterBurst(uint8_t saddr, uint8_t *data, uint8_t size);\n\n\tuint8_t readRegister(uint8_t addr);\n\n\tvoid readRegisterBurs... |
C++ | rcnn/backbone.hpp | GaoLon/tensorrtx | 67bd89f27c4bcaf99c3ff50317c035b60bdce58e | #pragma once
#include <vector>
#include <map>
#include <string>
#include "common.hpp"
enum RESNETTYPE {
R18 = 0,
R34,
R50,
R101,
R152
};
const std::map<RESNETTYPE, std::vector<int>> num_blocks_per_stage = {
{R18, {2, 2, 2, 2}},
{R34, {3, 4, 6, 3}},
{R50, {3, 4, 6, 3}},
{R101, {3, 4... | #pragma once
#include <vector>
#include <map>
#include <string>
#include "common.hpp"
enum RESNETTYPE {
R18 = 0,
R34,
R50,
R101,
R152
};
const std::map<RESNETTYPE, std::vector<int>> num_blocks_per_stage = {
{R18, {2, 2, 2, 2}},
{R34, {3, 4, 6, 3}},
{R50, {3, 4, 6, 3}},
{R101, {3, 4... |
int out_channels = res2_out_channels;
ITensor* out = nullptr;
auto stem = BasicStem(network, weightMap, "backbone.stem", input, stem_out_channels);
out = stem->getOutput(0);
for (int i = 0; i < 3; i++) {
int dilation = (i == 3) ? res5_dilation : 1;
int first_stride = (i ... | if (resnet_type == R18 || resnet_type == R34) {
assert(res2_out_channels == 64);
assert(res5_dilation == 1);
} | if_condition | [] |
C++ | media/jni/audioeffect/android_media_SourceDefaultEffect.cpp | rio-31/android_frameworks_base-1 | 091a068a3288d27d77636708679dde58b7b7fd25 |
#define LOG_TAG "SourceDefaultEffect-JNI"
#include <utils/Errors.h>
#include <utils/Log.h>
#include <jni.h>
#include <nativehelper/JNIHelp.h>
#include <android_runtime/AndroidRuntime.h>
#include "media/AudioEffect.h"
#include <nativehelper/ScopedUtfChars.h>
#include "android_media_AudioEffect.h"
using namespace a... |
#define LOG_TAG "SourceDefaultEffect-JNI"
#include <utils/Errors.h>
#include <utils/Log.h>
#include <jni.h>
#include <nativehelper/JNIHelp.h>
#include <android_runtime/AndroidRuntime.h>
#include "media/AudioEffect.h"
#include <nativehelper/ScopedUtfChars.h>
#include "android_media_AudioEffect.h"
using namespace a... | ;
if (lStatus != NO_ERROR) {
ALOGE("setup: Error adding SourceDefaultEffect");
goto setup_exit;
}
nId[0] = static_cast<jint>(id);
setup_exit:
if (nId != NULL) {
env->ReleasePrimitiveArrayCritical(jId, nId, 0);
nId = NULL;
}
if (uuidStr != NULL) {
... | AudioEffect::addSourceDefaultEffect(typeStr,
String16(opPackageNameStr.c_str()),
uuidStr,
priority,
static_cast<audio_so... | call_expression | [] |
C++ | zircon/system/uapp/iotime/iotime.cc | opensource-assist/fuschia | 66646c55b3d0b36aae90a4b6706b87f1a6261935 |
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <block-client/client.h>
#include <fuchsia/hardware/block/c/fidl.h>
#include <lib/fzl/fdio.h>
#include <lib/zx/channel.h>
#include <lib/zx/fifo.h>
#include <lib/zx/vmo.h>
#include <ramdevice-c... |
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <block-client/client.h>
#include <fuchsia/hardware/block/c/fidl.h>
#include <lib/fzl/fdio.h>
#include <lib/zx/channel.h>
#include <lib/zx/fifo.h>
#include <lib/zx/vmo.h>
#include <ramdevice-c... | r, "error: out of memory\n");
return ZX_TIME_INFINITE;
}
zx_time_t t0 = zx_clock_get_monotonic();
size_t n = total;
const char* fn_name = is_read ? "read" : "write";
while (n > 0) {
size_t xfer = (n > bufsz) ? bufsz : n;
ssize_t r = is_read ? read(fd, buffer, xfer) : write(fd, buffer, xfer);
... | err, "%g %s/s\n", rate, unit);
}
static zx_duration_t iotime_posix(int is_read, int fd, size_t total, size_t bufsz) {
void* buffer = malloc(bufsz);
if (buffer == NULL) {
fprintf(stder | random | [] |
C++ | old/v2/src/sim/Maze.cpp | qiuwenhui/micromouse_-simulator | 6625b2814b8281a0db5d4e9d57ae8881ff31fed0 | #include "Maze.h"
#include <queue>
#include <set>
#include <vector>
#include "../maze/IMazeAlgorithm.h"
#include "../maze/MazeAlgorithms.h"
#include "Assert.h"
#include "Directory.h"
#include "Logging.h"
#include "MazeChecker.h"
#include "MazeFileType.h"
#include "MazeFileUtilities.h"
#include "MazeInterface.h"
#incl... | #include "Maze.h"
#include <queue>
#include <set>
#include <vector>
#include "../maze/IMazeAlgorithm.h"
#include "../maze/MazeAlgorithms.h"
#include "Assert.h"
#include "Directory.h"
#include "Logging.h"
#include "MazeChecker.h"
#include "MazeFileType.h"
#include "MazeFileUtilities.h"
#include "MazeInterface.h"
#incl... | }
}
return rotated;
}
std::vector<std::vector<Tile>> Maze::setTileDistances(std::vector<std::vector<Tile>> maze) {
int width = maze.size();
int height = maze.at(0).size();
auto getNeighbor = [&maze, &width, &height](int x, int y, Direction direction) {
switch (direction) {... | mazeWidth, int mazeHeight) {
std::vector<std::vector<BasicTile>> blankMaze;
for (int x = 0; x < mazeWidth; x += 1) {
std::vector<BasicTile> column;
for (int y = 0; y < mazeHeight; y += 1) {
BasicTile tile;
for (Direction direction : DIRECTIONS) {
tile.wall... | random | [
{
"content": "class Test : public IMouseAlgorithm {\n\n\n\npublic:\n\n std::string mouseFile() const;\n\n std::string interfaceType() const;\n\n void solve(\n\n int mazeWidth, int mazeHeight, bool isOfficialMaze,\n\n char initialDirection, sim::MouseInterface* mouse);\n\n\n\n};\n\n\n\n} /... |
C++ | libc/winsup/cygwin/fhandler_procsys.cc | The0x539/wasp | 5f83aab7bf0c0915b1d3491034d35b091c7aebdf |
#include "winsup.h"
#include <stdlib.h>
#include "cygerrno.h"
#include "security.h"
#include "path.h"
#include "fhandler.h"
#include "dtable.h"
#include "cygheap.h"
#include <winioctl.h>
#include "ntdll.h"
#include "tls_pbuf.h"
#include <dirent.h>
const char procsys[] = "/proc/sys";
const size_t procsys_len = sizeo... |
#include "winsup.h"
#include <stdlib.h>
#include "cygerrno.h"
#include "security.h"
#include "path.h"
#include "fhandler.h"
#include "dtable.h"
#include "cygheap.h"
#include <winioctl.h>
#include "ntdll.h"
#include "tls_pbuf.h"
#include <dirent.h>
const char procsys[] = "/proc/sys";
const size_t procsys_len = sizeo... | ;
if (!NT_SUCCESS (status))
goto unreadable;
RtlInitEmptyUnicodeString (&target, tp.w_get (),
(NT_MAX_PATH - 1) * sizeof (WCHAR));
status = NtQuerySymbolicLinkObject (h, &target, NULL);
NtClose (h);
if (!NT_SUCCESS (status))
goto unreadable;
len = sys_wcstombs (NULL, 0, target.Buffer, target... | US_SHARING_VIOLATION)
return virt_fsfile;
if (status == STATUS_OBJECT_PATH_NOT_FOUND
|| status == STATUS_OBJECT_NAME_NOT_FOUND)
return virt_fsfile;
if (status >= STATUS_PIPE_NOT_AVAILABLE && status <= STATUS_PIPE_BUSY)
return virt_pipe;
if (status == STATUS_ACCESS_DENIED && !internal)
... | random | [
{
"content": "struct __sFILE64 *fopen64 (const char *, const char *);\n",
"file_path": "libc/winsup/cygwin/winsup.h",
"rank": 0,
"score": 303894.749413499
},
{
"content": "struct passwd *getpwnam (const char *);\n",
"file_path": "libc/winsup/cygwin/winsup.h",
"rank": 1,
"score": ... |
C++ | iverilog-parser/IRStmtVisitor.cc | gokhankici/xenon | d749abd865f2017cda323cf63cf38b585de9e7af | #include <sstream>
#include "IRExporter.h"
#include "IRStmtVisitor.h"
#include "IRExprVisitor.h"
using namespace std;
void IRStmtVisitor::visit(PGAssign *ga)
{
if (ga->delay_count() != 0) {
cerr << "continuous assignment has a delay:" << endl;
ga->dump(cerr,0);
cerr << endl;
}
if... | #include <sstream>
#include "IRExporter.h"
#include "IRStmtVisitor.h"
#include "IRExprVisitor.h"
using namespace std;
void IRStmtVisitor::visit(PGAssign *ga)
{
|
if (ga->pin_count() != 2 || ga->pin(0) == NULL || ga->pin(1) == NULL) {
cerr << "NOT SUPPORTED: PrologExporter@PGAssign: sth wrong with pins" << endl;
exit(1);
}
irStmt = doAssignment(IRStmt_AssignmentType::CONTINUOUS, ga->pin(0), ga->pin(1));
}
void IRStmtVisitor::visit(PGBuiltin *gb)
{... | if (ga->delay_count() != 0) {
cerr << "continuous assignment has a delay:" << endl;
ga->dump(cerr,0);
cerr << endl;
} | if_condition | [
{
"content": "extern DLLEXPORT void (*vlog_startup_routines[])(void);\n",
"file_path": "iverilog-parser/vpi_user.h",
"rank": 0,
"score": 98623.54510942122
},
{
"content": "static void do_include();\n",
"file_path": "iverilog-parser/ivlpp/lexor.c",
"rank": 1,
"score": 54072.917652... |
C++ | examples/12-fonts/src/Main.cpp | szszszsz/blue | a6a93d9a6c7bda6b4ed4fa3b9b4b01094c4915b8 | #include <blue/Context.hpp>
#include <blue/Timestep.hpp>
#include <blue/ShaderUtils.h>
#include <blue/TextureUtils.hpp>
#include <blue/camera/OrthographicCamera.hpp>
#include <blue/FontUtils.hpp>
#include <atomic>
#include <string>
#include <cstdint>
#include <cstdlib>
namespace Sample
{
const std::uint16_t window_w... | #include <blue/Context.hpp>
#include <blue/Timestep.hpp>
#include <blue/ShaderUtils.h>
#include <blue/TextureUtils.hpp>
#include <blue/camera/OrthographicCamera.hpp>
#include <blue/FontUtils.hpp>
#include <atomic>
#include <string>
#include <cstdint>
#include <cstdlib>
namespace Sample
{
const std::uint16_t window_w... | view() });
auto font = FontUtils::read_ttf_relative("resources/Lato-Black.ttf");
auto create_texture_entity = FontUtils::create_text(font, "The quick brown fox jumps over the lazy dog.", Sample::window_width, Sample::window_height, 22);
auto texture = blue::Context::gpu_system().submit(create_texture_entity).get(... | array = blue::Context::gpu_system().submit(CreateMeshEntity{ vertices, indices, attributes, static_cast<std::uint32_t>(indices.size()) }).get();
auto environment = blue::Context::gpu_system().submit(CreateEnvironmentEntity{}).get();
OrthographicCamera camera(OrthographicCamera::Mode::SCREEN_SPACE, blue::Conte... | random | [
{
"content": "struct ShaderAttribute\n\n{\n",
"file_path": "include/blue/gpu/GpuEntities.hpp",
"rank": 0,
"score": 105984.379388146
},
{
"content": "\tenum class Model : int\n\n\t{\n\n\t\tPINE_TREE = 0,\n\n\t\tHURDLE = 1,\n\n\t\tWHEAT = 2,\n\n\t\tBOULDER = 3,\n\n\t\tSMALL_BOULDER = 4,\n\n\t\... |
C++ | Code/Engine/Animation/Graph/Nodes/Animation_RuntimeGraphNode_Parameters.cpp | JuanluMorales/KRG | f3a11de469586a4ef0db835af4bc4589e6b70779 | #include "Animation_RuntimeGraphNode_Parameters.h"
namespace KRG::Animation::GraphNodes
{
void ControlParameterBoolNode::Settings::InstantiateNode( TVector<GraphNode*> const& nodePtrs, GraphDataSet const* pDataSet, InitOptions options ) const
{
auto pNode = CreateNode<ControlParameterBoolNode>( nodePtr... | #include "Animation_RuntimeGraphNode_Parameters.h"
namespace KRG::Animation::GraphNodes
{
void ControlParameterBoolNode::Settings::InstantiateNode( TVector<GraphNode*> const& nodePtrs, GraphDataSet const* pDataSet, InitOptions options ) const
{
auto pNode = CreateNode<ControlParameterBoolNode>( nodePtr... |
void VirtualParameterTargetNode::ShutdownInternal( GraphContext& context )
{
KRG_ASSERT( m_pChildNode != nullptr );
m_pChildNode->Shutdown( context );
TargetValueNode::ShutdownInternal( context );
}
void VirtualParameterTargetNode::GetValueInternal( GraphContext& context, void... | void VirtualParameterTargetNode::InitializeInternal( GraphContext& context )
{
KRG_ASSERT( m_pChildNode != nullptr );
TargetValueNode::InitializeInternal( context );
m_pChildNode->Initialize( context );
} | function_block-full_function | [] |
C++ | chrome/browser/renderer_host/render_process_host_chrome_browsertest.cc | hujiajie/pa-chromium | 1816ff80336a6efd1616f9e936880af460b1e105 |
#include "base/command_line.h"
#include "chrome/browser/devtools/devtools_window.h"
#include "chrome/browser/ui/browser.h"
#include "chrome/browser/ui/browser_commands.h"
#include "chrome/browser/ui/singleton_tabs.h"
#include "chrome/browser/ui/tabs/tab_strip_model.h"
#include "chrome/common/chrome_switches.h"
#inclu... |
#include "base/command_line.h"
#include "chrome/browser/devtools/devtools_window.h"
#include "chrome/browser/ui/browser.h"
#include "chrome/browser/ui/browser_commands.h"
#include "chrome/browser/ui/singleton_tabs.h"
#include "chrome/browser/ui/tabs/tab_strip_model.h"
#include "chrome/common/chrome_switches.h"
#inclu... |
RenderViewHost* FindFirstDevToolsHost() {
content::RenderProcessHost::iterator hosts =
content::RenderProcessHost::AllHostsIterator();
for (; !hosts.IsAtEnd(); hosts.Advance()) {
content::RenderProcessHost* render_process_host = hosts.GetCurrentValue();
DCHECK(render_process_host);
if (!render_p... | int RenderProcessHostCount() {
content::RenderProcessHost::iterator hosts =
content::RenderProcessHost::AllHostsIterator();
int count = 0;
while (!hosts.IsAtEnd()) {
if (hosts.GetCurrentValue()->HasConnection())
count++;
hosts.Advance();
}
return count;
} | function_block-full_function | [] |
C++ | src/material/material_mixture.cpp | Luvideria/lightmetrica-v3 | 3e83db59998e79648047bac29c37d8eb18d7600d |
#include <pch.h>
#include <lm/core.h>
#include <lm/material.h>
#include <lm/surface.h>
LM_NAMESPACE_BEGIN(LM_NAMESPACE)
class Material_ConstantWeightMixture_RR final : public Material {
private:
struct Entry {
Material* material;
Float weight;
template <typename Archive>
void se... |
#include <pch.h>
#include <lm/core.h>
#include <lm/material.h>
#include <lm/surface.h>
LM_NAMESPACE_BEGIN(LM_NAMESPACE)
class Material_ConstantWeightMixture_RR final : public Material {
private:
struct Entry {
Material* material;
Float weight;
template <typename Archive>
void se... | group.dist.add(entry.weight);
}
group.dist.norm();
dist_.add(weight_sum);
}
dist_.norm();
}
virtual ComponentSample sample_component(const ComponentSampleU& u, const PointGeometry&, Vec3) const override {
const int comp = dist_.sample(u.uc[0]);
... |
for (auto& entry : prop) {
auto* mat = json::comp_ref<Material>(entry, "material");
const auto weight = json::value<Float>(entry, "weight");
if (mat->is_specular_component({})) {
material_groups_.emplace_back();
material_gro... | random | [
{
"content": "class Material_Glossy final : public Material {\n\nprivate:\n\n Vec3 Ks_; // Specular reflectance\n\n Float ax_, ay_; // Roughness (anisotropic)\n\n\n\npublic:\n\n LM_SERIALIZE_IMPL(ar) {\n\n ar(Ks_, ax_, ay_);\n\n }\n\n\n\npublic:\n\n virtual void construct(const Jso... |
C++ | example/add2/addserver.cc | walterzhaoJR/braft_walter | bba0afae3b28e9446e4ecc44e0b2b8baac1c4780 |
#include <map>
#include <string>
#include <fstream>
#include <gflags/gflags.h>
#include <brpc/controller.h>
#include <brpc/server.h>
#include <braft/raft.h>
#include <braft/util.h>
#include <braft/storage.h>
#include <butil/sys_byteorder.h>
#include "add.pb.h"
DEFINE_int32(port, 8100, "Li... |
#include <map>
#include <string>
#include <fstream>
#include <gflags/gflags.h>
#include <brpc/controller.h>
#include <brpc/server.h>
#include <braft/raft.h>
#include <braft/util.h>
#include <braft/storage.h>
#include <butil/sys_byteorder.h>
#include "add.pb.h"
DEFINE_int32(port, 8100, "Li... |
int AddStateMachine::start(int id){
id_ = id;
butil::EndPoint addr(butil::my_ip(), FLAGS_port);
braft::Node* node = new braft::Node(FLAGS_group, braft::PeerId(addr,id));
braft::NodeOptions node_options;
stringstream data_path_stream;
data_path_stream << FLAGS_data_path << id;
string data_path = ... | h();
snapshot_path.append("/data");
std::ifstream is(snapshot_path.c_str());
string key ;
int64_t value = 0;
while (is >> key >> value) {
LOG(DEBUG) << "key:" << key << ",value:" << value;
number_map_[key] = value;
}
return 0;
} | function_block-function_prefixed | [] |
C++ | Wargame/Auth/Session.hpp | N00byEdge/best-wargame | 35af9e00bad31c31eed4b902266e24dbf33a42ef | #pragma once
#include <array>
#include <random>
#include <queue>
#include "Wargame/Web/Network.hpp"
#include "Wargame/Util.hpp"
namespace Wargame {
struct User;
}
namespace Auth {
auto sessionTimeoutDuration = std::chrono::hours{24*7};
using SessionKey = std::array<char, 40>;
constexpr char sessionChars[] ... | #pragma once
#include <array>
#include <random>
#include <queue>
#include "Wargame/Web/Network.hpp"
#include "Wargame/Util.hpp"
namespace Wargame {
struct User;
}
namespace Auth {
auto sessionTimeoutDuration = std::chrono::hours{24*7};
using SessionKey = std::array<char, 40>;
constexpr char sessionChars[] ... |
return session;
}
void updateSession(ActiveSession const *ptr, UserPtr user) {
activeSessions.update<ActiveSession::UserIndex>(ptr, user);
ptr->lastActiveAt = std::chrono::system_clock::now();
}
void updateSession(ActiveSession const *ptr) {
updateSession(ptr, ptr->user);
}
ActiveSession... | if(session) {
auto timeSinceOnline = std::chrono::system_clock::now() - session->lastActiveAt;
if(timeSinceOnline > sessionTimeoutDuration)
activeSessions.erase(std::exchange(session, nullptr));
} | if_condition | [
{
"content": "#pragma once\n\n\n\n#include \"Wargame/Auth/Passwords.hpp\"\n\n\n\nnamespace Auth {\n\n struct UserAuth {\n\n bool authenticate(std::string password) {\n\n auto attemptedHash = Auth::hashPassword(password, salt, hashIterations);\n\n return attemptedHash == passwordHash;\n\n }\n\n\... |
C++ | requests/requestexecutor.cpp | aghoward/dbpp | b55f1f3d70ea3f0a8d6058ab0ba3b4d5a568b802 | #include "requests/requestexecutor.h"
#include <algorithm>
#include <cstdio>
#include <memory>
#include <optional>
#include <string>
#include <vector>
#include <cpr/cpr.h>
#include "parameters/arguments.h"
#include "multi-threading/threadpool.h"
#include "multi-threading/workqueue.h"
#include "requests/executioncont... | #include "requests/requestexecutor.h"
#include <algorithm>
#include <cstdio>
#include <memory>
#include <optional>
#include <string>
#include <vector>
#include <cpr/cpr.h>
#include "parameters/arguments.h"
#include "multi-threading/threadpool.h"
#include "multi-threading/workqueue.h"
#include "requests/executioncont... |
std::shared_ptr<WorkQueue<std::string>> RequestExecutor::create_work_queue(std::size_t queue_size) const
{
auto word_list = get_word_list(_args.wordlist_file);
auto work_pool = std::make_shared<WorkQueue<std::string>>(queue_size);
work_pool->add_items(word_list.begin(), word_list.end());
return work_p... | std::vector<std::string> RequestExecutor::execute(const std::string& item)
{
auto results = std::vector<std::string>();
for (const auto& request_template : _context->request_templates)
{
auto result = execute(item, request_template);
if (result)
results.push_back(result.value());... | function_block-full_function | [
{
"content": "#include \"support/template_formatting.h\"\n\n\n\n#include <string>\n\n#include <map>\n\n#include <utility>\n\n\n\nnamespace impl\n\n{\n\n std::string format_single(const std::string& _template, const std::pair<std::string, std::string>& replacement)\n\n {\n\n auto result = _template;... |
C++ | SurgSim/Graphics/RenderTests/OsgPointCloudRepresentationRenderTests.cpp | dbungert/opensurgsim | bd30629f2fd83f823632293959b7654275552fa9 |
#include <gtest/gtest.h>
#include <memory>
#include <vector>
#include "SurgSim/DataStructures/Vertices.h"
#include "SurgSim/Framework/Runtime.h"
#include "SurgSim/Framework/Scene.h"
#include "SurgSim/Graphics/OsgBoxRepresentation.h"
#include "SurgSim/Graphics/OsgManager.h"
#include "SurgSim/Graphics/OsgMaterial.h"
... |
#include <gtest/gtest.h>
#include <memory>
#include <vector>
#include "SurgSim/DataStructures/Vertices.h"
#include "SurgSim/Framework/Runtime.h"
#include "SurgSim/Framework/Scene.h"
#include "SurgSim/Graphics/OsgBoxRepresentation.h"
#include "SurgSim/Graphics/OsgManager.h"
#include "SurgSim/Graphics/OsgMaterial.h"
... |
TEST_F(OsgPointCloudRepresentationRenderTests, StaticRotate)
{
std::shared_ptr<PointCloudRepresentation> representation = makeCloud(makeCube());
runtime->start();
EXPECT_TRUE(graphicsManager->isInitialized());
EXPECT_TRUE(viewElement->isInitialized());
boost::this_thread::sleep(boost::posix_time::milliseconds... | viewElement->addComponent(representation);
runtime->start();
EXPECT_TRUE(graphicsManager->isInitialized());
EXPECT_TRUE(viewElement->isInitialized());
boost::this_thread::sleep(boost::posix_time::milliseconds(500));
for (size_t i = 0; i < vertices.size(); ++i)
{
pointCloud->addVertex(PointCloud::VertexType(... | function_block-function_prefix_line | [
{
"content": "struct OsgVectorFieldRepresentationRenderTests : public SurgSim::Graphics::RenderTest\n\n{\n\nprotected:\n\n\t// A point is a location (X,Y,Z) in 3D space\n\n\tstd::vector<Vector3d> makeStartingPoints()\n\n\t{\n\n\t\tstd::vector<Vector3d> points(8);\n\n\t\tpoints[0] = Vector3d(1.0, 0.0, 0.0);\n\n\... |
C++ | Utilities/itkSplitAlternatingTimeSeriesImageFilter.hxx | KevinScholtes/ANTsX | 5462269c0c32e5d65560bae4014c5a05cb02588d |
#ifndef __itkSplitAlternatingTimeSeriesImageFilter_hxx
#define __itkSplitAlternatingTimeSeriesImageFilter_hxx
#include "itkSplitAlternatingTimeSeriesImageFilter.h"
#include "itkProgressReporter.h"
#include "itkImageRegionIterator.h"
#include "itkImageRegionConstIterator.h"
namespace itk
{
template< typename TInputIm... |
#ifndef __itkSplitAlternatingTimeSeriesImageFilter_hxx
#define __itkSplitAlternatingTimeSeriesImageFilter_hxx
#include "itkSplitAlternatingTimeSeriesImageFilter.h"
#include "itkProgressReporter.h"
#include "itkImageRegionIterator.h"
#include "itkImageRegionConstIterator.h"
namespace itk
{
template< typename TInputIm... |
if ( numComponents != outputPtr1->GetNumberOfComponentsPerPixel() )
{
outputPtr1->SetNumberOfComponentsPerPixel( numComponents );
}
}
template< typename TInputImage, typename TOutputImage >
void
SplitAlternatingTimeSeriesImageFilter< TInputImage, TOutputImage >
::ThreadedGenerateData(const OutputImageRe... | if ( numComponents != outputPtr0->GetNumberOfComponentsPerPixel() )
{
outputPtr0->SetNumberOfComponentsPerPixel( numComponents );
} | if_condition | [
{
"content": "class ITK_TEMPLATE_EXPORT SimulatedDisplacementFieldSource:\n\n public ImageSource<TOutputImage>\n\n{\n\npublic:\n\n ITK_DISALLOW_COPY_AND_ASSIGN( SimulatedDisplacementFieldSource );\n\n\n\n /** Standard class type aliases. */\n\n using Self = SimulatedDisplacementFieldSource;\n\n using Super... |
C++ | searchlib/src/tests/features/subqueries/subqueries_test.cpp | amahussein/vespa | 29d266ae1e5c95e25002b97822953fdd02b1451e |
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/searchlib/features/setup.h>
#include <vespa/searchlib/fef/test/indexenvironment.h>
#include <vespa/searchlib/fef/test/indexenvironmentbuilder.h>
#include <vespa/searchlib/fef/test/queryenvironment.h>
#include <vespa/searchlib/features/subqueries_feature.h>
#... |
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/searchlib/features/setup.h>
#include <vespa/searchlib/fef/test/indexenvironment.h>
#include <vespa/searchlib/fef/test/indexenvironmentbuilder.h>
#include <vespa/searchlib/fef/test/queryenvironment.h>
#include <vespa/searchlib/features/subqueries_feature.h>
#... | ()));
EXPECT_FALSE(((Blueprint&)f1).setup(f2.indexEnv, {"unknown"}));
}
TEST_F("require that not searching a field will give it 0 subqueries",
RankFixture(0, 3)) {
EXPECT_EQUAL(0, f1.getSubqueries(10));
}
TEST_F("require that subqueries can be obtained", RankFixture(1, 0)) {
f1.setFooSubqueries(0, ... | oo"}));
}
TEST_FF("require that setup can be done on attribute field",
SubqueriesBlueprint, IndexFixture) {
DummyDependencyHandler deps(f1);
f1.setName(vespalib::make_string("%s(bar)", f1.getBaseName().c_str()));
EXPECT_TRUE(((Blueprint&)f1).setup(f2.indexEnv, {"bar"}));
}
TEST_FF("require that se... | random | [] |
C++ | Engine/src/CotQuaternion.cpp | TeamNut/CotEngine | d7f8c39715b8828eb8b4295c8ad844bdc7ab6849 | #include "math/CotQuaternion.h"
#include "math/CotVec3.h"
#include "math/CotVec4.h"
namespace Cot
{
Quaternion::Quaternion()
: x(0.0f), y(0.0f), z(0.0f), w(1.0f)
{ }
Quaternion::Quaternion(const float value)
: x(value), y(value), z(value), w(value)
{ }
Quaternion::Quaternion(const float xx, const float yy,... | #include "math/CotQuaternion.h"
#include "math/CotVec3.h"
#include "math/CotVec4.h"
namespace Cot
{
Quaternion::Quaternion()
: x(0.0f), y(0.0f), z(0.0f), w(1.0f)
{ }
Quaternion::Quaternion(const float value)
: x(value), y(value), z(value), w(value)
{ }
Quaternion::Quaternion(const float xx, const float yy,... |
Quaternion& Quaternion::operator-=(const float value)
{
x -= value;
y -= value;
z -= value;
w -= value;
return *this;
}
Quaternion& Quaternion::operator*=(const float value)
{
x *= value;
y *= value;
z *= value;
w *= value;
return *this;
}
Quaternion& Quaternion::operator/=(const float va... | Quaternion& Quaternion::operator+=(const float value)
{
x += value;
y += value;
z += value;
w += value;
return *this;
} | function_block-full_function | [
{
"content": "\tclass Vec4;\n",
"file_path": "Engine/include/math/CotQuaternion.h",
"rank": 0,
"score": 178629.8132119183
},
{
"content": "\tclass Vec3;\n",
"file_path": "Engine/include/math/CotQuaternion.h",
"rank": 1,
"score": 178621.05006660835
},
{
"content": "\tclass... |
C++ | trunk/third_party/webrtc/modules/rtp_rtcp/test/testAPI/test_api_audio.cc | goddino/libjingle | 9516bee51c73af4c3082e74b88ed1198a0eb2bb1 |
#include <algorithm>
#include <vector>
#include "testing/gtest/include/gtest/gtest.h"
#include "webrtc/modules/rtp_rtcp/test/testAPI/test_api.h"
#include "webrtc/common_types.h"
#include "webrtc/modules/rtp_rtcp/interface/rtp_rtcp.h"
#include "webrtc/modules/rtp_rtcp/interface/rtp_rtcp_defines.h"
using namespace w... |
#include <algorithm>
#include <vector>
#include "testing/gtest/include/gtest/gtest.h"
#include "webrtc/modules/rtp_rtcp/test/testAPI/test_api.h"
#include "webrtc/common_types.h"
#include "webrtc/modules/rtp_rtcp/interface/rtp_rtcp.h"
#include "webrtc/modules/rtp_rtcp/interface/rtp_rtcp_defines.h"
using namespace w... | 160; timeStamp += 160) {
EXPECT_EQ(0, module1->SendOutgoingData(webrtc::kAudioFrameSpeech, 96,
timeStamp, -1, test, 4));
fake_clock.AdvanceTimeMilliseconds(20);
module1->Process();
}
}
| ));
EXPECT_EQ(0, module1->SetStartTimestamp(test_timestamp));
EXPECT_EQ(0, module1->SetSendingStatus(true));
voiceCodec.pltype = 127;
voiceCodec.plfreq = 8000;
memcpy(voiceCodec.plname, "RED", 4);
EXPECT_EQ(0, module1->SetSendREDPayloadType(voiceCodec.pltype));
int8_t red = 0;
EXPECT_EQ(0, module1->Se... | random | [] |
C++ | lib/fiber/element_pair_topology.hpp | nicolas-chaulet/bempp | 0f5cc72e0e542437e787db5704978456b0ad9e35 |
#ifndef fiber_element_pair_topology_hpp
#define fiber_element_pair_topology_hpp
#include "../common/common.hpp"
#include "../common/armadillo_fwd.hpp"
#include <cassert>
#include <iostream>
#include <boost/tuple/tuple_comparison.hpp>
namespace Fiber
{
struct ElementPairTopology
{
ElementPairTopology() :
... |
#ifndef fiber_element_pair_topology_hpp
#define fiber_element_pair_topology_hpp
#include "../common/common.hpp"
#include "../common/armadillo_fwd.hpp"
#include <cassert>
#include <iostream>
#include <boost/tuple/tuple_comparison.hpp>
namespace Fiber
{
struct ElementPairTopology
{
ElementPairTopology() :
... | +testV)
if (testElementCornerIndices(testV) ==
trialElementCornerIndices(trialV))
{
testSharedVertices[hits] = testV;
trialSharedVertices[hits] = trialV;
++hits;
break;
}
if (hits == 0)
{
... | ther) const {
return type == other.type &&
testVertexCount == other.testVertexCount &&
trialVertexCount == other.trialVertexCount &&
testSharedVertex0 == other.testSharedVertex0 &&
testSharedVertex1 == other.testSharedVertex1 &&
tri... | random | [
{
"content": "enum CallVariant\n\n{\n\n TEST_TRIAL = 0,\n\n TRIAL_TEST = 1\n\n};\n\n\n\ntypedef int LocalDofIndex;\n\nconst LocalDofIndex ALL_DOFS = -1;\n\n\n\n}\n\n\n\n#endif\n",
"file_path": "lib/fiber/types.hpp",
"rank": 0,
"score": 187458.7934374725
},
{
"content": "enum Geometrica... |
C++ | src/automaton/core/testnet/testnet.cc | sept-en/automaton | b7448dfe578cf52df37ec7c86536d1e51017c548 | #include "automaton/core/testnet/testnet.h"
#include <set>
#include "automaton/core/io/io.h"
#include "automaton/core/node/node.h"
namespace automaton {
namespace core {
namespace testnet {
static const uint32_t STARTING_PORT = 12300;
std::unordered_map<std::string, std::shared_ptr<testnet>> testnet::testnets;
bo... | #include "automaton/core/testnet/testnet.h"
#include <set>
#include "automaton/core/io/io.h"
#include "automaton/core/node/node.h"
namespace automaton {
namespace core {
namespace testnet {
static const uint32_t STARTING_PORT = 12300;
std::unordered_map<std::string, std::shared_ptr<testnet>> testnet::testnets;
bo... | = "";
uint32_t port = 0;
if (network_type == network_protocol_type::localhost) {
address = "tcp://127.0.0.1:";
port = STARTING_PORT;
} else {
address = "sim://100:10000:";
}
for (uint32_t i = 1; i <= number_nodes; ++i) {
std::string node_id = network_id + "_" + std::to_string(i);
bool res ... | [id] = std::move(net);
return true;
}
void testnet::destroy_testnet(const std::string& id) {
auto it = testnets.find(id);
if (it != testnets.end()) {
testnets.erase(it);
}
}
std::shared_ptr<testnet> testnet::get_testnet(const std::string& id) {
auto it = testnets.find(id);
if (it != testnets.end()) {
... | random | [
{
"content": "class testnet {\n\n public:\n\n enum network_protocol_type {\n\n localhost = 1,\n\n simulation = 2\n\n };\n\n\n\n ~testnet();\n\n\n\n static bool create_testnet(const std::string& node_type, const std::string& id, const std::string& smart_protocol_id,\n\n network_protocol_type ntype... |
C++ | include/SctpSocket.hpp | GaborTimko/lsctp | cdc89010b1afcc2ed9cd811a61256749938a54dd | #ifndef LSSOCKET_HPP
#define LSSOCKET_HPP
#include <vector>
#include <cstring>
#include <cerrno>
#include <type_traits>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netinet/sctp.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <fcntl.h>
#include "Lua/Lua.hpp"
namespace Sctp {
namespace Socket {
... | #ifndef LSSOCKET_HPP
#define LSSOCKET_HPP
#include <vector>
#include <cstring>
#include <cerrno>
#include <type_traits>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netinet/sctp.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <fcntl.h>
#include "Lua/Lua.hpp"
namespace Sctp {
namespace Socket {
... |
template<>
inline auto Base<6>::pushIPAddress(Lua::State* L, AddressArray& addrs, const char* ip, uint16_t port, int idx) noexcept -> int {
addrs[idx].sin6_family = AF_INET6;
addrs[idx].sin6_port = port;
int conversion = ::inet_pton(AF_INET6, ip, &addrs[idx].sin6_addr);
return checkIPConversionResult(L, ip,... | inline auto Base<4>::pushIPAddress(Lua::State* L, AddressArray& addrs, const char* ip, uint16_t port, int idx) noexcept -> int {
addrs[idx].sin_family = AF_INET;
addrs[idx].sin_port = port;
int conversion = ::inet_pton(AF_INET, ip, &addrs[idx].sin_addr);
return checkIPConversionResult(L, ip, conversion);
} | function_block-full_function | [
{
"content": "class Server final : public Base<IPVersion> {\n\npublic:\n\n static constexpr int DefaultBackLogSize = 1000;\n\n static const char* MetaTableName;\n\npublic:\n\n Server() : Base<IPVersion>() {}\n\npublic:\n\n auto listen(Lua::State*) noexcept -> int;\n\n auto accept(Lua::State*) noexcept -> i... |
C++ | SM_RayIntersect.cpp | xzrunner/sm | e31351c4fcd4470efa4dbec5bb6ee02c21ae42f8 | #include "SM_RayIntersect.h"
namespace sm
{
bool ray_ray_intersect(const Ray& ray0, const Ray& ray1, vec3* cross)
{
auto& da = ray0.dir;
auto& db = ray1.dir;
auto dc = ray1.origin - ray0.origin;
auto cross_ab = da.Cross(db);
if (fabs(dc.Dot(cross_ab)) > SM_LARGE_EPSILON) {
return false;
}
float d = cross_ab... | #include "SM_RayIntersect.h"
namespace sm
{
bool ray_ray_intersect(const Ray& ray0, const Ray& ray1, vec3* cross)
{
auto& da = ray0.dir;
auto& db = ray1.dir;
auto dc = ray1.origin - ray0.origin;
auto cross_ab = da.Cross(db);
if (fabs(dc.Dot(cross_ab)) > SM_LARGE_EPSILON) {
return false;
}
float d = cross_ab... |
bool ray_triangle_intersect_both_faces(const mat4& mat, const vec3& v0, const vec3& v1,
const vec3& v2, const Ray& ray, vec3* cross)
{
auto _v0 = mat * v0;
auto _v1 = mat * v1;
auto _v2 = mat * v2;
auto e1 = _v1 - _v0;
auto e2 = _v2 - _v0;
auto p = ray.dir.Cross(e2);;
auto... | auto q = s.Cross(e1);
cross->y = f * ray.dir.Dot(q);
if (cross->y < 0.0f) {
return false;
}
if (cross->y + cross->x > 1.0f) {
return false;
}
cross->z = f * e2.Dot(q);
return cross->z >= 0.0f;
} | function_block-function_prefix_line | [
{
"content": "struct sm_vec3* sm_vec3_vector(struct sm_vec3* v, const struct sm_vec3* p1, const struct sm_vec3* p2)\n\n{\n\n\t*(vec3*)v = (*(const vec3*)p1) - (*(const vec3*)p2);\n\n\treturn v;\n\n}\n\n\n\nextern \"C\"\n",
"file_path": "sm_c_vector.cpp",
"rank": 0,
"score": 127451.4694807237
},
... |
C++ | Source/VoxelWorld/World/Chunk/ChunkLoader.cpp | AirGuanZ/VoxelWorld | 8defdee9e2b8fb20607d33ba0f3a316b95273693 |
#include <algorithm>
#include <cassert>
#include <Utility\HelperFunctions.h>
#include <World\Land\V0\LandGenerator_V0.h>
#include <World\Land\V1\LandGenerator_V1.h>
#include <World\Land\V2\LandGenerator_V2.h>
#include <World\Land\V3\LandGenerator_V3.h>
#include "ChunkLoader.h"
#include "ChunkManager.h"
#include "Ch... |
#include <algorithm>
#include <cassert>
#include <Utility\HelperFunctions.h>
#include <World\Land\V0\LandGenerator_V0.h>
#include <World\Land\V1\LandGenerator_V1.h>
#include <World\Land\V2\LandGenerator_V2.h>
#include <World\Land\V3\LandGenerator_V3.h>
#include "ChunkLoader.h"
#include "ChunkManager.h"
#include "Ch... | {
if(infoMgr.GetBlockInfo(GetType(cks, x, y, z)).lightDec < LIGHT_COMPONENT_MAX)
{
TryAsSource(x - 1, y, z);
TryAsSource(x + 1, y, z);
TryAsSource(x, y - 1, z);
TryAsSource(x, y + ... | r::TaskThreadEntry(void)
{
while(running_)
{
ChunkLoaderTask *task = nullptr;
{
std::lock_guard<std::mutex> lk(taskQueueMutex_);
if(loaderTasks_.Size())
{
task = loaderTasks_.Back();
loaderTasks_.PopBack();
}
... | random | [
{
"content": "class BasicBufferSetter<true> : public BasicBufferView\n\n{\n\npublic:\n\n bool SetData(const void *data, int byteSize)\n\n {\n\n assert(data && byteSize > 0);\n\n\n\n D3D11_MAPPED_SUBRESOURCE rsc;\n\n HRESULT hr = Window::GetInstance().GetD3DDeviceContext()\n\n ... |
C++ | src/classical/aig.hpp | eletesta/cirkit | 6d0939798ea25cecf92306ce796be154139b94f5 |
#ifndef AIG_HPP
#define AIG_HPP
#include <iostream>
#include <map>
#include <vector>
#include <boost/dynamic_bitset.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/property_map/property_map.hpp>
#include <core/properties.hpp>
#include <core/utils/graph_utils.hpp>
#include <classical/traits.hpp>
nam... |
#ifndef AIG_HPP
#define AIG_HPP
#include <iostream>
#include <map>
#include <vector>
#include <boost/dynamic_bitset.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/property_map/property_map.hpp>
#include <core/properties.hpp>
#include <core/utils/graph_utils.hpp>
#include <classical/traits.hpp>
nam... | onst std::string& name );
void aig_remove_po( aig_graph& aig );
aig_function aig_create_ci( aig_graph& aig, const std::string& name );
void aig_create_co( aig_graph& aig, const aig_function& f );
aig_function aig_create_and( aig_graph& aig, const aig_function& left, const aig_function& right );
aig_function aig_create_... | detail::edge_properties_t,
detail::graph_properties_t>;
using aig_node = vertex_t<aig_graph>;
using aig_edge = edge_t<aig_graph>;
void aig_initialize( aig_graph& aig, const std::string& model_name = std::string() );
aig_function aig_get_constant( aig_graph& aig, bool ... | random | [
{
"content": "struct store_info<std::vector<aig_node>>\n\n{\n\n static constexpr const char* key = \"gates\";\n\n static constexpr const char* option = \"gate\";\n\n static constexpr const char* mnemonic = \"\";\n\n static constexpr const char* name = \"gate\";\n\n static constexpr c... |
C++ | src/orbital/software/self.cpp | Klern28/orbital | 3e0a669e550e1d9a36eef24c9e77f40782bc5381 |
#include "self.h"
#include <orbital/crypto_ps4.h>
#include <zlib.h>
#include <stdexcept>
constexpr U32 SELF_MAGIC = '\x4F\x15\x3D\x1D';
enum SelfEndian {
LITTLE = 1,
};
enum ProgramAuthID : U64 {
PAID_KERNEL = UINT64_C(0x3C00000000000001),
};
enum ProgramType : U64 {
PTYPE_FAKE = 0x1,
P... |
#include "self.h"
#include <orbital/crypto_ps4.h>
#include <zlib.h>
#include <stdexcept>
constexpr U32 SELF_MAGIC = '\x4F\x15\x3D\x1D';
enum SelfEndian {
LITTLE = 1,
};
enum ProgramAuthID : U64 {
PAID_KERNEL = UINT64_C(0x3C00000000000001),
};
enum ProgramType : U64 {
PTYPE_FAKE = 0x1,
P... | d_segment(index);
const auto& segment = segments[segment_idx];
const auto& meta = metas[segment_idx];
s.seek(segment.offset, StreamSeek::Set);
Buffer buffer = s.read_b(segment.mem_size);
if (segment.is_encrypted()) {
decrypt(buffer, meta);
}
if (segment.is_compressed()) {
co... | to = ps4Crypto();
s.seek(0, StreamSeek::Set);
header = s.read_t<SelfHeader>();
assert(header.magic == SELF_MAGIC);
assert(header.version == 0);
assert(header.mode == 1);
assert(header.endian == SelfEndian::LITTLE);
assert(header.attr == 0x12);
segments.resize(header.segment_c... | random | [
{
"content": "struct Key {\n\n enum Type {\n\n NONE,\n\n AES_128_EBC,\n\n AES_128_CBC,\n\n } type;\n\n\n\n Botan::SymmetricKey key;\n\n Botan::InitializationVector iv;\n\n\n\n Key() : type(NONE) {}\n\n Key(Type type, const void* key_buf, size_t key_len, const void* iv_buf,... |
C++ | include/svg_reader.hpp | phonxvzf/svg2scad | eb458df6cee6a65fbabbe5a5600f50551532adb4 | #ifndef SVG_READER_HPP
#define SVG_READER_HPP
#include <string>
#include <memory>
#include "svgpp/svgpp.hpp"
#include "rapidxml_ns/rapidxml_ns_utils.hpp"
#include "svgpp/policy/xml/rapidxml_ns.hpp"
#include "math/util.hpp"
namespace svg {
using namespace math;
namespace action {
enum type {
ACTION_MO... | #ifndef SVG_READER_HPP
#define SVG_READER_HPP
#include <string>
#include <memory>
#include "svgpp/svgpp.hpp"
#include "rapidxml_ns/rapidxml_ns_utils.hpp"
#include "svgpp/policy/xml/rapidxml_ns.hpp"
#include "math/util.hpp"
namespace svg {
using namespace math;
namespace action {
enum type {
ACTION_MO... |
}
class reader {
private:
class context {
private:
std::vector<std::shared_ptr<action::base>> m_actions;
public:
context() = default;
~context();
const std::vector<std::shared_ptr<action::base>>& actions() const;
void path_... | O;
if (dynamic_cast<line_to*>(base_ptr)) return ACTION_LINE_TO;
if (dynamic_cast<quadratic_bezier_to*>(base_ptr)) return ACTION_QUAD_BEZIER_TO;
if (dynamic_cast<cubic_bezier_to*>(base_ptr)) return ACTION_CUBIC_BEZIER_TO;
if (dynamic_cast<elliptic_arc_to*>(base_ptr)) return AC... | function_block-function_prefixed | [
{
"content": "struct value_parser<tag::type::string, SVGPP_TEMPLATE_ARGS_PASS>\n\n{\n\n template<class AttributeTag, class Context, class AttributeValue, class PropertySource>\n\n static bool parse(AttributeTag tag, Context & context, AttributeValue const & attribute_value, \n\n ... |
C++ | src/graphics/examples/vkproto/cmd-buf-benchmark/main.cc | allansrc/fuchsia | a2c235b33fc4305044d496354a08775f30cdcf37 |
#include <unistd.h>
#include <memory>
#include <vector>
#include "src/graphics/examples/vkproto/common/command_buffers.h"
#include "src/graphics/examples/vkproto/common/command_pool.h"
#include "src/graphics/examples/vkproto/common/debug_utils_messenger.h"
#include "src/graphics/examples/vkproto/common/device.h"
#i... |
#include <unistd.h>
#include <memory>
#include <vector>
#include "src/graphics/examples/vkproto/common/command_buffers.h"
#include "src/graphics/examples/vkproto/common/command_pool.h"
#include "src/graphics/examples/vkproto/common/debug_utils_messenger.h"
#include "src/graphics/examples/vkproto/common/device.h"
#i... |
vkp::PhysicalDevice vkp_physical_device(vkp_instance.shared());
RTN_IF_MSG(1, !vkp_physical_device.Init(), "Phys Device Initialization Failed.\n");
vkp::Device vkp_device(vkp_physical_device.get());
RTN_IF_MSG(1, !vkp_device.Init(), "Logical Device Initialization Failed.\n");
std::shared_ptr<vk::Devi... | if (kEnableValidation) {
vkp::DebugUtilsMessenger vkp_debug_messenger(vkp_instance.shared());
RTN_IF_MSG(1, !vkp_debug_messenger.Init(), "Debug Messenger Initialization Failed.\n");
} | if_condition | [] |
C++ | src/resources/track.hpp | mnewhouse/tselements | bd1c6724018e862156948a680bb1bc70dd28bef6 |
#pragma once
#include "tile_library.hpp"
#include "terrain_library.hpp"
#include "texture_library.hpp"
#include "path_library.hpp"
#include "track_layer.hpp"
#include "start_point.hpp"
#include "control_point.hpp"
#include "track_path.hpp"
#include "utility/vector2.hpp"
#include <boost/range/iterator_range.hpp>
#i... |
#pragma once
#include "tile_library.hpp"
#include "terrain_library.hpp"
#include "texture_library.hpp"
#include "path_library.hpp"
#include "track_layer.hpp"
#include "start_point.hpp"
#include "control_point.hpp"
#include "track_path.hpp"
#include "utility/vector2.hpp"
#include <boost/range/iterator_range.hpp>
#i... | ult;
Track& operator=(const Track&) = default;
Track(Track&&) = default;
Track& operator=(Track&&) = default;
void set_path(const std::string& path);
const std::string& path() const noexcept;
void set_author(std::string author);
const std::string& author() const noexcept;
... | cstdint>
#include <cstddef>
#include <map>
namespace ts
{
namespace resources
{
namespace detail
{
struct ConstPathRangeTransform
{
const resources::TrackPath* operator()(const std::unique_ptr<TrackPath>& p) const
{
return p.get();
}
};
struct Path... | random | [
{
"content": "/*\n\n * Created by Phil on 5/11/2010.\n\n * Copyright 2010 Two Blue Cubes Ltd. All rights reserved.\n\n *\n\n * Distributed under the Boost Software License, Version 1.0. (See accompanying\n\n * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n */\n\n#ifndef TWOBLUECUB... |
C++ | Samples/cuSolverDn_LinearSolver/cuSolverDn_LinearSolver.cpp | rob-opsi/cuda-samples | 32943424ed7023f9168266d9fb7b76e8566fd054 |
#include <assert.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cuda_runtime.h>
#include "cublas_v2.h"
#include "cusolverDn.h"
#include "helper_cuda.h"
#include "helper_cusolver.h"
template <typename T_ELEM>
int loadMMSparseMatrix(char *filename, char elem_type, bool cs... |
#include <assert.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <cuda_runtime.h>
#include "cublas_v2.h"
#include "cusolverDn.h"
#include "helper_cuda.h"
#include "helper_cusolver.h"
template <typename T_ELEM>
int loadMMSparseMatrix(char *filename, char elem_type, bool cs... | int main(int argc, char *argv[]) {
struct testOpts opts;
cusolverDnHandle_t handle = NULL;
cublasHandle_t cublasHandle = NULL;
cudaStream_t stream = NULL;
int rowsA = 0;
int colsA = 0;
int nnzA = 0;
int baseA = 0;
int lda = 0;
int *h_csrRowPtrA = NULL;
int *h_csrColIndA = NULL;... | function_block-full_function | [
{
"content": "// structure defining the properties of a single buffer\n\nstruct bufferConfig {\n\n string name;\n\n GLenum format;\n\n int bits;\n\n};\n\n\n",
"file_path": "Common/rendercheck_gl.h",
"rank": 0,
"score": 201948.48625693982
},
{
"content": "class ArrayFileWriter<int> {\n\n p... | |
C++ | common/sockets.cpp | kkamagui/TPM2.0-TSS | 106e914dd285f1b152c127f1cad564744596cf2f | #include <tcti/tcti_socket.h>
#include "debug.h"
#include "sockets.h"
#ifndef _WIN32
void WSACleanup() {}
int WSAGetLastError() { return errno; }
#endif
void CloseSockets( SOCKET otherSock, SOCKET tpmSock)
{
closesocket(otherSock);
closesocket(tpmSock);
}
TSS2_RC recvBytes( SOCKET tpmSock, unsigned char *dat... | #include <tcti/tcti_socket.h>
#include "debug.h"
#include "sockets.h"
#ifndef _WIN32
void WSACleanup() {}
int WSAGetLastError() { return errno; }
#endif
void CloseSockets( SOCKET otherSock, SOCKET tpmSock)
{
closesocket(otherSock);
closesocket(tpmSock);
}
TSS2_RC recvBytes( SOCKET tpmSock, unsigned char *dat... | bind to IP address:port: %s:%d\n", hostName, port + 1 );
}
iResult = listen( *otherSock, 4 );
if (iResult == SOCKET_ERROR) {
SAFE_CALL( debugfunc, data, NO_PREFIX, "listen failed with error %u\n", WSAGetLastError());
closesocket(*otherSock);
... | if (iResult == SOCKET_ERROR) {
SAFE_CALL( debugfunc, data, NO_PREFIX, "bind failed with error %u\n", WSAGetLastError());
closesocket(*otherSock);
WSACleanup();
return 1;
}
else
{
SAFE_CALL( debugfunc, ... | function_block-random_span | [
{
"content": " uint16_t port;\n",
"file_path": "include/tcti/tcti_socket.h",
"rank": 0,
"score": 158306.02717439883
},
{
"content": " const char *hostname;\n",
"file_path": "include/tcti/tcti_socket.h",
"rank": 1,
"score": 127279.91855985833
},
{
"content": " voi... |
C++ | src/add-ons/media/media-add-ons/dvb/DVBCard.cpp | Kirishikesan/haiku | 835565c55830f2dab01e6e332cc7e2d9c015b51e |
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <unistd.h>
#include <sys/ioctl.h>
#include <errno.h>
#include <OS.h>
#include "DVBCard.h"
DVBCard::DVBCard(const char *path)
: fInitStatus(B_OK)
, fDev(-1)
{
printf("DVBCard opening %s\n", path);
fDev = open(path, O_RDWR);
... |
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <unistd.h>
#include <sys/ioctl.h>
#include <errno.h>
#include <OS.h>
#include "DVBCard.h"
DVBCard::DVBCard(const char *path)
: fInitStatus(B_OK)
, fDev(-1)
{
printf("DVBCard opening %s\n", path);
fDev = open(path, O_RDWR);
... | return B_OK;
}
int
DVBCard::do_ioctl(int fDev, ulong op, void *arg)
{
int res = 0;
int i;
for (i = 0; i < 20; i++) {
res = ioctl(fDev, op, arg);
if (res >= 0)
break;
}
if (i != 0) printf("ioctl %lx repeated %d times\n", op, i);
return res;
}
| pe)
{
dvb_interface_info_t info;
if (do_ioctl(fDev, DVB_GET_INTERFACE_INFO, &info) < 0) {
printf("DVB_GET_INTERFACE_INFO failed with error %s\n", strerror(errno));
return errno;
}
if (info.version < 1) {
printf("DVBCard::GetCardInfo wrong API version\n");
return B_ERROR;
}
*type = info.type;
return B... | random | [] |
C++ | cpdp/src/v20190820/model/CreateInvoiceItem.cpp | li5ch/tencentcloud-sdk-cpp | 12ebfd75a399ee2791f6ac1220a79ce8a9faf7c4 |
#include <tencentcloud/cpdp/v20190820/model/CreateInvoiceItem.h>
using TencentCloud::CoreInternalOutcome;
using namespace TencentCloud::Cpdp::V20190820::Model;
using namespace rapidjson;
using namespace std;
CreateInvoiceItem::CreateInvoiceItem() :
m_nameHasBeenSet(false),
m_taxCodeHasBeenSet(false),
m_... |
#include <tencentcloud/cpdp/v20190820/model/CreateInvoiceItem.h>
using TencentCloud::CoreInternalOutcome;
using namespace TencentCloud::Cpdp::V20190820::Model;
using namespace rapidjson;
using namespace std;
CreateInvoiceItem::CreateInvoiceItem() :
m_nameHasBeenSet(false),
m_taxCodeHasBeenSet(false),
m_... |
void CreateInvoiceItem::ToJsonObject(Value &value, Document::AllocatorType& allocator) const
{
if (m_nameHasBeenSet)
{
Value iKey(kStringType);
string key = "Name";
iKey.SetString(key.c_str(), allocator);
value.AddMember(iKey, Value(m_name.c_str(), allocator).Move(), allocator... | CoreInternalOutcome CreateInvoiceItem::Deserialize(const Value &value)
{
string requestId = "";
if (value.HasMember("Name") && !value["Name"].IsNull())
{
if (!value["Name"].IsString())
{
return CoreInternalOutcome(Error("response `CreateInvoiceItem.Name` IsString=false incorrect... | function_block-full_function | [] |
C++ | src/tracking/multi_tracker.cpp | PPokorski/laser_object_tracker | bc967459218b417c7e0e97603464e77f110e25ef |
#include "laser_object_tracker/tracking/multi_tracker.hpp"
#include <numeric>
namespace laser_object_tracker {
namespace tracking {
MultiTracker::MultiTracker(DistanceFunctor distance_calculator,
std::unique_ptr<data_association::BaseDataAssociation> data_association,
... |
#include "laser_object_tracker/tracking/multi_tracker.hpp"
#include <numeric>
namespace laser_object_tracker {
namespace tracking {
MultiTracker::MultiTracker(DistanceFunctor distance_calculator,
std::unique_ptr<data_association::BaseDataAssociation> data_association,
... |
void MultiTracker::handleRejectedTracks() {
auto trackers_it = trackers_.cbegin();
auto rejectors_it = trackers_rejections_.cbegin();
for (; trackers_it != trackers_.cend(); ) {
const auto& tracker = **trackers_it;
const auto& rejector = **rejectors_it;
if (rejector.invalidate(tracker)) {
trac... | void MultiTracker::handleNotUpdatedTracks(const Eigen::VectorXi& assignment_vector) {
std::vector<int> trackers_indices(trackers_.size());
std::iota(trackers_indices.begin(), trackers_indices.end(), 0);
std::vector<int> updated_trackers(assignment_vector.data(), assignment_vector.data() + assignment_vector.size(... | function_block-full_function | [
{
"content": "*\n\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n* DISCLAIMED. IN NO EVENT SHALL THE COPYRIG... |
C++ | src/rendering/ui.cpp | hyp/Arpheg | 78d142c15028da7c0c2ef4503bed6bcfd1ced67d | #include <limits>
#include <string.h>
#include "../core/assert.h"
#include "../core/allocatorNew.h"
#include "../core/bufferArray.h"
#include "../services.h"
#include "rendering.h"
#include "ui.h"
#include "../data/font/font.h"
#include "2d.h"
#include "text.h"
#include "opengl/gl.h"
namespace rendering {
namespace ui... | #include <limits>
#include <string.h>
#include "../core/assert.h"
#include "../core/allocatorNew.h"
#include "../core/bufferArray.h"
#include "../services.h"
#include "rendering.h"
#include "ui.h"
#include "../data/font/font.h"
#include "2d.h"
#include "text.h"
#include "opengl/gl.h"
namespace rendering {
namespace ui... | ;
core::bufferArray::nth<BatchImpl>(batches_,id).font = font;
BatchFontMapping map = {font,id};
core::bufferArray::add<BatchFontMapping>(fontBatches_,map);
return id;
}
Batch::Geometry Service::allocate(uint32 layerId,const data::Font* font,uint32 vertexCount,uint32 indexCount) {
uint32 batchId = 0xFFFF;
using... | registerBatch(batch,
font->renderingType() == text::fontType::Outlined? OutlinedTextPipeline : TextPipeline,
font->renderingType() == text::fontType::Outlined? OutlinedTextGeometry : TextGeometry) | call_expression | [
{
"content": "struct Batch {\n\n\tenum { kMaxLayer = 0xFF };\n\n\tenum { kMaxDepth = 0xFF };\n\n\n\n\ttypedef batching::Geometry Geometry;\n\n\n\n\tsize_t verticesSize,indicesSize;\n\n\ttopology::Primitive primitive;\n\n\tconst char* name;\n\n\tuint32 layer,depth;//Batches are sorted by depth and layers.\n\n\n\... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.