PairType;\\n\\n typedef PairType* iterator;\\n\\n\\n\\n VmaMap(const VmaStlAllocator<PairType>& allocator) : m_Vector(allocator) { }\\n\\n\\n\\n iterator begin() { return m_Vector.begin(); }\\n\\n iterator end() { return m_Vector.end(); }\\n\\n\\n\\n void insert(const PairType& pair);\\n\\n iterator find(const KeyT& key);\\n\\n void erase(iterator it);\\n\\n \\n\\nprivate:\\n\\n VmaVector< PairType, VmaStlAllocator<PairType> > m_Vector;\\n\\n};\\n\\n\\n\\n#define VMA_MAP_TYPE(KeyT, ValueT) VmaMap<KeyT, ValueT>\\n\\n\\n\\ntemplate<typename FirstT, typename SecondT>\\n\",\n \"file_path\": \"engine/include/gfx/vulkan/vk_mem_alloc.h\",\n \"rank\": 48,\n \"score\": 87436.45526183337\n },\n {\n \"content\": \"enum BufferMapUsage\\n\\n{\\n\\n\\tGFX_BUFFER_MAP_READ = 1,\\n\\n\\tGFX_BUFFER_MAP_WRITE = 2,\\n\\n\\tGFX_BUFFER_MAP_READ_WRITE = 4,\\n\\n\\tGFX_BUFFER_MAP_PERSISTANT = 8\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/gfx_enums.hpp\",\n \"rank\": 49,\n \"score\": 87436.45526183337\n },\n {\n \"content\": \"struct Texture\\n\\n{\\n\\n GLuint id;\\n\\n uint16_t resource_id;\\n\\n GLenum gl_texture_target;\\n\\n\\tuint32_t mipLevels;\\n\\n\\tuint32_t arraySize;\\n\\n\\tGLenum internalFormat;\\n\\n\\tGLenum format;\\n\\n\\tGLenum type;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/opengl/gfx_types_gl.hpp\",\n \"rank\": 50,\n \"score\": 86739.03420739449\n },\n {\n \"content\": \"struct TextureCreateDesc\\n\\n{\\n\\n\\tTextureFormat format;\\n\\n\\tTextureUsage texture_usage;\\n\\n\\tResourceUsage resource_usage;\\n\\n\\tTextureType\\t type;\\n\\n uint16_t width;\\n\\n uint16_t height;\\n\\n uint16_t depth;\\n\\n\\tSampleCount samples;\\n\\n void* data;\\n\\n\\tuint16_t array_slices;\\n\\n uint16_t mipmap_levels;\\n\\n uint32_t flags;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/gfx_descs.hpp\",\n \"rank\": 51,\n \"score\": 86739.03420739449\n },\n {\n \"content\": \"struct Texture\\n\\n{\\n\\n\\tTextureType type;\\n\\n\\tTextureFormat format;\\n\\n\\tuint32_t\\twidth;\\n\\n\\tuint32_t\\theight;\\n\\n\\tuint32_t\\tdepth;\\n\\n\\tVkImage image;\\n\\n\\tVkFormat vk_format;\\n\\n\\tVkImageType vk_type;\\n\\n\\t// For accessing images in shaders.\\n\\n\\tVkImageView vk_image_view; \\n\\n\\tVkImageAspectFlags aspect_flags;\\n\\n\\tVkSampleCountFlagBits sample_count;\\n\\n\\tstruct VmaAllocation_T* allocation;\\n\\n\\tVkDeviceMemory device_memory;\\n\\n\\tResourceState current_state;\\n\\n\\n\\n\\tTexture()\\n\\n\\t{\\n\\n\\t\\timage = VK_NULL_HANDLE;\\n\\n\\t\\tvk_image_view = VK_NULL_HANDLE;\\n\\n\\t\\tallocation = VK_NULL_HANDLE;\\n\\n\\t\\tdevice_memory = VK_NULL_HANDLE;\\n\\n\\t\\tvk_format = VK_FORMAT_UNDEFINED;\\n\\n\\t\\tcurrent_state = GFX_RESOURCE_STATE_UNDEFINED;\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/vulkan/gfx_types_vk.hpp\",\n \"rank\": 52,\n \"score\": 86739.03420739449\n },\n {\n \"content\": \"enum TextureAddressMode\\n\\n{\\n\\n\\tGFX_ADDRESS_REPEAT = 0,\\n\\n\\tGFX_ADDRESS_MIRRORED_REPEAT = 1,\\n\\n\\tGFX_ADDRESS_CLAMP_TO_EDGE = 2,\\n\\n\\tGFX_ADDRESS_CLAMP_TO_BORDER = 3\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/gfx_enums.hpp\",\n \"rank\": 53,\n \"score\": 86739.03420739449\n },\n {\n \"content\": \"struct Texture\\n\\n{\\n\\n\\tComPtr<ID3D12Resource> d3d12_texture;\\n\\n\\tCD3DX12_CPU_DESCRIPTOR_HANDLE d3d12_srv;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/direct3d12/gfx_types_d3d12.hpp\",\n \"rank\": 54,\n \"score\": 86739.03420739449\n },\n {\n \"content\": \"struct TextureResourceBarrier\\n\\n{\\n\\n\\tTexture*\\t texture;\\n\\n\\tResourceState target_state;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/gfx_descs.hpp\",\n \"rank\": 55,\n \"score\": 86739.03420739449\n },\n {\n \"content\": \"class VmaStringBuilder\\n\\n{\\n\\npublic:\\n\\n VmaStringBuilder(VmaAllocator alloc) : m_Data(VmaStlAllocator<char>(alloc->GetAllocationCallbacks())) { }\\n\\n size_t GetLength() const { return m_Data.size(); }\\n\\n const char* GetData() const { return m_Data.data(); }\\n\\n\\n\\n void Add(char ch) { m_Data.push_back(ch); }\\n\\n void Add(const char* pStr);\\n\\n void AddNewLine() { Add('\\\\n'); }\\n\\n void AddNumber(uint32_t num);\\n\\n void AddNumber(uint64_t num);\\n\\n void AddPointer(const void* ptr);\\n\\n\\n\\nprivate:\\n\\n VmaVector< char, VmaStlAllocator<char> > m_Data;\\n\\n};\\n\\n\\n\\nvoid VmaStringBuilder::Add(const char* pStr)\\n\\n{\\n\",\n \"file_path\": \"engine/include/gfx/vulkan/vk_mem_alloc.h\",\n \"rank\": 56,\n \"score\": 85157.11588568868\n },\n {\n \"content\": \"class VmaJsonWriter\\n\\n{\\n\\npublic:\\n\\n VmaJsonWriter(const VkAllocationCallbacks* pAllocationCallbacks, VmaStringBuilder& sb);\\n\\n ~VmaJsonWriter();\\n\\n\\n\\n void BeginObject(bool singleLine = false);\\n\\n void EndObject();\\n\\n \\n\\n void BeginArray(bool singleLine = false);\\n\\n void EndArray();\\n\\n \\n\\n void WriteString(const char* pStr);\\n\\n void BeginString(const char* pStr = VMA_NULL);\\n\\n void ContinueString(const char* pStr);\\n\\n void ContinueString(uint32_t n);\\n\\n void ContinueString(uint64_t n);\\n\\n void ContinueString_Pointer(const void* ptr);\\n\\n void EndString(const char* pStr = VMA_NULL);\\n\\n \\n\",\n \"file_path\": \"engine/include/gfx/vulkan/vk_mem_alloc.h\",\n \"rank\": 57,\n \"score\": 85146.67384879044\n },\n {\n \"content\": \"struct RenderDeviceInitData\\n\\n{\\n\\n void* memory;\\n\\n size_t size;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/gfx_descs.hpp\",\n \"rank\": 58,\n \"score\": 85132.72747547894\n },\n {\n \"content\": \"struct DeviceData\\n\\n{\\n\\n void* window;\\n\\n uint16_t width;\\n\\n uint16_t height;\\n\\n GLenum\\t\\t primitive_type;\\n\\n ShaderProgram* current_program;\\n\\n GLuint\\t\\t last_sampler_location;\\n\\n IndexBuffer* current_index_buffer = nullptr;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"engine/include/gfx/opengl/gfx_types_gl.hpp\",\n \"rank\": 59,\n \"score\": 85132.72747547894\n },\n {\n \"content\": \"struct BufferTextureCopyRegion\\n\\n{\\n\\n\\tsize_t src_offset;\\n\\n\\tsize_t row_pitch;\\n\\n\\tsize_t height;\\n\\n\\tint32_t offsets[3];\\n\\n\\tuint32_t extents[3];\\n\\n\\tuint32_t mip_level;\\n\\n\\tuint32_t base_array_layer;\\n\\n\\tuint32_t layer_count;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/gfx_descs.hpp\",\n \"rank\": 60,\n \"score\": 84439.81485478055\n },\n {\n \"content\": \" bool verbose = false;\\n\",\n \"file_path\": \"tools/mesh_import/include/options.h\",\n \"rank\": 61,\n \"score\": 82981.9423429682\n },\n {\n \"content\": \"class TypeResolver<StringBuffer<N>>\\n\\n{\\n\\npublic:\\n\\n\\tstatic TypeDescriptor* get()\\n\\n\\t{\\n\\n\\t\\tstatic TypeDescriptor_StringBuffer<N> typeDesc;\\n\\n\\t\\treturn &typeDesc;\\n\\n\\t}\\n\\n};\\n\\n\\n\\nTE_END_TERMINUS_NAMESPACE\",\n \"file_path\": \"engine/include/io/type_descriptor.hpp\",\n \"rank\": 62,\n \"score\": 82958.11847694902\n },\n {\n \"content\": \"struct Texture2D : Texture\\n\\n{\\n\\n uint16_t width;\\n\\n uint16_t height;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/opengl/gfx_types_gl.hpp\",\n \"rank\": 63,\n \"score\": 82259.34018594169\n },\n {\n \"content\": \"struct Texture3D : Texture\\n\\n{\\n\\n \\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/opengl/gfx_types_gl.hpp\",\n \"rank\": 64,\n \"score\": 82259.34018594169\n },\n {\n \"content\": \"struct Texture1D : Texture\\n\\n{\\n\\n \\n\\n};\\n\\n\\n\",\n \"file_path\": \"engine/include/gfx/opengl/gfx_types_gl.hpp\",\n \"rank\": 65,\n \"score\": 82259.34018594169\n },\n {\n \"content\": \"struct TypeDescriptor_StringBuffer : TypeDescriptor\\n\\n{\\n\\n\\tTypeDescriptor_StringBuffer() : TypeDescriptor{ \\\"StringBuffer\\\", sizeof(StringBuffer<N>) }\\n\\n\\t{\\n\\n\\n\\n\\t}\\n\\n\\n\\n\\tvoid serialize(void* obj, const char* name, ISerializer* serializer)\\n\\n\\t{\\n\\n\\t\\tif (serializer->is_raw_serializable())\\n\\n\\t\\t\\tserializer->raw_serialize(obj, m_size);\\n\\n\\t\\telse\\n\\n\\t\\t\\tserializer->serialize(name, (const char*)obj);\\n\\n\\t}\\n\\n\\n\\n\\tvoid deserialize(void* obj, const char* name, ISerializer* serializer)\\n\\n\\t{\\n\\n\\t\\tif (serializer->is_raw_serializable())\\n\\n\\t\\t\\tserializer->raw_deserialize(obj, m_size);\\n\\n\\t\\telse\\n\",\n \"file_path\": \"engine/include/io/type_descriptor.hpp\",\n \"rank\": 66,\n \"score\": 80869.83088395736\n },\n {\n \"content\": \" int output_h;\\n\",\n \"file_path\": \"tools/texture_import/src/stb_image_resize.h\",\n \"rank\": 67,\n \"score\": 80642.27959821923\n },\n {\n \"content\": \" int output_w;\\n\",\n \"file_path\": \"tools/texture_import/src/stb_image_resize.h\",\n \"rank\": 68,\n \"score\": 80642.27959821923\n },\n {\n \"content\": \" void *raw_data, *raw_coeff;\\n\",\n \"file_path\": \"tools/texture_import/src/stb_image.h\",\n \"rank\": 69,\n \"score\": 80598.68639245721\n },\n {\n \"content\": \"\\tchar joint_name[50];\\n\",\n \"file_path\": \"tools/mesh_import/include/tsm_animation.h\",\n \"rank\": 70,\n \"score\": 78840.44844284334\n },\n {\n \"content\": \"\\tString mesh_name;\\n\",\n \"file_path\": \"tools/mesh_import/include/tsm_material.h\",\n \"rank\": 71,\n \"score\": 78840.44844284334\n },\n {\n \"content\": \" const void* input_data;\\n\",\n \"file_path\": \"tools/texture_import/src/stb_image_resize.h\",\n \"rank\": 72,\n \"score\": 78667.04206424177\n },\n {\n \"content\": \" void *io_user_data;\\n\",\n \"file_path\": \"tools/texture_import/src/stb_image.h\",\n \"rank\": 73,\n \"score\": 78667.04206424177\n },\n {\n \"content\": \"PFNGLNAMEDBUFFERDATAPROC glad_glNamedBufferData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 74,\n \"score\": 77417.57087635256\n },\n {\n \"content\": \"PFNGLMAPNAMEDBUFFERPROC glad_glMapNamedBuffer;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 75,\n \"score\": 77405.22837947929\n },\n {\n \"content\": \"struct TSM_Material_Json\\n\\n{\\n\\n\\tchar material[50];\\n\",\n \"file_path\": \"tools/mesh_import/include/tsm_material.h\",\n \"rank\": 76,\n \"score\": 76984.10460762131\n },\n {\n \"content\": \"struct AssimpImportData;\\n\",\n \"file_path\": \"tools/mesh_import/include/binary_exporter.h\",\n \"rank\": 77,\n \"score\": 76971.49520066062\n },\n {\n \"content\": \"struct AssimpImportData\\n\\n{\\n\\n\\tTSM_FileHeader header;\\n\\n\\tTSM_MeshHeader* meshes;\\n\\n\\tAssimp_Material* materials;\\n\\n\\tTSM_Vertex*\\t\\t\\tvertices;\\n\\n\\tTSM_SkeletalVertex* skeletal_vertices;\\n\\n\\tuint32_t*\\t\\t\\tindices;\\n\\n\\tbool\\t\\t\\t skeletal;\\n\\n std::string mesh_path;\\n\\n std::string filename;\\n\",\n \"file_path\": \"tools/mesh_import/include/assimp_importer.h\",\n \"rank\": 78,\n \"score\": 76971.49520066062\n },\n {\n \"content\": \"struct TypeDescriptor_StaticHashMap: TypeDescriptor_Container\\n\\n{\\n\\n\\tTypeDescriptor* m_key_desc;\\n\\n\\tvoid* (*get_key)(void*, size_t);\\n\\n\\tvoid (*deserialize_pair)(void*, TypeDescriptor*, TypeDescriptor*, ISerializer*);\\n\\n\\n\\n\\tTypeDescriptor_StaticHashMap() : TypeDescriptor_Container{ \\\"StaticHashMap\\\", sizeof(StaticHashMap<KEY_TYPE, VALUE_TYPE, N>) }\\n\\n\\t{\\n\\n\\t\\tm_object_desc = TypeResolver<StripPointer<VALUE_TYPE>::Type>::get();\\n\\n\\t\\tm_key_desc = TypeResolver<StripPointer<KEY_TYPE>::Type>::get();\\n\\n\\n\\n\\t\\tget_size = [](void* obj) -> size_t {\\n\\n\\t\\t\\tStaticHashMap<KEY_TYPE, VALUE_TYPE, N>* hash_map = (StaticHashMap<KEY_TYPE, VALUE_TYPE, N>*)obj;\\n\\n\\t\\t\\treturn hash_map->size();\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tget_item = [](void* obj, size_t idx) -> void* {\\n\\n\\t\\t\\tStaticHashMap<KEY_TYPE, VALUE_TYPE, N>* hash_map = (StaticHashMap<KEY_TYPE, VALUE_TYPE, N>*)obj;\\n\\n\\t\\t\\treturn &hash_map->m_value[idx];\\n\\n\\t\\t};\\n\",\n \"file_path\": \"engine/include/io/type_descriptor.hpp\",\n \"rank\": 79,\n \"score\": 76958.85690102493\n },\n {\n \"content\": \" int output_stride_bytes;\\n\",\n \"file_path\": \"tools/texture_import/src/stb_image_resize.h\",\n \"rank\": 80,\n \"score\": 76867.37161857035\n },\n {\n \"content\": \"PFNGLNAMEDFRAMEBUFFERTEXTUREPROC glad_glNamedFramebufferTexture;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 81,\n \"score\": 76805.74727601997\n },\n {\n \"content\": \"PFNGLCLEARNAMEDBUFFERDATAPROC glad_glClearNamedBufferData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 82,\n \"score\": 75647.03198472747\n },\n {\n \"content\": \"PFNGLNAMEDBUFFERSUBDATAPROC glad_glNamedBufferSubData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 83,\n \"score\": 75647.03198472747\n },\n {\n \"content\": \"PFNGLINVALIDATENAMEDFRAMEBUFFERDATAPROC glad_glInvalidateNamedFramebufferData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 84,\n \"score\": 75647.03198472747\n },\n {\n \"content\": \"PFNGLMAPNAMEDBUFFERRANGEPROC glad_glMapNamedBufferRange;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 85,\n \"score\": 75634.97176060553\n },\n {\n \"content\": \"PFNGLNAMEDFRAMEBUFFERTEXTURELAYERPROC glad_glNamedFramebufferTextureLayer;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 86,\n \"score\": 75049.20078259261\n },\n {\n \"content\": \"PFNGLINVALIDATENAMEDFRAMEBUFFERSUBDATAPROC glad_glInvalidateNamedFramebufferSubData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 87,\n \"score\": 73955.66679672891\n },\n {\n \"content\": \"PFNGLCOPYNAMEDBUFFERSUBDATAPROC glad_glCopyNamedBufferSubData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 88,\n \"score\": 73955.66679672891\n },\n {\n \"content\": \"PFNGLGETNAMEDBUFFERSUBDATAPROC glad_glGetNamedBufferSubData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 89,\n \"score\": 73955.66679672891\n },\n {\n \"content\": \"PFNGLCLEARNAMEDBUFFERSUBDATAPROC glad_glClearNamedBufferSubData;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 90,\n \"score\": 73955.66679672891\n },\n {\n \"content\": \"PFNGLFLUSHMAPPEDNAMEDBUFFERRANGEPROC glad_glFlushMappedNamedBufferRange;\\n\",\n \"file_path\": \"engine/src/gfx/opengl/glad.c\",\n \"rank\": 91,\n \"score\": 73943.87622288543\n },\n {\n \"content\": \"class TypeResolver<StaticHashMap<KEY_TYPE, VALUE_TYPE, N>>\\n\\n{\\n\\npublic:\\n\\n\\tstatic TypeDescriptor* get()\\n\\n\\t{\\n\\n\\t\\tstatic TypeDescriptor_StaticHashMap<KEY_TYPE, VALUE_TYPE, N> typeDesc;\\n\\n\\t\\treturn &typeDesc;\\n\\n\\t}\\n\\n};\\n\\n\\n\\ntemplate <size_t N>\\n\",\n \"file_path\": \"engine/include/io/type_descriptor.hpp\",\n \"rank\": 92,\n \"score\": 73438.76068369723\n },\n {\n \"content\": \"#include <iostream>\\n\\n#include <core/application.hpp>\\n\\n#include <core/engine_core.hpp>\\n\\n#include <core/terminus_macros.hpp>\\n\\n#include <io/reflection.hpp>\\n\\n#include <io/json_serializer.hpp>\\n\\n#include <io/binary_serializer.hpp>\\n\\n#include <io/memory_stream.hpp>\\n\\n#include <io/file_stream.hpp>\\n\\n#include <io/logger.hpp>\\n\\n\\n\\nTE_BEGIN_TERMINUS_NAMESPACE\\n\\n\\n\\nvoid on_state_input(Event* e)\\n\\n{\\n\\n\\tif (e->data.input_state.hash == TE_HASH(\\\"fire\\\"))\\n\\n\\t{\\n\\n\\t\\tif (e->data.input_state.state == 1)\\n\\n\\t\\t\\tstd::cout << \\\"Fire State ON\\\" << std::endl;\\n\\n\\t\\telse\\n\",\n \"file_path\": \"samples/2_texture/main.cpp\",\n \"rank\": 93,\n \"score\": 51340.41061869478\n },\n {\n \"content\": \"void create_foo(Foo& foo)\\n\\n{\\n\\n\\tfoo.list.resize(10);\\n\\n\\n\\n\\tfor (int i = 0; i < 10; i++)\\n\\n\\t\\tfoo.list[i] = rand();\\n\\n\\n\\n\\tfor (int i = 0; i < 10; i++)\\n\\n\\t{\\n\\n\\t\\tBar obj;\\n\\n\\t\\tobj.a = rand();\\n\\n\\t\\tobj.b = rand();\\n\\n\\t\\tfoo.test.push_back(obj);\\n\\n\\t}\\n\\n\\n\\n\\tfoo.map.set(\\\"Jesse\\\", 434);\\n\\n\\tfoo.map.set(\\\"Walter\\\", 85);\\n\\n}\\n\\n\\n\\nvoid test_bin_serialize_fs(const Foo& foo)\\n\",\n \"file_path\": \"samples/2_texture/main.cpp\",\n \"rank\": 94,\n \"score\": 51333.530418559625\n },\n {\n \"content\": \"\\tserializer.save(foo);\\n\\n\\tserializer.flush_to_stream();\\n\\n\\n\\n\\tf->write(stream.data(), stream.size(), 1);\\n\\n\\tglobal::filesystem().close_file(f);\\n\\n}\\n\\n\\n\\nvoid test_deserialize_ms()\\n\\n{\\n\\n\\tFile* f = global::filesystem().open_file(\\\"test_m.json\\\", TE_FS_READ | TE_FS_BINARY);\\n\\n\\n\\n\\tsize_t size = f->size();\\n\\n\\tchar* buf = (char*)TE_HEAP_ALLOC(size + 1);\\n\\n\\tf->read(buf, size, 1);\\n\\n\\tbuf[size] = '\\\\0';\\n\\n\\n\\n\\tMemoryStream stream(buf, size);\\n\\n\\tJsonSerializer serializer(stream);\\n\\n\\n\\n\\tserializer.print();\\n\",\n \"file_path\": \"samples/2_texture/main.cpp\",\n \"rank\": 95,\n \"score\": 51329.46705030664\n },\n {\n \"content\": \"\\t\\t\\tstd::cout << \\\"Fire State OFF\\\" << std::endl;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid on_action_input(Event* e)\\n\\n{\\n\\n\\tif (e->data.input_action.hash == TE_HASH(\\\"block\\\"))\\n\\n\\t\\tstd::cout << \\\"Block action\\\" << std::endl;\\n\\n}\\n\\n\\n\\nvoid on_axis_input(Event* e)\\n\\n{\\n\\n\\tif (e->data.input_axis.hash == TE_HASH(\\\"forward\\\"))\\n\\n\\t{\\n\\n\\t\\tstd::cout << \\\"Forward axis : \\\" << e->data.input_axis.value << std::endl;\\n\\n\\t}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"samples/2_texture/main.cpp\",\n \"rank\": 96,\n \"score\": 51329.32959440261\n },\n {\n \"content\": \"\\tserializer.load(foo);\\n\\n\\n\\n\\tglobal::filesystem().close_file(f);\\n\\n}\\n\\n\\n\\nvoid test_serialize_fs(const Foo& foo)\\n\\n{\\n\\n\\tFile* f = global::filesystem().open_file(\\\"test_f.json\\\", TE_FS_WRITE | TE_FS_BINARY);\\n\\n\\n\\n\\tFileStream stream(f);\\n\\n\\tJsonSerializer serializer(stream);\\n\\n\\n\\n\\tserializer.save(foo);\\n\\n\\tserializer.flush_to_stream();\\n\\n\\n\\n\\tglobal::filesystem().close_file(f);\\n\\n}\\n\\n\\n\\nvoid test_deserialize_fs()\\n\\n{\\n\",\n \"file_path\": \"samples/2_texture/main.cpp\",\n \"rank\": 97,\n \"score\": 51328.41320157327\n },\n {\n \"content\": \"\\tFile* f = global::filesystem().open_file(\\\"test_f.json\\\", TE_FS_READ | TE_FS_BINARY);\\n\\n\\n\\n\\tFileStream stream(f);\\n\\n\\tJsonSerializer serializer(stream);\\n\\n\\n\\n\\tserializer.print();\\n\\n\\n\\n\\tFoo foo;\\n\\n\\tserializer.load(foo);\\n\\n\\n\\n\\tglobal::filesystem().close_file(f);\\n\\n}\\n\\n\\n\\nvoid test_serialize_ms(const Foo& foo)\\n\\n{\\n\\n\\tFile* f = global::filesystem().open_file(\\\"test_m.json\\\", TE_FS_WRITE | TE_FS_BINARY);\\n\\n\\n\\n\\tMemoryStream stream;\\n\\n\\tJsonSerializer serializer(stream);\\n\\n\\n\",\n \"file_path\": \"samples/2_texture/main.cpp\",\n \"rank\": 98,\n \"score\": 51327.82600898352\n },\n {\n \"content\": \"\\t\\tvbo_desc.usage_flags = GFX_RESOURCE_USAGE_GPU_ONLY;\\n\\n\\t\\tvbo_desc.data_type = GFX_DATA_TYPE_FLOAT;\\n\\n\\t\\tvbo_desc.offset = 0;\\n\\n\\t\\tvbo_desc.size = sizeof(kVertices);\\n\\n\\t\\tvbo_desc.data = (void*)&kVertices[0];\\n\\n\\n\\n\\t\\tm_vbo = global::gfx_device().create_buffer(vbo_desc);\\n\\n\\n\\n\\t\\tif (!m_vbo)\\n\\n\\t\\t{\\n\\n\\t\\t\\tTE_LOG_ERROR(\\\"Failed to create Vertex Buffer!\\\");\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tBufferCreateDesc ibo_desc;\\n\\n\\t\\tibo_desc.creation_flags = GFX_BUFFER_CREATION_COMMITTED;\\n\\n\\t\\tibo_desc.type = GFX_BUFFER_INDEX;\\n\\n\\t\\tibo_desc.usage_flags = GFX_RESOURCE_USAGE_GPU_ONLY;\\n\\n\\t\\tibo_desc.data_type = GFX_DATA_TYPE_UINT32;\\n\\n\\t\\tibo_desc.offset = 0;\\n\",\n \"file_path\": \"samples/2_texture/main.cpp\",\n \"rank\": 99,\n \"score\": 51327.081838216254\n }\n]","isConversational":false}}},{"rowIdx":461,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/EventTraceKit.Etw/EventSession.cpp"},"repo_name":{"kind":"string","value":"ljani/event-trace-kit"},"commit":{"kind":"string","value":"59a217fbaecfc87b3915e2494a8d25593d04ae99"},"file_code":{"kind":"string","value":"#include \"Descriptors.h\"\n#include \"TraceLog.h\"\n#include \"WatchDog.h\"\n#include \"InteropHelper.h\"\n\n#include \"etk/ITraceLog.h\"\n#include \"etk/ITraceProcessor.h\"\n#include \"etk/ITraceSession.h\"\n\n#include <memory>\n#include <string>\n\nusing namespace System;\nusing namespace System::Collections::Generic;\nusing namespace System::ComponentModel;\nusing namespace System::Linq;\nusing namespace System::Runtime::InteropServices;\nusing namespace System::Threading::Tasks;\nusing namespace EventTraceKit::Tracing;\nusing msclr::interop::marshal_as;\n\nnamespace msclr\n{\nnamespace interop\n{\n\nstatic bool IsProviderBinary(String^ filePath)\n{\n return\n filePath->EndsWith(L\".exe\", StringComparison::OrdinalIgnoreCase) ||\n filePath->EndsWith(L\".dll\", StringComparison::OrdinalIgnoreCase);\n}\n\ntemplate<>\ninline etk::TraceProviderDescriptor marshal_as(EventProviderDescriptor^ const& provider)\n{\n etk::TraceProviderDescriptor native(\n marshal_as<GUID>(provider->Id), provider->Level, provider->MatchAnyKeyword,\n provider->MatchAllKeyword);\n\n native.IncludeSecurityId = provider->IncludeSecurityId;\n native.IncludeTerminalSessionId = provider->IncludeTerminalSessionId;\n native.IncludeStackTrace = provider->IncludeStackTrace;\n\n if (provider->ExecutableName)\n native.ExecutableName = marshal_as<std::wstring>(provider->ExecutableName);\n if (provider->ProcessIds)\n native.ProcessIds = marshal_as_vector(provider->ProcessIds);\n\n native.EventIdsFilterIn = provider->EventIdsFilterIn;\n if (provider->EventIds)\n native.EventIds = marshal_as_vector(provider->EventIds);\n\n native.StackWalkEventIdsFilterIn = provider->StackWalkEventIdsFilterIn;\n if (provider->StackWalkEventIds)\n native.StackWalkEventIds = marshal_as_vector(provider->StackWalkEventIds);\n\n native.FilterStackWalkLevelKeyword = provider->FilterStackWalkLevelKeyword;\n native.StackWalkFilterIn = provider->StackWalkFilterIn;\n native.StackWalkLevel = provider->StackWalkLevel;\n native.StackWalkMatchAnyKeyword = provider->StackWalkMatchAnyKeyword;\n native.StackWalkMatchAllKeyword = provider->StackWalkMatchAllKeyword;\n\n if (provider->Manifest) {\n auto manifest = marshal_as<std::wstring>(provider->Manifest);\n if (IsProviderBinary(provider->Manifest))\n native.SetProviderBinary(manifest);\n else\n native.SetManifest(manifest);\n }\n\n return native;\n}\n\n} \n} \n\nnamespace EventTraceKit::Tracing\n{\n\npublic ref struct TraceStatistics\n{\n property unsigned NumberOfBuffers;\n property unsigned FreeBuffers;\n property unsigned EventsLost;\n property unsigned BuffersWritten;\n property unsigned LogBuffersLost;\n property unsigned RealTimeBuffersLost;\n property unsigned LoggerThreadId;\n};\n\npublic ref class EventSession : public System::IDisposable\n{\npublic:\n EventSession(TraceProfileDescriptor^ profile, TraceLog^ traceLog);\n ~EventSession() { this->!EventSession(); }\n !EventSession();\n\n void Start();\n Task^ StartAsync();\n void Stop();\n void Flush();\n TraceStatistics^ Query();\n\nprivate:\n ref struct StartAsyncHelper\n {\n StartAsyncHelper(EventSession^ parent)\n : parent(parent) {}\n\n void Run()\n {\n parent->Start();\n }\n\n EventSession^ parent;\n };\n\n TraceProfileDescriptor^ profile;\n TraceLog^ traceLog;\n std::wstring* loggerName = nullptr;\n WatchDog^ watchDog;\n\n etk::ITraceSession* session = nullptr;\n etk::ITraceSession* kernelSession = nullptr;\n etk::ITraceProcessor* processor = nullptr;\n};\n\nstatic std::wstring LoggerNameBase = L\"EventTraceKit_54644792-9281-48E9-B69D-E82A86F98960\";\n\nstatic std::wstring CreateLoggerName()\n{\n int pid = System::Diagnostics::Process::GetCurrentProcess()->Id;\n return LoggerNameBase + L\"_\" + std::to_wstring(pid);\n}\n\nstatic etk::TraceProperties CreateTraceProperties(CollectorDescriptor^ profile)\n{\n etk::TraceProperties properties(marshal_as<GUID>(System::Guid::NewGuid()));\n if (profile->BufferSize.HasValue)\n properties.BufferSize = profile->BufferSize.Value;\n if (profile->MinimumBuffers.HasValue)\n properties.MinimumBuffers = profile->MinimumBuffers.Value;\n if (profile->MaximumBuffers.HasValue)\n properties.MaximumBuffers = profile->MaximumBuffers.Value;\n if (profile->LogFileName)\n properties.LogFileName = marshal_as<std::wstring>(profile->LogFileName);\n if (profile->FlushPeriod.HasValue) {\n properties.FlushPeriod = std::chrono::duration<unsigned, std::milli>(\n static_cast<unsigned>(profile->FlushPeriod.Value.TotalMilliseconds));\n }\n return properties;\n}\n\nEventSession::EventSession(TraceProfileDescriptor^ profile, TraceLog^ traceLog)\n : profile(profile)\n , traceLog(traceLog)\n , loggerName(new std::wstring(CreateLoggerName()))\n{\n if (profile->Collectors->Count == 0)\n throw gcnew System::ArgumentException(L\"profile\");\n if (!traceLog)\n throw gcnew System::ArgumentNullException(L\"traceLog\");\n\n watchDog = gcnew WatchDog(marshal_as<String^>(*loggerName));\n traceLog->UpdateTraceData(profile);\n\n for each (auto collector in profile->Collectors) {\n if (auto systemCollector = dynamic_cast<SystemCollectorDescriptor^>(collector)) {\n auto traceProperties = CreateTraceProperties(systemCollector);\n auto session = etk::CreateEtwTraceSession(L\"NT Kernel Logger\", traceProperties);\n session->SetKernelProviders(systemCollector->KernelFlags, true);\n this->kernelSession = session.release();\n continue;\n }\n\n if (auto eventCollector = dynamic_cast<EventCollectorDescriptor^>(collector)) {\n auto traceProperties = CreateTraceProperties(eventCollector);\n auto session = etk::CreateEtwTraceSession(*loggerName, traceProperties);\n\n for each (auto provider in eventCollector->Providers) {\n auto nativeProvider = marshal_as<etk::TraceProviderDescriptor>(provider);\n session->AddProvider(nativeProvider);\n session->EnableProvider(nativeProvider.Id);\n }\n\n this->session = session.release();\n continue;\n }\n }\n}\n\nEventSession::!EventSession()\n{\n Stop();\n delete session;\n delete kernelSession;\n delete watchDog;\n delete loggerName;\n}\n\nvoid EventSession::Start()\n{\n watchDog->Start();\n\n HRESULT hr;\n if (kernelSession) {\n hr = kernelSession->Start();\n if (FAILED(hr))\n throw gcnew Win32Exception(hr);\n }\n\n if (session) {\n hr = session->Start();\n if (FAILED(hr)) {\n if (kernelSession)\n (void)kernelSession->Stop();\n throw gcnew Win32Exception(hr);\n }\n }\n\n std::vector<std::wstring_view> loggerNames;\n if (session)\n loggerNames.push_back(*loggerName);\n if (kernelSession)\n loggerNames.push_back(L\"NT Kernel Logger\");\n\n auto processor = etk::CreateEtwTraceProcessor(loggerNames);\n processor->SetEventSink(traceLog->Native());\n\n this->processor = processor.release();\n this->processor->StartProcessing();\n\n auto logFileHeader = this->processor->GetLogFileHeader();\n EventSessionInfo sessionInfo;\n sessionInfo.StartTime = logFileHeader->StartTime.QuadPart;\n sessionInfo.PerfFreq = logFileHeader->PerfFreq.QuadPart;\n sessionInfo.PointerSize = logFileHeader->PointerSize;\n traceLog->SetSessionInfo(sessionInfo);\n}\n\nTask^ EventSession::StartAsync()\n{\n return Task::Run(gcnew Action(this, &EventSession::Start));\n}\n\nvoid EventSession::Stop()\n{\n if (!processor)\n return;\n\n processor->StopProcessing();\n if (session)\n session->Stop();\n if (kernelSession)\n kernelSession->Stop();\n watchDog->Stop();\n\n delete processor;\n processor = nullptr;\n}\n\nvoid EventSession::Flush()\n{\n if (!processor)\n return;\n\n if (session)\n session->Flush();\n if (kernelSession)\n kernelSession->Flush();\n}\n\nTraceStatistics^ EventSession::Query()\n{\n if (!session)\n return gcnew TraceStatistics();\n\n etk::TraceStatistics nativeStats;\n session->Query(nativeStats);\n\n auto stats = gcnew TraceStatistics();\n stats->NumberOfBuffers = nativeStats.NumberOfBuffers;\n stats->FreeBuffers = nativeStats.FreeBuffers;\n stats->EventsLost = nativeStats.EventsLost;\n stats->BuffersWritten = nativeStats.BuffersWritten;\n stats->LogBuffersLost = nativeStats.LogBuffersLost;\n stats->RealTimeBuffersLost = nativeStats.RealTimeBuffersLost;\n stats->LoggerThreadId = nativeStats.LoggerThreadId;\n\n return stats;\n}\n\n} \n"},"prefix":{"kind":"string","value":"#include \"Descriptors.h\"\n#include \"TraceLog.h\"\n#include \"WatchDog.h\"\n#include \"InteropHelper.h\"\n\n#include \"etk/ITraceLog.h\"\n#include \"etk/ITraceProcessor.h\"\n#include \"etk/ITraceSession.h\"\n\n#include <memory>\n#include <string>\n\nusing namespace System;\nusing namespace System::Collections::Generic;\nusing namespace System::ComponentModel;\nusing namespace System::Linq;\nusing namespace System::Runtime::InteropServices;\nusing namespace System::Threading::Tasks;\nusing namespace EventTraceKit::Tracing;\nusing msclr::interop::marshal_as;\n\nnamespace msclr\n{\nnamespace interop\n{\n\nstatic bool IsPro"},"suffix":{"kind":"string","value":"on* kernelSession = nullptr;\n etk::ITraceProcessor* processor = nullptr;\n};\n\nstatic std::wstring LoggerNameBase = L\"EventTraceKit_54644792-9281-48E9-B69D-E82A86F98960\";\n\nstatic std::wstring CreateLoggerName()\n{\n int pid = System::Diagnostics::Process::GetCurrentProcess()->Id;\n return LoggerNameBase + L\"_\" + std::to_wstring(pid);\n}\n\nstatic etk::TraceProperties CreateTraceProperties(CollectorDescriptor^ profile)\n{\n etk::TraceProperties properties(marshal_as<GUID>(System::Guid::NewGuid()));\n if (profile->BufferSize.HasValue)\n properties.BufferSize = profile->BufferSize.Value;\n if (profile->MinimumBuffers.HasValue)\n properties.MinimumBuffers = profile->MinimumBuffers.Value;\n if (profile->MaximumBuffers.HasValue)\n properties.MaximumBuffers = profile->MaximumBuffers.Value;\n if (profile->LogFileName)\n properties.LogFileName = marshal_as<std::wstring>(profile->LogFileName);\n if (profile->FlushPeriod.HasValue) {\n properties.FlushPeriod = std::chrono::duration<unsigned, std::milli>(\n static_cast<unsigned>(profile->FlushPeriod.Value.TotalMilliseconds));\n }\n return properties;\n}\n\nEventSession::EventSession(TraceProfileDescriptor^ profile, TraceLog^ traceLog)\n : profile(profile)\n , traceLog(traceLog)\n , loggerName(new std::wstring(CreateLoggerName()))\n{\n if (profile->Collectors->Count == 0)\n throw gcnew System::ArgumentException(L\"profile\");\n if (!traceLog)\n throw gcnew System::ArgumentNullException(L\"traceLog\");\n\n watchDog = gcnew WatchDog(marshal_as<String^>(*loggerName));\n traceLog->UpdateTraceData(profile);\n\n for each (auto collector in profile->Collectors) {\n if (auto systemCollector = dynamic_cast<SystemCollectorDescriptor^>(collector)) {\n auto traceProperties = CreateTraceProperties(systemCollector);\n auto session = etk::CreateEtwTraceSession(L\"NT Kernel Logger\", traceProperties);\n session->SetKernelProviders(systemCollector->KernelFlags, true);\n this->kernelSession = session.release();\n continue;\n }\n\n if (auto eventCollector = dynamic_cast<EventCollectorDescriptor^>(collector)) {\n auto traceProperties = CreateTraceProperties(eventCollector);\n auto session = etk::CreateEtwTraceSession(*loggerName, traceProperties);\n\n for each (auto provider in eventCollector->Providers) {\n auto nativeProvider = marshal_as<etk::TraceProviderDescriptor>(provider);\n session->AddProvider(nativeProvider);\n session->EnableProvider(nativeProvider.Id);\n }\n\n this->session = session.release();\n continue;\n }\n }\n}\n\nEventSession::!EventSession()\n{\n Stop();\n delete session;\n delete kernelSession;\n delete watchDog;\n delete loggerName;\n}\n\nvoid EventSession::Start()\n{\n watchDog->Start();\n\n HRESULT hr;\n if (kernelSession) {\n hr = kernelSession->Start();\n if (FAILED(hr))\n throw gcnew Win32Exception(hr);\n }\n\n if (session) {\n hr = session->Start();\n if (FAILED(hr)) {\n if (kernelSession)\n (void)kernelSession->Stop();\n throw gcnew Win32Exception(hr);\n }\n }\n\n std::vector<std::wstring_view> loggerNames;\n if (session)\n loggerNames.push_back(*loggerName);\n if (kernelSession)\n loggerNames.push_back(L\"NT Kernel Logger\");\n\n auto processor = etk::CreateEtwTraceProcessor(loggerNames);\n processor->SetEventSink(traceLog->Native());\n\n this->processor = processor.release();\n this->processor->StartProcessing();\n\n auto logFileHeader = this->processor->GetLogFileHeader();\n EventSessionInfo sessionInfo;\n sessionInfo.StartTime = logFileHeader->StartTime.QuadPart;\n sessionInfo.PerfFreq = logFileHeader->PerfFreq.QuadPart;\n sessionInfo.PointerSize = logFileHeader->PointerSize;\n traceLog->SetSessionInfo(sessionInfo);\n}\n\nTask^ EventSession::StartAsync()\n{\n return Task::Run(gcnew Action(this, &EventSession::Start));\n}\n\nvoid EventSession::Stop()\n{\n if (!processor)\n return;\n\n processor->StopProcessing();\n if (session)\n session->Stop();\n if (kernelSession)\n kernelSession->Stop();\n watchDog->Stop();\n\n delete processor;\n processor = nullptr;\n}\n\nvoid EventSession::Flush()\n{\n if (!processor)\n return;\n\n if (session)\n session->Flush();\n if (kernelSession)\n kernelSession->Flush();\n}\n\nTraceStatistics^ EventSession::Query()\n{\n if (!session)\n return gcnew TraceStatistics();\n\n etk::TraceStatistics nativeStats;\n session->Query(nativeStats);\n\n auto stats = gcnew TraceStatistics();\n stats->NumberOfBuffers = nativeStats.NumberOfBuffers;\n stats->FreeBuffers = nativeStats.FreeBuffers;\n stats->EventsLost = nativeStats.EventsLost;\n stats->BuffersWritten = nativeStats.BuffersWritten;\n stats->LogBuffersLost = nativeStats.LogBuffersLost;\n stats->RealTimeBuffersLost = nativeStats.RealTimeBuffersLost;\n stats->LoggerThreadId = nativeStats.LoggerThreadId;\n\n return stats;\n}\n\n} \n"},"middle":{"kind":"string","value":"viderBinary(String^ filePath)\n{\n return\n filePath->EndsWith(L\".exe\", StringComparison::OrdinalIgnoreCase) ||\n filePath->EndsWith(L\".dll\", StringComparison::OrdinalIgnoreCase);\n}\n\ntemplate<>\ninline etk::TraceProviderDescriptor marshal_as(EventProviderDescriptor^ const& provider)\n{\n etk::TraceProviderDescriptor native(\n marshal_as<GUID>(provider->Id), provider->Level, provider->MatchAnyKeyword,\n provider->MatchAllKeyword);\n\n native.IncludeSecurityId = provider->IncludeSecurityId;\n native.IncludeTerminalSessionId = provider->IncludeTerminalSessionId;\n native.IncludeStackTrace = provider->IncludeStackTrace;\n\n if (provider->ExecutableName)\n native.ExecutableName = marshal_as<std::wstring>(provider->ExecutableName);\n if (provider->ProcessIds)\n native.ProcessIds = marshal_as_vector(provider->ProcessIds);\n\n native.EventIdsFilterIn = provider->EventIdsFilterIn;\n if (provider->EventIds)\n native.EventIds = marshal_as_vector(provider->EventIds);\n\n native.StackWalkEventIdsFilterIn = provider->StackWalkEventIdsFilterIn;\n if (provider->StackWalkEventIds)\n native.StackWalkEventIds = marshal_as_vector(provider->StackWalkEventIds);\n\n native.FilterStackWalkLevelKeyword = provider->FilterStackWalkLevelKeyword;\n native.StackWalkFilterIn = provider->StackWalkFilterIn;\n native.StackWalkLevel = provider->StackWalkLevel;\n native.StackWalkMatchAnyKeyword = provider->StackWalkMatchAnyKeyword;\n native.StackWalkMatchAllKeyword = provider->StackWalkMatchAllKeyword;\n\n if (provider->Manifest) {\n auto manifest = marshal_as<std::wstring>(provider->Manifest);\n if (IsProviderBinary(provider->Manifest))\n native.SetProviderBinary(manifest);\n else\n native.SetManifest(manifest);\n }\n\n return native;\n}\n\n} \n} \n\nnamespace EventTraceKit::Tracing\n{\n\npublic ref struct TraceStatistics\n{\n property unsigned NumberOfBuffers;\n property unsigned FreeBuffers;\n property unsigned EventsLost;\n property unsigned BuffersWritten;\n property unsigned LogBuffersLost;\n property unsigned RealTimeBuffersLost;\n property unsigned LoggerThreadId;\n};\n\npublic ref class EventSession : public System::IDisposable\n{\npublic:\n EventSession(TraceProfileDescriptor^ profile, TraceLog^ traceLog);\n ~EventSession() { this->!EventSession(); }\n !EventSession();\n\n void Start();\n Task^ StartAsync();\n void Stop();\n void Flush();\n TraceStatistics^ Query();\n\nprivate:\n ref struct StartAsyncHelper\n {\n StartAsyncHelper(EventSession^ parent)\n : parent(parent) {}\n\n void Run()\n {\n parent->Start();\n }\n\n EventSession^ parent;\n };\n\n TraceProfileDescriptor^ profile;\n TraceLog^ traceLog;\n std::wstring* loggerName = nullptr;\n WatchDog^ watchDog;\n\n etk::ITraceSession* session = nullptr;\n etk::ITraceSessi"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"namespace EventTraceKit.EventTracing.Schema\n\n{\n\n using System.Xml.Linq;\n\n using EventTraceKit.EventTracing.Schema.Base;\n\n\n\n public static class EventManifestSchema\n\n {\n\n public static readonly XNamespace Namespace =\n\n \"http://schemas.microsoft.com/win/2004/08/events\";\n\n }\n\n\n\n public static class EventSchema\n\n {\n\n public static readonly XNamespace Namespace =\n\n \"http://schemas.microsoft.com/win/2004/08/events/event\";\n\n }\n\n\n\n public static class WinEventSchema\n\n {\n\n public static readonly XNamespace Namespace =\n","file_path":"src/EventTraceKit.EventTracing/Schema/Namespaces.cs","rank":0,"score":52726.358330813},{"content":" \"http://manifests.microsoft.com/win/2004/08/windows/events\";\n\n\n\n public static readonly QName Int8 = new QName(\"Int8\", \"win\", Namespace);\n\n public static readonly QName UInt8 = new QName(\"UInt8\", \"win\", Namespace);\n\n public static readonly QName Int16 = new QName(\"Int16\", \"win\", Namespace);\n\n public static readonly QName UInt16 = new QName(\"UInt16\", \"win\", Namespace);\n\n public static readonly QName Int32 = new QName(\"Int32\", \"win\", Namespace);\n\n public static readonly QName UInt32 = new QName(\"UInt32\", \"win\", Namespace);\n\n public static readonly QName Int64 = new QName(\"Int64\", \"win\", Namespace);\n\n public static readonly QName UInt64 = new QName(\"UInt64\", \"win\", Namespace);\n\n public static readonly QName Float = new QName(\"Float\", \"win\", Namespace);\n\n public static readonly QName Double = new QName(\"Double\", \"win\", Namespace);\n\n public static readonly QName Boolean = new QName(\"Boolean\", \"win\", Namespace);\n\n public static readonly QName UnicodeString = new QName(\"UnicodeString\", \"win\", Namespace);\n\n public static readonly QName AnsiString = new QName(\"AnsiString\", \"win\", Namespace);\n\n public static readonly QName Binary = new QName(\"Binary\", \"win\", Namespace);\n\n public static readonly QName Guid = new QName(\"GUID\", \"win\", Namespace);\n\n public static readonly QName Pointer = new QName(\"Pointer\", \"win\", Namespace);\n\n public static readonly QName FileTime = new QName(\"FILETIME\", \"win\", Namespace);\n\n public static readonly QName SystemTime = new QName(\"SYSTEMTIME\", \"win\", Namespace);\n","file_path":"src/EventTraceKit.EventTracing/Schema/Namespaces.cs","rank":1,"score":52723.241055772894},{"content":" public static readonly QName SecurityId = new QName(\"SID\", \"win\", Namespace);\n\n public static readonly QName HexInt32 = new QName(\"HexInt32\", \"win\", Namespace);\n\n public static readonly QName HexInt64 = new QName(\"HexInt64\", \"win\", Namespace);\n\n public static readonly QName CountedUnicodeString = new QName(\"CountedUnicodeString\", \"win\", Namespace);\n\n public static readonly QName CountedAnsiString = new QName(\"CountedAnsiString\", \"win\", Namespace);\n\n public static readonly QName CountedBinary = new QName(\"CountedBinary\", \"win\", Namespace);\n\n }\n\n\n\n public static class EventTraceKitSchema\n\n {\n\n public static readonly XNamespace Namespace = \"urn:uuid:fb199331-10b4-437d-88b3-adb0561c2e3f\";\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing/Schema/Namespaces.cs","rank":2,"score":52722.678416230076},{"content":" // with the /str option, or rebuild your VS project.\n\n [global::System.CodeDom.Compiler.GeneratedCodeAttribute(\"System.Resources.Tools.StronglyTypedResourceBuilder\", \"16.0.0.0\")]\n\n [global::System.Diagnostics.DebuggerNonUserCodeAttribute()]\n\n [global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]\n\n internal class Strings {\n\n \n\n private static global::System.Resources.ResourceManager resourceMan;\n\n \n\n private static global::System.Globalization.CultureInfo resourceCulture;\n\n \n\n [global::System.Diagnostics.CodeAnalysis.SuppressMessageAttribute(\"Microsoft.Performance\", \"CA1811:AvoidUncalledPrivateCode\")]\n\n internal Strings() {\n\n }\n\n \n\n /// <summary>\n\n /// Returns the cached ResourceManager instance used by this class.\n\n /// </summary>\n\n [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]\n\n internal static global::System.Resources.ResourceManager ResourceManager {\n\n get {\n","file_path":"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs","rank":3,"score":52671.558719639164},{"content":" if (object.ReferenceEquals(resourceMan, null)) {\n\n global::System.Resources.ResourceManager temp = new global::System.Resources.ResourceManager(\"EventManifestCompiler.Build.Tasks.Strings\", typeof(Strings).Assembly);\n\n resourceMan = temp;\n\n }\n\n return resourceMan;\n\n }\n\n }\n\n \n\n /// <summary>\n\n /// Overrides the current thread's CurrentUICulture property for all\n\n /// resource lookups using this strongly typed resource class.\n\n /// </summary>\n\n [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]\n\n internal static global::System.Globalization.CultureInfo Culture {\n\n get {\n\n return resourceCulture;\n\n }\n\n set {\n\n resourceCulture = value;\n\n }\n","file_path":"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs","rank":4,"score":52670.51069852171},{"content":"//------------------------------------------------------------------------------\n\n// <auto-generated>\n\n// This code was generated by a tool.\n\n// Runtime Version:4.0.30319.42000\n\n//\n\n// Changes to this file may cause incorrect behavior and will be lost if\n\n// the code is regenerated.\n\n// </auto-generated>\n\n//------------------------------------------------------------------------------\n\n\n\nnamespace EventManifestCompiler.Build.Tasks {\n\n using System;\n\n \n\n \n\n /// <summary>\n\n /// A strongly-typed resource class, for looking up localized strings, etc.\n\n /// </summary>\n\n // This class was auto-generated by the StronglyTypedResourceBuilder\n\n // class via a tool like ResGen or Visual Studio.\n\n // To add or remove a member, edit your .ResX file then rerun ResGen\n","file_path":"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs","rank":5,"score":52667.7442525992},{"content":" }\n\n \n\n /// <summary>\n\n /// Looks up a localized string similar to Required file "{0}" is missing..\n\n /// </summary>\n\n internal static string Error_MissingFile {\n\n get {\n\n return ResourceManager.GetString(\"Error_MissingFile\", resourceCulture);\n\n }\n\n }\n\n \n\n /// <summary>\n\n /// Looks up a localized string similar to "{1}" task received an invalid value for the "{0}" parameter..\n\n /// </summary>\n\n internal static string General_InvalidValue {\n\n get {\n\n return ResourceManager.GetString(\"General_InvalidValue\", resourceCulture);\n\n }\n\n }\n\n \n","file_path":"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs","rank":6,"score":52664.821821041485},{"content":" /// </summary>\n\n internal static string TrackedToolTask_RebuildingDueToInvalidTLog {\n\n get {\n\n return ResourceManager.GetString(\"TrackedToolTask_RebuildingDueToInvalidTLog\", resourceCulture);\n\n }\n\n }\n\n \n\n /// <summary>\n\n /// Looks up a localized string similar to Forcing a rebuild of all source files due to the contents of "{0}" being invalid..\n\n /// </summary>\n\n internal static string TrackedToolTask_RebuildingDueToInvalidTLogContents {\n\n get {\n\n return ResourceManager.GetString(\"TrackedToolTask_RebuildingDueToInvalidTLogContents\", resourceCulture);\n\n }\n\n }\n\n \n\n /// <summary>\n\n /// Looks up a localized string similar to Forcing rebuild of all source files due to missing command TLog "{0}"..\n\n /// </summary>\n\n internal static string TrackedToolTask_RebuildingNoCommandTLog {\n","file_path":"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs","rank":7,"score":52664.50913309738},{"content":" /// <summary>\n\n /// Looks up a localized string similar to Tracking command:.\n\n /// </summary>\n\n internal static string Native_TrackingCommandMessage {\n\n get {\n\n return ResourceManager.GetString(\"Native_TrackingCommandMessage\", resourceCulture);\n\n }\n\n }\n\n \n\n /// <summary>\n\n /// Looks up a localized string similar to Forcing rebuild of all source files due to a change in the command line since the last build..\n\n /// </summary>\n\n internal static string TrackedToolTask_RebuildingAllSourcesCommandLineChanged {\n\n get {\n\n return ResourceManager.GetString(\"TrackedToolTask_RebuildingAllSourcesCommandLineChanged\", resourceCulture);\n\n }\n\n }\n\n \n\n /// <summary>\n\n /// Looks up a localized string similar to Forcing a rebuild of all sources due to an error with the tracking logs. {0}.\n","file_path":"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs","rank":8,"score":52664.20290265273},{"content":" get {\n\n return ResourceManager.GetString(\"TrackedToolTask_RebuildingNoCommandTLog\", resourceCulture);\n\n }\n\n }\n\n \n\n /// <summary>\n\n /// Looks up a localized string similar to Forcing rebuild of source file "{0}" due to a change in the command line since the last build..\n\n /// </summary>\n\n internal static string TrackedToolTask_RebuildingSourceCommandLineChanged {\n\n get {\n\n return ResourceManager.GetString(\"TrackedToolTask_RebuildingSourceCommandLineChanged\", resourceCulture);\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs","rank":9,"score":52662.936854528816},{"content":"namespace EventTraceKit.VsExtension.Native\n\n{\n\n using System;\n\n using System.Runtime.InteropServices;\n\n\n\n [StructLayout(LayoutKind.Sequential)]\n\n public struct UnmanagedString\n\n : IEquatable<UnmanagedString>\n\n , IComparable<UnmanagedString>\n\n , IComparable<string>\n\n {\n\n private readonly unsafe char* str;\n\n\n\n public unsafe UnmanagedString(char* str)\n\n {\n\n this.str = str;\n\n }\n\n\n\n public static readonly UnmanagedString Empty;\n\n\n","file_path":"src/EventTraceKit.VsExtension/Native/UnmanagedString.cs","rank":10,"score":51810.678015160636},{"content":"namespace EventTraceKit.VsExtension.Extensions\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Text.RegularExpressions;\n\n\n\n public static class StringExtensions\n\n {\n\n public static string TrimToLength(\n\n this string s, int maxLength, TrimPosition position = TrimPosition.End)\n\n {\n\n if (s == null || s.Length <= maxLength)\n\n return s;\n\n if (maxLength <= 0)\n\n return string.Empty;\n\n\n\n var length = maxLength - 1;\n\n switch (position) {\n\n case TrimPosition.End:\n\n return s.Substring(0, length) + \"…\";\n","file_path":"src/EventTraceKit.VsExtension/Extensions/StringExtensions.cs","rank":11,"score":51807.7719341781},{"content":"namespace EventTraceKit.EventTracing.Schema\n\n{\n\n using System;\n\n using System.Diagnostics;\n\n using EventTraceKit.EventTracing.Support;\n\n\n\n [DebuggerDisplay(\"{Name}({Id,h}) = '{Value}'\")]\n\n public sealed class LocalizedString : SourceItem\n\n {\n\n public const uint UnusedId = uint.MaxValue;\n\n\n\n public LocalizedString(LocatedRef<string> name, LocatedRef<string> value)\n\n : this(name, value, UnusedId)\n\n {\n\n }\n\n\n\n public LocalizedString(LocatedRef<string> name, string value, uint id)\n\n {\n\n Name = name ?? throw new ArgumentNullException(nameof(name));\n\n Value = value ?? throw new ArgumentNullException(nameof(value));\n","file_path":"src/EventTraceKit.EventTracing/Schema/LocalizedString.cs","rank":12,"score":51801.0714109881},{"content":" public unsafe bool IsEmpty\n\n {\n\n get\n\n {\n\n if (HasValue)\n\n return str[0] == '\\0';\n\n return true;\n\n }\n\n }\n\n\n\n public unsafe bool HasValue => str != null;\n\n\n\n public override unsafe string ToString()\n\n {\n\n return str != null ? new string(str) : string.Empty;\n\n }\n\n\n\n public static implicit operator string(UnmanagedString value)\n\n {\n\n return value.ToString();\n","file_path":"src/EventTraceKit.VsExtension/Native/UnmanagedString.cs","rank":13,"score":51798.564162794355},{"content":" case TrimPosition.Start:\n\n return \"…\" + s.Substring(s.Length - length, length);\n\n case TrimPosition.Middle:\n\n int suffix = length / 2;\n\n int prefix = length - suffix;\n\n return s.Substring(0, prefix) + \"…\" + s.Substring(s.Length - suffix, suffix);\n\n default:\n\n throw new ArgumentOutOfRangeException(nameof(position), position, null);\n\n }\n\n }\n\n\n\n public static string MakeNumberedCopy(this string fullString, ISet<string> usedStrings = null)\n\n {\n\n if (usedStrings == null || !usedStrings.Contains(fullString))\n\n return fullString;\n\n\n\n var match = Regex.Match(fullString, @\"\\A(?<str>.*) \\(Copy(?: (?<num>\\d+))?\\)\\z\");\n\n\n\n string str;\n\n int num;\n","file_path":"src/EventTraceKit.VsExtension/Extensions/StringExtensions.cs","rank":14,"score":51797.18286477046},{"content":" }\n\n\n\n public static unsafe explicit operator char*(UnmanagedString value)\n\n {\n\n return value.str;\n\n }\n\n\n\n public bool Equals(UnmanagedString other)\n\n {\n\n throw new NotImplementedException();\n\n }\n\n\n\n public int CompareTo(UnmanagedString other)\n\n {\n\n throw new NotImplementedException();\n\n }\n\n\n\n public int CompareTo(string other)\n\n {\n\n throw new NotImplementedException();\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.VsExtension/Native/UnmanagedString.cs","rank":15,"score":51796.998671407324},{"content":" Id = id;\n\n }\n\n\n\n public LocatedRef<string> Name { get; }\n\n public LocatedRef<string> Value { get; }\n\n public uint Id { get; set; }\n\n public LocatedRef<string> Symbol { get; set; }\n\n\n\n public bool Imported { get; set; }\n\n\n\n public override string ToString()\n\n {\n\n return Name;\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing/Schema/LocalizedString.cs","rank":16,"score":51792.80226015142},{"content":" if (match.Success) {\n\n str = match.Groups[\"str\"].Value;\n\n num = match.Groups[\"num\"].Success ? int.Parse(match.Groups[\"num\"].Value) : 1;\n\n } else {\n\n str = fullString;\n\n num = 0;\n\n }\n\n\n\n while (true) {\n\n ++num;\n\n string copiedStr = str + (num == 1 ? \" (Copy)\" : $\" (Copy {num})\");\n\n if (!usedStrings.Contains(copiedStr))\n\n return copiedStr;\n\n }\n\n }\n\n }\n\n\n\n public enum TrimPosition\n\n {\n\n End,\n\n Start,\n\n Middle\n\n }\n\n}\n","file_path":"src/EventTraceKit.VsExtension/Extensions/StringExtensions.cs","rank":17,"score":51791.40650379109},{"content":"[assembly: System.Windows.Markup.XmlnsDefinition(\n\n \"urn:schemas-eventtracekit:settings\",\n\n \"EventTraceKit.VsExtension.Settings.Persistence\")]\n","file_path":"src/EventTraceKit.VsExtension/Settings/Persistence/NamespaceMapping.cs","rank":18,"score":50992.616962507505},{"content":"namespace EventTraceKit.EventTracing.Internal.Extensions\n\n{\n\n using System;\n\n using System.Globalization;\n\n\n\n internal static class StringExtensions\n\n {\n\n public static string ToStringInvariant(this int value)\n\n {\n\n return value.ToString(CultureInfo.InvariantCulture);\n\n }\n\n\n\n /// <summary>\n\n /// Escapes the string so that it is safe to use as a formatting\n\n /// string with <see cref=\"string.Format(string,object)\"/> and zero\n\n /// args.\n\n /// </summary>\n\n /// <param name=\"str\">The string to escape.</param>\n\n /// <returns>\n\n /// The escaped string with formatting-relevant characters ({, })\n","file_path":"src/EventTraceKit.EventTracing/Internal/Extensions/StringExtensions.cs","rank":19,"score":50964.41060174091},{"content":"namespace EventTraceKit.VsExtension.Extensions\n\n{\n\n using System.Text;\n\n\n\n public static class StringBuilderExtensions\n\n {\n\n private const string HexChars = \"0123456789ABCDEF\";\n\n\n\n public static void AppendHexByte(this StringBuilder builder, byte b)\n\n {\n\n int hi = (b >> 4) & 0xF;\n\n int lo = b & 0xF;\n\n builder.Append(HexChars[hi]);\n\n builder.Append(HexChars[lo]);\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.VsExtension/Extensions/StringBuilderExtensions.cs","rank":20,"score":50961.273277669374},{"content":"#include \"etk/Support/StringConversions.h\"\n\n\n\n#include <Windows.h>\n\n#include <type_traits>\n\n\n\nnamespace etk\n\n{\n\n\n\nnamespace\n\n{\n\n\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":21,"score":50956.72100756398},{"content":"\n\n buffer.resize(convertedLength);\n\n return true;\n\n}\n\n\n\n} // namespace\n\n\n\nbool U8To16(std::string_view source, std::wstring& output)\n\n{\n\n return Convert<U8To16Conversion>(source.data(), source.length(), output);\n\n}\n\n\n\nstd::wstring U8To16(std::string_view source)\n\n{\n\n std::wstring buffer;\n\n (void)Convert<U8To16Conversion>(source.data(), source.length(), buffer);\n\n return buffer;\n\n}\n\n\n\nbool U16To8(std::wstring_view source, std::string& output)\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":22,"score":50952.2288436528},{"content":" /// escaped.\n\n /// </returns>\n\n public static string EscapeFormatting(this string str)\n\n {\n\n return str.Replace(\"{\", \"{{\").Replace(\"}\", \"}}\");\n\n }\n\n\n\n /// <summary>\n\n /// Returns the longest common prefix of both specified strings.\n\n /// </summary>\n\n /// <param name=\"a\">The first string.</param>\n\n /// <param name=\"b\">The second string.</param>\n\n /// <returns>\n\n /// The longest common prefix of both strings (which may be empty).\n\n /// Also returns empty if any input string is <see langword=\"null\"/>.\n\n /// </returns>\n\n public static string LongestCommonPrefix(string a, string b)\n\n {\n\n if (string.IsNullOrEmpty(a) || string.IsNullOrEmpty(b))\n\n return string.Empty;\n","file_path":"src/EventTraceKit.EventTracing/Internal/Extensions/StringExtensions.cs","rank":23,"score":50950.16563447492},{"content":"{\n\n return Convert<U16To8Conversion>(source.data(), source.length(), output);\n\n}\n\n\n\nstd::string U16To8(std::wstring_view source)\n\n{\n\n std::string buffer;\n\n (void)Convert<U16To8Conversion>(source.data(), source.length(), buffer);\n\n return buffer;\n\n}\n\n\n\n} // namespace etk\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":24,"score":50947.996306245535},{"content":" typename OutputStringAllocator = std::allocator<typename Converter::OutputChar>>\n\nbool Convert(typename Converter::InputChar const* source, size_t sourceLength,\n\n std::basic_string<typename Converter::OutputChar, OutputCharTraits,\n\n OutputStringAllocator>& buffer)\n\n{\n\n if (sourceLength == 0)\n\n return true;\n\n\n\n size_t outLength;\n\n if (!Converter::EstimateLength(source, sourceLength, outLength))\n\n return false;\n\n\n\n buffer.resize(outLength);\n\n\n\n size_t const convertedLength =\n\n Converter::Convert(&buffer[0], buffer.length() + 1, source, sourceLength);\n\n if (convertedLength == 0) {\n\n buffer.clear();\n\n return false;\n\n }\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":25,"score":50946.87197643195},{"content":" return true;\n\n}\n\n\n\nsize_t U8To16Conversion::Convert(wchar_t* out, size_t outSize, char const* source,\n\n size_t sourceLength) noexcept\n\n{\n\n if (outSize == 0)\n\n return 0;\n\n\n\n int const length =\n\n MultiByteToWideChar(CP_UTF8, 0, source, static_cast<int>(sourceLength), out,\n\n static_cast<int>(outSize));\n\n if (length <= 0)\n\n return 0;\n\n\n\n return static_cast<size_t>(length);\n\n}\n\n\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":26,"score":50944.18168820014},{"content":" return true;\n\n}\n\n\n\nsize_t U16To8Conversion::Convert(char* out, size_t outSize, wchar_t const* source,\n\n size_t sourceLength) noexcept\n\n{\n\n if (outSize == 0)\n\n return 0;\n\n\n\n int const length =\n\n WideCharToMultiByte(CP_UTF8, 0, source, static_cast<int>(sourceLength), out,\n\n static_cast<int>(outSize), nullptr, nullptr);\n\n if (length <= 0)\n\n return 0;\n\n\n\n return static_cast<size_t>(length);\n\n}\n\n\n\ntemplate<typename Converter,\n\n typename OutputCharTraits = std::char_traits<typename Converter::OutputChar>,\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":27,"score":50943.8146029162},{"content":"\n\n int length = Math.Min(a.Length, b.Length);\n\n int i;\n\n for (i = 0; i < length; ++i) {\n\n if (a[i] != b[i])\n\n break;\n\n }\n\n\n\n return a.Substring(0, i);\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing/Internal/Extensions/StringExtensions.cs","rank":28,"score":50938.176251761935},{"content":"namespace EventTraceKit.EventTracing.Internal\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Xml;\n\n using System.Xml.Linq;\n\n\n\n internal sealed class XElementNamespaceResolver : IXmlNamespaceResolver\n\n {\n\n private readonly XElement element;\n\n\n\n public XElementNamespaceResolver(XElement element)\n\n {\n\n this.element = element;\n\n }\n\n\n\n public IDictionary<string, string> GetNamespacesInScope(XmlNamespaceScope scope)\n\n {\n\n throw new NotSupportedException();\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Internal/XElementNamespaceResolver.cs","rank":29,"score":50194.11345940599},{"content":"namespace EventTraceKit.VsExtension.Views\n\n{\n\n using System.Collections.ObjectModel;\n\n using System.Linq;\n\n using EventTraceKit.Tracing;\n\n using EventTraceKit.VsExtension.Extensions;\n\n using EventTraceKit.VsExtension.Serialization;\n\n\n\n [SerializedShape(typeof(Settings.Persistence.SystemCollector))]\n\n public class SystemCollectorViewModel : CollectorViewModel\n\n {\n\n private string name = \"System Collector\";\n\n\n\n public SystemCollectorViewModel()\n\n {\n\n KernelFlags.Add(new KernelFlag(false, \"Process\", \"Process create/delete\", 0x00000001));\n\n KernelFlags.Add(new KernelFlag(false, \"Image Load\", \"Kernel and user mode Image Load/Unload events\", 0x00000004));\n\n }\n\n\n\n public override ITraceSettingsContext Context { get; set; }\n","file_path":"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs","rank":30,"score":50191.3271020458},{"content":"\n\n public string Name\n\n {\n\n get => name;\n\n set => SetProperty(ref name, value);\n\n }\n\n\n\n public class KernelFlag : ObservableModel\n\n {\n\n private bool isEnabled;\n\n\n\n public KernelFlag(bool isEnabled, string name, string description, uint flagValue)\n\n {\n\n this.isEnabled = isEnabled;\n\n this.name = name;\n\n this.description = description;\n\n FlagValue = flagValue;\n\n }\n\n\n\n public bool IsEnabled\n","file_path":"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs","rank":31,"score":50185.54554381572},{"content":"\n\n public string LookupNamespace(string prefix)\n\n {\n\n return element.GetNamespaceOfPrefix(prefix)?.NamespaceName;\n\n }\n\n\n\n public string LookupPrefix(string namespaceName)\n\n {\n\n return element.GetPrefixOfNamespace(namespaceName);\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing/Internal/XElementNamespaceResolver.cs","rank":32,"score":50184.034355326374},{"content":" {\n\n get => isEnabled;\n\n set => SetProperty(ref isEnabled, value);\n\n }\n\n\n\n private string name;\n\n\n\n public string Name\n\n {\n\n get => name;\n\n set => SetProperty(ref name, value);\n\n }\n\n\n\n private string description;\n\n\n\n public string Description\n\n {\n\n get => description;\n\n set => SetProperty(ref description, value);\n\n }\n","file_path":"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs","rank":33,"score":50179.98622008191},{"content":"\n\n public uint FlagValue { get; }\n\n }\n\n\n\n public ObservableCollection<KernelFlag> KernelFlags { get; } =\n\n new ObservableCollection<KernelFlag>();\n\n\n\n public override CollectorViewModel DeepClone()\n\n {\n\n var clone = new SystemCollectorViewModel();\n\n clone.KernelFlags.AddRange(KernelFlags.Select(x => new KernelFlag(x.IsEnabled, x.Name, x.Description, x.FlagValue)));\n\n return clone;\n\n }\n\n\n\n public override CollectorDescriptor CreateDescriptor()\n\n {\n\n var descriptor = new SystemCollectorDescriptor();\n\n descriptor.KernelFlags = KernelFlags.Where(x => x.IsEnabled).Aggregate(0u, (a, x) => a | x.FlagValue);\n\n return descriptor;\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs","rank":34,"score":50178.35904719005},{"content":"namespace EventTraceKit.VsExtension.Tests.Extensions\n\n{\n\n using System.Collections.Generic;\n\n using EventTraceKit.VsExtension.Extensions;\n\n using Xunit;\n\n\n\n public class StringExtensionsTest\n\n {\n\n [Theory]\n\n [InlineData(null, 0, TrimPosition.End, null)]\n\n [InlineData(\"1234567890\", 0, TrimPosition.End, \"\")]\n\n [InlineData(\"1234567890\", 0, TrimPosition.Start, \"\")]\n\n [InlineData(\"1234567890\", 0, TrimPosition.Middle, \"\")]\n\n [InlineData(\"1234567890\", 1, TrimPosition.End, \"…\")]\n\n [InlineData(\"1234567890\", 1, TrimPosition.Start, \"…\")]\n\n [InlineData(\"1234567890\", 1, TrimPosition.Middle, \"…\")]\n\n [InlineData(\"1234567890\", 2, TrimPosition.End, \"1…\")]\n\n [InlineData(\"1234567890\", 2, TrimPosition.Start, \"…0\")]\n\n [InlineData(\"1234567890\", 2, TrimPosition.Middle, \"1…\")]\n\n [InlineData(\"1234567890\", 5, TrimPosition.End, \"1234…\")]\n","file_path":"src/EventTraceKit.VsExtension.Tests/Extensions/StringExtensionsTest.cs","rank":35,"score":50135.97483106294},{"content":" [InlineData(\"foo bar\", \"foo bar (Copy)\", new[] { \"foo bar\" })]\n\n [InlineData(\"foo bar\", \"foo bar (Copy 2)\", new[] { \"foo bar\", \"foo bar (Copy)\" })]\n\n [InlineData(\"foo bar\", \"foo bar (Copy 3)\", new[] { \"foo bar\", \"foo bar (Copy)\", \"foo bar (Copy 2)\" })]\n\n [InlineData(\"foo bar\", \"foo bar (Copy)\", new[] { \"foo bar\", \"foo bar (Copy 2)\" })]\n\n [InlineData(\"foo bar\", \"foo bar (Copy 2)\", new[] { \"foo bar\", \"foo bar (Copy)\", \"foo bar (Copy 3)\" })]\n\n [InlineData(\"foo (Copy)\", \"foo (Copy)\", new[] { \"foo\" })]\n\n [InlineData(\"foo (Copy)\", \"foo (Copy 2)\", new[] { \"foo (Copy)\" })]\n\n [InlineData(\"foo (Copy 2)\", \"foo (Copy 3)\", new[] { \"foo (Copy 2)\" })]\n\n public void MakeNumberedCopy(string input, string expected, string[] used)\n\n {\n\n Assert.Equal(expected, input.MakeNumberedCopy(used != null ? new HashSet<string>(used) : null));\n\n Assert.Equal(expected, StringExtensions.MakeNumberedCopy(input, used != null ? new HashSet<string>(used) : null));\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.VsExtension.Tests/Extensions/StringExtensionsTest.cs","rank":36,"score":50132.51345550208},{"content":" [InlineData(\"1234567890\", 5, TrimPosition.Start, \"…7890\")]\n\n [InlineData(\"1234567890\", 5, TrimPosition.Middle, \"12…90\")]\n\n [InlineData(\"1234567890\", 6, TrimPosition.End, \"12345…\")]\n\n [InlineData(\"1234567890\", 6, TrimPosition.Start, \"…67890\")]\n\n [InlineData(\"1234567890\", 6, TrimPosition.Middle, \"123…90\")]\n\n [InlineData(\"1234567890\", 10, TrimPosition.End, \"1234567890\")]\n\n [InlineData(\"1234567890\", 10, TrimPosition.Start, \"1234567890\")]\n\n [InlineData(\"1234567890\", 10, TrimPosition.Middle, \"1234567890\")]\n\n public void TrimToLength(string input, int maxLength, TrimPosition position, string expected)\n\n {\n\n Assert.Equal(expected, input.TrimToLength(maxLength, position));\n\n Assert.Equal(expected, StringExtensions.TrimToLength(input, maxLength, position));\n\n }\n\n\n\n [Theory]\n\n [InlineData(null, null, null)]\n\n [InlineData(\"foo\", \"foo\", null)]\n\n [InlineData(\"foo\", \"foo\", new string[0])]\n\n [InlineData(\"foo\", \"foo\", new[] { \"bar\" })]\n\n [InlineData(\"foo\", \"foo (Copy)\", new[] { \"foo\" })]\n","file_path":"src/EventTraceKit.VsExtension.Tests/Extensions/StringExtensionsTest.cs","rank":37,"score":50126.93105395291},{"content":"namespace EventTraceKit.EventTracing.Compilation.Support\n\n{\n\n using System;\n\n using System.IO;\n\n using System.IO.MemoryMappedFiles;\n\n using System.Runtime.InteropServices;\n\n using System.Text;\n\n\n\n internal sealed class MemoryMappedViewWriter : IDisposable\n\n {\n\n private readonly FileStream output;\n\n\n\n private MemoryMappedFile mappedFile;\n\n private MemoryMappedViewAccessor accessor;\n\n private byte[] stringBuffer = new byte[0x100];\n\n private long position;\n\n\n\n public MemoryMappedViewWriter(FileStream output, long initialCapacity = 0x10000)\n\n {\n\n this.output = output ?? throw new ArgumentNullException(nameof(output));\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":38,"score":49395.749396682455},{"content":" return count;\n\n }\n\n\n\n public void WriteString(ref long offset, string str)\n\n {\n\n int count = EncodeName(str, ref stringBuffer);\n\n WriteArray(ref offset, stringBuffer, 0, count);\n\n }\n\n\n\n public void WriteZString(ref long offset, string str)\n\n {\n\n // Includes NUL wchar_t.\n\n int count = Encoding.Unicode.GetByteCount(str) + 2;\n\n if (stringBuffer.Length < count)\n\n stringBuffer = new byte[count];\n\n\n\n int byteCount = Encoding.Unicode.GetBytes(str, 0, str.Length, stringBuffer, 0);\n\n for (int i = byteCount; i < count; ++i)\n\n stringBuffer[i] = 0;\n\n WriteArray(ref offset, stringBuffer, 0, count);\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":39,"score":49377.65054421089},{"content":" WriteResource(ref position, ref resource);\n\n }\n\n\n\n private int GetByteCount(string name)\n\n {\n\n // Count includes NUL and 4-byte length.\n\n int count = Encoding.Unicode.GetByteCount(name) + 2 + 4;\n\n return (count + 3) & ~3;\n\n }\n\n\n\n private int EncodeName(string name, ref byte[] buf)\n\n {\n\n int count = GetByteCount(name);\n\n if (buf.Length < count)\n\n buf = new byte[count];\n\n byte[] countBytes = BitConverter.GetBytes((uint)count);\n\n Buffer.BlockCopy(countBytes, 0, buf, 0, 4);\n\n int byteCount = Encoding.Unicode.GetBytes(name, 0, name.Length, buf, 4);\n\n for (int i = 4 + byteCount; i < count; ++i)\n\n buf[i] = 0;\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":40,"score":49375.2362230816},{"content":"\n\n private void Allocate(long newCapacity)\n\n {\n\n if (accessor != null) {\n\n accessor.Dispose();\n\n mappedFile.Dispose();\n\n }\n\n\n\n mappedFile = MemoryMappedFile.CreateFromFile(\n\n output,\n\n null,\n\n newCapacity,\n\n MemoryMappedFileAccess.ReadWrite,\n\n null,\n\n HandleInheritability.None,\n\n true);\n\n\n\n accessor = mappedFile.CreateViewAccessor();\n\n Capacity = newCapacity;\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":41,"score":49373.13984800272},{"content":"\n\n private void EnsureSpace(long offset, int byteCount)\n\n {\n\n long requiredCapacity = offset + byteCount;\n\n if (requiredCapacity > Capacity)\n\n GrowTo(requiredCapacity);\n\n }\n\n\n\n private void EnsureSpace(int byteCount)\n\n {\n\n long requiredCapacity = position + byteCount;\n\n if (requiredCapacity > Capacity)\n\n GrowTo(requiredCapacity);\n\n }\n\n\n\n private void GrowTo(long requiredCapacity)\n\n {\n\n long newCapacity = Capacity;\n\n while (newCapacity < requiredCapacity)\n\n newCapacity *= 2;\n\n Allocate(newCapacity);\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":42,"score":49367.68790352438},{"content":"\n\n Allocate(initialCapacity);\n\n }\n\n\n\n public long Capacity { get; private set; }\n\n\n\n public long Position\n\n {\n\n get => position;\n\n set\n\n {\n\n position = value;\n\n if (position > Capacity)\n\n GrowTo(position);\n\n }\n\n }\n\n\n\n public void Dispose()\n\n {\n\n accessor.Dispose();\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":43,"score":49367.68790352438},{"content":"\n\n public void WriteUInt8(byte value)\n\n {\n\n WriteUInt8(ref position, value);\n\n }\n\n\n\n public void WriteUInt16(ushort value)\n\n {\n\n WriteUInt16(ref position, value);\n\n }\n\n\n\n public void WriteUInt32(uint value)\n\n {\n\n WriteUInt32(ref position, value);\n\n }\n\n\n\n public void Align(ref long offset, int alignment)\n\n {\n\n var mod = (int)(offset % alignment);\n\n if (mod == 0)\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":44,"score":49367.68790352438},{"content":" }\n\n\n\n public void WriteArray<T>(T[] values) where T : struct\n\n {\n\n WriteArray(ref position, values);\n\n }\n\n\n\n public void WriteArray<T>(ref long offset, T[] values) where T : struct\n\n {\n\n WriteArray(ref offset, values, 0, values.Length);\n\n }\n\n\n\n public void WriteArray<T>(ref long offset, T[] values, int index, int count) where T : struct\n\n {\n\n int byteCount = count * Marshal.SizeOf<T>();\n\n EnsureSpace(offset, byteCount);\n\n accessor.WriteArray(offset, values, index, count);\n\n offset += byteCount;\n\n }\n\n\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":45,"score":49367.68790352438},{"content":" mappedFile.Dispose();\n\n output.SetLength(Position);\n\n }\n\n\n\n public void Flush()\n\n {\n\n accessor.Flush();\n\n output.Flush();\n\n }\n\n\n\n public void WriteResource<T>(ref long offset, ref T resource) where T : struct\n\n {\n\n var size = Marshal.SizeOf<T>();\n\n EnsureSpace(offset, size);\n\n accessor.Write(offset, ref resource);\n\n offset += size;\n\n }\n\n\n\n public void WriteResource<T>(ref T resource) where T : struct\n\n {\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":46,"score":49367.68790352438},{"content":" return;\n\n int fill = alignment - mod;\n\n for (int i = 0; i < fill; ++i)\n\n WriteUInt8(ref offset, 0);\n\n }\n\n\n\n public void Align(int alignment)\n\n {\n\n Align(ref position, alignment);\n\n }\n\n\n\n public void AlignBlock(long start, ref long offset, int alignment)\n\n {\n\n var mod = (int)((offset - start) % alignment);\n\n if (mod == 0)\n\n return;\n\n int fill = alignment - mod;\n\n for (int i = 0; i < fill; ++i)\n\n WriteUInt8(ref offset, 0);\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":47,"score":49367.68790352438},{"content":" public void WriteUInt8(ref long offset, byte value)\n\n {\n\n EnsureSpace(1);\n\n accessor.Write(offset, value);\n\n offset += 1;\n\n }\n\n\n\n public void WriteUInt16(ref long offset, ushort value)\n\n {\n\n EnsureSpace(2);\n\n accessor.Write(offset, value);\n\n offset += 2;\n\n }\n\n\n\n public void WriteUInt32(ref long offset, uint value)\n\n {\n\n EnsureSpace(offset, 4);\n\n accessor.Write(offset, value);\n\n offset += 4;\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs","rank":48,"score":49367.68790352438},{"content":"namespace EventTraceKit.VsExtension.Tests.Extensions\n\n{\n\n using System.Text;\n\n using VsExtension.Extensions;\n\n using Xunit;\n\n\n\n public class StringBuilderExtensionsTest\n\n {\n\n [Theory]\n\n [InlineData(0x00, \"00\")]\n\n [InlineData(0x9A, \"9A\")]\n\n [InlineData(0xAB, \"AB\")]\n\n [InlineData(0xFF, \"FF\")]\n\n public void Name(byte input, string expected)\n\n {\n\n var builder = new StringBuilder();\n\n builder.AppendHexByte(input);\n\n Assert.Equal(expected, builder.ToString());\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.VsExtension.Tests/Extensions/StringBuilderExtensionsTest.cs","rank":49,"score":49349.94733895365},{"content":"namespace EventTraceKit.EventTracing.Tests.Internal.Extensions\n\n{\n\n using EventTraceKit.EventTracing.Internal.Extensions;\n\n using Xunit;\n\n\n\n public class StringExtensionsTest\n\n {\n\n [Theory]\n\n [InlineData(\"\", \"\")]\n\n [InlineData(\"abc\", \"abc\")]\n\n [InlineData(\"{\", \"{{\")]\n\n [InlineData(\"abc {0}\", \"abc {{0}}\")]\n\n [InlineData(\"abc {{0}}\", \"abc {{{{0}}}}\")]\n\n [InlineData(\"abc {{{0}}}\", \"abc {{{{{{0}}}}}}\")]\n\n public static void EscapeFormatting(string input, string expected)\n\n {\n\n Assert.Equal(expected, input.EscapeFormatting());\n\n Assert.Equal(input, string.Format(input.EscapeFormatting(), new object[0]));\n\n }\n\n\n","file_path":"src/EventTraceKit.EventTracing.Tests/Internal/Extensions/StringExtensionsTest.cs","rank":50,"score":49348.27097229085},{"content":" [Theory]\n\n [InlineData(null, null, \"\")]\n\n [InlineData(\"abc\", null, \"\")]\n\n [InlineData(null, \"abc\", \"\")]\n\n [InlineData(\"\", \"\", \"\")]\n\n [InlineData(\"abc\", \"\", \"\")]\n\n [InlineData(\"\", \"abc\", \"\")]\n\n [InlineData(\"abc\", \"abc\", \"abc\")]\n\n [InlineData(\"abcX\", \"abc\", \"abc\")]\n\n [InlineData(\"abc\", \"abcX\", \"abc\")]\n\n [InlineData(\"abcX\", \"abcY\", \"abc\")]\n\n public static void LongestCommonPrefix(string input1, string input2, string expected)\n\n {\n\n Assert.Equal(expected, StringExtensions.LongestCommonPrefix(input1, input2));\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing.Tests/Internal/Extensions/StringExtensionsTest.cs","rank":51,"score":49340.15827006624},{"content":"struct U8To16Conversion\n\n{\n\n using InputChar = char;\n\n using OutputChar =\n\n std::conditional_t<sizeof(wchar_t) == sizeof(char16_t), wchar_t, char16_t>;\n\n static bool EstimateLength(InputChar const* source, size_t sourceLength,\n\n size_t& outLength) noexcept;\n\n static size_t Convert(OutputChar* out, size_t outLength, InputChar const* source,\n\n size_t sourceLength) noexcept;\n\n};\n\n\n\nbool U8To16Conversion::EstimateLength(char const* source, size_t sourceLength,\n\n size_t& outLength) noexcept\n\n{\n\n int const length = MultiByteToWideChar(CP_UTF8, 0, source,\n\n static_cast<int>(sourceLength), nullptr, 0);\n\n if (length <= 0)\n\n return false;\n\n\n\n outLength = static_cast<size_t>(length);\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":52,"score":48564.928719895426},{"content":"struct U16To8Conversion\n\n{\n\n using InputChar =\n\n std::conditional_t<sizeof(wchar_t) == sizeof(char16_t), wchar_t, char16_t>;\n\n using OutputChar = char;\n\n static bool EstimateLength(InputChar const* source, size_t sourceLength,\n\n size_t& outLength) noexcept;\n\n static size_t Convert(OutputChar* out, size_t outLength, InputChar const* source,\n\n size_t sourceLength) noexcept;\n\n};\n\n\n\nbool U16To8Conversion::EstimateLength(wchar_t const* source, size_t sourceLength,\n\n size_t& outLength) noexcept\n\n{\n\n int const length = WideCharToMultiByte(\n\n CP_UTF8, 0, source, static_cast<int>(sourceLength), nullptr, 0, nullptr, nullptr);\n\n if (length <= 0)\n\n return false;\n\n\n\n outLength = static_cast<size_t>(length);\n","file_path":"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp","rank":53,"score":48564.928719895426},{"content":"class string_back_insert_iterator\n\n{\n\npublic:\n\n using iterator_category = std::output_iterator_tag;\n\n using value_type = void;\n\n using difference_type = void;\n\n using pointer = void;\n\n using reference = void;\n\n\n\n using container_type = Container;\n\n\n\n explicit string_back_insert_iterator(Container& container)\n\n : container(std::addressof(container))\n\n {}\n\n\n\n template<typename T>\n\n string_back_insert_iterator& operator=(T const& value)\n\n {\n\n container->push_back(static_cast<typename Container::value_type>(value));\n\n return *this;\n","file_path":"src/EventTraceKit.EtwCore/Source/EtwTraceProcessor.cpp","rank":54,"score":47822.2375107212},{"content":"namespace etk\n\n{\n\n\n\ninline bool vsprintf(std::wstring& sink, size_t expectedLength, wchar_t const* format,\n\n va_list args)\n\n{\n\n size_t currSize = sink.size();\n\n\n\n bool measured = false;\n\nretry:\n\n if (expectedLength == 0) {\n\n va_list a;\n\n va_copy(a, args);\n\n int ret = _scwprintf(format, a);\n\n va_end(a);\n\n if (ret < 0)\n\n return false;\n\n if (ret == 0)\n\n return true;\n\n measured = true;\n\n expectedLength = static_cast<size_t>(ret);\n\n }\n\n\n\n if (expectedLength > 0)\n\n sink.resize(currSize + expectedLength);\n\n\n\n int ret = vswprintf(&sink[currSize], expectedLength + 1, format, args);\n\n if (ret < 0) {\n\n if (measured)\n\n return false;\n\n expectedLength = 0;\n\n goto retry;\n\n }\n\n\n\n size_t written = static_cast<unsigned>(ret);\n\n sink.resize(currSize + written);\n\n\n\n return written <= expectedLength;\n\n}\n\n\n\ninline bool vsprintf(std::wstring& sink, wchar_t const* format, va_list args)\n\n{\n\n return vsprintf(sink, 0, format, args);\n\n}\n\n\n\ninline bool sprintf(std::wstring& sink, wchar_t const* format, ...)\n\n{\n\n va_list args;\n\n va_start(args, format);\n\n bool ret = vsprintf(sink, 0, format, args);\n\n va_end(args);\n\n return ret;\n\n}\n\n\n\ninline bool sprintf(std::wstring& sink, size_t expectedLength, wchar_t const* format, ...)\n\n{\n\n va_list args;\n\n va_start(args, format);\n\n bool ret = vsprintf(sink, expectedLength, format, args);\n\n va_end(args);\n\n return ret;\n\n}\n\n\n","file_path":"src/EventTraceKit.EtwCore/Public/etk/Support/StringFormat.h","rank":55,"score":46402.97938446688},{"content":"namespace etk\n\n{\n\n\n\nbool U8To16(std::string_view source, std::wstring& output);\n\nstd::wstring U8To16(std::string_view source);\n\n\n\nbool U16To8(std::wstring_view source, std::string& output);\n\nstd::string U16To8(std::wstring_view source);\n\n\n","file_path":"src/EventTraceKit.EtwCore/Public/etk/Support/StringConversions.h","rank":56,"score":46402.97938446688},{"content":"struct EmcGenStaticProviderList\n\n{\n\n struct Entry\n\n {\n\n using FunctionType = ULONG();\n\n FunctionType* Register;\n\n FunctionType* Unregister;\n\n };\n\n\n\n /// <summary>\n\n /// Registers all enlisted static providers with ETW.\n\n /// </summary>\n\n static inline ULONG RegisterAll()\n\n {\n\n ULONG result = 0;\n\n for (auto it = &first + 1; it < &last; ++it) {\n\n if (*it) {\n\n ULONG const ec = (*it)->Register();\n\n if (ec != 0 && result == 0)\n\n result = ec;\n","file_path":"src/EventTraceKit.EventTracing/Compilation/CodeGen/CxxCodeGenerator.cs","rank":57,"score":45776.487244793156},{"content":"#define MSG_UnexpectedSWFallback_OutOfVideoMemory 0xD000000EL\n","file_path":"src/EventTraceKit.EventTracing.Tests/Compilation/ResGen/TestCases/wpf-etw.h","rank":58,"score":41509.7684727525},{"content":"#define MSG_UnexpectedSWFallback_OutOfVideoMemory 0xD000000EL\n","file_path":"src/EventTraceKit.EventTracing.Tests/Compilation/ResGen/TestCases/wpf-etw.wevt.v3-8.1-compat.h","rank":59,"score":39921.191414375666},{"content":"#include <sdkddkver.h>\n\n#undef _WIN32_WINNT\n\n#define _WIN32_WINNT _WIN32_WINNT_WINBLUE\n\n\n\n#include \"etk/ADT/VarStructPtr.h\"\n\n#include \"etk/Support/CompilerSupport.h\"\n\n#include \"InteropHelper.h\"\n\n\n\n#include <memory>\n\n#include <windows.h>\n\n#include <tdh.h>\n\n\n\nusing namespace System;\n\nusing namespace System::Collections::Generic;\n\nusing namespace System::ComponentModel;\n\nusing namespace System::Runtime::InteropServices;\n\nusing namespace System::Threading;\n\nusing msclr::interop::marshal_as;\n\n\n\nnamespace\n","file_path":"src/EventTraceKit.Etw/ManifestInfo.cpp","rank":61,"score":39.49312747538503},{"content":"#include \"TraceLog.h\"\n\n#include <msclr/marshal_cppstd.h>\n\n\n\nusing namespace System;\n\nusing namespace System::ComponentModel;\n\nusing namespace System::Runtime::InteropServices;\n\nusing msclr::interop::marshal_as;\n\n\n\nnamespace EventTraceKit::Tracing\n\n{\n\n\n\nnamespace\n\n{\n\n\n\netk::TraceLogFilterEvent* GetNativeFunctionPtr(TraceLogFilterPredicate^ filter)\n\n{\n\n if (!filter) return nullptr;\n\n return static_cast<etk::TraceLogFilterEvent*>(\n\n Marshal::GetFunctionPointerForDelegate(filter).ToPointer());\n\n}\n\n\n","file_path":"src/EventTraceKit.Etw/TraceLog.cpp","rank":62,"score":36.3403069879213},{"content":"namespace EventTraceKit.VsExtension.Tests\n\n{\n\n using System.Collections.Generic;\n\n using System.IO;\n\n using System.Linq;\n\n using System.Xml.Linq;\n\n\n\n public static class TestExtensions\n\n {\n\n public static IEnumerable<XAttribute> NonXmlnsAttributes(this XElement element)\n\n {\n\n return element.Attributes().Where(x => !IsXmlns(x.Name));\n\n }\n\n\n\n public static bool IsXmlns(this XName name)\n\n {\n\n return name.LocalName == \"xmlns\" || name.Namespace == XNamespace.Xmlns;\n\n }\n\n\n\n public static string ReadFullyAsString(this MemoryStream stream)\n","file_path":"src/EventTraceKit.VsExtension.Tests/TestExtensions.cs","rank":63,"score":35.417189459732825},{"content":"#include \"WatchDog.h\"\n\n\n\nusing namespace System;\n\nusing namespace System::Diagnostics;\n\nusing namespace System::IO;\n\nusing namespace System::Reflection;\n\nusing namespace System::Text;\n\nusing namespace System::Threading;\n\nusing namespace Microsoft::Win32::SafeHandles;\n\n\n\nnamespace EventTraceKit\n\n{\n\n\n\nstatic String^ GetAssemblyFilePath(Assembly^ assembly)\n\n{\n\n String^ path = (gcnew Uri(assembly->CodeBase))->AbsolutePath;\n\n path = Uri::UnescapeDataString(path);\n\n return Path::GetFullPath(path);\n\n}\n\n\n","file_path":"src/EventTraceKit.Etw/WatchDog.cpp","rank":64,"score":32.29979067276252},{"content":"namespace EventTraceKit.VsExtension.Windows\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Linq;\n\n using System.Reflection;\n\n using System.Runtime.InteropServices;\n\n using System.Windows;\n\n using System.Windows.Controls.Primitives;\n\n using System.Windows.Data;\n\n using System.Windows.Interop;\n\n using System.Windows.Media;\n\n\n\n public static class FrameworkExtensions\n\n {\n\n private static readonly Func<DependencyObject, DependencyObject, bool> MenuBase_IsDescendant;\n\n\n\n static FrameworkExtensions()\n\n {\n\n MenuBase_IsDescendant = (Func<DependencyObject, DependencyObject, bool>)\n","file_path":"src/EventTraceKit.VsExtension/Windows/FrameworkExtensions.cs","rank":65,"score":31.986385075150743},{"content":"namespace EventTraceKit.VsExtension.Native\n\n{\n\n using System;\n\n using System.Diagnostics;\n\n using System.Runtime.InteropServices;\n\n using System.Text;\n\n using Microsoft.VisualStudio.Shell.Interop;\n\n using FILETIME = System.Runtime.InteropServices.ComTypes.FILETIME;\n\n\n\n internal static class NativeMethods\n\n {\n\n public const int ERROR_NOT_SAME_DEVICE = 17;\n\n\n\n [DllImport(\"user32.dll\")]\n\n public static extern IntPtr GetCapture();\n\n\n\n [DllImport(\"user32.dll\")]\n\n [return: MarshalAs(UnmanagedType.Bool)]\n\n public static extern bool GetWindowRect(IntPtr hwnd, out RECT lpRect);\n\n\n","file_path":"src/EventTraceKit.VsExtension/Native/NativeMethods.cs","rank":66,"score":31.22312218599959},{"content":"namespace EventTraceKit.VsExtension.Serialization\n\n{\n\n using System.Collections.Generic;\n\n using System.IO;\n\n\n\n public static class XamlSerializerExtensions\n\n {\n\n public static MemoryStream SaveToStream(\n\n this IXamlSerializer serializer, object element)\n\n {\n\n var stream = new MemoryStream();\n\n serializer.Save(element, stream);\n\n stream.Position = 0;\n\n return stream;\n\n }\n\n\n\n public static string SaveToString(\n\n this IXamlSerializer serializer, object element)\n\n {\n\n using var stream = serializer.SaveToStream(element);\n","file_path":"src/EventTraceKit.VsExtension/Serialization/XamlSerializerExtensions.cs","rank":67,"score":30.449246813457748},{"content":"namespace EventTraceKit.EventTracing.Internal.Extensions\n\n{\n\n using System;\n\n using System.IO;\n\n using System.Runtime.InteropServices;\n\n using System.Text;\n\n\n\n internal static class BinaryReaderExtensions\n\n {\n\n public static string ReadPaddedString(this BinaryReader reader, uint byteCount)\n\n {\n\n return reader.ReadPaddedString(Encoding.ASCII, byteCount);\n\n }\n\n\n\n public static string ReadPaddedString(this BinaryReader reader, Encoding encoding, uint byteCount)\n\n {\n\n var bytes = new byte[byteCount];\n\n reader.Read(bytes, 0, bytes.Length);\n\n return encoding.GetString(bytes).TrimEnd('\\0');\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Internal/Extensions/BinaryReaderExtensions.cs","rank":68,"score":29.561530428580355},{"content":"namespace EventTraceKit.EventTracing.Internal.Native\n\n{\n\n using System;\n\n using System.Runtime.ConstrainedExecution;\n\n using System.Runtime.InteropServices;\n\n\n\n public static class NativeMethods\n\n {\n\n public const int MESSAGE_RESOURCE_UNICODE = 1;\n\n\n\n [DllImport(\"kernel32.dll\")]\n\n [ReliabilityContract(Consistency.WillNotCorruptState, Cer.Success)]\n\n public static extern IntPtr LocalFree(IntPtr hMem);\n\n\n\n [DllImport(\"advapi32.dll\", CharSet = CharSet.Unicode, SetLastError = true)]\n\n private static extern bool ConvertStringSecurityDescriptorToSecurityDescriptor(\n\n string StringSecurityDescriptor,\n\n uint StringSDRevision,\n\n out SafeLocalMemHandle pSecurityDescriptor,\n\n out uint SecurityDescriptorSize);\n","file_path":"src/EventTraceKit.EventTracing/Internal/Native/NativeMethods.cs","rank":69,"score":29.466591133085288},{"content":"namespace EventTraceKit.EventTracing.Internal.Native\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Runtime.ConstrainedExecution;\n\n using System.Runtime.InteropServices;\n\n using System.Security;\n\n\n\n [SecurityCritical]\n\n [SuppressUnmanagedCodeSecurity]\n\n internal static class UnsafeNativeMethods\n\n {\n\n public const short RT_RCDATA = 10;\n\n public const short RT_MESSAGETABLE = 11;\n\n public const short RT_HTML = 23;\n\n\n\n public static bool IS_INTRESOURCE(IntPtr ptr)\n\n {\n\n return (ptr.ToInt64() >> 16) == 0;\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Internal/Native/UnsafeNativeMethods.cs","rank":70,"score":28.870623469308427},{"content":"namespace EventManifestCompiler.Build.Tasks.Tests\n\n{\n\n using System.Collections.Generic;\n\n using System.Text;\n\n\n\n public static class CommandLineUtils\n\n {\n\n public static IEnumerable<string> EnumerateCommandLineArgs(string commandLine)\n\n {\n\n if (string.IsNullOrEmpty(commandLine))\n\n yield break;\n\n\n\n int backslashCount = 0;\n\n bool inQuotes = false;\n\n\n\n var buffer = new StringBuilder();\n\n for (int i = 0; i < commandLine.Length; ++i) {\n\n char c = commandLine[i];\n\n switch (c) {\n\n case '\"':\n","file_path":"src/EventManifestCompiler.Build.Tasks.Tests/CommandLineUtils.cs","rank":71,"score":28.38219170712814},{"content":"namespace EventTraceKit.VsExtension\n\n{\n\n using System;\n\n using System.Diagnostics;\n\n using Microsoft.VisualStudio.Shell;\n\n using Microsoft.VisualStudio.Shell.Interop;\n\n\n\n public static class MessageHelper\n\n {\n\n public static void ShowWarningMessage(string message, string title)\n\n {\n\n VsShellUtilities.ShowMessageBox(\n\n ServiceProvider.GlobalProvider,\n\n message,\n\n title,\n\n OLEMSGICON.OLEMSGICON_WARNING,\n\n OLEMSGBUTTON.OLEMSGBUTTON_OK,\n\n OLEMSGDEFBUTTON.OLEMSGDEFBUTTON_FIRST);\n\n }\n\n\n","file_path":"src/EventTraceKit.VsExtension/MessageHelper.cs","rank":72,"score":28.352078940179602},{"content":"namespace EventTraceKit.EventTracing.Internal.Native\n\n{\n\n using System;\n\n using System.Globalization;\n\n using System.Runtime.InteropServices;\n\n\n\n internal sealed class ResourceName\n\n {\n\n public ResourceName(short id)\n\n {\n\n Id = id;\n\n }\n\n\n\n public ResourceName(string name)\n\n {\n\n Name = name;\n\n }\n\n\n\n public static ResourceName FromPtr(IntPtr ptr)\n\n {\n","file_path":"src/EventTraceKit.EventTracing/Internal/Native/ResourceName.cs","rank":73,"score":28.28805060000025},{"content":"namespace EventTraceKit.EventTracing.Internal\n\n{\n\n using System.Collections.Generic;\n\n using System.IO;\n\n using System.Linq;\n\n\n\n internal static class WindowsSdkUtils\n\n {\n\n public static string FindSdkPath()\n\n {\n\n return EnumerateSdkIncludePaths().FirstOrDefault(Directory.Exists);\n\n }\n\n\n\n public static IEnumerable<string> EnumerateSdkIncludePaths()\n\n {\n\n var winKits10 = new DirectoryInfo(@\"C:\\Program Files (x86)\\Windows Kits\\10\\Include\");\n\n foreach (var dir in winKits10.EnumerateDirectories().Reverse()) {\n\n var path = Path.Combine(dir.FullName, \"um\");\n\n if (Directory.Exists(path))\n\n yield return path;\n\n }\n\n\n\n yield return @\"C:\\Program Files (x86)\\Windows Kits\\8.1\\Include\\um\";\n\n yield return @\"C:\\Program Files (x86)\\Windows Kits\\8.0\\Include\\um\";\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing/Internal/WindowsSdkUtils.cs","rank":74,"score":28.134526690769842},{"content":"namespace EventTraceKit.EventTracing.Internal.Extensions\n\n{\n\n using System.Xml;\n\n using System.Xml.Linq;\n\n using System.Xml.Schema;\n\n\n\n internal static class XmlExtensions\n\n {\n\n public static void Add(\n\n this XmlSchemaSet set, XNamespace targetNamespace, string schemaUri)\n\n {\n\n set.Add(targetNamespace.NamespaceName, schemaUri);\n\n }\n\n\n\n public static void AddNamespace(\n\n this XmlNamespaceManager nsmgr, string prefix, XNamespace ns)\n\n {\n\n nsmgr.AddNamespace(prefix, ns.NamespaceName);\n\n }\n\n }\n\n}\n","file_path":"src/EventTraceKit.EventTracing/Internal/Extensions/XmlExtensions.cs","rank":75,"score":28.09659831820796},{"content":"namespace EventTraceKit.VsExtension\n\n{\n\n using System.Runtime.InteropServices;\n\n using System.Windows;\n\n\n\n public static class ClipboardUtils\n\n {\n\n public static bool TryGet<T>(out T value, out string text)\n\n where T : class\n\n {\n\n value = default;\n\n text = default;\n\n\n\n var dataObj = Clipboard.GetDataObject();\n\n if (dataObj == null)\n\n return false;\n\n\n\n if (dataObj.GetDataPresent(typeof(T)))\n\n value = (T)dataObj.GetData(typeof(T));\n\n if (dataObj.GetDataPresent(DataFormats.UnicodeText, true))\n","file_path":"src/EventTraceKit.VsExtension/ClipboardUtils.cs","rank":76,"score":27.999257763081683},{"content":"#include <cstdio>\n\n#include <string>\n\n#include <string_view>\n\n\n\n#include <fcntl.h>\n\n#include <io.h>\n\n#include <objbase.h>\n\n#include <psapi.h>\n\n#include <windows.h>\n\n\n\nusing namespace std::literals;\n\n\n\nnamespace\n\n{\n\n\n\nbool Consume(wchar_t const*& p, wchar_t chr)\n\n{\n\n if (*p != chr)\n\n return false;\n\n\n","file_path":"src/TraceLaunch.x86/Main.cpp","rank":77,"score":27.771248923616497},{"content":"namespace EventManifestCompiler.Build.Tasks\n\n{\n\n using System;\n\n using System.IO;\n\n using System.Security;\n\n using Microsoft.Build.Framework;\n\n using Microsoft.Build.Utilities;\n\n\n\n internal static class FileUtilities\n\n {\n\n internal static string GetTemporaryFile()\n\n {\n\n return GetTemporaryFile(\".tmp\");\n\n }\n\n\n\n internal static string GetTemporaryFile(string extension)\n\n {\n\n return GetTemporaryFile(null, extension);\n\n }\n\n\n","file_path":"src/EventManifestCompiler.Build.Tasks/FileUtilities.cs","rank":78,"score":27.66754230879425},{"content":"namespace EventManifestCompiler.Build.Tasks\n\n{\n\n using System;\n\n using System.IO;\n\n\n\n internal static class ErrorUtilities\n\n {\n\n internal static void ThrowInternalError(string message, params object[] args)\n\n {\n\n //throw new InternalErrorException(ResourceUtilities.FormatString(message, args));\n\n throw new Exception(string.Format(message, args));\n\n }\n\n\n\n internal static void ThrowInternalError(string message, Exception innerException, params object[] args)\n\n {\n\n //throw new InternalErrorException(ResourceUtilities.FormatString(message, args), innerException);\n\n throw new Exception(string.Format(message, args), innerException);\n\n }\n\n\n\n internal static void VerifyThrow(bool condition, string unformattedMessage)\n","file_path":"src/EventManifestCompiler.Build.Tasks/ErrorUtilities.cs","rank":79,"score":26.596582588484225},{"content":"namespace EventTraceKit.VsExtension.Native\n\n{\n\n using System;\n\n using System.Runtime.InteropServices;\n\n using Microsoft.Win32.SafeHandles;\n\n\n\n internal sealed class SafeBstrHandle : SafeHandleZeroOrMinusOneIsInvalid\n\n {\n\n private SafeBstrHandle(IntPtr handle) : base(true)\n\n {\n\n SetHandle(handle);\n\n }\n\n\n\n public static SafeBstrHandle Create(string str)\n\n {\n\n return new SafeBstrHandle(Marshal.StringToBSTR(str));\n\n }\n\n\n\n public unsafe UnmanagedString Get()\n\n {\n","file_path":"src/EventTraceKit.VsExtension/Native/SafeBstrHandle.cs","rank":80,"score":26.54624766242958},{"content":"namespace Xunit.Sdk\n\n{\n\n using System;\n\n using System.Collections;\n\n using System.Collections.Generic;\n\n using System.Globalization;\n\n using System.Linq;\n\n using System.Reflection;\n\n using System.Text;\n\n using EventTraceKit.EventTracing.Tests.Compilation.TestSupport;\n\n\n\n internal class SequenceEqualException : EqualException\n\n {\n\n private static readonly Dictionary<char, string> Encodings = new Dictionary<char, string> {\n\n { '\\r', \"\\\\r\" },\n\n { '\\n', \"\\\\n\" },\n\n { '\\t', \"\\\\t\" },\n\n { '\\0', \"\\\\0\" }\n\n };\n\n\n","file_path":"src/EventTraceKit.EventTracing.Tests/Compilation/TestSupport/SequenceEqualException.cs","rank":81,"score":26.41011911829444},{"content":"namespace EventTraceKit.VsExtension.Extensions\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Linq;\n\n using System.Runtime.InteropServices;\n\n using EnvDTE;\n\n using EnvDTE80;\n\n using Microsoft.VisualStudio;\n\n using Microsoft.VisualStudio.Shell;\n\n using Microsoft.VisualStudio.Shell.Interop;\n\n\n\n internal static class DteExtensions\n\n {\n\n public static IEnumerable<Project> ProjectsRecursive(this Solution solution)\n\n {\n\n return solution.Projects.Cast<Project>().SelectMany(EnumerateProject);\n\n }\n\n\n\n private static IEnumerable<Project> EnumerateProject(Project project)\n","file_path":"src/EventTraceKit.VsExtension/Extensions/DteExtensions.cs","rank":82,"score":26.328013542766143},{"content":"namespace EventTraceKit.VsExtension.Views.PresetManager\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Linq;\n\n using System.Threading.Tasks;\n\n using System.Windows;\n\n using EventTraceKit.VsExtension.Windows;\n\n\n\n public partial class PresetSaveAsDialog\n\n {\n\n private readonly IEnumerable<string> builtInPresetNames;\n\n private AsyncDelegateCommand saveCommand;\n\n\n\n public static readonly DependencyProperty CanExecuteProperty =\n\n DependencyProperty.Register(\n\n nameof(CanExecute),\n\n typeof(bool),\n\n typeof(PresetSaveAsDialog),\n\n new PropertyMetadata(\n","file_path":"src/EventTraceKit.VsExtension/Views/PresetManager/PresetSaveAsDialog.xaml.cs","rank":83,"score":26.021238910440236},{"content":"namespace EventTraceKit.VsExtension.Views\n\n{\n\n using System;\n\n using System.Runtime.InteropServices;\n\n using System.Windows;\n\n using System.Windows.Interop;\n\n using EventTraceKit.VsExtension.Extensions;\n\n using Microsoft.VisualStudio.Shell;\n\n using Microsoft.VisualStudio.Shell.Interop;\n\n using Microsoft.Win32;\n\n using Microsoft.Windows.TaskDialogs;\n\n\n\n public static class VsModalExtensions\n\n {\n\n public static TaskDialogResult ShowModal(this TaskDialog dialog)\n\n {\n\n dialog.OwnerWindow = new HandleRef(null, GetDialogOwnerHwnd());\n\n return dialog.Show();\n\n }\n\n\n","file_path":"src/EventTraceKit.VsExtension/Views/VsModalExtensions.cs","rank":84,"score":25.90072408731532},{"content":"namespace CoreConsoleApp\n\n{\n\n using System;\n\n using System.Threading;\n\n\n\n public class Program\n\n {\n\n public static void Main(string[] args)\n\n {\n\n for (int i = 0; i < 50; ++i) {\n\n Console.WriteLine(\"CoreConsoleApp {0}\", i);\n\n Thread.Sleep(1000);\n\n }\n\n }\n\n }\n\n}\n","file_path":"test/CoreConsoleApp/Program.cs","rank":85,"score":25.857268050069848},{"content":"namespace EventTraceKit.VsExtension\n\n{\n\n using System;\n\n using System.Globalization;\n\n using System.Linq;\n\n using System.Runtime.InteropServices;\n\n using System.Windows;\n\n using System.Windows.Markup;\n\n using System.Windows.Media;\n\n using Microsoft.VisualStudio;\n\n using Microsoft.VisualStudio.Settings;\n\n using Microsoft.VisualStudio.Shell;\n\n using Microsoft.VisualStudio.Shell.Interop;\n\n using Microsoft.VisualStudio.Shell.Settings;\n\n using Microsoft.VisualStudio.TextManager.Interop;\n\n using Native;\n\n using IServiceProvider = Microsoft.VisualStudio.OLE.Interop.IServiceProvider;\n\n\n\n public static class FontUtils\n\n {\n","file_path":"src/EventTraceKit.VsExtension/FontAndColorsHelper.cs","rank":86,"score":25.82344818629604},{"content":"namespace EventTraceKit.EventTracing.Compilation.Support\n\n{\n\n using System.IO;\n\n using System.Text;\n\n using System.Threading;\n\n\n\n internal static class IO\n\n {\n\n private static UTF8Encoding utf8WithBOM;\n\n private static UTF8Encoding utf8NoBOM;\n\n\n\n private static Encoding UTF8BOM\n\n {\n\n get\n\n {\n\n if (utf8WithBOM == null) {\n\n var encoding = new UTF8Encoding(false, true);\n\n Thread.MemoryBarrier();\n\n utf8WithBOM = encoding;\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Compilation/Support/IO.cs","rank":87,"score":25.620577226254124},{"content":"namespace EventTraceKit.VsExtension.UITests\n\n{\n\n using System;\n\n using System.Collections;\n\n using System.Collections.Generic;\n\n using System.Linq;\n\n using System.Threading.Tasks;\n\n using System.Windows;\n\n using System.Windows.Controls;\n\n using EventTraceKit.VsExtension.Windows;\n\n using Microsoft.VisualStudio.Threading;\n\n using Xunit;\n\n\n\n public class BindTest\n\n {\n\n private const string SpecialItemValue = \"<special>\";\n\n\n\n private static IEnumerable<string> NextItems(Random rng, int count)\n\n {\n\n var list = Enumerable.Range(0, count).Select(x => rng.Next().ToString()).ToList();\n","file_path":"src/EventTraceKit.VsExtension.UITests/BindTest.cs","rank":88,"score":25.384785486282603},{"content":"namespace EventTraceKit.VsExtension.Extensions\n\n{\n\n using System;\n\n using System.Xml.Linq;\n\n\n\n public static class XElementExtensions\n\n {\n\n public static string AsString(this XAttribute attribute)\n\n {\n\n return attribute?.Value;\n\n }\n\n\n\n public static byte? AsByte(this XAttribute attribute)\n\n {\n\n if (attribute != null && byte.TryParse(attribute.Value, out byte value))\n\n return value;\n\n return null;\n\n }\n\n\n\n public static ushort? AsUShort(this XAttribute attribute)\n","file_path":"src/EventTraceKit.VsExtension/Extensions/XElementExtensions.cs","rank":89,"score":25.351287370805956},{"content":"namespace EventManifestCompiler\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.ComponentModel;\n\n using System.ComponentModel.Composition;\n\n using System.ComponentModel.Composition.Hosting;\n\n using System.Diagnostics;\n\n using System.IO;\n\n using System.Linq;\n\n using System.Reflection;\n\n using EventManifestCompiler.Support;\n\n using EventTraceKit.EventTracing.Compilation.CodeGen;\n\n using EventTraceKit.EventTracing.Support;\n\n using NOption;\n\n\n\n public static class Program\n\n {\n\n public static int Main(string[] args)\n\n {\n","file_path":"src/EventManifestCompiler/Program.cs","rank":90,"score":25.312860491090685},{"content":"namespace EventTraceKit.EventTracing.Compilation.CodeGen\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Linq;\n\n using System.Text;\n\n\n\n internal static class CodeGenUtils\n\n {\n\n public static IEnumerable<int> CodePoints(this string str)\n\n {\n\n for (int i = 0; i < str.Length;) {\n\n int cp;\n\n if (char.IsSurrogate(str, i)) {\n\n cp = char.ConvertToUtf32(str, i);\n\n i += 2;\n\n } else {\n\n cp = str[i];\n\n ++i;\n\n }\n","file_path":"src/EventTraceKit.EventTracing/Compilation/CodeGen/CodeGenUtils.cs","rank":91,"score":25.289714639596014},{"content":"namespace EventManifestCompiler.Build.Tasks\n\n{\n\n using System;\n\n using System.IO;\n\n using System.Security;\n\n\n\n internal static class ExceptionHandling\n\n {\n\n internal static bool NotExpectedException(Exception ex)\n\n {\n\n return\n\n !(ex is UnauthorizedAccessException) &&\n\n !(ex is NotSupportedException) &&\n\n (!(ex is ArgumentException) || ex is ArgumentNullException) &&\n\n !(ex is SecurityException) &&\n\n !(ex is IOException);\n\n }\n\n }\n\n}\n","file_path":"src/EventManifestCompiler.Build.Tasks/ExceptionHandling.cs","rank":92,"score":24.975498336930613},{"content":"namespace EventTraceKit.VsExtension.Formatting\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.Linq;\n\n using System.Reflection;\n\n\n\n public static class FormatProviderExtensions\n\n {\n\n public static string DefaultFormat(\n\n this IFormatProvider formatProvider)\n\n {\n\n return formatProvider?.GetType()\n\n .GetCustomAttribute<DefaultFormatAttribute>(true)?.DefaultFormat;\n\n }\n\n\n\n public static SupportedFormat DefaultSupportedFormat(\n\n this IFormatProvider formatProvider)\n\n {\n\n if (formatProvider == null)\n","file_path":"src/EventTraceKit.VsExtension/Formatting/FormatProviderExtensions.cs","rank":93,"score":24.923327334296108},{"content":"namespace EventTraceKit.EventTracing.Internal.Native\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n using System.ComponentModel;\n\n using System.IO;\n\n using System.Runtime.InteropServices;\n\n\n\n internal static class SafeModuleHandleExtensions\n\n {\n\n public static List<ResourceName> GetResourceTypes(this SafeModuleHandle module)\n\n {\n\n return UnsafeNativeMethods.GetResourceTypesEx(module);\n\n }\n\n\n\n public static List<ResourceName> GetResourceNames(this SafeModuleHandle module, ResourceName type)\n\n {\n\n return UnsafeNativeMethods.GetResourceNamesEx(module, type);\n\n }\n\n\n","file_path":"src/EventTraceKit.EventTracing/Internal/Native/SafeModuleHandleExtensions.cs","rank":95,"score":24.592216894510592},{"content":"namespace EventTraceKit.VsExtension.Windows\n\n{\n\n using System.Windows;\n\n using Extensions;\n\n\n\n public static class ValidateValueCallbacks\n\n {\n\n private static bool IsFiniteDoubleImpl(object value)\n\n {\n\n return value is double d && d.IsFinite();\n\n }\n\n\n\n public static ValidateValueCallback IsFiniteDouble { get; } = IsFiniteDoubleImpl;\n\n }\n\n}\n","file_path":"src/EventTraceKit.VsExtension/Windows/ValidateValueCallbacks.cs","rank":96,"score":24.51298787185155},{"content":"namespace EventTraceKit.VsExtension.Extensions\n\n{\n\n using System;\n\n using System.Collections.Generic;\n\n\n\n internal static class ComparisonUtils\n\n {\n\n public static bool CompareValueT<T>(\n\n out int cmp, T first, T second) where T : struct, IComparable<T>\n\n {\n\n cmp = first.CompareTo(second);\n\n return cmp == 0;\n\n }\n\n\n\n public static bool Compare<T>(out int cmp, T first, T second)\n\n where T : IComparable\n\n {\n\n cmp = first.CompareTo(second);\n\n return cmp == 0;\n\n }\n","file_path":"src/EventTraceKit.VsExtension/Extensions/ComparisonUtils.cs","rank":97,"score":24.441652349838826},{"content":"namespace EventTraceKit.VsExtension\n\n{\n\n using System;\n\n using System.Threading.Tasks;\n\n using System.Windows.Input;\n\n\n\n public class AsyncDelegateCommand : ICommand\n\n {\n\n private static readonly Func<bool> CanAlwaysExecute = () => true;\n\n private readonly Func<Task> execute;\n\n private readonly Func<bool> canExecute;\n\n private bool isExecuting;\n\n\n\n public AsyncDelegateCommand(Func<Task> execute)\n\n : this(execute, CanAlwaysExecute)\n\n {\n\n }\n\n\n\n public AsyncDelegateCommand(\n\n Func<Task> execute, Func<bool> canExecute)\n","file_path":"src/EventTraceKit.VsExtension/AsyncDelegateCommand.cs","rank":98,"score":24.380954199212148},{"content":"namespace PerfRunner\n\n{\n\n using System;\n\n using System.Runtime.InteropServices;\n\n\n\n internal sealed class CoTaskMemHandle : SafeHandle\n\n {\n\n public CoTaskMemHandle(IntPtr handle)\n\n : base(handle, true)\n\n {\n\n }\n\n\n\n public override bool IsInvalid => handle == IntPtr.Zero;\n\n\n\n public static CoTaskMemHandle Allocate(int size)\n\n {\n\n var buffer = Marshal.AllocCoTaskMem(size);\n\n return new CoTaskMemHandle(buffer);\n\n }\n\n\n\n protected override bool ReleaseHandle()\n\n {\n\n Marshal.FreeCoTaskMem(handle);\n\n return true;\n\n }\n\n }\n\n}\n","file_path":"src/PerfRunner/CoTaskMemHandle.cs","rank":99,"score":24.275686108896927}],"string":"[\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Schema\\n\\n{\\n\\n using System.Xml.Linq;\\n\\n using EventTraceKit.EventTracing.Schema.Base;\\n\\n\\n\\n public static class EventManifestSchema\\n\\n {\\n\\n public static readonly XNamespace Namespace =\\n\\n \\\"http://schemas.microsoft.com/win/2004/08/events\\\";\\n\\n }\\n\\n\\n\\n public static class EventSchema\\n\\n {\\n\\n public static readonly XNamespace Namespace =\\n\\n \\\"http://schemas.microsoft.com/win/2004/08/events/event\\\";\\n\\n }\\n\\n\\n\\n public static class WinEventSchema\\n\\n {\\n\\n public static readonly XNamespace Namespace =\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Schema/Namespaces.cs\",\n \"rank\": 0,\n \"score\": 52726.358330813\n },\n {\n \"content\": \" \\\"http://manifests.microsoft.com/win/2004/08/windows/events\\\";\\n\\n\\n\\n public static readonly QName Int8 = new QName(\\\"Int8\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName UInt8 = new QName(\\\"UInt8\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Int16 = new QName(\\\"Int16\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName UInt16 = new QName(\\\"UInt16\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Int32 = new QName(\\\"Int32\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName UInt32 = new QName(\\\"UInt32\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Int64 = new QName(\\\"Int64\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName UInt64 = new QName(\\\"UInt64\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Float = new QName(\\\"Float\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Double = new QName(\\\"Double\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Boolean = new QName(\\\"Boolean\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName UnicodeString = new QName(\\\"UnicodeString\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName AnsiString = new QName(\\\"AnsiString\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Binary = new QName(\\\"Binary\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Guid = new QName(\\\"GUID\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName Pointer = new QName(\\\"Pointer\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName FileTime = new QName(\\\"FILETIME\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName SystemTime = new QName(\\\"SYSTEMTIME\\\", \\\"win\\\", Namespace);\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Schema/Namespaces.cs\",\n \"rank\": 1,\n \"score\": 52723.241055772894\n },\n {\n \"content\": \" public static readonly QName SecurityId = new QName(\\\"SID\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName HexInt32 = new QName(\\\"HexInt32\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName HexInt64 = new QName(\\\"HexInt64\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName CountedUnicodeString = new QName(\\\"CountedUnicodeString\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName CountedAnsiString = new QName(\\\"CountedAnsiString\\\", \\\"win\\\", Namespace);\\n\\n public static readonly QName CountedBinary = new QName(\\\"CountedBinary\\\", \\\"win\\\", Namespace);\\n\\n }\\n\\n\\n\\n public static class EventTraceKitSchema\\n\\n {\\n\\n public static readonly XNamespace Namespace = \\\"urn:uuid:fb199331-10b4-437d-88b3-adb0561c2e3f\\\";\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Schema/Namespaces.cs\",\n \"rank\": 2,\n \"score\": 52722.678416230076\n },\n {\n \"content\": \" // with the /str option, or rebuild your VS project.\\n\\n [global::System.CodeDom.Compiler.GeneratedCodeAttribute(\\\"System.Resources.Tools.StronglyTypedResourceBuilder\\\", \\\"16.0.0.0\\\")]\\n\\n [global::System.Diagnostics.DebuggerNonUserCodeAttribute()]\\n\\n [global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]\\n\\n internal class Strings {\\n\\n \\n\\n private static global::System.Resources.ResourceManager resourceMan;\\n\\n \\n\\n private static global::System.Globalization.CultureInfo resourceCulture;\\n\\n \\n\\n [global::System.Diagnostics.CodeAnalysis.SuppressMessageAttribute(\\\"Microsoft.Performance\\\", \\\"CA1811:AvoidUncalledPrivateCode\\\")]\\n\\n internal Strings() {\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Returns the cached ResourceManager instance used by this class.\\n\\n /// </summary>\\n\\n [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]\\n\\n internal static global::System.Resources.ResourceManager ResourceManager {\\n\\n get {\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs\",\n \"rank\": 3,\n \"score\": 52671.558719639164\n },\n {\n \"content\": \" if (object.ReferenceEquals(resourceMan, null)) {\\n\\n global::System.Resources.ResourceManager temp = new global::System.Resources.ResourceManager(\\\"EventManifestCompiler.Build.Tasks.Strings\\\", typeof(Strings).Assembly);\\n\\n resourceMan = temp;\\n\\n }\\n\\n return resourceMan;\\n\\n }\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Overrides the current thread's CurrentUICulture property for all\\n\\n /// resource lookups using this strongly typed resource class.\\n\\n /// </summary>\\n\\n [global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]\\n\\n internal static global::System.Globalization.CultureInfo Culture {\\n\\n get {\\n\\n return resourceCulture;\\n\\n }\\n\\n set {\\n\\n resourceCulture = value;\\n\\n }\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs\",\n \"rank\": 4,\n \"score\": 52670.51069852171\n },\n {\n \"content\": \"//------------------------------------------------------------------------------\\n\\n// <auto-generated>\\n\\n// This code was generated by a tool.\\n\\n// Runtime Version:4.0.30319.42000\\n\\n//\\n\\n// Changes to this file may cause incorrect behavior and will be lost if\\n\\n// the code is regenerated.\\n\\n// </auto-generated>\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\nnamespace EventManifestCompiler.Build.Tasks {\\n\\n using System;\\n\\n \\n\\n \\n\\n /// <summary>\\n\\n /// A strongly-typed resource class, for looking up localized strings, etc.\\n\\n /// </summary>\\n\\n // This class was auto-generated by the StronglyTypedResourceBuilder\\n\\n // class via a tool like ResGen or Visual Studio.\\n\\n // To add or remove a member, edit your .ResX file then rerun ResGen\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs\",\n \"rank\": 5,\n \"score\": 52667.7442525992\n },\n {\n \"content\": \" }\\n\\n \\n\\n /// <summary>\\n\\n /// Looks up a localized string similar to Required file "{0}" is missing..\\n\\n /// </summary>\\n\\n internal static string Error_MissingFile {\\n\\n get {\\n\\n return ResourceManager.GetString(\\\"Error_MissingFile\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Looks up a localized string similar to "{1}" task received an invalid value for the "{0}" parameter..\\n\\n /// </summary>\\n\\n internal static string General_InvalidValue {\\n\\n get {\\n\\n return ResourceManager.GetString(\\\"General_InvalidValue\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n \\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs\",\n \"rank\": 6,\n \"score\": 52664.821821041485\n },\n {\n \"content\": \" /// </summary>\\n\\n internal static string TrackedToolTask_RebuildingDueToInvalidTLog {\\n\\n get {\\n\\n return ResourceManager.GetString(\\\"TrackedToolTask_RebuildingDueToInvalidTLog\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Looks up a localized string similar to Forcing a rebuild of all source files due to the contents of "{0}" being invalid..\\n\\n /// </summary>\\n\\n internal static string TrackedToolTask_RebuildingDueToInvalidTLogContents {\\n\\n get {\\n\\n return ResourceManager.GetString(\\\"TrackedToolTask_RebuildingDueToInvalidTLogContents\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Looks up a localized string similar to Forcing rebuild of all source files due to missing command TLog "{0}"..\\n\\n /// </summary>\\n\\n internal static string TrackedToolTask_RebuildingNoCommandTLog {\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs\",\n \"rank\": 7,\n \"score\": 52664.50913309738\n },\n {\n \"content\": \" /// <summary>\\n\\n /// Looks up a localized string similar to Tracking command:.\\n\\n /// </summary>\\n\\n internal static string Native_TrackingCommandMessage {\\n\\n get {\\n\\n return ResourceManager.GetString(\\\"Native_TrackingCommandMessage\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Looks up a localized string similar to Forcing rebuild of all source files due to a change in the command line since the last build..\\n\\n /// </summary>\\n\\n internal static string TrackedToolTask_RebuildingAllSourcesCommandLineChanged {\\n\\n get {\\n\\n return ResourceManager.GetString(\\\"TrackedToolTask_RebuildingAllSourcesCommandLineChanged\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Looks up a localized string similar to Forcing a rebuild of all sources due to an error with the tracking logs. {0}.\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs\",\n \"rank\": 8,\n \"score\": 52664.20290265273\n },\n {\n \"content\": \" get {\\n\\n return ResourceManager.GetString(\\\"TrackedToolTask_RebuildingNoCommandTLog\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n \\n\\n /// <summary>\\n\\n /// Looks up a localized string similar to Forcing rebuild of source file "{0}" due to a change in the command line since the last build..\\n\\n /// </summary>\\n\\n internal static string TrackedToolTask_RebuildingSourceCommandLineChanged {\\n\\n get {\\n\\n return ResourceManager.GetString(\\\"TrackedToolTask_RebuildingSourceCommandLineChanged\\\", resourceCulture);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/Strings.Designer.cs\",\n \"rank\": 9,\n \"score\": 52662.936854528816\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Native\\n\\n{\\n\\n using System;\\n\\n using System.Runtime.InteropServices;\\n\\n\\n\\n [StructLayout(LayoutKind.Sequential)]\\n\\n public struct UnmanagedString\\n\\n : IEquatable<UnmanagedString>\\n\\n , IComparable<UnmanagedString>\\n\\n , IComparable<string>\\n\\n {\\n\\n private readonly unsafe char* str;\\n\\n\\n\\n public unsafe UnmanagedString(char* str)\\n\\n {\\n\\n this.str = str;\\n\\n }\\n\\n\\n\\n public static readonly UnmanagedString Empty;\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Native/UnmanagedString.cs\",\n \"rank\": 10,\n \"score\": 51810.678015160636\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Extensions\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Text.RegularExpressions;\\n\\n\\n\\n public static class StringExtensions\\n\\n {\\n\\n public static string TrimToLength(\\n\\n this string s, int maxLength, TrimPosition position = TrimPosition.End)\\n\\n {\\n\\n if (s == null || s.Length <= maxLength)\\n\\n return s;\\n\\n if (maxLength <= 0)\\n\\n return string.Empty;\\n\\n\\n\\n var length = maxLength - 1;\\n\\n switch (position) {\\n\\n case TrimPosition.End:\\n\\n return s.Substring(0, length) + \\\"…\\\";\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Extensions/StringExtensions.cs\",\n \"rank\": 11,\n \"score\": 51807.7719341781\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Schema\\n\\n{\\n\\n using System;\\n\\n using System.Diagnostics;\\n\\n using EventTraceKit.EventTracing.Support;\\n\\n\\n\\n [DebuggerDisplay(\\\"{Name}({Id,h}) = '{Value}'\\\")]\\n\\n public sealed class LocalizedString : SourceItem\\n\\n {\\n\\n public const uint UnusedId = uint.MaxValue;\\n\\n\\n\\n public LocalizedString(LocatedRef<string> name, LocatedRef<string> value)\\n\\n : this(name, value, UnusedId)\\n\\n {\\n\\n }\\n\\n\\n\\n public LocalizedString(LocatedRef<string> name, string value, uint id)\\n\\n {\\n\\n Name = name ?? throw new ArgumentNullException(nameof(name));\\n\\n Value = value ?? throw new ArgumentNullException(nameof(value));\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Schema/LocalizedString.cs\",\n \"rank\": 12,\n \"score\": 51801.0714109881\n },\n {\n \"content\": \" public unsafe bool IsEmpty\\n\\n {\\n\\n get\\n\\n {\\n\\n if (HasValue)\\n\\n return str[0] == '\\\\0';\\n\\n return true;\\n\\n }\\n\\n }\\n\\n\\n\\n public unsafe bool HasValue => str != null;\\n\\n\\n\\n public override unsafe string ToString()\\n\\n {\\n\\n return str != null ? new string(str) : string.Empty;\\n\\n }\\n\\n\\n\\n public static implicit operator string(UnmanagedString value)\\n\\n {\\n\\n return value.ToString();\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Native/UnmanagedString.cs\",\n \"rank\": 13,\n \"score\": 51798.564162794355\n },\n {\n \"content\": \" case TrimPosition.Start:\\n\\n return \\\"…\\\" + s.Substring(s.Length - length, length);\\n\\n case TrimPosition.Middle:\\n\\n int suffix = length / 2;\\n\\n int prefix = length - suffix;\\n\\n return s.Substring(0, prefix) + \\\"…\\\" + s.Substring(s.Length - suffix, suffix);\\n\\n default:\\n\\n throw new ArgumentOutOfRangeException(nameof(position), position, null);\\n\\n }\\n\\n }\\n\\n\\n\\n public static string MakeNumberedCopy(this string fullString, ISet<string> usedStrings = null)\\n\\n {\\n\\n if (usedStrings == null || !usedStrings.Contains(fullString))\\n\\n return fullString;\\n\\n\\n\\n var match = Regex.Match(fullString, @\\\"\\\\A(?<str>.*) \\\\(Copy(?: (?<num>\\\\d+))?\\\\)\\\\z\\\");\\n\\n\\n\\n string str;\\n\\n int num;\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Extensions/StringExtensions.cs\",\n \"rank\": 14,\n \"score\": 51797.18286477046\n },\n {\n \"content\": \" }\\n\\n\\n\\n public static unsafe explicit operator char*(UnmanagedString value)\\n\\n {\\n\\n return value.str;\\n\\n }\\n\\n\\n\\n public bool Equals(UnmanagedString other)\\n\\n {\\n\\n throw new NotImplementedException();\\n\\n }\\n\\n\\n\\n public int CompareTo(UnmanagedString other)\\n\\n {\\n\\n throw new NotImplementedException();\\n\\n }\\n\\n\\n\\n public int CompareTo(string other)\\n\\n {\\n\\n throw new NotImplementedException();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Native/UnmanagedString.cs\",\n \"rank\": 15,\n \"score\": 51796.998671407324\n },\n {\n \"content\": \" Id = id;\\n\\n }\\n\\n\\n\\n public LocatedRef<string> Name { get; }\\n\\n public LocatedRef<string> Value { get; }\\n\\n public uint Id { get; set; }\\n\\n public LocatedRef<string> Symbol { get; set; }\\n\\n\\n\\n public bool Imported { get; set; }\\n\\n\\n\\n public override string ToString()\\n\\n {\\n\\n return Name;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Schema/LocalizedString.cs\",\n \"rank\": 16,\n \"score\": 51792.80226015142\n },\n {\n \"content\": \" if (match.Success) {\\n\\n str = match.Groups[\\\"str\\\"].Value;\\n\\n num = match.Groups[\\\"num\\\"].Success ? int.Parse(match.Groups[\\\"num\\\"].Value) : 1;\\n\\n } else {\\n\\n str = fullString;\\n\\n num = 0;\\n\\n }\\n\\n\\n\\n while (true) {\\n\\n ++num;\\n\\n string copiedStr = str + (num == 1 ? \\\" (Copy)\\\" : $\\\" (Copy {num})\\\");\\n\\n if (!usedStrings.Contains(copiedStr))\\n\\n return copiedStr;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n public enum TrimPosition\\n\\n {\\n\\n End,\\n\\n Start,\\n\\n Middle\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Extensions/StringExtensions.cs\",\n \"rank\": 17,\n \"score\": 51791.40650379109\n },\n {\n \"content\": \"[assembly: System.Windows.Markup.XmlnsDefinition(\\n\\n \\\"urn:schemas-eventtracekit:settings\\\",\\n\\n \\\"EventTraceKit.VsExtension.Settings.Persistence\\\")]\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Settings/Persistence/NamespaceMapping.cs\",\n \"rank\": 18,\n \"score\": 50992.616962507505\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal.Extensions\\n\\n{\\n\\n using System;\\n\\n using System.Globalization;\\n\\n\\n\\n internal static class StringExtensions\\n\\n {\\n\\n public static string ToStringInvariant(this int value)\\n\\n {\\n\\n return value.ToString(CultureInfo.InvariantCulture);\\n\\n }\\n\\n\\n\\n /// <summary>\\n\\n /// Escapes the string so that it is safe to use as a formatting\\n\\n /// string with <see cref=\\\"string.Format(string,object)\\\"/> and zero\\n\\n /// args.\\n\\n /// </summary>\\n\\n /// <param name=\\\"str\\\">The string to escape.</param>\\n\\n /// <returns>\\n\\n /// The escaped string with formatting-relevant characters ({, })\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Extensions/StringExtensions.cs\",\n \"rank\": 19,\n \"score\": 50964.41060174091\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Extensions\\n\\n{\\n\\n using System.Text;\\n\\n\\n\\n public static class StringBuilderExtensions\\n\\n {\\n\\n private const string HexChars = \\\"0123456789ABCDEF\\\";\\n\\n\\n\\n public static void AppendHexByte(this StringBuilder builder, byte b)\\n\\n {\\n\\n int hi = (b >> 4) & 0xF;\\n\\n int lo = b & 0xF;\\n\\n builder.Append(HexChars[hi]);\\n\\n builder.Append(HexChars[lo]);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Extensions/StringBuilderExtensions.cs\",\n \"rank\": 20,\n \"score\": 50961.273277669374\n },\n {\n \"content\": \"#include \\\"etk/Support/StringConversions.h\\\"\\n\\n\\n\\n#include <Windows.h>\\n\\n#include <type_traits>\\n\\n\\n\\nnamespace etk\\n\\n{\\n\\n\\n\\nnamespace\\n\\n{\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 21,\n \"score\": 50956.72100756398\n },\n {\n \"content\": \"\\n\\n buffer.resize(convertedLength);\\n\\n return true;\\n\\n}\\n\\n\\n\\n} // namespace\\n\\n\\n\\nbool U8To16(std::string_view source, std::wstring& output)\\n\\n{\\n\\n return Convert<U8To16Conversion>(source.data(), source.length(), output);\\n\\n}\\n\\n\\n\\nstd::wstring U8To16(std::string_view source)\\n\\n{\\n\\n std::wstring buffer;\\n\\n (void)Convert<U8To16Conversion>(source.data(), source.length(), buffer);\\n\\n return buffer;\\n\\n}\\n\\n\\n\\nbool U16To8(std::wstring_view source, std::string& output)\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 22,\n \"score\": 50952.2288436528\n },\n {\n \"content\": \" /// escaped.\\n\\n /// </returns>\\n\\n public static string EscapeFormatting(this string str)\\n\\n {\\n\\n return str.Replace(\\\"{\\\", \\\"{{\\\").Replace(\\\"}\\\", \\\"}}\\\");\\n\\n }\\n\\n\\n\\n /// <summary>\\n\\n /// Returns the longest common prefix of both specified strings.\\n\\n /// </summary>\\n\\n /// <param name=\\\"a\\\">The first string.</param>\\n\\n /// <param name=\\\"b\\\">The second string.</param>\\n\\n /// <returns>\\n\\n /// The longest common prefix of both strings (which may be empty).\\n\\n /// Also returns empty if any input string is <see langword=\\\"null\\\"/>.\\n\\n /// </returns>\\n\\n public static string LongestCommonPrefix(string a, string b)\\n\\n {\\n\\n if (string.IsNullOrEmpty(a) || string.IsNullOrEmpty(b))\\n\\n return string.Empty;\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Extensions/StringExtensions.cs\",\n \"rank\": 23,\n \"score\": 50950.16563447492\n },\n {\n \"content\": \"{\\n\\n return Convert<U16To8Conversion>(source.data(), source.length(), output);\\n\\n}\\n\\n\\n\\nstd::string U16To8(std::wstring_view source)\\n\\n{\\n\\n std::string buffer;\\n\\n (void)Convert<U16To8Conversion>(source.data(), source.length(), buffer);\\n\\n return buffer;\\n\\n}\\n\\n\\n\\n} // namespace etk\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 24,\n \"score\": 50947.996306245535\n },\n {\n \"content\": \" typename OutputStringAllocator = std::allocator<typename Converter::OutputChar>>\\n\\nbool Convert(typename Converter::InputChar const* source, size_t sourceLength,\\n\\n std::basic_string<typename Converter::OutputChar, OutputCharTraits,\\n\\n OutputStringAllocator>& buffer)\\n\\n{\\n\\n if (sourceLength == 0)\\n\\n return true;\\n\\n\\n\\n size_t outLength;\\n\\n if (!Converter::EstimateLength(source, sourceLength, outLength))\\n\\n return false;\\n\\n\\n\\n buffer.resize(outLength);\\n\\n\\n\\n size_t const convertedLength =\\n\\n Converter::Convert(&buffer[0], buffer.length() + 1, source, sourceLength);\\n\\n if (convertedLength == 0) {\\n\\n buffer.clear();\\n\\n return false;\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 25,\n \"score\": 50946.87197643195\n },\n {\n \"content\": \" return true;\\n\\n}\\n\\n\\n\\nsize_t U8To16Conversion::Convert(wchar_t* out, size_t outSize, char const* source,\\n\\n size_t sourceLength) noexcept\\n\\n{\\n\\n if (outSize == 0)\\n\\n return 0;\\n\\n\\n\\n int const length =\\n\\n MultiByteToWideChar(CP_UTF8, 0, source, static_cast<int>(sourceLength), out,\\n\\n static_cast<int>(outSize));\\n\\n if (length <= 0)\\n\\n return 0;\\n\\n\\n\\n return static_cast<size_t>(length);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 26,\n \"score\": 50944.18168820014\n },\n {\n \"content\": \" return true;\\n\\n}\\n\\n\\n\\nsize_t U16To8Conversion::Convert(char* out, size_t outSize, wchar_t const* source,\\n\\n size_t sourceLength) noexcept\\n\\n{\\n\\n if (outSize == 0)\\n\\n return 0;\\n\\n\\n\\n int const length =\\n\\n WideCharToMultiByte(CP_UTF8, 0, source, static_cast<int>(sourceLength), out,\\n\\n static_cast<int>(outSize), nullptr, nullptr);\\n\\n if (length <= 0)\\n\\n return 0;\\n\\n\\n\\n return static_cast<size_t>(length);\\n\\n}\\n\\n\\n\\ntemplate<typename Converter,\\n\\n typename OutputCharTraits = std::char_traits<typename Converter::OutputChar>,\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 27,\n \"score\": 50943.8146029162\n },\n {\n \"content\": \"\\n\\n int length = Math.Min(a.Length, b.Length);\\n\\n int i;\\n\\n for (i = 0; i < length; ++i) {\\n\\n if (a[i] != b[i])\\n\\n break;\\n\\n }\\n\\n\\n\\n return a.Substring(0, i);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Extensions/StringExtensions.cs\",\n \"rank\": 28,\n \"score\": 50938.176251761935\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Xml;\\n\\n using System.Xml.Linq;\\n\\n\\n\\n internal sealed class XElementNamespaceResolver : IXmlNamespaceResolver\\n\\n {\\n\\n private readonly XElement element;\\n\\n\\n\\n public XElementNamespaceResolver(XElement element)\\n\\n {\\n\\n this.element = element;\\n\\n }\\n\\n\\n\\n public IDictionary<string, string> GetNamespacesInScope(XmlNamespaceScope scope)\\n\\n {\\n\\n throw new NotSupportedException();\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/XElementNamespaceResolver.cs\",\n \"rank\": 29,\n \"score\": 50194.11345940599\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Views\\n\\n{\\n\\n using System.Collections.ObjectModel;\\n\\n using System.Linq;\\n\\n using EventTraceKit.Tracing;\\n\\n using EventTraceKit.VsExtension.Extensions;\\n\\n using EventTraceKit.VsExtension.Serialization;\\n\\n\\n\\n [SerializedShape(typeof(Settings.Persistence.SystemCollector))]\\n\\n public class SystemCollectorViewModel : CollectorViewModel\\n\\n {\\n\\n private string name = \\\"System Collector\\\";\\n\\n\\n\\n public SystemCollectorViewModel()\\n\\n {\\n\\n KernelFlags.Add(new KernelFlag(false, \\\"Process\\\", \\\"Process create/delete\\\", 0x00000001));\\n\\n KernelFlags.Add(new KernelFlag(false, \\\"Image Load\\\", \\\"Kernel and user mode Image Load/Unload events\\\", 0x00000004));\\n\\n }\\n\\n\\n\\n public override ITraceSettingsContext Context { get; set; }\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs\",\n \"rank\": 30,\n \"score\": 50191.3271020458\n },\n {\n \"content\": \"\\n\\n public string Name\\n\\n {\\n\\n get => name;\\n\\n set => SetProperty(ref name, value);\\n\\n }\\n\\n\\n\\n public class KernelFlag : ObservableModel\\n\\n {\\n\\n private bool isEnabled;\\n\\n\\n\\n public KernelFlag(bool isEnabled, string name, string description, uint flagValue)\\n\\n {\\n\\n this.isEnabled = isEnabled;\\n\\n this.name = name;\\n\\n this.description = description;\\n\\n FlagValue = flagValue;\\n\\n }\\n\\n\\n\\n public bool IsEnabled\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs\",\n \"rank\": 31,\n \"score\": 50185.54554381572\n },\n {\n \"content\": \"\\n\\n public string LookupNamespace(string prefix)\\n\\n {\\n\\n return element.GetNamespaceOfPrefix(prefix)?.NamespaceName;\\n\\n }\\n\\n\\n\\n public string LookupPrefix(string namespaceName)\\n\\n {\\n\\n return element.GetPrefixOfNamespace(namespaceName);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/XElementNamespaceResolver.cs\",\n \"rank\": 32,\n \"score\": 50184.034355326374\n },\n {\n \"content\": \" {\\n\\n get => isEnabled;\\n\\n set => SetProperty(ref isEnabled, value);\\n\\n }\\n\\n\\n\\n private string name;\\n\\n\\n\\n public string Name\\n\\n {\\n\\n get => name;\\n\\n set => SetProperty(ref name, value);\\n\\n }\\n\\n\\n\\n private string description;\\n\\n\\n\\n public string Description\\n\\n {\\n\\n get => description;\\n\\n set => SetProperty(ref description, value);\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs\",\n \"rank\": 33,\n \"score\": 50179.98622008191\n },\n {\n \"content\": \"\\n\\n public uint FlagValue { get; }\\n\\n }\\n\\n\\n\\n public ObservableCollection<KernelFlag> KernelFlags { get; } =\\n\\n new ObservableCollection<KernelFlag>();\\n\\n\\n\\n public override CollectorViewModel DeepClone()\\n\\n {\\n\\n var clone = new SystemCollectorViewModel();\\n\\n clone.KernelFlags.AddRange(KernelFlags.Select(x => new KernelFlag(x.IsEnabled, x.Name, x.Description, x.FlagValue)));\\n\\n return clone;\\n\\n }\\n\\n\\n\\n public override CollectorDescriptor CreateDescriptor()\\n\\n {\\n\\n var descriptor = new SystemCollectorDescriptor();\\n\\n descriptor.KernelFlags = KernelFlags.Where(x => x.IsEnabled).Aggregate(0u, (a, x) => a | x.FlagValue);\\n\\n return descriptor;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Views/SystemCollectorViewModel.cs\",\n \"rank\": 34,\n \"score\": 50178.35904719005\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Tests.Extensions\\n\\n{\\n\\n using System.Collections.Generic;\\n\\n using EventTraceKit.VsExtension.Extensions;\\n\\n using Xunit;\\n\\n\\n\\n public class StringExtensionsTest\\n\\n {\\n\\n [Theory]\\n\\n [InlineData(null, 0, TrimPosition.End, null)]\\n\\n [InlineData(\\\"1234567890\\\", 0, TrimPosition.End, \\\"\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 0, TrimPosition.Start, \\\"\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 0, TrimPosition.Middle, \\\"\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 1, TrimPosition.End, \\\"…\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 1, TrimPosition.Start, \\\"…\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 1, TrimPosition.Middle, \\\"…\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 2, TrimPosition.End, \\\"1…\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 2, TrimPosition.Start, \\\"…0\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 2, TrimPosition.Middle, \\\"1…\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 5, TrimPosition.End, \\\"1234…\\\")]\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension.Tests/Extensions/StringExtensionsTest.cs\",\n \"rank\": 35,\n \"score\": 50135.97483106294\n },\n {\n \"content\": \" [InlineData(\\\"foo bar\\\", \\\"foo bar (Copy)\\\", new[] { \\\"foo bar\\\" })]\\n\\n [InlineData(\\\"foo bar\\\", \\\"foo bar (Copy 2)\\\", new[] { \\\"foo bar\\\", \\\"foo bar (Copy)\\\" })]\\n\\n [InlineData(\\\"foo bar\\\", \\\"foo bar (Copy 3)\\\", new[] { \\\"foo bar\\\", \\\"foo bar (Copy)\\\", \\\"foo bar (Copy 2)\\\" })]\\n\\n [InlineData(\\\"foo bar\\\", \\\"foo bar (Copy)\\\", new[] { \\\"foo bar\\\", \\\"foo bar (Copy 2)\\\" })]\\n\\n [InlineData(\\\"foo bar\\\", \\\"foo bar (Copy 2)\\\", new[] { \\\"foo bar\\\", \\\"foo bar (Copy)\\\", \\\"foo bar (Copy 3)\\\" })]\\n\\n [InlineData(\\\"foo (Copy)\\\", \\\"foo (Copy)\\\", new[] { \\\"foo\\\" })]\\n\\n [InlineData(\\\"foo (Copy)\\\", \\\"foo (Copy 2)\\\", new[] { \\\"foo (Copy)\\\" })]\\n\\n [InlineData(\\\"foo (Copy 2)\\\", \\\"foo (Copy 3)\\\", new[] { \\\"foo (Copy 2)\\\" })]\\n\\n public void MakeNumberedCopy(string input, string expected, string[] used)\\n\\n {\\n\\n Assert.Equal(expected, input.MakeNumberedCopy(used != null ? new HashSet<string>(used) : null));\\n\\n Assert.Equal(expected, StringExtensions.MakeNumberedCopy(input, used != null ? new HashSet<string>(used) : null));\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension.Tests/Extensions/StringExtensionsTest.cs\",\n \"rank\": 36,\n \"score\": 50132.51345550208\n },\n {\n \"content\": \" [InlineData(\\\"1234567890\\\", 5, TrimPosition.Start, \\\"…7890\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 5, TrimPosition.Middle, \\\"12…90\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 6, TrimPosition.End, \\\"12345…\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 6, TrimPosition.Start, \\\"…67890\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 6, TrimPosition.Middle, \\\"123…90\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 10, TrimPosition.End, \\\"1234567890\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 10, TrimPosition.Start, \\\"1234567890\\\")]\\n\\n [InlineData(\\\"1234567890\\\", 10, TrimPosition.Middle, \\\"1234567890\\\")]\\n\\n public void TrimToLength(string input, int maxLength, TrimPosition position, string expected)\\n\\n {\\n\\n Assert.Equal(expected, input.TrimToLength(maxLength, position));\\n\\n Assert.Equal(expected, StringExtensions.TrimToLength(input, maxLength, position));\\n\\n }\\n\\n\\n\\n [Theory]\\n\\n [InlineData(null, null, null)]\\n\\n [InlineData(\\\"foo\\\", \\\"foo\\\", null)]\\n\\n [InlineData(\\\"foo\\\", \\\"foo\\\", new string[0])]\\n\\n [InlineData(\\\"foo\\\", \\\"foo\\\", new[] { \\\"bar\\\" })]\\n\\n [InlineData(\\\"foo\\\", \\\"foo (Copy)\\\", new[] { \\\"foo\\\" })]\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension.Tests/Extensions/StringExtensionsTest.cs\",\n \"rank\": 37,\n \"score\": 50126.93105395291\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Compilation.Support\\n\\n{\\n\\n using System;\\n\\n using System.IO;\\n\\n using System.IO.MemoryMappedFiles;\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Text;\\n\\n\\n\\n internal sealed class MemoryMappedViewWriter : IDisposable\\n\\n {\\n\\n private readonly FileStream output;\\n\\n\\n\\n private MemoryMappedFile mappedFile;\\n\\n private MemoryMappedViewAccessor accessor;\\n\\n private byte[] stringBuffer = new byte[0x100];\\n\\n private long position;\\n\\n\\n\\n public MemoryMappedViewWriter(FileStream output, long initialCapacity = 0x10000)\\n\\n {\\n\\n this.output = output ?? throw new ArgumentNullException(nameof(output));\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 38,\n \"score\": 49395.749396682455\n },\n {\n \"content\": \" return count;\\n\\n }\\n\\n\\n\\n public void WriteString(ref long offset, string str)\\n\\n {\\n\\n int count = EncodeName(str, ref stringBuffer);\\n\\n WriteArray(ref offset, stringBuffer, 0, count);\\n\\n }\\n\\n\\n\\n public void WriteZString(ref long offset, string str)\\n\\n {\\n\\n // Includes NUL wchar_t.\\n\\n int count = Encoding.Unicode.GetByteCount(str) + 2;\\n\\n if (stringBuffer.Length < count)\\n\\n stringBuffer = new byte[count];\\n\\n\\n\\n int byteCount = Encoding.Unicode.GetBytes(str, 0, str.Length, stringBuffer, 0);\\n\\n for (int i = byteCount; i < count; ++i)\\n\\n stringBuffer[i] = 0;\\n\\n WriteArray(ref offset, stringBuffer, 0, count);\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 39,\n \"score\": 49377.65054421089\n },\n {\n \"content\": \" WriteResource(ref position, ref resource);\\n\\n }\\n\\n\\n\\n private int GetByteCount(string name)\\n\\n {\\n\\n // Count includes NUL and 4-byte length.\\n\\n int count = Encoding.Unicode.GetByteCount(name) + 2 + 4;\\n\\n return (count + 3) & ~3;\\n\\n }\\n\\n\\n\\n private int EncodeName(string name, ref byte[] buf)\\n\\n {\\n\\n int count = GetByteCount(name);\\n\\n if (buf.Length < count)\\n\\n buf = new byte[count];\\n\\n byte[] countBytes = BitConverter.GetBytes((uint)count);\\n\\n Buffer.BlockCopy(countBytes, 0, buf, 0, 4);\\n\\n int byteCount = Encoding.Unicode.GetBytes(name, 0, name.Length, buf, 4);\\n\\n for (int i = 4 + byteCount; i < count; ++i)\\n\\n buf[i] = 0;\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 40,\n \"score\": 49375.2362230816\n },\n {\n \"content\": \"\\n\\n private void Allocate(long newCapacity)\\n\\n {\\n\\n if (accessor != null) {\\n\\n accessor.Dispose();\\n\\n mappedFile.Dispose();\\n\\n }\\n\\n\\n\\n mappedFile = MemoryMappedFile.CreateFromFile(\\n\\n output,\\n\\n null,\\n\\n newCapacity,\\n\\n MemoryMappedFileAccess.ReadWrite,\\n\\n null,\\n\\n HandleInheritability.None,\\n\\n true);\\n\\n\\n\\n accessor = mappedFile.CreateViewAccessor();\\n\\n Capacity = newCapacity;\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 41,\n \"score\": 49373.13984800272\n },\n {\n \"content\": \"\\n\\n private void EnsureSpace(long offset, int byteCount)\\n\\n {\\n\\n long requiredCapacity = offset + byteCount;\\n\\n if (requiredCapacity > Capacity)\\n\\n GrowTo(requiredCapacity);\\n\\n }\\n\\n\\n\\n private void EnsureSpace(int byteCount)\\n\\n {\\n\\n long requiredCapacity = position + byteCount;\\n\\n if (requiredCapacity > Capacity)\\n\\n GrowTo(requiredCapacity);\\n\\n }\\n\\n\\n\\n private void GrowTo(long requiredCapacity)\\n\\n {\\n\\n long newCapacity = Capacity;\\n\\n while (newCapacity < requiredCapacity)\\n\\n newCapacity *= 2;\\n\\n Allocate(newCapacity);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 42,\n \"score\": 49367.68790352438\n },\n {\n \"content\": \"\\n\\n Allocate(initialCapacity);\\n\\n }\\n\\n\\n\\n public long Capacity { get; private set; }\\n\\n\\n\\n public long Position\\n\\n {\\n\\n get => position;\\n\\n set\\n\\n {\\n\\n position = value;\\n\\n if (position > Capacity)\\n\\n GrowTo(position);\\n\\n }\\n\\n }\\n\\n\\n\\n public void Dispose()\\n\\n {\\n\\n accessor.Dispose();\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 43,\n \"score\": 49367.68790352438\n },\n {\n \"content\": \"\\n\\n public void WriteUInt8(byte value)\\n\\n {\\n\\n WriteUInt8(ref position, value);\\n\\n }\\n\\n\\n\\n public void WriteUInt16(ushort value)\\n\\n {\\n\\n WriteUInt16(ref position, value);\\n\\n }\\n\\n\\n\\n public void WriteUInt32(uint value)\\n\\n {\\n\\n WriteUInt32(ref position, value);\\n\\n }\\n\\n\\n\\n public void Align(ref long offset, int alignment)\\n\\n {\\n\\n var mod = (int)(offset % alignment);\\n\\n if (mod == 0)\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 44,\n \"score\": 49367.68790352438\n },\n {\n \"content\": \" }\\n\\n\\n\\n public void WriteArray<T>(T[] values) where T : struct\\n\\n {\\n\\n WriteArray(ref position, values);\\n\\n }\\n\\n\\n\\n public void WriteArray<T>(ref long offset, T[] values) where T : struct\\n\\n {\\n\\n WriteArray(ref offset, values, 0, values.Length);\\n\\n }\\n\\n\\n\\n public void WriteArray<T>(ref long offset, T[] values, int index, int count) where T : struct\\n\\n {\\n\\n int byteCount = count * Marshal.SizeOf<T>();\\n\\n EnsureSpace(offset, byteCount);\\n\\n accessor.WriteArray(offset, values, index, count);\\n\\n offset += byteCount;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 45,\n \"score\": 49367.68790352438\n },\n {\n \"content\": \" mappedFile.Dispose();\\n\\n output.SetLength(Position);\\n\\n }\\n\\n\\n\\n public void Flush()\\n\\n {\\n\\n accessor.Flush();\\n\\n output.Flush();\\n\\n }\\n\\n\\n\\n public void WriteResource<T>(ref long offset, ref T resource) where T : struct\\n\\n {\\n\\n var size = Marshal.SizeOf<T>();\\n\\n EnsureSpace(offset, size);\\n\\n accessor.Write(offset, ref resource);\\n\\n offset += size;\\n\\n }\\n\\n\\n\\n public void WriteResource<T>(ref T resource) where T : struct\\n\\n {\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 46,\n \"score\": 49367.68790352438\n },\n {\n \"content\": \" return;\\n\\n int fill = alignment - mod;\\n\\n for (int i = 0; i < fill; ++i)\\n\\n WriteUInt8(ref offset, 0);\\n\\n }\\n\\n\\n\\n public void Align(int alignment)\\n\\n {\\n\\n Align(ref position, alignment);\\n\\n }\\n\\n\\n\\n public void AlignBlock(long start, ref long offset, int alignment)\\n\\n {\\n\\n var mod = (int)((offset - start) % alignment);\\n\\n if (mod == 0)\\n\\n return;\\n\\n int fill = alignment - mod;\\n\\n for (int i = 0; i < fill; ++i)\\n\\n WriteUInt8(ref offset, 0);\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 47,\n \"score\": 49367.68790352438\n },\n {\n \"content\": \" public void WriteUInt8(ref long offset, byte value)\\n\\n {\\n\\n EnsureSpace(1);\\n\\n accessor.Write(offset, value);\\n\\n offset += 1;\\n\\n }\\n\\n\\n\\n public void WriteUInt16(ref long offset, ushort value)\\n\\n {\\n\\n EnsureSpace(2);\\n\\n accessor.Write(offset, value);\\n\\n offset += 2;\\n\\n }\\n\\n\\n\\n public void WriteUInt32(ref long offset, uint value)\\n\\n {\\n\\n EnsureSpace(offset, 4);\\n\\n accessor.Write(offset, value);\\n\\n offset += 4;\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/MemoryMappedViewWriter.cs\",\n \"rank\": 48,\n \"score\": 49367.68790352438\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Tests.Extensions\\n\\n{\\n\\n using System.Text;\\n\\n using VsExtension.Extensions;\\n\\n using Xunit;\\n\\n\\n\\n public class StringBuilderExtensionsTest\\n\\n {\\n\\n [Theory]\\n\\n [InlineData(0x00, \\\"00\\\")]\\n\\n [InlineData(0x9A, \\\"9A\\\")]\\n\\n [InlineData(0xAB, \\\"AB\\\")]\\n\\n [InlineData(0xFF, \\\"FF\\\")]\\n\\n public void Name(byte input, string expected)\\n\\n {\\n\\n var builder = new StringBuilder();\\n\\n builder.AppendHexByte(input);\\n\\n Assert.Equal(expected, builder.ToString());\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension.Tests/Extensions/StringBuilderExtensionsTest.cs\",\n \"rank\": 49,\n \"score\": 49349.94733895365\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Tests.Internal.Extensions\\n\\n{\\n\\n using EventTraceKit.EventTracing.Internal.Extensions;\\n\\n using Xunit;\\n\\n\\n\\n public class StringExtensionsTest\\n\\n {\\n\\n [Theory]\\n\\n [InlineData(\\\"\\\", \\\"\\\")]\\n\\n [InlineData(\\\"abc\\\", \\\"abc\\\")]\\n\\n [InlineData(\\\"{\\\", \\\"{{\\\")]\\n\\n [InlineData(\\\"abc {0}\\\", \\\"abc {{0}}\\\")]\\n\\n [InlineData(\\\"abc {{0}}\\\", \\\"abc {{{{0}}}}\\\")]\\n\\n [InlineData(\\\"abc {{{0}}}\\\", \\\"abc {{{{{{0}}}}}}\\\")]\\n\\n public static void EscapeFormatting(string input, string expected)\\n\\n {\\n\\n Assert.Equal(expected, input.EscapeFormatting());\\n\\n Assert.Equal(input, string.Format(input.EscapeFormatting(), new object[0]));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing.Tests/Internal/Extensions/StringExtensionsTest.cs\",\n \"rank\": 50,\n \"score\": 49348.27097229085\n },\n {\n \"content\": \" [Theory]\\n\\n [InlineData(null, null, \\\"\\\")]\\n\\n [InlineData(\\\"abc\\\", null, \\\"\\\")]\\n\\n [InlineData(null, \\\"abc\\\", \\\"\\\")]\\n\\n [InlineData(\\\"\\\", \\\"\\\", \\\"\\\")]\\n\\n [InlineData(\\\"abc\\\", \\\"\\\", \\\"\\\")]\\n\\n [InlineData(\\\"\\\", \\\"abc\\\", \\\"\\\")]\\n\\n [InlineData(\\\"abc\\\", \\\"abc\\\", \\\"abc\\\")]\\n\\n [InlineData(\\\"abcX\\\", \\\"abc\\\", \\\"abc\\\")]\\n\\n [InlineData(\\\"abc\\\", \\\"abcX\\\", \\\"abc\\\")]\\n\\n [InlineData(\\\"abcX\\\", \\\"abcY\\\", \\\"abc\\\")]\\n\\n public static void LongestCommonPrefix(string input1, string input2, string expected)\\n\\n {\\n\\n Assert.Equal(expected, StringExtensions.LongestCommonPrefix(input1, input2));\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing.Tests/Internal/Extensions/StringExtensionsTest.cs\",\n \"rank\": 51,\n \"score\": 49340.15827006624\n },\n {\n \"content\": \"struct U8To16Conversion\\n\\n{\\n\\n using InputChar = char;\\n\\n using OutputChar =\\n\\n std::conditional_t<sizeof(wchar_t) == sizeof(char16_t), wchar_t, char16_t>;\\n\\n static bool EstimateLength(InputChar const* source, size_t sourceLength,\\n\\n size_t& outLength) noexcept;\\n\\n static size_t Convert(OutputChar* out, size_t outLength, InputChar const* source,\\n\\n size_t sourceLength) noexcept;\\n\\n};\\n\\n\\n\\nbool U8To16Conversion::EstimateLength(char const* source, size_t sourceLength,\\n\\n size_t& outLength) noexcept\\n\\n{\\n\\n int const length = MultiByteToWideChar(CP_UTF8, 0, source,\\n\\n static_cast<int>(sourceLength), nullptr, 0);\\n\\n if (length <= 0)\\n\\n return false;\\n\\n\\n\\n outLength = static_cast<size_t>(length);\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 52,\n \"score\": 48564.928719895426\n },\n {\n \"content\": \"struct U16To8Conversion\\n\\n{\\n\\n using InputChar =\\n\\n std::conditional_t<sizeof(wchar_t) == sizeof(char16_t), wchar_t, char16_t>;\\n\\n using OutputChar = char;\\n\\n static bool EstimateLength(InputChar const* source, size_t sourceLength,\\n\\n size_t& outLength) noexcept;\\n\\n static size_t Convert(OutputChar* out, size_t outLength, InputChar const* source,\\n\\n size_t sourceLength) noexcept;\\n\\n};\\n\\n\\n\\nbool U16To8Conversion::EstimateLength(wchar_t const* source, size_t sourceLength,\\n\\n size_t& outLength) noexcept\\n\\n{\\n\\n int const length = WideCharToMultiByte(\\n\\n CP_UTF8, 0, source, static_cast<int>(sourceLength), nullptr, 0, nullptr, nullptr);\\n\\n if (length <= 0)\\n\\n return false;\\n\\n\\n\\n outLength = static_cast<size_t>(length);\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/Support/StringConversions.cpp\",\n \"rank\": 53,\n \"score\": 48564.928719895426\n },\n {\n \"content\": \"class string_back_insert_iterator\\n\\n{\\n\\npublic:\\n\\n using iterator_category = std::output_iterator_tag;\\n\\n using value_type = void;\\n\\n using difference_type = void;\\n\\n using pointer = void;\\n\\n using reference = void;\\n\\n\\n\\n using container_type = Container;\\n\\n\\n\\n explicit string_back_insert_iterator(Container& container)\\n\\n : container(std::addressof(container))\\n\\n {}\\n\\n\\n\\n template<typename T>\\n\\n string_back_insert_iterator& operator=(T const& value)\\n\\n {\\n\\n container->push_back(static_cast<typename Container::value_type>(value));\\n\\n return *this;\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Source/EtwTraceProcessor.cpp\",\n \"rank\": 54,\n \"score\": 47822.2375107212\n },\n {\n \"content\": \"namespace etk\\n\\n{\\n\\n\\n\\ninline bool vsprintf(std::wstring& sink, size_t expectedLength, wchar_t const* format,\\n\\n va_list args)\\n\\n{\\n\\n size_t currSize = sink.size();\\n\\n\\n\\n bool measured = false;\\n\\nretry:\\n\\n if (expectedLength == 0) {\\n\\n va_list a;\\n\\n va_copy(a, args);\\n\\n int ret = _scwprintf(format, a);\\n\\n va_end(a);\\n\\n if (ret < 0)\\n\\n return false;\\n\\n if (ret == 0)\\n\\n return true;\\n\\n measured = true;\\n\\n expectedLength = static_cast<size_t>(ret);\\n\\n }\\n\\n\\n\\n if (expectedLength > 0)\\n\\n sink.resize(currSize + expectedLength);\\n\\n\\n\\n int ret = vswprintf(&sink[currSize], expectedLength + 1, format, args);\\n\\n if (ret < 0) {\\n\\n if (measured)\\n\\n return false;\\n\\n expectedLength = 0;\\n\\n goto retry;\\n\\n }\\n\\n\\n\\n size_t written = static_cast<unsigned>(ret);\\n\\n sink.resize(currSize + written);\\n\\n\\n\\n return written <= expectedLength;\\n\\n}\\n\\n\\n\\ninline bool vsprintf(std::wstring& sink, wchar_t const* format, va_list args)\\n\\n{\\n\\n return vsprintf(sink, 0, format, args);\\n\\n}\\n\\n\\n\\ninline bool sprintf(std::wstring& sink, wchar_t const* format, ...)\\n\\n{\\n\\n va_list args;\\n\\n va_start(args, format);\\n\\n bool ret = vsprintf(sink, 0, format, args);\\n\\n va_end(args);\\n\\n return ret;\\n\\n}\\n\\n\\n\\ninline bool sprintf(std::wstring& sink, size_t expectedLength, wchar_t const* format, ...)\\n\\n{\\n\\n va_list args;\\n\\n va_start(args, format);\\n\\n bool ret = vsprintf(sink, expectedLength, format, args);\\n\\n va_end(args);\\n\\n return ret;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Public/etk/Support/StringFormat.h\",\n \"rank\": 55,\n \"score\": 46402.97938446688\n },\n {\n \"content\": \"namespace etk\\n\\n{\\n\\n\\n\\nbool U8To16(std::string_view source, std::wstring& output);\\n\\nstd::wstring U8To16(std::string_view source);\\n\\n\\n\\nbool U16To8(std::wstring_view source, std::string& output);\\n\\nstd::string U16To8(std::wstring_view source);\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EtwCore/Public/etk/Support/StringConversions.h\",\n \"rank\": 56,\n \"score\": 46402.97938446688\n },\n {\n \"content\": \"struct EmcGenStaticProviderList\\n\\n{\\n\\n struct Entry\\n\\n {\\n\\n using FunctionType = ULONG();\\n\\n FunctionType* Register;\\n\\n FunctionType* Unregister;\\n\\n };\\n\\n\\n\\n /// <summary>\\n\\n /// Registers all enlisted static providers with ETW.\\n\\n /// </summary>\\n\\n static inline ULONG RegisterAll()\\n\\n {\\n\\n ULONG result = 0;\\n\\n for (auto it = &first + 1; it < &last; ++it) {\\n\\n if (*it) {\\n\\n ULONG const ec = (*it)->Register();\\n\\n if (ec != 0 && result == 0)\\n\\n result = ec;\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/CodeGen/CxxCodeGenerator.cs\",\n \"rank\": 57,\n \"score\": 45776.487244793156\n },\n {\n \"content\": \"#define MSG_UnexpectedSWFallback_OutOfVideoMemory 0xD000000EL\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing.Tests/Compilation/ResGen/TestCases/wpf-etw.h\",\n \"rank\": 58,\n \"score\": 41509.7684727525\n },\n {\n \"content\": \"#define MSG_UnexpectedSWFallback_OutOfVideoMemory 0xD000000EL\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing.Tests/Compilation/ResGen/TestCases/wpf-etw.wevt.v3-8.1-compat.h\",\n \"rank\": 59,\n \"score\": 39921.191414375666\n },\n {\n \"content\": \"#include <sdkddkver.h>\\n\\n#undef _WIN32_WINNT\\n\\n#define _WIN32_WINNT _WIN32_WINNT_WINBLUE\\n\\n\\n\\n#include \\\"etk/ADT/VarStructPtr.h\\\"\\n\\n#include \\\"etk/Support/CompilerSupport.h\\\"\\n\\n#include \\\"InteropHelper.h\\\"\\n\\n\\n\\n#include <memory>\\n\\n#include <windows.h>\\n\\n#include <tdh.h>\\n\\n\\n\\nusing namespace System;\\n\\nusing namespace System::Collections::Generic;\\n\\nusing namespace System::ComponentModel;\\n\\nusing namespace System::Runtime::InteropServices;\\n\\nusing namespace System::Threading;\\n\\nusing msclr::interop::marshal_as;\\n\\n\\n\\nnamespace\\n\",\n \"file_path\": \"src/EventTraceKit.Etw/ManifestInfo.cpp\",\n \"rank\": 61,\n \"score\": 39.49312747538503\n },\n {\n \"content\": \"#include \\\"TraceLog.h\\\"\\n\\n#include <msclr/marshal_cppstd.h>\\n\\n\\n\\nusing namespace System;\\n\\nusing namespace System::ComponentModel;\\n\\nusing namespace System::Runtime::InteropServices;\\n\\nusing msclr::interop::marshal_as;\\n\\n\\n\\nnamespace EventTraceKit::Tracing\\n\\n{\\n\\n\\n\\nnamespace\\n\\n{\\n\\n\\n\\netk::TraceLogFilterEvent* GetNativeFunctionPtr(TraceLogFilterPredicate^ filter)\\n\\n{\\n\\n if (!filter) return nullptr;\\n\\n return static_cast<etk::TraceLogFilterEvent*>(\\n\\n Marshal::GetFunctionPointerForDelegate(filter).ToPointer());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.Etw/TraceLog.cpp\",\n \"rank\": 62,\n \"score\": 36.3403069879213\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Tests\\n\\n{\\n\\n using System.Collections.Generic;\\n\\n using System.IO;\\n\\n using System.Linq;\\n\\n using System.Xml.Linq;\\n\\n\\n\\n public static class TestExtensions\\n\\n {\\n\\n public static IEnumerable<XAttribute> NonXmlnsAttributes(this XElement element)\\n\\n {\\n\\n return element.Attributes().Where(x => !IsXmlns(x.Name));\\n\\n }\\n\\n\\n\\n public static bool IsXmlns(this XName name)\\n\\n {\\n\\n return name.LocalName == \\\"xmlns\\\" || name.Namespace == XNamespace.Xmlns;\\n\\n }\\n\\n\\n\\n public static string ReadFullyAsString(this MemoryStream stream)\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension.Tests/TestExtensions.cs\",\n \"rank\": 63,\n \"score\": 35.417189459732825\n },\n {\n \"content\": \"#include \\\"WatchDog.h\\\"\\n\\n\\n\\nusing namespace System;\\n\\nusing namespace System::Diagnostics;\\n\\nusing namespace System::IO;\\n\\nusing namespace System::Reflection;\\n\\nusing namespace System::Text;\\n\\nusing namespace System::Threading;\\n\\nusing namespace Microsoft::Win32::SafeHandles;\\n\\n\\n\\nnamespace EventTraceKit\\n\\n{\\n\\n\\n\\nstatic String^ GetAssemblyFilePath(Assembly^ assembly)\\n\\n{\\n\\n String^ path = (gcnew Uri(assembly->CodeBase))->AbsolutePath;\\n\\n path = Uri::UnescapeDataString(path);\\n\\n return Path::GetFullPath(path);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.Etw/WatchDog.cpp\",\n \"rank\": 64,\n \"score\": 32.29979067276252\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Windows\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Linq;\\n\\n using System.Reflection;\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Windows;\\n\\n using System.Windows.Controls.Primitives;\\n\\n using System.Windows.Data;\\n\\n using System.Windows.Interop;\\n\\n using System.Windows.Media;\\n\\n\\n\\n public static class FrameworkExtensions\\n\\n {\\n\\n private static readonly Func<DependencyObject, DependencyObject, bool> MenuBase_IsDescendant;\\n\\n\\n\\n static FrameworkExtensions()\\n\\n {\\n\\n MenuBase_IsDescendant = (Func<DependencyObject, DependencyObject, bool>)\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Windows/FrameworkExtensions.cs\",\n \"rank\": 65,\n \"score\": 31.986385075150743\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Native\\n\\n{\\n\\n using System;\\n\\n using System.Diagnostics;\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Text;\\n\\n using Microsoft.VisualStudio.Shell.Interop;\\n\\n using FILETIME = System.Runtime.InteropServices.ComTypes.FILETIME;\\n\\n\\n\\n internal static class NativeMethods\\n\\n {\\n\\n public const int ERROR_NOT_SAME_DEVICE = 17;\\n\\n\\n\\n [DllImport(\\\"user32.dll\\\")]\\n\\n public static extern IntPtr GetCapture();\\n\\n\\n\\n [DllImport(\\\"user32.dll\\\")]\\n\\n [return: MarshalAs(UnmanagedType.Bool)]\\n\\n public static extern bool GetWindowRect(IntPtr hwnd, out RECT lpRect);\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Native/NativeMethods.cs\",\n \"rank\": 66,\n \"score\": 31.22312218599959\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Serialization\\n\\n{\\n\\n using System.Collections.Generic;\\n\\n using System.IO;\\n\\n\\n\\n public static class XamlSerializerExtensions\\n\\n {\\n\\n public static MemoryStream SaveToStream(\\n\\n this IXamlSerializer serializer, object element)\\n\\n {\\n\\n var stream = new MemoryStream();\\n\\n serializer.Save(element, stream);\\n\\n stream.Position = 0;\\n\\n return stream;\\n\\n }\\n\\n\\n\\n public static string SaveToString(\\n\\n this IXamlSerializer serializer, object element)\\n\\n {\\n\\n using var stream = serializer.SaveToStream(element);\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Serialization/XamlSerializerExtensions.cs\",\n \"rank\": 67,\n \"score\": 30.449246813457748\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal.Extensions\\n\\n{\\n\\n using System;\\n\\n using System.IO;\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Text;\\n\\n\\n\\n internal static class BinaryReaderExtensions\\n\\n {\\n\\n public static string ReadPaddedString(this BinaryReader reader, uint byteCount)\\n\\n {\\n\\n return reader.ReadPaddedString(Encoding.ASCII, byteCount);\\n\\n }\\n\\n\\n\\n public static string ReadPaddedString(this BinaryReader reader, Encoding encoding, uint byteCount)\\n\\n {\\n\\n var bytes = new byte[byteCount];\\n\\n reader.Read(bytes, 0, bytes.Length);\\n\\n return encoding.GetString(bytes).TrimEnd('\\\\0');\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Extensions/BinaryReaderExtensions.cs\",\n \"rank\": 68,\n \"score\": 29.561530428580355\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal.Native\\n\\n{\\n\\n using System;\\n\\n using System.Runtime.ConstrainedExecution;\\n\\n using System.Runtime.InteropServices;\\n\\n\\n\\n public static class NativeMethods\\n\\n {\\n\\n public const int MESSAGE_RESOURCE_UNICODE = 1;\\n\\n\\n\\n [DllImport(\\\"kernel32.dll\\\")]\\n\\n [ReliabilityContract(Consistency.WillNotCorruptState, Cer.Success)]\\n\\n public static extern IntPtr LocalFree(IntPtr hMem);\\n\\n\\n\\n [DllImport(\\\"advapi32.dll\\\", CharSet = CharSet.Unicode, SetLastError = true)]\\n\\n private static extern bool ConvertStringSecurityDescriptorToSecurityDescriptor(\\n\\n string StringSecurityDescriptor,\\n\\n uint StringSDRevision,\\n\\n out SafeLocalMemHandle pSecurityDescriptor,\\n\\n out uint SecurityDescriptorSize);\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Native/NativeMethods.cs\",\n \"rank\": 69,\n \"score\": 29.466591133085288\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal.Native\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Runtime.ConstrainedExecution;\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Security;\\n\\n\\n\\n [SecurityCritical]\\n\\n [SuppressUnmanagedCodeSecurity]\\n\\n internal static class UnsafeNativeMethods\\n\\n {\\n\\n public const short RT_RCDATA = 10;\\n\\n public const short RT_MESSAGETABLE = 11;\\n\\n public const short RT_HTML = 23;\\n\\n\\n\\n public static bool IS_INTRESOURCE(IntPtr ptr)\\n\\n {\\n\\n return (ptr.ToInt64() >> 16) == 0;\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Native/UnsafeNativeMethods.cs\",\n \"rank\": 70,\n \"score\": 28.870623469308427\n },\n {\n \"content\": \"namespace EventManifestCompiler.Build.Tasks.Tests\\n\\n{\\n\\n using System.Collections.Generic;\\n\\n using System.Text;\\n\\n\\n\\n public static class CommandLineUtils\\n\\n {\\n\\n public static IEnumerable<string> EnumerateCommandLineArgs(string commandLine)\\n\\n {\\n\\n if (string.IsNullOrEmpty(commandLine))\\n\\n yield break;\\n\\n\\n\\n int backslashCount = 0;\\n\\n bool inQuotes = false;\\n\\n\\n\\n var buffer = new StringBuilder();\\n\\n for (int i = 0; i < commandLine.Length; ++i) {\\n\\n char c = commandLine[i];\\n\\n switch (c) {\\n\\n case '\\\"':\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks.Tests/CommandLineUtils.cs\",\n \"rank\": 71,\n \"score\": 28.38219170712814\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension\\n\\n{\\n\\n using System;\\n\\n using System.Diagnostics;\\n\\n using Microsoft.VisualStudio.Shell;\\n\\n using Microsoft.VisualStudio.Shell.Interop;\\n\\n\\n\\n public static class MessageHelper\\n\\n {\\n\\n public static void ShowWarningMessage(string message, string title)\\n\\n {\\n\\n VsShellUtilities.ShowMessageBox(\\n\\n ServiceProvider.GlobalProvider,\\n\\n message,\\n\\n title,\\n\\n OLEMSGICON.OLEMSGICON_WARNING,\\n\\n OLEMSGBUTTON.OLEMSGBUTTON_OK,\\n\\n OLEMSGDEFBUTTON.OLEMSGDEFBUTTON_FIRST);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/MessageHelper.cs\",\n \"rank\": 72,\n \"score\": 28.352078940179602\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal.Native\\n\\n{\\n\\n using System;\\n\\n using System.Globalization;\\n\\n using System.Runtime.InteropServices;\\n\\n\\n\\n internal sealed class ResourceName\\n\\n {\\n\\n public ResourceName(short id)\\n\\n {\\n\\n Id = id;\\n\\n }\\n\\n\\n\\n public ResourceName(string name)\\n\\n {\\n\\n Name = name;\\n\\n }\\n\\n\\n\\n public static ResourceName FromPtr(IntPtr ptr)\\n\\n {\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Native/ResourceName.cs\",\n \"rank\": 73,\n \"score\": 28.28805060000025\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal\\n\\n{\\n\\n using System.Collections.Generic;\\n\\n using System.IO;\\n\\n using System.Linq;\\n\\n\\n\\n internal static class WindowsSdkUtils\\n\\n {\\n\\n public static string FindSdkPath()\\n\\n {\\n\\n return EnumerateSdkIncludePaths().FirstOrDefault(Directory.Exists);\\n\\n }\\n\\n\\n\\n public static IEnumerable<string> EnumerateSdkIncludePaths()\\n\\n {\\n\\n var winKits10 = new DirectoryInfo(@\\\"C:\\\\Program Files (x86)\\\\Windows Kits\\\\10\\\\Include\\\");\\n\\n foreach (var dir in winKits10.EnumerateDirectories().Reverse()) {\\n\\n var path = Path.Combine(dir.FullName, \\\"um\\\");\\n\\n if (Directory.Exists(path))\\n\\n yield return path;\\n\\n }\\n\\n\\n\\n yield return @\\\"C:\\\\Program Files (x86)\\\\Windows Kits\\\\8.1\\\\Include\\\\um\\\";\\n\\n yield return @\\\"C:\\\\Program Files (x86)\\\\Windows Kits\\\\8.0\\\\Include\\\\um\\\";\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/WindowsSdkUtils.cs\",\n \"rank\": 74,\n \"score\": 28.134526690769842\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal.Extensions\\n\\n{\\n\\n using System.Xml;\\n\\n using System.Xml.Linq;\\n\\n using System.Xml.Schema;\\n\\n\\n\\n internal static class XmlExtensions\\n\\n {\\n\\n public static void Add(\\n\\n this XmlSchemaSet set, XNamespace targetNamespace, string schemaUri)\\n\\n {\\n\\n set.Add(targetNamespace.NamespaceName, schemaUri);\\n\\n }\\n\\n\\n\\n public static void AddNamespace(\\n\\n this XmlNamespaceManager nsmgr, string prefix, XNamespace ns)\\n\\n {\\n\\n nsmgr.AddNamespace(prefix, ns.NamespaceName);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Extensions/XmlExtensions.cs\",\n \"rank\": 75,\n \"score\": 28.09659831820796\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension\\n\\n{\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Windows;\\n\\n\\n\\n public static class ClipboardUtils\\n\\n {\\n\\n public static bool TryGet<T>(out T value, out string text)\\n\\n where T : class\\n\\n {\\n\\n value = default;\\n\\n text = default;\\n\\n\\n\\n var dataObj = Clipboard.GetDataObject();\\n\\n if (dataObj == null)\\n\\n return false;\\n\\n\\n\\n if (dataObj.GetDataPresent(typeof(T)))\\n\\n value = (T)dataObj.GetData(typeof(T));\\n\\n if (dataObj.GetDataPresent(DataFormats.UnicodeText, true))\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/ClipboardUtils.cs\",\n \"rank\": 76,\n \"score\": 27.999257763081683\n },\n {\n \"content\": \"#include <cstdio>\\n\\n#include <string>\\n\\n#include <string_view>\\n\\n\\n\\n#include <fcntl.h>\\n\\n#include <io.h>\\n\\n#include <objbase.h>\\n\\n#include <psapi.h>\\n\\n#include <windows.h>\\n\\n\\n\\nusing namespace std::literals;\\n\\n\\n\\nnamespace\\n\\n{\\n\\n\\n\\nbool Consume(wchar_t const*& p, wchar_t chr)\\n\\n{\\n\\n if (*p != chr)\\n\\n return false;\\n\\n\\n\",\n \"file_path\": \"src/TraceLaunch.x86/Main.cpp\",\n \"rank\": 77,\n \"score\": 27.771248923616497\n },\n {\n \"content\": \"namespace EventManifestCompiler.Build.Tasks\\n\\n{\\n\\n using System;\\n\\n using System.IO;\\n\\n using System.Security;\\n\\n using Microsoft.Build.Framework;\\n\\n using Microsoft.Build.Utilities;\\n\\n\\n\\n internal static class FileUtilities\\n\\n {\\n\\n internal static string GetTemporaryFile()\\n\\n {\\n\\n return GetTemporaryFile(\\\".tmp\\\");\\n\\n }\\n\\n\\n\\n internal static string GetTemporaryFile(string extension)\\n\\n {\\n\\n return GetTemporaryFile(null, extension);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/FileUtilities.cs\",\n \"rank\": 78,\n \"score\": 27.66754230879425\n },\n {\n \"content\": \"namespace EventManifestCompiler.Build.Tasks\\n\\n{\\n\\n using System;\\n\\n using System.IO;\\n\\n\\n\\n internal static class ErrorUtilities\\n\\n {\\n\\n internal static void ThrowInternalError(string message, params object[] args)\\n\\n {\\n\\n //throw new InternalErrorException(ResourceUtilities.FormatString(message, args));\\n\\n throw new Exception(string.Format(message, args));\\n\\n }\\n\\n\\n\\n internal static void ThrowInternalError(string message, Exception innerException, params object[] args)\\n\\n {\\n\\n //throw new InternalErrorException(ResourceUtilities.FormatString(message, args), innerException);\\n\\n throw new Exception(string.Format(message, args), innerException);\\n\\n }\\n\\n\\n\\n internal static void VerifyThrow(bool condition, string unformattedMessage)\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/ErrorUtilities.cs\",\n \"rank\": 79,\n \"score\": 26.596582588484225\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Native\\n\\n{\\n\\n using System;\\n\\n using System.Runtime.InteropServices;\\n\\n using Microsoft.Win32.SafeHandles;\\n\\n\\n\\n internal sealed class SafeBstrHandle : SafeHandleZeroOrMinusOneIsInvalid\\n\\n {\\n\\n private SafeBstrHandle(IntPtr handle) : base(true)\\n\\n {\\n\\n SetHandle(handle);\\n\\n }\\n\\n\\n\\n public static SafeBstrHandle Create(string str)\\n\\n {\\n\\n return new SafeBstrHandle(Marshal.StringToBSTR(str));\\n\\n }\\n\\n\\n\\n public unsafe UnmanagedString Get()\\n\\n {\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Native/SafeBstrHandle.cs\",\n \"rank\": 80,\n \"score\": 26.54624766242958\n },\n {\n \"content\": \"namespace Xunit.Sdk\\n\\n{\\n\\n using System;\\n\\n using System.Collections;\\n\\n using System.Collections.Generic;\\n\\n using System.Globalization;\\n\\n using System.Linq;\\n\\n using System.Reflection;\\n\\n using System.Text;\\n\\n using EventTraceKit.EventTracing.Tests.Compilation.TestSupport;\\n\\n\\n\\n internal class SequenceEqualException : EqualException\\n\\n {\\n\\n private static readonly Dictionary<char, string> Encodings = new Dictionary<char, string> {\\n\\n { '\\\\r', \\\"\\\\\\\\r\\\" },\\n\\n { '\\\\n', \\\"\\\\\\\\n\\\" },\\n\\n { '\\\\t', \\\"\\\\\\\\t\\\" },\\n\\n { '\\\\0', \\\"\\\\\\\\0\\\" }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing.Tests/Compilation/TestSupport/SequenceEqualException.cs\",\n \"rank\": 81,\n \"score\": 26.41011911829444\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Extensions\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Linq;\\n\\n using System.Runtime.InteropServices;\\n\\n using EnvDTE;\\n\\n using EnvDTE80;\\n\\n using Microsoft.VisualStudio;\\n\\n using Microsoft.VisualStudio.Shell;\\n\\n using Microsoft.VisualStudio.Shell.Interop;\\n\\n\\n\\n internal static class DteExtensions\\n\\n {\\n\\n public static IEnumerable<Project> ProjectsRecursive(this Solution solution)\\n\\n {\\n\\n return solution.Projects.Cast<Project>().SelectMany(EnumerateProject);\\n\\n }\\n\\n\\n\\n private static IEnumerable<Project> EnumerateProject(Project project)\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Extensions/DteExtensions.cs\",\n \"rank\": 82,\n \"score\": 26.328013542766143\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Views.PresetManager\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Linq;\\n\\n using System.Threading.Tasks;\\n\\n using System.Windows;\\n\\n using EventTraceKit.VsExtension.Windows;\\n\\n\\n\\n public partial class PresetSaveAsDialog\\n\\n {\\n\\n private readonly IEnumerable<string> builtInPresetNames;\\n\\n private AsyncDelegateCommand saveCommand;\\n\\n\\n\\n public static readonly DependencyProperty CanExecuteProperty =\\n\\n DependencyProperty.Register(\\n\\n nameof(CanExecute),\\n\\n typeof(bool),\\n\\n typeof(PresetSaveAsDialog),\\n\\n new PropertyMetadata(\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Views/PresetManager/PresetSaveAsDialog.xaml.cs\",\n \"rank\": 83,\n \"score\": 26.021238910440236\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Views\\n\\n{\\n\\n using System;\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Windows;\\n\\n using System.Windows.Interop;\\n\\n using EventTraceKit.VsExtension.Extensions;\\n\\n using Microsoft.VisualStudio.Shell;\\n\\n using Microsoft.VisualStudio.Shell.Interop;\\n\\n using Microsoft.Win32;\\n\\n using Microsoft.Windows.TaskDialogs;\\n\\n\\n\\n public static class VsModalExtensions\\n\\n {\\n\\n public static TaskDialogResult ShowModal(this TaskDialog dialog)\\n\\n {\\n\\n dialog.OwnerWindow = new HandleRef(null, GetDialogOwnerHwnd());\\n\\n return dialog.Show();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Views/VsModalExtensions.cs\",\n \"rank\": 84,\n \"score\": 25.90072408731532\n },\n {\n \"content\": \"namespace CoreConsoleApp\\n\\n{\\n\\n using System;\\n\\n using System.Threading;\\n\\n\\n\\n public class Program\\n\\n {\\n\\n public static void Main(string[] args)\\n\\n {\\n\\n for (int i = 0; i < 50; ++i) {\\n\\n Console.WriteLine(\\\"CoreConsoleApp {0}\\\", i);\\n\\n Thread.Sleep(1000);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"test/CoreConsoleApp/Program.cs\",\n \"rank\": 85,\n \"score\": 25.857268050069848\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension\\n\\n{\\n\\n using System;\\n\\n using System.Globalization;\\n\\n using System.Linq;\\n\\n using System.Runtime.InteropServices;\\n\\n using System.Windows;\\n\\n using System.Windows.Markup;\\n\\n using System.Windows.Media;\\n\\n using Microsoft.VisualStudio;\\n\\n using Microsoft.VisualStudio.Settings;\\n\\n using Microsoft.VisualStudio.Shell;\\n\\n using Microsoft.VisualStudio.Shell.Interop;\\n\\n using Microsoft.VisualStudio.Shell.Settings;\\n\\n using Microsoft.VisualStudio.TextManager.Interop;\\n\\n using Native;\\n\\n using IServiceProvider = Microsoft.VisualStudio.OLE.Interop.IServiceProvider;\\n\\n\\n\\n public static class FontUtils\\n\\n {\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/FontAndColorsHelper.cs\",\n \"rank\": 86,\n \"score\": 25.82344818629604\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Compilation.Support\\n\\n{\\n\\n using System.IO;\\n\\n using System.Text;\\n\\n using System.Threading;\\n\\n\\n\\n internal static class IO\\n\\n {\\n\\n private static UTF8Encoding utf8WithBOM;\\n\\n private static UTF8Encoding utf8NoBOM;\\n\\n\\n\\n private static Encoding UTF8BOM\\n\\n {\\n\\n get\\n\\n {\\n\\n if (utf8WithBOM == null) {\\n\\n var encoding = new UTF8Encoding(false, true);\\n\\n Thread.MemoryBarrier();\\n\\n utf8WithBOM = encoding;\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/Support/IO.cs\",\n \"rank\": 87,\n \"score\": 25.620577226254124\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.UITests\\n\\n{\\n\\n using System;\\n\\n using System.Collections;\\n\\n using System.Collections.Generic;\\n\\n using System.Linq;\\n\\n using System.Threading.Tasks;\\n\\n using System.Windows;\\n\\n using System.Windows.Controls;\\n\\n using EventTraceKit.VsExtension.Windows;\\n\\n using Microsoft.VisualStudio.Threading;\\n\\n using Xunit;\\n\\n\\n\\n public class BindTest\\n\\n {\\n\\n private const string SpecialItemValue = \\\"<special>\\\";\\n\\n\\n\\n private static IEnumerable<string> NextItems(Random rng, int count)\\n\\n {\\n\\n var list = Enumerable.Range(0, count).Select(x => rng.Next().ToString()).ToList();\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension.UITests/BindTest.cs\",\n \"rank\": 88,\n \"score\": 25.384785486282603\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Extensions\\n\\n{\\n\\n using System;\\n\\n using System.Xml.Linq;\\n\\n\\n\\n public static class XElementExtensions\\n\\n {\\n\\n public static string AsString(this XAttribute attribute)\\n\\n {\\n\\n return attribute?.Value;\\n\\n }\\n\\n\\n\\n public static byte? AsByte(this XAttribute attribute)\\n\\n {\\n\\n if (attribute != null && byte.TryParse(attribute.Value, out byte value))\\n\\n return value;\\n\\n return null;\\n\\n }\\n\\n\\n\\n public static ushort? AsUShort(this XAttribute attribute)\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Extensions/XElementExtensions.cs\",\n \"rank\": 89,\n \"score\": 25.351287370805956\n },\n {\n \"content\": \"namespace EventManifestCompiler\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.ComponentModel;\\n\\n using System.ComponentModel.Composition;\\n\\n using System.ComponentModel.Composition.Hosting;\\n\\n using System.Diagnostics;\\n\\n using System.IO;\\n\\n using System.Linq;\\n\\n using System.Reflection;\\n\\n using EventManifestCompiler.Support;\\n\\n using EventTraceKit.EventTracing.Compilation.CodeGen;\\n\\n using EventTraceKit.EventTracing.Support;\\n\\n using NOption;\\n\\n\\n\\n public static class Program\\n\\n {\\n\\n public static int Main(string[] args)\\n\\n {\\n\",\n \"file_path\": \"src/EventManifestCompiler/Program.cs\",\n \"rank\": 90,\n \"score\": 25.312860491090685\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Compilation.CodeGen\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Linq;\\n\\n using System.Text;\\n\\n\\n\\n internal static class CodeGenUtils\\n\\n {\\n\\n public static IEnumerable<int> CodePoints(this string str)\\n\\n {\\n\\n for (int i = 0; i < str.Length;) {\\n\\n int cp;\\n\\n if (char.IsSurrogate(str, i)) {\\n\\n cp = char.ConvertToUtf32(str, i);\\n\\n i += 2;\\n\\n } else {\\n\\n cp = str[i];\\n\\n ++i;\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Compilation/CodeGen/CodeGenUtils.cs\",\n \"rank\": 91,\n \"score\": 25.289714639596014\n },\n {\n \"content\": \"namespace EventManifestCompiler.Build.Tasks\\n\\n{\\n\\n using System;\\n\\n using System.IO;\\n\\n using System.Security;\\n\\n\\n\\n internal static class ExceptionHandling\\n\\n {\\n\\n internal static bool NotExpectedException(Exception ex)\\n\\n {\\n\\n return\\n\\n !(ex is UnauthorizedAccessException) &&\\n\\n !(ex is NotSupportedException) &&\\n\\n (!(ex is ArgumentException) || ex is ArgumentNullException) &&\\n\\n !(ex is SecurityException) &&\\n\\n !(ex is IOException);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventManifestCompiler.Build.Tasks/ExceptionHandling.cs\",\n \"rank\": 92,\n \"score\": 24.975498336930613\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Formatting\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.Linq;\\n\\n using System.Reflection;\\n\\n\\n\\n public static class FormatProviderExtensions\\n\\n {\\n\\n public static string DefaultFormat(\\n\\n this IFormatProvider formatProvider)\\n\\n {\\n\\n return formatProvider?.GetType()\\n\\n .GetCustomAttribute<DefaultFormatAttribute>(true)?.DefaultFormat;\\n\\n }\\n\\n\\n\\n public static SupportedFormat DefaultSupportedFormat(\\n\\n this IFormatProvider formatProvider)\\n\\n {\\n\\n if (formatProvider == null)\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Formatting/FormatProviderExtensions.cs\",\n \"rank\": 93,\n \"score\": 24.923327334296108\n },\n {\n \"content\": \"namespace EventTraceKit.EventTracing.Internal.Native\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n using System.ComponentModel;\\n\\n using System.IO;\\n\\n using System.Runtime.InteropServices;\\n\\n\\n\\n internal static class SafeModuleHandleExtensions\\n\\n {\\n\\n public static List<ResourceName> GetResourceTypes(this SafeModuleHandle module)\\n\\n {\\n\\n return UnsafeNativeMethods.GetResourceTypesEx(module);\\n\\n }\\n\\n\\n\\n public static List<ResourceName> GetResourceNames(this SafeModuleHandle module, ResourceName type)\\n\\n {\\n\\n return UnsafeNativeMethods.GetResourceNamesEx(module, type);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/EventTraceKit.EventTracing/Internal/Native/SafeModuleHandleExtensions.cs\",\n \"rank\": 95,\n \"score\": 24.592216894510592\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Windows\\n\\n{\\n\\n using System.Windows;\\n\\n using Extensions;\\n\\n\\n\\n public static class ValidateValueCallbacks\\n\\n {\\n\\n private static bool IsFiniteDoubleImpl(object value)\\n\\n {\\n\\n return value is double d && d.IsFinite();\\n\\n }\\n\\n\\n\\n public static ValidateValueCallback IsFiniteDouble { get; } = IsFiniteDoubleImpl;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Windows/ValidateValueCallbacks.cs\",\n \"rank\": 96,\n \"score\": 24.51298787185155\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension.Extensions\\n\\n{\\n\\n using System;\\n\\n using System.Collections.Generic;\\n\\n\\n\\n internal static class ComparisonUtils\\n\\n {\\n\\n public static bool CompareValueT<T>(\\n\\n out int cmp, T first, T second) where T : struct, IComparable<T>\\n\\n {\\n\\n cmp = first.CompareTo(second);\\n\\n return cmp == 0;\\n\\n }\\n\\n\\n\\n public static bool Compare<T>(out int cmp, T first, T second)\\n\\n where T : IComparable\\n\\n {\\n\\n cmp = first.CompareTo(second);\\n\\n return cmp == 0;\\n\\n }\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/Extensions/ComparisonUtils.cs\",\n \"rank\": 97,\n \"score\": 24.441652349838826\n },\n {\n \"content\": \"namespace EventTraceKit.VsExtension\\n\\n{\\n\\n using System;\\n\\n using System.Threading.Tasks;\\n\\n using System.Windows.Input;\\n\\n\\n\\n public class AsyncDelegateCommand : ICommand\\n\\n {\\n\\n private static readonly Func<bool> CanAlwaysExecute = () => true;\\n\\n private readonly Func<Task> execute;\\n\\n private readonly Func<bool> canExecute;\\n\\n private bool isExecuting;\\n\\n\\n\\n public AsyncDelegateCommand(Func<Task> execute)\\n\\n : this(execute, CanAlwaysExecute)\\n\\n {\\n\\n }\\n\\n\\n\\n public AsyncDelegateCommand(\\n\\n Func<Task> execute, Func<bool> canExecute)\\n\",\n \"file_path\": \"src/EventTraceKit.VsExtension/AsyncDelegateCommand.cs\",\n \"rank\": 98,\n \"score\": 24.380954199212148\n },\n {\n \"content\": \"namespace PerfRunner\\n\\n{\\n\\n using System;\\n\\n using System.Runtime.InteropServices;\\n\\n\\n\\n internal sealed class CoTaskMemHandle : SafeHandle\\n\\n {\\n\\n public CoTaskMemHandle(IntPtr handle)\\n\\n : base(handle, true)\\n\\n {\\n\\n }\\n\\n\\n\\n public override bool IsInvalid => handle == IntPtr.Zero;\\n\\n\\n\\n public static CoTaskMemHandle Allocate(int size)\\n\\n {\\n\\n var buffer = Marshal.AllocCoTaskMem(size);\\n\\n return new CoTaskMemHandle(buffer);\\n\\n }\\n\\n\\n\\n protected override bool ReleaseHandle()\\n\\n {\\n\\n Marshal.FreeCoTaskMem(handle);\\n\\n return true;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/PerfRunner/CoTaskMemHandle.cs\",\n \"rank\": 99,\n \"score\": 24.275686108896927\n }\n]","isConversational":false}}},{"rowIdx":462,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"export/windows/cpp/obj/src/haxe/Timer.cpp"},"repo_name":{"kind":"string","value":"TinyPlanetStudios/Project-Crash-Land"},"commit":{"kind":"string","value":"365f196be4212602d32251566f26b53fb70693f6"},"file_code":{"kind":"string","value":"\n#include <hxcpp.h>\n\n#ifndef INCLUDED_haxe_Log\n#include <haxe/Log.h>\n#endif\n#ifndef INCLUDED_haxe_Timer\n#include <haxe/Timer.h>\n#endif\n#ifndef INCLUDED_openfl__legacy_Lib\n#include <openfl/_legacy/Lib.h>\n#endif\n\nnamespace haxe{\n\nvoid Timer_obj::__construct(Float time){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"new\",0x4136b0cf,\"haxe.Timer.new\",\"haxe/Timer.hx\",210,0x1a690682)\n \tHX_STACK_THIS(this)\n \tHX_STACK_ARG(time,\"time\")\nHXLINE( 212)\t\tthis->mTime = time;\nHXLINE( 213)\t\t::haxe::Timer_obj::sRunningTimers->push(hx::ObjectPtr<OBJ_>(this));\nHXLINE( 214)\t\tFloat _hx_tmp = ::haxe::Timer_obj::getMS();\nHXDLIN( 214)\t\tthis->mFireAt = (_hx_tmp + this->mTime);\nHXLINE( 215)\t\tthis->mRunning = true;\n \t}\n\nDynamic Timer_obj::__CreateEmpty() { return new Timer_obj; }\n\nhx::ObjectPtr< Timer_obj > Timer_obj::__new(Float time)\n{\n\thx::ObjectPtr< Timer_obj > _hx_result = new Timer_obj();\n\t_hx_result->__construct(time);\n\treturn _hx_result;\n}\n\nDynamic Timer_obj::__Create(hx::DynamicArray inArgs)\n{\n\thx::ObjectPtr< Timer_obj > _hx_result = new Timer_obj();\n\t_hx_result->__construct(inArgs[0]);\n\treturn _hx_result;\n}\n\nHX_BEGIN_DEFAULT_FUNC(__default_run,Timer_obj)\nvoid _hx_run(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__default_run\",0xdc2b9b9c,\"haxe.Timer.__default_run\",\"haxe/Timer.hx\",257,0x1a690682)\n \tHX_STACK_THIS(this)\n \t}\nHX_END_LOCAL_FUNC0((void))\nHX_END_DEFAULT_FUNC\n\nvoid Timer_obj::stop(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"stop\",0xd1fd70b3,\"haxe.Timer.stop\",\"haxe/Timer.hx\",277,0x1a690682)\n \tHX_STACK_THIS(this)\nHXLINE( 277)\t\tBool _hx_tmp = this->mRunning;\nHXDLIN( 277)\t\tif (_hx_tmp) {\nHXLINE( 279)\t\t\tthis->mRunning = false;\nHXLINE( 281)\t\t\t{\nHXLINE( 281)\t\t\t\tHX_VARI( Int,_g1) = (int)0;\nHXDLIN( 281)\t\t\t\tHX_VARI( Int,_g) = ::haxe::Timer_obj::sRunningTimers->length;\nHXDLIN( 281)\t\t\t\twhile((_g1 < _g)){\nHXLINE( 281)\t\t\t\t\tHX_VARI( Int,i) = _g1++;\nHXLINE( 283)\t\t\t\t\tBool _hx_tmp1 = hx::IsEq( ::haxe::Timer_obj::sRunningTimers->__get(i).StaticCast< ::haxe::Timer >(),hx::ObjectPtr<OBJ_>(this) );\nHXDLIN( 283)\t\t\t\t\tif (_hx_tmp1) {\nHXLINE( 285)\t\t\t\t\t\t::haxe::Timer_obj::sRunningTimers[i] = null();\nHXLINE( 286)\t\t\t\t\t\tgoto _hx_goto_0;\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t\t_hx_goto_0:;\n \t\t\t}\n \t\t}\n \t}\n\nHX_DEFINE_DYNAMIC_FUNC0(Timer_obj,stop,(void))\n\nvoid Timer_obj::_hx___check(Float inTime){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__check\",0xb5623597,\"haxe.Timer.__check\",\"haxe/Timer.hx\",299,0x1a690682)\n \tHX_STACK_THIS(this)\n \tHX_STACK_ARG(inTime,\"inTime\")\nHXLINE( 299)\t\tBool _hx_tmp = (inTime >= this->mFireAt);\nHXDLIN( 299)\t\tif (_hx_tmp) {\nHXLINE( 301)\t\t\thx::AddEq(this->mFireAt,this->mTime);\nHXLINE( 302)\t\t\tthis->run();\n \t\t}\n \t}\n\nHX_DEFINE_DYNAMIC_FUNC1(Timer_obj,_hx___check,(void))\n\n::Array< ::Dynamic> Timer_obj::sRunningTimers;\n\n ::haxe::Timer Timer_obj::delay( ::Dynamic f,Int time){\n \t\tHX_BEGIN_LOCAL_FUNC_S2(hx::LocalFunc,_hx_Closure_0, ::Dynamic,f, ::haxe::Timer,t) HXARGC(0)\n \t\tvoid _hx_run(){\n \t\t\tHX_STACK_FRAME(\"haxe.Timer\",\"delay\",0x3ed5f1b2,\"haxe.Timer.delay\",\"haxe/Timer.hx\",224,0x1a690682)\nHXLINE( 226)\t\t\tt->stop();\nHXLINE( 227)\t\t\tf();\n \t\t}\n \t\tHX_END_LOCAL_FUNC0((void))\n\n \tHX_STACK_FRAME(\"haxe.Timer\",\"delay\",0x3ed5f1b2,\"haxe.Timer.delay\",\"haxe/Timer.hx\",220,0x1a690682)\n \tHX_STACK_ARG(f,\"f\")\n \tHX_STACK_ARG(time,\"time\")\nHXLINE( 222)\t\tHX_VARI( ::haxe::Timer,t) = ::haxe::Timer_obj::__new(time);\nHXLINE( 224)\t\tt->run = ::Dynamic(new _hx_Closure_0(f,t));\nHXLINE( 231)\t\treturn t;\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC2(Timer_obj,delay,return )\n\nFloat Timer_obj::getMS(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"getMS\",0xf90fafab,\"haxe.Timer.getMS\",\"haxe/Timer.hx\",239,0x1a690682)\nHXLINE( 239)\t\tFloat _hx_tmp = ( (Float)(::haxe::Timer_obj::lime_time_stamp()) );\nHXDLIN( 239)\t\treturn (_hx_tmp * ((Float)1000.0));\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC0(Timer_obj,getMS,return )\n\n ::Dynamic Timer_obj::measure( ::Dynamic f, ::Dynamic pos){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"measure\",0x42373f4d,\"haxe.Timer.measure\",\"haxe/Timer.hx\",247,0x1a690682)\n \tHX_STACK_ARG(f,\"f\")\n \tHX_STACK_ARG(pos,\"pos\")\nHXLINE( 249)\t\tHX_VARI( Float,t0) = ::haxe::Timer_obj::stamp();\nHXLINE( 250)\t\tHX_VARI( ::Dynamic,r) = f();\nHXLINE( 251)\t\tFloat _hx_tmp = ::haxe::Timer_obj::stamp();\nHXDLIN( 251)\t\t::haxe::Log_obj::trace(((_hx_tmp - t0) + HX_(\"s\",73,00,00,00)),pos);\nHXLINE( 252)\t\treturn r;\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC2(Timer_obj,measure,return )\n\nFloat Timer_obj::stamp(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"stamp\",0xebba8a32,\"haxe.Timer.stamp\",\"haxe/Timer.hx\",267,0x1a690682)\nHXLINE( 267)\t\treturn ( (Float)(::haxe::Timer_obj::lime_time_stamp()) );\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC0(Timer_obj,stamp,return )\n\nvoid Timer_obj::_hx___checkTimers(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__checkTimers\",0xb7078205,\"haxe.Timer.__checkTimers\",\"haxe/Timer.hx\",309,0x1a690682)\nHXLINE( 311)\t\tHX_VARI( Float,now) = ::haxe::Timer_obj::getMS();\nHXLINE( 312)\t\tHX_VARI( Bool,foundNull) = false;\nHXLINE( 313)\t\tHX_VAR( ::haxe::Timer,timer);\nHXLINE( 315)\t\t{\nHXLINE( 315)\t\t\tHX_VARI( Int,_g1) = (int)0;\nHXDLIN( 315)\t\t\tHX_VARI( Int,_g) = ::haxe::Timer_obj::sRunningTimers->length;\nHXDLIN( 315)\t\t\twhile((_g1 < _g)){\nHXLINE( 315)\t\t\t\tHX_VARI( Int,i) = _g1++;\nHXLINE( 317)\t\t\t\ttimer = ::haxe::Timer_obj::sRunningTimers->__get(i).StaticCast< ::haxe::Timer >();\nHXLINE( 319)\t\t\t\tBool _hx_tmp = hx::IsNotNull( timer );\nHXDLIN( 319)\t\t\t\tif (_hx_tmp) {\nHXLINE( 321)\t\t\t\t\ttimer->_hx___check(now);\n \t\t\t\t}\nHXLINE( 325)\t\t\t\tBool _hx_tmp1 = !(foundNull);\nHXDLIN( 325)\t\t\t\tif (_hx_tmp1) {\nHXLINE( 325)\t\t\t\t\tfoundNull = hx::IsNull( ::haxe::Timer_obj::sRunningTimers->__get(i).StaticCast< ::haxe::Timer >() );\n \t\t\t\t}\n \t\t\t\telse {\nHXLINE( 325)\t\t\t\t\tfoundNull = true;\n \t\t\t\t}\n \t\t\t}\n \t\t}\nHXLINE( 329)\t\tif (foundNull) {\n \t\t\tHX_BEGIN_LOCAL_FUNC_S0(hx::LocalFunc,_hx_Closure_0) HXARGC(1)\n \t\t\tBool _hx_run( ::haxe::Timer val){\n \t\t\t\tHX_STACK_FRAME(\"haxe.Timer\",\"__checkTimers\",0xb7078205,\"haxe.Timer.__checkTimers\",\"haxe/Timer.hx\",331,0x1a690682)\n \t\t\t\tHX_STACK_ARG(val,\"val\")\nHXLINE( 331)\t\t\t\treturn hx::IsNotNull( val );\n \t\t\t}\n \t\t\tHX_END_LOCAL_FUNC1(return)\n\nHXLINE( 331)\t\t\t::haxe::Timer_obj::sRunningTimers = ::haxe::Timer_obj::sRunningTimers->filter( ::Dynamic(new _hx_Closure_0()));\n \t\t}\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC0(Timer_obj,_hx___checkTimers,(void))\n\nFloat Timer_obj::_hx___nextWake(Float limit){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__nextWake\",0x0e101148,\"haxe.Timer.__nextWake\",\"haxe/Timer.hx\",339,0x1a690682)\n \tHX_STACK_ARG(limit,\"limit\")\nHXLINE( 341)\t\tHX_VARI( Float,now) = ::haxe::Timer_obj::getMS();\nHXLINE( 342)\t\tHX_VAR( Float,sleep);\nHXLINE( 344)\t\t{\nHXLINE( 344)\t\t\tHX_VARI( Int,_g) = (int)0;\nHXDLIN( 344)\t\t\tHX_VARI( ::Array< ::Dynamic>,_g1) = ::haxe::Timer_obj::sRunningTimers;\nHXDLIN( 344)\t\t\twhile((_g < _g1->length)){\nHXLINE( 344)\t\t\t\tHX_VARI( ::haxe::Timer,timer) = _g1->__get(_g).StaticCast< ::haxe::Timer >();\nHXDLIN( 344)\t\t\t\t++_g;\nHXLINE( 346)\t\t\t\tBool _hx_tmp = hx::IsNull( timer );\nHXDLIN( 346)\t\t\t\tif (_hx_tmp) {\nHXLINE( 347)\t\t\t\t\tcontinue;\n \t\t\t\t}\nHXLINE( 349)\t\t\t\tsleep = (timer->mFireAt - now);\nHXLINE( 351)\t\t\t\tBool _hx_tmp1 = (sleep < limit);\nHXDLIN( 351)\t\t\t\tif (_hx_tmp1) {\nHXLINE( 353)\t\t\t\t\tlimit = sleep;\nHXLINE( 355)\t\t\t\t\tif ((sleep < (int)0)) {\nHXLINE( 357)\t\t\t\t\t\treturn (int)0;\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t}\n \t\t}\nHXLINE( 365)\t\treturn (limit * ((Float)0.001));\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC1(Timer_obj,_hx___nextWake,return )\n\n ::Dynamic Timer_obj::lime_time_stamp;\n\nTimer_obj::Timer_obj()\n{\n\trun = new __default_run(this);\n}\n\nvoid Timer_obj::__Mark(HX_MARK_PARAMS)\n{\n\tHX_MARK_BEGIN_CLASS(Timer);\n\tHX_MARK_MEMBER_NAME(mTime,\"mTime\");\n\tHX_MARK_MEMBER_NAME(mFireAt,\"mFireAt\");\n\tHX_MARK_MEMBER_NAME(mRunning,\"mRunning\");\n\tHX_MARK_MEMBER_NAME(run,\"run\");\n\tHX_MARK_END_CLASS();\n}\n\nvoid Timer_obj::__Visit(HX_VISIT_PARAMS)\n{\n\tHX_VISIT_MEMBER_NAME(mTime,\"mTime\");\n\tHX_VISIT_MEMBER_NAME(mFireAt,\"mFireAt\");\n\tHX_VISIT_MEMBER_NAME(mRunning,\"mRunning\");\n\tHX_VISIT_MEMBER_NAME(run,\"run\");\n}\n\nhx::Val Timer_obj::__Field(const ::String &inName,hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 3:\n\t\tif (HX_FIELD_EQ(inName,\"run\") ) { return hx::Val( run); }\n\t\tbreak;\n\tcase 4:\n\t\tif (HX_FIELD_EQ(inName,\"stop\") ) { return hx::Val( stop_dyn()); }\n\t\tbreak;\n\tcase 5:\n\t\tif (HX_FIELD_EQ(inName,\"mTime\") ) { return hx::Val( mTime); }\n\t\tbreak;\n\tcase 7:\n\t\tif (HX_FIELD_EQ(inName,\"mFireAt\") ) { return hx::Val( mFireAt); }\n\t\tif (HX_FIELD_EQ(inName,\"__check\") ) { return hx::Val( _hx___check_dyn()); }\n\t\tbreak;\n\tcase 8:\n\t\tif (HX_FIELD_EQ(inName,\"mRunning\") ) { return hx::Val( mRunning); }\n\t}\n\treturn super::__Field(inName,inCallProp);\n}\n\nbool Timer_obj::__GetStatic(const ::String &inName, Dynamic &outValue, hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 5:\n\t\tif (HX_FIELD_EQ(inName,\"delay\") ) { outValue = delay_dyn(); return true; }\n\t\tif (HX_FIELD_EQ(inName,\"getMS\") ) { outValue = getMS_dyn(); return true; }\n\t\tif (HX_FIELD_EQ(inName,\"stamp\") ) { outValue = stamp_dyn(); return true; }\n\t\tbreak;\n\tcase 7:\n\t\tif (HX_FIELD_EQ(inName,\"measure\") ) { outValue = measure_dyn(); return true; }\n\t\tbreak;\n\tcase 10:\n\t\tif (HX_FIELD_EQ(inName,\"__nextWake\") ) { outValue = _hx___nextWake_dyn(); return true; }\n\t\tbreak;\n\tcase 13:\n\t\tif (HX_FIELD_EQ(inName,\"__checkTimers\") ) { outValue = _hx___checkTimers_dyn(); return true; }\n\t\tbreak;\n\tcase 14:\n\t\tif (HX_FIELD_EQ(inName,\"sRunningTimers\") ) { outValue = sRunningTimers; return true; }\n\t\tbreak;\n\tcase 15:\n\t\tif (HX_FIELD_EQ(inName,\"lime_time_stamp\") ) { outValue = lime_time_stamp; return true; }\n\t}\n\treturn false;\n}\n\nhx::Val Timer_obj::__SetField(const ::String &inName,const hx::Val &inValue,hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 3:\n\t\tif (HX_FIELD_EQ(inName,\"run\") ) { run=inValue.Cast< ::Dynamic >(); return inValue; }\n\t\tbreak;\n\tcase 5:\n\t\tif (HX_FIELD_EQ(inName,\"mTime\") ) { mTime=inValue.Cast< Float >(); return inValue; }\n\t\tbreak;\n\tcase 7:\n\t\tif (HX_FIELD_EQ(inName,\"mFireAt\") ) { mFireAt=inValue.Cast< Float >(); return inValue; }\n\t\tbreak;\n\tcase 8:\n\t\tif (HX_FIELD_EQ(inName,\"mRunning\") ) { mRunning=inValue.Cast< Bool >(); return inValue; }\n\t}\n\treturn super::__SetField(inName,inValue,inCallProp);\n}\n\nbool Timer_obj::__SetStatic(const ::String &inName,Dynamic &ioValue,hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 14:\n\t\tif (HX_FIELD_EQ(inName,\"sRunningTimers\") ) { sRunningTimers=ioValue.Cast< ::Array< ::Dynamic> >(); return true; }\n\t\tbreak;\n\tcase 15:\n\t\tif (HX_FIELD_EQ(inName,\"lime_time_stamp\") ) { lime_time_stamp=ioValue.Cast< ::Dynamic >(); return true; }\n\t}\n\treturn false;\n}\n\nvoid Timer_obj::__GetFields(Array< ::String> &outFields)\n{\n\toutFields->push(HX_HCSTRING(\"mTime\",\"\\x1a\",\"\\x33\",\"\\x83\",\"\\xfa\"));\n\toutFields->push(HX_HCSTRING(\"mFireAt\",\"\\x96\",\"\\xea\",\"\\x58\",\"\\x72\"));\n\toutFields->push(HX_HCSTRING(\"mRunning\",\"\\x12\",\"\\x2d\",\"\\x35\",\"\\x13\"));\n\tsuper::__GetFields(outFields);\n};\n\n#if HXCPP_SCRIPTABLE\nstatic hx::StorageInfo Timer_obj_sMemberStorageInfo[] = {\n\t{hx::fsFloat,(int)offsetof(Timer_obj,mTime),HX_HCSTRING(\"mTime\",\"\\x1a\",\"\\x33\",\"\\x83\",\"\\xfa\")},\n\t{hx::fsFloat,(int)offsetof(Timer_obj,mFireAt),HX_HCSTRING(\"mFireAt\",\"\\x96\",\"\\xea\",\"\\x58\",\"\\x72\")},\n\t{hx::fsBool,(int)offsetof(Timer_obj,mRunning),HX_HCSTRING(\"mRunning\",\"\\x12\",\"\\x2d\",\"\\x35\",\"\\x13\")},\n\t{hx::fsObject ,(int)offsetof(Timer_obj,run),HX_HCSTRING(\"run\",\"\\x4b\",\"\\xe7\",\"\\x56\",\"\\x00\")},\n\t{ hx::fsUnknown, 0, null()}\n};\nstatic hx::StaticInfo Timer_obj_sStaticStorageInfo[] = {\n\t{hx::fsObject ,(void *) &Timer_obj::sRunningTimers,HX_HCSTRING(\"sRunningTimers\",\"\\xfa\",\"\\xbb\",\"\\xcd\",\"\\xfe\")},\n\t{hx::fsObject ,(void *) &Timer_obj::lime_time_stamp,HX_HCSTRING(\"lime_time_stamp\",\"\\x3b\",\"\\x9f\",\"\\x6b\",\"\\x12\")},\n\t{ hx::fsUnknown, 0, null()}\n};\n#endif\n\nstatic ::String Timer_obj_sMemberFields[] = {\n\tHX_HCSTRING(\"mTime\",\"\\x1a\",\"\\x33\",\"\\x83\",\"\\xfa\"),\n\tHX_HCSTRING(\"mFireAt\",\"\\x96\",\"\\xea\",\"\\x58\",\"\\x72\"),\n\tHX_HCSTRING(\"mRunning\",\"\\x12\",\"\\x2d\",\"\\x35\",\"\\x13\"),\n\tHX_HCSTRING(\"run\",\"\\x4b\",\"\\xe7\",\"\\x56\",\"\\x00\"),\n\tHX_HCSTRING(\"stop\",\"\\x02\",\"\\xf0\",\"\\x5b\",\"\\x4c\"),\n\tHX_HCSTRING(\"__check\",\"\\xa8\",\"\\xf1\",\"\\x14\",\"\\xb0\"),\n\t::String(null()) };\n\nstatic void Timer_obj_sMarkStatics(HX_MARK_PARAMS) {\n\tHX_MARK_MEMBER_NAME(Timer_obj::__mClass,\"__mClass\");\n\tHX_MARK_MEMBER_NAME(Timer_obj::sRunningTimers,\"sRunningTimers\");\n\tHX_MARK_MEMBER_NAME(Timer_obj::lime_time_stamp,\"lime_time_stamp\");\n};\n\n#ifdef HXCPP_VISIT_ALLOCS\nstatic void Timer_obj_sVisitStatics(HX_VISIT_PARAMS) {\n\tHX_VISIT_MEMBER_NAME(Timer_obj::__mClass,\"__mClass\");\n\tHX_VISIT_MEMBER_NAME(Timer_obj::sRunningTimers,\"sRunningTimers\");\n\tHX_VISIT_MEMBER_NAME(Timer_obj::lime_time_stamp,\"lime_time_stamp\");\n};\n\n#endif\n\nhx::Class Timer_obj::__mClass;\n\nstatic ::String Timer_obj_sStaticFields[] = {\n\tHX_HCSTRING(\"sRunningTimers\",\"\\xfa\",\"\\xbb\",\"\\xcd\",\"\\xfe\"),\n\tHX_HCSTRING(\"delay\",\"\\x83\",\"\\xd7\",\"\\x26\",\"\\xd7\"),\n\tHX_HCSTRING(\"getMS\",\"\\x7c\",\"\\x95\",\"\\x60\",\"\\x91\"),\n\tHX_HCSTRING(\"measure\",\"\\x5e\",\"\\xfb\",\"\\xe9\",\"\\x3c\"),\n\tHX_HCSTRING(\"stamp\",\"\\x03\",\"\\x70\",\"\\x0b\",\"\\x84\"),\n\tHX_HCSTRING(\"__checkTimers\",\"\\xd6\",\"\\x20\",\"\\x5c\",\"\\x49\"),\n\tHX_HCSTRING(\"__nextWake\",\"\\xd7\",\"\\x75\",\"\\xf7\",\"\\x9d\"),\n\tHX_HCSTRING(\"lime_time_stamp\",\"\\x3b\",\"\\x9f\",\"\\x6b\",\"\\x12\"),\n\t::String(null())\n};\n\nvoid Timer_obj::__register()\n{\n\thx::Static(__mClass) = new hx::Class_obj();\n\t__mClass->mName = HX_HCSTRING(\"haxe.Timer\",\"\\x5d\",\"\\x9d\",\"\\x24\",\"\\x4b\");\n\t__mClass->mSuper = &super::__SGetClass();\n\t__mClass->mConstructEmpty = &__CreateEmpty;\n\t__mClass->mConstructArgs = &__Create;\n\t__mClass->mGetStaticField = &Timer_obj::__GetStatic;\n\t__mClass->mSetStaticField = &Timer_obj::__SetStatic;\n\t__mClass->mMarkFunc = Timer_obj_sMarkStatics;\n\t__mClass->mStatics = hx::Class_obj::dupFunctions(Timer_obj_sStaticFields);\n\t__mClass->mMembers = hx::Class_obj::dupFunctions(Timer_obj_sMemberFields);\n\t__mClass->mCanCast = hx::TCanCast< Timer_obj >;\n#ifdef HXCPP_VISIT_ALLOCS\n\t__mClass->mVisitFunc = Timer_obj_sVisitStatics;\n#endif\n#ifdef HXCPP_SCRIPTABLE\n\t__mClass->mMemberStorageInfo = Timer_obj_sMemberStorageInfo;\n#endif\n#ifdef HXCPP_SCRIPTABLE\n\t__mClass->mStaticStorageInfo = Timer_obj_sStaticStorageInfo;\n#endif\n\thx::_hx_RegisterClass(__mClass->mName, __mClass);\n}\n\nvoid Timer_obj::__boot()\n{\n{\n \tHX_STACK_FRAME(\"haxe.Timer\",\"boot\",0xc6bd04e3,\"haxe.Timer.boot\",\"haxe/Timer.hx\",203,0x1a690682)\nHXLINE( 203)\t\tsRunningTimers = ::Array_obj< ::Dynamic>::__new(0);\n \t}\n{\n \tHX_STACK_FRAME(\"haxe.Timer\",\"boot\",0xc6bd04e3,\"haxe.Timer.boot\",\"haxe/Timer.hx\",379,0x1a690682)\nHXLINE( 379)\t\tlime_time_stamp = ::openfl::_legacy::Lib_obj::load(HX_(\"lime-legacy\",c1,7f,b9,87),HX_(\"lime_legacy_time_stamp\",9d,85,d0,ec),(int)0);\n \t}\n}\n\n} \n"},"prefix":{"kind":"string","value":"\n#include <hxcpp.h>\n\n#ifndef INCLUDED_haxe_Log\n#include <haxe/Log.h>\n#endif\n#ifndef INCLUDED_haxe_Timer\n#include <haxe/Timer.h>\n#endif\n#ifndef INCLUDED_openfl__legacy_Lib\n#include <openfl/_legacy/Lib.h>\n#endif\n\nnamespace haxe{\n\nvoid Timer_obj::__construct(Float time){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"new\",0x4136b0cf,\"haxe.Timer.new\",\"haxe/Timer.hx\",210,0x1a690682)\n \tHX_STACK_THIS(this)\n \tHX_STACK_ARG(time,\"time\")\nHXLINE( 212)\t\tthis->mTime = time;\nHXLINE( 213)\t\t::haxe::Timer_obj::sRunningTimers->push(hx::ObjectPtr<OBJ_>(this));\nHXLINE( 214)\t\tFloat _hx_tmp = ::haxe::Timer_obj::getMS();\nHXDLIN( 214)\t\tthis->mFireAt = (_hx_tmp + this->mTime);\nHXLINE( 215)\t\tthis->mRunning = true;\n \t}\n\nDynamic Timer_obj::__CreateEmpty() { return new Timer_obj; }\n\nhx::ObjectPtr< Timer_obj > Timer_obj::__new(Float time)\n{\n\thx::ObjectPtr< Timer_obj > _hx_result = new Timer_obj();\n\t_hx_result->__construct(time);\n\treturn _hx_result;\n}\n\nDynamic Timer_obj::__Create(hx::DynamicArray inArgs)\n{\n\thx::ObjectPtr< Timer_obj > _hx_result = new Timer_obj();\n\t_hx_result->__construct(inArgs[0]);\n\treturn _hx_result;\n}\n\nHX_BEGIN_DEFAULT_FUNC(__default_run,Timer_obj)\nvoid _hx_run(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__default_run\",0xdc2b9b9c,\"haxe.Timer.__default_run\",\"haxe/Timer.hx\",257,0x1a690682)\n \tHX_STACK_THIS(this)\n \t}\nHX_END_LOCAL_FUNC0((void))\nHX_END_DEFAULT_FUNC\n\nvoid Timer_obj::stop(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"stop\",0xd1fd70b3,\"haxe.Timer.stop\",\"haxe/Timer.hx\",277,0x1a690682)\n \tHX_STACK_THIS(this)\nHXLINE( 277)\t\tBool _hx_tmp = this->mRunning;\nHXDLIN( 277)\t\tif (_hx_tmp) {\nHXLINE( 279)\t\t\tthis->mRunning = false;\nHXLINE( 281)\t\t\t{\nHXLINE( 281)\t\t\t\tHX_VARI( Int,_g1) = (int)0;\nHXDLIN( 281)\t\t\t\tHX_VARI( Int,_g) = ::haxe::Timer_obj::sRunningTimers->length;\nHXDLIN( 281)\t\t\t\twhile((_g1 < _g)){\nHXLINE( 281)\t\t\t\t\tHX_VARI( Int,i) = _g1++;\nHXLINE( 283)\t\t\t\t\tBool _hx_tmp1 = hx::IsEq( ::haxe::Timer_obj::sRunningTimers->__get(i).StaticCast< ::haxe::Timer >(),hx::ObjectPtr<OBJ_>(this) );\nHXDLIN( 283)\t\t\t\t\tif (_hx_tmp1) {\nHXLINE( 285)\t\t\t\t\t\t::haxe::Timer_obj::sRunningTimers[i] = null();\nHXLINE( 286)\t\t\t\t\t\tgoto _hx_goto_0;\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t\t_hx_goto_0:;\n \t\t\t}\n \t\t}\n \t}\n\nHX_DEFINE_DYNAMIC_FUNC0(Timer_obj,stop,(void))\n\nvoid Timer_obj::_hx___check(Float inTime){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__check\",0xb5623597,\"haxe.Timer.__check\",\"haxe/Timer.hx\",299,0x1a690682)\n \tHX_STACK_THIS(this)\n \tHX_STACK_ARG(inTime,\"inTime\")\nHXLINE( 299)\t\tBool _hx_tmp = (inTime >= this->mFireAt);\nHXDLIN( 299)\t\tif (_hx_tmp) {\nHXLINE( 301)\t\t\thx::AddEq(this->mFireAt,this->mTime);\nHXLINE( 302)\t\t\tthis->run();\n \t\t}\n \t}\n\nHX_DEFINE_DYNAMIC_FUNC1(Timer_obj,_hx___check,(void))\n\n::Array< ::Dynamic> Timer_obj::sRunningTimers;\n\n ::haxe::Timer Timer_obj::delay( ::Dynamic f,Int time){\n \t\tHX_BEGIN_LOCAL_FUNC_S2(hx::LocalFunc,_hx_Closure_0, ::Dynamic,f, ::haxe::Timer,t) HXARGC(0)\n \t\tvoid _hx_run(){\n \t\t\tHX_STACK_FRAME(\"haxe.Timer\",\"delay\",0x3ed5f1b2,\"haxe.Timer.delay\",\"haxe/Timer.hx\",224,0x1a690682)\nHXLINE( 226)\t\t\tt->stop();\nHXLINE( 227)\t\t\tf();\n \t\t}\n \t\tHX_END_LOCAL_FUNC0((void))\n\n \tHX_STACK_FRAME(\"haxe.Timer\",\"delay\",0x3ed5f1b2,\"haxe.Timer.delay\",\"haxe/Timer.hx\",220,0x1a690682)\n \tHX_STACK_ARG(f,\"f\")\n \tHX_STACK_ARG(time,\"time\")\nHXLINE( 222)\t\tHX_VARI( ::haxe::Timer,t) = ::haxe::Timer_obj::__new(time);\nHXLINE( 224)\t\tt->run = ::Dynamic(new _hx_Closure_0(f,t));\nHXLINE( 231)\t\treturn t;\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC2(Timer_obj,delay,return )\n\nFloat Timer_obj::getMS(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"getMS\",0xf90fafab,\"haxe.Timer.getMS\",\"haxe/Timer.hx\",239,0x1a690682)\nHXLINE( 239)\t\tFloat _hx_tmp = ( (Float)(::haxe::Timer_obj::lime_time_stamp()) );\nHXDLIN( 239)\t\treturn (_hx_tmp * ((Float)1000.0));\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC0(Timer_obj,getMS,return )\n\n ::Dynamic Timer_obj::measure( ::Dynamic f, ::Dynamic pos){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"measure\",0x42373f4d,\"haxe.Timer.measure\",\"haxe/Timer.hx\",247,0x1a690682)\n \tHX_STACK_ARG(f,\"f\")\n \tHX_STACK_ARG(pos,\"pos\")\nHXLINE( 249)\t\tHX_VARI( Float,t0) = ::haxe::Timer_obj::stamp();\nHXLINE( 250)\t\tHX_VARI( ::Dynamic,r) = f();\nHXLINE( 251)\t\tFloat _hx_tmp = ::haxe::Timer_obj::stamp();\nHXDLIN( 251)\t\t::haxe::Log_obj::trace(((_hx_tmp - t0) + HX_(\"s\",73,00,00,00)),pos);\nHXLINE( 252)\t\treturn r;\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC2(Timer_obj,measure,return )\n\nFloat Timer_obj::stamp(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"stamp\",0xebba8a32,\"haxe.Timer.stamp\",\"haxe/Timer.hx\",267,0x1a690682)\nHXLINE( 267)\t\treturn ( (Float)(::haxe::Timer_obj::lime_time_stamp()) );\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC0(Timer_obj,stamp,return )\n\nvoid Timer_obj::_hx___checkTimers(){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__checkTimers\",0xb7078205,\"haxe.Timer.__checkTimers\",\"haxe/Timer.hx\",309,0x1a690682)\nHXLINE( 311)\t\tHX_VARI( Float,now) = ::haxe::Timer_obj::getMS();\nHXLINE( 312)\t\tHX_VARI( Bool,foundNull) = false;\nHXLINE( 313)\t\tHX_VAR( ::haxe::Timer,timer);\nHXLINE( 315)\t\t{\nHXLINE( 315)\t\t\tHX_VARI( Int,_g1) = (int)0;\nHXDLIN( 315)\t\t\tHX_VARI( Int,_g) = ::haxe::Timer_obj::sRunningTimers->length;\nHXDLIN( 315)\t\t\twhile((_g1 < _g)){\nHXLINE( 315)\t\t\t\tHX_VARI( Int,i) = _g1++;\nHXLINE( 317)\t\t\t\ttimer = ::haxe::Timer_obj::sRunningTimers->__get(i).StaticCast< ::haxe::Timer >();\nHXLINE( 319)\t\t\t\tBool _hx_tmp = hx::IsNotNull( timer );\nHXDLIN( 319)\t\t\t\tif (_hx_tmp) {\nHXLINE( 321)\t\t\t\t\ttimer->_hx___check(now);\n \t\t\t\t}\nHXLINE( 325)\t\t\t\tBool _hx_tmp1 = !(foundNull);\nHXDLIN( 325)\t\t\t\tif (_hx_tmp1) {\nHXLINE( 325)\t\t\t\t\tfoundNull = hx::IsNull( ::haxe::Timer_obj::sRunningTimers->__get(i).StaticCast< ::haxe::Timer >() );\n \t\t\t\t}\n \t\t\t\telse {\nHXLINE( 325)\t\t\t\t\tfoundNull = true;\n \t\t\t\t}\n \t\t\t}\n \t\t}\nHXLINE( 329)\t\tif (foundNull) {\n \t\t\tHX_BEGIN_LOCAL_FUNC_S0(hx::LocalFunc,_hx_Closure_0) HXARGC(1)\n \t\t\tBool _hx_run( ::haxe::Timer val){\n \t\t\t\tHX_STACK_FRAME(\"haxe.Timer\",\"__checkTimers\",0xb7078205,\"haxe.Timer.__checkTimers\",\"haxe/Timer.hx\",331,0x1a690682)\n \t\t\t\tHX_STACK_ARG(val,\"val\")\nHXLINE( 331)\t\t\t\treturn hx::IsNotNull( val );\n \t\t\t}\n \t\t\tHX_END_LOCAL_FUNC1(return)\n\nHXLINE( 331)\t\t\t::haxe::Timer_obj::sRunningTimers = ::haxe::Timer_obj::sRunningTimers->filter( ::Dynamic(new _hx_Closure_0()));\n \t\t}\n \t}\n\n"},"suffix":{"kind":"string","value":"\n\n ::Dynamic Timer_obj::lime_time_stamp;\n\nTimer_obj::Timer_obj()\n{\n\trun = new __default_run(this);\n}\n\nvoid Timer_obj::__Mark(HX_MARK_PARAMS)\n{\n\tHX_MARK_BEGIN_CLASS(Timer);\n\tHX_MARK_MEMBER_NAME(mTime,\"mTime\");\n\tHX_MARK_MEMBER_NAME(mFireAt,\"mFireAt\");\n\tHX_MARK_MEMBER_NAME(mRunning,\"mRunning\");\n\tHX_MARK_MEMBER_NAME(run,\"run\");\n\tHX_MARK_END_CLASS();\n}\n\nvoid Timer_obj::__Visit(HX_VISIT_PARAMS)\n{\n\tHX_VISIT_MEMBER_NAME(mTime,\"mTime\");\n\tHX_VISIT_MEMBER_NAME(mFireAt,\"mFireAt\");\n\tHX_VISIT_MEMBER_NAME(mRunning,\"mRunning\");\n\tHX_VISIT_MEMBER_NAME(run,\"run\");\n}\n\nhx::Val Timer_obj::__Field(const ::String &inName,hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 3:\n\t\tif (HX_FIELD_EQ(inName,\"run\") ) { return hx::Val( run); }\n\t\tbreak;\n\tcase 4:\n\t\tif (HX_FIELD_EQ(inName,\"stop\") ) { return hx::Val( stop_dyn()); }\n\t\tbreak;\n\tcase 5:\n\t\tif (HX_FIELD_EQ(inName,\"mTime\") ) { return hx::Val( mTime); }\n\t\tbreak;\n\tcase 7:\n\t\tif (HX_FIELD_EQ(inName,\"mFireAt\") ) { return hx::Val( mFireAt); }\n\t\tif (HX_FIELD_EQ(inName,\"__check\") ) { return hx::Val( _hx___check_dyn()); }\n\t\tbreak;\n\tcase 8:\n\t\tif (HX_FIELD_EQ(inName,\"mRunning\") ) { return hx::Val( mRunning); }\n\t}\n\treturn super::__Field(inName,inCallProp);\n}\n\nbool Timer_obj::__GetStatic(const ::String &inName, Dynamic &outValue, hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 5:\n\t\tif (HX_FIELD_EQ(inName,\"delay\") ) { outValue = delay_dyn(); return true; }\n\t\tif (HX_FIELD_EQ(inName,\"getMS\") ) { outValue = getMS_dyn(); return true; }\n\t\tif (HX_FIELD_EQ(inName,\"stamp\") ) { outValue = stamp_dyn(); return true; }\n\t\tbreak;\n\tcase 7:\n\t\tif (HX_FIELD_EQ(inName,\"measure\") ) { outValue = measure_dyn(); return true; }\n\t\tbreak;\n\tcase 10:\n\t\tif (HX_FIELD_EQ(inName,\"__nextWake\") ) { outValue = _hx___nextWake_dyn(); return true; }\n\t\tbreak;\n\tcase 13:\n\t\tif (HX_FIELD_EQ(inName,\"__checkTimers\") ) { outValue = _hx___checkTimers_dyn(); return true; }\n\t\tbreak;\n\tcase 14:\n\t\tif (HX_FIELD_EQ(inName,\"sRunningTimers\") ) { outValue = sRunningTimers; return true; }\n\t\tbreak;\n\tcase 15:\n\t\tif (HX_FIELD_EQ(inName,\"lime_time_stamp\") ) { outValue = lime_time_stamp; return true; }\n\t}\n\treturn false;\n}\n\nhx::Val Timer_obj::__SetField(const ::String &inName,const hx::Val &inValue,hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 3:\n\t\tif (HX_FIELD_EQ(inName,\"run\") ) { run=inValue.Cast< ::Dynamic >(); return inValue; }\n\t\tbreak;\n\tcase 5:\n\t\tif (HX_FIELD_EQ(inName,\"mTime\") ) { mTime=inValue.Cast< Float >(); return inValue; }\n\t\tbreak;\n\tcase 7:\n\t\tif (HX_FIELD_EQ(inName,\"mFireAt\") ) { mFireAt=inValue.Cast< Float >(); return inValue; }\n\t\tbreak;\n\tcase 8:\n\t\tif (HX_FIELD_EQ(inName,\"mRunning\") ) { mRunning=inValue.Cast< Bool >(); return inValue; }\n\t}\n\treturn super::__SetField(inName,inValue,inCallProp);\n}\n\nbool Timer_obj::__SetStatic(const ::String &inName,Dynamic &ioValue,hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 14:\n\t\tif (HX_FIELD_EQ(inName,\"sRunningTimers\") ) { sRunningTimers=ioValue.Cast< ::Array< ::Dynamic> >(); return true; }\n\t\tbreak;\n\tcase 15:\n\t\tif (HX_FIELD_EQ(inName,\"lime_time_stamp\") ) { lime_time_stamp=ioValue.Cast< ::Dynamic >(); return true; }\n\t}\n\treturn false;\n}\n\nvoid Timer_obj::__GetFields(Array< ::String> &outFields)\n{\n\toutFields->push(HX_HCSTRING(\"mTime\",\"\\x1a\",\"\\x33\",\"\\x83\",\"\\xfa\"));\n\toutFields->push(HX_HCSTRING(\"mFireAt\",\"\\x96\",\"\\xea\",\"\\x58\",\"\\x72\"));\n\toutFields->push(HX_HCSTRING(\"mRunning\",\"\\x12\",\"\\x2d\",\"\\x35\",\"\\x13\"));\n\tsuper::__GetFields(outFields);\n};\n\n#if HXCPP_SCRIPTABLE\nstatic hx::StorageInfo Timer_obj_sMemberStorageInfo[] = {\n\t{hx::fsFloat,(int)offsetof(Timer_obj,mTime),HX_HCSTRING(\"mTime\",\"\\x1a\",\"\\x33\",\"\\x83\",\"\\xfa\")},\n\t{hx::fsFloat,(int)offsetof(Timer_obj,mFireAt),HX_HCSTRING(\"mFireAt\",\"\\x96\",\"\\xea\",\"\\x58\",\"\\x72\")},\n\t{hx::fsBool,(int)offsetof(Timer_obj,mRunning),HX_HCSTRING(\"mRunning\",\"\\x12\",\"\\x2d\",\"\\x35\",\"\\x13\")},\n\t{hx::fsObject ,(int)offsetof(Timer_obj,run),HX_HCSTRING(\"run\",\"\\x4b\",\"\\xe7\",\"\\x56\",\"\\x00\")},\n\t{ hx::fsUnknown, 0, null()}\n};\nstatic hx::StaticInfo Timer_obj_sStaticStorageInfo[] = {\n\t{hx::fsObject ,(void *) &Timer_obj::sRunningTimers,HX_HCSTRING(\"sRunningTimers\",\"\\xfa\",\"\\xbb\",\"\\xcd\",\"\\xfe\")},\n\t{hx::fsObject ,(void *) &Timer_obj::lime_time_stamp,HX_HCSTRING(\"lime_time_stamp\",\"\\x3b\",\"\\x9f\",\"\\x6b\",\"\\x12\")},\n\t{ hx::fsUnknown, 0, null()}\n};\n#endif\n\nstatic ::String Timer_obj_sMemberFields[] = {\n\tHX_HCSTRING(\"mTime\",\"\\x1a\",\"\\x33\",\"\\x83\",\"\\xfa\"),\n\tHX_HCSTRING(\"mFireAt\",\"\\x96\",\"\\xea\",\"\\x58\",\"\\x72\"),\n\tHX_HCSTRING(\"mRunning\",\"\\x12\",\"\\x2d\",\"\\x35\",\"\\x13\"),\n\tHX_HCSTRING(\"run\",\"\\x4b\",\"\\xe7\",\"\\x56\",\"\\x00\"),\n\tHX_HCSTRING(\"stop\",\"\\x02\",\"\\xf0\",\"\\x5b\",\"\\x4c\"),\n\tHX_HCSTRING(\"__check\",\"\\xa8\",\"\\xf1\",\"\\x14\",\"\\xb0\"),\n\t::String(null()) };\n\nstatic void Timer_obj_sMarkStatics(HX_MARK_PARAMS) {\n\tHX_MARK_MEMBER_NAME(Timer_obj::__mClass,\"__mClass\");\n\tHX_MARK_MEMBER_NAME(Timer_obj::sRunningTimers,\"sRunningTimers\");\n\tHX_MARK_MEMBER_NAME(Timer_obj::lime_time_stamp,\"lime_time_stamp\");\n};\n\n#ifdef HXCPP_VISIT_ALLOCS\nstatic void Timer_obj_sVisitStatics(HX_VISIT_PARAMS) {\n\tHX_VISIT_MEMBER_NAME(Timer_obj::__mClass,\"__mClass\");\n\tHX_VISIT_MEMBER_NAME(Timer_obj::sRunningTimers,\"sRunningTimers\");\n\tHX_VISIT_MEMBER_NAME(Timer_obj::lime_time_stamp,\"lime_time_stamp\");\n};\n\n#endif\n\nhx::Class Timer_obj::__mClass;\n\nstatic ::String Timer_obj_sStaticFields[] = {\n\tHX_HCSTRING(\"sRunningTimers\",\"\\xfa\",\"\\xbb\",\"\\xcd\",\"\\xfe\"),\n\tHX_HCSTRING(\"delay\",\"\\x83\",\"\\xd7\",\"\\x26\",\"\\xd7\"),\n\tHX_HCSTRING(\"getMS\",\"\\x7c\",\"\\x95\",\"\\x60\",\"\\x91\"),\n\tHX_HCSTRING(\"measure\",\"\\x5e\",\"\\xfb\",\"\\xe9\",\"\\x3c\"),\n\tHX_HCSTRING(\"stamp\",\"\\x03\",\"\\x70\",\"\\x0b\",\"\\x84\"),\n\tHX_HCSTRING(\"__checkTimers\",\"\\xd6\",\"\\x20\",\"\\x5c\",\"\\x49\"),\n\tHX_HCSTRING(\"__nextWake\",\"\\xd7\",\"\\x75\",\"\\xf7\",\"\\x9d\"),\n\tHX_HCSTRING(\"lime_time_stamp\",\"\\x3b\",\"\\x9f\",\"\\x6b\",\"\\x12\"),\n\t::String(null())\n};\n\nvoid Timer_obj::__register()\n{\n\thx::Static(__mClass) = new hx::Class_obj();\n\t__mClass->mName = HX_HCSTRING(\"haxe.Timer\",\"\\x5d\",\"\\x9d\",\"\\x24\",\"\\x4b\");\n\t__mClass->mSuper = &super::__SGetClass();\n\t__mClass->mConstructEmpty = &__CreateEmpty;\n\t__mClass->mConstructArgs = &__Create;\n\t__mClass->mGetStaticField = &Timer_obj::__GetStatic;\n\t__mClass->mSetStaticField = &Timer_obj::__SetStatic;\n\t__mClass->mMarkFunc = Timer_obj_sMarkStatics;\n\t__mClass->mStatics = hx::Class_obj::dupFunctions(Timer_obj_sStaticFields);\n\t__mClass->mMembers = hx::Class_obj::dupFunctions(Timer_obj_sMemberFields);\n\t__mClass->mCanCast = hx::TCanCast< Timer_obj >;\n#ifdef HXCPP_VISIT_ALLOCS\n\t__mClass->mVisitFunc = Timer_obj_sVisitStatics;\n#endif\n#ifdef HXCPP_SCRIPTABLE\n\t__mClass->mMemberStorageInfo = Timer_obj_sMemberStorageInfo;\n#endif\n#ifdef HXCPP_SCRIPTABLE\n\t__mClass->mStaticStorageInfo = Timer_obj_sStaticStorageInfo;\n#endif\n\thx::_hx_RegisterClass(__mClass->mName, __mClass);\n}\n\nvoid Timer_obj::__boot()\n{\n{\n \tHX_STACK_FRAME(\"haxe.Timer\",\"boot\",0xc6bd04e3,\"haxe.Timer.boot\",\"haxe/Timer.hx\",203,0x1a690682)\nHXLINE( 203)\t\tsRunningTimers = ::Array_obj< ::Dynamic>::__new(0);\n \t}\n{\n \tHX_STACK_FRAME(\"haxe.Timer\",\"boot\",0xc6bd04e3,\"haxe.Timer.boot\",\"haxe/Timer.hx\",379,0x1a690682)\nHXLINE( 379)\t\tlime_time_stamp = ::openfl::_legacy::Lib_obj::load(HX_(\"lime-legacy\",c1,7f,b9,87),HX_(\"lime_legacy_time_stamp\",9d,85,d0,ec),(int)0);\n \t}\n}\n\n} \n"},"middle":{"kind":"string","value":"STATIC_HX_DEFINE_DYNAMIC_FUNC0(Timer_obj,_hx___checkTimers,(void))\n\nFloat Timer_obj::_hx___nextWake(Float limit){\n \tHX_STACK_FRAME(\"haxe.Timer\",\"__nextWake\",0x0e101148,\"haxe.Timer.__nextWake\",\"haxe/Timer.hx\",339,0x1a690682)\n \tHX_STACK_ARG(limit,\"limit\")\nHXLINE( 341)\t\tHX_VARI( Float,now) = ::haxe::Timer_obj::getMS();\nHXLINE( 342)\t\tHX_VAR( Float,sleep);\nHXLINE( 344)\t\t{\nHXLINE( 344)\t\t\tHX_VARI( Int,_g) = (int)0;\nHXDLIN( 344)\t\t\tHX_VARI( ::Array< ::Dynamic>,_g1) = ::haxe::Timer_obj::sRunningTimers;\nHXDLIN( 344)\t\t\twhile((_g < _g1->length)){\nHXLINE( 344)\t\t\t\tHX_VARI( ::haxe::Timer,timer) = _g1->__get(_g).StaticCast< ::haxe::Timer >();\nHXDLIN( 344)\t\t\t\t++_g;\nHXLINE( 346)\t\t\t\tBool _hx_tmp = hx::IsNull( timer );\nHXDLIN( 346)\t\t\t\tif (_hx_tmp) {\nHXLINE( 347)\t\t\t\t\tcontinue;\n \t\t\t\t}\nHXLINE( 349)\t\t\t\tsleep = (timer->mFireAt - now);\nHXLINE( 351)\t\t\t\tBool _hx_tmp1 = (sleep < limit);\nHXDLIN( 351)\t\t\t\tif (_hx_tmp1) {\nHXLINE( 353)\t\t\t\t\tlimit = sleep;\nHXLINE( 355)\t\t\t\t\tif ((sleep < (int)0)) {\nHXLINE( 357)\t\t\t\t\t\treturn (int)0;\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t}\n \t\t}\nHXLINE( 365)\t\treturn (limit * ((Float)0.001));\n \t}\n\nSTATIC_HX_DEFINE_DYNAMIC_FUNC1(Timer_obj,_hx___nextWake,return )"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"class HXCPP_CLASS_ATTRIBUTES Timer_obj : public hx::Object\n\n{\n\n\tpublic:\n\n\t\ttypedef hx::Object super;\n\n\t\ttypedef Timer_obj OBJ_;\n\n\t\tTimer_obj();\n\n\n\n\tpublic:\n\n\t\tvoid __construct(Float time);\n\n\t\tinline void *operator new(size_t inSize, bool inContainer=true,const char *inName=\"haxe.Timer\")\n\n\t\t\t{ return hx::Object::operator new(inSize,inContainer,inName); }\n\n\t\tinline void *operator new(size_t inSize, int extra)\n\n\t\t\t{ return hx::Object::operator new(inSize+extra,true,\"haxe.Timer\"); }\n\n\t\tstatic hx::ObjectPtr< Timer_obj > __new(Float time);\n\n\t\tstatic Dynamic __CreateEmpty();\n\n\t\tstatic Dynamic __Create(hx::DynamicArray inArgs);\n\n\t\t//~Timer_obj();\n\n\n\n\t\tHX_DO_RTTI_ALL;\n\n\t\thx::Val __Field(const ::String &inString, hx::PropertyAccess inCallProp);\n","file_path":"export/windows/cpp/obj/include/haxe/Timer.h","rank":0,"score":195030.109864606},{"content":"\t\tstatic Float stamp();\n\n\t\tstatic ::Dynamic stamp_dyn();\n\n\n\n\t\tstatic void _hx___checkTimers();\n\n\t\tstatic ::Dynamic _hx___checkTimers_dyn();\n\n\n\n\t\tstatic Float _hx___nextWake(Float limit);\n\n\t\tstatic ::Dynamic _hx___nextWake_dyn();\n\n\n\n\t\tstatic ::Dynamic lime_time_stamp;\n\n\t\tstatic ::Dynamic &lime_time_stamp_dyn() { return lime_time_stamp;}\n\n\t\tFloat mTime;\n\n\t\tFloat mFireAt;\n\n\t\tBool mRunning;\n\n\t\t::Dynamic run;\n\n\t\tinline ::Dynamic &run_dyn() {return run; }\n\n\n\n\t\tvoid stop();\n\n\t\t::Dynamic stop_dyn();\n\n\n\n\t\tvoid _hx___check(Float inTime);\n\n\t\t::Dynamic _hx___check_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n\n\n#endif /* INCLUDED_haxe_Timer */ \n","file_path":"export/windows/cpp/obj/include/haxe/Timer.h","rank":1,"score":182495.56334394234},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Timer\",\"\\xa5\",\"\\x2f\",\"\\x63\",\"\\xa3\"); }\n\n\n\n\t\tstatic void __boot();\n\n\t\tstatic ::Array< ::Dynamic> sRunningTimers;\n\n\t\tstatic ::haxe::Timer delay( ::Dynamic f,Int time);\n\n\t\tstatic ::Dynamic delay_dyn();\n\n\n\n\t\tstatic Float getMS();\n\n\t\tstatic ::Dynamic getMS_dyn();\n\n\n\n\t\tstatic ::Dynamic measure( ::Dynamic f, ::Dynamic pos);\n\n\t\tstatic ::Dynamic measure_dyn();\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/Timer.h","rank":2,"score":182488.76642533243},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_Timer\n\n#define INCLUDED_haxe_Timer\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS1(haxe,Timer)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/Timer.h","rank":3,"score":182469.25554587154},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"NullResolver\",\"\\xcd\",\"\\x81\",\"\\x9f\",\"\\xf1\"); }\n\n\n\n\t\tstatic ::haxe::_Unserializer::NullResolver instance;\n\n\t\thx::Class resolveClass(::String name);\n\n\t\t::Dynamic resolveClass_dyn();\n\n\n\n\t\thx::Class resolveEnum(::String name);\n\n\t\t::Dynamic resolveEnum_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace _Unserializer\n\n\n\n#endif /* INCLUDED_haxe__Unserializer_NullResolver */ \n","file_path":"export/windows/cpp/obj/include/haxe/_Unserializer/NullResolver.h","rank":4,"score":175619.2902763549},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe__Unserializer_NullResolver\n\n#define INCLUDED_haxe__Unserializer_NullResolver\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,_Unserializer,NullResolver)\n\n\n\nnamespace haxe{\n\nnamespace _Unserializer{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/_Unserializer/NullResolver.h","rank":5,"score":175608.17102341115},{"content":"class HXCPP_CLASS_ATTRIBUTES NullResolver_obj : public hx::Object\n\n{\n\n\tpublic:\n\n\t\ttypedef hx::Object super;\n\n\t\ttypedef NullResolver_obj OBJ_;\n\n\t\tNullResolver_obj();\n\n\n\n\tpublic:\n\n\t\tvoid __construct();\n\n\t\tinline void *operator new(size_t inSize, bool inContainer=false,const char *inName=\"haxe._Unserializer.NullResolver\")\n\n\t\t\t{ return hx::Object::operator new(inSize,inContainer,inName); }\n\n\t\tinline void *operator new(size_t inSize, int extra)\n\n\t\t\t{ return hx::Object::operator new(inSize+extra,false,\"haxe._Unserializer.NullResolver\"); }\n\n\t\tstatic hx::ObjectPtr< NullResolver_obj > __new();\n\n\t\tstatic Dynamic __CreateEmpty();\n\n\t\tstatic Dynamic __Create(hx::DynamicArray inArgs);\n\n\t\t//~NullResolver_obj();\n\n\n\n\t\tHX_DO_RTTI_ALL;\n\n\t\thx::Val __Field(const ::String &inString, hx::PropertyAccess inCallProp);\n","file_path":"export/windows/cpp/obj/include/haxe/_Unserializer/NullResolver.h","rank":6,"score":165414.484600914},{"content":"class HXCPP_CLASS_ATTRIBUTES ByteArray_obj : public ::haxe::io::Bytes_obj\n\n{\n\n\tpublic:\n\n\t\ttypedef ::haxe::io::Bytes_obj super;\n\n\t\ttypedef ByteArray_obj OBJ_;\n\n\t\tByteArray_obj();\n\n\n\n\tpublic:\n\n\t\tvoid __construct(hx::Null< Int > __o_size);\n\n\t\tinline void *operator new(size_t inSize, bool inContainer=true,const char *inName=\"openfl._legacy.utils.ByteArray\")\n\n\t\t\t{ return hx::Object::operator new(inSize,inContainer,inName); }\n\n\t\tinline void *operator new(size_t inSize, int extra)\n\n\t\t\t{ return hx::Object::operator new(inSize+extra,true,\"openfl._legacy.utils.ByteArray\"); }\n\n\t\tstatic hx::ObjectPtr< ByteArray_obj > __new(hx::Null< Int > __o_size);\n\n\t\tstatic Dynamic __CreateEmpty();\n\n\t\tstatic Dynamic __Create(hx::DynamicArray inArgs);\n\n\t\t//~ByteArray_obj();\n\n\n\n\t\tHX_DO_RTTI_ALL;\n\n\t\thx::Val __Field(const ::String &inString, hx::PropertyAccess inCallProp);\n","file_path":"export/windows/cpp/obj/include/openfl/_legacy/utils/ByteArray.h","rank":7,"score":158703.65765527412},{"content":"\t\tInt pos;\n\n\t\tInt length;\n\n\t\t::cpp::VirtualArray cache;\n\n\t\t::Array< ::String > scache;\n\n\t\t ::Dynamic resolver;\n\n\t\tvoid setResolver( ::Dynamic r);\n\n\t\t::Dynamic setResolver_dyn();\n\n\n\n\t\tInt readDigits();\n\n\t\t::Dynamic readDigits_dyn();\n\n\n\n\t\tFloat readFloat();\n\n\t\t::Dynamic readFloat_dyn();\n\n\n\n\t\tvoid unserializeObject( ::Dynamic o);\n\n\t\t::Dynamic unserializeObject_dyn();\n\n\n\n\t\t ::Dynamic unserializeEnum(hx::Class edecl,::String tag);\n\n\t\t::Dynamic unserializeEnum_dyn();\n\n\n\n\t\t ::Dynamic unserialize();\n\n\t\t::Dynamic unserialize_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n\n\n#endif /* INCLUDED_haxe_Unserializer */ \n","file_path":"export/windows/cpp/obj/include/haxe/Unserializer.h","rank":8,"score":121219.3596996057},{"content":"\t\tInt scount;\n\n\t\tBool useCache;\n\n\t\tBool useEnumIndex;\n\n\t\tvirtual ::String toString();\n\n\t\t::Dynamic toString_dyn();\n\n\n\n\t\tvoid serializeString(::String s);\n\n\t\t::Dynamic serializeString_dyn();\n\n\n\n\t\tBool serializeRef( ::Dynamic v);\n\n\t\t::Dynamic serializeRef_dyn();\n\n\n\n\t\tvoid serializeFields( ::Dynamic v);\n\n\t\t::Dynamic serializeFields_dyn();\n\n\n\n\t\tvoid serialize( ::Dynamic v);\n\n\t\t::Dynamic serialize_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n\n\n#endif /* INCLUDED_haxe_Serializer */ \n","file_path":"export/windows/cpp/obj/include/haxe/Serializer.h","rank":9,"score":121215.17104553738},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Serializer\",\"\\xb2\",\"\\xca\",\"\\xd0\",\"\\x55\"); }\n\n\n\n\t\tstatic void __boot();\n\n\t\tstatic Bool USE_CACHE;\n\n\t\tstatic Bool USE_ENUM_INDEX;\n\n\t\tstatic ::String BASE64;\n\n\t\tstatic ::Array< ::Dynamic> BASE64_CODES;\n\n\t\tstatic ::String run( ::Dynamic v);\n\n\t\tstatic ::Dynamic run_dyn();\n\n\n\n\t\t ::StringBuf buf;\n\n\t\t::cpp::VirtualArray cache;\n\n\t\t ::haxe::ds::StringMap shash;\n","file_path":"export/windows/cpp/obj/include/haxe/Serializer.h","rank":10,"score":121212.46275034203},{"content":"\t\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Log\",\"\\x64\",\"\\x0c\",\"\\x3a\",\"\\x00\"); }\n\n\n\n\t\tstatic void __boot();\n\n\t\tstatic ::Dynamic trace;\n\n\t\tstatic inline ::Dynamic &trace_dyn() {return trace; }\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n\n\n#endif /* INCLUDED_haxe_Log */ \n","file_path":"export/windows/cpp/obj/include/haxe/Log.h","rank":11,"score":121212.45252078192},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Unserializer\",\"\\x4b\",\"\\x42\",\"\\x41\",\"\\x93\"); }\n\n\n\n\t\tstatic void __boot();\n\n\t\tstatic ::Dynamic DEFAULT_RESOLVER;\n\n\t\tstatic ::String BASE64;\n\n\t\tstatic ::Array< Int > CODES;\n\n\t\tstatic ::Array< Int > initCodes();\n\n\t\tstatic ::Dynamic initCodes_dyn();\n\n\n\n\t\tstatic ::Dynamic run(::String v);\n\n\t\tstatic ::Dynamic run_dyn();\n\n\n\n\t\t::String buf;\n","file_path":"export/windows/cpp/obj/include/haxe/Unserializer.h","rank":12,"score":121207.81174627165},{"content":"\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Resource\",\"\\xee\",\"\\x18\",\"\\x52\",\"\\xec\"); }\n\n\n\n\t\tstatic ::haxe::io::Bytes getBytes(::String name);\n\n\t\tstatic ::Dynamic getBytes_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n\n\n#endif /* INCLUDED_haxe_Resource */ \n","file_path":"export/windows/cpp/obj/include/haxe/Resource.h","rank":13,"score":121206.41226342598},{"content":"\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Utf8\",\"\\x51\",\"\\x81\",\"\\x87\",\"\\x38\"); }\n\n\n\n\t\tstatic Int charCodeAt(::String s,Int index);\n\n\t\tstatic ::Dynamic charCodeAt_dyn();\n\n\n\n\t\tstatic Int length(::String s);\n\n\t\tstatic ::Dynamic length_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n\n\n#endif /* INCLUDED_haxe_Utf8 */ \n","file_path":"export/windows/cpp/obj/include/haxe/Utf8.h","rank":14,"score":121206.04367018919},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_Utf8\n\n#define INCLUDED_haxe_Utf8\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS1(haxe,Utf8)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/Utf8.h","rank":15,"score":121198.24502775673},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_Log\n\n#define INCLUDED_haxe_Log\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS1(haxe,Log)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/Log.h","rank":16,"score":121198.24502775673},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_IMap\n\n#define INCLUDED_haxe_IMap\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS1(haxe,IMap)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/IMap.h","rank":17,"score":121198.24502775673},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_Unserializer\n\n#define INCLUDED_haxe_Unserializer\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS1(haxe,Unserializer)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/Unserializer.h","rank":18,"score":121198.24502775673},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_Resource\n\n#define INCLUDED_haxe_Resource\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS1(haxe,Resource)\n\nHX_DECLARE_CLASS2(haxe,io,Bytes)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/Resource.h","rank":19,"score":121197.9549772077},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_Serializer\n\n#define INCLUDED_haxe_Serializer\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS0(StringBuf)\n\nHX_DECLARE_CLASS1(haxe,IMap)\n\nHX_DECLARE_CLASS1(haxe,Serializer)\n\nHX_DECLARE_CLASS2(haxe,ds,StringMap)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/Serializer.h","rank":20,"score":121197.35680160648},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Uncompress\",\"\\x1b\",\"\\x33\",\"\\x34\",\"\\x00\"); }\n\n\n\n\t\tstatic ::haxe::io::Bytes run( ::haxe::io::Bytes src, ::Dynamic bufsize);\n\n\t\tstatic ::Dynamic run_dyn();\n\n\n\n\t\t ::Dynamic s;\n\n\t\t ::Dynamic execute( ::haxe::io::Bytes src,Int srcPos, ::haxe::io::Bytes dst,Int dstPos);\n\n\t\t::Dynamic execute_dyn();\n\n\n\n\t\tvoid setFlushMode(::hx::EnumBase f);\n\n\t\t::Dynamic setFlushMode_dyn();\n\n\n\n\t\tvoid close();\n\n\t\t::Dynamic close_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace zip\n\n\n\n#endif /* INCLUDED_haxe_zip_Uncompress */ \n","file_path":"export/windows/cpp/obj/include/haxe/zip/Uncompress.h","rank":42,"score":118888.10303614964},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Compress\",\"\\xc2\",\"\\x03\",\"\\x71\",\"\\x5d\"); }\n\n\n\n\t\tstatic ::haxe::io::Bytes run( ::haxe::io::Bytes s,Int level);\n\n\t\tstatic ::Dynamic run_dyn();\n\n\n\n\t\t ::Dynamic s;\n\n\t\t ::Dynamic execute( ::haxe::io::Bytes src,Int srcPos, ::haxe::io::Bytes dst,Int dstPos);\n\n\t\t::Dynamic execute_dyn();\n\n\n\n\t\tvoid setFlushMode(::hx::EnumBase f);\n\n\t\t::Dynamic setFlushMode_dyn();\n\n\n\n\t\tvoid close();\n\n\t\t::Dynamic close_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace zip\n\n\n\n#endif /* INCLUDED_haxe_zip_Compress */ \n","file_path":"export/windows/cpp/obj/include/haxe/zip/Compress.h","rank":43,"score":118888.05118335148},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Path\",\"\\xc5\",\"\\x11\",\"\\x2b\",\"\\x35\"); }\n\n\n\n\t\tstatic ::String directory(::String path);\n\n\t\tstatic ::Dynamic directory_dyn();\n\n\n\n\t\tstatic ::String addTrailingSlash(::String path);\n\n\t\tstatic ::Dynamic addTrailingSlash_dyn();\n\n\n\n\t\tstatic ::String removeTrailingSlashes(::String path);\n\n\t\tstatic ::Dynamic removeTrailingSlashes_dyn();\n\n\n\n\t\t::String dir;\n\n\t\t::String file;\n\n\t\t::String ext;\n\n\t\tBool backslash;\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace io\n\n\n\n#endif /* INCLUDED_haxe_io_Path */ \n","file_path":"export/windows/cpp/obj/include/haxe/io/Path.h","rank":44,"score":118887.06529969852},{"content":"\t\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Parser\",\"\\xff\",\"\\x10\",\"\\x1d\",\"\\x22\"); }\n\n\n\n\t\tstatic void __boot();\n\n\t\tstatic ::haxe::ds::StringMap escapes;\n\n\t\tstatic ::Xml parse(::String str,hx::Null< Bool > strict);\n\n\t\tstatic ::Dynamic parse_dyn();\n\n\n\n\t\tstatic Int doParse(::String str,Bool strict,hx::Null< Int > p, ::Xml parent);\n\n\t\tstatic ::Dynamic doParse_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace xml\n\n\n\n#endif /* INCLUDED_haxe_xml_Parser */ \n","file_path":"export/windows/cpp/obj/include/haxe/xml/Parser.h","rank":45,"score":118886.74685827289},{"content":"\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"CallStack\",\"\\xaa\",\"\\xa1\",\"\\x1d\",\"\\xb2\"); }\n\n\n\n\t\tstatic ::Array< ::Dynamic> callStack();\n\n\t\tstatic ::Dynamic callStack_dyn();\n\n\n\n\t\tstatic ::Array< ::Dynamic> exceptionStack();\n\n\t\tstatic ::Dynamic exceptionStack_dyn();\n\n\n\n\t\tstatic ::String toString(::Array< ::Dynamic> stack);\n\n\t\tstatic ::Dynamic toString_dyn();\n\n\n\n\t\tstatic void itemToString( ::StringBuf b,::hx::EnumBase s);\n\n\t\tstatic ::Dynamic itemToString_dyn();\n\n\n\n\t\tstatic ::Array< ::Dynamic> makeStack(::Array< ::String > s);\n\n\t\tstatic ::Dynamic makeStack_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n\n\n#endif /* INCLUDED_haxe_CallStack */ \n","file_path":"export/windows/cpp/obj/include/haxe/CallStack.h","rank":46,"score":118880.47657007379},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Bytes\",\"\\x4b\",\"\\x78\",\"\\xc5\",\"\\x50\"); }\n\n\n\n\t\tstatic ::haxe::io::Bytes alloc(Int length);\n\n\t\tstatic ::Dynamic alloc_dyn();\n\n\n\n\t\tstatic ::haxe::io::Bytes ofString(::String s);\n\n\t\tstatic ::Dynamic ofString_dyn();\n\n\n\n\t\tstatic ::haxe::io::Bytes ofData(::Array< unsigned char > b);\n\n\t\tstatic ::Dynamic ofData_dyn();\n\n\n\n\t\tInt length;\n\n\t\t::Array< unsigned char > b;\n\n\t\tvoid blit(Int pos, ::haxe::io::Bytes src,Int srcpos,Int len);\n","file_path":"export/windows/cpp/obj/include/haxe/io/Bytes.h","rank":47,"score":118880.17219875482},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Fast\",\"\\xbc\",\"\\xee\",\"\\x8e\",\"\\x2e\"); }\n\n\n\n\t\t ::Xml x;\n\n\t\t ::haxe::xml::_Fast::NodeAccess node;\n\n\t\t ::haxe::xml::_Fast::NodeListAccess nodes;\n\n\t\t ::haxe::xml::_Fast::AttribAccess att;\n\n\t\t ::haxe::xml::_Fast::HasAttribAccess has;\n\n\t\t ::haxe::xml::_Fast::HasNodeAccess hasNode;\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace xml\n\n\n\n#endif /* INCLUDED_haxe_xml_Fast */ \n","file_path":"export/windows/cpp/obj/include/haxe/xml/Fast.h","rank":48,"score":118879.50732610619},{"content":"\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Input\",\"\\xea\",\"\\x33\",\"\\x4b\",\"\\x51\"); }\n\n\n\n\t\tvirtual Int readByte();\n\n\t\t::Dynamic readByte_dyn();\n\n\n\n\t\tvoid close();\n\n\t\t::Dynamic close_dyn();\n\n\n\n\t\t::String readLine();\n\n\t\t::Dynamic readLine_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace io\n\n\n\n#endif /* INCLUDED_haxe_io_Input */ \n","file_path":"export/windows/cpp/obj/include/haxe/io/Input.h","rank":49,"score":118876.61940935934},{"content":"\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Output\",\"\\x21\",\"\\x83\",\"\\x15\",\"\\x41\"); }\n\n\n\n\t\tvirtual void writeByte(Int c);\n\n\t\t::Dynamic writeByte_dyn();\n\n\n\n\t\tvirtual Int writeBytes( ::haxe::io::Bytes s,Int pos,Int len);\n\n\t\t::Dynamic writeBytes_dyn();\n\n\n\n\t\tvirtual void close();\n\n\t\t::Dynamic close_dyn();\n\n\n\n\t\tvoid write( ::haxe::io::Bytes s);\n\n\t\t::Dynamic write_dyn();\n\n\n\n\t\tvoid writeFullBytes( ::haxe::io::Bytes s,Int pos,Int len);\n\n\t\t::Dynamic writeFullBytes_dyn();\n\n\n\n\t\tvoid writeString(::String s);\n\n\t\t::Dynamic writeString_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace io\n\n\n\n#endif /* INCLUDED_haxe_io_Output */ \n","file_path":"export/windows/cpp/obj/include/haxe/io/Output.h","rank":50,"score":118876.56995826628},{"content":"\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"Eof\",\"\\x9c\",\"\\xbc\",\"\\x34\",\"\\x00\"); }\n\n\n\n\t\tvirtual ::String toString();\n\n\t\t::Dynamic toString_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace io\n\n\n\n#endif /* INCLUDED_haxe_io_Eof */ \n","file_path":"export/windows/cpp/obj/include/haxe/io/Eof.h","rank":51,"score":118875.43305605448},{"content":"\t\t::Dynamic blit_dyn();\n\n\n\n\t\t ::haxe::io::Bytes sub(Int pos,Int len);\n\n\t\t::Dynamic sub_dyn();\n\n\n\n\t\t::String getString(Int pos,Int len);\n\n\t\t::Dynamic getString_dyn();\n\n\n\n\t\tvirtual ::String toString();\n\n\t\t::Dynamic toString_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace io\n\n\n\n#endif /* INCLUDED_haxe_io_Bytes */ \n","file_path":"export/windows/cpp/obj/include/haxe/io/Bytes.h","rank":52,"score":118871.04176771177},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_lang_Iterator\n\n#define INCLUDED_haxe_lang_Iterator\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,lang,Iterator)\n\n\n\nnamespace haxe{\n\nnamespace lang{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/lang/Iterator.h","rank":53,"score":118866.8296684023},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_io_Input\n\n#define INCLUDED_haxe_io_Input\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Input)\n\n\n\nnamespace haxe{\n\nnamespace io{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/io/Input.h","rank":54,"score":118866.8296684023},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_io_Eof\n\n#define INCLUDED_haxe_io_Eof\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Eof)\n\n\n\nnamespace haxe{\n\nnamespace io{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/io/Eof.h","rank":55,"score":118866.8296684023},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_io_Bytes\n\n#define INCLUDED_haxe_io_Bytes\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Bytes)\n\n\n\nnamespace haxe{\n\nnamespace io{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/io/Bytes.h","rank":56,"score":118866.8296684023},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_io_Path\n\n#define INCLUDED_haxe_io_Path\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Path)\n\n\n\nnamespace haxe{\n\nnamespace io{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/io/Path.h","rank":57,"score":118866.8296684023},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_io_Error\n\n#define INCLUDED_haxe_io_Error\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Error)\n\nnamespace haxe{\n\nnamespace io{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/io/Error.h","rank":58,"score":118866.8296684023},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_io_Output\n\n#define INCLUDED_haxe_io_Output\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Bytes)\n\nHX_DECLARE_CLASS2(haxe,io,Output)\n\n\n\nnamespace haxe{\n\nnamespace io{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/io/Output.h","rank":59,"score":118866.61881549875},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_lang_Iterable\n\n#define INCLUDED_haxe_lang_Iterable\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,lang,Iterable)\n\nHX_DECLARE_CLASS2(haxe,lang,Iterator)\n\n\n\nnamespace haxe{\n\nnamespace lang{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/lang/Iterable.h","rank":60,"score":118866.61881549875},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_zip_Compress\n\n#define INCLUDED_haxe_zip_Compress\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Bytes)\n\nHX_DECLARE_CLASS2(haxe,zip,Compress)\n\nHX_DECLARE_CLASS2(haxe,zip,FlushMode)\n\n\n\nnamespace haxe{\n\nnamespace zip{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/zip/Compress.h","rank":61,"score":118866.3454995754},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_zip_Uncompress\n\n#define INCLUDED_haxe_zip_Uncompress\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Bytes)\n\nHX_DECLARE_CLASS2(haxe,zip,FlushMode)\n\nHX_DECLARE_CLASS2(haxe,zip,Uncompress)\n\n\n\nnamespace haxe{\n\nnamespace zip{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/zip/Uncompress.h","rank":62,"score":118866.3454995754},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_xml_Parser\n\n#define INCLUDED_haxe_xml_Parser\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS0(Xml)\n\nHX_DECLARE_CLASS1(haxe,IMap)\n\nHX_DECLARE_CLASS2(haxe,ds,StringMap)\n\nHX_DECLARE_CLASS2(haxe,xml,Parser)\n\n\n\nnamespace haxe{\n\nnamespace xml{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/xml/Parser.h","rank":63,"score":118866.1847948758},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_StackItem\n\n#define INCLUDED_haxe_StackItem\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS1(haxe,StackItem)\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/StackItem.h","rank":64,"score":118865.68598994333},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_CallStack\n\n#define INCLUDED_haxe_CallStack\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS0(StringBuf)\n\nHX_DECLARE_CLASS1(haxe,CallStack)\n\nHX_DECLARE_CLASS1(haxe,StackItem)\n\n\n\nnamespace haxe{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/CallStack.h","rank":65,"score":118865.08597227944},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_xml_Fast\n\n#define INCLUDED_haxe_xml_Fast\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS0(Xml)\n\nHX_DECLARE_CLASS2(haxe,xml,Fast)\n\nHX_DECLARE_CLASS3(haxe,xml,_Fast,AttribAccess)\n\nHX_DECLARE_CLASS3(haxe,xml,_Fast,HasAttribAccess)\n\nHX_DECLARE_CLASS3(haxe,xml,_Fast,HasNodeAccess)\n\nHX_DECLARE_CLASS3(haxe,xml,_Fast,NodeAccess)\n\nHX_DECLARE_CLASS3(haxe,xml,_Fast,NodeListAccess)\n\n\n\nnamespace haxe{\n\nnamespace xml{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/xml/Fast.h","rank":66,"score":118865.0659216143},{"content":"\t\tvoid destroy();\n\n\t\t::Dynamic destroy_dyn();\n\n\n\n\t\t ::flixel::util::FlxTimer start(hx::Null< Float > Time, ::Dynamic OnComplete,hx::Null< Int > Loops);\n\n\t\t::Dynamic start_dyn();\n\n\n\n\t\t ::flixel::util::FlxTimer reset(hx::Null< Float > NewTime);\n\n\t\t::Dynamic reset_dyn();\n\n\n\n\t\tvoid cancel();\n\n\t\t::Dynamic cancel_dyn();\n\n\n\n\t\tvoid update(Float elapsed);\n\n\t\t::Dynamic update_dyn();\n\n\n\n\t\tFloat get_timeLeft();\n\n\t\t::Dynamic get_timeLeft_dyn();\n\n\n\n\t\tFloat get_elapsedTime();\n\n\t\t::Dynamic get_elapsedTime_dyn();\n","file_path":"export/windows/cpp/obj/include/flixel/util/FlxTimer.h","rank":67,"score":116935.49961141686},{"content":"\t\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\n\n\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\tvoid *_hx_getInterface(int inHash);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"FlxTimer\",\"\\x13\",\"\\xca\",\"\\x0f\",\"\\xcd\"); }\n\n\n\n\t\tstatic ::flixel::util::FlxTimerManager manager;\n\n\t\tFloat time;\n\n\t\tInt loops;\n\n\t\tBool active;\n\n\t\tBool finished;\n\n\t\t ::Dynamic onComplete;\n\n\t\t ::Dynamic &onComplete_dyn() { return onComplete;}\n\n\t\tFloat _timeCounter;\n\n\t\tInt _loopsCounter;\n\n\t\tBool _inManager;\n","file_path":"export/windows/cpp/obj/include/flixel/util/FlxTimer.h","rank":68,"score":116934.29415259432},{"content":"\n\n\t\tInt get_loopsLeft();\n\n\t\t::Dynamic get_loopsLeft_dyn();\n\n\n\n\t\tInt get_elapsedLoops();\n\n\t\t::Dynamic get_elapsedLoops_dyn();\n\n\n\n\t\tFloat get_progress();\n\n\t\t::Dynamic get_progress_dyn();\n\n\n\n};\n\n\n\n} // end namespace flixel\n\n} // end namespace util\n\n\n\n#endif /* INCLUDED_flixel_util_FlxTimer */ \n","file_path":"export/windows/cpp/obj/include/flixel/util/FlxTimer.h","rank":69,"score":116918.31025401094},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_flixel_util_FlxTimer\n\n#define INCLUDED_flixel_util_FlxTimer\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\n#ifndef INCLUDED_flixel_util_IFlxDestroyable\n\n#include <flixel/util/IFlxDestroyable.h>\n\n#endif\n\nHX_DECLARE_CLASS1(flixel,FlxBasic)\n\nHX_DECLARE_CLASS2(flixel,util,FlxTimer)\n\nHX_DECLARE_CLASS2(flixel,util,FlxTimerManager)\n\nHX_DECLARE_CLASS2(flixel,util,IFlxDestroyable)\n\n\n\nnamespace flixel{\n\nnamespace util{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/flixel/util/FlxTimer.h","rank":70,"score":116913.643860138},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"BytesBuffer\",\"\\xab\",\"\\x73\",\"\\x22\",\"\\xf6\"); }\n\n\n\n\t\t::Array< unsigned char > b;\n\n\t\t ::haxe::io::Bytes getBytes();\n\n\t\t::Dynamic getBytes_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace io\n\n\n\n#endif /* INCLUDED_haxe_io_BytesBuffer */ \n","file_path":"export/windows/cpp/obj/include/haxe/io/BytesBuffer.h","rank":71,"score":116642.09132108769},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"TreeNode\",\"\\xa0\",\"\\x92\",\"\\x83\",\"\\x06\"); }\n\n\n\n\t\t ::haxe::ds::TreeNode left;\n\n\t\t ::haxe::ds::TreeNode right;\n\n\t\t ::Dynamic key;\n\n\t\t ::Dynamic value;\n\n\t\tInt _height;\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace ds\n\n\n\n#endif /* INCLUDED_haxe_ds_TreeNode */ \n","file_path":"export/windows/cpp/obj/include/haxe/ds/TreeNode.h","rank":72,"score":116641.92662791381},{"content":" template<typename F>\n\n inline void set(int key, const ::cpp::Function<F> &value) {__int_hash_set(h,key,value); }\n\n template<typename V>\n\n inline void set(int key, const ::cpp::Pointer<V> &value) {__int_hash_set(h,key,(Dynamic)value ); }\n\n\n\n template<typename VALUE>\n\n inline Void set(Dynamic &key, const VALUE &value) { set( (int)key, value ); return null(); }\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace ds\n\n\n\n#endif /* INCLUDED_haxe_ds_IntMap */ \n","file_path":"export/windows/cpp/obj/include/haxe/ds/IntMap.h","rank":73,"score":116641.63226838465},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"JsonParser\",\"\\x47\",\"\\x65\",\"\\x2e\",\"\\x25\"); }\n\n\n\n\t\t::String str;\n\n\t\tInt pos;\n\n\t\t ::Dynamic parseRec();\n\n\t\t::Dynamic parseRec_dyn();\n\n\n\n\t\t::String parseString();\n\n\t\t::Dynamic parseString_dyn();\n\n\n\n\t\tvoid invalidChar();\n\n\t\t::Dynamic invalidChar_dyn();\n\n\n\n\t\tvoid invalidNumber(Int start);\n\n\t\t::Dynamic invalidNumber_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace format\n\n\n\n#endif /* INCLUDED_haxe_format_JsonParser */ \n","file_path":"export/windows/cpp/obj/include/haxe/format/JsonParser.h","rank":74,"score":116640.46240834262},{"content":"\n\n template<typename V, typename H>\n\n inline void set(String key, const ::cpp::Struct<V,H> &value) {__string_hash_set(h,key,value); }\n\n template<typename V>\n\n inline void set(String key, const ::cpp::Function<V> &value) {__string_hash_set(h,key,(Dynamic)value ); }\n\n template<typename V>\n\n inline void set(String key, const ::cpp::Pointer<V> &value) {__string_hash_set(h,key,(Dynamic)value ); }\n\n\n\n template<typename VALUE>\n\n inline Void set(Dynamic &key, const VALUE &value) { set( (String)key, value ); return null(); }\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace ds\n\n\n\n#endif /* INCLUDED_haxe_ds_StringMap */ \n","file_path":"export/windows/cpp/obj/include/haxe/ds/StringMap.h","rank":75,"score":116633.7650152168},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"BalancedTree\",\"\\x66\",\"\\x71\",\"\\xf8\",\"\\xaa\"); }\n\n\n\n\t\t ::haxe::ds::TreeNode root;\n\n\t\tvoid set( ::Dynamic key, ::Dynamic value);\n\n\t\t::Dynamic set_dyn();\n\n\n\n\t\t ::Dynamic get( ::Dynamic key);\n\n\t\t::Dynamic get_dyn();\n\n\n\n\t\t ::haxe::ds::TreeNode setLoop( ::Dynamic k, ::Dynamic v, ::haxe::ds::TreeNode node);\n\n\t\t::Dynamic setLoop_dyn();\n\n\n\n\t\t ::haxe::ds::TreeNode balance( ::haxe::ds::TreeNode l, ::Dynamic k, ::Dynamic v, ::haxe::ds::TreeNode r);\n\n\t\t::Dynamic balance_dyn();\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/ds/BalancedTree.h","rank":76,"score":116631.87241573833},{"content":" inline void set(Dynamic key, const ::cpp::Struct<V,H> &value) {__object_hash_set(h,key,value); }\n\n template<typename V>\n\n inline void set(Dynamic key, const ::cpp::Function<V> &value) {__object_hash_set(h,key,(Dynamic)value ); }\n\n template<typename V>\n\n inline void set(Dynamic key, const ::cpp::Pointer<V> &value) {__object_hash_set(h,key,(Dynamic)value ); }\n\n\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace ds\n\n\n\n#endif /* INCLUDED_haxe_ds_ObjectMap */ \n","file_path":"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h","rank":77,"score":116631.48238696535},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\tvoid *_hx_getInterface(int inHash);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"ObjectMap\",\"\\xfd\",\"\\xa4\",\"\\x50\",\"\\xe5\"); }\n\n\n\n\t\t ::Dynamic h;\n\n\t\tvoid set( ::Dynamic key, ::Dynamic value);\n\n\t\t::Dynamic set_dyn();\n\n\n\n\t\t ::Dynamic get( ::Dynamic key);\n\n\t\t::Dynamic get_dyn();\n\n\n\n\t\tBool exists( ::Dynamic key);\n\n\t\t::Dynamic exists_dyn();\n\n\n\n\t\tBool remove( ::Dynamic key);\n\n\t\t::Dynamic remove_dyn();\n","file_path":"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h","rank":78,"score":116631.28750386862},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\tvoid *_hx_getInterface(int inHash);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"StringMap\",\"\\x2b\",\"\\x12\",\"\\x8c\",\"\\x69\"); }\n\n\n\n\t\t ::Dynamic h;\n\n\t\tvoid set(::String key, ::Dynamic value);\n\n\t\t::Dynamic set_dyn();\n\n\n\n\t\t ::Dynamic get(::String key);\n\n\t\t::Dynamic get_dyn();\n\n\n\n\t\tBool exists(::String key);\n\n\t\t::Dynamic exists_dyn();\n\n\n\n\t\tBool remove(::String key);\n\n\t\t::Dynamic remove_dyn();\n","file_path":"export/windows/cpp/obj/include/haxe/ds/StringMap.h","rank":79,"score":116630.9044816804},{"content":"\t\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\n\n\t\tvoid __GetFields(Array< ::String> &outFields);\n\n\t\tstatic void __register();\n\n\t\tvoid __Mark(HX_MARK_PARAMS);\n\n\t\tvoid __Visit(HX_VISIT_PARAMS);\n\n\t\tvoid *_hx_getInterface(int inHash);\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"IntMap\",\"\\x0d\",\"\\xa9\",\"\\x08\",\"\\xd3\"); }\n\n\n\n\t\t ::Dynamic h;\n\n\t\tvoid set(Int key, ::Dynamic value);\n\n\t\t::Dynamic set_dyn();\n\n\n\n\t\t ::Dynamic get(Int key);\n\n\t\t::Dynamic get_dyn();\n\n\n\n\t\tBool exists(Int key);\n\n\t\t::Dynamic exists_dyn();\n\n\n\n\t\tBool remove(Int key);\n\n\t\t::Dynamic remove_dyn();\n","file_path":"export/windows/cpp/obj/include/haxe/ds/IntMap.h","rank":80,"score":116630.9044816804},{"content":"\t\tstatic void __register();\n\n\t\t::String __ToString() const { return HX_HCSTRING(\"DefaultResolver\",\"\\xc7\",\"\\x41\",\"\\x4a\",\"\\x96\"); }\n\n\n\n\t\thx::Class resolveClass(::String name);\n\n\t\t::Dynamic resolveClass_dyn();\n\n\n\n\t\thx::Class resolveEnum(::String name);\n\n\t\t::Dynamic resolveEnum_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace _Unserializer\n\n\n\n#endif /* INCLUDED_haxe__Unserializer_DefaultResolver */ \n","file_path":"export/windows/cpp/obj/include/haxe/_Unserializer/DefaultResolver.h","rank":81,"score":116630.15393970073},{"content":"\t\tvirtual Int compare( ::Dynamic k1, ::Dynamic k2);\n\n\t\t::Dynamic compare_dyn();\n\n\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace ds\n\n\n\n#endif /* INCLUDED_haxe_ds_BalancedTree */ \n","file_path":"export/windows/cpp/obj/include/haxe/ds/BalancedTree.h","rank":82,"score":116627.9686884337},{"content":"\n\n\t\t ::Dynamic keys();\n\n\t\t::Dynamic keys_dyn();\n\n\n\n\n\n inline void set(Dynamic key, ::null value) { __object_hash_set(h,key,value); }\n\n inline void set(Dynamic key, bool value) { __object_hash_set(h,key,value); }\n\n inline void set(Dynamic key, char value) { __object_hash_set_int(h,key,value); }\n\n inline void set(Dynamic key, unsigned char value) { __object_hash_set_int(h,key,value); }\n\n inline void set(Dynamic key, signed char value) { __object_hash_set_int(h,key,value); }\n\n inline void set(Dynamic key, short value) { __object_hash_set_int(h,key,value); }\n\n inline void set(Dynamic key, unsigned short value) { __object_hash_set_int(h,key,value); }\n\n inline void set(Dynamic key, int value) { __object_hash_set_int(h,key,value); }\n\n inline void set(Dynamic key, unsigned int value) { __object_hash_set_int(h,key,value); }\n\n inline void set(Dynamic key, float value) { __object_hash_set_float(h,key,value); }\n\n inline void set(Dynamic key, double value) { __object_hash_set_float(h,key,value); }\n\n inline void set(Dynamic key, ::String value) { __object_hash_set_string(h,key,value); }\n\n\n\n\n\n template<typename V, typename H>\n","file_path":"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h","rank":83,"score":116626.61163049004},{"content":"\n\n\t\t ::Dynamic keys();\n\n\t\t::Dynamic keys_dyn();\n\n\n\n\t\t ::Dynamic iterator();\n\n\t\t::Dynamic iterator_dyn();\n\n\n\n\n\n inline void set(String key, ::null value) { __string_hash_set(h,key,value); }\n\n inline void set(String key, bool value) { __string_hash_set(h,key,value); }\n\n inline void set(String key, char value) { __string_hash_set_int(h,key,value); }\n\n inline void set(String key, unsigned char value) { __string_hash_set_int(h,key,value); }\n\n inline void set(String key, signed char value) { __string_hash_set_int(h,key,value); }\n\n inline void set(String key, short value) { __string_hash_set_int(h,key,value); }\n\n inline void set(String key, unsigned short value) { __string_hash_set_int(h,key,value); }\n\n inline void set(String key, int value) { __string_hash_set_int(h,key,value); }\n\n inline void set(String key, unsigned int value) { __string_hash_set_int(h,key,value); }\n\n inline void set(String key, float value) { __string_hash_set_float(h,key,value); }\n\n inline void set(String key, double value) { __string_hash_set_float(h,key,value); }\n\n inline void set(String key, ::String value) { __string_hash_set_string(h,key,value); }\n","file_path":"export/windows/cpp/obj/include/haxe/ds/StringMap.h","rank":84,"score":116624.83494133218},{"content":"\n\n\t\t ::Dynamic keys();\n\n\t\t::Dynamic keys_dyn();\n\n\n\n\n\n inline void set(int key, ::null value) { __int_hash_set(h,key,value); }\n\n inline void set(int key, bool value) { __int_hash_set(h,key,value); }\n\n inline void set(int key, char value) { __int_hash_set_int(h,key,value); }\n\n inline void set(int key, unsigned char value) { __int_hash_set_int(h,key,value); }\n\n inline void set(int key, signed char value) { __int_hash_set_int(h,key,value); }\n\n inline void set(int key, short value) { __int_hash_set_int(h,key,value); }\n\n inline void set(int key, unsigned short value) { __int_hash_set_int(h,key,value); }\n\n inline void set(int key, int value) { __int_hash_set_int(h,key,value); }\n\n inline void set(int key, unsigned int value) { __int_hash_set_int(h,key,value); }\n\n inline void set(int key, float value) { __int_hash_set_float(h,key,value); }\n\n inline void set(int key, double value) { __int_hash_set_float(h,key,value); }\n\n inline void set(int key, ::String value) { __int_hash_set_string(h,key,value); }\n\n\n\n template<typename V, typename H>\n\n inline void set(int key, const ::cpp::Struct<V,H> &value) {__int_hash_set(h,key,value); }\n","file_path":"export/windows/cpp/obj/include/haxe/ds/IntMap.h","rank":85,"score":116622.78233468426},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_ds_StringMap\n\n#define INCLUDED_haxe_ds_StringMap\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\n#ifndef INCLUDED_haxe_IMap\n\n#include <haxe/IMap.h>\n\n#endif\n\nHX_DECLARE_CLASS1(haxe,IMap)\n\nHX_DECLARE_CLASS2(haxe,ds,StringMap)\n\n\n\nnamespace haxe{\n\nnamespace ds{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/ds/StringMap.h","rank":86,"score":116622.69194339824},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_ds_IntMap\n\n#define INCLUDED_haxe_ds_IntMap\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\n#ifndef INCLUDED_haxe_IMap\n\n#include <haxe/IMap.h>\n\n#endif\n\nHX_DECLARE_CLASS1(haxe,IMap)\n\nHX_DECLARE_CLASS2(haxe,ds,IntMap)\n\n\n\nnamespace haxe{\n\nnamespace ds{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/ds/IntMap.h","rank":87,"score":116622.69194339824},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_ds_ObjectMap\n\n#define INCLUDED_haxe_ds_ObjectMap\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\n#ifndef INCLUDED_haxe_IMap\n\n#include <haxe/IMap.h>\n\n#endif\n\nHX_DECLARE_CLASS1(haxe,IMap)\n\nHX_DECLARE_CLASS2(haxe,ds,ObjectMap)\n\n\n\nnamespace haxe{\n\nnamespace ds{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h","rank":88,"score":116622.69194339824},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_zip_FlushMode\n\n#define INCLUDED_haxe_zip_FlushMode\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,zip,FlushMode)\n\nnamespace haxe{\n\nnamespace zip{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/zip/FlushMode.h","rank":89,"score":116622.39486138537},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_ds_TreeNode\n\n#define INCLUDED_haxe_ds_TreeNode\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,ds,TreeNode)\n\n\n\nnamespace haxe{\n\nnamespace ds{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/ds/TreeNode.h","rank":90,"score":116622.39486138537},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe__Unserializer_DefaultResolver\n\n#define INCLUDED_haxe__Unserializer_DefaultResolver\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,_Unserializer,DefaultResolver)\n\n\n\nnamespace haxe{\n\nnamespace _Unserializer{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/_Unserializer/DefaultResolver.h","rank":91,"score":116622.39486138537},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_format_JsonParser\n\n#define INCLUDED_haxe_format_JsonParser\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,format,JsonParser)\n\n\n\nnamespace haxe{\n\nnamespace format{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/format/JsonParser.h","rank":92,"score":116622.39486138537},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_io_BytesBuffer\n\n#define INCLUDED_haxe_io_BytesBuffer\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,io,Bytes)\n\nHX_DECLARE_CLASS2(haxe,io,BytesBuffer)\n\n\n\nnamespace haxe{\n\nnamespace io{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/io/BytesBuffer.h","rank":93,"score":116622.19575065663},{"content":"// Generated by Haxe 3.3.0\n\n#ifndef INCLUDED_haxe_ds_BalancedTree\n\n#define INCLUDED_haxe_ds_BalancedTree\n\n\n\n#ifndef HXCPP_H\n\n#include <hxcpp.h>\n\n#endif\n\n\n\nHX_DECLARE_CLASS2(haxe,ds,BalancedTree)\n\nHX_DECLARE_CLASS2(haxe,ds,TreeNode)\n\n\n\nnamespace haxe{\n\nnamespace ds{\n\n\n\n\n","file_path":"export/windows/cpp/obj/include/haxe/ds/BalancedTree.h","rank":94,"score":116622.139276171},{"content":"\t\tstatic ::haxe::zip::FlushMode NO;\n\n\t\tstatic inline ::haxe::zip::FlushMode NO_dyn() { return NO; }\n\n\t\tstatic ::haxe::zip::FlushMode SYNC;\n\n\t\tstatic inline ::haxe::zip::FlushMode SYNC_dyn() { return SYNC; }\n\n};\n\n\n\n} // end namespace haxe\n\n} // end namespace zip\n\n\n\n#endif /* INCLUDED_haxe_zip_FlushMode */ \n","file_path":"export/windows/cpp/obj/include/haxe/zip/FlushMode.h","rank":95,"score":116620.22173494939},{"content":"// Generated by Haxe 3.3.0\n\n#include <hxcpp.h>\n\n\n\n#ifndef INCLUDED_haxe__Unserializer_NullResolver\n\n#include <haxe/_Unserializer/NullResolver.h>\n\n#endif\n\n\n\nnamespace haxe{\n\nnamespace _Unserializer{\n\n\n\nvoid NullResolver_obj::__construct(){\n\n \tHX_STACK_FRAME(\"haxe._Unserializer.NullResolver\",\"new\",0x49a2304b,\"haxe._Unserializer.NullResolver.new\",\"C:\\\\Haxe\\\\haxe\\\\std/haxe/Unserializer.hx\",477,0x81c40bdb)\n\n \tHX_STACK_THIS(this)\n\n \t}\n\n\n\nDynamic NullResolver_obj::__CreateEmpty() { return new NullResolver_obj; }\n\n\n\nhx::ObjectPtr< NullResolver_obj > NullResolver_obj::__new()\n\n{\n\n\thx::ObjectPtr< NullResolver_obj > _hx_result = new NullResolver_obj();\n","file_path":"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp","rank":96,"score":115504.95586954909},{"content":"\t_hx_result->__construct();\n\n\treturn _hx_result;\n\n}\n\n\n\nDynamic NullResolver_obj::__Create(hx::DynamicArray inArgs)\n\n{\n\n\thx::ObjectPtr< NullResolver_obj > _hx_result = new NullResolver_obj();\n\n\t_hx_result->__construct();\n\n\treturn _hx_result;\n\n}\n\n\n\nhx::Class NullResolver_obj::resolveClass(::String name){\n\n \tHX_STACK_FRAME(\"haxe._Unserializer.NullResolver\",\"resolveClass\",0xc4a78861,\"haxe._Unserializer.NullResolver.resolveClass\",\"C:\\\\Haxe\\\\haxe\\\\std/haxe/Unserializer.hx\",478,0x81c40bdb)\n\n \tHX_STACK_THIS(this)\n\n \tHX_STACK_ARG(name,\"name\")\n\nHXLINE( 478)\t\treturn null();\n\n \t}\n\n\n\n\n\nHX_DEFINE_DYNAMIC_FUNC1(NullResolver_obj,resolveClass,return )\n","file_path":"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp","rank":97,"score":115494.52781958974},{"content":"\n\nhx::Class NullResolver_obj::resolveEnum(::String name){\n\n \tHX_STACK_FRAME(\"haxe._Unserializer.NullResolver\",\"resolveEnum\",0x5f3252f8,\"haxe._Unserializer.NullResolver.resolveEnum\",\"C:\\\\Haxe\\\\haxe\\\\std/haxe/Unserializer.hx\",479,0x81c40bdb)\n\n \tHX_STACK_THIS(this)\n\n \tHX_STACK_ARG(name,\"name\")\n\nHXLINE( 479)\t\treturn null();\n\n \t}\n\n\n\n\n\nHX_DEFINE_DYNAMIC_FUNC1(NullResolver_obj,resolveEnum,return )\n\n\n\n ::haxe::_Unserializer::NullResolver NullResolver_obj::instance;\n\n\n\n\n\nNullResolver_obj::NullResolver_obj()\n\n{\n\n}\n\n\n\nhx::Val NullResolver_obj::__Field(const ::String &inName,hx::PropertyAccess inCallProp)\n\n{\n","file_path":"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp","rank":98,"score":115488.66823247627},{"content":"\tswitch(inName.length) {\n\n\tcase 11:\n\n\t\tif (HX_FIELD_EQ(inName,\"resolveEnum\") ) { return hx::Val( resolveEnum_dyn()); }\n\n\t\tbreak;\n\n\tcase 12:\n\n\t\tif (HX_FIELD_EQ(inName,\"resolveClass\") ) { return hx::Val( resolveClass_dyn()); }\n\n\t}\n\n\treturn super::__Field(inName,inCallProp);\n\n}\n\n\n\nbool NullResolver_obj::__GetStatic(const ::String &inName, Dynamic &outValue, hx::PropertyAccess inCallProp)\n\n{\n\n\tswitch(inName.length) {\n\n\tcase 8:\n\n\t\tif (HX_FIELD_EQ(inName,\"instance\") ) { outValue = instance; return true; }\n\n\t}\n\n\treturn false;\n\n}\n\n\n\nbool NullResolver_obj::__SetStatic(const ::String &inName,Dynamic &ioValue,hx::PropertyAccess inCallProp)\n","file_path":"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp","rank":99,"score":115487.84878105036}],"string":"[\n {\n \"content\": \"class HXCPP_CLASS_ATTRIBUTES Timer_obj : public hx::Object\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef hx::Object super;\\n\\n\\t\\ttypedef Timer_obj OBJ_;\\n\\n\\t\\tTimer_obj();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid __construct(Float time);\\n\\n\\t\\tinline void *operator new(size_t inSize, bool inContainer=true,const char *inName=\\\"haxe.Timer\\\")\\n\\n\\t\\t\\t{ return hx::Object::operator new(inSize,inContainer,inName); }\\n\\n\\t\\tinline void *operator new(size_t inSize, int extra)\\n\\n\\t\\t\\t{ return hx::Object::operator new(inSize+extra,true,\\\"haxe.Timer\\\"); }\\n\\n\\t\\tstatic hx::ObjectPtr< Timer_obj > __new(Float time);\\n\\n\\t\\tstatic Dynamic __CreateEmpty();\\n\\n\\t\\tstatic Dynamic __Create(hx::DynamicArray inArgs);\\n\\n\\t\\t//~Timer_obj();\\n\\n\\n\\n\\t\\tHX_DO_RTTI_ALL;\\n\\n\\t\\thx::Val __Field(const ::String &inString, hx::PropertyAccess inCallProp);\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Timer.h\",\n \"rank\": 0,\n \"score\": 195030.109864606\n },\n {\n \"content\": \"\\t\\tstatic Float stamp();\\n\\n\\t\\tstatic ::Dynamic stamp_dyn();\\n\\n\\n\\n\\t\\tstatic void _hx___checkTimers();\\n\\n\\t\\tstatic ::Dynamic _hx___checkTimers_dyn();\\n\\n\\n\\n\\t\\tstatic Float _hx___nextWake(Float limit);\\n\\n\\t\\tstatic ::Dynamic _hx___nextWake_dyn();\\n\\n\\n\\n\\t\\tstatic ::Dynamic lime_time_stamp;\\n\\n\\t\\tstatic ::Dynamic &lime_time_stamp_dyn() { return lime_time_stamp;}\\n\\n\\t\\tFloat mTime;\\n\\n\\t\\tFloat mFireAt;\\n\\n\\t\\tBool mRunning;\\n\\n\\t\\t::Dynamic run;\\n\\n\\t\\tinline ::Dynamic &run_dyn() {return run; }\\n\\n\\n\\n\\t\\tvoid stop();\\n\\n\\t\\t::Dynamic stop_dyn();\\n\\n\\n\\n\\t\\tvoid _hx___check(Float inTime);\\n\\n\\t\\t::Dynamic _hx___check_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n\\n\\n#endif /* INCLUDED_haxe_Timer */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Timer.h\",\n \"rank\": 1,\n \"score\": 182495.56334394234\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Timer\\\",\\\"\\\\xa5\\\",\\\"\\\\x2f\\\",\\\"\\\\x63\\\",\\\"\\\\xa3\\\"); }\\n\\n\\n\\n\\t\\tstatic void __boot();\\n\\n\\t\\tstatic ::Array< ::Dynamic> sRunningTimers;\\n\\n\\t\\tstatic ::haxe::Timer delay( ::Dynamic f,Int time);\\n\\n\\t\\tstatic ::Dynamic delay_dyn();\\n\\n\\n\\n\\t\\tstatic Float getMS();\\n\\n\\t\\tstatic ::Dynamic getMS_dyn();\\n\\n\\n\\n\\t\\tstatic ::Dynamic measure( ::Dynamic f, ::Dynamic pos);\\n\\n\\t\\tstatic ::Dynamic measure_dyn();\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Timer.h\",\n \"rank\": 2,\n \"score\": 182488.76642533243\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_Timer\\n\\n#define INCLUDED_haxe_Timer\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS1(haxe,Timer)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Timer.h\",\n \"rank\": 3,\n \"score\": 182469.25554587154\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"NullResolver\\\",\\\"\\\\xcd\\\",\\\"\\\\x81\\\",\\\"\\\\x9f\\\",\\\"\\\\xf1\\\"); }\\n\\n\\n\\n\\t\\tstatic ::haxe::_Unserializer::NullResolver instance;\\n\\n\\t\\thx::Class resolveClass(::String name);\\n\\n\\t\\t::Dynamic resolveClass_dyn();\\n\\n\\n\\n\\t\\thx::Class resolveEnum(::String name);\\n\\n\\t\\t::Dynamic resolveEnum_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace _Unserializer\\n\\n\\n\\n#endif /* INCLUDED_haxe__Unserializer_NullResolver */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/_Unserializer/NullResolver.h\",\n \"rank\": 4,\n \"score\": 175619.2902763549\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe__Unserializer_NullResolver\\n\\n#define INCLUDED_haxe__Unserializer_NullResolver\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,_Unserializer,NullResolver)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace _Unserializer{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/_Unserializer/NullResolver.h\",\n \"rank\": 5,\n \"score\": 175608.17102341115\n },\n {\n \"content\": \"class HXCPP_CLASS_ATTRIBUTES NullResolver_obj : public hx::Object\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef hx::Object super;\\n\\n\\t\\ttypedef NullResolver_obj OBJ_;\\n\\n\\t\\tNullResolver_obj();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid __construct();\\n\\n\\t\\tinline void *operator new(size_t inSize, bool inContainer=false,const char *inName=\\\"haxe._Unserializer.NullResolver\\\")\\n\\n\\t\\t\\t{ return hx::Object::operator new(inSize,inContainer,inName); }\\n\\n\\t\\tinline void *operator new(size_t inSize, int extra)\\n\\n\\t\\t\\t{ return hx::Object::operator new(inSize+extra,false,\\\"haxe._Unserializer.NullResolver\\\"); }\\n\\n\\t\\tstatic hx::ObjectPtr< NullResolver_obj > __new();\\n\\n\\t\\tstatic Dynamic __CreateEmpty();\\n\\n\\t\\tstatic Dynamic __Create(hx::DynamicArray inArgs);\\n\\n\\t\\t//~NullResolver_obj();\\n\\n\\n\\n\\t\\tHX_DO_RTTI_ALL;\\n\\n\\t\\thx::Val __Field(const ::String &inString, hx::PropertyAccess inCallProp);\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/_Unserializer/NullResolver.h\",\n \"rank\": 6,\n \"score\": 165414.484600914\n },\n {\n \"content\": \"class HXCPP_CLASS_ATTRIBUTES ByteArray_obj : public ::haxe::io::Bytes_obj\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef ::haxe::io::Bytes_obj super;\\n\\n\\t\\ttypedef ByteArray_obj OBJ_;\\n\\n\\t\\tByteArray_obj();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid __construct(hx::Null< Int > __o_size);\\n\\n\\t\\tinline void *operator new(size_t inSize, bool inContainer=true,const char *inName=\\\"openfl._legacy.utils.ByteArray\\\")\\n\\n\\t\\t\\t{ return hx::Object::operator new(inSize,inContainer,inName); }\\n\\n\\t\\tinline void *operator new(size_t inSize, int extra)\\n\\n\\t\\t\\t{ return hx::Object::operator new(inSize+extra,true,\\\"openfl._legacy.utils.ByteArray\\\"); }\\n\\n\\t\\tstatic hx::ObjectPtr< ByteArray_obj > __new(hx::Null< Int > __o_size);\\n\\n\\t\\tstatic Dynamic __CreateEmpty();\\n\\n\\t\\tstatic Dynamic __Create(hx::DynamicArray inArgs);\\n\\n\\t\\t//~ByteArray_obj();\\n\\n\\n\\n\\t\\tHX_DO_RTTI_ALL;\\n\\n\\t\\thx::Val __Field(const ::String &inString, hx::PropertyAccess inCallProp);\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/openfl/_legacy/utils/ByteArray.h\",\n \"rank\": 7,\n \"score\": 158703.65765527412\n },\n {\n \"content\": \"\\t\\tInt pos;\\n\\n\\t\\tInt length;\\n\\n\\t\\t::cpp::VirtualArray cache;\\n\\n\\t\\t::Array< ::String > scache;\\n\\n\\t\\t ::Dynamic resolver;\\n\\n\\t\\tvoid setResolver( ::Dynamic r);\\n\\n\\t\\t::Dynamic setResolver_dyn();\\n\\n\\n\\n\\t\\tInt readDigits();\\n\\n\\t\\t::Dynamic readDigits_dyn();\\n\\n\\n\\n\\t\\tFloat readFloat();\\n\\n\\t\\t::Dynamic readFloat_dyn();\\n\\n\\n\\n\\t\\tvoid unserializeObject( ::Dynamic o);\\n\\n\\t\\t::Dynamic unserializeObject_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic unserializeEnum(hx::Class edecl,::String tag);\\n\\n\\t\\t::Dynamic unserializeEnum_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic unserialize();\\n\\n\\t\\t::Dynamic unserialize_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n\\n\\n#endif /* INCLUDED_haxe_Unserializer */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Unserializer.h\",\n \"rank\": 8,\n \"score\": 121219.3596996057\n },\n {\n \"content\": \"\\t\\tInt scount;\\n\\n\\t\\tBool useCache;\\n\\n\\t\\tBool useEnumIndex;\\n\\n\\t\\tvirtual ::String toString();\\n\\n\\t\\t::Dynamic toString_dyn();\\n\\n\\n\\n\\t\\tvoid serializeString(::String s);\\n\\n\\t\\t::Dynamic serializeString_dyn();\\n\\n\\n\\n\\t\\tBool serializeRef( ::Dynamic v);\\n\\n\\t\\t::Dynamic serializeRef_dyn();\\n\\n\\n\\n\\t\\tvoid serializeFields( ::Dynamic v);\\n\\n\\t\\t::Dynamic serializeFields_dyn();\\n\\n\\n\\n\\t\\tvoid serialize( ::Dynamic v);\\n\\n\\t\\t::Dynamic serialize_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n\\n\\n#endif /* INCLUDED_haxe_Serializer */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Serializer.h\",\n \"rank\": 9,\n \"score\": 121215.17104553738\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Serializer\\\",\\\"\\\\xb2\\\",\\\"\\\\xca\\\",\\\"\\\\xd0\\\",\\\"\\\\x55\\\"); }\\n\\n\\n\\n\\t\\tstatic void __boot();\\n\\n\\t\\tstatic Bool USE_CACHE;\\n\\n\\t\\tstatic Bool USE_ENUM_INDEX;\\n\\n\\t\\tstatic ::String BASE64;\\n\\n\\t\\tstatic ::Array< ::Dynamic> BASE64_CODES;\\n\\n\\t\\tstatic ::String run( ::Dynamic v);\\n\\n\\t\\tstatic ::Dynamic run_dyn();\\n\\n\\n\\n\\t\\t ::StringBuf buf;\\n\\n\\t\\t::cpp::VirtualArray cache;\\n\\n\\t\\t ::haxe::ds::StringMap shash;\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Serializer.h\",\n \"rank\": 10,\n \"score\": 121212.46275034203\n },\n {\n \"content\": \"\\t\\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Log\\\",\\\"\\\\x64\\\",\\\"\\\\x0c\\\",\\\"\\\\x3a\\\",\\\"\\\\x00\\\"); }\\n\\n\\n\\n\\t\\tstatic void __boot();\\n\\n\\t\\tstatic ::Dynamic trace;\\n\\n\\t\\tstatic inline ::Dynamic &trace_dyn() {return trace; }\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n\\n\\n#endif /* INCLUDED_haxe_Log */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Log.h\",\n \"rank\": 11,\n \"score\": 121212.45252078192\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Unserializer\\\",\\\"\\\\x4b\\\",\\\"\\\\x42\\\",\\\"\\\\x41\\\",\\\"\\\\x93\\\"); }\\n\\n\\n\\n\\t\\tstatic void __boot();\\n\\n\\t\\tstatic ::Dynamic DEFAULT_RESOLVER;\\n\\n\\t\\tstatic ::String BASE64;\\n\\n\\t\\tstatic ::Array< Int > CODES;\\n\\n\\t\\tstatic ::Array< Int > initCodes();\\n\\n\\t\\tstatic ::Dynamic initCodes_dyn();\\n\\n\\n\\n\\t\\tstatic ::Dynamic run(::String v);\\n\\n\\t\\tstatic ::Dynamic run_dyn();\\n\\n\\n\\n\\t\\t::String buf;\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Unserializer.h\",\n \"rank\": 12,\n \"score\": 121207.81174627165\n },\n {\n \"content\": \"\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Resource\\\",\\\"\\\\xee\\\",\\\"\\\\x18\\\",\\\"\\\\x52\\\",\\\"\\\\xec\\\"); }\\n\\n\\n\\n\\t\\tstatic ::haxe::io::Bytes getBytes(::String name);\\n\\n\\t\\tstatic ::Dynamic getBytes_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n\\n\\n#endif /* INCLUDED_haxe_Resource */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Resource.h\",\n \"rank\": 13,\n \"score\": 121206.41226342598\n },\n {\n \"content\": \"\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Utf8\\\",\\\"\\\\x51\\\",\\\"\\\\x81\\\",\\\"\\\\x87\\\",\\\"\\\\x38\\\"); }\\n\\n\\n\\n\\t\\tstatic Int charCodeAt(::String s,Int index);\\n\\n\\t\\tstatic ::Dynamic charCodeAt_dyn();\\n\\n\\n\\n\\t\\tstatic Int length(::String s);\\n\\n\\t\\tstatic ::Dynamic length_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n\\n\\n#endif /* INCLUDED_haxe_Utf8 */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Utf8.h\",\n \"rank\": 14,\n \"score\": 121206.04367018919\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_Utf8\\n\\n#define INCLUDED_haxe_Utf8\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS1(haxe,Utf8)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Utf8.h\",\n \"rank\": 15,\n \"score\": 121198.24502775673\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_Log\\n\\n#define INCLUDED_haxe_Log\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS1(haxe,Log)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Log.h\",\n \"rank\": 16,\n \"score\": 121198.24502775673\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_IMap\\n\\n#define INCLUDED_haxe_IMap\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS1(haxe,IMap)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/IMap.h\",\n \"rank\": 17,\n \"score\": 121198.24502775673\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_Unserializer\\n\\n#define INCLUDED_haxe_Unserializer\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS1(haxe,Unserializer)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Unserializer.h\",\n \"rank\": 18,\n \"score\": 121198.24502775673\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_Resource\\n\\n#define INCLUDED_haxe_Resource\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS1(haxe,Resource)\\n\\nHX_DECLARE_CLASS2(haxe,io,Bytes)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Resource.h\",\n \"rank\": 19,\n \"score\": 121197.9549772077\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_Serializer\\n\\n#define INCLUDED_haxe_Serializer\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS0(StringBuf)\\n\\nHX_DECLARE_CLASS1(haxe,IMap)\\n\\nHX_DECLARE_CLASS1(haxe,Serializer)\\n\\nHX_DECLARE_CLASS2(haxe,ds,StringMap)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/Serializer.h\",\n \"rank\": 20,\n \"score\": 121197.35680160648\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Uncompress\\\",\\\"\\\\x1b\\\",\\\"\\\\x33\\\",\\\"\\\\x34\\\",\\\"\\\\x00\\\"); }\\n\\n\\n\\n\\t\\tstatic ::haxe::io::Bytes run( ::haxe::io::Bytes src, ::Dynamic bufsize);\\n\\n\\t\\tstatic ::Dynamic run_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic s;\\n\\n\\t\\t ::Dynamic execute( ::haxe::io::Bytes src,Int srcPos, ::haxe::io::Bytes dst,Int dstPos);\\n\\n\\t\\t::Dynamic execute_dyn();\\n\\n\\n\\n\\t\\tvoid setFlushMode(::hx::EnumBase f);\\n\\n\\t\\t::Dynamic setFlushMode_dyn();\\n\\n\\n\\n\\t\\tvoid close();\\n\\n\\t\\t::Dynamic close_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace zip\\n\\n\\n\\n#endif /* INCLUDED_haxe_zip_Uncompress */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/zip/Uncompress.h\",\n \"rank\": 42,\n \"score\": 118888.10303614964\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Compress\\\",\\\"\\\\xc2\\\",\\\"\\\\x03\\\",\\\"\\\\x71\\\",\\\"\\\\x5d\\\"); }\\n\\n\\n\\n\\t\\tstatic ::haxe::io::Bytes run( ::haxe::io::Bytes s,Int level);\\n\\n\\t\\tstatic ::Dynamic run_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic s;\\n\\n\\t\\t ::Dynamic execute( ::haxe::io::Bytes src,Int srcPos, ::haxe::io::Bytes dst,Int dstPos);\\n\\n\\t\\t::Dynamic execute_dyn();\\n\\n\\n\\n\\t\\tvoid setFlushMode(::hx::EnumBase f);\\n\\n\\t\\t::Dynamic setFlushMode_dyn();\\n\\n\\n\\n\\t\\tvoid close();\\n\\n\\t\\t::Dynamic close_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace zip\\n\\n\\n\\n#endif /* INCLUDED_haxe_zip_Compress */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/zip/Compress.h\",\n \"rank\": 43,\n \"score\": 118888.05118335148\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Path\\\",\\\"\\\\xc5\\\",\\\"\\\\x11\\\",\\\"\\\\x2b\\\",\\\"\\\\x35\\\"); }\\n\\n\\n\\n\\t\\tstatic ::String directory(::String path);\\n\\n\\t\\tstatic ::Dynamic directory_dyn();\\n\\n\\n\\n\\t\\tstatic ::String addTrailingSlash(::String path);\\n\\n\\t\\tstatic ::Dynamic addTrailingSlash_dyn();\\n\\n\\n\\n\\t\\tstatic ::String removeTrailingSlashes(::String path);\\n\\n\\t\\tstatic ::Dynamic removeTrailingSlashes_dyn();\\n\\n\\n\\n\\t\\t::String dir;\\n\\n\\t\\t::String file;\\n\\n\\t\\t::String ext;\\n\\n\\t\\tBool backslash;\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace io\\n\\n\\n\\n#endif /* INCLUDED_haxe_io_Path */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Path.h\",\n \"rank\": 44,\n \"score\": 118887.06529969852\n },\n {\n \"content\": \"\\t\\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Parser\\\",\\\"\\\\xff\\\",\\\"\\\\x10\\\",\\\"\\\\x1d\\\",\\\"\\\\x22\\\"); }\\n\\n\\n\\n\\t\\tstatic void __boot();\\n\\n\\t\\tstatic ::haxe::ds::StringMap escapes;\\n\\n\\t\\tstatic ::Xml parse(::String str,hx::Null< Bool > strict);\\n\\n\\t\\tstatic ::Dynamic parse_dyn();\\n\\n\\n\\n\\t\\tstatic Int doParse(::String str,Bool strict,hx::Null< Int > p, ::Xml parent);\\n\\n\\t\\tstatic ::Dynamic doParse_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace xml\\n\\n\\n\\n#endif /* INCLUDED_haxe_xml_Parser */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/xml/Parser.h\",\n \"rank\": 45,\n \"score\": 118886.74685827289\n },\n {\n \"content\": \"\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"CallStack\\\",\\\"\\\\xaa\\\",\\\"\\\\xa1\\\",\\\"\\\\x1d\\\",\\\"\\\\xb2\\\"); }\\n\\n\\n\\n\\t\\tstatic ::Array< ::Dynamic> callStack();\\n\\n\\t\\tstatic ::Dynamic callStack_dyn();\\n\\n\\n\\n\\t\\tstatic ::Array< ::Dynamic> exceptionStack();\\n\\n\\t\\tstatic ::Dynamic exceptionStack_dyn();\\n\\n\\n\\n\\t\\tstatic ::String toString(::Array< ::Dynamic> stack);\\n\\n\\t\\tstatic ::Dynamic toString_dyn();\\n\\n\\n\\n\\t\\tstatic void itemToString( ::StringBuf b,::hx::EnumBase s);\\n\\n\\t\\tstatic ::Dynamic itemToString_dyn();\\n\\n\\n\\n\\t\\tstatic ::Array< ::Dynamic> makeStack(::Array< ::String > s);\\n\\n\\t\\tstatic ::Dynamic makeStack_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n\\n\\n#endif /* INCLUDED_haxe_CallStack */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/CallStack.h\",\n \"rank\": 46,\n \"score\": 118880.47657007379\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Bytes\\\",\\\"\\\\x4b\\\",\\\"\\\\x78\\\",\\\"\\\\xc5\\\",\\\"\\\\x50\\\"); }\\n\\n\\n\\n\\t\\tstatic ::haxe::io::Bytes alloc(Int length);\\n\\n\\t\\tstatic ::Dynamic alloc_dyn();\\n\\n\\n\\n\\t\\tstatic ::haxe::io::Bytes ofString(::String s);\\n\\n\\t\\tstatic ::Dynamic ofString_dyn();\\n\\n\\n\\n\\t\\tstatic ::haxe::io::Bytes ofData(::Array< unsigned char > b);\\n\\n\\t\\tstatic ::Dynamic ofData_dyn();\\n\\n\\n\\n\\t\\tInt length;\\n\\n\\t\\t::Array< unsigned char > b;\\n\\n\\t\\tvoid blit(Int pos, ::haxe::io::Bytes src,Int srcpos,Int len);\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Bytes.h\",\n \"rank\": 47,\n \"score\": 118880.17219875482\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Fast\\\",\\\"\\\\xbc\\\",\\\"\\\\xee\\\",\\\"\\\\x8e\\\",\\\"\\\\x2e\\\"); }\\n\\n\\n\\n\\t\\t ::Xml x;\\n\\n\\t\\t ::haxe::xml::_Fast::NodeAccess node;\\n\\n\\t\\t ::haxe::xml::_Fast::NodeListAccess nodes;\\n\\n\\t\\t ::haxe::xml::_Fast::AttribAccess att;\\n\\n\\t\\t ::haxe::xml::_Fast::HasAttribAccess has;\\n\\n\\t\\t ::haxe::xml::_Fast::HasNodeAccess hasNode;\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace xml\\n\\n\\n\\n#endif /* INCLUDED_haxe_xml_Fast */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/xml/Fast.h\",\n \"rank\": 48,\n \"score\": 118879.50732610619\n },\n {\n \"content\": \"\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Input\\\",\\\"\\\\xea\\\",\\\"\\\\x33\\\",\\\"\\\\x4b\\\",\\\"\\\\x51\\\"); }\\n\\n\\n\\n\\t\\tvirtual Int readByte();\\n\\n\\t\\t::Dynamic readByte_dyn();\\n\\n\\n\\n\\t\\tvoid close();\\n\\n\\t\\t::Dynamic close_dyn();\\n\\n\\n\\n\\t\\t::String readLine();\\n\\n\\t\\t::Dynamic readLine_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace io\\n\\n\\n\\n#endif /* INCLUDED_haxe_io_Input */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Input.h\",\n \"rank\": 49,\n \"score\": 118876.61940935934\n },\n {\n \"content\": \"\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Output\\\",\\\"\\\\x21\\\",\\\"\\\\x83\\\",\\\"\\\\x15\\\",\\\"\\\\x41\\\"); }\\n\\n\\n\\n\\t\\tvirtual void writeByte(Int c);\\n\\n\\t\\t::Dynamic writeByte_dyn();\\n\\n\\n\\n\\t\\tvirtual Int writeBytes( ::haxe::io::Bytes s,Int pos,Int len);\\n\\n\\t\\t::Dynamic writeBytes_dyn();\\n\\n\\n\\n\\t\\tvirtual void close();\\n\\n\\t\\t::Dynamic close_dyn();\\n\\n\\n\\n\\t\\tvoid write( ::haxe::io::Bytes s);\\n\\n\\t\\t::Dynamic write_dyn();\\n\\n\\n\\n\\t\\tvoid writeFullBytes( ::haxe::io::Bytes s,Int pos,Int len);\\n\\n\\t\\t::Dynamic writeFullBytes_dyn();\\n\\n\\n\\n\\t\\tvoid writeString(::String s);\\n\\n\\t\\t::Dynamic writeString_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace io\\n\\n\\n\\n#endif /* INCLUDED_haxe_io_Output */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Output.h\",\n \"rank\": 50,\n \"score\": 118876.56995826628\n },\n {\n \"content\": \"\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"Eof\\\",\\\"\\\\x9c\\\",\\\"\\\\xbc\\\",\\\"\\\\x34\\\",\\\"\\\\x00\\\"); }\\n\\n\\n\\n\\t\\tvirtual ::String toString();\\n\\n\\t\\t::Dynamic toString_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace io\\n\\n\\n\\n#endif /* INCLUDED_haxe_io_Eof */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Eof.h\",\n \"rank\": 51,\n \"score\": 118875.43305605448\n },\n {\n \"content\": \"\\t\\t::Dynamic blit_dyn();\\n\\n\\n\\n\\t\\t ::haxe::io::Bytes sub(Int pos,Int len);\\n\\n\\t\\t::Dynamic sub_dyn();\\n\\n\\n\\n\\t\\t::String getString(Int pos,Int len);\\n\\n\\t\\t::Dynamic getString_dyn();\\n\\n\\n\\n\\t\\tvirtual ::String toString();\\n\\n\\t\\t::Dynamic toString_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace io\\n\\n\\n\\n#endif /* INCLUDED_haxe_io_Bytes */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Bytes.h\",\n \"rank\": 52,\n \"score\": 118871.04176771177\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_lang_Iterator\\n\\n#define INCLUDED_haxe_lang_Iterator\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,lang,Iterator)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace lang{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/lang/Iterator.h\",\n \"rank\": 53,\n \"score\": 118866.8296684023\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_io_Input\\n\\n#define INCLUDED_haxe_io_Input\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Input)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace io{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Input.h\",\n \"rank\": 54,\n \"score\": 118866.8296684023\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_io_Eof\\n\\n#define INCLUDED_haxe_io_Eof\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Eof)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace io{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Eof.h\",\n \"rank\": 55,\n \"score\": 118866.8296684023\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_io_Bytes\\n\\n#define INCLUDED_haxe_io_Bytes\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Bytes)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace io{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Bytes.h\",\n \"rank\": 56,\n \"score\": 118866.8296684023\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_io_Path\\n\\n#define INCLUDED_haxe_io_Path\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Path)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace io{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Path.h\",\n \"rank\": 57,\n \"score\": 118866.8296684023\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_io_Error\\n\\n#define INCLUDED_haxe_io_Error\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Error)\\n\\nnamespace haxe{\\n\\nnamespace io{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Error.h\",\n \"rank\": 58,\n \"score\": 118866.8296684023\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_io_Output\\n\\n#define INCLUDED_haxe_io_Output\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Bytes)\\n\\nHX_DECLARE_CLASS2(haxe,io,Output)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace io{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/Output.h\",\n \"rank\": 59,\n \"score\": 118866.61881549875\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_lang_Iterable\\n\\n#define INCLUDED_haxe_lang_Iterable\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,lang,Iterable)\\n\\nHX_DECLARE_CLASS2(haxe,lang,Iterator)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace lang{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/lang/Iterable.h\",\n \"rank\": 60,\n \"score\": 118866.61881549875\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_zip_Compress\\n\\n#define INCLUDED_haxe_zip_Compress\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Bytes)\\n\\nHX_DECLARE_CLASS2(haxe,zip,Compress)\\n\\nHX_DECLARE_CLASS2(haxe,zip,FlushMode)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace zip{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/zip/Compress.h\",\n \"rank\": 61,\n \"score\": 118866.3454995754\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_zip_Uncompress\\n\\n#define INCLUDED_haxe_zip_Uncompress\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Bytes)\\n\\nHX_DECLARE_CLASS2(haxe,zip,FlushMode)\\n\\nHX_DECLARE_CLASS2(haxe,zip,Uncompress)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace zip{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/zip/Uncompress.h\",\n \"rank\": 62,\n \"score\": 118866.3454995754\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_xml_Parser\\n\\n#define INCLUDED_haxe_xml_Parser\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS0(Xml)\\n\\nHX_DECLARE_CLASS1(haxe,IMap)\\n\\nHX_DECLARE_CLASS2(haxe,ds,StringMap)\\n\\nHX_DECLARE_CLASS2(haxe,xml,Parser)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace xml{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/xml/Parser.h\",\n \"rank\": 63,\n \"score\": 118866.1847948758\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_StackItem\\n\\n#define INCLUDED_haxe_StackItem\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS1(haxe,StackItem)\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/StackItem.h\",\n \"rank\": 64,\n \"score\": 118865.68598994333\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_CallStack\\n\\n#define INCLUDED_haxe_CallStack\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS0(StringBuf)\\n\\nHX_DECLARE_CLASS1(haxe,CallStack)\\n\\nHX_DECLARE_CLASS1(haxe,StackItem)\\n\\n\\n\\nnamespace haxe{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/CallStack.h\",\n \"rank\": 65,\n \"score\": 118865.08597227944\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_xml_Fast\\n\\n#define INCLUDED_haxe_xml_Fast\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS0(Xml)\\n\\nHX_DECLARE_CLASS2(haxe,xml,Fast)\\n\\nHX_DECLARE_CLASS3(haxe,xml,_Fast,AttribAccess)\\n\\nHX_DECLARE_CLASS3(haxe,xml,_Fast,HasAttribAccess)\\n\\nHX_DECLARE_CLASS3(haxe,xml,_Fast,HasNodeAccess)\\n\\nHX_DECLARE_CLASS3(haxe,xml,_Fast,NodeAccess)\\n\\nHX_DECLARE_CLASS3(haxe,xml,_Fast,NodeListAccess)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace xml{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/xml/Fast.h\",\n \"rank\": 66,\n \"score\": 118865.0659216143\n },\n {\n \"content\": \"\\t\\tvoid destroy();\\n\\n\\t\\t::Dynamic destroy_dyn();\\n\\n\\n\\n\\t\\t ::flixel::util::FlxTimer start(hx::Null< Float > Time, ::Dynamic OnComplete,hx::Null< Int > Loops);\\n\\n\\t\\t::Dynamic start_dyn();\\n\\n\\n\\n\\t\\t ::flixel::util::FlxTimer reset(hx::Null< Float > NewTime);\\n\\n\\t\\t::Dynamic reset_dyn();\\n\\n\\n\\n\\t\\tvoid cancel();\\n\\n\\t\\t::Dynamic cancel_dyn();\\n\\n\\n\\n\\t\\tvoid update(Float elapsed);\\n\\n\\t\\t::Dynamic update_dyn();\\n\\n\\n\\n\\t\\tFloat get_timeLeft();\\n\\n\\t\\t::Dynamic get_timeLeft_dyn();\\n\\n\\n\\n\\t\\tFloat get_elapsedTime();\\n\\n\\t\\t::Dynamic get_elapsedTime_dyn();\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/flixel/util/FlxTimer.h\",\n \"rank\": 67,\n \"score\": 116935.49961141686\n },\n {\n \"content\": \"\\t\\tstatic bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tstatic bool __SetStatic(const ::String &inString, Dynamic &ioValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\tvoid *_hx_getInterface(int inHash);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"FlxTimer\\\",\\\"\\\\x13\\\",\\\"\\\\xca\\\",\\\"\\\\x0f\\\",\\\"\\\\xcd\\\"); }\\n\\n\\n\\n\\t\\tstatic ::flixel::util::FlxTimerManager manager;\\n\\n\\t\\tFloat time;\\n\\n\\t\\tInt loops;\\n\\n\\t\\tBool active;\\n\\n\\t\\tBool finished;\\n\\n\\t\\t ::Dynamic onComplete;\\n\\n\\t\\t ::Dynamic &onComplete_dyn() { return onComplete;}\\n\\n\\t\\tFloat _timeCounter;\\n\\n\\t\\tInt _loopsCounter;\\n\\n\\t\\tBool _inManager;\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/flixel/util/FlxTimer.h\",\n \"rank\": 68,\n \"score\": 116934.29415259432\n },\n {\n \"content\": \"\\n\\n\\t\\tInt get_loopsLeft();\\n\\n\\t\\t::Dynamic get_loopsLeft_dyn();\\n\\n\\n\\n\\t\\tInt get_elapsedLoops();\\n\\n\\t\\t::Dynamic get_elapsedLoops_dyn();\\n\\n\\n\\n\\t\\tFloat get_progress();\\n\\n\\t\\t::Dynamic get_progress_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace flixel\\n\\n} // end namespace util\\n\\n\\n\\n#endif /* INCLUDED_flixel_util_FlxTimer */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/flixel/util/FlxTimer.h\",\n \"rank\": 69,\n \"score\": 116918.31025401094\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_flixel_util_FlxTimer\\n\\n#define INCLUDED_flixel_util_FlxTimer\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\n#ifndef INCLUDED_flixel_util_IFlxDestroyable\\n\\n#include <flixel/util/IFlxDestroyable.h>\\n\\n#endif\\n\\nHX_DECLARE_CLASS1(flixel,FlxBasic)\\n\\nHX_DECLARE_CLASS2(flixel,util,FlxTimer)\\n\\nHX_DECLARE_CLASS2(flixel,util,FlxTimerManager)\\n\\nHX_DECLARE_CLASS2(flixel,util,IFlxDestroyable)\\n\\n\\n\\nnamespace flixel{\\n\\nnamespace util{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/flixel/util/FlxTimer.h\",\n \"rank\": 70,\n \"score\": 116913.643860138\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"BytesBuffer\\\",\\\"\\\\xab\\\",\\\"\\\\x73\\\",\\\"\\\\x22\\\",\\\"\\\\xf6\\\"); }\\n\\n\\n\\n\\t\\t::Array< unsigned char > b;\\n\\n\\t\\t ::haxe::io::Bytes getBytes();\\n\\n\\t\\t::Dynamic getBytes_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace io\\n\\n\\n\\n#endif /* INCLUDED_haxe_io_BytesBuffer */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/BytesBuffer.h\",\n \"rank\": 71,\n \"score\": 116642.09132108769\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"TreeNode\\\",\\\"\\\\xa0\\\",\\\"\\\\x92\\\",\\\"\\\\x83\\\",\\\"\\\\x06\\\"); }\\n\\n\\n\\n\\t\\t ::haxe::ds::TreeNode left;\\n\\n\\t\\t ::haxe::ds::TreeNode right;\\n\\n\\t\\t ::Dynamic key;\\n\\n\\t\\t ::Dynamic value;\\n\\n\\t\\tInt _height;\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace ds\\n\\n\\n\\n#endif /* INCLUDED_haxe_ds_TreeNode */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/TreeNode.h\",\n \"rank\": 72,\n \"score\": 116641.92662791381\n },\n {\n \"content\": \" template<typename F>\\n\\n inline void set(int key, const ::cpp::Function<F> &value) {__int_hash_set(h,key,value); }\\n\\n template<typename V>\\n\\n inline void set(int key, const ::cpp::Pointer<V> &value) {__int_hash_set(h,key,(Dynamic)value ); }\\n\\n\\n\\n template<typename VALUE>\\n\\n inline Void set(Dynamic &key, const VALUE &value) { set( (int)key, value ); return null(); }\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace ds\\n\\n\\n\\n#endif /* INCLUDED_haxe_ds_IntMap */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/IntMap.h\",\n \"rank\": 73,\n \"score\": 116641.63226838465\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"JsonParser\\\",\\\"\\\\x47\\\",\\\"\\\\x65\\\",\\\"\\\\x2e\\\",\\\"\\\\x25\\\"); }\\n\\n\\n\\n\\t\\t::String str;\\n\\n\\t\\tInt pos;\\n\\n\\t\\t ::Dynamic parseRec();\\n\\n\\t\\t::Dynamic parseRec_dyn();\\n\\n\\n\\n\\t\\t::String parseString();\\n\\n\\t\\t::Dynamic parseString_dyn();\\n\\n\\n\\n\\t\\tvoid invalidChar();\\n\\n\\t\\t::Dynamic invalidChar_dyn();\\n\\n\\n\\n\\t\\tvoid invalidNumber(Int start);\\n\\n\\t\\t::Dynamic invalidNumber_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace format\\n\\n\\n\\n#endif /* INCLUDED_haxe_format_JsonParser */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/format/JsonParser.h\",\n \"rank\": 74,\n \"score\": 116640.46240834262\n },\n {\n \"content\": \"\\n\\n template<typename V, typename H>\\n\\n inline void set(String key, const ::cpp::Struct<V,H> &value) {__string_hash_set(h,key,value); }\\n\\n template<typename V>\\n\\n inline void set(String key, const ::cpp::Function<V> &value) {__string_hash_set(h,key,(Dynamic)value ); }\\n\\n template<typename V>\\n\\n inline void set(String key, const ::cpp::Pointer<V> &value) {__string_hash_set(h,key,(Dynamic)value ); }\\n\\n\\n\\n template<typename VALUE>\\n\\n inline Void set(Dynamic &key, const VALUE &value) { set( (String)key, value ); return null(); }\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace ds\\n\\n\\n\\n#endif /* INCLUDED_haxe_ds_StringMap */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/StringMap.h\",\n \"rank\": 75,\n \"score\": 116633.7650152168\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"BalancedTree\\\",\\\"\\\\x66\\\",\\\"\\\\x71\\\",\\\"\\\\xf8\\\",\\\"\\\\xaa\\\"); }\\n\\n\\n\\n\\t\\t ::haxe::ds::TreeNode root;\\n\\n\\t\\tvoid set( ::Dynamic key, ::Dynamic value);\\n\\n\\t\\t::Dynamic set_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic get( ::Dynamic key);\\n\\n\\t\\t::Dynamic get_dyn();\\n\\n\\n\\n\\t\\t ::haxe::ds::TreeNode setLoop( ::Dynamic k, ::Dynamic v, ::haxe::ds::TreeNode node);\\n\\n\\t\\t::Dynamic setLoop_dyn();\\n\\n\\n\\n\\t\\t ::haxe::ds::TreeNode balance( ::haxe::ds::TreeNode l, ::Dynamic k, ::Dynamic v, ::haxe::ds::TreeNode r);\\n\\n\\t\\t::Dynamic balance_dyn();\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/BalancedTree.h\",\n \"rank\": 76,\n \"score\": 116631.87241573833\n },\n {\n \"content\": \" inline void set(Dynamic key, const ::cpp::Struct<V,H> &value) {__object_hash_set(h,key,value); }\\n\\n template<typename V>\\n\\n inline void set(Dynamic key, const ::cpp::Function<V> &value) {__object_hash_set(h,key,(Dynamic)value ); }\\n\\n template<typename V>\\n\\n inline void set(Dynamic key, const ::cpp::Pointer<V> &value) {__object_hash_set(h,key,(Dynamic)value ); }\\n\\n\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace ds\\n\\n\\n\\n#endif /* INCLUDED_haxe_ds_ObjectMap */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h\",\n \"rank\": 77,\n \"score\": 116631.48238696535\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\tvoid *_hx_getInterface(int inHash);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"ObjectMap\\\",\\\"\\\\xfd\\\",\\\"\\\\xa4\\\",\\\"\\\\x50\\\",\\\"\\\\xe5\\\"); }\\n\\n\\n\\n\\t\\t ::Dynamic h;\\n\\n\\t\\tvoid set( ::Dynamic key, ::Dynamic value);\\n\\n\\t\\t::Dynamic set_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic get( ::Dynamic key);\\n\\n\\t\\t::Dynamic get_dyn();\\n\\n\\n\\n\\t\\tBool exists( ::Dynamic key);\\n\\n\\t\\t::Dynamic exists_dyn();\\n\\n\\n\\n\\t\\tBool remove( ::Dynamic key);\\n\\n\\t\\t::Dynamic remove_dyn();\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h\",\n \"rank\": 78,\n \"score\": 116631.28750386862\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\tvoid *_hx_getInterface(int inHash);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"StringMap\\\",\\\"\\\\x2b\\\",\\\"\\\\x12\\\",\\\"\\\\x8c\\\",\\\"\\\\x69\\\"); }\\n\\n\\n\\n\\t\\t ::Dynamic h;\\n\\n\\t\\tvoid set(::String key, ::Dynamic value);\\n\\n\\t\\t::Dynamic set_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic get(::String key);\\n\\n\\t\\t::Dynamic get_dyn();\\n\\n\\n\\n\\t\\tBool exists(::String key);\\n\\n\\t\\t::Dynamic exists_dyn();\\n\\n\\n\\n\\t\\tBool remove(::String key);\\n\\n\\t\\t::Dynamic remove_dyn();\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/StringMap.h\",\n \"rank\": 79,\n \"score\": 116630.9044816804\n },\n {\n \"content\": \"\\t\\thx::Val __SetField(const ::String &inString,const hx::Val &inValue, hx::PropertyAccess inCallProp);\\n\\n\\t\\tvoid __GetFields(Array< ::String> &outFields);\\n\\n\\t\\tstatic void __register();\\n\\n\\t\\tvoid __Mark(HX_MARK_PARAMS);\\n\\n\\t\\tvoid __Visit(HX_VISIT_PARAMS);\\n\\n\\t\\tvoid *_hx_getInterface(int inHash);\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"IntMap\\\",\\\"\\\\x0d\\\",\\\"\\\\xa9\\\",\\\"\\\\x08\\\",\\\"\\\\xd3\\\"); }\\n\\n\\n\\n\\t\\t ::Dynamic h;\\n\\n\\t\\tvoid set(Int key, ::Dynamic value);\\n\\n\\t\\t::Dynamic set_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic get(Int key);\\n\\n\\t\\t::Dynamic get_dyn();\\n\\n\\n\\n\\t\\tBool exists(Int key);\\n\\n\\t\\t::Dynamic exists_dyn();\\n\\n\\n\\n\\t\\tBool remove(Int key);\\n\\n\\t\\t::Dynamic remove_dyn();\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/IntMap.h\",\n \"rank\": 80,\n \"score\": 116630.9044816804\n },\n {\n \"content\": \"\\t\\tstatic void __register();\\n\\n\\t\\t::String __ToString() const { return HX_HCSTRING(\\\"DefaultResolver\\\",\\\"\\\\xc7\\\",\\\"\\\\x41\\\",\\\"\\\\x4a\\\",\\\"\\\\x96\\\"); }\\n\\n\\n\\n\\t\\thx::Class resolveClass(::String name);\\n\\n\\t\\t::Dynamic resolveClass_dyn();\\n\\n\\n\\n\\t\\thx::Class resolveEnum(::String name);\\n\\n\\t\\t::Dynamic resolveEnum_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace _Unserializer\\n\\n\\n\\n#endif /* INCLUDED_haxe__Unserializer_DefaultResolver */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/_Unserializer/DefaultResolver.h\",\n \"rank\": 81,\n \"score\": 116630.15393970073\n },\n {\n \"content\": \"\\t\\tvirtual Int compare( ::Dynamic k1, ::Dynamic k2);\\n\\n\\t\\t::Dynamic compare_dyn();\\n\\n\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace ds\\n\\n\\n\\n#endif /* INCLUDED_haxe_ds_BalancedTree */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/BalancedTree.h\",\n \"rank\": 82,\n \"score\": 116627.9686884337\n },\n {\n \"content\": \"\\n\\n\\t\\t ::Dynamic keys();\\n\\n\\t\\t::Dynamic keys_dyn();\\n\\n\\n\\n\\n\\n inline void set(Dynamic key, ::null value) { __object_hash_set(h,key,value); }\\n\\n inline void set(Dynamic key, bool value) { __object_hash_set(h,key,value); }\\n\\n inline void set(Dynamic key, char value) { __object_hash_set_int(h,key,value); }\\n\\n inline void set(Dynamic key, unsigned char value) { __object_hash_set_int(h,key,value); }\\n\\n inline void set(Dynamic key, signed char value) { __object_hash_set_int(h,key,value); }\\n\\n inline void set(Dynamic key, short value) { __object_hash_set_int(h,key,value); }\\n\\n inline void set(Dynamic key, unsigned short value) { __object_hash_set_int(h,key,value); }\\n\\n inline void set(Dynamic key, int value) { __object_hash_set_int(h,key,value); }\\n\\n inline void set(Dynamic key, unsigned int value) { __object_hash_set_int(h,key,value); }\\n\\n inline void set(Dynamic key, float value) { __object_hash_set_float(h,key,value); }\\n\\n inline void set(Dynamic key, double value) { __object_hash_set_float(h,key,value); }\\n\\n inline void set(Dynamic key, ::String value) { __object_hash_set_string(h,key,value); }\\n\\n\\n\\n\\n\\n template<typename V, typename H>\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h\",\n \"rank\": 83,\n \"score\": 116626.61163049004\n },\n {\n \"content\": \"\\n\\n\\t\\t ::Dynamic keys();\\n\\n\\t\\t::Dynamic keys_dyn();\\n\\n\\n\\n\\t\\t ::Dynamic iterator();\\n\\n\\t\\t::Dynamic iterator_dyn();\\n\\n\\n\\n\\n\\n inline void set(String key, ::null value) { __string_hash_set(h,key,value); }\\n\\n inline void set(String key, bool value) { __string_hash_set(h,key,value); }\\n\\n inline void set(String key, char value) { __string_hash_set_int(h,key,value); }\\n\\n inline void set(String key, unsigned char value) { __string_hash_set_int(h,key,value); }\\n\\n inline void set(String key, signed char value) { __string_hash_set_int(h,key,value); }\\n\\n inline void set(String key, short value) { __string_hash_set_int(h,key,value); }\\n\\n inline void set(String key, unsigned short value) { __string_hash_set_int(h,key,value); }\\n\\n inline void set(String key, int value) { __string_hash_set_int(h,key,value); }\\n\\n inline void set(String key, unsigned int value) { __string_hash_set_int(h,key,value); }\\n\\n inline void set(String key, float value) { __string_hash_set_float(h,key,value); }\\n\\n inline void set(String key, double value) { __string_hash_set_float(h,key,value); }\\n\\n inline void set(String key, ::String value) { __string_hash_set_string(h,key,value); }\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/StringMap.h\",\n \"rank\": 84,\n \"score\": 116624.83494133218\n },\n {\n \"content\": \"\\n\\n\\t\\t ::Dynamic keys();\\n\\n\\t\\t::Dynamic keys_dyn();\\n\\n\\n\\n\\n\\n inline void set(int key, ::null value) { __int_hash_set(h,key,value); }\\n\\n inline void set(int key, bool value) { __int_hash_set(h,key,value); }\\n\\n inline void set(int key, char value) { __int_hash_set_int(h,key,value); }\\n\\n inline void set(int key, unsigned char value) { __int_hash_set_int(h,key,value); }\\n\\n inline void set(int key, signed char value) { __int_hash_set_int(h,key,value); }\\n\\n inline void set(int key, short value) { __int_hash_set_int(h,key,value); }\\n\\n inline void set(int key, unsigned short value) { __int_hash_set_int(h,key,value); }\\n\\n inline void set(int key, int value) { __int_hash_set_int(h,key,value); }\\n\\n inline void set(int key, unsigned int value) { __int_hash_set_int(h,key,value); }\\n\\n inline void set(int key, float value) { __int_hash_set_float(h,key,value); }\\n\\n inline void set(int key, double value) { __int_hash_set_float(h,key,value); }\\n\\n inline void set(int key, ::String value) { __int_hash_set_string(h,key,value); }\\n\\n\\n\\n template<typename V, typename H>\\n\\n inline void set(int key, const ::cpp::Struct<V,H> &value) {__int_hash_set(h,key,value); }\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/IntMap.h\",\n \"rank\": 85,\n \"score\": 116622.78233468426\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_ds_StringMap\\n\\n#define INCLUDED_haxe_ds_StringMap\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\n#ifndef INCLUDED_haxe_IMap\\n\\n#include <haxe/IMap.h>\\n\\n#endif\\n\\nHX_DECLARE_CLASS1(haxe,IMap)\\n\\nHX_DECLARE_CLASS2(haxe,ds,StringMap)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace ds{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/StringMap.h\",\n \"rank\": 86,\n \"score\": 116622.69194339824\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_ds_IntMap\\n\\n#define INCLUDED_haxe_ds_IntMap\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\n#ifndef INCLUDED_haxe_IMap\\n\\n#include <haxe/IMap.h>\\n\\n#endif\\n\\nHX_DECLARE_CLASS1(haxe,IMap)\\n\\nHX_DECLARE_CLASS2(haxe,ds,IntMap)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace ds{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/IntMap.h\",\n \"rank\": 87,\n \"score\": 116622.69194339824\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_ds_ObjectMap\\n\\n#define INCLUDED_haxe_ds_ObjectMap\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\n#ifndef INCLUDED_haxe_IMap\\n\\n#include <haxe/IMap.h>\\n\\n#endif\\n\\nHX_DECLARE_CLASS1(haxe,IMap)\\n\\nHX_DECLARE_CLASS2(haxe,ds,ObjectMap)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace ds{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/ObjectMap.h\",\n \"rank\": 88,\n \"score\": 116622.69194339824\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_zip_FlushMode\\n\\n#define INCLUDED_haxe_zip_FlushMode\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,zip,FlushMode)\\n\\nnamespace haxe{\\n\\nnamespace zip{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/zip/FlushMode.h\",\n \"rank\": 89,\n \"score\": 116622.39486138537\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_ds_TreeNode\\n\\n#define INCLUDED_haxe_ds_TreeNode\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,ds,TreeNode)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace ds{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/TreeNode.h\",\n \"rank\": 90,\n \"score\": 116622.39486138537\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe__Unserializer_DefaultResolver\\n\\n#define INCLUDED_haxe__Unserializer_DefaultResolver\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,_Unserializer,DefaultResolver)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace _Unserializer{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/_Unserializer/DefaultResolver.h\",\n \"rank\": 91,\n \"score\": 116622.39486138537\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_format_JsonParser\\n\\n#define INCLUDED_haxe_format_JsonParser\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,format,JsonParser)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace format{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/format/JsonParser.h\",\n \"rank\": 92,\n \"score\": 116622.39486138537\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_io_BytesBuffer\\n\\n#define INCLUDED_haxe_io_BytesBuffer\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,io,Bytes)\\n\\nHX_DECLARE_CLASS2(haxe,io,BytesBuffer)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace io{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/io/BytesBuffer.h\",\n \"rank\": 93,\n \"score\": 116622.19575065663\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#ifndef INCLUDED_haxe_ds_BalancedTree\\n\\n#define INCLUDED_haxe_ds_BalancedTree\\n\\n\\n\\n#ifndef HXCPP_H\\n\\n#include <hxcpp.h>\\n\\n#endif\\n\\n\\n\\nHX_DECLARE_CLASS2(haxe,ds,BalancedTree)\\n\\nHX_DECLARE_CLASS2(haxe,ds,TreeNode)\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace ds{\\n\\n\\n\\n\\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/ds/BalancedTree.h\",\n \"rank\": 94,\n \"score\": 116622.139276171\n },\n {\n \"content\": \"\\t\\tstatic ::haxe::zip::FlushMode NO;\\n\\n\\t\\tstatic inline ::haxe::zip::FlushMode NO_dyn() { return NO; }\\n\\n\\t\\tstatic ::haxe::zip::FlushMode SYNC;\\n\\n\\t\\tstatic inline ::haxe::zip::FlushMode SYNC_dyn() { return SYNC; }\\n\\n};\\n\\n\\n\\n} // end namespace haxe\\n\\n} // end namespace zip\\n\\n\\n\\n#endif /* INCLUDED_haxe_zip_FlushMode */ \\n\",\n \"file_path\": \"export/windows/cpp/obj/include/haxe/zip/FlushMode.h\",\n \"rank\": 95,\n \"score\": 116620.22173494939\n },\n {\n \"content\": \"// Generated by Haxe 3.3.0\\n\\n#include <hxcpp.h>\\n\\n\\n\\n#ifndef INCLUDED_haxe__Unserializer_NullResolver\\n\\n#include <haxe/_Unserializer/NullResolver.h>\\n\\n#endif\\n\\n\\n\\nnamespace haxe{\\n\\nnamespace _Unserializer{\\n\\n\\n\\nvoid NullResolver_obj::__construct(){\\n\\n \\tHX_STACK_FRAME(\\\"haxe._Unserializer.NullResolver\\\",\\\"new\\\",0x49a2304b,\\\"haxe._Unserializer.NullResolver.new\\\",\\\"C:\\\\\\\\Haxe\\\\\\\\haxe\\\\\\\\std/haxe/Unserializer.hx\\\",477,0x81c40bdb)\\n\\n \\tHX_STACK_THIS(this)\\n\\n \\t}\\n\\n\\n\\nDynamic NullResolver_obj::__CreateEmpty() { return new NullResolver_obj; }\\n\\n\\n\\nhx::ObjectPtr< NullResolver_obj > NullResolver_obj::__new()\\n\\n{\\n\\n\\thx::ObjectPtr< NullResolver_obj > _hx_result = new NullResolver_obj();\\n\",\n \"file_path\": \"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp\",\n \"rank\": 96,\n \"score\": 115504.95586954909\n },\n {\n \"content\": \"\\t_hx_result->__construct();\\n\\n\\treturn _hx_result;\\n\\n}\\n\\n\\n\\nDynamic NullResolver_obj::__Create(hx::DynamicArray inArgs)\\n\\n{\\n\\n\\thx::ObjectPtr< NullResolver_obj > _hx_result = new NullResolver_obj();\\n\\n\\t_hx_result->__construct();\\n\\n\\treturn _hx_result;\\n\\n}\\n\\n\\n\\nhx::Class NullResolver_obj::resolveClass(::String name){\\n\\n \\tHX_STACK_FRAME(\\\"haxe._Unserializer.NullResolver\\\",\\\"resolveClass\\\",0xc4a78861,\\\"haxe._Unserializer.NullResolver.resolveClass\\\",\\\"C:\\\\\\\\Haxe\\\\\\\\haxe\\\\\\\\std/haxe/Unserializer.hx\\\",478,0x81c40bdb)\\n\\n \\tHX_STACK_THIS(this)\\n\\n \\tHX_STACK_ARG(name,\\\"name\\\")\\n\\nHXLINE( 478)\\t\\treturn null();\\n\\n \\t}\\n\\n\\n\\n\\n\\nHX_DEFINE_DYNAMIC_FUNC1(NullResolver_obj,resolveClass,return )\\n\",\n \"file_path\": \"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp\",\n \"rank\": 97,\n \"score\": 115494.52781958974\n },\n {\n \"content\": \"\\n\\nhx::Class NullResolver_obj::resolveEnum(::String name){\\n\\n \\tHX_STACK_FRAME(\\\"haxe._Unserializer.NullResolver\\\",\\\"resolveEnum\\\",0x5f3252f8,\\\"haxe._Unserializer.NullResolver.resolveEnum\\\",\\\"C:\\\\\\\\Haxe\\\\\\\\haxe\\\\\\\\std/haxe/Unserializer.hx\\\",479,0x81c40bdb)\\n\\n \\tHX_STACK_THIS(this)\\n\\n \\tHX_STACK_ARG(name,\\\"name\\\")\\n\\nHXLINE( 479)\\t\\treturn null();\\n\\n \\t}\\n\\n\\n\\n\\n\\nHX_DEFINE_DYNAMIC_FUNC1(NullResolver_obj,resolveEnum,return )\\n\\n\\n\\n ::haxe::_Unserializer::NullResolver NullResolver_obj::instance;\\n\\n\\n\\n\\n\\nNullResolver_obj::NullResolver_obj()\\n\\n{\\n\\n}\\n\\n\\n\\nhx::Val NullResolver_obj::__Field(const ::String &inName,hx::PropertyAccess inCallProp)\\n\\n{\\n\",\n \"file_path\": \"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp\",\n \"rank\": 98,\n \"score\": 115488.66823247627\n },\n {\n \"content\": \"\\tswitch(inName.length) {\\n\\n\\tcase 11:\\n\\n\\t\\tif (HX_FIELD_EQ(inName,\\\"resolveEnum\\\") ) { return hx::Val( resolveEnum_dyn()); }\\n\\n\\t\\tbreak;\\n\\n\\tcase 12:\\n\\n\\t\\tif (HX_FIELD_EQ(inName,\\\"resolveClass\\\") ) { return hx::Val( resolveClass_dyn()); }\\n\\n\\t}\\n\\n\\treturn super::__Field(inName,inCallProp);\\n\\n}\\n\\n\\n\\nbool NullResolver_obj::__GetStatic(const ::String &inName, Dynamic &outValue, hx::PropertyAccess inCallProp)\\n\\n{\\n\\n\\tswitch(inName.length) {\\n\\n\\tcase 8:\\n\\n\\t\\tif (HX_FIELD_EQ(inName,\\\"instance\\\") ) { outValue = instance; return true; }\\n\\n\\t}\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\nbool NullResolver_obj::__SetStatic(const ::String &inName,Dynamic &ioValue,hx::PropertyAccess inCallProp)\\n\",\n \"file_path\": \"export/windows/cpp/obj/src/haxe/_Unserializer/NullResolver.cpp\",\n \"rank\": 99,\n \"score\": 115487.84878105036\n }\n]","isConversational":false}}},{"rowIdx":463,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"include/external/urdl/istreambuf.hpp"},"repo_name":{"kind":"string","value":"Ptomaine/nstd"},"commit":{"kind":"string","value":"72daa4abab97dc82b407c774b00476459df0730b"},"file_code":{"kind":"string","value":"\n\n#ifndef URDL_ISTREAMBUF_HPP\n#define URDL_ISTREAMBUF_HPP\n\n#include <streambuf>\n#include \"detail/config.hpp\"\n#include \"option_set.hpp\"\n#include \"url.hpp\"\n#include \"detail/abi_prefix.hpp\"\n\nnamespace urdl {\n\nclass istreambuf\n : public std::streambuf\n{\npublic:\n \n URDL_DECL istreambuf();\n\n \n URDL_DECL ~istreambuf();\n\n \n \n template <typename Option>\n void set_option(const Option& option)\n {\n option_set options;\n options.set_option(option);\n set_options(options);\n }\n\n \n \n URDL_DECL void set_options(const option_set& options);\n\n \n \n \n template <typename Option>\n Option get_option() const\n {\n option_set options(get_options());\n return options.get_option<Option>();\n }\n\n \n \n URDL_DECL option_set get_options() const;\n\n \n \n URDL_DECL bool is_open() const;\n\n \n \n URDL_DECL istreambuf* open(const url& u);\n\n \n \n URDL_DECL istreambuf* close();\n\n \n \n URDL_DECL const asio::error_code& puberror() const;\n\n \n \n URDL_DECL std::size_t open_timeout() const;\n\n \n \n URDL_DECL void open_timeout(std::size_t milliseconds);\n\n \n \n URDL_DECL std::size_t read_timeout() const;\n\n \n \n URDL_DECL void read_timeout(std::size_t milliseconds);\n\n \n \n URDL_DECL std::string content_type() const;\n\n \n \n URDL_DECL std::size_t content_length() const;\n\n \n \n URDL_DECL std::string headers() const;\n\nprotected:\n \n \n URDL_DECL int_type underflow();\n\n \n \n URDL_DECL virtual const asio::error_code& error() const;\n\nprivate:\n URDL_DECL void init_buffers();\n\n struct body;\n body* body_;\n};\n\n} \n\n#include \"detail/abi_suffix.hpp\"\n\n#if defined(URDL_HEADER_ONLY)\n# include \"impl/istreambuf.ipp\"\n#endif\n\n#endif \n"},"prefix":{"kind":"string","value":"\n\n#ifndef URDL_ISTREAMBUF_HPP\n#define URDL_ISTREAMBUF_HPP\n\n#include <streambuf>\n#include \"detail/config.hpp\"\n#include \"option_set.hpp\"\n#include \"url.hpp\"\n#include \"detail/abi_prefix.hpp\"\n\nnamespace urdl {"},"suffix":{"kind":"string","value":"fix.hpp\"\n\n#if defined(URDL_HEADER_ONLY)\n# include \"impl/istreambuf.ipp\"\n#endif\n\n#endif \n"},"middle":{"kind":"string","value":"\n\nclass istreambuf\n : public std::streambuf\n{\npublic:\n \n URDL_DECL istreambuf();\n\n \n URDL_DECL ~istreambuf();\n\n \n \n template <typename Option>\n void set_option(const Option& option)\n {\n option_set options;\n options.set_option(option);\n set_options(options);\n }\n\n \n \n URDL_DECL void set_options(const option_set& options);\n\n \n \n \n template <typename Option>\n Option get_option() const\n {\n option_set options(get_options());\n return options.get_option<Option>();\n }\n\n \n \n URDL_DECL option_set get_options() const;\n\n \n \n URDL_DECL bool is_open() const;\n\n \n \n URDL_DECL istreambuf* open(const url& u);\n\n \n \n URDL_DECL istreambuf* close();\n\n \n \n URDL_DECL const asio::error_code& puberror() const;\n\n \n \n URDL_DECL std::size_t open_timeout() const;\n\n \n \n URDL_DECL void open_timeout(std::size_t milliseconds);\n\n \n \n URDL_DECL std::size_t read_timeout() const;\n\n \n \n URDL_DECL void read_timeout(std::size_t milliseconds);\n\n \n \n URDL_DECL std::string content_type() const;\n\n \n \n URDL_DECL std::size_t content_length() const;\n\n \n \n URDL_DECL std::string headers() const;\n\nprotected:\n \n \n URDL_DECL int_type underflow();\n\n \n \n URDL_DECL virtual const asio::error_code& error() const;\n\nprivate:\n URDL_DECL void init_buffers();\n\n struct body;\n body* body_;\n};\n\n} \n\n#include \"detail/abi_suf"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"*/\n\n\n\n#define URDL_HEADER_ONLY\n\n#define URDL_DISABLE_SSL\n\n#define ASIO_STANDALONE\n\n#define ASIO_HAS_STD_CHRONO\n\n\n\n#include \"external/asio/asio/include/asio.hpp\"\n\n#include \"external/urdl/http.hpp\"\n\n#include \"external/urdl/istream.hpp\"\n\n#include \"external/urdl/istreambuf.hpp\"\n\n#include \"external/urdl/option_set.hpp\"\n\n#include \"external/urdl/read_stream.hpp\"\n\n#include \"external/urdl/url.hpp\"\n\n\n\n#include <string>\n\n#include <vector>\n\n\n\nnamespace nstd\n\n{\n","file_path":"include/urdl.hpp","rank":0,"score":107560.42862580251},{"content":" namespace asio = asio;\n\n namespace urdl = urdl;\n\n\n\n template<typename ContainerType = std::string>\n\n std::pair<std::string, ContainerType> download_url(const urdl::url &url)\n\n {\n\n nstd::asio::io_context io_service;\n\n\n\n nstd::urdl::read_stream stream(io_service);\n\n\n\n stream.open(url);\n\n\n\n std::vector<uint8_t> result;\n\n\n\n while (true)\n\n {\n\n char data[1024];\n\n asio::error_code ec;\n\n std::size_t length { stream.read_some(nstd::asio::buffer(data), ec) };\n\n\n","file_path":"include/urdl.hpp","rank":1,"score":107552.98411664768},{"content":"#pragma once\n\n\n\n/*\n\nMIT License\n\nCopyright (c) 2017 Arlen Keshabyan (arlen.albert@gmail.com)\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n","file_path":"include/urdl.hpp","rank":2,"score":107546.70770493812},{"content":" if (ec == nstd::asio::error::eof) break;\n\n\n\n if (ec) throw std::system_error(ec);\n\n\n\n std::copy(reinterpret_cast<uint8_t*>(data), reinterpret_cast<uint8_t*>(data) + length, std::back_inserter(result));\n\n }\n\n\n\n return std::make_pair(stream.headers(), ContainerType(std::begin(result), std::end(result)));\n\n }\n\n}\n","file_path":"include/urdl.hpp","rank":3,"score":107541.85615195702},{"content":"inline asio::error_code make_error_code(errc_t e)\n\n{\n\n return asio::error_code(\n\n static_cast<int>(e), http::error_category());\n\n}\n\n\n\n} // namespace errc\n\n} // namespace http\n\n} // namespace urdl\n\n\n\n#include \"detail/abi_suffix.hpp\"\n\n\n\n#if defined(URDL_HEADER_ONLY)\n\n# include \"impl/http.ipp\"\n\n#endif\n\n\n\n#endif // URDL_HTTP_HPP\n","file_path":"include/external/urdl/http.hpp","rank":5,"score":100128.79786663178},{"content":" */\n\n std::string headers() const\n\n {\n\n return rdbuf()->headers();\n\n }\n\n};\n\n\n\n} // namespace urdl\n\n\n\n#include \"detail/abi_suffix.hpp\"\n\n\n\n#endif // URDL_ISTREAM_HPP\n","file_path":"include/external/urdl/istream.hpp","rank":6,"score":100127.91494015093},{"content":"//\n\n// http.hpp\n\n// ~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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 URDL_HTTP_HPP\n\n#define URDL_HTTP_HPP\n\n\n\n#include <string>\n\n#include \"detail/config.hpp\"\n\n#include \"detail/abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\nnamespace http {\n\n\n","file_path":"include/external/urdl/http.hpp","rank":7,"score":100127.43410486069},{"content":"//\n\n// istream.hpp\n\n// ~~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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 URDL_ISTREAM_HPP\n\n#define URDL_ISTREAM_HPP\n\n\n\n#include <istream>\n\n#include \"utility/base_from_member.hpp\"\n\n#include \"istreambuf.hpp\"\n\n#include \"detail/abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\n\n","file_path":"include/external/urdl/istream.hpp","rank":8,"score":100126.22592901268},{"content":" std::string protocol_;\n\n std::string user_info_;\n\n std::string host_;\n\n std::string port_;\n\n std::string path_;\n\n std::string query_;\n\n std::string fragment_;\n\n bool ipv6_host_;\n\n};\n\n\n\n} // namespace urdl\n\n\n\n#include \"detail/abi_suffix.hpp\"\n\n\n\n#if defined(URDL_HEADER_ONLY)\n\n# include \"impl/url.ipp\"\n\n#endif\n\n\n\n#endif // URDL_URL_HPP\n","file_path":"include/external/urdl/url.hpp","rank":9,"score":100125.77488055655},{"content":"//\n\n// url.hpp\n\n// ~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n\n//\n\n// Distributed under the Boost Software License, Version 1.0. (See accompanying\n\n// path LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n//\n\n\n\n#ifndef URDL_URL_HPP\n\n#define URDL_URL_HPP\n\n\n\n#include <string>\n\n#include \"detail/config.hpp\"\n\n#include \"detail/abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\n\n\n/// The class @c url enables parsing and accessing the components of URLs.\n","file_path":"include/external/urdl/url.hpp","rank":10,"score":100125.35941379638},{"content":" */\n\n void value(const std::string& v)\n\n {\n\n value_ = v;\n\n }\n\n\n\nprivate:\n\n std::string value_;\n\n};\n\n\n\nnamespace errc {\n\n\n\n/// HTTP error codes.\n\n/**\n\n * The enumerators of type @c errc_t are implicitly convertible to objects of\n\n * type @c asio::error_code.\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n","file_path":"include/external/urdl/http.hpp","rank":12,"score":100122.24155792604},{"content":" * is.open(\"http://www.boost.org\");\n\n * @endcode\n\n *\n\n * To set the user agent for an object of class @c urdl::read_stream:\n\n * @code\n\n * urdl::read_stream stream;\n\n * stream.set_option(urdl::http::user_agent(\"Urdl\"));\n\n * stream.open(\"http://www.boost.org\");\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n","file_path":"include/external/urdl/http.hpp","rank":13,"score":100121.57918954385},{"content":" * is.open(\"http://www.boost.org\");\n\n * @endcode\n\n *\n\n * To set the request method for an object of class @c urdl::read_stream:\n\n * @code\n\n * urdl::read_stream stream;\n\n * stream.set_option(urdl::http::request_method(\"HEAD\"));\n\n * stream.open(\"http://www.boost.org\");\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n","file_path":"include/external/urdl/http.hpp","rank":14,"score":100121.31297238504},{"content":" * is.set_option(urdl::http::max_redirects(1));\n\n * is.open(\"http://www.boost.org\");\n\n * @endcode\n\n *\n\n * To set maximum number of redirects for an object of class\n\n * @c urdl::read_stream:\n\n * @code\n\n * urdl::read_stream stream;\n\n * stream.set_option(urdl::http::max_redirects(1));\n\n * stream.open(\"http://www.boost.org\");\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n","file_path":"include/external/urdl/http.hpp","rank":16,"score":100121.18574841897},{"content":"/// Gets the error category for HTTP errors.\n\n/**\n\n * @returns The @c asio::error_category used for HTTP errors.\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n\nURDL_DECL const asio::error_category& error_category();\n\n\n\n/// Option to specify the HTTP request method.\n\n/**\n\n * @par Remarks\n\n * The default request method is \"GET\".\n\n *\n\n * @par Example\n\n * To set the request method for an object of class @c urdl::istream:\n\n * @code\n\n * urdl::istream is;\n\n * is.set_option(urdl::http::request_method(\"HEAD\"));\n","file_path":"include/external/urdl/http.hpp","rank":17,"score":100120.71286715995},{"content":" * is.set_option(urdl::http::request_content(\"Hello, world!\"));\n\n * is.set_option(urdl::http::request_content_type(\"text/plain\"));\n\n * is.open(\"http://host/path\");\n\n * @endcode\n\n *\n\n * To add content to the HTTP request using an object of class\n\n * @c urdl::read_stream:\n\n * @code\n\n * urdl::read_stream stream;\n\n * stream.set_option(urdl::http::request_method(\"POST\"));\n\n * stream.set_option(urdl::http::request_content(\"Hello, world!\"));\n\n * stream.set_option(urdl::http::request_content_type(\"text/plain\"));\n\n * stream.open(\"http://host/path\");\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n","file_path":"include/external/urdl/http.hpp","rank":18,"score":100120.31381267445},{"content":" * is.set_option(urdl::http::request_content(\"Hello, world!\"));\n\n * is.set_option(urdl::http::request_content_type(\"text/plain\"));\n\n * is.open(\"http://host/path\");\n\n * @endcode\n\n *\n\n * To add content to the HTTP request using an object of class\n\n * @c urdl::read_stream:\n\n * @code\n\n * urdl::read_stream stream;\n\n * stream.set_option(urdl::http::request_method(\"POST\"));\n\n * stream.set_option(urdl::http::request_content(\"Hello, world!\"));\n\n * stream.set_option(urdl::http::request_content_type(\"text/plain\"));\n\n * stream.open(\"http://host/path\");\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n","file_path":"include/external/urdl/http.hpp","rank":19,"score":100120.31381267445},{"content":"/// The class @c istream supports reading content from a specified URL.\n\n/**\n\n * @par Remarks\n\n * The class stores an object of class @c istreambuf.\n\n *\n\n * Currently supported URL protocols are @c http, @c https and @c file.\n\n *\n\n * @par Example\n\n * To read the entire content of a resource located by a URL into a string:\n\n * @code\n\n * urdl::istream is(\"http://www.boost.org/LICENSE_1_0.txt\");\n\n * if (is)\n\n * {\n\n * std::string content;\n\n * if (std::getline(is, content, std::char_traits<char>::eof()))\n\n * {\n\n * ...\n\n * }\n\n * }\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/istream.hpp> @n\n\n * @e Namespace: @c urdl\n\n */\n","file_path":"include/external/urdl/istream.hpp","rank":20,"score":100119.41231750825},{"content":" /// The server-generated status code \"502 Bad Gateway\".\n\n bad_gateway = 502,\n\n\n\n /// The server-generated status code \"503 Service Unavailable\".\n\n service_unavailable = 503,\n\n\n\n /// The server-generated status code \"504 Gateway Timeout\".\n\n gateway_timeout = 504,\n\n\n\n /// The server-generated status code \"505 HTTP Version Not Supported\".\n\n version_not_supported = 505\n\n};\n\n\n\n/// Converts a value of type @c errc_t to a corresponding object of type\n\n/// @c asio::error_code.\n\n/**\n\n * @par Requirements\n\n * @e Header: @c <urdl/http.hpp> @n\n\n * @e Namespace: @c urdl::http\n\n */\n","file_path":"include/external/urdl/http.hpp","rank":21,"score":100118.92902620125},{"content":"/**\n\n * @par Example\n\n * To extract the components of a URL:\n\n * @code\n\n * urdl::url url(\"http://user:pass@host:1234/dir/page?param=0#anchor\");\n\n * std::cout << \"Protocol: \" << url.protocol() << std::endl;\n\n * std::cout << \"User Info: \" << url.user_info() << std::endl;\n\n * std::cout << \"Host: \" << url.host() << std::endl;\n\n * std::cout << \"Port: \" << url.port() << std::endl;\n\n * std::cout << \"Path: \" << url.path() << std::endl;\n\n * std::cout << \"Query: \" << url.query() << std::endl;\n\n * std::cout << \"Fragment: \" << url.fragment() << std::endl;\n\n * @endcode\n\n * The above code will print:\n\n * @code\n\n * Protocol: http\n\n * User Info: user:pass\n\n * Host: host\n\n * Port: 1234\n\n * Path: /dir/page\n\n * Query: param=0\n\n * Fragment: anchor\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/url.hpp> @n\n\n * @e Namespace: @c urdl\n\n */\n","file_path":"include/external/urdl/url.hpp","rank":23,"score":100117.5894869525},{"content":" */\n\n void value(std::size_t v)\n\n {\n\n value_ = v;\n\n }\n\n\n\nprivate:\n\n std::size_t value_;\n\n};\n\n\n\n/// Option to specify the user agent identifier.\n\n/**\n\n * @par Remarks\n\n * The default is to not specify the user agent.\n\n *\n\n * @par Example\n\n * To set the user agent for an object of class @c urdl::istream:\n\n * @code\n\n * urdl::istream is;\n\n * is.set_option(urdl::http::user_agent(\"Urdl\"));\n","file_path":"include/external/urdl/http.hpp","rank":24,"score":100117.19894709153},{"content":" *\n\n * @param ec Error code set to indicate the reason for failure, if any.\n\n *\n\n * @returns A @c url object corresponding to the specified string.\n\n */\n\n URDL_DECL static url from_string(const std::string& s,\n\n asio::error_code& ec);\n\n\n\n /// Compares two @c url objects for equality.\n\n friend URDL_DECL bool operator==(const url& a, const url& b);\n\n\n\n /// Compares two @c url objects for inequality.\n\n friend URDL_DECL bool operator!=(const url& a, const url& b);\n\n\n\n /// Compares two @c url objects for ordering.\n\n friend URDL_DECL bool operator<(const url& a, const url& b);\n\n\n\nprivate:\n\n URDL_DECL static bool unescape_path(const std::string& in, std::string& out);\n\n\n","file_path":"include/external/urdl/url.hpp","rank":25,"score":100116.73282815052},{"content":" * urdl::url::host_component\n\n * | urdl::url::port_component);\n\n * @endcode\n\n */\n\n URDL_DECL std::string to_string(int components = all_components) const;\n\n\n\n /// Converts a string representation of a URL into an object of class @c url.\n\n /**\n\n * @param s URL string to be parsed into its components.\n\n *\n\n * @returns A @c url object corresponding to the specified string.\n\n *\n\n * @throws asio::system_error Thrown when the URL string is invalid.\n\n */\n\n URDL_DECL static url from_string(const char* s);\n\n\n\n /// Converts a string representation of a URL into an object of class @c url.\n\n /**\n\n * @param s URL string to be parsed into its components.\n\n *\n","file_path":"include/external/urdl/url.hpp","rank":26,"score":100116.62739691888},{"content":" */\n\n void value(const std::string& v)\n\n {\n\n value_ = v;\n\n }\n\n\n\nprivate:\n\n std::string value_;\n\n};\n\n\n\n/// Option to specify content to accompany an HTTP request.\n\n/**\n\n * @par Remarks\n\n * The default is for no content to be sent.\n\n *\n\n * @par Example\n\n * To add content to the HTTP request using an object of class @c urdl::istream:\n\n * @code\n\n * urdl::istream is;\n\n * is.set_option(urdl::http::request_method(\"POST\"));\n","file_path":"include/external/urdl/http.hpp","rank":27,"score":100116.61019140642},{"content":" */\n\n void value(const std::string& v)\n\n {\n\n value_ = v;\n\n }\n\n\n\nprivate:\n\n std::string value_;\n\n};\n\n\n\n/// Option to specify the type of the content that accompanies an HTTP request.\n\n/**\n\n * @par Remarks\n\n * The default is for no content type to be specified in the request.\n\n *\n\n * @par Example\n\n * To add content to the HTTP request using an object of class @c urdl::istream:\n\n * @code\n\n * urdl::istream is;\n\n * is.set_option(urdl::http::request_method(\"POST\"));\n","file_path":"include/external/urdl/http.hpp","rank":28,"score":100116.57171098245},{"content":" {\n\n rdbuf()->set_option(option);\n\n }\n\n\n\n /// Sets options to control the behaviour of the stream.\n\n /**\n\n * @param options The options to be set on the stream. The options in the set\n\n * are added on top of any options already set on the stream.\n\n *\n\n * @par Remarks\n\n * Performs @c rdbuf()->set_options(options).\n\n *\n\n * @par Example\n\n * @code\n\n * urdl::istream is;\n\n * urdl::option_set options;\n\n * options.set_option(urdl::http::max_redirects(1));\n\n * options.set_option(urdl::ssl::verify_peer(false));\n\n * stream.set_options(options);\n\n * @endcode\n","file_path":"include/external/urdl/istream.hpp","rank":29,"score":100116.5127088537},{"content":" */\n\n void set_options(const option_set& options)\n\n {\n\n rdbuf()->set_options(options);\n\n }\n\n\n\n /// Gets the current value of an option that controls the behaviour of the\n\n /// stream.\n\n /**\n\n * @returns The current value of the option.\n\n *\n\n * @par Remarks\n\n * Returns @c rdbuf()->get_option<Option>(). Options are uniquely identified\n\n * by type.\n\n *\n\n * @par Example\n\n * @code\n\n * urdl::istream is;\n\n * urdl::http::max_redirects option\n\n * = is.get_option<urdl::http::max_redirects>();\n","file_path":"include/external/urdl/istream.hpp","rank":30,"score":100116.31462632296},{"content":" * ...\n\n * urdl::option_set options(is.get_options());\n\n * urdl::http::max_redirects option\n\n * = options.get_option<urdl::http::max_redirects>();\n\n * std::size_t value = option.value();\n\n * @endcode\n\n */\n\n option_set get_options() const\n\n {\n\n return rdbuf()->get_options();\n\n }\n\n\n\n /// Determines whether the stream is open.\n\n /**\n\n * @returns @c true if the stream is open, @c false otherwise.\n\n *\n\n * @par Remarks\n\n * Returns @c rdbuf()->is_open().\n\n */\n\n bool is_open() const\n","file_path":"include/external/urdl/istream.hpp","rank":31,"score":100116.27956454825},{"content":" */\n\n void value(const std::string& v)\n\n {\n\n value_ = v;\n\n }\n\n\n\nprivate:\n\n std::string value_;\n\n};\n\n\n\n/// Option to specify the maximum number of allowed HTTP redirects.\n\n/**\n\n * @par Remarks\n\n * The default value is for there to be no limit on the number of allowed\n\n * redirects. Set the option to 0 to disable HTTP redirects.\n\n *\n\n * @par Example\n\n * To set maximum number of redirects for an object of class @c urdl::istream:\n\n * @code\n\n * urdl::istream is;\n","file_path":"include/external/urdl/http.hpp","rank":33,"score":100115.72776826534},{"content":" *\n\n * @par Remarks\n\n * Initializes the base class with @c std::basic_istream<char>(sb), where\n\n * @c sb is an object of class @c istreambuf stored within the class. It also\n\n * performs @c rdbuf()->set_options(options), then opens @c sb by performing\n\n * @c sb.open(u) and, if that fails (returns a null pointer), calls\n\n * @c setstate(failbit).\n\n *\n\n * @par Example\n\n * @code\n\n * urdl::option_set options;\n\n * options.set_option(urdl::http::max_redirects(1));\n\n * urdl::istream is(\"http://www.boost.org\", options);\n\n * @endcode\n\n */\n\n explicit istream(const url& u, const option_set& options)\n\n : std::basic_istream<char>(\n\n &this->base_from_member<istreambuf>::member)\n\n {\n\n rdbuf()->set_options(options);\n","file_path":"include/external/urdl/istream.hpp","rank":34,"score":100115.57015435984},{"content":" if (rdbuf()->open(u) == 0)\n\n setstate(std::ios_base::failbit);\n\n }\n\n\n\n /// Sets an option to control the behaviour of the stream.\n\n /**\n\n * @param option The option to be set on the stream.\n\n *\n\n * @par Remarks\n\n * Performs @c rdbuf()->set_option(option). Options are uniquely identified by\n\n * type.\n\n *\n\n * @par Example\n\n * @code\n\n * urdl::istream is;\n\n * is.set_option(urdl::http::max_redirects(1));\n\n * @endcode\n\n */\n\n template <typename Option>\n\n void set_option(const Option& option)\n","file_path":"include/external/urdl/istream.hpp","rank":35,"score":100115.40128265912},{"content":" &this->base_from_member<istreambuf>::member);\n\n }\n\n\n\n /// Gets the last error associated with the stream.\n\n /**\n\n * @returns An @c error_code corresponding to the last error from the stream.\n\n *\n\n * @par Remarks\n\n * Returns a reference to an @c error_code object representing the last\n\n * failure reported by an @c istreambuf function. The set of possible\n\n * @c error_code values and categories depends on the protocol of the URL\n\n * used to open the stream.\n\n *\n\n * @par Example\n\n * To take action given a specific error:\n\n * @code\n\n * urdl::istream is(\"http://somesite/page\");\n\n * if (!is)\n\n * {\n\n * if (is.error() == urdl::http::errc::forbidden)\n","file_path":"include/external/urdl/istream.hpp","rank":37,"score":100115.04305936325},{"content":" * @param ec Error code set to indicate the reason for failure, if any.\n\n *\n\n * @returns A @c url object corresponding to the specified string.\n\n */\n\n URDL_DECL static url from_string(const char* s,\n\n asio::error_code& ec);\n\n\n\n /// Converts a string representation of a URL into an object of class @c url.\n\n /**\n\n * @param s URL string to be parsed into its components.\n\n *\n\n * @returns A @c url object corresponding to the specified string.\n\n *\n\n * @throws asio::system_error Thrown when the URL string is invalid.\n\n */\n\n URDL_DECL static url from_string(const std::string& s);\n\n\n\n /// Converts a string representation of a URL into an object of class @c url.\n\n /**\n\n * @param s URL string to be parsed into its components.\n","file_path":"include/external/urdl/url.hpp","rank":39,"score":100114.94489000126},{"content":" /**\n\n * @returns A string containing the host name of the URL.\n\n */\n\n std::string host() const\n\n {\n\n return host_;\n\n }\n\n\n\n /// Gets the port component of the URL.\n\n /**\n\n * @returns The port number of the URL.\n\n *\n\n * @par Remarks\n\n * If the URL string did not specify a port, and the protocol is one of @c\n\n * http, @c https or @c ftp, an appropriate default port number is returned.\n\n */\n\n URDL_DECL unsigned short port() const;\n\n\n\n /// Gets the path component of the URL.\n\n /**\n","file_path":"include/external/urdl/url.hpp","rank":40,"score":100114.06055687716},{"content":" * std::size_t value = option.value();\n\n * @endcode\n\n */\n\n template <typename Option>\n\n Option get_option() const\n\n {\n\n return rdbuf()->get_option<Option>();\n\n }\n\n\n\n /// Gets the values of all options set on the stream.\n\n /**\n\n * @returns An option set containing all options from the stream.\n\n *\n\n * @par Remarks\n\n * Returns @c rdbuf()->get_options().\n\n *\n\n * @par Example\n\n * To get the options that have been set on the stream:\n\n * @code\n\n * urdl::istream is;\n","file_path":"include/external/urdl/istream.hpp","rank":41,"score":100114.06055687716},{"content":" /**\n\n * @returns A string specifying the protocol of the URL. Examples include\n\n * @c http, @c https or @c file.\n\n */\n\n std::string protocol() const\n\n {\n\n return protocol_;\n\n }\n\n\n\n /// Gets the user info component of the URL.\n\n /**\n\n * @returns A string containing the user info of the URL. Typically in the\n\n * format <tt>user:password</tt>, but depends on the protocol.\n\n */\n\n std::string user_info() const\n\n {\n\n return user_info_;\n\n }\n\n\n\n /// Gets the host component of the URL.\n","file_path":"include/external/urdl/url.hpp","rank":42,"score":100114.03653521104},{"content":" }\n\n\n\n /// Gets the MIME type of the content obtained from the URL.\n\n /**\n\n * @returns A string specifying the MIME type. Examples of possible return\n\n * values include @c text/plain, @c text/html and @c image/png.\n\n *\n\n * @par Remarks\n\n * Returns @c rdbuf()->content_type().\n\n *\n\n * Not all URL protocols support a content type. For these protocols, this\n\n * function returns an empty string.\n\n */\n\n std::string content_type() const\n\n {\n\n return rdbuf()->content_type();\n\n }\n\n\n\n /// Gets the length of the content obtained from the URL.\n\n /**\n","file_path":"include/external/urdl/istream.hpp","rank":43,"score":100113.9130684231},{"content":" * @returns A string containing the path of the URL.\n\n *\n\n * @par Remarks\n\n * The path string is unescaped. To obtain the path in escaped form, use\n\n * @c to_string(url::path_component).\n\n */\n\n URDL_DECL std::string path() const;\n\n\n\n /// Gets the query component of the URL.\n\n /**\n\n * @returns A string containing the query string of the URL.\n\n *\n\n * @par Remarks\n\n * The query string is not unescaped, but is returned in whatever form it\n\n * takes in the original URL string.\n\n */\n\n std::string query() const\n\n {\n\n return query_;\n\n }\n","file_path":"include/external/urdl/url.hpp","rank":44,"score":100113.85778298254},{"content":" all_components = protocol_component | user_info_component | host_component\n\n | port_component | path_component | query_component | fragment_component\n\n };\n\n\n\n /// Converts an object of class @c url to a string representation.\n\n /**\n\n * @param components A bitmask specifying which components of the URL should\n\n * be included in the string. See the @c url::components_type enumeration for\n\n * possible values.\n\n *\n\n * @returns A string representation of the URL.\n\n *\n\n * @par Examples\n\n * To convert the entire URL to a string:\n\n * @code\n\n * std::string s = url.to_string();\n\n * @endcode\n\n * To convert only the host and port number into a string:\n\n * @code\n\n * std::string s = url.to_string(\n","file_path":"include/external/urdl/url.hpp","rank":47,"score":100113.36727595459},{"content":" * @returns The length, in bytes, of the content. If the content associated\n\n * with the URL does not specify a length,\n\n * @c std::numeric_limits<std::size_t>::max().\n\n *\n\n * @par Remarks\n\n * Returns @c rdbuf()->content_length().\n\n */\n\n std::size_t content_length() const\n\n {\n\n return rdbuf()->content_length();\n\n }\n\n\n\n /// Gets the protocol-specific headers obtained from the URL.\n\n /**\n\n * @returns A string containing the headers returned with the content from the\n\n * URL. The format and interpretation of these headers is specific to the\n\n * protocol associated with the URL.\n\n *\n\n * @par Remarks\n\n * Returns @c rdbuf()->headers().\n","file_path":"include/external/urdl/istream.hpp","rank":48,"score":100110.12604997592},{"content":" *\n\n * @par Remarks\n\n * Initializes the base class with @c std::basic_istream<char>(sb),\n\n * where @c sb is an object of class @c istreambuf stored within the class. It\n\n * also opens @c sb by performing @c sb.open(u) and, if that fails (returns a\n\n * null pointer), calls @c setstate(failbit).\n\n */\n\n explicit istream(const url& u)\n\n : std::basic_istream<char>(\n\n &this->base_from_member<istreambuf>::member)\n\n {\n\n if (rdbuf()->open(u) == 0)\n\n setstate(std::ios_base::failbit);\n\n }\n\n\n\n /// Constructs an object of class @c istream.\n\n /**\n\n * @param u The URL to open.\n\n *\n\n * @param options The options to be set on the stream.\n","file_path":"include/external/urdl/istream.hpp","rank":49,"score":100110.12604997592},{"content":"\n\n /// The server-generated status code \"407 Proxy Authentication Required\".\n\n proxy_authentication_required = 407,\n\n\n\n /// The server-generated status code \"408 Request Time-out\".\n\n request_timeout = 408,\n\n\n\n /// The server-generated status code \"409 Conflict\".\n\n conflict = 409,\n\n\n\n /// The server-generated status code \"410 Gone\".\n\n gone = 410,\n\n\n\n /// The server-generated status code \"411 Length Required\".\n\n length_required = 411,\n\n\n\n /// The server-generated status code \"412 Precondition Failed\".\n\n precondition_failed = 412,\n\n\n\n /// The server-generated status code \"413 Request Entity Too Large\".\n","file_path":"include/external/urdl/http.hpp","rank":50,"score":100110.12604997592},{"content":" request_entity_too_large = 413,\n\n\n\n /// The server-generated status code \"414 Request URI Too Large\".\n\n request_uri_too_large = 414,\n\n\n\n /// The server-generated status code \"415 Unsupported Media Type\".\n\n unsupported_media_type = 415,\n\n\n\n /// The server-generated status code \"416 Requested Range Not Satisfiable\".\n\n requested_range_not_satisfiable = 416,\n\n\n\n /// The server-generated status code \"417 Expectation Failed\".\n\n expectation_failed = 417,\n\n\n\n /// The server-generated status code \"500 Internal Server Error\".\n\n internal_server_error = 500,\n\n\n\n /// The server-generated status code \"501 Not Implemented\".\n\n not_implemented = 501,\n\n\n","file_path":"include/external/urdl/http.hpp","rank":51,"score":100110.12604997592},{"content":" */\n\n url(const char* s)\n\n : ipv6_host_(false)\n\n {\n\n *this = from_string(s);\n\n }\n\n\n\n /// Constructs an object of class @c url.\n\n /**\n\n * @param s URL string to be parsed into its components.\n\n *\n\n * @throws asio::system_error Thrown when the URL string is invalid.\n\n */\n\n url(const std::string& s)\n\n : ipv6_host_(false)\n\n {\n\n *this = from_string(s);\n\n }\n\n\n\n /// Gets the protocol component of the URL.\n","file_path":"include/external/urdl/url.hpp","rank":52,"score":100110.12604997592},{"content":" {\n\n return rdbuf()->is_open();\n\n }\n\n\n\n /// Opens the specified URL.\n\n /**\n\n * @param u The URL to open.\n\n *\n\n * @par Remarks\n\n * Calls @c rdbuf()->open(u). If that function does not return a null\n\n * pointer, calls @c clear(). Otherwise calls @c setstate(failbit) (which may\n\n * throw @c ios_base::failure).\n\n */\n\n void open(const url& u)\n\n {\n\n if (rdbuf()->open(u) == 0)\n\n setstate(std::ios_base::failbit);\n\n else\n\n clear();\n\n }\n","file_path":"include/external/urdl/istream.hpp","rank":53,"score":100110.12604997592},{"content":" *\n\n * @par Remarks\n\n * Returns @c rdbuf()->read_timeout().\n\n */\n\n std::size_t read_timeout() const\n\n {\n\n return rdbuf()->read_timeout();\n\n }\n\n\n\n /// Sets the read timeout of the stream.\n\n /**\n\n * @param milliseconds The timeout, in milliseconds, to be used for individual\n\n * read operations on the underlying transport.\n\n *\n\n * @par Remarks\n\n * Performs @c rdbuf()->read_timeout(milliseconds).\n\n */\n\n void read_timeout(std::size_t milliseconds)\n\n {\n\n rdbuf()->read_timeout(milliseconds);\n","file_path":"include/external/urdl/istream.hpp","rank":54,"score":100110.12604997592},{"content":" explicit request_content_type(const std::string& v)\n\n : value_(v)\n\n {\n\n }\n\n\n\n /// Gets the value of the option.\n\n /**\n\n * @returns The value of the option.\n\n */\n\n std::string value() const\n\n {\n\n return value_;\n\n }\n\n\n\n /// Sets the value of the option.\n\n /**\n\n * @param v The desired value for the option.\n\n *\n\n * @par Remarks\n\n * Postcondition: <tt>value() == v</tt>\n","file_path":"include/external/urdl/http.hpp","rank":55,"score":100110.12604997592},{"content":" explicit request_content(const std::string& v)\n\n : value_(v)\n\n {\n\n }\n\n\n\n /// Gets the value of the option.\n\n /**\n\n * @returns The value of the option.\n\n */\n\n std::string value() const\n\n {\n\n return value_;\n\n }\n\n\n\n /// Sets the value of the option.\n\n /**\n\n * @param v The desired value for the option.\n\n *\n\n * @par Remarks\n\n * Postcondition: <tt>value() == v</tt>\n","file_path":"include/external/urdl/http.hpp","rank":56,"score":100110.12604997592},{"content":" return rdbuf()->open_timeout();\n\n }\n\n\n\n /// Sets the open timeout of the stream.\n\n /**\n\n * @param milliseconds The timeout, in milliseconds, to be used when opening\n\n * a URL.\n\n *\n\n * @par Remarks\n\n * Performs @c rdbuf()->open_timeout(milliseconds).\n\n */\n\n void open_timeout(std::size_t milliseconds)\n\n {\n\n rdbuf()->open_timeout(milliseconds);\n\n }\n\n\n\n /// Gets the read timeout of the stream.\n\n /**\n\n * @returns The timeout, in milliseconds, used for individual read operations\n\n * on the underlying transport.\n","file_path":"include/external/urdl/istream.hpp","rank":57,"score":100110.12604997592},{"content":"\n\n /// Gets the fragment component of the URL.\n\n /**\n\n * @returns A string containing the fragment of the URL.\n\n */\n\n std::string fragment() const\n\n {\n\n return fragment_;\n\n }\n\n\n\n /// Components of the URL, used with @c from_string.\n\n enum components_type\n\n {\n\n protocol_component = 1,\n\n user_info_component = 2,\n\n host_component = 4,\n\n port_component = 8,\n\n path_component = 16,\n\n query_component = 32,\n\n fragment_component = 64,\n","file_path":"include/external/urdl/url.hpp","rank":58,"score":100110.12604997592},{"content":" multiple_choices = 300,\n\n\n\n /// The server-generated status code \"301 Moved Permanently\".\n\n moved_permanently = 301,\n\n\n\n /// The server-generated status code \"302 Found\".\n\n found = 302,\n\n\n\n /// The server-generated status code \"303 See Other\".\n\n see_other = 303,\n\n\n\n /// The server-generated status code \"304 Not Modified\".\n\n not_modified = 304,\n\n\n\n /// The server-generated status code \"305 Use Proxy\".\n\n use_proxy = 305,\n\n\n\n /// The server-generated status code \"307 Temporary Redirect\".\n\n temporary_redirect = 307,\n\n\n","file_path":"include/external/urdl/http.hpp","rank":59,"score":100110.12604997592},{"content":" /// The server-generated status code \"400 Bad Request\".\n\n bad_request = 400,\n\n\n\n /// The server-generated status code \"401 Unauthorized\".\n\n unauthorized = 401,\n\n\n\n /// The server-generated status code \"402 Payment Required\".\n\n payment_required = 402,\n\n\n\n /// The server-generated status code \"403 Forbidden\".\n\n forbidden = 403,\n\n\n\n /// The server-generated status code \"404 Not Found\".\n\n not_found = 404,\n\n\n\n /// The server-generated status code \"405 Method Not Allowed\".\n\n method_not_allowed = 405,\n\n\n\n /// The server-generated status code \"406 Not Acceptable\".\n\n not_acceptable = 406,\n","file_path":"include/external/urdl/http.hpp","rank":60,"score":100110.12604997592},{"content":"\n\n /// Closes the stream.\n\n /**\n\n * @par Remarks\n\n * Calls @c rdbuf()->close() and, if that function returns a null\n\n * pointer, calls @c setstate(failbit) (which may throw @c ios_base::failure).\n\n */\n\n void close()\n\n {\n\n if (rdbuf()->close() == 0)\n\n setstate(std::ios_base::failbit);\n\n }\n\n\n\n /// Gets the underlying stream buffer.\n\n /**\n\n * @returns A pointer to the stream buffer contained within the class.\n\n */\n\n istreambuf* rdbuf() const\n\n {\n\n return const_cast<istreambuf*>(\n","file_path":"include/external/urdl/istream.hpp","rank":61,"score":100110.12604997592},{"content":" explicit max_redirects(std::size_t v)\n\n : value_(v)\n\n {\n\n }\n\n\n\n /// Gets the value of the option.\n\n /**\n\n * @returns The value of the option.\n\n */\n\n std::size_t value() const\n\n {\n\n return value_;\n\n }\n\n\n\n /// Sets the value of the option.\n\n /**\n\n * @param v The desired value for the option.\n\n *\n\n * @par Remarks\n\n * Postcondition: <tt>value() == v</tt>\n","file_path":"include/external/urdl/http.hpp","rank":62,"score":100110.12604997592},{"content":"\n\n /// The server-generated status code \"201 Created\".\n\n created = 201,\n\n\n\n /// The server-generated status code \"202 Accepted\".\n\n accepted = 202,\n\n\n\n /// The server-generated status code \"203 Non-Authoritative Information\".\n\n non_authoritative_information = 203,\n\n\n\n /// The server-generated status code \"204 No Content\".\n\n no_content = 204,\n\n\n\n /// The server-generated status code \"205 Reset Content\".\n\n reset_content = 205,\n\n\n\n /// The server-generated status code \"206 Partial Content\".\n\n partial_content = 206,\n\n\n\n /// The server-generated status code \"300 Multiple Choices\".\n","file_path":"include/external/urdl/http.hpp","rank":63,"score":100110.12604997592},{"content":" * {\n\n * std::cout << \"Computer says no\" << std::endl;\n\n * }\n\n * }\n\n * @endcode\n\n */\n\n const asio::error_code& error() const\n\n {\n\n return rdbuf()->puberror();\n\n }\n\n\n\n /// Gets the open timeout of the stream.\n\n /**\n\n * @returns The timeout, in milliseconds, used when opening a URL.\n\n *\n\n * @par Remarks\n\n * Returns @c rdbuf()->open_timeout().\n\n */\n\n std::size_t open_timeout() const\n\n {\n","file_path":"include/external/urdl/istream.hpp","rank":64,"score":100110.12604997592},{"content":" explicit request_method(const std::string& v)\n\n : value_(v)\n\n {\n\n }\n\n\n\n /// Gets the value of the option.\n\n /**\n\n * @returns The value of the option.\n\n */\n\n std::string value() const\n\n {\n\n return value_;\n\n }\n\n\n\n /// Sets the value of the option.\n\n /**\n\n * @param v The desired value for the option.\n\n *\n\n * @par Remarks\n\n * Postcondition: <tt>value() == v</tt>\n","file_path":"include/external/urdl/http.hpp","rank":65,"score":100110.12604997592},{"content":" explicit user_agent(const std::string& v)\n\n : value_(v)\n\n {\n\n }\n\n\n\n /// Gets the value of the option.\n\n /**\n\n * @returns The value of the option.\n\n */\n\n std::string value() const\n\n {\n\n return value_;\n\n }\n\n\n\n /// Sets the value of the option.\n\n /**\n\n * @param v The desired value for the option.\n\n *\n\n * @par Remarks\n\n * Postcondition: <tt>value() == v</tt>\n","file_path":"include/external/urdl/http.hpp","rank":66,"score":100110.12604997592},{"content":" break;\n\n case final_linefeed:\n\n return (c == '\\n');\n\n default:\n\n return false;\n\n }\n\n }\n\n return false;\n\n}\n\n\n\n} // namespace detail\n\n} // namespace urdl\n\n\n\n#include \"abi_suffix.hpp\"\n\n\n\n#endif // URDL_DETAIL_PARSERS_HPP\n","file_path":"include/external/urdl/detail/parsers.hpp","rank":67,"score":96784.9399272547},{"content":"//\n\n// connect.hpp\n\n// ~~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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 URDL_DETAIL_CONNECT_HPP\n\n#define URDL_DETAIL_CONNECT_HPP\n\n\n\n#include <sstream>\n\n#include \"coroutine.hpp\"\n\n#include \"abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\nnamespace detail {\n\n\n","file_path":"include/external/urdl/detail/connect.hpp","rank":68,"score":96783.88442024332},{"content":" } while (0)\n\n\n\n#if defined(_MSC_VER)\n\n# define URDL_CORO_YIELD(s) URDL_CORO_YIELD_IMPL(s, __COUNTER__ + 1)\n\n#else // defined(_MSC_VER)\n\n# define URDL_CORO_YIELD(s) URDL_CORO_YIELD_IMPL(s, __LINE__)\n\n#endif // defined(_MSC_VER)\n\n\n\n#define URDL_CORO_END \\\n\n }\n\n\n\n} // namespace detail\n\n} // namespace urdl\n\n\n\n#include \"abi_suffix.hpp\"\n\n\n\n#endif // URDL_DETAIL_COROUTINE_HPP\n","file_path":"include/external/urdl/detail/coroutine.hpp","rank":69,"score":96783.504560291},{"content":"//\n\n// parsers.hpp\n\n// ~~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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 URDL_DETAIL_PARSERS_HPP\n\n#define URDL_DETAIL_PARSERS_HPP\n\n\n\n#include <algorithm>\n\n#include <cctype>\n\n#include <cstdlib>\n\n#include <string>\n\n#include \"abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n","file_path":"include/external/urdl/detail/parsers.hpp","rank":70,"score":96783.16854402907},{"content":"//\n\n// coroutine.hpp\n\n// ~~~~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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 URDL_DETAIL_COROUTINE_HPP\n\n#define URDL_DETAIL_COROUTINE_HPP\n\n\n\n#include \"abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\nnamespace detail {\n\n\n","file_path":"include/external/urdl/detail/coroutine.hpp","rank":71,"score":96781.99212186292},{"content":" URDL_DECL void set_option_wrapper_base(option_wrapper_base* o);\n\n URDL_DECL option_wrapper_base* get_option_wrapper_base(\n\n const std::type_info& ti) const;\n\n URDL_DECL void clear_option_wrapper_base(const std::type_info& ti);\n\n\n\n std::unique_ptr<option_wrapper_base> head_;\n\n};\n\n\n\n} // namespace urdl\n\n\n\n#include \"detail/abi_suffix.hpp\"\n\n\n\n#if defined(URDL_HEADER_ONLY)\n\n# include \"impl/option_set.ipp\"\n\n#endif\n\n\n\n#endif // URDL_OPTION_SET_HPP\n","file_path":"include/external/urdl/option_set.hpp","rank":72,"score":96781.85301884999},{"content":"//\n\n// option_set.hpp\n\n// ~~~~~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n\n//\n\n// Distributed under the Boost Software License, Version 1.0. (See accompanying\n\n// path LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n\n//\n\n\n\n#ifndef URDL_OPTION_SET_HPP\n\n#define URDL_OPTION_SET_HPP\n\n\n\n#include <typeinfo>\n\n#include \"detail/config.hpp\"\n\n#include \"detail/abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\n\n\n/// The class @c option_set maintains a collection of options.\n","file_path":"include/external/urdl/option_set.hpp","rank":73,"score":96781.713394977},{"content":" std::string host_;\n\n};\n\n\n\ntemplate <typename Handler>\n\nvoid async_handshake(\n\n asio::ssl::stream<asio::ip::tcp::socket>& socket,\n\n const std::string& host, Handler handler)\n\n{\n\n handshake_coro<Handler>(handler, socket, host)(asio::error_code());\n\n}\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n\n\n} // namespace detail\n\n} // namespace urdl\n\n\n\n#include \"abi_suffix.hpp\"\n\n\n\n#endif // URDL_DETAIL_HANDSHAKE_HPP\n","file_path":"include/external/urdl/detail/handshake.hpp","rank":74,"score":96781.65247318485},{"content":"#endif // !defined(URDL_DISABLE_SSL)\n\n\n\n#include \"abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\nnamespace detail {\n\n\n\ninline asio::error_code handshake(\n\n asio::ip::tcp::socket& /*socket*/,\n\n const std::string& /*host*/, asio::error_code& ec)\n\n{\n\n ec = asio::error_code();\n\n return ec;\n\n}\n\n\n\ntemplate <typename Handler>\n\nvoid async_handshake(asio::ip::tcp::socket& socket,\n\n const std::string& /*host*/, Handler handler)\n\n{\n\n asio::error_code ec;\n","file_path":"include/external/urdl/detail/handshake.hpp","rank":75,"score":96780.0187009886},{"content":"#if !defined(URDL_DISABLE_SSL)\n\n# include \"asio/ssl.hpp\"\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n\n\n#include \"detail/abi_prefix.hpp\"\n\n\n\nnamespace urdl {\n\n\n\n/// The class @c read_stream supports reading content from a specified URL\n\n/// using synchronous or asynchronous operations.\n\n/**\n\n * @par Remarks\n\n * Currently supported URL protocols are @c http, @c https and @c file.\n\n *\n\n * The class @c read_stream meets the type requirements for @c SyncReadStream\n\n * and @c AsyncReadStream, as defined in the Boost.Asio documentation. This\n\n * allows objects of class @c read_stream to be used with the functions\n\n * @c asio::read, @c asio::async_read, @c asio::read_until\n\n * and @c asio::async_read_until.\n\n *\n","file_path":"include/external/urdl/read_stream.hpp","rank":76,"score":96779.65115261203},{"content":"//\n\n// handshake.hpp\n\n// ~~~~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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 URDL_DETAIL_HANDSHAKE_HPP\n\n#define URDL_DETAIL_HANDSHAKE_HPP\n\n\n\n#include <cstring>\n\n#include <cctype>\n\n#include \"coroutine.hpp\"\n\n\n\n#if !defined(URDL_DISABLE_SSL)\n\n# include \"asio/ssl.hpp\"\n\n# include <openssl/x509v3.h>\n","file_path":"include/external/urdl/detail/handshake.hpp","rank":77,"score":96779.36234986945},{"content":"template <typename Handler>\n\nvoid async_connect(asio::ip::tcp::socket::lowest_layer_type& socket,\n\n asio::ip::tcp::resolver& resolver, const url& u, Handler handler)\n\n{\n\n std::ostringstream port_string;\n\n port_string << u.port();\n\n asio::ip::tcp::resolver::query query(u.host(), port_string.str());\n\n connect_coro<Handler>(handler, socket, resolver)(\n\n asio::error_code(), &query);\n\n}\n\n\n\n} // namespace detail\n\n} // namespace urdl\n\n\n\n#include \"abi_suffix.hpp\"\n\n\n\n#endif // URDL_DETAIL_CONNECT_HPP\n","file_path":"include/external/urdl/detail/connect.hpp","rank":78,"score":96779.34106985916},{"content":"\n\n asio::io_context& io_context_;\n\n option_set options_;\n\n detail::file_read_stream file_;\n\n detail::http_read_stream<asio::ip::tcp::socket> http_;\n\n#if !defined(URDL_DISABLE_SSL)\n\n asio::ssl::context ssl_context_;\n\n detail::http_read_stream<\n\n asio::ssl::stream<\n\n asio::ip::tcp::socket> > https_;\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n enum { unknown, file, http, https } protocol_;\n\n};\n\n\n\n} // namespace urdl\n\n\n\n#include \"detail/abi_suffix.hpp\"\n\n\n\n#endif // URDL_READ_STREAM_HPP\n","file_path":"include/external/urdl/read_stream.hpp","rank":79,"score":96779.14220960785},{"content":"//\n\n// read_stream.hpp\n\n// ~~~~~~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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 URDL_READ_STREAM_HPP\n\n#define URDL_READ_STREAM_HPP\n\n\n\n#include \"http.hpp\"\n\n#include \"option_set.hpp\"\n\n#include \"url.hpp\"\n\n#include \"detail/coroutine.hpp\"\n\n#include \"detail/file_read_stream.hpp\"\n\n#include \"detail/http_read_stream.hpp\"\n\n\n","file_path":"include/external/urdl/read_stream.hpp","rank":80,"score":96778.26004621026},{"content":"/**\n\n * @par Remarks\n\n * Options are uniquely identified by type, so the @c option_set class is a\n\n * collection of objects of differing types, indexed by type.\n\n *\n\n * The option types stored in the set must meet the type requirements for\n\n * CopyConstructible.\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/option_set.hpp> @n\n\n * @e Namespace: @c urdl\n\n */\n","file_path":"include/external/urdl/option_set.hpp","rank":81,"score":96777.37099404875},{"content":"//\n\n// config.hpp\n\n// ~~~~~~~~~~\n\n//\n\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\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// No include guard.\n\n\n\n#if defined(URDL_HEADER_ONLY)\n\n# define URDL_DECL inline\n\n#else // defined(URDL_HEADER_ONLY)\n\n# if defined(BOOST_HAS_DECLSPEC)\n\n// We need to import/export our code only if the user has specifically asked\n\n// for it by defining either BOOST_ALL_DYN_LINK if they want all boost\n\n// libraries to be dynamically linked (and if boost is dynamically linked, urdl\n\n// must be dynamically linked too), or URDL_DYN_LINK if they want just urdl to\n","file_path":"include/external/urdl/detail/config.hpp","rank":82,"score":96776.39717451607},{"content":" * read_stream.async_read_some(asio::buffer(data), read_handler);\n\n * }\n\n * }\n\n * ...\n\n * void read_handler(const asio::error_code& ec, std::size_t length)\n\n * {\n\n * if (!ec)\n\n * {\n\n * std::cout.write(data, length);\n\n * read_stream.async_read_some(asio::buffer(data), read_handler);\n\n * }\n\n * }\n\n * @endcode\n\n *\n\n * @par Requirements\n\n * @e Header: @c <urdl/read_stream.hpp> @n\n\n * @e Namespace: @c urdl\n\n */\n","file_path":"include/external/urdl/read_stream.hpp","rank":83,"score":96775.76259854477},{"content":" case http:\n\n return http_.close(ec);\n\n#if !defined(URDL_DISABLE_SSL)\n\n case https:\n\n return https_.close(ec);\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n default:\n\n ec = asio::error_code();\n\n break;\n\n }\n\n\n\n return ec;\n\n }\n\n\n\n /// Gets the MIME type of the content obtained from the URL.\n\n /**\n\n * @returns A string specifying the MIME type. Examples of possible return\n\n * values include @c text/plain, @c text/html and @c image/png.\n\n *\n\n * @par Remarks\n","file_path":"include/external/urdl/read_stream.hpp","rank":84,"score":96775.67717618815},{"content":"// be dynamically liked.\n\n# if defined(BOOST_ALL_DYN_LINK) || defined(URDL_DYN_LINK)\n\n# if !defined(URDL_DYN_LINK)\n\n# define URDL_DYN_LINK\n\n# endif // !defined(URDL_DYN_LINK)\n\n// Export if this is our own source, otherwise import.\n\n# if defined(URDL_SOURCE)\n\n# define URDL_DECL __declspec(dllexport)\n\n# else // defined(URDL_SOURCE)\n\n# define URDL_DECL __declspec(dllimport)\n\n# endif // defined(URDL_SOURCE)\n\n# endif // defined(BOOST_ALL_DYN_LINK) || defined(URDL_DYN_LINK)\n\n# endif // defined(BOOST_HAS_DECLSPEC)\n\n#endif // defined(URDL_HEADER_ONLY)\n\n\n\n// If URDL_DECL isn't defined yet define it now.\n\n#if !defined(URDL_DECL)\n\n# define URDL_DECL\n\n#endif // !defined(URDL_DECL)\n\n\n","file_path":"include/external/urdl/detail/config.hpp","rank":85,"score":96774.61659540875},{"content":"# else\n\n# define URDL_LIB_PREFIX \"lib\"\n\n# endif\n\n\n\n# if defined(_DEBUG)\n\n# if defined(_DLL)\n\n# define URDL_LIB_SUFFIX \"-gd\"\n\n# else\n\n# define URDL_LIB_SUFFIX \"-sgd\"\n\n# endif\n\n# else\n\n# if defined(_DLL)\n\n# define URDL_LIB_SUFFIX\n\n# else\n\n# define URDL_LIB_SUFFIX \"-s\"\n\n# endif\n\n# endif\n\n\n\n# pragma comment(lib, URDL_LIB_PREFIX \"urdl\" URDL_LIB_SUFFIX \".lib\")\n\n\n\n#endif // !defined(BOOST_ALL_NO_LIB) && !defined(URDL_NO_LIB)\n\n // && !defined(URDL_SOURCE) && !defined(URDL_HEADER_ONLY)\n\n // && defined(_MSC_VER)\n","file_path":"include/external/urdl/detail/config.hpp","rank":86,"score":96774.56595423556},{"content":"#if (BOOST_VERSION >= 105400)\n\n# define URDL_INITFN_RESULT_TYPE(h, sig) BOOST_ASIO_INITFN_RESULT_TYPE(h, sig)\n\n#else // (BOOST_VERSION >= 105400)\n\n# define URDL_INITFN_RESULT_TYPE(h, sig) void\n\n#endif // (BOOST_VERSION >= 105400)\n\n\n\n// Enable library autolinking for MSVC.\n\n\n\n#if !defined(BOOST_ALL_NO_LIB) && !defined(URDL_NO_LIB) \\\n\n && !defined(URDL_SOURCE) && !defined(URDL_HEADER_ONLY) \\\n\n && defined(_MSC_VER)\n\n\n\n# if !defined(_MT)\n\n# error \"You must use the multithreaded runtime.\"\n\n# endif\n\n\n\n# if (defined(_DLL) || defined(_RTLDLL)) && defined(URDL_DYN_LINK)\n\n# define URDL_LIB_PREFIX\n\n# elif defined(URDL_DYN_LINK)\n\n# error \"Mixing a dll library with a static runtime is unsupported.\"\n","file_path":"include/external/urdl/detail/config.hpp","rank":87,"score":96773.80411141897},{"content":" * urdl::read_stream stream(io_context);\n\n * ...\n\n * urdl::option_set options(stream.get_options());\n\n * urdl::http::max_redirects option\n\n * = options.get_option<urdl::http::max_redirects>();\n\n * std::size_t value = option.value();\n\n * @endcode\n\n */\n\n option_set get_options() const\n\n {\n\n return options_;\n\n }\n\n\n\n /// Determines whether the stream is open.\n\n /**\n\n * @returns @c true if the stream is open, @c false otherwise.\n\n */\n\n bool is_open() const\n\n {\n\n switch (protocol_)\n","file_path":"include/external/urdl/read_stream.hpp","rank":88,"score":96773.22699774466},{"content":" * urdl::read_stream stream(io_context);\n\n * urdl::option_set options;\n\n * options.set_option(urdl::http::max_redirects(1));\n\n * options.set_option(urdl::ssl::verify_peer(false));\n\n * stream.set_options(options);\n\n * @endcode\n\n */\n\n void set_options(const option_set& options)\n\n {\n\n options_.set_options(options);\n\n }\n\n\n\n /// Gets the current value of an option that controls the behaviour of the\n\n /// stream.\n\n /**\n\n * @returns The current value of the option.\n\n *\n\n * @par Remarks\n\n * Options are uniquely identified by type.\n\n *\n","file_path":"include/external/urdl/read_stream.hpp","rank":89,"score":96773.04865585399},{"content":" urdl::http::max_redirects>().value();\n\n if (redirects < max_redirects)\n\n {\n\n ++redirects;\n\n tmp_url = https_.location();\n\n https_.close(ec);\n\n continue;\n\n }\n\n }\n\n return ec;\n\n }\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n else\n\n {\n\n ec = asio::error::operation_not_supported;\n\n return ec;\n\n }\n\n }\n\n }\n\n\n","file_path":"include/external/urdl/read_stream.hpp","rank":90,"score":96772.69912517791},{"content":" * @par Example\n\n * @code\n\n * urdl::read_stream stream(io_context);\n\n * urdl::http::max_redirects option\n\n * = stream.get_option<urdl::http::max_redirects>();\n\n * std::size_t value = option.value();\n\n * @endcode\n\n */\n\n template <typename Option>\n\n Option get_option() const\n\n {\n\n return options_.get_option<Option>();\n\n }\n\n\n\n /// Gets the values of all options set on the stream.\n\n /**\n\n * @returns An option set containing all options from the stream.\n\n *\n\n * @par Example\n\n * @code\n","file_path":"include/external/urdl/read_stream.hpp","rank":91,"score":96772.62703850494},{"content":" {\n\n case file:\n\n return file_.is_open();\n\n case http:\n\n return http_.is_open();\n\n#if !defined(URDL_DISABLE_SSL)\n\n case https:\n\n return https_.is_open();\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n default:\n\n return false;\n\n }\n\n }\n\n\n\n /// Opens the specified URL.\n\n /**\n\n * @param u The URL to open.\n\n *\n\n * @throws asio::system_error Thrown on failure.\n\n *\n","file_path":"include/external/urdl/read_stream.hpp","rank":92,"score":96772.4507595562},{"content":" const asio::ip::tcp::resolver::query* query = 0)\n\n {\n\n URDL_CORO_BEGIN;\n\n\n\n // Open the socket to give the caller something to close to cancel the\n\n // asynchronous operation.\n\n socket_.open(asio::ip::tcp::v4(), ec);\n\n if (ec)\n\n {\n\n URDL_CORO_YIELD(socket_.get_io_context().post(\n\n asio::detail::bind_handler(*this, ec)));\n\n handler_(ec);\n\n return;\n\n }\n\n\n\n // Get a list of endpoints corresponding to the host name.\n\n URDL_CORO_YIELD(resolver_.async_resolve(*query, *this));\n\n if (ec)\n\n {\n\n handler_(ec);\n","file_path":"include/external/urdl/detail/connect.hpp","rank":93,"score":96772.39994150346},{"content":" * Not all URL protocols support a content type. For these protocols, this\n\n * function returns an empty string.\n\n */\n\n std::string content_type() const\n\n {\n\n switch (protocol_)\n\n {\n\n case file:\n\n return std::string();\n\n case http:\n\n return http_.content_type();\n\n#if !defined(URDL_DISABLE_SSL)\n\n case https:\n\n return https_.content_type();\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n default:\n\n return std::string();\n\n }\n\n }\n\n\n","file_path":"include/external/urdl/read_stream.hpp","rank":94,"score":96772.17808364797},{"content":" handler_(ec);\n\n return;\n\n }\n\n else if (url_.protocol() == \"http\")\n\n {\n\n this_->protocol_ = http;\n\n URDL_CORO_YIELD(this_->http_.async_open(url_, *this));\n\n if (ec.value() == http::errc::moved_permanently || ec.value() == http::errc::found)\n\n {\n\n url_ = this_->http_.location();\n\n this_->http_.close(ec);\n\n continue;\n\n }\n\n handler_(ec);\n\n return;\n\n }\n\n#if !defined(URDL_DISABLE_SSL)\n\n else if (url_.protocol() == \"https\")\n\n {\n\n this_->protocol_ = https;\n","file_path":"include/external/urdl/read_stream.hpp","rank":95,"score":96772.00994090318},{"content":" break;\n\n#if !defined(URDL_DISABLE_SSL)\n\n case https:\n\n https_.async_read_some(buffers, real_handler);\n\n break;\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n default:\n\n asio::error_code ec\n\n = asio::error::operation_not_supported;\n\n io_context_.post(asio::detail::bind_handler(real_handler, ec, 0));\n\n break;\n\n }\n\n\n\n return result.get();\n\n }\n\n\n\nprivate:\n\n template <typename Handler>\n","file_path":"include/external/urdl/read_stream.hpp","rank":96,"score":96772.00994090318},{"content":" URDL_CORO_YIELD(this_->https_.async_open(url_, *this));\n\n if (ec.value() == http::errc::moved_permanently || ec.value() == http::errc::found)\n\n {\n\n url_ = this_->https_.location();\n\n this_->https_.close(ec);\n\n continue;\n\n }\n\n handler_(ec);\n\n return;\n\n }\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n else\n\n {\n\n ec = asio::error::operation_not_supported;\n\n this_->io_context_.post(\n\n asio::detail::bind_handler(handler_, ec));\n\n return;\n\n }\n\n }\n\n\n","file_path":"include/external/urdl/read_stream.hpp","rank":97,"score":96771.92959882578},{"content":" *\n\n * @par Example\n\n * @code\n\n * urdl::read_stream stream(io_context);\n\n * stream.set_option(urdl::http::max_redirects(1));\n\n * @endcode\n\n */\n\n template <typename Option>\n\n void set_option(const Option& option)\n\n {\n\n options_.set_option(option);\n\n }\n\n\n\n /// Sets options to control the behaviour of the stream.\n\n /**\n\n * @param options The options to be set on the stream. The options in the set\n\n * are added on top of any options already set on the stream.\n\n *\n\n * @par Example\n\n * @code\n","file_path":"include/external/urdl/read_stream.hpp","rank":98,"score":96771.73876770303},{"content":" */\n\n template <typename MutableBufferSequence>\n\n std::size_t read_some(const MutableBufferSequence& buffers,\n\n asio::error_code& ec)\n\n {\n\n switch (protocol_)\n\n {\n\n case file:\n\n return file_.read_some(buffers, ec);\n\n case http:\n\n return http_.read_some(buffers, ec);\n\n#if !defined(URDL_DISABLE_SSL)\n\n case https:\n\n return https_.read_some(buffers, ec);\n\n#endif // !defined(URDL_DISABLE_SSL)\n\n default:\n\n ec = asio::error::operation_not_supported;\n\n return 0;\n\n }\n\n }\n","file_path":"include/external/urdl/read_stream.hpp","rank":99,"score":96771.73876770303}],"string":"[\n {\n \"content\": \"*/\\n\\n\\n\\n#define URDL_HEADER_ONLY\\n\\n#define URDL_DISABLE_SSL\\n\\n#define ASIO_STANDALONE\\n\\n#define ASIO_HAS_STD_CHRONO\\n\\n\\n\\n#include \\\"external/asio/asio/include/asio.hpp\\\"\\n\\n#include \\\"external/urdl/http.hpp\\\"\\n\\n#include \\\"external/urdl/istream.hpp\\\"\\n\\n#include \\\"external/urdl/istreambuf.hpp\\\"\\n\\n#include \\\"external/urdl/option_set.hpp\\\"\\n\\n#include \\\"external/urdl/read_stream.hpp\\\"\\n\\n#include \\\"external/urdl/url.hpp\\\"\\n\\n\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\nnamespace nstd\\n\\n{\\n\",\n \"file_path\": \"include/urdl.hpp\",\n \"rank\": 0,\n \"score\": 107560.42862580251\n },\n {\n \"content\": \" namespace asio = asio;\\n\\n namespace urdl = urdl;\\n\\n\\n\\n template<typename ContainerType = std::string>\\n\\n std::pair<std::string, ContainerType> download_url(const urdl::url &url)\\n\\n {\\n\\n nstd::asio::io_context io_service;\\n\\n\\n\\n nstd::urdl::read_stream stream(io_service);\\n\\n\\n\\n stream.open(url);\\n\\n\\n\\n std::vector<uint8_t> result;\\n\\n\\n\\n while (true)\\n\\n {\\n\\n char data[1024];\\n\\n asio::error_code ec;\\n\\n std::size_t length { stream.read_some(nstd::asio::buffer(data), ec) };\\n\\n\\n\",\n \"file_path\": \"include/urdl.hpp\",\n \"rank\": 1,\n \"score\": 107552.98411664768\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\nMIT License\\n\\nCopyright (c) 2017 Arlen Keshabyan (arlen.albert@gmail.com)\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\",\n \"file_path\": \"include/urdl.hpp\",\n \"rank\": 2,\n \"score\": 107546.70770493812\n },\n {\n \"content\": \" if (ec == nstd::asio::error::eof) break;\\n\\n\\n\\n if (ec) throw std::system_error(ec);\\n\\n\\n\\n std::copy(reinterpret_cast<uint8_t*>(data), reinterpret_cast<uint8_t*>(data) + length, std::back_inserter(result));\\n\\n }\\n\\n\\n\\n return std::make_pair(stream.headers(), ContainerType(std::begin(result), std::end(result)));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"include/urdl.hpp\",\n \"rank\": 3,\n \"score\": 107541.85615195702\n },\n {\n \"content\": \"inline asio::error_code make_error_code(errc_t e)\\n\\n{\\n\\n return asio::error_code(\\n\\n static_cast<int>(e), http::error_category());\\n\\n}\\n\\n\\n\\n} // namespace errc\\n\\n} // namespace http\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"detail/abi_suffix.hpp\\\"\\n\\n\\n\\n#if defined(URDL_HEADER_ONLY)\\n\\n# include \\\"impl/http.ipp\\\"\\n\\n#endif\\n\\n\\n\\n#endif // URDL_HTTP_HPP\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 5,\n \"score\": 100128.79786663178\n },\n {\n \"content\": \" */\\n\\n std::string headers() const\\n\\n {\\n\\n return rdbuf()->headers();\\n\\n }\\n\\n};\\n\\n\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"detail/abi_suffix.hpp\\\"\\n\\n\\n\\n#endif // URDL_ISTREAM_HPP\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 6,\n \"score\": 100127.91494015093\n },\n {\n \"content\": \"//\\n\\n// http.hpp\\n\\n// ~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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 URDL_HTTP_HPP\\n\\n#define URDL_HTTP_HPP\\n\\n\\n\\n#include <string>\\n\\n#include \\\"detail/config.hpp\\\"\\n\\n#include \\\"detail/abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\nnamespace http {\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 7,\n \"score\": 100127.43410486069\n },\n {\n \"content\": \"//\\n\\n// istream.hpp\\n\\n// ~~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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 URDL_ISTREAM_HPP\\n\\n#define URDL_ISTREAM_HPP\\n\\n\\n\\n#include <istream>\\n\\n#include \\\"utility/base_from_member.hpp\\\"\\n\\n#include \\\"istreambuf.hpp\\\"\\n\\n#include \\\"detail/abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 8,\n \"score\": 100126.22592901268\n },\n {\n \"content\": \" std::string protocol_;\\n\\n std::string user_info_;\\n\\n std::string host_;\\n\\n std::string port_;\\n\\n std::string path_;\\n\\n std::string query_;\\n\\n std::string fragment_;\\n\\n bool ipv6_host_;\\n\\n};\\n\\n\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"detail/abi_suffix.hpp\\\"\\n\\n\\n\\n#if defined(URDL_HEADER_ONLY)\\n\\n# include \\\"impl/url.ipp\\\"\\n\\n#endif\\n\\n\\n\\n#endif // URDL_URL_HPP\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 9,\n \"score\": 100125.77488055655\n },\n {\n \"content\": \"//\\n\\n// url.hpp\\n\\n// ~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\n\\n//\\n\\n// Distributed under the Boost Software License, Version 1.0. (See accompanying\\n\\n// path LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\\n\\n//\\n\\n\\n\\n#ifndef URDL_URL_HPP\\n\\n#define URDL_URL_HPP\\n\\n\\n\\n#include <string>\\n\\n#include \\\"detail/config.hpp\\\"\\n\\n#include \\\"detail/abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\n\\n\\n/// The class @c url enables parsing and accessing the components of URLs.\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 10,\n \"score\": 100125.35941379638\n },\n {\n \"content\": \" */\\n\\n void value(const std::string& v)\\n\\n {\\n\\n value_ = v;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n std::string value_;\\n\\n};\\n\\n\\n\\nnamespace errc {\\n\\n\\n\\n/// HTTP error codes.\\n\\n/**\\n\\n * The enumerators of type @c errc_t are implicitly convertible to objects of\\n\\n * type @c asio::error_code.\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 12,\n \"score\": 100122.24155792604\n },\n {\n \"content\": \" * is.open(\\\"http://www.boost.org\\\");\\n\\n * @endcode\\n\\n *\\n\\n * To set the user agent for an object of class @c urdl::read_stream:\\n\\n * @code\\n\\n * urdl::read_stream stream;\\n\\n * stream.set_option(urdl::http::user_agent(\\\"Urdl\\\"));\\n\\n * stream.open(\\\"http://www.boost.org\\\");\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 13,\n \"score\": 100121.57918954385\n },\n {\n \"content\": \" * is.open(\\\"http://www.boost.org\\\");\\n\\n * @endcode\\n\\n *\\n\\n * To set the request method for an object of class @c urdl::read_stream:\\n\\n * @code\\n\\n * urdl::read_stream stream;\\n\\n * stream.set_option(urdl::http::request_method(\\\"HEAD\\\"));\\n\\n * stream.open(\\\"http://www.boost.org\\\");\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 14,\n \"score\": 100121.31297238504\n },\n {\n \"content\": \" * is.set_option(urdl::http::max_redirects(1));\\n\\n * is.open(\\\"http://www.boost.org\\\");\\n\\n * @endcode\\n\\n *\\n\\n * To set maximum number of redirects for an object of class\\n\\n * @c urdl::read_stream:\\n\\n * @code\\n\\n * urdl::read_stream stream;\\n\\n * stream.set_option(urdl::http::max_redirects(1));\\n\\n * stream.open(\\\"http://www.boost.org\\\");\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 16,\n \"score\": 100121.18574841897\n },\n {\n \"content\": \"/// Gets the error category for HTTP errors.\\n\\n/**\\n\\n * @returns The @c asio::error_category used for HTTP errors.\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\\nURDL_DECL const asio::error_category& error_category();\\n\\n\\n\\n/// Option to specify the HTTP request method.\\n\\n/**\\n\\n * @par Remarks\\n\\n * The default request method is \\\"GET\\\".\\n\\n *\\n\\n * @par Example\\n\\n * To set the request method for an object of class @c urdl::istream:\\n\\n * @code\\n\\n * urdl::istream is;\\n\\n * is.set_option(urdl::http::request_method(\\\"HEAD\\\"));\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 17,\n \"score\": 100120.71286715995\n },\n {\n \"content\": \" * is.set_option(urdl::http::request_content(\\\"Hello, world!\\\"));\\n\\n * is.set_option(urdl::http::request_content_type(\\\"text/plain\\\"));\\n\\n * is.open(\\\"http://host/path\\\");\\n\\n * @endcode\\n\\n *\\n\\n * To add content to the HTTP request using an object of class\\n\\n * @c urdl::read_stream:\\n\\n * @code\\n\\n * urdl::read_stream stream;\\n\\n * stream.set_option(urdl::http::request_method(\\\"POST\\\"));\\n\\n * stream.set_option(urdl::http::request_content(\\\"Hello, world!\\\"));\\n\\n * stream.set_option(urdl::http::request_content_type(\\\"text/plain\\\"));\\n\\n * stream.open(\\\"http://host/path\\\");\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 18,\n \"score\": 100120.31381267445\n },\n {\n \"content\": \" * is.set_option(urdl::http::request_content(\\\"Hello, world!\\\"));\\n\\n * is.set_option(urdl::http::request_content_type(\\\"text/plain\\\"));\\n\\n * is.open(\\\"http://host/path\\\");\\n\\n * @endcode\\n\\n *\\n\\n * To add content to the HTTP request using an object of class\\n\\n * @c urdl::read_stream:\\n\\n * @code\\n\\n * urdl::read_stream stream;\\n\\n * stream.set_option(urdl::http::request_method(\\\"POST\\\"));\\n\\n * stream.set_option(urdl::http::request_content(\\\"Hello, world!\\\"));\\n\\n * stream.set_option(urdl::http::request_content_type(\\\"text/plain\\\"));\\n\\n * stream.open(\\\"http://host/path\\\");\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 19,\n \"score\": 100120.31381267445\n },\n {\n \"content\": \"/// The class @c istream supports reading content from a specified URL.\\n\\n/**\\n\\n * @par Remarks\\n\\n * The class stores an object of class @c istreambuf.\\n\\n *\\n\\n * Currently supported URL protocols are @c http, @c https and @c file.\\n\\n *\\n\\n * @par Example\\n\\n * To read the entire content of a resource located by a URL into a string:\\n\\n * @code\\n\\n * urdl::istream is(\\\"http://www.boost.org/LICENSE_1_0.txt\\\");\\n\\n * if (is)\\n\\n * {\\n\\n * std::string content;\\n\\n * if (std::getline(is, content, std::char_traits<char>::eof()))\\n\\n * {\\n\\n * ...\\n\\n * }\\n\\n * }\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/istream.hpp> @n\\n\\n * @e Namespace: @c urdl\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 20,\n \"score\": 100119.41231750825\n },\n {\n \"content\": \" /// The server-generated status code \\\"502 Bad Gateway\\\".\\n\\n bad_gateway = 502,\\n\\n\\n\\n /// The server-generated status code \\\"503 Service Unavailable\\\".\\n\\n service_unavailable = 503,\\n\\n\\n\\n /// The server-generated status code \\\"504 Gateway Timeout\\\".\\n\\n gateway_timeout = 504,\\n\\n\\n\\n /// The server-generated status code \\\"505 HTTP Version Not Supported\\\".\\n\\n version_not_supported = 505\\n\\n};\\n\\n\\n\\n/// Converts a value of type @c errc_t to a corresponding object of type\\n\\n/// @c asio::error_code.\\n\\n/**\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/http.hpp> @n\\n\\n * @e Namespace: @c urdl::http\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 21,\n \"score\": 100118.92902620125\n },\n {\n \"content\": \"/**\\n\\n * @par Example\\n\\n * To extract the components of a URL:\\n\\n * @code\\n\\n * urdl::url url(\\\"http://user:pass@host:1234/dir/page?param=0#anchor\\\");\\n\\n * std::cout << \\\"Protocol: \\\" << url.protocol() << std::endl;\\n\\n * std::cout << \\\"User Info: \\\" << url.user_info() << std::endl;\\n\\n * std::cout << \\\"Host: \\\" << url.host() << std::endl;\\n\\n * std::cout << \\\"Port: \\\" << url.port() << std::endl;\\n\\n * std::cout << \\\"Path: \\\" << url.path() << std::endl;\\n\\n * std::cout << \\\"Query: \\\" << url.query() << std::endl;\\n\\n * std::cout << \\\"Fragment: \\\" << url.fragment() << std::endl;\\n\\n * @endcode\\n\\n * The above code will print:\\n\\n * @code\\n\\n * Protocol: http\\n\\n * User Info: user:pass\\n\\n * Host: host\\n\\n * Port: 1234\\n\\n * Path: /dir/page\\n\\n * Query: param=0\\n\\n * Fragment: anchor\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/url.hpp> @n\\n\\n * @e Namespace: @c urdl\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 23,\n \"score\": 100117.5894869525\n },\n {\n \"content\": \" */\\n\\n void value(std::size_t v)\\n\\n {\\n\\n value_ = v;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n std::size_t value_;\\n\\n};\\n\\n\\n\\n/// Option to specify the user agent identifier.\\n\\n/**\\n\\n * @par Remarks\\n\\n * The default is to not specify the user agent.\\n\\n *\\n\\n * @par Example\\n\\n * To set the user agent for an object of class @c urdl::istream:\\n\\n * @code\\n\\n * urdl::istream is;\\n\\n * is.set_option(urdl::http::user_agent(\\\"Urdl\\\"));\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 24,\n \"score\": 100117.19894709153\n },\n {\n \"content\": \" *\\n\\n * @param ec Error code set to indicate the reason for failure, if any.\\n\\n *\\n\\n * @returns A @c url object corresponding to the specified string.\\n\\n */\\n\\n URDL_DECL static url from_string(const std::string& s,\\n\\n asio::error_code& ec);\\n\\n\\n\\n /// Compares two @c url objects for equality.\\n\\n friend URDL_DECL bool operator==(const url& a, const url& b);\\n\\n\\n\\n /// Compares two @c url objects for inequality.\\n\\n friend URDL_DECL bool operator!=(const url& a, const url& b);\\n\\n\\n\\n /// Compares two @c url objects for ordering.\\n\\n friend URDL_DECL bool operator<(const url& a, const url& b);\\n\\n\\n\\nprivate:\\n\\n URDL_DECL static bool unescape_path(const std::string& in, std::string& out);\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 25,\n \"score\": 100116.73282815052\n },\n {\n \"content\": \" * urdl::url::host_component\\n\\n * | urdl::url::port_component);\\n\\n * @endcode\\n\\n */\\n\\n URDL_DECL std::string to_string(int components = all_components) const;\\n\\n\\n\\n /// Converts a string representation of a URL into an object of class @c url.\\n\\n /**\\n\\n * @param s URL string to be parsed into its components.\\n\\n *\\n\\n * @returns A @c url object corresponding to the specified string.\\n\\n *\\n\\n * @throws asio::system_error Thrown when the URL string is invalid.\\n\\n */\\n\\n URDL_DECL static url from_string(const char* s);\\n\\n\\n\\n /// Converts a string representation of a URL into an object of class @c url.\\n\\n /**\\n\\n * @param s URL string to be parsed into its components.\\n\\n *\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 26,\n \"score\": 100116.62739691888\n },\n {\n \"content\": \" */\\n\\n void value(const std::string& v)\\n\\n {\\n\\n value_ = v;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n std::string value_;\\n\\n};\\n\\n\\n\\n/// Option to specify content to accompany an HTTP request.\\n\\n/**\\n\\n * @par Remarks\\n\\n * The default is for no content to be sent.\\n\\n *\\n\\n * @par Example\\n\\n * To add content to the HTTP request using an object of class @c urdl::istream:\\n\\n * @code\\n\\n * urdl::istream is;\\n\\n * is.set_option(urdl::http::request_method(\\\"POST\\\"));\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 27,\n \"score\": 100116.61019140642\n },\n {\n \"content\": \" */\\n\\n void value(const std::string& v)\\n\\n {\\n\\n value_ = v;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n std::string value_;\\n\\n};\\n\\n\\n\\n/// Option to specify the type of the content that accompanies an HTTP request.\\n\\n/**\\n\\n * @par Remarks\\n\\n * The default is for no content type to be specified in the request.\\n\\n *\\n\\n * @par Example\\n\\n * To add content to the HTTP request using an object of class @c urdl::istream:\\n\\n * @code\\n\\n * urdl::istream is;\\n\\n * is.set_option(urdl::http::request_method(\\\"POST\\\"));\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 28,\n \"score\": 100116.57171098245\n },\n {\n \"content\": \" {\\n\\n rdbuf()->set_option(option);\\n\\n }\\n\\n\\n\\n /// Sets options to control the behaviour of the stream.\\n\\n /**\\n\\n * @param options The options to be set on the stream. The options in the set\\n\\n * are added on top of any options already set on the stream.\\n\\n *\\n\\n * @par Remarks\\n\\n * Performs @c rdbuf()->set_options(options).\\n\\n *\\n\\n * @par Example\\n\\n * @code\\n\\n * urdl::istream is;\\n\\n * urdl::option_set options;\\n\\n * options.set_option(urdl::http::max_redirects(1));\\n\\n * options.set_option(urdl::ssl::verify_peer(false));\\n\\n * stream.set_options(options);\\n\\n * @endcode\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 29,\n \"score\": 100116.5127088537\n },\n {\n \"content\": \" */\\n\\n void set_options(const option_set& options)\\n\\n {\\n\\n rdbuf()->set_options(options);\\n\\n }\\n\\n\\n\\n /// Gets the current value of an option that controls the behaviour of the\\n\\n /// stream.\\n\\n /**\\n\\n * @returns The current value of the option.\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->get_option<Option>(). Options are uniquely identified\\n\\n * by type.\\n\\n *\\n\\n * @par Example\\n\\n * @code\\n\\n * urdl::istream is;\\n\\n * urdl::http::max_redirects option\\n\\n * = is.get_option<urdl::http::max_redirects>();\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 30,\n \"score\": 100116.31462632296\n },\n {\n \"content\": \" * ...\\n\\n * urdl::option_set options(is.get_options());\\n\\n * urdl::http::max_redirects option\\n\\n * = options.get_option<urdl::http::max_redirects>();\\n\\n * std::size_t value = option.value();\\n\\n * @endcode\\n\\n */\\n\\n option_set get_options() const\\n\\n {\\n\\n return rdbuf()->get_options();\\n\\n }\\n\\n\\n\\n /// Determines whether the stream is open.\\n\\n /**\\n\\n * @returns @c true if the stream is open, @c false otherwise.\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->is_open().\\n\\n */\\n\\n bool is_open() const\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 31,\n \"score\": 100116.27956454825\n },\n {\n \"content\": \" */\\n\\n void value(const std::string& v)\\n\\n {\\n\\n value_ = v;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n std::string value_;\\n\\n};\\n\\n\\n\\n/// Option to specify the maximum number of allowed HTTP redirects.\\n\\n/**\\n\\n * @par Remarks\\n\\n * The default value is for there to be no limit on the number of allowed\\n\\n * redirects. Set the option to 0 to disable HTTP redirects.\\n\\n *\\n\\n * @par Example\\n\\n * To set maximum number of redirects for an object of class @c urdl::istream:\\n\\n * @code\\n\\n * urdl::istream is;\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 33,\n \"score\": 100115.72776826534\n },\n {\n \"content\": \" *\\n\\n * @par Remarks\\n\\n * Initializes the base class with @c std::basic_istream<char>(sb), where\\n\\n * @c sb is an object of class @c istreambuf stored within the class. It also\\n\\n * performs @c rdbuf()->set_options(options), then opens @c sb by performing\\n\\n * @c sb.open(u) and, if that fails (returns a null pointer), calls\\n\\n * @c setstate(failbit).\\n\\n *\\n\\n * @par Example\\n\\n * @code\\n\\n * urdl::option_set options;\\n\\n * options.set_option(urdl::http::max_redirects(1));\\n\\n * urdl::istream is(\\\"http://www.boost.org\\\", options);\\n\\n * @endcode\\n\\n */\\n\\n explicit istream(const url& u, const option_set& options)\\n\\n : std::basic_istream<char>(\\n\\n &this->base_from_member<istreambuf>::member)\\n\\n {\\n\\n rdbuf()->set_options(options);\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 34,\n \"score\": 100115.57015435984\n },\n {\n \"content\": \" if (rdbuf()->open(u) == 0)\\n\\n setstate(std::ios_base::failbit);\\n\\n }\\n\\n\\n\\n /// Sets an option to control the behaviour of the stream.\\n\\n /**\\n\\n * @param option The option to be set on the stream.\\n\\n *\\n\\n * @par Remarks\\n\\n * Performs @c rdbuf()->set_option(option). Options are uniquely identified by\\n\\n * type.\\n\\n *\\n\\n * @par Example\\n\\n * @code\\n\\n * urdl::istream is;\\n\\n * is.set_option(urdl::http::max_redirects(1));\\n\\n * @endcode\\n\\n */\\n\\n template <typename Option>\\n\\n void set_option(const Option& option)\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 35,\n \"score\": 100115.40128265912\n },\n {\n \"content\": \" &this->base_from_member<istreambuf>::member);\\n\\n }\\n\\n\\n\\n /// Gets the last error associated with the stream.\\n\\n /**\\n\\n * @returns An @c error_code corresponding to the last error from the stream.\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns a reference to an @c error_code object representing the last\\n\\n * failure reported by an @c istreambuf function. The set of possible\\n\\n * @c error_code values and categories depends on the protocol of the URL\\n\\n * used to open the stream.\\n\\n *\\n\\n * @par Example\\n\\n * To take action given a specific error:\\n\\n * @code\\n\\n * urdl::istream is(\\\"http://somesite/page\\\");\\n\\n * if (!is)\\n\\n * {\\n\\n * if (is.error() == urdl::http::errc::forbidden)\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 37,\n \"score\": 100115.04305936325\n },\n {\n \"content\": \" * @param ec Error code set to indicate the reason for failure, if any.\\n\\n *\\n\\n * @returns A @c url object corresponding to the specified string.\\n\\n */\\n\\n URDL_DECL static url from_string(const char* s,\\n\\n asio::error_code& ec);\\n\\n\\n\\n /// Converts a string representation of a URL into an object of class @c url.\\n\\n /**\\n\\n * @param s URL string to be parsed into its components.\\n\\n *\\n\\n * @returns A @c url object corresponding to the specified string.\\n\\n *\\n\\n * @throws asio::system_error Thrown when the URL string is invalid.\\n\\n */\\n\\n URDL_DECL static url from_string(const std::string& s);\\n\\n\\n\\n /// Converts a string representation of a URL into an object of class @c url.\\n\\n /**\\n\\n * @param s URL string to be parsed into its components.\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 39,\n \"score\": 100114.94489000126\n },\n {\n \"content\": \" /**\\n\\n * @returns A string containing the host name of the URL.\\n\\n */\\n\\n std::string host() const\\n\\n {\\n\\n return host_;\\n\\n }\\n\\n\\n\\n /// Gets the port component of the URL.\\n\\n /**\\n\\n * @returns The port number of the URL.\\n\\n *\\n\\n * @par Remarks\\n\\n * If the URL string did not specify a port, and the protocol is one of @c\\n\\n * http, @c https or @c ftp, an appropriate default port number is returned.\\n\\n */\\n\\n URDL_DECL unsigned short port() const;\\n\\n\\n\\n /// Gets the path component of the URL.\\n\\n /**\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 40,\n \"score\": 100114.06055687716\n },\n {\n \"content\": \" * std::size_t value = option.value();\\n\\n * @endcode\\n\\n */\\n\\n template <typename Option>\\n\\n Option get_option() const\\n\\n {\\n\\n return rdbuf()->get_option<Option>();\\n\\n }\\n\\n\\n\\n /// Gets the values of all options set on the stream.\\n\\n /**\\n\\n * @returns An option set containing all options from the stream.\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->get_options().\\n\\n *\\n\\n * @par Example\\n\\n * To get the options that have been set on the stream:\\n\\n * @code\\n\\n * urdl::istream is;\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 41,\n \"score\": 100114.06055687716\n },\n {\n \"content\": \" /**\\n\\n * @returns A string specifying the protocol of the URL. Examples include\\n\\n * @c http, @c https or @c file.\\n\\n */\\n\\n std::string protocol() const\\n\\n {\\n\\n return protocol_;\\n\\n }\\n\\n\\n\\n /// Gets the user info component of the URL.\\n\\n /**\\n\\n * @returns A string containing the user info of the URL. Typically in the\\n\\n * format <tt>user:password</tt>, but depends on the protocol.\\n\\n */\\n\\n std::string user_info() const\\n\\n {\\n\\n return user_info_;\\n\\n }\\n\\n\\n\\n /// Gets the host component of the URL.\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 42,\n \"score\": 100114.03653521104\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Gets the MIME type of the content obtained from the URL.\\n\\n /**\\n\\n * @returns A string specifying the MIME type. Examples of possible return\\n\\n * values include @c text/plain, @c text/html and @c image/png.\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->content_type().\\n\\n *\\n\\n * Not all URL protocols support a content type. For these protocols, this\\n\\n * function returns an empty string.\\n\\n */\\n\\n std::string content_type() const\\n\\n {\\n\\n return rdbuf()->content_type();\\n\\n }\\n\\n\\n\\n /// Gets the length of the content obtained from the URL.\\n\\n /**\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 43,\n \"score\": 100113.9130684231\n },\n {\n \"content\": \" * @returns A string containing the path of the URL.\\n\\n *\\n\\n * @par Remarks\\n\\n * The path string is unescaped. To obtain the path in escaped form, use\\n\\n * @c to_string(url::path_component).\\n\\n */\\n\\n URDL_DECL std::string path() const;\\n\\n\\n\\n /// Gets the query component of the URL.\\n\\n /**\\n\\n * @returns A string containing the query string of the URL.\\n\\n *\\n\\n * @par Remarks\\n\\n * The query string is not unescaped, but is returned in whatever form it\\n\\n * takes in the original URL string.\\n\\n */\\n\\n std::string query() const\\n\\n {\\n\\n return query_;\\n\\n }\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 44,\n \"score\": 100113.85778298254\n },\n {\n \"content\": \" all_components = protocol_component | user_info_component | host_component\\n\\n | port_component | path_component | query_component | fragment_component\\n\\n };\\n\\n\\n\\n /// Converts an object of class @c url to a string representation.\\n\\n /**\\n\\n * @param components A bitmask specifying which components of the URL should\\n\\n * be included in the string. See the @c url::components_type enumeration for\\n\\n * possible values.\\n\\n *\\n\\n * @returns A string representation of the URL.\\n\\n *\\n\\n * @par Examples\\n\\n * To convert the entire URL to a string:\\n\\n * @code\\n\\n * std::string s = url.to_string();\\n\\n * @endcode\\n\\n * To convert only the host and port number into a string:\\n\\n * @code\\n\\n * std::string s = url.to_string(\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 47,\n \"score\": 100113.36727595459\n },\n {\n \"content\": \" * @returns The length, in bytes, of the content. If the content associated\\n\\n * with the URL does not specify a length,\\n\\n * @c std::numeric_limits<std::size_t>::max().\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->content_length().\\n\\n */\\n\\n std::size_t content_length() const\\n\\n {\\n\\n return rdbuf()->content_length();\\n\\n }\\n\\n\\n\\n /// Gets the protocol-specific headers obtained from the URL.\\n\\n /**\\n\\n * @returns A string containing the headers returned with the content from the\\n\\n * URL. The format and interpretation of these headers is specific to the\\n\\n * protocol associated with the URL.\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->headers().\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 48,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" *\\n\\n * @par Remarks\\n\\n * Initializes the base class with @c std::basic_istream<char>(sb),\\n\\n * where @c sb is an object of class @c istreambuf stored within the class. It\\n\\n * also opens @c sb by performing @c sb.open(u) and, if that fails (returns a\\n\\n * null pointer), calls @c setstate(failbit).\\n\\n */\\n\\n explicit istream(const url& u)\\n\\n : std::basic_istream<char>(\\n\\n &this->base_from_member<istreambuf>::member)\\n\\n {\\n\\n if (rdbuf()->open(u) == 0)\\n\\n setstate(std::ios_base::failbit);\\n\\n }\\n\\n\\n\\n /// Constructs an object of class @c istream.\\n\\n /**\\n\\n * @param u The URL to open.\\n\\n *\\n\\n * @param options The options to be set on the stream.\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 49,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \"\\n\\n /// The server-generated status code \\\"407 Proxy Authentication Required\\\".\\n\\n proxy_authentication_required = 407,\\n\\n\\n\\n /// The server-generated status code \\\"408 Request Time-out\\\".\\n\\n request_timeout = 408,\\n\\n\\n\\n /// The server-generated status code \\\"409 Conflict\\\".\\n\\n conflict = 409,\\n\\n\\n\\n /// The server-generated status code \\\"410 Gone\\\".\\n\\n gone = 410,\\n\\n\\n\\n /// The server-generated status code \\\"411 Length Required\\\".\\n\\n length_required = 411,\\n\\n\\n\\n /// The server-generated status code \\\"412 Precondition Failed\\\".\\n\\n precondition_failed = 412,\\n\\n\\n\\n /// The server-generated status code \\\"413 Request Entity Too Large\\\".\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 50,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" request_entity_too_large = 413,\\n\\n\\n\\n /// The server-generated status code \\\"414 Request URI Too Large\\\".\\n\\n request_uri_too_large = 414,\\n\\n\\n\\n /// The server-generated status code \\\"415 Unsupported Media Type\\\".\\n\\n unsupported_media_type = 415,\\n\\n\\n\\n /// The server-generated status code \\\"416 Requested Range Not Satisfiable\\\".\\n\\n requested_range_not_satisfiable = 416,\\n\\n\\n\\n /// The server-generated status code \\\"417 Expectation Failed\\\".\\n\\n expectation_failed = 417,\\n\\n\\n\\n /// The server-generated status code \\\"500 Internal Server Error\\\".\\n\\n internal_server_error = 500,\\n\\n\\n\\n /// The server-generated status code \\\"501 Not Implemented\\\".\\n\\n not_implemented = 501,\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 51,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" */\\n\\n url(const char* s)\\n\\n : ipv6_host_(false)\\n\\n {\\n\\n *this = from_string(s);\\n\\n }\\n\\n\\n\\n /// Constructs an object of class @c url.\\n\\n /**\\n\\n * @param s URL string to be parsed into its components.\\n\\n *\\n\\n * @throws asio::system_error Thrown when the URL string is invalid.\\n\\n */\\n\\n url(const std::string& s)\\n\\n : ipv6_host_(false)\\n\\n {\\n\\n *this = from_string(s);\\n\\n }\\n\\n\\n\\n /// Gets the protocol component of the URL.\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 52,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" {\\n\\n return rdbuf()->is_open();\\n\\n }\\n\\n\\n\\n /// Opens the specified URL.\\n\\n /**\\n\\n * @param u The URL to open.\\n\\n *\\n\\n * @par Remarks\\n\\n * Calls @c rdbuf()->open(u). If that function does not return a null\\n\\n * pointer, calls @c clear(). Otherwise calls @c setstate(failbit) (which may\\n\\n * throw @c ios_base::failure).\\n\\n */\\n\\n void open(const url& u)\\n\\n {\\n\\n if (rdbuf()->open(u) == 0)\\n\\n setstate(std::ios_base::failbit);\\n\\n else\\n\\n clear();\\n\\n }\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 53,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->read_timeout().\\n\\n */\\n\\n std::size_t read_timeout() const\\n\\n {\\n\\n return rdbuf()->read_timeout();\\n\\n }\\n\\n\\n\\n /// Sets the read timeout of the stream.\\n\\n /**\\n\\n * @param milliseconds The timeout, in milliseconds, to be used for individual\\n\\n * read operations on the underlying transport.\\n\\n *\\n\\n * @par Remarks\\n\\n * Performs @c rdbuf()->read_timeout(milliseconds).\\n\\n */\\n\\n void read_timeout(std::size_t milliseconds)\\n\\n {\\n\\n rdbuf()->read_timeout(milliseconds);\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 54,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" explicit request_content_type(const std::string& v)\\n\\n : value_(v)\\n\\n {\\n\\n }\\n\\n\\n\\n /// Gets the value of the option.\\n\\n /**\\n\\n * @returns The value of the option.\\n\\n */\\n\\n std::string value() const\\n\\n {\\n\\n return value_;\\n\\n }\\n\\n\\n\\n /// Sets the value of the option.\\n\\n /**\\n\\n * @param v The desired value for the option.\\n\\n *\\n\\n * @par Remarks\\n\\n * Postcondition: <tt>value() == v</tt>\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 55,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" explicit request_content(const std::string& v)\\n\\n : value_(v)\\n\\n {\\n\\n }\\n\\n\\n\\n /// Gets the value of the option.\\n\\n /**\\n\\n * @returns The value of the option.\\n\\n */\\n\\n std::string value() const\\n\\n {\\n\\n return value_;\\n\\n }\\n\\n\\n\\n /// Sets the value of the option.\\n\\n /**\\n\\n * @param v The desired value for the option.\\n\\n *\\n\\n * @par Remarks\\n\\n * Postcondition: <tt>value() == v</tt>\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 56,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" return rdbuf()->open_timeout();\\n\\n }\\n\\n\\n\\n /// Sets the open timeout of the stream.\\n\\n /**\\n\\n * @param milliseconds The timeout, in milliseconds, to be used when opening\\n\\n * a URL.\\n\\n *\\n\\n * @par Remarks\\n\\n * Performs @c rdbuf()->open_timeout(milliseconds).\\n\\n */\\n\\n void open_timeout(std::size_t milliseconds)\\n\\n {\\n\\n rdbuf()->open_timeout(milliseconds);\\n\\n }\\n\\n\\n\\n /// Gets the read timeout of the stream.\\n\\n /**\\n\\n * @returns The timeout, in milliseconds, used for individual read operations\\n\\n * on the underlying transport.\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 57,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \"\\n\\n /// Gets the fragment component of the URL.\\n\\n /**\\n\\n * @returns A string containing the fragment of the URL.\\n\\n */\\n\\n std::string fragment() const\\n\\n {\\n\\n return fragment_;\\n\\n }\\n\\n\\n\\n /// Components of the URL, used with @c from_string.\\n\\n enum components_type\\n\\n {\\n\\n protocol_component = 1,\\n\\n user_info_component = 2,\\n\\n host_component = 4,\\n\\n port_component = 8,\\n\\n path_component = 16,\\n\\n query_component = 32,\\n\\n fragment_component = 64,\\n\",\n \"file_path\": \"include/external/urdl/url.hpp\",\n \"rank\": 58,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" multiple_choices = 300,\\n\\n\\n\\n /// The server-generated status code \\\"301 Moved Permanently\\\".\\n\\n moved_permanently = 301,\\n\\n\\n\\n /// The server-generated status code \\\"302 Found\\\".\\n\\n found = 302,\\n\\n\\n\\n /// The server-generated status code \\\"303 See Other\\\".\\n\\n see_other = 303,\\n\\n\\n\\n /// The server-generated status code \\\"304 Not Modified\\\".\\n\\n not_modified = 304,\\n\\n\\n\\n /// The server-generated status code \\\"305 Use Proxy\\\".\\n\\n use_proxy = 305,\\n\\n\\n\\n /// The server-generated status code \\\"307 Temporary Redirect\\\".\\n\\n temporary_redirect = 307,\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 59,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" /// The server-generated status code \\\"400 Bad Request\\\".\\n\\n bad_request = 400,\\n\\n\\n\\n /// The server-generated status code \\\"401 Unauthorized\\\".\\n\\n unauthorized = 401,\\n\\n\\n\\n /// The server-generated status code \\\"402 Payment Required\\\".\\n\\n payment_required = 402,\\n\\n\\n\\n /// The server-generated status code \\\"403 Forbidden\\\".\\n\\n forbidden = 403,\\n\\n\\n\\n /// The server-generated status code \\\"404 Not Found\\\".\\n\\n not_found = 404,\\n\\n\\n\\n /// The server-generated status code \\\"405 Method Not Allowed\\\".\\n\\n method_not_allowed = 405,\\n\\n\\n\\n /// The server-generated status code \\\"406 Not Acceptable\\\".\\n\\n not_acceptable = 406,\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 60,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \"\\n\\n /// Closes the stream.\\n\\n /**\\n\\n * @par Remarks\\n\\n * Calls @c rdbuf()->close() and, if that function returns a null\\n\\n * pointer, calls @c setstate(failbit) (which may throw @c ios_base::failure).\\n\\n */\\n\\n void close()\\n\\n {\\n\\n if (rdbuf()->close() == 0)\\n\\n setstate(std::ios_base::failbit);\\n\\n }\\n\\n\\n\\n /// Gets the underlying stream buffer.\\n\\n /**\\n\\n * @returns A pointer to the stream buffer contained within the class.\\n\\n */\\n\\n istreambuf* rdbuf() const\\n\\n {\\n\\n return const_cast<istreambuf*>(\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 61,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" explicit max_redirects(std::size_t v)\\n\\n : value_(v)\\n\\n {\\n\\n }\\n\\n\\n\\n /// Gets the value of the option.\\n\\n /**\\n\\n * @returns The value of the option.\\n\\n */\\n\\n std::size_t value() const\\n\\n {\\n\\n return value_;\\n\\n }\\n\\n\\n\\n /// Sets the value of the option.\\n\\n /**\\n\\n * @param v The desired value for the option.\\n\\n *\\n\\n * @par Remarks\\n\\n * Postcondition: <tt>value() == v</tt>\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 62,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \"\\n\\n /// The server-generated status code \\\"201 Created\\\".\\n\\n created = 201,\\n\\n\\n\\n /// The server-generated status code \\\"202 Accepted\\\".\\n\\n accepted = 202,\\n\\n\\n\\n /// The server-generated status code \\\"203 Non-Authoritative Information\\\".\\n\\n non_authoritative_information = 203,\\n\\n\\n\\n /// The server-generated status code \\\"204 No Content\\\".\\n\\n no_content = 204,\\n\\n\\n\\n /// The server-generated status code \\\"205 Reset Content\\\".\\n\\n reset_content = 205,\\n\\n\\n\\n /// The server-generated status code \\\"206 Partial Content\\\".\\n\\n partial_content = 206,\\n\\n\\n\\n /// The server-generated status code \\\"300 Multiple Choices\\\".\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 63,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" * {\\n\\n * std::cout << \\\"Computer says no\\\" << std::endl;\\n\\n * }\\n\\n * }\\n\\n * @endcode\\n\\n */\\n\\n const asio::error_code& error() const\\n\\n {\\n\\n return rdbuf()->puberror();\\n\\n }\\n\\n\\n\\n /// Gets the open timeout of the stream.\\n\\n /**\\n\\n * @returns The timeout, in milliseconds, used when opening a URL.\\n\\n *\\n\\n * @par Remarks\\n\\n * Returns @c rdbuf()->open_timeout().\\n\\n */\\n\\n std::size_t open_timeout() const\\n\\n {\\n\",\n \"file_path\": \"include/external/urdl/istream.hpp\",\n \"rank\": 64,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" explicit request_method(const std::string& v)\\n\\n : value_(v)\\n\\n {\\n\\n }\\n\\n\\n\\n /// Gets the value of the option.\\n\\n /**\\n\\n * @returns The value of the option.\\n\\n */\\n\\n std::string value() const\\n\\n {\\n\\n return value_;\\n\\n }\\n\\n\\n\\n /// Sets the value of the option.\\n\\n /**\\n\\n * @param v The desired value for the option.\\n\\n *\\n\\n * @par Remarks\\n\\n * Postcondition: <tt>value() == v</tt>\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 65,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" explicit user_agent(const std::string& v)\\n\\n : value_(v)\\n\\n {\\n\\n }\\n\\n\\n\\n /// Gets the value of the option.\\n\\n /**\\n\\n * @returns The value of the option.\\n\\n */\\n\\n std::string value() const\\n\\n {\\n\\n return value_;\\n\\n }\\n\\n\\n\\n /// Sets the value of the option.\\n\\n /**\\n\\n * @param v The desired value for the option.\\n\\n *\\n\\n * @par Remarks\\n\\n * Postcondition: <tt>value() == v</tt>\\n\",\n \"file_path\": \"include/external/urdl/http.hpp\",\n \"rank\": 66,\n \"score\": 100110.12604997592\n },\n {\n \"content\": \" break;\\n\\n case final_linefeed:\\n\\n return (c == '\\\\n');\\n\\n default:\\n\\n return false;\\n\\n }\\n\\n }\\n\\n return false;\\n\\n}\\n\\n\\n\\n} // namespace detail\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"abi_suffix.hpp\\\"\\n\\n\\n\\n#endif // URDL_DETAIL_PARSERS_HPP\\n\",\n \"file_path\": \"include/external/urdl/detail/parsers.hpp\",\n \"rank\": 67,\n \"score\": 96784.9399272547\n },\n {\n \"content\": \"//\\n\\n// connect.hpp\\n\\n// ~~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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 URDL_DETAIL_CONNECT_HPP\\n\\n#define URDL_DETAIL_CONNECT_HPP\\n\\n\\n\\n#include <sstream>\\n\\n#include \\\"coroutine.hpp\\\"\\n\\n#include \\\"abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\nnamespace detail {\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/detail/connect.hpp\",\n \"rank\": 68,\n \"score\": 96783.88442024332\n },\n {\n \"content\": \" } while (0)\\n\\n\\n\\n#if defined(_MSC_VER)\\n\\n# define URDL_CORO_YIELD(s) URDL_CORO_YIELD_IMPL(s, __COUNTER__ + 1)\\n\\n#else // defined(_MSC_VER)\\n\\n# define URDL_CORO_YIELD(s) URDL_CORO_YIELD_IMPL(s, __LINE__)\\n\\n#endif // defined(_MSC_VER)\\n\\n\\n\\n#define URDL_CORO_END \\\\\\n\\n }\\n\\n\\n\\n} // namespace detail\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"abi_suffix.hpp\\\"\\n\\n\\n\\n#endif // URDL_DETAIL_COROUTINE_HPP\\n\",\n \"file_path\": \"include/external/urdl/detail/coroutine.hpp\",\n \"rank\": 69,\n \"score\": 96783.504560291\n },\n {\n \"content\": \"//\\n\\n// parsers.hpp\\n\\n// ~~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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 URDL_DETAIL_PARSERS_HPP\\n\\n#define URDL_DETAIL_PARSERS_HPP\\n\\n\\n\\n#include <algorithm>\\n\\n#include <cctype>\\n\\n#include <cstdlib>\\n\\n#include <string>\\n\\n#include \\\"abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\",\n \"file_path\": \"include/external/urdl/detail/parsers.hpp\",\n \"rank\": 70,\n \"score\": 96783.16854402907\n },\n {\n \"content\": \"//\\n\\n// coroutine.hpp\\n\\n// ~~~~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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 URDL_DETAIL_COROUTINE_HPP\\n\\n#define URDL_DETAIL_COROUTINE_HPP\\n\\n\\n\\n#include \\\"abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\nnamespace detail {\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/detail/coroutine.hpp\",\n \"rank\": 71,\n \"score\": 96781.99212186292\n },\n {\n \"content\": \" URDL_DECL void set_option_wrapper_base(option_wrapper_base* o);\\n\\n URDL_DECL option_wrapper_base* get_option_wrapper_base(\\n\\n const std::type_info& ti) const;\\n\\n URDL_DECL void clear_option_wrapper_base(const std::type_info& ti);\\n\\n\\n\\n std::unique_ptr<option_wrapper_base> head_;\\n\\n};\\n\\n\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"detail/abi_suffix.hpp\\\"\\n\\n\\n\\n#if defined(URDL_HEADER_ONLY)\\n\\n# include \\\"impl/option_set.ipp\\\"\\n\\n#endif\\n\\n\\n\\n#endif // URDL_OPTION_SET_HPP\\n\",\n \"file_path\": \"include/external/urdl/option_set.hpp\",\n \"rank\": 72,\n \"score\": 96781.85301884999\n },\n {\n \"content\": \"//\\n\\n// option_set.hpp\\n\\n// ~~~~~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\n\\n//\\n\\n// Distributed under the Boost Software License, Version 1.0. (See accompanying\\n\\n// path LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\\n\\n//\\n\\n\\n\\n#ifndef URDL_OPTION_SET_HPP\\n\\n#define URDL_OPTION_SET_HPP\\n\\n\\n\\n#include <typeinfo>\\n\\n#include \\\"detail/config.hpp\\\"\\n\\n#include \\\"detail/abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\n\\n\\n/// The class @c option_set maintains a collection of options.\\n\",\n \"file_path\": \"include/external/urdl/option_set.hpp\",\n \"rank\": 73,\n \"score\": 96781.713394977\n },\n {\n \"content\": \" std::string host_;\\n\\n};\\n\\n\\n\\ntemplate <typename Handler>\\n\\nvoid async_handshake(\\n\\n asio::ssl::stream<asio::ip::tcp::socket>& socket,\\n\\n const std::string& host, Handler handler)\\n\\n{\\n\\n handshake_coro<Handler>(handler, socket, host)(asio::error_code());\\n\\n}\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n\\n\\n} // namespace detail\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"abi_suffix.hpp\\\"\\n\\n\\n\\n#endif // URDL_DETAIL_HANDSHAKE_HPP\\n\",\n \"file_path\": \"include/external/urdl/detail/handshake.hpp\",\n \"rank\": 74,\n \"score\": 96781.65247318485\n },\n {\n \"content\": \"#endif // !defined(URDL_DISABLE_SSL)\\n\\n\\n\\n#include \\\"abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\nnamespace detail {\\n\\n\\n\\ninline asio::error_code handshake(\\n\\n asio::ip::tcp::socket& /*socket*/,\\n\\n const std::string& /*host*/, asio::error_code& ec)\\n\\n{\\n\\n ec = asio::error_code();\\n\\n return ec;\\n\\n}\\n\\n\\n\\ntemplate <typename Handler>\\n\\nvoid async_handshake(asio::ip::tcp::socket& socket,\\n\\n const std::string& /*host*/, Handler handler)\\n\\n{\\n\\n asio::error_code ec;\\n\",\n \"file_path\": \"include/external/urdl/detail/handshake.hpp\",\n \"rank\": 75,\n \"score\": 96780.0187009886\n },\n {\n \"content\": \"#if !defined(URDL_DISABLE_SSL)\\n\\n# include \\\"asio/ssl.hpp\\\"\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n\\n\\n#include \\\"detail/abi_prefix.hpp\\\"\\n\\n\\n\\nnamespace urdl {\\n\\n\\n\\n/// The class @c read_stream supports reading content from a specified URL\\n\\n/// using synchronous or asynchronous operations.\\n\\n/**\\n\\n * @par Remarks\\n\\n * Currently supported URL protocols are @c http, @c https and @c file.\\n\\n *\\n\\n * The class @c read_stream meets the type requirements for @c SyncReadStream\\n\\n * and @c AsyncReadStream, as defined in the Boost.Asio documentation. This\\n\\n * allows objects of class @c read_stream to be used with the functions\\n\\n * @c asio::read, @c asio::async_read, @c asio::read_until\\n\\n * and @c asio::async_read_until.\\n\\n *\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 76,\n \"score\": 96779.65115261203\n },\n {\n \"content\": \"//\\n\\n// handshake.hpp\\n\\n// ~~~~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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 URDL_DETAIL_HANDSHAKE_HPP\\n\\n#define URDL_DETAIL_HANDSHAKE_HPP\\n\\n\\n\\n#include <cstring>\\n\\n#include <cctype>\\n\\n#include \\\"coroutine.hpp\\\"\\n\\n\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n# include \\\"asio/ssl.hpp\\\"\\n\\n# include <openssl/x509v3.h>\\n\",\n \"file_path\": \"include/external/urdl/detail/handshake.hpp\",\n \"rank\": 77,\n \"score\": 96779.36234986945\n },\n {\n \"content\": \"template <typename Handler>\\n\\nvoid async_connect(asio::ip::tcp::socket::lowest_layer_type& socket,\\n\\n asio::ip::tcp::resolver& resolver, const url& u, Handler handler)\\n\\n{\\n\\n std::ostringstream port_string;\\n\\n port_string << u.port();\\n\\n asio::ip::tcp::resolver::query query(u.host(), port_string.str());\\n\\n connect_coro<Handler>(handler, socket, resolver)(\\n\\n asio::error_code(), &query);\\n\\n}\\n\\n\\n\\n} // namespace detail\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"abi_suffix.hpp\\\"\\n\\n\\n\\n#endif // URDL_DETAIL_CONNECT_HPP\\n\",\n \"file_path\": \"include/external/urdl/detail/connect.hpp\",\n \"rank\": 78,\n \"score\": 96779.34106985916\n },\n {\n \"content\": \"\\n\\n asio::io_context& io_context_;\\n\\n option_set options_;\\n\\n detail::file_read_stream file_;\\n\\n detail::http_read_stream<asio::ip::tcp::socket> http_;\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n asio::ssl::context ssl_context_;\\n\\n detail::http_read_stream<\\n\\n asio::ssl::stream<\\n\\n asio::ip::tcp::socket> > https_;\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n enum { unknown, file, http, https } protocol_;\\n\\n};\\n\\n\\n\\n} // namespace urdl\\n\\n\\n\\n#include \\\"detail/abi_suffix.hpp\\\"\\n\\n\\n\\n#endif // URDL_READ_STREAM_HPP\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 79,\n \"score\": 96779.14220960785\n },\n {\n \"content\": \"//\\n\\n// read_stream.hpp\\n\\n// ~~~~~~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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 URDL_READ_STREAM_HPP\\n\\n#define URDL_READ_STREAM_HPP\\n\\n\\n\\n#include \\\"http.hpp\\\"\\n\\n#include \\\"option_set.hpp\\\"\\n\\n#include \\\"url.hpp\\\"\\n\\n#include \\\"detail/coroutine.hpp\\\"\\n\\n#include \\\"detail/file_read_stream.hpp\\\"\\n\\n#include \\\"detail/http_read_stream.hpp\\\"\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 80,\n \"score\": 96778.26004621026\n },\n {\n \"content\": \"/**\\n\\n * @par Remarks\\n\\n * Options are uniquely identified by type, so the @c option_set class is a\\n\\n * collection of objects of differing types, indexed by type.\\n\\n *\\n\\n * The option types stored in the set must meet the type requirements for\\n\\n * CopyConstructible.\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/option_set.hpp> @n\\n\\n * @e Namespace: @c urdl\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/option_set.hpp\",\n \"rank\": 81,\n \"score\": 96777.37099404875\n },\n {\n \"content\": \"//\\n\\n// config.hpp\\n\\n// ~~~~~~~~~~\\n\\n//\\n\\n// Copyright (c) 2009-2013 Christopher M. Kohlhoff (chris at kohlhoff dot com)\\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// No include guard.\\n\\n\\n\\n#if defined(URDL_HEADER_ONLY)\\n\\n# define URDL_DECL inline\\n\\n#else // defined(URDL_HEADER_ONLY)\\n\\n# if defined(BOOST_HAS_DECLSPEC)\\n\\n// We need to import/export our code only if the user has specifically asked\\n\\n// for it by defining either BOOST_ALL_DYN_LINK if they want all boost\\n\\n// libraries to be dynamically linked (and if boost is dynamically linked, urdl\\n\\n// must be dynamically linked too), or URDL_DYN_LINK if they want just urdl to\\n\",\n \"file_path\": \"include/external/urdl/detail/config.hpp\",\n \"rank\": 82,\n \"score\": 96776.39717451607\n },\n {\n \"content\": \" * read_stream.async_read_some(asio::buffer(data), read_handler);\\n\\n * }\\n\\n * }\\n\\n * ...\\n\\n * void read_handler(const asio::error_code& ec, std::size_t length)\\n\\n * {\\n\\n * if (!ec)\\n\\n * {\\n\\n * std::cout.write(data, length);\\n\\n * read_stream.async_read_some(asio::buffer(data), read_handler);\\n\\n * }\\n\\n * }\\n\\n * @endcode\\n\\n *\\n\\n * @par Requirements\\n\\n * @e Header: @c <urdl/read_stream.hpp> @n\\n\\n * @e Namespace: @c urdl\\n\\n */\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 83,\n \"score\": 96775.76259854477\n },\n {\n \"content\": \" case http:\\n\\n return http_.close(ec);\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n case https:\\n\\n return https_.close(ec);\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n default:\\n\\n ec = asio::error_code();\\n\\n break;\\n\\n }\\n\\n\\n\\n return ec;\\n\\n }\\n\\n\\n\\n /// Gets the MIME type of the content obtained from the URL.\\n\\n /**\\n\\n * @returns A string specifying the MIME type. Examples of possible return\\n\\n * values include @c text/plain, @c text/html and @c image/png.\\n\\n *\\n\\n * @par Remarks\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 84,\n \"score\": 96775.67717618815\n },\n {\n \"content\": \"// be dynamically liked.\\n\\n# if defined(BOOST_ALL_DYN_LINK) || defined(URDL_DYN_LINK)\\n\\n# if !defined(URDL_DYN_LINK)\\n\\n# define URDL_DYN_LINK\\n\\n# endif // !defined(URDL_DYN_LINK)\\n\\n// Export if this is our own source, otherwise import.\\n\\n# if defined(URDL_SOURCE)\\n\\n# define URDL_DECL __declspec(dllexport)\\n\\n# else // defined(URDL_SOURCE)\\n\\n# define URDL_DECL __declspec(dllimport)\\n\\n# endif // defined(URDL_SOURCE)\\n\\n# endif // defined(BOOST_ALL_DYN_LINK) || defined(URDL_DYN_LINK)\\n\\n# endif // defined(BOOST_HAS_DECLSPEC)\\n\\n#endif // defined(URDL_HEADER_ONLY)\\n\\n\\n\\n// If URDL_DECL isn't defined yet define it now.\\n\\n#if !defined(URDL_DECL)\\n\\n# define URDL_DECL\\n\\n#endif // !defined(URDL_DECL)\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/detail/config.hpp\",\n \"rank\": 85,\n \"score\": 96774.61659540875\n },\n {\n \"content\": \"# else\\n\\n# define URDL_LIB_PREFIX \\\"lib\\\"\\n\\n# endif\\n\\n\\n\\n# if defined(_DEBUG)\\n\\n# if defined(_DLL)\\n\\n# define URDL_LIB_SUFFIX \\\"-gd\\\"\\n\\n# else\\n\\n# define URDL_LIB_SUFFIX \\\"-sgd\\\"\\n\\n# endif\\n\\n# else\\n\\n# if defined(_DLL)\\n\\n# define URDL_LIB_SUFFIX\\n\\n# else\\n\\n# define URDL_LIB_SUFFIX \\\"-s\\\"\\n\\n# endif\\n\\n# endif\\n\\n\\n\\n# pragma comment(lib, URDL_LIB_PREFIX \\\"urdl\\\" URDL_LIB_SUFFIX \\\".lib\\\")\\n\\n\\n\\n#endif // !defined(BOOST_ALL_NO_LIB) && !defined(URDL_NO_LIB)\\n\\n // && !defined(URDL_SOURCE) && !defined(URDL_HEADER_ONLY)\\n\\n // && defined(_MSC_VER)\\n\",\n \"file_path\": \"include/external/urdl/detail/config.hpp\",\n \"rank\": 86,\n \"score\": 96774.56595423556\n },\n {\n \"content\": \"#if (BOOST_VERSION >= 105400)\\n\\n# define URDL_INITFN_RESULT_TYPE(h, sig) BOOST_ASIO_INITFN_RESULT_TYPE(h, sig)\\n\\n#else // (BOOST_VERSION >= 105400)\\n\\n# define URDL_INITFN_RESULT_TYPE(h, sig) void\\n\\n#endif // (BOOST_VERSION >= 105400)\\n\\n\\n\\n// Enable library autolinking for MSVC.\\n\\n\\n\\n#if !defined(BOOST_ALL_NO_LIB) && !defined(URDL_NO_LIB) \\\\\\n\\n && !defined(URDL_SOURCE) && !defined(URDL_HEADER_ONLY) \\\\\\n\\n && defined(_MSC_VER)\\n\\n\\n\\n# if !defined(_MT)\\n\\n# error \\\"You must use the multithreaded runtime.\\\"\\n\\n# endif\\n\\n\\n\\n# if (defined(_DLL) || defined(_RTLDLL)) && defined(URDL_DYN_LINK)\\n\\n# define URDL_LIB_PREFIX\\n\\n# elif defined(URDL_DYN_LINK)\\n\\n# error \\\"Mixing a dll library with a static runtime is unsupported.\\\"\\n\",\n \"file_path\": \"include/external/urdl/detail/config.hpp\",\n \"rank\": 87,\n \"score\": 96773.80411141897\n },\n {\n \"content\": \" * urdl::read_stream stream(io_context);\\n\\n * ...\\n\\n * urdl::option_set options(stream.get_options());\\n\\n * urdl::http::max_redirects option\\n\\n * = options.get_option<urdl::http::max_redirects>();\\n\\n * std::size_t value = option.value();\\n\\n * @endcode\\n\\n */\\n\\n option_set get_options() const\\n\\n {\\n\\n return options_;\\n\\n }\\n\\n\\n\\n /// Determines whether the stream is open.\\n\\n /**\\n\\n * @returns @c true if the stream is open, @c false otherwise.\\n\\n */\\n\\n bool is_open() const\\n\\n {\\n\\n switch (protocol_)\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 88,\n \"score\": 96773.22699774466\n },\n {\n \"content\": \" * urdl::read_stream stream(io_context);\\n\\n * urdl::option_set options;\\n\\n * options.set_option(urdl::http::max_redirects(1));\\n\\n * options.set_option(urdl::ssl::verify_peer(false));\\n\\n * stream.set_options(options);\\n\\n * @endcode\\n\\n */\\n\\n void set_options(const option_set& options)\\n\\n {\\n\\n options_.set_options(options);\\n\\n }\\n\\n\\n\\n /// Gets the current value of an option that controls the behaviour of the\\n\\n /// stream.\\n\\n /**\\n\\n * @returns The current value of the option.\\n\\n *\\n\\n * @par Remarks\\n\\n * Options are uniquely identified by type.\\n\\n *\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 89,\n \"score\": 96773.04865585399\n },\n {\n \"content\": \" urdl::http::max_redirects>().value();\\n\\n if (redirects < max_redirects)\\n\\n {\\n\\n ++redirects;\\n\\n tmp_url = https_.location();\\n\\n https_.close(ec);\\n\\n continue;\\n\\n }\\n\\n }\\n\\n return ec;\\n\\n }\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n else\\n\\n {\\n\\n ec = asio::error::operation_not_supported;\\n\\n return ec;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 90,\n \"score\": 96772.69912517791\n },\n {\n \"content\": \" * @par Example\\n\\n * @code\\n\\n * urdl::read_stream stream(io_context);\\n\\n * urdl::http::max_redirects option\\n\\n * = stream.get_option<urdl::http::max_redirects>();\\n\\n * std::size_t value = option.value();\\n\\n * @endcode\\n\\n */\\n\\n template <typename Option>\\n\\n Option get_option() const\\n\\n {\\n\\n return options_.get_option<Option>();\\n\\n }\\n\\n\\n\\n /// Gets the values of all options set on the stream.\\n\\n /**\\n\\n * @returns An option set containing all options from the stream.\\n\\n *\\n\\n * @par Example\\n\\n * @code\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 91,\n \"score\": 96772.62703850494\n },\n {\n \"content\": \" {\\n\\n case file:\\n\\n return file_.is_open();\\n\\n case http:\\n\\n return http_.is_open();\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n case https:\\n\\n return https_.is_open();\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n default:\\n\\n return false;\\n\\n }\\n\\n }\\n\\n\\n\\n /// Opens the specified URL.\\n\\n /**\\n\\n * @param u The URL to open.\\n\\n *\\n\\n * @throws asio::system_error Thrown on failure.\\n\\n *\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 92,\n \"score\": 96772.4507595562\n },\n {\n \"content\": \" const asio::ip::tcp::resolver::query* query = 0)\\n\\n {\\n\\n URDL_CORO_BEGIN;\\n\\n\\n\\n // Open the socket to give the caller something to close to cancel the\\n\\n // asynchronous operation.\\n\\n socket_.open(asio::ip::tcp::v4(), ec);\\n\\n if (ec)\\n\\n {\\n\\n URDL_CORO_YIELD(socket_.get_io_context().post(\\n\\n asio::detail::bind_handler(*this, ec)));\\n\\n handler_(ec);\\n\\n return;\\n\\n }\\n\\n\\n\\n // Get a list of endpoints corresponding to the host name.\\n\\n URDL_CORO_YIELD(resolver_.async_resolve(*query, *this));\\n\\n if (ec)\\n\\n {\\n\\n handler_(ec);\\n\",\n \"file_path\": \"include/external/urdl/detail/connect.hpp\",\n \"rank\": 93,\n \"score\": 96772.39994150346\n },\n {\n \"content\": \" * Not all URL protocols support a content type. For these protocols, this\\n\\n * function returns an empty string.\\n\\n */\\n\\n std::string content_type() const\\n\\n {\\n\\n switch (protocol_)\\n\\n {\\n\\n case file:\\n\\n return std::string();\\n\\n case http:\\n\\n return http_.content_type();\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n case https:\\n\\n return https_.content_type();\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n default:\\n\\n return std::string();\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 94,\n \"score\": 96772.17808364797\n },\n {\n \"content\": \" handler_(ec);\\n\\n return;\\n\\n }\\n\\n else if (url_.protocol() == \\\"http\\\")\\n\\n {\\n\\n this_->protocol_ = http;\\n\\n URDL_CORO_YIELD(this_->http_.async_open(url_, *this));\\n\\n if (ec.value() == http::errc::moved_permanently || ec.value() == http::errc::found)\\n\\n {\\n\\n url_ = this_->http_.location();\\n\\n this_->http_.close(ec);\\n\\n continue;\\n\\n }\\n\\n handler_(ec);\\n\\n return;\\n\\n }\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n else if (url_.protocol() == \\\"https\\\")\\n\\n {\\n\\n this_->protocol_ = https;\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 95,\n \"score\": 96772.00994090318\n },\n {\n \"content\": \" break;\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n case https:\\n\\n https_.async_read_some(buffers, real_handler);\\n\\n break;\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n default:\\n\\n asio::error_code ec\\n\\n = asio::error::operation_not_supported;\\n\\n io_context_.post(asio::detail::bind_handler(real_handler, ec, 0));\\n\\n break;\\n\\n }\\n\\n\\n\\n return result.get();\\n\\n }\\n\\n\\n\\nprivate:\\n\\n template <typename Handler>\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 96,\n \"score\": 96772.00994090318\n },\n {\n \"content\": \" URDL_CORO_YIELD(this_->https_.async_open(url_, *this));\\n\\n if (ec.value() == http::errc::moved_permanently || ec.value() == http::errc::found)\\n\\n {\\n\\n url_ = this_->https_.location();\\n\\n this_->https_.close(ec);\\n\\n continue;\\n\\n }\\n\\n handler_(ec);\\n\\n return;\\n\\n }\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n else\\n\\n {\\n\\n ec = asio::error::operation_not_supported;\\n\\n this_->io_context_.post(\\n\\n asio::detail::bind_handler(handler_, ec));\\n\\n return;\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 97,\n \"score\": 96771.92959882578\n },\n {\n \"content\": \" *\\n\\n * @par Example\\n\\n * @code\\n\\n * urdl::read_stream stream(io_context);\\n\\n * stream.set_option(urdl::http::max_redirects(1));\\n\\n * @endcode\\n\\n */\\n\\n template <typename Option>\\n\\n void set_option(const Option& option)\\n\\n {\\n\\n options_.set_option(option);\\n\\n }\\n\\n\\n\\n /// Sets options to control the behaviour of the stream.\\n\\n /**\\n\\n * @param options The options to be set on the stream. The options in the set\\n\\n * are added on top of any options already set on the stream.\\n\\n *\\n\\n * @par Example\\n\\n * @code\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 98,\n \"score\": 96771.73876770303\n },\n {\n \"content\": \" */\\n\\n template <typename MutableBufferSequence>\\n\\n std::size_t read_some(const MutableBufferSequence& buffers,\\n\\n asio::error_code& ec)\\n\\n {\\n\\n switch (protocol_)\\n\\n {\\n\\n case file:\\n\\n return file_.read_some(buffers, ec);\\n\\n case http:\\n\\n return http_.read_some(buffers, ec);\\n\\n#if !defined(URDL_DISABLE_SSL)\\n\\n case https:\\n\\n return https_.read_some(buffers, ec);\\n\\n#endif // !defined(URDL_DISABLE_SSL)\\n\\n default:\\n\\n ec = asio::error::operation_not_supported;\\n\\n return 0;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"include/external/urdl/read_stream.hpp\",\n \"rank\": 99,\n \"score\": 96771.73876770303\n }\n]","isConversational":false}}},{"rowIdx":464,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/machine_learning/matrix_factorization.cpp"},"repo_name":{"kind":"string","value":"rafaelppires/rex"},"commit":{"kind":"string","value":"4d3c10ba4bde86365090b5c7c5e8de037a1fb885"},"file_code":{"kind":"string","value":"#include \"matrix_factorization.h\"\n#include <utils/time_probe.h>\n\n#include <iostream>\n\nMatrixFactorizationModel::MatrixFactorizationModel(int rank) : rank_(rank) {}\n\ndouble MatrixFactorizationModel::predict(int user, int item) const {\n return weights_.predict(user, item);\n}\n\ndouble MatrixFactorizationModel::rmse(const TripletVector<uint8_t> &testset) {\n size_t count = 0;\n double sumofsquares = 0;\n for (auto &t : testset) {\n double diff = t.value() - predict(t.row(), t.col());\n sumofsquares += diff * diff;\n ++count;\n }\n return sqrt(sumofsquares / count);\n}\n\nbool MatrixFactorizationModel::init_item(int item, const Sparse &column) {\n if (!weights_.has_item(item)) {\n find_space(0, item);\n weights_.items.col(item) = column;\n return true;\n }\n return false;\n}\n\nbool MatrixFactorizationModel::init_user(int user, const Sparse &column) {\n if (!weights_.has_user(user)) {\n find_space(user, 0);\n weights_.users.col(user) = column;\n return true;\n }\n return false;\n}\n\nSparse MatrixFactorizationModel::zero_embedding() {\n Sparse ret;\n ret.reserve(rank_);\n ret.resize(rank_, 1);\n ret.col(0) = Eigen::MatrixXd::Zero(rank_, 1).sparseView();\n return ret;\n}\n\nvoid MatrixFactorizationModel::make_compressed() {\n weights_.users.makeCompressed();\n weights_.items.makeCompressed();\n weights_.user_biases.makeCompressed();\n weights_.item_biases.makeCompressed();\n}\n\nvoid MatrixFactorizationModel::item_merge_column(Sparse &Y,\n const Sparse &Other) {\n sparse_matrix_outer_iterate(Other, [&](Sparse::InnerIterator it, int i) {\n int item = it.col();\n if (!init_item(item, Other.col(item))) {\n Y.col(item) = (Y.col(item) + Other.col(item)) / 2.;\n }\n });\n}\n\nvoid MatrixFactorizationModel::user_merge_column(Sparse &X,\n const Sparse &Other) {\n sparse_matrix_outer_iterate(Other, [&](Sparse::InnerIterator it, int i) {\n int user = it.col();\n if (!init_user(user, Other.col(user))) {\n X.col(user) = (X.col(user) + Other.col(user)) / 2.;\n }\n });\n}\n\nvoid MatrixFactorizationModel::merge_average(\n const MatrixFactorizationModel &m) {\n item_merge_column(weights_.items, m.weights_.items);\n item_merge_column(weights_.item_biases, m.weights_.item_biases);\n\n user_merge_column(weights_.users, m.weights_.users);\n user_merge_column(weights_.user_biases, m.weights_.user_biases);\n}\n\nvoid MatrixFactorizationModel::prep_toshare() {\n init_user(rank_, weights_.users.col(0));\n weights_.users.col(rank_) = weights_.users.col(0);\n weights_.users.col(0) = Eigen::MatrixXd::Zero(rank_, 1).sparseView();\n weights_.user_biases.coeffRef(0, rank_) = weights_.user_biases.coeff(0, 0);\n weights_.user_biases.coeffRef(0, 0) = 0;\n}\n\nstd::set<int> MatrixFactorizationModel::metropolis_hastings(\n size_t my_degree, const DegreesAndModels &models, Sparse &factors,\n Sparse &biases, bool isusers) {\n std::set<int> ret;\n sparse_matrix_outer_iterate(factors, [&](Sparse::InnerIterator it, int i) {\n int index = it.col();\n double sum_weights = 0;\n Sparse embedding(zero_embedding()), bias;\n bias.resize(1, 1);\n bias.coeffRef(0, 0) = 0;\n std::vector<size_t> degrees;\n for (const auto &model : models) {\n size_t degree = model.degree;\n const MatrixFactorizationModel &nmodel = model.model;\n if (isusers ? nmodel.weights_.has_user(index)\n : nmodel.weights_.has_item(index)) {\n double weight = 1. / (1 + std::max(my_degree, degree));\n embedding.col(0) +=\n weight * (isusers ? nmodel.weights_.users.col(index)\n : nmodel.weights_.items.col(index));\n bias.coeffRef(0, 0) +=\n weight *\n (isusers ? nmodel.weights_.user_biases.coeff(0, index)\n : nmodel.weights_.item_biases.coeff(0, index));\n sum_weights += weight;\n degrees.emplace_back(degree);\n }\n }\n if (sum_weights > 1.0) {\n std::cerr << \"my rank: \" << rank_ << \" idx: \" << index << std::endl;\n std::cerr << \"Sum of weights > 1: \" << sum_weights << std::endl;\n std::cerr << my_degree << \" (\" << degrees.size() << \") - \";\n for (auto &d : degrees) std::cerr << d << \" \";\n std::cerr << std::endl;\n abort();\n }\n double my_weight = 1. - sum_weights;\n factors.col(index) *= my_weight;\n biases.coeffRef(0, index) *= my_weight;\n factors.col(index) += embedding.col(0);\n biases.coeffRef(0, index) += bias.coeff(0, 0);\n ret.insert(index);\n });\n return ret;\n}\n\nstd::set<int> MatrixFactorizationModel::metropolis_hastings_users(\n size_t my_degree, const DegreesAndModels &models) {\n return metropolis_hastings(my_degree, models, weights_.users,\n weights_.user_biases, true);\n}\n\nstd::set<int> MatrixFactorizationModel::metropolis_hastings_items(\n size_t my_degree, const DegreesAndModels &models) {\n return metropolis_hastings(my_degree, models, weights_.items,\n weights_.item_biases, false);\n}\n\nstd::pair<double, Sparse> MatrixFactorizationModel::combine_neighbors(\n bool isuser, int index, const DegreesAndModels &models) {\n struct Entry {\n Entry(unsigned d, Sparse c, double b) : degree(d), col(c), bias(b) {}\n unsigned degree;\n Sparse col;\n double bias;\n };\n std::vector<Entry> embs; \n for (const auto &neigh : models) {\n const MatrixFactorizationModel &nmodel = neigh.model;\n if (isuser ? nmodel.weights_.has_user(index)\n : nmodel.weights_.has_item(index)) {\n embs.emplace_back(\n neigh.degree,\n isuser ? nmodel.weights_.users.col(index)\n : nmodel.weights_.items.col(index),\n isuser ? nmodel.weights_.user_biases.coeff(0, index)\n : nmodel.weights_.item_biases.coeff(0, index));\n }\n }\n\n Sparse embedd(zero_embedding());\n double sum_of_inverses = 0, bias = 0;\n for (const auto &e : embs) sum_of_inverses += 1.0 / e.degree;\n for (const auto &e : embs) {\n double w = (1.0 / (1 + e.degree * (sum_of_inverses - 1.0 / e.degree)));\n embedd.col(0) += w * e.col;\n bias += w * e.bias;\n }\n return std::make_pair(bias, embedd);\n}\n\nvoid MatrixFactorizationModel::combine_neighbors_embeddings(\n bool isuser, const DegreesAndModels &models, std::set<int> &exclude_list) {\n for (const auto &neigh : models) {\n sparse_matrix_outer_iterate(\n isuser ? neigh.model.weights_.users : neigh.model.weights_.items,\n [&](Sparse::InnerIterator it, int i) {\n int index = it.col();\n if (exclude_list.insert(index).second) {\n auto combined = combine_neighbors(isuser, index, models);\n if (isuser) {\n init_user(index, combined.second);\n weights_.user_biases.coeffRef(0, index) =\n combined.first;\n } else {\n init_item(index, combined.second);\n weights_.item_biases.coeffRef(0, index) =\n combined.first;\n }\n }\n });\n }\n}\n\nvoid MatrixFactorizationModel::combine_neighbors_users(\n const DegreesAndModels &models, std::set<int> &exclude_list) {\n combine_neighbors_embeddings(true, models, exclude_list);\n}\n\nvoid MatrixFactorizationModel::combine_neighbors_items(\n const DegreesAndModels &models, std::set<int> &exclude_list) {\n combine_neighbors_embeddings(false, models, exclude_list);\n}\n\nvoid MatrixFactorizationModel::merge_weighted(size_t my_degree,\n const DegreesAndModels &models) {\n \n std::set<int> users_done = metropolis_hastings_users(my_degree, models),\n items_done = metropolis_hastings_items(my_degree, models);\n\n \n combine_neighbors_users(models, users_done);\n combine_neighbors_items(models, items_done);\n}\n\nvoid MatrixFactorizationModel::find_space(int user, int item, const Sparse &col,\n double b) {\n auto &Y = weights_.items, &B = weights_.item_biases;\n auto &X = weights_.users, &A = weights_.user_biases;\n if (item >= Y.cols()) {\n Y.conservativeResize(rank_, item + 1);\n B.conservativeResize(1, item + 1);\n if (col.outerSize() > 0) Y.col(item) = col;\n if (b > 0) B.coeffRef(0, item) = b;\n }\n if (user >= X.cols()) {\n X.conservativeResize(rank_, user + 1);\n A.conservativeResize(1, user + 1);\n if (col.outerSize() > 0) X.col(user) = col;\n if (b > 0) A.coeffRef(0, user) = b;\n }\n}\n\nsize_t MatrixFactorizationModel::estimate_serial_size() const {\n return sizeof(rank_) + weights_.estimate_serial_size();\n}\n\nvoid MatrixFactorizationModel::serialize_append(\n std::vector<uint8_t> &out) const {\n const uint8_t *rptr = reinterpret_cast<const uint8_t *>(&rank_);\n out.insert(out.end(), rptr, rptr + sizeof(rank_));\n weights_.serialize_append(out);\n}\n\nsize_t MatrixFactorizationModel::deserialize(const std::vector<uint8_t> &data,\n size_t offset) {\n rank_ = *reinterpret_cast<const int *>(&data[offset]);\n return weights_.deserialize(data, offset + sizeof(rank_));\n}\n\nHyperMFSGD::HyperMFSGD(int r, double lr, double rp, double ib, double ifact)\n : rank(r),\n learning_rate(lr),\n regularization_param(rp),\n init_factor(ifact),\n init_bias(ib) {\n#if 0\n init_column_ = Sparse(Dense::Constant(r, 1, ifact).sparseView());\n#else \n TripletVector<double> column;\n for (int i = 0; i < r; ++i) {\n column.emplace_back(i, 0, ifact * double(rand() % 10000) / 10000);\n }\n Sparse m(r, 1);\n m.setFromTriplets(column.begin(), column.end());\n init_column_ = m;\n#endif\n}\n\nMFSGD::MFSGD(HyperMFSGD h)\n : hyper_(h), model_(h.rank), weights_(model_.weights_) {}\n\ndouble MFSGD::train(int user, int item, double value) {\n auto &Y = weights_.items, &B = weights_.item_biases;\n auto &X = weights_.users, &A = weights_.user_biases;\n double lambda = hyper_.regularization_param, eta = hyper_.learning_rate;\n#if 1 \n double err = value - model_.predict(user, item), step = eta * err,\n mult = 1 - eta * lambda;\n Y.col(item) = mult * Y.col(item) + step * X.col(user);\n B.coeffRef(0, item) += step;\n X.col(user) = mult * X.col(user) + step * Y.col(item);\n A.coeffRef(0, user) += step;\n#else \n double err = value - model_.predict(user, item);\n B.coeffRef(0, item) += eta * (err - lambda * B.coeffRef(0, item));\n A.coeffRef(0, user) += eta * (err - lambda * A.coeffRef(0, user));\n X.col(user) += eta * (err * Y.col(item) - lambda * X.col(user));\n Y.col(item) += eta * (err * X.col(user) - lambda * Y.col(item));\n#endif\n return err * err;\n}\n\nvoid MatrixFactorizationModel::get_factors(int user, int item) {\n \n}\n\n"},"prefix":{"kind":"string","value":"#include \"matrix_factorization.h\"\n#include <utils/time_probe.h>\n\n#include <iostream>\n\nMatrixFactorizationModel::MatrixFactorizationModel(int rank) : rank_(rank) {}\n\ndouble MatrixFactorizationModel::predict(int user, int item) const {\n return weights_.predict(user, item);\n}\n\ndouble MatrixFactorizationModel::rmse(const TripletVector<uint8_t> &testset) {\n size_t count = 0;\n double sumofsquares = 0;\n for (auto &t : testset) {\n double diff = t.value() - predict(t.row(), t.col());\n sumofsquares += diff * diff;\n ++count;\n }\n return sqrt(sumofsquares / count);\n}\n\nbool MatrixFactorizationModel::init_item(int item, const Sparse &column) {\n if (!weights_.has_item(item)) {\n find_space(0, item);\n weights_.items.col(item) = column;\n return true;\n }\n return false;\n}\n\nbool MatrixFactorizationModel::init_user(int user, const Sparse &column) {\n if (!weights_.has_user(user)) {\n find_space(user, 0);\n weights_.users.col(user) = column;\n return true;\n }\n return false;\n}\n\nSparse MatrixFactorizationModel::zero_embedding() {\n Sparse ret;\n ret.reserve(rank_);\n ret.resize(rank_, 1);\n ret.col(0) = Eigen::MatrixXd::Zero(rank_, 1).sparseView();\n return ret;\n}\n\nvoid MatrixFactorizationModel::make_compressed() {\n weights_.users.makeCompressed();\n weights_.items.makeCompressed();\n weights_.user_biases.makeCompressed();\n weights_.item_biases.makeCompressed();\n}\n\nvoid MatrixFactorizationModel::item_merge_column(Sparse &Y,\n const Sparse &Other) {\n sparse_matrix_outer_iterate(Other, [&](Sparse::InnerIterator it, int i) {\n int item = it.col();\n if (!init_item(item, Other.col(item))) {\n Y.col(item) = (Y.col(item) + Other.col(item)) / 2.;\n }\n });\n}\n\nvoid MatrixFactorizationModel::user_merge_column(Sparse &X,\n const Sparse &Other) {\n sparse_matrix_outer_iterate(Other, [&](Sparse::InnerIterator it, int i) {\n int user = it.col();\n if (!init_user(user, Other.col(user))) {\n X.col(user) = (X.col(user) + Other.col(user)) / 2.;\n }\n });\n}\n\nvoid MatrixFactorizationModel::merge_average(\n const MatrixFactorizationModel &m) {\n item_merge_column(weights_.items, m.weights_.items);\n item_merge_column(weights_.item_biases, m.weights_.item_biases);\n\n user_merge_column(weights_.users, m.weights_.users);\n user_merge_column(weights_.user_biases, m.weights_.user_biases);\n}\n\nvoid MatrixFactorizationModel::prep_toshare() {\n init_user(rank_, weights_.users.col(0));\n weights_.users.col(rank_) = weights_.users.col(0);\n weights_.users.col(0) = Eigen::MatrixXd::Zero(rank_, 1).sparseView();\n weights_.user_biases.coeffRef(0, rank_) = weights_.user_biases.coeff(0, 0);\n weights_.user_biases.coeffRef(0, 0) = 0;\n}\n\nstd::set<int> MatrixFactorizationModel::metropolis_hastings(\n size_t my_degree, const DegreesAndModels &models, Sparse &factors,\n Sparse &biases, bool isusers) {\n std::set<int> ret;\n sparse_matrix_outer_iterate(factors, [&](Sparse::InnerIterator it, int i) {\n int index = it.col();\n double sum_weights = 0;\n Sparse embedding(zero_embedding()), bias;\n bias.resize(1, 1);\n bias.coeffRef(0, 0) = 0;\n std::vector<size_t> degrees;\n for (const auto &model : models) {\n size_t degree = model.degree;\n const MatrixFactorizationModel &nmodel = model.model;\n if (isusers ? nmodel.weights_.has_user(index)\n : nmodel.weights_.has_item(index)) {\n double weight = 1. / (1 + std::max(my_degree, degree));\n embedding.col(0) +=\n weight * (isusers ? nmodel.weights_.users.col(index)\n : nmodel.weights_.items.col(index));\n bias.coeffRef(0, 0) +=\n weight *\n (isusers ? nmodel.weights_.user_biases.coeff(0, index)\n : nmodel.weights_.item_biases.coeff(0, index));\n sum_weights += weight;\n degrees.emplace_back(degree);\n }\n }\n if (sum_weights > 1.0) {\n std::cerr << \"my rank: \" << rank_ << \" idx: \" << index << std::endl;\n std::cerr << \"Sum of weights > 1: \" << sum_weights << std::endl;\n std::cerr << my_degree << \" (\" << degrees.size() << \") - \";\n for (auto &d : degrees) std::cerr << d << \" \";\n std::cerr << std::endl;\n abort();\n }\n double my_weight = 1. - sum_weights;\n factors.col(index) *= my_weight;\n biase"},"suffix":{"kind":"string","value":"rank_) + weights_.estimate_serial_size();\n}\n\nvoid MatrixFactorizationModel::serialize_append(\n std::vector<uint8_t> &out) const {\n const uint8_t *rptr = reinterpret_cast<const uint8_t *>(&rank_);\n out.insert(out.end(), rptr, rptr + sizeof(rank_));\n weights_.serialize_append(out);\n}\n\nsize_t MatrixFactorizationModel::deserialize(const std::vector<uint8_t> &data,\n size_t offset) {\n rank_ = *reinterpret_cast<const int *>(&data[offset]);\n return weights_.deserialize(data, offset + sizeof(rank_));\n}\n\nHyperMFSGD::HyperMFSGD(int r, double lr, double rp, double ib, double ifact)\n : rank(r),\n learning_rate(lr),\n regularization_param(rp),\n init_factor(ifact),\n init_bias(ib) {\n#if 0\n init_column_ = Sparse(Dense::Constant(r, 1, ifact).sparseView());\n#else \n TripletVector<double> column;\n for (int i = 0; i < r; ++i) {\n column.emplace_back(i, 0, ifact * double(rand() % 10000) / 10000);\n }\n Sparse m(r, 1);\n m.setFromTriplets(column.begin(), column.end());\n init_column_ = m;\n#endif\n}\n\nMFSGD::MFSGD(HyperMFSGD h)\n : hyper_(h), model_(h.rank), weights_(model_.weights_) {}\n\ndouble MFSGD::train(int user, int item, double value) {\n auto &Y = weights_.items, &B = weights_.item_biases;\n auto &X = weights_.users, &A = weights_.user_biases;\n double lambda = hyper_.regularization_param, eta = hyper_.learning_rate;\n#if 1 \n double err = value - model_.predict(user, item), step = eta * err,\n mult = 1 - eta * lambda;\n Y.col(item) = mult * Y.col(item) + step * X.col(user);\n B.coeffRef(0, item) += step;\n X.col(user) = mult * X.col(user) + step * Y.col(item);\n A.coeffRef(0, user) += step;\n#else \n double err = value - model_.predict(user, item);\n B.coeffRef(0, item) += eta * (err - lambda * B.coeffRef(0, item));\n A.coeffRef(0, user) += eta * (err - lambda * A.coeffRef(0, user));\n X.col(user) += eta * (err * Y.col(item) - lambda * X.col(user));\n Y.col(item) += eta * (err * X.col(user) - lambda * Y.col(item));\n#endif\n return err * err;\n}\n\nvoid MatrixFactorizationModel::get_factors(int user, int item) {\n \n}\n\n"},"middle":{"kind":"string","value":"s.coeffRef(0, index) *= my_weight;\n factors.col(index) += embedding.col(0);\n biases.coeffRef(0, index) += bias.coeff(0, 0);\n ret.insert(index);\n });\n return ret;\n}\n\nstd::set<int> MatrixFactorizationModel::metropolis_hastings_users(\n size_t my_degree, const DegreesAndModels &models) {\n return metropolis_hastings(my_degree, models, weights_.users,\n weights_.user_biases, true);\n}\n\nstd::set<int> MatrixFactorizationModel::metropolis_hastings_items(\n size_t my_degree, const DegreesAndModels &models) {\n return metropolis_hastings(my_degree, models, weights_.items,\n weights_.item_biases, false);\n}\n\nstd::pair<double, Sparse> MatrixFactorizationModel::combine_neighbors(\n bool isuser, int index, const DegreesAndModels &models) {\n struct Entry {\n Entry(unsigned d, Sparse c, double b) : degree(d), col(c), bias(b) {}\n unsigned degree;\n Sparse col;\n double bias;\n };\n std::vector<Entry> embs; \n for (const auto &neigh : models) {\n const MatrixFactorizationModel &nmodel = neigh.model;\n if (isuser ? nmodel.weights_.has_user(index)\n : nmodel.weights_.has_item(index)) {\n embs.emplace_back(\n neigh.degree,\n isuser ? nmodel.weights_.users.col(index)\n : nmodel.weights_.items.col(index),\n isuser ? nmodel.weights_.user_biases.coeff(0, index)\n : nmodel.weights_.item_biases.coeff(0, index));\n }\n }\n\n Sparse embedd(zero_embedding());\n double sum_of_inverses = 0, bias = 0;\n for (const auto &e : embs) sum_of_inverses += 1.0 / e.degree;\n for (const auto &e : embs) {\n double w = (1.0 / (1 + e.degree * (sum_of_inverses - 1.0 / e.degree)));\n embedd.col(0) += w * e.col;\n bias += w * e.bias;\n }\n return std::make_pair(bias, embedd);\n}\n\nvoid MatrixFactorizationModel::combine_neighbors_embeddings(\n bool isuser, const DegreesAndModels &models, std::set<int> &exclude_list) {\n for (const auto &neigh : models) {\n sparse_matrix_outer_iterate(\n isuser ? neigh.model.weights_.users : neigh.model.weights_.items,\n [&](Sparse::InnerIterator it, int i) {\n int index = it.col();\n if (exclude_list.insert(index).second) {\n auto combined = combine_neighbors(isuser, index, models);\n if (isuser) {\n init_user(index, combined.second);\n weights_.user_biases.coeffRef(0, index) =\n combined.first;\n } else {\n init_item(index, combined.second);\n weights_.item_biases.coeffRef(0, index) =\n combined.first;\n }\n }\n });\n }\n}\n\nvoid MatrixFactorizationModel::combine_neighbors_users(\n const DegreesAndModels &models, std::set<int> &exclude_list) {\n combine_neighbors_embeddings(true, models, exclude_list);\n}\n\nvoid MatrixFactorizationModel::combine_neighbors_items(\n const DegreesAndModels &models, std::set<int> &exclude_list) {\n combine_neighbors_embeddings(false, models, exclude_list);\n}\n\nvoid MatrixFactorizationModel::merge_weighted(size_t my_degree,\n const DegreesAndModels &models) {\n \n std::set<int> users_done = metropolis_hastings_users(my_degree, models),\n items_done = metropolis_hastings_items(my_degree, models);\n\n \n combine_neighbors_users(models, users_done);\n combine_neighbors_items(models, items_done);\n}\n\nvoid MatrixFactorizationModel::find_space(int user, int item, const Sparse &col,\n double b) {\n auto &Y = weights_.items, &B = weights_.item_biases;\n auto &X = weights_.users, &A = weights_.user_biases;\n if (item >= Y.cols()) {\n Y.conservativeResize(rank_, item + 1);\n B.conservativeResize(1, item + 1);\n if (col.outerSize() > 0) Y.col(item) = col;\n if (b > 0) B.coeffRef(0, item) = b;\n }\n if (user >= X.cols()) {\n X.conservativeResize(rank_, user + 1);\n A.conservativeResize(1, user + 1);\n if (col.outerSize() > 0) X.col(user) = col;\n if (b > 0) A.coeffRef(0, user) = b;\n }\n}\n\nsize_t MatrixFactorizationModel::estimate_serial_size() const {\n return sizeof("},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class meta_sqrt<Y, InfX, SupX, true> { public: enum { ret = (SupX*SupX <= Y) ? SupX : InfX }; };\n\n\n\n\n\n/** \\internal Computes the least common multiple of two positive integer A and B\n\n * at compile-time. It implements a naive algorithm testing all multiples of A.\n\n * It thus works better if A>=B.\n\n */\n\ntemplate<int A, int B, int K=1, bool Done = ((A*K)%B)==0>\n","file_path":"src/Eigen/src/Core/util/Meta.h","rank":0,"score":181519.79548809066},{"content":"class MatrixFactorizationModel {\n\n public:\n\n typedef std::vector<DPSGDEntry> DegreesAndModels;\n\n\n\n MatrixFactorizationModel() = default;\n\n MatrixFactorizationModel(int rank);\n\n double predict(int user, int item) const;\n\n std::vector<int> recommend_user(int item, int how_many);\n\n std::vector<int> recommend_item(int user, int how_many);\n\n int rank() { return rank_; }\n\n const Sparse& user_features() { return weights_.users; }\n\n const Sparse& item_features() { return weights_.items; }\n\n double rmse(const TripletVector<uint8_t>& testset);\n\n void get_factors(int user, int item);\n\n\n\n void serialize_append(std::vector<uint8_t> &out) const;\n\n size_t deserialize(const std::vector<uint8_t> &data, size_t offset);\n\n void find_space(int user, int item, const Sparse& col = Sparse(),\n\n double b = -1);\n\n\n","file_path":"src/machine_learning/matrix_factorization.h","rank":1,"score":166525.93255033102},{"content":"class MatrixFactorizationModel;\n","file_path":"src/model_merging/dpsgd_entry.h","rank":2,"score":166520.4204823774},{"content":"struct is_convertible<const T,const T&> { enum { value = true }; };\n\n\n\n#endif\n\n\n\n/** \\internal Allows to enable/disable an overload\n\n * according to a compile time condition.\n\n */\n\ntemplate<bool Condition, typename T=void> struct enable_if;\n\n\n\ntemplate<typename T> struct enable_if<true,T>\n\n{ typedef T type; };\n\n\n\n#if defined(EIGEN_GPU_COMPILE_PHASE)\n\n#if !defined(__FLT_EPSILON__)\n\n#define __FLT_EPSILON__ FLT_EPSILON\n\n#define __DBL_EPSILON__ DBL_EPSILON\n\n#endif\n\n\n\nnamespace device {\n\n\n","file_path":"src/Eigen/src/Core/util/Meta.h","rank":3,"score":165563.2227008175},{"content":"class BlockImpl<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true,Sparse>\n\n : public internal::sparse_matrix_block_impl<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols>\n\n{\n\npublic:\n\n typedef _StorageIndex StorageIndex;\n\n typedef const SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType;\n\n typedef internal::sparse_matrix_block_impl<SparseMatrixType,BlockRows,BlockCols> Base;\n\n inline BlockImpl(SparseMatrixType& xpr, Index i)\n\n : Base(xpr, i)\n\n {}\n\n\n\n inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)\n\n : Base(xpr, startRow, startCol, blockRows, blockCols)\n\n {}\n\n\n\n using Base::operator=;\n\nprivate:\n\n template<typename Derived> BlockImpl(const SparseMatrixBase<Derived>& xpr, Index i);\n\n template<typename Derived> BlockImpl(const SparseMatrixBase<Derived>& xpr);\n\n};\n\n\n\n//----------\n\n\n\n/** Generic implementation of sparse Block expression.\n\n * Real-only.\n\n */\n\ntemplate<typename XprType, int BlockRows, int BlockCols, bool InnerPanel>\n","file_path":"src/Eigen/src/SparseCore/SparseBlock.h","rank":4,"score":161217.16643593376},{"content":"struct unary_evaluator<Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true>, IteratorBased>\n\n : evaluator<SparseCompressedBase<Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> > >\n\n{\n\n typedef Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> XprType;\n\n typedef evaluator<SparseCompressedBase<XprType> > Base;\n\n explicit unary_evaluator(const XprType &xpr) : Base(xpr) {}\n\n};\n\n\n\n} // end namespace internal\n\n\n\n\n\n} // end namespace Eigen\n\n\n\n#endif // EIGEN_SPARSE_BLOCK_H\n","file_path":"src/Eigen/src/SparseCore/SparseBlock.h","rank":5,"score":154856.5955950414},{"content":"struct bool_constant<true> : true_type {};\n\n\n\ntemplate<>\n","file_path":"src/Eigen/src/Core/util/Meta.h","rank":6,"score":149700.23256709104},{"content":"class const_blas_data_mapper : public blas_data_mapper<const Scalar, Index, StorageOrder> {\n\n public:\n\n EIGEN_ALWAYS_INLINE const_blas_data_mapper(const Scalar *data, Index stride) : blas_data_mapper<const Scalar, Index, StorageOrder>(data, stride) {}\n\n\n\n EIGEN_ALWAYS_INLINE const_blas_data_mapper<Scalar, Index, StorageOrder> getSubMapper(Index i, Index j) const {\n\n return const_blas_data_mapper<Scalar, Index, StorageOrder>(&(this->operator()(i, j)), this->m_stride);\n\n }\n\n};\n\n\n\n\n\n/* Helper class to analyze the factors of a Product expression.\n\n * In particular it allows to pop out operator-, scalar multiples,\n\n * and conjugate */\n\ntemplate<typename XprType> struct blas_traits\n\n{\n\n typedef typename traits<XprType>::Scalar Scalar;\n\n typedef const XprType& ExtractType;\n\n typedef XprType _ExtractType;\n\n enum {\n\n IsComplex = NumTraits<Scalar>::IsComplex,\n","file_path":"src/Eigen/src/Core/util/BlasUtil.h","rank":7,"score":146704.30906553016},{"content":"struct is_void : is_same<void, typename remove_const<T>::type> {};\n\n\n\n#if EIGEN_HAS_CXX11\n\ntemplate<> struct is_arithmetic<signed long long> { enum { value = true }; };\n\ntemplate<> struct is_arithmetic<unsigned long long> { enum { value = true }; };\n\nusing std::is_integral;\n\n#else\n\ntemplate<typename T> struct is_integral { enum { value = false }; };\n\ntemplate<> struct is_integral<bool> { enum { value = true }; };\n\ntemplate<> struct is_integral<char> { enum { value = true }; };\n\ntemplate<> struct is_integral<signed char> { enum { value = true }; };\n\ntemplate<> struct is_integral<unsigned char> { enum { value = true }; };\n\ntemplate<> struct is_integral<signed short> { enum { value = true }; };\n\ntemplate<> struct is_integral<unsigned short> { enum { value = true }; };\n\ntemplate<> struct is_integral<signed int> { enum { value = true }; };\n\ntemplate<> struct is_integral<unsigned int> { enum { value = true }; };\n\ntemplate<> struct is_integral<signed long> { enum { value = true }; };\n\ntemplate<> struct is_integral<unsigned long> { enum { value = true }; };\n\n#if EIGEN_COMP_MSVC\n\ntemplate<> struct is_integral<signed __int64> { enum { value = true }; };\n","file_path":"src/Eigen/src/Core/util/Meta.h","rank":8,"score":134841.5823909178},{"content":"struct inplace_transpose_selector<MatrixType,true,true> { // PacketSize x PacketSize\n\n static void run(MatrixType& m) {\n\n typedef typename MatrixType::Scalar Scalar;\n\n typedef typename internal::packet_traits<typename MatrixType::Scalar>::type Packet;\n\n const Index PacketSize = internal::packet_traits<Scalar>::size;\n\n const Index Alignment = internal::evaluator<MatrixType>::Alignment;\n\n PacketBlock<Packet> A;\n\n for (Index i=0; i<PacketSize; ++i)\n\n A.packet[i] = m.template packetByOuterInner<Alignment>(i,0);\n\n internal::ptranspose(A);\n\n for (Index i=0; i<PacketSize; ++i)\n\n m.template writePacket<Alignment>(m.rowIndexByOuterInner(i,0), m.colIndexByOuterInner(i,0), A.packet[i]);\n\n }\n\n};\n\n\n\ntemplate<typename MatrixType,bool MatchPacketSize>\n","file_path":"src/Eigen/src/Core/Transpose.h","rank":9,"score":120145.61848764142},{"content":"struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};\n\n\n\nNLOHMANN_JSON_HAS_HELPER(mapped_type);\n\nNLOHMANN_JSON_HAS_HELPER(key_type);\n\nNLOHMANN_JSON_HAS_HELPER(value_type);\n\nNLOHMANN_JSON_HAS_HELPER(iterator);\n\n\n\ntemplate<bool B, class RealType, class CompatibleObjectType>\n","file_path":"src/json/json.hpp","rank":10,"score":117139.37543565963},{"content":"struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleObjectType,\n\n typename = void>\n","file_path":"src/json/json-17.hpp","rank":11,"score":117139.37543565963},{"content":"struct nullary_wrapper<Scalar,NullaryOp,true,true,true>\n\n{\n\n template <typename IndexType>\n\n EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i, IndexType j) const {\n\n return nullary_wrapper<Scalar,NullaryOp,\n\n has_nullary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\n\n has_unary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\n\n has_binary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value>().operator()(op,i,j);\n\n }\n\n template <typename IndexType>\n\n EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i) const {\n\n return nullary_wrapper<Scalar,NullaryOp,\n\n has_nullary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\n\n has_unary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\n\n has_binary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value>().operator()(op,i);\n\n }\n\n\n\n template <typename T, typename IndexType>\n\n EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i, IndexType j) const {\n\n return nullary_wrapper<Scalar,NullaryOp,\n","file_path":"src/Eigen/src/Core/CoreEvaluators.h","rank":12,"score":116362.23632104407},{"content":"struct has_none {int a[1];};\n","file_path":"src/Eigen/src/Core/util/Meta.h","rank":13,"score":115519.14814585852},{"content":"struct triangular_solver_unroller<Lhs,Rhs,Mode,LoopIndex,Size,true> {\n\n static void run(const Lhs&, Rhs&) {}\n\n};\n\n\n\ntemplate<typename Lhs, typename Rhs, int Mode>\n","file_path":"src/Eigen/src/Core/SolveTriangular.h","rank":14,"score":115200.36842311482},{"content":"struct has_std_result_type {int a[2];};\n","file_path":"src/Eigen/src/Core/util/Meta.h","rank":15,"score":113189.59007229327},{"content":"extern __inline int __attribute__((__gnu_inline__, __always_inline__, __artificial__))\n","file_path":"src/simd/mmintrin.h","rank":16,"score":108807.23622173438},{"content":"struct RangeAccess<AcMd, const T> : RangeAccess<AcMd, T> {\n\n typedef RangeAccess<AcMd, T> Base;\n\n using Base::Base;\n\n};\n\n\n\n} // namespace internal\n\n} // namespace TensorSycl\n\n} // namespace Eigen\n\n\n\n#endif // EIGEN_CXX11_TENSOR_TENSOR_SYCL_STORAGE_MEMORY_H\n","file_path":"src/Eigen/src/Core/arch/SYCL/SyclMemoryModel.h","rank":17,"score":108704.179495046},{"content":"extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))\n","file_path":"src/simd/mmintrin.h","rank":18,"score":108658.44152511084},{"content":"class Ref<const SparseVector<MatScalar,MatOptions,MatIndex>, Options, StrideType>\n\n : public internal::SparseRefBase<Ref<const SparseVector<MatScalar,MatOptions,MatIndex>, Options, StrideType> >\n\n{\n\n typedef SparseVector<MatScalar,MatOptions,MatIndex> TPlainObjectType;\n\n typedef internal::traits<Ref> Traits;\n\n public:\n\n\n\n typedef internal::SparseRefBase<Ref> Base;\n\n EIGEN_SPARSE_PUBLIC_INTERFACE(Ref)\n\n\n\n template<typename Derived>\n\n inline Ref(const SparseMatrixBase<Derived>& expr) : m_hasCopy(false)\n\n {\n\n construct(expr.derived(), typename Traits::template match<Derived>::type());\n\n }\n\n\n\n inline Ref(const Ref& other) : Base(other), m_hasCopy(false) {\n\n // copy constructor shall not copy the m_object, to avoid unnecessary malloc and copy\n\n }\n\n\n","file_path":"src/Eigen/src/SparseCore/SparseRef.h","rank":19,"score":106922.77734636124},{"content":"class Map<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>\n\n : public SparseMapBase<Map<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >\n\n{\n\n public:\n\n typedef SparseMapBase<Map> Base;\n\n EIGEN_SPARSE_PUBLIC_INTERFACE(Map)\n\n enum { IsRowMajor = Base::IsRowMajor };\n\n\n\n public:\n\n#endif\n\n /** This is the const version of the above constructor.\n\n *\n\n * This constructor is available only if \\c SparseMatrixType is const, e.g.:\n\n * \\code Map<const SparseMatrix<double> > \\endcode\n\n */\n\n inline Map(Index rows, Index cols, Index nnz, const StorageIndex* outerIndexPtr,\n\n const StorageIndex* innerIndexPtr, const Scalar* valuePtr, const StorageIndex* innerNonZerosPtr = 0)\n\n : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr)\n\n {}\n\n\n\n /** Empty destructor */\n\n inline ~Map() {}\n\n};\n\n\n\nnamespace internal {\n\n\n\ntemplate<typename MatScalar, int MatOptions, typename MatIndex, int Options, typename StrideType>\n","file_path":"src/Eigen/src/SparseCore/SparseMap.h","rank":20,"score":106922.77734636124},{"content":"class Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>\n\n : public internal::SparseRefBase<Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >\n\n{\n\n typedef SparseMatrix<MatScalar,MatOptions,MatIndex> TPlainObjectType;\n\n typedef internal::traits<Ref> Traits;\n\n public:\n\n\n\n typedef internal::SparseRefBase<Ref> Base;\n\n EIGEN_SPARSE_PUBLIC_INTERFACE(Ref)\n\n\n\n template<typename Derived>\n\n inline Ref(const SparseMatrixBase<Derived>& expr) : m_hasCopy(false)\n\n {\n\n construct(expr.derived(), typename Traits::template match<Derived>::type());\n\n }\n\n\n\n inline Ref(const Ref& other) : Base(other), m_hasCopy(false) {\n\n // copy constructor shall not copy the m_object, to avoid unnecessary malloc and copy\n\n }\n\n\n","file_path":"src/Eigen/src/SparseCore/SparseRef.h","rank":21,"score":106922.77734636124},{"content":" static EIGEN_STRONG_INLINE Index blocked(MatrixType& mat)\n","file_path":"src/Eigen/src/Cholesky/LLT.h","rank":22,"score":106242.98767853303},{"content":"EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void MatrixBase<Derived>::stableNormalize()\n","file_path":"src/Eigen/src/Core/Dot.h","rank":23,"score":106225.2093320402},{"content":" static EIGEN_DEVICE_FUNC\n","file_path":"src/Eigen/src/Eigenvalues/Tridiagonalization.h","rank":24,"score":106225.2093320402},{"content":"struct ScalarBinaryOpTraits<void,void,BinaryOp>\n\n{\n\n typedef void ReturnType;\n\n};\n\n\n\n// We require Lhs and Rhs to have \"compatible\" scalar types.\n\n// It is tempting to always allow mixing different types but remember that this is often impossible in the vectorized paths.\n\n// So allowing mixing different types gives very unexpected errors when enabling vectorization, when the user tries to\n\n// add together a float matrix and a double matrix.\n\n#define EIGEN_CHECK_BINARY_COMPATIBILIY(BINOP,LHS,RHS) \\\n\n EIGEN_STATIC_ASSERT((Eigen::internal::has_ReturnType<ScalarBinaryOpTraits<LHS, RHS,BINOP> >::value), \\\n\n YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY)\n\n \n\n} // end namespace Eigen\n\n\n\n#endif // EIGEN_XPRHELPER_H\n","file_path":"src/Eigen/src/Core/util/XprHelper.h","rank":25,"score":106200.68600682903},{"content":"inline typename internal::traits<Derived>::Scalar MatrixBase<Derived>::determinant() const\n\n{\n\n eigen_assert(rows() == cols());\n\n typedef typename internal::nested_eval<Derived,Base::RowsAtCompileTime>::type Nested;\n\n return internal::determinant_impl<typename internal::remove_all<Nested>::type>::run(derived());\n","file_path":"src/Eigen/src/LU/Determinant.h","rank":26,"score":106185.4804657049},{"content":" EIGEN_DEVICE_FUNC Index rows(void) const {return m_rows;}\n","file_path":"src/Eigen/src/Core/DenseStorage.h","rank":27,"score":105105.70210982021},{"content":"EIGEN_DEVICE_FUNC inline Eigen::Index DenseBase<Derived>::count() const\n","file_path":"src/Eigen/src/Core/BooleanRedux.h","rank":28,"score":105105.70210982021},{"content":" static EIGEN_DEVICE_FUNC\n","file_path":"src/Eigen/src/Core/ProductEvaluators.h","rank":29,"score":105086.8542164767},{"content":" EIGEN_DEVICE_FUNC void swap(DenseStorage& other) {\n","file_path":"src/Eigen/src/Core/DenseStorage.h","rank":30,"score":105086.8542164767},{"content":" EIGEN_DEVICE_FUNC\n","file_path":"src/Eigen/src/Householder/HouseholderSequence.h","rank":31,"score":105053.71322178084},{"content":" inline const CompleteOrthogonalDecomposition<PlainObject> completeOrthogonalDecomposition() const;\n","file_path":"src/Eigen/src/Core/MatrixBase.h","rank":32,"score":105047.49962595612},{"content":"EIGEN_DEVICE_FUNC inline bool DenseBase<Derived>::any() const\n\n{\n\n typedef internal::evaluator<Derived> Evaluator;\n\n enum {\n\n unroll = SizeAtCompileTime != Dynamic\n\n && SizeAtCompileTime * (Evaluator::CoeffReadCost + NumTraits<Scalar>::AddCost) <= EIGEN_UNROLLING_LIMIT\n\n };\n\n Evaluator evaluator(derived());\n\n if(unroll)\n\n return internal::any_unroller<Evaluator, unroll ? int(SizeAtCompileTime) : Dynamic, internal::traits<Derived>::RowsAtCompileTime>::run(evaluator);\n\n else\n\n {\n\n for(Index j = 0; j < cols(); ++j)\n\n for(Index i = 0; i < rows(); ++i)\n\n if (evaluator.coeff(i, j)) return true;\n\n return false;\n\n }\n","file_path":"src/Eigen/src/Core/BooleanRedux.h","rank":33,"score":105047.49962595612},{"content":" EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE\n\n const PacketType packet(Index index) const\n\n {\n\n const Index row = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? 0 : index;\n\n const Index col = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? index : 0;\n\n return packet<LoadMode,PacketType>(row,col);\n","file_path":"src/Eigen/src/Core/ProductEvaluators.h","rank":34,"score":105047.49962595612},{"content":"inline const Inverse<Derived> MatrixBase<Derived>::inverse() const\n\n{\n\n EIGEN_STATIC_ASSERT(!NumTraits<Scalar>::IsInteger,THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES)\n\n eigen_assert(rows() == cols());\n\n return Inverse<Derived>(derived());\n","file_path":"src/Eigen/src/LU/InverseImpl.h","rank":35,"score":105047.49962595612},{"content":" EIGEN_DEVICE_FUNC Index cols() const {return m_cols;}\n","file_path":"src/Eigen/src/Core/DenseStorage.h","rank":36,"score":105047.49962595612},{"content":" const Index rank = m_cpqr.rank();\n","file_path":"src/Eigen/src/QR/CompleteOrthogonalDecomposition.h","rank":37,"score":104156.12186127497},{"content":"class BlockImpl<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true,Sparse>\n\n : public internal::sparse_matrix_block_impl<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols>\n\n{\n\npublic:\n\n typedef _StorageIndex StorageIndex;\n\n typedef SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType;\n\n typedef internal::sparse_matrix_block_impl<SparseMatrixType,BlockRows,BlockCols> Base;\n\n inline BlockImpl(SparseMatrixType& xpr, Index i)\n\n : Base(xpr, i)\n\n {}\n\n\n\n inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)\n\n : Base(xpr, startRow, startCol, blockRows, blockCols)\n\n {}\n\n\n\n using Base::operator=;\n\n};\n\n\n\ntemplate<typename _Scalar, int _Options, typename _StorageIndex, int BlockRows, int BlockCols>\n","file_path":"src/Eigen/src/SparseCore/SparseBlock.h","rank":38,"score":104000.21363159583},{"content":"EIGEN_DEVICE_FUNC inline void\n","file_path":"src/Eigen/src/Core/arch/AVX/Complex.h","rank":39,"score":103996.2921142464},{"content":"EIGEN_DEVICE_FUNC inline void\n","file_path":"src/Eigen/src/Core/arch/AVX512/Complex.h","rank":40,"score":103996.2921142464},{"content":"EIGEN_STRONG_INLINE void ptranspose(PacketBlock<Packet1cd, 2>& kernel) {\n","file_path":"src/Eigen/src/Core/arch/MSA/Complex.h","rank":41,"score":103996.2921142464},{"content":"EIGEN_DEVICE_FUNC inline void\n","file_path":"src/Eigen/src/Core/arch/SSE/Complex.h","rank":42,"score":103996.2921142464},{"content":"EIGEN_DEVICE_FUNC inline void ptranspose(PacketBlock<Packet1cf, 1>& /*kernel*/) {}\n","file_path":"src/Eigen/src/Core/arch/NEON/Complex.h","rank":43,"score":103996.2921142464},{"content":" EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC\n\n PacketType packet(Index idx) const\n\n {\n\n enum { PacketSize = internal::unpacket_traits<PacketType>::size };\n\n typedef Block<const ArgTypeNestedCleaned,\n\n Direction==Vertical ? int(ArgType::RowsAtCompileTime) : int(PacketSize),\n\n Direction==Vertical ? int(PacketSize) : int(ArgType::ColsAtCompileTime),\n\n true /* InnerPanel */> PanelType;\n\n \n\n PanelType panel(m_arg,\n\n Direction==Vertical ? 0 : idx,\n\n Direction==Vertical ? idx : 0,\n\n Direction==Vertical ? m_arg.rows() : Index(PacketSize),\n\n Direction==Vertical ? Index(PacketSize) : m_arg.cols());\n\n\n\n // FIXME\n\n // See bug 1612, currently if PacketSize==1 (i.e. complex<double> with 128bits registers) then the storage-order of panel get reversed\n\n // and methods like packetByOuterInner do not make sense anymore in this context.\n\n // So let's just by pass \"vectorization\" in this case:\n\n if(PacketSize==1)\n\n return internal::pset1<PacketType>(coeff(idx));\n\n \n\n typedef typename internal::redux_evaluator<PanelType> PanelEvaluator;\n\n PanelEvaluator panel_eval(panel);\n\n typedef typename MemberOp::BinaryOp BinaryOp;\n\n PacketType p = internal::packetwise_redux_impl<BinaryOp,PanelEvaluator>::template run<PacketType>(panel_eval,m_functor.binaryFunc(),m_arg.outerSize());\n\n return p;\n","file_path":"src/Eigen/src/Core/PartialReduxEvaluator.h","rank":44,"score":103957.29608584214},{"content":" EIGEN_STRONG_INLINE Packet2cd pmul(const Packet2cd& a, const Packet2cd& b) const\n\n {\n\n return pconj(internal::pmul(a, b));\n","file_path":"src/Eigen/src/Core/arch/AVX/Complex.h","rank":45,"score":103957.29608584214},{"content":" EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const\n","file_path":"src/Eigen/src/Core/arch/NEON/Complex.h","rank":46,"score":103957.29608584214},{"content":" EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const {\n\n return internal::pmul(pconj(a), b);\n","file_path":"src/Eigen/src/Core/arch/MSA/Complex.h","rank":47,"score":103957.29608584214},{"content":" // Merging models\n\n void merge_average(const MatrixFactorizationModel& w);\n\n void merge_weighted(size_t my_degree, const DegreesAndModels& models);\n\n\n\n void item_merge_column(Sparse& Y, const Sparse& Other);\n\n void user_merge_column(Sparse& X, const Sparse& Other);\n\n\n\n bool init_item(int item, const Sparse& column);\n\n bool init_user(int user, const Sparse& column);\n\n void prep_toshare();\n\n void make_compressed();\n\n size_t estimate_serial_size() const;\n\n\n\n private:\n\n Sparse zero_embedding();\n\n std::set<int> metropolis_hastings(size_t my_degree,\n\n const DegreesAndModels& models,\n\n Sparse& factors, Sparse& biases,\n\n bool isusers);\n\n std::set<int> metropolis_hastings_users(size_t my_degree,\n","file_path":"src/machine_learning/matrix_factorization.h","rank":55,"score":66.6961087593988},{"content":"#include \"mf_weights.h\"\n\n\n\n#include <iostream>\n\n\n\n//------------------------------------------------------------------------------\n\n// MWeights\n\n//------------------------------------------------------------------------------\n\nbool MFWeights::has(int i, const Sparse &m) const {\n\n return i < m.outerSize() && Sparse::InnerIterator(m, i);\n\n // column exists (i.e., not all 0)\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nEmbedding MFWeights::get_factors(int i, const Sparse &factors,\n\n const Sparse &bias) const {\n\n std::vector<double> ret;\n\n const auto &v = factors.col(i);\n\n int n = v.rows();\n\n for (int i = 0; i < n; ++i) ret.emplace_back(v.coeff(i, 0));\n\n return Embedding(bias.coeff(0, i), ret);\n","file_path":"src/machine_learning/mf_weights.cpp","rank":60,"score":57.92220849350536},{"content":" const DegreesAndModels& models);\n\n std::set<int> metropolis_hastings_items(size_t my_degree,\n\n const DegreesAndModels& models);\n\n\n\n std::pair<double, Sparse> combine_neighbors(bool isuser, int index,\n\n const DegreesAndModels& models);\n\n void combine_neighbors_embeddings(bool isuser,\n\n const DegreesAndModels& models,\n\n std::set<int>& exclude_list);\n\n void combine_neighbors_users(const DegreesAndModels& models,\n\n std::set<int>& exclude_list);\n\n void combine_neighbors_items(const DegreesAndModels& models,\n\n std::set<int>& exclude_list);\n\n\n\n int rank_;\n\n MFWeights weights_;\n\n friend class MFSGD;\n\n};\n\n\n","file_path":"src/machine_learning/matrix_factorization.h","rank":62,"score":54.99399410587737},{"content":"}\n\n\n\n//------------------------------------------------------------------------------\n\nbool MFWeights::has_item(int item) const { return has(item, items); }\n\n\n\n//------------------------------------------------------------------------------\n\nbool MFWeights::has_user(int user) const { return has(user, users); }\n\n\n\n//------------------------------------------------------------------------------\n\nEmbedding MFWeights::get_item_factors(int item) const {\n\n return get_factors(item, items, item_biases);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nEmbedding MFWeights::get_user_factors(int user) const {\n\n return get_factors(user, users, user_biases);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\ndouble MFWeights::predict(int user, int item) const {\n","file_path":"src/machine_learning/mf_weights.cpp","rank":64,"score":48.74051705042084},{"content":" for(const auto& x: *node_data_) {\n\n if(train_indices.find(i) != train_indices.end()) {\n\n int user = x.first.first, item = x.first.second;\n\n assert(x.second >= 0 && x.second <= 10);\n\n\n\n model_.find_space(user, item, hyper_.init_column_,\n\n hyper_.init_bias);\n\n total_err += MFSGD::train(user, item, x.second);\n\n ++count;\n\n }\n\n i++;\n\n if(count == num_local_steps)\n\n break;\n\n }\n\n\n\n return std::make_pair(total_err, count);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\ndouble MFSGDDecentralized::test(const TripletVector<uint8_t> &testset) {\n","file_path":"src/machine_learning/mf_decentralized.cpp","rank":67,"score":46.27923089487722},{"content":"#include \"mf_centralized.h\"\n\n\n\n#include <utils/time_probe.h>\n\n\n\n#include <future>\n\n#include <iostream>\n\n#include <mutex>\n\n//------------------------------------------------------------------------------\n\nMatrixFactorizationModel MFSGD::trainX(const Ratings &ratings, uint8_t lowscore,\n\n uint8_t highscore, int matrix_rank,\n\n double learning, double regularization,\n\n int iterations,\n\n const TripletVector<uint8_t> &test) {\n\n double init_bias = lowscore,\n\n init_factor = sqrt(double(highscore - lowscore) / matrix_rank);\n\n HyperMFSGD hyper(matrix_rank, learning, regularization, init_bias,\n\n init_factor);\n\n MFSGDCentralized trainer(ratings, hyper);\n\n trainer.init();\n\n std::cout << \"epoch;trainerr;testerr\\n\";\n","file_path":"src/machine_learning/mf_centralized.cpp","rank":69,"score":42.34981853768643},{"content":" if (user < 0 || item < 0) {\n\n std::cerr << \"Invalid index (\" << user << \",\" << item << \")\"\n\n << std::endl;\n\n abort();\n\n }\n\n assert(users.rows() == items.rows());\n\n return Sparse(users.col(user).transpose() * items.col(item)).coeff(0, 0) +\n\n user_biases.coeff(0, user) + item_biases.coeff(0, item);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nsize_t MFWeights::estimate_serial_size() const {\n\n return serial_size(users) + serial_size(items) + serial_size(user_biases) +\n\n serial_size(item_biases);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nvoid MFWeights::serialize_with_size(const Sparse &matrix,\n\n std::vector<uint8_t> &out) const {\n\n size_t index = out.size();\n","file_path":"src/machine_learning/mf_weights.cpp","rank":70,"score":41.56572479868186},{"content":" for (const auto &t : testset) {\n\n model_.init_user(t.row(), hyper_.init_column_);\n\n model_.init_item(t.col(), hyper_.init_column_); \n\n }\n\n return model_.rmse(testset);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nsize_t MFSGDDecentralized::add_raw_ratings(SharingRatings sr) {\n\n size_t count = 0;\n\n if (sr) {\n\n for(auto it = sr->begin(); it != sr->end(); it++) {\n\n auto res = node_data_->insert(std::make_pair(std::make_pair(it->row(), it->col()), it->value()));\n\n if(res.second)\n\n count++;\n\n }\n\n }\n\n return count;\n\n}\n\n\n","file_path":"src/machine_learning/mf_decentralized.cpp","rank":71,"score":40.78036660339293},{"content":" model_.find_space(user, item, hyper_.init_column_, hyper_.init_bias);\n\n model_.init_item(item, hyper_.init_column_);\n\n model_.init_user(user, hyper_.init_column_);\n\n });\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nstd::pair<double, size_t> MFSGDCentralized::train() {\n\n std::vector<std::future<std::pair<double, size_t>>> results;\n\n sparse_matrix_outer_iterate(ratings_, [&](Ratings::InnerIterator it,\n\n int item) {\n\n auto shared =\n\n std::make_shared<std::packaged_task<std::pair<double, size_t>()>>(\n\n std::bind(&MFSGDCentralized::parallel_train, this, it, item));\n\n results.emplace_back(shared->get_future());\n\n pool_.add_task([shared]() { (*shared)(); });\n\n });\n\n\n\n double total_err = 0;\n\n size_t count = 0;\n","file_path":"src/machine_learning/mf_centralized.cpp","rank":72,"score":40.17324702762591},{"content":" << (sum_train_err / count) << \";\" << (sum_test_err / count) << \";\"\n\n << (sum_items / count) << \";\" << (sum_time / count) << \";\"\n\n << (sumbout / count) << \";\" << (sumbin / count) << \";\" << count\n\n << std::endl;\n\n // std::cout << epoch_stats_.summary() << std::endl;\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nvoid MFCoordinator::run(uint8_t lowscore, uint8_t highscore, int matrix_rank,\n\n double learning, double regularization, int iterations,\n\n bool dpsgd, bool randgraph, unsigned local,\n\n size_t steps_per_iteration, unsigned share_howmany) {\n\n Graph g = randgraph ? random_graph_erdos_renyi(nodes_.size())\n\n : random_graph_small_world(nodes_.size());\n\n make_connected(g);\n\n unsigned edges = establish_relations(g);\n\n //std::cout << (randgraph ? \"Erdos-Renyi\" : \"Small World\")\n\n // << \" Mean degree: \" << double(edges) / nodes_.size() << std::endl;\n\n\n\n double init_bias = lowscore,\n","file_path":"src/machine_learning/mf_coordinator.cpp","rank":73,"score":38.247336953268125},{"content":"\n\n DPSGDModelPtr toshare = std::make_shared<DPSGDShareableModel>(\n\n epoch, modelshare_? trainer_->model(): MatrixFactorizationModel(-2), // -2 for no model sharing\n\n rawdata, neighbours_.size());\n\n\n\n size_t ret = 0;\n\n for (auto &peer : neighbours_) {\n\n ret += communication_->send(userrank_, peer, toshare);\n\n }\n\n return ret;\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nvoid DPSGDMerger::merge(int epoch) {\n\n std::unique_lock<std::mutex> lock(recv_mtx_);\n\n std::vector<DPSGDEntry> models;\n\n size_t count = 0;\n\n for (auto &m : received_models_[epoch]) {\n\n unsigned src = m.first;\n\n ShareableModelPtr shared = m.second;\n","file_path":"src/model_merging/dpsgd.cpp","rank":74,"score":36.082109268346166},{"content":"#include <csv.h>\n\n#include <ratings_parser.h>\n\n#include <stringtools.h>\n\n\n\n#include <Eigen/Sparse>\n\n#include <fstream>\n\n#include <iostream>\n\n#include <set>\n\nusing Eigen::Triplet;\n\nstatic std::set<int> users;\n\n//------------------------------------------------------------------------------\n\nbool csvitem_tovector(TripletVector<uint8_t>& v,\n\n const std::vector<std::string>& item,\n\n std::pair<int, int>& dim, int limit, int filter_divisor,\n\n int filter_modulo) {\n\n try {\n\n Triplet<uint8_t> t(std::stoul(item[0]) - 1, std::stoul(item[1]) - 1,\n\n int(std::stof(item[2]) * 2));\n\n if (limit > 0) {\n\n users.insert(t.row());\n","file_path":"src/ratings_parser.cpp","rank":75,"score":35.521761237265736},{"content":"\n\n return ret;\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nvoid RandomModelWalkMerger::merge(int epoch) {\n\n std::unique_lock<std::mutex> lock(recv_mtx_);\n\n\n\n size_t count = 0;\n\n for (auto &model : received_models_[epoch]) {\n\n unsigned src = model.first;\n\n ShareableModelPtr shared = model.second;\n\n if (shared->model_.rank() != -1) {\n\n if (modelshare_) { // or shared->model_.rank() != -2\n\n trainer_->mutable_model().merge_average(shared->model_);\n\n }\n\n count += trainer_->add_raw_ratings(shared->rawdata);\n\n } // else it's a dummy. Used for synchronization\n\n recvdfrom_.erase(std::make_pair(src, shared->epoch));\n\n }\n\n\n\n received_models_[epoch].clear();\n\n}\n\n\n\n//------------------------------------------------------------------------------\n","file_path":"src/model_merging/random_model_walk.cpp","rank":76,"score":35.240072342314406},{"content":" return MFSGD::trainX(ratings, 2, 10, 20, 0.01, 0.01, 10);\n\n}\n\n*/\n\n\n\n//------------------------------------------------------------------------------\n\nvoid run(Ratings &ratings, TripletVector<uint8_t> &test) {\n\n /*\n\n MatrixFactorizationModel model = train(ratings);\n\n printf(\"RMSE = %lf\\n\", test_model(test, model));\n\n */\n\n ThreadPool tp(std::thread::hardware_concurrency());\n\n std::vector<int> iters = {201};\n\n std::vector<int> ranks = {10};\n\n std::vector<double> lambdas = {0.1};\n\n std::vector<double> etas = {0.005};\n\n std::vector<std::pair<string, std::future<MatrixFactorizationModel>>>\n\n results;\n\n for (int iter : iters) {\n\n for (int rank : ranks) {\n\n for (double eta : etas) {\n","file_path":"src/local_training.cpp","rank":78,"score":33.70272351225419},{"content":" uint8_t *nptr = reinterpret_cast<uint8_t *>(&index);\n\n out.insert(out.end(), nptr, nptr + sizeof(index)); // placeholder\n\n matrix_to_triplets_append(matrix, out);\n\n assert(*reinterpret_cast<size_t *>(&out[index]) == index); // check value\n\n size_t tmp = out.size() - index - sizeof(size_t);\n\n memcpy(&out[index], &tmp, sizeof(tmp)); // fill size in B\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nvoid MFWeights::serialize_append(std::vector<uint8_t> &out) const {\n\n serialize_with_size(users, out);\n\n serialize_with_size(items, out);\n\n serialize_with_size(user_biases, out);\n\n serialize_with_size(item_biases, out);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nsize_t MFWeights::deserialize_matrix(Sparse &matrix,\n\n const std::vector<uint8_t> &data,\n\n size_t offset) {\n","file_path":"src/machine_learning/mf_weights.cpp","rank":79,"score":32.92676166202218},{"content":"#include \"mf_decentralized.h\"\n\n#include <random>\n\n#include <iostream>\n\n//------------------------------------------------------------------------------\n\n// MFSGDDecentralized\n\n//------------------------------------------------------------------------------\n\nMFSGDDecentralized::MFSGDDecentralized(unsigned node_index,\n\n std::shared_ptr<DataStore> node_data,\n\n HyperMFSGD h,\n\n size_t steps_per_iteration)\n\n : MFSGD(h), node_index_(node_index), node_data_(node_data), steps_per_iteration_(steps_per_iteration) {}\n\n//------------------------------------------------------------------------------\n\nMatrixFactorizationModel& MFSGDDecentralized::mutable_model() { return model_; }\n\n\n\n//------------------------------------------------------------------------------\n\nvoid MFSGDDecentralized::make_compressed() {\n\n model_.make_compressed();\n\n}\n\n\n\n//------------------------------------------------------------------------------\n","file_path":"src/machine_learning/mf_decentralized.cpp","rank":80,"score":32.71588008301312},{"content":" for (; it; ++it) {\n\n ulock = get_user_lock(it.row());\n\n if (!ulock) {\n\n std::cerr << \"Error getting user \" << it.row() << \" lock\"\n\n << std::endl;\n\n abort();\n\n } else {\n\n std::lock_guard<std::mutex> lock_user(*ulock);\n\n err += MFSGD::train(it.row(), item, it.value());\n\n ++count;\n\n }\n\n }\n\n }\n\n return std::make_pair(err, count);\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nvoid MFSGDCentralized::init() {\n\n sparse_matrix_iterate(ratings_, [&](Ratings::InnerIterator it) {\n\n int user = it.row(), item = it.col();\n","file_path":"src/machine_learning/mf_centralized.cpp","rank":81,"score":32.55739474957963},{"content":" for (double lambda : lambdas) {\n\n auto shared = std::make_shared<\n\n std::packaged_task<MatrixFactorizationModel()>>(\n\n std::bind(&MFSGD::trainX, ratings, 2, 10, rank, eta,\n\n lambda, iter, test));\n\n std::stringstream ss;\n\n ss << \"r=\" << rank << \" n=\" << eta << \" l=\" << lambda\n\n << \" n=\" << iter;\n\n results.emplace_back(\n\n std::make_pair(ss.str(), shared->get_future()));\n\n tp.add_task([shared]() { (*shared)(); });\n\n }\n\n }\n\n }\n\n }\n\n\n\n bool once = false;\n\n for (auto &r : results) {\n\n r.second.wait();\n\n MatrixFactorizationModel model = r.second.get();\n","file_path":"src/local_training.cpp","rank":82,"score":32.51357986512679},{"content":"#include \"data_splitter.h\"\n\n#include <csv.h>\n\n#include <ratings_parser.h>\n\n#include <set>\n\n\n\nusing std::string;\n\n//------------------------------------------------------------------------------\n\nvoid split_vectors(int from, int to, TripletVector<uint8_t> &src,\n\n TripletVector<uint8_t> &train,\n\n TripletVector<uint8_t> &test) {\n\n float tmult = 0.7;\n\n int count = to - from;\n\n int tcount = tmult * count;\n\n std::set<int> indexes;\n\n while (indexes.size() != tcount) indexes.insert(from + rand() % count);\n\n for (int i = from; i < to; ++i) {\n\n if (indexes.find(i) == indexes.end())\n\n test.push_back(src[i]);\n\n else\n\n train.push_back(src[i]);\n","file_path":"src/data_splitter.cpp","rank":83,"score":31.49121813181848},{"content":" typedef typename ReturnType<internal::member_all>::Type AllReturnType;\n\n typedef typename ReturnType<internal::member_any>::Type AnyReturnType;\n\n typedef PartialReduxExpr<ExpressionType, internal::member_count<Index,Scalar>, Direction> CountReturnType;\n\n typedef typename ReturnType<internal::member_prod>::Type ProdReturnType;\n\n typedef Reverse<const ExpressionType, Direction> ConstReverseReturnType;\n\n typedef Reverse<ExpressionType, Direction> ReverseReturnType;\n\n\n\n template<int p> struct LpNormReturnType {\n\n typedef PartialReduxExpr<ExpressionType, internal::member_lpnorm<p,RealScalar,Scalar>,Direction> Type;\n\n };\n\n\n\n /** \\returns a row (or column) vector expression of the smallest coefficient\n\n * of each column (or row) of the referenced expression.\n\n *\n\n * \\warning the size along the reduction direction must be strictly positive,\n\n * otherwise an assertion is triggered.\n\n * \n\n * \\warning the result is undefined if \\c *this contains NaN.\n\n *\n\n * Example: \\include PartialRedux_minCoeff.cpp\n","file_path":"src/Eigen/src/Core/VectorwiseOp.h","rank":84,"score":29.99203547866953},{"content":"\n\ntemplate<typename MatrixType>\n\ntemplate<typename BDerived,typename XDerived>\n\nbool KLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const\n\n{\n\n Index rhsCols = b.cols();\n\n EIGEN_STATIC_ASSERT((XDerived::Flags&RowMajorBit)==0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);\n\n eigen_assert(m_factorizationIsOk && \"The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()\");\n\n\n\n x = b;\n\n int info = klu_solve(m_symbolic, m_numeric, b.rows(), rhsCols, x.const_cast_derived().data(), const_cast<klu_common*>(&m_common), Scalar());\n\n\n\n m_info = info!=0 ? Success : NumericalIssue;\n\n return true;\n\n}\n\n\n\n} // end namespace Eigen\n\n\n\n#endif // EIGEN_KLUSUPPORT_H\n","file_path":"src/Eigen/src/KLUSupport/KLUSupport.h","rank":85,"score":29.94311282530998},{"content":"\n\n if(modelshare_) {\n\n auto &local_model = trainer_->mutable_model();\n\n local_model.merge_weighted(neighbours_.size(), models);\n\n }\n\n\n\n received_models_[epoch].clear();\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n// DPSGDShareableModel\n\n//------------------------------------------------------------------------------\n\nDPSGDShareableModel::DPSGDShareableModel(int e,\n\n const MatrixFactorizationModel &m,\n\n SharingRatings data, size_t degree)\n\n : ShareableModel(e, DPSGD, m, data), degree_(degree) {\n\n // puts user embedding into its place\n\n //model_.prep_toshare();\n\n // call not needed now, training occurs at original place\n\n}\n","file_path":"src/model_merging/dpsgd.cpp","rank":86,"score":29.91790691919642},{"content":" // If the factorization failed, minor is the column at which it did. On success minor == n.\n\n this->m_info = (m_cholmodFactor->minor == m_cholmodFactor->n ? Success : NumericalIssue);\n\n m_factorizationIsOk = true;\n\n }\n\n\n\n /** Returns a reference to the Cholmod's configuration structure to get a full control over the performed operations.\n\n * See the Cholmod user guide for details. */\n\n cholmod_common& cholmod() { return m_cholmod; }\n\n\n\n #ifndef EIGEN_PARSED_BY_DOXYGEN\n\n /** \\internal */\n\n template<typename Rhs,typename Dest>\n\n void _solve_impl(const MatrixBase<Rhs> &b, MatrixBase<Dest> &dest) const\n\n {\n\n eigen_assert(m_factorizationIsOk && \"The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()\");\n\n const Index size = m_cholmodFactor->n;\n\n EIGEN_UNUSED_VARIABLE(size);\n\n eigen_assert(size==b.rows());\n\n\n\n // Cholmod needs column-major storage without inner-stride, which corresponds to the default behavior of Ref.\n","file_path":"src/Eigen/src/CholmodSupport/CholmodSupport.h","rank":87,"score":29.873523821141397},{"content":" typedef Replicate<ExpressionType,(isVertical?Dynamic:1),(isHorizontal?Dynamic:1)> ReplicateReturnType;\n\n EIGEN_DEVICE_FUNC\n\n const ReplicateReturnType replicate(Index factor) const;\n\n\n\n /**\n\n * \\return an expression of the replication of each column (or row) of \\c *this\n\n *\n\n * Example: \\include DirectionWise_replicate.cpp\n\n * Output: \\verbinclude DirectionWise_replicate.out\n\n *\n\n * \\sa VectorwiseOp::replicate(Index), DenseBase::replicate(), class Replicate\n\n */\n\n // NOTE implemented here because of sunstudio's compilation errors\n\n // isVertical*Factor+isHorizontal instead of (isVertical?Factor:1) to handle CUDA bug with ternary operator\n\n template<int Factor> const Replicate<ExpressionType,isVertical*Factor+isHorizontal,isHorizontal*Factor+isVertical>\n\n EIGEN_DEVICE_FUNC\n\n replicate(Index factor = Factor) const\n\n {\n\n return Replicate<ExpressionType,(isVertical?Factor:1),(isHorizontal?Factor:1)>\n\n (_expression(),isVertical?factor:1,isHorizontal?factor:1);\n","file_path":"src/Eigen/src/Core/VectorwiseOp.h","rank":88,"score":29.532755779828108},{"content":"//------------------------------------------------------------------------------\n\nvoid MFSGDDecentralized::extract_raw_ratings(unsigned userrank,\n\n unsigned howmany,\n\n TripletVector<uint8_t> &dst) {\n\n std::set<unsigned> sharing_indices;\n\n std::default_random_engine generator;\n\n std::uniform_int_distribution<int> distribution(0, node_data_->size()-1);\n\n \n\n howmany = std::min(howmany, (unsigned) node_data_->size());\n\n\n\n while(sharing_indices.size() < howmany) {\n\n sharing_indices.insert(distribution(generator));\n\n }\n\n\n\n int i = 0, count = 0;\n\n for(const auto& x: *node_data_) {\n\n if(sharing_indices.find(i) != sharing_indices.end()) {\n\n int user = x.first.first, item = x.first.second;\n\n assert(x.second >= 0 && x.second <= 10);\n\n dst.emplace_back(user, item, x.second);\n","file_path":"src/machine_learning/mf_decentralized.cpp","rank":89,"score":29.21144611463507},{"content":" * of each column (or row) of the referenced expression.\n\n *\n\n * Example: \\include PartialRedux_sum.cpp\n\n * Output: \\verbinclude PartialRedux_sum.out\n\n *\n\n * \\sa DenseBase::sum() */\n\n EIGEN_DEVICE_FUNC\n\n const SumReturnType sum() const\n\n { return SumReturnType(_expression()); }\n\n\n\n /** \\returns a row (or column) vector expression of the mean\n\n * of each column (or row) of the referenced expression.\n\n *\n\n * \\sa DenseBase::mean() */\n\n EIGEN_DEVICE_FUNC\n\n const MeanReturnType mean() const\n\n { return sum() / Scalar(Direction==Vertical?m_matrix.rows():m_matrix.cols()); }\n\n\n\n /** \\returns a row (or column) vector expression representing\n\n * whether \\b all coefficients of each respective column (or row) are \\c true.\n","file_path":"src/Eigen/src/Core/VectorwiseOp.h","rank":90,"score":28.8175308950414},{"content":" {\n\n m_factorizationIsOk = true;\n\n m_info = Success;\n\n }\n\n } while(m_info!=Success);\n\n}\n\n\n\ntemplate<typename Scalar, int _UpLo, typename OrderingType>\n\ninline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol)\n\n{\n\n if (jk < colPtr(col+1) )\n\n {\n\n Index p = colPtr(col+1) - jk;\n\n Index minpos; \n\n rowIdx.segment(jk,p).minCoeff(&minpos);\n\n minpos += jk;\n\n if (rowIdx(minpos) != rowIdx(jk))\n\n {\n\n //Swap\n\n std::swap(rowIdx(jk),rowIdx(minpos));\n","file_path":"src/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h","rank":92,"score":28.332726895576602},{"content":" */\n\n Array<StorageIndex,IPARM_SIZE,1>& iparm()\n\n {\n\n return m_iparm; \n\n }\n\n \n\n /** Return a reference to a particular index parameter of the IPARM vector \n\n * \\sa iparm()\n\n */\n\n \n\n int& iparm(int idxparam)\n\n {\n\n return m_iparm(idxparam);\n\n }\n\n \n\n /** Returns a reference to the double vector DPARM of PaStiX parameters \n\n * The statistics related to the different phases of factorization and solve are saved here as well\n\n * \\sa analyzePattern() factorize()\n\n */\n\n Array<double,DPARM_SIZE,1>& dparm()\n","file_path":"src/Eigen/src/PaStiXSupport/PaStiXSupport.h","rank":93,"score":28.324687013450983},{"content":" std::pair<int, int> dim = read_and_split(fname, train, test, cap);\n\n if (dim.first == 0 || dim.second == 0) return false;\n\n\n\n int num_users_per_node = dim.first / num_nodes,\n\n remaining_users = dim.first % num_nodes;\n\n std::vector<int> users_per_node(num_nodes, num_users_per_node);\n\n if (remaining_users > 0) {\n\n do {\n\n users_per_node[remaining_users]++;\n\n } while (--remaining_users);\n\n }\n\n\n\n size_t train_count = 0, test_count = 0; // for later validation\n\n\n\n int i = 0, // counter for train data\n\n j = 0, // counter for test data\n\n node_index = 0;\n\n while (node_index < num_nodes) {\n\n // create training data\n\n auto node_train_data = std::make_shared<DataStore>();\n","file_path":"src/local_decentralized_training.cpp","rank":94,"score":28.322822374942344},{"content":" results.emplace_back(std::make_pair(n.rank(), shared->get_future()));\n\n tp.add_task([shared]() { (*shared)(); });\n\n }\n\n\n\n double sum_train_err = 0, sum_test_err = 0, sum_time = 0, sum_items = 0,\n\n sumbout = 0, sumbin = 0;\n\n unsigned count = 0;\n\n for (auto &kv : results) {\n\n kv.second.wait(); // barrier\n\n auto retval = kv.second.get();\n\n sum_train_err += retval.train_err;\n\n sum_items += retval.train_count;\n\n sum_test_err += retval.test_err;\n\n sum_time += retval.duration;\n\n sumbout += retval.bytes_out;\n\n sumbin += retval.bytes_in;\n\n ++count;\n\n }\n\n epoch_stats_.stop();\n\n std::cout << epoch << \";\" << absolute_timer_.stop() << \";\"\n","file_path":"src/machine_learning/mf_coordinator.cpp","rank":95,"score":28.26125428387969},{"content":" template<bool DoLDLT>\n\n void factorize_preordered(const CholMatrixType& a);\n\n\n\n void analyzePattern(const MatrixType& a, bool doLDLT)\n\n {\n\n eigen_assert(a.rows()==a.cols());\n\n Index size = a.cols();\n\n CholMatrixType tmp(size,size);\n\n ConstCholMatrixPtr pmat;\n\n ordering(a, pmat, tmp);\n\n analyzePattern_preordered(*pmat,doLDLT);\n\n }\n\n void analyzePattern_preordered(const CholMatrixType& a, bool doLDLT);\n\n \n\n void ordering(const MatrixType& a, ConstCholMatrixPtr &pmat, CholMatrixType& ap);\n\n\n\n /** keeps off-diagonal entries; drops diagonal entries */\n\n struct keep_diag {\n\n inline bool operator() (const Index& row, const Index& col, const Scalar&) const\n\n {\n","file_path":"src/Eigen/src/SparseCholesky/SimplicialCholesky.h","rank":96,"score":28.101176256852927},{"content":" * This expression can be assigned to a vector with entries of type \\c bool.\n\n *\n\n * \\sa DenseBase::all() */\n\n EIGEN_DEVICE_FUNC\n\n const AllReturnType all() const\n\n { return AllReturnType(_expression()); }\n\n\n\n /** \\returns a row (or column) vector expression representing\n\n * whether \\b at \\b least one coefficient of each respective column (or row) is \\c true.\n\n * This expression can be assigned to a vector with entries of type \\c bool.\n\n *\n\n * \\sa DenseBase::any() */\n\n EIGEN_DEVICE_FUNC\n\n const AnyReturnType any() const\n\n { return AnyReturnType(_expression()); }\n\n\n\n /** \\returns a row (or column) vector expression representing\n\n * the number of \\c true coefficients of each respective column (or row).\n\n * This expression can be assigned to a vector whose entries have the same type as is used to\n\n * index entries of the original matrix; for dense matrices, this is \\c std::ptrdiff_t .\n","file_path":"src/Eigen/src/Core/VectorwiseOp.h","rank":97,"score":28.03224608853849},{"content":" else dest = y.topRows(cols());\n\n \n\n m_info = Success;\n\n return true;\n\n }\n\n\n\n /** Sets the threshold that is used to determine linearly dependent columns during the factorization.\n\n *\n\n * In practice, if during the factorization the norm of the column that has to be eliminated is below\n\n * this threshold, then the entire column is treated as zero, and it is moved at the end.\n\n */\n\n void setPivotThreshold(const RealScalar& threshold)\n\n {\n\n m_useDefaultThreshold = false;\n\n m_threshold = threshold;\n\n }\n\n \n\n /** \\returns the solution X of \\f$ A X = B \\f$ using the current decomposition of A.\n\n *\n\n * \\sa compute()\n","file_path":"src/Eigen/src/SparseQR/SparseQR.h","rank":98,"score":27.808195815468125},{"content":" if (items[0].revents & ZMQ_POLLIN) {\n\n handle_backend();\n\n }\n\n if (items[1].revents & ZMQ_POLLIN) {\n\n handle_frontend();\n\n }\n\n }\n\n\n\n for (int i = 0; i < thread_count; ++i) {\n\n t[i]->join();\n\n delete t[i];\n\n }\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nvoid AsyncZmq::announce_completion(int rank, char t) {\n\n {\n\n std::unique_lock<std::mutex> lock(oqueue_mtx_);\n\n outqueue_.push(\n\n std::make_pair(rank, pack(t + std::string(\"so long\"), TEXT)));\n","file_path":"src/communication/async_zmq.cpp","rank":99,"score":27.758600235700627}],"string":"[\n {\n \"content\": \"class meta_sqrt<Y, InfX, SupX, true> { public: enum { ret = (SupX*SupX <= Y) ? SupX : InfX }; };\\n\\n\\n\\n\\n\\n/** \\\\internal Computes the least common multiple of two positive integer A and B\\n\\n * at compile-time. It implements a naive algorithm testing all multiples of A.\\n\\n * It thus works better if A>=B.\\n\\n */\\n\\ntemplate<int A, int B, int K=1, bool Done = ((A*K)%B)==0>\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/Meta.h\",\n \"rank\": 0,\n \"score\": 181519.79548809066\n },\n {\n \"content\": \"class MatrixFactorizationModel {\\n\\n public:\\n\\n typedef std::vector<DPSGDEntry> DegreesAndModels;\\n\\n\\n\\n MatrixFactorizationModel() = default;\\n\\n MatrixFactorizationModel(int rank);\\n\\n double predict(int user, int item) const;\\n\\n std::vector<int> recommend_user(int item, int how_many);\\n\\n std::vector<int> recommend_item(int user, int how_many);\\n\\n int rank() { return rank_; }\\n\\n const Sparse& user_features() { return weights_.users; }\\n\\n const Sparse& item_features() { return weights_.items; }\\n\\n double rmse(const TripletVector<uint8_t>& testset);\\n\\n void get_factors(int user, int item);\\n\\n\\n\\n void serialize_append(std::vector<uint8_t> &out) const;\\n\\n size_t deserialize(const std::vector<uint8_t> &data, size_t offset);\\n\\n void find_space(int user, int item, const Sparse& col = Sparse(),\\n\\n double b = -1);\\n\\n\\n\",\n \"file_path\": \"src/machine_learning/matrix_factorization.h\",\n \"rank\": 1,\n \"score\": 166525.93255033102\n },\n {\n \"content\": \"class MatrixFactorizationModel;\\n\",\n \"file_path\": \"src/model_merging/dpsgd_entry.h\",\n \"rank\": 2,\n \"score\": 166520.4204823774\n },\n {\n \"content\": \"struct is_convertible<const T,const T&> { enum { value = true }; };\\n\\n\\n\\n#endif\\n\\n\\n\\n/** \\\\internal Allows to enable/disable an overload\\n\\n * according to a compile time condition.\\n\\n */\\n\\ntemplate<bool Condition, typename T=void> struct enable_if;\\n\\n\\n\\ntemplate<typename T> struct enable_if<true,T>\\n\\n{ typedef T type; };\\n\\n\\n\\n#if defined(EIGEN_GPU_COMPILE_PHASE)\\n\\n#if !defined(__FLT_EPSILON__)\\n\\n#define __FLT_EPSILON__ FLT_EPSILON\\n\\n#define __DBL_EPSILON__ DBL_EPSILON\\n\\n#endif\\n\\n\\n\\nnamespace device {\\n\\n\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/Meta.h\",\n \"rank\": 3,\n \"score\": 165563.2227008175\n },\n {\n \"content\": \"class BlockImpl<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true,Sparse>\\n\\n : public internal::sparse_matrix_block_impl<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols>\\n\\n{\\n\\npublic:\\n\\n typedef _StorageIndex StorageIndex;\\n\\n typedef const SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType;\\n\\n typedef internal::sparse_matrix_block_impl<SparseMatrixType,BlockRows,BlockCols> Base;\\n\\n inline BlockImpl(SparseMatrixType& xpr, Index i)\\n\\n : Base(xpr, i)\\n\\n {}\\n\\n\\n\\n inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)\\n\\n : Base(xpr, startRow, startCol, blockRows, blockCols)\\n\\n {}\\n\\n\\n\\n using Base::operator=;\\n\\nprivate:\\n\\n template<typename Derived> BlockImpl(const SparseMatrixBase<Derived>& xpr, Index i);\\n\\n template<typename Derived> BlockImpl(const SparseMatrixBase<Derived>& xpr);\\n\\n};\\n\\n\\n\\n//----------\\n\\n\\n\\n/** Generic implementation of sparse Block expression.\\n\\n * Real-only.\\n\\n */\\n\\ntemplate<typename XprType, int BlockRows, int BlockCols, bool InnerPanel>\\n\",\n \"file_path\": \"src/Eigen/src/SparseCore/SparseBlock.h\",\n \"rank\": 4,\n \"score\": 161217.16643593376\n },\n {\n \"content\": \"struct unary_evaluator<Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true>, IteratorBased>\\n\\n : evaluator<SparseCompressedBase<Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> > >\\n\\n{\\n\\n typedef Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> XprType;\\n\\n typedef evaluator<SparseCompressedBase<XprType> > Base;\\n\\n explicit unary_evaluator(const XprType &xpr) : Base(xpr) {}\\n\\n};\\n\\n\\n\\n} // end namespace internal\\n\\n\\n\\n\\n\\n} // end namespace Eigen\\n\\n\\n\\n#endif // EIGEN_SPARSE_BLOCK_H\\n\",\n \"file_path\": \"src/Eigen/src/SparseCore/SparseBlock.h\",\n \"rank\": 5,\n \"score\": 154856.5955950414\n },\n {\n \"content\": \"struct bool_constant<true> : true_type {};\\n\\n\\n\\ntemplate<>\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/Meta.h\",\n \"rank\": 6,\n \"score\": 149700.23256709104\n },\n {\n \"content\": \"class const_blas_data_mapper : public blas_data_mapper<const Scalar, Index, StorageOrder> {\\n\\n public:\\n\\n EIGEN_ALWAYS_INLINE const_blas_data_mapper(const Scalar *data, Index stride) : blas_data_mapper<const Scalar, Index, StorageOrder>(data, stride) {}\\n\\n\\n\\n EIGEN_ALWAYS_INLINE const_blas_data_mapper<Scalar, Index, StorageOrder> getSubMapper(Index i, Index j) const {\\n\\n return const_blas_data_mapper<Scalar, Index, StorageOrder>(&(this->operator()(i, j)), this->m_stride);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n/* Helper class to analyze the factors of a Product expression.\\n\\n * In particular it allows to pop out operator-, scalar multiples,\\n\\n * and conjugate */\\n\\ntemplate<typename XprType> struct blas_traits\\n\\n{\\n\\n typedef typename traits<XprType>::Scalar Scalar;\\n\\n typedef const XprType& ExtractType;\\n\\n typedef XprType _ExtractType;\\n\\n enum {\\n\\n IsComplex = NumTraits<Scalar>::IsComplex,\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/BlasUtil.h\",\n \"rank\": 7,\n \"score\": 146704.30906553016\n },\n {\n \"content\": \"struct is_void : is_same<void, typename remove_const<T>::type> {};\\n\\n\\n\\n#if EIGEN_HAS_CXX11\\n\\ntemplate<> struct is_arithmetic<signed long long> { enum { value = true }; };\\n\\ntemplate<> struct is_arithmetic<unsigned long long> { enum { value = true }; };\\n\\nusing std::is_integral;\\n\\n#else\\n\\ntemplate<typename T> struct is_integral { enum { value = false }; };\\n\\ntemplate<> struct is_integral<bool> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<char> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<signed char> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<unsigned char> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<signed short> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<unsigned short> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<signed int> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<unsigned int> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<signed long> { enum { value = true }; };\\n\\ntemplate<> struct is_integral<unsigned long> { enum { value = true }; };\\n\\n#if EIGEN_COMP_MSVC\\n\\ntemplate<> struct is_integral<signed __int64> { enum { value = true }; };\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/Meta.h\",\n \"rank\": 8,\n \"score\": 134841.5823909178\n },\n {\n \"content\": \"struct inplace_transpose_selector<MatrixType,true,true> { // PacketSize x PacketSize\\n\\n static void run(MatrixType& m) {\\n\\n typedef typename MatrixType::Scalar Scalar;\\n\\n typedef typename internal::packet_traits<typename MatrixType::Scalar>::type Packet;\\n\\n const Index PacketSize = internal::packet_traits<Scalar>::size;\\n\\n const Index Alignment = internal::evaluator<MatrixType>::Alignment;\\n\\n PacketBlock<Packet> A;\\n\\n for (Index i=0; i<PacketSize; ++i)\\n\\n A.packet[i] = m.template packetByOuterInner<Alignment>(i,0);\\n\\n internal::ptranspose(A);\\n\\n for (Index i=0; i<PacketSize; ++i)\\n\\n m.template writePacket<Alignment>(m.rowIndexByOuterInner(i,0), m.colIndexByOuterInner(i,0), A.packet[i]);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<typename MatrixType,bool MatchPacketSize>\\n\",\n \"file_path\": \"src/Eigen/src/Core/Transpose.h\",\n \"rank\": 9,\n \"score\": 120145.61848764142\n },\n {\n \"content\": \"struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};\\n\\n\\n\\nNLOHMANN_JSON_HAS_HELPER(mapped_type);\\n\\nNLOHMANN_JSON_HAS_HELPER(key_type);\\n\\nNLOHMANN_JSON_HAS_HELPER(value_type);\\n\\nNLOHMANN_JSON_HAS_HELPER(iterator);\\n\\n\\n\\ntemplate<bool B, class RealType, class CompatibleObjectType>\\n\",\n \"file_path\": \"src/json/json.hpp\",\n \"rank\": 10,\n \"score\": 117139.37543565963\n },\n {\n \"content\": \"struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleObjectType,\\n\\n typename = void>\\n\",\n \"file_path\": \"src/json/json-17.hpp\",\n \"rank\": 11,\n \"score\": 117139.37543565963\n },\n {\n \"content\": \"struct nullary_wrapper<Scalar,NullaryOp,true,true,true>\\n\\n{\\n\\n template <typename IndexType>\\n\\n EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i, IndexType j) const {\\n\\n return nullary_wrapper<Scalar,NullaryOp,\\n\\n has_nullary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\\n\\n has_unary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\\n\\n has_binary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value>().operator()(op,i,j);\\n\\n }\\n\\n template <typename IndexType>\\n\\n EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i) const {\\n\\n return nullary_wrapper<Scalar,NullaryOp,\\n\\n has_nullary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\\n\\n has_unary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value,\\n\\n has_binary_operator<NullaryOp,nullary_wrapper_workaround_msvc<IndexType> >::value>().operator()(op,i);\\n\\n }\\n\\n\\n\\n template <typename T, typename IndexType>\\n\\n EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i, IndexType j) const {\\n\\n return nullary_wrapper<Scalar,NullaryOp,\\n\",\n \"file_path\": \"src/Eigen/src/Core/CoreEvaluators.h\",\n \"rank\": 12,\n \"score\": 116362.23632104407\n },\n {\n \"content\": \"struct has_none {int a[1];};\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/Meta.h\",\n \"rank\": 13,\n \"score\": 115519.14814585852\n },\n {\n \"content\": \"struct triangular_solver_unroller<Lhs,Rhs,Mode,LoopIndex,Size,true> {\\n\\n static void run(const Lhs&, Rhs&) {}\\n\\n};\\n\\n\\n\\ntemplate<typename Lhs, typename Rhs, int Mode>\\n\",\n \"file_path\": \"src/Eigen/src/Core/SolveTriangular.h\",\n \"rank\": 14,\n \"score\": 115200.36842311482\n },\n {\n \"content\": \"struct has_std_result_type {int a[2];};\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/Meta.h\",\n \"rank\": 15,\n \"score\": 113189.59007229327\n },\n {\n \"content\": \"extern __inline int __attribute__((__gnu_inline__, __always_inline__, __artificial__))\\n\",\n \"file_path\": \"src/simd/mmintrin.h\",\n \"rank\": 16,\n \"score\": 108807.23622173438\n },\n {\n \"content\": \"struct RangeAccess<AcMd, const T> : RangeAccess<AcMd, T> {\\n\\n typedef RangeAccess<AcMd, T> Base;\\n\\n using Base::Base;\\n\\n};\\n\\n\\n\\n} // namespace internal\\n\\n} // namespace TensorSycl\\n\\n} // namespace Eigen\\n\\n\\n\\n#endif // EIGEN_CXX11_TENSOR_TENSOR_SYCL_STORAGE_MEMORY_H\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/SYCL/SyclMemoryModel.h\",\n \"rank\": 17,\n \"score\": 108704.179495046\n },\n {\n \"content\": \"extern __inline void __attribute__((__gnu_inline__, __always_inline__, __artificial__))\\n\",\n \"file_path\": \"src/simd/mmintrin.h\",\n \"rank\": 18,\n \"score\": 108658.44152511084\n },\n {\n \"content\": \"class Ref<const SparseVector<MatScalar,MatOptions,MatIndex>, Options, StrideType>\\n\\n : public internal::SparseRefBase<Ref<const SparseVector<MatScalar,MatOptions,MatIndex>, Options, StrideType> >\\n\\n{\\n\\n typedef SparseVector<MatScalar,MatOptions,MatIndex> TPlainObjectType;\\n\\n typedef internal::traits<Ref> Traits;\\n\\n public:\\n\\n\\n\\n typedef internal::SparseRefBase<Ref> Base;\\n\\n EIGEN_SPARSE_PUBLIC_INTERFACE(Ref)\\n\\n\\n\\n template<typename Derived>\\n\\n inline Ref(const SparseMatrixBase<Derived>& expr) : m_hasCopy(false)\\n\\n {\\n\\n construct(expr.derived(), typename Traits::template match<Derived>::type());\\n\\n }\\n\\n\\n\\n inline Ref(const Ref& other) : Base(other), m_hasCopy(false) {\\n\\n // copy constructor shall not copy the m_object, to avoid unnecessary malloc and copy\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/Eigen/src/SparseCore/SparseRef.h\",\n \"rank\": 19,\n \"score\": 106922.77734636124\n },\n {\n \"content\": \"class Map<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>\\n\\n : public SparseMapBase<Map<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >\\n\\n{\\n\\n public:\\n\\n typedef SparseMapBase<Map> Base;\\n\\n EIGEN_SPARSE_PUBLIC_INTERFACE(Map)\\n\\n enum { IsRowMajor = Base::IsRowMajor };\\n\\n\\n\\n public:\\n\\n#endif\\n\\n /** This is the const version of the above constructor.\\n\\n *\\n\\n * This constructor is available only if \\\\c SparseMatrixType is const, e.g.:\\n\\n * \\\\code Map<const SparseMatrix<double> > \\\\endcode\\n\\n */\\n\\n inline Map(Index rows, Index cols, Index nnz, const StorageIndex* outerIndexPtr,\\n\\n const StorageIndex* innerIndexPtr, const Scalar* valuePtr, const StorageIndex* innerNonZerosPtr = 0)\\n\\n : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr)\\n\\n {}\\n\\n\\n\\n /** Empty destructor */\\n\\n inline ~Map() {}\\n\\n};\\n\\n\\n\\nnamespace internal {\\n\\n\\n\\ntemplate<typename MatScalar, int MatOptions, typename MatIndex, int Options, typename StrideType>\\n\",\n \"file_path\": \"src/Eigen/src/SparseCore/SparseMap.h\",\n \"rank\": 20,\n \"score\": 106922.77734636124\n },\n {\n \"content\": \"class Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType>\\n\\n : public internal::SparseRefBase<Ref<const SparseMatrix<MatScalar,MatOptions,MatIndex>, Options, StrideType> >\\n\\n{\\n\\n typedef SparseMatrix<MatScalar,MatOptions,MatIndex> TPlainObjectType;\\n\\n typedef internal::traits<Ref> Traits;\\n\\n public:\\n\\n\\n\\n typedef internal::SparseRefBase<Ref> Base;\\n\\n EIGEN_SPARSE_PUBLIC_INTERFACE(Ref)\\n\\n\\n\\n template<typename Derived>\\n\\n inline Ref(const SparseMatrixBase<Derived>& expr) : m_hasCopy(false)\\n\\n {\\n\\n construct(expr.derived(), typename Traits::template match<Derived>::type());\\n\\n }\\n\\n\\n\\n inline Ref(const Ref& other) : Base(other), m_hasCopy(false) {\\n\\n // copy constructor shall not copy the m_object, to avoid unnecessary malloc and copy\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/Eigen/src/SparseCore/SparseRef.h\",\n \"rank\": 21,\n \"score\": 106922.77734636124\n },\n {\n \"content\": \" static EIGEN_STRONG_INLINE Index blocked(MatrixType& mat)\\n\",\n \"file_path\": \"src/Eigen/src/Cholesky/LLT.h\",\n \"rank\": 22,\n \"score\": 106242.98767853303\n },\n {\n \"content\": \"EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void MatrixBase<Derived>::stableNormalize()\\n\",\n \"file_path\": \"src/Eigen/src/Core/Dot.h\",\n \"rank\": 23,\n \"score\": 106225.2093320402\n },\n {\n \"content\": \" static EIGEN_DEVICE_FUNC\\n\",\n \"file_path\": \"src/Eigen/src/Eigenvalues/Tridiagonalization.h\",\n \"rank\": 24,\n \"score\": 106225.2093320402\n },\n {\n \"content\": \"struct ScalarBinaryOpTraits<void,void,BinaryOp>\\n\\n{\\n\\n typedef void ReturnType;\\n\\n};\\n\\n\\n\\n// We require Lhs and Rhs to have \\\"compatible\\\" scalar types.\\n\\n// It is tempting to always allow mixing different types but remember that this is often impossible in the vectorized paths.\\n\\n// So allowing mixing different types gives very unexpected errors when enabling vectorization, when the user tries to\\n\\n// add together a float matrix and a double matrix.\\n\\n#define EIGEN_CHECK_BINARY_COMPATIBILIY(BINOP,LHS,RHS) \\\\\\n\\n EIGEN_STATIC_ASSERT((Eigen::internal::has_ReturnType<ScalarBinaryOpTraits<LHS, RHS,BINOP> >::value), \\\\\\n\\n YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY)\\n\\n \\n\\n} // end namespace Eigen\\n\\n\\n\\n#endif // EIGEN_XPRHELPER_H\\n\",\n \"file_path\": \"src/Eigen/src/Core/util/XprHelper.h\",\n \"rank\": 25,\n \"score\": 106200.68600682903\n },\n {\n \"content\": \"inline typename internal::traits<Derived>::Scalar MatrixBase<Derived>::determinant() const\\n\\n{\\n\\n eigen_assert(rows() == cols());\\n\\n typedef typename internal::nested_eval<Derived,Base::RowsAtCompileTime>::type Nested;\\n\\n return internal::determinant_impl<typename internal::remove_all<Nested>::type>::run(derived());\\n\",\n \"file_path\": \"src/Eigen/src/LU/Determinant.h\",\n \"rank\": 26,\n \"score\": 106185.4804657049\n },\n {\n \"content\": \" EIGEN_DEVICE_FUNC Index rows(void) const {return m_rows;}\\n\",\n \"file_path\": \"src/Eigen/src/Core/DenseStorage.h\",\n \"rank\": 27,\n \"score\": 105105.70210982021\n },\n {\n \"content\": \"EIGEN_DEVICE_FUNC inline Eigen::Index DenseBase<Derived>::count() const\\n\",\n \"file_path\": \"src/Eigen/src/Core/BooleanRedux.h\",\n \"rank\": 28,\n \"score\": 105105.70210982021\n },\n {\n \"content\": \" static EIGEN_DEVICE_FUNC\\n\",\n \"file_path\": \"src/Eigen/src/Core/ProductEvaluators.h\",\n \"rank\": 29,\n \"score\": 105086.8542164767\n },\n {\n \"content\": \" EIGEN_DEVICE_FUNC void swap(DenseStorage& other) {\\n\",\n \"file_path\": \"src/Eigen/src/Core/DenseStorage.h\",\n \"rank\": 30,\n \"score\": 105086.8542164767\n },\n {\n \"content\": \" EIGEN_DEVICE_FUNC\\n\",\n \"file_path\": \"src/Eigen/src/Householder/HouseholderSequence.h\",\n \"rank\": 31,\n \"score\": 105053.71322178084\n },\n {\n \"content\": \" inline const CompleteOrthogonalDecomposition<PlainObject> completeOrthogonalDecomposition() const;\\n\",\n \"file_path\": \"src/Eigen/src/Core/MatrixBase.h\",\n \"rank\": 32,\n \"score\": 105047.49962595612\n },\n {\n \"content\": \"EIGEN_DEVICE_FUNC inline bool DenseBase<Derived>::any() const\\n\\n{\\n\\n typedef internal::evaluator<Derived> Evaluator;\\n\\n enum {\\n\\n unroll = SizeAtCompileTime != Dynamic\\n\\n && SizeAtCompileTime * (Evaluator::CoeffReadCost + NumTraits<Scalar>::AddCost) <= EIGEN_UNROLLING_LIMIT\\n\\n };\\n\\n Evaluator evaluator(derived());\\n\\n if(unroll)\\n\\n return internal::any_unroller<Evaluator, unroll ? int(SizeAtCompileTime) : Dynamic, internal::traits<Derived>::RowsAtCompileTime>::run(evaluator);\\n\\n else\\n\\n {\\n\\n for(Index j = 0; j < cols(); ++j)\\n\\n for(Index i = 0; i < rows(); ++i)\\n\\n if (evaluator.coeff(i, j)) return true;\\n\\n return false;\\n\\n }\\n\",\n \"file_path\": \"src/Eigen/src/Core/BooleanRedux.h\",\n \"rank\": 33,\n \"score\": 105047.49962595612\n },\n {\n \"content\": \" EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE\\n\\n const PacketType packet(Index index) const\\n\\n {\\n\\n const Index row = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? 0 : index;\\n\\n const Index col = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? index : 0;\\n\\n return packet<LoadMode,PacketType>(row,col);\\n\",\n \"file_path\": \"src/Eigen/src/Core/ProductEvaluators.h\",\n \"rank\": 34,\n \"score\": 105047.49962595612\n },\n {\n \"content\": \"inline const Inverse<Derived> MatrixBase<Derived>::inverse() const\\n\\n{\\n\\n EIGEN_STATIC_ASSERT(!NumTraits<Scalar>::IsInteger,THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES)\\n\\n eigen_assert(rows() == cols());\\n\\n return Inverse<Derived>(derived());\\n\",\n \"file_path\": \"src/Eigen/src/LU/InverseImpl.h\",\n \"rank\": 35,\n \"score\": 105047.49962595612\n },\n {\n \"content\": \" EIGEN_DEVICE_FUNC Index cols() const {return m_cols;}\\n\",\n \"file_path\": \"src/Eigen/src/Core/DenseStorage.h\",\n \"rank\": 36,\n \"score\": 105047.49962595612\n },\n {\n \"content\": \" const Index rank = m_cpqr.rank();\\n\",\n \"file_path\": \"src/Eigen/src/QR/CompleteOrthogonalDecomposition.h\",\n \"rank\": 37,\n \"score\": 104156.12186127497\n },\n {\n \"content\": \"class BlockImpl<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true,Sparse>\\n\\n : public internal::sparse_matrix_block_impl<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols>\\n\\n{\\n\\npublic:\\n\\n typedef _StorageIndex StorageIndex;\\n\\n typedef SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType;\\n\\n typedef internal::sparse_matrix_block_impl<SparseMatrixType,BlockRows,BlockCols> Base;\\n\\n inline BlockImpl(SparseMatrixType& xpr, Index i)\\n\\n : Base(xpr, i)\\n\\n {}\\n\\n\\n\\n inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)\\n\\n : Base(xpr, startRow, startCol, blockRows, blockCols)\\n\\n {}\\n\\n\\n\\n using Base::operator=;\\n\\n};\\n\\n\\n\\ntemplate<typename _Scalar, int _Options, typename _StorageIndex, int BlockRows, int BlockCols>\\n\",\n \"file_path\": \"src/Eigen/src/SparseCore/SparseBlock.h\",\n \"rank\": 38,\n \"score\": 104000.21363159583\n },\n {\n \"content\": \"EIGEN_DEVICE_FUNC inline void\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/AVX/Complex.h\",\n \"rank\": 39,\n \"score\": 103996.2921142464\n },\n {\n \"content\": \"EIGEN_DEVICE_FUNC inline void\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/AVX512/Complex.h\",\n \"rank\": 40,\n \"score\": 103996.2921142464\n },\n {\n \"content\": \"EIGEN_STRONG_INLINE void ptranspose(PacketBlock<Packet1cd, 2>& kernel) {\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/MSA/Complex.h\",\n \"rank\": 41,\n \"score\": 103996.2921142464\n },\n {\n \"content\": \"EIGEN_DEVICE_FUNC inline void\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/SSE/Complex.h\",\n \"rank\": 42,\n \"score\": 103996.2921142464\n },\n {\n \"content\": \"EIGEN_DEVICE_FUNC inline void ptranspose(PacketBlock<Packet1cf, 1>& /*kernel*/) {}\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/NEON/Complex.h\",\n \"rank\": 43,\n \"score\": 103996.2921142464\n },\n {\n \"content\": \" EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC\\n\\n PacketType packet(Index idx) const\\n\\n {\\n\\n enum { PacketSize = internal::unpacket_traits<PacketType>::size };\\n\\n typedef Block<const ArgTypeNestedCleaned,\\n\\n Direction==Vertical ? int(ArgType::RowsAtCompileTime) : int(PacketSize),\\n\\n Direction==Vertical ? int(PacketSize) : int(ArgType::ColsAtCompileTime),\\n\\n true /* InnerPanel */> PanelType;\\n\\n \\n\\n PanelType panel(m_arg,\\n\\n Direction==Vertical ? 0 : idx,\\n\\n Direction==Vertical ? idx : 0,\\n\\n Direction==Vertical ? m_arg.rows() : Index(PacketSize),\\n\\n Direction==Vertical ? Index(PacketSize) : m_arg.cols());\\n\\n\\n\\n // FIXME\\n\\n // See bug 1612, currently if PacketSize==1 (i.e. complex<double> with 128bits registers) then the storage-order of panel get reversed\\n\\n // and methods like packetByOuterInner do not make sense anymore in this context.\\n\\n // So let's just by pass \\\"vectorization\\\" in this case:\\n\\n if(PacketSize==1)\\n\\n return internal::pset1<PacketType>(coeff(idx));\\n\\n \\n\\n typedef typename internal::redux_evaluator<PanelType> PanelEvaluator;\\n\\n PanelEvaluator panel_eval(panel);\\n\\n typedef typename MemberOp::BinaryOp BinaryOp;\\n\\n PacketType p = internal::packetwise_redux_impl<BinaryOp,PanelEvaluator>::template run<PacketType>(panel_eval,m_functor.binaryFunc(),m_arg.outerSize());\\n\\n return p;\\n\",\n \"file_path\": \"src/Eigen/src/Core/PartialReduxEvaluator.h\",\n \"rank\": 44,\n \"score\": 103957.29608584214\n },\n {\n \"content\": \" EIGEN_STRONG_INLINE Packet2cd pmul(const Packet2cd& a, const Packet2cd& b) const\\n\\n {\\n\\n return pconj(internal::pmul(a, b));\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/AVX/Complex.h\",\n \"rank\": 45,\n \"score\": 103957.29608584214\n },\n {\n \"content\": \" EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/NEON/Complex.h\",\n \"rank\": 46,\n \"score\": 103957.29608584214\n },\n {\n \"content\": \" EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const {\\n\\n return internal::pmul(pconj(a), b);\\n\",\n \"file_path\": \"src/Eigen/src/Core/arch/MSA/Complex.h\",\n \"rank\": 47,\n \"score\": 103957.29608584214\n },\n {\n \"content\": \" // Merging models\\n\\n void merge_average(const MatrixFactorizationModel& w);\\n\\n void merge_weighted(size_t my_degree, const DegreesAndModels& models);\\n\\n\\n\\n void item_merge_column(Sparse& Y, const Sparse& Other);\\n\\n void user_merge_column(Sparse& X, const Sparse& Other);\\n\\n\\n\\n bool init_item(int item, const Sparse& column);\\n\\n bool init_user(int user, const Sparse& column);\\n\\n void prep_toshare();\\n\\n void make_compressed();\\n\\n size_t estimate_serial_size() const;\\n\\n\\n\\n private:\\n\\n Sparse zero_embedding();\\n\\n std::set<int> metropolis_hastings(size_t my_degree,\\n\\n const DegreesAndModels& models,\\n\\n Sparse& factors, Sparse& biases,\\n\\n bool isusers);\\n\\n std::set<int> metropolis_hastings_users(size_t my_degree,\\n\",\n \"file_path\": \"src/machine_learning/matrix_factorization.h\",\n \"rank\": 55,\n \"score\": 66.6961087593988\n },\n {\n \"content\": \"#include \\\"mf_weights.h\\\"\\n\\n\\n\\n#include <iostream>\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n// MWeights\\n\\n//------------------------------------------------------------------------------\\n\\nbool MFWeights::has(int i, const Sparse &m) const {\\n\\n return i < m.outerSize() && Sparse::InnerIterator(m, i);\\n\\n // column exists (i.e., not all 0)\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nEmbedding MFWeights::get_factors(int i, const Sparse &factors,\\n\\n const Sparse &bias) const {\\n\\n std::vector<double> ret;\\n\\n const auto &v = factors.col(i);\\n\\n int n = v.rows();\\n\\n for (int i = 0; i < n; ++i) ret.emplace_back(v.coeff(i, 0));\\n\\n return Embedding(bias.coeff(0, i), ret);\\n\",\n \"file_path\": \"src/machine_learning/mf_weights.cpp\",\n \"rank\": 60,\n \"score\": 57.92220849350536\n },\n {\n \"content\": \" const DegreesAndModels& models);\\n\\n std::set<int> metropolis_hastings_items(size_t my_degree,\\n\\n const DegreesAndModels& models);\\n\\n\\n\\n std::pair<double, Sparse> combine_neighbors(bool isuser, int index,\\n\\n const DegreesAndModels& models);\\n\\n void combine_neighbors_embeddings(bool isuser,\\n\\n const DegreesAndModels& models,\\n\\n std::set<int>& exclude_list);\\n\\n void combine_neighbors_users(const DegreesAndModels& models,\\n\\n std::set<int>& exclude_list);\\n\\n void combine_neighbors_items(const DegreesAndModels& models,\\n\\n std::set<int>& exclude_list);\\n\\n\\n\\n int rank_;\\n\\n MFWeights weights_;\\n\\n friend class MFSGD;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/machine_learning/matrix_factorization.h\",\n \"rank\": 62,\n \"score\": 54.99399410587737\n },\n {\n \"content\": \"}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nbool MFWeights::has_item(int item) const { return has(item, items); }\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nbool MFWeights::has_user(int user) const { return has(user, users); }\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nEmbedding MFWeights::get_item_factors(int item) const {\\n\\n return get_factors(item, items, item_biases);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nEmbedding MFWeights::get_user_factors(int user) const {\\n\\n return get_factors(user, users, user_biases);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\ndouble MFWeights::predict(int user, int item) const {\\n\",\n \"file_path\": \"src/machine_learning/mf_weights.cpp\",\n \"rank\": 64,\n \"score\": 48.74051705042084\n },\n {\n \"content\": \" for(const auto& x: *node_data_) {\\n\\n if(train_indices.find(i) != train_indices.end()) {\\n\\n int user = x.first.first, item = x.first.second;\\n\\n assert(x.second >= 0 && x.second <= 10);\\n\\n\\n\\n model_.find_space(user, item, hyper_.init_column_,\\n\\n hyper_.init_bias);\\n\\n total_err += MFSGD::train(user, item, x.second);\\n\\n ++count;\\n\\n }\\n\\n i++;\\n\\n if(count == num_local_steps)\\n\\n break;\\n\\n }\\n\\n\\n\\n return std::make_pair(total_err, count);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\ndouble MFSGDDecentralized::test(const TripletVector<uint8_t> &testset) {\\n\",\n \"file_path\": \"src/machine_learning/mf_decentralized.cpp\",\n \"rank\": 67,\n \"score\": 46.27923089487722\n },\n {\n \"content\": \"#include \\\"mf_centralized.h\\\"\\n\\n\\n\\n#include <utils/time_probe.h>\\n\\n\\n\\n#include <future>\\n\\n#include <iostream>\\n\\n#include <mutex>\\n\\n//------------------------------------------------------------------------------\\n\\nMatrixFactorizationModel MFSGD::trainX(const Ratings &ratings, uint8_t lowscore,\\n\\n uint8_t highscore, int matrix_rank,\\n\\n double learning, double regularization,\\n\\n int iterations,\\n\\n const TripletVector<uint8_t> &test) {\\n\\n double init_bias = lowscore,\\n\\n init_factor = sqrt(double(highscore - lowscore) / matrix_rank);\\n\\n HyperMFSGD hyper(matrix_rank, learning, regularization, init_bias,\\n\\n init_factor);\\n\\n MFSGDCentralized trainer(ratings, hyper);\\n\\n trainer.init();\\n\\n std::cout << \\\"epoch;trainerr;testerr\\\\n\\\";\\n\",\n \"file_path\": \"src/machine_learning/mf_centralized.cpp\",\n \"rank\": 69,\n \"score\": 42.34981853768643\n },\n {\n \"content\": \" if (user < 0 || item < 0) {\\n\\n std::cerr << \\\"Invalid index (\\\" << user << \\\",\\\" << item << \\\")\\\"\\n\\n << std::endl;\\n\\n abort();\\n\\n }\\n\\n assert(users.rows() == items.rows());\\n\\n return Sparse(users.col(user).transpose() * items.col(item)).coeff(0, 0) +\\n\\n user_biases.coeff(0, user) + item_biases.coeff(0, item);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nsize_t MFWeights::estimate_serial_size() const {\\n\\n return serial_size(users) + serial_size(items) + serial_size(user_biases) +\\n\\n serial_size(item_biases);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid MFWeights::serialize_with_size(const Sparse &matrix,\\n\\n std::vector<uint8_t> &out) const {\\n\\n size_t index = out.size();\\n\",\n \"file_path\": \"src/machine_learning/mf_weights.cpp\",\n \"rank\": 70,\n \"score\": 41.56572479868186\n },\n {\n \"content\": \" for (const auto &t : testset) {\\n\\n model_.init_user(t.row(), hyper_.init_column_);\\n\\n model_.init_item(t.col(), hyper_.init_column_); \\n\\n }\\n\\n return model_.rmse(testset);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nsize_t MFSGDDecentralized::add_raw_ratings(SharingRatings sr) {\\n\\n size_t count = 0;\\n\\n if (sr) {\\n\\n for(auto it = sr->begin(); it != sr->end(); it++) {\\n\\n auto res = node_data_->insert(std::make_pair(std::make_pair(it->row(), it->col()), it->value()));\\n\\n if(res.second)\\n\\n count++;\\n\\n }\\n\\n }\\n\\n return count;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/machine_learning/mf_decentralized.cpp\",\n \"rank\": 71,\n \"score\": 40.78036660339293\n },\n {\n \"content\": \" model_.find_space(user, item, hyper_.init_column_, hyper_.init_bias);\\n\\n model_.init_item(item, hyper_.init_column_);\\n\\n model_.init_user(user, hyper_.init_column_);\\n\\n });\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nstd::pair<double, size_t> MFSGDCentralized::train() {\\n\\n std::vector<std::future<std::pair<double, size_t>>> results;\\n\\n sparse_matrix_outer_iterate(ratings_, [&](Ratings::InnerIterator it,\\n\\n int item) {\\n\\n auto shared =\\n\\n std::make_shared<std::packaged_task<std::pair<double, size_t>()>>(\\n\\n std::bind(&MFSGDCentralized::parallel_train, this, it, item));\\n\\n results.emplace_back(shared->get_future());\\n\\n pool_.add_task([shared]() { (*shared)(); });\\n\\n });\\n\\n\\n\\n double total_err = 0;\\n\\n size_t count = 0;\\n\",\n \"file_path\": \"src/machine_learning/mf_centralized.cpp\",\n \"rank\": 72,\n \"score\": 40.17324702762591\n },\n {\n \"content\": \" << (sum_train_err / count) << \\\";\\\" << (sum_test_err / count) << \\\";\\\"\\n\\n << (sum_items / count) << \\\";\\\" << (sum_time / count) << \\\";\\\"\\n\\n << (sumbout / count) << \\\";\\\" << (sumbin / count) << \\\";\\\" << count\\n\\n << std::endl;\\n\\n // std::cout << epoch_stats_.summary() << std::endl;\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid MFCoordinator::run(uint8_t lowscore, uint8_t highscore, int matrix_rank,\\n\\n double learning, double regularization, int iterations,\\n\\n bool dpsgd, bool randgraph, unsigned local,\\n\\n size_t steps_per_iteration, unsigned share_howmany) {\\n\\n Graph g = randgraph ? random_graph_erdos_renyi(nodes_.size())\\n\\n : random_graph_small_world(nodes_.size());\\n\\n make_connected(g);\\n\\n unsigned edges = establish_relations(g);\\n\\n //std::cout << (randgraph ? \\\"Erdos-Renyi\\\" : \\\"Small World\\\")\\n\\n // << \\\" Mean degree: \\\" << double(edges) / nodes_.size() << std::endl;\\n\\n\\n\\n double init_bias = lowscore,\\n\",\n \"file_path\": \"src/machine_learning/mf_coordinator.cpp\",\n \"rank\": 73,\n \"score\": 38.247336953268125\n },\n {\n \"content\": \"\\n\\n DPSGDModelPtr toshare = std::make_shared<DPSGDShareableModel>(\\n\\n epoch, modelshare_? trainer_->model(): MatrixFactorizationModel(-2), // -2 for no model sharing\\n\\n rawdata, neighbours_.size());\\n\\n\\n\\n size_t ret = 0;\\n\\n for (auto &peer : neighbours_) {\\n\\n ret += communication_->send(userrank_, peer, toshare);\\n\\n }\\n\\n return ret;\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid DPSGDMerger::merge(int epoch) {\\n\\n std::unique_lock<std::mutex> lock(recv_mtx_);\\n\\n std::vector<DPSGDEntry> models;\\n\\n size_t count = 0;\\n\\n for (auto &m : received_models_[epoch]) {\\n\\n unsigned src = m.first;\\n\\n ShareableModelPtr shared = m.second;\\n\",\n \"file_path\": \"src/model_merging/dpsgd.cpp\",\n \"rank\": 74,\n \"score\": 36.082109268346166\n },\n {\n \"content\": \"#include <csv.h>\\n\\n#include <ratings_parser.h>\\n\\n#include <stringtools.h>\\n\\n\\n\\n#include <Eigen/Sparse>\\n\\n#include <fstream>\\n\\n#include <iostream>\\n\\n#include <set>\\n\\nusing Eigen::Triplet;\\n\\nstatic std::set<int> users;\\n\\n//------------------------------------------------------------------------------\\n\\nbool csvitem_tovector(TripletVector<uint8_t>& v,\\n\\n const std::vector<std::string>& item,\\n\\n std::pair<int, int>& dim, int limit, int filter_divisor,\\n\\n int filter_modulo) {\\n\\n try {\\n\\n Triplet<uint8_t> t(std::stoul(item[0]) - 1, std::stoul(item[1]) - 1,\\n\\n int(std::stof(item[2]) * 2));\\n\\n if (limit > 0) {\\n\\n users.insert(t.row());\\n\",\n \"file_path\": \"src/ratings_parser.cpp\",\n \"rank\": 75,\n \"score\": 35.521761237265736\n },\n {\n \"content\": \"\\n\\n return ret;\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid RandomModelWalkMerger::merge(int epoch) {\\n\\n std::unique_lock<std::mutex> lock(recv_mtx_);\\n\\n\\n\\n size_t count = 0;\\n\\n for (auto &model : received_models_[epoch]) {\\n\\n unsigned src = model.first;\\n\\n ShareableModelPtr shared = model.second;\\n\\n if (shared->model_.rank() != -1) {\\n\\n if (modelshare_) { // or shared->model_.rank() != -2\\n\\n trainer_->mutable_model().merge_average(shared->model_);\\n\\n }\\n\\n count += trainer_->add_raw_ratings(shared->rawdata);\\n\\n } // else it's a dummy. Used for synchronization\\n\\n recvdfrom_.erase(std::make_pair(src, shared->epoch));\\n\\n }\\n\\n\\n\\n received_models_[epoch].clear();\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/model_merging/random_model_walk.cpp\",\n \"rank\": 76,\n \"score\": 35.240072342314406\n },\n {\n \"content\": \" return MFSGD::trainX(ratings, 2, 10, 20, 0.01, 0.01, 10);\\n\\n}\\n\\n*/\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid run(Ratings &ratings, TripletVector<uint8_t> &test) {\\n\\n /*\\n\\n MatrixFactorizationModel model = train(ratings);\\n\\n printf(\\\"RMSE = %lf\\\\n\\\", test_model(test, model));\\n\\n */\\n\\n ThreadPool tp(std::thread::hardware_concurrency());\\n\\n std::vector<int> iters = {201};\\n\\n std::vector<int> ranks = {10};\\n\\n std::vector<double> lambdas = {0.1};\\n\\n std::vector<double> etas = {0.005};\\n\\n std::vector<std::pair<string, std::future<MatrixFactorizationModel>>>\\n\\n results;\\n\\n for (int iter : iters) {\\n\\n for (int rank : ranks) {\\n\\n for (double eta : etas) {\\n\",\n \"file_path\": \"src/local_training.cpp\",\n \"rank\": 78,\n \"score\": 33.70272351225419\n },\n {\n \"content\": \" uint8_t *nptr = reinterpret_cast<uint8_t *>(&index);\\n\\n out.insert(out.end(), nptr, nptr + sizeof(index)); // placeholder\\n\\n matrix_to_triplets_append(matrix, out);\\n\\n assert(*reinterpret_cast<size_t *>(&out[index]) == index); // check value\\n\\n size_t tmp = out.size() - index - sizeof(size_t);\\n\\n memcpy(&out[index], &tmp, sizeof(tmp)); // fill size in B\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid MFWeights::serialize_append(std::vector<uint8_t> &out) const {\\n\\n serialize_with_size(users, out);\\n\\n serialize_with_size(items, out);\\n\\n serialize_with_size(user_biases, out);\\n\\n serialize_with_size(item_biases, out);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nsize_t MFWeights::deserialize_matrix(Sparse &matrix,\\n\\n const std::vector<uint8_t> &data,\\n\\n size_t offset) {\\n\",\n \"file_path\": \"src/machine_learning/mf_weights.cpp\",\n \"rank\": 79,\n \"score\": 32.92676166202218\n },\n {\n \"content\": \"#include \\\"mf_decentralized.h\\\"\\n\\n#include <random>\\n\\n#include <iostream>\\n\\n//------------------------------------------------------------------------------\\n\\n// MFSGDDecentralized\\n\\n//------------------------------------------------------------------------------\\n\\nMFSGDDecentralized::MFSGDDecentralized(unsigned node_index,\\n\\n std::shared_ptr<DataStore> node_data,\\n\\n HyperMFSGD h,\\n\\n size_t steps_per_iteration)\\n\\n : MFSGD(h), node_index_(node_index), node_data_(node_data), steps_per_iteration_(steps_per_iteration) {}\\n\\n//------------------------------------------------------------------------------\\n\\nMatrixFactorizationModel& MFSGDDecentralized::mutable_model() { return model_; }\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid MFSGDDecentralized::make_compressed() {\\n\\n model_.make_compressed();\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/machine_learning/mf_decentralized.cpp\",\n \"rank\": 80,\n \"score\": 32.71588008301312\n },\n {\n \"content\": \" for (; it; ++it) {\\n\\n ulock = get_user_lock(it.row());\\n\\n if (!ulock) {\\n\\n std::cerr << \\\"Error getting user \\\" << it.row() << \\\" lock\\\"\\n\\n << std::endl;\\n\\n abort();\\n\\n } else {\\n\\n std::lock_guard<std::mutex> lock_user(*ulock);\\n\\n err += MFSGD::train(it.row(), item, it.value());\\n\\n ++count;\\n\\n }\\n\\n }\\n\\n }\\n\\n return std::make_pair(err, count);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid MFSGDCentralized::init() {\\n\\n sparse_matrix_iterate(ratings_, [&](Ratings::InnerIterator it) {\\n\\n int user = it.row(), item = it.col();\\n\",\n \"file_path\": \"src/machine_learning/mf_centralized.cpp\",\n \"rank\": 81,\n \"score\": 32.55739474957963\n },\n {\n \"content\": \" for (double lambda : lambdas) {\\n\\n auto shared = std::make_shared<\\n\\n std::packaged_task<MatrixFactorizationModel()>>(\\n\\n std::bind(&MFSGD::trainX, ratings, 2, 10, rank, eta,\\n\\n lambda, iter, test));\\n\\n std::stringstream ss;\\n\\n ss << \\\"r=\\\" << rank << \\\" n=\\\" << eta << \\\" l=\\\" << lambda\\n\\n << \\\" n=\\\" << iter;\\n\\n results.emplace_back(\\n\\n std::make_pair(ss.str(), shared->get_future()));\\n\\n tp.add_task([shared]() { (*shared)(); });\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n bool once = false;\\n\\n for (auto &r : results) {\\n\\n r.second.wait();\\n\\n MatrixFactorizationModel model = r.second.get();\\n\",\n \"file_path\": \"src/local_training.cpp\",\n \"rank\": 82,\n \"score\": 32.51357986512679\n },\n {\n \"content\": \"#include \\\"data_splitter.h\\\"\\n\\n#include <csv.h>\\n\\n#include <ratings_parser.h>\\n\\n#include <set>\\n\\n\\n\\nusing std::string;\\n\\n//------------------------------------------------------------------------------\\n\\nvoid split_vectors(int from, int to, TripletVector<uint8_t> &src,\\n\\n TripletVector<uint8_t> &train,\\n\\n TripletVector<uint8_t> &test) {\\n\\n float tmult = 0.7;\\n\\n int count = to - from;\\n\\n int tcount = tmult * count;\\n\\n std::set<int> indexes;\\n\\n while (indexes.size() != tcount) indexes.insert(from + rand() % count);\\n\\n for (int i = from; i < to; ++i) {\\n\\n if (indexes.find(i) == indexes.end())\\n\\n test.push_back(src[i]);\\n\\n else\\n\\n train.push_back(src[i]);\\n\",\n \"file_path\": \"src/data_splitter.cpp\",\n \"rank\": 83,\n \"score\": 31.49121813181848\n },\n {\n \"content\": \" typedef typename ReturnType<internal::member_all>::Type AllReturnType;\\n\\n typedef typename ReturnType<internal::member_any>::Type AnyReturnType;\\n\\n typedef PartialReduxExpr<ExpressionType, internal::member_count<Index,Scalar>, Direction> CountReturnType;\\n\\n typedef typename ReturnType<internal::member_prod>::Type ProdReturnType;\\n\\n typedef Reverse<const ExpressionType, Direction> ConstReverseReturnType;\\n\\n typedef Reverse<ExpressionType, Direction> ReverseReturnType;\\n\\n\\n\\n template<int p> struct LpNormReturnType {\\n\\n typedef PartialReduxExpr<ExpressionType, internal::member_lpnorm<p,RealScalar,Scalar>,Direction> Type;\\n\\n };\\n\\n\\n\\n /** \\\\returns a row (or column) vector expression of the smallest coefficient\\n\\n * of each column (or row) of the referenced expression.\\n\\n *\\n\\n * \\\\warning the size along the reduction direction must be strictly positive,\\n\\n * otherwise an assertion is triggered.\\n\\n * \\n\\n * \\\\warning the result is undefined if \\\\c *this contains NaN.\\n\\n *\\n\\n * Example: \\\\include PartialRedux_minCoeff.cpp\\n\",\n \"file_path\": \"src/Eigen/src/Core/VectorwiseOp.h\",\n \"rank\": 84,\n \"score\": 29.99203547866953\n },\n {\n \"content\": \"\\n\\ntemplate<typename MatrixType>\\n\\ntemplate<typename BDerived,typename XDerived>\\n\\nbool KLU<MatrixType>::_solve_impl(const MatrixBase<BDerived> &b, MatrixBase<XDerived> &x) const\\n\\n{\\n\\n Index rhsCols = b.cols();\\n\\n EIGEN_STATIC_ASSERT((XDerived::Flags&RowMajorBit)==0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);\\n\\n eigen_assert(m_factorizationIsOk && \\\"The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()\\\");\\n\\n\\n\\n x = b;\\n\\n int info = klu_solve(m_symbolic, m_numeric, b.rows(), rhsCols, x.const_cast_derived().data(), const_cast<klu_common*>(&m_common), Scalar());\\n\\n\\n\\n m_info = info!=0 ? Success : NumericalIssue;\\n\\n return true;\\n\\n}\\n\\n\\n\\n} // end namespace Eigen\\n\\n\\n\\n#endif // EIGEN_KLUSUPPORT_H\\n\",\n \"file_path\": \"src/Eigen/src/KLUSupport/KLUSupport.h\",\n \"rank\": 85,\n \"score\": 29.94311282530998\n },\n {\n \"content\": \"\\n\\n if(modelshare_) {\\n\\n auto &local_model = trainer_->mutable_model();\\n\\n local_model.merge_weighted(neighbours_.size(), models);\\n\\n }\\n\\n\\n\\n received_models_[epoch].clear();\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n// DPSGDShareableModel\\n\\n//------------------------------------------------------------------------------\\n\\nDPSGDShareableModel::DPSGDShareableModel(int e,\\n\\n const MatrixFactorizationModel &m,\\n\\n SharingRatings data, size_t degree)\\n\\n : ShareableModel(e, DPSGD, m, data), degree_(degree) {\\n\\n // puts user embedding into its place\\n\\n //model_.prep_toshare();\\n\\n // call not needed now, training occurs at original place\\n\\n}\\n\",\n \"file_path\": \"src/model_merging/dpsgd.cpp\",\n \"rank\": 86,\n \"score\": 29.91790691919642\n },\n {\n \"content\": \" // If the factorization failed, minor is the column at which it did. On success minor == n.\\n\\n this->m_info = (m_cholmodFactor->minor == m_cholmodFactor->n ? Success : NumericalIssue);\\n\\n m_factorizationIsOk = true;\\n\\n }\\n\\n\\n\\n /** Returns a reference to the Cholmod's configuration structure to get a full control over the performed operations.\\n\\n * See the Cholmod user guide for details. */\\n\\n cholmod_common& cholmod() { return m_cholmod; }\\n\\n\\n\\n #ifndef EIGEN_PARSED_BY_DOXYGEN\\n\\n /** \\\\internal */\\n\\n template<typename Rhs,typename Dest>\\n\\n void _solve_impl(const MatrixBase<Rhs> &b, MatrixBase<Dest> &dest) const\\n\\n {\\n\\n eigen_assert(m_factorizationIsOk && \\\"The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()\\\");\\n\\n const Index size = m_cholmodFactor->n;\\n\\n EIGEN_UNUSED_VARIABLE(size);\\n\\n eigen_assert(size==b.rows());\\n\\n\\n\\n // Cholmod needs column-major storage without inner-stride, which corresponds to the default behavior of Ref.\\n\",\n \"file_path\": \"src/Eigen/src/CholmodSupport/CholmodSupport.h\",\n \"rank\": 87,\n \"score\": 29.873523821141397\n },\n {\n \"content\": \" typedef Replicate<ExpressionType,(isVertical?Dynamic:1),(isHorizontal?Dynamic:1)> ReplicateReturnType;\\n\\n EIGEN_DEVICE_FUNC\\n\\n const ReplicateReturnType replicate(Index factor) const;\\n\\n\\n\\n /**\\n\\n * \\\\return an expression of the replication of each column (or row) of \\\\c *this\\n\\n *\\n\\n * Example: \\\\include DirectionWise_replicate.cpp\\n\\n * Output: \\\\verbinclude DirectionWise_replicate.out\\n\\n *\\n\\n * \\\\sa VectorwiseOp::replicate(Index), DenseBase::replicate(), class Replicate\\n\\n */\\n\\n // NOTE implemented here because of sunstudio's compilation errors\\n\\n // isVertical*Factor+isHorizontal instead of (isVertical?Factor:1) to handle CUDA bug with ternary operator\\n\\n template<int Factor> const Replicate<ExpressionType,isVertical*Factor+isHorizontal,isHorizontal*Factor+isVertical>\\n\\n EIGEN_DEVICE_FUNC\\n\\n replicate(Index factor = Factor) const\\n\\n {\\n\\n return Replicate<ExpressionType,(isVertical?Factor:1),(isHorizontal?Factor:1)>\\n\\n (_expression(),isVertical?factor:1,isHorizontal?factor:1);\\n\",\n \"file_path\": \"src/Eigen/src/Core/VectorwiseOp.h\",\n \"rank\": 88,\n \"score\": 29.532755779828108\n },\n {\n \"content\": \"//------------------------------------------------------------------------------\\n\\nvoid MFSGDDecentralized::extract_raw_ratings(unsigned userrank,\\n\\n unsigned howmany,\\n\\n TripletVector<uint8_t> &dst) {\\n\\n std::set<unsigned> sharing_indices;\\n\\n std::default_random_engine generator;\\n\\n std::uniform_int_distribution<int> distribution(0, node_data_->size()-1);\\n\\n \\n\\n howmany = std::min(howmany, (unsigned) node_data_->size());\\n\\n\\n\\n while(sharing_indices.size() < howmany) {\\n\\n sharing_indices.insert(distribution(generator));\\n\\n }\\n\\n\\n\\n int i = 0, count = 0;\\n\\n for(const auto& x: *node_data_) {\\n\\n if(sharing_indices.find(i) != sharing_indices.end()) {\\n\\n int user = x.first.first, item = x.first.second;\\n\\n assert(x.second >= 0 && x.second <= 10);\\n\\n dst.emplace_back(user, item, x.second);\\n\",\n \"file_path\": \"src/machine_learning/mf_decentralized.cpp\",\n \"rank\": 89,\n \"score\": 29.21144611463507\n },\n {\n \"content\": \" * of each column (or row) of the referenced expression.\\n\\n *\\n\\n * Example: \\\\include PartialRedux_sum.cpp\\n\\n * Output: \\\\verbinclude PartialRedux_sum.out\\n\\n *\\n\\n * \\\\sa DenseBase::sum() */\\n\\n EIGEN_DEVICE_FUNC\\n\\n const SumReturnType sum() const\\n\\n { return SumReturnType(_expression()); }\\n\\n\\n\\n /** \\\\returns a row (or column) vector expression of the mean\\n\\n * of each column (or row) of the referenced expression.\\n\\n *\\n\\n * \\\\sa DenseBase::mean() */\\n\\n EIGEN_DEVICE_FUNC\\n\\n const MeanReturnType mean() const\\n\\n { return sum() / Scalar(Direction==Vertical?m_matrix.rows():m_matrix.cols()); }\\n\\n\\n\\n /** \\\\returns a row (or column) vector expression representing\\n\\n * whether \\\\b all coefficients of each respective column (or row) are \\\\c true.\\n\",\n \"file_path\": \"src/Eigen/src/Core/VectorwiseOp.h\",\n \"rank\": 90,\n \"score\": 28.8175308950414\n },\n {\n \"content\": \" {\\n\\n m_factorizationIsOk = true;\\n\\n m_info = Success;\\n\\n }\\n\\n } while(m_info!=Success);\\n\\n}\\n\\n\\n\\ntemplate<typename Scalar, int _UpLo, typename OrderingType>\\n\\ninline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol)\\n\\n{\\n\\n if (jk < colPtr(col+1) )\\n\\n {\\n\\n Index p = colPtr(col+1) - jk;\\n\\n Index minpos; \\n\\n rowIdx.segment(jk,p).minCoeff(&minpos);\\n\\n minpos += jk;\\n\\n if (rowIdx(minpos) != rowIdx(jk))\\n\\n {\\n\\n //Swap\\n\\n std::swap(rowIdx(jk),rowIdx(minpos));\\n\",\n \"file_path\": \"src/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h\",\n \"rank\": 92,\n \"score\": 28.332726895576602\n },\n {\n \"content\": \" */\\n\\n Array<StorageIndex,IPARM_SIZE,1>& iparm()\\n\\n {\\n\\n return m_iparm; \\n\\n }\\n\\n \\n\\n /** Return a reference to a particular index parameter of the IPARM vector \\n\\n * \\\\sa iparm()\\n\\n */\\n\\n \\n\\n int& iparm(int idxparam)\\n\\n {\\n\\n return m_iparm(idxparam);\\n\\n }\\n\\n \\n\\n /** Returns a reference to the double vector DPARM of PaStiX parameters \\n\\n * The statistics related to the different phases of factorization and solve are saved here as well\\n\\n * \\\\sa analyzePattern() factorize()\\n\\n */\\n\\n Array<double,DPARM_SIZE,1>& dparm()\\n\",\n \"file_path\": \"src/Eigen/src/PaStiXSupport/PaStiXSupport.h\",\n \"rank\": 93,\n \"score\": 28.324687013450983\n },\n {\n \"content\": \" std::pair<int, int> dim = read_and_split(fname, train, test, cap);\\n\\n if (dim.first == 0 || dim.second == 0) return false;\\n\\n\\n\\n int num_users_per_node = dim.first / num_nodes,\\n\\n remaining_users = dim.first % num_nodes;\\n\\n std::vector<int> users_per_node(num_nodes, num_users_per_node);\\n\\n if (remaining_users > 0) {\\n\\n do {\\n\\n users_per_node[remaining_users]++;\\n\\n } while (--remaining_users);\\n\\n }\\n\\n\\n\\n size_t train_count = 0, test_count = 0; // for later validation\\n\\n\\n\\n int i = 0, // counter for train data\\n\\n j = 0, // counter for test data\\n\\n node_index = 0;\\n\\n while (node_index < num_nodes) {\\n\\n // create training data\\n\\n auto node_train_data = std::make_shared<DataStore>();\\n\",\n \"file_path\": \"src/local_decentralized_training.cpp\",\n \"rank\": 94,\n \"score\": 28.322822374942344\n },\n {\n \"content\": \" results.emplace_back(std::make_pair(n.rank(), shared->get_future()));\\n\\n tp.add_task([shared]() { (*shared)(); });\\n\\n }\\n\\n\\n\\n double sum_train_err = 0, sum_test_err = 0, sum_time = 0, sum_items = 0,\\n\\n sumbout = 0, sumbin = 0;\\n\\n unsigned count = 0;\\n\\n for (auto &kv : results) {\\n\\n kv.second.wait(); // barrier\\n\\n auto retval = kv.second.get();\\n\\n sum_train_err += retval.train_err;\\n\\n sum_items += retval.train_count;\\n\\n sum_test_err += retval.test_err;\\n\\n sum_time += retval.duration;\\n\\n sumbout += retval.bytes_out;\\n\\n sumbin += retval.bytes_in;\\n\\n ++count;\\n\\n }\\n\\n epoch_stats_.stop();\\n\\n std::cout << epoch << \\\";\\\" << absolute_timer_.stop() << \\\";\\\"\\n\",\n \"file_path\": \"src/machine_learning/mf_coordinator.cpp\",\n \"rank\": 95,\n \"score\": 28.26125428387969\n },\n {\n \"content\": \" template<bool DoLDLT>\\n\\n void factorize_preordered(const CholMatrixType& a);\\n\\n\\n\\n void analyzePattern(const MatrixType& a, bool doLDLT)\\n\\n {\\n\\n eigen_assert(a.rows()==a.cols());\\n\\n Index size = a.cols();\\n\\n CholMatrixType tmp(size,size);\\n\\n ConstCholMatrixPtr pmat;\\n\\n ordering(a, pmat, tmp);\\n\\n analyzePattern_preordered(*pmat,doLDLT);\\n\\n }\\n\\n void analyzePattern_preordered(const CholMatrixType& a, bool doLDLT);\\n\\n \\n\\n void ordering(const MatrixType& a, ConstCholMatrixPtr &pmat, CholMatrixType& ap);\\n\\n\\n\\n /** keeps off-diagonal entries; drops diagonal entries */\\n\\n struct keep_diag {\\n\\n inline bool operator() (const Index& row, const Index& col, const Scalar&) const\\n\\n {\\n\",\n \"file_path\": \"src/Eigen/src/SparseCholesky/SimplicialCholesky.h\",\n \"rank\": 96,\n \"score\": 28.101176256852927\n },\n {\n \"content\": \" * This expression can be assigned to a vector with entries of type \\\\c bool.\\n\\n *\\n\\n * \\\\sa DenseBase::all() */\\n\\n EIGEN_DEVICE_FUNC\\n\\n const AllReturnType all() const\\n\\n { return AllReturnType(_expression()); }\\n\\n\\n\\n /** \\\\returns a row (or column) vector expression representing\\n\\n * whether \\\\b at \\\\b least one coefficient of each respective column (or row) is \\\\c true.\\n\\n * This expression can be assigned to a vector with entries of type \\\\c bool.\\n\\n *\\n\\n * \\\\sa DenseBase::any() */\\n\\n EIGEN_DEVICE_FUNC\\n\\n const AnyReturnType any() const\\n\\n { return AnyReturnType(_expression()); }\\n\\n\\n\\n /** \\\\returns a row (or column) vector expression representing\\n\\n * the number of \\\\c true coefficients of each respective column (or row).\\n\\n * This expression can be assigned to a vector whose entries have the same type as is used to\\n\\n * index entries of the original matrix; for dense matrices, this is \\\\c std::ptrdiff_t .\\n\",\n \"file_path\": \"src/Eigen/src/Core/VectorwiseOp.h\",\n \"rank\": 97,\n \"score\": 28.03224608853849\n },\n {\n \"content\": \" else dest = y.topRows(cols());\\n\\n \\n\\n m_info = Success;\\n\\n return true;\\n\\n }\\n\\n\\n\\n /** Sets the threshold that is used to determine linearly dependent columns during the factorization.\\n\\n *\\n\\n * In practice, if during the factorization the norm of the column that has to be eliminated is below\\n\\n * this threshold, then the entire column is treated as zero, and it is moved at the end.\\n\\n */\\n\\n void setPivotThreshold(const RealScalar& threshold)\\n\\n {\\n\\n m_useDefaultThreshold = false;\\n\\n m_threshold = threshold;\\n\\n }\\n\\n \\n\\n /** \\\\returns the solution X of \\\\f$ A X = B \\\\f$ using the current decomposition of A.\\n\\n *\\n\\n * \\\\sa compute()\\n\",\n \"file_path\": \"src/Eigen/src/SparseQR/SparseQR.h\",\n \"rank\": 98,\n \"score\": 27.808195815468125\n },\n {\n \"content\": \" if (items[0].revents & ZMQ_POLLIN) {\\n\\n handle_backend();\\n\\n }\\n\\n if (items[1].revents & ZMQ_POLLIN) {\\n\\n handle_frontend();\\n\\n }\\n\\n }\\n\\n\\n\\n for (int i = 0; i < thread_count; ++i) {\\n\\n t[i]->join();\\n\\n delete t[i];\\n\\n }\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nvoid AsyncZmq::announce_completion(int rank, char t) {\\n\\n {\\n\\n std::unique_lock<std::mutex> lock(oqueue_mtx_);\\n\\n outqueue_.push(\\n\\n std::make_pair(rank, pack(t + std::string(\\\"so long\\\"), TEXT)));\\n\",\n \"file_path\": \"src/communication/async_zmq.cpp\",\n \"rank\": 99,\n \"score\": 27.758600235700627\n }\n]","isConversational":false}}},{"rowIdx":465,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"vtkMAF/Testing/vtkMAFVolumeResampleTest.cpp"},"repo_name":{"kind":"string","value":"FusionBox2/MAF2"},"commit":{"kind":"string","value":"b576955f4f6b954467021f12baedfebcaf79a382"},"file_code":{"kind":"string","value":"\n\n#include <cppunit/config/SourcePrefix.h>\n#include \"vtkMAFVolumeResampleTest.h\"\n\n#include \"vtkMAFSmartPointer.h\"\n#include \"vtkMAFVolumeResample.h\"\n\n#include \"vtkDataSet.h\"\n#include \"vtkStructuredPoints.h\"\n\n#include \"vtkRectilinearGridReader.h\"\n#include \"vtkRectilinearGrid.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkPointData.h\"\n#include \"vtkDataSetWriter.h\"\n\nusing namespace std;\n\nvoid vtkMAFVolumeResampleTest::TestResample()\n{\n const char *inFileName = \"volumeRG_dim_10_10_10_bounds_1_10_1_10_1_10.vtk\";\n \n const char *outVTKFileName= \"resampled_volumeRG_dim_10_10_10_bounds_1_10_1_10_1_10.vtk\";\n\n TestResampleInternal(inFileName, outVTKFileName );\n\n inFileName = \"volumeRG_dim_10_10_10_bounds_m5_5_m5_5_m5_5.vtk\";\n\n outVTKFileName= \"resampled_volumeRG_dim_10_10_10_bounds_m5_5_m5_5_m5_5.vtk\";\n \n TestResampleInternal(inFileName, outVTKFileName );\n \n}\n\nvoid vtkMAFVolumeResampleTest::TestResampleInternal( const char *inFileName , const char *outVTKFileName )\n{ \n std::string absPathFilename=MAF_DATA_ROOT;\n absPathFilename += \"/Test_VolumeResample/\";\n absPathFilename.append(inFileName);\n\n vtkRectilinearGridReader *reader = vtkRectilinearGridReader::New();\n\n reader->SetFileName(absPathFilename.c_str());\n reader->Update();\n\n double inputDataSpacing[3];\n vtkRectilinearGrid *rg = reader->GetOutput();\n\n inputDataSpacing[0] = rg->GetXCoordinates()->GetComponent(1,0)-rg->GetXCoordinates()->GetComponent(0,0);\n inputDataSpacing[1] = rg->GetYCoordinates()->GetComponent(1,0)-rg->GetYCoordinates()->GetComponent(0,0);\n inputDataSpacing[2] = rg->GetZCoordinates()->GetComponent(1,0)-rg->GetZCoordinates()->GetComponent(0,0);\n \n PrintDouble3(cout, inputDataSpacing, \"inputDataSpacing\");\n\n double inputDataOrigin[3];\n inputDataOrigin[0] = rg->GetXCoordinates()->GetComponent(0,0);\n inputDataOrigin[1] = rg->GetYCoordinates()->GetComponent(0,0);\n inputDataOrigin[2] = rg->GetZCoordinates()->GetComponent(0,0);\n \n PrintDouble3(cout, inputDataOrigin, \"inputDataOrigin\");\n\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetZeroValue(0);\n resample->SetInput(reader->GetOutput());\n\n resample->SetVolumeOrigin(inputDataOrigin);\n PrintDouble3(cout, inputDataOrigin, \"inputDataOrigin\");\n\n vtkTransform *transform = vtkTransform::New();\n transform->Identity();\n transform->Update();\n \n double xAxis[3] = {0,0,0};\n for (int i = 0; i < 3; i++)\n {\n xAxis[i] = transform->GetMatrix()->GetElement(i, 0);\n }\n resample->SetVolumeAxisX(xAxis);\n PrintDouble3(cout, xAxis, \"xAxis\");\n\n double yAxis[3] = {0,0,0};\n for (int i = 0; i < 3; i++)\n {\n yAxis[i] = transform->GetMatrix()->GetElement(i, 1);\n }\n resample->SetVolumeAxisY(yAxis);\n PrintDouble3(cout, yAxis, \"yAxis\");\n\n double sr[2];\n rg->GetScalarRange(sr);\n\n double w = sr[1] - sr[0];\n double l = (sr[1] + sr[0]) * 0.5;\n\n resample->SetWindow(w);\n resample->SetLevel(l);\n resample->AutoSpacingOff();\n \n vtkStructuredPoints *outputSP = vtkStructuredPoints::New();\n \n outputSP->SetSource(NULL);\n outputSP->SetOrigin(inputDataOrigin);\n outputSP->SetSpacing(inputDataSpacing);\n outputSP->SetScalarType(rg->GetPointData()->GetScalars()->GetDataType());\n \n double resamplingBoxBounds[6];\n rg->GetBounds(resamplingBoxBounds);\n int outputSPExtent[6];\n outputSPExtent[0] = 0;\n outputSPExtent[1] = (resamplingBoxBounds[1] - resamplingBoxBounds[0]) / inputDataSpacing[0];\n outputSPExtent[2] = 0;\n outputSPExtent[3] = (resamplingBoxBounds[3] - resamplingBoxBounds[2]) / inputDataSpacing[1];\n outputSPExtent[4] = 0;\n outputSPExtent[5] = (resamplingBoxBounds[5] - resamplingBoxBounds[4]) / inputDataSpacing[2];\n outputSP->SetExtent(outputSPExtent);\n outputSP->SetUpdateExtent(outputSPExtent);\n outputSP->Modified();\n\n resample->SetOutput(outputSP);\n resample->Update();\n \n double inBounds[6] = {0,0,0};\n rg->GetBounds(inBounds);\n\n double checkBounds[6];\n outputSP->GetBounds(checkBounds);\n \n CPPUNIT_ASSERT(checkBounds[0]==inBounds[0] && checkBounds[1]==inBounds[1] && checkBounds[2]==inBounds[2]);\n CPPUNIT_ASSERT(checkBounds[3]==inBounds[3] && checkBounds[4]==inBounds[4] && checkBounds[5]==inBounds[5]);\n\n WriteVTKDatasetToFile(outputSP, outVTKFileName);\n \n reader->Delete();\n resample->Delete(); \n outputSP->Delete();\n transform->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::WriteVTKDatasetToFile( vtkDataSet * outputVolumeVTKData, const char *outputFilename )\n{\n vtkMAFSmartPointer<vtkDataSetWriter> writer;\n writer->SetInput(outputVolumeVTKData);\n\n string fullPathOutputFilename;\n fullPathOutputFilename.append(MAF_DATA_ROOT);\n fullPathOutputFilename.append(\"/Test_VolumeResample/\");\n fullPathOutputFilename.append(outputFilename);\n cout << fullPathOutputFilename;\n\n writer->SetFileName(fullPathOutputFilename.c_str());\n writer->SetFileTypeToASCII();\n writer->Write();\n}\n\nvoid vtkMAFVolumeResampleTest::PrintDouble6( ostream& os, double array[6], const char *logMessage )\n{\n\n if (logMessage) os << logMessage << std::endl;\n os << \"xmin, xmax [\" << array[0] << \" , \" << array[1] << \"]\" << std::endl;\n os << \"ymin, ymax [\" << array[2] << \" , \" << array[3] << \"]\" << std::endl;\n os << \"zmin, zmax [\" << array[4] << \" , \" << array[5] << \"]\" << std::endl;\n os << std::endl;\n}\n\nvoid vtkMAFVolumeResampleTest::PrintDouble3( ostream& os, double array[3], const char *logMessage )\n{\n if (logMessage) os << logMessage << \" [\" << array[0] << \" , \" << array[1] << \" , \" << array[2] << \" ]\" << std::endl;\n os << std::endl;\n}\n\nvoid vtkMAFVolumeResampleTest::PrintInt3( ostream& os, int array[3], const char *logMessage )\n{\n if (logMessage) os << logMessage << \" [\" << array[0] << \" , \" << array[1] << \" , \" << array[2] << \" ]\" << std::endl;\n os << std::endl;\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetVolumeOrigin()\n{\n double volumeOrigin[3] = {1,2,3};\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetVolumeOrigin(volumeOrigin);\n\n double checkVolumeOrigin[3] = {1,2,3};\n resample->GetVolumeOrigin(checkVolumeOrigin);\n\n for (int i = 0; i < 3; i++) \n {\n CPPUNIT_ASSERT(checkVolumeOrigin[i] == volumeOrigin[i]);\n }\n \n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetVolumeAxisX()\n{\n double volumeAxisX[3] = {0,0,1};\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetVolumeAxisX(volumeAxisX);\n\n double checkVolumeAxisX[3] = {0,0,1};\n resample->GetVolumeAxisX(checkVolumeAxisX);\n\n for (int i = 0; i < 3; i++) \n {\n CPPUNIT_ASSERT(checkVolumeAxisX[i] == volumeAxisX[i]);\n }\n\n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetVolumeAxisY()\n{\n double volumeAxisY[3] = {0,0,1};\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetVolumeAxisY(volumeAxisY);\n\n double checkVolumeAxisY[3] = {0,0,1};\n resample->GetVolumeAxisY(checkVolumeAxisY);\n\n for (int i = 0; i < 3; i++) \n {\n CPPUNIT_ASSERT(checkVolumeAxisY[i] == volumeAxisY[i]);\n }\n\n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetWindow()\n{\n double window = 10;\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetWindow(window);\n\n double checkWindow = 10;\n resample->GetWindow();\n\n CPPUNIT_ASSERT(checkWindow == window);\n\n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetLevel()\n{\n double level = 10;\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetLevel(level);\n\n double checkLevel = 10;\n resample->GetLevel();\n\n CPPUNIT_ASSERT(checkLevel == level);\n \n resample->Delete();\n}"},"prefix":{"kind":"string","value":"\n\n#include <cppunit/config/SourcePrefix.h>\n#include \"vtkMAFVolumeResampleTest.h\"\n\n#include \"vtkMAFSmartPointer.h\"\n#include \"vtkMAFVolumeResample.h\"\n\n#include \"vtkDataSet.h\"\n#include \"vtkStructuredPoints.h\"\n\n#include \"vtkRectilinearGridReader.h\"\n#include \"vtkRectilinearGrid.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkPointData.h\"\n#include \"vtkDataSetWriter.h\"\n\nusing namespace std;\n\nvoid vtkMAFVolumeResampleTest::TestResample()\n{\n const char *inFileName = \"volumeRG_dim_10_10_10_bounds_1_10_1_10_1_10.vtk\";\n \n const char *outVTKFileName= \"resampled_volumeRG_dim_10_10_10_bounds_1_10_1_10_1_10.vtk\";\n\n TestResampleInternal(inFileName, outVTKFileName );\n\n inFileName = \"volumeRG_dim_10_10_10_bounds_m5_5_m5_5_m5_5.vtk\";\n\n outVTKFileName= \"resampled_volumeRG_dim_10_10_10_bounds_m5_5_m5_5_m5_5.vtk\";\n \n TestResampleInternal(inFileName, outVTKFileName );\n \n}\n\nvoid vtkMAFVolumeResampleTest::TestResampleInternal( const char *inFileName , const char *outVTKFileName )\n{ \n std::string absPathFilename=MAF_DATA_ROOT;\n absPathFilename += \"/Test_VolumeResample/\";\n absPathFilename.append(inFileName);\n\n vtkRectilinearGridReader *reader = vtkRectilinearGridReader::New();\n\n reader->SetFileName(absPathFilename.c_str());\n reader->Update();\n\n double inputDataSpacing[3];\n vtkRectilinearGrid *rg = reader->GetOutput();\n\n inputDataSpacing[0] = rg->GetXCoordinates()->GetComponent(1,0)-rg->GetXCoordinates()->GetComponent(0,0);\n inputDataSpacing[1] = rg->GetYCoordinates()->GetComponent(1,0)-rg->GetYCoordinates()->GetComponent(0,0);\n inputDataSpacing[2] = rg->GetZCoordinates()->GetComponent(1,0)-rg->GetZCoordinates()->GetComponent(0,0);\n \n PrintDouble3(cout, inputDataSpacing, \"inputDataSpacing\");\n\n double inputDataOrigin[3];\n inputDataOrigin[0] = rg->GetXCoordinates()->GetComponent(0,0);\n inputDataOrigin[1] = rg->GetYCoordinates()->GetComponent(0,0);\n inputDataOrigin[2] = rg->GetZCoordinates()->GetComponent(0,0);\n \n PrintDouble3(cout, inputDataOrigin, \"inputDataOrigin\");\n\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetZeroValue(0);\n resample->SetInput(reader->GetOutput());\n\n resample->SetVolumeOrigin(inputDataOrigin);\n PrintDouble3(cout, inputDataOrigin, \"inputDataOrigin\");\n\n vtkTransform *transform = vtkTransform::New();\n transform->Identity();\n transform->Update();\n \n double xAxis[3] = {0,0,0};\n for (int i = 0; i < 3; i++)\n {\n xAxis[i] = transform->GetMatrix()->GetElement(i, 0);\n }\n resample->SetVolumeAxisX(xAxis);\n PrintDouble3(cout, xAxis, \"xAxis\");\n\n double yAxis[3] = {0,0,0};\n for (int i = 0; i < 3; i++)\n {\n yAxis[i] = transform->GetMatrix()->GetElement(i, 1);\n }\n resample->SetVolumeAxisY(yAxis);\n PrintDouble3(cout, yAxis, \"yAxis\");\n\n double sr[2];\n rg->GetScalarRange(sr);\n\n double w = sr[1] - sr[0];\n double l = (sr[1] + sr[0]) * 0.5;\n\n resample->SetWindow(w);\n resample->SetLevel(l);\n resample->AutoSpacingOff();\n \n vtkStructuredPoints *outputSP = vtkStructuredPoints::New();\n \n outputSP->SetSource(NULL);\n outputSP->SetOrigin(inputDataOrigin);\n outputSP->SetSpacing(inputDataSpacing);\n outputSP->SetScalarType(rg->GetPointData()->GetScalars()->GetDataType());\n \n double resamplingBoxBounds[6];\n rg->GetBounds(resamplingBoxBounds);\n int outputSPExtent[6];\n outputSPExtent[0] = 0;\n outputSPExtent[1] = (resamplingBoxBounds[1] - resamplingBoxBounds[0]) / inputDataSpacing[0];\n outputSPExtent[2] = 0;\n outputSPExtent[3] = (resamplingBoxBounds[3] - resamplingBoxBounds[2]) / inputDataSpacing[1];\n outputSPExtent[4] = 0;\n outputSPExtent[5] = (resamplingBoxBounds[5] - resamplingBoxBounds[4]) / inputDataSpacing[2];\n outputSP->SetExtent(outputSPExtent);\n outputSP->SetUpdateExtent(outputSPExtent);\n outputSP->Modified();\n\n resample->SetOutput(outputSP);\n resample->Update();\n \n double inBounds[6] = {0,0,0};\n rg->GetBounds(inBounds);\n\n double checkBounds[6];\n outputSP->GetBounds(checkBounds);\n \n CPPUNIT_ASSERT(checkBounds[0]==inBounds[0] && checkBounds[1]==inBounds[1] && checkBounds[2]==inBounds[2]);\n CPPUNIT_ASSERT(checkBounds[3]==inBounds[3] && checkBounds[4]==inBounds[4] && checkBounds[5]==inBounds[5]);\n\n WriteVTKDatasetToFile(outputSP, outVTKFileName);\n \n reader->Delete();\n resample->Delete(); \n outputSP->Delete();\n transform->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::WriteVTKDatasetToFile( vtkDataSet * outputVolumeVTKData, const char *outputFilename )\n{\n vtkMAFSmartPointer<vtkDataSetWriter> writer;\n writer->SetInput(outputVolumeVTKData);\n\n string fullPathOutputFilename;\n fullPathOutputFilename.append(MAF_DATA_ROOT);\n fullPathOutputFilename.append(\"/Test_VolumeResample/\");\n fullPathOutputFilename.append(outputFilename);\n cout << fullPathOutputFilename;\n\n writer->SetFileName(fullPathOutputFilename.c_str());\n writer->SetFileTypeToASCII();\n writer->Write();\n}\n\nvoid vtkMAFVolumeResampleTest::PrintDouble6( ostream& os, double array[6], const char *logMessage )\n{\n\n if (logMessage) os << logMessage << std::endl;\n os << \"xmin, xmax [\" << array[0] << \" , \" << array[1] << \"]\" << std::endl;\n os << \"ymin, ymax [\" << array[2] << \" , \" << array[3] << \"]\" << std::endl;\n os << \"zmin, zmax [\" << array[4] << \" , \" << array[5] << \"]\" << std::endl;\n os << std::endl;\n}\n\nvoid vtkMAFVolumeResampleTest::PrintDouble3( ostream& os, double array[3], const char *logMessage )\n{\n if (logMessage) os << logMessage << \" [\" << array[0] << \" , \" << array[1] << \" , \" << array[2] << \" ]\" << std::endl;\n os << std::endl;\n}\n\nvoid vtkMAFVolumeResampleTest::PrintInt3( ostream& os, int array[3], const char *logMessage )\n{\n if (logMessage) os << logMessage << \" [\" << array[0] << \" , \" << array[1] << \" , \" << array[2] << \" ]\" << std::endl;\n os << std::endl;\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetVolumeOrigin()\n{\n double volumeOrigin[3] = {1,2,3};\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetVolumeOrigin(volumeOrigin);\n\n double checkVolum"},"suffix":{"kind":"string","value":"== volumeOrigin[i]);\n }\n \n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetVolumeAxisX()\n{\n double volumeAxisX[3] = {0,0,1};\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetVolumeAxisX(volumeAxisX);\n\n double checkVolumeAxisX[3] = {0,0,1};\n resample->GetVolumeAxisX(checkVolumeAxisX);\n\n for (int i = 0; i < 3; i++) \n {\n CPPUNIT_ASSERT(checkVolumeAxisX[i] == volumeAxisX[i]);\n }\n\n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetVolumeAxisY()\n{\n double volumeAxisY[3] = {0,0,1};\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetVolumeAxisY(volumeAxisY);\n\n double checkVolumeAxisY[3] = {0,0,1};\n resample->GetVolumeAxisY(checkVolumeAxisY);\n\n for (int i = 0; i < 3; i++) \n {\n CPPUNIT_ASSERT(checkVolumeAxisY[i] == volumeAxisY[i]);\n }\n\n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetWindow()\n{\n double window = 10;\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetWindow(window);\n\n double checkWindow = 10;\n resample->GetWindow();\n\n CPPUNIT_ASSERT(checkWindow == window);\n\n resample->Delete();\n}\n\nvoid vtkMAFVolumeResampleTest::TestSetGetLevel()\n{\n double level = 10;\n vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();\n resample->SetLevel(level);\n\n double checkLevel = 10;\n resample->GetLevel();\n\n CPPUNIT_ASSERT(checkLevel == level);\n \n resample->Delete();\n}"},"middle":{"kind":"string","value":"eOrigin[3] = {1,2,3};\n resample->GetVolumeOrigin(checkVolumeOrigin);\n\n for (int i = 0; i < 3; i++) \n {\n CPPUNIT_ASSERT(checkVolumeOrigin[i] "},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"class vtkTransform;\n","file_path":"Interaction/mafCameraTransform.h","rank":0,"score":127481.85520661279},{"content":"class vtkTransform;\n","file_path":"Testing/Base/mafTransformFrameTest.h","rank":1,"score":124946.89338589914},{"content":"class vtkTransform;\n","file_path":"Testing/Base/vtkMAFToLinearTransformTest.h","rank":2,"score":123742.2093744945},{"content":"class vtkTransform;\n","file_path":"Interaction/mafGizmoHandle.h","rank":3,"score":113059.86267520633},{"content":"class vtkTransform;\n","file_path":"Interaction/mafAvatar3D.h","rank":4,"score":113059.86267520633},{"content":" OVERLAPPED osReader; /* overlapped structure for reading */\n","file_path":"Interaction/Drivers/serial.h","rank":5,"score":112943.25534293203},{"content":"class vtkTransform;\n\n\n\n/** Basic gizmo component used to perform constrained translation on one axis.\n\n \n\n @sa mafGizmoTranslate \n\n*/\n","file_path":"Interaction/mafGizmoTranslateAxis.h","rank":6,"score":111390.35053719708},{"content":"class vtkTransform;\n","file_path":"Interaction/mafGizmoRotateFan.h","rank":7,"score":111390.35053719708},{"content":"class vtkTransform;\n","file_path":"Interaction/mafGizmoTranslatePlane.h","rank":8,"score":111390.35053719708},{"content":"class vtkTransform;\n\n\n\n/** Gizmo component used to perform isotropic scaling.\n\n \n\n @sa mafGizmoScale\n\n*/\n","file_path":"Interaction/mafGizmoScaleIsotropic.h","rank":9,"score":111390.35053719708},{"content":"class vtkTransform;\n","file_path":"VME/mafVMERefSys.h","rank":10,"score":111390.35053719708},{"content":"class vtkTransform;\n","file_path":"Interaction/mafGizmoBoundingBox.h","rank":11,"score":111390.35053719708},{"content":"class vtkTransform;\n","file_path":"Interaction/mafGizmoAutoscaleHelper.h","rank":12,"score":111390.35053719708},{"content":"class vtkTransform;\n\n\n\n/** Basic gizmo component used to perform constrained scaling along one axis.\n\n \n\n @sa mafGizmoScale\n\n*/\n","file_path":"Interaction/mafGizmoScaleAxis.h","rank":13,"score":111390.35053719708},{"content":"class vtkTransform;\n\n\n\ntemplate class MAF_EXPORT mafAutoPointer<mafMatrix>;\n\n\n\n//----------------------------------------------------------------------------\n\n/** Basic gizmo component used to perform constrained rotation around an axis.\n\n \n\n @sa mafGizmoRotate\n\n*/\n","file_path":"Interaction/mafGizmoRotateCircle.h","rank":14,"score":111390.35053719708},{"content":"//class vtkImageData;\n\nclass vtkRectilinearGrid;\n\n\n\n\n","file_path":"vtkMAF/vtkMAFVolumeResample.h","rank":15,"score":108454.3476626176},{"content":"class vtkTransform;\n","file_path":"vtkMAF/vtkMAFAnnotatedCubeActor.h","rank":16,"score":108311.02057408824},{"content":"class vtkTransform;\n","file_path":"vtkMAF/vtkMAFGlobalAxesHeadActor.h","rank":17,"score":106888.07777783138},{"content":"class vtkTransform;\n","file_path":"vtkMAF/vtkMAFRayCast3DPicker.h","rank":18,"score":106888.07777783138},{"content":" function is of type void *, and returns NULL.\n\n Otherwise the type is void which is correct for WIN32\n\n and SPROC\n\n*/ \n\n#ifdef CMAKE_USE_SPROC_INIT\n\ntypedef int mmuThreadProcessIDType;\n\n#endif\n\n\n\n\n\n#ifdef CMAKE_USE_PTHREADS_INIT\n\ntypedef void *(*mmuInternalThreadFunctionType)(void *);\n\ntypedef pthread_t mmuThreadProcessIDType;\n\n#endif\n\n\n\n#ifdef CMAKE_USE_WIN32_THREADS_INIT\n\ntypedef LPTHREAD_START_ROUTINE mmuInternalThreadFunctionType;\n\ntypedef HANDLE mmuThreadProcessIDType;\n\n#endif\n\n\n\n#if !defined(CMAKE_USE_PTHREADS_INIT) && !defined(CMAKE_USE_WIN32_THREADS_INIT)\n\ntypedef void (*mmuInternalThreadFunctionType)(void *);\n\ntypedef int mmuThreadProcessIDType;\n\n#endif\n\n\n\n\n","file_path":"Base/mafMultiThreader.h","rank":19,"score":89890.90225688777},{"content":"class ListOfPolyline2D : public std::vector<Polyline2D*> \n\n{\n\npublic:\n\n /** Clear the list of polylines. */\n\n void clear();\n\n /** check if point is inside the contour */\n\n bool IsInside(int x, int y, int polylineLengthThreshold);\n\n /** retrieve contour polyline */\n\n Polyline2D *FindContour(int x, int y, int polylineLengthThreshold, int distance = 1);\n\n};\n\n\n\n\n\n\n\n\n\n\n\n#endif\n","file_path":"vtkMAF/vtkMAFContourVolumeMapper.h","rank":20,"score":85503.3082038713},{"content":" class ListOfPolyline2DGPU : public std::vector<Polyline2DGPU*> \n\n {\n\n public:\n\n /** Clear the list of polylines. */\n\n void clear();\n\n /** check if point is inside the contour */\n\n bool IsInside(int x, int y, int polylineLengthThreshold);\n\n /** retrieve contour polyline */\n\n Polyline2DGPU *FindContour(int x, int y, int polylineLengthThreshold, int distance = 1);\n\n };\n\n//}//end baoquan space\n\n#endif\n","file_path":"vtkMAF/vtkMAFContourVolumeMapperGPU.h","rank":21,"score":84430.9551618731},{"content":"//----------------------------------------------------------------------------\n\n// constants\n\n//----------------------------------------------------------------------------\n\nenum MAF_TAG_IDS {MAF_MISSING_TAG=0,MAF_NUMERIC_TAG,MAF_STRING_TAG};\n\n\n\n//----------------------------------------------------------------------------\n\n// forward declarations\n\n//----------------------------------------------------------------------------\n\n\n\n/** an utility class for storing <key-type-array of values> information.\n\n an utility class for storing <key-type-array of values> information.\n\n @sa mafTagArray\n\n*/\n","file_path":"Core/mafTagItem.h","rank":22,"score":84403.6615299609},{"content":"class ListOfPolyline2DAdv : public std::vector<Polyline2DAdv*> \n\n{\n\npublic:\n\n /** Clear the list of polylines. */\n\n void clear();\n\n /** check if point is inside the contour */\n\n bool IsInside(int x, int y, int polylineLengthThreshold);\n\n /** retrieve contour polyline */\n\n Polyline2DAdv *FindContour(int x, int y, int polylineLengthThreshold, int distance = 1);\n\n};\n\n\n\n#endif\n","file_path":"vtkMAF/vtkMAFContourVolumeMapperAdv.h","rank":23,"score":82421.49761411735},{"content":"class mafCString : public mafString\n\n{\n\npublic:\n\n /** constructor. */\n\n mafCString(const char *str) {Set(str);}\n\n};\n\n\n\n#endif\n\n\n","file_path":"Base/mafString.h","rank":24,"score":79131.96552993653},{"content":"class MAF_EXPORT mafTransform : public mafTransformBase\n\n{\n\n public:\n\n //------------------------------------------------------------------------------\n\n // Events\n\n //------------------------------------------------------------------------------\n\n //MAF_ID_DEC(UpdateEvent); // Event rised by updates of the internal matrix\n\n\t\n\n mafTransform();\n\n ~mafTransform();\n\n\n\n //----------------------------------------------------------------------------\n\n // Ref Sys Type:\n\n //----------------------------------------------------------------------------\n\n enum \n\n {\n\n CUSTOM = 0, ///< auxiliar ref sys \n\n GLOBAL, \n\n PARENT,\n\n LOCAL, ///< the local ref sys of the VME\n","file_path":"Base/mafTransform.h","rank":25,"score":77084.77481879703},{"content":"class MAF_EXPORT mafCameraTransform:public mafTransformBase\n\n{\n\npublic:\n\n mafCameraTransform();\n\n virtual ~mafCameraTransform();\n\n\n\n mafTypeMacro(mafCameraTransform,mafTransformBase);\n\n \n\n enum AutoPositionModalities\n\n {\n\n ATTACH_TO_FOCAL_POINT, ///< Follow the focal point\n\n ATTACH_TO_CAMERA, ///< Follow the camera position\n\n ATTACH_TO_CLIPPING_PLANE ///< Follow the neat clipping plane\n\n };\n\n\n\n enum AutoFittingModalities\n\n {\n\n MAX_SCALE, ///< Select the maximum scale among X/Y (i.e. fit the minimum size)\n\n MIN_SCALE, ///< Select the minimum scale X/Y (i.e. fit the maximum size)\n\n FIT_X, ///< Always fit the X axis\n","file_path":"Interaction/mafCameraTransform.h","rank":26,"score":75303.09257940431},{"content":"class MAF_EXPORT mafTransformFrame : public mafTransformBase\n\n{\n\n public:\n\n mafTransformFrame();\n\n ~mafTransformFrame();\n\n\t\n\n mafTypeMacro(mafTransformFrame,mafTransformBase);\n\n\n\n //virtual void Print(std::ostream& os, const int tabs=0) const;\n\n\n\n /** set the matrix to be transformed */\n\n void SetInput(mafTransformBase *frame);\n\n void SetInput(mafMatrix *frame);\n\n mafTransformBase *GetInput() {return m_Input;}\n\n\n\n /**\n\n Set/Get the input reference system, i.e. the reference system of the \n\n input matrix.*/\n\n void SetInputFrame(mafMatrix *frame);\n\n void SetInputFrame(mafTransformBase *frame);\n","file_path":"Base/mafTransformFrame.h","rank":27,"score":75303.09257940431},{"content":"class vtkLinearTransform;\n","file_path":"Base/mafTransformBase.h","rank":28,"score":74191.18662171692},{"content":"class MAF_EXPORT vtkMAFToLinearTransform : public vtkLinearTransform\n\n{\n\n public:\n\n static vtkMAFToLinearTransform *New();\n\n vtkTypeRevisionMacro(vtkMAFToLinearTransform,vtkLinearTransform);\n\n void PrintSelf (ostream& os, vtkIndent indent);\n\n \n\n /** \n\n Set the input matrix. Any modifications to the MAF matrix will be\n\n reflected in the VTK transformation. This also set InputTransform to NULL.*/\n\n virtual void SetInputMatrix(mafMatrix *);\n\n\n\n /** return connected matrix if exists. */\n\n mafMatrix *GetInputMatrix() {return m_InputMatrix;}\n\n \n\n /** \n\n Set the input transform. Any modifications to the MAF transform will be\n\n reflected in the VTK transformation. This also set InputMatrix to NULL.*/\n\n virtual void SetInputTransform(mafTransformBase *);\n\n\n","file_path":"Base/vtkMAFToLinearTransform.h","rank":29,"score":73601.91076365368},{"content":"class vtkMAFToLinearTransform;\n\n\n\n#ifdef MAF_EXPORTS\n\ntemplate class MAF_EXPORT mafAutoPointer<mafMatrix>;\n\n#endif\n\n\n\n/** Superclass for Homogeneous transformations.\n\n mafTransformBase is the superclass for MAF geometric, and currently homogeneous\n\n only, transformations. The idea behind a mafTransformBase is the Update() method\n\n should always be called to update the output, which is a mafMatrix internally stored.\n\n @sa mafTransform\n\n @todo\n\n - change SetTimeStamp to apply a Modified(), than change matrix pipes to not call it!!!\n\n - implement issuing of a MATRIX_UPDATED event: add an event source member\n\n */\n","file_path":"Base/mafTransformBase.h","rank":30,"score":72945.35301645698},{"content":"class mafTransformBase;\n","file_path":"Base/vtkMAFToLinearTransform.h","rank":31,"score":72945.35301645698},{"content":"class MAF_EXPORT mafOpMAFTransform : public mafOpTransformInterface\n\n{\n\npublic:\n\n mafOpMAFTransform(const wxString &label = \"Transform \\tCtrl+T\");\n\n ~mafOpMAFTransform(); \n\n virtual void OnEvent(mafEventBase *maf_event);\n\n \n\n mafTypeMacro(mafOpMAFTransform, mafOp);\n\n\n\n mafOp* Copy();\n\n\n\n /** Return true for the acceptable vme type. */\n\n bool Accept(mafNode* vme);\n\n\n\n /** Builds operation's interface. */\n\n void OpRun();\n\n \n\n /** Execute the operation. */\n\n void OpDo();\n\n \n","file_path":"Operations/mafOpMAFTransform.h","rank":32,"score":72779.82162454759},{"content":"//support object\n\nclass mafTransformBaseDerivedClass : public mafTransformBase\n\n{\n\n\tmafTypeMacro(mafTransformBaseDerivedClass,mafTransformBase);\n\n\tmafTransformBaseDerivedClass(){;};\n\n\t\n\n\tvirtual void SetMatrix(const mafMatrix &input) {*m_Matrix=input;SetTimeStamp(input.GetTimeStamp());Modified();}\n\n\n\n\t~mafTransformBaseDerivedClass(){;};\n\n protected:\n\n\t\tvirtual void InternalUpdate(){;};\n\n};\n\n\n\n//----------------------------------------------------------------------------\n\nmafCxxTypeMacro(mafTransformBaseDerivedClass)\n\n//----------------------------------------------------------------------------\n\n\n\n//----------------------------------------------------------------------------\n\nvoid mafTransformBaseTest::TestFixture()\n\n//----------------------------------------------------------------------------\n\n{\n","file_path":"Testing/Base/mafTransformBaseTest.cpp","rank":33,"score":72779.82162454759},{"content":"class MAF_EXPORT mafGUITransformMouse : public mafGUITransformInterface\n\n{\n\npublic:\n\n mafGUITransformMouse(mafVME *input, mafObserver *listener = NULL, bool testMode = false);\n\n\t~mafGUITransformMouse(); \n\n\n\n // constraints enum\n\n enum TRANSFORM_MOUSE_WIDGET_ID\n\n {\n\n X_AXIS = 0,\n\n Y_AXIS, \n\n Z_AXIS,\n\n VIEW_PLANE, \n\n NORMAL_VIEW_PLANE,\n\n XY_PLANE, \n\n XZ_PLANE, \n\n YZ_PLANE,\n\n SURFACE_SNAP,\n\n NORMAL_SURFACE,\n\n };\n","file_path":"Interaction/mafGUITransformMouse.h","rank":34,"score":72779.82162454759},{"content":"class mafXMLString;\n\n\n","file_path":"Testing/IO/mafXMLStringTest.h","rank":35,"score":71903.45921210258},{"content":"class MAF_EXPORT mafXMLString\n\n{\n\npublic:\n\n\tmafXMLString() : m_WStr(0L), m_CStr(NULL) { };\n\n\tmafXMLString(const char *str);\n\n\tmafXMLString(XMLCh *wstr);\n\n\tmafXMLString(const XMLCh *wstr);\n\n\tmafXMLString(const mafXMLString ©);\n\n\t~mafXMLString();\n\n\tbool Append(const XMLCh *tail);\n\n\tbool Erase(const XMLCh *head, const XMLCh *tail);\n\n\tconst XMLCh* Begin() const;\n\n\tconst XMLCh* End() const;\n\n\tint Size() const;\n\n const char *GetCStr();\n\n\tXMLCh & operator [] (const int i);\n\n\tconst XMLCh operator [] (const int i) const;\n\n\toperator const XMLCh * () const { return m_WStr; };\n\n operator const char * () {return GetCStr();}\n\nprotected:\n\n XMLCh *m_WStr;\n\n char *m_CStr;\n\n};\n\n\n\n#endif\n","file_path":"IO/mafXMLString.h","rank":36,"score":71903.45921210258},{"content":"//----------------------------------------------------------------------------\n\n// widget id's\n\n//----------------------------------------------------------------------------\n\nenum MAF_TRANSFORM_ID\n\n{\n\n\tID_SHOW_GIZMO = MINID,\n\n ID_CHOOSE_GIZMO_COMBO,\n\n ID_ROTATION_STEP,\n\n ID_TRANSLATION_STEP,\n\n ID_ENABLE_STEP,\n\n ID_ROT_SNAP,\n\n ID_RESET,\n\n ID_AUX_REF_SYS,\n\n ID_ENABLE_SCALING,\n\n ID_ROLLOUT_TEXT_ENTRIES,\n\n ID_ROLLOUT_GIZMO_TRANSLATE,\n\n ID_ROLLOUT_GIZMO_ROTATE,\n\n ID_ROLLOUT_GIZMO_SCALE,\n\n ID_ROLLOUT_SAVE_POS\n\n};\n\n\n\n//----------------------------------------------------------------------------\n\nmafCxxTypeMacro(mafOpMAFTransform);\n","file_path":"Operations/mafOpMAFTransform.cpp","rank":37,"score":71740.66900505233},{"content":"class mafGUITransformMouse;\n","file_path":"Operations/mafOpTransformInterface.h","rank":38,"score":71740.66900505233},{"content":"class mafGUITransformMouse;\n","file_path":"Operations/mafOpMAFTransform.h","rank":39,"score":71740.66900505233},{"content":"class mafGUITransformInterfaceDummy : public mafGUITransformInterface\n\n{\n\npublic:\n\n mafGUITransformInterfaceDummy():mafGUITransformInterface(){};\n\n ~mafGUITransformInterfaceDummy(){};\n\n\n\n /*virtual*/ void EnableWidgets(bool enable){};\n\nprotected:\n\nprivate:\n\n};\n\n\n\n//----------------------------------------------------------------------------\n\nvoid mafGUITransformInterfaceTest::TestFixture()\n\n//----------------------------------------------------------------------------\n\n{\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid mafGUITransformInterfaceTest::setUp()\n\n//----------------------------------------------------------------------------\n\n{\n","file_path":"Testing/Interaction/mafGUITransformInterfaceTest.cpp","rank":40,"score":71189.53296860619},{"content":"class MAF_EXPORT mafGUITransformTextEntries : public mafGUITransformInterface\n\n{\n\npublic:\n\n\n\n mafGUITransformTextEntries(mafVME *input, mafObserver *listener = NULL, bool enableScaling = true, bool testMode = false);\n\n\t~mafGUITransformTextEntries(); \n\n\n\n void OnEvent(mafEventBase *maf_event);\n\n\n\n /** Enable-Disable the GUI's widgets */\n\n\tvoid EnableWidgets(bool enable);\n\n\n\n //----------------------------------------------------------------------------\n\n //gui constants: \n\n //----------------------------------------------------------------------------\n\n\n\n // this constants must be visible from the owner object \n\n enum TRANSFORMTEXTENTRIES_WIDGET_ID\n\n {\n\n ID_TRANSLATE_X = MINID,\n","file_path":"Interaction/mafGUITransformTextEntries.h","rank":41,"score":71189.53296860619},{"content":"//----------------------------------------------------------------------------\n\n// Constants :\n\n//----------------------------------------------------------------------------\n\nenum VOLUME_RESAMPLE_WIDGET_ID\n\n{\n\n\tID_FIRST = MINID,\t\n\n\tID_VOLUME_DIR_X,\n\n\tID_VOLUME_DIR_Y,\n\n\tID_VOLUME_DIR_Z,\n\n ID_VOLUME_ORIGIN,\n\n ID_VOLUME_ORIENTATION,\n\n ID_VOLUME_4DBOUNDS,\n\n ID_VOLUME_VMEBOUNDS,\n\n ID_VOLUME_VMELOCALBOUNDS,\n\n ID_VOLUME_SPACING,\n\n ID_VOLUME_CURRENT_SLICE,\n\n ID_VOLUME_AUTOSPACING,\n\n ID_VOLUME_ZERO_VALUE\n\n};\n\n\n","file_path":"Operations/mafOpVolumeResample.cpp","rank":42,"score":70745.96697888004},{"content":"class MAF_EXPORT mafString : public mafBase\n\n{\n\npublic:\n\n \n\n /**\n\n This static method returns the size of c-string. If the string is empty,\n\n it returns 0. It can handle null pointers.*/\n\n static mafID Length(const char* str);\n\n \n\n /** This method returns the size of this string. */\n\n const mafID Length() const;\n\n\n\n /** static method to copy c-string to the another c-string.*/\n\n static void Copy(char* dest, const char* src);\n\n \n\n /** Copy a c-string to this string.*/\n\n void Copy(const char* src);\n\n\n\n /** Copy N characters of another string to this string.*/\n\n void NCopy(const char* src,int n);\n","file_path":"Base/mafString.h","rank":43,"score":70735.2743918447},{"content":"class mafGUITransformTextEntries;\n","file_path":"Operations/mafOpMAFTransform.h","rank":44,"score":70575.128967825},{"content":"class mafStringTest : public CPPUNIT_NS::TestFixture\n\n{\n\n CPPUNIT_TEST_SUITE( mafStringTest );\n\n CPPUNIT_TEST( Test );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n protected:\n\n /** Test multiple string features with a single test */\n\n void Test();\n\n};\n\n\n\n\n\nint\n\nmain( int argc, char* argv[] )\n\n{\n\n // Create the event manager and test controller\n\n CPPUNIT_NS::TestResult controller;\n\n\n\n // Add a listener that colllects test result\n\n CPPUNIT_NS::TestResultCollector result;\n","file_path":"Testing/Base/mafStringTest.h","rank":45,"score":67447.88344584563},{"content":"class mafTransformTest : public CPPUNIT_NS::TestFixture\n\n{\n\n public: \n\n\n\n // CPPUNIT fixture: executed before each test\n\n void setUp();\n\n\n\n // CPPUNIT fixture: executed after each test\n\n void tearDown();\n\n\n\n // CPPUNIT test suite\n\n CPPUNIT_TEST_SUITE( mafTransformTest );\n\n CPPUNIT_TEST( TestFixture ); // just to test that the fixture has no leaks\n\n CPPUNIT_TEST( TestTranslateRotateScale );\n\n CPPUNIT_TEST( TestPolarDecomposition );// leaked! Leak source is mafMatrix\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n private:\n\n \n\n void TestFixture();\n","file_path":"Testing/Base/mafTransformTest.h","rank":46,"score":67295.18071037832},{"content":"class MAF_EXPORT mafTransformBase : public mafReferenceCounted\n\n{\n\npublic:\n\n mafTransformBase();\n\n ~mafTransformBase();\n\n\n\n /** copy constructor */\n\n mafTransformBase(const mafTransformBase&);\n\n\n\n mafAbstractTypeMacro(mafTransformBase,mafReferenceCounted);\n\n virtual void Print(std::ostream& os, const int indent=0) const;\n\n\n\n /** update and return internal transform matrix */\n\n virtual const mafMatrix &GetMatrix() {Update();return *m_Matrix;}\n\n\n\n /** \n\n return pointer to internal matrix (after updating).\n\n BEWARE: do not change the matrix directly. */\n\n mafMatrix *GetMatrixPointer() {Update(); return m_Matrix;}\n\n\n","file_path":"Base/mafTransformBase.h","rank":47,"score":67295.18071037832},{"content":" const bool operator!=(const char *src) const;\n\n const bool operator<(const char *a) const;\n\n const bool operator>(const char *a) const;\n\n const bool operator<=(const char *a) const;\n\n const bool operator>=(const char *a) const;\n\n\n\n //friend MAF_EXPORT std::ostream& operator<<(std::ostream& os, const mafString& s);\n\n //friend MAF_EXPORT std::istream& operator>>(std::istream& is, mafString& s);\n\n\n\n mafString &operator<<(const char *a) {return Append(a);};\n\n\n\n void operator<<(std::ostream &os);\n\n void operator>>(std::istream &os);\n\n\n\n mafString& operator<<( int d);\n\n mafString& operator<<( long d);\n\n mafString& operator<<( float d);\n\n mafString& operator<<( double d);\n\n\t/** Put inside string a mafMatrix in row order \n\n\texample:\n","file_path":"Base/mafString.h","rank":48,"score":66882.49840642868},{"content":" mafString &operator=(const char *src);\n\n mafString &operator=(const double &num);\n\n#ifdef MAF_USE_WX\n\n mafString &operator=(const wxString &str);\n\n#endif\n\n mafString();\n\n ~mafString();\n\nprotected:\n\n\n\n /** Allocate space for the internal c-string. */\n\n int SetSize(mafID size);\n\n\n\n void Initialize() {m_CStr=NULL;m_ConstCStr=\"\";m_Size=0;};\n\n\n\n char *m_CStr;\n\n const char *m_ConstCStr;\n\n mafID m_Size;\n\n};\n\n\n\n/**\n\n Class Name : mafCString.\n\n this string class is thought to simply wrap a c-string: no memory copy.\n\n*/\n","file_path":"Base/mafString.h","rank":49,"score":66869.94039391281},{"content":" 1 0 0 0\n\n\t0 1 0 0\n\n\t0 0 1 0\n\n\t0 0 0 1\n\n\t-> \"1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1\"\n\n\t*/\n\n\tmafString& operator<<( mafMatrix d);\n\n mafString& operator<<( mafString *s);\n\n //void operator<<( std::string s);\n\n\n\n mafString& operator+=(const char *s);\n\n\n\n mafString(const mafString &src);\n\n mafString(const char *src);\n\n mafString(const double &num);\n\n#ifdef MAF_USE_WX\n\n mafString(const wxString &str);\n\n#endif\n\n\n\n mafString &operator=(const mafString &mat);\n","file_path":"Base/mafString.h","rank":50,"score":66865.0954141186},{"content":"\n\n /** Erase characters from start position to end position. If end\n\n is not specified erase to the end of the string.*/\n\n void Erase(int start,int end=-1);\n\n\n\n /**\n\n This method makes a duplicate of a c-string similar to C function\n\n strdup but it uses new to create new string, so you can use\n\n delete to remove it. It returns 0 if the input is empty. This function\n\n automatically release old pointed data (if not specified differently)*/\n\n static char* Duplicate(const char* str);\n\n\n\n /**\n\n This method makes a duplicate of the string similar to C function\n\n strdup but it uses new to create new string, so you can use\n\n delete to remove it. It returns 0 if the input is empty. The new\n\n string pointer is copied in the destination pointer. If this was\n\n already != NULL, the corresponding memory is released. This is useful\n\n to automatically manage garbage collection but beware to not provide \n\n an uninitialized pointer variable. Beware memory releasing\n","file_path":"Base/mafString.h","rank":51,"score":66865.01348719474},{"content":" static char *ParsePathName(char *str);\n\n char *ParsePathName(mafString *str);\n\n\n\n /** Force the string to create an internal duplication in place of reference to const char */\n\n void ForceDuplicate();\n\n \n\n /** Return the pointer to the internal c-string */\n\n const char * GetCStr() const;\n\n \n\n /** \n\n Return the pointer to the internal c-string, but first force string\n\n the internal copy @sa ForceDulicate () */\n\n char *GetNonConstCStr();\n\n\n\n /** return the real memory size allocated for the internal c-string */\n\n int GetSize() const {return m_Size;};\n\n\n\n /**\n\n Pre-Allocate space for the internal c-string. The memory size is\n\n is given in terms of string length, that is one more character\n","file_path":"Base/mafString.h","rank":52,"score":66863.4581635056},{"content":"\n\n /** Format given arguments according to format string. Format string format is\n\n that of vsprintf function */\n\n void Printf(const char *format, ...);\n\n\n\n /** like Printf but faster (you can specify output string size) */ \n\n void NPrintf(unsigned long size, const char *format, ...);\n\n\n\n /** this allows to convert a mafString to const char *. */\n\n operator const char*() const {return GetCStr();}\n\n\n\n /** \n\n Direct access to single string elements for writing. This operator\n\n forces memory copy in case of internal const char reference. */\n\n char & operator [] (const int i);\n\n\n\n /** direct access to string single elements for reading */\n\n const char operator [] (const int i) const;\n\n\n\n const bool operator==(const char *src) const;\n","file_path":"Base/mafString.h","rank":53,"score":66862.07526536116},{"content":" /** Find last occurrence of a substring */\n\n int FindLast(const char *str) const;\n\n\n\n /** Extract the base name of a filename string */\n\n static const char *BaseName(const char *filename);\n\n const char *BaseName() const;\n\n\n\n /** Extract the pathname from a filename string. Result is written inplace. */\n\n void ExtractPathName();\n\n\n\n /**\n\n parse the given string to substitute each (back)slash\n\n character with the right pathname separator.*/\n\n void SetPathName(const char *str);\n\n void SetPathName(mafString *str);\n\n\n\n /**\n\n parse the given string to substitute each (back)slash\n\n character with the right pathname separator.*/\n\n char *ParsePathName();\n","file_path":"Base/mafString.h","rank":54,"score":66860.74364841188},{"content":" for the trailing '\\0' is allocated. Previous data is retained.\n\n Memory is reallocated only if requested size is > of existing one.\n\n All the mafString methods resize this memory when necessary, but to\n\n improve performance it's possible to preallocate an enough large\n\n memory to store the data preventing reallocation of memory.\n\n Return 0 if OK, -1 in case of relocation problems */\n\n int SetMaxLength(mafID len);\n\n\n\n /** return true if empty*/\n\n static bool IsEmpty(const char *str) { return (str?str[0]=='\\0':true);};\n\n /** return true if empty*/\n\n bool IsEmpty() const { return IsEmpty(GetCStr());};\n\n\n\n /** \n\n Set the internal pointer to a give pointer. Second parameter allow \n\n to force the release of the memory */\n\n mafString &Set(const char *a, bool release=false);\n\n \n\n /** this can be used only with non constant c-string */\n\n void SetCStr(char *a, bool release=false);\n","file_path":"Base/mafString.h","rank":55,"score":66859.43101993775},{"content":" must be performed by consumer*/\n\n static void Duplicate(char * &store,const char *src,bool release=true);\n\n \n\n /**\n\n Duplicate the string stored inside this object. Beware memory releasing\n\n must be performed by consumer */\n\n char* Duplicate() const;\n\n \n\n /** \n\n This static method compare two strings. It is similar to strcmp, but it\n\n can handle null pointers. return 0 if str1 == str2, -1 if str1<str2,\n\n 1 if str1>str2*/\n\n static int Compare(const char* str1, const char* str2); \n\n\n\n /** \n\n This method compare the given c-string with the one stored inside this object.\n\n It is similar to strcmp, but it can handle null pointers. Return 0 if str equal this,\n\n -1 if str > this, 1 if str < this*/\n\n int Compare(const char* str) const;\n\n \n","file_path":"Base/mafString.h","rank":56,"score":66859.19309559627},{"content":" /** Check if this string ends with the given one.*/\n\n bool EndsWith(const char* str) const;\n\n\n\n /**\n\n Append two strings and produce a new one. The consumer must delete\n\n the resulting string. The method returns 0 if inputs are empty or\n\n if there was an error.*/\n\n static char* Append(const char* str1, const char* str2);\n\n /** Append a new string to this string. */\n\n mafString &Append(const char* str);\n\n\n\n /** Scan the string for the first occurrence of the character */\n\n int FindChr(const int c) const;\n\n\n\n /** Scan the string for the first occurrence of the character */\n\n int FindLastChr(const int c) const;\n\n\n\n /** Find first occurrence of a substring */\n\n int FindFirst(const char *str) const;\n\n\n","file_path":"Base/mafString.h","rank":57,"score":66857.71751175958},{"content":" /**\n\n This static method compare two strings. It is similar to strcmp, but it\n\n can handle null pointers. Also it only returns C style true or\n\n false versus compare which returns also which one is greater.*/\n\n static bool Equals(const char* str1, const char* str2) { return Compare(str1, str2) == 0;}\n\n \n\n /**\n\n This method compare the given c-string with the one stored inside this object.\n\n It is similar to strcmp, but it can handle null pointers. Also it only\n\n returns C style true or false versus compare which returns also which\n\n one is greater.*/\n\n bool Equals(const char* str) const;\n\n \n\n /** Static method to check if the first string starts with the second one.*/\n\n static bool StartsWith(const char* str1, const char* str2);\n\n /** Check if this string starts with the given one.*/\n\n bool StartsWith(const char* str) const;\n\n\n\n /** Static method to check if the first string ends with the second one.*/\n\n static bool EndsWith(const char* str1, const char* str2); \n","file_path":"Base/mafString.h","rank":58,"score":66849.03582585334},{"content":"/*=========================================================================\n\n\n\n Program: MAF2\n\n Module: mafString\n\n Authors: originally based on vtkString (www.vtk.org), rewritten Marco Petrone\n\n \n\n Copyright (c) B3C\n\n All rights reserved. See Copyright.txt or\n\n http://www.scsitaly.com/Copyright.htm for details.\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef __mafString_h\n\n#define __mafString_h\n\n\n\n#include \"mafDefines.h\"\n\n#include \"mafBase.h\" \n\n#include <string.h>\n\n\n\n//----------------------------------------------------------\n\n// forward references:\n\n//----------------------------------------------------------\n","file_path":"Base/mafString.h","rank":59,"score":66848.39935359401},{"content":" /**\n\n This functions rotate the internal matrix around the specified axis. It can be used in conjuction with\n\n SetMatrix, but if a pipeline is defined (input, input_frame or target_frame) it's overwritten whenever\n\n the Update() is performed.*/\n\n static void RotateX(mafMatrix &matrix,double angle,int premultiply) { mafTransform::RotateWXYZ(matrix,matrix,angle, 1, 0, 0,premultiply); };\n\n static void RotateY(mafMatrix &matrix,double angle,int premultiply) { mafTransform::RotateWXYZ(matrix,matrix,angle, 0, 1, 0,premultiply); };\n\n static void RotateZ(mafMatrix &matrix,double angle,int premultiply) { mafTransform::RotateWXYZ(matrix,matrix,angle, 0, 0, 1,premultiply); };\n\n void RotateX(double angle,int premultiply) { this->RotateX(*m_Matrix,angle,premultiply); };\n\n void RotateY(double angle,int premultiply) { this->RotateY(*m_Matrix,angle,premultiply); };\n\n void RotateZ(double angle,int premultiply) { this->RotateZ(*m_Matrix,angle,premultiply); };\n\n\n\n /** Pre or Post multiply the internal matrix for given matrix and store result in the internal matrix */\n\n void Concatenate(const mafMatrix &matrix, int premultiply);\n\n\n\n /** Pre or Post multiply the internal matrix for given transform and store result in the internal matrix */\n\n void Concatenate(mafTransformBase *trans, int premultiply) {Concatenate(trans->GetMatrix(),premultiply);}\n\n\n\n /**\n\n This function set the orientation (acc. to VTK convention) of the matrix. Notice, the non static functions\n\n work on the internal matrix and can be used in conjuction with SetMatrix, but if a pipeline\n","file_path":"Base/mafTransform.h","rank":60,"score":66707.94514748175},{"content":" as argument. Notice, the non static functions work on the internal matrix and can be used\n\n in conjuction with SetMatrix, but if a pipeline is defined (input, input_frame or \n\n target_frame) it's overwritten whenever the Update() is perfromed.*/\n\n static void Translate(mafMatrix &matrix,double translation[3],int premultiply);\n\n void Translate(double translation[3],int premultiply) {this->Translate(*m_Matrix,translation,premultiply);}\n\n void Translate(double x,double y,double z,int premultiply) {this->Translate(*m_Matrix,x,y,z,premultiply);}\n\n static void Translate(mafMatrix &matrix, double x,double y,double z,int premultiply) {\n\n double temp[3];\n\n temp[0]=x;temp[1]=y;temp[2]=z;\n\n Translate(matrix,temp,premultiply);}\n\n\n\n /**\n\n This function rotate the matrix around the specified axis. Notice, the non static functions\n\n work on the internal matrix and can be used in conjuction with SetMatrix, but if a pipeline\n\n is defined (input, input_frame or target_frame) it's overwritten whenever the Update() is perfromed.*/\n\n static void RotateWXYZ(const mafMatrix &source,mafMatrix &target,double angle,double x, double y, double z,int premultiply);\n\n void RotateWXYZ(double angle,double x, double y, double z,int premultiply) {this->RotateWXYZ(*m_Matrix,*m_Matrix,angle,x,y,z,premultiply);}\n\n void RotateWXYZ(double angle,double rot[3],int premultiply) {this->RotateWXYZ(*m_Matrix,*m_Matrix,angle, rot[0], rot[1], rot[2],premultiply);}\n\n\n\n\n","file_path":"Base/mafTransform.h","rank":61,"score":66701.47957804076},{"content":" scale[2] = static_cast<float>(temp[2]); };\n\n\n\n /** Apply a scale transform. By default the scale matrix is premultiplied */\n\n static void Scale(mafMatrix &matrix,double scalex,double scaley,double scalez,int premultiply);\n\n void Scale(double scalex,double scaley,double scalez,int premultiply) \\\n\n { Scale(*m_Matrix,scalex,scaley,scalez,premultiply);}\n\n\n\n /** Set/Get internal matrix versor*/\n\n static void SetVersor(int axis, double versor[3], mafMatrix &matrix);\n\n \n\n static void GetVersor(int axis, const mafMatrix &matrix, double versor[3]) {mafMatrix::GetVersor(axis,matrix,versor);}\n\n static void GetVersor(int axis, const mafMatrix &matrix, float versor[3]) \\\n\n { \\\n\n double temp[3]; GetVersor(axis, matrix, temp); \\\n\n versor[0] = static_cast<float>(temp[0]); \\\n\n versor[1] = static_cast<float>(temp[1]); \\\n\n versor[2] = static_cast<float>(temp[2]); };\n\n \n\n void GetVersor(int axis, double versor[3]) {GetVersor(axis,GetMatrix(),versor);}\n\n void GetVersor(int axis, float versor[3]) {GetVersor(axis,GetMatrix(),versor);}\n","file_path":"Base/mafTransform.h","rank":62,"score":66700.44719613994},{"content":" VIEW ///< the view ref sys\n\n };\n\n\n\n /** copy constructor */\n\n mafTransform(const mafTransform&);\n\n\n\n /** RTTI stuff */\n\n mafTypeMacro(mafTransform,mafTransformBase);\n\n \n\n /**\n\n Directly set the internal Matrix. It's overwritten by Update if Input or InputFrame !=NULL\n\n This function makes a copy of the input matrix. */\n\n virtual void SetMatrix(const mafMatrix &input) {*m_Matrix=input;SetTimeStamp(input.GetTimeStamp());Modified();}\n\n\n\n /** set the internal matrix pointer to the given matrix. Do not use this if you don't know what you are doing */\n\n void SetMatrixPointer(mafMatrix *matrix);\n\n\n\n\t/**\n\n\t Polar Decomposition of matrix M in Q * S.*/\n\n\tstatic double PolarDecomp(const mafMatrix &M, mafMatrix &Q, mafMatrix &S, double translation[3]);\n","file_path":"Base/mafTransform.h","rank":63,"score":66699.37915997228},{"content":"/*=========================================================================\n\n\n\n Program: MAF2\n\n Module: mafTransform\n\n Authors: Marco Petrone, Stefano Perticoni,Stefania Paperini\n\n \n\n Copyright (c) B3C\n\n All rights reserved. See Copyright.txt or\n\n http://www.scsitaly.com/Copyright.htm for details.\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef __mafTransform_h\n\n#define __mafTransform_h\n\n\n\n#include \"mafTransformBase.h\"\n\n#include \"mafInteractorConstraint.h\"\n\n\n\n#include \"mafUtility.h\"\n\n\n\n//------------------------------------------------------------------------------\n\n// Forward declarations\n\n//------------------------------------------------------------------------------\n","file_path":"Base/mafTransform.h","rank":64,"score":66696.90085025562},{"content":" /**\n\n\t Return the wxyz angle+axis representing the current orientation.\n\n Copied from vtkTransform::GetVTKOrientationWXYZ()*/\n\n static void GetOrientationWXYZ(const mafMatrix &in_matrix, double wxyz[4]);\n\n void GetOrientationWXYZ(double wxyz[4]) \\\n\n { GetOrientationWXYZ(GetMatrix(),wxyz);}\n\n void GetOrientationWXYZ(float wxyz[3]) {\n\n double temp[4]; GetOrientationWXYZ(temp); \n\n wxyz[0]=static_cast<float>(temp[0]); \n\n wxyz[1]=static_cast<float>(temp[1]); \n\n wxyz[2]=static_cast<float>(temp[2]); \n\n wxyz[3]=static_cast<float>(temp[3]);};\n\n\n\n /**\n\n Return the position from the current transformation matrix as an array\n\n of three floating point numbers. This is simply returning the translation \n\n component of the 4x4 matrix. Copied from vtkTransform::GetPosition()*/\n\n static void GetPosition(const mafMatrix &matrix,double position[3]);\n\n static void GetPosition(const mafMatrix &matrix,float position[3]);\n\n void GetPosition(double position[3]) {this->GetPosition(GetMatrix(),position);}\n","file_path":"Base/mafTransform.h","rank":65,"score":66695.6694238508},{"content":" is defined (input, input_frame or target_frame) it's overwritten whenever the Update() is performed.*/\n\n static void SetOrientation(mafMatrix &matrix,double orientation[3]);\n\n void SetOrientation(double orientation[3]) {this->SetOrientation(*m_Matrix,orientation);}\n\n void SetOrientation(double rx,double ry,double rz) {this->SetOrientation(*m_Matrix,rx,ry,rz);}\n\n static void SetOrientation(mafMatrix &matrix,double rx,double ry,double rz) {\n\n double temp[3];\n\n temp[0]=rx;temp[1]=ry;temp[2]=rz;\n\n SetOrientation(matrix,temp);}\n\n\n\n /**\n\n Return the scale factors of the current transformation matrix as \n\n an array of three float numbers. These scale factors are not necessarily\n\n about the x, y, and z axes unless unless the scale transformation was\n\n applied before any rotations. Copied from vtkTransform::GetScale()*/\n\n static void GetScale(const mafMatrix &matrix,double scale[3]);\n\n void GetScale(double scale[3]) {this->GetScale(*m_Matrix,scale);}\n\n void GetScale(float scale[3]) {\n\n double temp[3]; this->GetScale(temp); \n\n scale[0] = static_cast<float>(temp[0]); \n\n scale[1] = static_cast<float>(temp[1]); \n","file_path":"Base/mafTransform.h","rank":66,"score":66695.56246462},{"content":" double PolarDecomp(mafMatrix &Q, mafMatrix &S, double translation[3]) {return PolarDecomp(GetMatrix(),Q,S,translation);}\n\n \n\n /** set internal matrix to Identity */\n\n void Identity();\n\n\n\n /** Invert internal matrix */\n\n void Invert();\n\n\n\n /**\n\n\t Get the x, y, z orientation angles from the transformation matrix as an\n\n array of three floating point values. Copied from vtkTransform::GetOrientation()*/\n\n static void GetOrientation(const mafMatrix &in_matrix,double orientation[3]);\n\n static void GetOrientation(const mafMatrix &in_matrix,float orientation[3]);\n\n void GetOrientation(double orientation[3]) { this->GetOrientation(GetMatrix(),orientation);}\n\n void GetOrientation(float orient[3]) {\n\n double temp[3]; this->GetOrientation(temp); \n\n orient[0] = static_cast<float>(temp[0]); \n\n orient[1] = static_cast<float>(temp[1]); \n\n orient[2] = static_cast<float>(temp[2]); };\n\n\n","file_path":"Base/mafTransform.h","rank":67,"score":66695.30430883408},{"content":"\n\n /**\n\n Copy the 3x3 rotation matrix from another 4x4 matrix into the specified matrix, or in the internal matrix.*/\n\n static void CopyRotation(const mafMatrix &source, mafMatrix &target);\n\n void CopyRotation(const mafMatrix &source) {this->CopyRotation(source,*m_Matrix);}\n\n\n\n /** Copy the translation vector */\n\n static void CopyTranslation(const mafMatrix &source, mafMatrix &target);\n\n void CopyTranslation(const mafMatrix &source) {this->CopyTranslation(source,*m_Matrix);}\n\n \n\n /** Add two vectors */\n\n static void AddVectors( double inV0[3],double inV1[3],double outSum[3] );\n\n\n\n /** Build vector with origin in p1 pointing to p2 */\n\n static void BuildVector(double *p1, double *p2, double *out_vector);\n\n\n\n /** Build vector [coeff * inVector] */\n\n static void BuildVector(double coeff, const double *inVector, double *outVector, int refSysType = LOCAL, int localAxis = mafInteractorConstraint::X);\n\n\n\n /** Project in_vector on in_axis direction; in_axis does not need to be \n","file_path":"Base/mafTransform.h","rank":68,"score":66694.86665628088},{"content":"\t\t\t\t\t\t\t\t\t\t\t\t\tint i,int j,int k,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\tmafMatrix &matrix);\n\n\n\n /** rotation + translation representation conversion */\n\n\tint MatrixToHelicalAxis(const mafMatrix &matrix,\n\n\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t\t\t\t\t\t double helical_axis[3],double point[3],\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double& phi,double& t, int intersect);\n\n\n\n\n\n //----------------------------------------------------------------------------\n\n // declarations for polar_decomp algorithm from Graphics Gems IV,\n\n // by Ken Shoemake <shoemake@graphics.cis.upenn.edu>\n\n //----------------------------------------------------------------------------\n\n enum mmuQuatPart {X, Y, Z, W};\n\n\n\n typedef struct {double x, y, z, w;} mmuQuat; ///< mmuQuaternion \n\n typedef mmuQuat HVect; ///< Homogeneous 3D vector \n\n \n\n typedef struct {\n\n\t HVect t;\t///< Translation components\n","file_path":"Base/mafTransform.h","rank":69,"score":66694.59548634806},{"content":" void GetPosition(float position[3]) {\n\n double temp[3]; this->GetPosition(temp); \n\n position[0] = static_cast<float>(temp[0]); \n\n position[1] = static_cast<float>(temp[1]); \n\n position[2] = static_cast<float>(temp[2]); };\n\n\n\n /**\n\n This function set the position column of the matrix. Notice, the non static functions\n\n work on the internal matrix and can be used in conjuction with SetMatrix, but if a pipeline\n\n is defined (input, input_frame or target_frame) it's overwritten whenever the Update() is perfromed.*/\n\n static void SetPosition(mafMatrix &matrix,double position[3]);\n\n void SetPosition(double position[3]) {this->SetPosition(*m_Matrix,position);}\n\n void SetPosition(double x,double y,double z) {this->SetPosition(*m_Matrix,x,y,z);}\n\n static void SetPosition(mafMatrix &matrix, double x,double y,double z) {\n\n double temp[3];\n\n temp[0]=x;temp[1]=y;temp[2]=z;\n\n SetPosition(matrix,temp);}\n\n\n\n /**\n\n This function set the translation column of the matrix by adding the transaltion provided\n","file_path":"Base/mafTransform.h","rank":70,"score":66693.09937418916},{"content":" normalised. The projection signed value is returned */\n\n static double ProjectVectorOnAxis(const double *in_vector, const double *in_axis, double *out_projection = NULL);\n\n\n\n /** Project in_vector on the plane identified by the normal vector in_plane_normal;\n\n in_plane_normal does not need to be normalised. The norm of the projection \n\n is returned and the projection vector is written in out_projection vector if provided. */\n\n static double ProjectVectorOnPlane(const double *in_vector, const double *in_plane_normal, double *out_projection = NULL);\n\n\n\n /** Find perpendicular versors to input versor N */\n\n static void FindPerpendicularVersors(double inVersorN[3], double outVersorP[3], double outVersorQ[3]);\n\n\n\n /** Multiply vector by scalar */\n\n static void MultiplyVectorByScalar(double s, double *vin, double *vout);\n\n\n\n /** rotation representation conversion */\n\n\tint MatrixToAttitudeVector(const mafMatrix &matrix,\n\n\t\t\t\t\t\t\t\t\t\t double attitude_vector[3]);\n\n\n\n /** rotation representation conversion */\n\n\tint MatrixToEulerCardanicAngle(const mafMatrix &matrix,\n","file_path":"Base/mafTransform.h","rank":71,"score":66692.77902237998},{"content":"\t mmuQuat q;\t///< Essential rotation\n\n\t mmuQuat u;\t///< Stretch rotation\n\n\t HVect k;\t///< Stretch factors\n\n\t double f;\t///< Sign of determinant\n\n } mmuAffineParts;\n\n \n\n typedef double HMatrix[4][4]; /* Right-handed, for column vectors */\n\n static double PolarDecomp(HMatrix M, HMatrix Q, HMatrix S);\n\n static void DecompAffine(HMatrix A, mmuAffineParts *parts);\n\n static HVect SpectDecomp(HMatrix S, HMatrix U);\n\n static mmuQuat QuaternionFromMatrix(HMatrix mat);\n\n static void InvertAffine(mmuAffineParts *parts, mmuAffineParts *inverse);\n\n static mmuQuat Snuggle(mmuQuat q, HVect *k);\n\n //----------------------------------------------------------------------------\n\nprotected:\n\n /**\n\n This only sets the timestamp for the output matrix: output matrix is not computed\n\n inside InternalUpdate since this is not a procedural transform. */\n\n virtual void InternalUpdate() {m_Matrix->SetTimeStamp(m_TimeStamp);}\n\nprivate:\n\n};\n\n\n\n#endif\n\n\n","file_path":"Base/mafTransform.h","rank":72,"score":66692.06989288183},{"content":"\t\t\t\t\t\t\t\t\t\t\t\t\tint i,int j,int k,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\tdouble euler_cardan[3],\n\n\t\t\t\t\t\t\t\t\t\t\t\t\tdouble tentative_euler_cardan_first,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\tdouble tentative_euler_cardan_second,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\tdouble tentative_euler_cardan_third);\n\n\n\n /** rotation representation conversion */\n\n\tint MatrixTommuQuaternion(const mafMatrix &matrix, double quaternion[4]);\n\n\n\n /** rotation representation conversion */\n\n\tint QuaternionToMatrix(double quaternion[4],\tmafMatrix &matrix);\n\n\n\n /** rotation + translation representation conversion */\n\n\tint HelicalAxisToMatrix(double helical_axis[3],double angle, mafMatrix &matrix);\n\n\n\n /** rotation representation conversion */\n\n\tint AttitudeVectorToMatrix(double attitude_vector[3], mafMatrix &matrix);\n\n\n\n /** rotation representation conversion */\n\n\tint EulerCardanicAngleToMatrix(double euler_cardan[3],\n","file_path":"Base/mafTransform.h","rank":73,"score":66690.0908448586},{"content":"//----------------------------------------------------------------------------\n\nclass MAF_EXPORT mafOpVolumeResample: public mafOp\n\n{\n\npublic:\n\n \n\n \t mafOpVolumeResample(const wxString &label = \"VolumeResample\");\n\n\tvirtual ~mafOpVolumeResample();\n\n\tvirtual void OnEvent(mafEventBase *maf_event);\n\n\t\n\n mafTypeMacro(mafOpVolumeResample, mafOp);\n\n\n\n mafOp* Copy();\n\n\n\n\tbool Accept(mafNode* vme);\n\n\tvoid OpRun();\t\n\n\tvoid OpDo();\n\n\tvoid OpUndo(); \n\n\n\n\t/**\n\n\tSet spacing for test mode*/\n\n\tvoid SetSpacing(double Spacing[3]);\n","file_path":"Operations/mafOpVolumeResample.h","rank":74,"score":66428.99296630337},{"content":"class MAF_EXPORT mafOpTransformInterface : public mafOp\n\n{\n\npublic:\n\n mafOpTransformInterface(const wxString &label = \"TransformInterface\");\n\n virtual ~mafOpTransformInterface(); \n\n \n\n /** Return true for the acceptable vme type. */\n\n bool Accept(mafNode* vme) {return true;};\n\n\n\n mafTypeMacro(mafOpTransformInterface, mafOp);\n\n\n\n /** Override superclass */\n\n mafOp* Copy();\n\n\n\n /** Override superclass */\n\n void OpDo();\n\n \n\n /** Set/Get the vme used as refsys, the vme is referenced*/\n\n void SetRefSysVME(mafVME *refSysVme);\n\n mafVME *GetRefSysVME() {return m_RefSysVME;};\n","file_path":"Operations/mafOpTransformInterface.h","rank":75,"score":66268.57962375708},{"content":"class MAF_EXPORT mafGUITransformInterface : public mafObserver\n\n{\n\npublic:\n\n\n\n /** Return the gui to be plugged*/\n\n mafGUI *GetGui() {return m_Gui;};\n\n\n\n /** Enable-Disable the GUI's widgets */\n\n virtual void EnableWidgets(bool enable) = 0;\n\n\n\n /** Set the vme to be used as reference system, the vme is referenced; default ref sys is vme abs matrix */\n\n void SetRefSys(mafVME *refSysVme); \n\n mafVME* GetRefSys() {return m_RefSysVME;};\n\n\n\n /** Reset the gui component to initial state */\n\n virtual void Reset() {};\n\n\n\n /** Events handling */ \n\n void OnEvent(mafEventBase *maf_event) {};\n\n \n","file_path":"Interaction/mafGUITransformInterface.h","rank":76,"score":66268.57962375708},{"content":"class mafXMLStringTest : public CPPUNIT_NS::TestFixture\n\n{\n\npublic:\n\n\n\n // CPPUNIT fixture: executed before each test\n\n void setUp();\n\n\n\n // CPPUNIT fixture: executed after each test\n\n void tearDown();\n\n\n\n\tCPPUNIT_TEST_SUITE( mafXMLStringTest );\n\n\tCPPUNIT_TEST( TestStaticAllocation );\n\n\tCPPUNIT_TEST( TestDynamicAllocation );\n\n CPPUNIT_TEST( TestAllConstructors );\n\n CPPUNIT_TEST( TestAppend );\n\n CPPUNIT_TEST( TestErase );\n\n CPPUNIT_TEST( TestBegin );\n\n CPPUNIT_TEST( TestEnd );\n\n CPPUNIT_TEST( TestSize );\n\n CPPUNIT_TEST( TestGetCStr );\n","file_path":"Testing/IO/mafXMLStringTest.h","rank":77,"score":65420.943614517964},{"content":"class mafTransformBaseTest : public CPPUNIT_NS::TestFixture\n\n{\n\npublic: \n\n // CPPUNIT fixture: executed before each test\n\n void setUp();\n\n\n\n // CPPUNIT fixture: executed after each test\n\n void tearDown();\n\n\n\n // CPPUNIT test suite\n\n CPPUNIT_TEST_SUITE( mafTransformBaseTest );\n\n CPPUNIT_TEST(TestFixture); // just to test that the fixture has no leaks\n\n CPPUNIT_TEST(TestStaticAllocation);\n\n CPPUNIT_TEST(TestDynamicAllocation);\n\n CPPUNIT_TEST(TestCopyConstructor);\n\n CPPUNIT_TEST(TestGetMatrix);\n\n\tCPPUNIT_TEST(TestTimeStamp);\n\n\tCPPUNIT_TEST(TestModifiedTime);\n\n\tCPPUNIT_TEST(TestUpdateTime);\n\n\tCPPUNIT_TEST(TestGetEventSource);\n","file_path":"Testing/Base/mafTransformBaseTest.h","rank":78,"score":65272.82989268693},{"content":"class mafTransformFrameTest : public CPPUNIT_NS::TestFixture\n\n{\n\n public: \n\n\n\n // CPPUNIT fixture: executed before each test\n\n void setUp();\n\n\n\n // CPPUNIT fixture: executed after each test\n\n void tearDown();\n\n\n\n // CPPUNIT test suite\n\n CPPUNIT_TEST_SUITE( mafTransformFrameTest );\n\n CPPUNIT_TEST( TestFixture ); // just to test that the fixture has no leaks\n\n CPPUNIT_TEST( TestMafTransformFrameConstructorDestructor );\n\n CPPUNIT_TEST( TestSetInputMafTransformBase );\n\n CPPUNIT_TEST( TestSetInputMafMatrix );\n\n CPPUNIT_TEST( TestGetInput );\n\n CPPUNIT_TEST( TestSetInputFrameMafMatrix );\n\n CPPUNIT_TEST( TestSetInputFrameMafTransformBase );\n\n CPPUNIT_TEST( TestGetInputFrame );\n","file_path":"Testing/Base/mafTransformFrameTest.h","rank":79,"score":65272.82989268693},{"content":"{\n\n Copy(src.c_str());\n\n return *this;\n\n}\n\n#endif\n\n/*\n\n//----------------------------------------------------------------------------\n\nstd::ostream& operator<<(std::ostream& os, const mafString& s)\n\n//----------------------------------------------------------------------------\n\n{\n\n const char *str=s.GetCStr();\n\n os << str;\n\n return os;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid mafString::operator>>(std::istream &is)\n\n//----------------------------------------------------------------------------\n\n{\n\n std::string tmp;\n","file_path":"Base/mafString.cpp","rank":80,"score":64886.16973650577},{"content":"\n\n\n\n#include <xercesc/util/XMLString.hpp>\n\n\n\n#ifdef XERCES_CPP_NAMESPACE_USE\n\n// XERCES_CPP_NAMESPACE_USE\n\n// SIL 12-apr-2006\n\n// removed XERCES_CPP_NAMESPACE_USE and added XERCES_CPP_NAMESPACE_QUALIFIER where required\n\n#endif\n\n\n\n/** string type for converting const char * to and from XMLString types\n\n This is an internal string type to be used only in conjunction with XercecC XML library.\n\n This object is able to convert const char* to and from XMLStrings. This code has been\n\n adapted from example code \"class XercesString\" found in articles \"Make the most of Xerces-C++\"\n\n by Rick Parrish (rfmobile@swbell.net) that can be found at \"www.ibm.com/developerworks/xml\".\n\n*/\n","file_path":"IO/mafXMLString.h","rank":81,"score":64877.08128100836},{"content":" // If the available memory is not sufficient, relocate!\n\n unsigned long len=Length(src);\n\n if (len>=m_Size)\n\n {\n\n SetMaxLength(len);\n\n }\n\n\n\n Copy(m_CStr,src);\n\n }\n\n else\n\n {\n\n SetMaxLength(0);\n\n m_ConstCStr=\"\";\n\n }\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid mafString::NCopy(const char* src,int n)\n\n//----------------------------------------------------------------------------\n\n{\n","file_path":"Base/mafString.cpp","rank":82,"score":64871.37975445897},{"content":"\n\n return strcmp(str1, str2);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nint mafString::Compare(const char* str) const\n\n//----------------------------------------------------------------------------\n\n{\n\n return Compare(m_Size>0?m_CStr:m_ConstCStr, str);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nbool mafString::Equals(const char* str) const\n\n//----------------------------------------------------------------------------\n\n{\n\n return Equals(m_Size>0?m_CStr:m_ConstCStr, str);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\n// Check if the first string starts with the second one.\n","file_path":"Base/mafString.cpp","rank":83,"score":64870.188776609924},{"content":" return *this;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nconst char * mafString::GetCStr() const\n\n//----------------------------------------------------------------------------\n\n{\n\n if (m_Size>0)\n\n {\n\n return m_CStr;\n\n }\n\n else\n\n { \n\n return m_ConstCStr;\n\n }\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nint mafString::SetMaxLength(mafID len)\n\n//----------------------------------------------------------------------------\n","file_path":"Base/mafString.cpp","rank":84,"score":64868.934865012314},{"content":"//----------------------------------------------------------------------------\n\n{\n\n if (a!=GetCStr())\n\n {\n\n SetSize(0); // force memory release\n\n m_ConstCStr = a;\n\n //m_Size = release?Length(a)+1:0;\n\n }\n\n return *this;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid mafString::SetCStr(char *a, bool release)\n\n//----------------------------------------------------------------------------\n\n{\n\n if (a!=GetCStr())\n\n {\n\n SetSize(0); // force memory release\n\n m_CStr = a;\n\n m_Size = release?Length(a)+1:0; // notice: I could have a (char *) that must not be released\n","file_path":"Base/mafString.cpp","rank":85,"score":64866.16599141951},{"content":" \n\n return m_CStr[i];\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nconst char mafString::operator [] (const int i) const\n\n//------------------------------------------------------------------------------\n\n{\n\n return GetCStr()[i];\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nint mafString::FindChr(const int c) const\n\n//----------------------------------------------------------------------------\n\n{\n\n if (IsEmpty())\n\n {\n\n return -1;\n\n }\n\n char *pdest;\n","file_path":"Base/mafString.cpp","rank":86,"score":64865.83790917253},{"content":"#include <stdarg.h>\n\n#include <assert.h>\n\n\n\n#include \"wx/wx.h\"\n\n#include <wx/string.h>\n\n#include <string>\n\n\n\n\n\n//----------------------------------------------------------------------------\n\nmafString::~mafString()\n\n//----------------------------------------------------------------------------\n\n{\n\n if (m_CStr)\n\n {\n\n if (m_Size>0)\n\n delete[] m_CStr;\n\n\n\n m_CStr=NULL;\n\n m_ConstCStr=NULL;\n\n }\n","file_path":"Base/mafString.cpp","rank":87,"score":64865.26929720919},{"content":"//----------------------------------------------------------------------------\n\nconst bool mafString::operator<=(const char *a) const\n\n//----------------------------------------------------------------------------\n\n{\n\n return Compare(a)<=0;\n\n}\n\n//----------------------------------------------------------------------------\n\nconst bool mafString::operator>=(const char *a) const\n\n//----------------------------------------------------------------------------\n\n{\n\n return Compare(a)>=0;\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\nchar & mafString::operator [] (const int i)\n\n//------------------------------------------------------------------------------\n\n{\n\n // check if the string is referencing a \"const char *\"\n\n if (!m_CStr)\n\n ForceDuplicate(); // force memory copying\n","file_path":"Base/mafString.cpp","rank":88,"score":64865.043425087715},{"content":" if (src)\n\n {\n\n SetMaxLength(n);\n\n strncpy(m_CStr,src,n);\n\n m_CStr[n]='\\0';\n\n }\n\n else\n\n {\n\n // release memory\n\n SetSize(0);\n\n }\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\n// Description:\n\n// This method makes a duplicate of the string similar to\n\n// C function strdup but it uses new to create new string, so\n\n// you can use delete to remove it. It returns empty string \n\n// \"\" if the input is empty.\n\nchar* mafString::Duplicate(const char* str)\n","file_path":"Base/mafString.cpp","rank":89,"score":64864.6358222818},{"content":" }\n\n}\n\n//----------------------------------------------------------------------------\n\n// This method returns the size of string. If the string is empty,\n\n// it returns 0. It can handle null pointers.\n\nmafID mafString::Length(const char* str)\n\n//----------------------------------------------------------------------------\n\n{\n\n if ( !str )\n\n {\n\n return 0;\n\n }\n\n return static_cast<mafID>(strlen(str));\n\n}\n\n\n\n \n\n//----------------------------------------------------------------------------\n\n// Description:\n\n// Copy string to the other string.\n\nvoid mafString::Copy(char* dest, const char* src)\n","file_path":"Base/mafString.cpp","rank":90,"score":64864.46799789997},{"content":"}\n\n\n\n//----------------------------------------------------------------------------\n\nmafString::mafString():m_CStr(NULL),m_ConstCStr(\"\"),m_Size(0)\n\n//----------------------------------------------------------------------------\n\n{\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nmafString::mafString(const mafString& src):m_CStr(NULL),m_ConstCStr(\"\"),m_Size(0)\n\n//----------------------------------------------------------------------------\n\n{\n\n Copy(src.GetCStr());\n\n}\n\n//----------------------------------------------------------------------------\n\nmafString::mafString(const char *src):m_CStr(NULL),m_ConstCStr(\"\"),m_Size(0)\n\n//----------------------------------------------------------------------------\n\n{\n\n Copy(src);\n\n}\n","file_path":"Base/mafString.cpp","rank":91,"score":64864.21892087765},{"content":"}\n\n\n\n//----------------------------------------------------------------------------\n\nchar *mafString::ParsePathName(mafString *str)\n\n//----------------------------------------------------------------------------\n\n{\n\n str->ForceDuplicate();\n\n return ParsePathName(str->m_CStr);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nchar *mafString::ParsePathName()\n\n//----------------------------------------------------------------------------\n\n{\n\n return mafString::ParsePathName(this);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid mafString::SetPathName(const char *str)\n\n//----------------------------------------------------------------------------\n","file_path":"Base/mafString.cpp","rank":92,"score":64864.16060207346},{"content":"bool mafString::StartsWith(const char* str1, const char* str2)\n\n//----------------------------------------------------------------------------\n\n{\n\n if ( !str1 || !str2 || strlen(str1) < strlen(str2) )\n\n {\n\n return false;\n\n }\n\n return !strncmp(str1, str2, strlen(str2)); \n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nbool mafString::StartsWith(const char* str) const\n\n//----------------------------------------------------------------------------\n\n{ \n\n return StartsWith(m_Size>0?m_CStr:m_ConstCStr, str);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\n// Check if the first string starts with the second one.\n\nbool mafString::EndsWith(const char* str1, const char* str2)\n","file_path":"Base/mafString.cpp","rank":93,"score":64864.10001538037},{"content":"mafString &mafString::operator<<( std::string s )\n\n//----------------------------------------------------------------------------\n\n{\n\n Append(s);\n\n return *this;\n\n}\n\n*/\n\n//----------------------------------------------------------------------------\n\nmafString &mafString::operator<<( mafString *s )\n\n//----------------------------------------------------------------------------\n\n{\n\n Append( s->m_CStr );\n\n return *this;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nmafString& mafString::operator+=(const char *s)\n\n//----------------------------------------------------------------------------\n\n{\n\n Append(s);\n","file_path":"Base/mafString.cpp","rank":94,"score":64863.69930792541},{"content":"\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nchar *mafString::ParsePathName(char *str)\n\n//----------------------------------------------------------------------------\n\n{\n\n if (mafString::IsEmpty(str))\n\n return str;\n\n\n\n // for Windows platforms parse the string to substitute \"/\" and \"\\\\\" with the right one.\n\n#ifdef _WIN32\n\n for (unsigned int i=0;i<Length(str);i++)\n\n {\n\n if (str[i]=='\\\\')\n\n str[i]='/';\n\n }\n\n#endif\n\n\n\n return str;\n","file_path":"Base/mafString.cpp","rank":95,"score":64863.6675666407},{"content":"\n\n // allocate new memory and copy the second string's content\n\n if (src)\n\n { \n\n store = new char[strlen(src)+1];\n\n strcpy(store,src);\n\n }\n\n else \n\n { \n\n // in case of NULL string reset the output string pointer...\n\n store = NULL;\n\n }\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nchar* mafString::Duplicate() const\n\n//---------------------------------------------------------------------------- \n\n{\n\n return Duplicate(m_Size>0?m_CStr:m_ConstCStr);\n\n}\n","file_path":"Base/mafString.cpp","rank":96,"score":64863.61395014039},{"content":"\n\n\n\n//----------------------------------------------------------------------------\n\n// This method compare two strings. It is similar to strcmp,\n\n// but it can handle null pointers.\n\nint mafString::Compare(const char* str1, const char* str2)\n\n//----------------------------------------------------------------------------\n\n{\n\n if (!str1&&!str2)\n\n return 0;\n\n\n\n if ( !str1&&str2 )\n\n {\n\n return -1;\n\n }\n\n\n\n if ( !str2&&str1 )\n\n {\n\n return 1;\n\n }\n","file_path":"Base/mafString.cpp","rank":97,"score":64863.551016460224},{"content":"{\n\n if (mafString::IsEmpty(str))\n\n return;\n\n\n\n Copy(str);\n\n\n\n ParsePathName(m_CStr);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid mafString::SetPathName(mafString *str)\n\n//----------------------------------------------------------------------------\n\n{\n\n SetPathName(str->GetCStr());\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nconst char *mafString::BaseName(const char *filename)\n\n//----------------------------------------------------------------------------\n\n{\n","file_path":"Base/mafString.cpp","rank":98,"score":64863.49675713878},{"content":" unsigned long len=Length();\n\n SetMaxLength(m_Size>=len?m_Size:len); \n\n }\n\n}\n\n//----------------------------------------------------------------------------\n\nchar *mafString::GetNonConstCStr()\n\n//----------------------------------------------------------------------------\n\n{\n\n ForceDuplicate();\n\n return m_CStr;\n\n}\n\n//----------------------------------------------------------------------------\n\nconst mafID mafString::Length() const\n\n//----------------------------------------------------------------------------\n\n{\n\n return Length(GetCStr());\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nmafString &mafString::Set(const char *a, bool release)\n","file_path":"Base/mafString.cpp","rank":99,"score":64863.29595387646}],"string":"[\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Interaction/mafCameraTransform.h\",\n \"rank\": 0,\n \"score\": 127481.85520661279\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Testing/Base/mafTransformFrameTest.h\",\n \"rank\": 1,\n \"score\": 124946.89338589914\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Testing/Base/vtkMAFToLinearTransformTest.h\",\n \"rank\": 2,\n \"score\": 123742.2093744945\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Interaction/mafGizmoHandle.h\",\n \"rank\": 3,\n \"score\": 113059.86267520633\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Interaction/mafAvatar3D.h\",\n \"rank\": 4,\n \"score\": 113059.86267520633\n },\n {\n \"content\": \" OVERLAPPED osReader; /* overlapped structure for reading */\\n\",\n \"file_path\": \"Interaction/Drivers/serial.h\",\n \"rank\": 5,\n \"score\": 112943.25534293203\n },\n {\n \"content\": \"class vtkTransform;\\n\\n\\n\\n/** Basic gizmo component used to perform constrained translation on one axis.\\n\\n \\n\\n @sa mafGizmoTranslate \\n\\n*/\\n\",\n \"file_path\": \"Interaction/mafGizmoTranslateAxis.h\",\n \"rank\": 6,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Interaction/mafGizmoRotateFan.h\",\n \"rank\": 7,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Interaction/mafGizmoTranslatePlane.h\",\n \"rank\": 8,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\\n\\n\\n/** Gizmo component used to perform isotropic scaling.\\n\\n \\n\\n @sa mafGizmoScale\\n\\n*/\\n\",\n \"file_path\": \"Interaction/mafGizmoScaleIsotropic.h\",\n \"rank\": 9,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"VME/mafVMERefSys.h\",\n \"rank\": 10,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Interaction/mafGizmoBoundingBox.h\",\n \"rank\": 11,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"Interaction/mafGizmoAutoscaleHelper.h\",\n \"rank\": 12,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\\n\\n\\n/** Basic gizmo component used to perform constrained scaling along one axis.\\n\\n \\n\\n @sa mafGizmoScale\\n\\n*/\\n\",\n \"file_path\": \"Interaction/mafGizmoScaleAxis.h\",\n \"rank\": 13,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"class vtkTransform;\\n\\n\\n\\ntemplate class MAF_EXPORT mafAutoPointer<mafMatrix>;\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n/** Basic gizmo component used to perform constrained rotation around an axis.\\n\\n \\n\\n @sa mafGizmoRotate\\n\\n*/\\n\",\n \"file_path\": \"Interaction/mafGizmoRotateCircle.h\",\n \"rank\": 14,\n \"score\": 111390.35053719708\n },\n {\n \"content\": \"//class vtkImageData;\\n\\nclass vtkRectilinearGrid;\\n\\n\\n\\n\\n\",\n \"file_path\": \"vtkMAF/vtkMAFVolumeResample.h\",\n \"rank\": 15,\n \"score\": 108454.3476626176\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"vtkMAF/vtkMAFAnnotatedCubeActor.h\",\n \"rank\": 16,\n \"score\": 108311.02057408824\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"vtkMAF/vtkMAFGlobalAxesHeadActor.h\",\n \"rank\": 17,\n \"score\": 106888.07777783138\n },\n {\n \"content\": \"class vtkTransform;\\n\",\n \"file_path\": \"vtkMAF/vtkMAFRayCast3DPicker.h\",\n \"rank\": 18,\n \"score\": 106888.07777783138\n },\n {\n \"content\": \" function is of type void *, and returns NULL.\\n\\n Otherwise the type is void which is correct for WIN32\\n\\n and SPROC\\n\\n*/ \\n\\n#ifdef CMAKE_USE_SPROC_INIT\\n\\ntypedef int mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n\\n\\n#ifdef CMAKE_USE_PTHREADS_INIT\\n\\ntypedef void *(*mmuInternalThreadFunctionType)(void *);\\n\\ntypedef pthread_t mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n#ifdef CMAKE_USE_WIN32_THREADS_INIT\\n\\ntypedef LPTHREAD_START_ROUTINE mmuInternalThreadFunctionType;\\n\\ntypedef HANDLE mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n#if !defined(CMAKE_USE_PTHREADS_INIT) && !defined(CMAKE_USE_WIN32_THREADS_INIT)\\n\\ntypedef void (*mmuInternalThreadFunctionType)(void *);\\n\\ntypedef int mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Base/mafMultiThreader.h\",\n \"rank\": 19,\n \"score\": 89890.90225688777\n },\n {\n \"content\": \"class ListOfPolyline2D : public std::vector<Polyline2D*> \\n\\n{\\n\\npublic:\\n\\n /** Clear the list of polylines. */\\n\\n void clear();\\n\\n /** check if point is inside the contour */\\n\\n bool IsInside(int x, int y, int polylineLengthThreshold);\\n\\n /** retrieve contour polyline */\\n\\n Polyline2D *FindContour(int x, int y, int polylineLengthThreshold, int distance = 1);\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"vtkMAF/vtkMAFContourVolumeMapper.h\",\n \"rank\": 20,\n \"score\": 85503.3082038713\n },\n {\n \"content\": \" class ListOfPolyline2DGPU : public std::vector<Polyline2DGPU*> \\n\\n {\\n\\n public:\\n\\n /** Clear the list of polylines. */\\n\\n void clear();\\n\\n /** check if point is inside the contour */\\n\\n bool IsInside(int x, int y, int polylineLengthThreshold);\\n\\n /** retrieve contour polyline */\\n\\n Polyline2DGPU *FindContour(int x, int y, int polylineLengthThreshold, int distance = 1);\\n\\n };\\n\\n//}//end baoquan space\\n\\n#endif\\n\",\n \"file_path\": \"vtkMAF/vtkMAFContourVolumeMapperGPU.h\",\n \"rank\": 21,\n \"score\": 84430.9551618731\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\n// constants\\n\\n//----------------------------------------------------------------------------\\n\\nenum MAF_TAG_IDS {MAF_MISSING_TAG=0,MAF_NUMERIC_TAG,MAF_STRING_TAG};\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// forward declarations\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n/** an utility class for storing <key-type-array of values> information.\\n\\n an utility class for storing <key-type-array of values> information.\\n\\n @sa mafTagArray\\n\\n*/\\n\",\n \"file_path\": \"Core/mafTagItem.h\",\n \"rank\": 22,\n \"score\": 84403.6615299609\n },\n {\n \"content\": \"class ListOfPolyline2DAdv : public std::vector<Polyline2DAdv*> \\n\\n{\\n\\npublic:\\n\\n /** Clear the list of polylines. */\\n\\n void clear();\\n\\n /** check if point is inside the contour */\\n\\n bool IsInside(int x, int y, int polylineLengthThreshold);\\n\\n /** retrieve contour polyline */\\n\\n Polyline2DAdv *FindContour(int x, int y, int polylineLengthThreshold, int distance = 1);\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"vtkMAF/vtkMAFContourVolumeMapperAdv.h\",\n \"rank\": 23,\n \"score\": 82421.49761411735\n },\n {\n \"content\": \"class mafCString : public mafString\\n\\n{\\n\\npublic:\\n\\n /** constructor. */\\n\\n mafCString(const char *str) {Set(str);}\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 24,\n \"score\": 79131.96552993653\n },\n {\n \"content\": \"class MAF_EXPORT mafTransform : public mafTransformBase\\n\\n{\\n\\n public:\\n\\n //------------------------------------------------------------------------------\\n\\n // Events\\n\\n //------------------------------------------------------------------------------\\n\\n //MAF_ID_DEC(UpdateEvent); // Event rised by updates of the internal matrix\\n\\n\\t\\n\\n mafTransform();\\n\\n ~mafTransform();\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n // Ref Sys Type:\\n\\n //----------------------------------------------------------------------------\\n\\n enum \\n\\n {\\n\\n CUSTOM = 0, ///< auxiliar ref sys \\n\\n GLOBAL, \\n\\n PARENT,\\n\\n LOCAL, ///< the local ref sys of the VME\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 25,\n \"score\": 77084.77481879703\n },\n {\n \"content\": \"class MAF_EXPORT mafCameraTransform:public mafTransformBase\\n\\n{\\n\\npublic:\\n\\n mafCameraTransform();\\n\\n virtual ~mafCameraTransform();\\n\\n\\n\\n mafTypeMacro(mafCameraTransform,mafTransformBase);\\n\\n \\n\\n enum AutoPositionModalities\\n\\n {\\n\\n ATTACH_TO_FOCAL_POINT, ///< Follow the focal point\\n\\n ATTACH_TO_CAMERA, ///< Follow the camera position\\n\\n ATTACH_TO_CLIPPING_PLANE ///< Follow the neat clipping plane\\n\\n };\\n\\n\\n\\n enum AutoFittingModalities\\n\\n {\\n\\n MAX_SCALE, ///< Select the maximum scale among X/Y (i.e. fit the minimum size)\\n\\n MIN_SCALE, ///< Select the minimum scale X/Y (i.e. fit the maximum size)\\n\\n FIT_X, ///< Always fit the X axis\\n\",\n \"file_path\": \"Interaction/mafCameraTransform.h\",\n \"rank\": 26,\n \"score\": 75303.09257940431\n },\n {\n \"content\": \"class MAF_EXPORT mafTransformFrame : public mafTransformBase\\n\\n{\\n\\n public:\\n\\n mafTransformFrame();\\n\\n ~mafTransformFrame();\\n\\n\\t\\n\\n mafTypeMacro(mafTransformFrame,mafTransformBase);\\n\\n\\n\\n //virtual void Print(std::ostream& os, const int tabs=0) const;\\n\\n\\n\\n /** set the matrix to be transformed */\\n\\n void SetInput(mafTransformBase *frame);\\n\\n void SetInput(mafMatrix *frame);\\n\\n mafTransformBase *GetInput() {return m_Input;}\\n\\n\\n\\n /**\\n\\n Set/Get the input reference system, i.e. the reference system of the \\n\\n input matrix.*/\\n\\n void SetInputFrame(mafMatrix *frame);\\n\\n void SetInputFrame(mafTransformBase *frame);\\n\",\n \"file_path\": \"Base/mafTransformFrame.h\",\n \"rank\": 27,\n \"score\": 75303.09257940431\n },\n {\n \"content\": \"class vtkLinearTransform;\\n\",\n \"file_path\": \"Base/mafTransformBase.h\",\n \"rank\": 28,\n \"score\": 74191.18662171692\n },\n {\n \"content\": \"class MAF_EXPORT vtkMAFToLinearTransform : public vtkLinearTransform\\n\\n{\\n\\n public:\\n\\n static vtkMAFToLinearTransform *New();\\n\\n vtkTypeRevisionMacro(vtkMAFToLinearTransform,vtkLinearTransform);\\n\\n void PrintSelf (ostream& os, vtkIndent indent);\\n\\n \\n\\n /** \\n\\n Set the input matrix. Any modifications to the MAF matrix will be\\n\\n reflected in the VTK transformation. This also set InputTransform to NULL.*/\\n\\n virtual void SetInputMatrix(mafMatrix *);\\n\\n\\n\\n /** return connected matrix if exists. */\\n\\n mafMatrix *GetInputMatrix() {return m_InputMatrix;}\\n\\n \\n\\n /** \\n\\n Set the input transform. Any modifications to the MAF transform will be\\n\\n reflected in the VTK transformation. This also set InputMatrix to NULL.*/\\n\\n virtual void SetInputTransform(mafTransformBase *);\\n\\n\\n\",\n \"file_path\": \"Base/vtkMAFToLinearTransform.h\",\n \"rank\": 29,\n \"score\": 73601.91076365368\n },\n {\n \"content\": \"class vtkMAFToLinearTransform;\\n\\n\\n\\n#ifdef MAF_EXPORTS\\n\\ntemplate class MAF_EXPORT mafAutoPointer<mafMatrix>;\\n\\n#endif\\n\\n\\n\\n/** Superclass for Homogeneous transformations.\\n\\n mafTransformBase is the superclass for MAF geometric, and currently homogeneous\\n\\n only, transformations. The idea behind a mafTransformBase is the Update() method\\n\\n should always be called to update the output, which is a mafMatrix internally stored.\\n\\n @sa mafTransform\\n\\n @todo\\n\\n - change SetTimeStamp to apply a Modified(), than change matrix pipes to not call it!!!\\n\\n - implement issuing of a MATRIX_UPDATED event: add an event source member\\n\\n */\\n\",\n \"file_path\": \"Base/mafTransformBase.h\",\n \"rank\": 30,\n \"score\": 72945.35301645698\n },\n {\n \"content\": \"class mafTransformBase;\\n\",\n \"file_path\": \"Base/vtkMAFToLinearTransform.h\",\n \"rank\": 31,\n \"score\": 72945.35301645698\n },\n {\n \"content\": \"class MAF_EXPORT mafOpMAFTransform : public mafOpTransformInterface\\n\\n{\\n\\npublic:\\n\\n mafOpMAFTransform(const wxString &label = \\\"Transform \\\\tCtrl+T\\\");\\n\\n ~mafOpMAFTransform(); \\n\\n virtual void OnEvent(mafEventBase *maf_event);\\n\\n \\n\\n mafTypeMacro(mafOpMAFTransform, mafOp);\\n\\n\\n\\n mafOp* Copy();\\n\\n\\n\\n /** Return true for the acceptable vme type. */\\n\\n bool Accept(mafNode* vme);\\n\\n\\n\\n /** Builds operation's interface. */\\n\\n void OpRun();\\n\\n \\n\\n /** Execute the operation. */\\n\\n void OpDo();\\n\\n \\n\",\n \"file_path\": \"Operations/mafOpMAFTransform.h\",\n \"rank\": 32,\n \"score\": 72779.82162454759\n },\n {\n \"content\": \"//support object\\n\\nclass mafTransformBaseDerivedClass : public mafTransformBase\\n\\n{\\n\\n\\tmafTypeMacro(mafTransformBaseDerivedClass,mafTransformBase);\\n\\n\\tmafTransformBaseDerivedClass(){;};\\n\\n\\t\\n\\n\\tvirtual void SetMatrix(const mafMatrix &input) {*m_Matrix=input;SetTimeStamp(input.GetTimeStamp());Modified();}\\n\\n\\n\\n\\t~mafTransformBaseDerivedClass(){;};\\n\\n protected:\\n\\n\\t\\tvirtual void InternalUpdate(){;};\\n\\n};\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nmafCxxTypeMacro(mafTransformBaseDerivedClass)\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafTransformBaseTest::TestFixture()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\",\n \"file_path\": \"Testing/Base/mafTransformBaseTest.cpp\",\n \"rank\": 33,\n \"score\": 72779.82162454759\n },\n {\n \"content\": \"class MAF_EXPORT mafGUITransformMouse : public mafGUITransformInterface\\n\\n{\\n\\npublic:\\n\\n mafGUITransformMouse(mafVME *input, mafObserver *listener = NULL, bool testMode = false);\\n\\n\\t~mafGUITransformMouse(); \\n\\n\\n\\n // constraints enum\\n\\n enum TRANSFORM_MOUSE_WIDGET_ID\\n\\n {\\n\\n X_AXIS = 0,\\n\\n Y_AXIS, \\n\\n Z_AXIS,\\n\\n VIEW_PLANE, \\n\\n NORMAL_VIEW_PLANE,\\n\\n XY_PLANE, \\n\\n XZ_PLANE, \\n\\n YZ_PLANE,\\n\\n SURFACE_SNAP,\\n\\n NORMAL_SURFACE,\\n\\n };\\n\",\n \"file_path\": \"Interaction/mafGUITransformMouse.h\",\n \"rank\": 34,\n \"score\": 72779.82162454759\n },\n {\n \"content\": \"class mafXMLString;\\n\\n\\n\",\n \"file_path\": \"Testing/IO/mafXMLStringTest.h\",\n \"rank\": 35,\n \"score\": 71903.45921210258\n },\n {\n \"content\": \"class MAF_EXPORT mafXMLString\\n\\n{\\n\\npublic:\\n\\n\\tmafXMLString() : m_WStr(0L), m_CStr(NULL) { };\\n\\n\\tmafXMLString(const char *str);\\n\\n\\tmafXMLString(XMLCh *wstr);\\n\\n\\tmafXMLString(const XMLCh *wstr);\\n\\n\\tmafXMLString(const mafXMLString ©);\\n\\n\\t~mafXMLString();\\n\\n\\tbool Append(const XMLCh *tail);\\n\\n\\tbool Erase(const XMLCh *head, const XMLCh *tail);\\n\\n\\tconst XMLCh* Begin() const;\\n\\n\\tconst XMLCh* End() const;\\n\\n\\tint Size() const;\\n\\n const char *GetCStr();\\n\\n\\tXMLCh & operator [] (const int i);\\n\\n\\tconst XMLCh operator [] (const int i) const;\\n\\n\\toperator const XMLCh * () const { return m_WStr; };\\n\\n operator const char * () {return GetCStr();}\\n\\nprotected:\\n\\n XMLCh *m_WStr;\\n\\n char *m_CStr;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"IO/mafXMLString.h\",\n \"rank\": 36,\n \"score\": 71903.45921210258\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\n// widget id's\\n\\n//----------------------------------------------------------------------------\\n\\nenum MAF_TRANSFORM_ID\\n\\n{\\n\\n\\tID_SHOW_GIZMO = MINID,\\n\\n ID_CHOOSE_GIZMO_COMBO,\\n\\n ID_ROTATION_STEP,\\n\\n ID_TRANSLATION_STEP,\\n\\n ID_ENABLE_STEP,\\n\\n ID_ROT_SNAP,\\n\\n ID_RESET,\\n\\n ID_AUX_REF_SYS,\\n\\n ID_ENABLE_SCALING,\\n\\n ID_ROLLOUT_TEXT_ENTRIES,\\n\\n ID_ROLLOUT_GIZMO_TRANSLATE,\\n\\n ID_ROLLOUT_GIZMO_ROTATE,\\n\\n ID_ROLLOUT_GIZMO_SCALE,\\n\\n ID_ROLLOUT_SAVE_POS\\n\\n};\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nmafCxxTypeMacro(mafOpMAFTransform);\\n\",\n \"file_path\": \"Operations/mafOpMAFTransform.cpp\",\n \"rank\": 37,\n \"score\": 71740.66900505233\n },\n {\n \"content\": \"class mafGUITransformMouse;\\n\",\n \"file_path\": \"Operations/mafOpTransformInterface.h\",\n \"rank\": 38,\n \"score\": 71740.66900505233\n },\n {\n \"content\": \"class mafGUITransformMouse;\\n\",\n \"file_path\": \"Operations/mafOpMAFTransform.h\",\n \"rank\": 39,\n \"score\": 71740.66900505233\n },\n {\n \"content\": \"class mafGUITransformInterfaceDummy : public mafGUITransformInterface\\n\\n{\\n\\npublic:\\n\\n mafGUITransformInterfaceDummy():mafGUITransformInterface(){};\\n\\n ~mafGUITransformInterfaceDummy(){};\\n\\n\\n\\n /*virtual*/ void EnableWidgets(bool enable){};\\n\\nprotected:\\n\\nprivate:\\n\\n};\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafGUITransformInterfaceTest::TestFixture()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafGUITransformInterfaceTest::setUp()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\",\n \"file_path\": \"Testing/Interaction/mafGUITransformInterfaceTest.cpp\",\n \"rank\": 40,\n \"score\": 71189.53296860619\n },\n {\n \"content\": \"class MAF_EXPORT mafGUITransformTextEntries : public mafGUITransformInterface\\n\\n{\\n\\npublic:\\n\\n\\n\\n mafGUITransformTextEntries(mafVME *input, mafObserver *listener = NULL, bool enableScaling = true, bool testMode = false);\\n\\n\\t~mafGUITransformTextEntries(); \\n\\n\\n\\n void OnEvent(mafEventBase *maf_event);\\n\\n\\n\\n /** Enable-Disable the GUI's widgets */\\n\\n\\tvoid EnableWidgets(bool enable);\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n //gui constants: \\n\\n //----------------------------------------------------------------------------\\n\\n\\n\\n // this constants must be visible from the owner object \\n\\n enum TRANSFORMTEXTENTRIES_WIDGET_ID\\n\\n {\\n\\n ID_TRANSLATE_X = MINID,\\n\",\n \"file_path\": \"Interaction/mafGUITransformTextEntries.h\",\n \"rank\": 41,\n \"score\": 71189.53296860619\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\n// Constants :\\n\\n//----------------------------------------------------------------------------\\n\\nenum VOLUME_RESAMPLE_WIDGET_ID\\n\\n{\\n\\n\\tID_FIRST = MINID,\\t\\n\\n\\tID_VOLUME_DIR_X,\\n\\n\\tID_VOLUME_DIR_Y,\\n\\n\\tID_VOLUME_DIR_Z,\\n\\n ID_VOLUME_ORIGIN,\\n\\n ID_VOLUME_ORIENTATION,\\n\\n ID_VOLUME_4DBOUNDS,\\n\\n ID_VOLUME_VMEBOUNDS,\\n\\n ID_VOLUME_VMELOCALBOUNDS,\\n\\n ID_VOLUME_SPACING,\\n\\n ID_VOLUME_CURRENT_SLICE,\\n\\n ID_VOLUME_AUTOSPACING,\\n\\n ID_VOLUME_ZERO_VALUE\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Operations/mafOpVolumeResample.cpp\",\n \"rank\": 42,\n \"score\": 70745.96697888004\n },\n {\n \"content\": \"class MAF_EXPORT mafString : public mafBase\\n\\n{\\n\\npublic:\\n\\n \\n\\n /**\\n\\n This static method returns the size of c-string. If the string is empty,\\n\\n it returns 0. It can handle null pointers.*/\\n\\n static mafID Length(const char* str);\\n\\n \\n\\n /** This method returns the size of this string. */\\n\\n const mafID Length() const;\\n\\n\\n\\n /** static method to copy c-string to the another c-string.*/\\n\\n static void Copy(char* dest, const char* src);\\n\\n \\n\\n /** Copy a c-string to this string.*/\\n\\n void Copy(const char* src);\\n\\n\\n\\n /** Copy N characters of another string to this string.*/\\n\\n void NCopy(const char* src,int n);\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 43,\n \"score\": 70735.2743918447\n },\n {\n \"content\": \"class mafGUITransformTextEntries;\\n\",\n \"file_path\": \"Operations/mafOpMAFTransform.h\",\n \"rank\": 44,\n \"score\": 70575.128967825\n },\n {\n \"content\": \"class mafStringTest : public CPPUNIT_NS::TestFixture\\n\\n{\\n\\n CPPUNIT_TEST_SUITE( mafStringTest );\\n\\n CPPUNIT_TEST( Test );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n protected:\\n\\n /** Test multiple string features with a single test */\\n\\n void Test();\\n\\n};\\n\\n\\n\\n\\n\\nint\\n\\nmain( int argc, char* argv[] )\\n\\n{\\n\\n // Create the event manager and test controller\\n\\n CPPUNIT_NS::TestResult controller;\\n\\n\\n\\n // Add a listener that colllects test result\\n\\n CPPUNIT_NS::TestResultCollector result;\\n\",\n \"file_path\": \"Testing/Base/mafStringTest.h\",\n \"rank\": 45,\n \"score\": 67447.88344584563\n },\n {\n \"content\": \"class mafTransformTest : public CPPUNIT_NS::TestFixture\\n\\n{\\n\\n public: \\n\\n\\n\\n // CPPUNIT fixture: executed before each test\\n\\n void setUp();\\n\\n\\n\\n // CPPUNIT fixture: executed after each test\\n\\n void tearDown();\\n\\n\\n\\n // CPPUNIT test suite\\n\\n CPPUNIT_TEST_SUITE( mafTransformTest );\\n\\n CPPUNIT_TEST( TestFixture ); // just to test that the fixture has no leaks\\n\\n CPPUNIT_TEST( TestTranslateRotateScale );\\n\\n CPPUNIT_TEST( TestPolarDecomposition );// leaked! Leak source is mafMatrix\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n private:\\n\\n \\n\\n void TestFixture();\\n\",\n \"file_path\": \"Testing/Base/mafTransformTest.h\",\n \"rank\": 46,\n \"score\": 67295.18071037832\n },\n {\n \"content\": \"class MAF_EXPORT mafTransformBase : public mafReferenceCounted\\n\\n{\\n\\npublic:\\n\\n mafTransformBase();\\n\\n ~mafTransformBase();\\n\\n\\n\\n /** copy constructor */\\n\\n mafTransformBase(const mafTransformBase&);\\n\\n\\n\\n mafAbstractTypeMacro(mafTransformBase,mafReferenceCounted);\\n\\n virtual void Print(std::ostream& os, const int indent=0) const;\\n\\n\\n\\n /** update and return internal transform matrix */\\n\\n virtual const mafMatrix &GetMatrix() {Update();return *m_Matrix;}\\n\\n\\n\\n /** \\n\\n return pointer to internal matrix (after updating).\\n\\n BEWARE: do not change the matrix directly. */\\n\\n mafMatrix *GetMatrixPointer() {Update(); return m_Matrix;}\\n\\n\\n\",\n \"file_path\": \"Base/mafTransformBase.h\",\n \"rank\": 47,\n \"score\": 67295.18071037832\n },\n {\n \"content\": \" const bool operator!=(const char *src) const;\\n\\n const bool operator<(const char *a) const;\\n\\n const bool operator>(const char *a) const;\\n\\n const bool operator<=(const char *a) const;\\n\\n const bool operator>=(const char *a) const;\\n\\n\\n\\n //friend MAF_EXPORT std::ostream& operator<<(std::ostream& os, const mafString& s);\\n\\n //friend MAF_EXPORT std::istream& operator>>(std::istream& is, mafString& s);\\n\\n\\n\\n mafString &operator<<(const char *a) {return Append(a);};\\n\\n\\n\\n void operator<<(std::ostream &os);\\n\\n void operator>>(std::istream &os);\\n\\n\\n\\n mafString& operator<<( int d);\\n\\n mafString& operator<<( long d);\\n\\n mafString& operator<<( float d);\\n\\n mafString& operator<<( double d);\\n\\n\\t/** Put inside string a mafMatrix in row order \\n\\n\\texample:\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 48,\n \"score\": 66882.49840642868\n },\n {\n \"content\": \" mafString &operator=(const char *src);\\n\\n mafString &operator=(const double &num);\\n\\n#ifdef MAF_USE_WX\\n\\n mafString &operator=(const wxString &str);\\n\\n#endif\\n\\n mafString();\\n\\n ~mafString();\\n\\nprotected:\\n\\n\\n\\n /** Allocate space for the internal c-string. */\\n\\n int SetSize(mafID size);\\n\\n\\n\\n void Initialize() {m_CStr=NULL;m_ConstCStr=\\\"\\\";m_Size=0;};\\n\\n\\n\\n char *m_CStr;\\n\\n const char *m_ConstCStr;\\n\\n mafID m_Size;\\n\\n};\\n\\n\\n\\n/**\\n\\n Class Name : mafCString.\\n\\n this string class is thought to simply wrap a c-string: no memory copy.\\n\\n*/\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 49,\n \"score\": 66869.94039391281\n },\n {\n \"content\": \" 1 0 0 0\\n\\n\\t0 1 0 0\\n\\n\\t0 0 1 0\\n\\n\\t0 0 0 1\\n\\n\\t-> \\\"1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1\\\"\\n\\n\\t*/\\n\\n\\tmafString& operator<<( mafMatrix d);\\n\\n mafString& operator<<( mafString *s);\\n\\n //void operator<<( std::string s);\\n\\n\\n\\n mafString& operator+=(const char *s);\\n\\n\\n\\n mafString(const mafString &src);\\n\\n mafString(const char *src);\\n\\n mafString(const double &num);\\n\\n#ifdef MAF_USE_WX\\n\\n mafString(const wxString &str);\\n\\n#endif\\n\\n\\n\\n mafString &operator=(const mafString &mat);\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 50,\n \"score\": 66865.0954141186\n },\n {\n \"content\": \"\\n\\n /** Erase characters from start position to end position. If end\\n\\n is not specified erase to the end of the string.*/\\n\\n void Erase(int start,int end=-1);\\n\\n\\n\\n /**\\n\\n This method makes a duplicate of a c-string similar to C function\\n\\n strdup but it uses new to create new string, so you can use\\n\\n delete to remove it. It returns 0 if the input is empty. This function\\n\\n automatically release old pointed data (if not specified differently)*/\\n\\n static char* Duplicate(const char* str);\\n\\n\\n\\n /**\\n\\n This method makes a duplicate of the string similar to C function\\n\\n strdup but it uses new to create new string, so you can use\\n\\n delete to remove it. It returns 0 if the input is empty. The new\\n\\n string pointer is copied in the destination pointer. If this was\\n\\n already != NULL, the corresponding memory is released. This is useful\\n\\n to automatically manage garbage collection but beware to not provide \\n\\n an uninitialized pointer variable. Beware memory releasing\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 51,\n \"score\": 66865.01348719474\n },\n {\n \"content\": \" static char *ParsePathName(char *str);\\n\\n char *ParsePathName(mafString *str);\\n\\n\\n\\n /** Force the string to create an internal duplication in place of reference to const char */\\n\\n void ForceDuplicate();\\n\\n \\n\\n /** Return the pointer to the internal c-string */\\n\\n const char * GetCStr() const;\\n\\n \\n\\n /** \\n\\n Return the pointer to the internal c-string, but first force string\\n\\n the internal copy @sa ForceDulicate () */\\n\\n char *GetNonConstCStr();\\n\\n\\n\\n /** return the real memory size allocated for the internal c-string */\\n\\n int GetSize() const {return m_Size;};\\n\\n\\n\\n /**\\n\\n Pre-Allocate space for the internal c-string. The memory size is\\n\\n is given in terms of string length, that is one more character\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 52,\n \"score\": 66863.4581635056\n },\n {\n \"content\": \"\\n\\n /** Format given arguments according to format string. Format string format is\\n\\n that of vsprintf function */\\n\\n void Printf(const char *format, ...);\\n\\n\\n\\n /** like Printf but faster (you can specify output string size) */ \\n\\n void NPrintf(unsigned long size, const char *format, ...);\\n\\n\\n\\n /** this allows to convert a mafString to const char *. */\\n\\n operator const char*() const {return GetCStr();}\\n\\n\\n\\n /** \\n\\n Direct access to single string elements for writing. This operator\\n\\n forces memory copy in case of internal const char reference. */\\n\\n char & operator [] (const int i);\\n\\n\\n\\n /** direct access to string single elements for reading */\\n\\n const char operator [] (const int i) const;\\n\\n\\n\\n const bool operator==(const char *src) const;\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 53,\n \"score\": 66862.07526536116\n },\n {\n \"content\": \" /** Find last occurrence of a substring */\\n\\n int FindLast(const char *str) const;\\n\\n\\n\\n /** Extract the base name of a filename string */\\n\\n static const char *BaseName(const char *filename);\\n\\n const char *BaseName() const;\\n\\n\\n\\n /** Extract the pathname from a filename string. Result is written inplace. */\\n\\n void ExtractPathName();\\n\\n\\n\\n /**\\n\\n parse the given string to substitute each (back)slash\\n\\n character with the right pathname separator.*/\\n\\n void SetPathName(const char *str);\\n\\n void SetPathName(mafString *str);\\n\\n\\n\\n /**\\n\\n parse the given string to substitute each (back)slash\\n\\n character with the right pathname separator.*/\\n\\n char *ParsePathName();\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 54,\n \"score\": 66860.74364841188\n },\n {\n \"content\": \" for the trailing '\\\\0' is allocated. Previous data is retained.\\n\\n Memory is reallocated only if requested size is > of existing one.\\n\\n All the mafString methods resize this memory when necessary, but to\\n\\n improve performance it's possible to preallocate an enough large\\n\\n memory to store the data preventing reallocation of memory.\\n\\n Return 0 if OK, -1 in case of relocation problems */\\n\\n int SetMaxLength(mafID len);\\n\\n\\n\\n /** return true if empty*/\\n\\n static bool IsEmpty(const char *str) { return (str?str[0]=='\\\\0':true);};\\n\\n /** return true if empty*/\\n\\n bool IsEmpty() const { return IsEmpty(GetCStr());};\\n\\n\\n\\n /** \\n\\n Set the internal pointer to a give pointer. Second parameter allow \\n\\n to force the release of the memory */\\n\\n mafString &Set(const char *a, bool release=false);\\n\\n \\n\\n /** this can be used only with non constant c-string */\\n\\n void SetCStr(char *a, bool release=false);\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 55,\n \"score\": 66859.43101993775\n },\n {\n \"content\": \" must be performed by consumer*/\\n\\n static void Duplicate(char * &store,const char *src,bool release=true);\\n\\n \\n\\n /**\\n\\n Duplicate the string stored inside this object. Beware memory releasing\\n\\n must be performed by consumer */\\n\\n char* Duplicate() const;\\n\\n \\n\\n /** \\n\\n This static method compare two strings. It is similar to strcmp, but it\\n\\n can handle null pointers. return 0 if str1 == str2, -1 if str1<str2,\\n\\n 1 if str1>str2*/\\n\\n static int Compare(const char* str1, const char* str2); \\n\\n\\n\\n /** \\n\\n This method compare the given c-string with the one stored inside this object.\\n\\n It is similar to strcmp, but it can handle null pointers. Return 0 if str equal this,\\n\\n -1 if str > this, 1 if str < this*/\\n\\n int Compare(const char* str) const;\\n\\n \\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 56,\n \"score\": 66859.19309559627\n },\n {\n \"content\": \" /** Check if this string ends with the given one.*/\\n\\n bool EndsWith(const char* str) const;\\n\\n\\n\\n /**\\n\\n Append two strings and produce a new one. The consumer must delete\\n\\n the resulting string. The method returns 0 if inputs are empty or\\n\\n if there was an error.*/\\n\\n static char* Append(const char* str1, const char* str2);\\n\\n /** Append a new string to this string. */\\n\\n mafString &Append(const char* str);\\n\\n\\n\\n /** Scan the string for the first occurrence of the character */\\n\\n int FindChr(const int c) const;\\n\\n\\n\\n /** Scan the string for the first occurrence of the character */\\n\\n int FindLastChr(const int c) const;\\n\\n\\n\\n /** Find first occurrence of a substring */\\n\\n int FindFirst(const char *str) const;\\n\\n\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 57,\n \"score\": 66857.71751175958\n },\n {\n \"content\": \" /**\\n\\n This static method compare two strings. It is similar to strcmp, but it\\n\\n can handle null pointers. Also it only returns C style true or\\n\\n false versus compare which returns also which one is greater.*/\\n\\n static bool Equals(const char* str1, const char* str2) { return Compare(str1, str2) == 0;}\\n\\n \\n\\n /**\\n\\n This method compare the given c-string with the one stored inside this object.\\n\\n It is similar to strcmp, but it can handle null pointers. Also it only\\n\\n returns C style true or false versus compare which returns also which\\n\\n one is greater.*/\\n\\n bool Equals(const char* str) const;\\n\\n \\n\\n /** Static method to check if the first string starts with the second one.*/\\n\\n static bool StartsWith(const char* str1, const char* str2);\\n\\n /** Check if this string starts with the given one.*/\\n\\n bool StartsWith(const char* str) const;\\n\\n\\n\\n /** Static method to check if the first string ends with the second one.*/\\n\\n static bool EndsWith(const char* str1, const char* str2); \\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 58,\n \"score\": 66849.03582585334\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: MAF2\\n\\n Module: mafString\\n\\n Authors: originally based on vtkString (www.vtk.org), rewritten Marco Petrone\\n\\n \\n\\n Copyright (c) B3C\\n\\n All rights reserved. See Copyright.txt or\\n\\n http://www.scsitaly.com/Copyright.htm for details.\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef __mafString_h\\n\\n#define __mafString_h\\n\\n\\n\\n#include \\\"mafDefines.h\\\"\\n\\n#include \\\"mafBase.h\\\" \\n\\n#include <string.h>\\n\\n\\n\\n//----------------------------------------------------------\\n\\n// forward references:\\n\\n//----------------------------------------------------------\\n\",\n \"file_path\": \"Base/mafString.h\",\n \"rank\": 59,\n \"score\": 66848.39935359401\n },\n {\n \"content\": \" /**\\n\\n This functions rotate the internal matrix around the specified axis. It can be used in conjuction with\\n\\n SetMatrix, but if a pipeline is defined (input, input_frame or target_frame) it's overwritten whenever\\n\\n the Update() is performed.*/\\n\\n static void RotateX(mafMatrix &matrix,double angle,int premultiply) { mafTransform::RotateWXYZ(matrix,matrix,angle, 1, 0, 0,premultiply); };\\n\\n static void RotateY(mafMatrix &matrix,double angle,int premultiply) { mafTransform::RotateWXYZ(matrix,matrix,angle, 0, 1, 0,premultiply); };\\n\\n static void RotateZ(mafMatrix &matrix,double angle,int premultiply) { mafTransform::RotateWXYZ(matrix,matrix,angle, 0, 0, 1,premultiply); };\\n\\n void RotateX(double angle,int premultiply) { this->RotateX(*m_Matrix,angle,premultiply); };\\n\\n void RotateY(double angle,int premultiply) { this->RotateY(*m_Matrix,angle,premultiply); };\\n\\n void RotateZ(double angle,int premultiply) { this->RotateZ(*m_Matrix,angle,premultiply); };\\n\\n\\n\\n /** Pre or Post multiply the internal matrix for given matrix and store result in the internal matrix */\\n\\n void Concatenate(const mafMatrix &matrix, int premultiply);\\n\\n\\n\\n /** Pre or Post multiply the internal matrix for given transform and store result in the internal matrix */\\n\\n void Concatenate(mafTransformBase *trans, int premultiply) {Concatenate(trans->GetMatrix(),premultiply);}\\n\\n\\n\\n /**\\n\\n This function set the orientation (acc. to VTK convention) of the matrix. Notice, the non static functions\\n\\n work on the internal matrix and can be used in conjuction with SetMatrix, but if a pipeline\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 60,\n \"score\": 66707.94514748175\n },\n {\n \"content\": \" as argument. Notice, the non static functions work on the internal matrix and can be used\\n\\n in conjuction with SetMatrix, but if a pipeline is defined (input, input_frame or \\n\\n target_frame) it's overwritten whenever the Update() is perfromed.*/\\n\\n static void Translate(mafMatrix &matrix,double translation[3],int premultiply);\\n\\n void Translate(double translation[3],int premultiply) {this->Translate(*m_Matrix,translation,premultiply);}\\n\\n void Translate(double x,double y,double z,int premultiply) {this->Translate(*m_Matrix,x,y,z,premultiply);}\\n\\n static void Translate(mafMatrix &matrix, double x,double y,double z,int premultiply) {\\n\\n double temp[3];\\n\\n temp[0]=x;temp[1]=y;temp[2]=z;\\n\\n Translate(matrix,temp,premultiply);}\\n\\n\\n\\n /**\\n\\n This function rotate the matrix around the specified axis. Notice, the non static functions\\n\\n work on the internal matrix and can be used in conjuction with SetMatrix, but if a pipeline\\n\\n is defined (input, input_frame or target_frame) it's overwritten whenever the Update() is perfromed.*/\\n\\n static void RotateWXYZ(const mafMatrix &source,mafMatrix &target,double angle,double x, double y, double z,int premultiply);\\n\\n void RotateWXYZ(double angle,double x, double y, double z,int premultiply) {this->RotateWXYZ(*m_Matrix,*m_Matrix,angle,x,y,z,premultiply);}\\n\\n void RotateWXYZ(double angle,double rot[3],int premultiply) {this->RotateWXYZ(*m_Matrix,*m_Matrix,angle, rot[0], rot[1], rot[2],premultiply);}\\n\\n\\n\\n\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 61,\n \"score\": 66701.47957804076\n },\n {\n \"content\": \" scale[2] = static_cast<float>(temp[2]); };\\n\\n\\n\\n /** Apply a scale transform. By default the scale matrix is premultiplied */\\n\\n static void Scale(mafMatrix &matrix,double scalex,double scaley,double scalez,int premultiply);\\n\\n void Scale(double scalex,double scaley,double scalez,int premultiply) \\\\\\n\\n { Scale(*m_Matrix,scalex,scaley,scalez,premultiply);}\\n\\n\\n\\n /** Set/Get internal matrix versor*/\\n\\n static void SetVersor(int axis, double versor[3], mafMatrix &matrix);\\n\\n \\n\\n static void GetVersor(int axis, const mafMatrix &matrix, double versor[3]) {mafMatrix::GetVersor(axis,matrix,versor);}\\n\\n static void GetVersor(int axis, const mafMatrix &matrix, float versor[3]) \\\\\\n\\n { \\\\\\n\\n double temp[3]; GetVersor(axis, matrix, temp); \\\\\\n\\n versor[0] = static_cast<float>(temp[0]); \\\\\\n\\n versor[1] = static_cast<float>(temp[1]); \\\\\\n\\n versor[2] = static_cast<float>(temp[2]); };\\n\\n \\n\\n void GetVersor(int axis, double versor[3]) {GetVersor(axis,GetMatrix(),versor);}\\n\\n void GetVersor(int axis, float versor[3]) {GetVersor(axis,GetMatrix(),versor);}\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 62,\n \"score\": 66700.44719613994\n },\n {\n \"content\": \" VIEW ///< the view ref sys\\n\\n };\\n\\n\\n\\n /** copy constructor */\\n\\n mafTransform(const mafTransform&);\\n\\n\\n\\n /** RTTI stuff */\\n\\n mafTypeMacro(mafTransform,mafTransformBase);\\n\\n \\n\\n /**\\n\\n Directly set the internal Matrix. It's overwritten by Update if Input or InputFrame !=NULL\\n\\n This function makes a copy of the input matrix. */\\n\\n virtual void SetMatrix(const mafMatrix &input) {*m_Matrix=input;SetTimeStamp(input.GetTimeStamp());Modified();}\\n\\n\\n\\n /** set the internal matrix pointer to the given matrix. Do not use this if you don't know what you are doing */\\n\\n void SetMatrixPointer(mafMatrix *matrix);\\n\\n\\n\\n\\t/**\\n\\n\\t Polar Decomposition of matrix M in Q * S.*/\\n\\n\\tstatic double PolarDecomp(const mafMatrix &M, mafMatrix &Q, mafMatrix &S, double translation[3]);\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 63,\n \"score\": 66699.37915997228\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: MAF2\\n\\n Module: mafTransform\\n\\n Authors: Marco Petrone, Stefano Perticoni,Stefania Paperini\\n\\n \\n\\n Copyright (c) B3C\\n\\n All rights reserved. See Copyright.txt or\\n\\n http://www.scsitaly.com/Copyright.htm for details.\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef __mafTransform_h\\n\\n#define __mafTransform_h\\n\\n\\n\\n#include \\\"mafTransformBase.h\\\"\\n\\n#include \\\"mafInteractorConstraint.h\\\"\\n\\n\\n\\n#include \\\"mafUtility.h\\\"\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n// Forward declarations\\n\\n//------------------------------------------------------------------------------\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 64,\n \"score\": 66696.90085025562\n },\n {\n \"content\": \" /**\\n\\n\\t Return the wxyz angle+axis representing the current orientation.\\n\\n Copied from vtkTransform::GetVTKOrientationWXYZ()*/\\n\\n static void GetOrientationWXYZ(const mafMatrix &in_matrix, double wxyz[4]);\\n\\n void GetOrientationWXYZ(double wxyz[4]) \\\\\\n\\n { GetOrientationWXYZ(GetMatrix(),wxyz);}\\n\\n void GetOrientationWXYZ(float wxyz[3]) {\\n\\n double temp[4]; GetOrientationWXYZ(temp); \\n\\n wxyz[0]=static_cast<float>(temp[0]); \\n\\n wxyz[1]=static_cast<float>(temp[1]); \\n\\n wxyz[2]=static_cast<float>(temp[2]); \\n\\n wxyz[3]=static_cast<float>(temp[3]);};\\n\\n\\n\\n /**\\n\\n Return the position from the current transformation matrix as an array\\n\\n of three floating point numbers. This is simply returning the translation \\n\\n component of the 4x4 matrix. Copied from vtkTransform::GetPosition()*/\\n\\n static void GetPosition(const mafMatrix &matrix,double position[3]);\\n\\n static void GetPosition(const mafMatrix &matrix,float position[3]);\\n\\n void GetPosition(double position[3]) {this->GetPosition(GetMatrix(),position);}\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 65,\n \"score\": 66695.6694238508\n },\n {\n \"content\": \" is defined (input, input_frame or target_frame) it's overwritten whenever the Update() is performed.*/\\n\\n static void SetOrientation(mafMatrix &matrix,double orientation[3]);\\n\\n void SetOrientation(double orientation[3]) {this->SetOrientation(*m_Matrix,orientation);}\\n\\n void SetOrientation(double rx,double ry,double rz) {this->SetOrientation(*m_Matrix,rx,ry,rz);}\\n\\n static void SetOrientation(mafMatrix &matrix,double rx,double ry,double rz) {\\n\\n double temp[3];\\n\\n temp[0]=rx;temp[1]=ry;temp[2]=rz;\\n\\n SetOrientation(matrix,temp);}\\n\\n\\n\\n /**\\n\\n Return the scale factors of the current transformation matrix as \\n\\n an array of three float numbers. These scale factors are not necessarily\\n\\n about the x, y, and z axes unless unless the scale transformation was\\n\\n applied before any rotations. Copied from vtkTransform::GetScale()*/\\n\\n static void GetScale(const mafMatrix &matrix,double scale[3]);\\n\\n void GetScale(double scale[3]) {this->GetScale(*m_Matrix,scale);}\\n\\n void GetScale(float scale[3]) {\\n\\n double temp[3]; this->GetScale(temp); \\n\\n scale[0] = static_cast<float>(temp[0]); \\n\\n scale[1] = static_cast<float>(temp[1]); \\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 66,\n \"score\": 66695.56246462\n },\n {\n \"content\": \" double PolarDecomp(mafMatrix &Q, mafMatrix &S, double translation[3]) {return PolarDecomp(GetMatrix(),Q,S,translation);}\\n\\n \\n\\n /** set internal matrix to Identity */\\n\\n void Identity();\\n\\n\\n\\n /** Invert internal matrix */\\n\\n void Invert();\\n\\n\\n\\n /**\\n\\n\\t Get the x, y, z orientation angles from the transformation matrix as an\\n\\n array of three floating point values. Copied from vtkTransform::GetOrientation()*/\\n\\n static void GetOrientation(const mafMatrix &in_matrix,double orientation[3]);\\n\\n static void GetOrientation(const mafMatrix &in_matrix,float orientation[3]);\\n\\n void GetOrientation(double orientation[3]) { this->GetOrientation(GetMatrix(),orientation);}\\n\\n void GetOrientation(float orient[3]) {\\n\\n double temp[3]; this->GetOrientation(temp); \\n\\n orient[0] = static_cast<float>(temp[0]); \\n\\n orient[1] = static_cast<float>(temp[1]); \\n\\n orient[2] = static_cast<float>(temp[2]); };\\n\\n\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 67,\n \"score\": 66695.30430883408\n },\n {\n \"content\": \"\\n\\n /**\\n\\n Copy the 3x3 rotation matrix from another 4x4 matrix into the specified matrix, or in the internal matrix.*/\\n\\n static void CopyRotation(const mafMatrix &source, mafMatrix &target);\\n\\n void CopyRotation(const mafMatrix &source) {this->CopyRotation(source,*m_Matrix);}\\n\\n\\n\\n /** Copy the translation vector */\\n\\n static void CopyTranslation(const mafMatrix &source, mafMatrix &target);\\n\\n void CopyTranslation(const mafMatrix &source) {this->CopyTranslation(source,*m_Matrix);}\\n\\n \\n\\n /** Add two vectors */\\n\\n static void AddVectors( double inV0[3],double inV1[3],double outSum[3] );\\n\\n\\n\\n /** Build vector with origin in p1 pointing to p2 */\\n\\n static void BuildVector(double *p1, double *p2, double *out_vector);\\n\\n\\n\\n /** Build vector [coeff * inVector] */\\n\\n static void BuildVector(double coeff, const double *inVector, double *outVector, int refSysType = LOCAL, int localAxis = mafInteractorConstraint::X);\\n\\n\\n\\n /** Project in_vector on in_axis direction; in_axis does not need to be \\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 68,\n \"score\": 66694.86665628088\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint i,int j,int k,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmafMatrix &matrix);\\n\\n\\n\\n /** rotation + translation representation conversion */\\n\\n\\tint MatrixToHelicalAxis(const mafMatrix &matrix,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t double helical_axis[3],double point[3],\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t double& phi,double& t, int intersect);\\n\\n\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n // declarations for polar_decomp algorithm from Graphics Gems IV,\\n\\n // by Ken Shoemake <shoemake@graphics.cis.upenn.edu>\\n\\n //----------------------------------------------------------------------------\\n\\n enum mmuQuatPart {X, Y, Z, W};\\n\\n\\n\\n typedef struct {double x, y, z, w;} mmuQuat; ///< mmuQuaternion \\n\\n typedef mmuQuat HVect; ///< Homogeneous 3D vector \\n\\n \\n\\n typedef struct {\\n\\n\\t HVect t;\\t///< Translation components\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 69,\n \"score\": 66694.59548634806\n },\n {\n \"content\": \" void GetPosition(float position[3]) {\\n\\n double temp[3]; this->GetPosition(temp); \\n\\n position[0] = static_cast<float>(temp[0]); \\n\\n position[1] = static_cast<float>(temp[1]); \\n\\n position[2] = static_cast<float>(temp[2]); };\\n\\n\\n\\n /**\\n\\n This function set the position column of the matrix. Notice, the non static functions\\n\\n work on the internal matrix and can be used in conjuction with SetMatrix, but if a pipeline\\n\\n is defined (input, input_frame or target_frame) it's overwritten whenever the Update() is perfromed.*/\\n\\n static void SetPosition(mafMatrix &matrix,double position[3]);\\n\\n void SetPosition(double position[3]) {this->SetPosition(*m_Matrix,position);}\\n\\n void SetPosition(double x,double y,double z) {this->SetPosition(*m_Matrix,x,y,z);}\\n\\n static void SetPosition(mafMatrix &matrix, double x,double y,double z) {\\n\\n double temp[3];\\n\\n temp[0]=x;temp[1]=y;temp[2]=z;\\n\\n SetPosition(matrix,temp);}\\n\\n\\n\\n /**\\n\\n This function set the translation column of the matrix by adding the transaltion provided\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 70,\n \"score\": 66693.09937418916\n },\n {\n \"content\": \" normalised. The projection signed value is returned */\\n\\n static double ProjectVectorOnAxis(const double *in_vector, const double *in_axis, double *out_projection = NULL);\\n\\n\\n\\n /** Project in_vector on the plane identified by the normal vector in_plane_normal;\\n\\n in_plane_normal does not need to be normalised. The norm of the projection \\n\\n is returned and the projection vector is written in out_projection vector if provided. */\\n\\n static double ProjectVectorOnPlane(const double *in_vector, const double *in_plane_normal, double *out_projection = NULL);\\n\\n\\n\\n /** Find perpendicular versors to input versor N */\\n\\n static void FindPerpendicularVersors(double inVersorN[3], double outVersorP[3], double outVersorQ[3]);\\n\\n\\n\\n /** Multiply vector by scalar */\\n\\n static void MultiplyVectorByScalar(double s, double *vin, double *vout);\\n\\n\\n\\n /** rotation representation conversion */\\n\\n\\tint MatrixToAttitudeVector(const mafMatrix &matrix,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t double attitude_vector[3]);\\n\\n\\n\\n /** rotation representation conversion */\\n\\n\\tint MatrixToEulerCardanicAngle(const mafMatrix &matrix,\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 71,\n \"score\": 66692.77902237998\n },\n {\n \"content\": \"\\t mmuQuat q;\\t///< Essential rotation\\n\\n\\t mmuQuat u;\\t///< Stretch rotation\\n\\n\\t HVect k;\\t///< Stretch factors\\n\\n\\t double f;\\t///< Sign of determinant\\n\\n } mmuAffineParts;\\n\\n \\n\\n typedef double HMatrix[4][4]; /* Right-handed, for column vectors */\\n\\n static double PolarDecomp(HMatrix M, HMatrix Q, HMatrix S);\\n\\n static void DecompAffine(HMatrix A, mmuAffineParts *parts);\\n\\n static HVect SpectDecomp(HMatrix S, HMatrix U);\\n\\n static mmuQuat QuaternionFromMatrix(HMatrix mat);\\n\\n static void InvertAffine(mmuAffineParts *parts, mmuAffineParts *inverse);\\n\\n static mmuQuat Snuggle(mmuQuat q, HVect *k);\\n\\n //----------------------------------------------------------------------------\\n\\nprotected:\\n\\n /**\\n\\n This only sets the timestamp for the output matrix: output matrix is not computed\\n\\n inside InternalUpdate since this is not a procedural transform. */\\n\\n virtual void InternalUpdate() {m_Matrix->SetTimeStamp(m_TimeStamp);}\\n\\nprivate:\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 72,\n \"score\": 66692.06989288183\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint i,int j,int k,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble euler_cardan[3],\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble tentative_euler_cardan_first,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble tentative_euler_cardan_second,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble tentative_euler_cardan_third);\\n\\n\\n\\n /** rotation representation conversion */\\n\\n\\tint MatrixTommuQuaternion(const mafMatrix &matrix, double quaternion[4]);\\n\\n\\n\\n /** rotation representation conversion */\\n\\n\\tint QuaternionToMatrix(double quaternion[4],\\tmafMatrix &matrix);\\n\\n\\n\\n /** rotation + translation representation conversion */\\n\\n\\tint HelicalAxisToMatrix(double helical_axis[3],double angle, mafMatrix &matrix);\\n\\n\\n\\n /** rotation representation conversion */\\n\\n\\tint AttitudeVectorToMatrix(double attitude_vector[3], mafMatrix &matrix);\\n\\n\\n\\n /** rotation representation conversion */\\n\\n\\tint EulerCardanicAngleToMatrix(double euler_cardan[3],\\n\",\n \"file_path\": \"Base/mafTransform.h\",\n \"rank\": 73,\n \"score\": 66690.0908448586\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\nclass MAF_EXPORT mafOpVolumeResample: public mafOp\\n\\n{\\n\\npublic:\\n\\n \\n\\n \\t mafOpVolumeResample(const wxString &label = \\\"VolumeResample\\\");\\n\\n\\tvirtual ~mafOpVolumeResample();\\n\\n\\tvirtual void OnEvent(mafEventBase *maf_event);\\n\\n\\t\\n\\n mafTypeMacro(mafOpVolumeResample, mafOp);\\n\\n\\n\\n mafOp* Copy();\\n\\n\\n\\n\\tbool Accept(mafNode* vme);\\n\\n\\tvoid OpRun();\\t\\n\\n\\tvoid OpDo();\\n\\n\\tvoid OpUndo(); \\n\\n\\n\\n\\t/**\\n\\n\\tSet spacing for test mode*/\\n\\n\\tvoid SetSpacing(double Spacing[3]);\\n\",\n \"file_path\": \"Operations/mafOpVolumeResample.h\",\n \"rank\": 74,\n \"score\": 66428.99296630337\n },\n {\n \"content\": \"class MAF_EXPORT mafOpTransformInterface : public mafOp\\n\\n{\\n\\npublic:\\n\\n mafOpTransformInterface(const wxString &label = \\\"TransformInterface\\\");\\n\\n virtual ~mafOpTransformInterface(); \\n\\n \\n\\n /** Return true for the acceptable vme type. */\\n\\n bool Accept(mafNode* vme) {return true;};\\n\\n\\n\\n mafTypeMacro(mafOpTransformInterface, mafOp);\\n\\n\\n\\n /** Override superclass */\\n\\n mafOp* Copy();\\n\\n\\n\\n /** Override superclass */\\n\\n void OpDo();\\n\\n \\n\\n /** Set/Get the vme used as refsys, the vme is referenced*/\\n\\n void SetRefSysVME(mafVME *refSysVme);\\n\\n mafVME *GetRefSysVME() {return m_RefSysVME;};\\n\",\n \"file_path\": \"Operations/mafOpTransformInterface.h\",\n \"rank\": 75,\n \"score\": 66268.57962375708\n },\n {\n \"content\": \"class MAF_EXPORT mafGUITransformInterface : public mafObserver\\n\\n{\\n\\npublic:\\n\\n\\n\\n /** Return the gui to be plugged*/\\n\\n mafGUI *GetGui() {return m_Gui;};\\n\\n\\n\\n /** Enable-Disable the GUI's widgets */\\n\\n virtual void EnableWidgets(bool enable) = 0;\\n\\n\\n\\n /** Set the vme to be used as reference system, the vme is referenced; default ref sys is vme abs matrix */\\n\\n void SetRefSys(mafVME *refSysVme); \\n\\n mafVME* GetRefSys() {return m_RefSysVME;};\\n\\n\\n\\n /** Reset the gui component to initial state */\\n\\n virtual void Reset() {};\\n\\n\\n\\n /** Events handling */ \\n\\n void OnEvent(mafEventBase *maf_event) {};\\n\\n \\n\",\n \"file_path\": \"Interaction/mafGUITransformInterface.h\",\n \"rank\": 76,\n \"score\": 66268.57962375708\n },\n {\n \"content\": \"class mafXMLStringTest : public CPPUNIT_NS::TestFixture\\n\\n{\\n\\npublic:\\n\\n\\n\\n // CPPUNIT fixture: executed before each test\\n\\n void setUp();\\n\\n\\n\\n // CPPUNIT fixture: executed after each test\\n\\n void tearDown();\\n\\n\\n\\n\\tCPPUNIT_TEST_SUITE( mafXMLStringTest );\\n\\n\\tCPPUNIT_TEST( TestStaticAllocation );\\n\\n\\tCPPUNIT_TEST( TestDynamicAllocation );\\n\\n CPPUNIT_TEST( TestAllConstructors );\\n\\n CPPUNIT_TEST( TestAppend );\\n\\n CPPUNIT_TEST( TestErase );\\n\\n CPPUNIT_TEST( TestBegin );\\n\\n CPPUNIT_TEST( TestEnd );\\n\\n CPPUNIT_TEST( TestSize );\\n\\n CPPUNIT_TEST( TestGetCStr );\\n\",\n \"file_path\": \"Testing/IO/mafXMLStringTest.h\",\n \"rank\": 77,\n \"score\": 65420.943614517964\n },\n {\n \"content\": \"class mafTransformBaseTest : public CPPUNIT_NS::TestFixture\\n\\n{\\n\\npublic: \\n\\n // CPPUNIT fixture: executed before each test\\n\\n void setUp();\\n\\n\\n\\n // CPPUNIT fixture: executed after each test\\n\\n void tearDown();\\n\\n\\n\\n // CPPUNIT test suite\\n\\n CPPUNIT_TEST_SUITE( mafTransformBaseTest );\\n\\n CPPUNIT_TEST(TestFixture); // just to test that the fixture has no leaks\\n\\n CPPUNIT_TEST(TestStaticAllocation);\\n\\n CPPUNIT_TEST(TestDynamicAllocation);\\n\\n CPPUNIT_TEST(TestCopyConstructor);\\n\\n CPPUNIT_TEST(TestGetMatrix);\\n\\n\\tCPPUNIT_TEST(TestTimeStamp);\\n\\n\\tCPPUNIT_TEST(TestModifiedTime);\\n\\n\\tCPPUNIT_TEST(TestUpdateTime);\\n\\n\\tCPPUNIT_TEST(TestGetEventSource);\\n\",\n \"file_path\": \"Testing/Base/mafTransformBaseTest.h\",\n \"rank\": 78,\n \"score\": 65272.82989268693\n },\n {\n \"content\": \"class mafTransformFrameTest : public CPPUNIT_NS::TestFixture\\n\\n{\\n\\n public: \\n\\n\\n\\n // CPPUNIT fixture: executed before each test\\n\\n void setUp();\\n\\n\\n\\n // CPPUNIT fixture: executed after each test\\n\\n void tearDown();\\n\\n\\n\\n // CPPUNIT test suite\\n\\n CPPUNIT_TEST_SUITE( mafTransformFrameTest );\\n\\n CPPUNIT_TEST( TestFixture ); // just to test that the fixture has no leaks\\n\\n CPPUNIT_TEST( TestMafTransformFrameConstructorDestructor );\\n\\n CPPUNIT_TEST( TestSetInputMafTransformBase );\\n\\n CPPUNIT_TEST( TestSetInputMafMatrix );\\n\\n CPPUNIT_TEST( TestGetInput );\\n\\n CPPUNIT_TEST( TestSetInputFrameMafMatrix );\\n\\n CPPUNIT_TEST( TestSetInputFrameMafTransformBase );\\n\\n CPPUNIT_TEST( TestGetInputFrame );\\n\",\n \"file_path\": \"Testing/Base/mafTransformFrameTest.h\",\n \"rank\": 79,\n \"score\": 65272.82989268693\n },\n {\n \"content\": \"{\\n\\n Copy(src.c_str());\\n\\n return *this;\\n\\n}\\n\\n#endif\\n\\n/*\\n\\n//----------------------------------------------------------------------------\\n\\nstd::ostream& operator<<(std::ostream& os, const mafString& s)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n const char *str=s.GetCStr();\\n\\n os << str;\\n\\n return os;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafString::operator>>(std::istream &is)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n std::string tmp;\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 80,\n \"score\": 64886.16973650577\n },\n {\n \"content\": \"\\n\\n\\n\\n#include <xercesc/util/XMLString.hpp>\\n\\n\\n\\n#ifdef XERCES_CPP_NAMESPACE_USE\\n\\n// XERCES_CPP_NAMESPACE_USE\\n\\n// SIL 12-apr-2006\\n\\n// removed XERCES_CPP_NAMESPACE_USE and added XERCES_CPP_NAMESPACE_QUALIFIER where required\\n\\n#endif\\n\\n\\n\\n/** string type for converting const char * to and from XMLString types\\n\\n This is an internal string type to be used only in conjunction with XercecC XML library.\\n\\n This object is able to convert const char* to and from XMLStrings. This code has been\\n\\n adapted from example code \\\"class XercesString\\\" found in articles \\\"Make the most of Xerces-C++\\\"\\n\\n by Rick Parrish (rfmobile@swbell.net) that can be found at \\\"www.ibm.com/developerworks/xml\\\".\\n\\n*/\\n\",\n \"file_path\": \"IO/mafXMLString.h\",\n \"rank\": 81,\n \"score\": 64877.08128100836\n },\n {\n \"content\": \" // If the available memory is not sufficient, relocate!\\n\\n unsigned long len=Length(src);\\n\\n if (len>=m_Size)\\n\\n {\\n\\n SetMaxLength(len);\\n\\n }\\n\\n\\n\\n Copy(m_CStr,src);\\n\\n }\\n\\n else\\n\\n {\\n\\n SetMaxLength(0);\\n\\n m_ConstCStr=\\\"\\\";\\n\\n }\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafString::NCopy(const char* src,int n)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 82,\n \"score\": 64871.37975445897\n },\n {\n \"content\": \"\\n\\n return strcmp(str1, str2);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nint mafString::Compare(const char* str) const\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n return Compare(m_Size>0?m_CStr:m_ConstCStr, str);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nbool mafString::Equals(const char* str) const\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n return Equals(m_Size>0?m_CStr:m_ConstCStr, str);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// Check if the first string starts with the second one.\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 83,\n \"score\": 64870.188776609924\n },\n {\n \"content\": \" return *this;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nconst char * mafString::GetCStr() const\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (m_Size>0)\\n\\n {\\n\\n return m_CStr;\\n\\n }\\n\\n else\\n\\n { \\n\\n return m_ConstCStr;\\n\\n }\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nint mafString::SetMaxLength(mafID len)\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 84,\n \"score\": 64868.934865012314\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\n{\\n\\n if (a!=GetCStr())\\n\\n {\\n\\n SetSize(0); // force memory release\\n\\n m_ConstCStr = a;\\n\\n //m_Size = release?Length(a)+1:0;\\n\\n }\\n\\n return *this;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafString::SetCStr(char *a, bool release)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (a!=GetCStr())\\n\\n {\\n\\n SetSize(0); // force memory release\\n\\n m_CStr = a;\\n\\n m_Size = release?Length(a)+1:0; // notice: I could have a (char *) that must not be released\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 85,\n \"score\": 64866.16599141951\n },\n {\n \"content\": \" \\n\\n return m_CStr[i];\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nconst char mafString::operator [] (const int i) const\\n\\n//------------------------------------------------------------------------------\\n\\n{\\n\\n return GetCStr()[i];\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nint mafString::FindChr(const int c) const\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (IsEmpty())\\n\\n {\\n\\n return -1;\\n\\n }\\n\\n char *pdest;\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 86,\n \"score\": 64865.83790917253\n },\n {\n \"content\": \"#include <stdarg.h>\\n\\n#include <assert.h>\\n\\n\\n\\n#include \\\"wx/wx.h\\\"\\n\\n#include <wx/string.h>\\n\\n#include <string>\\n\\n\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nmafString::~mafString()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (m_CStr)\\n\\n {\\n\\n if (m_Size>0)\\n\\n delete[] m_CStr;\\n\\n\\n\\n m_CStr=NULL;\\n\\n m_ConstCStr=NULL;\\n\\n }\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 87,\n \"score\": 64865.26929720919\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\nconst bool mafString::operator<=(const char *a) const\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n return Compare(a)<=0;\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nconst bool mafString::operator>=(const char *a) const\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n return Compare(a)>=0;\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nchar & mafString::operator [] (const int i)\\n\\n//------------------------------------------------------------------------------\\n\\n{\\n\\n // check if the string is referencing a \\\"const char *\\\"\\n\\n if (!m_CStr)\\n\\n ForceDuplicate(); // force memory copying\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 88,\n \"score\": 64865.043425087715\n },\n {\n \"content\": \" if (src)\\n\\n {\\n\\n SetMaxLength(n);\\n\\n strncpy(m_CStr,src,n);\\n\\n m_CStr[n]='\\\\0';\\n\\n }\\n\\n else\\n\\n {\\n\\n // release memory\\n\\n SetSize(0);\\n\\n }\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// Description:\\n\\n// This method makes a duplicate of the string similar to\\n\\n// C function strdup but it uses new to create new string, so\\n\\n// you can use delete to remove it. It returns empty string \\n\\n// \\\"\\\" if the input is empty.\\n\\nchar* mafString::Duplicate(const char* str)\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 89,\n \"score\": 64864.6358222818\n },\n {\n \"content\": \" }\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\n// This method returns the size of string. If the string is empty,\\n\\n// it returns 0. It can handle null pointers.\\n\\nmafID mafString::Length(const char* str)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if ( !str )\\n\\n {\\n\\n return 0;\\n\\n }\\n\\n return static_cast<mafID>(strlen(str));\\n\\n}\\n\\n\\n\\n \\n\\n//----------------------------------------------------------------------------\\n\\n// Description:\\n\\n// Copy string to the other string.\\n\\nvoid mafString::Copy(char* dest, const char* src)\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 90,\n \"score\": 64864.46799789997\n },\n {\n \"content\": \"}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nmafString::mafString():m_CStr(NULL),m_ConstCStr(\\\"\\\"),m_Size(0)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nmafString::mafString(const mafString& src):m_CStr(NULL),m_ConstCStr(\\\"\\\"),m_Size(0)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n Copy(src.GetCStr());\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nmafString::mafString(const char *src):m_CStr(NULL),m_ConstCStr(\\\"\\\"),m_Size(0)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n Copy(src);\\n\\n}\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 91,\n \"score\": 64864.21892087765\n },\n {\n \"content\": \"}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nchar *mafString::ParsePathName(mafString *str)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n str->ForceDuplicate();\\n\\n return ParsePathName(str->m_CStr);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nchar *mafString::ParsePathName()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n return mafString::ParsePathName(this);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafString::SetPathName(const char *str)\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 92,\n \"score\": 64864.16060207346\n },\n {\n \"content\": \"bool mafString::StartsWith(const char* str1, const char* str2)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if ( !str1 || !str2 || strlen(str1) < strlen(str2) )\\n\\n {\\n\\n return false;\\n\\n }\\n\\n return !strncmp(str1, str2, strlen(str2)); \\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nbool mafString::StartsWith(const char* str) const\\n\\n//----------------------------------------------------------------------------\\n\\n{ \\n\\n return StartsWith(m_Size>0?m_CStr:m_ConstCStr, str);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// Check if the first string starts with the second one.\\n\\nbool mafString::EndsWith(const char* str1, const char* str2)\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 93,\n \"score\": 64864.10001538037\n },\n {\n \"content\": \"mafString &mafString::operator<<( std::string s )\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n Append(s);\\n\\n return *this;\\n\\n}\\n\\n*/\\n\\n//----------------------------------------------------------------------------\\n\\nmafString &mafString::operator<<( mafString *s )\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n Append( s->m_CStr );\\n\\n return *this;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nmafString& mafString::operator+=(const char *s)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n Append(s);\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 94,\n \"score\": 64863.69930792541\n },\n {\n \"content\": \"\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nchar *mafString::ParsePathName(char *str)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (mafString::IsEmpty(str))\\n\\n return str;\\n\\n\\n\\n // for Windows platforms parse the string to substitute \\\"/\\\" and \\\"\\\\\\\\\\\" with the right one.\\n\\n#ifdef _WIN32\\n\\n for (unsigned int i=0;i<Length(str);i++)\\n\\n {\\n\\n if (str[i]=='\\\\\\\\')\\n\\n str[i]='/';\\n\\n }\\n\\n#endif\\n\\n\\n\\n return str;\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 95,\n \"score\": 64863.6675666407\n },\n {\n \"content\": \"\\n\\n // allocate new memory and copy the second string's content\\n\\n if (src)\\n\\n { \\n\\n store = new char[strlen(src)+1];\\n\\n strcpy(store,src);\\n\\n }\\n\\n else \\n\\n { \\n\\n // in case of NULL string reset the output string pointer...\\n\\n store = NULL;\\n\\n }\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nchar* mafString::Duplicate() const\\n\\n//---------------------------------------------------------------------------- \\n\\n{\\n\\n return Duplicate(m_Size>0?m_CStr:m_ConstCStr);\\n\\n}\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 96,\n \"score\": 64863.61395014039\n },\n {\n \"content\": \"\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// This method compare two strings. It is similar to strcmp,\\n\\n// but it can handle null pointers.\\n\\nint mafString::Compare(const char* str1, const char* str2)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (!str1&&!str2)\\n\\n return 0;\\n\\n\\n\\n if ( !str1&&str2 )\\n\\n {\\n\\n return -1;\\n\\n }\\n\\n\\n\\n if ( !str2&&str1 )\\n\\n {\\n\\n return 1;\\n\\n }\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 97,\n \"score\": 64863.551016460224\n },\n {\n \"content\": \"{\\n\\n if (mafString::IsEmpty(str))\\n\\n return;\\n\\n\\n\\n Copy(str);\\n\\n\\n\\n ParsePathName(m_CStr);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid mafString::SetPathName(mafString *str)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n SetPathName(str->GetCStr());\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nconst char *mafString::BaseName(const char *filename)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 98,\n \"score\": 64863.49675713878\n },\n {\n \"content\": \" unsigned long len=Length();\\n\\n SetMaxLength(m_Size>=len?m_Size:len); \\n\\n }\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nchar *mafString::GetNonConstCStr()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n ForceDuplicate();\\n\\n return m_CStr;\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nconst mafID mafString::Length() const\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n return Length(GetCStr());\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nmafString &mafString::Set(const char *a, bool release)\\n\",\n \"file_path\": \"Base/mafString.cpp\",\n \"rank\": 99,\n \"score\": 64863.29595387646\n }\n]","isConversational":false}}},{"rowIdx":466,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Libraries/VtkVgQtSceneUtil/vtkVgCoordinateTransform.cxx"},"repo_name":{"kind":"string","value":"PinkDiamond1/vivia"},"commit":{"kind":"string","value":"70f7fbed4b33b14d34de35c69b2b14df3514d720"},"file_code":{"kind":"string","value":"\n\n#include \"vtkVgCoordinateTransform.h\"\n\n#include <vtkVgAdapt.h>\n\n#include <vtkMatrix4x4.h>\n#include <vtkObjectFactory.h>\n\n#include <vgl/vgl_homg_point_2d.h>\n#include <vgl/algo/vgl_h_matrix_2d.h>\n#include <vgl/algo/vgl_h_matrix_2d_compute_linear.h>\n\nvtkStandardNewMacro(vtkVgCoordinateTransform);\n\nvtkVgCoordinateTransform::vtkVgCoordinateTransform()\n{\n \n}\n\nvtkVgCoordinateTransform::~vtkVgCoordinateTransform()\n{\n \n}\n\nvoid vtkVgCoordinateTransform::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os, indent);\n}\n\nvoid vtkVgCoordinateTransform::SetFromPoints(double pt1[], double pt2[],\n double pt3[], double pt4[])\n{\n this->FromPoint[0][0] = pt1[0];\n this->FromPoint[0][1] = pt1[1];\n this->FromPoint[1][0] = pt2[0];\n this->FromPoint[1][1] = pt2[1];\n this->FromPoint[2][0] = pt3[0];\n this->FromPoint[2][1] = pt3[1];\n this->FromPoint[3][0] = pt4[0];\n this->FromPoint[3][1] = pt4[1];\n}\n\nvoid vtkVgCoordinateTransform::SetFromPoints(double x1, double y1,\n double x2, double y2,\n double x3, double y3,\n double x4, double y4)\n{\n this->FromPoint[0][0] = x1;\n this->FromPoint[0][1] = y1;\n this->FromPoint[1][0] = x2;\n this->FromPoint[1][1] = y2;\n this->FromPoint[2][0] = x3;\n this->FromPoint[2][1] = y3;\n this->FromPoint[3][0] = x4;\n this->FromPoint[3][1] = y4;\n}\n\nvoid vtkVgCoordinateTransform::SetToPoints(double pt1[], double pt2[],\n double pt3[], double pt4[])\n{\n this->ToPoint[0][0] = pt1[0];\n this->ToPoint[0][1] = pt1[1];\n this->ToPoint[1][0] = pt2[0];\n this->ToPoint[1][1] = pt2[1];\n this->ToPoint[2][0] = pt3[0];\n this->ToPoint[2][1] = pt3[1];\n this->ToPoint[3][0] = pt4[0];\n this->ToPoint[3][1] = pt4[1];\n}\n\nvoid vtkVgCoordinateTransform::SetToPoints(double x1, double y1,\n double x2, double y2,\n double x3, double y3,\n double x4, double y4)\n{\n this->ToPoint[0][0] = x1;\n this->ToPoint[0][1] = y1;\n this->ToPoint[1][0] = x2;\n this->ToPoint[1][1] = y2;\n this->ToPoint[2][0] = x3;\n this->ToPoint[2][1] = y3;\n this->ToPoint[3][0] = x4;\n this->ToPoint[3][1] = y4;\n}\n\nvtkSmartPointer<vtkMatrix4x4> vtkVgCoordinateTransform::GetHomographyMatrix()\n{\n std::vector<vgl_homg_point_2d<double> > fromPoints;\n std::vector<vgl_homg_point_2d<double> > toPoints;\n\n \n for (int i = 0; i < 4; ++i)\n {\n vgl_homg_point_2d<double> vglPt2d(this->FromPoint[i][0], this->FromPoint[i][1], 1);\n fromPoints.push_back(vglPt2d);\n }\n\n \n for (int i = 0; i < 4; ++i)\n {\n vgl_homg_point_2d<double> vglPt2d(this->ToPoint[i][0], this->ToPoint[i][1], 1);\n toPoints.push_back(vglPt2d);\n }\n\n vgl_h_matrix_2d_compute_linear algo;\n vgl_h_matrix_2d<double> homography;\n bool success = algo.compute(fromPoints, toPoints, homography);\n\n if (success)\n {\n return vtkVgAdapt(homography.get_matrix());\n }\n else\n {\n return 0;\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"vtkVgCoordinateTransform.h\"\n\n#include <vtkVgAdapt.h>\n\n#include <vtkMatrix4x4.h>\n#include <vtkObjectFactory.h>\n\n#include <vgl/vgl_homg_point_2d.h>\n#include <vgl/algo/vgl_h_matrix_2d.h>\n#include <vgl/algo/vgl_h_matrix_2d_compute_linear.h>\n\nvtkStandardNewMacro(vtkVgCoordinateTransform);\n\nvtkVgCoordinateTransform::vtkVgCoordinateTransform()\n{\n \n}\n\nvtkVgCoordinateTransform::~vtkVgCoordinateTransform()\n{\n \n}\n\nvoid vtkVgCoordinateTransform::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os, indent);\n}\n\nvoid vtkVgCoordinateTransform::SetFromPoints(double pt1[], double pt2[],\n double pt3[], double pt4[])\n{\n this->FromPoint[0][0] = pt1[0];\n this->FromPoint[0][1] = pt1[1];\n this->FromPoint[1][0] = pt2[0];\n this->FromPoint[1][1] = pt2[1];\n this->FromPoint[2][0] = pt3[0];\n this->FromPoint[2][1] = pt3[1];\n this->FromPoint[3][0] = pt4[0];\n this->FromPoint[3][1] = pt4[1];\n}\n\nvoid vtkVgCoordinateTransform::SetFromPoints(double x1, double y1,\n double x2, double y2,\n double x3, double y3,\n double x4, double y4)\n{\n this->FromPoint[0][0] = x1;\n this->FromPoint[0][1] = y1;\n this->FromPoint[1][0] = x2;\n this->FromPoint[1][1] = y2;\n this->FromPoint[2][0] = x3;\n this->FromPoint[2][1] = y3;\n this->FromPoint[3][0] = x4;\n this->FromPoint[3][1] = y4;\n}\n\nvoid vtkVgCoordinateTransform::SetToPoints(double pt1[], double pt2[],\n double pt3[], double pt4[])\n{\n this->ToPoint[0][0] = pt1[0];\n this->ToPoint[0][1] = pt1[1];\n this->ToPoint[1][0] = pt2[0];\n this->ToPoint[1][1] = pt2[1];\n this->ToPoint[2][0] = pt3[0];\n this->ToPoint[2][1] = pt3[1];\n this->ToPoint[3][0] = pt4[0];\n this->ToPoint[3][1] = pt4[1];\n}\n\nvoid vtkVgCoordinateTransform::SetToPoints(double x1, double y1,\n double x2, double y2,\n double x3, double y3,\n double x4, double y4)\n{\n "},"suffix":{"kind":"string","value":"\n\nvtkSmartPointer<vtkMatrix4x4> vtkVgCoordinateTransform::GetHomographyMatrix()\n{\n std::vector<vgl_homg_point_2d<double> > fromPoints;\n std::vector<vgl_homg_point_2d<double> > toPoints;\n\n \n for (int i = 0; i < 4; ++i)\n {\n vgl_homg_point_2d<double> vglPt2d(this->FromPoint[i][0], this->FromPoint[i][1], 1);\n fromPoints.push_back(vglPt2d);\n }\n\n \n for (int i = 0; i < 4; ++i)\n {\n vgl_homg_point_2d<double> vglPt2d(this->ToPoint[i][0], this->ToPoint[i][1], 1);\n toPoints.push_back(vglPt2d);\n }\n\n vgl_h_matrix_2d_compute_linear algo;\n vgl_h_matrix_2d<double> homography;\n bool success = algo.compute(fromPoints, toPoints, homography);\n\n if (success)\n {\n return vtkVgAdapt(homography.get_matrix());\n }\n else\n {\n return 0;\n }\n}\n"},"middle":{"kind":"string","value":"this->ToPoint[0][0] = x1;\n this->ToPoint[0][1] = y1;\n this->ToPoint[1][0] = x2;\n this->ToPoint[1][1] = y2;\n this->ToPoint[2][0] = x3;\n this->ToPoint[2][1] = y3;\n this->ToPoint[3][0] = x4;\n this->ToPoint[3][1] = y4;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"class QT_TESTINGSUPPORT_EXPORT pqQteDoubleSliderEventPlayer :\n\n public pqWidgetEventPlayer\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n pqQteDoubleSliderEventPlayer(QObject* p = 0);\n\n\n\n bool playEvent(QObject* Object, const QString& Command, const QString& Arguments, bool& Error);\n\n\n\nprivate:\n\n Q_DISABLE_COPY(pqQteDoubleSliderEventPlayer)\n\n};\n\n\n\n#endif // !_pqQteDoubleSliderEventPlayer_h","file_path":"Libraries/QtTestingSupport/pqQteDoubleSliderEventPlayer.h","rank":0,"score":52769.839565178176},{"content":"class QT_TESTINGSUPPORT_EXPORT pqQteDoubleSliderEventTranslator :\n\n public pqWidgetEventTranslator\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n pqQteDoubleSliderEventTranslator(QObject* p = 0);\n\n\n\n virtual bool translateEvent(QObject* Object, QEvent* Event, bool& Error);\n\n\n\nprivate:\n\n Q_DISABLE_COPY(pqQteDoubleSliderEventTranslator)\n\n\n\n QObject* CurrentObject;\n\n\n\nprivate slots:\n\n void onValueChanged(double);\n\n};\n\n\n\n#endif // !_pqQteDoubleSliderEventTranslator_h\n","file_path":"Libraries/QtTestingSupport/pqQteDoubleSliderEventTranslator.h","rank":1,"score":52769.839565178176},{"content":"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\n\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef _pqQteDoubleSliderEventPlayer_h\n\n#define _pqQteDoubleSliderEventPlayer_h\n\n\n\n#include <pqWidgetEventPlayer.h>\n\n\n\n#include <vgExport.h>\n\n\n\n/**\n\nConcrete implementation of pqWidgetEventPlayer that handles playback of recorded qtDoubleSlider user input.\n\n\n\n\\sa pqEventPlayer\n\n*/\n","file_path":"Libraries/QtTestingSupport/pqQteDoubleSliderEventPlayer.h","rank":2,"score":47031.678339405225},{"content":"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\n\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef _pqQteDoubleSliderEventTranslator_h\n\n#define _pqQteDoubleSliderEventTranslator_h\n\n\n\n#include \"pqWidgetEventTranslator.h\"\n\n\n\n#include <vgExport.h>\n\n\n\n/**\n\nTranslates low-level Qt events into high-level ParaView events that can be recorded as test cases.\n\n\n\n\\sa pqEventTranslator\n\n*/\n\n\n","file_path":"Libraries/QtTestingSupport/pqQteDoubleSliderEventTranslator.h","rank":3,"score":47030.98081845511},{"content":"/*=========================================================================\n\n\n\n Program: ParaView\n\n Module: pqQteDoubleSliderEventTranslator.h\n\n\n\n Copyright (c) 2005-2008 Sandia Corporation, Kitware Inc.\n\n All rights reserved.\n\n\n\n ParaView is a free software; you can redistribute it and/or modify it\n\n under the terms of the ParaView license version 1.2.\n\n\n\n See License_v1.2.txt for the full ParaView license.\n\n A copy of this license can be obtained by contacting\n\n Kitware Inc.\n\n 28 Corporate Drive\n\n Clifton Park, NY 12065\n\n USA\n\n\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n","file_path":"Libraries/QtTestingSupport/pqQteDoubleSliderEventTranslator.h","rank":4,"score":47028.58388006288},{"content":"/*=========================================================================\n\n\n\n Program: ParaView\n\n Module: pqQteDoubleSliderEventPlayer.h\n\n\n\n Copyright (c) 2005-2008 Sandia Corporation, Kitware Inc.\n\n All rights reserved.\n\n\n\n ParaView is a free software; you can redistribute it and/or modify it\n\n under the terms of the ParaView license version 1.2.\n\n\n\n See License_v1.2.txt for the full ParaView license.\n\n A copy of this license can be obtained by contacting\n\n Kitware Inc.\n\n 28 Corporate Drive\n\n Clifton Park, NY 12065\n\n USA\n\n\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\n``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n","file_path":"Libraries/QtTestingSupport/pqQteDoubleSliderEventPlayer.h","rank":5,"score":47028.58388006288},{"content":"class QDoubleSpinBox;\n","file_path":"Applications/VpView/vpGraphModelWidget.h","rank":6,"score":45921.49001921082},{"content":"// Forward declarations.\n\nclass vtkInformationDoubleKey;\n","file_path":"Libraries/VtkVgModelView/vtkVgRepresentationBase.h","rank":7,"score":43869.385660511696},{"content":" void SetToPoints(double x1, double y1,\n\n double x2, double y2,\n\n double x3, double y3,\n\n double x4, double y4);\n\n\n\n vtkSmartPointer<vtkMatrix4x4> GetHomographyMatrix();\n\n\n\nprotected:\n\n vtkVgCoordinateTransform();\n\n virtual ~vtkVgCoordinateTransform();\n\n\n\n double FromPoint[4][2];\n\n double ToPoint[4][2];\n\n\n\nprivate:\n\n vtkVgCoordinateTransform(const vtkVgCoordinateTransform&); // Not implemented.\n\n void operator=(const vtkVgCoordinateTransform&); // Not implemented.\n\n};\n\n\n\n#endif // __vtkVgCoordinateTransform_h\n","file_path":"Libraries/VtkVgQtSceneUtil/vtkVgCoordinateTransform.h","rank":8,"score":34.448571112913086},{"content":" void SetForegroundColor(double color[3]);\n\n\n\n // Description:\n\n // Compute event time using node's position and timeline view\n\n vtkVgTimeStamp ComputeNodeStartTime(double x, double y, double z);\n\n\n\n // Description:\n\n // Return current layout extents\n\n void GetCurrentLayoutExtents(vgRange<double>& xext, vgRange<double>& yext);\n\n\n\nprotected:\n\n /// Add graph to the representation\n\n void AddGraph(vtkGraph* graph, const std::string& domain);\n\n\n\n vtkIdType PickNodes(double x1, double y1, double x2, double y2,\n\n vtkRenderer* ren);\n\n vtkIdType PickEdges(double x1, double y1, double x2, double y2,\n\n vtkRenderer* ren);\n\n\n\n /// Layout implementations\n","file_path":"Applications/VpView/vpMultiGraphRepresentation.h","rank":9,"score":22.593757139580898},{"content":" void Initialize();\n\n\n\n /// Set the item on the representation.\n\n void SetGraphModel(vpMultiGraphModel* graphModel);\n\n vpMultiGraphModel* GetGraphModel() const;\n\n\n\n /// Update all the event actors. Generally called by the application layer.\n\n virtual void Update();\n\n\n\n /// Pick operation from display (i.e., pixel) coordinates in the current\n\n /// renderer. Return the picked eventId if a successful pick occurs,\n\n /// otherwise return -1. Note that the pick operation takes into account\n\n /// whether the event is currently visible or not.\n\n virtual vtkIdType Pick(double renX, double renY,\n\n vtkRenderer* ren, vtkIdType& pickType);\n\n\n\n // Pick within bounding rectangle\n\n vtkIdType Pick(double x1, double y1, double x2, double y2,\n\n vtkRenderer* ren, vtkIdType& pickType);\n\n\n","file_path":"Applications/VpView/vpMultiGraphRepresentation.h","rank":10,"score":16.80161777830034},{"content":"\n\n//-----------------------------------------------------------------------------\n\ntemplate <typename T>\n\nvoid vtkVgTypeRegistry<T>::PrintSelf(ostream& os, vtkIndent indent)\n\n{\n\n this->Superclass::PrintSelf(os, indent);\n\n\n\n os << indent << \"Types:\\n\";\n\n for (int i = 0, end = this->GetNumberOfTypes(); i < end; ++i)\n\n {\n\n os << indent << this->Types[i].GetName()\n\n << \" (\" << this->Types[i].GetId() << \")\\n\";\n\n }\n\n}\n\n\n\n//-----------------------------------------------------------------------------\n\ntemplate <typename T>\n\nint vtkVgTypeRegistry<T>::GetNumberOfTypes() const\n\n{\n\n return static_cast<int>(this->Types.size());\n","file_path":"Libraries/VtkVgCore/vtkVgTypeRegistry.h","rank":11,"score":16.001990666367565},{"content":" DescriptorStyleGroup,\n\n UserType = 32\n\n };\n\n\n\n enum Column\n\n {\n\n Name = 0x1,\n\n Source = 0x2,\n\n TimeRange = 0x4,\n\n All = 0xf\n\n };\n\n Q_DECLARE_FLAGS(Columns, Column)\n\n\n\n explicit vvDescriptorInfoTree(QWidget* parent = 0);\n\n virtual ~vvDescriptorInfoTree();\n\n\n\n void setItemFactory(vvDescriptorInfoTreeItemFactory*);\n\n\n\n QHash<qint64, vvDescriptor> descriptors() const;\n\n QList<vvDescriptor> descriptors(QList<qint64>) const;\n","file_path":"Libraries/VvWidgets/vvDescriptorInfoTree.h","rank":12,"score":14.999139121120143},{"content":" // Standard VTK functions.\n\n static vtkVgInteractorStyleRubberBand2D* New();\n\n vtkTypeMacro(vtkVgInteractorStyleRubberBand2D, vtkInteractorStyleRubberBand2D);\n\n\n\n virtual void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n // Description:\n\n // Constructor / Destructor.\n\n vtkVgInteractorStyleRubberBand2D();\n\n ~vtkVgInteractorStyleRubberBand2D();\n\n\n\n // Description:\n\n virtual void OnKeyPress();\n\n\n\n virtual void OnChar();\n\n\n\n // Description:\n\n // Overriding these functions to implement custom\n\n // interactions.\n\n virtual void OnLeftButtonDown();\n","file_path":"Libraries/VtkVgCore/vtkVgInteractorStyleRubberBand2D.h","rank":13,"score":13.635539950820226},{"content":" void setTrackUpdateChunkSize(int frames)\n\n {\n\n this->TrackUpdateChunkSize = frames;\n\n }\n\n\n\n double getGeoDistance(double imagePt1[4], double imagePt2[4],\n\n double& latDist, double& lonDist);\n\n\n\n void setRealTimeVideoPlayback(bool enable);\n\n\n\n void setRulerEnabled(bool enable);\n\n\n\n void setColorWindow(double colorWindow);\n\n void setColorLevel(double colorLevel);\n\n\n\n void zoomIn();\n\n void zoomOut();\n\n\n\nprotected slots:\n\n void forceUpdate();\n","file_path":"Applications/VpView/vpViewCore.h","rank":14,"score":13.380631819952873},{"content":" virtual void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n // Description:\n\n // Set/Get layout mode.\n\n void SetLayoutMode(int);\n\n vtkGetMacro(LayoutMode, int);\n\n\n\n // Description:\n\n // Set/Get blast flag that will move the children away from each other.\n\n vtkSetMacro(Blast, int);\n\n vtkGetMacro(Blast, int);\n\n vtkBooleanMacro(Blast, int);\n\n\n\n // Description:\n\n vtkSetMacro(Stack, int);\n\n vtkGetMacro(Stack, int);\n\n vtkBooleanMacro(Stack, int);\n\n\n\n // Description:\n\n vtkSetMacro(ZSort, int);\n","file_path":"Applications/Viqui/vtkVQBlastLayoutNode.h","rank":15,"score":12.649922627296885},{"content":"\n\n static vtkVgNodeBase* New();\n\n\n\n virtual void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n // Description:\n\n // Set/Get name for the node.\n\n vtkSetStringMacro(Name);\n\n const char* GetName() const;\n\n\n\n // Description:\n\n // Set/Get visibility flag.\n\n virtual int SetVisible(int flag);\n\n vtkGetMacro(Visible, int);\n\n vtkBooleanMacro(Visible, int);\n\n\n\n // Description:\n\n // Flag that indicates is state of this node is dirty.\n\n vtkSetMacro(Dirty, int);\n\n vtkGetMacro(Dirty, int);\n","file_path":"Libraries/VtkVgSceneGraph/vtkVgNodeBase.h","rank":16,"score":11.865292925966534},{"content":" // Standard VTK functions.\n\n static vtkVgEventBase* New();\n\n vtkTypeMacro(vtkVgEventBase, vtkObject);\n\n virtual void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n // Description:\n\n // Set/Get the points used for the \"region\" that may or may not be present at\n\n // frames during the event.\n\n vtkGetObjectMacro(RegionPoints, vtkPoints);\n\n void SetRegionPoints(vtkPoints* points);\n\n\n\n void AddRegion(const vtkVgTimeStamp& timeStamp,\n\n vtkIdType numberOfRegionPts, double* regionPts);\n\n void SetRegion(const vtkVgTimeStamp& timeStamp,\n\n vtkIdType numberOfRegionPts, double* regionPts);\n\n void GetRegion(const vtkVgTimeStamp& timeStamp,\n\n vtkIdType& npts, vtkIdType*& pts);\n\n bool GetRegionCenter(const vtkVgTimeStamp& timeStamp, double* center,\n\n bool interpolated);\n\n bool GetRegionAtOrAfter(vtkVgTimeStamp& timeStamp,\n","file_path":"Libraries/VtkVgCore/vtkVgEventBase.h","rank":17,"score":11.665720840866214},{"content":" virtual void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n static vtkVgGraphRepresentation* New();\n\n\n\n static std::string GetGraphEdgeColorModeString(int mode);\n\n static std::string GetGraphEdgeThicknessModeString(int mode);\n\n\n\n // Description:\n\n // Return all the objects that can be rendered.\n\n virtual const vtkPropCollection* GetNewRenderObjects() const;\n\n virtual const vtkPropCollection* GetActiveRenderObjects() const;\n\n virtual const vtkPropCollection* GetExpiredRenderObjects() const;\n\n\n\n virtual vtkPropCollection* GetNewRenderObjects();\n\n virtual vtkPropCollection* GetActiveRenderObjects();\n\n virtual vtkPropCollection* GetExpiredRenderObjects();\n\n\n\n virtual void ResetTemporaryRenderObjects();\n\n\n\n // Description:\n","file_path":"Libraries/VtkVgModelView/vtkVgGraphRepresentation.h","rank":18,"score":11.488903062739977},{"content":" vtkVgClassMacro(vqArchiveVideoSource);\n\n\n\n // Description:\n\n // Usual VTK functions.\n\n vtkTypeMacro(vqArchiveVideoSource, vtkVgVideoProviderBase);\n\n\n\n static vqArchiveVideoSource* New();\n\n\n\n virtual void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n // Description:\n\n // Get and store a clip from a given ::vgKwaArchive.\n\n int AcquireVideoClip(vgKwaArchive* videoArchive);\n\n\n\n // Description:\n\n // Get and store a clip from a given URI.\n\n int AcquireVideoClip(QUrl);\n\n\n\n QUrl GetClipUri() const\n\n {\n","file_path":"Applications/Viqui/vqArchiveVideoSource.h","rank":19,"score":11.414732227910331},{"content":" virtual void GetPickPosition(double pos[3])\n\n {\n\n pos[0] = VTK_DOUBLE_MIN;\n\n pos[1] = VTK_DOUBLE_MIN;\n\n pos[2] = VTK_DOUBLE_MIN;\n\n }\n\n\n\n // Description:\n\n // Color value modifier.\n\n vtkSetClampMacro(ColorMultiplier, double, 0.0, 1.0);\n\n vtkGetMacro(ColorMultiplier, double);\n\n\n\n // Description:\n\n // Force the representation to display all objects in a single color\n\n void SetOverrideColor(const double color[3]);\n\n\n\n // Description:\n\n // Set the display mask that this representation will use.\n\n vtkSetMacro(DisplayMask, unsigned);\n\n vtkGetMacro(DisplayMask, unsigned);\n","file_path":"Libraries/VtkVgModelView/vtkVgRepresentationBase.h","rank":20,"score":9.985177593376621},{"content":"\n\nsignals:\n\n void invalidateHomographyCaching();\n\n\n\nprivate slots:\n\n void updateXMin();\n\n void updateYMin();\n\n void updateBox();\n\n void bundleCropSelect();\n\n void cropSelect();\n\n void disable();\n\n void frameChanged();\n\n void runBundleAdjustment();\n\n void onBundleSelectionComplete();\n\n void onSelectionComplete();\n\n void onRunClicked();\n\n void updateNumImages();\n\n void cacheHomographies(std::string, std::vector<vgl_h_matrix_2d<double> >);\n\n void imageIncludeChanged(bool);\n\n void onImageListSelection();\n","file_path":"Applications/VpView/vpSuperResWidget.h","rank":21,"score":9.950457021432785},{"content":" // Return whether or not this timestamp set to max time\n\n bool IsMaxTime() const\n\n {\n\n return this->Time == VTK_DOUBLE_MAX;\n\n }\n\n\n\n void SetToMinTime()\n\n {\n\n this->Time = VTK_DOUBLE_MIN;\n\n }\n\n bool IsMinTime() const\n\n {\n\n return this->Time == VTK_DOUBLE_MIN;\n\n }\n\n\n\n // Description:\n\n // Returns true if this contains time, otherwise false.\n\n bool HasTime() const\n\n {\n\n return vgTimeStamp::HasTime();\n","file_path":"Libraries/VtkVgCore/vtkVgTimeStamp.h","rank":22,"score":9.82765847535285},{"content":" JSONNode exportToJson();\n\n\n\n void saveState(JSONNode& root);\n\n\n\n void getWorldViewport(double (&viewport)[4], double offX, double offY);\n\n\n\n void setParameterValue(double value, QDoubleSpinBox* widget);\n\n\n\nprotected slots:\n\n void enableCreateNode(bool flag);\n\n void enableCreateEdge(bool flag);\n\n\n\n void createNode(double x, double y);\n\n void createNodeSpatial(double x, double y);\n\n\n\n void createEdge();\n\n void createEdge(int parentId, int childId);\n\n\n\n void removeNodes();\n\n void removeEdges();\n","file_path":"Applications/VpView/vpGraphModelWidget.h","rank":23,"score":9.77597631571686},{"content":" // reimplemented from QWidget\n\n virtual void contextMenuEvent(QContextMenuEvent* event);\n\n virtual void leaveEvent(QEvent* event);\n\n\n\n virtual void mousePressEvent(QMouseEvent* event);\n\n virtual void mouseDoubleClickEvent(QMouseEvent* event);\n\n\n\n virtual QSize sizeHint() const\n\n { return QSize(500, 300); }\n\n\n\n virtual QSize minimumSizeHint() const\n\n { return QSize(300, 200); }\n\n\n\nsignals:\n\n void NodesSelected(QList<vtkVgNodeBase*> nodes);\n\n void NodeActivated(vtkVgNodeBase& node);\n\n void MouseLeft();\n\n void ContextMenuOpened(QMenu& menu);\n\n void ItemsChanged();\n\n\n","file_path":"Applications/Viqui/vqTreeView.h","rank":24,"score":9.299507612838244},{"content":" {\n\n return vgTimeStamp::IsValid();\n\n }\n\n\n\n // Description:\n\n // Reset to initialized state (no time or frame #)\n\n void Reset()\n\n {\n\n this->Time = vgTimeStamp::InvalidTime();\n\n this->FrameNumber = vgTimeStamp::InvalidFrameNumber();\n\n }\n\n\n\n // Description:\n\n // Set time to large value, any comparison (frame or time), will have this\n\n // timestamp grater than other, unless both at max time\n\n void SetToMaxTime()\n\n {\n\n this->Time = VTK_DOUBLE_MAX;\n\n }\n\n\n","file_path":"Libraries/VtkVgCore/vtkVgTimeStamp.h","rank":25,"score":8.859933844224127},{"content":" QList<vvDescriptor> descriptors(QList<QTreeWidgetItem*>,\n\n bool includeChildren = false) const;\n\n QList<qint64> descriptorIds(QList<QTreeWidgetItem*>,\n\n bool includeChildren = false) const;\n\n\n\n QTreeWidgetItem* findItem(int type, qint64 id, QTreeWidgetItem* from = 0);\n\n QList<QTreeWidgetItem*> findItems(int type, qint64 id = -1);\n\n\n\n QList<QTreeWidgetItem*> descriptorItems(qint64 id = -1);\n\n\n\n bool groupByStyle() const;\n\n void setStyleMap(vvDescriptorStyle::Map);\n\n void setColumns(Columns columns, bool setHeaders = true);\n\n\n\n static qint64 itemId(const QTreeWidgetItem*, bool* isValid = 0);\n\n static int itemType(const QTreeWidgetItem*);\n\n static void setItemId(QTreeWidgetItem*, qint64);\n\n static void setItemType(QTreeWidgetItem*, int);\n\n\n\nsignals:\n","file_path":"Libraries/VvWidgets/vvDescriptorInfoTree.h","rank":26,"score":8.644709528409464},{"content":" Unknown = 0x0,\n\n Person = 0x1,\n\n Vehicle = 0x2,\n\n Classifier = 0xf,\n\n Alert = 0x10,\n\n General = 0x20,\n\n User = 0x80,\n\n NonUser = 0x7f,\n\n All = 0xff\n\n };\n\n Q_DECLARE_FLAGS(Groups, Group)\n\n\n\n enum Type\n\n {\n\n Tripwire = -3000,\n\n EnteringRegion = -3001,\n\n ExitingRegion = -3002,\n\n Annotation = -4000,\n\n // NOTE: -5000 - -5??? reserved by vsTrackInfo\n\n QueryAlert = -10000,\n","file_path":"Libraries/VspData/vsEventInfo.h","rank":27,"score":8.618245977601738},{"content":"\n\nprivate:\n\n void completeSelection(bool isBundleCrop);\n\n\n\n void readSuperResParams(super3d::super_res_params::TV_METHOD method,\n\n super3d::super_res_params* srp,\n\n double regularizationScale);\n\n void updateImageInclusion();\n\n QListWidgetItem* buildImageIncludeList(int currentFrame);\n\n\n\n void loadImagery(std::vector<std::string>& filenames);\n\n\n\n void updateHomographyReferenceFrameAndCamera(int newReferenceFrame);\n\n\n\n Ui::vpSuperResWidget* Ui;\n\n\n\n vpViewCore* ViewCoreInstance;\n\n vtkSmartPointer<vtkActor> CropRegionActor;\n\n vtkSmartPointer<vtkPoints> CropRegionPoints;\n\n\n","file_path":"Applications/VpView/vpSuperResWidget.h","rank":28,"score":8.566315224003235},{"content":"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\n\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef _pqVgMixerEventPlayer_h\n\n#define _pqVgMixerEventPlayer_h\n\n\n\n#include <pqWidgetEventPlayer.h>\n\n\n\n#include <vgExport.h>\n\n\n\n/**\n\nConcrete implementation of pqWidgetEventPlayer that handles playback of recorded qtDoubleSlider user input.\n\n\n\n\\sa pqEventPlayer\n\n*/\n","file_path":"Libraries/QtTestingSupport/pqVgMixerEventPlayer.h","rank":29,"score":8.492154948953871},{"content":"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\n\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef _pqQDialogButtonBoxEventPlayer_h\n\n#define _pqQDialogButtonBoxEventPlayer_h\n\n\n\n#include <pqWidgetEventPlayer.h>\n\n\n\n#include <vgExport.h>\n\n\n\n/**\n\nConcrete implementation of pqWidgetEventPlayer that handles playback of recorded qtDoubleSlider user input.\n\n\n\n\\sa pqEventPlayer\n\n*/\n","file_path":"Libraries/QtTestingSupport/pqQDialogButtonBoxEventPlayer.h","rank":30,"score":8.383710116096665},{"content":" // Main \"execute\" function to check the status of all \"trip wires\" relative\n\n // to the tracks in the track model.\n\n void CheckTripWires();\n\n\n\n // Description:\n\n // Check the specified trip-wire for interesections against all tracks in the\n\n // TrackModel.\n\n void CheckTripWire(vtkIdType tripWireId, std::vector<IntersectionInfo>& intersections);\n\n\n\n // Description:\n\n //int ClassifierType, // Entering, Exiting, or TripWire\n\n //double IntersectionPt[2], // x, y of intersection\n\n //vtkVgTimeStamp &IntersectionTime); // Interpolated \"Time\" at IntersectionPt\n\n void CheckTrackSegment(double pt1[2], double p2[2],\n\n const vtkVgTimeStamp& timeStamp1, const vtkVgTimeStamp& timeStamp2,\n\n std::vector<IntersectionInfo>& intersections);\n\n\n\n // Description:\n\n // Make sure the event model is up to date regarding detected trip wire events\n\n void UpdateEventModel(const vtkVgTimeStamp& timestamp);\n","file_path":"Libraries/VtkVgModelView/vtkVgTripWireManager.h","rank":31,"score":7.947797523054908},{"content":" // Description:\n\n // Set if the label should include the classifier score\n\n vtkSetMacro(ShowProbability, bool);\n\n vtkGetMacro(ShowProbability, bool);\n\n\n\n // Description:\n\n // Set if the label should include the event note\n\n vtkSetMacro(ShowNote, bool);\n\n vtkGetMacro(ShowNote, bool);\n\n\n\n // Description:\n\n // Update all the event actors. Generally called by the application layer.\n\n virtual void Update();\n\n\n\n // Description:\n\n // Set/Get prefix to add to the label\n\n vtkSetStringMacro(LabelPrefix);\n\n vtkGetStringMacro(LabelPrefix);\n\n\n\n enum enumLocationSourceMode\n","file_path":"Libraries/VtkVgModelView/vtkVgEventLabelRepresentation.h","rank":32,"score":7.911716592730486},{"content":" // Get the units of the stored data\n\n // Return false if type is not ASCII\n\n std::string& GetUnits(void);\n\n\n\nprotected:\n\n ~vtkVgNitfEngrdaElement(void);\n\n\n\nprivate:\n\n friend class vtkVgNitfEngrda;\n\n\n\n std::string Label;\n\n size_t MatrixColumnCount;\n\n size_t MatrixRowCount;\n\n char Type;\n\n size_t DataTypeSize;\n\n std::string DataUnits;\n\n size_t DataCount;\n\n\n\n // FIXME: Extend for other data types\n\n union\n\n {\n\n char* Data;\n\n int DataInt;\n\n float DataFloat;\n\n double DataDouble;\n\n };\n\n};\n\ntypedef vtkSmartPointer<vtkVgNitfEngrdaElement> vtkVgNitfEngrdaElementRefPtr;\n\n\n","file_path":"Libraries/VtkVgIO/vtkVgNitfEngrda.h","rank":33,"score":7.688312535232902},{"content":"\n\n /// Location of application user manual.\n\n ///\n\n /// This specifies the file name or location of the application's user\n\n /// manual.\n\n ///\n\n /// \\sa userManualLocation(), setUserManualLocation()\n\n Q_PROPERTY(QString userManualLocation READ userManualLocation\n\n WRITE setUserManualLocation)\n\n\n\npublic:\n\n enum HelpMenuEntry\n\n {\n\n UserManualAction = 0x1,\n\n AboutAction = 0x2,\n\n FullHelpMenu = 0xff\n\n };\n\n Q_DECLARE_FLAGS(HelpMenuEntries, HelpMenuEntry);\n\n\n\npublic:\n","file_path":"Libraries/QtVgWidgets/vgApplication.h","rank":34,"score":7.587753881368895},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n// The size of this class is kept small (sizeof(void*)) so that it can be\n\n// efficiently passed by value and inserted into \"inline\" data structures\n\n// with minimal overhead.\n\n\n\n#ifndef __vtkVgEventInfo_h\n\n#define __vtkVgEventInfo_h\n\n\n\n#include \"vgPointerInt.h\"\n\n\n","file_path":"Libraries/VtkVgModelView/vtkVgEventInfo.h","rank":35,"score":7.321421848546459},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n// The size of this class is kept small (sizeof(void*)) so that it can be\n\n// efficiently passed by value and inserted into \"inline\" data structures\n\n// with minimal overhead.\n\n\n\n#ifndef __vtkVgTrackInfo_h\n\n#define __vtkVgTrackInfo_h\n\n\n\n#include \"vgPointerInt.h\"\n\n\n","file_path":"Libraries/VtkVgModelView/vtkVgTrackInfo.h","rank":36,"score":7.321421848546459},{"content":"\n\n /// Set location of application user manual.\n\n ///\n\n /// This method will resolve non-absolute paths so that the stored value is\n\n /// always a complete absolute path. If a name without path is given\n\n /// (recommended), the user manual is assumed to be in a well known relative\n\n /// location with respect to the location of the application executable.\n\n ///\n\n /// The result of specifying a relative path is not specified.\n\n ///\n\n /// \\sa userManualLocation, userManualLocation()\n\n static void setUserManualLocation(const QString&);\n\n\n\n /// Create standard help menu actions.\n\n ///\n\n /// This creates the specified standard actions in the application's Help\n\n /// menu. This includes activation slots for the actions, i.e. the actions\n\n /// will function with no additional setup required.\n\n static void setupHelpMenu(QMenu*, HelpMenuEntries = FullHelpMenu);\n\n\n","file_path":"Libraries/QtVgWidgets/vgApplication.h","rank":37,"score":7.221286248548754},{"content":"// Qt includes\n\n#include <QDebug>\n\n#include <QMouseEvent>\n\n#include <QKeyEvent>\n\n#include <QStyleOptionSlider>\n\n#include <QApplication>\n\n#include <QStylePainter>\n\n#include <QStyle>\n\n\n\n// CTK includes\n\n#include \"ctkRangeSlider.h\"\n\n\n","file_path":"Libraries/QtVgWidgets/ctkRangeSlider.cpp","rank":38,"score":6.670564795996662},{"content":"#include <vtkVgVideoFrameMetaData.h>\n\n\n\n#include <vsDataSource.h>\n\n#include <vsDescriptor.h>\n\n#include <vsDescriptorInput.h>\n\n#include <vsEvent.h>\n\n#include <vsEventInfo.h>\n\n#include <vsSourceFactory.h>\n\n#include <vsTrackClassifier.h>\n\n#include <vsTrackData.h>\n\n#include <vsTrackId.h>\n\n\n\n#include \"vsAlert.h\"\n\n#include \"vsContourWidget.h\"\n\n\n","file_path":"Libraries/VspUserInterface/vsCore.h","rank":39,"score":6.657661853624339},{"content":"#include <qtStatusSource.h>\n\n\n\n// VTK includes\n\n#include <vtkSmartPointer.h>\n\n\n\n// VISGUI includes\n\n#include <vtkVgTimeStamp.h>\n\n#include <vvQueryFormulation.h>\n\n#include <vvQueryInstance.h>\n\n#include <vvQueryResult.h>\n\n\n\n// Viqui includes\n\n#include \"vqResultFilter.h\"\n\n#include \"vtkVQBlastLayoutNode.h\"\n\n\n\n// Forward declarations.\n","file_path":"Applications/Viqui/vqCore.h","rank":40,"score":6.650212947833601},{"content":"\n\n // Description:\n\n virtual void SetVisible(int flag);\n\n virtual int GetVisible() const { return this->Visible; }\n\n\n\n virtual vtkIdType Pick(double renX,\n\n double renY,\n\n vtkRenderer* ren,\n\n vtkIdType& pickType);\n\n\n\n // Description:\n\n // Set if the label should include the event ID\n\n vtkSetMacro(ShowId, bool);\n\n vtkGetMacro(ShowId, bool);\n\n\n\n // Description:\n\n // Set how many classifiers (max) the label should show\n\n vtkSetMacro(ShowClassifiers, unsigned int);\n\n vtkGetMacro(ShowClassifiers, unsigned int);\n\n\n","file_path":"Libraries/VtkVgModelView/vtkVgEventLabelRepresentation.h","rank":41,"score":6.630969459829236},{"content":"#include <vtkVgTrack.h>\n\n#include <vtkVgTrackModel.h>\n\n#include <vtkVgTrackRepresentation.h>\n\n#include <vtkVgVideoMetadata.h>\n\n#include <vtkVgVideoModel0.h>\n\n#include <vtkVgVideoNode.h>\n\n\n\n// VTK includes\n\n#include <vtkIdList.h>\n\n#include <vtkPoints.h>\n\n\n\n#include \"vvVideoPlayerPrivate.h\"\n\n\n","file_path":"Libraries/VvVtkWidgets/vvQueryVideoPlayerPrivate.h","rank":42,"score":6.605069748001375},{"content":"\n\n#include <qtGlobal.h>\n\n\n\n#include <QThread>\n\n\n\n#include <boost/shared_ptr.hpp>\n\n\n\n#include <fstream>\n\n#include <string>\n\n#include <vector>\n\n\n","file_path":"Applications/VpView/vpSuperResDepthWarper.h","rank":43,"score":6.588558531823017},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n// Qt includes\n\n#include <QFileInfo>\n\n#include <QHash>\n\n#include <QMap>\n\n#include <QMultiHash>\n\n\n\n// QtExtensions includes\n\n#include <qtUtil.h>\n\n\n\n// visgui includes\n\n#include <vtkVgAdapt.h>\n\n#include <vtkVgCompositeEventRepresentation.h>\n\n#include <vtkVgEvent.h>\n\n#include <vtkVgEventModel.h>\n\n#include <vtkVgEventRegionRepresentation.h>\n\n#include <vtkVgTimeStamp.h>\n","file_path":"Libraries/VvVtkWidgets/vvQueryVideoPlayerPrivate.h","rank":44,"score":6.5660724841074956},{"content":"// visgui includes\n\n#include <vgFileDialog.h>\n\n\n\n// VTK Extensions includes\n\n#include <vtkVgEvent.h>\n\n#include <vtkVgEventRegionRepresentation.h>\n\n#include <vtkVgRegionWidget.h>\n\n\n\n#include <vvDescriptorInfoTree.h>\n\n\n\n#include \"vvQueryVideoPlayer.h\"\n\n\n\nnamespace // anonymous\n\n{\n\n\n","file_path":"Libraries/VvVtkWidgets/vvVideoQueryDialogPrivate.h","rank":45,"score":6.545363834579607},{"content":"#include <qtGlobal.h>\n\n\n\n// Qt includes\n\n#include <QDialog>\n\n#include <QCloseEvent>\n\n\n\n// boost includes\n\n#include <boost/shared_ptr.hpp>\n\n\n\n// Forward declarations.\n","file_path":"Applications/VpView/vpSuperResDepthViewer.h","rank":46,"score":6.541104168067802},{"content":"#include <QSharedPointer>\n\n#include <QString>\n\n#include <QStringList>\n\n\n\n#include <map>\n\n#include <memory>\n\n#include <vector>\n\n\n\nnamespace kwiver\n\n{\n\nnamespace vital\n\n{\n","file_path":"Applications/VpView/vpViewCore.h","rank":47,"score":6.541104168067802},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vqCore_h\n\n#define __vqCore_h\n\n\n\n// Qt includes\n\n#include <QVTKWidget.h>\n\n#include <QBasicTimer>\n\n#include <QString>\n\n#include <QList>\n\n#include <QHash>\n\n#include <QMultiMap>\n\n#include <QSet>\n\n#include <QSharedPointer>\n\n#include <QUrl>\n\n\n\n// QtExtensions includes\n\n#include <qtGradient.h>\n","file_path":"Applications/Viqui/vqCore.h","rank":48,"score":6.537841442116962},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#include \"vvVideoQueryDialog.h\"\n\n#include \"ui_videoQuery.h\"\n\n\n\n#include <QDebug>\n\n#include <QLabel>\n\n#include <QMessageBox>\n\n#include <QProgressBar>\n\n#include <QSettings>\n\n\n\n// Qt Extensions includes\n\n#include <qtScopedValueChange.h>\n\n#include <qtStatusManager.h>\n\n#include <qtUtil.h>\n\n\n\n#include <vgExport.h>\n\n\n","file_path":"Libraries/VvVtkWidgets/vvVideoQueryDialogPrivate.h","rank":49,"score":6.537841442116962},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpSuperResViewer_h\n\n#define __vpSuperResViewer_h\n\n\n\n// super3d includes\n\n#include <super3d/depth/super_res.h>\n\n\n\n// vidtk includes\n\n#include <video_transforms/super_res.h>\n\n\n\n// vxl includes\n\n#include <vil/vil_image_view.h>\n\n#include <vgl/algo/vgl_h_matrix_2d.h>\n\n\n\n// vtk includes\n\n#include <vtkSmartPointer.h>\n\n\n\n// Qt includes\n\n#include <QDialog>\n\n#include <QCloseEvent>\n\n\n\n// boost includes\n\n#include <boost/shared_ptr.hpp>\n\n\n\n// Forward declarations.\n","file_path":"Applications/VpView/vpSuperResViewer.h","rank":50,"score":6.535695361895864},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsScene_h\n\n#define __vsScene_h\n\n\n\n#include \"vsAlert.h\"\n\n\n\n#include <vsContour.h>\n\n#include <vsEventInfo.h>\n\n#include <vsVideoSource.h>\n\n\n\n#include <vgfItemReference.h>\n\n\n\n#include <vgVideoPlayer.h>\n\n#include <vgVtkVideoFrame.h>\n\n\n\n#include <vtkVgTrackRepresentationBase.h>\n\n\n\n#include <vgMatrix.h>\n\n\n\n#include <vgExport.h>\n\n\n\n#include <qtGlobal.h>\n\n\n\n#include <QColor>\n\n#include <QObject>\n\n\n","file_path":"Libraries/VspUserInterface/vsScene.h","rank":51,"score":6.525846240936778},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsScenePrivate_h\n\n#define __vsScenePrivate_h\n\n\n\n#include <vsEventInfo.h>\n\n\n\n#include <vgVideoPlayer.h>\n\n\n\n#include <vtkVgInstance.h>\n\n#include <vtkVgTimeStamp.h>\n\n\n\n#include <vgColor.h>\n\n#include <vgMatrix.h>\n\n\n\n#include <vtkSmartPointer.h>\n\n#include <vtkTimeStamp.h>\n\n\n\n#include <QHash>\n\n#include <QMap>\n\n#include <QPoint>\n\n#include <QSet>\n\n#include <QSharedPointer>\n\n\n","file_path":"Libraries/VspUserInterface/vsScenePrivate.h","rank":52,"score":6.520439988420708},{"content":" void ItemsChanged();\n\n\n\npublic slots:\n\n void FocusItemAlone();\n\n void FocusItem();\n\n\n\nprotected slots:\n\n void OnTreeSelectionChanged();\n\n void OnTreeContextMenu(QMenu& menu);\n\n void CreateEvent(int type);\n\n void DeleteEvent();\n\n void EditTrack();\n\n void StopEditingTrack();\n\n void DeleteTrack();\n\n void SplitTrack();\n\n void ImproveTrack();\n\n void AddEventToActivity();\n\n void RemoveEventFromActivity();\n\n\n\n void SetEventStatus(int status);\n","file_path":"Applications/VpView/vpObjectSelectionPanel.h","rank":53,"score":6.516964981642532},{"content":" void update();\n\n void postRender();\n\n\n\n void onLeftClick();\n\n void onRightButtonPress();\n\n void onRightButtonRelease();\n\n void onMouseWheelForward();\n\n void onMouseWheelBackward();\n\n void onPKeyPress();\n\n\n\n void onContextMenuEvent();\n\n\n\n void addRasterLayer(QUrl uri);\n\n\n\n void drawRegion();\n\n void setRegion(vgGeocodedPoly region);\n\n\n\n void updateScene();\n\n void updateSources();\n\n void updateLOD(bool override = false);\n","file_path":"Applications/Viqui/vqCore.h","rank":54,"score":6.512168617858049},{"content":"\n\n void AddEventsToGraphModel();\n\n void AddTrackEventsToGraphModel();\n\n\n\npublic slots:\n\n void ShowAll();\n\n void HideAll();\n\n\n\n void SortBy(int type, Qt::SortOrder direction);\n\n\n\n void ShowAllTracks();\n\n void HideAllTracks();\n\n\n\n void ShowEventType(int type);\n\n void ShowAllEvents();\n\n void HideAllEvents();\n\n\n\n void ShowActivityType(int type);\n\n void ShowAllActivities();\n\n void HideAllActivities();\n","file_path":"Applications/VpView/vpTreeView.h","rank":55,"score":6.503739956062841},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vqArchiveVideoSource_h\n\n#define __vqArchiveVideoSource_h\n\n\n\n// VG includes.\n\n#include <vtkVgMacros.h>\n\n#include <vtkVgVideoProviderBase.h>\n\n\n\n// VV includes.\n\n#include <vvIqr.h>\n\n\n\n// STL includes.\n\n#include <vector>\n\n\n\n// QT includes.\n\n#include <QObject>\n\n#include <QSharedPointer>\n\n#include <QUrl>\n\n\n","file_path":"Applications/Viqui/vqArchiveVideoSource.h","rank":56,"score":6.49456964884962},{"content":"\n\n void onVideoPlaying();\n\n void onVideoPaused();\n\n void onVideoStopped();\n\n\n\n void onLeftButtonClicked();\n\n\n\n void reset();\n\n\n\n void resetView();\n\n\n\n void seekTo(double value);\n\n\n\n void setEventRegionVisible(bool);\n\n void setEventFollowingEnabled(bool);\n\n void setPlaybackEnabled(bool);\n\n\n\n void doubleThePlaybackSpeed();\n\n void reducePlaybackSpeedByHalf();\n\n\n","file_path":"Libraries/VvVtkWidgets/vvVideoPlayer.h","rank":57,"score":6.486573204805329},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpProject_h\n\n#define __vpProject_h\n\n\n\n#include \"vpProjectBase.h\"\n\n\n\n#include <vgAttributeSet.h>\n\n\n\n#include <qtGlobal.h>\n\n\n\n#include <vtkSmartPointer.h>\n\n\n\n#include <QHash>\n\n#include <QSharedPointer>\n\n\n\n#include <string>\n\n#include <map>\n\n#include <vector>\n\n#include <algorithm>\n\n\n","file_path":"Applications/VpView/vpProject.h","rank":58,"score":6.484802051404319},{"content":" void onOverviewLoaded();\n\n void onEnterAdjudicationMode();\n\n void onFollowTrackChange(int trackId);\n\n void onExitFollowTrack();\n\n void toggleAdjudicationMode(bool state);\n\n void exitApp();\n\n void onFrameChange();\n\n void onTimeChange(double now);\n\n void onReachedPlayBoundary();\n\n void onFastBackward();\n\n void onReversePause();\n\n void onPause();\n\n void onPlayPause();\n\n void onFastForward();\n\n void onLoopToggle(bool state);\n\n void onFrameUpdate(int minFrameNumber, int frameNumber, bool resize);\n\n void onTimeUpdate(double minTime, double time, bool resize);\n\n void updateMinTime(double time);\n\n void onFrameIntervalEnabled(int state);\n\n void onTreeSelectionChanged(int sessionId);\n","file_path":"Applications/VpView/vpView.h","rank":59,"score":6.479319355837096},{"content":" void forceRender();\n\n\n\n void reactToDataChanged();\n\n\n\n void reactToExternalProcessFileChanged(QString);\n\n\n\nsignals:\n\n\n\n void dataLoaded();\n\n void dataSetChanged();\n\n void iconsLoaded();\n\n void overviewLoaded();\n\n void followTrackChange(int trackId);\n\n\n\n void trackTypesModified();\n\n\n\n void displayZoom();\n\n void frameChanged();\n\n void frameChanged(const QString&);\n\n void timeChanged(double microseconds);\n","file_path":"Applications/VpView/vpViewCore.h","rank":60,"score":6.476276980871496},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vvQueryVideoPlayer_h\n\n#define __vvQueryVideoPlayer_h\n\n\n\n#include \"vvVideoPlayer.h\"\n\n\n\n#include <QHash>\n\n#include <QList>\n\n#include <QSet>\n\n#include <QSharedPointer>\n\n#include <QUrl>\n\n\n\n#include <vtkType.h>\n\n\n\n#include <vgExport.h>\n\n\n\n#include <vtkVgTrack.h>\n\n\n\n#include <vvQuery.h>\n\n\n\n#include \"vgRegionKeyframe.h\"\n\n\n","file_path":"Libraries/VvVtkWidgets/vvQueryVideoPlayer.h","rank":61,"score":6.469334652730426},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vtkVgTrack_h\n\n#define __vtkVgTrack_h\n\n\n\n#include <vtkObject.h>\n\n#include <vtkSmartPointer.h>\n\n#include <vtkDenseArray.h>\n\n#include <vtkBoundingBox.h>\n\n\n\n#include \"vtkVgSetGet.h\"\n\n#include \"vtkVgTimeStamp.h\"\n\n\n\n#include <map>\n\n#include <string>\n\n#include <vector>\n\n\n\n#include <vgExport.h>\n\n\n\n#include \"vtkVgGeoCoord.h\"\n\n\n","file_path":"Libraries/VtkVgCore/vtkVgTrack.h","rank":62,"score":6.469334652730426},{"content":" bool UpdateEventAnnotation(vtkVgEvent* event);\n\n bool UpdateActivityAnnotation(vtkVgActivity* event);\n\n\n\n void AddFrameDelta(std::ostream& os,\n\n unsigned int currFrame,\n\n unsigned int firstFrame, unsigned int lastFrame);\n\n\n\nprivate:\n\n bool Visible;\n\n int ObjectType;\n\n vtkIdType ObjectId;\n\n\n\n union\n\n {\n\n vtkVgTrack* Track;\n\n vtkVgEvent* Event;\n\n vtkVgActivity* Activity;\n\n } Object;\n\n\n\n vpViewCore* ViewCoreInstance;\n\n\n\n vtkVgAnnotationActor* Actor;\n\n\n\n vtkSmartPointer<vtkMatrix4x4> RepresentationMatrix;\n\n};\n\n\n\n#endif // __vpAnnotation_h\n","file_path":"Applications/VpView/vpAnnotation.h","rank":63,"score":6.46909164069398},{"content":" void onLeftRelease();\n\n void onLeftClick();\n\n void onRightClick();\n\n void onMouseMove();\n\n void onSelectionComplete();\n\n\n\n void onEditTrackHeadRegion();\n\n\n\n void resetToAOIView();\n\n void resetView();\n\n void resetToViewExtents();\n\n void getAOIExtents(double extents[4]);\n\n\n\n void decreaseTrackHeadSize();\n\n void toggleImageFiltering();\n\n void increaseTrackHeadSize();\n\n\n\n int pickScene();\n\n\n\n void CreateInformaticsDisplay(int x, int y, vtkImageData* normalcy);\n","file_path":"Applications/VpView/vpViewCore.h","rank":64,"score":6.467477626641269},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpMultiGraphRepresentation_h\n\n#define __vpMultiGraphRepresentation_h\n\n\n\n#include \"vpMultiGraphModel.h\"\n\n#include \"vpPrimitiveConfig.h\"\n\n\n\n// VisGUI includes\n\n#include <vgRange.h>\n\n#include <vtkVgRepresentationBase.h>\n\n#include <vtkVgPickData.h>\n\n\n\n// VTK includes\n\n#include <vtkActor.h>\n\n#include <vtkSmartPointer.h>\n\n\n\n// C++ includes\n\n#include <map>\n\n\n","file_path":"Applications/VpView/vpMultiGraphRepresentation.h","rank":65,"score":6.463056515190249},{"content":"\n\n void FollowTrack();\n\n\n\n void OnShowLinkedEvents();\n\n void OnHideLinkedEvents();\n\n\n\n void OnShowLinkedActivities();\n\n void OnHideLinkedActivities();\n\n\n\n void OnShownItemsChanged();\n\n\n\n void OnHideAll();\n\n void OnShowAll();\n\n\n\n void OnAddEventsToGraphModel();\n\n void OnAddTrackEventsToGraphModel();\n\n\n\nprotected:\n\n virtual void showEvent(QShowEvent* event);\n\n\n","file_path":"Applications/VpView/vpObjectSelectionPanel.h","rank":66,"score":6.459963974929843},{"content":" void onRemoveAllTemporalFilters();\n\n void onRemoveAllFilters();\n\n\n\n void temporalFilterChanged(QTreeWidgetItem* item, int column);\n\n\n\n void bookmarkViewport();\n\n void copyViewportExtentsToClipboard();\n\n void copyExtendedInfoToClipboard();\n\n\n\n void updateInfoWidget(bool trackAttributesOnly = false);\n\n void rebuildObjectViews();\n\n\n\n void onSettingsChanged();\n\n\n\n void onTestingStarted();\n\n void onTestingStopped();\n\n\n\n void createTrack(bool start);\n\n void createEvent(bool start);\n\n void createSceneElement(bool start);\n","file_path":"Applications/VpView/vpView.h","rank":67,"score":6.447281138969845},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsDescriptorSource_h\n\n#define __vsDescriptorSource_h\n\n\n\n#include <vgExport.h>\n\n\n\n#include <vvDescriptor.h>\n\n#include <vvTrack.h>\n\n\n\n#include \"vsDataSource.h\"\n\n#include \"vsDescriptor.h\"\n\n#include \"vsEvent.h\"\n\n#include \"vsEventInfo.h\"\n\n#include \"vsTrackClassifier.h\"\n\n#include \"vsTrackId.h\"\n\n\n\n#include \"vsDescriptorInput.h\"\n\n\n","file_path":"Libraries/VspData/vsDescriptorSource.h","rank":68,"score":6.4365435958191055},{"content":"#ifndef __ctkRangeSlider_h\n\n#define __ctkRangeSlider_h\n\n\n\n// Qt includes\n\n#include <QSlider>\n\n\n\n#include <vgExport.h>\n\n\n\n// CTK includes\n\n//#include <ctkPimpl.h>\n\n\n","file_path":"Libraries/QtVgWidgets/ctkRangeSlider.h","rank":69,"score":6.433495270303379},{"content":"\n\n virtual void Update();\n\n\n\n // Description:\n\n // Mouse move event.\n\n virtual bool MouseMoveEvent(const vtkContextMouseEvent& mouse);\n\n\n\n // Description:\n\n // Mouse button double click event.\n\n virtual bool MouseDoubleClickEvent(const vtkContextMouseEvent& mouse);\n\n\n\n // Description:\n\n // Mouse button release event.\n\n virtual bool MouseButtonReleaseEvent(const vtkContextMouseEvent& mouse);\n\n\n\n // Description:\n\n // Mouse wheel event, positive delta indicates forward movement of the wheel.\n\n virtual bool MouseWheelEvent(const vtkContextMouseEvent& mouse, int delta);\n\n\n\n virtual bool Hit(const vtkContextMouseEvent& mouse);\n","file_path":"Libraries/VtkVgCore/vtkVgChartTimeline.h","rank":70,"score":6.433067982519232},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpGraphAnimateCallback_h\n\n#define __vpGraphAnimateCallback_h\n\n\n\n// VisGUI includes\n\n#include \"vpMultiGraphModel.h\"\n\n#include \"vpMultiGraphRepresentation.h\"\n\n\n\n// VTK includes\n\n#include <vtkCommand.h>\n\n#include <vtkRenderer.h>\n\n#include <vtkRenderWindow.h>\n\n#include <vtkRenderWindowInteractor.h>\n\n\n\n// C++ includes\n\n#include <vector>\n\n\n","file_path":"Applications/VpView/vpGraphAnimateCallback.h","rank":71,"score":6.429708101725302},{"content":" void exportSceneElements();\n\n void exportFilters();\n\n void exportFilters(QString path, bool startExternalProcess);\n\n\n\n void setTrackTrailLength();\n\n\n\n void changeTrackColors();\n\n void updateTrackColorsFromDialog(vpTrackColorDialog* dlg);\n\n\n\n void setFrameOffset();\n\n\n\n void importProject();\n\n void closeProject(int sessionId);\n\n\n\n void updateTracks();\n\n void finishTrackUpdate();\n\n\n\n void setAutoUpdateEnabled(bool enable);\n\n\n\n void disableTimeBasedIndexing();\n","file_path":"Applications/VpView/vpView.h","rank":72,"score":6.427423687041007},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsCore_h\n\n#define __vsCore_h\n\n\n\n#include <QObject>\n\n#include <QList>\n\n#include <QHash>\n\n#include <QMap>\n\n#include <QSet>\n\n\n\n#include <qtGlobal.h>\n\n\n\n#include <vgExport.h>\n\n#include <vgNamespace.h>\n\n\n\n#include <vtkVgTimeStamp.h>\n\n\n","file_path":"Libraries/VspUserInterface/vsCore.h","rank":73,"score":6.427094941921273},{"content":"\n\n virtual void chooseQueryVideo() {}\n\n virtual void reprocessQueryVideo() {}\n\n\n\n virtual void setQueryTracksAndDescriptors(\n\n QList<vvDescriptor> descriptors, QList<vvTrack> tracks);\n\n virtual void clearQueryDescriptors();\n\n\n\n void moveToSelected();\n\n void moveToAvailable();\n\n void clearSelected();\n\n\n\n void setStartTimeConstraintToCurrentFrame();\n\n void setEndTimeConstraintToCurrentFrame();\n\n void clearTimeConstraints();\n\n\n\n void addKeyframe();\n\n void removeSelectedKeyframes();\n\n void loadKeyframes();\n\n void unsetKeyframeEditCursor();\n","file_path":"Libraries/VvVtkWidgets/vvVideoQueryDialog.h","rank":74,"score":6.422212221564201},{"content":" void stepVideoForward();\n\n void stepVideoBackward();\n\n void skipVideoForward();\n\n void skipVideoBackward();\n\n\n\n void decreaseVideoPlaybackSpeed();\n\n void increaseVideoPlaybackSpeed();\n\n\n\n void writeRenderedImages(bool);\n\n void saveScreenShot();\n\n\n\n void initializeTesting(const qtCliArgs*);\n\n\n\nprotected slots:\n\n void toggleDrawing(bool);\n\n\n\n void setCursorLocationText(QString);\n\n\n\n void updateTrackLabelActionsEnabled();\n\n\n","file_path":"Libraries/VspUserInterface/vsMainWindow.h","rank":75,"score":6.421841256525086},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vtkVgPropCollection_h\n\n#define __vtkVgPropCollection_h\n\n\n\n// VTK includes.\n\n#include <vtkObject.h>\n\n#include <vtkSmartPointer.h>\n\n\n\n// STL includes.\n\n#include <map>\n\n#include <vector>\n\n\n\n// VG includes.\n\n#include \"vtkVgMacros.h\"\n\n\n\n#include <vgExport.h>\n\n\n\n// Forward declarations.\n","file_path":"Libraries/VtkVgSceneGraph/vtkVgPropCollection.h","rank":76,"score":6.419523110909629},{"content":"public slots:\n\n void initializeTesting(const qtCliArgs*);\n\n void addLayer(QUrl);\n\n\n\n void resultsPageBack();\n\n void resultsPageForward();\n\n\n\nprotected slots:\n\n void showQueryNewDialog();\n\n void showQueryEditDialog();\n\n void showQueryOpenDialog();\n\n void showGroundTruthOpenDialog();\n\n void showLayerAddFileDialog();\n\n void showConfigureDialog();\n\n void refineResults();\n\n\n\n void setResultFilters();\n\n\n\n void showQueryClip(vvQueryInstance query);\n\n\n","file_path":"Applications/Viqui/vqApplication.h","rank":77,"score":6.416667324151747},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsContextViewer_h\n\n#define __vsContextViewer_h\n\n\n\n// VisGUI includes.\n\n#include <vsDescriptorInput.h>\n\n\n\n#include <qtGlobal.h>\n\n\n\n// VTK includes.\n\n#include <QVTKWidget.h>\n\n\n\n// QT includes.\n\n#include <QBasicTimer>\n\n#include <QSet>\n\n#include <QUrl>\n\n\n\n// Forward declarations\n","file_path":"Plugins/VspUiExtensions/ContextViewer/vsContextViewer.h","rank":78,"score":6.411969099818391},{"content":" void onEventFilterPresetChanged(int index);\n\n void onEventFilterVisibilityChanged();\n\n void onEventFilterChanged();\n\n void onFrameRendered();\n\n void onReinitialized();\n\n void onShow3dView(bool state);\n\n void onHide3dView();\n\n void onEventExpirationModeChange(QAction* sizeAction, bool render = true);\n\n void onContextLODChanged(int value);\n\n void onWebExport();\n\n void onProjectProcessed();\n\n\n\n void updateFrameTime();\n\n void updateObjectCounts();\n\n void updateUI();\n\n\n\n void handleRenderWindowMouseMove(int x, int y);\n\n void updateFrameFileName(const QString& fileName);\n\n\n\n bool eventFilter(QObject* obj, QEvent* event);\n","file_path":"Applications/VpView/vpView.h","rank":79,"score":6.409406041427738},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vtkVgRepresentationBase_h\n\n#define __vtkVgRepresentationBase_h\n\n\n\n// VTK includes.\n\n#include <vtkObject.h>\n\n#include <vtkPropCollection.h>\n\n#include <vtkSmartPointer.h>\n\n\n\n// VG includes.\n\n#include \"vtkVgMacros.h\"\n\n\n\n// C++ includes\n\n#include <limits>\n\n\n\n#include <vgExport.h>\n\n\n\n// Forward declarations.\n","file_path":"Libraries/VtkVgModelView/vtkVgRepresentationBase.h","rank":80,"score":6.404432845814079},{"content":" void readyToProcessDatabaseVideoQuery(vvQueryInstance);\n\n\n\npublic slots:\n\n virtual void accept();\n\n\n\nprotected slots:\n\n void updateTimeUpperFromLower();\n\n void updateTimeLowerFromUpper();\n\n\n\n void preSetQueryType();\n\n void setQueryType(int);\n\n\n\n void requestRegion();\n\n void acceptDrawnRegion(vgGeocodedPoly region);\n\n\n\n void editRegionNumeric();\n\n\n\n void editQuery();\n\n\n\n void loadQuery();\n","file_path":"Applications/Viqui/vqQueryDialog.h","rank":81,"score":6.402596150644024},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsViperArchiveSourcePrivate_h\n\n#define __vsViperArchiveSourcePrivate_h\n\n\n\n#include \"vsViperArchiveSource.h\"\n\n\n\n#include <QMap>\n\n#include <QSet>\n\n#include <QUrl>\n\n\n\n#include <qtThread.h>\n\n\n\n#include <vvDescriptor.h>\n\n\n\n#include <track_oracle/track_oracle.h>\n\n\n\n#include <vsDescriptorInput.h>\n\n#include <vsEvent.h>\n\n#include <vsTrackId.h>\n\n\n","file_path":"Plugins/VspSourceService/ViperArchiveSource/vsViperArchiveSourcePrivate.h","rank":82,"score":6.402510694677576},{"content":" void onTreeHoverItemChanged(int sessionId);\n\n void updateObject(int objectType, int id);\n\n void updateColorofTracksOfType(int typeIndex, double* rgb);\n\n void updateCore();\n\n void updateEverything();\n\n void onCreateEvent(int type, vtkIdList* ids);\n\n void onTimelineSelectionChanged(int type, int id);\n\n void onShowHideTimelineView(bool show);\n\n void onTimelineDialogClosed();\n\n void onDisplayEventLegend(bool state);\n\n void onDisplayEventIcons(bool state);\n\n void onIconSizeChange(QAction* sizeAction, bool render = true);\n\n void onDisplayOverview(bool state);\n\n void onDisplayAOIOutline(bool state);\n\n void onCriticalError(const QString&);\n\n void onWarningError(const QString&);\n\n void onShowConfigureDialog();\n\n void onShowExternalProcessDialog();\n\n void onSaveRenderedImages(bool state);\n\n void onExecuteModeChanged(int index);\n","file_path":"Applications/VpView/vpView.h","rank":83,"score":6.401968001840416},{"content":"\n\n void onIncreaseSceneElementTransparency();\n\n void onDecreaseSceneElementTransparency();\n\n\n\n void onIncreasePolygonNodeSize();\n\n void onDecreasePolygonNodeSize();\n\n\n\n void onPlay();\n\n void onPause();\n\n void setLoop(bool state);\n\n\n\n void nextFrame();\n\n void prevFrame();\n\n void seekToFrame(const vtkVgTimeStamp& position, vg::SeekMode direction);\n\n\n\n void setPlaybackRate(double rate);\n\n double getPlaybackRate();\n\n\n\n void onResize(int width, int height);\n\n\n","file_path":"Applications/VpView/vpViewCore.h","rank":84,"score":6.398621530881519},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpQtViewer3d_h\n\n#define __vpQtViewer3d_h\n\n\n\n// VisGUI includes\n\n#include <vtkVgPicker.h>\n\n#include <vtkVgTimeStamp.h>\n\n\n\n#include <qtGlobal.h>\n\n\n\n// Qt includes\n\n#include <QList>\n\n#include <QObject>\n\n\n\n// VTK includes\n\n#include <vtkSmartPointer.h>\n\n\n\n// Forward declarations.\n","file_path":"Applications/VpView/vpQtViewer3d.h","rank":85,"score":6.396914286358268},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsMainWindowPrivate_h\n\n#define __vsMainWindowPrivate_h\n\n\n\n#include <QHash>\n\n#include <QStack>\n\n\n\n#include <qtUiState.h>\n\n\n\n#include <vgRange.h>\n\n\n\n#include <vsContour.h>\n\n#include <vsDescriptorInput.h>\n\n\n\n#include \"vsMainWindow.h\"\n\n\n\n#include \"ui_vsp.h\"\n\n#include \"am_vsp.h\"\n\n\n","file_path":"Libraries/VspUserInterface/vsMainWindowPrivate.h","rank":86,"score":6.396914286358268},{"content":"\n\npublic slots:\n\n void hideAllItems();\n\n void showAllItems();\n\n void setHiddenItemsShown(bool enable);\n\n\n\n void hideSelectedItems();\n\n void showSelectedItems();\n\n\n\n void setSelectedItemsStarred(bool starred);\n\n\n\n void selectTrack(vtkIdType trackId);\n\n\n\n void jumpToSelectedStart();\n\n void jumpToSelectedEnd();\n\n void followSelectedTrack();\n\n\n\nprotected slots:\n\n void itemActivated(const QModelIndex& index);\n\n\n","file_path":"Libraries/VspUserInterface/vsTrackTreeView.h","rank":87,"score":6.389985843476846},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vtkVgTerrainSource_h\n\n#define __vtkVgTerrainSource_h\n\n\n\n// VG includes.\n\n#include <vgExport.h>\n\n\n\n#include <vtkVgMacros.h>\n\n#include <vtkVgDataSourceBase.h>\n\n\n\n// VTK includes.\n\n#include <vtkMatrix4x4.h>\n\n#include <vtkSmartPointer.h>\n\n\n\n// STL includes.\n\n#include <vector>\n\n\n\n// Forward declarations.\n","file_path":"Libraries/VtkVgQtSceneUtil/vtkVgTerrainSource.h","rank":88,"score":6.38941335920586},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vdfTrackSource_h\n\n#define __vdfTrackSource_h\n\n\n\n#include \"vdfDataSourceInterface.h\"\n\n#include \"vdfTrackData.h\"\n\n#include \"vdfTrackId.h\"\n\n\n\n#include <vvTrack.h>\n\n\n\n#include <vgTimeMap.h>\n\n\n\n#include <vgExport.h>\n\n\n\n#include <QHash>\n\n#include <QObject>\n\n#include <QSet>\n\n\n","file_path":"Libraries/VgDataFramework/vdfTrackSource.h","rank":89,"score":6.38941335920586},{"content":"\n\nsignals:\n\n void ActivatedNode(vtkVgNodeBase& node);\n\n void SelectedNodes(QList<vtkVgNodeBase*> nodes);\n\n\n\npublic slots:\n\n void SelectNodes(QList<vtkVgNodeBase*> node);\n\n void UpdateColors();\n\n void Update();\n\n void ResetView();\n\n void OnKeyPressed();\n\n\n\nprivate slots:\n\n void OnFrameChanged(int frame);\n\n\n\nprivate:\n\n void UpdateTimelineChart();\n\n void UpdateTimelineTable();\n\n void UpdateSelection();\n\n\n","file_path":"Applications/Viqui/vqTimeline.h","rank":90,"score":6.383699299149272},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpSuperResDepthViewer_h\n\n#define __vpSuperResDepthViewer_h\n\n\n\n// super3d includes\n\n#include <super3d/depth/super_config.h>\n\n#include <super3d/depth/super_res.h>\n\n\n\n// vxl includes\n\n#include <vil/vil_image_view.h>\n\n#include <vgl/algo/vgl_h_matrix_2d.h>\n\n#include <vpgl/vpgl_perspective_camera.h>\n\n\n\n// vtk includes\n\n#include <vtkSmartPointer.h>\n\n#include <vtkPolyData.h>\n\n\n","file_path":"Applications/VpView/vpSuperResDepthViewer.h","rank":91,"score":6.382263157049693},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsStreamSourcePrivate_h\n\n#define __vsStreamSourcePrivate_h\n\n\n\n#include <QUrl>\n\n\n\n#include <vgExport.h>\n\n\n\n#include <vvDescriptor.h>\n\n\n\n#include <vsDescriptor.h>\n\n#include <vsDescriptorInput.h>\n\n#include <vsEvent.h>\n\n#include <vsEventInfo.h>\n\n#include <vsVideoSourcePrivate.h>\n\n\n\n#include \"vsStreamSource.h\"\n\n\n","file_path":"Libraries/VspSourceUtil/vsStreamSourcePrivate.h","rank":92,"score":6.374464154287197},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpSuperResWorker_h\n\n#define __vpSuperResWorker_h\n\n\n\n#include <super3d/depth/super_res.h>\n\n\n\n#include <vgl/algo/vgl_h_matrix_2d.h>\n\n\n\n#include <vtkSmartPointer.h>\n\n\n\n#include <QScopedPointer>\n\n#include <QThread>\n\n\n\n#include <boost/shared_ptr.hpp>\n\n\n\n#include <fstream>\n\n#include <string>\n\n#include <vector>\n\n\n","file_path":"Applications/VpView/vpSuperResWorker.h","rank":93,"score":6.374464154287197},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vsCorePrivate_h\n\n#define __vsCorePrivate_h\n\n\n\n#include <vgSwatchCache.h>\n\n#include <vgTimeMap.h>\n\n\n\n#include <vtkVgInstance.h>\n\n#include <vtkVgVideoMetadata.h>\n\n\n\n#include <vsContour.h>\n\n#include <vsDescriptorInput.h>\n\n#include <vsEvent.h>\n\n#include <vsTrackId.h>\n\n\n\n#include \"vsCore.h\"\n\n\n","file_path":"Libraries/VspUserInterface/vsCorePrivate.h","rank":94,"score":6.374464154287197},{"content":" void finalizeKeyframeEdit();\n\n void cancelKeyframeEdit();\n\n\n\n void selectDescriptor(vtkIdType id);\n\n void selectKeyframe(vtkIdType id);\n\n void selectTrack(vtkIdType id);\n\n void selectItem(vvDescriptorInfoTree* tree, vtkIdType id, int type);\n\n\n\n void selectItem(QTreeWidgetItem* item, int column);\n\n\n\n void showAll();\n\n void hideAll();\n\n void hideAllDescriptors();\n\n void itemVisibilityChanged(QTreeWidgetItem* item, int column);\n\n void updateItemParentVisibilities();\n\n\n\n void updateSelectionControlsState();\n\n void updateTrackConstraintControlsState();\n\n void updateKeyframeControlsState();\n\n\n","file_path":"Libraries/VvVtkWidgets/vvVideoQueryDialog.h","rank":95,"score":6.371489716188259},{"content":" static const char* GetSortTypeString(int sortType);\n\n\n\nsignals:\n\n void ItemsChanged(const QList<QTreeWidgetItem*>& items,\n\n bool updateStatus = true);\n\n\n\n void MouseLeft();\n\n void ContextMenuOpened(QMenu& menu);\n\n\n\n void FocusItemAlone();\n\n void FocusItem();\n\n void GoToStartFrame();\n\n void GoToEndFrame();\n\n void FollowTrack();\n\n\n\n void ShowLinkedEvents();\n\n void HideLinkedEvents();\n\n\n\n void ShowLinkedActivities();\n\n void HideLinkedActivities();\n","file_path":"Applications/VpView/vpTreeView.h","rank":96,"score":6.369831939213807},{"content":"\n\n void timeIntervalMeasurementRequested();\n\n\n\npublic slots:\n\n void initializeUi();\n\n void loadEventTypes(vtkVgEventTypeRegistry* reg);\n\n void loadPrimitiveTypes(const QString& filename = QString());\n\n void loadAttributeTypes(const QString& filename = QString());\n\n void loadConfig(const QString& filename);\n\n\n\n void updateViews();\n\n void updateVertexDisplaySize();\n\n\n\n void importJson();\n\n void exportJson(QString filename=QString(\"\"));\n\n\n\n void clear();\n\n\n\n void selectEvent(int id);\n\n\n","file_path":"Applications/VpView/vpGraphModelWidget.h","rank":97,"score":6.369831939213807},{"content":"\n\n void mergeTracks(bool start);\n\n\n\n void stopCreatingTrack();\n\n void stopCreatingEvent();\n\n void stopMergingTracks();\n\n\n\n void onEventCreated(int id);\n\n void onTracksMerged(int id);\n\n\n\n void splitTrack(int id, int sessionId);\n\n void improveTrack(int id, int sessionId);\n\n\n\n void addEventsToGraphModel(QList<int> eventIds, int sessionId);\n\n void addTrackEventsToGraphModel(int id, int sessionId);\n\n\n\n void selectEvent(int id);\n\n\n\n void exportTracks();\n\n void exportEvents();\n","file_path":"Applications/VpView/vpView.h","rank":98,"score":6.368705883103003},{"content":"// This file is part of ViViA, and is distributed under the\n\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\n\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\n\n\n\n#ifndef __vpMultiGraphModel_h\n\n#define __vpMultiGraphModel_h\n\n\n\n#include <vtkVgModelBase.h>\n\n\n\n//\n\n#include <vgTimeStamp.h>\n\n\n\n// VTK includes\n\n#include <vtkGraph.h>\n\n#include <vtkMath.h>\n\n\n\n// C++ include\n\n#include <map>\n\n#include <string>\n\n\n","file_path":"Applications/VpView/vpMultiGraphModel.h","rank":99,"score":6.364742163729922}],"string":"[\n {\n \"content\": \"class QT_TESTINGSUPPORT_EXPORT pqQteDoubleSliderEventPlayer :\\n\\n public pqWidgetEventPlayer\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n pqQteDoubleSliderEventPlayer(QObject* p = 0);\\n\\n\\n\\n bool playEvent(QObject* Object, const QString& Command, const QString& Arguments, bool& Error);\\n\\n\\n\\nprivate:\\n\\n Q_DISABLE_COPY(pqQteDoubleSliderEventPlayer)\\n\\n};\\n\\n\\n\\n#endif // !_pqQteDoubleSliderEventPlayer_h\",\n \"file_path\": \"Libraries/QtTestingSupport/pqQteDoubleSliderEventPlayer.h\",\n \"rank\": 0,\n \"score\": 52769.839565178176\n },\n {\n \"content\": \"class QT_TESTINGSUPPORT_EXPORT pqQteDoubleSliderEventTranslator :\\n\\n public pqWidgetEventTranslator\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n pqQteDoubleSliderEventTranslator(QObject* p = 0);\\n\\n\\n\\n virtual bool translateEvent(QObject* Object, QEvent* Event, bool& Error);\\n\\n\\n\\nprivate:\\n\\n Q_DISABLE_COPY(pqQteDoubleSliderEventTranslator)\\n\\n\\n\\n QObject* CurrentObject;\\n\\n\\n\\nprivate slots:\\n\\n void onValueChanged(double);\\n\\n};\\n\\n\\n\\n#endif // !_pqQteDoubleSliderEventTranslator_h\\n\",\n \"file_path\": \"Libraries/QtTestingSupport/pqQteDoubleSliderEventTranslator.h\",\n \"rank\": 1,\n \"score\": 52769.839565178176\n },\n {\n \"content\": \"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\\n\\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\\n\\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\\n\\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\\n\\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\\n\\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\\n\\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\\n\\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef _pqQteDoubleSliderEventPlayer_h\\n\\n#define _pqQteDoubleSliderEventPlayer_h\\n\\n\\n\\n#include <pqWidgetEventPlayer.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n/**\\n\\nConcrete implementation of pqWidgetEventPlayer that handles playback of recorded qtDoubleSlider user input.\\n\\n\\n\\n\\\\sa pqEventPlayer\\n\\n*/\\n\",\n \"file_path\": \"Libraries/QtTestingSupport/pqQteDoubleSliderEventPlayer.h\",\n \"rank\": 2,\n \"score\": 47031.678339405225\n },\n {\n \"content\": \"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\\n\\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\\n\\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\\n\\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\\n\\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\\n\\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\\n\\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\\n\\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef _pqQteDoubleSliderEventTranslator_h\\n\\n#define _pqQteDoubleSliderEventTranslator_h\\n\\n\\n\\n#include \\\"pqWidgetEventTranslator.h\\\"\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n/**\\n\\nTranslates low-level Qt events into high-level ParaView events that can be recorded as test cases.\\n\\n\\n\\n\\\\sa pqEventTranslator\\n\\n*/\\n\\n\\n\",\n \"file_path\": \"Libraries/QtTestingSupport/pqQteDoubleSliderEventTranslator.h\",\n \"rank\": 3,\n \"score\": 47030.98081845511\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ParaView\\n\\n Module: pqQteDoubleSliderEventTranslator.h\\n\\n\\n\\n Copyright (c) 2005-2008 Sandia Corporation, Kitware Inc.\\n\\n All rights reserved.\\n\\n\\n\\n ParaView is a free software; you can redistribute it and/or modify it\\n\\n under the terms of the ParaView license version 1.2.\\n\\n\\n\\n See License_v1.2.txt for the full ParaView license.\\n\\n A copy of this license can be obtained by contacting\\n\\n Kitware Inc.\\n\\n 28 Corporate Drive\\n\\n Clifton Park, NY 12065\\n\\n USA\\n\\n\\n\\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\",\n \"file_path\": \"Libraries/QtTestingSupport/pqQteDoubleSliderEventTranslator.h\",\n \"rank\": 4,\n \"score\": 47028.58388006288\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ParaView\\n\\n Module: pqQteDoubleSliderEventPlayer.h\\n\\n\\n\\n Copyright (c) 2005-2008 Sandia Corporation, Kitware Inc.\\n\\n All rights reserved.\\n\\n\\n\\n ParaView is a free software; you can redistribute it and/or modify it\\n\\n under the terms of the ParaView license version 1.2.\\n\\n\\n\\n See License_v1.2.txt for the full ParaView license.\\n\\n A copy of this license can be obtained by contacting\\n\\n Kitware Inc.\\n\\n 28 Corporate Drive\\n\\n Clifton Park, NY 12065\\n\\n USA\\n\\n\\n\\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\\n\\n``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\\n\",\n \"file_path\": \"Libraries/QtTestingSupport/pqQteDoubleSliderEventPlayer.h\",\n \"rank\": 5,\n \"score\": 47028.58388006288\n },\n {\n \"content\": \"class QDoubleSpinBox;\\n\",\n \"file_path\": \"Applications/VpView/vpGraphModelWidget.h\",\n \"rank\": 6,\n \"score\": 45921.49001921082\n },\n {\n \"content\": \"// Forward declarations.\\n\\nclass vtkInformationDoubleKey;\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgRepresentationBase.h\",\n \"rank\": 7,\n \"score\": 43869.385660511696\n },\n {\n \"content\": \" void SetToPoints(double x1, double y1,\\n\\n double x2, double y2,\\n\\n double x3, double y3,\\n\\n double x4, double y4);\\n\\n\\n\\n vtkSmartPointer<vtkMatrix4x4> GetHomographyMatrix();\\n\\n\\n\\nprotected:\\n\\n vtkVgCoordinateTransform();\\n\\n virtual ~vtkVgCoordinateTransform();\\n\\n\\n\\n double FromPoint[4][2];\\n\\n double ToPoint[4][2];\\n\\n\\n\\nprivate:\\n\\n vtkVgCoordinateTransform(const vtkVgCoordinateTransform&); // Not implemented.\\n\\n void operator=(const vtkVgCoordinateTransform&); // Not implemented.\\n\\n};\\n\\n\\n\\n#endif // __vtkVgCoordinateTransform_h\\n\",\n \"file_path\": \"Libraries/VtkVgQtSceneUtil/vtkVgCoordinateTransform.h\",\n \"rank\": 8,\n \"score\": 34.448571112913086\n },\n {\n \"content\": \" void SetForegroundColor(double color[3]);\\n\\n\\n\\n // Description:\\n\\n // Compute event time using node's position and timeline view\\n\\n vtkVgTimeStamp ComputeNodeStartTime(double x, double y, double z);\\n\\n\\n\\n // Description:\\n\\n // Return current layout extents\\n\\n void GetCurrentLayoutExtents(vgRange<double>& xext, vgRange<double>& yext);\\n\\n\\n\\nprotected:\\n\\n /// Add graph to the representation\\n\\n void AddGraph(vtkGraph* graph, const std::string& domain);\\n\\n\\n\\n vtkIdType PickNodes(double x1, double y1, double x2, double y2,\\n\\n vtkRenderer* ren);\\n\\n vtkIdType PickEdges(double x1, double y1, double x2, double y2,\\n\\n vtkRenderer* ren);\\n\\n\\n\\n /// Layout implementations\\n\",\n \"file_path\": \"Applications/VpView/vpMultiGraphRepresentation.h\",\n \"rank\": 9,\n \"score\": 22.593757139580898\n },\n {\n \"content\": \" void Initialize();\\n\\n\\n\\n /// Set the item on the representation.\\n\\n void SetGraphModel(vpMultiGraphModel* graphModel);\\n\\n vpMultiGraphModel* GetGraphModel() const;\\n\\n\\n\\n /// Update all the event actors. Generally called by the application layer.\\n\\n virtual void Update();\\n\\n\\n\\n /// Pick operation from display (i.e., pixel) coordinates in the current\\n\\n /// renderer. Return the picked eventId if a successful pick occurs,\\n\\n /// otherwise return -1. Note that the pick operation takes into account\\n\\n /// whether the event is currently visible or not.\\n\\n virtual vtkIdType Pick(double renX, double renY,\\n\\n vtkRenderer* ren, vtkIdType& pickType);\\n\\n\\n\\n // Pick within bounding rectangle\\n\\n vtkIdType Pick(double x1, double y1, double x2, double y2,\\n\\n vtkRenderer* ren, vtkIdType& pickType);\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpMultiGraphRepresentation.h\",\n \"rank\": 10,\n \"score\": 16.80161777830034\n },\n {\n \"content\": \"\\n\\n//-----------------------------------------------------------------------------\\n\\ntemplate <typename T>\\n\\nvoid vtkVgTypeRegistry<T>::PrintSelf(ostream& os, vtkIndent indent)\\n\\n{\\n\\n this->Superclass::PrintSelf(os, indent);\\n\\n\\n\\n os << indent << \\\"Types:\\\\n\\\";\\n\\n for (int i = 0, end = this->GetNumberOfTypes(); i < end; ++i)\\n\\n {\\n\\n os << indent << this->Types[i].GetName()\\n\\n << \\\" (\\\" << this->Types[i].GetId() << \\\")\\\\n\\\";\\n\\n }\\n\\n}\\n\\n\\n\\n//-----------------------------------------------------------------------------\\n\\ntemplate <typename T>\\n\\nint vtkVgTypeRegistry<T>::GetNumberOfTypes() const\\n\\n{\\n\\n return static_cast<int>(this->Types.size());\\n\",\n \"file_path\": \"Libraries/VtkVgCore/vtkVgTypeRegistry.h\",\n \"rank\": 11,\n \"score\": 16.001990666367565\n },\n {\n \"content\": \" DescriptorStyleGroup,\\n\\n UserType = 32\\n\\n };\\n\\n\\n\\n enum Column\\n\\n {\\n\\n Name = 0x1,\\n\\n Source = 0x2,\\n\\n TimeRange = 0x4,\\n\\n All = 0xf\\n\\n };\\n\\n Q_DECLARE_FLAGS(Columns, Column)\\n\\n\\n\\n explicit vvDescriptorInfoTree(QWidget* parent = 0);\\n\\n virtual ~vvDescriptorInfoTree();\\n\\n\\n\\n void setItemFactory(vvDescriptorInfoTreeItemFactory*);\\n\\n\\n\\n QHash<qint64, vvDescriptor> descriptors() const;\\n\\n QList<vvDescriptor> descriptors(QList<qint64>) const;\\n\",\n \"file_path\": \"Libraries/VvWidgets/vvDescriptorInfoTree.h\",\n \"rank\": 12,\n \"score\": 14.999139121120143\n },\n {\n \"content\": \" // Standard VTK functions.\\n\\n static vtkVgInteractorStyleRubberBand2D* New();\\n\\n vtkTypeMacro(vtkVgInteractorStyleRubberBand2D, vtkInteractorStyleRubberBand2D);\\n\\n\\n\\n virtual void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n // Description:\\n\\n // Constructor / Destructor.\\n\\n vtkVgInteractorStyleRubberBand2D();\\n\\n ~vtkVgInteractorStyleRubberBand2D();\\n\\n\\n\\n // Description:\\n\\n virtual void OnKeyPress();\\n\\n\\n\\n virtual void OnChar();\\n\\n\\n\\n // Description:\\n\\n // Overriding these functions to implement custom\\n\\n // interactions.\\n\\n virtual void OnLeftButtonDown();\\n\",\n \"file_path\": \"Libraries/VtkVgCore/vtkVgInteractorStyleRubberBand2D.h\",\n \"rank\": 13,\n \"score\": 13.635539950820226\n },\n {\n \"content\": \" void setTrackUpdateChunkSize(int frames)\\n\\n {\\n\\n this->TrackUpdateChunkSize = frames;\\n\\n }\\n\\n\\n\\n double getGeoDistance(double imagePt1[4], double imagePt2[4],\\n\\n double& latDist, double& lonDist);\\n\\n\\n\\n void setRealTimeVideoPlayback(bool enable);\\n\\n\\n\\n void setRulerEnabled(bool enable);\\n\\n\\n\\n void setColorWindow(double colorWindow);\\n\\n void setColorLevel(double colorLevel);\\n\\n\\n\\n void zoomIn();\\n\\n void zoomOut();\\n\\n\\n\\nprotected slots:\\n\\n void forceUpdate();\\n\",\n \"file_path\": \"Applications/VpView/vpViewCore.h\",\n \"rank\": 14,\n \"score\": 13.380631819952873\n },\n {\n \"content\": \" virtual void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n // Description:\\n\\n // Set/Get layout mode.\\n\\n void SetLayoutMode(int);\\n\\n vtkGetMacro(LayoutMode, int);\\n\\n\\n\\n // Description:\\n\\n // Set/Get blast flag that will move the children away from each other.\\n\\n vtkSetMacro(Blast, int);\\n\\n vtkGetMacro(Blast, int);\\n\\n vtkBooleanMacro(Blast, int);\\n\\n\\n\\n // Description:\\n\\n vtkSetMacro(Stack, int);\\n\\n vtkGetMacro(Stack, int);\\n\\n vtkBooleanMacro(Stack, int);\\n\\n\\n\\n // Description:\\n\\n vtkSetMacro(ZSort, int);\\n\",\n \"file_path\": \"Applications/Viqui/vtkVQBlastLayoutNode.h\",\n \"rank\": 15,\n \"score\": 12.649922627296885\n },\n {\n \"content\": \"\\n\\n static vtkVgNodeBase* New();\\n\\n\\n\\n virtual void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n // Description:\\n\\n // Set/Get name for the node.\\n\\n vtkSetStringMacro(Name);\\n\\n const char* GetName() const;\\n\\n\\n\\n // Description:\\n\\n // Set/Get visibility flag.\\n\\n virtual int SetVisible(int flag);\\n\\n vtkGetMacro(Visible, int);\\n\\n vtkBooleanMacro(Visible, int);\\n\\n\\n\\n // Description:\\n\\n // Flag that indicates is state of this node is dirty.\\n\\n vtkSetMacro(Dirty, int);\\n\\n vtkGetMacro(Dirty, int);\\n\",\n \"file_path\": \"Libraries/VtkVgSceneGraph/vtkVgNodeBase.h\",\n \"rank\": 16,\n \"score\": 11.865292925966534\n },\n {\n \"content\": \" // Standard VTK functions.\\n\\n static vtkVgEventBase* New();\\n\\n vtkTypeMacro(vtkVgEventBase, vtkObject);\\n\\n virtual void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n // Description:\\n\\n // Set/Get the points used for the \\\"region\\\" that may or may not be present at\\n\\n // frames during the event.\\n\\n vtkGetObjectMacro(RegionPoints, vtkPoints);\\n\\n void SetRegionPoints(vtkPoints* points);\\n\\n\\n\\n void AddRegion(const vtkVgTimeStamp& timeStamp,\\n\\n vtkIdType numberOfRegionPts, double* regionPts);\\n\\n void SetRegion(const vtkVgTimeStamp& timeStamp,\\n\\n vtkIdType numberOfRegionPts, double* regionPts);\\n\\n void GetRegion(const vtkVgTimeStamp& timeStamp,\\n\\n vtkIdType& npts, vtkIdType*& pts);\\n\\n bool GetRegionCenter(const vtkVgTimeStamp& timeStamp, double* center,\\n\\n bool interpolated);\\n\\n bool GetRegionAtOrAfter(vtkVgTimeStamp& timeStamp,\\n\",\n \"file_path\": \"Libraries/VtkVgCore/vtkVgEventBase.h\",\n \"rank\": 17,\n \"score\": 11.665720840866214\n },\n {\n \"content\": \" virtual void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n static vtkVgGraphRepresentation* New();\\n\\n\\n\\n static std::string GetGraphEdgeColorModeString(int mode);\\n\\n static std::string GetGraphEdgeThicknessModeString(int mode);\\n\\n\\n\\n // Description:\\n\\n // Return all the objects that can be rendered.\\n\\n virtual const vtkPropCollection* GetNewRenderObjects() const;\\n\\n virtual const vtkPropCollection* GetActiveRenderObjects() const;\\n\\n virtual const vtkPropCollection* GetExpiredRenderObjects() const;\\n\\n\\n\\n virtual vtkPropCollection* GetNewRenderObjects();\\n\\n virtual vtkPropCollection* GetActiveRenderObjects();\\n\\n virtual vtkPropCollection* GetExpiredRenderObjects();\\n\\n\\n\\n virtual void ResetTemporaryRenderObjects();\\n\\n\\n\\n // Description:\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgGraphRepresentation.h\",\n \"rank\": 18,\n \"score\": 11.488903062739977\n },\n {\n \"content\": \" vtkVgClassMacro(vqArchiveVideoSource);\\n\\n\\n\\n // Description:\\n\\n // Usual VTK functions.\\n\\n vtkTypeMacro(vqArchiveVideoSource, vtkVgVideoProviderBase);\\n\\n\\n\\n static vqArchiveVideoSource* New();\\n\\n\\n\\n virtual void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n // Description:\\n\\n // Get and store a clip from a given ::vgKwaArchive.\\n\\n int AcquireVideoClip(vgKwaArchive* videoArchive);\\n\\n\\n\\n // Description:\\n\\n // Get and store a clip from a given URI.\\n\\n int AcquireVideoClip(QUrl);\\n\\n\\n\\n QUrl GetClipUri() const\\n\\n {\\n\",\n \"file_path\": \"Applications/Viqui/vqArchiveVideoSource.h\",\n \"rank\": 19,\n \"score\": 11.414732227910331\n },\n {\n \"content\": \" virtual void GetPickPosition(double pos[3])\\n\\n {\\n\\n pos[0] = VTK_DOUBLE_MIN;\\n\\n pos[1] = VTK_DOUBLE_MIN;\\n\\n pos[2] = VTK_DOUBLE_MIN;\\n\\n }\\n\\n\\n\\n // Description:\\n\\n // Color value modifier.\\n\\n vtkSetClampMacro(ColorMultiplier, double, 0.0, 1.0);\\n\\n vtkGetMacro(ColorMultiplier, double);\\n\\n\\n\\n // Description:\\n\\n // Force the representation to display all objects in a single color\\n\\n void SetOverrideColor(const double color[3]);\\n\\n\\n\\n // Description:\\n\\n // Set the display mask that this representation will use.\\n\\n vtkSetMacro(DisplayMask, unsigned);\\n\\n vtkGetMacro(DisplayMask, unsigned);\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgRepresentationBase.h\",\n \"rank\": 20,\n \"score\": 9.985177593376621\n },\n {\n \"content\": \"\\n\\nsignals:\\n\\n void invalidateHomographyCaching();\\n\\n\\n\\nprivate slots:\\n\\n void updateXMin();\\n\\n void updateYMin();\\n\\n void updateBox();\\n\\n void bundleCropSelect();\\n\\n void cropSelect();\\n\\n void disable();\\n\\n void frameChanged();\\n\\n void runBundleAdjustment();\\n\\n void onBundleSelectionComplete();\\n\\n void onSelectionComplete();\\n\\n void onRunClicked();\\n\\n void updateNumImages();\\n\\n void cacheHomographies(std::string, std::vector<vgl_h_matrix_2d<double> >);\\n\\n void imageIncludeChanged(bool);\\n\\n void onImageListSelection();\\n\",\n \"file_path\": \"Applications/VpView/vpSuperResWidget.h\",\n \"rank\": 21,\n \"score\": 9.950457021432785\n },\n {\n \"content\": \" // Return whether or not this timestamp set to max time\\n\\n bool IsMaxTime() const\\n\\n {\\n\\n return this->Time == VTK_DOUBLE_MAX;\\n\\n }\\n\\n\\n\\n void SetToMinTime()\\n\\n {\\n\\n this->Time = VTK_DOUBLE_MIN;\\n\\n }\\n\\n bool IsMinTime() const\\n\\n {\\n\\n return this->Time == VTK_DOUBLE_MIN;\\n\\n }\\n\\n\\n\\n // Description:\\n\\n // Returns true if this contains time, otherwise false.\\n\\n bool HasTime() const\\n\\n {\\n\\n return vgTimeStamp::HasTime();\\n\",\n \"file_path\": \"Libraries/VtkVgCore/vtkVgTimeStamp.h\",\n \"rank\": 22,\n \"score\": 9.82765847535285\n },\n {\n \"content\": \" JSONNode exportToJson();\\n\\n\\n\\n void saveState(JSONNode& root);\\n\\n\\n\\n void getWorldViewport(double (&viewport)[4], double offX, double offY);\\n\\n\\n\\n void setParameterValue(double value, QDoubleSpinBox* widget);\\n\\n\\n\\nprotected slots:\\n\\n void enableCreateNode(bool flag);\\n\\n void enableCreateEdge(bool flag);\\n\\n\\n\\n void createNode(double x, double y);\\n\\n void createNodeSpatial(double x, double y);\\n\\n\\n\\n void createEdge();\\n\\n void createEdge(int parentId, int childId);\\n\\n\\n\\n void removeNodes();\\n\\n void removeEdges();\\n\",\n \"file_path\": \"Applications/VpView/vpGraphModelWidget.h\",\n \"rank\": 23,\n \"score\": 9.77597631571686\n },\n {\n \"content\": \" // reimplemented from QWidget\\n\\n virtual void contextMenuEvent(QContextMenuEvent* event);\\n\\n virtual void leaveEvent(QEvent* event);\\n\\n\\n\\n virtual void mousePressEvent(QMouseEvent* event);\\n\\n virtual void mouseDoubleClickEvent(QMouseEvent* event);\\n\\n\\n\\n virtual QSize sizeHint() const\\n\\n { return QSize(500, 300); }\\n\\n\\n\\n virtual QSize minimumSizeHint() const\\n\\n { return QSize(300, 200); }\\n\\n\\n\\nsignals:\\n\\n void NodesSelected(QList<vtkVgNodeBase*> nodes);\\n\\n void NodeActivated(vtkVgNodeBase& node);\\n\\n void MouseLeft();\\n\\n void ContextMenuOpened(QMenu& menu);\\n\\n void ItemsChanged();\\n\\n\\n\",\n \"file_path\": \"Applications/Viqui/vqTreeView.h\",\n \"rank\": 24,\n \"score\": 9.299507612838244\n },\n {\n \"content\": \" {\\n\\n return vgTimeStamp::IsValid();\\n\\n }\\n\\n\\n\\n // Description:\\n\\n // Reset to initialized state (no time or frame #)\\n\\n void Reset()\\n\\n {\\n\\n this->Time = vgTimeStamp::InvalidTime();\\n\\n this->FrameNumber = vgTimeStamp::InvalidFrameNumber();\\n\\n }\\n\\n\\n\\n // Description:\\n\\n // Set time to large value, any comparison (frame or time), will have this\\n\\n // timestamp grater than other, unless both at max time\\n\\n void SetToMaxTime()\\n\\n {\\n\\n this->Time = VTK_DOUBLE_MAX;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Libraries/VtkVgCore/vtkVgTimeStamp.h\",\n \"rank\": 25,\n \"score\": 8.859933844224127\n },\n {\n \"content\": \" QList<vvDescriptor> descriptors(QList<QTreeWidgetItem*>,\\n\\n bool includeChildren = false) const;\\n\\n QList<qint64> descriptorIds(QList<QTreeWidgetItem*>,\\n\\n bool includeChildren = false) const;\\n\\n\\n\\n QTreeWidgetItem* findItem(int type, qint64 id, QTreeWidgetItem* from = 0);\\n\\n QList<QTreeWidgetItem*> findItems(int type, qint64 id = -1);\\n\\n\\n\\n QList<QTreeWidgetItem*> descriptorItems(qint64 id = -1);\\n\\n\\n\\n bool groupByStyle() const;\\n\\n void setStyleMap(vvDescriptorStyle::Map);\\n\\n void setColumns(Columns columns, bool setHeaders = true);\\n\\n\\n\\n static qint64 itemId(const QTreeWidgetItem*, bool* isValid = 0);\\n\\n static int itemType(const QTreeWidgetItem*);\\n\\n static void setItemId(QTreeWidgetItem*, qint64);\\n\\n static void setItemType(QTreeWidgetItem*, int);\\n\\n\\n\\nsignals:\\n\",\n \"file_path\": \"Libraries/VvWidgets/vvDescriptorInfoTree.h\",\n \"rank\": 26,\n \"score\": 8.644709528409464\n },\n {\n \"content\": \" Unknown = 0x0,\\n\\n Person = 0x1,\\n\\n Vehicle = 0x2,\\n\\n Classifier = 0xf,\\n\\n Alert = 0x10,\\n\\n General = 0x20,\\n\\n User = 0x80,\\n\\n NonUser = 0x7f,\\n\\n All = 0xff\\n\\n };\\n\\n Q_DECLARE_FLAGS(Groups, Group)\\n\\n\\n\\n enum Type\\n\\n {\\n\\n Tripwire = -3000,\\n\\n EnteringRegion = -3001,\\n\\n ExitingRegion = -3002,\\n\\n Annotation = -4000,\\n\\n // NOTE: -5000 - -5??? reserved by vsTrackInfo\\n\\n QueryAlert = -10000,\\n\",\n \"file_path\": \"Libraries/VspData/vsEventInfo.h\",\n \"rank\": 27,\n \"score\": 8.618245977601738\n },\n {\n \"content\": \"\\n\\nprivate:\\n\\n void completeSelection(bool isBundleCrop);\\n\\n\\n\\n void readSuperResParams(super3d::super_res_params::TV_METHOD method,\\n\\n super3d::super_res_params* srp,\\n\\n double regularizationScale);\\n\\n void updateImageInclusion();\\n\\n QListWidgetItem* buildImageIncludeList(int currentFrame);\\n\\n\\n\\n void loadImagery(std::vector<std::string>& filenames);\\n\\n\\n\\n void updateHomographyReferenceFrameAndCamera(int newReferenceFrame);\\n\\n\\n\\n Ui::vpSuperResWidget* Ui;\\n\\n\\n\\n vpViewCore* ViewCoreInstance;\\n\\n vtkSmartPointer<vtkActor> CropRegionActor;\\n\\n vtkSmartPointer<vtkPoints> CropRegionPoints;\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpSuperResWidget.h\",\n \"rank\": 28,\n \"score\": 8.566315224003235\n },\n {\n \"content\": \"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\\n\\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\\n\\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\\n\\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\\n\\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\\n\\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\\n\\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\\n\\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef _pqVgMixerEventPlayer_h\\n\\n#define _pqVgMixerEventPlayer_h\\n\\n\\n\\n#include <pqWidgetEventPlayer.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n/**\\n\\nConcrete implementation of pqWidgetEventPlayer that handles playback of recorded qtDoubleSlider user input.\\n\\n\\n\\n\\\\sa pqEventPlayer\\n\\n*/\\n\",\n \"file_path\": \"Libraries/QtTestingSupport/pqVgMixerEventPlayer.h\",\n \"rank\": 29,\n \"score\": 8.492154948953871\n },\n {\n \"content\": \"LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\\n\\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR\\n\\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\\n\\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\\n\\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\\n\\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\\n\\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\\n\\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\\n\\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef _pqQDialogButtonBoxEventPlayer_h\\n\\n#define _pqQDialogButtonBoxEventPlayer_h\\n\\n\\n\\n#include <pqWidgetEventPlayer.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n/**\\n\\nConcrete implementation of pqWidgetEventPlayer that handles playback of recorded qtDoubleSlider user input.\\n\\n\\n\\n\\\\sa pqEventPlayer\\n\\n*/\\n\",\n \"file_path\": \"Libraries/QtTestingSupport/pqQDialogButtonBoxEventPlayer.h\",\n \"rank\": 30,\n \"score\": 8.383710116096665\n },\n {\n \"content\": \" // Main \\\"execute\\\" function to check the status of all \\\"trip wires\\\" relative\\n\\n // to the tracks in the track model.\\n\\n void CheckTripWires();\\n\\n\\n\\n // Description:\\n\\n // Check the specified trip-wire for interesections against all tracks in the\\n\\n // TrackModel.\\n\\n void CheckTripWire(vtkIdType tripWireId, std::vector<IntersectionInfo>& intersections);\\n\\n\\n\\n // Description:\\n\\n //int ClassifierType, // Entering, Exiting, or TripWire\\n\\n //double IntersectionPt[2], // x, y of intersection\\n\\n //vtkVgTimeStamp &IntersectionTime); // Interpolated \\\"Time\\\" at IntersectionPt\\n\\n void CheckTrackSegment(double pt1[2], double p2[2],\\n\\n const vtkVgTimeStamp& timeStamp1, const vtkVgTimeStamp& timeStamp2,\\n\\n std::vector<IntersectionInfo>& intersections);\\n\\n\\n\\n // Description:\\n\\n // Make sure the event model is up to date regarding detected trip wire events\\n\\n void UpdateEventModel(const vtkVgTimeStamp& timestamp);\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgTripWireManager.h\",\n \"rank\": 31,\n \"score\": 7.947797523054908\n },\n {\n \"content\": \" // Description:\\n\\n // Set if the label should include the classifier score\\n\\n vtkSetMacro(ShowProbability, bool);\\n\\n vtkGetMacro(ShowProbability, bool);\\n\\n\\n\\n // Description:\\n\\n // Set if the label should include the event note\\n\\n vtkSetMacro(ShowNote, bool);\\n\\n vtkGetMacro(ShowNote, bool);\\n\\n\\n\\n // Description:\\n\\n // Update all the event actors. Generally called by the application layer.\\n\\n virtual void Update();\\n\\n\\n\\n // Description:\\n\\n // Set/Get prefix to add to the label\\n\\n vtkSetStringMacro(LabelPrefix);\\n\\n vtkGetStringMacro(LabelPrefix);\\n\\n\\n\\n enum enumLocationSourceMode\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgEventLabelRepresentation.h\",\n \"rank\": 32,\n \"score\": 7.911716592730486\n },\n {\n \"content\": \" // Get the units of the stored data\\n\\n // Return false if type is not ASCII\\n\\n std::string& GetUnits(void);\\n\\n\\n\\nprotected:\\n\\n ~vtkVgNitfEngrdaElement(void);\\n\\n\\n\\nprivate:\\n\\n friend class vtkVgNitfEngrda;\\n\\n\\n\\n std::string Label;\\n\\n size_t MatrixColumnCount;\\n\\n size_t MatrixRowCount;\\n\\n char Type;\\n\\n size_t DataTypeSize;\\n\\n std::string DataUnits;\\n\\n size_t DataCount;\\n\\n\\n\\n // FIXME: Extend for other data types\\n\\n union\\n\\n {\\n\\n char* Data;\\n\\n int DataInt;\\n\\n float DataFloat;\\n\\n double DataDouble;\\n\\n };\\n\\n};\\n\\ntypedef vtkSmartPointer<vtkVgNitfEngrdaElement> vtkVgNitfEngrdaElementRefPtr;\\n\\n\\n\",\n \"file_path\": \"Libraries/VtkVgIO/vtkVgNitfEngrda.h\",\n \"rank\": 33,\n \"score\": 7.688312535232902\n },\n {\n \"content\": \"\\n\\n /// Location of application user manual.\\n\\n ///\\n\\n /// This specifies the file name or location of the application's user\\n\\n /// manual.\\n\\n ///\\n\\n /// \\\\sa userManualLocation(), setUserManualLocation()\\n\\n Q_PROPERTY(QString userManualLocation READ userManualLocation\\n\\n WRITE setUserManualLocation)\\n\\n\\n\\npublic:\\n\\n enum HelpMenuEntry\\n\\n {\\n\\n UserManualAction = 0x1,\\n\\n AboutAction = 0x2,\\n\\n FullHelpMenu = 0xff\\n\\n };\\n\\n Q_DECLARE_FLAGS(HelpMenuEntries, HelpMenuEntry);\\n\\n\\n\\npublic:\\n\",\n \"file_path\": \"Libraries/QtVgWidgets/vgApplication.h\",\n \"rank\": 34,\n \"score\": 7.587753881368895\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n// The size of this class is kept small (sizeof(void*)) so that it can be\\n\\n// efficiently passed by value and inserted into \\\"inline\\\" data structures\\n\\n// with minimal overhead.\\n\\n\\n\\n#ifndef __vtkVgEventInfo_h\\n\\n#define __vtkVgEventInfo_h\\n\\n\\n\\n#include \\\"vgPointerInt.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgEventInfo.h\",\n \"rank\": 35,\n \"score\": 7.321421848546459\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n// The size of this class is kept small (sizeof(void*)) so that it can be\\n\\n// efficiently passed by value and inserted into \\\"inline\\\" data structures\\n\\n// with minimal overhead.\\n\\n\\n\\n#ifndef __vtkVgTrackInfo_h\\n\\n#define __vtkVgTrackInfo_h\\n\\n\\n\\n#include \\\"vgPointerInt.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgTrackInfo.h\",\n \"rank\": 36,\n \"score\": 7.321421848546459\n },\n {\n \"content\": \"\\n\\n /// Set location of application user manual.\\n\\n ///\\n\\n /// This method will resolve non-absolute paths so that the stored value is\\n\\n /// always a complete absolute path. If a name without path is given\\n\\n /// (recommended), the user manual is assumed to be in a well known relative\\n\\n /// location with respect to the location of the application executable.\\n\\n ///\\n\\n /// The result of specifying a relative path is not specified.\\n\\n ///\\n\\n /// \\\\sa userManualLocation, userManualLocation()\\n\\n static void setUserManualLocation(const QString&);\\n\\n\\n\\n /// Create standard help menu actions.\\n\\n ///\\n\\n /// This creates the specified standard actions in the application's Help\\n\\n /// menu. This includes activation slots for the actions, i.e. the actions\\n\\n /// will function with no additional setup required.\\n\\n static void setupHelpMenu(QMenu*, HelpMenuEntries = FullHelpMenu);\\n\\n\\n\",\n \"file_path\": \"Libraries/QtVgWidgets/vgApplication.h\",\n \"rank\": 37,\n \"score\": 7.221286248548754\n },\n {\n \"content\": \"// Qt includes\\n\\n#include <QDebug>\\n\\n#include <QMouseEvent>\\n\\n#include <QKeyEvent>\\n\\n#include <QStyleOptionSlider>\\n\\n#include <QApplication>\\n\\n#include <QStylePainter>\\n\\n#include <QStyle>\\n\\n\\n\\n// CTK includes\\n\\n#include \\\"ctkRangeSlider.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/QtVgWidgets/ctkRangeSlider.cpp\",\n \"rank\": 38,\n \"score\": 6.670564795996662\n },\n {\n \"content\": \"#include <vtkVgVideoFrameMetaData.h>\\n\\n\\n\\n#include <vsDataSource.h>\\n\\n#include <vsDescriptor.h>\\n\\n#include <vsDescriptorInput.h>\\n\\n#include <vsEvent.h>\\n\\n#include <vsEventInfo.h>\\n\\n#include <vsSourceFactory.h>\\n\\n#include <vsTrackClassifier.h>\\n\\n#include <vsTrackData.h>\\n\\n#include <vsTrackId.h>\\n\\n\\n\\n#include \\\"vsAlert.h\\\"\\n\\n#include \\\"vsContourWidget.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsCore.h\",\n \"rank\": 39,\n \"score\": 6.657661853624339\n },\n {\n \"content\": \"#include <qtStatusSource.h>\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// VISGUI includes\\n\\n#include <vtkVgTimeStamp.h>\\n\\n#include <vvQueryFormulation.h>\\n\\n#include <vvQueryInstance.h>\\n\\n#include <vvQueryResult.h>\\n\\n\\n\\n// Viqui includes\\n\\n#include \\\"vqResultFilter.h\\\"\\n\\n#include \\\"vtkVQBlastLayoutNode.h\\\"\\n\\n\\n\\n// Forward declarations.\\n\",\n \"file_path\": \"Applications/Viqui/vqCore.h\",\n \"rank\": 40,\n \"score\": 6.650212947833601\n },\n {\n \"content\": \"\\n\\n // Description:\\n\\n virtual void SetVisible(int flag);\\n\\n virtual int GetVisible() const { return this->Visible; }\\n\\n\\n\\n virtual vtkIdType Pick(double renX,\\n\\n double renY,\\n\\n vtkRenderer* ren,\\n\\n vtkIdType& pickType);\\n\\n\\n\\n // Description:\\n\\n // Set if the label should include the event ID\\n\\n vtkSetMacro(ShowId, bool);\\n\\n vtkGetMacro(ShowId, bool);\\n\\n\\n\\n // Description:\\n\\n // Set how many classifiers (max) the label should show\\n\\n vtkSetMacro(ShowClassifiers, unsigned int);\\n\\n vtkGetMacro(ShowClassifiers, unsigned int);\\n\\n\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgEventLabelRepresentation.h\",\n \"rank\": 41,\n \"score\": 6.630969459829236\n },\n {\n \"content\": \"#include <vtkVgTrack.h>\\n\\n#include <vtkVgTrackModel.h>\\n\\n#include <vtkVgTrackRepresentation.h>\\n\\n#include <vtkVgVideoMetadata.h>\\n\\n#include <vtkVgVideoModel0.h>\\n\\n#include <vtkVgVideoNode.h>\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkIdList.h>\\n\\n#include <vtkPoints.h>\\n\\n\\n\\n#include \\\"vvVideoPlayerPrivate.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvQueryVideoPlayerPrivate.h\",\n \"rank\": 42,\n \"score\": 6.605069748001375\n },\n {\n \"content\": \"\\n\\n#include <qtGlobal.h>\\n\\n\\n\\n#include <QThread>\\n\\n\\n\\n#include <boost/shared_ptr.hpp>\\n\\n\\n\\n#include <fstream>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpSuperResDepthWarper.h\",\n \"rank\": 43,\n \"score\": 6.588558531823017\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n// Qt includes\\n\\n#include <QFileInfo>\\n\\n#include <QHash>\\n\\n#include <QMap>\\n\\n#include <QMultiHash>\\n\\n\\n\\n// QtExtensions includes\\n\\n#include <qtUtil.h>\\n\\n\\n\\n// visgui includes\\n\\n#include <vtkVgAdapt.h>\\n\\n#include <vtkVgCompositeEventRepresentation.h>\\n\\n#include <vtkVgEvent.h>\\n\\n#include <vtkVgEventModel.h>\\n\\n#include <vtkVgEventRegionRepresentation.h>\\n\\n#include <vtkVgTimeStamp.h>\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvQueryVideoPlayerPrivate.h\",\n \"rank\": 44,\n \"score\": 6.5660724841074956\n },\n {\n \"content\": \"// visgui includes\\n\\n#include <vgFileDialog.h>\\n\\n\\n\\n// VTK Extensions includes\\n\\n#include <vtkVgEvent.h>\\n\\n#include <vtkVgEventRegionRepresentation.h>\\n\\n#include <vtkVgRegionWidget.h>\\n\\n\\n\\n#include <vvDescriptorInfoTree.h>\\n\\n\\n\\n#include \\\"vvQueryVideoPlayer.h\\\"\\n\\n\\n\\nnamespace // anonymous\\n\\n{\\n\\n\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvVideoQueryDialogPrivate.h\",\n \"rank\": 45,\n \"score\": 6.545363834579607\n },\n {\n \"content\": \"#include <qtGlobal.h>\\n\\n\\n\\n// Qt includes\\n\\n#include <QDialog>\\n\\n#include <QCloseEvent>\\n\\n\\n\\n// boost includes\\n\\n#include <boost/shared_ptr.hpp>\\n\\n\\n\\n// Forward declarations.\\n\",\n \"file_path\": \"Applications/VpView/vpSuperResDepthViewer.h\",\n \"rank\": 46,\n \"score\": 6.541104168067802\n },\n {\n \"content\": \"#include <QSharedPointer>\\n\\n#include <QString>\\n\\n#include <QStringList>\\n\\n\\n\\n#include <map>\\n\\n#include <memory>\\n\\n#include <vector>\\n\\n\\n\\nnamespace kwiver\\n\\n{\\n\\nnamespace vital\\n\\n{\\n\",\n \"file_path\": \"Applications/VpView/vpViewCore.h\",\n \"rank\": 47,\n \"score\": 6.541104168067802\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vqCore_h\\n\\n#define __vqCore_h\\n\\n\\n\\n// Qt includes\\n\\n#include <QVTKWidget.h>\\n\\n#include <QBasicTimer>\\n\\n#include <QString>\\n\\n#include <QList>\\n\\n#include <QHash>\\n\\n#include <QMultiMap>\\n\\n#include <QSet>\\n\\n#include <QSharedPointer>\\n\\n#include <QUrl>\\n\\n\\n\\n// QtExtensions includes\\n\\n#include <qtGradient.h>\\n\",\n \"file_path\": \"Applications/Viqui/vqCore.h\",\n \"rank\": 48,\n \"score\": 6.537841442116962\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#include \\\"vvVideoQueryDialog.h\\\"\\n\\n#include \\\"ui_videoQuery.h\\\"\\n\\n\\n\\n#include <QDebug>\\n\\n#include <QLabel>\\n\\n#include <QMessageBox>\\n\\n#include <QProgressBar>\\n\\n#include <QSettings>\\n\\n\\n\\n// Qt Extensions includes\\n\\n#include <qtScopedValueChange.h>\\n\\n#include <qtStatusManager.h>\\n\\n#include <qtUtil.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvVideoQueryDialogPrivate.h\",\n \"rank\": 49,\n \"score\": 6.537841442116962\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpSuperResViewer_h\\n\\n#define __vpSuperResViewer_h\\n\\n\\n\\n// super3d includes\\n\\n#include <super3d/depth/super_res.h>\\n\\n\\n\\n// vidtk includes\\n\\n#include <video_transforms/super_res.h>\\n\\n\\n\\n// vxl includes\\n\\n#include <vil/vil_image_view.h>\\n\\n#include <vgl/algo/vgl_h_matrix_2d.h>\\n\\n\\n\\n// vtk includes\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// Qt includes\\n\\n#include <QDialog>\\n\\n#include <QCloseEvent>\\n\\n\\n\\n// boost includes\\n\\n#include <boost/shared_ptr.hpp>\\n\\n\\n\\n// Forward declarations.\\n\",\n \"file_path\": \"Applications/VpView/vpSuperResViewer.h\",\n \"rank\": 50,\n \"score\": 6.535695361895864\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsScene_h\\n\\n#define __vsScene_h\\n\\n\\n\\n#include \\\"vsAlert.h\\\"\\n\\n\\n\\n#include <vsContour.h>\\n\\n#include <vsEventInfo.h>\\n\\n#include <vsVideoSource.h>\\n\\n\\n\\n#include <vgfItemReference.h>\\n\\n\\n\\n#include <vgVideoPlayer.h>\\n\\n#include <vgVtkVideoFrame.h>\\n\\n\\n\\n#include <vtkVgTrackRepresentationBase.h>\\n\\n\\n\\n#include <vgMatrix.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n#include <qtGlobal.h>\\n\\n\\n\\n#include <QColor>\\n\\n#include <QObject>\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsScene.h\",\n \"rank\": 51,\n \"score\": 6.525846240936778\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsScenePrivate_h\\n\\n#define __vsScenePrivate_h\\n\\n\\n\\n#include <vsEventInfo.h>\\n\\n\\n\\n#include <vgVideoPlayer.h>\\n\\n\\n\\n#include <vtkVgInstance.h>\\n\\n#include <vtkVgTimeStamp.h>\\n\\n\\n\\n#include <vgColor.h>\\n\\n#include <vgMatrix.h>\\n\\n\\n\\n#include <vtkSmartPointer.h>\\n\\n#include <vtkTimeStamp.h>\\n\\n\\n\\n#include <QHash>\\n\\n#include <QMap>\\n\\n#include <QPoint>\\n\\n#include <QSet>\\n\\n#include <QSharedPointer>\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsScenePrivate.h\",\n \"rank\": 52,\n \"score\": 6.520439988420708\n },\n {\n \"content\": \" void ItemsChanged();\\n\\n\\n\\npublic slots:\\n\\n void FocusItemAlone();\\n\\n void FocusItem();\\n\\n\\n\\nprotected slots:\\n\\n void OnTreeSelectionChanged();\\n\\n void OnTreeContextMenu(QMenu& menu);\\n\\n void CreateEvent(int type);\\n\\n void DeleteEvent();\\n\\n void EditTrack();\\n\\n void StopEditingTrack();\\n\\n void DeleteTrack();\\n\\n void SplitTrack();\\n\\n void ImproveTrack();\\n\\n void AddEventToActivity();\\n\\n void RemoveEventFromActivity();\\n\\n\\n\\n void SetEventStatus(int status);\\n\",\n \"file_path\": \"Applications/VpView/vpObjectSelectionPanel.h\",\n \"rank\": 53,\n \"score\": 6.516964981642532\n },\n {\n \"content\": \" void update();\\n\\n void postRender();\\n\\n\\n\\n void onLeftClick();\\n\\n void onRightButtonPress();\\n\\n void onRightButtonRelease();\\n\\n void onMouseWheelForward();\\n\\n void onMouseWheelBackward();\\n\\n void onPKeyPress();\\n\\n\\n\\n void onContextMenuEvent();\\n\\n\\n\\n void addRasterLayer(QUrl uri);\\n\\n\\n\\n void drawRegion();\\n\\n void setRegion(vgGeocodedPoly region);\\n\\n\\n\\n void updateScene();\\n\\n void updateSources();\\n\\n void updateLOD(bool override = false);\\n\",\n \"file_path\": \"Applications/Viqui/vqCore.h\",\n \"rank\": 54,\n \"score\": 6.512168617858049\n },\n {\n \"content\": \"\\n\\n void AddEventsToGraphModel();\\n\\n void AddTrackEventsToGraphModel();\\n\\n\\n\\npublic slots:\\n\\n void ShowAll();\\n\\n void HideAll();\\n\\n\\n\\n void SortBy(int type, Qt::SortOrder direction);\\n\\n\\n\\n void ShowAllTracks();\\n\\n void HideAllTracks();\\n\\n\\n\\n void ShowEventType(int type);\\n\\n void ShowAllEvents();\\n\\n void HideAllEvents();\\n\\n\\n\\n void ShowActivityType(int type);\\n\\n void ShowAllActivities();\\n\\n void HideAllActivities();\\n\",\n \"file_path\": \"Applications/VpView/vpTreeView.h\",\n \"rank\": 55,\n \"score\": 6.503739956062841\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vqArchiveVideoSource_h\\n\\n#define __vqArchiveVideoSource_h\\n\\n\\n\\n// VG includes.\\n\\n#include <vtkVgMacros.h>\\n\\n#include <vtkVgVideoProviderBase.h>\\n\\n\\n\\n// VV includes.\\n\\n#include <vvIqr.h>\\n\\n\\n\\n// STL includes.\\n\\n#include <vector>\\n\\n\\n\\n// QT includes.\\n\\n#include <QObject>\\n\\n#include <QSharedPointer>\\n\\n#include <QUrl>\\n\\n\\n\",\n \"file_path\": \"Applications/Viqui/vqArchiveVideoSource.h\",\n \"rank\": 56,\n \"score\": 6.49456964884962\n },\n {\n \"content\": \"\\n\\n void onVideoPlaying();\\n\\n void onVideoPaused();\\n\\n void onVideoStopped();\\n\\n\\n\\n void onLeftButtonClicked();\\n\\n\\n\\n void reset();\\n\\n\\n\\n void resetView();\\n\\n\\n\\n void seekTo(double value);\\n\\n\\n\\n void setEventRegionVisible(bool);\\n\\n void setEventFollowingEnabled(bool);\\n\\n void setPlaybackEnabled(bool);\\n\\n\\n\\n void doubleThePlaybackSpeed();\\n\\n void reducePlaybackSpeedByHalf();\\n\\n\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvVideoPlayer.h\",\n \"rank\": 57,\n \"score\": 6.486573204805329\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpProject_h\\n\\n#define __vpProject_h\\n\\n\\n\\n#include \\\"vpProjectBase.h\\\"\\n\\n\\n\\n#include <vgAttributeSet.h>\\n\\n\\n\\n#include <qtGlobal.h>\\n\\n\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n#include <QHash>\\n\\n#include <QSharedPointer>\\n\\n\\n\\n#include <string>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n#include <algorithm>\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpProject.h\",\n \"rank\": 58,\n \"score\": 6.484802051404319\n },\n {\n \"content\": \" void onOverviewLoaded();\\n\\n void onEnterAdjudicationMode();\\n\\n void onFollowTrackChange(int trackId);\\n\\n void onExitFollowTrack();\\n\\n void toggleAdjudicationMode(bool state);\\n\\n void exitApp();\\n\\n void onFrameChange();\\n\\n void onTimeChange(double now);\\n\\n void onReachedPlayBoundary();\\n\\n void onFastBackward();\\n\\n void onReversePause();\\n\\n void onPause();\\n\\n void onPlayPause();\\n\\n void onFastForward();\\n\\n void onLoopToggle(bool state);\\n\\n void onFrameUpdate(int minFrameNumber, int frameNumber, bool resize);\\n\\n void onTimeUpdate(double minTime, double time, bool resize);\\n\\n void updateMinTime(double time);\\n\\n void onFrameIntervalEnabled(int state);\\n\\n void onTreeSelectionChanged(int sessionId);\\n\",\n \"file_path\": \"Applications/VpView/vpView.h\",\n \"rank\": 59,\n \"score\": 6.479319355837096\n },\n {\n \"content\": \" void forceRender();\\n\\n\\n\\n void reactToDataChanged();\\n\\n\\n\\n void reactToExternalProcessFileChanged(QString);\\n\\n\\n\\nsignals:\\n\\n\\n\\n void dataLoaded();\\n\\n void dataSetChanged();\\n\\n void iconsLoaded();\\n\\n void overviewLoaded();\\n\\n void followTrackChange(int trackId);\\n\\n\\n\\n void trackTypesModified();\\n\\n\\n\\n void displayZoom();\\n\\n void frameChanged();\\n\\n void frameChanged(const QString&);\\n\\n void timeChanged(double microseconds);\\n\",\n \"file_path\": \"Applications/VpView/vpViewCore.h\",\n \"rank\": 60,\n \"score\": 6.476276980871496\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vvQueryVideoPlayer_h\\n\\n#define __vvQueryVideoPlayer_h\\n\\n\\n\\n#include \\\"vvVideoPlayer.h\\\"\\n\\n\\n\\n#include <QHash>\\n\\n#include <QList>\\n\\n#include <QSet>\\n\\n#include <QSharedPointer>\\n\\n#include <QUrl>\\n\\n\\n\\n#include <vtkType.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n#include <vtkVgTrack.h>\\n\\n\\n\\n#include <vvQuery.h>\\n\\n\\n\\n#include \\\"vgRegionKeyframe.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvQueryVideoPlayer.h\",\n \"rank\": 61,\n \"score\": 6.469334652730426\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vtkVgTrack_h\\n\\n#define __vtkVgTrack_h\\n\\n\\n\\n#include <vtkObject.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n#include <vtkDenseArray.h>\\n\\n#include <vtkBoundingBox.h>\\n\\n\\n\\n#include \\\"vtkVgSetGet.h\\\"\\n\\n#include \\\"vtkVgTimeStamp.h\\\"\\n\\n\\n\\n#include <map>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n#include \\\"vtkVgGeoCoord.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VtkVgCore/vtkVgTrack.h\",\n \"rank\": 62,\n \"score\": 6.469334652730426\n },\n {\n \"content\": \" bool UpdateEventAnnotation(vtkVgEvent* event);\\n\\n bool UpdateActivityAnnotation(vtkVgActivity* event);\\n\\n\\n\\n void AddFrameDelta(std::ostream& os,\\n\\n unsigned int currFrame,\\n\\n unsigned int firstFrame, unsigned int lastFrame);\\n\\n\\n\\nprivate:\\n\\n bool Visible;\\n\\n int ObjectType;\\n\\n vtkIdType ObjectId;\\n\\n\\n\\n union\\n\\n {\\n\\n vtkVgTrack* Track;\\n\\n vtkVgEvent* Event;\\n\\n vtkVgActivity* Activity;\\n\\n } Object;\\n\\n\\n\\n vpViewCore* ViewCoreInstance;\\n\\n\\n\\n vtkVgAnnotationActor* Actor;\\n\\n\\n\\n vtkSmartPointer<vtkMatrix4x4> RepresentationMatrix;\\n\\n};\\n\\n\\n\\n#endif // __vpAnnotation_h\\n\",\n \"file_path\": \"Applications/VpView/vpAnnotation.h\",\n \"rank\": 63,\n \"score\": 6.46909164069398\n },\n {\n \"content\": \" void onLeftRelease();\\n\\n void onLeftClick();\\n\\n void onRightClick();\\n\\n void onMouseMove();\\n\\n void onSelectionComplete();\\n\\n\\n\\n void onEditTrackHeadRegion();\\n\\n\\n\\n void resetToAOIView();\\n\\n void resetView();\\n\\n void resetToViewExtents();\\n\\n void getAOIExtents(double extents[4]);\\n\\n\\n\\n void decreaseTrackHeadSize();\\n\\n void toggleImageFiltering();\\n\\n void increaseTrackHeadSize();\\n\\n\\n\\n int pickScene();\\n\\n\\n\\n void CreateInformaticsDisplay(int x, int y, vtkImageData* normalcy);\\n\",\n \"file_path\": \"Applications/VpView/vpViewCore.h\",\n \"rank\": 64,\n \"score\": 6.467477626641269\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpMultiGraphRepresentation_h\\n\\n#define __vpMultiGraphRepresentation_h\\n\\n\\n\\n#include \\\"vpMultiGraphModel.h\\\"\\n\\n#include \\\"vpPrimitiveConfig.h\\\"\\n\\n\\n\\n// VisGUI includes\\n\\n#include <vgRange.h>\\n\\n#include <vtkVgRepresentationBase.h>\\n\\n#include <vtkVgPickData.h>\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkActor.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// C++ includes\\n\\n#include <map>\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpMultiGraphRepresentation.h\",\n \"rank\": 65,\n \"score\": 6.463056515190249\n },\n {\n \"content\": \"\\n\\n void FollowTrack();\\n\\n\\n\\n void OnShowLinkedEvents();\\n\\n void OnHideLinkedEvents();\\n\\n\\n\\n void OnShowLinkedActivities();\\n\\n void OnHideLinkedActivities();\\n\\n\\n\\n void OnShownItemsChanged();\\n\\n\\n\\n void OnHideAll();\\n\\n void OnShowAll();\\n\\n\\n\\n void OnAddEventsToGraphModel();\\n\\n void OnAddTrackEventsToGraphModel();\\n\\n\\n\\nprotected:\\n\\n virtual void showEvent(QShowEvent* event);\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpObjectSelectionPanel.h\",\n \"rank\": 66,\n \"score\": 6.459963974929843\n },\n {\n \"content\": \" void onRemoveAllTemporalFilters();\\n\\n void onRemoveAllFilters();\\n\\n\\n\\n void temporalFilterChanged(QTreeWidgetItem* item, int column);\\n\\n\\n\\n void bookmarkViewport();\\n\\n void copyViewportExtentsToClipboard();\\n\\n void copyExtendedInfoToClipboard();\\n\\n\\n\\n void updateInfoWidget(bool trackAttributesOnly = false);\\n\\n void rebuildObjectViews();\\n\\n\\n\\n void onSettingsChanged();\\n\\n\\n\\n void onTestingStarted();\\n\\n void onTestingStopped();\\n\\n\\n\\n void createTrack(bool start);\\n\\n void createEvent(bool start);\\n\\n void createSceneElement(bool start);\\n\",\n \"file_path\": \"Applications/VpView/vpView.h\",\n \"rank\": 67,\n \"score\": 6.447281138969845\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsDescriptorSource_h\\n\\n#define __vsDescriptorSource_h\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n#include <vvDescriptor.h>\\n\\n#include <vvTrack.h>\\n\\n\\n\\n#include \\\"vsDataSource.h\\\"\\n\\n#include \\\"vsDescriptor.h\\\"\\n\\n#include \\\"vsEvent.h\\\"\\n\\n#include \\\"vsEventInfo.h\\\"\\n\\n#include \\\"vsTrackClassifier.h\\\"\\n\\n#include \\\"vsTrackId.h\\\"\\n\\n\\n\\n#include \\\"vsDescriptorInput.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VspData/vsDescriptorSource.h\",\n \"rank\": 68,\n \"score\": 6.4365435958191055\n },\n {\n \"content\": \"#ifndef __ctkRangeSlider_h\\n\\n#define __ctkRangeSlider_h\\n\\n\\n\\n// Qt includes\\n\\n#include <QSlider>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n// CTK includes\\n\\n//#include <ctkPimpl.h>\\n\\n\\n\",\n \"file_path\": \"Libraries/QtVgWidgets/ctkRangeSlider.h\",\n \"rank\": 69,\n \"score\": 6.433495270303379\n },\n {\n \"content\": \"\\n\\n virtual void Update();\\n\\n\\n\\n // Description:\\n\\n // Mouse move event.\\n\\n virtual bool MouseMoveEvent(const vtkContextMouseEvent& mouse);\\n\\n\\n\\n // Description:\\n\\n // Mouse button double click event.\\n\\n virtual bool MouseDoubleClickEvent(const vtkContextMouseEvent& mouse);\\n\\n\\n\\n // Description:\\n\\n // Mouse button release event.\\n\\n virtual bool MouseButtonReleaseEvent(const vtkContextMouseEvent& mouse);\\n\\n\\n\\n // Description:\\n\\n // Mouse wheel event, positive delta indicates forward movement of the wheel.\\n\\n virtual bool MouseWheelEvent(const vtkContextMouseEvent& mouse, int delta);\\n\\n\\n\\n virtual bool Hit(const vtkContextMouseEvent& mouse);\\n\",\n \"file_path\": \"Libraries/VtkVgCore/vtkVgChartTimeline.h\",\n \"rank\": 70,\n \"score\": 6.433067982519232\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpGraphAnimateCallback_h\\n\\n#define __vpGraphAnimateCallback_h\\n\\n\\n\\n// VisGUI includes\\n\\n#include \\\"vpMultiGraphModel.h\\\"\\n\\n#include \\\"vpMultiGraphRepresentation.h\\\"\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkCommand.h>\\n\\n#include <vtkRenderer.h>\\n\\n#include <vtkRenderWindow.h>\\n\\n#include <vtkRenderWindowInteractor.h>\\n\\n\\n\\n// C++ includes\\n\\n#include <vector>\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpGraphAnimateCallback.h\",\n \"rank\": 71,\n \"score\": 6.429708101725302\n },\n {\n \"content\": \" void exportSceneElements();\\n\\n void exportFilters();\\n\\n void exportFilters(QString path, bool startExternalProcess);\\n\\n\\n\\n void setTrackTrailLength();\\n\\n\\n\\n void changeTrackColors();\\n\\n void updateTrackColorsFromDialog(vpTrackColorDialog* dlg);\\n\\n\\n\\n void setFrameOffset();\\n\\n\\n\\n void importProject();\\n\\n void closeProject(int sessionId);\\n\\n\\n\\n void updateTracks();\\n\\n void finishTrackUpdate();\\n\\n\\n\\n void setAutoUpdateEnabled(bool enable);\\n\\n\\n\\n void disableTimeBasedIndexing();\\n\",\n \"file_path\": \"Applications/VpView/vpView.h\",\n \"rank\": 72,\n \"score\": 6.427423687041007\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsCore_h\\n\\n#define __vsCore_h\\n\\n\\n\\n#include <QObject>\\n\\n#include <QList>\\n\\n#include <QHash>\\n\\n#include <QMap>\\n\\n#include <QSet>\\n\\n\\n\\n#include <qtGlobal.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n#include <vgNamespace.h>\\n\\n\\n\\n#include <vtkVgTimeStamp.h>\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsCore.h\",\n \"rank\": 73,\n \"score\": 6.427094941921273\n },\n {\n \"content\": \"\\n\\n virtual void chooseQueryVideo() {}\\n\\n virtual void reprocessQueryVideo() {}\\n\\n\\n\\n virtual void setQueryTracksAndDescriptors(\\n\\n QList<vvDescriptor> descriptors, QList<vvTrack> tracks);\\n\\n virtual void clearQueryDescriptors();\\n\\n\\n\\n void moveToSelected();\\n\\n void moveToAvailable();\\n\\n void clearSelected();\\n\\n\\n\\n void setStartTimeConstraintToCurrentFrame();\\n\\n void setEndTimeConstraintToCurrentFrame();\\n\\n void clearTimeConstraints();\\n\\n\\n\\n void addKeyframe();\\n\\n void removeSelectedKeyframes();\\n\\n void loadKeyframes();\\n\\n void unsetKeyframeEditCursor();\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvVideoQueryDialog.h\",\n \"rank\": 74,\n \"score\": 6.422212221564201\n },\n {\n \"content\": \" void stepVideoForward();\\n\\n void stepVideoBackward();\\n\\n void skipVideoForward();\\n\\n void skipVideoBackward();\\n\\n\\n\\n void decreaseVideoPlaybackSpeed();\\n\\n void increaseVideoPlaybackSpeed();\\n\\n\\n\\n void writeRenderedImages(bool);\\n\\n void saveScreenShot();\\n\\n\\n\\n void initializeTesting(const qtCliArgs*);\\n\\n\\n\\nprotected slots:\\n\\n void toggleDrawing(bool);\\n\\n\\n\\n void setCursorLocationText(QString);\\n\\n\\n\\n void updateTrackLabelActionsEnabled();\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsMainWindow.h\",\n \"rank\": 75,\n \"score\": 6.421841256525086\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vtkVgPropCollection_h\\n\\n#define __vtkVgPropCollection_h\\n\\n\\n\\n// VTK includes.\\n\\n#include <vtkObject.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// STL includes.\\n\\n#include <map>\\n\\n#include <vector>\\n\\n\\n\\n// VG includes.\\n\\n#include \\\"vtkVgMacros.h\\\"\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n// Forward declarations.\\n\",\n \"file_path\": \"Libraries/VtkVgSceneGraph/vtkVgPropCollection.h\",\n \"rank\": 76,\n \"score\": 6.419523110909629\n },\n {\n \"content\": \"public slots:\\n\\n void initializeTesting(const qtCliArgs*);\\n\\n void addLayer(QUrl);\\n\\n\\n\\n void resultsPageBack();\\n\\n void resultsPageForward();\\n\\n\\n\\nprotected slots:\\n\\n void showQueryNewDialog();\\n\\n void showQueryEditDialog();\\n\\n void showQueryOpenDialog();\\n\\n void showGroundTruthOpenDialog();\\n\\n void showLayerAddFileDialog();\\n\\n void showConfigureDialog();\\n\\n void refineResults();\\n\\n\\n\\n void setResultFilters();\\n\\n\\n\\n void showQueryClip(vvQueryInstance query);\\n\\n\\n\",\n \"file_path\": \"Applications/Viqui/vqApplication.h\",\n \"rank\": 77,\n \"score\": 6.416667324151747\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsContextViewer_h\\n\\n#define __vsContextViewer_h\\n\\n\\n\\n// VisGUI includes.\\n\\n#include <vsDescriptorInput.h>\\n\\n\\n\\n#include <qtGlobal.h>\\n\\n\\n\\n// VTK includes.\\n\\n#include <QVTKWidget.h>\\n\\n\\n\\n// QT includes.\\n\\n#include <QBasicTimer>\\n\\n#include <QSet>\\n\\n#include <QUrl>\\n\\n\\n\\n// Forward declarations\\n\",\n \"file_path\": \"Plugins/VspUiExtensions/ContextViewer/vsContextViewer.h\",\n \"rank\": 78,\n \"score\": 6.411969099818391\n },\n {\n \"content\": \" void onEventFilterPresetChanged(int index);\\n\\n void onEventFilterVisibilityChanged();\\n\\n void onEventFilterChanged();\\n\\n void onFrameRendered();\\n\\n void onReinitialized();\\n\\n void onShow3dView(bool state);\\n\\n void onHide3dView();\\n\\n void onEventExpirationModeChange(QAction* sizeAction, bool render = true);\\n\\n void onContextLODChanged(int value);\\n\\n void onWebExport();\\n\\n void onProjectProcessed();\\n\\n\\n\\n void updateFrameTime();\\n\\n void updateObjectCounts();\\n\\n void updateUI();\\n\\n\\n\\n void handleRenderWindowMouseMove(int x, int y);\\n\\n void updateFrameFileName(const QString& fileName);\\n\\n\\n\\n bool eventFilter(QObject* obj, QEvent* event);\\n\",\n \"file_path\": \"Applications/VpView/vpView.h\",\n \"rank\": 79,\n \"score\": 6.409406041427738\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vtkVgRepresentationBase_h\\n\\n#define __vtkVgRepresentationBase_h\\n\\n\\n\\n// VTK includes.\\n\\n#include <vtkObject.h>\\n\\n#include <vtkPropCollection.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// VG includes.\\n\\n#include \\\"vtkVgMacros.h\\\"\\n\\n\\n\\n// C++ includes\\n\\n#include <limits>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n// Forward declarations.\\n\",\n \"file_path\": \"Libraries/VtkVgModelView/vtkVgRepresentationBase.h\",\n \"rank\": 80,\n \"score\": 6.404432845814079\n },\n {\n \"content\": \" void readyToProcessDatabaseVideoQuery(vvQueryInstance);\\n\\n\\n\\npublic slots:\\n\\n virtual void accept();\\n\\n\\n\\nprotected slots:\\n\\n void updateTimeUpperFromLower();\\n\\n void updateTimeLowerFromUpper();\\n\\n\\n\\n void preSetQueryType();\\n\\n void setQueryType(int);\\n\\n\\n\\n void requestRegion();\\n\\n void acceptDrawnRegion(vgGeocodedPoly region);\\n\\n\\n\\n void editRegionNumeric();\\n\\n\\n\\n void editQuery();\\n\\n\\n\\n void loadQuery();\\n\",\n \"file_path\": \"Applications/Viqui/vqQueryDialog.h\",\n \"rank\": 81,\n \"score\": 6.402596150644024\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsViperArchiveSourcePrivate_h\\n\\n#define __vsViperArchiveSourcePrivate_h\\n\\n\\n\\n#include \\\"vsViperArchiveSource.h\\\"\\n\\n\\n\\n#include <QMap>\\n\\n#include <QSet>\\n\\n#include <QUrl>\\n\\n\\n\\n#include <qtThread.h>\\n\\n\\n\\n#include <vvDescriptor.h>\\n\\n\\n\\n#include <track_oracle/track_oracle.h>\\n\\n\\n\\n#include <vsDescriptorInput.h>\\n\\n#include <vsEvent.h>\\n\\n#include <vsTrackId.h>\\n\\n\\n\",\n \"file_path\": \"Plugins/VspSourceService/ViperArchiveSource/vsViperArchiveSourcePrivate.h\",\n \"rank\": 82,\n \"score\": 6.402510694677576\n },\n {\n \"content\": \" void onTreeHoverItemChanged(int sessionId);\\n\\n void updateObject(int objectType, int id);\\n\\n void updateColorofTracksOfType(int typeIndex, double* rgb);\\n\\n void updateCore();\\n\\n void updateEverything();\\n\\n void onCreateEvent(int type, vtkIdList* ids);\\n\\n void onTimelineSelectionChanged(int type, int id);\\n\\n void onShowHideTimelineView(bool show);\\n\\n void onTimelineDialogClosed();\\n\\n void onDisplayEventLegend(bool state);\\n\\n void onDisplayEventIcons(bool state);\\n\\n void onIconSizeChange(QAction* sizeAction, bool render = true);\\n\\n void onDisplayOverview(bool state);\\n\\n void onDisplayAOIOutline(bool state);\\n\\n void onCriticalError(const QString&);\\n\\n void onWarningError(const QString&);\\n\\n void onShowConfigureDialog();\\n\\n void onShowExternalProcessDialog();\\n\\n void onSaveRenderedImages(bool state);\\n\\n void onExecuteModeChanged(int index);\\n\",\n \"file_path\": \"Applications/VpView/vpView.h\",\n \"rank\": 83,\n \"score\": 6.401968001840416\n },\n {\n \"content\": \"\\n\\n void onIncreaseSceneElementTransparency();\\n\\n void onDecreaseSceneElementTransparency();\\n\\n\\n\\n void onIncreasePolygonNodeSize();\\n\\n void onDecreasePolygonNodeSize();\\n\\n\\n\\n void onPlay();\\n\\n void onPause();\\n\\n void setLoop(bool state);\\n\\n\\n\\n void nextFrame();\\n\\n void prevFrame();\\n\\n void seekToFrame(const vtkVgTimeStamp& position, vg::SeekMode direction);\\n\\n\\n\\n void setPlaybackRate(double rate);\\n\\n double getPlaybackRate();\\n\\n\\n\\n void onResize(int width, int height);\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpViewCore.h\",\n \"rank\": 84,\n \"score\": 6.398621530881519\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpQtViewer3d_h\\n\\n#define __vpQtViewer3d_h\\n\\n\\n\\n// VisGUI includes\\n\\n#include <vtkVgPicker.h>\\n\\n#include <vtkVgTimeStamp.h>\\n\\n\\n\\n#include <qtGlobal.h>\\n\\n\\n\\n// Qt includes\\n\\n#include <QList>\\n\\n#include <QObject>\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// Forward declarations.\\n\",\n \"file_path\": \"Applications/VpView/vpQtViewer3d.h\",\n \"rank\": 85,\n \"score\": 6.396914286358268\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsMainWindowPrivate_h\\n\\n#define __vsMainWindowPrivate_h\\n\\n\\n\\n#include <QHash>\\n\\n#include <QStack>\\n\\n\\n\\n#include <qtUiState.h>\\n\\n\\n\\n#include <vgRange.h>\\n\\n\\n\\n#include <vsContour.h>\\n\\n#include <vsDescriptorInput.h>\\n\\n\\n\\n#include \\\"vsMainWindow.h\\\"\\n\\n\\n\\n#include \\\"ui_vsp.h\\\"\\n\\n#include \\\"am_vsp.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsMainWindowPrivate.h\",\n \"rank\": 86,\n \"score\": 6.396914286358268\n },\n {\n \"content\": \"\\n\\npublic slots:\\n\\n void hideAllItems();\\n\\n void showAllItems();\\n\\n void setHiddenItemsShown(bool enable);\\n\\n\\n\\n void hideSelectedItems();\\n\\n void showSelectedItems();\\n\\n\\n\\n void setSelectedItemsStarred(bool starred);\\n\\n\\n\\n void selectTrack(vtkIdType trackId);\\n\\n\\n\\n void jumpToSelectedStart();\\n\\n void jumpToSelectedEnd();\\n\\n void followSelectedTrack();\\n\\n\\n\\nprotected slots:\\n\\n void itemActivated(const QModelIndex& index);\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsTrackTreeView.h\",\n \"rank\": 87,\n \"score\": 6.389985843476846\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vtkVgTerrainSource_h\\n\\n#define __vtkVgTerrainSource_h\\n\\n\\n\\n// VG includes.\\n\\n#include <vgExport.h>\\n\\n\\n\\n#include <vtkVgMacros.h>\\n\\n#include <vtkVgDataSourceBase.h>\\n\\n\\n\\n// VTK includes.\\n\\n#include <vtkMatrix4x4.h>\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n// STL includes.\\n\\n#include <vector>\\n\\n\\n\\n// Forward declarations.\\n\",\n \"file_path\": \"Libraries/VtkVgQtSceneUtil/vtkVgTerrainSource.h\",\n \"rank\": 88,\n \"score\": 6.38941335920586\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vdfTrackSource_h\\n\\n#define __vdfTrackSource_h\\n\\n\\n\\n#include \\\"vdfDataSourceInterface.h\\\"\\n\\n#include \\\"vdfTrackData.h\\\"\\n\\n#include \\\"vdfTrackId.h\\\"\\n\\n\\n\\n#include <vvTrack.h>\\n\\n\\n\\n#include <vgTimeMap.h>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n#include <QHash>\\n\\n#include <QObject>\\n\\n#include <QSet>\\n\\n\\n\",\n \"file_path\": \"Libraries/VgDataFramework/vdfTrackSource.h\",\n \"rank\": 89,\n \"score\": 6.38941335920586\n },\n {\n \"content\": \"\\n\\nsignals:\\n\\n void ActivatedNode(vtkVgNodeBase& node);\\n\\n void SelectedNodes(QList<vtkVgNodeBase*> nodes);\\n\\n\\n\\npublic slots:\\n\\n void SelectNodes(QList<vtkVgNodeBase*> node);\\n\\n void UpdateColors();\\n\\n void Update();\\n\\n void ResetView();\\n\\n void OnKeyPressed();\\n\\n\\n\\nprivate slots:\\n\\n void OnFrameChanged(int frame);\\n\\n\\n\\nprivate:\\n\\n void UpdateTimelineChart();\\n\\n void UpdateTimelineTable();\\n\\n void UpdateSelection();\\n\\n\\n\",\n \"file_path\": \"Applications/Viqui/vqTimeline.h\",\n \"rank\": 90,\n \"score\": 6.383699299149272\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpSuperResDepthViewer_h\\n\\n#define __vpSuperResDepthViewer_h\\n\\n\\n\\n// super3d includes\\n\\n#include <super3d/depth/super_config.h>\\n\\n#include <super3d/depth/super_res.h>\\n\\n\\n\\n// vxl includes\\n\\n#include <vil/vil_image_view.h>\\n\\n#include <vgl/algo/vgl_h_matrix_2d.h>\\n\\n#include <vpgl/vpgl_perspective_camera.h>\\n\\n\\n\\n// vtk includes\\n\\n#include <vtkSmartPointer.h>\\n\\n#include <vtkPolyData.h>\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpSuperResDepthViewer.h\",\n \"rank\": 91,\n \"score\": 6.382263157049693\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsStreamSourcePrivate_h\\n\\n#define __vsStreamSourcePrivate_h\\n\\n\\n\\n#include <QUrl>\\n\\n\\n\\n#include <vgExport.h>\\n\\n\\n\\n#include <vvDescriptor.h>\\n\\n\\n\\n#include <vsDescriptor.h>\\n\\n#include <vsDescriptorInput.h>\\n\\n#include <vsEvent.h>\\n\\n#include <vsEventInfo.h>\\n\\n#include <vsVideoSourcePrivate.h>\\n\\n\\n\\n#include \\\"vsStreamSource.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VspSourceUtil/vsStreamSourcePrivate.h\",\n \"rank\": 92,\n \"score\": 6.374464154287197\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpSuperResWorker_h\\n\\n#define __vpSuperResWorker_h\\n\\n\\n\\n#include <super3d/depth/super_res.h>\\n\\n\\n\\n#include <vgl/algo/vgl_h_matrix_2d.h>\\n\\n\\n\\n#include <vtkSmartPointer.h>\\n\\n\\n\\n#include <QScopedPointer>\\n\\n#include <QThread>\\n\\n\\n\\n#include <boost/shared_ptr.hpp>\\n\\n\\n\\n#include <fstream>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpSuperResWorker.h\",\n \"rank\": 93,\n \"score\": 6.374464154287197\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vsCorePrivate_h\\n\\n#define __vsCorePrivate_h\\n\\n\\n\\n#include <vgSwatchCache.h>\\n\\n#include <vgTimeMap.h>\\n\\n\\n\\n#include <vtkVgInstance.h>\\n\\n#include <vtkVgVideoMetadata.h>\\n\\n\\n\\n#include <vsContour.h>\\n\\n#include <vsDescriptorInput.h>\\n\\n#include <vsEvent.h>\\n\\n#include <vsTrackId.h>\\n\\n\\n\\n#include \\\"vsCore.h\\\"\\n\\n\\n\",\n \"file_path\": \"Libraries/VspUserInterface/vsCorePrivate.h\",\n \"rank\": 94,\n \"score\": 6.374464154287197\n },\n {\n \"content\": \" void finalizeKeyframeEdit();\\n\\n void cancelKeyframeEdit();\\n\\n\\n\\n void selectDescriptor(vtkIdType id);\\n\\n void selectKeyframe(vtkIdType id);\\n\\n void selectTrack(vtkIdType id);\\n\\n void selectItem(vvDescriptorInfoTree* tree, vtkIdType id, int type);\\n\\n\\n\\n void selectItem(QTreeWidgetItem* item, int column);\\n\\n\\n\\n void showAll();\\n\\n void hideAll();\\n\\n void hideAllDescriptors();\\n\\n void itemVisibilityChanged(QTreeWidgetItem* item, int column);\\n\\n void updateItemParentVisibilities();\\n\\n\\n\\n void updateSelectionControlsState();\\n\\n void updateTrackConstraintControlsState();\\n\\n void updateKeyframeControlsState();\\n\\n\\n\",\n \"file_path\": \"Libraries/VvVtkWidgets/vvVideoQueryDialog.h\",\n \"rank\": 95,\n \"score\": 6.371489716188259\n },\n {\n \"content\": \" static const char* GetSortTypeString(int sortType);\\n\\n\\n\\nsignals:\\n\\n void ItemsChanged(const QList<QTreeWidgetItem*>& items,\\n\\n bool updateStatus = true);\\n\\n\\n\\n void MouseLeft();\\n\\n void ContextMenuOpened(QMenu& menu);\\n\\n\\n\\n void FocusItemAlone();\\n\\n void FocusItem();\\n\\n void GoToStartFrame();\\n\\n void GoToEndFrame();\\n\\n void FollowTrack();\\n\\n\\n\\n void ShowLinkedEvents();\\n\\n void HideLinkedEvents();\\n\\n\\n\\n void ShowLinkedActivities();\\n\\n void HideLinkedActivities();\\n\",\n \"file_path\": \"Applications/VpView/vpTreeView.h\",\n \"rank\": 96,\n \"score\": 6.369831939213807\n },\n {\n \"content\": \"\\n\\n void timeIntervalMeasurementRequested();\\n\\n\\n\\npublic slots:\\n\\n void initializeUi();\\n\\n void loadEventTypes(vtkVgEventTypeRegistry* reg);\\n\\n void loadPrimitiveTypes(const QString& filename = QString());\\n\\n void loadAttributeTypes(const QString& filename = QString());\\n\\n void loadConfig(const QString& filename);\\n\\n\\n\\n void updateViews();\\n\\n void updateVertexDisplaySize();\\n\\n\\n\\n void importJson();\\n\\n void exportJson(QString filename=QString(\\\"\\\"));\\n\\n\\n\\n void clear();\\n\\n\\n\\n void selectEvent(int id);\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpGraphModelWidget.h\",\n \"rank\": 97,\n \"score\": 6.369831939213807\n },\n {\n \"content\": \"\\n\\n void mergeTracks(bool start);\\n\\n\\n\\n void stopCreatingTrack();\\n\\n void stopCreatingEvent();\\n\\n void stopMergingTracks();\\n\\n\\n\\n void onEventCreated(int id);\\n\\n void onTracksMerged(int id);\\n\\n\\n\\n void splitTrack(int id, int sessionId);\\n\\n void improveTrack(int id, int sessionId);\\n\\n\\n\\n void addEventsToGraphModel(QList<int> eventIds, int sessionId);\\n\\n void addTrackEventsToGraphModel(int id, int sessionId);\\n\\n\\n\\n void selectEvent(int id);\\n\\n\\n\\n void exportTracks();\\n\\n void exportEvents();\\n\",\n \"file_path\": \"Applications/VpView/vpView.h\",\n \"rank\": 98,\n \"score\": 6.368705883103003\n },\n {\n \"content\": \"// This file is part of ViViA, and is distributed under the\\n\\n// OSI-approved BSD 3-Clause License. See top-level LICENSE file or\\n\\n// https://github.com/Kitware/vivia/blob/master/LICENSE for details.\\n\\n\\n\\n#ifndef __vpMultiGraphModel_h\\n\\n#define __vpMultiGraphModel_h\\n\\n\\n\\n#include <vtkVgModelBase.h>\\n\\n\\n\\n//\\n\\n#include <vgTimeStamp.h>\\n\\n\\n\\n// VTK includes\\n\\n#include <vtkGraph.h>\\n\\n#include <vtkMath.h>\\n\\n\\n\\n// C++ include\\n\\n#include <map>\\n\\n#include <string>\\n\\n\\n\",\n \"file_path\": \"Applications/VpView/vpMultiGraphModel.h\",\n \"rank\": 99,\n \"score\": 6.364742163729922\n }\n]","isConversational":false}}},{"rowIdx":467,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/stats_main_cmdline.hpp"},"repo_name":{"kind":"string","value":"transcript/DNAnexus_apps"},"commit":{"kind":"string","value":"12c2ba6f57b805a9fcf6e1da4f9d64394ef72256"},"file_code":{"kind":"string","value":"\n\n#ifndef __STATS_ARGS_HPP__\n#define __STATS_ARGS_HPP__\n\n#include <jellyfish/yaggo.hpp>\n\nclass stats_args {\npublic:\n bool recompute_flag;\n uint64_t lower_count_arg;\n bool lower_count_given;\n uint64_t upper_count_arg;\n bool upper_count_given;\n bool verbose_flag;\n const char * output_arg;\n bool output_given;\n const char * db_arg;\n\n enum {\n USAGE_OPT = 1000,\n FULL_HELP_OPT\n };\n\n stats_args() : \n recompute_flag(false),\n lower_count_arg(), lower_count_given(false),\n upper_count_arg(), upper_count_given(false),\n verbose_flag(false),\n output_arg(\"\"), output_given(false)\n { }\n\n stats_args(int argc, char* argv[]) :\n recompute_flag(false),\n lower_count_arg(), lower_count_given(false),\n upper_count_arg(), upper_count_given(false),\n verbose_flag(false),\n output_arg(\"\"), output_given(false)\n { parse(argc, argv); }\n\n void parse(int argc, char* argv[]) {\n static struct option long_options[] = {\n {\"recompute\", 0, 0, 'r'},\n {\"lower-count\", 1, 0, 'L'},\n {\"upper-count\", 1, 0, 'U'},\n {\"verbose\", 0, 0, 'v'},\n {\"output\", 1, 0, 'o'},\n {\"help\", 0, 0, 'h'},\n {\"full-help\", 0, 0, FULL_HELP_OPT},\n {\"usage\", 0, 0, USAGE_OPT},\n {\"version\", 0, 0, 'V'},\n {0, 0, 0, 0}\n };\n static const char *short_options = \"hVrL:U:vo:\";\n\n std::string err;\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n while(true) { \n int index = -1;\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n if(c == -1) break;\n switch(c) {\n case ':': \n std::cerr << \"Missing required argument for \"\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\n << std::endl;\n exit(1);\n case 'h':\n std::cout << usage() << \"\\n\\n\" << help() << std::endl;\n exit(0);\n case USAGE_OPT:\n std::cout << usage() << \"\\nUse --help for more information.\" << std::endl;\n exit(0);\n case 'V':\n print_version();\n exit(0);\n case '?':\n std::cerr << \"Use --usage or --help for some help\\n\";\n exit(1);\n case FULL_HELP_OPT:\n std::cout << usage() << \"\\n\\n\" << help() << \"\\n\\n\" << hidden() << std::endl;\n exit(0);\n case 'r':\n recompute_flag = true;\n break;\n case 'L':\n lower_count_given = true;\n lower_count_arg = yaggo::conv_uint<uint64_t>((const char *)optarg, err, false);\n CHECK_ERR(uint64_t, optarg, \"-L, --lower-count=uint64\")\n break;\n case 'U':\n upper_count_given = true;\n upper_count_arg = yaggo::conv_uint<uint64_t>((const char *)optarg, err, false);\n CHECK_ERR(uint64_t, optarg, \"-U, --upper-count=uint64\")\n break;\n case 'v':\n verbose_flag = true;\n break;\n case 'o':\n output_given = true;\n output_arg = optarg;\n break;\n }\n }\n\n \n if(argc - optind != 1)\n error(\"Requires exactly 1 argument.\");\n db_arg = argv[optind];\n ++optind;\n }\n\n#define stats_args_USAGE \"Usage: jellyfish stats [options] db:path\"\n const char * usage() const { return stats_args_USAGE; }\n void error(const char *msg) { \n std::cerr << \"Error: \" << msg << \"\\n\" << usage()\n << \"\\nUse --help for more information\"\n << std::endl;\n exit(1);\n }\n\n#define stats_args_HELP \"Statistics\\n\\nDisplay some statistics about the k-mers in the hash:\\n\" \\\n \"\\n\" \\\n \"Unique: Number of k-mers which occur only once.\\n\" \\\n \"Distinct: Number of k-mers, not counting multiplicity.\\n\" \\\n \"Total: Number of k-mers, including multiplicity.\\n\" \\\n \"Max_count: Maximum number of occurrence of a k-mer.\\n\\n\" \\\n \"Options (default value in (), *required):\\n\" \\\n \" -L, --lower-count=uint64 Don't consider k-mer with count < lower-count\\n\" \\\n \" -U, --upper-count=uint64 Don't consider k-mer with count > upper-count\\n\" \\\n \" -v, --verbose Verbose (false)\\n\" \\\n \" -o, --output=string Output file\\n\" \\\n \" --usage Usage\\n\" \\\n \" -h, --help This message\\n\" \\\n \" --full-help Detailed help\\n\" \\\n \" -V, --version Version\"\n\n const char * help() const { return stats_args_HELP; }\n#define stats_args_HIDDEN \"Hidden options:\\n\" \\\n \" -r, --recompute Recompute (false)\"\n\n const char * hidden() const { return stats_args_HIDDEN; }\n void print_version(std::ostream &os = std::cout) const {\n#ifndef PACKAGE_VERSION\n#define PACKAGE_VERSION \"0.0.0\"\n#endif\n os << PACKAGE_VERSION << \"\\n\";\n }\n void dump(std::ostream &os = std::cout) {\n os << \"recompute_flag:\" << recompute_flag << \"\\n\";\n os << \"lower_count_given:\" << lower_count_given << \" lower_count_arg:\" << lower_count_arg << \"\\n\";\n os << \"upper_count_given:\" << upper_count_given << \" upper_count_arg:\" << upper_count_arg << \"\\n\";\n os << \"verbose_flag:\" << verbose_flag << \"\\n\";\n os << \"output_given:\" << output_given << \" output_arg:\" << output_arg << \"\\n\";\n os << \"db_arg:\" << db_arg << \"\\n\";\n }\nprivate:\n};\n\n#endif \n"},"prefix":{"kind":"string","value":"\n\n#ifndef __STATS_ARGS_HPP__\n#define __STATS_ARGS_HPP__\n\n#include <jellyfish/yaggo.hpp>\n\nclass stats_args {\npublic:\n bool recompute_flag;\n uint64_t lower_count_arg;\n bool lower_count_given;\n uint64_t upper_count_arg;\n bool upper_count_given;\n bool verbose_flag;\n const char * output_arg;\n bool output_given;\n const char * db_arg;\n\n enum {\n USAGE_OPT = 1000,\n FULL_HELP_OPT\n };\n\n stats_args() : \n recompute_flag(false),\n lower_count_arg(), lower_count_given(false),\n upper_count_arg(), upper_count_given(false),\n verbose_flag(false),\n output_arg(\"\"), output_given(false)\n { }\n\n stats_args(int argc, char* argv[]) :\n recompute_flag(false),\n lower_count_arg(), lower_count_given(false),\n upper_count_arg(), upper_count_given(false),\n verbose_flag(false),\n output_arg(\"\"), output_given(false)\n { parse(argc, argv); }\n\n void parse(int argc, char* argv[]) {\n static struct option long_options[] = {\n {\"recompute\", 0, 0, 'r'},\n {\"lower-count\", 1, 0, 'L'},\n {\"upper-count\", 1, 0, 'U'},\n {\"verbose\", 0, 0, 'v'},\n {\"output\", 1, 0, 'o'},\n {\"help\", 0, 0, 'h'},\n {\"full-help\", 0, 0, FULL_HELP_OPT},\n {\"usage\", 0, 0, USAGE_OPT},\n {\"version\", 0, 0, 'V'},\n {0, 0, 0, 0}\n };\n static const char *short_options = \"hVrL:U:vo:\";\n\n std::string err;\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n while(true) { \n int index = -1;\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n if(c == -1) break;\n switch(c) {\n case ':': \n std::cerr << \"Missing required argument for \"\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\n << std::endl;\n exit(1);\n case 'h':\n std::cout << usage() << \"\\n\\n\" << help() << std::endl;\n exit(0);\n case USAGE_OPT:\n std::cout << usage() << \"\\nUse --help for more information.\" << std::endl;\n exit(0);\n case 'V':\n print_version();\n exit(0);\n case '?':\n std::cerr << \"Use --usage or --help for some help\\n\";\n exit(1);\n case FULL_HELP_OPT:\n std::cout << usage() << \"\\n\\n\" << help() << \"\\n\\n\" << hidden() << std::endl;\n exit(0);\n case 'r':\n recompute_flag = true;\n break;\n case 'L':\n lower_count_given = true;\n lower_count_arg = yaggo::conv_uint<uint64_t>((const char *)optarg, err, false);\n CHECK_ERR(uint64_t, optarg, \"-L, --lower-count=uint64\")\n break;\n case 'U':\n upper_count_given = true;\n upper_count_arg = yaggo::conv_uint<uint64_t>((const char *)optarg, err, false);\n CHECK_ERR(uint64_t, optarg, \"-U, --upper-count=uint64\")\n break;\n case 'v':\n verbose_flag = true;\n break;\n case 'o':\n output_given = true;\n output_arg = optarg;\n break;\n }\n }\n\n \n if(argc - optind != 1)\n error(\"Requires exactly 1 argument.\");\n db_arg = argv[optind];\n ++optind;\n }\n\n#define stats_args_USAGE \"Usage: jellyfish stats [options] db:path\"\n const char * usage() const { return stats_args_USAGE; }\n void error(const char *msg) { \n std::cerr << \"Error: \" << msg << \"\\n\" << usage()\n << \"\\nUse --help for more information\"\n << std::endl;\n exit(1);\n }\n\n#define stats_args_HELP \"Statistics\\n\\nDisplay some statistics about the k-mers in the hash:\\n\" \\\n \"\\n\" \\\n \"Unique: Number of k-mers which occur only once.\\n\" \\\n \"Distinct: Number of k-mers, not counting multiplicity.\\n\" \\\n \"Total: Number of k-mers, including multiplicity.\\n\" \\\n \"Max_count: Maximum number of occurrence of a k-mer.\\n\\n\" \\\n \"Options (default value in (), *required):\\n\" \\\n \" -L, --lower-count=uint64 Don't consider k-mer with count < lower-count\\n\" \\\n \" -U, --upper-count=uint64 Don't consider k-mer with count > upper-count\\n\" \\\n \" -v, --verbose Verbose (false)\\n\" \\\n \" -o, --output=string Output file\\n\" \\\n \" --usage Usage\\n\" \\\n \" -h, --help This message\\n\" \\\n \" --full-help Detailed help\\n\" \\\n \" -V, --version Version\"\n\n const char * help() const { return stats_args_HELP; }\n#define stats_args_HIDDEN \"Hidden options:\\n\" \\\n \" -r, --recompute Recompute (false)\"\n\n const char * hidden() const { return stats_args_HIDDEN; }\n void print_version(std::ostream &os = std::cout) const {\n#ifndef PACKAGE_VERSION\n#define PACKAGE_VERSION \"0.0.0\"\n#endif\n os << PACKAGE_VERSION << \"\\n\";\n }\n "},"suffix":{"kind":"string","value":"\nprivate:\n};\n\n#endif \n"},"middle":{"kind":"string","value":"void dump(std::ostream &os = std::cout) {\n os << \"recompute_flag:\" << recompute_flag << \"\\n\";\n os << \"lower_count_given:\" << lower_count_given << \" lower_count_arg:\" << lower_count_arg << \"\\n\";\n os << \"upper_count_given:\" << upper_count_given << \" upper_count_arg:\" << upper_count_arg << \"\\n\";\n os << \"verbose_flag:\" << verbose_flag << \"\\n\";\n os << \"output_given:\" << output_given << \" output_arg:\" << output_arg << \"\\n\";\n os << \"db_arg:\" << db_arg << \"\\n\";\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"struct tuple_size<GTEST_1_TUPLE_(T)> { static const int value = 1; };\n\n\n\ntemplate <GTEST_2_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":0,"score":416406.8253525696},{"content":"struct tuple_size<GTEST_0_TUPLE_(T)> { static const int value = 0; };\n\n\n\ntemplate <GTEST_1_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":1,"score":416402.5838420616},{"content":"struct tuple_size<GTEST_2_TUPLE_(T)> { static const int value = 2; };\n\n\n\ntemplate <GTEST_3_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":2,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_6_TUPLE_(T)> { static const int value = 6; };\n\n\n\ntemplate <GTEST_7_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":3,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_3_TUPLE_(T)> { static const int value = 3; };\n\n\n\ntemplate <GTEST_4_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":4,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_10_TUPLE_(T)> { static const int value = 10; };\n\n\n\ntemplate <int k, class Tuple>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":5,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_5_TUPLE_(T)> { static const int value = 5; };\n\n\n\ntemplate <GTEST_6_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":6,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_7_TUPLE_(T)> { static const int value = 7; };\n\n\n\ntemplate <GTEST_8_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":7,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_8_TUPLE_(T)> { static const int value = 8; };\n\n\n\ntemplate <GTEST_9_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":8,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_9_TUPLE_(T)> { static const int value = 9; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":9,"score":391806.44473026635},{"content":"struct tuple_size<GTEST_4_TUPLE_(T)> { static const int value = 4; };\n\n\n\ntemplate <GTEST_5_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":10,"score":391806.44473026635},{"content":"class FooTest : public ::testing::TestWithParam<const char*> {\n\n // You can implement all the usual class fixture members here.\n\n};\n\n\n\n// Then, use the TEST_P macro to define as many parameterized tests\n\n// for this fixture as you want. The _P suffix is for \"parameterized\"\n\n// or \"pattern\", whichever you prefer to think.\n\n\n\nTEST_P(FooTest, DoesBlah) {\n\n // Inside a test, access the test parameter with the GetParam() method\n\n // of the TestWithParam<T> class:\n\n EXPECT_TRUE(foo.Blah(GetParam()));\n\n ...\n\n}\n\n\n\nTEST_P(FooTest, HasBlahBlah) {\n\n ...\n\n}\n\n\n\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-param-test.h","rank":11,"score":361592.2892925329},{"content":"struct is_pointer<T*> : public true_type {};\n\n\n\ntemplate <typename Iterator>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":12,"score":327009.92499011045},{"content":" class TestName : public CaseName<gtest_TypeParam_> { \\\n\n private: \\\n\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\n\n typedef gtest_TypeParam_ TypeParam; \\\n\n virtual void TestBody(); \\\n\n }; \\\n\n static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \\\n\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\\\n\n __FILE__, __LINE__, #CaseName, #TestName); \\\n\n } \\\n\n template <typename gtest_TypeParam_> \\\n\n void GTEST_CASE_NAMESPACE_(CaseName)::TestName<gtest_TypeParam_>::TestBody()\n\n\n\n# define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \\\n\n namespace GTEST_CASE_NAMESPACE_(CaseName) { \\\n\n typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \\\n\n } \\\n\n static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \\\n\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\\\n\n __FILE__, __LINE__, #__VA_ARGS__)\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-typed-test.h","rank":13,"score":326466.0368386953},{"content":"struct RemoveConst<const T[N]> {\n\n typedef typename RemoveConst<T>::type type[N];\n\n};\n\n#endif\n\n\n\n// A handy wrapper around RemoveConst that works when the argument\n\n// T depends on template parameters.\n\n#define GTEST_REMOVE_CONST_(T) \\\n\n typename ::testing::internal::RemoveConst<T>::type\n\n\n\n// Turns const U&, U&, const U, and U all into U.\n\n#define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \\\n\n GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T))\n\n\n\n// Adds reference to a type if it is not a reference type,\n\n// otherwise leaves it unchanged. This is the same as\n\n// tr1::add_reference, which is not widely available yet.\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":14,"score":326160.0692892401},{"content":"class mer_counting_fasta_direct : public mer_counting<jellyfish::parse_dna, direct_index_t> {\n\npublic:\n\n mer_counting_fasta_direct(const std::vector<const char *> &files,\n\n count_args &_args) :\n\n mer_counting<jellyfish::parse_dna, direct_index_t>(_args)\n\n {\n\n parser = new jellyfish::parse_dna(files.begin(), files.end(),\n\n args->mer_len_arg, args->buffers_arg,\n\n args->buffer_size_arg);\n\n ary = new direct_index_t::storage_t(2 * args->mer_len_arg);\n\n hash = new direct_index_t(ary);\n\n if(args->no_write_flag) {\n\n dumper = new jellyfish::noop_dumper();\n\n } else {\n\n if(args->raw_flag)\n\n std::cerr << \"Switch --raw not (yet) supported with direct indexing. Ignoring.\" << std::endl;\n\n direct_index_dumper_t *_dumper =\n\n new direct_index_dumper_t(args->threads_arg, args->output_arg.c_str(),\n\n args->out_buffer_size_arg,\n\n 8*args->out_counter_len_arg,\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc","rank":15,"score":319664.316422704},{"content":"class mer_counting_qual_fasta_direct : public mer_counting<jellyfish::parse_qual_dna, direct_index_t> {\n\npublic:\n\n mer_counting_qual_fasta_direct(const std::vector<const char *> &files,\n\n count_args &_args) :\n\n mer_counting<jellyfish::parse_qual_dna, direct_index_t>(_args)\n\n {\n\n parser = new jellyfish::parse_qual_dna(files,\n\n args->mer_len_arg, args->buffers_arg,\n\n args->buffer_size_arg, args->quality_start_arg,\n\n args->min_quality_arg);\n\n ary = new direct_index_t::storage_t(2 * args->mer_len_arg);\n\n hash = new direct_index_t(ary);\n\n if(args->no_write_flag) {\n\n dumper = new jellyfish::noop_dumper();\n\n } else {\n\n if(args->raw_flag)\n\n std::cerr << \"Switch --raw not (yet) supported with direct indexing. Ignoring.\" << std::endl;\n\n direct_index_dumper_t *_dumper =\n\n new direct_index_dumper_t(args->threads_arg, args->output_arg.c_str(),\n\n args->out_buffer_size_arg,\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc","rank":16,"score":314897.01594195655},{"content":"#define die if(1) err::die_t()\n\n#define eraise(e) if(1) err::raise_t<e>()\n\n#define define_error_class(name) \\\n\n class name : public std::runtime_error { \\\n\n public: explicit name(const std::string &txt) : std::runtime_error(txt) {} \\\n\n }\n\n\n\n#endif\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/err.hpp","rank":17,"score":305628.80483490357},{"content":"struct TupleElement<true, 1, GTEST_10_TUPLE_(T)> { typedef T1 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":18,"score":305087.0739641233},{"content":"struct TupleElement<true, 0, GTEST_10_TUPLE_(T)> { typedef T0 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":19,"score":305082.83245361526},{"content":"class DerivedTest : public BaseTest, public ::testing::WithParamInterface<int> {\n\n // The usual test fixture members go here too.\n\n};\n\n\n\nTEST_F(BaseTest, HasFoo) {\n\n // This is an ordinary non-parameterized test.\n\n}\n\n\n\nTEST_P(DerivedTest, DoesBlah) {\n\n // GetParam works just the same here as if you inherit from TestWithParam.\n\n EXPECT_TRUE(foo.Blah(GetParam()));\n\n}\n\n\n\n#endif // 0\n\n\n\n#include \"gtest/internal/gtest-port.h\"\n\n\n\n#if !GTEST_OS_SYMBIAN\n\n# include <utility>\n\n#endif\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-param-test.h","rank":20,"score":303715.3787569794},{"content":"struct RemoveConst<const T> { typedef T type; }; // NOLINT\n\n\n\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\n\n// definition to fail to remove the const in 'const int[3]' and 'const\n\n// char[3][4]'. The following specialization works around the bug.\n\n// However, it causes trouble with GCC and thus needs to be\n\n// conditionally compiled.\n\n#if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__)\n\ntemplate <typename T, size_t N>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":21,"score":300269.94545915036},{"content":"struct ByRef { typedef const T& type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":22,"score":298316.6096498102},{"content":"struct is_pointer : public false_type {};\n\n\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":23,"score":289508.80635476613},{"content":" // Holds a value of type T.\n\n class ValueHolder : public ThreadLocalValueHolderBase {\n\n public:\n\n explicit ValueHolder(const T& value) : value_(value) {}\n\n\n\n T* pointer() { return &value_; }\n\n\n\n private:\n\n T value_;\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ValueHolder);\n\n };\n\n\n\n static pthread_key_t CreateKey() {\n\n pthread_key_t key;\n\n // When a thread exits, DeleteThreadLocalValue() will be called on\n\n // the object managed for that thread.\n\n GTEST_CHECK_POSIX_SUCCESS_(\n\n pthread_key_create(&key, &DeleteThreadLocalValue));\n\n return key;\n\n }\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":24,"score":287550.99943429907},{"content":"struct TupleElement<true, 4, GTEST_10_TUPLE_(T)> { typedef T4 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":25,"score":280486.6933418201},{"content":"struct TupleElement<true, 6, GTEST_10_TUPLE_(T)> { typedef T6 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":26,"score":280486.6933418201},{"content":"struct TupleElement<true, 8, GTEST_10_TUPLE_(T)> { typedef T8 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":27,"score":280486.6933418201},{"content":"struct TupleElement<true, 3, GTEST_10_TUPLE_(T)> { typedef T3 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":28,"score":280486.6933418201},{"content":"struct TupleElement<true, 7, GTEST_10_TUPLE_(T)> { typedef T7 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":29,"score":280486.6933418201},{"content":"struct TupleElement<true, 5, GTEST_10_TUPLE_(T)> { typedef T5 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":30,"score":280486.6933418201},{"content":"struct TupleElement<true, 2, GTEST_10_TUPLE_(T)> { typedef T2 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":31,"score":280486.6933418201},{"content":"struct TupleElement<true, 9, GTEST_10_TUPLE_(T)> { typedef T9 type; };\n\n\n\n} // namespace gtest_internal\n\n\n\ntemplate <>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":32,"score":280486.6933418201},{"content":"class ParameterizedTestCaseInfo : public ParameterizedTestCaseInfoBase {\n\n public:\n\n // ParamType and GeneratorCreationFunc are private types but are required\n\n // for declarations of public methods AddTestPattern() and\n\n // AddTestCaseInstantiation().\n\n typedef typename TestCase::ParamType ParamType;\n\n // A function that returns an instance of appropriate generator type.\n\n typedef ParamGenerator<ParamType>(GeneratorCreationFunc)();\n\n\n\n explicit ParameterizedTestCaseInfo(const char* name)\n\n : test_case_name_(name) {}\n\n\n\n // Test case base name for display purposes.\n\n virtual const string& GetTestCaseName() const { return test_case_name_; }\n\n // Test case id to verify identity.\n\n virtual TypeId GetTestCaseTypeId() const { return GetTypeId<TestCase>(); }\n\n // TEST_P macro uses AddTestPattern() to record information\n\n // about a single test in a LocalTestInfo structure.\n\n // test_case_name is the base name of the test case (without invocation\n\n // prefix). test_base_name is the name of an individual test without\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h","rank":33,"score":280326.48300916073},{"content":"class FooTest : public testing::Test {\n\n ...\n\n};\n\n\n\n// Next, declare that you will define a type-parameterized test case\n\n// (the _P suffix is for \"parameterized\" or \"pattern\", whichever you\n\n// prefer):\n\nTYPED_TEST_CASE_P(FooTest);\n\n\n\n// Then, use TYPED_TEST_P() to define as many type-parameterized tests\n\n// for this type-parameterized test case as you want.\n\nTYPED_TEST_P(FooTest, DoesBlah) {\n\n // Inside a test, refer to TypeParam to get the type parameter.\n\n TypeParam n = 0;\n\n ...\n\n}\n\n\n\nTYPED_TEST_P(FooTest, HasPropertyA) { ... }\n\n\n\n// Now the tricky part: you need to register all test patterns before\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-typed-test.h","rank":34,"score":278226.2086145318},{"content":"class mer_counting_quake : public mer_counting<jellyfish::parse_quake, fastq_hash_t> {\n\npublic:\n\n mer_counting_quake(std::vector<const char *>,\n\n count_args &_args) :\n\n mer_counting<jellyfish::parse_quake, fastq_hash_t>(_args)\n\n {\n\n parser = new jellyfish::parse_quake(args->file_arg,\n\n args->mer_len_arg, args->buffers_arg, \n\n args->buffer_size_arg, \n\n args->quality_start_arg);\n\n ary = new fastq_hash_t::storage_t(args->size_arg, 2*args->mer_len_arg,\n\n args->reprobes_arg, \n\n jellyfish::quadratic_reprobes);\n\n hash = new fastq_hash_t(ary);\n\n if(args->no_write_flag) {\n\n dumper = new jellyfish::noop_dumper();\n\n } else {\n\n dumper = new raw_fastq_dumper_t(args->threads_arg, args->output_arg.c_str(),\n\n args->out_buffer_size_arg,\n\n ary);\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc","rank":35,"score":277631.91260988},{"content":"class mer_counting : public mer_counting_base, public thread_exec {\n\nprotected:\n\n count_args *args;\n\n locks::pthread::barrier sync_barrier;\n\n parser_t *parser;\n\n typename hash_t::storage_t *ary;\n\n hash_t *hash;\n\n jellyfish::dumper_t *dumper;\n\n uint64_t distinct, total;\n\n\n\npublic:\n\n explicit mer_counting(count_args &_args) :\n\n args(&_args), sync_barrier(args->threads_arg),\n\n distinct(0), total(0) {}\n\n\n\n ~mer_counting() { \n\n if(dumper)\n\n delete dumper;\n\n if(hash)\n\n delete hash;\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc","rank":36,"score":276426.75657765043},{"content":"class mer_counting_fasta_hash : public mer_counting<jellyfish::parse_dna, inv_hash_t> {\n\npublic:\n\n mer_counting_fasta_hash(const std::vector<const char *> &files,\n\n count_args &_args) :\n\n mer_counting<jellyfish::parse_dna, inv_hash_t>(_args)\n\n {\n\n parser = new jellyfish::parse_dna(files.begin(), files.end(),\n\n args->mer_len_arg, args->buffers_arg,\n\n args->buffer_size_arg);\n\n ary = new inv_hash_t::storage_t(args->size_arg, 2*args->mer_len_arg,\n\n args->counter_len_arg, \n\n args->reprobes_arg, \n\n jellyfish::quadratic_reprobes);\n\n if(args->matrix_given) {\n\n std::ifstream fd;\n\n fd.exceptions(std::ifstream::eofbit|std::ifstream::failbit|std::ifstream::badbit);\n\n fd.open(args->matrix_arg.c_str());\n\n SquareBinaryMatrix m(&fd);\n\n fd.close();\n\n ary->set_matrix(m);\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc","rank":37,"score":275734.441437414},{"content":"#define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\\\n\nclass GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\\\n\n public:\\\n\n GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\\\n\n private:\\\n\n virtual void TestBody();\\\n\n static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\\\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(\\\n\n GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\\\n\n};\\\n\n\\\n\n::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\\\n\n ::test_info_ =\\\n\n ::testing::internal::MakeAndRegisterTestInfo(\\\n\n #test_case_name, #test_name, NULL, NULL, \\\n\n (parent_id), \\\n\n parent_class::SetUpTestCase, \\\n\n parent_class::TearDownTestCase, \\\n\n new ::testing::internal::TestFactoryImpl<\\\n\n GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>);\\\n\nvoid GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody()\n\n\n\n#ifdef __ICC\n\n// Disable explicit warning on Intel compiler\n\n#pragma warning enable 2304\n\n#endif\n\n\n\n#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":38,"score":274514.8057984098},{"content":"struct RemoveConst { typedef T type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":39,"score":274446.60236797674},{"content":"class fstream_default : public Base {\n\n typedef Base super;\n\n static std::streambuf* open_file(const char* str, std::ios_base::openmode mode) {\n\n std::filebuf* fb = new std::filebuf;\n\n return fb->open(str, mode);\n\n }\n\n\n\n static std::streambuf* get_streambuf(const char* str, Base& def, \n\n std::ios_base::openmode mode) {\n\n return (str != 0) ? open_file(str, mode) : def.rdbuf();\n\n }\n\n static std::streambuf* get_streambuf(const char* str, std::streambuf* buf, \n\n std::ios_base::openmode mode) {\n\n return (str != 0) ? open_file(str, mode) : buf;\n\n }\n\n\n\n bool do_close;\n\npublic:\n\n fstream_default(const char* str, Base& def, std::ios_base::openmode mode = def_mode) :\n\n Base(get_streambuf(str, def, mode)), do_close(str != 0) { \n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/fstream_default.hpp","rank":40,"score":273369.3888964084},{"content":"class mer_counting_qual_fasta_hash : public mer_counting<jellyfish::parse_qual_dna, inv_hash_t> {\n\npublic:\n\n mer_counting_qual_fasta_hash(const std::vector<const char *> &files,\n\n count_args &_args) :\n\n mer_counting<jellyfish::parse_qual_dna, inv_hash_t>(_args)\n\n {\n\n parser = new jellyfish::parse_qual_dna(files,\n\n args->mer_len_arg, args->buffers_arg,\n\n args->buffer_size_arg, args->quality_start_arg,\n\n args->min_quality_arg);\n\n ary = new inv_hash_t::storage_t(args->size_arg, 2*args->mer_len_arg,\n\n args->counter_len_arg, \n\n args->reprobes_arg, \n\n jellyfish::quadratic_reprobes);\n\n if(args->matrix_given) {\n\n std::ifstream fd;\n\n fd.exceptions(std::ifstream::eofbit|std::ifstream::failbit|std::ifstream::badbit);\n\n fd.open(args->matrix_arg.c_str());\n\n SquareBinaryMatrix m(&fd);\n\n fd.close();\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc","rank":41,"score":272056.43702638487},{"content":"// A concrete DeathTestFactory implementation for normal use.\n\nclass DefaultDeathTestFactory : public DeathTestFactory {\n\n public:\n\n virtual bool Create(const char* statement, const RE* regex,\n\n const char* file, int line, DeathTest** test);\n\n};\n\n\n\n// Returns true if exit_status describes a process that was terminated\n\n// by a signal, or exited normally with a nonzero exit code.\n\nGTEST_API_ bool ExitedUnsuccessfully(int exit_status);\n\n\n\n// Traps C++ exceptions escaping statement and reports them as test\n\n// failures. Note that trapping SEH exceptions is not implemented here.\n\n# if GTEST_HAS_EXCEPTIONS\n\n# define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \\\n\n try { \\\n\n GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \\\n\n } catch (const ::std::exception& gtest_exception) { \\\n\n fprintf(\\\n\n stderr, \\\n\n \"\\n%s: Caught std::exception-derived exception escaping the \" \\\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-death-test-internal.h","rank":42,"score":269971.9165508655},{"content":" class Iterator : public ParamIteratorInterface<ParamType> {\n\n public:\n\n Iterator(const ParamGeneratorInterface<ParamType>* base,\n\n const ParamGenerator<T1>& g1,\n\n const typename ParamGenerator<T1>::iterator& current1,\n\n const ParamGenerator<T2>& g2,\n\n const typename ParamGenerator<T2>::iterator& current2,\n\n const ParamGenerator<T3>& g3,\n\n const typename ParamGenerator<T3>::iterator& current3,\n\n const ParamGenerator<T4>& g4,\n\n const typename ParamGenerator<T4>::iterator& current4,\n\n const ParamGenerator<T5>& g5,\n\n const typename ParamGenerator<T5>::iterator& current5,\n\n const ParamGenerator<T6>& g6,\n\n const typename ParamGenerator<T6>::iterator& current6,\n\n const ParamGenerator<T7>& g7,\n\n const typename ParamGenerator<T7>::iterator& current7,\n\n const ParamGenerator<T8>& g8,\n\n const typename ParamGenerator<T8>::iterator& current8,\n\n const ParamGenerator<T9>& g9,\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util-generated.h","rank":43,"score":267324.6985924891},{"content":"class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface<T> {\n\n public:\n\n template <typename ForwardIterator>\n\n ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end)\n\n : container_(begin, end) {}\n\n virtual ~ValuesInIteratorRangeGenerator() {}\n\n\n\n virtual ParamIteratorInterface<T>* Begin() const {\n\n return new Iterator(this, container_.begin());\n\n }\n\n virtual ParamIteratorInterface<T>* End() const {\n\n return new Iterator(this, container_.end());\n\n }\n\n\n\n private:\n\n typedef typename ::std::vector<T> ContainerType;\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h","rank":44,"score":264726.4635216782},{"content":" class array : public storage_t {\n\n public:\n\n typedef _key_t key_t;\n\n typedef _val_t val_t;\n\n\n\n private:\n\n typedef typename ::jellyfish::invertible_hash::array<key_t, atomic, mem_block_t> key_ary_t;\n\n typedef typename ::jellyfish::direct_indexing::array<size_t, val_t, atomic, mem_block_t> val_ary_t;\n\n \n\n key_ary_t keys;\n\n val_ary_t vals;\n\n\n\n public:\n\n array(size_t _size, uint_t _key_len, uint_t _reprobe_limit,\n\n size_t *_reprobes) :\n\n keys(_size, _key_len, 0, _reprobe_limit, _reprobes),\n\n vals(keys.get_lsize())\n\n { }\n\n\n\n array(char *keys_map, char *vals_map,\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/aligned_values_array.hpp","rank":45,"score":261580.8212873121},{"content":"struct StaticAssertTypeEqHelper;\n\n\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":46,"score":259293.83566585646},{"content":"class TypeParameterizedTestCase {\n\n public:\n\n static bool Register(const char* prefix, const char* case_name,\n\n const char* test_names) {\n\n typedef typename Tests::Head Head;\n\n\n\n // First, register the first test in 'Test' for each type in 'Types'.\n\n TypeParameterizedTest<Fixture, Head, Types>::Register(\n\n prefix, case_name, test_names, 0);\n\n\n\n // Next, recurses (at compile time) with the tail of the test list.\n\n return TypeParameterizedTestCase<Fixture, typename Tests::Tail, Types>\n\n ::Register(prefix, case_name, SkipComma(test_names));\n\n }\n\n};\n\n\n\n// The base case for the compile time recursion.\n\ntemplate <GTEST_TEMPLATE_ Fixture, typename Types>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":47,"score":258397.7464239542},{"content":"// Helper for suppressing false warning from Clang on a const char*\n\n// variable declared in a conditional expression always being NULL in\n\n// the else branch.\n\nstruct GTEST_API_ ConstCharPtr {\n\n ConstCharPtr(const char* str) : value(str) {}\n\n operator bool() const { return true; }\n\n const char* value;\n\n};\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":48,"score":255696.429730216},{"content":"class ErrorWriting : public std::exception {\n\n std::string msg;\n\npublic:\n\n explicit ErrorWriting(const std::string &_msg) : msg(_msg) {}\n\n virtual ~ErrorWriting() throw() {}\n\n virtual const char* what() const throw() {\n\n return msg.c_str();\n\n }\n\n};\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/hash_merge.cc","rank":49,"score":254215.3576770229},{"content":" class string : public ::std::string {\n\n public:\n\n string() : ::std::string() {}\n\n explicit string(const ::std::string &s) : std::string(s) {}\n\n explicit string(const char *s) : ::std::string(s) {}\n\n int as_enum(const char* const strs[]) {\n\n ::std::string err;\n\n int res = conv_enum((const char*)this->c_str(), err, strs);\n\n if(!err.empty())\n\n throw ::std::runtime_error(err);\n\n return res;\n\n }\n\n\n\n\n\n uint32_t as_uint32_suffix() const { return as_uint32(true); }\n\n uint32_t as_uint32(bool si_suffix = false) const {\n\n ::std::string err;\n\n uint32_t res = conv_uint<uint32_t>((const char*)this->c_str(), err, si_suffix);\n\n if(!err.empty()) {\n\n ::std::string msg(\"Invalid conversion of '\");\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/count_main_cmdline.hpp","rank":50,"score":254096.04286682548},{"content":"class EqHelper<true> {\n\n public:\n\n // We define two overloaded versions of Compare(). The first\n\n // version will be picked when the second argument to ASSERT_EQ() is\n\n // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or\n\n // EXPECT_EQ(false, a_bool).\n\n template <typename T1, typename T2>\n\n static AssertionResult Compare(\n\n const char* expected_expression,\n\n const char* actual_expression,\n\n const T1& expected,\n\n const T2& actual,\n\n // The following line prevents this overload from being considered if T2\n\n // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr)\n\n // expands to Compare(\"\", \"\", NULL, my_ptr), which requires a conversion\n\n // to match the Secret* in the other overload, which would otherwise make\n\n // this template match better.\n\n typename EnableIf<!is_pointer<T2>::value>::type* = 0) {\n\n return CmpHelperEQ(expected_expression, actual_expression, expected,\n\n actual);\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h","rank":51,"score":253957.3941003691},{"content":"class TypeParameterizedTestCase<Fixture, Templates0, Types> {\n\n public:\n\n static bool Register(const char* /*prefix*/, const char* /*case_name*/,\n\n const char* /*test_names*/) {\n\n return true;\n\n }\n\n};\n\n\n\n#endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P\n\n\n\n// Returns the current OS stack trace as a String.\n\n//\n\n// The maximum number of stack frames to be included is specified by\n\n// the gtest_stack_trace_depth flag. The skip_count parameter\n\n// specifies the number of top frames to be skipped, which doesn't\n\n// count against the number of frames to be included.\n\n//\n\n// For example, if Foo() calls Bar(), which in turn calls\n\n// GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in\n\n// the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't.\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":52,"score":253578.85434808198},{"content":" class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \\\n\n : public CaseName<gtest_TypeParam_> { \\\n\n private: \\\n\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\n\n typedef gtest_TypeParam_ TypeParam; \\\n\n virtual void TestBody(); \\\n\n }; \\\n\n bool gtest_##CaseName##_##TestName##_registered_ GTEST_ATTRIBUTE_UNUSED_ = \\\n\n ::testing::internal::TypeParameterizedTest< \\\n\n CaseName, \\\n\n ::testing::internal::TemplateSel< \\\n\n GTEST_TEST_CLASS_NAME_(CaseName, TestName)>, \\\n\n GTEST_TYPE_PARAMS_(CaseName)>::Register(\\\n\n \"\", #CaseName, #TestName, 0); \\\n\n template <typename gtest_TypeParam_> \\\n\n void GTEST_TEST_CLASS_NAME_(CaseName, TestName)<gtest_TypeParam_>::TestBody()\n\n\n\n#endif // GTEST_HAS_TYPED_TEST\n\n\n\n// Implements type-parameterized tests.\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-typed-test.h","rank":53,"score":253238.52919145327},{"content":"class CRandomMother { // Encapsulate random number generator\n\npublic:\n\n void RandomInit(int seed); // Initialization\n\n int IRandom(int min, int max); // Get integer random number in desired interval\n\n double Random(); // Get floating point random number\n\n uint32_t BRandom(); // Output random bits\n\n explicit CRandomMother(int seed) { // Constructor\n\n RandomInit(seed);}\n\nprotected:\n\n uint32_t x[5]; // History buffer\n\n};\n\n\n\n#endif // __cplusplus\n\n#endif // RANDOMC_H\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/randomc.h","rank":54,"score":250516.96644426516},{"content":"class CRandomMersenne { // Encapsulate random number generator\n\n// Choose which version of Mersenne Twister you want:\n\n#if 0 \n\n// Define constants for type MT11213A:\n\n#define MERS_N 351\n\n#define MERS_M 175\n\n#define MERS_R 19\n\n#define MERS_U 11\n\n#define MERS_S 7\n\n#define MERS_T 15\n\n#define MERS_L 17\n\n#define MERS_A 0xE4BD75F5\n\n#define MERS_B 0x655E5280\n\n#define MERS_C 0xFFD58000\n\n#else \n\n// or constants for type MT19937:\n\n#define MERS_N 624\n\n#define MERS_M 397\n\n#define MERS_R 31\n\n#define MERS_U 11\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/randomc.h","rank":55,"score":250516.96644426516},{"content":"struct StaticAssertTypeEqHelper<T, T> {};\n\n\n\n#if GTEST_HAS_GLOBAL_STRING\n\ntypedef ::string string;\n\n#else\n\ntypedef ::std::string string;\n\n#endif // GTEST_HAS_GLOBAL_STRING\n\n\n\n#if GTEST_HAS_GLOBAL_WSTRING\n\ntypedef ::wstring wstring;\n\n#elif GTEST_HAS_STD_WSTRING\n\ntypedef ::std::wstring wstring;\n\n#endif // GTEST_HAS_GLOBAL_WSTRING\n\n\n\n// A helper for suppressing warnings on constant condition. It just\n\n// returns 'condition'.\n\nGTEST_API_ bool IsTrue(bool condition);\n\n\n\n// Defines scoped_ptr.\n\n\n\n// This implementation of scoped_ptr is PARTIAL - it only contains\n\n// enough stuff to satisfy Google Test's need.\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":56,"score":246821.68418338487},{"content":"// State of the definition of a type-parameterized test case.\n\nclass GTEST_API_ TypedTestCasePState {\n\n public:\n\n TypedTestCasePState() : registered_(false) {}\n\n\n\n // Adds the given test name to defined_test_names_ and return true\n\n // if the test case hasn't been registered; otherwise aborts the\n\n // program.\n\n bool AddTestName(const char* file, int line, const char* case_name,\n\n const char* test_name) {\n\n if (registered_) {\n\n fprintf(stderr, \"%s Test %s must be defined before \"\n\n \"REGISTER_TYPED_TEST_CASE_P(%s, ...).\\n\",\n\n FormatFileLocation(file, line).c_str(), test_name, case_name);\n\n fflush(stderr);\n\n posix::Abort();\n\n }\n\n defined_test_names_.insert(test_name);\n\n return true;\n\n }\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":57,"score":246443.33577027763},{"content":"class TestWithParam : public Test, public WithParamInterface<T> {\n\n};\n\n\n\n#endif // GTEST_HAS_PARAM_TEST\n\n\n\n// Macros for indicating success/failure in test code.\n\n\n\n// ADD_FAILURE unconditionally adds a failure to the current test.\n\n// SUCCEED generates a success - it doesn't automatically make the\n\n// current test successful, as a test is only successful when it has\n\n// no failure.\n\n//\n\n// EXPECT_* verifies that a certain condition is satisfied. If not,\n\n// it behaves like ADD_FAILURE. In particular:\n\n//\n\n// EXPECT_TRUE verifies that a Boolean condition is true.\n\n// EXPECT_FALSE verifies that a Boolean condition is false.\n\n//\n\n// FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except\n\n// that they will also abort the current function on failure. People\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h","rank":58,"score":246114.6251949954},{"content":"// A working implementation of the OsStackTraceGetterInterface interface.\n\nclass OsStackTraceGetter : public OsStackTraceGetterInterface {\n\n public:\n\n OsStackTraceGetter() : caller_frame_(NULL) {}\n\n virtual String CurrentStackTrace(int max_depth, int skip_count);\n\n virtual void UponLeavingGTest();\n\n\n\n // This string is inserted in place of stack frames that are part of\n\n // Google Test's implementation.\n\n static const char* const kElidedFramesMarker;\n\n\n\n private:\n\n Mutex mutex_; // protects all internal state\n\n\n\n // We save the stack frame below the frame that calls user code.\n\n // We do this because the address of the frame immediately below\n\n // the user code changes between the call to UponLeavingGTest()\n\n // and any calls to CurrentStackTrace() from within the user code.\n\n void* caller_frame_;\n\n\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetter);\n\n};\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/src/gtest-internal-inl.h","rank":59,"score":243931.47780125585},{"content":"struct IteratorTraits<const T*> {\n\n typedef T value_type;\n\n};\n\n\n\n#if GTEST_OS_WINDOWS\n\n# define GTEST_PATH_SEP_ \"\\\\\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 1\n\n// The biggest signed integer type the compiler supports.\n\ntypedef __int64 BiggestInt;\n\n#else\n\n# define GTEST_PATH_SEP_ \"/\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 0\n\ntypedef long long BiggestInt; // NOLINT\n\n#endif // GTEST_OS_WINDOWS\n\n\n\n// Utilities for char.\n\n\n\n// isspace(int ch) and friends accept an unsigned char or EOF. char\n\n// may be signed, depending on the compiler (or compiler flags).\n\n// Therefore we need to cast a char to unsigned char before calling\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":60,"score":243902.89101124124},{"content":"class UniversalPrinter<T[N]> {\n\n public:\n\n // Prints the given array, omitting some elements when there are too\n\n // many.\n\n static void Print(const T (&a)[N], ::std::ostream* os) {\n\n UniversalPrintArray(a, N, os);\n\n }\n\n};\n\n\n\n// Implements printing a reference type T&.\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-printers.h","rank":61,"score":242791.93522003427},{"content":"// The Mutex class can only be used for mutexes created at runtime. It\n\n// shares its API with MutexBase otherwise.\n\nclass Mutex : public MutexBase {\n\n public:\n\n Mutex() {\n\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL));\n\n owner_ = 0;\n\n }\n\n ~Mutex() {\n\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_));\n\n }\n\n\n\n private:\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex);\n\n};\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":62,"score":240039.95126593817},{"content":"// The convenience class for users who need to override just one or two\n\n// methods and are not concerned that a possible change to a signature of\n\n// the methods they override will not be caught during the build. For\n\n// comments about each method please see the definition of TestEventListener\n\n// above.\n\nclass EmptyTestEventListener : public TestEventListener {\n\n public:\n\n virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {}\n\n virtual void OnTestIterationStart(const UnitTest& /*unit_test*/,\n\n int /*iteration*/) {}\n\n virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {}\n\n virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {}\n\n virtual void OnTestCaseStart(const TestCase& /*test_case*/) {}\n\n virtual void OnTestStart(const TestInfo& /*test_info*/) {}\n\n virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {}\n\n virtual void OnTestEnd(const TestInfo& /*test_info*/) {}\n\n virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {}\n\n virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {}\n\n virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {}\n\n virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/,\n\n int /*iteration*/) {}\n\n virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {}\n\n};\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h","rank":63,"score":235499.09584645365},{"content":"class ThreadWithParam : public ThreadWithParamBase {\n\n public:\n\n typedef void (*UserThreadFunc)(T);\n\n\n\n ThreadWithParam(\n\n UserThreadFunc func, T param, Notification* thread_can_start)\n\n : func_(func),\n\n param_(param),\n\n thread_can_start_(thread_can_start),\n\n finished_(false) {\n\n ThreadWithParamBase* const base = this;\n\n // The thread can be created only after all fields except thread_\n\n // have been initialized.\n\n GTEST_CHECK_POSIX_SUCCESS_(\n\n pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base));\n\n }\n\n ~ThreadWithParam() { Join(); }\n\n\n\n void Join() {\n\n if (!finished_) {\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":64,"score":235494.29727300708},{"content":"class TestFactoryImpl : public TestFactoryBase {\n\n public:\n\n virtual Test* CreateTest() { return new TestClass; }\n\n};\n\n\n\n#if GTEST_OS_WINDOWS\n\n\n\n// Predicate-formatters for implementing the HRESULT checking macros\n\n// {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}\n\n// We pass a long instead of HRESULT to avoid causing an\n\n// include dependency for the HRESULT type.\n\nGTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr,\n\n long hr); // NOLINT\n\nGTEST_API_ AssertionResult IsHRESULTFailure(const char* expr,\n\n long hr); // NOLINT\n\n\n\n#endif // GTEST_OS_WINDOWS\n\n\n\n// Types of SetUpTestCase() and TearDownTestCase() functions.\n\ntypedef void (*SetUpTestCaseFunc)();\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":65,"score":233314.31408302265},{"content":"class BaseTest : public ::testing::Test {\n\n // You can inherit all the usual members for a non-parameterized test\n\n // fixture here.\n\n};\n\n\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-param-test.h","rank":66,"score":232659.1795088345},{"content":"// A failed Google Test assertion will throw an exception of this type when\n\n// GTEST_FLAG(throw_on_failure) is true (if exceptions are enabled). We\n\n// derive it from std::runtime_error, which is for errors presumably\n\n// detectable only at run time. Since std::runtime_error inherits from\n\n// std::exception, many testing frameworks know how to extract and print the\n\n// message inside it.\n\nclass GoogleTestFailureException : public ::std::runtime_error {\n\n public:\n\n explicit GoogleTestFailureException(const TestPartResult& failure)\n\n : ::std::runtime_error(PrintTestPartResultToString(failure).c_str()) {}\n\n};\n\n#endif // GTEST_HAS_EXCEPTIONS\n\n\n\nnamespace internal {\n\n// We put these helper functions in the internal namespace as IBM's xlC\n\n// compiler rejects the code if they were declared static.\n\n\n\n// Runs the given method and handles SEH exceptions it throws, when\n\n// SEH is supported; returns the 0-value for type Result in case of an\n\n// SEH exception. (Microsoft compilers cannot handle SEH and C++\n\n// exceptions in the same function. Therefore, we provide a separate\n\n// wrapper function for handling SEH exceptions.)\n\ntemplate <class T, typename Result>\n\nResult HandleSehExceptionsInMethodIfSupported(\n\n T* object, Result (T::*method)(), const char* location) {\n\n#if GTEST_HAS_SEH\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/src/gtest.cc","rank":67,"score":232590.3438832387},{"content":"class ParameterizedTestFactory : public TestFactoryBase {\n\n public:\n\n typedef typename TestClass::ParamType ParamType;\n\n explicit ParameterizedTestFactory(ParamType parameter) :\n\n parameter_(parameter) {}\n\n virtual Test* CreateTest() {\n\n TestClass::SetParam(¶meter_);\n\n return new TestClass();\n\n }\n\n\n\n private:\n\n const ParamType parameter_;\n\n\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory);\n\n};\n\n\n\n// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE.\n\n//\n\n// TestMetaFactoryBase is a base class for meta-factories that create\n\n// test factories for passing into MakeAndRegisterTestInfo function.\n\ntemplate <class ParamType>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h","rank":68,"score":231189.76074905344},{"content":"class ClassUniqueToAlwaysTrue {};\n\n}\n\n\n\nbool IsTrue(bool condition) { return condition; }\n\n\n\nbool AlwaysTrue() {\n\n#if GTEST_HAS_EXCEPTIONS\n\n // This condition is always false so AlwaysTrue() never actually throws,\n\n // but it makes the compiler think that it may throw.\n\n if (IsTrue(false))\n\n throw ClassUniqueToAlwaysTrue();\n\n#endif // GTEST_HAS_EXCEPTIONS\n\n return true;\n\n}\n\n\n\n// If *pstr starts with the given prefix, modifies *pstr to be right\n\n// past the prefix and returns true; otherwise leaves *pstr unchanged\n\n// and returns false. None of pstr, *pstr, and prefix can be NULL.\n\nbool SkipPrefix(const char* prefix, const char** pstr) {\n\n const size_t prefix_len = strlen(prefix);\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/src/gtest.cc","rank":69,"score":231001.19950436073},{"content":"struct AddRef { typedef T& type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":70,"score":229364.44087975562},{"content":"struct RemoveReference { typedef T type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":71,"score":229364.44087975565},{"content":"struct AddReference { typedef T& type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":72,"score":229364.44087975565},{"content":" class Iterator : public ParamIteratorInterface<T> {\n\n public:\n\n Iterator(const ParamGeneratorInterface<T>* base,\n\n typename ContainerType::const_iterator iterator)\n\n : base_(base), iterator_(iterator) {}\n\n virtual ~Iterator() {}\n\n\n\n virtual const ParamGeneratorInterface<T>* BaseGenerator() const {\n\n return base_;\n\n }\n\n virtual void Advance() {\n\n ++iterator_;\n\n value_.reset();\n\n }\n\n virtual ParamIteratorInterface<T>* Clone() const {\n\n return new Iterator(*this);\n\n }\n\n // We need to use cached value referenced by iterator_ because *iterator_\n\n // can return a temporary object (and of type other then T), so just\n\n // having \"return &*iterator_;\" doesn't work.\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h","rank":73,"score":228241.58534315112},{"content":"class RangeGenerator : public ParamGeneratorInterface<T> {\n\n public:\n\n RangeGenerator(T begin, T end, IncrementT step)\n\n : begin_(begin), end_(end),\n\n step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}\n\n virtual ~RangeGenerator() {}\n\n\n\n virtual ParamIteratorInterface<T>* Begin() const {\n\n return new Iterator(this, begin_, 0, step_);\n\n }\n\n virtual ParamIteratorInterface<T>* End() const {\n\n return new Iterator(this, end_, end_index_, step_);\n\n }\n\n\n\n private:\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h","rank":74,"score":226117.03200918192},{"content":"struct ByRef<T&> { typedef T& type; }; // NOLINT\n\n\n\n// A handy wrapper for ByRef.\n\n#define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef<T>::type\n\n\n\n// AddRef<T>::type is T if T is a reference; otherwise it's T&. This\n\n// is the same as tr1::add_reference<T>::type.\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":75,"score":225422.3250972037},{"content":"// For selecting which printer to use when a given type has neither <<\n\n// nor PrintTo().\n\nenum TypeKind {\n\n kProtobuf, // a protobuf type\n\n kConvertibleToInteger, // a type implicitly convertible to BiggestInt\n\n // (e.g. a named or unnamed enum type)\n\n kOtherType // anything else\n\n};\n\n\n\n// TypeWithoutFormatter<T, kTypeKind>::PrintValue(value, os) is called\n\n// by the universal printer to print a value of type T when neither\n\n// operator<< nor PrintTo() is defined for T, where kTypeKind is the\n\n// \"kind\" of T as defined by enum TypeKind.\n\ntemplate <typename T, TypeKind kTypeKind>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-printers.h","rank":76,"score":223746.60419191042},{"content":"struct RemoveReference<T&> { typedef T type; }; // NOLINT\n\n\n\n// A handy wrapper around RemoveReference that works when the argument\n\n// T depends on template parameters.\n\n#define GTEST_REMOVE_REFERENCE_(T) \\\n\n typename ::testing::internal::RemoveReference<T>::type\n\n\n\n// Removes const from a type if it is a const type, otherwise leaves\n\n// it unchanged. This is the same as tr1::remove_const, which is not\n\n// widely available yet.\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":77,"score":223232.79770637926},{"content":"struct AddRef<T&> { typedef T& type; }; // NOLINT\n\n\n\n// A handy wrapper for AddRef.\n\n#define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef<T>::type\n\n\n\n// A helper for implementing get<k>().\n\ntemplate <int k> class Get;\n\n\n\n// A helper for implementing tuple_element<k, T>. kIndexValid is true\n\n// iff k < the number of fields in tuple type T.\n\ntemplate <bool kIndexValid, int kIndex, class Tuple>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h","rank":78,"score":223232.79770637926},{"content":"struct AddReference<T&> { typedef T& type; }; // NOLINT\n\n\n\n// A handy wrapper around AddReference that works when the argument T\n\n// depends on template parameters.\n\n#define GTEST_ADD_REFERENCE_(T) \\\n\n typename ::testing::internal::AddReference<T>::type\n\n\n\n// Adds a reference to const on top of T as necessary. For example,\n\n// it transforms\n\n//\n\n// char ==> const char&\n\n// const char ==> const char&\n\n// char& ==> const char&\n\n// const char& ==> const char&\n\n//\n\n// The argument T must depend on some template parameters.\n\n#define GTEST_REFERENCE_TO_CONST_(T) \\\n\n GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T))\n\n\n\n// ImplicitlyConvertible<From, To>::value is a compile-time bool\n\n// constant that's true iff type From can be implicitly converted to\n\n// type To.\n\ntemplate <typename From, typename To>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":79,"score":223232.79770637926},{"content":" class dumper : public dumper_t, public thread_exec {\n\n typedef token_ring<locks::pthread::cond> token_ring_t;\n\n struct thread_info_t {\n\n token_ring_t::token *token;\n\n };\n\n const uint_t threads;\n\n const std::string file_prefix;\n\n storage_t *const ary;\n\n int file_index;\n\n token_ring_t tr;\n\n \n\n struct thread_info_t *thread_info;\n\n size_t nb_records, nb_blocks;\n\n std::ofstream *out;\n\n\n\n public:\n\n dumper(uint_t _threads, const char *_file_prefix, size_t chunk_size, storage_t *_ary) :\n\n threads(_threads), file_prefix(_file_prefix),\n\n ary(_ary), file_index(0), tr()\n\n {\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/raw_dumper.hpp","rank":80,"score":223173.28413626686},{"content":"class TestCase;\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h","rank":81,"score":222069.47032379985},{"content":" class sorted_dumper : public dumper_t, public thread_exec {\n\n typedef typename storage_t::overlap_iterator iterator;\n\n typedef compacted_hash::writer<storage_t> writer_t;\n\n typedef heap_t<iterator> oheap_t;\n\n typedef token_ring<locks::pthread::cond> token_ring_t;\n\n\n\n struct thread_info_t {\n\n writer_t writer;\n\n oheap_t heap;\n\n token_ring_t::token *token;\n\n };\n\n\n\n uint_t threads;\n\n std::string file_prefix;\n\n size_t buffer_size;\n\n uint_t klen, vlen;\n\n uint_t key_len, val_len;\n\n size_t record_len, nb_records, nb_blocks;\n\n storage_t *ary;\n\n int file_index;\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/sorted_dumper.hpp","rank":82,"score":221615.64368409564},{"content":" class ComputeOffsetsTest : public ::testing::TestWithParam<offset_test_param>\n\n {\n\n public:\n\n Offsets<uint64_t> offsets;\n\n\n\n ComputeOffsetsTest() :\n\n offsets(GetParam().key_len, GetParam().val_len, 15)\n\n { }\n\n\n\n ~ComputeOffsetsTest() { }\n\n };\n\n\n\n TEST_P(ComputeOffsetsTest, CheckCoherency) {\n\n const Offsets<uint64_t>::offset_t *it = NULL, *pit = NULL;\n\n const Offsets<uint64_t>::offset_t *lit = NULL, *lpit = NULL;\n\n uint_t k_len = GetParam().key_len;\n\n uint_t v_len = GetParam().val_len;\n\n uint_t kv_len = k_len + v_len;\n\n uint_t lk_len = 4;\n\n uint_t lv_len = kv_len - lk_len;\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/test_offsets_key_value.cc","rank":83,"score":221614.34458526858},{"content":"struct bool_constant {\n\n typedef bool_constant<bool_value> type;\n\n static const bool value = bool_value;\n\n};\n\ntemplate <bool bool_value> const bool bool_constant<bool_value>::value;\n\n\n\ntypedef bool_constant<false> false_type;\n\ntypedef bool_constant<true> true_type;\n\n\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":84,"score":220871.66418502445},{"content":" class direct_sorted_dumper : public dumper_t, public thread_exec {\n\n typedef typename storage_t::iterator iterator;\n\n typedef typename compacted_hash::writer<storage_t> writer_t;\n\n typedef token_ring<locks::pthread::cond> token_ring_t;\n\n\n\n struct thread_info_t {\n\n writer_t writer;\n\n token_ring_t::token *token;\n\n };\n\n\n\n uint_t threads;\n\n const char *file_prefix;\n\n size_t buffer_size;\n\n uint_t klen, vlen;\n\n uint_t key_len, val_len;\n\n size_t record_len, nb_records;\n\n storage_t *ary;\n\n int file_index;\n\n token_ring_t tr;\n\n uint64_t lower_count, upper_count;\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/direct_sorted_dumper.hpp","rank":85,"score":218597.12745035865},{"content":"class TypeWithSize {\n\n public:\n\n // This prevents the user from using TypeWithSize<N> with incorrect\n\n // values of N.\n\n typedef void UInt;\n\n};\n\n\n\n// The specialization for size 4.\n\ntemplate <>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h","rank":86,"score":216885.12875478246},{"content":"class TypeWithoutFormatter {\n\n public:\n\n // This default version is called when kTypeKind is kOtherType.\n\n static void PrintValue(const T& value, ::std::ostream* os) {\n\n PrintBytesInObjectTo(reinterpret_cast<const unsigned char*>(&value),\n\n sizeof(value), os);\n\n }\n\n};\n\n\n\n// We print a protobuf using its ShortDebugString() when the string\n\n// doesn't exceed this many characters; otherwise we print it using\n\n// DebugString() for better readability.\n\nconst size_t kProtobufOneLinerMaxLength = 50;\n\n\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-printers.h","rank":87,"score":216885.12875478246},{"content":" class hash : public hash_t {\n\n public:\n\n define_error_class(TableFull);\n\n // typedef typename std::pair<key_t,val_t> kv_t;\n\n typedef ary_t storage_t;\n\n typedef typename ary_t::iterator iterator;\n\n\n\n hash() : ary(NULL), dumper(NULL), dumping_initiated(false) {}\n\n explicit hash(ary_t *_ary) : ary(_ary), dumper(NULL), dumping_initiated(false) {}\n\n\n\n virtual ~hash() {}\n\n\n\n size_t get_size() const { return ary->get_size(); }\n\n uint_t get_key_len() const { return ary->get_key_len(); }\n\n uint_t get_val_len() const { return ary->get_val_len(); }\n\n uint_t get_max_reprobe() const { return ary->get_max_reprobe(); }\n\n size_t get_max_reprobe_offset() const { return ary->get_max_reprobe_offset(); }\n\n \n\n void set_dumper(dumper_t *new_dumper) { dumper = new_dumper; }\n\n Time get_writing_time() const { \n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/hash.hpp","rank":88,"score":216544.84863546852},{"content":"struct CompileAssertTypesEqual;\n\n\n\ntemplate <typename T>\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h","rank":89,"score":215913.0354147811},{"content":" {\"upper-count\", 1, 0, 'U'},\n\n {\"verbose\", 0, 0, 'v'},\n\n {\"output\", 1, 0, 'o'},\n\n {\"help\", 0, 0, 'h'},\n\n {\"usage\", 0, 0, USAGE_OPT},\n\n {\"version\", 0, 0, 'V'},\n\n {0, 0, 0, 0}\n\n };\n\n static const char *short_options = \"hVctL:U:vo:\";\n\n\n\n std::string err;\n\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n\n while(true) { \n\n int index = -1;\n\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n\n if(c == -1) break;\n\n switch(c) {\n\n case ':': \n\n std::cerr << \"Missing required argument for \"\n\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/dump_fastq_main_cmdline.hpp","rank":91,"score":102.21565083810376},{"content":" void parse(int argc, char* argv[]) {\n\n static struct option long_options[] = {\n\n {\"bibtex\", 0, 0, 'b'},\n\n {\"output\", 1, 0, 'o'},\n\n {\"help\", 0, 0, 'h'},\n\n {\"usage\", 0, 0, USAGE_OPT},\n\n {\"version\", 0, 0, 'V'},\n\n {0, 0, 0, 0}\n\n };\n\n static const char *short_options = \"hVbo:\";\n\n\n\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n\n while(true) { \n\n int index = -1;\n\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n\n if(c == -1) break;\n\n switch(c) {\n\n case ':': \n\n std::cerr << \"Missing required argument for \"\n\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/cite_cmdline.hpp","rank":92,"score":98.19930595393116},{"content":" {\"usage\", 0, 0, USAGE_OPT},\n\n {\"version\", 0, 0, 'V'},\n\n {0, 0, 0, 0}\n\n };\n\n static const char *short_options = \"hVctL:U:o:\";\n\n\n\n std::string err;\n\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n\n while(true) { \n\n int index = -1;\n\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n\n if(c == -1) break;\n\n switch(c) {\n\n case ':': \n\n std::cerr << \"Missing required argument for \"\n\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\n\n << std::endl;\n\n exit(1);\n\n case 'h':\n\n std::cout << usage() << \"\\n\\n\" << help() << std::endl;\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/dump_main_cmdline.hpp","rank":93,"score":95.05075436714039},{"content":" CHECK_ERR(double_t, optarg, \"-i, --increment=double\")\n\n break;\n\n case 'f':\n\n full_flag = true;\n\n break;\n\n }\n\n }\n\n\n\n // Parse arguments\n\n if(argc - optind != 1)\n\n error(\"Requires exactly 1 argument.\");\n\n db_arg = argv[optind];\n\n ++optind;\n\n }\n\n\n\n#define histo_fastq_main_args_USAGE \"Usage: jellyfish qhisto [options] db:string\"\n\n const char * usage() const { return histo_fastq_main_args_USAGE; }\n\n void error(const char *msg) { \n\n std::cerr << \"Error: \" << msg << \"\\n\" << usage()\n\n << \"\\nUse --help for more information\"\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/histo_fastq_main_cmdline.hpp","rank":95,"score":93.55025964726212},{"content":"\n\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n\n while(true) { \n\n int index = -1;\n\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n\n if(c == -1) break;\n\n switch(c) {\n\n case ':': \n\n std::cerr << \"Missing required argument for \"\n\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\n\n << std::endl;\n\n exit(1);\n\n case 'h':\n\n std::cout << usage() << \"\\n\\n\" << help() << std::endl;\n\n exit(0);\n\n case USAGE_OPT:\n\n std::cout << usage() << \"\\nUse --help for more information.\" << std::endl;\n\n exit(0);\n\n case 'V':\n\n print_version();\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/query_cmdline.hpp","rank":96,"score":91.12339205019302},{"content":" ::std::string err;\n\n#define CHECK_ERR(type,val,which) if(!err.empty()) { ::std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n\n while(true) {\n\n int index = -1;\n\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n\n if(c == -1) break;\n\n switch(c) {\n\n case ':':\n\n ::std::cerr << \"Missing required argument for \"\n\n << (index == -1 ? ::std::string(1, (char)optopt) : std::string(long_options[index].name))\n\n << ::std::endl;\n\n exit(1);\n\n case 'h':\n\n ::std::cout << usage() << \"\\n\\n\" << help() << std::endl;\n\n exit(0);\n\n case USAGE_OPT:\n\n ::std::cout << usage() << \"\\nUse --help for more information.\" << std::endl;\n\n exit(0);\n\n case 'V':\n\n print_version();\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/count_main_cmdline.hpp","rank":97,"score":90.3642265943503},{"content":" {\"output\", 1, 0, 'o'},\n\n {\"out-counter-len\", 1, 0, OUT_COUNTER_LEN_OPT},\n\n {\"out-buffer-size\", 1, 0, OUT_BUFFER_SIZE_OPT},\n\n {\"verbose\", 0, 0, 'v'},\n\n {\"help\", 0, 0, 'h'},\n\n {\"usage\", 0, 0, USAGE_OPT},\n\n {\"version\", 0, 0, 'V'},\n\n {0, 0, 0, 0}\n\n };\n\n static const char *short_options = \"hVs:o:v\";\n\n\n\n std::string err;\n\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n\n while(true) { \n\n int index = -1;\n\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n\n if(c == -1) break;\n\n switch(c) {\n\n case ':': \n\n std::cerr << \"Missing required argument for \"\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/hash_merge_cmdline.hpp","rank":98,"score":90.1042499324664},{"content":" };\n\n static const char *short_options = \"Vl:h:i:f\";\n\n\n\n std::string err;\n\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \"Invalid \" #type \" '\" << val << \"' for [\" which \"]: \" << err << \"\\n\"; exit(1); }\n\n while(true) { \n\n int index = -1;\n\n int c = getopt_long(argc, argv, short_options, long_options, &index);\n\n if(c == -1) break;\n\n switch(c) {\n\n case ':': \n\n std::cerr << \"Missing required argument for \"\n\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\n\n << std::endl;\n\n exit(1);\n\n case HELP_OPT:\n\n std::cout << usage() << \"\\n\\n\" << help() << std::endl;\n\n exit(0);\n\n case USAGE_OPT:\n\n std::cout << usage() << \"\\nUse --help for more information.\" << std::endl;\n","file_path":"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/histo_fastq_main_cmdline.hpp","rank":99,"score":87.95662058162483}],"string":"[\n {\n \"content\": \"struct tuple_size<GTEST_1_TUPLE_(T)> { static const int value = 1; };\\n\\n\\n\\ntemplate <GTEST_2_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 0,\n \"score\": 416406.8253525696\n },\n {\n \"content\": \"struct tuple_size<GTEST_0_TUPLE_(T)> { static const int value = 0; };\\n\\n\\n\\ntemplate <GTEST_1_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 1,\n \"score\": 416402.5838420616\n },\n {\n \"content\": \"struct tuple_size<GTEST_2_TUPLE_(T)> { static const int value = 2; };\\n\\n\\n\\ntemplate <GTEST_3_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 2,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_6_TUPLE_(T)> { static const int value = 6; };\\n\\n\\n\\ntemplate <GTEST_7_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 3,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_3_TUPLE_(T)> { static const int value = 3; };\\n\\n\\n\\ntemplate <GTEST_4_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 4,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_10_TUPLE_(T)> { static const int value = 10; };\\n\\n\\n\\ntemplate <int k, class Tuple>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 5,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_5_TUPLE_(T)> { static const int value = 5; };\\n\\n\\n\\ntemplate <GTEST_6_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 6,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_7_TUPLE_(T)> { static const int value = 7; };\\n\\n\\n\\ntemplate <GTEST_8_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 7,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_8_TUPLE_(T)> { static const int value = 8; };\\n\\n\\n\\ntemplate <GTEST_9_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 8,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_9_TUPLE_(T)> { static const int value = 9; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 9,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"struct tuple_size<GTEST_4_TUPLE_(T)> { static const int value = 4; };\\n\\n\\n\\ntemplate <GTEST_5_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 10,\n \"score\": 391806.44473026635\n },\n {\n \"content\": \"class FooTest : public ::testing::TestWithParam<const char*> {\\n\\n // You can implement all the usual class fixture members here.\\n\\n};\\n\\n\\n\\n// Then, use the TEST_P macro to define as many parameterized tests\\n\\n// for this fixture as you want. The _P suffix is for \\\"parameterized\\\"\\n\\n// or \\\"pattern\\\", whichever you prefer to think.\\n\\n\\n\\nTEST_P(FooTest, DoesBlah) {\\n\\n // Inside a test, access the test parameter with the GetParam() method\\n\\n // of the TestWithParam<T> class:\\n\\n EXPECT_TRUE(foo.Blah(GetParam()));\\n\\n ...\\n\\n}\\n\\n\\n\\nTEST_P(FooTest, HasBlahBlah) {\\n\\n ...\\n\\n}\\n\\n\\n\\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-param-test.h\",\n \"rank\": 11,\n \"score\": 361592.2892925329\n },\n {\n \"content\": \"struct is_pointer<T*> : public true_type {};\\n\\n\\n\\ntemplate <typename Iterator>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 12,\n \"score\": 327009.92499011045\n },\n {\n \"content\": \" class TestName : public CaseName<gtest_TypeParam_> { \\\\\\n\\n private: \\\\\\n\\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\\\\n\\n typedef gtest_TypeParam_ TypeParam; \\\\\\n\\n virtual void TestBody(); \\\\\\n\\n }; \\\\\\n\\n static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \\\\\\n\\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\\\\\\n\\n __FILE__, __LINE__, #CaseName, #TestName); \\\\\\n\\n } \\\\\\n\\n template <typename gtest_TypeParam_> \\\\\\n\\n void GTEST_CASE_NAMESPACE_(CaseName)::TestName<gtest_TypeParam_>::TestBody()\\n\\n\\n\\n# define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \\\\\\n\\n namespace GTEST_CASE_NAMESPACE_(CaseName) { \\\\\\n\\n typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \\\\\\n\\n } \\\\\\n\\n static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \\\\\\n\\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\\\\\\n\\n __FILE__, __LINE__, #__VA_ARGS__)\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-typed-test.h\",\n \"rank\": 13,\n \"score\": 326466.0368386953\n },\n {\n \"content\": \"struct RemoveConst<const T[N]> {\\n\\n typedef typename RemoveConst<T>::type type[N];\\n\\n};\\n\\n#endif\\n\\n\\n\\n// A handy wrapper around RemoveConst that works when the argument\\n\\n// T depends on template parameters.\\n\\n#define GTEST_REMOVE_CONST_(T) \\\\\\n\\n typename ::testing::internal::RemoveConst<T>::type\\n\\n\\n\\n// Turns const U&, U&, const U, and U all into U.\\n\\n#define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \\\\\\n\\n GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T))\\n\\n\\n\\n// Adds reference to a type if it is not a reference type,\\n\\n// otherwise leaves it unchanged. This is the same as\\n\\n// tr1::add_reference, which is not widely available yet.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 14,\n \"score\": 326160.0692892401\n },\n {\n \"content\": \"class mer_counting_fasta_direct : public mer_counting<jellyfish::parse_dna, direct_index_t> {\\n\\npublic:\\n\\n mer_counting_fasta_direct(const std::vector<const char *> &files,\\n\\n count_args &_args) :\\n\\n mer_counting<jellyfish::parse_dna, direct_index_t>(_args)\\n\\n {\\n\\n parser = new jellyfish::parse_dna(files.begin(), files.end(),\\n\\n args->mer_len_arg, args->buffers_arg,\\n\\n args->buffer_size_arg);\\n\\n ary = new direct_index_t::storage_t(2 * args->mer_len_arg);\\n\\n hash = new direct_index_t(ary);\\n\\n if(args->no_write_flag) {\\n\\n dumper = new jellyfish::noop_dumper();\\n\\n } else {\\n\\n if(args->raw_flag)\\n\\n std::cerr << \\\"Switch --raw not (yet) supported with direct indexing. Ignoring.\\\" << std::endl;\\n\\n direct_index_dumper_t *_dumper =\\n\\n new direct_index_dumper_t(args->threads_arg, args->output_arg.c_str(),\\n\\n args->out_buffer_size_arg,\\n\\n 8*args->out_counter_len_arg,\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc\",\n \"rank\": 15,\n \"score\": 319664.316422704\n },\n {\n \"content\": \"class mer_counting_qual_fasta_direct : public mer_counting<jellyfish::parse_qual_dna, direct_index_t> {\\n\\npublic:\\n\\n mer_counting_qual_fasta_direct(const std::vector<const char *> &files,\\n\\n count_args &_args) :\\n\\n mer_counting<jellyfish::parse_qual_dna, direct_index_t>(_args)\\n\\n {\\n\\n parser = new jellyfish::parse_qual_dna(files,\\n\\n args->mer_len_arg, args->buffers_arg,\\n\\n args->buffer_size_arg, args->quality_start_arg,\\n\\n args->min_quality_arg);\\n\\n ary = new direct_index_t::storage_t(2 * args->mer_len_arg);\\n\\n hash = new direct_index_t(ary);\\n\\n if(args->no_write_flag) {\\n\\n dumper = new jellyfish::noop_dumper();\\n\\n } else {\\n\\n if(args->raw_flag)\\n\\n std::cerr << \\\"Switch --raw not (yet) supported with direct indexing. Ignoring.\\\" << std::endl;\\n\\n direct_index_dumper_t *_dumper =\\n\\n new direct_index_dumper_t(args->threads_arg, args->output_arg.c_str(),\\n\\n args->out_buffer_size_arg,\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc\",\n \"rank\": 16,\n \"score\": 314897.01594195655\n },\n {\n \"content\": \"#define die if(1) err::die_t()\\n\\n#define eraise(e) if(1) err::raise_t<e>()\\n\\n#define define_error_class(name) \\\\\\n\\n class name : public std::runtime_error { \\\\\\n\\n public: explicit name(const std::string &txt) : std::runtime_error(txt) {} \\\\\\n\\n }\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/err.hpp\",\n \"rank\": 17,\n \"score\": 305628.80483490357\n },\n {\n \"content\": \"struct TupleElement<true, 1, GTEST_10_TUPLE_(T)> { typedef T1 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 18,\n \"score\": 305087.0739641233\n },\n {\n \"content\": \"struct TupleElement<true, 0, GTEST_10_TUPLE_(T)> { typedef T0 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 19,\n \"score\": 305082.83245361526\n },\n {\n \"content\": \"class DerivedTest : public BaseTest, public ::testing::WithParamInterface<int> {\\n\\n // The usual test fixture members go here too.\\n\\n};\\n\\n\\n\\nTEST_F(BaseTest, HasFoo) {\\n\\n // This is an ordinary non-parameterized test.\\n\\n}\\n\\n\\n\\nTEST_P(DerivedTest, DoesBlah) {\\n\\n // GetParam works just the same here as if you inherit from TestWithParam.\\n\\n EXPECT_TRUE(foo.Blah(GetParam()));\\n\\n}\\n\\n\\n\\n#endif // 0\\n\\n\\n\\n#include \\\"gtest/internal/gtest-port.h\\\"\\n\\n\\n\\n#if !GTEST_OS_SYMBIAN\\n\\n# include <utility>\\n\\n#endif\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-param-test.h\",\n \"rank\": 20,\n \"score\": 303715.3787569794\n },\n {\n \"content\": \"struct RemoveConst<const T> { typedef T type; }; // NOLINT\\n\\n\\n\\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\\n\\n// definition to fail to remove the const in 'const int[3]' and 'const\\n\\n// char[3][4]'. The following specialization works around the bug.\\n\\n// However, it causes trouble with GCC and thus needs to be\\n\\n// conditionally compiled.\\n\\n#if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__)\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 21,\n \"score\": 300269.94545915036\n },\n {\n \"content\": \"struct ByRef { typedef const T& type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 22,\n \"score\": 298316.6096498102\n },\n {\n \"content\": \"struct is_pointer : public false_type {};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 23,\n \"score\": 289508.80635476613\n },\n {\n \"content\": \" // Holds a value of type T.\\n\\n class ValueHolder : public ThreadLocalValueHolderBase {\\n\\n public:\\n\\n explicit ValueHolder(const T& value) : value_(value) {}\\n\\n\\n\\n T* pointer() { return &value_; }\\n\\n\\n\\n private:\\n\\n T value_;\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ValueHolder);\\n\\n };\\n\\n\\n\\n static pthread_key_t CreateKey() {\\n\\n pthread_key_t key;\\n\\n // When a thread exits, DeleteThreadLocalValue() will be called on\\n\\n // the object managed for that thread.\\n\\n GTEST_CHECK_POSIX_SUCCESS_(\\n\\n pthread_key_create(&key, &DeleteThreadLocalValue));\\n\\n return key;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 24,\n \"score\": 287550.99943429907\n },\n {\n \"content\": \"struct TupleElement<true, 4, GTEST_10_TUPLE_(T)> { typedef T4 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 25,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"struct TupleElement<true, 6, GTEST_10_TUPLE_(T)> { typedef T6 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 26,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"struct TupleElement<true, 8, GTEST_10_TUPLE_(T)> { typedef T8 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 27,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"struct TupleElement<true, 3, GTEST_10_TUPLE_(T)> { typedef T3 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 28,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"struct TupleElement<true, 7, GTEST_10_TUPLE_(T)> { typedef T7 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 29,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"struct TupleElement<true, 5, GTEST_10_TUPLE_(T)> { typedef T5 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 30,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"struct TupleElement<true, 2, GTEST_10_TUPLE_(T)> { typedef T2 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 31,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"struct TupleElement<true, 9, GTEST_10_TUPLE_(T)> { typedef T9 type; };\\n\\n\\n\\n} // namespace gtest_internal\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 32,\n \"score\": 280486.6933418201\n },\n {\n \"content\": \"class ParameterizedTestCaseInfo : public ParameterizedTestCaseInfoBase {\\n\\n public:\\n\\n // ParamType and GeneratorCreationFunc are private types but are required\\n\\n // for declarations of public methods AddTestPattern() and\\n\\n // AddTestCaseInstantiation().\\n\\n typedef typename TestCase::ParamType ParamType;\\n\\n // A function that returns an instance of appropriate generator type.\\n\\n typedef ParamGenerator<ParamType>(GeneratorCreationFunc)();\\n\\n\\n\\n explicit ParameterizedTestCaseInfo(const char* name)\\n\\n : test_case_name_(name) {}\\n\\n\\n\\n // Test case base name for display purposes.\\n\\n virtual const string& GetTestCaseName() const { return test_case_name_; }\\n\\n // Test case id to verify identity.\\n\\n virtual TypeId GetTestCaseTypeId() const { return GetTypeId<TestCase>(); }\\n\\n // TEST_P macro uses AddTestPattern() to record information\\n\\n // about a single test in a LocalTestInfo structure.\\n\\n // test_case_name is the base name of the test case (without invocation\\n\\n // prefix). test_base_name is the name of an individual test without\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 33,\n \"score\": 280326.48300916073\n },\n {\n \"content\": \"class FooTest : public testing::Test {\\n\\n ...\\n\\n};\\n\\n\\n\\n// Next, declare that you will define a type-parameterized test case\\n\\n// (the _P suffix is for \\\"parameterized\\\" or \\\"pattern\\\", whichever you\\n\\n// prefer):\\n\\nTYPED_TEST_CASE_P(FooTest);\\n\\n\\n\\n// Then, use TYPED_TEST_P() to define as many type-parameterized tests\\n\\n// for this type-parameterized test case as you want.\\n\\nTYPED_TEST_P(FooTest, DoesBlah) {\\n\\n // Inside a test, refer to TypeParam to get the type parameter.\\n\\n TypeParam n = 0;\\n\\n ...\\n\\n}\\n\\n\\n\\nTYPED_TEST_P(FooTest, HasPropertyA) { ... }\\n\\n\\n\\n// Now the tricky part: you need to register all test patterns before\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-typed-test.h\",\n \"rank\": 34,\n \"score\": 278226.2086145318\n },\n {\n \"content\": \"class mer_counting_quake : public mer_counting<jellyfish::parse_quake, fastq_hash_t> {\\n\\npublic:\\n\\n mer_counting_quake(std::vector<const char *>,\\n\\n count_args &_args) :\\n\\n mer_counting<jellyfish::parse_quake, fastq_hash_t>(_args)\\n\\n {\\n\\n parser = new jellyfish::parse_quake(args->file_arg,\\n\\n args->mer_len_arg, args->buffers_arg, \\n\\n args->buffer_size_arg, \\n\\n args->quality_start_arg);\\n\\n ary = new fastq_hash_t::storage_t(args->size_arg, 2*args->mer_len_arg,\\n\\n args->reprobes_arg, \\n\\n jellyfish::quadratic_reprobes);\\n\\n hash = new fastq_hash_t(ary);\\n\\n if(args->no_write_flag) {\\n\\n dumper = new jellyfish::noop_dumper();\\n\\n } else {\\n\\n dumper = new raw_fastq_dumper_t(args->threads_arg, args->output_arg.c_str(),\\n\\n args->out_buffer_size_arg,\\n\\n ary);\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc\",\n \"rank\": 35,\n \"score\": 277631.91260988\n },\n {\n \"content\": \"class mer_counting : public mer_counting_base, public thread_exec {\\n\\nprotected:\\n\\n count_args *args;\\n\\n locks::pthread::barrier sync_barrier;\\n\\n parser_t *parser;\\n\\n typename hash_t::storage_t *ary;\\n\\n hash_t *hash;\\n\\n jellyfish::dumper_t *dumper;\\n\\n uint64_t distinct, total;\\n\\n\\n\\npublic:\\n\\n explicit mer_counting(count_args &_args) :\\n\\n args(&_args), sync_barrier(args->threads_arg),\\n\\n distinct(0), total(0) {}\\n\\n\\n\\n ~mer_counting() { \\n\\n if(dumper)\\n\\n delete dumper;\\n\\n if(hash)\\n\\n delete hash;\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc\",\n \"rank\": 36,\n \"score\": 276426.75657765043\n },\n {\n \"content\": \"class mer_counting_fasta_hash : public mer_counting<jellyfish::parse_dna, inv_hash_t> {\\n\\npublic:\\n\\n mer_counting_fasta_hash(const std::vector<const char *> &files,\\n\\n count_args &_args) :\\n\\n mer_counting<jellyfish::parse_dna, inv_hash_t>(_args)\\n\\n {\\n\\n parser = new jellyfish::parse_dna(files.begin(), files.end(),\\n\\n args->mer_len_arg, args->buffers_arg,\\n\\n args->buffer_size_arg);\\n\\n ary = new inv_hash_t::storage_t(args->size_arg, 2*args->mer_len_arg,\\n\\n args->counter_len_arg, \\n\\n args->reprobes_arg, \\n\\n jellyfish::quadratic_reprobes);\\n\\n if(args->matrix_given) {\\n\\n std::ifstream fd;\\n\\n fd.exceptions(std::ifstream::eofbit|std::ifstream::failbit|std::ifstream::badbit);\\n\\n fd.open(args->matrix_arg.c_str());\\n\\n SquareBinaryMatrix m(&fd);\\n\\n fd.close();\\n\\n ary->set_matrix(m);\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc\",\n \"rank\": 37,\n \"score\": 275734.441437414\n },\n {\n \"content\": \"#define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\\\\\\n\\nclass GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\\\\\\n\\n public:\\\\\\n\\n GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\\\\\\n\\n private:\\\\\\n\\n virtual void TestBody();\\\\\\n\\n static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\\\\\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(\\\\\\n\\n GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\\\\\\n\\n};\\\\\\n\\n\\\\\\n\\n::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\\\\\\n\\n ::test_info_ =\\\\\\n\\n ::testing::internal::MakeAndRegisterTestInfo(\\\\\\n\\n #test_case_name, #test_name, NULL, NULL, \\\\\\n\\n (parent_id), \\\\\\n\\n parent_class::SetUpTestCase, \\\\\\n\\n parent_class::TearDownTestCase, \\\\\\n\\n new ::testing::internal::TestFactoryImpl<\\\\\\n\\n GTEST_TEST_CLASS_NAME_(test_case_name, test_name)>);\\\\\\n\\nvoid GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody()\\n\\n\\n\\n#ifdef __ICC\\n\\n// Disable explicit warning on Intel compiler\\n\\n#pragma warning enable 2304\\n\\n#endif\\n\\n\\n\\n#endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 38,\n \"score\": 274514.8057984098\n },\n {\n \"content\": \"struct RemoveConst { typedef T type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 39,\n \"score\": 274446.60236797674\n },\n {\n \"content\": \"class fstream_default : public Base {\\n\\n typedef Base super;\\n\\n static std::streambuf* open_file(const char* str, std::ios_base::openmode mode) {\\n\\n std::filebuf* fb = new std::filebuf;\\n\\n return fb->open(str, mode);\\n\\n }\\n\\n\\n\\n static std::streambuf* get_streambuf(const char* str, Base& def, \\n\\n std::ios_base::openmode mode) {\\n\\n return (str != 0) ? open_file(str, mode) : def.rdbuf();\\n\\n }\\n\\n static std::streambuf* get_streambuf(const char* str, std::streambuf* buf, \\n\\n std::ios_base::openmode mode) {\\n\\n return (str != 0) ? open_file(str, mode) : buf;\\n\\n }\\n\\n\\n\\n bool do_close;\\n\\npublic:\\n\\n fstream_default(const char* str, Base& def, std::ios_base::openmode mode = def_mode) :\\n\\n Base(get_streambuf(str, def, mode)), do_close(str != 0) { \\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/fstream_default.hpp\",\n \"rank\": 40,\n \"score\": 273369.3888964084\n },\n {\n \"content\": \"class mer_counting_qual_fasta_hash : public mer_counting<jellyfish::parse_qual_dna, inv_hash_t> {\\n\\npublic:\\n\\n mer_counting_qual_fasta_hash(const std::vector<const char *> &files,\\n\\n count_args &_args) :\\n\\n mer_counting<jellyfish::parse_qual_dna, inv_hash_t>(_args)\\n\\n {\\n\\n parser = new jellyfish::parse_qual_dna(files,\\n\\n args->mer_len_arg, args->buffers_arg,\\n\\n args->buffer_size_arg, args->quality_start_arg,\\n\\n args->min_quality_arg);\\n\\n ary = new inv_hash_t::storage_t(args->size_arg, 2*args->mer_len_arg,\\n\\n args->counter_len_arg, \\n\\n args->reprobes_arg, \\n\\n jellyfish::quadratic_reprobes);\\n\\n if(args->matrix_given) {\\n\\n std::ifstream fd;\\n\\n fd.exceptions(std::ifstream::eofbit|std::ifstream::failbit|std::ifstream::badbit);\\n\\n fd.open(args->matrix_arg.c_str());\\n\\n SquareBinaryMatrix m(&fd);\\n\\n fd.close();\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/mer_counter.cc\",\n \"rank\": 41,\n \"score\": 272056.43702638487\n },\n {\n \"content\": \"// A concrete DeathTestFactory implementation for normal use.\\n\\nclass DefaultDeathTestFactory : public DeathTestFactory {\\n\\n public:\\n\\n virtual bool Create(const char* statement, const RE* regex,\\n\\n const char* file, int line, DeathTest** test);\\n\\n};\\n\\n\\n\\n// Returns true if exit_status describes a process that was terminated\\n\\n// by a signal, or exited normally with a nonzero exit code.\\n\\nGTEST_API_ bool ExitedUnsuccessfully(int exit_status);\\n\\n\\n\\n// Traps C++ exceptions escaping statement and reports them as test\\n\\n// failures. Note that trapping SEH exceptions is not implemented here.\\n\\n# if GTEST_HAS_EXCEPTIONS\\n\\n# define GTEST_EXECUTE_DEATH_TEST_STATEMENT_(statement, death_test) \\\\\\n\\n try { \\\\\\n\\n GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \\\\\\n\\n } catch (const ::std::exception& gtest_exception) { \\\\\\n\\n fprintf(\\\\\\n\\n stderr, \\\\\\n\\n \\\"\\\\n%s: Caught std::exception-derived exception escaping the \\\" \\\\\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-death-test-internal.h\",\n \"rank\": 42,\n \"score\": 269971.9165508655\n },\n {\n \"content\": \" class Iterator : public ParamIteratorInterface<ParamType> {\\n\\n public:\\n\\n Iterator(const ParamGeneratorInterface<ParamType>* base,\\n\\n const ParamGenerator<T1>& g1,\\n\\n const typename ParamGenerator<T1>::iterator& current1,\\n\\n const ParamGenerator<T2>& g2,\\n\\n const typename ParamGenerator<T2>::iterator& current2,\\n\\n const ParamGenerator<T3>& g3,\\n\\n const typename ParamGenerator<T3>::iterator& current3,\\n\\n const ParamGenerator<T4>& g4,\\n\\n const typename ParamGenerator<T4>::iterator& current4,\\n\\n const ParamGenerator<T5>& g5,\\n\\n const typename ParamGenerator<T5>::iterator& current5,\\n\\n const ParamGenerator<T6>& g6,\\n\\n const typename ParamGenerator<T6>::iterator& current6,\\n\\n const ParamGenerator<T7>& g7,\\n\\n const typename ParamGenerator<T7>::iterator& current7,\\n\\n const ParamGenerator<T8>& g8,\\n\\n const typename ParamGenerator<T8>::iterator& current8,\\n\\n const ParamGenerator<T9>& g9,\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util-generated.h\",\n \"rank\": 43,\n \"score\": 267324.6985924891\n },\n {\n \"content\": \"class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface<T> {\\n\\n public:\\n\\n template <typename ForwardIterator>\\n\\n ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end)\\n\\n : container_(begin, end) {}\\n\\n virtual ~ValuesInIteratorRangeGenerator() {}\\n\\n\\n\\n virtual ParamIteratorInterface<T>* Begin() const {\\n\\n return new Iterator(this, container_.begin());\\n\\n }\\n\\n virtual ParamIteratorInterface<T>* End() const {\\n\\n return new Iterator(this, container_.end());\\n\\n }\\n\\n\\n\\n private:\\n\\n typedef typename ::std::vector<T> ContainerType;\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 44,\n \"score\": 264726.4635216782\n },\n {\n \"content\": \" class array : public storage_t {\\n\\n public:\\n\\n typedef _key_t key_t;\\n\\n typedef _val_t val_t;\\n\\n\\n\\n private:\\n\\n typedef typename ::jellyfish::invertible_hash::array<key_t, atomic, mem_block_t> key_ary_t;\\n\\n typedef typename ::jellyfish::direct_indexing::array<size_t, val_t, atomic, mem_block_t> val_ary_t;\\n\\n \\n\\n key_ary_t keys;\\n\\n val_ary_t vals;\\n\\n\\n\\n public:\\n\\n array(size_t _size, uint_t _key_len, uint_t _reprobe_limit,\\n\\n size_t *_reprobes) :\\n\\n keys(_size, _key_len, 0, _reprobe_limit, _reprobes),\\n\\n vals(keys.get_lsize())\\n\\n { }\\n\\n\\n\\n array(char *keys_map, char *vals_map,\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/aligned_values_array.hpp\",\n \"rank\": 45,\n \"score\": 261580.8212873121\n },\n {\n \"content\": \"struct StaticAssertTypeEqHelper;\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 46,\n \"score\": 259293.83566585646\n },\n {\n \"content\": \"class TypeParameterizedTestCase {\\n\\n public:\\n\\n static bool Register(const char* prefix, const char* case_name,\\n\\n const char* test_names) {\\n\\n typedef typename Tests::Head Head;\\n\\n\\n\\n // First, register the first test in 'Test' for each type in 'Types'.\\n\\n TypeParameterizedTest<Fixture, Head, Types>::Register(\\n\\n prefix, case_name, test_names, 0);\\n\\n\\n\\n // Next, recurses (at compile time) with the tail of the test list.\\n\\n return TypeParameterizedTestCase<Fixture, typename Tests::Tail, Types>\\n\\n ::Register(prefix, case_name, SkipComma(test_names));\\n\\n }\\n\\n};\\n\\n\\n\\n// The base case for the compile time recursion.\\n\\ntemplate <GTEST_TEMPLATE_ Fixture, typename Types>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 47,\n \"score\": 258397.7464239542\n },\n {\n \"content\": \"// Helper for suppressing false warning from Clang on a const char*\\n\\n// variable declared in a conditional expression always being NULL in\\n\\n// the else branch.\\n\\nstruct GTEST_API_ ConstCharPtr {\\n\\n ConstCharPtr(const char* str) : value(str) {}\\n\\n operator bool() const { return true; }\\n\\n const char* value;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 48,\n \"score\": 255696.429730216\n },\n {\n \"content\": \"class ErrorWriting : public std::exception {\\n\\n std::string msg;\\n\\npublic:\\n\\n explicit ErrorWriting(const std::string &_msg) : msg(_msg) {}\\n\\n virtual ~ErrorWriting() throw() {}\\n\\n virtual const char* what() const throw() {\\n\\n return msg.c_str();\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/hash_merge.cc\",\n \"rank\": 49,\n \"score\": 254215.3576770229\n },\n {\n \"content\": \" class string : public ::std::string {\\n\\n public:\\n\\n string() : ::std::string() {}\\n\\n explicit string(const ::std::string &s) : std::string(s) {}\\n\\n explicit string(const char *s) : ::std::string(s) {}\\n\\n int as_enum(const char* const strs[]) {\\n\\n ::std::string err;\\n\\n int res = conv_enum((const char*)this->c_str(), err, strs);\\n\\n if(!err.empty())\\n\\n throw ::std::runtime_error(err);\\n\\n return res;\\n\\n }\\n\\n\\n\\n\\n\\n uint32_t as_uint32_suffix() const { return as_uint32(true); }\\n\\n uint32_t as_uint32(bool si_suffix = false) const {\\n\\n ::std::string err;\\n\\n uint32_t res = conv_uint<uint32_t>((const char*)this->c_str(), err, si_suffix);\\n\\n if(!err.empty()) {\\n\\n ::std::string msg(\\\"Invalid conversion of '\\\");\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/count_main_cmdline.hpp\",\n \"rank\": 50,\n \"score\": 254096.04286682548\n },\n {\n \"content\": \"class EqHelper<true> {\\n\\n public:\\n\\n // We define two overloaded versions of Compare(). The first\\n\\n // version will be picked when the second argument to ASSERT_EQ() is\\n\\n // NOT a pointer, e.g. ASSERT_EQ(0, AnIntFunction()) or\\n\\n // EXPECT_EQ(false, a_bool).\\n\\n template <typename T1, typename T2>\\n\\n static AssertionResult Compare(\\n\\n const char* expected_expression,\\n\\n const char* actual_expression,\\n\\n const T1& expected,\\n\\n const T2& actual,\\n\\n // The following line prevents this overload from being considered if T2\\n\\n // is not a pointer type. We need this because ASSERT_EQ(NULL, my_ptr)\\n\\n // expands to Compare(\\\"\\\", \\\"\\\", NULL, my_ptr), which requires a conversion\\n\\n // to match the Secret* in the other overload, which would otherwise make\\n\\n // this template match better.\\n\\n typename EnableIf<!is_pointer<T2>::value>::type* = 0) {\\n\\n return CmpHelperEQ(expected_expression, actual_expression, expected,\\n\\n actual);\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h\",\n \"rank\": 51,\n \"score\": 253957.3941003691\n },\n {\n \"content\": \"class TypeParameterizedTestCase<Fixture, Templates0, Types> {\\n\\n public:\\n\\n static bool Register(const char* /*prefix*/, const char* /*case_name*/,\\n\\n const char* /*test_names*/) {\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\n#endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P\\n\\n\\n\\n// Returns the current OS stack trace as a String.\\n\\n//\\n\\n// The maximum number of stack frames to be included is specified by\\n\\n// the gtest_stack_trace_depth flag. The skip_count parameter\\n\\n// specifies the number of top frames to be skipped, which doesn't\\n\\n// count against the number of frames to be included.\\n\\n//\\n\\n// For example, if Foo() calls Bar(), which in turn calls\\n\\n// GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in\\n\\n// the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't.\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 52,\n \"score\": 253578.85434808198\n },\n {\n \"content\": \" class GTEST_TEST_CLASS_NAME_(CaseName, TestName) \\\\\\n\\n : public CaseName<gtest_TypeParam_> { \\\\\\n\\n private: \\\\\\n\\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\\\\n\\n typedef gtest_TypeParam_ TypeParam; \\\\\\n\\n virtual void TestBody(); \\\\\\n\\n }; \\\\\\n\\n bool gtest_##CaseName##_##TestName##_registered_ GTEST_ATTRIBUTE_UNUSED_ = \\\\\\n\\n ::testing::internal::TypeParameterizedTest< \\\\\\n\\n CaseName, \\\\\\n\\n ::testing::internal::TemplateSel< \\\\\\n\\n GTEST_TEST_CLASS_NAME_(CaseName, TestName)>, \\\\\\n\\n GTEST_TYPE_PARAMS_(CaseName)>::Register(\\\\\\n\\n \\\"\\\", #CaseName, #TestName, 0); \\\\\\n\\n template <typename gtest_TypeParam_> \\\\\\n\\n void GTEST_TEST_CLASS_NAME_(CaseName, TestName)<gtest_TypeParam_>::TestBody()\\n\\n\\n\\n#endif // GTEST_HAS_TYPED_TEST\\n\\n\\n\\n// Implements type-parameterized tests.\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-typed-test.h\",\n \"rank\": 53,\n \"score\": 253238.52919145327\n },\n {\n \"content\": \"class CRandomMother { // Encapsulate random number generator\\n\\npublic:\\n\\n void RandomInit(int seed); // Initialization\\n\\n int IRandom(int min, int max); // Get integer random number in desired interval\\n\\n double Random(); // Get floating point random number\\n\\n uint32_t BRandom(); // Output random bits\\n\\n explicit CRandomMother(int seed) { // Constructor\\n\\n RandomInit(seed);}\\n\\nprotected:\\n\\n uint32_t x[5]; // History buffer\\n\\n};\\n\\n\\n\\n#endif // __cplusplus\\n\\n#endif // RANDOMC_H\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/randomc.h\",\n \"rank\": 54,\n \"score\": 250516.96644426516\n },\n {\n \"content\": \"class CRandomMersenne { // Encapsulate random number generator\\n\\n// Choose which version of Mersenne Twister you want:\\n\\n#if 0 \\n\\n// Define constants for type MT11213A:\\n\\n#define MERS_N 351\\n\\n#define MERS_M 175\\n\\n#define MERS_R 19\\n\\n#define MERS_U 11\\n\\n#define MERS_S 7\\n\\n#define MERS_T 15\\n\\n#define MERS_L 17\\n\\n#define MERS_A 0xE4BD75F5\\n\\n#define MERS_B 0x655E5280\\n\\n#define MERS_C 0xFFD58000\\n\\n#else \\n\\n// or constants for type MT19937:\\n\\n#define MERS_N 624\\n\\n#define MERS_M 397\\n\\n#define MERS_R 31\\n\\n#define MERS_U 11\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/randomc.h\",\n \"rank\": 55,\n \"score\": 250516.96644426516\n },\n {\n \"content\": \"struct StaticAssertTypeEqHelper<T, T> {};\\n\\n\\n\\n#if GTEST_HAS_GLOBAL_STRING\\n\\ntypedef ::string string;\\n\\n#else\\n\\ntypedef ::std::string string;\\n\\n#endif // GTEST_HAS_GLOBAL_STRING\\n\\n\\n\\n#if GTEST_HAS_GLOBAL_WSTRING\\n\\ntypedef ::wstring wstring;\\n\\n#elif GTEST_HAS_STD_WSTRING\\n\\ntypedef ::std::wstring wstring;\\n\\n#endif // GTEST_HAS_GLOBAL_WSTRING\\n\\n\\n\\n// A helper for suppressing warnings on constant condition. It just\\n\\n// returns 'condition'.\\n\\nGTEST_API_ bool IsTrue(bool condition);\\n\\n\\n\\n// Defines scoped_ptr.\\n\\n\\n\\n// This implementation of scoped_ptr is PARTIAL - it only contains\\n\\n// enough stuff to satisfy Google Test's need.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 56,\n \"score\": 246821.68418338487\n },\n {\n \"content\": \"// State of the definition of a type-parameterized test case.\\n\\nclass GTEST_API_ TypedTestCasePState {\\n\\n public:\\n\\n TypedTestCasePState() : registered_(false) {}\\n\\n\\n\\n // Adds the given test name to defined_test_names_ and return true\\n\\n // if the test case hasn't been registered; otherwise aborts the\\n\\n // program.\\n\\n bool AddTestName(const char* file, int line, const char* case_name,\\n\\n const char* test_name) {\\n\\n if (registered_) {\\n\\n fprintf(stderr, \\\"%s Test %s must be defined before \\\"\\n\\n \\\"REGISTER_TYPED_TEST_CASE_P(%s, ...).\\\\n\\\",\\n\\n FormatFileLocation(file, line).c_str(), test_name, case_name);\\n\\n fflush(stderr);\\n\\n posix::Abort();\\n\\n }\\n\\n defined_test_names_.insert(test_name);\\n\\n return true;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 57,\n \"score\": 246443.33577027763\n },\n {\n \"content\": \"class TestWithParam : public Test, public WithParamInterface<T> {\\n\\n};\\n\\n\\n\\n#endif // GTEST_HAS_PARAM_TEST\\n\\n\\n\\n// Macros for indicating success/failure in test code.\\n\\n\\n\\n// ADD_FAILURE unconditionally adds a failure to the current test.\\n\\n// SUCCEED generates a success - it doesn't automatically make the\\n\\n// current test successful, as a test is only successful when it has\\n\\n// no failure.\\n\\n//\\n\\n// EXPECT_* verifies that a certain condition is satisfied. If not,\\n\\n// it behaves like ADD_FAILURE. In particular:\\n\\n//\\n\\n// EXPECT_TRUE verifies that a Boolean condition is true.\\n\\n// EXPECT_FALSE verifies that a Boolean condition is false.\\n\\n//\\n\\n// FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except\\n\\n// that they will also abort the current function on failure. People\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h\",\n \"rank\": 58,\n \"score\": 246114.6251949954\n },\n {\n \"content\": \"// A working implementation of the OsStackTraceGetterInterface interface.\\n\\nclass OsStackTraceGetter : public OsStackTraceGetterInterface {\\n\\n public:\\n\\n OsStackTraceGetter() : caller_frame_(NULL) {}\\n\\n virtual String CurrentStackTrace(int max_depth, int skip_count);\\n\\n virtual void UponLeavingGTest();\\n\\n\\n\\n // This string is inserted in place of stack frames that are part of\\n\\n // Google Test's implementation.\\n\\n static const char* const kElidedFramesMarker;\\n\\n\\n\\n private:\\n\\n Mutex mutex_; // protects all internal state\\n\\n\\n\\n // We save the stack frame below the frame that calls user code.\\n\\n // We do this because the address of the frame immediately below\\n\\n // the user code changes between the call to UponLeavingGTest()\\n\\n // and any calls to CurrentStackTrace() from within the user code.\\n\\n void* caller_frame_;\\n\\n\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(OsStackTraceGetter);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/src/gtest-internal-inl.h\",\n \"rank\": 59,\n \"score\": 243931.47780125585\n },\n {\n \"content\": \"struct IteratorTraits<const T*> {\\n\\n typedef T value_type;\\n\\n};\\n\\n\\n\\n#if GTEST_OS_WINDOWS\\n\\n# define GTEST_PATH_SEP_ \\\"\\\\\\\\\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 1\\n\\n// The biggest signed integer type the compiler supports.\\n\\ntypedef __int64 BiggestInt;\\n\\n#else\\n\\n# define GTEST_PATH_SEP_ \\\"/\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 0\\n\\ntypedef long long BiggestInt; // NOLINT\\n\\n#endif // GTEST_OS_WINDOWS\\n\\n\\n\\n// Utilities for char.\\n\\n\\n\\n// isspace(int ch) and friends accept an unsigned char or EOF. char\\n\\n// may be signed, depending on the compiler (or compiler flags).\\n\\n// Therefore we need to cast a char to unsigned char before calling\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 60,\n \"score\": 243902.89101124124\n },\n {\n \"content\": \"class UniversalPrinter<T[N]> {\\n\\n public:\\n\\n // Prints the given array, omitting some elements when there are too\\n\\n // many.\\n\\n static void Print(const T (&a)[N], ::std::ostream* os) {\\n\\n UniversalPrintArray(a, N, os);\\n\\n }\\n\\n};\\n\\n\\n\\n// Implements printing a reference type T&.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-printers.h\",\n \"rank\": 61,\n \"score\": 242791.93522003427\n },\n {\n \"content\": \"// The Mutex class can only be used for mutexes created at runtime. It\\n\\n// shares its API with MutexBase otherwise.\\n\\nclass Mutex : public MutexBase {\\n\\n public:\\n\\n Mutex() {\\n\\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL));\\n\\n owner_ = 0;\\n\\n }\\n\\n ~Mutex() {\\n\\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_));\\n\\n }\\n\\n\\n\\n private:\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 62,\n \"score\": 240039.95126593817\n },\n {\n \"content\": \"// The convenience class for users who need to override just one or two\\n\\n// methods and are not concerned that a possible change to a signature of\\n\\n// the methods they override will not be caught during the build. For\\n\\n// comments about each method please see the definition of TestEventListener\\n\\n// above.\\n\\nclass EmptyTestEventListener : public TestEventListener {\\n\\n public:\\n\\n virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnTestIterationStart(const UnitTest& /*unit_test*/,\\n\\n int /*iteration*/) {}\\n\\n virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnTestCaseStart(const TestCase& /*test_case*/) {}\\n\\n virtual void OnTestStart(const TestInfo& /*test_info*/) {}\\n\\n virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {}\\n\\n virtual void OnTestEnd(const TestInfo& /*test_info*/) {}\\n\\n virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {}\\n\\n virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/,\\n\\n int /*iteration*/) {}\\n\\n virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h\",\n \"rank\": 63,\n \"score\": 235499.09584645365\n },\n {\n \"content\": \"class ThreadWithParam : public ThreadWithParamBase {\\n\\n public:\\n\\n typedef void (*UserThreadFunc)(T);\\n\\n\\n\\n ThreadWithParam(\\n\\n UserThreadFunc func, T param, Notification* thread_can_start)\\n\\n : func_(func),\\n\\n param_(param),\\n\\n thread_can_start_(thread_can_start),\\n\\n finished_(false) {\\n\\n ThreadWithParamBase* const base = this;\\n\\n // The thread can be created only after all fields except thread_\\n\\n // have been initialized.\\n\\n GTEST_CHECK_POSIX_SUCCESS_(\\n\\n pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base));\\n\\n }\\n\\n ~ThreadWithParam() { Join(); }\\n\\n\\n\\n void Join() {\\n\\n if (!finished_) {\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 64,\n \"score\": 235494.29727300708\n },\n {\n \"content\": \"class TestFactoryImpl : public TestFactoryBase {\\n\\n public:\\n\\n virtual Test* CreateTest() { return new TestClass; }\\n\\n};\\n\\n\\n\\n#if GTEST_OS_WINDOWS\\n\\n\\n\\n// Predicate-formatters for implementing the HRESULT checking macros\\n\\n// {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}\\n\\n// We pass a long instead of HRESULT to avoid causing an\\n\\n// include dependency for the HRESULT type.\\n\\nGTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr,\\n\\n long hr); // NOLINT\\n\\nGTEST_API_ AssertionResult IsHRESULTFailure(const char* expr,\\n\\n long hr); // NOLINT\\n\\n\\n\\n#endif // GTEST_OS_WINDOWS\\n\\n\\n\\n// Types of SetUpTestCase() and TearDownTestCase() functions.\\n\\ntypedef void (*SetUpTestCaseFunc)();\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 65,\n \"score\": 233314.31408302265\n },\n {\n \"content\": \"class BaseTest : public ::testing::Test {\\n\\n // You can inherit all the usual members for a non-parameterized test\\n\\n // fixture here.\\n\\n};\\n\\n\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-param-test.h\",\n \"rank\": 66,\n \"score\": 232659.1795088345\n },\n {\n \"content\": \"// A failed Google Test assertion will throw an exception of this type when\\n\\n// GTEST_FLAG(throw_on_failure) is true (if exceptions are enabled). We\\n\\n// derive it from std::runtime_error, which is for errors presumably\\n\\n// detectable only at run time. Since std::runtime_error inherits from\\n\\n// std::exception, many testing frameworks know how to extract and print the\\n\\n// message inside it.\\n\\nclass GoogleTestFailureException : public ::std::runtime_error {\\n\\n public:\\n\\n explicit GoogleTestFailureException(const TestPartResult& failure)\\n\\n : ::std::runtime_error(PrintTestPartResultToString(failure).c_str()) {}\\n\\n};\\n\\n#endif // GTEST_HAS_EXCEPTIONS\\n\\n\\n\\nnamespace internal {\\n\\n// We put these helper functions in the internal namespace as IBM's xlC\\n\\n// compiler rejects the code if they were declared static.\\n\\n\\n\\n// Runs the given method and handles SEH exceptions it throws, when\\n\\n// SEH is supported; returns the 0-value for type Result in case of an\\n\\n// SEH exception. (Microsoft compilers cannot handle SEH and C++\\n\\n// exceptions in the same function. Therefore, we provide a separate\\n\\n// wrapper function for handling SEH exceptions.)\\n\\ntemplate <class T, typename Result>\\n\\nResult HandleSehExceptionsInMethodIfSupported(\\n\\n T* object, Result (T::*method)(), const char* location) {\\n\\n#if GTEST_HAS_SEH\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/src/gtest.cc\",\n \"rank\": 67,\n \"score\": 232590.3438832387\n },\n {\n \"content\": \"class ParameterizedTestFactory : public TestFactoryBase {\\n\\n public:\\n\\n typedef typename TestClass::ParamType ParamType;\\n\\n explicit ParameterizedTestFactory(ParamType parameter) :\\n\\n parameter_(parameter) {}\\n\\n virtual Test* CreateTest() {\\n\\n TestClass::SetParam(¶meter_);\\n\\n return new TestClass();\\n\\n }\\n\\n\\n\\n private:\\n\\n const ParamType parameter_;\\n\\n\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory);\\n\\n};\\n\\n\\n\\n// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE.\\n\\n//\\n\\n// TestMetaFactoryBase is a base class for meta-factories that create\\n\\n// test factories for passing into MakeAndRegisterTestInfo function.\\n\\ntemplate <class ParamType>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 68,\n \"score\": 231189.76074905344\n },\n {\n \"content\": \"class ClassUniqueToAlwaysTrue {};\\n\\n}\\n\\n\\n\\nbool IsTrue(bool condition) { return condition; }\\n\\n\\n\\nbool AlwaysTrue() {\\n\\n#if GTEST_HAS_EXCEPTIONS\\n\\n // This condition is always false so AlwaysTrue() never actually throws,\\n\\n // but it makes the compiler think that it may throw.\\n\\n if (IsTrue(false))\\n\\n throw ClassUniqueToAlwaysTrue();\\n\\n#endif // GTEST_HAS_EXCEPTIONS\\n\\n return true;\\n\\n}\\n\\n\\n\\n// If *pstr starts with the given prefix, modifies *pstr to be right\\n\\n// past the prefix and returns true; otherwise leaves *pstr unchanged\\n\\n// and returns false. None of pstr, *pstr, and prefix can be NULL.\\n\\nbool SkipPrefix(const char* prefix, const char** pstr) {\\n\\n const size_t prefix_len = strlen(prefix);\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/src/gtest.cc\",\n \"rank\": 69,\n \"score\": 231001.19950436073\n },\n {\n \"content\": \"struct AddRef { typedef T& type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 70,\n \"score\": 229364.44087975562\n },\n {\n \"content\": \"struct RemoveReference { typedef T type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 71,\n \"score\": 229364.44087975565\n },\n {\n \"content\": \"struct AddReference { typedef T& type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 72,\n \"score\": 229364.44087975565\n },\n {\n \"content\": \" class Iterator : public ParamIteratorInterface<T> {\\n\\n public:\\n\\n Iterator(const ParamGeneratorInterface<T>* base,\\n\\n typename ContainerType::const_iterator iterator)\\n\\n : base_(base), iterator_(iterator) {}\\n\\n virtual ~Iterator() {}\\n\\n\\n\\n virtual const ParamGeneratorInterface<T>* BaseGenerator() const {\\n\\n return base_;\\n\\n }\\n\\n virtual void Advance() {\\n\\n ++iterator_;\\n\\n value_.reset();\\n\\n }\\n\\n virtual ParamIteratorInterface<T>* Clone() const {\\n\\n return new Iterator(*this);\\n\\n }\\n\\n // We need to use cached value referenced by iterator_ because *iterator_\\n\\n // can return a temporary object (and of type other then T), so just\\n\\n // having \\\"return &*iterator_;\\\" doesn't work.\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 73,\n \"score\": 228241.58534315112\n },\n {\n \"content\": \"class RangeGenerator : public ParamGeneratorInterface<T> {\\n\\n public:\\n\\n RangeGenerator(T begin, T end, IncrementT step)\\n\\n : begin_(begin), end_(end),\\n\\n step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}\\n\\n virtual ~RangeGenerator() {}\\n\\n\\n\\n virtual ParamIteratorInterface<T>* Begin() const {\\n\\n return new Iterator(this, begin_, 0, step_);\\n\\n }\\n\\n virtual ParamIteratorInterface<T>* End() const {\\n\\n return new Iterator(this, end_, end_index_, step_);\\n\\n }\\n\\n\\n\\n private:\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 74,\n \"score\": 226117.03200918192\n },\n {\n \"content\": \"struct ByRef<T&> { typedef T& type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper for ByRef.\\n\\n#define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef<T>::type\\n\\n\\n\\n// AddRef<T>::type is T if T is a reference; otherwise it's T&. This\\n\\n// is the same as tr1::add_reference<T>::type.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 75,\n \"score\": 225422.3250972037\n },\n {\n \"content\": \"// For selecting which printer to use when a given type has neither <<\\n\\n// nor PrintTo().\\n\\nenum TypeKind {\\n\\n kProtobuf, // a protobuf type\\n\\n kConvertibleToInteger, // a type implicitly convertible to BiggestInt\\n\\n // (e.g. a named or unnamed enum type)\\n\\n kOtherType // anything else\\n\\n};\\n\\n\\n\\n// TypeWithoutFormatter<T, kTypeKind>::PrintValue(value, os) is called\\n\\n// by the universal printer to print a value of type T when neither\\n\\n// operator<< nor PrintTo() is defined for T, where kTypeKind is the\\n\\n// \\\"kind\\\" of T as defined by enum TypeKind.\\n\\ntemplate <typename T, TypeKind kTypeKind>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-printers.h\",\n \"rank\": 76,\n \"score\": 223746.60419191042\n },\n {\n \"content\": \"struct RemoveReference<T&> { typedef T type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper around RemoveReference that works when the argument\\n\\n// T depends on template parameters.\\n\\n#define GTEST_REMOVE_REFERENCE_(T) \\\\\\n\\n typename ::testing::internal::RemoveReference<T>::type\\n\\n\\n\\n// Removes const from a type if it is a const type, otherwise leaves\\n\\n// it unchanged. This is the same as tr1::remove_const, which is not\\n\\n// widely available yet.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 77,\n \"score\": 223232.79770637926\n },\n {\n \"content\": \"struct AddRef<T&> { typedef T& type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper for AddRef.\\n\\n#define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef<T>::type\\n\\n\\n\\n// A helper for implementing get<k>().\\n\\ntemplate <int k> class Get;\\n\\n\\n\\n// A helper for implementing tuple_element<k, T>. kIndexValid is true\\n\\n// iff k < the number of fields in tuple type T.\\n\\ntemplate <bool kIndexValid, int kIndex, class Tuple>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 78,\n \"score\": 223232.79770637926\n },\n {\n \"content\": \"struct AddReference<T&> { typedef T& type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper around AddReference that works when the argument T\\n\\n// depends on template parameters.\\n\\n#define GTEST_ADD_REFERENCE_(T) \\\\\\n\\n typename ::testing::internal::AddReference<T>::type\\n\\n\\n\\n// Adds a reference to const on top of T as necessary. For example,\\n\\n// it transforms\\n\\n//\\n\\n// char ==> const char&\\n\\n// const char ==> const char&\\n\\n// char& ==> const char&\\n\\n// const char& ==> const char&\\n\\n//\\n\\n// The argument T must depend on some template parameters.\\n\\n#define GTEST_REFERENCE_TO_CONST_(T) \\\\\\n\\n GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T))\\n\\n\\n\\n// ImplicitlyConvertible<From, To>::value is a compile-time bool\\n\\n// constant that's true iff type From can be implicitly converted to\\n\\n// type To.\\n\\ntemplate <typename From, typename To>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 79,\n \"score\": 223232.79770637926\n },\n {\n \"content\": \" class dumper : public dumper_t, public thread_exec {\\n\\n typedef token_ring<locks::pthread::cond> token_ring_t;\\n\\n struct thread_info_t {\\n\\n token_ring_t::token *token;\\n\\n };\\n\\n const uint_t threads;\\n\\n const std::string file_prefix;\\n\\n storage_t *const ary;\\n\\n int file_index;\\n\\n token_ring_t tr;\\n\\n \\n\\n struct thread_info_t *thread_info;\\n\\n size_t nb_records, nb_blocks;\\n\\n std::ofstream *out;\\n\\n\\n\\n public:\\n\\n dumper(uint_t _threads, const char *_file_prefix, size_t chunk_size, storage_t *_ary) :\\n\\n threads(_threads), file_prefix(_file_prefix),\\n\\n ary(_ary), file_index(0), tr()\\n\\n {\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/raw_dumper.hpp\",\n \"rank\": 80,\n \"score\": 223173.28413626686\n },\n {\n \"content\": \"class TestCase;\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest.h\",\n \"rank\": 81,\n \"score\": 222069.47032379985\n },\n {\n \"content\": \" class sorted_dumper : public dumper_t, public thread_exec {\\n\\n typedef typename storage_t::overlap_iterator iterator;\\n\\n typedef compacted_hash::writer<storage_t> writer_t;\\n\\n typedef heap_t<iterator> oheap_t;\\n\\n typedef token_ring<locks::pthread::cond> token_ring_t;\\n\\n\\n\\n struct thread_info_t {\\n\\n writer_t writer;\\n\\n oheap_t heap;\\n\\n token_ring_t::token *token;\\n\\n };\\n\\n\\n\\n uint_t threads;\\n\\n std::string file_prefix;\\n\\n size_t buffer_size;\\n\\n uint_t klen, vlen;\\n\\n uint_t key_len, val_len;\\n\\n size_t record_len, nb_records, nb_blocks;\\n\\n storage_t *ary;\\n\\n int file_index;\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/sorted_dumper.hpp\",\n \"rank\": 82,\n \"score\": 221615.64368409564\n },\n {\n \"content\": \" class ComputeOffsetsTest : public ::testing::TestWithParam<offset_test_param>\\n\\n {\\n\\n public:\\n\\n Offsets<uint64_t> offsets;\\n\\n\\n\\n ComputeOffsetsTest() :\\n\\n offsets(GetParam().key_len, GetParam().val_len, 15)\\n\\n { }\\n\\n\\n\\n ~ComputeOffsetsTest() { }\\n\\n };\\n\\n\\n\\n TEST_P(ComputeOffsetsTest, CheckCoherency) {\\n\\n const Offsets<uint64_t>::offset_t *it = NULL, *pit = NULL;\\n\\n const Offsets<uint64_t>::offset_t *lit = NULL, *lpit = NULL;\\n\\n uint_t k_len = GetParam().key_len;\\n\\n uint_t v_len = GetParam().val_len;\\n\\n uint_t kv_len = k_len + v_len;\\n\\n uint_t lk_len = 4;\\n\\n uint_t lv_len = kv_len - lk_len;\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/test_offsets_key_value.cc\",\n \"rank\": 83,\n \"score\": 221614.34458526858\n },\n {\n \"content\": \"struct bool_constant {\\n\\n typedef bool_constant<bool_value> type;\\n\\n static const bool value = bool_value;\\n\\n};\\n\\ntemplate <bool bool_value> const bool bool_constant<bool_value>::value;\\n\\n\\n\\ntypedef bool_constant<false> false_type;\\n\\ntypedef bool_constant<true> true_type;\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 84,\n \"score\": 220871.66418502445\n },\n {\n \"content\": \" class direct_sorted_dumper : public dumper_t, public thread_exec {\\n\\n typedef typename storage_t::iterator iterator;\\n\\n typedef typename compacted_hash::writer<storage_t> writer_t;\\n\\n typedef token_ring<locks::pthread::cond> token_ring_t;\\n\\n\\n\\n struct thread_info_t {\\n\\n writer_t writer;\\n\\n token_ring_t::token *token;\\n\\n };\\n\\n\\n\\n uint_t threads;\\n\\n const char *file_prefix;\\n\\n size_t buffer_size;\\n\\n uint_t klen, vlen;\\n\\n uint_t key_len, val_len;\\n\\n size_t record_len, nb_records;\\n\\n storage_t *ary;\\n\\n int file_index;\\n\\n token_ring_t tr;\\n\\n uint64_t lower_count, upper_count;\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/direct_sorted_dumper.hpp\",\n \"rank\": 85,\n \"score\": 218597.12745035865\n },\n {\n \"content\": \"class TypeWithSize {\\n\\n public:\\n\\n // This prevents the user from using TypeWithSize<N> with incorrect\\n\\n // values of N.\\n\\n typedef void UInt;\\n\\n};\\n\\n\\n\\n// The specialization for size 4.\\n\\ntemplate <>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 86,\n \"score\": 216885.12875478246\n },\n {\n \"content\": \"class TypeWithoutFormatter {\\n\\n public:\\n\\n // This default version is called when kTypeKind is kOtherType.\\n\\n static void PrintValue(const T& value, ::std::ostream* os) {\\n\\n PrintBytesInObjectTo(reinterpret_cast<const unsigned char*>(&value),\\n\\n sizeof(value), os);\\n\\n }\\n\\n};\\n\\n\\n\\n// We print a protobuf using its ShortDebugString() when the string\\n\\n// doesn't exceed this many characters; otherwise we print it using\\n\\n// DebugString() for better readability.\\n\\nconst size_t kProtobufOneLinerMaxLength = 50;\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/gtest-printers.h\",\n \"rank\": 87,\n \"score\": 216885.12875478246\n },\n {\n \"content\": \" class hash : public hash_t {\\n\\n public:\\n\\n define_error_class(TableFull);\\n\\n // typedef typename std::pair<key_t,val_t> kv_t;\\n\\n typedef ary_t storage_t;\\n\\n typedef typename ary_t::iterator iterator;\\n\\n\\n\\n hash() : ary(NULL), dumper(NULL), dumping_initiated(false) {}\\n\\n explicit hash(ary_t *_ary) : ary(_ary), dumper(NULL), dumping_initiated(false) {}\\n\\n\\n\\n virtual ~hash() {}\\n\\n\\n\\n size_t get_size() const { return ary->get_size(); }\\n\\n uint_t get_key_len() const { return ary->get_key_len(); }\\n\\n uint_t get_val_len() const { return ary->get_val_len(); }\\n\\n uint_t get_max_reprobe() const { return ary->get_max_reprobe(); }\\n\\n size_t get_max_reprobe_offset() const { return ary->get_max_reprobe_offset(); }\\n\\n \\n\\n void set_dumper(dumper_t *new_dumper) { dumper = new_dumper; }\\n\\n Time get_writing_time() const { \\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/hash.hpp\",\n \"rank\": 88,\n \"score\": 216544.84863546852\n },\n {\n \"content\": \"struct CompileAssertTypesEqual;\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 89,\n \"score\": 215913.0354147811\n },\n {\n \"content\": \" {\\\"upper-count\\\", 1, 0, 'U'},\\n\\n {\\\"verbose\\\", 0, 0, 'v'},\\n\\n {\\\"output\\\", 1, 0, 'o'},\\n\\n {\\\"help\\\", 0, 0, 'h'},\\n\\n {\\\"usage\\\", 0, 0, USAGE_OPT},\\n\\n {\\\"version\\\", 0, 0, 'V'},\\n\\n {0, 0, 0, 0}\\n\\n };\\n\\n static const char *short_options = \\\"hVctL:U:vo:\\\";\\n\\n\\n\\n std::string err;\\n\\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \\\"Invalid \\\" #type \\\" '\\\" << val << \\\"' for [\\\" which \\\"]: \\\" << err << \\\"\\\\n\\\"; exit(1); }\\n\\n while(true) { \\n\\n int index = -1;\\n\\n int c = getopt_long(argc, argv, short_options, long_options, &index);\\n\\n if(c == -1) break;\\n\\n switch(c) {\\n\\n case ':': \\n\\n std::cerr << \\\"Missing required argument for \\\"\\n\\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/dump_fastq_main_cmdline.hpp\",\n \"rank\": 91,\n \"score\": 102.21565083810376\n },\n {\n \"content\": \" void parse(int argc, char* argv[]) {\\n\\n static struct option long_options[] = {\\n\\n {\\\"bibtex\\\", 0, 0, 'b'},\\n\\n {\\\"output\\\", 1, 0, 'o'},\\n\\n {\\\"help\\\", 0, 0, 'h'},\\n\\n {\\\"usage\\\", 0, 0, USAGE_OPT},\\n\\n {\\\"version\\\", 0, 0, 'V'},\\n\\n {0, 0, 0, 0}\\n\\n };\\n\\n static const char *short_options = \\\"hVbo:\\\";\\n\\n\\n\\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \\\"Invalid \\\" #type \\\" '\\\" << val << \\\"' for [\\\" which \\\"]: \\\" << err << \\\"\\\\n\\\"; exit(1); }\\n\\n while(true) { \\n\\n int index = -1;\\n\\n int c = getopt_long(argc, argv, short_options, long_options, &index);\\n\\n if(c == -1) break;\\n\\n switch(c) {\\n\\n case ':': \\n\\n std::cerr << \\\"Missing required argument for \\\"\\n\\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/cite_cmdline.hpp\",\n \"rank\": 92,\n \"score\": 98.19930595393116\n },\n {\n \"content\": \" {\\\"usage\\\", 0, 0, USAGE_OPT},\\n\\n {\\\"version\\\", 0, 0, 'V'},\\n\\n {0, 0, 0, 0}\\n\\n };\\n\\n static const char *short_options = \\\"hVctL:U:o:\\\";\\n\\n\\n\\n std::string err;\\n\\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \\\"Invalid \\\" #type \\\" '\\\" << val << \\\"' for [\\\" which \\\"]: \\\" << err << \\\"\\\\n\\\"; exit(1); }\\n\\n while(true) { \\n\\n int index = -1;\\n\\n int c = getopt_long(argc, argv, short_options, long_options, &index);\\n\\n if(c == -1) break;\\n\\n switch(c) {\\n\\n case ':': \\n\\n std::cerr << \\\"Missing required argument for \\\"\\n\\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\\n\\n << std::endl;\\n\\n exit(1);\\n\\n case 'h':\\n\\n std::cout << usage() << \\\"\\\\n\\\\n\\\" << help() << std::endl;\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/dump_main_cmdline.hpp\",\n \"rank\": 93,\n \"score\": 95.05075436714039\n },\n {\n \"content\": \" CHECK_ERR(double_t, optarg, \\\"-i, --increment=double\\\")\\n\\n break;\\n\\n case 'f':\\n\\n full_flag = true;\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n // Parse arguments\\n\\n if(argc - optind != 1)\\n\\n error(\\\"Requires exactly 1 argument.\\\");\\n\\n db_arg = argv[optind];\\n\\n ++optind;\\n\\n }\\n\\n\\n\\n#define histo_fastq_main_args_USAGE \\\"Usage: jellyfish qhisto [options] db:string\\\"\\n\\n const char * usage() const { return histo_fastq_main_args_USAGE; }\\n\\n void error(const char *msg) { \\n\\n std::cerr << \\\"Error: \\\" << msg << \\\"\\\\n\\\" << usage()\\n\\n << \\\"\\\\nUse --help for more information\\\"\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/histo_fastq_main_cmdline.hpp\",\n \"rank\": 95,\n \"score\": 93.55025964726212\n },\n {\n \"content\": \"\\n\\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \\\"Invalid \\\" #type \\\" '\\\" << val << \\\"' for [\\\" which \\\"]: \\\" << err << \\\"\\\\n\\\"; exit(1); }\\n\\n while(true) { \\n\\n int index = -1;\\n\\n int c = getopt_long(argc, argv, short_options, long_options, &index);\\n\\n if(c == -1) break;\\n\\n switch(c) {\\n\\n case ':': \\n\\n std::cerr << \\\"Missing required argument for \\\"\\n\\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\\n\\n << std::endl;\\n\\n exit(1);\\n\\n case 'h':\\n\\n std::cout << usage() << \\\"\\\\n\\\\n\\\" << help() << std::endl;\\n\\n exit(0);\\n\\n case USAGE_OPT:\\n\\n std::cout << usage() << \\\"\\\\nUse --help for more information.\\\" << std::endl;\\n\\n exit(0);\\n\\n case 'V':\\n\\n print_version();\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/query_cmdline.hpp\",\n \"rank\": 96,\n \"score\": 91.12339205019302\n },\n {\n \"content\": \" ::std::string err;\\n\\n#define CHECK_ERR(type,val,which) if(!err.empty()) { ::std::cerr << \\\"Invalid \\\" #type \\\" '\\\" << val << \\\"' for [\\\" which \\\"]: \\\" << err << \\\"\\\\n\\\"; exit(1); }\\n\\n while(true) {\\n\\n int index = -1;\\n\\n int c = getopt_long(argc, argv, short_options, long_options, &index);\\n\\n if(c == -1) break;\\n\\n switch(c) {\\n\\n case ':':\\n\\n ::std::cerr << \\\"Missing required argument for \\\"\\n\\n << (index == -1 ? ::std::string(1, (char)optopt) : std::string(long_options[index].name))\\n\\n << ::std::endl;\\n\\n exit(1);\\n\\n case 'h':\\n\\n ::std::cout << usage() << \\\"\\\\n\\\\n\\\" << help() << std::endl;\\n\\n exit(0);\\n\\n case USAGE_OPT:\\n\\n ::std::cout << usage() << \\\"\\\\nUse --help for more information.\\\" << std::endl;\\n\\n exit(0);\\n\\n case 'V':\\n\\n print_version();\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/count_main_cmdline.hpp\",\n \"rank\": 97,\n \"score\": 90.3642265943503\n },\n {\n \"content\": \" {\\\"output\\\", 1, 0, 'o'},\\n\\n {\\\"out-counter-len\\\", 1, 0, OUT_COUNTER_LEN_OPT},\\n\\n {\\\"out-buffer-size\\\", 1, 0, OUT_BUFFER_SIZE_OPT},\\n\\n {\\\"verbose\\\", 0, 0, 'v'},\\n\\n {\\\"help\\\", 0, 0, 'h'},\\n\\n {\\\"usage\\\", 0, 0, USAGE_OPT},\\n\\n {\\\"version\\\", 0, 0, 'V'},\\n\\n {0, 0, 0, 0}\\n\\n };\\n\\n static const char *short_options = \\\"hVs:o:v\\\";\\n\\n\\n\\n std::string err;\\n\\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \\\"Invalid \\\" #type \\\" '\\\" << val << \\\"' for [\\\" which \\\"]: \\\" << err << \\\"\\\\n\\\"; exit(1); }\\n\\n while(true) { \\n\\n int index = -1;\\n\\n int c = getopt_long(argc, argv, short_options, long_options, &index);\\n\\n if(c == -1) break;\\n\\n switch(c) {\\n\\n case ':': \\n\\n std::cerr << \\\"Missing required argument for \\\"\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/hash_merge_cmdline.hpp\",\n \"rank\": 98,\n \"score\": 90.1042499324664\n },\n {\n \"content\": \" };\\n\\n static const char *short_options = \\\"Vl:h:i:f\\\";\\n\\n\\n\\n std::string err;\\n\\n#define CHECK_ERR(type,val,which) if(!err.empty()) { std::cerr << \\\"Invalid \\\" #type \\\" '\\\" << val << \\\"' for [\\\" which \\\"]: \\\" << err << \\\"\\\\n\\\"; exit(1); }\\n\\n while(true) { \\n\\n int index = -1;\\n\\n int c = getopt_long(argc, argv, short_options, long_options, &index);\\n\\n if(c == -1) break;\\n\\n switch(c) {\\n\\n case ':': \\n\\n std::cerr << \\\"Missing required argument for \\\"\\n\\n << (index == -1 ? std::string(1, (char)optopt) : std::string(long_options[index].name))\\n\\n << std::endl;\\n\\n exit(1);\\n\\n case HELP_OPT:\\n\\n std::cout << usage() << \\\"\\\\n\\\\n\\\" << help() << std::endl;\\n\\n exit(0);\\n\\n case USAGE_OPT:\\n\\n std::cout << usage() << \\\"\\\\nUse --help for more information.\\\" << std::endl;\\n\",\n \"file_path\": \"kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/histo_fastq_main_cmdline.hpp\",\n \"rank\": 99,\n \"score\": 87.95662058162483\n }\n]","isConversational":false}}},{"rowIdx":468,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"sources/dansandu/ballotin/logging.cpp"},"repo_name":{"kind":"string","value":"dansandu/ballotin"},"commit":{"kind":"string","value":"e92aac53153ca85759bc412a86937b28c5dbfc4c"},"file_code":{"kind":"string","value":"#include \"dansandu/ballotin/logging.hpp\"\n#include \"dansandu/ballotin/date_time.hpp\"\n#include \"dansandu/ballotin/exception.hpp\"\n#include \"dansandu/ballotin/file_system.hpp\"\n#include \"dansandu/ballotin/string.hpp\"\n\n#include <algorithm>\n#include <fstream>\n\nusing dansandu::ballotin::date_time::getDateTime;\nusing dansandu::ballotin::file_system::writeToStandardError;\nusing dansandu::ballotin::file_system::writeToStandardOutput;\n\nnamespace dansandu::ballotin::logging\n{\n\nLogger& Logger::globalInstance()\n{\n static auto logger = Logger{};\n return logger;\n}\n\nLogger::Logger() : level_{Level::debug}\n{\n}\n\nvoid Logger::addHandler(std::string name, const Level level, std::function<void(const LogEntry&)> handler)\n{\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n if (std::find_if(handlers_.cbegin(), handlers_.cend(),\n [&name](const auto& handler) { return handler.name == name; }) == handlers_.cend())\n {\n handlers_.push_back({std::move(name), level, std::move(handler)});\n }\n else\n {\n THROW(std::logic_error, \"the handler named '\", name, \"' is already registered\");\n }\n}\n\nvoid Logger::removeHandler(const std::string_view name)\n{\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n if (const auto position = std::find_if(handlers_.cbegin(), handlers_.cend(),\n [name](const auto& handler) { return handler.name == name; });\n position != handlers_.cend())\n {\n handlers_.erase(position);\n }\n}\n\nvoid Logger::setLevel(const Level level)\n{\n level_.store(level);\n}\n\nLevel Logger::getLevel() const\n{\n return level_.load();\n}\n\nvoid Logger::log(const Level level, const char* const function, const char* const file, const int line,\n const std::string_view message) const\n{\n if (level <= getLevel())\n {\n const auto timestamp = getDateTime();\n const auto logEntry = LogEntry{timestamp, level, std::this_thread::get_id(), function, file, line, message};\n\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n for (const auto& handler : handlers_)\n {\n if (logEntry.level <= handler.level)\n {\n handler.callback(logEntry);\n }\n }\n }\n}\n\nvoid Logger::log(const Level level, const char* const function, const char* const file, const int line,\n const std::function<std::string()>& messageSupplier) const\n{\n if (level <= getLevel())\n {\n const auto timestamp = getDateTime();\n const auto message = messageSupplier();\n const auto logEntry = LogEntry{timestamp, level, std::this_thread::get_id(), function, file, line, message};\n\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n for (const auto& handler : handlers_)\n {\n if (logEntry.level <= handler.level)\n {\n handler.callback(logEntry);\n }\n }\n }\n}\n\nvoid standardOutputHandler(const LogEntry& logEntry)\n{\n auto stream = std::stringstream{};\n stream << logEntry.timestamp << \" \" << levelToString(logEntry.level) << \" \" << logEntry.threadId << \" \"\n << logEntry.file << \":\" << logEntry.line << \" \" << logEntry.message << std::endl;\n const auto string = stream.str();\n\n if (logEntry.level <= Level::warn)\n {\n writeToStandardOutput(string);\n }\n else\n {\n writeToStandardError(string);\n }\n}\n\nstruct UnitTestsHandlerImplementation\n{\n static void deleter(void* pointer)\n {\n delete static_cast<UnitTestsHandlerImplementation*>(pointer);\n }\n\n UnitTestsHandlerImplementation(const char* const filePath)\n : logFile{filePath, std::ios_base::out | std::ios_base::app}\n {\n }\n\n std::ofstream logFile;\n std::mutex mutex;\n};\n\nUnitTestsHandler::UnitTestsHandler(const char* const filePath)\n : implementation_{new UnitTestsHandlerImplementation{filePath}, UnitTestsHandlerImplementation::deleter}\n{\n}\n\nvoid UnitTestsHandler::operator()(const LogEntry& logEntry)\n{\n auto stream = std::stringstream{};\n stream << logEntry.timestamp << \" \" << levelToString(logEntry.level) << \" \" << logEntry.threadId << \" \"\n << logEntry.file << \":\" << logEntry.line << \" \" << logEntry.message << std::endl;\n const auto casted = static_cast<UnitTestsHandlerImplementation*>(implementation_.get());\n\n const auto lock = std::lock_guard<std::mutex>{casted->mutex};\n casted->logFile << stream.rdbuf();\n}\n\n}\n"},"prefix":{"kind":"string","value":"#include \"dansandu/ballotin/logging.hpp\"\n#include \"dansandu/ballotin/date_time.hpp\"\n#include \"dansandu/ballotin/exception.hpp\"\n#include \"dansandu/ballotin/file_system.hpp\"\n#include \"dansandu/ballotin/string.hpp\"\n\n#include <algorithm>\n#include <fstream>\n\nusing dansandu::ballotin::date_time::getDateTime;\nusing dansandu::ballotin::file_system::writeToStandardError;\nusing dansandu::ballotin::file_system::writeToStandardOutput;\n\nnamespace dansandu::ballotin::logging\n{\n\nLogger& Logger::globalInstance()\n{\n static auto logger = Logger{};\n return logger;\n}\n\nLogger::Logger() : level_{Level::debug}\n{\n}\n\nvoid Logger::addHandler(std::string name, const Level level, std::function<void(const LogEntry&)> handler)\n{\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n if (std::find_if(handlers_.cbegin(), handlers_.cend(),\n [&name](const auto& handler) { return handler.name == name; }) == handlers_.cend())\n {\n handlers_.push_back({std::move(name), level, std::move(handler)});\n }\n else\n {\n THROW(std::logic_error, \"the handler named '\", name, \"' is already registered\");\n }\n}\n\nvoid Logger::removeHandler(const std::string_view name)\n{\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n if (const auto position = std::find_if(handlers_.cbegin(), handlers_.cend(),\n [name](const auto& handler) { return handler.name == name; });\n position != handlers_.cend())\n {\n handlers_.erase(position);\n }\n}\n\nvoid Logger::setLevel(const Level level)\n{\n level_.store(level);\n}\n\nLevel Logger::getLevel() const\n{\n return level_.load();\n}\n\nvoid Logger::log(const Level level, const char* const function, const char* const file, const int line,\n const std::string_view message) const\n{\n if (level <= getLevel())\n {\n const auto timestamp = getDateTime();\n const auto logEntry = LogEntry{timestamp, level, std::this_thread::get_id(), function, file, line, message};\n\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n for (const auto& handler : handlers_)\n {\n if (logEntry.level <= handler.level)\n {\n handler.callback(logEntry);\n }\n }\n }\n}\n\n"},"suffix":{"kind":"string","value":"\n\nvoid standardOutputHandler(const LogEntry& logEntry)\n{\n auto stream = std::stringstream{};\n stream << logEntry.timestamp << \" \" << levelToString(logEntry.level) << \" \" << logEntry.threadId << \" \"\n << logEntry.file << \":\" << logEntry.line << \" \" << logEntry.message << std::endl;\n const auto string = stream.str();\n\n if (logEntry.level <= Level::warn)\n {\n writeToStandardOutput(string);\n }\n else\n {\n writeToStandardError(string);\n }\n}\n\nstruct UnitTestsHandlerImplementation\n{\n static void deleter(void* pointer)\n {\n delete static_cast<UnitTestsHandlerImplementation*>(pointer);\n }\n\n UnitTestsHandlerImplementation(const char* const filePath)\n : logFile{filePath, std::ios_base::out | std::ios_base::app}\n {\n }\n\n std::ofstream logFile;\n std::mutex mutex;\n};\n\nUnitTestsHandler::UnitTestsHandler(const char* const filePath)\n : implementation_{new UnitTestsHandlerImplementation{filePath}, UnitTestsHandlerImplementation::deleter}\n{\n}\n\nvoid UnitTestsHandler::operator()(const LogEntry& logEntry)\n{\n auto stream = std::stringstream{};\n stream << logEntry.timestamp << \" \" << levelToString(logEntry.level) << \" \" << logEntry.threadId << \" \"\n << logEntry.file << \":\" << logEntry.line << \" \" << logEntry.message << std::endl;\n const auto casted = static_cast<UnitTestsHandlerImplementation*>(implementation_.get());\n\n const auto lock = std::lock_guard<std::mutex>{casted->mutex};\n casted->logFile << stream.rdbuf();\n}\n\n}\n"},"middle":{"kind":"string","value":"void Logger::log(const Level level, const char* const function, const char* const file, const int line,\n const std::function<std::string()>& messageSupplier) const\n{\n if (level <= getLevel())\n {\n const auto timestamp = getDateTime();\n const auto message = messageSupplier();\n const auto logEntry = LogEntry{timestamp, level, std::this_thread::get_id(), function, file, line, message};\n\n const auto lock = std::lock_guard<std::mutex>{mutex_};\n for (const auto& handler : handlers_)\n {\n if (logEntry.level <= handler.level)\n {\n handler.callback(logEntry);\n }\n }\n }\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"enum class Level\n\n{\n\n none,\n\n error,\n\n warn,\n\n info,\n\n debug\n\n};\n\n\n\nconstexpr bool operator<(const Level left, const Level right)\n\n{\n\n return static_cast<int>(left) < static_cast<int>(right);\n\n}\n\n\n\nconstexpr bool operator>(const Level left, const Level right)\n\n{\n\n return right < left;\n\n}\n\n\n\nconstexpr bool operator<=(const Level left, const Level right)\n","file_path":"sources/dansandu/ballotin/logging.hpp","rank":0,"score":37964.187076900904},{"content":"class PRALINE_EXPORT Logger\n\n{\n\npublic:\n\n static Logger& globalInstance();\n\n\n\n Logger();\n\n\n\n void addHandler(std::string name, const Level level, std::function<void(const LogEntry&)> handler);\n\n\n\n void removeHandler(const std::string_view name);\n\n\n\n void setLevel(const Level level);\n\n\n\n Level getLevel() const;\n\n\n\n void log(const Level level, const char* const function, const char* const file, const int line,\n\n const std::string_view message) const;\n\n\n\n void log(const Level level, const char* const function, const char* const file, const int line,\n\n const std::function<std::string()>& messageSupplier) const;\n","file_path":"sources/dansandu/ballotin/logging.hpp","rank":1,"score":37004.50375433012},{"content":"#include \"dansandu/ballotin/file_system.hpp\"\n\n#include \"dansandu/ballotin/exception.hpp\"\n\n\n\n#include <fstream>\n\n#include <iostream>\n\n#include <mutex>\n\n#include <string>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::file_system\n\n{\n\n\n\nvoid writeBinaryFile(const std::string& path, const std::vector<uint8_t>& bytes)\n\n{\n\n auto file = std::ofstream{path, std::ios_base::binary};\n\n file << std::noskipws;\n\n for (auto byte : bytes)\n\n {\n\n if (!(file << byte))\n\n {\n","file_path":"sources/dansandu/ballotin/file_system.cpp","rank":2,"score":24546.439535208512},{"content":" }\n\n\n\n return bytes;\n\n}\n\n\n\nvoid writeToStandardOutput(const std::string_view string)\n\n{\n\n static auto mutex = std::mutex{};\n\n auto lock = std::lock_guard<std::mutex>{mutex};\n\n std::cout << string;\n\n}\n\n\n\nvoid writeToStandardError(const std::string_view string)\n\n{\n\n static auto mutex = std::mutex{};\n\n auto lock = std::lock_guard<std::mutex>{mutex};\n\n std::cerr << string;\n\n}\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/file_system.cpp","rank":3,"score":24545.773598053685},{"content":"#pragma once\n\n\n\n#include <cstdint>\n\n#include <string>\n\n#include <string_view>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::file_system\n\n{\n\n\n\nPRALINE_EXPORT void writeBinaryFile(const std::string& path, const std::vector<uint8_t>& bytes);\n\n\n\nPRALINE_EXPORT std::vector<uint8_t> readBinaryFile(const std::string& path);\n\n\n\nPRALINE_EXPORT void writeToStandardOutput(const std::string_view string);\n\n\n\nPRALINE_EXPORT void writeToStandardError(const std::string_view string);\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/file_system.hpp","rank":4,"score":24544.495660802197},{"content":" THROW(std::runtime_error, \"could not write bytes to file '\", path, \"'\");\n\n }\n\n }\n\n file.close();\n\n}\n\n\n\nstd::vector<uint8_t> readBinaryFile(const std::string& path)\n\n{\n\n auto bytes = std::vector<uint8_t>{};\n\n\n\n auto file = std::ifstream{path, std::ios_base::binary};\n\n if (!(file >> std::noskipws))\n\n {\n\n THROW(std::runtime_error, \"file '\", path, \"' does not exist\");\n\n }\n\n\n\n auto byte = uint8_t{};\n\n while (file >> byte)\n\n {\n\n bytes.push_back(byte);\n","file_path":"sources/dansandu/ballotin/file_system.cpp","rank":5,"score":24539.849632900863},{"content":"class PRALINE_EXPORT UnitTestsHandler\n\n{\n\npublic:\n\n UnitTestsHandler(const char* const filePath);\n\n\n\n void operator()(const LogEntry& logEntry);\n\n\n\nprivate:\n\n std::shared_ptr<void> implementation_;\n\n};\n\n\n\n}\n\n\n\n#if (PRALINE_LOGGING_LEVEL >= 1)\n\n#define LOG_ERROR(...) \\\n\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\n\n dansandu::ballotin::logging::Level::error, __func__, __FILE__, __LINE__, \\\n\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\n\n#else\n\n#define LOG_ERROR(...) ;\n","file_path":"sources/dansandu/ballotin/logging.hpp","rank":7,"score":20946.509790293385},{"content":"\n\n logger.log(expectedLevel, expectedFunction, expectedFile, expectedLine, expectedMessage);\n\n\n\n REQUIRE(logged);\n\n }\n\n\n\n SECTION(\"level not matching\")\n\n {\n\n auto logged = false;\n\n\n\n logger.addHandler(\"test\", Level::info, [&](const LogEntry&) { logged = true; });\n\n\n\n logger.log(Level::debug, \"function\", \"file\", 3, \"message\");\n\n\n\n REQUIRE(!logged);\n\n }\n\n\n\n SECTION(\"duplicate handler\")\n\n {\n\n const auto name = \"default\";\n","file_path":"sources/dansandu/ballotin/logging.test.cpp","rank":12,"score":17.44756364670914},{"content":"#include \"dansandu/ballotin/logging.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\n#include <stdexcept>\n\n#include <string>\n\n#include <string_view>\n\n\n\nusing dansandu::ballotin::logging::Level;\n\nusing dansandu::ballotin::logging::LogEntry;\n\nusing dansandu::ballotin::logging::Logger;\n\n\n\nTEST_CASE(\"logging\")\n\n{\n\n auto logger = Logger{};\n\n\n\n SECTION(\"level matching\")\n\n {\n\n const auto expectedFunction = \"function\";\n\n const auto expectedFile = \"file\";\n\n const auto expectedLine = 17;\n","file_path":"sources/dansandu/ballotin/logging.test.cpp","rank":13,"score":16.201727605812955},{"content":"#define CATCH_CONFIG_RUNNER\n\n#include \"catchorg/catch/catch.hpp\"\n\n#include \"dansandu/ballotin/logging.hpp\"\n\n\n\nusing dansandu::ballotin::logging::Level;\n\nusing dansandu::ballotin::logging::Logger;\n\nusing dansandu::ballotin::logging::UnitTestsHandler;\n\n\n\nint main(const int argumentsCount, const char* const* const arguments)\n\n{\n\n auto& logger = Logger::globalInstance();\n\n logger.setLevel(Level::debug);\n\n logger.addHandler(\"UnitTests\", Level::debug, UnitTestsHandler{\"unit_tests.log\"});\n\n\n\n const auto catchResult = Catch::Session().run(argumentsCount, arguments);\n\n\n\n return catchResult;\n\n}\n","file_path":"sources/dansandu/ballotin/executable.test.cpp","rank":14,"score":15.739934268121328},{"content":" const auto expectedLevel = Level::debug;\n\n const auto expectedMessage = \"message\";\n\n\n\n auto logged = false;\n\n\n\n logger.addHandler(\"test\", Level::debug,\n\n [&](const LogEntry& logEntry)\n\n {\n\n REQUIRE(logEntry.function == expectedFunction);\n\n\n\n REQUIRE(logEntry.file == expectedFile);\n\n\n\n REQUIRE(logEntry.line == expectedLine);\n\n\n\n REQUIRE(logEntry.level == expectedLevel);\n\n\n\n REQUIRE(logEntry.message == expectedMessage);\n\n\n\n logged = true;\n\n });\n","file_path":"sources/dansandu/ballotin/logging.test.cpp","rank":16,"score":14.945977943292384},{"content":" const auto level = Level::debug;\n\n const auto handler = [&](const LogEntry&) {};\n\n\n\n logger.addHandler(name, level, handler);\n\n\n\n REQUIRE_THROWS_AS(logger.addHandler(name, level, handler), std::logic_error);\n\n }\n\n\n\n SECTION(\"remove handler\")\n\n {\n\n auto logged = false;\n\n\n\n logger.addHandler(\"test\", Level::error, [&](const LogEntry&) { logged = true; });\n\n\n\n logger.removeHandler(\"test\");\n\n\n\n logger.log(Level::error, \"function\", \"file\", 3, \"message\");\n\n\n\n REQUIRE(!logged);\n\n }\n\n}\n","file_path":"sources/dansandu/ballotin/logging.test.cpp","rank":17,"score":14.64119949356617},{"content":"#pragma once\n\n\n\n#include <algorithm>\n\n#include <map>\n\n#include <optional>\n\n#include <ostream>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::container\n\n{\n\n\n\ntemplate<typename T>\n\nauto pop(std::vector<T>& stack)\n\n{\n\n auto value = std::move(stack.back());\n\n stack.pop_back();\n\n return value;\n\n}\n\n\n\ntemplate<typename T, typename E>\n","file_path":"sources/dansandu/ballotin/container.hpp","rank":20,"score":10.722046983428807},{"content":"\n\nprivate:\n\n struct Handler\n\n {\n\n std::string name;\n\n Level level;\n\n std::function<void(const LogEntry&)> callback;\n\n };\n\n\n\n std::atomic<Level> level_;\n\n std::vector<Handler> handlers_;\n\n mutable std::mutex mutex_;\n\n};\n\n\n\nPRALINE_EXPORT void standardOutputHandler(const LogEntry& logEntry);\n\n\n","file_path":"sources/dansandu/ballotin/logging.hpp","rank":21,"score":10.192521224568342},{"content":"{\n\n return !(right < left);\n\n}\n\n\n\nconstexpr bool operator>=(const Level left, const Level right)\n\n{\n\n return !(left < right);\n\n}\n\n\n\nconstexpr const char* levelToString(const Level level)\n\n{\n\n const char* const levels[] = {\"NONE\", \"ERROR\", \"WARN\", \"INFO\", \"DEBUG\"};\n\n return levels[static_cast<int>(level)];\n\n}\n\n\n","file_path":"sources/dansandu/ballotin/logging.hpp","rank":22,"score":9.81178658241992},{"content":"#include \"dansandu/ballotin/type_traits.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\nusing dansandu::ballotin::type_traits::TypeDictionary;\n\nusing dansandu::ballotin::type_traits::TypeEntry;\n\nusing dansandu::ballotin::type_traits::TypePack;\n\n\n\nTEST_CASE(\"type_traits\")\n\n{\n\n REQUIRE(TypePack<int, float, double>::contains<int>);\n\n\n\n REQUIRE(!TypePack<int, float, double>::contains<char>);\n\n\n\n using Dictionary = TypeDictionary<TypeEntry<int, unsigned>, TypeEntry<char, unsigned char>>;\n\n\n\n REQUIRE(Dictionary::containsKey<int>);\n\n\n\n REQUIRE(!Dictionary::containsKey<double>);\n\n\n\n REQUIRE(std::is_same_v<Dictionary::Get<double>, void>);\n\n\n\n REQUIRE(std::is_same_v<Dictionary::Get<int>, unsigned>);\n\n}\n","file_path":"sources/dansandu/ballotin/type_traits.test.cpp","rank":23,"score":9.739394036981015},{"content":"#include \"dansandu/ballotin/binary.hpp\"\n\n#include \"dansandu/ballotin/exception.hpp\"\n\n\n\n#include <cstdint>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::binary\n\n{\n\n\n\nvoid pushBits(std::vector<uint8_t>& bytes, int& bitsCount, const unsigned bitsToAppend, const int bitsToAppendCount)\n\n{\n\n constexpr auto bitsPerByte = 8;\n\n\n\n const auto bytesCount = bitsCount / bitsPerByte + (0 < bitsCount % bitsPerByte);\n\n\n\n if (static_cast<int>(bytes.size()) < bytesCount)\n\n {\n\n THROW(std::invalid_argument, \"invalid bit count \", bitsCount,\n\n \" -- bit count cannot be larger than current bytes size\", bytes.size());\n\n }\n","file_path":"sources/dansandu/ballotin/binary.cpp","rank":24,"score":8.784973699006745},{"content":"#pragma once\n\n\n\n#include <cstdint>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::binary\n\n{\n\n\n\nPRALINE_EXPORT void pushBits(std::vector<uint8_t>& bytes, int& bitsCount, const unsigned bitsToAppend,\n\n const int bitsToAppendCount);\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/binary.hpp","rank":25,"score":8.575316755047561},{"content":"#endif\n\n\n\n#if (PRALINE_LOGGING_LEVEL >= 2)\n\n#define LOG_WARN(...) \\\n\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\n\n dansandu::ballotin::logging::Level::warn, __func__, __FILE__, __LINE__, \\\n\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\n\n#else\n\n#define LOG_WARN(...) ;\n\n#endif\n\n\n\n#if (PRALINE_LOGGING_LEVEL >= 3)\n\n#define LOG_INFO(...) \\\n\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\n\n dansandu::ballotin::logging::Level::info, __func__, __FILE__, __LINE__, \\\n\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\n\n#else\n\n#define LOG_INFO(...) ;\n\n#endif\n\n\n\n#if (PRALINE_LOGGING_LEVEL >= 4)\n\n#define LOG_DEBUG(...) \\\n\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\n\n dansandu::ballotin::logging::Level::debug, __func__, __FILE__, __LINE__, \\\n\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\n\n#else\n\n#define LOG_DEBUG(...) ;\n\n#endif\n","file_path":"sources/dansandu/ballotin/logging.hpp","rank":26,"score":8.533284570238202},{"content":"{\n\n const auto casted = static_cast<Implementation*>(implementation_.get());\n\n if (casted->process_)\n\n {\n\n {\n\n const auto lock = std::lock_guard{casted->mutex_};\n\n casted->events_.push_back(Event::resume);\n\n }\n\n casted->conditionVariable_.notify_one();\n\n }\n\n}\n\n\n\nvoid Processor::pause()\n\n{\n\n const auto casted = static_cast<Implementation*>(implementation_.get());\n\n if (casted->process_)\n\n {\n\n {\n\n const auto lock = std::lock_guard{casted->mutex_};\n\n casted->events_.push_back(Event::pause);\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":27,"score":8.361582407829935},{"content":"#pragma once\n\n\n\n#include <functional>\n\n\n\nnamespace dansandu::ballotin::hash\n\n{\n\n\n\ntemplate<typename ValueType>\n\nauto hashCombine(std::size_t seed, const ValueType& value)\n\n{\n\n using std::hash;\n\n return seed ^ (hash<ValueType>{}(value) + (seed << 6) + (seed >> 2) + 0x9e3779b9);\n\n}\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/hash.hpp","rank":28,"score":8.324089680729909},{"content":"#include \"dansandu/ballotin/hash.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\nusing dansandu::ballotin::hash::hashCombine;\n\n\n\nTEST_CASE(\"hash\")\n\n{\n\n SECTION(\"hash combine\")\n\n {\n\n auto i = 13;\n\n auto j = 29;\n\n auto iHash = std::hash<int>{}(i);\n\n auto jHash = std::hash<int>{}(j);\n\n auto hash = hashCombine(iHash, j);\n\n\n\n REQUIRE(iHash != hash);\n\n\n\n REQUIRE(jHash != hash);\n\n }\n\n}\n","file_path":"sources/dansandu/ballotin/hash.test.cpp","rank":29,"score":8.273410419739868},{"content":"#include \"dansandu/ballotin/container.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\n#include <map>\n\n#include <sstream>\n\n#include <string>\n\n#include <vector>\n\n\n\nusing dansandu::ballotin::container::contains;\n\nusing dansandu::ballotin::container::pop;\n\nusing dansandu::ballotin::container::uniquePushBack;\n\nusing dansandu::ballotin::container::operator<<;\n\n\n\nTEST_CASE(\"container\")\n\n{\n\n SECTION(\"pop\")\n\n {\n\n auto stack = std::vector<int>{{7, 11, 13}};\n\n\n\n REQUIRE(pop(stack) == 13);\n","file_path":"sources/dansandu/ballotin/container.test.cpp","rank":30,"score":8.170698598813185},{"content":"#pragma once\n\n\n\n#include <sstream>\n\n#include <string>\n\n#include <string_view>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::string\n\n{\n\n\n\ntemplate<typename Iterable>\n\nauto join(const Iterable& iterable, const std::string_view separator)\n\n{\n\n auto stream = std::stringstream{};\n\n for (const auto& element : iterable)\n\n {\n\n stream << element << separator;\n\n }\n\n auto result = stream.str();\n\n result.erase(result.end() - std::min(separator.size(), result.size()), result.end());\n","file_path":"sources/dansandu/ballotin/string.hpp","rank":31,"score":7.6750462094875225},{"content":"#include \"dansandu/ballotin/string.hpp\"\n\n#include \"dansandu/ballotin/exception.hpp\"\n\n\n\n#include <algorithm>\n\n#include <sstream>\n\n#include <string>\n\n#include <string_view>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::string\n\n{\n\n\n\nstd::vector<std::string> split(const std::string_view string, const std::string_view delimiter)\n\n{\n\n if (delimiter.empty())\n\n {\n\n THROW(std::invalid_argument, \"delimiter cannot be empty\");\n\n }\n\n auto tokens = std::vector<std::string>{};\n\n auto tokenBegin = string.cbegin();\n","file_path":"sources/dansandu/ballotin/string.cpp","rank":32,"score":7.141171046312068},{"content":"#include \"dansandu/ballotin/exception.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\n#include <stdexcept>\n\n\n\nusing Catch::Matches;\n\n\n\nTEST_CASE(\"exception\")\n\n{\n\n SECTION(\"pretty throw\")\n\n {\n\n std::string message;\n\n try\n\n {\n\n THROW(std::invalid_argument, \"ouch -- \", 1, \" exception has been thrown\");\n\n }\n\n catch (const std::exception& ex)\n\n {\n\n message = ex.what();\n\n }\n\n\n\n REQUIRE(!message.empty());\n\n }\n\n}\n","file_path":"sources/dansandu/ballotin/exception.test.cpp","rank":33,"score":7.141132953702044},{"content":" }\n\n casted->conditionVariable_.notify_one();\n\n }\n\n}\n\n\n\nvoid Processor::reset()\n\n{\n\n const auto casted = static_cast<Implementation*>(implementation_.get());\n\n if (casted->process_)\n\n {\n\n {\n\n const auto lock = std::lock_guard{casted->mutex_};\n\n casted->events_.push_back(Event::reset);\n\n }\n\n casted->conditionVariable_.notify_one();\n\n }\n\n}\n\n\n\nstd::unique_ptr<IProcess> Processor::wait()\n\n{\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":34,"score":7.121676900867499},{"content":"#include \"dansandu/ballotin/date_time.hpp\"\n\n\n\n#include <chrono>\n\n#include <ctime>\n\n\n\nnamespace dansandu::ballotin::date_time\n\n{\n\n\n\nstd::string getDateTime()\n\n{\n\n auto t = time_t{};\n\n time(&t);\n\n\n\n auto tt = tm{};\n\n\n\n#ifdef _WIN32\n\n gmtime_s(&tt, &t);\n\n#else\n\n gmtime_r(&t, &tt);\n\n#endif\n\n\n\n char buffer[64];\n\n strftime(buffer, sizeof(buffer) / sizeof(*buffer), \"%Y-%m-%d %H:%M:%S%z\", &tt);\n\n\n\n return buffer;\n\n}\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/date_time.cpp","rank":35,"score":7.052971571705927},{"content":" const auto casted = static_cast<Implementation*>(implementation_.get());\n\n if (casted->process_)\n\n {\n\n {\n\n const auto lock = std::lock_guard{casted->mutex_};\n\n casted->events_.push_back(Event::wait);\n\n }\n\n casted->conditionVariable_.notify_one();\n\n casted->thread_.join();\n\n }\n\n return std::move(casted->process_);\n\n}\n\n\n\nstd::unique_ptr<IProcess> Processor::yield()\n\n{\n\n const auto casted = static_cast<Implementation*>(implementation_.get());\n\n if (casted->process_)\n\n {\n\n {\n\n const auto lock = std::lock_guard{casted->mutex_};\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":36,"score":6.865452302204998},{"content":"#include \"dansandu/ballotin/random.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\n#include <algorithm>\n\n\n\nusing dansandu::ballotin::random::PredictableBitGenerator;\n\n\n\nTEST_CASE(\"random\")\n\n{\n\n SECTION(\"PredictableBitGenerator\")\n\n {\n\n SECTION(\"seedless\")\n\n {\n\n SECTION(\"samples\")\n\n {\n\n auto generator = PredictableBitGenerator{};\n\n\n\n REQUIRE(generator.min() == 0U);\n\n\n\n REQUIRE(generator.max() == 255U);\n","file_path":"sources/dansandu/ballotin/random.test.cpp","rank":37,"score":6.86516764722126},{"content":"bool contains(const std::vector<T>& container, const E& element)\n\n{\n\n return std::find(container.cbegin(), container.cend(), element) != container.cend();\n\n}\n\n\n\ntemplate<typename T, typename E>\n\nvoid uniquePushBack(std::vector<T>& container, E&& element)\n\n{\n\n if (auto position = std::find(container.cbegin(), container.cend(), element); position == container.cend())\n\n {\n\n container.push_back(std::forward<E>(element));\n\n }\n\n}\n\n\n\ntemplate<typename T>\n\nstd::ostream& operator<<(std::ostream& stream, const std::vector<T>& container)\n\n{\n\n auto addComma = false;\n\n stream << \"[\";\n\n for (const auto& element : container)\n","file_path":"sources/dansandu/ballotin/container.hpp","rank":38,"score":6.765770928275906},{"content":"#include \"dansandu/ballotin/string.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n#include \"dansandu/ballotin/exception.hpp\"\n\n\n\n#include <vector>\n\n\n\nusing dansandu::ballotin::string::format;\n\nusing dansandu::ballotin::string::join;\n\nusing dansandu::ballotin::string::split;\n\nusing dansandu::ballotin::string::trim;\n\n\n\nTEST_CASE(\"string\")\n\n{\n\n SECTION(\"join\")\n\n {\n\n SECTION(\"nonempty separator and list\")\n\n {\n\n std::vector<int> integers = {1, 2, 3, 4};\n\n REQUIRE(join(integers, \", \") == \"1, 2, 3, 4\");\n\n }\n","file_path":"sources/dansandu/ballotin/string.test.cpp","rank":39,"score":6.725182501826636},{"content":"#include \"dansandu/ballotin/binary.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\n#include <cstdint>\n\n#include <vector>\n\n\n\nusing dansandu::ballotin::binary::pushBits;\n\n\n\nusing bytes_type = std::vector<uint8_t>;\n\n\n\nTEST_CASE(\"binary\")\n\n{\n\n SECTION(\"push bits\")\n\n {\n\n SECTION(\"new byte partial write\")\n\n {\n\n bytes_type output = {};\n\n\n\n auto bitsCount = 0;\n\n\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":40,"score":6.282337066906995},{"content":"#pragma once\n\n\n\n#include \"dansandu/ballotin/string.hpp\"\n\n\n\n#include <stdexcept>\n\n#include <thread>\n\n\n\n#define THROW(exception, ...) \\\n\n throw exception{dansandu::ballotin::string::format(\"'\", #exception, \"' exception in thread '\", \\\n\n std::this_thread::get_id(), \\\n\n \"': \", dansandu::ballotin::string::format(__VA_ARGS__), \\\n\n \"\\n at \", __func__, \"(\", __FILE__, \":\", __LINE__, \")\")};\n","file_path":"sources/dansandu/ballotin/exception.hpp","rank":41,"score":6.066664982677775},{"content":"#pragma once\n\n\n\n#include <type_traits>\n\n#include <variant>\n\n\n\nnamespace dansandu::ballotin::type_traits\n\n{\n\n\n","file_path":"sources/dansandu/ballotin/type_traits.hpp","rank":42,"score":5.6522548257993},{"content":"#pragma once\n\n\n\n#include \"dansandu/ballotin/type_traits.hpp\"\n\n\n\n#include <chrono>\n\n#include <memory>\n\n\n\nnamespace dansandu::ballotin::processor\n\n{\n\n\n","file_path":"sources/dansandu/ballotin/processor.hpp","rank":43,"score":5.499857423342395},{"content":"#include \"dansandu/ballotin/processor.hpp\"\n\n\n\n#include <chrono>\n\n#include <condition_variable>\n\n#include <memory>\n\n#include <mutex>\n\n#include <thread>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::processor\n\n{\n\n\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":44,"score":5.488743430064611},{"content":"#pragma once\n\n\n\n#include \"dansandu/ballotin/string.hpp\"\n\n\n\n#include <atomic>\n\n#include <functional>\n\n#include <memory>\n\n#include <mutex>\n\n#include <string>\n\n#include <string_view>\n\n#include <thread>\n\n#include <vector>\n\n\n\nnamespace dansandu::ballotin::logging\n\n{\n\n\n","file_path":"sources/dansandu/ballotin/logging.hpp","rank":45,"score":5.3747592612285136},{"content":"#pragma once\n\n\n\nnamespace dansandu::ballotin::relation\n\n{\n\n\n\ntemplate<typename T>\n","file_path":"sources/dansandu/ballotin/relation.hpp","rank":46,"score":5.3038671848018115},{"content":"#include \"dansandu/ballotin/relation.hpp\"\n\n#include \"catchorg/catch/catch.hpp\"\n\n\n\nusing dansandu::ballotin::relation::TotalOrder;\n\n\n","file_path":"sources/dansandu/ballotin/relation.test.cpp","rank":47,"score":5.234473767629856},{"content":"\n\n auto lock = std::unique_lock{mutex_};\n\n\n\n if (handleEvents())\n\n {\n\n return;\n\n }\n\n\n\n while (paused)\n\n {\n\n conditionVariable_.wait(lock);\n\n\n\n if (handleEvents())\n\n {\n\n return;\n\n }\n\n }\n\n\n\n if (remaining > std::chrono::milliseconds::zero())\n\n {\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":48,"score":4.895054463724028},{"content":"#pragma once\n\n\n\n#include <string>\n\n\n\nnamespace dansandu::ballotin::date_time\n\n{\n\n\n\nstd::string getDateTime();\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/date_time.hpp","rank":49,"score":4.643605514744116},{"content":"\n\n REQUIRE(pop(stack) == 11);\n\n\n\n REQUIRE(pop(stack) == 7);\n\n }\n\n\n\n SECTION(\"contains\")\n\n {\n\n auto container = std::vector<int>{{3, 5, 7, 10}};\n\n\n\n REQUIRE(contains(container, 5));\n\n\n\n REQUIRE(!contains(container, 8));\n\n }\n\n\n\n SECTION(\"unique push back\")\n\n {\n\n auto container = std::vector<int>{{1, 3, 5, 7}};\n\n\n\n SECTION(\"unique\")\n","file_path":"sources/dansandu/ballotin/container.test.cpp","rank":50,"score":4.514603732773809},{"content":"\n\n while (static_cast<int>(bytes.size()) > bytesCount)\n\n {\n\n bytes.pop_back();\n\n }\n\n\n\n const auto bitsCapacity = bytesCount * bitsPerByte;\n\n\n\n auto remainingBits = bitsToAppend;\n\n auto remainingBitsCount = bitsToAppendCount;\n\n\n\n while (remainingBitsCount > 0)\n\n {\n\n const auto freeBitsCount = bitsCapacity - bitsCount;\n\n\n\n if (const auto implaceBitsCount = std::min(freeBitsCount, remainingBitsCount); implaceBitsCount > 0)\n\n {\n\n const auto implaceMask = (1U << implaceBitsCount) - 1U;\n\n bytes.back() |= (remainingBits & implaceMask) << (bitsPerByte - freeBitsCount);\n\n\n","file_path":"sources/dansandu/ballotin/binary.cpp","rank":51,"score":4.3799986047786446},{"content":"\n\n const auto expected = std::vector<unsigned>{{0, 1, 2, 3, 4, 5, 6, 7}};\n\n\n\n auto actual = std::vector<unsigned>{};\n\n for (auto i = 0U; i < expected.size(); ++i)\n\n {\n\n actual.push_back(generator());\n\n }\n\n\n\n REQUIRE(expected == actual);\n\n }\n\n\n\n SECTION(\"shuffle\")\n\n {\n\n const auto samples = 50000;\n\n\n\n auto ordered = std::vector<int>{};\n\n for (auto index = 0; index < samples; ++index)\n\n {\n\n ordered.push_back(index);\n","file_path":"sources/dansandu/ballotin/random.test.cpp","rank":52,"score":4.234990475103344},{"content":" {\n\n if (addComma)\n\n stream << \", \";\n\n stream << element;\n\n addComma = true;\n\n }\n\n return stream << \"]\";\n\n}\n\n\n\ntemplate<typename K, typename V>\n\nstd::ostream& operator<<(std::ostream& stream, const std::map<K, V>& container)\n\n{\n\n auto addComma = false;\n\n stream << \"{\";\n\n for (const auto& pair : container)\n\n {\n\n if (addComma)\n\n stream << \", \";\n\n stream << pair.first << \": \" << pair.second;\n\n addComma = true;\n","file_path":"sources/dansandu/ballotin/container.hpp","rank":53,"score":3.955242603721711},{"content":" {\n\n uniquePushBack(container, 0);\n\n\n\n REQUIRE(container == std::vector<int>{{1, 3, 5, 7, 0}});\n\n }\n\n\n\n SECTION(\"duplicate\")\n\n {\n\n uniquePushBack(container, 3);\n\n\n\n REQUIRE(container == std::vector<int>{{1, 3, 5, 7}});\n\n }\n\n }\n\n\n\n SECTION(\"pretty print\")\n\n {\n\n auto stream = std::stringstream{};\n\n\n\n SECTION(\"empty vector\")\n\n {\n","file_path":"sources/dansandu/ballotin/container.test.cpp","rank":54,"score":3.9199625164313625},{"content":" return result;\n\n}\n\n\n\ntemplate<typename... Arguments>\n\nauto format(Arguments&&... arguments)\n\n{\n\n auto stream = std::stringstream{};\n\n (stream << ... << arguments);\n\n return stream.str();\n\n}\n\n\n\nPRALINE_EXPORT std::vector<std::string> split(const std::string_view string, const std::string_view delimiter);\n\n\n\nPRALINE_EXPORT std::string trim(const std::string_view string);\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/string.hpp","rank":55,"score":3.38773520798557},{"content":" const auto timepoint = std::chrono::system_clock::now() + remaining;\n\n\n\n auto status = std::cv_status::no_timeout;\n\n\n\n while ((status != std::cv_status::timeout) & !paused)\n\n {\n\n status = conditionVariable_.wait_until(lock, timepoint);\n\n if (handleEvents())\n\n {\n\n return;\n\n }\n\n }\n\n\n\n if (status == std::cv_status::timeout)\n\n {\n\n remaining = interval_;\n\n }\n\n else\n\n {\n\n remaining = std::chrono::duration_cast<std::chrono::milliseconds>(timepoint -\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":56,"score":3.2512358143521807},{"content":"\n\n constexpr static result_type min()\n\n {\n\n return 0U;\n\n }\n\n\n\n constexpr static result_type max()\n\n {\n\n return 255U;\n\n }\n\n\n\nprivate:\n\n result_type index_;\n\n};\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/random.hpp","rank":57,"score":3.0156891609125216},{"content":" stream << std::vector<int>{};\n\n REQUIRE(stream.str() == \"[]\");\n\n }\n\n\n\n SECTION(\"singleton vector\")\n\n {\n\n stream << std::vector<int>{1};\n\n REQUIRE(stream.str() == \"[1]\");\n\n }\n\n\n\n SECTION(\"many elements vector\")\n\n {\n\n stream << std::vector<int>{{1, 2, 3, 4}};\n\n REQUIRE(stream.str() == \"[1, 2, 3, 4]\");\n\n }\n\n\n\n SECTION(\"empty map\")\n\n {\n\n stream << std::map<std::string, int>{};\n\n REQUIRE(stream.str() == \"{}\");\n","file_path":"sources/dansandu/ballotin/container.test.cpp","rank":58,"score":2.9119966926890486},{"content":"#pragma once\n\n\n\nnamespace dansandu::ballotin::random\n\n{\n\n\n","file_path":"sources/dansandu/ballotin/random.hpp","rank":59,"score":2.8274098452571748},{"content":"\n\n SECTION(\"empty separator and nonempty list\")\n\n {\n\n std::vector<int> integers = {1, 2, 3, 4};\n\n REQUIRE(join(integers, \"\") == \"1234\");\n\n }\n\n\n\n SECTION(\"nonempty separator and empty list\")\n\n {\n\n std::vector<int> integers;\n\n REQUIRE(join(integers, \"#\") == \"\");\n\n }\n\n\n\n SECTION(\"empty separator and empty list\")\n\n {\n\n std::vector<int> integers;\n\n REQUIRE(join(integers, \"\") == \"\");\n\n }\n\n }\n\n\n","file_path":"sources/dansandu/ballotin/string.test.cpp","rank":60,"score":2.7267031025978414},{"content":" {\n\n const auto sequence = {32, 0, 34, 1, 4, 5, 6, 35, 33};\n\n const auto codeSize = 6;\n\n auto output = bytes_type{};\n\n auto bitsCount = 0;\n\n\n\n for (const auto code : sequence)\n\n {\n\n pushBits(output, bitsCount, code, codeSize);\n\n }\n\n\n\n const bytes_type expectedOutput = {0b00100000U, 0b00100000U, 0b00000110U, 0b01000100U,\n\n 0b01100001U, 0b10001100U, 0b00100001U};\n\n\n\n REQUIRE(output == expectedOutput);\n\n\n\n const auto expectedBitsCount = 54;\n\n\n\n REQUIRE(bitsCount == expectedBitsCount);\n\n }\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":61,"score":2.5051240631596885},{"content":" auto done = false;\n\n auto wait = false;\n\n auto remaining = interval_;\n\n\n\n const auto handleEvents = [&]()\n\n {\n\n for (decltype(events_.size()) index = 0; index < events_.size(); ++index)\n\n {\n\n switch (events_[index])\n\n {\n\n case Event::resume:\n\n // +--------+--------+-------------------------+\n\n // | wait | done | paused = wait & !done |\n\n // +--------+--------+-------------------------+\n\n // | 0 | 0 | 0 |\n\n // | 0 | 1 | 0 |\n\n // | 1 | 0 | 1 |\n\n // | 1 | 1 | 0 |\n\n // +--------+--------+-------------------------+\n\n paused = wait & !done;\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":62,"score":2.5037855698581497},{"content":" }\n\n }\n\n\n\n SECTION(\"with seed\")\n\n {\n\n auto generator = PredictableBitGenerator{252U};\n\n\n\n REQUIRE(generator.min() == 0U);\n\n\n\n REQUIRE(generator.max() == 255U);\n\n\n\n const auto expected = std::vector<unsigned>{{252, 253, 254, 255, 0, 1, 2}};\n\n\n\n auto actual = std::vector<unsigned>{};\n\n for (auto i = 0U; i < expected.size(); ++i)\n\n {\n\n actual.push_back(generator());\n\n }\n\n\n\n REQUIRE(expected == actual);\n\n }\n\n }\n\n}\n","file_path":"sources/dansandu/ballotin/random.test.cpp","rank":63,"score":2.4553759877110366},{"content":" }\n\n\n\n SECTION(\"singleton map\")\n\n {\n\n stream << std::map<std::string, int>{{{\"key\", 17}}};\n\n REQUIRE(stream.str() == \"{key: 17}\");\n\n }\n\n\n\n SECTION(\"many elements map\")\n\n {\n\n stream << std::map<std::string, int>{{{\"key\", 17}, {\"other\", 20}, {\"another\", 23}}};\n\n REQUIRE(stream.str() == \"{another: 23, key: 17, other: 20}\");\n\n }\n\n }\n\n}\n","file_path":"sources/dansandu/ballotin/container.test.cpp","rank":64,"score":2.444549221522946},{"content":" }\n\n\n\n const auto seed = 0U;\n\n\n\n auto generator = PredictableBitGenerator{seed};\n\n auto shuffled = ordered;\n\n std::shuffle(shuffled.begin(), shuffled.end(), generator);\n\n\n\n REQUIRE(shuffled.size() == ordered.size());\n\n\n\n REQUIRE(std::is_permutation(shuffled.cbegin(), shuffled.cend(), ordered.cbegin(), ordered.cend()));\n\n\n\n const auto expected = shuffled;\n\n\n\n generator.seed(seed);\n\n\n\n shuffled = ordered;\n\n std::shuffle(shuffled.begin(), shuffled.end(), generator);\n\n\n\n REQUIRE(expected == shuffled);\n","file_path":"sources/dansandu/ballotin/random.test.cpp","rank":65,"score":2.252167574636667},{"content":" ++begin;\n\n\n\n auto end = string.end() - 1;\n\n while (end > begin && std::isspace(*end))\n\n --end;\n\n\n\n return {begin, end + 1};\n\n}\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/string.cpp","rank":66,"score":2.22934589559777},{"content":"\n\n auto bitsCount = 12;\n\n\n\n pushBits(output, bitsCount, 0b0110, 4);\n\n\n\n const bytes_type expectedOutput = {0b11100101U, 0b01101111U};\n\n\n\n REQUIRE(output == expectedOutput);\n\n\n\n const auto expectedByteCount = 2;\n\n\n\n REQUIRE(output.size() == expectedByteCount);\n\n\n\n const auto expectedBitsCount = 16;\n\n\n\n REQUIRE(bitsCount == expectedBitsCount);\n\n }\n\n\n\n SECTION(\"new byte fill\")\n\n {\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":67,"score":2.105916354730592},{"content":" }\n\n return stream << \"}\";\n\n}\n\n\n\ntemplate<typename T>\n\nstd::ostream& operator<<(std::ostream& stream, const std::optional<T>& optional)\n\n{\n\n stream << \"Optional(\";\n\n if (optional)\n\n stream << *optional;\n\n return stream << \")\";\n\n}\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/container.hpp","rank":68,"score":2.09537522687058},{"content":" pushBits(output, bitsCount, 0b101U, 3);\n\n\n\n const bytes_type expectedOutput = {0b00000101U};\n\n\n\n REQUIRE(output == expectedOutput);\n\n\n\n const auto expectedByteCount = 1;\n\n\n\n REQUIRE(output.size() == expectedByteCount);\n\n\n\n const auto expectedBitsCount = 3;\n\n\n\n REQUIRE(bitsCount == expectedBitsCount);\n\n }\n\n\n\n SECTION(\"previous byte parital write\")\n\n {\n\n bytes_type output = {0b00000101U};\n\n\n\n auto bitsCount = 3;\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":69,"score":2.031070159737566},{"content":" auto bitsCount = 7;\n\n\n\n pushBits(output, bitsCount, 0b10011U, 5);\n\n\n\n const bytes_type expectedOutput = {0b11100101U, 0b00001001U};\n\n\n\n REQUIRE(output == expectedOutput);\n\n\n\n const auto expectedByteCount = 2;\n\n\n\n REQUIRE(output.size() == expectedByteCount);\n\n\n\n const auto expectedBitsCount = 12;\n\n\n\n REQUIRE(bitsCount == expectedBitsCount);\n\n }\n\n\n\n SECTION(\"previous byte fill\")\n\n {\n\n bytes_type output = {0b11100101U, 0b00001111U};\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":70,"score":1.9886628214846853},{"content":" bytes_type output = {0b11100101U, 0b01111111U, 0b00101011U};\n\n\n\n auto bitsCount = 24;\n\n\n\n pushBits(output, bitsCount, 0b00001100U, 8);\n\n\n\n const bytes_type expectedOutput = {0b11100101U, 0b01111111U, 0b00101011U, 0b00001100U};\n\n\n\n REQUIRE(output == expectedOutput);\n\n\n\n const auto expectedByteCount = 4;\n\n\n\n REQUIRE(output.size() == expectedByteCount);\n\n\n\n const auto expectedBitsCount = 32;\n\n\n\n REQUIRE(bitsCount == expectedBitsCount);\n\n }\n\n\n\n SECTION(\"sequence\")\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":71,"score":1.9347997822239937},{"content":"\n\n const bytes_type expectedOutput = {0b11110100};\n\n\n\n REQUIRE(output == expectedOutput);\n\n\n\n const auto expectedBitsCount = 8;\n\n\n\n REQUIRE(bitsCount == expectedBitsCount);\n\n }\n\n\n\n SECTION(\"byte underflow\")\n\n {\n\n bytes_type output = {0b10101010};\n\n auto bitsCount = 9;\n\n\n\n REQUIRE_THROWS_AS(pushBits(output, bitsCount, 0b00110011, 6), std::invalid_argument);\n\n }\n\n }\n\n}\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":72,"score":1.8457874084396222},{"content":"\n\n SECTION(\"large append\")\n\n {\n\n bytes_type output = {0b00000111};\n\n\n\n auto bitsCount = 3;\n\n\n\n pushBits(output, bitsCount, 0b11111011110111011010, 20);\n\n\n\n const bytes_type expectedOutput = {0b11010111, 0b11101110, 0b01111101};\n\n\n\n REQUIRE(output == expectedOutput);\n\n }\n\n\n\n SECTION(\"byte overflow\")\n\n {\n\n bytes_type output = {0b00110100, 0b00000000, 0b00000000};\n\n auto bitsCount = 6;\n\n\n\n pushBits(output, bitsCount, 0b00000011, 2);\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":73,"score":1.7604948052244769},{"content":"\n\n pushBits(output, bitsCount, 0b1100U, 4);\n\n\n\n const bytes_type expectedOutput = {0b01100101U};\n\n\n\n REQUIRE(output == expectedOutput);\n\n\n\n const auto expectedByteCount = 1;\n\n\n\n REQUIRE(output.size() == expectedByteCount);\n\n\n\n const auto expectedBitsCount = 7;\n\n\n\n REQUIRE(bitsCount == expectedBitsCount);\n\n }\n\n\n\n SECTION(\"previous byte write extending to new byte\")\n\n {\n\n bytes_type output = {0b01100101U};\n\n\n","file_path":"sources/dansandu/ballotin/binary.test.cpp","rank":74,"score":1.6977338861482911},{"content":" remainingBits >>= implaceBitsCount;\n\n remainingBitsCount -= implaceBitsCount;\n\n bitsCount += implaceBitsCount;\n\n }\n\n\n\n if (const auto extendedBitsCount = std::min(bitsPerByte, remainingBitsCount); extendedBitsCount > 0)\n\n {\n\n const auto extendedMask = (1U << extendedBitsCount) - 1U;\n\n bytes.push_back(remainingBits & extendedMask);\n\n\n\n remainingBits >>= extendedBitsCount;\n\n remainingBitsCount -= extendedBitsCount;\n\n bitsCount += extendedBitsCount;\n\n }\n\n }\n\n}\n\n\n\n}\n","file_path":"sources/dansandu/ballotin/binary.cpp","rank":75,"score":1.5214561923852314},{"content":" auto tokenEnd = tokenBegin;\n\n while ((tokenEnd = std::search(tokenBegin, string.cend(), delimiter.cbegin(), delimiter.cend())) != string.cend())\n\n {\n\n if (tokenBegin != tokenEnd)\n\n {\n\n tokens.emplace_back(tokenBegin, tokenEnd);\n\n }\n\n tokenBegin = tokenEnd + delimiter.size();\n\n }\n\n if (tokenBegin != tokenEnd)\n\n {\n\n tokens.emplace_back(tokenBegin, tokenEnd);\n\n }\n\n return tokens;\n\n}\n\n\n\nstd::string trim(const std::string_view string)\n\n{\n\n auto begin = string.begin();\n\n while (begin < string.end() && std::isspace(*begin))\n","file_path":"sources/dansandu/ballotin/string.cpp","rank":76,"score":1.4975345367974282},{"content":" std::chrono::system_clock::now());\n\n }\n\n }\n\n }\n\n }\n\n\n\n std::thread thread_;\n\n std::condition_variable conditionVariable_;\n\n std::vector<Event> events_;\n\n std::unique_ptr<IProcess> process_;\n\n std::chrono::milliseconds interval_;\n\n std::mutex mutex_;\n\n};\n\n\n\nProcessor::Processor(std::unique_ptr<IProcess> process, const std::chrono::milliseconds interval)\n\n : implementation_{new Implementation{std::move(process), interval}, &Implementation::deleter}\n\n{\n\n}\n\n\n\nvoid Processor::resume()\n","file_path":"sources/dansandu/ballotin/processor.cpp","rank":77,"score":1.31255754540252}],"string":"[\n {\n \"content\": \"enum class Level\\n\\n{\\n\\n none,\\n\\n error,\\n\\n warn,\\n\\n info,\\n\\n debug\\n\\n};\\n\\n\\n\\nconstexpr bool operator<(const Level left, const Level right)\\n\\n{\\n\\n return static_cast<int>(left) < static_cast<int>(right);\\n\\n}\\n\\n\\n\\nconstexpr bool operator>(const Level left, const Level right)\\n\\n{\\n\\n return right < left;\\n\\n}\\n\\n\\n\\nconstexpr bool operator<=(const Level left, const Level right)\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.hpp\",\n \"rank\": 0,\n \"score\": 37964.187076900904\n },\n {\n \"content\": \"class PRALINE_EXPORT Logger\\n\\n{\\n\\npublic:\\n\\n static Logger& globalInstance();\\n\\n\\n\\n Logger();\\n\\n\\n\\n void addHandler(std::string name, const Level level, std::function<void(const LogEntry&)> handler);\\n\\n\\n\\n void removeHandler(const std::string_view name);\\n\\n\\n\\n void setLevel(const Level level);\\n\\n\\n\\n Level getLevel() const;\\n\\n\\n\\n void log(const Level level, const char* const function, const char* const file, const int line,\\n\\n const std::string_view message) const;\\n\\n\\n\\n void log(const Level level, const char* const function, const char* const file, const int line,\\n\\n const std::function<std::string()>& messageSupplier) const;\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.hpp\",\n \"rank\": 1,\n \"score\": 37004.50375433012\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/file_system.hpp\\\"\\n\\n#include \\\"dansandu/ballotin/exception.hpp\\\"\\n\\n\\n\\n#include <fstream>\\n\\n#include <iostream>\\n\\n#include <mutex>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::file_system\\n\\n{\\n\\n\\n\\nvoid writeBinaryFile(const std::string& path, const std::vector<uint8_t>& bytes)\\n\\n{\\n\\n auto file = std::ofstream{path, std::ios_base::binary};\\n\\n file << std::noskipws;\\n\\n for (auto byte : bytes)\\n\\n {\\n\\n if (!(file << byte))\\n\\n {\\n\",\n \"file_path\": \"sources/dansandu/ballotin/file_system.cpp\",\n \"rank\": 2,\n \"score\": 24546.439535208512\n },\n {\n \"content\": \" }\\n\\n\\n\\n return bytes;\\n\\n}\\n\\n\\n\\nvoid writeToStandardOutput(const std::string_view string)\\n\\n{\\n\\n static auto mutex = std::mutex{};\\n\\n auto lock = std::lock_guard<std::mutex>{mutex};\\n\\n std::cout << string;\\n\\n}\\n\\n\\n\\nvoid writeToStandardError(const std::string_view string)\\n\\n{\\n\\n static auto mutex = std::mutex{};\\n\\n auto lock = std::lock_guard<std::mutex>{mutex};\\n\\n std::cerr << string;\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/file_system.cpp\",\n \"rank\": 3,\n \"score\": 24545.773598053685\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <cstdint>\\n\\n#include <string>\\n\\n#include <string_view>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::file_system\\n\\n{\\n\\n\\n\\nPRALINE_EXPORT void writeBinaryFile(const std::string& path, const std::vector<uint8_t>& bytes);\\n\\n\\n\\nPRALINE_EXPORT std::vector<uint8_t> readBinaryFile(const std::string& path);\\n\\n\\n\\nPRALINE_EXPORT void writeToStandardOutput(const std::string_view string);\\n\\n\\n\\nPRALINE_EXPORT void writeToStandardError(const std::string_view string);\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/file_system.hpp\",\n \"rank\": 4,\n \"score\": 24544.495660802197\n },\n {\n \"content\": \" THROW(std::runtime_error, \\\"could not write bytes to file '\\\", path, \\\"'\\\");\\n\\n }\\n\\n }\\n\\n file.close();\\n\\n}\\n\\n\\n\\nstd::vector<uint8_t> readBinaryFile(const std::string& path)\\n\\n{\\n\\n auto bytes = std::vector<uint8_t>{};\\n\\n\\n\\n auto file = std::ifstream{path, std::ios_base::binary};\\n\\n if (!(file >> std::noskipws))\\n\\n {\\n\\n THROW(std::runtime_error, \\\"file '\\\", path, \\\"' does not exist\\\");\\n\\n }\\n\\n\\n\\n auto byte = uint8_t{};\\n\\n while (file >> byte)\\n\\n {\\n\\n bytes.push_back(byte);\\n\",\n \"file_path\": \"sources/dansandu/ballotin/file_system.cpp\",\n \"rank\": 5,\n \"score\": 24539.849632900863\n },\n {\n \"content\": \"class PRALINE_EXPORT UnitTestsHandler\\n\\n{\\n\\npublic:\\n\\n UnitTestsHandler(const char* const filePath);\\n\\n\\n\\n void operator()(const LogEntry& logEntry);\\n\\n\\n\\nprivate:\\n\\n std::shared_ptr<void> implementation_;\\n\\n};\\n\\n\\n\\n}\\n\\n\\n\\n#if (PRALINE_LOGGING_LEVEL >= 1)\\n\\n#define LOG_ERROR(...) \\\\\\n\\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\\\\n\\n dansandu::ballotin::logging::Level::error, __func__, __FILE__, __LINE__, \\\\\\n\\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\\n\\n#else\\n\\n#define LOG_ERROR(...) ;\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.hpp\",\n \"rank\": 7,\n \"score\": 20946.509790293385\n },\n {\n \"content\": \"\\n\\n logger.log(expectedLevel, expectedFunction, expectedFile, expectedLine, expectedMessage);\\n\\n\\n\\n REQUIRE(logged);\\n\\n }\\n\\n\\n\\n SECTION(\\\"level not matching\\\")\\n\\n {\\n\\n auto logged = false;\\n\\n\\n\\n logger.addHandler(\\\"test\\\", Level::info, [&](const LogEntry&) { logged = true; });\\n\\n\\n\\n logger.log(Level::debug, \\\"function\\\", \\\"file\\\", 3, \\\"message\\\");\\n\\n\\n\\n REQUIRE(!logged);\\n\\n }\\n\\n\\n\\n SECTION(\\\"duplicate handler\\\")\\n\\n {\\n\\n const auto name = \\\"default\\\";\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.test.cpp\",\n \"rank\": 12,\n \"score\": 17.44756364670914\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/logging.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <string>\\n\\n#include <string_view>\\n\\n\\n\\nusing dansandu::ballotin::logging::Level;\\n\\nusing dansandu::ballotin::logging::LogEntry;\\n\\nusing dansandu::ballotin::logging::Logger;\\n\\n\\n\\nTEST_CASE(\\\"logging\\\")\\n\\n{\\n\\n auto logger = Logger{};\\n\\n\\n\\n SECTION(\\\"level matching\\\")\\n\\n {\\n\\n const auto expectedFunction = \\\"function\\\";\\n\\n const auto expectedFile = \\\"file\\\";\\n\\n const auto expectedLine = 17;\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.test.cpp\",\n \"rank\": 13,\n \"score\": 16.201727605812955\n },\n {\n \"content\": \"#define CATCH_CONFIG_RUNNER\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n#include \\\"dansandu/ballotin/logging.hpp\\\"\\n\\n\\n\\nusing dansandu::ballotin::logging::Level;\\n\\nusing dansandu::ballotin::logging::Logger;\\n\\nusing dansandu::ballotin::logging::UnitTestsHandler;\\n\\n\\n\\nint main(const int argumentsCount, const char* const* const arguments)\\n\\n{\\n\\n auto& logger = Logger::globalInstance();\\n\\n logger.setLevel(Level::debug);\\n\\n logger.addHandler(\\\"UnitTests\\\", Level::debug, UnitTestsHandler{\\\"unit_tests.log\\\"});\\n\\n\\n\\n const auto catchResult = Catch::Session().run(argumentsCount, arguments);\\n\\n\\n\\n return catchResult;\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/executable.test.cpp\",\n \"rank\": 14,\n \"score\": 15.739934268121328\n },\n {\n \"content\": \" const auto expectedLevel = Level::debug;\\n\\n const auto expectedMessage = \\\"message\\\";\\n\\n\\n\\n auto logged = false;\\n\\n\\n\\n logger.addHandler(\\\"test\\\", Level::debug,\\n\\n [&](const LogEntry& logEntry)\\n\\n {\\n\\n REQUIRE(logEntry.function == expectedFunction);\\n\\n\\n\\n REQUIRE(logEntry.file == expectedFile);\\n\\n\\n\\n REQUIRE(logEntry.line == expectedLine);\\n\\n\\n\\n REQUIRE(logEntry.level == expectedLevel);\\n\\n\\n\\n REQUIRE(logEntry.message == expectedMessage);\\n\\n\\n\\n logged = true;\\n\\n });\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.test.cpp\",\n \"rank\": 16,\n \"score\": 14.945977943292384\n },\n {\n \"content\": \" const auto level = Level::debug;\\n\\n const auto handler = [&](const LogEntry&) {};\\n\\n\\n\\n logger.addHandler(name, level, handler);\\n\\n\\n\\n REQUIRE_THROWS_AS(logger.addHandler(name, level, handler), std::logic_error);\\n\\n }\\n\\n\\n\\n SECTION(\\\"remove handler\\\")\\n\\n {\\n\\n auto logged = false;\\n\\n\\n\\n logger.addHandler(\\\"test\\\", Level::error, [&](const LogEntry&) { logged = true; });\\n\\n\\n\\n logger.removeHandler(\\\"test\\\");\\n\\n\\n\\n logger.log(Level::error, \\\"function\\\", \\\"file\\\", 3, \\\"message\\\");\\n\\n\\n\\n REQUIRE(!logged);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.test.cpp\",\n \"rank\": 17,\n \"score\": 14.64119949356617\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <algorithm>\\n\\n#include <map>\\n\\n#include <optional>\\n\\n#include <ostream>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::container\\n\\n{\\n\\n\\n\\ntemplate<typename T>\\n\\nauto pop(std::vector<T>& stack)\\n\\n{\\n\\n auto value = std::move(stack.back());\\n\\n stack.pop_back();\\n\\n return value;\\n\\n}\\n\\n\\n\\ntemplate<typename T, typename E>\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.hpp\",\n \"rank\": 20,\n \"score\": 10.722046983428807\n },\n {\n \"content\": \"\\n\\nprivate:\\n\\n struct Handler\\n\\n {\\n\\n std::string name;\\n\\n Level level;\\n\\n std::function<void(const LogEntry&)> callback;\\n\\n };\\n\\n\\n\\n std::atomic<Level> level_;\\n\\n std::vector<Handler> handlers_;\\n\\n mutable std::mutex mutex_;\\n\\n};\\n\\n\\n\\nPRALINE_EXPORT void standardOutputHandler(const LogEntry& logEntry);\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.hpp\",\n \"rank\": 21,\n \"score\": 10.192521224568342\n },\n {\n \"content\": \"{\\n\\n return !(right < left);\\n\\n}\\n\\n\\n\\nconstexpr bool operator>=(const Level left, const Level right)\\n\\n{\\n\\n return !(left < right);\\n\\n}\\n\\n\\n\\nconstexpr const char* levelToString(const Level level)\\n\\n{\\n\\n const char* const levels[] = {\\\"NONE\\\", \\\"ERROR\\\", \\\"WARN\\\", \\\"INFO\\\", \\\"DEBUG\\\"};\\n\\n return levels[static_cast<int>(level)];\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.hpp\",\n \"rank\": 22,\n \"score\": 9.81178658241992\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/type_traits.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\nusing dansandu::ballotin::type_traits::TypeDictionary;\\n\\nusing dansandu::ballotin::type_traits::TypeEntry;\\n\\nusing dansandu::ballotin::type_traits::TypePack;\\n\\n\\n\\nTEST_CASE(\\\"type_traits\\\")\\n\\n{\\n\\n REQUIRE(TypePack<int, float, double>::contains<int>);\\n\\n\\n\\n REQUIRE(!TypePack<int, float, double>::contains<char>);\\n\\n\\n\\n using Dictionary = TypeDictionary<TypeEntry<int, unsigned>, TypeEntry<char, unsigned char>>;\\n\\n\\n\\n REQUIRE(Dictionary::containsKey<int>);\\n\\n\\n\\n REQUIRE(!Dictionary::containsKey<double>);\\n\\n\\n\\n REQUIRE(std::is_same_v<Dictionary::Get<double>, void>);\\n\\n\\n\\n REQUIRE(std::is_same_v<Dictionary::Get<int>, unsigned>);\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/type_traits.test.cpp\",\n \"rank\": 23,\n \"score\": 9.739394036981015\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/binary.hpp\\\"\\n\\n#include \\\"dansandu/ballotin/exception.hpp\\\"\\n\\n\\n\\n#include <cstdint>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::binary\\n\\n{\\n\\n\\n\\nvoid pushBits(std::vector<uint8_t>& bytes, int& bitsCount, const unsigned bitsToAppend, const int bitsToAppendCount)\\n\\n{\\n\\n constexpr auto bitsPerByte = 8;\\n\\n\\n\\n const auto bytesCount = bitsCount / bitsPerByte + (0 < bitsCount % bitsPerByte);\\n\\n\\n\\n if (static_cast<int>(bytes.size()) < bytesCount)\\n\\n {\\n\\n THROW(std::invalid_argument, \\\"invalid bit count \\\", bitsCount,\\n\\n \\\" -- bit count cannot be larger than current bytes size\\\", bytes.size());\\n\\n }\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.cpp\",\n \"rank\": 24,\n \"score\": 8.784973699006745\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <cstdint>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::binary\\n\\n{\\n\\n\\n\\nPRALINE_EXPORT void pushBits(std::vector<uint8_t>& bytes, int& bitsCount, const unsigned bitsToAppend,\\n\\n const int bitsToAppendCount);\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.hpp\",\n \"rank\": 25,\n \"score\": 8.575316755047561\n },\n {\n \"content\": \"#endif\\n\\n\\n\\n#if (PRALINE_LOGGING_LEVEL >= 2)\\n\\n#define LOG_WARN(...) \\\\\\n\\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\\\\n\\n dansandu::ballotin::logging::Level::warn, __func__, __FILE__, __LINE__, \\\\\\n\\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\\n\\n#else\\n\\n#define LOG_WARN(...) ;\\n\\n#endif\\n\\n\\n\\n#if (PRALINE_LOGGING_LEVEL >= 3)\\n\\n#define LOG_INFO(...) \\\\\\n\\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\\\\n\\n dansandu::ballotin::logging::Level::info, __func__, __FILE__, __LINE__, \\\\\\n\\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\\n\\n#else\\n\\n#define LOG_INFO(...) ;\\n\\n#endif\\n\\n\\n\\n#if (PRALINE_LOGGING_LEVEL >= 4)\\n\\n#define LOG_DEBUG(...) \\\\\\n\\n dansandu::ballotin::logging::Logger::globalInstance().log( \\\\\\n\\n dansandu::ballotin::logging::Level::debug, __func__, __FILE__, __LINE__, \\\\\\n\\n [&]() { return dansandu::ballotin::string::format(__VA_ARGS__); });\\n\\n#else\\n\\n#define LOG_DEBUG(...) ;\\n\\n#endif\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.hpp\",\n \"rank\": 26,\n \"score\": 8.533284570238202\n },\n {\n \"content\": \"{\\n\\n const auto casted = static_cast<Implementation*>(implementation_.get());\\n\\n if (casted->process_)\\n\\n {\\n\\n {\\n\\n const auto lock = std::lock_guard{casted->mutex_};\\n\\n casted->events_.push_back(Event::resume);\\n\\n }\\n\\n casted->conditionVariable_.notify_one();\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Processor::pause()\\n\\n{\\n\\n const auto casted = static_cast<Implementation*>(implementation_.get());\\n\\n if (casted->process_)\\n\\n {\\n\\n {\\n\\n const auto lock = std::lock_guard{casted->mutex_};\\n\\n casted->events_.push_back(Event::pause);\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 27,\n \"score\": 8.361582407829935\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <functional>\\n\\n\\n\\nnamespace dansandu::ballotin::hash\\n\\n{\\n\\n\\n\\ntemplate<typename ValueType>\\n\\nauto hashCombine(std::size_t seed, const ValueType& value)\\n\\n{\\n\\n using std::hash;\\n\\n return seed ^ (hash<ValueType>{}(value) + (seed << 6) + (seed >> 2) + 0x9e3779b9);\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/hash.hpp\",\n \"rank\": 28,\n \"score\": 8.324089680729909\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/hash.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\nusing dansandu::ballotin::hash::hashCombine;\\n\\n\\n\\nTEST_CASE(\\\"hash\\\")\\n\\n{\\n\\n SECTION(\\\"hash combine\\\")\\n\\n {\\n\\n auto i = 13;\\n\\n auto j = 29;\\n\\n auto iHash = std::hash<int>{}(i);\\n\\n auto jHash = std::hash<int>{}(j);\\n\\n auto hash = hashCombine(iHash, j);\\n\\n\\n\\n REQUIRE(iHash != hash);\\n\\n\\n\\n REQUIRE(jHash != hash);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/hash.test.cpp\",\n \"rank\": 29,\n \"score\": 8.273410419739868\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/container.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\n#include <map>\\n\\n#include <sstream>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\\nusing dansandu::ballotin::container::contains;\\n\\nusing dansandu::ballotin::container::pop;\\n\\nusing dansandu::ballotin::container::uniquePushBack;\\n\\nusing dansandu::ballotin::container::operator<<;\\n\\n\\n\\nTEST_CASE(\\\"container\\\")\\n\\n{\\n\\n SECTION(\\\"pop\\\")\\n\\n {\\n\\n auto stack = std::vector<int>{{7, 11, 13}};\\n\\n\\n\\n REQUIRE(pop(stack) == 13);\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.test.cpp\",\n \"rank\": 30,\n \"score\": 8.170698598813185\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <sstream>\\n\\n#include <string>\\n\\n#include <string_view>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::string\\n\\n{\\n\\n\\n\\ntemplate<typename Iterable>\\n\\nauto join(const Iterable& iterable, const std::string_view separator)\\n\\n{\\n\\n auto stream = std::stringstream{};\\n\\n for (const auto& element : iterable)\\n\\n {\\n\\n stream << element << separator;\\n\\n }\\n\\n auto result = stream.str();\\n\\n result.erase(result.end() - std::min(separator.size(), result.size()), result.end());\\n\",\n \"file_path\": \"sources/dansandu/ballotin/string.hpp\",\n \"rank\": 31,\n \"score\": 7.6750462094875225\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/string.hpp\\\"\\n\\n#include \\\"dansandu/ballotin/exception.hpp\\\"\\n\\n\\n\\n#include <algorithm>\\n\\n#include <sstream>\\n\\n#include <string>\\n\\n#include <string_view>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::string\\n\\n{\\n\\n\\n\\nstd::vector<std::string> split(const std::string_view string, const std::string_view delimiter)\\n\\n{\\n\\n if (delimiter.empty())\\n\\n {\\n\\n THROW(std::invalid_argument, \\\"delimiter cannot be empty\\\");\\n\\n }\\n\\n auto tokens = std::vector<std::string>{};\\n\\n auto tokenBegin = string.cbegin();\\n\",\n \"file_path\": \"sources/dansandu/ballotin/string.cpp\",\n \"rank\": 32,\n \"score\": 7.141171046312068\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/exception.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\n#include <stdexcept>\\n\\n\\n\\nusing Catch::Matches;\\n\\n\\n\\nTEST_CASE(\\\"exception\\\")\\n\\n{\\n\\n SECTION(\\\"pretty throw\\\")\\n\\n {\\n\\n std::string message;\\n\\n try\\n\\n {\\n\\n THROW(std::invalid_argument, \\\"ouch -- \\\", 1, \\\" exception has been thrown\\\");\\n\\n }\\n\\n catch (const std::exception& ex)\\n\\n {\\n\\n message = ex.what();\\n\\n }\\n\\n\\n\\n REQUIRE(!message.empty());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/exception.test.cpp\",\n \"rank\": 33,\n \"score\": 7.141132953702044\n },\n {\n \"content\": \" }\\n\\n casted->conditionVariable_.notify_one();\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Processor::reset()\\n\\n{\\n\\n const auto casted = static_cast<Implementation*>(implementation_.get());\\n\\n if (casted->process_)\\n\\n {\\n\\n {\\n\\n const auto lock = std::lock_guard{casted->mutex_};\\n\\n casted->events_.push_back(Event::reset);\\n\\n }\\n\\n casted->conditionVariable_.notify_one();\\n\\n }\\n\\n}\\n\\n\\n\\nstd::unique_ptr<IProcess> Processor::wait()\\n\\n{\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 34,\n \"score\": 7.121676900867499\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/date_time.hpp\\\"\\n\\n\\n\\n#include <chrono>\\n\\n#include <ctime>\\n\\n\\n\\nnamespace dansandu::ballotin::date_time\\n\\n{\\n\\n\\n\\nstd::string getDateTime()\\n\\n{\\n\\n auto t = time_t{};\\n\\n time(&t);\\n\\n\\n\\n auto tt = tm{};\\n\\n\\n\\n#ifdef _WIN32\\n\\n gmtime_s(&tt, &t);\\n\\n#else\\n\\n gmtime_r(&t, &tt);\\n\\n#endif\\n\\n\\n\\n char buffer[64];\\n\\n strftime(buffer, sizeof(buffer) / sizeof(*buffer), \\\"%Y-%m-%d %H:%M:%S%z\\\", &tt);\\n\\n\\n\\n return buffer;\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/date_time.cpp\",\n \"rank\": 35,\n \"score\": 7.052971571705927\n },\n {\n \"content\": \" const auto casted = static_cast<Implementation*>(implementation_.get());\\n\\n if (casted->process_)\\n\\n {\\n\\n {\\n\\n const auto lock = std::lock_guard{casted->mutex_};\\n\\n casted->events_.push_back(Event::wait);\\n\\n }\\n\\n casted->conditionVariable_.notify_one();\\n\\n casted->thread_.join();\\n\\n }\\n\\n return std::move(casted->process_);\\n\\n}\\n\\n\\n\\nstd::unique_ptr<IProcess> Processor::yield()\\n\\n{\\n\\n const auto casted = static_cast<Implementation*>(implementation_.get());\\n\\n if (casted->process_)\\n\\n {\\n\\n {\\n\\n const auto lock = std::lock_guard{casted->mutex_};\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 36,\n \"score\": 6.865452302204998\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/random.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\n#include <algorithm>\\n\\n\\n\\nusing dansandu::ballotin::random::PredictableBitGenerator;\\n\\n\\n\\nTEST_CASE(\\\"random\\\")\\n\\n{\\n\\n SECTION(\\\"PredictableBitGenerator\\\")\\n\\n {\\n\\n SECTION(\\\"seedless\\\")\\n\\n {\\n\\n SECTION(\\\"samples\\\")\\n\\n {\\n\\n auto generator = PredictableBitGenerator{};\\n\\n\\n\\n REQUIRE(generator.min() == 0U);\\n\\n\\n\\n REQUIRE(generator.max() == 255U);\\n\",\n \"file_path\": \"sources/dansandu/ballotin/random.test.cpp\",\n \"rank\": 37,\n \"score\": 6.86516764722126\n },\n {\n \"content\": \"bool contains(const std::vector<T>& container, const E& element)\\n\\n{\\n\\n return std::find(container.cbegin(), container.cend(), element) != container.cend();\\n\\n}\\n\\n\\n\\ntemplate<typename T, typename E>\\n\\nvoid uniquePushBack(std::vector<T>& container, E&& element)\\n\\n{\\n\\n if (auto position = std::find(container.cbegin(), container.cend(), element); position == container.cend())\\n\\n {\\n\\n container.push_back(std::forward<E>(element));\\n\\n }\\n\\n}\\n\\n\\n\\ntemplate<typename T>\\n\\nstd::ostream& operator<<(std::ostream& stream, const std::vector<T>& container)\\n\\n{\\n\\n auto addComma = false;\\n\\n stream << \\\"[\\\";\\n\\n for (const auto& element : container)\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.hpp\",\n \"rank\": 38,\n \"score\": 6.765770928275906\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/string.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n#include \\\"dansandu/ballotin/exception.hpp\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\nusing dansandu::ballotin::string::format;\\n\\nusing dansandu::ballotin::string::join;\\n\\nusing dansandu::ballotin::string::split;\\n\\nusing dansandu::ballotin::string::trim;\\n\\n\\n\\nTEST_CASE(\\\"string\\\")\\n\\n{\\n\\n SECTION(\\\"join\\\")\\n\\n {\\n\\n SECTION(\\\"nonempty separator and list\\\")\\n\\n {\\n\\n std::vector<int> integers = {1, 2, 3, 4};\\n\\n REQUIRE(join(integers, \\\", \\\") == \\\"1, 2, 3, 4\\\");\\n\\n }\\n\",\n \"file_path\": \"sources/dansandu/ballotin/string.test.cpp\",\n \"rank\": 39,\n \"score\": 6.725182501826636\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/binary.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\n#include <cstdint>\\n\\n#include <vector>\\n\\n\\n\\nusing dansandu::ballotin::binary::pushBits;\\n\\n\\n\\nusing bytes_type = std::vector<uint8_t>;\\n\\n\\n\\nTEST_CASE(\\\"binary\\\")\\n\\n{\\n\\n SECTION(\\\"push bits\\\")\\n\\n {\\n\\n SECTION(\\\"new byte partial write\\\")\\n\\n {\\n\\n bytes_type output = {};\\n\\n\\n\\n auto bitsCount = 0;\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 40,\n \"score\": 6.282337066906995\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"dansandu/ballotin/string.hpp\\\"\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <thread>\\n\\n\\n\\n#define THROW(exception, ...) \\\\\\n\\n throw exception{dansandu::ballotin::string::format(\\\"'\\\", #exception, \\\"' exception in thread '\\\", \\\\\\n\\n std::this_thread::get_id(), \\\\\\n\\n \\\"': \\\", dansandu::ballotin::string::format(__VA_ARGS__), \\\\\\n\\n \\\"\\\\n at \\\", __func__, \\\"(\\\", __FILE__, \\\":\\\", __LINE__, \\\")\\\")};\\n\",\n \"file_path\": \"sources/dansandu/ballotin/exception.hpp\",\n \"rank\": 41,\n \"score\": 6.066664982677775\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <type_traits>\\n\\n#include <variant>\\n\\n\\n\\nnamespace dansandu::ballotin::type_traits\\n\\n{\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/type_traits.hpp\",\n \"rank\": 42,\n \"score\": 5.6522548257993\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"dansandu/ballotin/type_traits.hpp\\\"\\n\\n\\n\\n#include <chrono>\\n\\n#include <memory>\\n\\n\\n\\nnamespace dansandu::ballotin::processor\\n\\n{\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.hpp\",\n \"rank\": 43,\n \"score\": 5.499857423342395\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/processor.hpp\\\"\\n\\n\\n\\n#include <chrono>\\n\\n#include <condition_variable>\\n\\n#include <memory>\\n\\n#include <mutex>\\n\\n#include <thread>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::processor\\n\\n{\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 44,\n \"score\": 5.488743430064611\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include \\\"dansandu/ballotin/string.hpp\\\"\\n\\n\\n\\n#include <atomic>\\n\\n#include <functional>\\n\\n#include <memory>\\n\\n#include <mutex>\\n\\n#include <string>\\n\\n#include <string_view>\\n\\n#include <thread>\\n\\n#include <vector>\\n\\n\\n\\nnamespace dansandu::ballotin::logging\\n\\n{\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/logging.hpp\",\n \"rank\": 45,\n \"score\": 5.3747592612285136\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\nnamespace dansandu::ballotin::relation\\n\\n{\\n\\n\\n\\ntemplate<typename T>\\n\",\n \"file_path\": \"sources/dansandu/ballotin/relation.hpp\",\n \"rank\": 46,\n \"score\": 5.3038671848018115\n },\n {\n \"content\": \"#include \\\"dansandu/ballotin/relation.hpp\\\"\\n\\n#include \\\"catchorg/catch/catch.hpp\\\"\\n\\n\\n\\nusing dansandu::ballotin::relation::TotalOrder;\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/relation.test.cpp\",\n \"rank\": 47,\n \"score\": 5.234473767629856\n },\n {\n \"content\": \"\\n\\n auto lock = std::unique_lock{mutex_};\\n\\n\\n\\n if (handleEvents())\\n\\n {\\n\\n return;\\n\\n }\\n\\n\\n\\n while (paused)\\n\\n {\\n\\n conditionVariable_.wait(lock);\\n\\n\\n\\n if (handleEvents())\\n\\n {\\n\\n return;\\n\\n }\\n\\n }\\n\\n\\n\\n if (remaining > std::chrono::milliseconds::zero())\\n\\n {\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 48,\n \"score\": 4.895054463724028\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <string>\\n\\n\\n\\nnamespace dansandu::ballotin::date_time\\n\\n{\\n\\n\\n\\nstd::string getDateTime();\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/date_time.hpp\",\n \"rank\": 49,\n \"score\": 4.643605514744116\n },\n {\n \"content\": \"\\n\\n REQUIRE(pop(stack) == 11);\\n\\n\\n\\n REQUIRE(pop(stack) == 7);\\n\\n }\\n\\n\\n\\n SECTION(\\\"contains\\\")\\n\\n {\\n\\n auto container = std::vector<int>{{3, 5, 7, 10}};\\n\\n\\n\\n REQUIRE(contains(container, 5));\\n\\n\\n\\n REQUIRE(!contains(container, 8));\\n\\n }\\n\\n\\n\\n SECTION(\\\"unique push back\\\")\\n\\n {\\n\\n auto container = std::vector<int>{{1, 3, 5, 7}};\\n\\n\\n\\n SECTION(\\\"unique\\\")\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.test.cpp\",\n \"rank\": 50,\n \"score\": 4.514603732773809\n },\n {\n \"content\": \"\\n\\n while (static_cast<int>(bytes.size()) > bytesCount)\\n\\n {\\n\\n bytes.pop_back();\\n\\n }\\n\\n\\n\\n const auto bitsCapacity = bytesCount * bitsPerByte;\\n\\n\\n\\n auto remainingBits = bitsToAppend;\\n\\n auto remainingBitsCount = bitsToAppendCount;\\n\\n\\n\\n while (remainingBitsCount > 0)\\n\\n {\\n\\n const auto freeBitsCount = bitsCapacity - bitsCount;\\n\\n\\n\\n if (const auto implaceBitsCount = std::min(freeBitsCount, remainingBitsCount); implaceBitsCount > 0)\\n\\n {\\n\\n const auto implaceMask = (1U << implaceBitsCount) - 1U;\\n\\n bytes.back() |= (remainingBits & implaceMask) << (bitsPerByte - freeBitsCount);\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.cpp\",\n \"rank\": 51,\n \"score\": 4.3799986047786446\n },\n {\n \"content\": \"\\n\\n const auto expected = std::vector<unsigned>{{0, 1, 2, 3, 4, 5, 6, 7}};\\n\\n\\n\\n auto actual = std::vector<unsigned>{};\\n\\n for (auto i = 0U; i < expected.size(); ++i)\\n\\n {\\n\\n actual.push_back(generator());\\n\\n }\\n\\n\\n\\n REQUIRE(expected == actual);\\n\\n }\\n\\n\\n\\n SECTION(\\\"shuffle\\\")\\n\\n {\\n\\n const auto samples = 50000;\\n\\n\\n\\n auto ordered = std::vector<int>{};\\n\\n for (auto index = 0; index < samples; ++index)\\n\\n {\\n\\n ordered.push_back(index);\\n\",\n \"file_path\": \"sources/dansandu/ballotin/random.test.cpp\",\n \"rank\": 52,\n \"score\": 4.234990475103344\n },\n {\n \"content\": \" {\\n\\n if (addComma)\\n\\n stream << \\\", \\\";\\n\\n stream << element;\\n\\n addComma = true;\\n\\n }\\n\\n return stream << \\\"]\\\";\\n\\n}\\n\\n\\n\\ntemplate<typename K, typename V>\\n\\nstd::ostream& operator<<(std::ostream& stream, const std::map<K, V>& container)\\n\\n{\\n\\n auto addComma = false;\\n\\n stream << \\\"{\\\";\\n\\n for (const auto& pair : container)\\n\\n {\\n\\n if (addComma)\\n\\n stream << \\\", \\\";\\n\\n stream << pair.first << \\\": \\\" << pair.second;\\n\\n addComma = true;\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.hpp\",\n \"rank\": 53,\n \"score\": 3.955242603721711\n },\n {\n \"content\": \" {\\n\\n uniquePushBack(container, 0);\\n\\n\\n\\n REQUIRE(container == std::vector<int>{{1, 3, 5, 7, 0}});\\n\\n }\\n\\n\\n\\n SECTION(\\\"duplicate\\\")\\n\\n {\\n\\n uniquePushBack(container, 3);\\n\\n\\n\\n REQUIRE(container == std::vector<int>{{1, 3, 5, 7}});\\n\\n }\\n\\n }\\n\\n\\n\\n SECTION(\\\"pretty print\\\")\\n\\n {\\n\\n auto stream = std::stringstream{};\\n\\n\\n\\n SECTION(\\\"empty vector\\\")\\n\\n {\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.test.cpp\",\n \"rank\": 54,\n \"score\": 3.9199625164313625\n },\n {\n \"content\": \" return result;\\n\\n}\\n\\n\\n\\ntemplate<typename... Arguments>\\n\\nauto format(Arguments&&... arguments)\\n\\n{\\n\\n auto stream = std::stringstream{};\\n\\n (stream << ... << arguments);\\n\\n return stream.str();\\n\\n}\\n\\n\\n\\nPRALINE_EXPORT std::vector<std::string> split(const std::string_view string, const std::string_view delimiter);\\n\\n\\n\\nPRALINE_EXPORT std::string trim(const std::string_view string);\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/string.hpp\",\n \"rank\": 55,\n \"score\": 3.38773520798557\n },\n {\n \"content\": \" const auto timepoint = std::chrono::system_clock::now() + remaining;\\n\\n\\n\\n auto status = std::cv_status::no_timeout;\\n\\n\\n\\n while ((status != std::cv_status::timeout) & !paused)\\n\\n {\\n\\n status = conditionVariable_.wait_until(lock, timepoint);\\n\\n if (handleEvents())\\n\\n {\\n\\n return;\\n\\n }\\n\\n }\\n\\n\\n\\n if (status == std::cv_status::timeout)\\n\\n {\\n\\n remaining = interval_;\\n\\n }\\n\\n else\\n\\n {\\n\\n remaining = std::chrono::duration_cast<std::chrono::milliseconds>(timepoint -\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 56,\n \"score\": 3.2512358143521807\n },\n {\n \"content\": \"\\n\\n constexpr static result_type min()\\n\\n {\\n\\n return 0U;\\n\\n }\\n\\n\\n\\n constexpr static result_type max()\\n\\n {\\n\\n return 255U;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n result_type index_;\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/random.hpp\",\n \"rank\": 57,\n \"score\": 3.0156891609125216\n },\n {\n \"content\": \" stream << std::vector<int>{};\\n\\n REQUIRE(stream.str() == \\\"[]\\\");\\n\\n }\\n\\n\\n\\n SECTION(\\\"singleton vector\\\")\\n\\n {\\n\\n stream << std::vector<int>{1};\\n\\n REQUIRE(stream.str() == \\\"[1]\\\");\\n\\n }\\n\\n\\n\\n SECTION(\\\"many elements vector\\\")\\n\\n {\\n\\n stream << std::vector<int>{{1, 2, 3, 4}};\\n\\n REQUIRE(stream.str() == \\\"[1, 2, 3, 4]\\\");\\n\\n }\\n\\n\\n\\n SECTION(\\\"empty map\\\")\\n\\n {\\n\\n stream << std::map<std::string, int>{};\\n\\n REQUIRE(stream.str() == \\\"{}\\\");\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.test.cpp\",\n \"rank\": 58,\n \"score\": 2.9119966926890486\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\nnamespace dansandu::ballotin::random\\n\\n{\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/random.hpp\",\n \"rank\": 59,\n \"score\": 2.8274098452571748\n },\n {\n \"content\": \"\\n\\n SECTION(\\\"empty separator and nonempty list\\\")\\n\\n {\\n\\n std::vector<int> integers = {1, 2, 3, 4};\\n\\n REQUIRE(join(integers, \\\"\\\") == \\\"1234\\\");\\n\\n }\\n\\n\\n\\n SECTION(\\\"nonempty separator and empty list\\\")\\n\\n {\\n\\n std::vector<int> integers;\\n\\n REQUIRE(join(integers, \\\"#\\\") == \\\"\\\");\\n\\n }\\n\\n\\n\\n SECTION(\\\"empty separator and empty list\\\")\\n\\n {\\n\\n std::vector<int> integers;\\n\\n REQUIRE(join(integers, \\\"\\\") == \\\"\\\");\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/string.test.cpp\",\n \"rank\": 60,\n \"score\": 2.7267031025978414\n },\n {\n \"content\": \" {\\n\\n const auto sequence = {32, 0, 34, 1, 4, 5, 6, 35, 33};\\n\\n const auto codeSize = 6;\\n\\n auto output = bytes_type{};\\n\\n auto bitsCount = 0;\\n\\n\\n\\n for (const auto code : sequence)\\n\\n {\\n\\n pushBits(output, bitsCount, code, codeSize);\\n\\n }\\n\\n\\n\\n const bytes_type expectedOutput = {0b00100000U, 0b00100000U, 0b00000110U, 0b01000100U,\\n\\n 0b01100001U, 0b10001100U, 0b00100001U};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n\\n\\n const auto expectedBitsCount = 54;\\n\\n\\n\\n REQUIRE(bitsCount == expectedBitsCount);\\n\\n }\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 61,\n \"score\": 2.5051240631596885\n },\n {\n \"content\": \" auto done = false;\\n\\n auto wait = false;\\n\\n auto remaining = interval_;\\n\\n\\n\\n const auto handleEvents = [&]()\\n\\n {\\n\\n for (decltype(events_.size()) index = 0; index < events_.size(); ++index)\\n\\n {\\n\\n switch (events_[index])\\n\\n {\\n\\n case Event::resume:\\n\\n // +--------+--------+-------------------------+\\n\\n // | wait | done | paused = wait & !done |\\n\\n // +--------+--------+-------------------------+\\n\\n // | 0 | 0 | 0 |\\n\\n // | 0 | 1 | 0 |\\n\\n // | 1 | 0 | 1 |\\n\\n // | 1 | 1 | 0 |\\n\\n // +--------+--------+-------------------------+\\n\\n paused = wait & !done;\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 62,\n \"score\": 2.5037855698581497\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n SECTION(\\\"with seed\\\")\\n\\n {\\n\\n auto generator = PredictableBitGenerator{252U};\\n\\n\\n\\n REQUIRE(generator.min() == 0U);\\n\\n\\n\\n REQUIRE(generator.max() == 255U);\\n\\n\\n\\n const auto expected = std::vector<unsigned>{{252, 253, 254, 255, 0, 1, 2}};\\n\\n\\n\\n auto actual = std::vector<unsigned>{};\\n\\n for (auto i = 0U; i < expected.size(); ++i)\\n\\n {\\n\\n actual.push_back(generator());\\n\\n }\\n\\n\\n\\n REQUIRE(expected == actual);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/random.test.cpp\",\n \"rank\": 63,\n \"score\": 2.4553759877110366\n },\n {\n \"content\": \" }\\n\\n\\n\\n SECTION(\\\"singleton map\\\")\\n\\n {\\n\\n stream << std::map<std::string, int>{{{\\\"key\\\", 17}}};\\n\\n REQUIRE(stream.str() == \\\"{key: 17}\\\");\\n\\n }\\n\\n\\n\\n SECTION(\\\"many elements map\\\")\\n\\n {\\n\\n stream << std::map<std::string, int>{{{\\\"key\\\", 17}, {\\\"other\\\", 20}, {\\\"another\\\", 23}}};\\n\\n REQUIRE(stream.str() == \\\"{another: 23, key: 17, other: 20}\\\");\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.test.cpp\",\n \"rank\": 64,\n \"score\": 2.444549221522946\n },\n {\n \"content\": \" }\\n\\n\\n\\n const auto seed = 0U;\\n\\n\\n\\n auto generator = PredictableBitGenerator{seed};\\n\\n auto shuffled = ordered;\\n\\n std::shuffle(shuffled.begin(), shuffled.end(), generator);\\n\\n\\n\\n REQUIRE(shuffled.size() == ordered.size());\\n\\n\\n\\n REQUIRE(std::is_permutation(shuffled.cbegin(), shuffled.cend(), ordered.cbegin(), ordered.cend()));\\n\\n\\n\\n const auto expected = shuffled;\\n\\n\\n\\n generator.seed(seed);\\n\\n\\n\\n shuffled = ordered;\\n\\n std::shuffle(shuffled.begin(), shuffled.end(), generator);\\n\\n\\n\\n REQUIRE(expected == shuffled);\\n\",\n \"file_path\": \"sources/dansandu/ballotin/random.test.cpp\",\n \"rank\": 65,\n \"score\": 2.252167574636667\n },\n {\n \"content\": \" ++begin;\\n\\n\\n\\n auto end = string.end() - 1;\\n\\n while (end > begin && std::isspace(*end))\\n\\n --end;\\n\\n\\n\\n return {begin, end + 1};\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/string.cpp\",\n \"rank\": 66,\n \"score\": 2.22934589559777\n },\n {\n \"content\": \"\\n\\n auto bitsCount = 12;\\n\\n\\n\\n pushBits(output, bitsCount, 0b0110, 4);\\n\\n\\n\\n const bytes_type expectedOutput = {0b11100101U, 0b01101111U};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n\\n\\n const auto expectedByteCount = 2;\\n\\n\\n\\n REQUIRE(output.size() == expectedByteCount);\\n\\n\\n\\n const auto expectedBitsCount = 16;\\n\\n\\n\\n REQUIRE(bitsCount == expectedBitsCount);\\n\\n }\\n\\n\\n\\n SECTION(\\\"new byte fill\\\")\\n\\n {\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 67,\n \"score\": 2.105916354730592\n },\n {\n \"content\": \" }\\n\\n return stream << \\\"}\\\";\\n\\n}\\n\\n\\n\\ntemplate<typename T>\\n\\nstd::ostream& operator<<(std::ostream& stream, const std::optional<T>& optional)\\n\\n{\\n\\n stream << \\\"Optional(\\\";\\n\\n if (optional)\\n\\n stream << *optional;\\n\\n return stream << \\\")\\\";\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/container.hpp\",\n \"rank\": 68,\n \"score\": 2.09537522687058\n },\n {\n \"content\": \" pushBits(output, bitsCount, 0b101U, 3);\\n\\n\\n\\n const bytes_type expectedOutput = {0b00000101U};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n\\n\\n const auto expectedByteCount = 1;\\n\\n\\n\\n REQUIRE(output.size() == expectedByteCount);\\n\\n\\n\\n const auto expectedBitsCount = 3;\\n\\n\\n\\n REQUIRE(bitsCount == expectedBitsCount);\\n\\n }\\n\\n\\n\\n SECTION(\\\"previous byte parital write\\\")\\n\\n {\\n\\n bytes_type output = {0b00000101U};\\n\\n\\n\\n auto bitsCount = 3;\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 69,\n \"score\": 2.031070159737566\n },\n {\n \"content\": \" auto bitsCount = 7;\\n\\n\\n\\n pushBits(output, bitsCount, 0b10011U, 5);\\n\\n\\n\\n const bytes_type expectedOutput = {0b11100101U, 0b00001001U};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n\\n\\n const auto expectedByteCount = 2;\\n\\n\\n\\n REQUIRE(output.size() == expectedByteCount);\\n\\n\\n\\n const auto expectedBitsCount = 12;\\n\\n\\n\\n REQUIRE(bitsCount == expectedBitsCount);\\n\\n }\\n\\n\\n\\n SECTION(\\\"previous byte fill\\\")\\n\\n {\\n\\n bytes_type output = {0b11100101U, 0b00001111U};\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 70,\n \"score\": 1.9886628214846853\n },\n {\n \"content\": \" bytes_type output = {0b11100101U, 0b01111111U, 0b00101011U};\\n\\n\\n\\n auto bitsCount = 24;\\n\\n\\n\\n pushBits(output, bitsCount, 0b00001100U, 8);\\n\\n\\n\\n const bytes_type expectedOutput = {0b11100101U, 0b01111111U, 0b00101011U, 0b00001100U};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n\\n\\n const auto expectedByteCount = 4;\\n\\n\\n\\n REQUIRE(output.size() == expectedByteCount);\\n\\n\\n\\n const auto expectedBitsCount = 32;\\n\\n\\n\\n REQUIRE(bitsCount == expectedBitsCount);\\n\\n }\\n\\n\\n\\n SECTION(\\\"sequence\\\")\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 71,\n \"score\": 1.9347997822239937\n },\n {\n \"content\": \"\\n\\n const bytes_type expectedOutput = {0b11110100};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n\\n\\n const auto expectedBitsCount = 8;\\n\\n\\n\\n REQUIRE(bitsCount == expectedBitsCount);\\n\\n }\\n\\n\\n\\n SECTION(\\\"byte underflow\\\")\\n\\n {\\n\\n bytes_type output = {0b10101010};\\n\\n auto bitsCount = 9;\\n\\n\\n\\n REQUIRE_THROWS_AS(pushBits(output, bitsCount, 0b00110011, 6), std::invalid_argument);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 72,\n \"score\": 1.8457874084396222\n },\n {\n \"content\": \"\\n\\n SECTION(\\\"large append\\\")\\n\\n {\\n\\n bytes_type output = {0b00000111};\\n\\n\\n\\n auto bitsCount = 3;\\n\\n\\n\\n pushBits(output, bitsCount, 0b11111011110111011010, 20);\\n\\n\\n\\n const bytes_type expectedOutput = {0b11010111, 0b11101110, 0b01111101};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n }\\n\\n\\n\\n SECTION(\\\"byte overflow\\\")\\n\\n {\\n\\n bytes_type output = {0b00110100, 0b00000000, 0b00000000};\\n\\n auto bitsCount = 6;\\n\\n\\n\\n pushBits(output, bitsCount, 0b00000011, 2);\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 73,\n \"score\": 1.7604948052244769\n },\n {\n \"content\": \"\\n\\n pushBits(output, bitsCount, 0b1100U, 4);\\n\\n\\n\\n const bytes_type expectedOutput = {0b01100101U};\\n\\n\\n\\n REQUIRE(output == expectedOutput);\\n\\n\\n\\n const auto expectedByteCount = 1;\\n\\n\\n\\n REQUIRE(output.size() == expectedByteCount);\\n\\n\\n\\n const auto expectedBitsCount = 7;\\n\\n\\n\\n REQUIRE(bitsCount == expectedBitsCount);\\n\\n }\\n\\n\\n\\n SECTION(\\\"previous byte write extending to new byte\\\")\\n\\n {\\n\\n bytes_type output = {0b01100101U};\\n\\n\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.test.cpp\",\n \"rank\": 74,\n \"score\": 1.6977338861482911\n },\n {\n \"content\": \" remainingBits >>= implaceBitsCount;\\n\\n remainingBitsCount -= implaceBitsCount;\\n\\n bitsCount += implaceBitsCount;\\n\\n }\\n\\n\\n\\n if (const auto extendedBitsCount = std::min(bitsPerByte, remainingBitsCount); extendedBitsCount > 0)\\n\\n {\\n\\n const auto extendedMask = (1U << extendedBitsCount) - 1U;\\n\\n bytes.push_back(remainingBits & extendedMask);\\n\\n\\n\\n remainingBits >>= extendedBitsCount;\\n\\n remainingBitsCount -= extendedBitsCount;\\n\\n bitsCount += extendedBitsCount;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"sources/dansandu/ballotin/binary.cpp\",\n \"rank\": 75,\n \"score\": 1.5214561923852314\n },\n {\n \"content\": \" auto tokenEnd = tokenBegin;\\n\\n while ((tokenEnd = std::search(tokenBegin, string.cend(), delimiter.cbegin(), delimiter.cend())) != string.cend())\\n\\n {\\n\\n if (tokenBegin != tokenEnd)\\n\\n {\\n\\n tokens.emplace_back(tokenBegin, tokenEnd);\\n\\n }\\n\\n tokenBegin = tokenEnd + delimiter.size();\\n\\n }\\n\\n if (tokenBegin != tokenEnd)\\n\\n {\\n\\n tokens.emplace_back(tokenBegin, tokenEnd);\\n\\n }\\n\\n return tokens;\\n\\n}\\n\\n\\n\\nstd::string trim(const std::string_view string)\\n\\n{\\n\\n auto begin = string.begin();\\n\\n while (begin < string.end() && std::isspace(*begin))\\n\",\n \"file_path\": \"sources/dansandu/ballotin/string.cpp\",\n \"rank\": 76,\n \"score\": 1.4975345367974282\n },\n {\n \"content\": \" std::chrono::system_clock::now());\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n std::thread thread_;\\n\\n std::condition_variable conditionVariable_;\\n\\n std::vector<Event> events_;\\n\\n std::unique_ptr<IProcess> process_;\\n\\n std::chrono::milliseconds interval_;\\n\\n std::mutex mutex_;\\n\\n};\\n\\n\\n\\nProcessor::Processor(std::unique_ptr<IProcess> process, const std::chrono::milliseconds interval)\\n\\n : implementation_{new Implementation{std::move(process), interval}, &Implementation::deleter}\\n\\n{\\n\\n}\\n\\n\\n\\nvoid Processor::resume()\\n\",\n \"file_path\": \"sources/dansandu/ballotin/processor.cpp\",\n \"rank\": 77,\n \"score\": 1.31255754540252\n }\n]","isConversational":false}}},{"rowIdx":469,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"external/opengl/libagl2/src/texture.cpp"},"repo_name":{"kind":"string","value":"gordonjohnpatrick/XobotOS"},"commit":{"kind":"string","value":"888ed3b8cc8d8e0a54b1858bfa5a3572545f4d2f"},"file_code":{"kind":"string","value":"#include \"gles2context.h\"\n\n#define API_ENTRY\n#define CALL_GL_API(NAME,...) LOGD(\"?\"#NAME); assert(0);\n#define CALL_GL_API_RETURN(NAME,...) LOGD(\"?\"#NAME); assert(0); return 0;\n\nstatic inline GGLTexture * AllocTexture()\n{\n GGLTexture * tex = (GGLTexture *)calloc(1, sizeof(GGLTexture));\n tex->minFilter = GGLTexture::GGL_LINEAR; \n tex->magFilter = GGLTexture::GGL_LINEAR;\n return tex;\n}\n\nvoid GLES2Context::InitializeTextures()\n{\n tex.textures = std::map<GLuint, GGLTexture *>(); \n tex.tex2D = AllocTexture();\n tex.textures[GL_TEXTURE_2D] = tex.tex2D;\n tex.texCube = AllocTexture();\n tex.textures[GL_TEXTURE_CUBE_MAP] = tex.texCube;\n for (unsigned i = 0; i < GGL_MAXCOMBINEDTEXTUREIMAGEUNITS; i++) {\n tex.tmus[i] = NULL;\n tex.sampler2tmu[i] = NULL;\n }\n\n tex.active = 0;\n\n tex.free = max(GL_TEXTURE_2D, GL_TEXTURE_CUBE_MAP) + 1;\n\n tex.tex2D->format = GGL_PIXEL_FORMAT_RGBA_8888;\n tex.tex2D->type = GL_TEXTURE_2D;\n tex.tex2D->levelCount = 1;\n tex.tex2D->wrapS = tex.tex2D->wrapT = GGLTexture::GGL_REPEAT;\n tex.tex2D->minFilter = tex.tex2D->magFilter = GGLTexture::GGL_NEAREST;\n tex.tex2D->width = tex.tex2D->height = 1;\n tex.tex2D->levels = malloc(4);\n *(unsigned *)tex.tex2D->levels = 0xff000000;\n\n tex.texCube->format = GGL_PIXEL_FORMAT_RGBA_8888;\n tex.texCube->type = GL_TEXTURE_CUBE_MAP;\n tex.texCube->levelCount = 1;\n tex.texCube->wrapS = tex.texCube->wrapT = GGLTexture::GGL_REPEAT;\n tex.texCube->minFilter = tex.texCube->magFilter = GGLTexture::GGL_NEAREST;\n tex.texCube->width = tex.texCube->height = 1;\n tex.texCube->levels = malloc(4 * 6);\n static unsigned texels [6] = {0xff0000ff, 0xff00ff00, 0xffff0000,\n 0xff00ffff, 0xffffff00, 0xffff00ff\n };\n memcpy(tex.texCube->levels, texels, sizeof texels);\n\n \n\n \n \n \n \n \n \n \n \n tex.unpack = 4;\n}\n\nvoid GLES2Context::TextureState::UpdateSampler(GGLInterface * iface, unsigned tmu)\n{\n for (unsigned i = 0; i < GGL_MAXCOMBINEDTEXTUREIMAGEUNITS; i++)\n if (tmu == sampler2tmu[i])\n iface->SetSampler(iface, i, tmus[tmu]);\n}\n\nvoid GLES2Context::UninitializeTextures()\n{\n for (std::map<GLuint, GGLTexture *>::iterator it = tex.textures.begin(); it != tex.textures.end(); it++) {\n if (!it->second)\n continue;\n free(it->second->levels);\n free(it->second);\n }\n}\n\nstatic inline void GetFormatAndBytesPerPixel(const GLenum format, unsigned * bytesPerPixel,\n GGLPixelFormat * texFormat)\n{\n switch (format) {\n case GL_ALPHA:\n *texFormat = GGL_PIXEL_FORMAT_A_8;\n *bytesPerPixel = 1;\n break;\n case GL_LUMINANCE:\n *texFormat = GGL_PIXEL_FORMAT_L_8;\n *bytesPerPixel = 1;\n break;\n case GL_LUMINANCE_ALPHA:\n *texFormat = GGL_PIXEL_FORMAT_LA_88;\n *bytesPerPixel = 2;\n break;\n case GL_RGB:\n *texFormat = GGL_PIXEL_FORMAT_RGB_888;\n *bytesPerPixel = 3;\n break;\n case GL_RGBA:\n *texFormat = GGL_PIXEL_FORMAT_RGBA_8888;\n *bytesPerPixel = 4;\n break;\n\n \n case GL_UNSIGNED_SHORT_5_6_5:\n *texFormat = GGL_PIXEL_FORMAT_RGB_565;\n *bytesPerPixel = 2;\n break;\n\n default:\n assert(0);\n return;\n }\n}\n\nstatic inline void CopyTexture(char * dst, const char * src, const unsigned bytesPerPixel,\n const unsigned sx, const unsigned sy, const unsigned sw,\n const unsigned dx, const unsigned dy, const unsigned dw,\n const unsigned w, const unsigned h)\n{\n const unsigned bpp = bytesPerPixel;\n if (dw == sw && dw == w && sx == 0 && dx == 0)\n memcpy(dst + dy * dw * bpp, src + sy * sw * bpp, w * h * bpp);\n else\n for (unsigned y = 0; y < h; y++)\n memcpy(dst + ((dy + y) * dw + dx) * bpp, src + ((sy + y) * sw + sx) * bpp, w * bpp); \n}\n\nvoid glActiveTexture(GLenum texture)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n unsigned index = texture - GL_TEXTURE0;\n assert(NELEM(ctx->tex.tmus) > index);\n\n ctx->tex.active = index;\n}\n\nvoid glBindTexture(GLenum target, GLuint texture)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n std::map<GLuint, GGLTexture *>::iterator it = ctx->tex.textures.find(texture);\n GGLTexture * tex = NULL;\n if (it != ctx->tex.textures.end()) {\n tex = it->second;\n if (!tex) {\n tex = AllocTexture();\n tex->type = target;\n it->second = tex;\n\n }\n\n assert(target == tex->type);\n } else if (0 == texture) {\n if (GL_TEXTURE_2D == target)\n {\n tex = ctx->tex.tex2D;\n\n }\n else if (GL_TEXTURE_CUBE_MAP == target)\n {\n tex = ctx->tex.texCube;\n\n }\n else\n assert(0);\n } else {\n if (texture <= ctx->tex.free)\n ctx->tex.free = texture + 1;\n tex = AllocTexture();\n tex->type = target;\n ctx->tex.textures[texture] = tex;\n\n }\n ctx->tex.tmus[ctx->tex.active] = tex;\n\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid API_ENTRY(glCompressedTexImage2D)(GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const GLvoid* data)\n{\n CALL_GL_API(glCompressedTexImage2D, target, level, internalformat, width, height, border, imageSize, data);\n}\n\nvoid API_ENTRY(glCompressedTexSubImage2D)(GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const GLvoid* data)\n{\n CALL_GL_API(glCompressedTexSubImage2D, target, level, xoffset, yoffset, width, height, format, imageSize, data);\n}\n\nvoid glCopyTexImage2D(GLenum target, GLint level, GLenum internalformat,\n GLint x, GLint y, GLsizei width, GLsizei height, GLint border)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(0 == border);\n assert(0 == level);\n unsigned bytesPerPixel = 0;\n GGLPixelFormat texFormat = GGL_PIXEL_FORMAT_UNKNOWN;\n GetFormatAndBytesPerPixel(internalformat, &bytesPerPixel, &texFormat);\n\n assert(texFormat == ctx->rasterizer.frameSurface.format);\n\n unsigned offset = 0, size = width * height * bytesPerPixel, totalSize = size;\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n assert(y + height <= ctx->rasterizer.frameSurface.height);\n assert(x + width <= ctx->rasterizer.frameSurface.width);\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n tex.width = width;\n tex.height = height;\n tex.levelCount = 1;\n tex.format = texFormat;\n switch (target) {\n case GL_TEXTURE_2D:\n tex.levels = realloc(tex.levels, totalSize);\n CopyTexture((char *)tex.levels, (const char *)ctx->rasterizer.frameSurface.data, bytesPerPixel,\n x, y, ctx->rasterizer.frameSurface.width, 0, 0, width, width, height);\n break;\n default:\n assert(0);\n return;\n }\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid glCopyTexSubImage2D(GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height)\n{\n \n \n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(0 == level);\n\n unsigned bytesPerPixel = 4;\n unsigned offset = 0, size = width * height * bytesPerPixel, totalSize = size;\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n\n assert(tex.format == ctx->rasterizer.frameSurface.format);\n assert(GGL_PIXEL_FORMAT_RGBA_8888 == tex.format);\n\n const unsigned srcWidth = ctx->rasterizer.frameSurface.width;\n const unsigned srcHeight = ctx->rasterizer.frameSurface.height;\n\n assert(x >= 0 && y >= 0);\n assert(xoffset >= 0 && yoffset >= 0);\n assert(x + width <= srcWidth);\n assert(y + height <= srcHeight);\n assert(xoffset + width <= tex.width);\n assert(yoffset + height <= tex.height);\n\n switch (target) {\n case GL_TEXTURE_2D:\n CopyTexture((char *)tex.levels, (const char *)ctx->rasterizer.frameSurface.data, bytesPerPixel,\n x, y, srcWidth, xoffset, yoffset, tex.width, width, height);\n break;\n default:\n assert(0);\n return;\n }\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid glDeleteTextures(GLsizei n, const GLuint* textures)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n for (unsigned i = 0; i < n; i++) {\n std::map<GLuint, GGLTexture *>::iterator it = ctx->tex.textures.find(textures[i]);\n if (it == ctx->tex.textures.end())\n continue;\n ctx->tex.free = min(ctx->tex.free, textures[i]);\n for (unsigned i = 0; i < GGL_MAXCOMBINEDTEXTUREIMAGEUNITS; i++)\n if (ctx->tex.tmus[i] == it->second) {\n if (GL_TEXTURE_2D == it->second->type)\n ctx->tex.tmus[i] = ctx->tex.tex2D;\n else if (GL_TEXTURE_CUBE_MAP == it->second->type)\n ctx->tex.tmus[i] = ctx->tex.texCube;\n else\n assert(0);\n ctx->tex.UpdateSampler(ctx->iface, i);\n }\n if (it->second) {\n free(it->second->levels);\n free(it->second);\n }\n ctx->tex.textures.erase(it);\n }\n}\n\nvoid glGenTextures(GLsizei n, GLuint* textures)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n for (unsigned i = 0; i < n; i++) {\n textures[i] = 0;\n for (ctx->tex.free; ctx->tex.free < 0xffffffffu; ctx->tex.free++)\n if (ctx->tex.textures.find(ctx->tex.free) == ctx->tex.textures.end()) {\n ctx->tex.textures[ctx->tex.free] = NULL;\n textures[i] = ctx->tex.free;\n ctx->tex.free++;\n break;\n }\n assert(textures[i]);\n }\n}\n\nvoid API_ENTRY(glGetTexParameterfv)(GLenum target, GLenum pname, GLfloat* params)\n{\n CALL_GL_API(glGetTexParameterfv, target, pname, params);\n}\nvoid API_ENTRY(glGetTexParameteriv)(GLenum target, GLenum pname, GLint* params)\n{\n CALL_GL_API(glGetTexParameteriv, target, pname, params);\n}\n\nGLboolean glIsTexture(GLuint texture)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n if (ctx->tex.textures.find(texture) == ctx->tex.textures.end())\n return GL_FALSE;\n else\n return GL_TRUE;\n}\n\nvoid glPixelStorei(GLenum pname, GLint param)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n assert(GL_UNPACK_ALIGNMENT == pname);\n assert(1 == param || 2 == param || 4 == param || 8 == param);\n\n ctx->tex.unpack = param;\n\n}\nvoid glTexImage2D(GLenum target, GLint level, GLint internalformat, GLsizei width,\n GLsizei height, GLint border, GLenum format, GLenum type, const GLvoid* pixels)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n switch (type) {\n case GL_UNSIGNED_BYTE:\n break;\n case GL_UNSIGNED_SHORT_5_6_5:\n internalformat = format = GL_UNSIGNED_SHORT_5_6_5;\n assert(4 == ctx->tex.unpack);\n break;\n default:\n assert(0);\n }\n assert(internalformat == format);\n assert(0 == border);\n if (0 != level) {\n LOGD(\"agl2: glTexImage2D level=%d\", level);\n return;\n }\n unsigned bytesPerPixel = 0;\n GGLPixelFormat texFormat = GGL_PIXEL_FORMAT_UNKNOWN;\n GetFormatAndBytesPerPixel(format, &bytesPerPixel, &texFormat);\n\n assert(texFormat && bytesPerPixel);\n\n unsigned offset = 0, size = width * height * bytesPerPixel, totalSize = size;\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n tex.width = width;\n tex.height = height;\n tex.levelCount = 1;\n tex.format = texFormat;\n\n switch (target) {\n case GL_TEXTURE_2D:\n assert(GL_TEXTURE_2D == ctx->tex.tmus[ctx->tex.active]->type);\n offset = 0;\n break;\n break;\n case GL_TEXTURE_CUBE_MAP_POSITIVE_X:\n case GL_TEXTURE_CUBE_MAP_NEGATIVE_X:\n case GL_TEXTURE_CUBE_MAP_POSITIVE_Y:\n case GL_TEXTURE_CUBE_MAP_NEGATIVE_Y:\n case GL_TEXTURE_CUBE_MAP_POSITIVE_Z:\n case GL_TEXTURE_CUBE_MAP_NEGATIVE_Z:\n assert(GL_TEXTURE_CUBE_MAP == ctx->tex.tmus[ctx->tex.active]->type);\n assert(width == height);\n offset = (target - GL_TEXTURE_CUBE_MAP_POSITIVE_X) * size;\n totalSize = 6 * size;\n break;\n default:\n assert(0);\n return;\n }\n\n tex.levels = realloc(tex.levels, totalSize);\n if (pixels)\n CopyTexture((char *)tex.levels, (const char *)pixels, bytesPerPixel, 0, 0, width, 0, 0, width, width, height);\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid glTexParameterf(GLenum target, GLenum pname, GLfloat param)\n{\n\n glTexParameteri(target, pname, param);\n}\nvoid API_ENTRY(glTexParameterfv)(GLenum target, GLenum pname, const GLfloat* params)\n{\n CALL_GL_API(glTexParameterfv, target, pname, params);\n}\nvoid glTexParameteri(GLenum target, GLenum pname, GLint param)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n assert(target == ctx->tex.tmus[ctx->tex.active]->type);\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n switch (pname) {\n case GL_TEXTURE_WRAP_S:\n case GL_TEXTURE_WRAP_T:\n GGLTexture::GGLTextureWrap wrap;\n switch (param) {\n case GL_REPEAT:\n wrap = GGLTexture::GGL_REPEAT;\n break;\n case GL_CLAMP_TO_EDGE:\n wrap = GGLTexture::GGL_CLAMP_TO_EDGE;\n break;\n case GL_MIRRORED_REPEAT:\n wrap = GGLTexture::GGL_MIRRORED_REPEAT;\n break;\n default:\n assert(0);\n return;\n }\n if (GL_TEXTURE_WRAP_S == pname)\n tex.wrapS = wrap;\n else\n tex.wrapT = wrap;\n break;\n case GL_TEXTURE_MIN_FILTER:\n switch (param) {\n case GL_NEAREST:\n tex.minFilter = GGLTexture::GGL_NEAREST;\n break;\n case GL_LINEAR:\n tex.minFilter = GGLTexture::GGL_LINEAR;\n break;\n case GL_NEAREST_MIPMAP_NEAREST:\n\n break;\n case GL_NEAREST_MIPMAP_LINEAR:\n\n break;\n case GL_LINEAR_MIPMAP_NEAREST:\n\n break;\n case GL_LINEAR_MIPMAP_LINEAR:\n\n break;\n default:\n assert(0);\n return;\n }\n break;\n case GL_TEXTURE_MAG_FILTER:\n switch (param) {\n case GL_NEAREST:\n tex.minFilter = GGLTexture::GGL_NEAREST;\n break;\n case GL_LINEAR:\n tex.minFilter = GGLTexture::GGL_LINEAR;\n break;\n default:\n assert(0);\n return;\n }\n break;\n default:\n assert(0);\n return;\n }\n \n if (tex.magFilter != tex.minFilter)\n tex.magFilter = tex.minFilter = GGLTexture::GGL_LINEAR;\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\nvoid API_ENTRY(glTexParameteriv)(GLenum target, GLenum pname, const GLint* params)\n{\n CALL_GL_API(glTexParameteriv, target, pname, params);\n}\nvoid glTexSubImage2D(GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const GLvoid* pixels)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(0 == level);\n assert(target == ctx->tex.tmus[ctx->tex.active]->type);\n switch (type) {\n case GL_UNSIGNED_BYTE:\n break;\n case GL_UNSIGNED_SHORT_5_6_5:\n format = GL_UNSIGNED_SHORT_5_6_5;\n assert(4 == ctx->tex.unpack);\n break;\n default:\n assert(0);\n }\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n GGLPixelFormat texFormat = GGL_PIXEL_FORMAT_UNKNOWN;\n unsigned bytesPerPixel = 0;\n GetFormatAndBytesPerPixel(format, &bytesPerPixel, &texFormat);\n assert(texFormat == tex.format);\n assert(GL_UNSIGNED_BYTE == type);\n switch (target) {\n case GL_TEXTURE_2D:\n CopyTexture((char *)tex.levels, (const char *)pixels, bytesPerPixel, 0, 0, width, xoffset,\n yoffset, tex.width, width, height);\n break;\n default:\n assert(0);\n }\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n"},"prefix":{"kind":"string","value":"#include \"gles2context.h\"\n\n#define API_ENTRY\n#define CALL_GL_API(NAME,...) LOGD(\"?\"#NAME); assert(0);\n#define CALL_GL_API_RETURN(NAME,...) LOGD(\"?\"#NAME); assert(0); return 0;\n\n"},"suffix":{"kind":"string","value":"\n\nvoid GLES2Context::InitializeTextures()\n{\n tex.textures = std::map<GLuint, GGLTexture *>(); \n tex.tex2D = AllocTexture();\n tex.textures[GL_TEXTURE_2D] = tex.tex2D;\n tex.texCube = AllocTexture();\n tex.textures[GL_TEXTURE_CUBE_MAP] = tex.texCube;\n for (unsigned i = 0; i < GGL_MAXCOMBINEDTEXTUREIMAGEUNITS; i++) {\n tex.tmus[i] = NULL;\n tex.sampler2tmu[i] = NULL;\n }\n\n tex.active = 0;\n\n tex.free = max(GL_TEXTURE_2D, GL_TEXTURE_CUBE_MAP) + 1;\n\n tex.tex2D->format = GGL_PIXEL_FORMAT_RGBA_8888;\n tex.tex2D->type = GL_TEXTURE_2D;\n tex.tex2D->levelCount = 1;\n tex.tex2D->wrapS = tex.tex2D->wrapT = GGLTexture::GGL_REPEAT;\n tex.tex2D->minFilter = tex.tex2D->magFilter = GGLTexture::GGL_NEAREST;\n tex.tex2D->width = tex.tex2D->height = 1;\n tex.tex2D->levels = malloc(4);\n *(unsigned *)tex.tex2D->levels = 0xff000000;\n\n tex.texCube->format = GGL_PIXEL_FORMAT_RGBA_8888;\n tex.texCube->type = GL_TEXTURE_CUBE_MAP;\n tex.texCube->levelCount = 1;\n tex.texCube->wrapS = tex.texCube->wrapT = GGLTexture::GGL_REPEAT;\n tex.texCube->minFilter = tex.texCube->magFilter = GGLTexture::GGL_NEAREST;\n tex.texCube->width = tex.texCube->height = 1;\n tex.texCube->levels = malloc(4 * 6);\n static unsigned texels [6] = {0xff0000ff, 0xff00ff00, 0xffff0000,\n 0xff00ffff, 0xffffff00, 0xffff00ff\n };\n memcpy(tex.texCube->levels, texels, sizeof texels);\n\n \n\n \n \n \n \n \n \n \n \n tex.unpack = 4;\n}\n\nvoid GLES2Context::TextureState::UpdateSampler(GGLInterface * iface, unsigned tmu)\n{\n for (unsigned i = 0; i < GGL_MAXCOMBINEDTEXTUREIMAGEUNITS; i++)\n if (tmu == sampler2tmu[i])\n iface->SetSampler(iface, i, tmus[tmu]);\n}\n\nvoid GLES2Context::UninitializeTextures()\n{\n for (std::map<GLuint, GGLTexture *>::iterator it = tex.textures.begin(); it != tex.textures.end(); it++) {\n if (!it->second)\n continue;\n free(it->second->levels);\n free(it->second);\n }\n}\n\nstatic inline void GetFormatAndBytesPerPixel(const GLenum format, unsigned * bytesPerPixel,\n GGLPixelFormat * texFormat)\n{\n switch (format) {\n case GL_ALPHA:\n *texFormat = GGL_PIXEL_FORMAT_A_8;\n *bytesPerPixel = 1;\n break;\n case GL_LUMINANCE:\n *texFormat = GGL_PIXEL_FORMAT_L_8;\n *bytesPerPixel = 1;\n break;\n case GL_LUMINANCE_ALPHA:\n *texFormat = GGL_PIXEL_FORMAT_LA_88;\n *bytesPerPixel = 2;\n break;\n case GL_RGB:\n *texFormat = GGL_PIXEL_FORMAT_RGB_888;\n *bytesPerPixel = 3;\n break;\n case GL_RGBA:\n *texFormat = GGL_PIXEL_FORMAT_RGBA_8888;\n *bytesPerPixel = 4;\n break;\n\n \n case GL_UNSIGNED_SHORT_5_6_5:\n *texFormat = GGL_PIXEL_FORMAT_RGB_565;\n *bytesPerPixel = 2;\n break;\n\n default:\n assert(0);\n return;\n }\n}\n\nstatic inline void CopyTexture(char * dst, const char * src, const unsigned bytesPerPixel,\n const unsigned sx, const unsigned sy, const unsigned sw,\n const unsigned dx, const unsigned dy, const unsigned dw,\n const unsigned w, const unsigned h)\n{\n const unsigned bpp = bytesPerPixel;\n if (dw == sw && dw == w && sx == 0 && dx == 0)\n memcpy(dst + dy * dw * bpp, src + sy * sw * bpp, w * h * bpp);\n else\n for (unsigned y = 0; y < h; y++)\n memcpy(dst + ((dy + y) * dw + dx) * bpp, src + ((sy + y) * sw + sx) * bpp, w * bpp); \n}\n\nvoid glActiveTexture(GLenum texture)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n unsigned index = texture - GL_TEXTURE0;\n assert(NELEM(ctx->tex.tmus) > index);\n\n ctx->tex.active = index;\n}\n\nvoid glBindTexture(GLenum target, GLuint texture)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n std::map<GLuint, GGLTexture *>::iterator it = ctx->tex.textures.find(texture);\n GGLTexture * tex = NULL;\n if (it != ctx->tex.textures.end()) {\n tex = it->second;\n if (!tex) {\n tex = AllocTexture();\n tex->type = target;\n it->second = tex;\n\n }\n\n assert(target == tex->type);\n } else if (0 == texture) {\n if (GL_TEXTURE_2D == target)\n {\n tex = ctx->tex.tex2D;\n\n }\n else if (GL_TEXTURE_CUBE_MAP == target)\n {\n tex = ctx->tex.texCube;\n\n }\n else\n assert(0);\n } else {\n if (texture <= ctx->tex.free)\n ctx->tex.free = texture + 1;\n tex = AllocTexture();\n tex->type = target;\n ctx->tex.textures[texture] = tex;\n\n }\n ctx->tex.tmus[ctx->tex.active] = tex;\n\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid API_ENTRY(glCompressedTexImage2D)(GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLint border, GLsizei imageSize, const GLvoid* data)\n{\n CALL_GL_API(glCompressedTexImage2D, target, level, internalformat, width, height, border, imageSize, data);\n}\n\nvoid API_ENTRY(glCompressedTexSubImage2D)(GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLsizei imageSize, const GLvoid* data)\n{\n CALL_GL_API(glCompressedTexSubImage2D, target, level, xoffset, yoffset, width, height, format, imageSize, data);\n}\n\nvoid glCopyTexImage2D(GLenum target, GLint level, GLenum internalformat,\n GLint x, GLint y, GLsizei width, GLsizei height, GLint border)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(0 == border);\n assert(0 == level);\n unsigned bytesPerPixel = 0;\n GGLPixelFormat texFormat = GGL_PIXEL_FORMAT_UNKNOWN;\n GetFormatAndBytesPerPixel(internalformat, &bytesPerPixel, &texFormat);\n\n assert(texFormat == ctx->rasterizer.frameSurface.format);\n\n unsigned offset = 0, size = width * height * bytesPerPixel, totalSize = size;\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n assert(y + height <= ctx->rasterizer.frameSurface.height);\n assert(x + width <= ctx->rasterizer.frameSurface.width);\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n tex.width = width;\n tex.height = height;\n tex.levelCount = 1;\n tex.format = texFormat;\n switch (target) {\n case GL_TEXTURE_2D:\n tex.levels = realloc(tex.levels, totalSize);\n CopyTexture((char *)tex.levels, (const char *)ctx->rasterizer.frameSurface.data, bytesPerPixel,\n x, y, ctx->rasterizer.frameSurface.width, 0, 0, width, width, height);\n break;\n default:\n assert(0);\n return;\n }\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid glCopyTexSubImage2D(GLenum target, GLint level, GLint xoffset, GLint yoffset, GLint x, GLint y, GLsizei width, GLsizei height)\n{\n \n \n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(0 == level);\n\n unsigned bytesPerPixel = 4;\n unsigned offset = 0, size = width * height * bytesPerPixel, totalSize = size;\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n\n assert(tex.format == ctx->rasterizer.frameSurface.format);\n assert(GGL_PIXEL_FORMAT_RGBA_8888 == tex.format);\n\n const unsigned srcWidth = ctx->rasterizer.frameSurface.width;\n const unsigned srcHeight = ctx->rasterizer.frameSurface.height;\n\n assert(x >= 0 && y >= 0);\n assert(xoffset >= 0 && yoffset >= 0);\n assert(x + width <= srcWidth);\n assert(y + height <= srcHeight);\n assert(xoffset + width <= tex.width);\n assert(yoffset + height <= tex.height);\n\n switch (target) {\n case GL_TEXTURE_2D:\n CopyTexture((char *)tex.levels, (const char *)ctx->rasterizer.frameSurface.data, bytesPerPixel,\n x, y, srcWidth, xoffset, yoffset, tex.width, width, height);\n break;\n default:\n assert(0);\n return;\n }\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid glDeleteTextures(GLsizei n, const GLuint* textures)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n for (unsigned i = 0; i < n; i++) {\n std::map<GLuint, GGLTexture *>::iterator it = ctx->tex.textures.find(textures[i]);\n if (it == ctx->tex.textures.end())\n continue;\n ctx->tex.free = min(ctx->tex.free, textures[i]);\n for (unsigned i = 0; i < GGL_MAXCOMBINEDTEXTUREIMAGEUNITS; i++)\n if (ctx->tex.tmus[i] == it->second) {\n if (GL_TEXTURE_2D == it->second->type)\n ctx->tex.tmus[i] = ctx->tex.tex2D;\n else if (GL_TEXTURE_CUBE_MAP == it->second->type)\n ctx->tex.tmus[i] = ctx->tex.texCube;\n else\n assert(0);\n ctx->tex.UpdateSampler(ctx->iface, i);\n }\n if (it->second) {\n free(it->second->levels);\n free(it->second);\n }\n ctx->tex.textures.erase(it);\n }\n}\n\nvoid glGenTextures(GLsizei n, GLuint* textures)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n for (unsigned i = 0; i < n; i++) {\n textures[i] = 0;\n for (ctx->tex.free; ctx->tex.free < 0xffffffffu; ctx->tex.free++)\n if (ctx->tex.textures.find(ctx->tex.free) == ctx->tex.textures.end()) {\n ctx->tex.textures[ctx->tex.free] = NULL;\n textures[i] = ctx->tex.free;\n ctx->tex.free++;\n break;\n }\n assert(textures[i]);\n }\n}\n\nvoid API_ENTRY(glGetTexParameterfv)(GLenum target, GLenum pname, GLfloat* params)\n{\n CALL_GL_API(glGetTexParameterfv, target, pname, params);\n}\nvoid API_ENTRY(glGetTexParameteriv)(GLenum target, GLenum pname, GLint* params)\n{\n CALL_GL_API(glGetTexParameteriv, target, pname, params);\n}\n\nGLboolean glIsTexture(GLuint texture)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n if (ctx->tex.textures.find(texture) == ctx->tex.textures.end())\n return GL_FALSE;\n else\n return GL_TRUE;\n}\n\nvoid glPixelStorei(GLenum pname, GLint param)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n assert(GL_UNPACK_ALIGNMENT == pname);\n assert(1 == param || 2 == param || 4 == param || 8 == param);\n\n ctx->tex.unpack = param;\n\n}\nvoid glTexImage2D(GLenum target, GLint level, GLint internalformat, GLsizei width,\n GLsizei height, GLint border, GLenum format, GLenum type, const GLvoid* pixels)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n switch (type) {\n case GL_UNSIGNED_BYTE:\n break;\n case GL_UNSIGNED_SHORT_5_6_5:\n internalformat = format = GL_UNSIGNED_SHORT_5_6_5;\n assert(4 == ctx->tex.unpack);\n break;\n default:\n assert(0);\n }\n assert(internalformat == format);\n assert(0 == border);\n if (0 != level) {\n LOGD(\"agl2: glTexImage2D level=%d\", level);\n return;\n }\n unsigned bytesPerPixel = 0;\n GGLPixelFormat texFormat = GGL_PIXEL_FORMAT_UNKNOWN;\n GetFormatAndBytesPerPixel(format, &bytesPerPixel, &texFormat);\n\n assert(texFormat && bytesPerPixel);\n\n unsigned offset = 0, size = width * height * bytesPerPixel, totalSize = size;\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n tex.width = width;\n tex.height = height;\n tex.levelCount = 1;\n tex.format = texFormat;\n\n switch (target) {\n case GL_TEXTURE_2D:\n assert(GL_TEXTURE_2D == ctx->tex.tmus[ctx->tex.active]->type);\n offset = 0;\n break;\n break;\n case GL_TEXTURE_CUBE_MAP_POSITIVE_X:\n case GL_TEXTURE_CUBE_MAP_NEGATIVE_X:\n case GL_TEXTURE_CUBE_MAP_POSITIVE_Y:\n case GL_TEXTURE_CUBE_MAP_NEGATIVE_Y:\n case GL_TEXTURE_CUBE_MAP_POSITIVE_Z:\n case GL_TEXTURE_CUBE_MAP_NEGATIVE_Z:\n assert(GL_TEXTURE_CUBE_MAP == ctx->tex.tmus[ctx->tex.active]->type);\n assert(width == height);\n offset = (target - GL_TEXTURE_CUBE_MAP_POSITIVE_X) * size;\n totalSize = 6 * size;\n break;\n default:\n assert(0);\n return;\n }\n\n tex.levels = realloc(tex.levels, totalSize);\n if (pixels)\n CopyTexture((char *)tex.levels, (const char *)pixels, bytesPerPixel, 0, 0, width, 0, 0, width, width, height);\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n\nvoid glTexParameterf(GLenum target, GLenum pname, GLfloat param)\n{\n\n glTexParameteri(target, pname, param);\n}\nvoid API_ENTRY(glTexParameterfv)(GLenum target, GLenum pname, const GLfloat* params)\n{\n CALL_GL_API(glTexParameterfv, target, pname, params);\n}\nvoid glTexParameteri(GLenum target, GLenum pname, GLint param)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(ctx->tex.tmus[ctx->tex.active]);\n assert(target == ctx->tex.tmus[ctx->tex.active]->type);\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n switch (pname) {\n case GL_TEXTURE_WRAP_S:\n case GL_TEXTURE_WRAP_T:\n GGLTexture::GGLTextureWrap wrap;\n switch (param) {\n case GL_REPEAT:\n wrap = GGLTexture::GGL_REPEAT;\n break;\n case GL_CLAMP_TO_EDGE:\n wrap = GGLTexture::GGL_CLAMP_TO_EDGE;\n break;\n case GL_MIRRORED_REPEAT:\n wrap = GGLTexture::GGL_MIRRORED_REPEAT;\n break;\n default:\n assert(0);\n return;\n }\n if (GL_TEXTURE_WRAP_S == pname)\n tex.wrapS = wrap;\n else\n tex.wrapT = wrap;\n break;\n case GL_TEXTURE_MIN_FILTER:\n switch (param) {\n case GL_NEAREST:\n tex.minFilter = GGLTexture::GGL_NEAREST;\n break;\n case GL_LINEAR:\n tex.minFilter = GGLTexture::GGL_LINEAR;\n break;\n case GL_NEAREST_MIPMAP_NEAREST:\n\n break;\n case GL_NEAREST_MIPMAP_LINEAR:\n\n break;\n case GL_LINEAR_MIPMAP_NEAREST:\n\n break;\n case GL_LINEAR_MIPMAP_LINEAR:\n\n break;\n default:\n assert(0);\n return;\n }\n break;\n case GL_TEXTURE_MAG_FILTER:\n switch (param) {\n case GL_NEAREST:\n tex.minFilter = GGLTexture::GGL_NEAREST;\n break;\n case GL_LINEAR:\n tex.minFilter = GGLTexture::GGL_LINEAR;\n break;\n default:\n assert(0);\n return;\n }\n break;\n default:\n assert(0);\n return;\n }\n \n if (tex.magFilter != tex.minFilter)\n tex.magFilter = tex.minFilter = GGLTexture::GGL_LINEAR;\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\nvoid API_ENTRY(glTexParameteriv)(GLenum target, GLenum pname, const GLint* params)\n{\n CALL_GL_API(glTexParameteriv, target, pname, params);\n}\nvoid glTexSubImage2D(GLenum target, GLint level, GLint xoffset, GLint yoffset, GLsizei width, GLsizei height, GLenum format, GLenum type, const GLvoid* pixels)\n{\n GLES2_GET_CONST_CONTEXT(ctx);\n\n assert(0 == level);\n assert(target == ctx->tex.tmus[ctx->tex.active]->type);\n switch (type) {\n case GL_UNSIGNED_BYTE:\n break;\n case GL_UNSIGNED_SHORT_5_6_5:\n format = GL_UNSIGNED_SHORT_5_6_5;\n assert(4 == ctx->tex.unpack);\n break;\n default:\n assert(0);\n }\n GGLTexture & tex = *ctx->tex.tmus[ctx->tex.active];\n GGLPixelFormat texFormat = GGL_PIXEL_FORMAT_UNKNOWN;\n unsigned bytesPerPixel = 0;\n GetFormatAndBytesPerPixel(format, &bytesPerPixel, &texFormat);\n assert(texFormat == tex.format);\n assert(GL_UNSIGNED_BYTE == type);\n switch (target) {\n case GL_TEXTURE_2D:\n CopyTexture((char *)tex.levels, (const char *)pixels, bytesPerPixel, 0, 0, width, xoffset,\n yoffset, tex.width, width, height);\n break;\n default:\n assert(0);\n }\n ctx->tex.UpdateSampler(ctx->iface, ctx->tex.active);\n}\n"},"middle":{"kind":"string","value":"static inline GGLTexture * AllocTexture()\n{\n GGLTexture * tex = (GGLTexture *)calloc(1, sizeof(GGLTexture));\n tex->minFilter = GGLTexture::GGL_LINEAR; \n tex->magFilter = GGLTexture::GGL_LINEAR;\n return tex;\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":470,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"activemq-cpp/src/test/activemq/core/ConnectionAuditTest.cpp"},"repo_name":{"kind":"string","value":"novomatic-tech/activemq-cpp"},"commit":{"kind":"string","value":"d6f76ede90d21b7ee2f0b5d4648e440e66d63003"},"file_code":{"kind":"string","value":"\n\n#include \"ConnectionAuditTest.h\"\n\n#include <activemq/core/ConnectionAudit.h>\n#include <activemq/core/Dispatcher.h>\n#include <activemq/core/ActiveMQMessageAudit.h>\n#include <activemq/util/IdGenerator.h>\n#include <activemq/commands/Message.h>\n#include <activemq/commands/ActiveMQDestination.h>\n#include <activemq/commands/ActiveMQQueue.h>\n\n#include <decaf/util/ArrayList.h>\n\nusing namespace std;\nusing namespace activemq;\nusing namespace activemq::core;\nusing namespace activemq::commands;\nusing namespace activemq::util;\nusing namespace decaf;\nusing namespace decaf::lang;\nusing namespace decaf::util;\n\nnamespace {\n\n class MyDispatcher : public Dispatcher {\n public:\n\n virtual ~MyDispatcher() {}\n\n virtual void dispatch(const Pointer<commands::MessageDispatch>& message) {\n\n }\n\n virtual int getHashCode() const {\n return 1;\n }\n\n };\n}\n\nConnectionAuditTest::ConnectionAuditTest() {\n}\n\nConnectionAuditTest::~ConnectionAuditTest() {\n}\n\nvoid ConnectionAuditTest::testConstructor1() {\n\n ConnectionAudit audit;\n CPPUNIT_ASSERT(audit.isCheckForDuplicates());\n CPPUNIT_ASSERT(audit.getAuditDepth() == ActiveMQMessageAudit::DEFAULT_WINDOW_SIZE);\n CPPUNIT_ASSERT(audit.getAuditMaximumProducerNumber() == ActiveMQMessageAudit::MAXIMUM_PRODUCER_COUNT);\n}\n\nvoid ConnectionAuditTest::testConstructor2() {\n\n ConnectionAudit audit(100, 200);\n CPPUNIT_ASSERT(audit.isCheckForDuplicates());\n CPPUNIT_ASSERT(audit.getAuditDepth() == 100);\n CPPUNIT_ASSERT(audit.getAuditMaximumProducerNumber() == 200);\n}\n\nvoid ConnectionAuditTest::testIsDuplicate() {\n\n int count = 10000;\n ConnectionAudit audit;\n ArrayList<Pointer<MessageId> > list;\n Pointer<MyDispatcher> dispatcher(new MyDispatcher);\n\n Pointer<ProducerId> pid(new ProducerId);\n pid->setConnectionId(\"test\");\n pid->setSessionId(0);\n pid->setValue(1);\n\n Pointer<Message> message(new Message());\n\n for (int i = 0; i < count; i++) {\n Pointer<ActiveMQDestination> destination(new ActiveMQQueue(\"TEST.QUEUE\"));\n message->setDestination(destination);\n\n Pointer<MessageId> id(new MessageId);\n id->setProducerId(pid);\n id->setProducerSequenceId(i);\n list.add(id);\n\n message->setMessageId(id);\n CPPUNIT_ASSERT(!audit.isDuplicate(dispatcher.get(), message));\n }\n\n int index = list.size() -1 -audit.getAuditDepth();\n for (; index < list.size(); index++) {\n Pointer<MessageId> id = list.get(index);\n message->setMessageId(id);\n CPPUNIT_ASSERT_MESSAGE(std::string() + \"duplicate msg:\" + id->toString(),\n audit.isDuplicate(dispatcher.get(), message));\n }\n}\n\nvoid ConnectionAuditTest::testRollbackDuplicate() {\n\n int count = 10000;\n ConnectionAudit audit;\n ArrayList<Pointer<MessageId> > list;\n Pointer<MyDispatcher> dispatcher(new MyDispatcher);\n\n Pointer<ProducerId> pid(new ProducerId);\n pid->setConnectionId(\"test\");\n pid->setSessionId(0);\n pid->setValue(1);\n\n Pointer<ActiveMQDestination> destination(new ActiveMQQueue(\"TEST.QUEUE\"));\n Pointer<Message> message(new Message());\n message->setDestination(destination);\n\n for (int i = 0; i < count; i++) {\n Pointer<MessageId> id(new MessageId);\n id->setProducerId(pid);\n id->setProducerSequenceId(i);\n list.add(id);\n\n message->setMessageId(id);\n CPPUNIT_ASSERT(!audit.isDuplicate(dispatcher.get(), message));\n }\n\n int index = list.size() -1 -audit.getAuditDepth();\n for (; index < list.size(); index++) {\n Pointer<MessageId> id = list.get(index);\n message->setMessageId(id);\n CPPUNIT_ASSERT_MESSAGE(std::string() + \"duplicate msg:\" + id->toString(),\n audit.isDuplicate(dispatcher.get(), message));\n audit.rollbackDuplicate(dispatcher.get(), message);\n CPPUNIT_ASSERT_MESSAGE(std::string() + \"duplicate msg:\" + id->toString(),\n !audit.isDuplicate(dispatcher.get(), message));\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"ConnectionAuditTest.h\"\n\n#include <activemq/core/ConnectionAudit.h>\n#include <activemq/core/Dispatcher.h>\n#include <activemq/core/ActiveMQMessageAudit.h>\n#include <activemq/util/IdGenerator.h>\n#include <activemq/commands/Message.h>\n#include <activemq/commands/ActiveMQDestination.h>\n#include <activemq/commands/ActiveMQQueue.h>\n\n#include <decaf/util/ArrayList.h>\n\nusing namespace std;\nusing namespace activemq;\nusing namespace activemq::core;\nusing namespace activemq::commands;\nusing namespace activemq::util;\nusing namespace decaf;\nusing namespace decaf::lang;\nusing namespace decaf::util;\n\nnamespace {\n\n class MyDispatcher : public Dispatcher {\n public:\n\n virtual ~MyDispatcher() {}\n\n virtual void dispatch(const Pointer<commands::MessageDispatch>& message) {\n\n }\n\n virtual int getHashCode() const {\n return 1;\n }\n\n };\n}\n\nConnectionAuditTest::ConnectionAuditTest() {\n}\n\nConnectionAuditTest::~ConnectionAuditTest() {\n}\n\nvoid ConnectionAuditTest::testConstructor1() {\n\n ConnectionAudit audit;\n CPPUNIT_ASSERT(audit.isCheckForDuplicates());\n CPPUNIT_ASSERT(audit.getAuditDepth() == ActiveMQMessageAudit::DEFAULT_WINDOW_SIZE);\n CPPUNIT_ASSERT(audit.getAuditMaximumProd"},"suffix":{"kind":"string","value":"eId> id(new MessageId);\n id->setProducerId(pid);\n id->setProducerSequenceId(i);\n list.add(id);\n\n message->setMessageId(id);\n CPPUNIT_ASSERT(!audit.isDuplicate(dispatcher.get(), message));\n }\n\n int index = list.size() -1 -audit.getAuditDepth();\n for (; index < list.size(); index++) {\n Pointer<MessageId> id = list.get(index);\n message->setMessageId(id);\n CPPUNIT_ASSERT_MESSAGE(std::string() + \"duplicate msg:\" + id->toString(),\n audit.isDuplicate(dispatcher.get(), message));\n }\n}\n\nvoid ConnectionAuditTest::testRollbackDuplicate() {\n\n int count = 10000;\n ConnectionAudit audit;\n ArrayList<Pointer<MessageId> > list;\n Pointer<MyDispatcher> dispatcher(new MyDispatcher);\n\n Pointer<ProducerId> pid(new ProducerId);\n pid->setConnectionId(\"test\");\n pid->setSessionId(0);\n pid->setValue(1);\n\n Pointer<ActiveMQDestination> destination(new ActiveMQQueue(\"TEST.QUEUE\"));\n Pointer<Message> message(new Message());\n message->setDestination(destination);\n\n for (int i = 0; i < count; i++) {\n Pointer<MessageId> id(new MessageId);\n id->setProducerId(pid);\n id->setProducerSequenceId(i);\n list.add(id);\n\n message->setMessageId(id);\n CPPUNIT_ASSERT(!audit.isDuplicate(dispatcher.get(), message));\n }\n\n int index = list.size() -1 -audit.getAuditDepth();\n for (; index < list.size(); index++) {\n Pointer<MessageId> id = list.get(index);\n message->setMessageId(id);\n CPPUNIT_ASSERT_MESSAGE(std::string() + \"duplicate msg:\" + id->toString(),\n audit.isDuplicate(dispatcher.get(), message));\n audit.rollbackDuplicate(dispatcher.get(), message);\n CPPUNIT_ASSERT_MESSAGE(std::string() + \"duplicate msg:\" + id->toString(),\n !audit.isDuplicate(dispatcher.get(), message));\n }\n}\n"},"middle":{"kind":"string","value":"ucerNumber() == ActiveMQMessageAudit::MAXIMUM_PRODUCER_COUNT);\n}\n\nvoid ConnectionAuditTest::testConstructor2() {\n\n ConnectionAudit audit(100, 200);\n CPPUNIT_ASSERT(audit.isCheckForDuplicates());\n CPPUNIT_ASSERT(audit.getAuditDepth() == 100);\n CPPUNIT_ASSERT(audit.getAuditMaximumProducerNumber() == 200);\n}\n\nvoid ConnectionAuditTest::testIsDuplicate() {\n\n int count = 10000;\n ConnectionAudit audit;\n ArrayList<Pointer<MessageId> > list;\n Pointer<MyDispatcher> dispatcher(new MyDispatcher);\n\n Pointer<ProducerId> pid(new ProducerId);\n pid->setConnectionId(\"test\");\n pid->setSessionId(0);\n pid->setValue(1);\n\n Pointer<Message> message(new Message());\n\n for (int i = 0; i < count; i++) {\n Pointer<ActiveMQDestination> destination(new ActiveMQQueue(\"TEST.QUEUE\"));\n message->setDestination(destination);\n\n Pointer<Messag"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":" class DECAF_API Reader: public virtual decaf::io::Closeable, public virtual decaf::lang::Readable {\n\n private:\n\n\n\n Reader(const Reader&);\n\n Reader& operator=(const Reader&);\n\n\n\n protected:\n\n\n\n Reader();\n\n\n\n public:\n\n\n\n virtual ~Reader();\n\n\n\n /**\n\n * Marks the present position in the stream. Subsequent calls to reset() will attempt\n\n * to reposition the stream to this point. Not all character-input streams support\n\n * the mark() operation.\n\n *\n\n * @param readAheadLimit\n","file_path":"activemq-cpp/src/main/decaf/io/Reader.h","rank":0,"score":401708.00318746694},{"content":" class AMQCPP_API MessageDispatchChannel: public decaf::util::concurrent::Synchronizable {\n\n public:\n\n\n\n virtual ~MessageDispatchChannel();\n\n\n\n /**\n\n * Add a Message to the Channel behind all pending message.\n\n *\n\n * @param message - The message to add to the Channel.\n\n */\n\n virtual void enqueue(const Pointer<MessageDispatch>& message) = 0;\n\n\n\n /**\n\n * Add a message to the front of the Channel.\n\n *\n\n * @param message - The Message to add to the front of the Channel.\n\n */\n\n virtual void enqueueFirst(const Pointer<MessageDispatch>& message) = 0;\n\n\n\n /**\n","file_path":"activemq-cpp/src/main/activemq/core/MessageDispatchChannel.h","rank":1,"score":386964.97447386186},{"content":" class Queue : public virtual decaf::util::Collection<E> {\n\n public:\n\n\n\n virtual ~Queue() {}\n\n\n\n /**\n\n * Inserts the specified element into the queue provided that the condition\n\n * allows such an operation. The method is generally preferable to the\n\n * collection.add(E), since the latter might throw an exception if the\n\n * operation fails.\n\n *\n\n * @param value\n\n * the specified element to insert into the queue.\n\n *\n\n * @return true if the operation succeeds and false if it fails.\n\n *\n\n * @throws NullPointerException if the Queue implementation does not allow Null values to\n\n * be inserted into the Queue.\n\n * @throws IllegalArgumentException if some property of the specified\n\n * element prevents it from being added to this queue\n","file_path":"activemq-cpp/src/main/decaf/util/Queue.h","rank":2,"score":367434.3860060965},{"content":" class Set : public virtual decaf::util::Collection<E> {\n\n public:\n\n\n\n virtual ~Set() {}\n\n\n\n };\n\n\n\n}}\n\n\n\n#endif /*_DECAF_UTIL_SET_H_*/\n","file_path":"activemq-cpp/src/main/decaf/util/Set.h","rank":3,"score":367434.3860060965},{"content":" class AbstractCollection : public virtual decaf::util::Collection<E> {\n\n protected:\n\n\n\n mutable util::concurrent::Mutex mutex;\n\n\n\n public:\n\n\n\n AbstractCollection() : Collection<E>(), mutex() {}\n\n\n\n /**\n\n * Copy Constructor, copy element from the source collection to this\n\n * collection after clearing any element stored in this collection.\n\n *\n\n * @param collection - the collection to copy\n\n */\n\n AbstractCollection(const AbstractCollection& other) : Collection<E>(), mutex() {\n\n if (other.isEmpty()) {\n\n return;\n\n }\n\n std::auto_ptr<Iterator<E> > iter(other.iterator());\n","file_path":"activemq-cpp/src/main/decaf/util/AbstractCollection.h","rank":4,"score":360459.1533890603},{"content":" class AbstractSet : public virtual decaf::util::Set<E>,\n\n public virtual decaf::util::AbstractCollection<E> {\n\n public:\n\n\n\n AbstractSet() : AbstractCollection<E>() {}\n\n\n\n virtual ~AbstractSet() {}\n\n\n\n /**\n\n * {@inheritDoc}\n\n *\n\n * This implementation determines which is the smaller of this set and the specified\n\n * collection, by invoking the size method on each. If this set has fewer elements,\n\n * then the implementation iterates over this set, checking each element returned by\n\n * the iterator in turn to see if it is contained in the specified collection. If it\n\n * is so contained, it is removed from this set with the iterator's remove method. If\n\n * the specified collection has fewer elements, then the implementation iterates over\n\n * the specified collection, removing from this set each element returned by the\n\n * iterator, using this set's remove method.\n\n *\n","file_path":"activemq-cpp/src/main/decaf/util/AbstractSet.h","rank":5,"score":360459.1533890603},{"content":" class DECAF_API List : public virtual decaf::util::Collection<E> {\n\n public:\n\n\n\n // Un-hide any methods from Collection that the declarations in this interface hid.\n\n using decaf::util::Collection<E>::add;\n\n using decaf::util::Collection<E>::addAll;\n\n using decaf::util::Collection<E>::remove;\n\n\n\n public:\n\n\n\n List() {}\n\n\n\n virtual ~List() {}\n\n\n\n /**\n\n * @return a list iterator over the elements in this list (in proper sequence).\n\n */\n\n virtual ListIterator<E>* listIterator() = 0;\n\n virtual ListIterator<E>* listIterator() const = 0;\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/List.h","rank":6,"score":360160.5376354226},{"content":" class DECAF_API IntArrayBuffer : public decaf::nio::IntBuffer {\n\n private:\n\n\n\n // The reference array object that backs this buffer.\n\n decaf::lang::Pointer<ByteArrayAdapter> _array;\n\n\n\n // Offset into the array that we are to start from\n\n int offset;\n\n\n\n // The length of the sub-array, or limit\n\n int length;\n\n\n\n // Read / Write flag\n\n bool readOnly;\n\n\n\n public:\n\n\n\n /**\n\n * Creates a IntArrayBuffer object that has its backing array allocated internally\n\n * and is then owned and deleted when this object is deleted. The array is\n","file_path":"activemq-cpp/src/main/decaf/internal/nio/IntArrayBuffer.h","rank":7,"score":351041.91839714267},{"content":" class DECAF_API Throwable : public std::exception {\n\n public:\n\n\n\n Throwable();\n\n\n\n virtual ~Throwable() throw();\n\n\n\n /**\n\n * Gets the cause of the error, if no message was provided to the instance\n\n * of this interface but a cause was then the value cause.getMessage is\n\n * then returned.\n\n * @return string errors message\n\n */\n\n virtual std::string getMessage() const = 0;\n\n\n\n /**\n\n * Gets the exception that caused this one to be thrown, this allows\n\n * for chaining of exceptions in the case of a method that throws only\n\n * a particular exception but wishes to allow for the real causal\n\n * exception to be passed only in case the caller knows about that\n","file_path":"activemq-cpp/src/main/decaf/lang/Throwable.h","rank":8,"score":350153.8989948907},{"content":" class MockComparatorStringByLength : public decaf::util::Comparator<std::string> {\n\n\n\n virtual bool operator() ( const std::string& left, const std::string& right ) const {\n\n return left.size() == right.size();\n\n }\n\n\n\n virtual int compare( const std::string& o1, const std::string& o2 ) const {\n\n return o1.size() < o2.size() ? -1 : o1.size() > o2.size() ? 1 : 0;\n\n }\n\n\n\n };\n\n\n\n}}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nvoid PriorityQueueTest::testConstructor_1() {\n\n\n\n PriorityQueue<int> pqueue;\n\n\n\n CPPUNIT_ASSERT( pqueue.isEmpty() );\n","file_path":"activemq-cpp/src/test/decaf/util/PriorityQueueTest.cpp","rank":9,"score":347711.3501310664},{"content":" class MessagingTask : public decaf::lang::Runnable {\n\n private:\n\n\n\n Receiver* receiver;\n\n std::string message;\n\n\n\n private:\n\n\n\n MessagingTask(const MessagingTask&);\n\n MessagingTask& operator= (const MessagingTask&);\n\n\n\n public:\n\n\n\n MessagingTask(Receiver* receiver, const std::string& message);\n\n\n\n virtual ~MessagingTask();\n\n\n\n virtual void run();\n\n\n\n };\n\n}\n\n\n\n#endif /** _CMSTEMPLATE_MESSAGINGTASK_H_ */\n","file_path":"activemq-cpp/src/examples/cmstemplate-stress/MessagingTask.h","rank":10,"score":346881.05999272387},{"content":" class CacheMap : public LinkedHashMap<int, int> {\n\n public:\n\n\n\n int removals;\n\n\n\n CacheMap() : LinkedHashMap<int, int>(), removals(0) {\n\n }\n\n\n\n virtual ~CacheMap() {}\n\n\n\n protected:\n\n\n\n virtual bool removeEldestEntry(const MapEntry<int, int>& eldest) {\n\n return size() > 5;\n\n }\n\n\n\n virtual void onEviction(const MapEntry<int, int>& eldest) {\n\n removals++;\n\n }\n\n\n","file_path":"activemq-cpp/src/test/decaf/util/LinkedHashMapTest.cpp","rank":11,"score":344854.4892614318},{"content":" class StringTask : public decaf::util::concurrent::Callable<std::string> {\n\n public:\n\n\n\n StringTask() : decaf::util::concurrent::Callable<std::string>() {\n\n }\n\n\n\n virtual ~StringTask() {}\n\n\n\n std::string call() {\n\n return TEST_STRING;\n\n }\n\n };\n\n\n\n };\n\n\n\n}}}\n\n\n\n#endif /* _DECAF_UTIL_CONCURRENT_EXECUTORSTESTSUPPORT_H_ */\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h","rank":12,"score":343705.2422850198},{"content":" class DECAF_API SHA1MessageDigestSpi : public decaf::security::MessageDigestSpi {\n\n private:\n\n\n\n SHA1MessageDigestSpi(const SHA1MessageDigestSpi&);\n\n SHA1MessageDigestSpi& operator= (const SHA1MessageDigestSpi&);\n\n\n\n SHA1MessageDigestSpiImpl* impl;\n\n\n\n public:\n\n\n\n SHA1MessageDigestSpi();\n\n\n\n virtual ~SHA1MessageDigestSpi();\n\n\n\n public:\n\n\n\n virtual bool isCloneable() const {\n\n return true;\n\n }\n\n\n","file_path":"activemq-cpp/src/main/decaf/internal/security/provider/crypto/SHA1MessageDigestSpi.h","rank":13,"score":337775.90640608995},{"content":" class DECAF_API MD5MessageDigestSpi : public decaf::security::MessageDigestSpi {\n\n private:\n\n\n\n MD5MessageDigestSpi(const MD5MessageDigestSpi&);\n\n MD5MessageDigestSpi& operator= (const MD5MessageDigestSpi&);\n\n\n\n MD5MessageDigestSpiImpl* impl;\n\n\n\n public:\n\n\n\n MD5MessageDigestSpi();\n\n\n\n virtual ~MD5MessageDigestSpi();\n\n\n\n public:\n\n\n\n virtual bool isCloneable() const {\n\n return true;\n\n }\n\n\n","file_path":"activemq-cpp/src/main/decaf/internal/security/provider/crypto/MD5MessageDigestSpi.h","rank":14,"score":337775.90640608995},{"content":" class DECAF_API MD4MessageDigestSpi : public decaf::security::MessageDigestSpi {\n\n private:\n\n\n\n MD4MessageDigestSpi(const MD4MessageDigestSpi&);\n\n MD4MessageDigestSpi& operator= (const MD4MessageDigestSpi&);\n\n\n\n MD4MessageDigestSpiImpl* impl;\n\n\n\n public:\n\n\n\n MD4MessageDigestSpi();\n\n\n\n virtual ~MD4MessageDigestSpi();\n\n\n\n public:\n\n\n\n virtual bool isCloneable() const {\n\n return true;\n\n }\n\n\n","file_path":"activemq-cpp/src/main/decaf/internal/security/provider/crypto/MD4MessageDigestSpi.h","rank":15,"score":337775.90640608995},{"content":" class AMQCPP_API MessageId : public BaseDataStructure, public decaf::lang::Comparable<MessageId> {\n\n protected:\n\n\n\n std::string textView;\n\n Pointer<ProducerId> producerId;\n\n long long producerSequenceId;\n\n long long brokerSequenceId;\n\n\n\n public:\n\n\n\n const static unsigned char ID_MESSAGEID = 110;\n\n\n\n typedef decaf::lang::PointerComparator<MessageId> COMPARATOR;\n\n\n\n private:\n\n\n\n mutable std::string key;\n\n\n\n public:\n\n\n","file_path":"activemq-cpp/src/main/activemq/commands/MessageId.h","rank":16,"score":337417.82874138793},{"content":" class DECAF_API InputStream: public Closeable, virtual public util::concurrent::Synchronizable {\n\n private:\n\n\n\n // Synchronization object.\n\n util::concurrent::Mutex mutex;\n\n\n\n private:\n\n\n\n InputStream(const InputStream&);\n\n InputStream& operator=(const InputStream&);\n\n\n\n public:\n\n\n\n InputStream();\n\n\n\n virtual ~InputStream();\n\n\n\n /**\n\n * Closes the InputStream freeing any resources that might have been acquired\n\n * during the lifetime of this stream.\n","file_path":"activemq-cpp/src/main/decaf/io/InputStream.h","rank":17,"score":336287.18010013824},{"content":" class BrokerMonitor: public decaf::lang::Runnable, activemq::cmsutil::MessageCreator {\n\n private:\n\n\n\n bool closing;\n\n bool brokerOk;\n\n std::string url;\n\n int interval;\n\n decaf::lang::Thread* brokerMonitorThread;\n\n decaf::util::concurrent::CountDownLatch* quit;\n\n\n\n private:\n\n\n\n activemq::cmsutil::CmsTemplate* createCmsTemplate(cms::ConnectionFactory* connectionFactory);\n\n\n\n public:\n\n\n\n BrokerMonitor(const std::string& url, int interval,\n\n decaf::util::concurrent::CountDownLatch* quit);\n\n\n\n virtual ~BrokerMonitor();\n","file_path":"activemq-cpp/src/examples/stress-test/BrokerMonitor.h","rank":18,"score":332922.4514917914},{"content":" class AMQCPP_API MessageDispatch : public BaseCommand {\n\n protected:\n\n\n\n Pointer<ConsumerId> consumerId;\n\n Pointer<ActiveMQDestination> destination;\n\n Pointer<Message> message;\n\n int redeliveryCounter;\n\n\n\n public:\n\n\n\n const static unsigned char ID_MESSAGEDISPATCH = 21;\n\n\n\n private:\n\n\n\n decaf::lang::Exception rollbackCause;\n\n\n\n private:\n\n\n\n MessageDispatch(const MessageDispatch&);\n\n MessageDispatch& operator= (const MessageDispatch&);\n","file_path":"activemq-cpp/src/main/activemq/commands/MessageDispatch.h","rank":19,"score":331405.99918630504},{"content":" class AMQCPP_API FifoMessageDispatchChannel : public MessageDispatchChannel {\n\n private:\n\n\n\n bool closed;\n\n bool running;\n\n\n\n mutable decaf::util::LinkedList< Pointer<MessageDispatch> > channel;\n\n\n\n private:\n\n\n\n FifoMessageDispatchChannel(const FifoMessageDispatchChannel&);\n\n FifoMessageDispatchChannel& operator=(const FifoMessageDispatchChannel&);\n\n\n\n public:\n\n\n\n FifoMessageDispatchChannel();\n\n\n\n virtual ~FifoMessageDispatchChannel();\n\n\n\n virtual void enqueue(const Pointer<MessageDispatch>& message);\n","file_path":"activemq-cpp/src/main/activemq/core/FifoMessageDispatchChannel.h","rank":20,"score":331332.36017740273},{"content":" class PublicFutureTask : public FutureTask<std::string> {\n\n public:\n\n\n\n PublicFutureTask(Callable<std::string>* r) : FutureTask<std::string>(r) {}\n\n\n\n virtual ~PublicFutureTask() {}\n\n\n\n virtual bool runAndReset() {\n\n return FutureTask<std::string>::runAndReset();\n\n }\n\n\n\n virtual void set(const std::string& x) {\n\n FutureTask<std::string>::set(x);\n\n }\n\n\n\n virtual void setException(const Exception& ex) {\n\n FutureTask<std::string>::setException(ex);\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/FutureTaskTest.cpp","rank":21,"score":331007.6304638015},{"content":" class Collection : public virtual lang::Iterable<E>,\n\n public virtual util::concurrent::Synchronizable {\n\n public:\n\n\n\n virtual ~Collection() {}\n\n\n\n /**\n\n * Renders this Collection as a Copy of the given Collection\n\n *\n\n * @param collection\n\n * The collection to mirror.\n\n *\n\n * @throws UnsupportedOperationExceptio if this is an unmodifiable collection.\n\n * @throws IllegalStateException if the elements cannot be added at this time due\n\n * to insertion restrictions.\n\n */\n\n virtual void copy(const Collection<E>& collection) = 0;\n\n\n\n /**\n\n * Returns true if this collection changed as a result of the call.\n","file_path":"activemq-cpp/src/main/decaf/util/Collection.h","rank":22,"score":329701.4392738956},{"content":" class DECAF_API DefaultMessageDigestProviderService : public decaf::security::ProviderService {\n\n private:\n\n\n\n DefaultMessageDigestProviderService(const DefaultMessageDigestProviderService&);\n\n DefaultMessageDigestProviderService& operator= (const DefaultMessageDigestProviderService&);\n\n\n\n public:\n\n\n\n DefaultMessageDigestProviderService(const decaf::security::Provider* provider,\n\n const std::string& algorithmName);\n\n\n\n virtual ~DefaultMessageDigestProviderService();\n\n\n\n virtual decaf::security::SecuritySpi* newInstance();\n\n\n\n };\n\n\n\n}}}}\n\n\n\n#endif /* _DECAF_INTERNAL_SECURITY_PROVIDER_DEFAULTMESSAGEDIGESTPROVIDERSERVICE_H_ */\n","file_path":"activemq-cpp/src/main/decaf/internal/security/provider/DefaultMessageDigestProviderService.h","rank":24,"score":329481.08025801694},{"content":" class DECAF_API IntBuffer : public Buffer,\n\n public lang::Comparable<IntBuffer> {\n\n protected:\n\n\n\n /**\n\n * Creates a IntBuffer object that has its backing array allocated internally\n\n * and is then owned and deleted when this object is deleted. The array is\n\n * initially created with all elements initialized to zero.\n\n *\n\n * @param capacity\n\n * The size and limit of the Buffer in integers.\n\n *\n\n * @throws IllegalArguementException if capacity is negative.\n\n */\n\n IntBuffer( int capacity );\n\n\n\n public:\n\n\n\n virtual ~IntBuffer() {}\n\n\n","file_path":"activemq-cpp/src/main/decaf/nio/IntBuffer.h","rank":25,"score":328541.99899933394},{"content":" class Consumer: public cms::MessageListener, public decaf::lang::Runnable {\n\n private:\n\n\n\n auto_ptr<CMSProvider> cmsProvider;\n\n long initialDelay;\n\n long waitMillis;\n\n int numReceived;\n\n\n\n public:\n\n\n\n Consumer(const std::string& brokerURL, const std::string& destination, long waitMillis) :\n\n Runnable(), cmsProvider(), initialDelay(0), waitMillis(waitMillis), numReceived(0) {\n\n\n\n this->cmsProvider.reset(new CMSProvider(brokerURL));\n\n this->cmsProvider->setTopic(false);\n\n this->cmsProvider->setDestinationName(destination);\n\n }\n\n\n\n virtual ~Consumer() {\n\n }\n","file_path":"activemq-cpp/src/test-integration/activemq/test/ExpirationTest.cpp","rank":26,"score":326876.109226265},{"content":" class ConstStlListIterator : public decaf::util::ListIterator<E> {\n\n private:\n\n\n\n typename std::list<E>::const_iterator current;\n\n typename std::list<E>::const_iterator prev;\n\n const typename std::list<E>* list;\n\n\n\n private:\n\n\n\n ConstStlListIterator(const ConstStlListIterator&);\n\n ConstStlListIterator operator= (const ConstStlListIterator&);\n\n\n\n public:\n\n\n\n ConstStlListIterator(const typename std::list<E>* list, int index) :\n\n ListIterator<E>(), current(list->begin()), prev(list->end()), list( list) {\n\n\n\n if (index < (int) list->size()) {\n\n std::advance(this->current, index);\n\n } else {\n","file_path":"activemq-cpp/src/main/decaf/util/StlList.h","rank":27,"score":326113.9140867044},{"content":" class AMQCPP_API SimplePriorityMessageDispatchChannel : public MessageDispatchChannel {\n\n private:\n\n\n\n static const int MAX_PRIORITIES;\n\n\n\n bool closed;\n\n bool running;\n\n\n\n mutable decaf::util::concurrent::Mutex mutex;\n\n\n\n mutable ArrayPointer< decaf::util::LinkedList< Pointer<MessageDispatch> > > channels;\n\n\n\n int enqueued;\n\n\n\n private:\n\n\n\n SimplePriorityMessageDispatchChannel(const SimplePriorityMessageDispatchChannel&);\n\n SimplePriorityMessageDispatchChannel& operator=(const SimplePriorityMessageDispatchChannel&);\n\n\n\n public:\n","file_path":"activemq-cpp/src/main/activemq/core/SimplePriorityMessageDispatchChannel.h","rank":28,"score":326027.9881067106},{"content":" class AMQCPP_API MessageDispatchNotification : public BaseCommand {\n\n protected:\n\n\n\n Pointer<ConsumerId> consumerId;\n\n Pointer<ActiveMQDestination> destination;\n\n long long deliverySequenceId;\n\n Pointer<MessageId> messageId;\n\n\n\n public:\n\n\n\n const static unsigned char ID_MESSAGEDISPATCHNOTIFICATION = 90;\n\n\n\n private:\n\n\n\n MessageDispatchNotification(const MessageDispatchNotification&);\n\n MessageDispatchNotification& operator= (const MessageDispatchNotification&);\n\n\n\n public:\n\n\n\n MessageDispatchNotification();\n","file_path":"activemq-cpp/src/main/activemq/commands/MessageDispatchNotification.h","rank":29,"score":324867.14274572884},{"content":" class testSubmitEECallable : public Callable<int> {\n\n public:\n\n\n\n virtual ~testSubmitEECallable() {}\n\n\n\n virtual int call() {\n\n throw NumberFormatException(__FILE__, __LINE__, \"Throwing a common exception\");\n\n return 1;\n\n }\n\n };\n\n}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nvoid AbstractExecutorServiceTest::testSubmitEE() {\n\n ThreadPoolExecutor p(1, 1, 60, TimeUnit::SECONDS, new LinkedBlockingQueue<Runnable*>(10));\n\n\n\n testSubmitEECallable c;\n\n\n\n try {\n\n\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/AbstractExecutorServiceTest.cpp","rank":30,"score":322666.52403640456},{"content":" class AMQCPP_API ActiveMQSessionKernel : public virtual cms::Session, public Dispatcher {\n\n private:\n\n\n\n friend class activemq::core::ActiveMQSessionExecutor;\n\n\n\n protected:\n\n\n\n SessionConfig* config;\n\n\n\n /**\n\n * SessionInfo for this Session\n\n */\n\n Pointer<commands::SessionInfo> sessionInfo;\n\n\n\n /**\n\n * Transaction Management object\n\n */\n\n Pointer<ActiveMQTransactionContext> transaction;\n\n\n\n /**\n","file_path":"activemq-cpp/src/main/activemq/core/kernels/ActiveMQSessionKernel.h","rank":31,"score":319834.52370512113},{"content":" class StringThreadLocal : public ThreadLocal<std::string> {\n\n public:\n\n\n\n StringThreadLocal() : ThreadLocal<std::string>() {}\n\n virtual ~StringThreadLocal() {}\n\n\n\n protected:\n\n\n\n virtual std::string initialValue() const {\n\n return \"initial\";\n\n }\n\n };\n\n\n\n}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nvoid ThreadLocalTest::testRemove() {\n\n\n\n StringThreadLocal tl;\n\n\n\n CPPUNIT_ASSERT_EQUAL(std::string(\"initial\"), tl.get());\n\n tl.set(\"fixture\");\n\n CPPUNIT_ASSERT_EQUAL(std::string(\"fixture\"), tl.get());\n\n tl.remove();\n\n CPPUNIT_ASSERT_EQUAL(std::string(\"initial\"), tl.get());\n\n}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nnamespace {\n\n\n","file_path":"activemq-cpp/src/test/decaf/lang/ThreadLocalTest.cpp","rank":32,"score":318409.8925882912},{"content":" class DECAF_API MessageDigestSpi : public SecuritySpi {\n\n public:\n\n\n\n MessageDigestSpi();\n\n\n\n virtual ~MessageDigestSpi();\n\n\n\n /**\n\n * Queries the SPI implementation and returns true if the SPI can be\n\n * cloned.\n\n *\n\n * @return true if the SPI is clonable.\n\n */\n\n virtual bool isCloneable() const;\n\n\n\n /**\n\n * Returns a clone if the implementation supports being cloned.\n\n *\n\n * @return a new pointer that is a copy of this object.\n\n *\n","file_path":"activemq-cpp/src/main/decaf/security/MessageDigestSpi.h","rank":33,"score":318132.9580087902},{"content":" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstKeyIterator(const ConstKeyIterator&);\n\n ConstKeyIterator& operator= (const ConstKeyIterator&);\n\n\n\n public:\n\n\n\n ConstKeyIterator(const HashMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstKeyIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual K next() {\n\n this->makeNext();\n\n return this->currentEntry->getKey();\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\");\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/HashMap.h","rank":34,"score":317752.2299740074},{"content":" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstKeyIterator(const ConstKeyIterator&);\n\n ConstKeyIterator& operator= (const ConstKeyIterator&);\n\n\n\n public:\n\n\n\n ConstKeyIterator(const StlMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstKeyIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual K next() {\n\n this->makeNext();\n\n return this->currentEntry->first;\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\" );\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/StlMap.h","rank":35,"score":317752.2299740074},{"content":" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstValueIterator(const ConstValueIterator&);\n\n ConstValueIterator& operator= (const ConstValueIterator&);\n\n\n\n public:\n\n\n\n ConstValueIterator(const StlMap* parent) : ConstAbstractMapIterator(parent) {}\n\n\n\n virtual ~ConstValueIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual V next() {\n\n this->makeNext();\n\n return this->currentEntry->second;\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\" );\n\n }\n\n };\n\n\n\n private:\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/StlMap.h","rank":36,"score":317752.22997400735},{"content":" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstValueIterator(const ConstValueIterator&);\n\n ConstValueIterator& operator= (const ConstValueIterator&);\n\n\n\n public:\n\n\n\n ConstValueIterator(const HashMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstValueIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual V next() {\n\n this->makeNext();\n\n return this->currentEntry->getValue();\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\");\n\n }\n\n };\n\n\n\n protected:\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/HashMap.h","rank":37,"score":317752.2299740074},{"content":" class MessagingTask:public decaf::lang::Runnable {\n\n private:\n\n\n\n Receiver* receiver;\n\n std::string message;\n\n\n\n static decaf::util::concurrent::ThreadPoolExecutor* threadPoolExecutor;\n\n\n\n public:\n\n\n\n MessagingTask(Receiver* receiver, const std::string& message);\n\n\n\n virtual ~MessagingTask();\n\n\n\n virtual void run();\n\n\n\n static void initializeThreads(int min, int max);\n\n static void terminateThreads();\n\n\n\n virtual void queue();\n\n\n\n };\n\n\n\n}}\n\n\n\n#endif /** _CMS_STRESS_MESSAGINGTASK_H_ */\n","file_path":"activemq-cpp/src/examples/stress-test/MessagingTask.h","rank":38,"score":316052.0157265151},{"content":" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstKeyIterator(const ConstKeyIterator&);\n\n ConstKeyIterator& operator= (const ConstKeyIterator&);\n\n\n\n public:\n\n\n\n ConstKeyIterator(const LinkedHashMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstKeyIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual K next() {\n\n this->makeNext();\n\n return this->currentEntry->getKey();\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\" );\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/LinkedHashMap.h","rank":39,"score":314821.45311548834},{"content":" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstValueIterator(const ConstValueIterator&);\n\n ConstValueIterator& operator= (const ConstValueIterator&);\n\n\n\n public:\n\n\n\n ConstValueIterator(const LinkedHashMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstValueIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual V next() {\n\n this->makeNext();\n\n return this->currentEntry->getValue();\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\" );\n\n }\n\n };\n\n\n\n private:\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/LinkedHashMap.h","rank":40,"score":314821.45311548834},{"content":" class AMQCPP_API PrimitiveMap : public decaf::util::StlMap<std::string, PrimitiveValueNode> {\n\n private:\n\n\n\n PrimitiveValueConverter converter;\n\n\n\n public:\n\n\n\n /**\n\n * Default Constructor, creates an empty map.\n\n */\n\n PrimitiveMap();\n\n\n\n virtual ~PrimitiveMap();\n\n\n\n /**\n\n * Copy Constructor\n\n *\n\n * @param source\n\n * The Decaf Library Map instance whose elements will be copied into this Map.\n\n */\n","file_path":"activemq-cpp/src/main/activemq/util/PrimitiveMap.h","rank":41,"score":314677.2490113568},{"content":" class ActiveMQMessageAuditTest : public CppUnit::TestFixture {\n\n\n\n CPPUNIT_TEST_SUITE( ActiveMQMessageAuditTest );\n\n CPPUNIT_TEST( testIsDuplicateString );\n\n CPPUNIT_TEST( testIsDuplicateMessageId );\n\n CPPUNIT_TEST( testIsInOrderString );\n\n CPPUNIT_TEST( testIsInOrderMessageId );\n\n CPPUNIT_TEST( testRollbackString );\n\n CPPUNIT_TEST( testRollbackMessageId );\n\n CPPUNIT_TEST( testGetLastSeqId );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n public:\n\n\n\n ActiveMQMessageAuditTest();\n\n virtual ~ActiveMQMessageAuditTest();\n\n\n\n void testIsDuplicateString();\n\n void testIsDuplicateMessageId();\n\n void testIsInOrderString();\n","file_path":"activemq-cpp/src/test/activemq/core/ActiveMQMessageAuditTest.h","rank":42,"score":312825.98034826474},{"content":" class AMQCPP_API MessageDispatchMarshaller : public BaseCommandMarshaller {\n\n public:\n\n\n\n MessageDispatchMarshaller() {}\n\n virtual ~MessageDispatchMarshaller() {}\n\n\n\n virtual commands::DataStructure* createObject() const;\n\n\n\n virtual unsigned char getDataStructureType() const;\n\n\n\n virtual void tightUnmarshal(OpenWireFormat* wireFormat,\n\n commands::DataStructure* dataStructure,\n\n decaf::io::DataInputStream* dataIn,\n\n utils::BooleanStream* bs);\n\n\n\n virtual int tightMarshal1(OpenWireFormat* wireFormat,\n\n commands::DataStructure* dataStructure,\n\n utils::BooleanStream* bs);\n\n\n\n virtual void tightMarshal2(OpenWireFormat* wireFormat,\n","file_path":"activemq-cpp/src/main/activemq/wireformat/openwire/marshal/generated/MessageDispatchMarshaller.h","rank":43,"score":312783.1097120461},{"content":" class FifoMessageDispatchChannelTest : public CppUnit::TestFixture {\n\n\n\n CPPUNIT_TEST_SUITE( FifoMessageDispatchChannelTest );\n\n CPPUNIT_TEST( testCtor );\n\n CPPUNIT_TEST( testStart );\n\n CPPUNIT_TEST( testStop );\n\n CPPUNIT_TEST( testClose );\n\n CPPUNIT_TEST( testEnqueue );\n\n CPPUNIT_TEST( testEnqueueFront );\n\n CPPUNIT_TEST( testPeek );\n\n CPPUNIT_TEST( testDequeueNoWait );\n\n CPPUNIT_TEST( testDequeue );\n\n CPPUNIT_TEST( testRemoveAll );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n public:\n\n\n\n FifoMessageDispatchChannelTest() {}\n\n virtual ~FifoMessageDispatchChannelTest() {}\n\n\n","file_path":"activemq-cpp/src/test/activemq/core/FifoMessageDispatchChannelTest.h","rank":44,"score":312783.1097120461},{"content":" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstValueIterator(const ConstValueIterator&);\n\n ConstValueIterator& operator= (const ConstValueIterator&);\n\n\n\n public:\n\n\n\n ConstValueIterator(const ConcurrentStlMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstValueIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual V next() {\n\n synchronized(&this->associatedMap->mutex) {\n\n this->makeNext();\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/ConcurrentStlMap.h","rank":45,"score":311964.85043618234},{"content":" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstKeyIterator(const ConstKeyIterator&);\n\n ConstKeyIterator& operator= (const ConstKeyIterator&);\n\n\n\n public:\n\n\n\n ConstKeyIterator(const ConcurrentStlMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstKeyIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual K next() {\n\n synchronized(&this->associatedMap->mutex) {\n\n this->makeNext();\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/ConcurrentStlMap.h","rank":46,"score":311964.85043618234},{"content":" class DECAF_API Writer: public decaf::io::Closeable, public decaf::io::Flushable, public decaf::lang::Appendable {\n\n private:\n\n\n\n Writer(const Writer&);\n\n Writer& operator=(const Writer&);\n\n\n\n public:\n\n\n\n Writer();\n\n\n\n virtual ~Writer();\n\n\n\n /**\n\n * Writes an single byte char value.\n\n *\n\n * @param v\n\n * The value to be written.\n\n *\n\n * @throws IOException thrown if an error occurs.\n\n */\n","file_path":"activemq-cpp/src/main/decaf/io/Writer.h","rank":47,"score":311087.47385014803},{"content":" class MessageDispatchMarshallerTest : public CppUnit::TestFixture {\n\n\n\n CPPUNIT_TEST_SUITE( MessageDispatchMarshallerTest );\n\n CPPUNIT_TEST( test );\n\n CPPUNIT_TEST( testLooseMarshal );\n\n CPPUNIT_TEST( testTightMarshal );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n public:\n\n\n\n MessageDispatchMarshallerTest() {}\n\n virtual ~MessageDispatchMarshallerTest() {}\n\n\n\n /**\n\n * Test the marshaller and its marshalled type.\n\n */\n\n virtual void test();\n\n virtual void testLooseMarshal();\n\n virtual void testTightMarshal();\n\n\n\n };\n\n\n\n}}}}}\n\n\n\n#endif /*_ACTIVEMQ_WIREFORMAT_OPENWIRE_MARSAHAL_GENERATED_MESSAGEDISPATCHMARSHALLERTEST_H_*/\n","file_path":"activemq-cpp/src/test/activemq/wireformat/openwire/marshal/generated/MessageDispatchMarshallerTest.h","rank":48,"score":309950.28183336294},{"content":" class AMQCPP_API MessageDispatchNotificationMarshaller : public BaseCommandMarshaller {\n\n public:\n\n\n\n MessageDispatchNotificationMarshaller() {}\n\n virtual ~MessageDispatchNotificationMarshaller() {}\n\n\n\n virtual commands::DataStructure* createObject() const;\n\n\n\n virtual unsigned char getDataStructureType() const;\n\n\n\n virtual void tightUnmarshal(OpenWireFormat* wireFormat,\n\n commands::DataStructure* dataStructure,\n\n decaf::io::DataInputStream* dataIn,\n\n utils::BooleanStream* bs);\n\n\n\n virtual int tightMarshal1(OpenWireFormat* wireFormat,\n\n commands::DataStructure* dataStructure,\n\n utils::BooleanStream* bs);\n\n\n\n virtual void tightMarshal2(OpenWireFormat* wireFormat,\n","file_path":"activemq-cpp/src/main/activemq/wireformat/openwire/marshal/generated/MessageDispatchNotificationMarshaller.h","rank":49,"score":307186.95284556714},{"content":" class SimplePriorityMessageDispatchChannelTest : public CppUnit::TestFixture {\n\n\n\n CPPUNIT_TEST_SUITE( SimplePriorityMessageDispatchChannelTest );\n\n CPPUNIT_TEST( testCtor );\n\n CPPUNIT_TEST( testStart );\n\n CPPUNIT_TEST( testStop );\n\n CPPUNIT_TEST( testClose );\n\n CPPUNIT_TEST( testEnqueue );\n\n CPPUNIT_TEST( testEnqueueFront );\n\n CPPUNIT_TEST( testPeek );\n\n CPPUNIT_TEST( testDequeueNoWait );\n\n CPPUNIT_TEST( testDequeue );\n\n CPPUNIT_TEST( testRemoveAll );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n public:\n\n\n\n SimplePriorityMessageDispatchChannelTest() {}\n\n virtual ~SimplePriorityMessageDispatchChannelTest() {}\n\n\n","file_path":"activemq-cpp/src/test/activemq/core/SimplePriorityMessageDispatchChannelTest.h","rank":50,"score":307186.95284556714},{"content":" class MessageDispatchNotificationMarshallerTest : public CppUnit::TestFixture {\n\n\n\n CPPUNIT_TEST_SUITE( MessageDispatchNotificationMarshallerTest );\n\n CPPUNIT_TEST( test );\n\n CPPUNIT_TEST( testLooseMarshal );\n\n CPPUNIT_TEST( testTightMarshal );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n public:\n\n\n\n MessageDispatchNotificationMarshallerTest() {}\n\n virtual ~MessageDispatchNotificationMarshallerTest() {}\n\n\n\n /**\n\n * Test the marshaller and its marshalled type.\n\n */\n\n virtual void test();\n\n virtual void testLooseMarshal();\n\n virtual void testTightMarshal();\n\n\n\n };\n\n\n\n}}}}}\n\n\n\n#endif /*_ACTIVEMQ_WIREFORMAT_OPENWIRE_MARSAHAL_GENERATED_MESSAGEDISPATCHNOTIFICATIONMARSHALLERTEST_H_*/\n","file_path":"activemq-cpp/src/test/activemq/wireformat/openwire/marshal/generated/MessageDispatchNotificationMarshallerTest.h","rank":51,"score":304490.4995546286},{"content":" class MessageDigestTest : public CppUnit::TestFixture {\n\n\n\n CPPUNIT_TEST_SUITE( MessageDigestTest );\n\n CPPUNIT_TEST( testGetInstance1 );\n\n CPPUNIT_TEST( testGetInstance2 );\n\n CPPUNIT_TEST( testGetInstance3 );\n\n CPPUNIT_TEST( testGetInstance4 );\n\n CPPUNIT_TEST( testResults1 );\n\n CPPUNIT_TEST( testResults2 );\n\n CPPUNIT_TEST( testResults3 );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\n public:\n\n\n\n MessageDigestTest();\n\n virtual ~MessageDigestTest();\n\n\n\n void testGetInstance1();\n\n void testGetInstance2();\n\n void testGetInstance3();\n","file_path":"activemq-cpp/src/test/decaf/security/MessageDigestTest.h","rank":52,"score":303709.3233578373},{"content":" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstEntryIterator(const ConstEntryIterator&);\n\n ConstEntryIterator& operator= (const ConstEntryIterator&);\n\n\n\n public:\n\n\n\n ConstEntryIterator(const StlMap* parent) : ConstAbstractMapIterator(parent) {}\n\n\n\n virtual ~ConstEntryIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual MapEntry<K, V> next() {\n\n this->makeNext();\n\n return MapEntry<K, V>(this->currentEntry->first, this->currentEntry->second);\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\" );\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/StlMap.h","rank":53,"score":301982.9478697166},{"content":" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstEntryIterator(const ConstEntryIterator&);\n\n ConstEntryIterator& operator= (const ConstEntryIterator&);\n\n\n\n public:\n\n\n\n ConstEntryIterator(const HashMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstEntryIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual MapEntry<K, V> next() {\n\n this->makeNext();\n\n return *(this->currentEntry);\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\");\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/HashMap.h","rank":54,"score":301982.9478697166},{"content":" class MessagePullCache : public LinkedHashMap<std::string, Pointer<Command> > {\n\n protected:\n\n\n\n ConnectionStateTracker* parent;\n\n\n\n public:\n\n\n\n MessagePullCache(ConnectionStateTracker* parent) :\n\n LinkedHashMap<std::string, Pointer<Command> >(), parent(parent) {\n\n }\n\n\n\n virtual ~MessagePullCache() {}\n\n\n\n virtual bool removeEldestEntry(const MapEntry<std::string, Pointer<Command> >& eldest AMQCPP_UNUSED) {\n\n return size() > parent->getMaxMessagePullCacheSize();\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/main/activemq/state/ConnectionStateTracker.cpp","rank":55,"score":301246.5132193222},{"content":" class ConstReverseIterator : public Iterator<E> {\n\n private:\n\n\n\n const LinkedList<E>* list;\n\n const ListNode<E>* current;\n\n\n\n private:\n\n\n\n ConstReverseIterator(const ConstReverseIterator&);\n\n ConstReverseIterator operator=(const ConstReverseIterator&);\n\n\n\n public:\n\n\n\n ConstReverseIterator(const LinkedList<E>* list) : Iterator<E>(), list(list), current(NULL) {\n\n\n\n if (list == NULL) {\n\n throw decaf::lang::exceptions::NullPointerException(\n\n __FILE__, __LINE__, \"Parent LinkedList pointer was Null.\" );\n\n }\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/LinkedList.h","rank":56,"score":299381.5881249159},{"content":" class ConstSetIterator : public Iterator<E> {\n\n private:\n\n\n\n typename std::set<E>::const_iterator current;\n\n typename std::set<E>::const_iterator previous;\n\n const typename std::set<E>* set;\n\n\n\n private:\n\n\n\n ConstSetIterator(const ConstSetIterator&);\n\n ConstSetIterator operator=(const ConstSetIterator&);\n\n\n\n public:\n\n\n\n ConstSetIterator(const typename std::set<E>* set) :\n\n Iterator<E>(), current(set->begin()), previous(set->begin()), set(set) {\n\n }\n\n\n\n virtual ~ConstSetIterator() {}\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/StlSet.h","rank":57,"score":299381.5881249159},{"content":" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstEntryIterator(const ConstEntryIterator&);\n\n ConstEntryIterator& operator= (const ConstEntryIterator&);\n\n\n\n public:\n\n\n\n ConstEntryIterator(const LinkedHashMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstEntryIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual MapEntry<K, V> next() {\n\n this->makeNext();\n\n return *(this->currentEntry);\n\n }\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__, \"Cannot write to a const Iterator.\" );\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/LinkedHashMap.h","rank":58,"score":299266.175104431},{"content":" class TimerImpl: public decaf::lang::Thread, public SynchronizableImpl {\n\n public:\n\n\n\n TimerTaskHeap heap;\n\n bool cancelled;\n\n\n\n public:\n\n\n\n TimerImpl() : Thread(), heap(), cancelled(false) {}\n\n\n\n TimerImpl(const std::string& name) : Thread(name), heap(), cancelled(false) {}\n\n\n\n virtual ~TimerImpl() {\n\n try {\n\n this->cancel();\n\n this->join();\n\n }\n\n DECAF_CATCHALL_NOTHROW()\n\n }\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/Timer.cpp","rank":59,"score":298461.86373176664},{"content":" class ConstPriorityQueueIterator : public PriorityQueueIterator {\n\n private:\n\n\n\n ConstPriorityQueueIterator( const ConstPriorityQueueIterator& );\n\n ConstPriorityQueueIterator& operator= ( const ConstPriorityQueueIterator& );\n\n\n\n public:\n\n\n\n ConstPriorityQueueIterator(const PriorityQueue* queue) :\n\n PriorityQueueIterator(const_cast<PriorityQueue*>(queue)) {}\n\n\n\n virtual void remove() {\n\n throw lang::exceptions::UnsupportedOperationException(\n\n __FILE__, __LINE__,\n\n \"PriorityQueue::Iterator::remove - Not Valid on a Const Iterator\");\n\n }\n\n };\n\n\n\n friend class PriorityQueueIterator;\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/PriorityQueue.h","rank":60,"score":297740.91988958255},{"content":"////////////////////////////////////////////////////////////////////////////////\n\nclass MyIntRunnable: public Runnable {\n\nprivate:\n\n\n\n AtomicInteger* aip;\n\n\n\nprivate:\n\n\n\n MyIntRunnable(const MyIntRunnable&);\n\n MyIntRunnable operator= (const MyIntRunnable&);\n\n\n\npublic:\n\n\n\n MyIntRunnable( AtomicInteger* ai ) :\n\n aip( ai ) {\n\n }\n\n\n\n virtual void run() {\n\n while( !aip->compareAndSet( 2, 3 ) ) {\n\n Thread::yield();\n\n }\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/atomic/AtomicIntegerTest.cpp","rank":61,"score":297713.5014424042},{"content":" class AMQCPP_API Transport : public activemq::util::Service, public decaf::io::Closeable {\n\n public:\n\n\n\n virtual ~Transport();\n\n\n\n /**\n\n * Starts the Transport, the send methods of a Transport will throw an exception\n\n * if used before the Transport is started.\n\n *\n\n * @throw IOException if and error occurs while starting the Transport.\n\n */\n\n virtual void start() = 0;\n\n\n\n /**\n\n * Stops the Transport.\n\n *\n\n * @throw IOException if an error occurs while stopping the transport.\n\n */\n\n virtual void stop() = 0;\n\n\n","file_path":"activemq-cpp/src/main/activemq/transport/Transport.h","rank":62,"score":297645.46304079914},{"content":" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\n\n private:\n\n\n\n ConstEntryIterator(const ConstEntryIterator&);\n\n ConstEntryIterator& operator= (const ConstEntryIterator&);\n\n\n\n public:\n\n\n\n ConstEntryIterator(const ConcurrentStlMap* parent) : ConstAbstractMapIterator(parent) {\n\n }\n\n\n\n virtual ~ConstEntryIterator() {}\n\n\n\n virtual bool hasNext() const {\n\n return this->checkHasNext();\n\n }\n\n\n\n virtual MapEntry<K, V> next() {\n\n synchronized(&this->associatedMap->mutex) {\n\n this->makeNext();\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/ConcurrentStlMap.h","rank":63,"score":296615.3541715774},{"content":" class CmsMessageCreator : public activemq::cmsutil::MessageCreator {\n\n private:\n\n\n\n std::string text;\n\n\n\n public:\n\n\n\n CmsMessageCreator(const std::string& text);\n\n\n\n virtual ~CmsMessageCreator();\n\n virtual cms::Message* createMessage(cms::Session* session);\n\n\n\n };\n\n}\n\n\n\n#endif /** _CMSTEMPLATE_CMSMESSAGECREATOR_H_ */\n","file_path":"activemq-cpp/src/examples/cmstemplate-stress/CmsMessageCreator.h","rank":64,"score":295978.92297144467},{"content":" class CmsMessageCreator: public activemq::cmsutil::MessageCreator {\n\n private:\n\n\n\n std::string text;\n\n std::string headerName;\n\n std::string headerValue;\n\n\n\n public:\n\n\n\n CmsMessageCreator(const std::string& txt,\n\n const std::string& name = \"\",\n\n const std::string& value = \"\");\n\n\n\n virtual ~CmsMessageCreator();\n\n\n\n virtual cms::Message* createMessage(cms::Session* session);\n\n };\n\n\n\n}}\n\n\n\n#endif /** _CMS_STRESS_CMSMESSAGECREATOR_H_ */\n","file_path":"activemq-cpp/src/examples/stress-test/CmsMessageCreator.h","rank":65,"score":295978.92297144467},{"content":" class IntArrayBufferTest : public CppUnit::TestFixture {\n\n\n\n CPPUNIT_TEST_SUITE( IntArrayBufferTest );\n\n CPPUNIT_TEST( test );\n\n CPPUNIT_TEST( testArray );\n\n CPPUNIT_TEST( testArrayOffset );\n\n CPPUNIT_TEST( testReadOnlyArray );\n\n CPPUNIT_TEST( testAsReadOnlyBuffer );\n\n CPPUNIT_TEST( testCompact );\n\n CPPUNIT_TEST( testCompareTo );\n\n CPPUNIT_TEST( testDuplicate );\n\n CPPUNIT_TEST( testEquals );\n\n CPPUNIT_TEST( testHasArray );\n\n CPPUNIT_TEST( testGet );\n\n CPPUNIT_TEST( testGet2 );\n\n CPPUNIT_TEST( testGetIntArray );\n\n CPPUNIT_TEST( testGetIntArray2 );\n\n CPPUNIT_TEST( testGetWithIndex );\n\n CPPUNIT_TEST( testPutInt );\n\n CPPUNIT_TEST( testPutIntArray );\n","file_path":"activemq-cpp/src/test/decaf/internal/nio/IntArrayBufferTest.h","rank":66,"score":294903.19044752506},{"content":" class ConstLinkedIterator : public Iterator<E> {\n\n private:\n\n\n\n Pointer< QueueNode<E> > current;\n\n Pointer< QueueNode<E> > last;\n\n E currentElement;\n\n const LinkedBlockingQueue<E>* parent;\n\n\n\n private:\n\n\n\n ConstLinkedIterator(const ConstLinkedIterator&);\n\n ConstLinkedIterator& operator= (const ConstLinkedIterator&);\n\n\n\n public:\n\n\n\n ConstLinkedIterator(const LinkedBlockingQueue<E>* parent) : current(), last(),\n\n currentElement(),\n\n parent(parent) {\n\n TotalLock lock(parent);\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/LinkedBlockingQueue.h","rank":67,"score":292095.3373270766},{"content":" class ConstSimpleListIterator : public ListIterator<E> {\n\n protected:\n\n\n\n const AbstractList<E>* parent;\n\n int numLeft;\n\n int expectedModCount;\n\n int lastPosition;\n\n\n\n private:\n\n\n\n ConstSimpleListIterator(const ConstSimpleListIterator&);\n\n ConstSimpleListIterator operator=(const ConstSimpleListIterator&);\n\n\n\n public:\n\n\n\n ConstSimpleListIterator(const AbstractList<E>* parent, int start) :\n\n ListIterator<E>(), parent(parent), numLeft(0), expectedModCount(0), lastPosition(-1) {\n\n\n\n if (parent == NULL) {\n\n throw decaf::lang::exceptions::NullPointerException(\n","file_path":"activemq-cpp/src/main/decaf/util/AbstractList.h","rank":68,"score":292095.3373270766},{"content":" class ConstLinkedListIterator : public ListIterator<E> {\n\n private:\n\n\n\n const LinkedList<E>* list;\n\n const ListNode<E>* current;\n\n const ListNode<E>* lastReturned;\n\n int index;\n\n\n\n private:\n\n\n\n ConstLinkedListIterator(const ConstLinkedListIterator&);\n\n ConstLinkedListIterator operator=(const ConstLinkedListIterator&);\n\n\n\n public:\n\n\n\n ConstLinkedListIterator(const LinkedList<E>* list, int index) :\n\n ListIterator<E>(), list(list), current(NULL), lastReturned(NULL), index(-1) {\n\n\n\n if (list == NULL) {\n\n throw decaf::lang::exceptions::NullPointerException(\n","file_path":"activemq-cpp/src/main/decaf/util/LinkedList.h","rank":69,"score":292095.3373270766},{"content":" class DECAF_API DecafRuntime: public decaf::lang::Runtime {\n\n private:\n\n\n\n DecafRuntime(const DecafRuntime&);\n\n DecafRuntime& operator=(const DecafRuntime&);\n\n\n\n public:\n\n\n\n /**\n\n * Initializes the APR Runtime for a library.\n\n */\n\n DecafRuntime();\n\n\n\n /**\n\n * Terminates the APR Runtime for a library.\n\n */\n\n virtual ~DecafRuntime();\n\n\n\n /**\n\n * Grants access to the Global APR Pool instance that should be\n","file_path":"activemq-cpp/src/main/decaf/internal/DecafRuntime.h","rank":70,"score":291302.08694993856},{"content":" class AMQCPP_API ActiveMQConsumerKernel : public cms::MessageConsumer, public Dispatcher {\n\n private:\n\n\n\n /**\n\n * Internal Class that holds Members of this class, allows for changes without API breakage.\n\n */\n\n ActiveMQConsumerKernelConfig* internal;\n\n\n\n /**\n\n * The ActiveMQSession that owns this class instance.\n\n */\n\n ActiveMQSessionKernel* session;\n\n\n\n /**\n\n * The ConsumerInfo object for this class instance.\n\n */\n\n Pointer<commands::ConsumerInfo> consumerInfo;\n\n\n\n private:\n\n\n","file_path":"activemq-cpp/src/main/activemq/core/kernels/ActiveMQConsumerKernel.h","rank":71,"score":291013.71159581514},{"content":" class RunnableFuture : public Future<T>, public decaf::lang::Runnable {\n\n public:\n\n\n\n virtual ~RunnableFuture() {}\n\n\n\n };\n\n\n\n}}}\n\n\n\n#endif /* _DECAF_UTIL_CONCURRENT_RUNNABLEFUTURE_H_ */\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/RunnableFuture.h","rank":72,"score":290958.5628967306},{"content":" class DECAF_API Socket : public decaf::io::Closeable {\n\n protected:\n\n\n\n // The actual Socket that this Socket represents.\n\n mutable SocketImpl* impl;\n\n\n\n private:\n\n\n\n // Factory for creating sockets, if not set a Plan TCP Socket is created\n\n static SocketImplFactory* factory;\n\n\n\n mutable volatile bool created;\n\n\n\n bool connected;\n\n bool closed;\n\n bool bound;\n\n bool inputShutdown;\n\n bool outputShutdown;\n\n\n\n friend class ServerSocket;\n","file_path":"activemq-cpp/src/main/decaf/net/Socket.h","rank":73,"score":289658.59809460206},{"content":" class ConstStlMapValueCollection : public AbstractCollection<V> {\n\n private:\n\n\n\n const StlMap* associatedMap;\n\n\n\n private:\n\n\n\n ConstStlMapValueCollection(const ConstStlMapValueCollection&);\n\n ConstStlMapValueCollection& operator= (const ConstStlMapValueCollection&);\n\n\n\n public:\n\n\n\n ConstStlMapValueCollection(const StlMap* parent) : AbstractCollection<V>(), associatedMap(parent) {}\n\n\n\n virtual ~ConstStlMapValueCollection() {}\n\n\n\n virtual bool contains(const V& value) const {\n\n return this->associatedMap->containsValue(value);\n\n }\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/StlMap.h","rank":74,"score":288626.8894152502},{"content":" class ConstHashMapKeySet : public AbstractSet<K> {\n\n private:\n\n\n\n const HashMap* associatedMap;\n\n\n\n private:\n\n\n\n ConstHashMapKeySet(const ConstHashMapKeySet&);\n\n ConstHashMapKeySet& operator= (const ConstHashMapKeySet&);\n\n\n\n public:\n\n\n\n ConstHashMapKeySet(const HashMap* parent) : AbstractSet<K>(), associatedMap(parent) {\n\n }\n\n\n\n virtual ~ConstHashMapKeySet() {}\n\n\n\n virtual bool contains(const K& key) const {\n\n return this->associatedMap->containsKey(key);\n\n }\n","file_path":"activemq-cpp/src/main/decaf/util/HashMap.h","rank":75,"score":288626.8894152502},{"content":" class ConstHashMapValueCollection : public AbstractCollection<V> {\n\n private:\n\n\n\n const HashMap* associatedMap;\n\n\n\n private:\n\n\n\n ConstHashMapValueCollection(const ConstHashMapValueCollection&);\n\n ConstHashMapValueCollection& operator= (const ConstHashMapValueCollection&);\n\n\n\n public:\n\n\n\n ConstHashMapValueCollection(const HashMap* parent) : AbstractCollection<V>(), associatedMap(parent) {\n\n }\n\n\n\n virtual ~ConstHashMapValueCollection() {}\n\n\n\n virtual bool contains(const V& value) const {\n\n return this->associatedMap->containsValue(value);\n\n }\n","file_path":"activemq-cpp/src/main/decaf/util/HashMap.h","rank":76,"score":288626.8894152502},{"content":" class ConstStlMapKeySet : public AbstractSet<K> {\n\n private:\n\n\n\n const StlMap* associatedMap;\n\n\n\n private:\n\n\n\n ConstStlMapKeySet(const ConstStlMapKeySet&);\n\n ConstStlMapKeySet& operator= (const ConstStlMapKeySet&);\n\n\n\n public:\n\n\n\n ConstStlMapKeySet(const StlMap* parent) : AbstractSet<K>(), associatedMap(parent) {}\n\n\n\n virtual ~ConstStlMapKeySet() {}\n\n\n\n virtual bool contains(const K& key) const {\n\n return this->associatedMap->containsKey(key);\n\n }\n\n\n","file_path":"activemq-cpp/src/main/decaf/util/StlMap.h","rank":77,"score":288626.8894152502},{"content":" class TextMessageCreator: public activemq::cmsutil::MessageCreator {\n\n public:\n\n\n\n TextMessageCreator() : MessageCreator() {}\n\n\n\n virtual ~TextMessageCreator() {}\n\n\n\n virtual cms::Message* createMessage( cms::Session* session ) {\n\n\n\n cms::Message* message = NULL;\n\n\n\n if( session != NULL ) {\n\n message = session->createTextMessage(\"test text message\");\n\n }\n\n\n\n return message;\n\n }\n\n };\n\n}\n\n\n","file_path":"activemq-cpp/src/examples/cmstemplate/CMSTemplateSender.cpp","rank":78,"score":288551.7731555651},{"content":" class MockReader : public decaf::io::Reader {\n\n private:\n\n\n\n std::vector<char> contents;\n\n\n\n int current_offset;\n\n int length;\n\n\n\n public:\n\n\n\n MockReader() : Reader(), contents(), current_offset(0), length(0) {\n\n }\n\n\n\n MockReader( std::vector<char>& data ) : Reader(), contents(data), current_offset(0), length((int)contents.size()) {\n\n }\n\n\n\n virtual void close() {\n\n contents.clear();\n\n }\n\n\n","file_path":"activemq-cpp/src/test/decaf/io/ReaderTest.cpp","rank":79,"score":287179.48452026525},{"content":" class ShutdownTask : public decaf::lang::Runnable {\n\n private:\n\n\n\n SocketFactory** defaultRef;\n\n\n\n private:\n\n\n\n ShutdownTask( const ShutdownTask& );\n\n ShutdownTask& operator= ( const ShutdownTask& );\n\n\n\n public:\n\n\n\n ShutdownTask( SocketFactory** defaultRef ) : defaultRef( defaultRef ) {}\n\n virtual ~ShutdownTask() {}\n\n\n\n virtual void run() {\n\n *defaultRef = NULL;\n\n }\n\n };\n\n}\n","file_path":"activemq-cpp/src/main/decaf/net/SocketFactory.cpp","rank":80,"score":287179.4845202652},{"content":" class DECAF_API SecureRandom : public decaf::util::Random {\n\n private:\n\n\n\n std::auto_ptr<SecureRandomSpi> secureRandom;\n\n\n\n public:\n\n\n\n /**\n\n * Creates a new instance of a secure random number generator that implements the\n\n * default random number algorithm.\n\n *\n\n * The SecureRandom instance that is created with this constructor is unseeded and\n\n * can be seeded by calling the setSeed method. Calls to nextBytes on an unseeded\n\n * SecureRandom result in the object seeding itself.\n\n */\n\n SecureRandom();\n\n\n\n /**\n\n * Creates a new instance of a secure random number generator that implements the\n\n * default random number algorithm.\n","file_path":"activemq-cpp/src/main/decaf/security/SecureRandom.h","rank":81,"score":284780.7412498363},{"content":" class NoOpRunnable : public decaf::lang::Runnable {\n\n public:\n\n\n\n NoOpRunnable() : decaf::lang::Runnable() {\n\n }\n\n\n\n virtual ~NoOpRunnable() {}\n\n\n\n virtual void run() {\n\n }\n\n };\n\n\n\n template<typename E>\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h","rank":82,"score":284647.8236890537},{"content":" class ShortRunnable : public decaf::lang::Runnable {\n\n private:\n\n\n\n ExecutorsTestSupport* parent;\n\n\n\n private:\n\n\n\n ShortRunnable(const ShortRunnable&);\n\n ShortRunnable operator= (const ShortRunnable&);\n\n\n\n public:\n\n\n\n ShortRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\n\n }\n\n\n\n virtual ~ShortRunnable() {}\n\n\n\n virtual void run() {\n\n try {\n\n Thread::sleep(SHORT_DELAY_MS);\n\n } catch(decaf::lang::Exception& e) {\n\n parent->threadUnexpectedException(e);\n\n }\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h","rank":83,"score":284647.8236890537},{"content":" class BenchmarkRunnable : public decaf::lang::Runnable {\n\n public:\n\n\n\n virtual void run() {\n\n Thread::sleep( 10 );\n\n }\n\n\n\n };\n\n\n\n}}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nThreadBenchmark::ThreadBenchmark() {\n\n}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\nThreadBenchmark::~ThreadBenchmark() {\n\n}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n","file_path":"activemq-cpp/src/test-benchmarks/decaf/lang/ThreadBenchmark.cpp","rank":84,"score":284647.8236890537},{"content":" class ShutdownTask : public decaf::lang::Runnable {\n\n private:\n\n\n\n ServerSocketFactory** defaultRef;\n\n\n\n private:\n\n\n\n ShutdownTask( const ShutdownTask& );\n\n ShutdownTask& operator= ( const ShutdownTask& );\n\n\n\n public:\n\n\n\n ShutdownTask( ServerSocketFactory** defaultRef ) : defaultRef( defaultRef ) {}\n\n virtual ~ShutdownTask() {}\n\n\n\n virtual void run() {\n\n *defaultRef = NULL;\n\n }\n\n };\n\n}\n","file_path":"activemq-cpp/src/main/decaf/net/ServerSocketFactory.cpp","rank":85,"score":284647.8236890537},{"content":" class SmallRunnable : public decaf::lang::Runnable {\n\n private:\n\n\n\n ExecutorsTestSupport* parent;\n\n\n\n private:\n\n\n\n SmallRunnable(const SmallRunnable&);\n\n SmallRunnable operator= (const SmallRunnable&);\n\n\n\n public:\n\n\n\n SmallRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\n\n }\n\n\n\n virtual ~SmallRunnable() {}\n\n\n\n virtual void run() {\n\n try {\n\n Thread::sleep(SMALL_DELAY_MS);\n\n } catch(decaf::lang::Exception& e) {\n\n parent->threadUnexpectedException(e);\n\n }\n\n }\n\n };\n\n\n\n template<typename E>\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h","rank":86,"score":284647.8236890537},{"content":"////////////////////////////////////////////////////////////////////////////////\n\nclass PointerTestRunnable : public decaf::lang::Runnable {\n\nprivate:\n\n\n\n Pointer<TestClassA> mine;\n\n\n\npublic:\n\n\n\n PointerTestRunnable( const Pointer<TestClassA>& value ) : mine( value ) {}\n\n\n\n void run() {\n\n\n\n for( int i = 0; i < 999; ++i ) {\n\n Pointer<TestClassBase> copy = this->mine;\n\n CPPUNIT_ASSERT( copy->returnHello() == \"Hello\" );\n\n copy.reset( new TestClassB() );\n\n CPPUNIT_ASSERT( copy->returnHello() == \"GoodBye\" );\n\n }\n\n }\n\n};\n\n\n","file_path":"activemq-cpp/src/test/decaf/lang/PointerTest.cpp","rank":87,"score":284647.8236890537},{"content":" class LongRunnable : public decaf::lang::Runnable {\n\n private:\n\n\n\n ExecutorsTestSupport* parent;\n\n\n\n private:\n\n\n\n LongRunnable(const LongRunnable&);\n\n LongRunnable operator= (const LongRunnable&);\n\n\n\n public:\n\n\n\n LongRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\n\n }\n\n\n\n virtual ~LongRunnable() {}\n\n\n\n virtual void run() {\n\n try {\n\n Thread::sleep(LONG_DELAY_MS);\n\n } catch(decaf::lang::Exception& e) {\n\n parent->threadUnexpectedException(e);\n\n }\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h","rank":88,"score":284647.8236890537},{"content":" class MediumRunnable : public decaf::lang::Runnable {\n\n private:\n\n\n\n ExecutorsTestSupport* parent;\n\n\n\n private:\n\n\n\n MediumRunnable(const MediumRunnable&);\n\n MediumRunnable operator= (const MediumRunnable&);\n\n\n\n public:\n\n\n\n MediumRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\n\n }\n\n\n\n virtual ~MediumRunnable() {}\n\n\n\n virtual void run() {\n\n try {\n\n Thread::sleep(MEDIUM_DELAY_MS);\n\n } catch(decaf::lang::Exception& e) {\n\n parent->threadUnexpectedException(e);\n\n }\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h","rank":89,"score":284647.8236890537},{"content":" class TextMessageCreator : public activemq::cmsutil::MessageCreator {\n\n private:\n\n\n\n std::string text;\n\n\n\n public:\n\n\n\n TextMessageCreator(const std::string& text) :\n\n activemq::cmsutil::MessageCreator(), text(text) {\n\n }\n\n\n\n virtual ~TextMessageCreator() {\n\n }\n\n\n\n std::string getText() const {\n\n return text;\n\n }\n\n\n\n virtual cms::Message* createMessage(cms::Session* session) throw (cms::CMSException) {\n\n\n\n return session->createTextMessage(text);\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/test-integration/activemq/test/CmsTemplateTest.cpp","rank":90,"score":284304.8306418946},{"content":" class Less : public decaf::util::Comparator<E> {\n\n public:\n\n\n\n Less() {}\n\n virtual ~Less() {}\n\n\n\n virtual bool operator()(const E& left, const E& right) const {\n\n return left < right;\n\n }\n\n\n\n virtual int compare(const E& o1, const E& o2) const {\n\n\n\n if (o1 > o2) {\n\n return 1;\n\n } else if (o1 < o2) {\n\n return -1;\n\n }\n\n\n\n return 0;\n\n }\n\n\n\n };\n\n\n\n}}}\n\n\n\n#endif /* _DECAF_UTIL_COMPARATORS_LESS_H_ */\n","file_path":"activemq-cpp/src/main/decaf/util/comparators/Less.h","rank":91,"score":283161.30317390535},{"content":" class Equals : public decaf::util::Comparator<E> {\n\n public:\n\n\n\n Equals() {}\n\n virtual ~Equals() {}\n\n\n\n virtual bool operator()(const E& left, const E& right) const {\n\n return left == right;\n\n }\n\n\n\n virtual int compare(const E& o1, const E& o2) const {\n\n\n\n if (o1 == o2) {\n\n return 0;\n\n }\n\n\n\n if (o1 < o2) {\n\n return -1;\n\n }\n\n\n\n return 1;\n\n }\n\n\n\n };\n\n\n\n template< typename E >\n","file_path":"activemq-cpp/src/main/decaf/util/comparators/Equals.h","rank":92,"score":283161.30317390535},{"content":" class MyTransport : public Transport, public decaf::lang::Runnable {\n\n public:\n\n\n\n TransportListener* listener;\n\n decaf::lang::Thread* thread;\n\n decaf::util::concurrent::Mutex mutex;\n\n decaf::util::concurrent::Mutex startedMutex;\n\n bool done;\n\n std::queue< Pointer<commands::Command> > requests;\n\n\n\n private:\n\n\n\n MyTransport(const MyTransport&);\n\n MyTransport& operator= (const MyTransport&);\n\n\n\n public:\n\n\n\n MyTransport() : listener(NULL), thread(NULL), mutex(), startedMutex(), done(false), requests() {\n\n }\n\n\n","file_path":"activemq-cpp/src/test/activemq/transport/correlator/ResponseCorrelatorTest.cpp","rank":93,"score":282778.7446210568},{"content":" class DECAF_API CancellationException : public decaf::lang::Exception {\n\n public:\n\n\n\n /**\n\n * Default Constructor\n\n */\n\n CancellationException();\n\n\n\n /**\n\n * Conversion Constructor from some other Exception\n\n *\n\n * @param ex An exception that should become this type of Exception\n\n */\n\n CancellationException(const decaf::lang::Exception& ex);\n\n\n\n /**\n\n * Copy Constructor\n\n *\n\n * @param ex - The Exception to copy in this new instance.\n\n */\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/CancellationException.h","rank":94,"score":282444.81469470053},{"content":" class DECAF_API TimeoutException : public decaf::lang::Exception {\n\n public:\n\n\n\n /**\n\n * Default Constructor\n\n */\n\n TimeoutException();\n\n\n\n /**\n\n * Conversion Constructor from some other Exception\n\n *\n\n * @param ex An exception that should become this type of Exception\n\n */\n\n TimeoutException(const decaf::lang::Exception& ex);\n\n\n\n /**\n\n * Copy Constructor\n\n *\n\n * @param ex\n\n * The exception to copy from.\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/TimeoutException.h","rank":95,"score":282444.81469470053},{"content":" class DECAF_API ExecutionException : public decaf::lang::Exception {\n\n public:\n\n\n\n /**\n\n * Default Constructor\n\n */\n\n ExecutionException();\n\n\n\n /**\n\n * Conversion Constructor from some other Exception\n\n *\n\n * @param ex - An exception that should become this type of Exception\n\n */\n\n ExecutionException(const decaf::lang::Exception& ex);\n\n\n\n /**\n\n * Copy Constructor\n\n *\n\n * @param ex - The Exception to copy in this new instance.\n\n */\n","file_path":"activemq-cpp/src/main/decaf/util/concurrent/ExecutionException.h","rank":96,"score":282444.81469470053},{"content":" class MediumInterruptedRunnable : public decaf::lang::Runnable {\n\n private:\n\n\n\n ExecutorsTestSupport* parent;\n\n\n\n private:\n\n\n\n MediumInterruptedRunnable(const MediumInterruptedRunnable&);\n\n MediumInterruptedRunnable operator= (const MediumInterruptedRunnable&);\n\n\n\n public:\n\n\n\n MediumInterruptedRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\n\n }\n\n\n\n virtual ~MediumInterruptedRunnable() {}\n\n\n\n virtual void run() {\n\n try {\n\n Thread::sleep(MEDIUM_DELAY_MS);\n\n parent->threadShouldThrow();\n\n } catch(decaf::lang::Exception& e) {\n\n }\n\n }\n\n };\n\n\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h","rank":97,"score":282189.39530217357},{"content":" class FutureRunnable : public decaf::lang::Runnable {\n\n public:\n\n\n\n FutureRunnable() {\n\n }\n\n\n\n virtual ~FutureRunnable() {\n\n }\n\n\n\n virtual void run() {\n\n }\n\n };\n\n\n\n template<typename E>\n","file_path":"activemq-cpp/src/test/decaf/util/concurrent/FutureTaskTest.cpp","rank":98,"score":282189.3953021735},{"content":" class ShutdownTask : public decaf::lang::Runnable {\n\n private:\n\n\n\n SocketFactory** defaultRef;\n\n\n\n private:\n\n\n\n ShutdownTask( const ShutdownTask& );\n\n ShutdownTask& operator= ( const ShutdownTask& );\n\n\n\n public:\n\n\n\n ShutdownTask( SocketFactory** defaultRef ) : defaultRef( defaultRef ) {}\n\n virtual ~ShutdownTask() {}\n\n\n\n virtual void run() {\n\n *defaultRef = NULL;\n\n }\n\n };\n\n}\n","file_path":"activemq-cpp/src/main/decaf/net/ssl/SSLSocketFactory.cpp","rank":99,"score":282189.3953021735}],"string":"[\n {\n \"content\": \" class DECAF_API Reader: public virtual decaf::io::Closeable, public virtual decaf::lang::Readable {\\n\\n private:\\n\\n\\n\\n Reader(const Reader&);\\n\\n Reader& operator=(const Reader&);\\n\\n\\n\\n protected:\\n\\n\\n\\n Reader();\\n\\n\\n\\n public:\\n\\n\\n\\n virtual ~Reader();\\n\\n\\n\\n /**\\n\\n * Marks the present position in the stream. Subsequent calls to reset() will attempt\\n\\n * to reposition the stream to this point. Not all character-input streams support\\n\\n * the mark() operation.\\n\\n *\\n\\n * @param readAheadLimit\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/io/Reader.h\",\n \"rank\": 0,\n \"score\": 401708.00318746694\n },\n {\n \"content\": \" class AMQCPP_API MessageDispatchChannel: public decaf::util::concurrent::Synchronizable {\\n\\n public:\\n\\n\\n\\n virtual ~MessageDispatchChannel();\\n\\n\\n\\n /**\\n\\n * Add a Message to the Channel behind all pending message.\\n\\n *\\n\\n * @param message - The message to add to the Channel.\\n\\n */\\n\\n virtual void enqueue(const Pointer<MessageDispatch>& message) = 0;\\n\\n\\n\\n /**\\n\\n * Add a message to the front of the Channel.\\n\\n *\\n\\n * @param message - The Message to add to the front of the Channel.\\n\\n */\\n\\n virtual void enqueueFirst(const Pointer<MessageDispatch>& message) = 0;\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/core/MessageDispatchChannel.h\",\n \"rank\": 1,\n \"score\": 386964.97447386186\n },\n {\n \"content\": \" class Queue : public virtual decaf::util::Collection<E> {\\n\\n public:\\n\\n\\n\\n virtual ~Queue() {}\\n\\n\\n\\n /**\\n\\n * Inserts the specified element into the queue provided that the condition\\n\\n * allows such an operation. The method is generally preferable to the\\n\\n * collection.add(E), since the latter might throw an exception if the\\n\\n * operation fails.\\n\\n *\\n\\n * @param value\\n\\n * the specified element to insert into the queue.\\n\\n *\\n\\n * @return true if the operation succeeds and false if it fails.\\n\\n *\\n\\n * @throws NullPointerException if the Queue implementation does not allow Null values to\\n\\n * be inserted into the Queue.\\n\\n * @throws IllegalArgumentException if some property of the specified\\n\\n * element prevents it from being added to this queue\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/Queue.h\",\n \"rank\": 2,\n \"score\": 367434.3860060965\n },\n {\n \"content\": \" class Set : public virtual decaf::util::Collection<E> {\\n\\n public:\\n\\n\\n\\n virtual ~Set() {}\\n\\n\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n#endif /*_DECAF_UTIL_SET_H_*/\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/Set.h\",\n \"rank\": 3,\n \"score\": 367434.3860060965\n },\n {\n \"content\": \" class AbstractCollection : public virtual decaf::util::Collection<E> {\\n\\n protected:\\n\\n\\n\\n mutable util::concurrent::Mutex mutex;\\n\\n\\n\\n public:\\n\\n\\n\\n AbstractCollection() : Collection<E>(), mutex() {}\\n\\n\\n\\n /**\\n\\n * Copy Constructor, copy element from the source collection to this\\n\\n * collection after clearing any element stored in this collection.\\n\\n *\\n\\n * @param collection - the collection to copy\\n\\n */\\n\\n AbstractCollection(const AbstractCollection& other) : Collection<E>(), mutex() {\\n\\n if (other.isEmpty()) {\\n\\n return;\\n\\n }\\n\\n std::auto_ptr<Iterator<E> > iter(other.iterator());\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/AbstractCollection.h\",\n \"rank\": 4,\n \"score\": 360459.1533890603\n },\n {\n \"content\": \" class AbstractSet : public virtual decaf::util::Set<E>,\\n\\n public virtual decaf::util::AbstractCollection<E> {\\n\\n public:\\n\\n\\n\\n AbstractSet() : AbstractCollection<E>() {}\\n\\n\\n\\n virtual ~AbstractSet() {}\\n\\n\\n\\n /**\\n\\n * {@inheritDoc}\\n\\n *\\n\\n * This implementation determines which is the smaller of this set and the specified\\n\\n * collection, by invoking the size method on each. If this set has fewer elements,\\n\\n * then the implementation iterates over this set, checking each element returned by\\n\\n * the iterator in turn to see if it is contained in the specified collection. If it\\n\\n * is so contained, it is removed from this set with the iterator's remove method. If\\n\\n * the specified collection has fewer elements, then the implementation iterates over\\n\\n * the specified collection, removing from this set each element returned by the\\n\\n * iterator, using this set's remove method.\\n\\n *\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/AbstractSet.h\",\n \"rank\": 5,\n \"score\": 360459.1533890603\n },\n {\n \"content\": \" class DECAF_API List : public virtual decaf::util::Collection<E> {\\n\\n public:\\n\\n\\n\\n // Un-hide any methods from Collection that the declarations in this interface hid.\\n\\n using decaf::util::Collection<E>::add;\\n\\n using decaf::util::Collection<E>::addAll;\\n\\n using decaf::util::Collection<E>::remove;\\n\\n\\n\\n public:\\n\\n\\n\\n List() {}\\n\\n\\n\\n virtual ~List() {}\\n\\n\\n\\n /**\\n\\n * @return a list iterator over the elements in this list (in proper sequence).\\n\\n */\\n\\n virtual ListIterator<E>* listIterator() = 0;\\n\\n virtual ListIterator<E>* listIterator() const = 0;\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/List.h\",\n \"rank\": 6,\n \"score\": 360160.5376354226\n },\n {\n \"content\": \" class DECAF_API IntArrayBuffer : public decaf::nio::IntBuffer {\\n\\n private:\\n\\n\\n\\n // The reference array object that backs this buffer.\\n\\n decaf::lang::Pointer<ByteArrayAdapter> _array;\\n\\n\\n\\n // Offset into the array that we are to start from\\n\\n int offset;\\n\\n\\n\\n // The length of the sub-array, or limit\\n\\n int length;\\n\\n\\n\\n // Read / Write flag\\n\\n bool readOnly;\\n\\n\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Creates a IntArrayBuffer object that has its backing array allocated internally\\n\\n * and is then owned and deleted when this object is deleted. The array is\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/internal/nio/IntArrayBuffer.h\",\n \"rank\": 7,\n \"score\": 351041.91839714267\n },\n {\n \"content\": \" class DECAF_API Throwable : public std::exception {\\n\\n public:\\n\\n\\n\\n Throwable();\\n\\n\\n\\n virtual ~Throwable() throw();\\n\\n\\n\\n /**\\n\\n * Gets the cause of the error, if no message was provided to the instance\\n\\n * of this interface but a cause was then the value cause.getMessage is\\n\\n * then returned.\\n\\n * @return string errors message\\n\\n */\\n\\n virtual std::string getMessage() const = 0;\\n\\n\\n\\n /**\\n\\n * Gets the exception that caused this one to be thrown, this allows\\n\\n * for chaining of exceptions in the case of a method that throws only\\n\\n * a particular exception but wishes to allow for the real causal\\n\\n * exception to be passed only in case the caller knows about that\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/lang/Throwable.h\",\n \"rank\": 8,\n \"score\": 350153.8989948907\n },\n {\n \"content\": \" class MockComparatorStringByLength : public decaf::util::Comparator<std::string> {\\n\\n\\n\\n virtual bool operator() ( const std::string& left, const std::string& right ) const {\\n\\n return left.size() == right.size();\\n\\n }\\n\\n\\n\\n virtual int compare( const std::string& o1, const std::string& o2 ) const {\\n\\n return o1.size() < o2.size() ? -1 : o1.size() > o2.size() ? 1 : 0;\\n\\n }\\n\\n\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nvoid PriorityQueueTest::testConstructor_1() {\\n\\n\\n\\n PriorityQueue<int> pqueue;\\n\\n\\n\\n CPPUNIT_ASSERT( pqueue.isEmpty() );\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/PriorityQueueTest.cpp\",\n \"rank\": 9,\n \"score\": 347711.3501310664\n },\n {\n \"content\": \" class MessagingTask : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n Receiver* receiver;\\n\\n std::string message;\\n\\n\\n\\n private:\\n\\n\\n\\n MessagingTask(const MessagingTask&);\\n\\n MessagingTask& operator= (const MessagingTask&);\\n\\n\\n\\n public:\\n\\n\\n\\n MessagingTask(Receiver* receiver, const std::string& message);\\n\\n\\n\\n virtual ~MessagingTask();\\n\\n\\n\\n virtual void run();\\n\\n\\n\\n };\\n\\n}\\n\\n\\n\\n#endif /** _CMSTEMPLATE_MESSAGINGTASK_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/examples/cmstemplate-stress/MessagingTask.h\",\n \"rank\": 10,\n \"score\": 346881.05999272387\n },\n {\n \"content\": \" class CacheMap : public LinkedHashMap<int, int> {\\n\\n public:\\n\\n\\n\\n int removals;\\n\\n\\n\\n CacheMap() : LinkedHashMap<int, int>(), removals(0) {\\n\\n }\\n\\n\\n\\n virtual ~CacheMap() {}\\n\\n\\n\\n protected:\\n\\n\\n\\n virtual bool removeEldestEntry(const MapEntry<int, int>& eldest) {\\n\\n return size() > 5;\\n\\n }\\n\\n\\n\\n virtual void onEviction(const MapEntry<int, int>& eldest) {\\n\\n removals++;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/LinkedHashMapTest.cpp\",\n \"rank\": 11,\n \"score\": 344854.4892614318\n },\n {\n \"content\": \" class StringTask : public decaf::util::concurrent::Callable<std::string> {\\n\\n public:\\n\\n\\n\\n StringTask() : decaf::util::concurrent::Callable<std::string>() {\\n\\n }\\n\\n\\n\\n virtual ~StringTask() {}\\n\\n\\n\\n std::string call() {\\n\\n return TEST_STRING;\\n\\n }\\n\\n };\\n\\n\\n\\n };\\n\\n\\n\\n}}}\\n\\n\\n\\n#endif /* _DECAF_UTIL_CONCURRENT_EXECUTORSTESTSUPPORT_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h\",\n \"rank\": 12,\n \"score\": 343705.2422850198\n },\n {\n \"content\": \" class DECAF_API SHA1MessageDigestSpi : public decaf::security::MessageDigestSpi {\\n\\n private:\\n\\n\\n\\n SHA1MessageDigestSpi(const SHA1MessageDigestSpi&);\\n\\n SHA1MessageDigestSpi& operator= (const SHA1MessageDigestSpi&);\\n\\n\\n\\n SHA1MessageDigestSpiImpl* impl;\\n\\n\\n\\n public:\\n\\n\\n\\n SHA1MessageDigestSpi();\\n\\n\\n\\n virtual ~SHA1MessageDigestSpi();\\n\\n\\n\\n public:\\n\\n\\n\\n virtual bool isCloneable() const {\\n\\n return true;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/internal/security/provider/crypto/SHA1MessageDigestSpi.h\",\n \"rank\": 13,\n \"score\": 337775.90640608995\n },\n {\n \"content\": \" class DECAF_API MD5MessageDigestSpi : public decaf::security::MessageDigestSpi {\\n\\n private:\\n\\n\\n\\n MD5MessageDigestSpi(const MD5MessageDigestSpi&);\\n\\n MD5MessageDigestSpi& operator= (const MD5MessageDigestSpi&);\\n\\n\\n\\n MD5MessageDigestSpiImpl* impl;\\n\\n\\n\\n public:\\n\\n\\n\\n MD5MessageDigestSpi();\\n\\n\\n\\n virtual ~MD5MessageDigestSpi();\\n\\n\\n\\n public:\\n\\n\\n\\n virtual bool isCloneable() const {\\n\\n return true;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/internal/security/provider/crypto/MD5MessageDigestSpi.h\",\n \"rank\": 14,\n \"score\": 337775.90640608995\n },\n {\n \"content\": \" class DECAF_API MD4MessageDigestSpi : public decaf::security::MessageDigestSpi {\\n\\n private:\\n\\n\\n\\n MD4MessageDigestSpi(const MD4MessageDigestSpi&);\\n\\n MD4MessageDigestSpi& operator= (const MD4MessageDigestSpi&);\\n\\n\\n\\n MD4MessageDigestSpiImpl* impl;\\n\\n\\n\\n public:\\n\\n\\n\\n MD4MessageDigestSpi();\\n\\n\\n\\n virtual ~MD4MessageDigestSpi();\\n\\n\\n\\n public:\\n\\n\\n\\n virtual bool isCloneable() const {\\n\\n return true;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/internal/security/provider/crypto/MD4MessageDigestSpi.h\",\n \"rank\": 15,\n \"score\": 337775.90640608995\n },\n {\n \"content\": \" class AMQCPP_API MessageId : public BaseDataStructure, public decaf::lang::Comparable<MessageId> {\\n\\n protected:\\n\\n\\n\\n std::string textView;\\n\\n Pointer<ProducerId> producerId;\\n\\n long long producerSequenceId;\\n\\n long long brokerSequenceId;\\n\\n\\n\\n public:\\n\\n\\n\\n const static unsigned char ID_MESSAGEID = 110;\\n\\n\\n\\n typedef decaf::lang::PointerComparator<MessageId> COMPARATOR;\\n\\n\\n\\n private:\\n\\n\\n\\n mutable std::string key;\\n\\n\\n\\n public:\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/commands/MessageId.h\",\n \"rank\": 16,\n \"score\": 337417.82874138793\n },\n {\n \"content\": \" class DECAF_API InputStream: public Closeable, virtual public util::concurrent::Synchronizable {\\n\\n private:\\n\\n\\n\\n // Synchronization object.\\n\\n util::concurrent::Mutex mutex;\\n\\n\\n\\n private:\\n\\n\\n\\n InputStream(const InputStream&);\\n\\n InputStream& operator=(const InputStream&);\\n\\n\\n\\n public:\\n\\n\\n\\n InputStream();\\n\\n\\n\\n virtual ~InputStream();\\n\\n\\n\\n /**\\n\\n * Closes the InputStream freeing any resources that might have been acquired\\n\\n * during the lifetime of this stream.\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/io/InputStream.h\",\n \"rank\": 17,\n \"score\": 336287.18010013824\n },\n {\n \"content\": \" class BrokerMonitor: public decaf::lang::Runnable, activemq::cmsutil::MessageCreator {\\n\\n private:\\n\\n\\n\\n bool closing;\\n\\n bool brokerOk;\\n\\n std::string url;\\n\\n int interval;\\n\\n decaf::lang::Thread* brokerMonitorThread;\\n\\n decaf::util::concurrent::CountDownLatch* quit;\\n\\n\\n\\n private:\\n\\n\\n\\n activemq::cmsutil::CmsTemplate* createCmsTemplate(cms::ConnectionFactory* connectionFactory);\\n\\n\\n\\n public:\\n\\n\\n\\n BrokerMonitor(const std::string& url, int interval,\\n\\n decaf::util::concurrent::CountDownLatch* quit);\\n\\n\\n\\n virtual ~BrokerMonitor();\\n\",\n \"file_path\": \"activemq-cpp/src/examples/stress-test/BrokerMonitor.h\",\n \"rank\": 18,\n \"score\": 332922.4514917914\n },\n {\n \"content\": \" class AMQCPP_API MessageDispatch : public BaseCommand {\\n\\n protected:\\n\\n\\n\\n Pointer<ConsumerId> consumerId;\\n\\n Pointer<ActiveMQDestination> destination;\\n\\n Pointer<Message> message;\\n\\n int redeliveryCounter;\\n\\n\\n\\n public:\\n\\n\\n\\n const static unsigned char ID_MESSAGEDISPATCH = 21;\\n\\n\\n\\n private:\\n\\n\\n\\n decaf::lang::Exception rollbackCause;\\n\\n\\n\\n private:\\n\\n\\n\\n MessageDispatch(const MessageDispatch&);\\n\\n MessageDispatch& operator= (const MessageDispatch&);\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/commands/MessageDispatch.h\",\n \"rank\": 19,\n \"score\": 331405.99918630504\n },\n {\n \"content\": \" class AMQCPP_API FifoMessageDispatchChannel : public MessageDispatchChannel {\\n\\n private:\\n\\n\\n\\n bool closed;\\n\\n bool running;\\n\\n\\n\\n mutable decaf::util::LinkedList< Pointer<MessageDispatch> > channel;\\n\\n\\n\\n private:\\n\\n\\n\\n FifoMessageDispatchChannel(const FifoMessageDispatchChannel&);\\n\\n FifoMessageDispatchChannel& operator=(const FifoMessageDispatchChannel&);\\n\\n\\n\\n public:\\n\\n\\n\\n FifoMessageDispatchChannel();\\n\\n\\n\\n virtual ~FifoMessageDispatchChannel();\\n\\n\\n\\n virtual void enqueue(const Pointer<MessageDispatch>& message);\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/core/FifoMessageDispatchChannel.h\",\n \"rank\": 20,\n \"score\": 331332.36017740273\n },\n {\n \"content\": \" class PublicFutureTask : public FutureTask<std::string> {\\n\\n public:\\n\\n\\n\\n PublicFutureTask(Callable<std::string>* r) : FutureTask<std::string>(r) {}\\n\\n\\n\\n virtual ~PublicFutureTask() {}\\n\\n\\n\\n virtual bool runAndReset() {\\n\\n return FutureTask<std::string>::runAndReset();\\n\\n }\\n\\n\\n\\n virtual void set(const std::string& x) {\\n\\n FutureTask<std::string>::set(x);\\n\\n }\\n\\n\\n\\n virtual void setException(const Exception& ex) {\\n\\n FutureTask<std::string>::setException(ex);\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/FutureTaskTest.cpp\",\n \"rank\": 21,\n \"score\": 331007.6304638015\n },\n {\n \"content\": \" class Collection : public virtual lang::Iterable<E>,\\n\\n public virtual util::concurrent::Synchronizable {\\n\\n public:\\n\\n\\n\\n virtual ~Collection() {}\\n\\n\\n\\n /**\\n\\n * Renders this Collection as a Copy of the given Collection\\n\\n *\\n\\n * @param collection\\n\\n * The collection to mirror.\\n\\n *\\n\\n * @throws UnsupportedOperationExceptio if this is an unmodifiable collection.\\n\\n * @throws IllegalStateException if the elements cannot be added at this time due\\n\\n * to insertion restrictions.\\n\\n */\\n\\n virtual void copy(const Collection<E>& collection) = 0;\\n\\n\\n\\n /**\\n\\n * Returns true if this collection changed as a result of the call.\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/Collection.h\",\n \"rank\": 22,\n \"score\": 329701.4392738956\n },\n {\n \"content\": \" class DECAF_API DefaultMessageDigestProviderService : public decaf::security::ProviderService {\\n\\n private:\\n\\n\\n\\n DefaultMessageDigestProviderService(const DefaultMessageDigestProviderService&);\\n\\n DefaultMessageDigestProviderService& operator= (const DefaultMessageDigestProviderService&);\\n\\n\\n\\n public:\\n\\n\\n\\n DefaultMessageDigestProviderService(const decaf::security::Provider* provider,\\n\\n const std::string& algorithmName);\\n\\n\\n\\n virtual ~DefaultMessageDigestProviderService();\\n\\n\\n\\n virtual decaf::security::SecuritySpi* newInstance();\\n\\n\\n\\n };\\n\\n\\n\\n}}}}\\n\\n\\n\\n#endif /* _DECAF_INTERNAL_SECURITY_PROVIDER_DEFAULTMESSAGEDIGESTPROVIDERSERVICE_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/internal/security/provider/DefaultMessageDigestProviderService.h\",\n \"rank\": 24,\n \"score\": 329481.08025801694\n },\n {\n \"content\": \" class DECAF_API IntBuffer : public Buffer,\\n\\n public lang::Comparable<IntBuffer> {\\n\\n protected:\\n\\n\\n\\n /**\\n\\n * Creates a IntBuffer object that has its backing array allocated internally\\n\\n * and is then owned and deleted when this object is deleted. The array is\\n\\n * initially created with all elements initialized to zero.\\n\\n *\\n\\n * @param capacity\\n\\n * The size and limit of the Buffer in integers.\\n\\n *\\n\\n * @throws IllegalArguementException if capacity is negative.\\n\\n */\\n\\n IntBuffer( int capacity );\\n\\n\\n\\n public:\\n\\n\\n\\n virtual ~IntBuffer() {}\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/nio/IntBuffer.h\",\n \"rank\": 25,\n \"score\": 328541.99899933394\n },\n {\n \"content\": \" class Consumer: public cms::MessageListener, public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n auto_ptr<CMSProvider> cmsProvider;\\n\\n long initialDelay;\\n\\n long waitMillis;\\n\\n int numReceived;\\n\\n\\n\\n public:\\n\\n\\n\\n Consumer(const std::string& brokerURL, const std::string& destination, long waitMillis) :\\n\\n Runnable(), cmsProvider(), initialDelay(0), waitMillis(waitMillis), numReceived(0) {\\n\\n\\n\\n this->cmsProvider.reset(new CMSProvider(brokerURL));\\n\\n this->cmsProvider->setTopic(false);\\n\\n this->cmsProvider->setDestinationName(destination);\\n\\n }\\n\\n\\n\\n virtual ~Consumer() {\\n\\n }\\n\",\n \"file_path\": \"activemq-cpp/src/test-integration/activemq/test/ExpirationTest.cpp\",\n \"rank\": 26,\n \"score\": 326876.109226265\n },\n {\n \"content\": \" class ConstStlListIterator : public decaf::util::ListIterator<E> {\\n\\n private:\\n\\n\\n\\n typename std::list<E>::const_iterator current;\\n\\n typename std::list<E>::const_iterator prev;\\n\\n const typename std::list<E>* list;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstStlListIterator(const ConstStlListIterator&);\\n\\n ConstStlListIterator operator= (const ConstStlListIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstStlListIterator(const typename std::list<E>* list, int index) :\\n\\n ListIterator<E>(), current(list->begin()), prev(list->end()), list( list) {\\n\\n\\n\\n if (index < (int) list->size()) {\\n\\n std::advance(this->current, index);\\n\\n } else {\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/StlList.h\",\n \"rank\": 27,\n \"score\": 326113.9140867044\n },\n {\n \"content\": \" class AMQCPP_API SimplePriorityMessageDispatchChannel : public MessageDispatchChannel {\\n\\n private:\\n\\n\\n\\n static const int MAX_PRIORITIES;\\n\\n\\n\\n bool closed;\\n\\n bool running;\\n\\n\\n\\n mutable decaf::util::concurrent::Mutex mutex;\\n\\n\\n\\n mutable ArrayPointer< decaf::util::LinkedList< Pointer<MessageDispatch> > > channels;\\n\\n\\n\\n int enqueued;\\n\\n\\n\\n private:\\n\\n\\n\\n SimplePriorityMessageDispatchChannel(const SimplePriorityMessageDispatchChannel&);\\n\\n SimplePriorityMessageDispatchChannel& operator=(const SimplePriorityMessageDispatchChannel&);\\n\\n\\n\\n public:\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/core/SimplePriorityMessageDispatchChannel.h\",\n \"rank\": 28,\n \"score\": 326027.9881067106\n },\n {\n \"content\": \" class AMQCPP_API MessageDispatchNotification : public BaseCommand {\\n\\n protected:\\n\\n\\n\\n Pointer<ConsumerId> consumerId;\\n\\n Pointer<ActiveMQDestination> destination;\\n\\n long long deliverySequenceId;\\n\\n Pointer<MessageId> messageId;\\n\\n\\n\\n public:\\n\\n\\n\\n const static unsigned char ID_MESSAGEDISPATCHNOTIFICATION = 90;\\n\\n\\n\\n private:\\n\\n\\n\\n MessageDispatchNotification(const MessageDispatchNotification&);\\n\\n MessageDispatchNotification& operator= (const MessageDispatchNotification&);\\n\\n\\n\\n public:\\n\\n\\n\\n MessageDispatchNotification();\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/commands/MessageDispatchNotification.h\",\n \"rank\": 29,\n \"score\": 324867.14274572884\n },\n {\n \"content\": \" class testSubmitEECallable : public Callable<int> {\\n\\n public:\\n\\n\\n\\n virtual ~testSubmitEECallable() {}\\n\\n\\n\\n virtual int call() {\\n\\n throw NumberFormatException(__FILE__, __LINE__, \\\"Throwing a common exception\\\");\\n\\n return 1;\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nvoid AbstractExecutorServiceTest::testSubmitEE() {\\n\\n ThreadPoolExecutor p(1, 1, 60, TimeUnit::SECONDS, new LinkedBlockingQueue<Runnable*>(10));\\n\\n\\n\\n testSubmitEECallable c;\\n\\n\\n\\n try {\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/AbstractExecutorServiceTest.cpp\",\n \"rank\": 30,\n \"score\": 322666.52403640456\n },\n {\n \"content\": \" class AMQCPP_API ActiveMQSessionKernel : public virtual cms::Session, public Dispatcher {\\n\\n private:\\n\\n\\n\\n friend class activemq::core::ActiveMQSessionExecutor;\\n\\n\\n\\n protected:\\n\\n\\n\\n SessionConfig* config;\\n\\n\\n\\n /**\\n\\n * SessionInfo for this Session\\n\\n */\\n\\n Pointer<commands::SessionInfo> sessionInfo;\\n\\n\\n\\n /**\\n\\n * Transaction Management object\\n\\n */\\n\\n Pointer<ActiveMQTransactionContext> transaction;\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/core/kernels/ActiveMQSessionKernel.h\",\n \"rank\": 31,\n \"score\": 319834.52370512113\n },\n {\n \"content\": \" class StringThreadLocal : public ThreadLocal<std::string> {\\n\\n public:\\n\\n\\n\\n StringThreadLocal() : ThreadLocal<std::string>() {}\\n\\n virtual ~StringThreadLocal() {}\\n\\n\\n\\n protected:\\n\\n\\n\\n virtual std::string initialValue() const {\\n\\n return \\\"initial\\\";\\n\\n }\\n\\n };\\n\\n\\n\\n}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nvoid ThreadLocalTest::testRemove() {\\n\\n\\n\\n StringThreadLocal tl;\\n\\n\\n\\n CPPUNIT_ASSERT_EQUAL(std::string(\\\"initial\\\"), tl.get());\\n\\n tl.set(\\\"fixture\\\");\\n\\n CPPUNIT_ASSERT_EQUAL(std::string(\\\"fixture\\\"), tl.get());\\n\\n tl.remove();\\n\\n CPPUNIT_ASSERT_EQUAL(std::string(\\\"initial\\\"), tl.get());\\n\\n}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nnamespace {\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/lang/ThreadLocalTest.cpp\",\n \"rank\": 32,\n \"score\": 318409.8925882912\n },\n {\n \"content\": \" class DECAF_API MessageDigestSpi : public SecuritySpi {\\n\\n public:\\n\\n\\n\\n MessageDigestSpi();\\n\\n\\n\\n virtual ~MessageDigestSpi();\\n\\n\\n\\n /**\\n\\n * Queries the SPI implementation and returns true if the SPI can be\\n\\n * cloned.\\n\\n *\\n\\n * @return true if the SPI is clonable.\\n\\n */\\n\\n virtual bool isCloneable() const;\\n\\n\\n\\n /**\\n\\n * Returns a clone if the implementation supports being cloned.\\n\\n *\\n\\n * @return a new pointer that is a copy of this object.\\n\\n *\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/security/MessageDigestSpi.h\",\n \"rank\": 33,\n \"score\": 318132.9580087902\n },\n {\n \"content\": \" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstKeyIterator(const ConstKeyIterator&);\\n\\n ConstKeyIterator& operator= (const ConstKeyIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstKeyIterator(const HashMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstKeyIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual K next() {\\n\\n this->makeNext();\\n\\n return this->currentEntry->getKey();\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\");\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/HashMap.h\",\n \"rank\": 34,\n \"score\": 317752.2299740074\n },\n {\n \"content\": \" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstKeyIterator(const ConstKeyIterator&);\\n\\n ConstKeyIterator& operator= (const ConstKeyIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstKeyIterator(const StlMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstKeyIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual K next() {\\n\\n this->makeNext();\\n\\n return this->currentEntry->first;\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\" );\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/StlMap.h\",\n \"rank\": 35,\n \"score\": 317752.2299740074\n },\n {\n \"content\": \" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstValueIterator(const ConstValueIterator&);\\n\\n ConstValueIterator& operator= (const ConstValueIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstValueIterator(const StlMap* parent) : ConstAbstractMapIterator(parent) {}\\n\\n\\n\\n virtual ~ConstValueIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual V next() {\\n\\n this->makeNext();\\n\\n return this->currentEntry->second;\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\" );\\n\\n }\\n\\n };\\n\\n\\n\\n private:\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/StlMap.h\",\n \"rank\": 36,\n \"score\": 317752.22997400735\n },\n {\n \"content\": \" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstValueIterator(const ConstValueIterator&);\\n\\n ConstValueIterator& operator= (const ConstValueIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstValueIterator(const HashMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstValueIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual V next() {\\n\\n this->makeNext();\\n\\n return this->currentEntry->getValue();\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\");\\n\\n }\\n\\n };\\n\\n\\n\\n protected:\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/HashMap.h\",\n \"rank\": 37,\n \"score\": 317752.2299740074\n },\n {\n \"content\": \" class MessagingTask:public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n Receiver* receiver;\\n\\n std::string message;\\n\\n\\n\\n static decaf::util::concurrent::ThreadPoolExecutor* threadPoolExecutor;\\n\\n\\n\\n public:\\n\\n\\n\\n MessagingTask(Receiver* receiver, const std::string& message);\\n\\n\\n\\n virtual ~MessagingTask();\\n\\n\\n\\n virtual void run();\\n\\n\\n\\n static void initializeThreads(int min, int max);\\n\\n static void terminateThreads();\\n\\n\\n\\n virtual void queue();\\n\\n\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n#endif /** _CMS_STRESS_MESSAGINGTASK_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/examples/stress-test/MessagingTask.h\",\n \"rank\": 38,\n \"score\": 316052.0157265151\n },\n {\n \"content\": \" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstKeyIterator(const ConstKeyIterator&);\\n\\n ConstKeyIterator& operator= (const ConstKeyIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstKeyIterator(const LinkedHashMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstKeyIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual K next() {\\n\\n this->makeNext();\\n\\n return this->currentEntry->getKey();\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\" );\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/LinkedHashMap.h\",\n \"rank\": 39,\n \"score\": 314821.45311548834\n },\n {\n \"content\": \" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstValueIterator(const ConstValueIterator&);\\n\\n ConstValueIterator& operator= (const ConstValueIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstValueIterator(const LinkedHashMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstValueIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual V next() {\\n\\n this->makeNext();\\n\\n return this->currentEntry->getValue();\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\" );\\n\\n }\\n\\n };\\n\\n\\n\\n private:\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/LinkedHashMap.h\",\n \"rank\": 40,\n \"score\": 314821.45311548834\n },\n {\n \"content\": \" class AMQCPP_API PrimitiveMap : public decaf::util::StlMap<std::string, PrimitiveValueNode> {\\n\\n private:\\n\\n\\n\\n PrimitiveValueConverter converter;\\n\\n\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Default Constructor, creates an empty map.\\n\\n */\\n\\n PrimitiveMap();\\n\\n\\n\\n virtual ~PrimitiveMap();\\n\\n\\n\\n /**\\n\\n * Copy Constructor\\n\\n *\\n\\n * @param source\\n\\n * The Decaf Library Map instance whose elements will be copied into this Map.\\n\\n */\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/util/PrimitiveMap.h\",\n \"rank\": 41,\n \"score\": 314677.2490113568\n },\n {\n \"content\": \" class ActiveMQMessageAuditTest : public CppUnit::TestFixture {\\n\\n\\n\\n CPPUNIT_TEST_SUITE( ActiveMQMessageAuditTest );\\n\\n CPPUNIT_TEST( testIsDuplicateString );\\n\\n CPPUNIT_TEST( testIsDuplicateMessageId );\\n\\n CPPUNIT_TEST( testIsInOrderString );\\n\\n CPPUNIT_TEST( testIsInOrderMessageId );\\n\\n CPPUNIT_TEST( testRollbackString );\\n\\n CPPUNIT_TEST( testRollbackMessageId );\\n\\n CPPUNIT_TEST( testGetLastSeqId );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n public:\\n\\n\\n\\n ActiveMQMessageAuditTest();\\n\\n virtual ~ActiveMQMessageAuditTest();\\n\\n\\n\\n void testIsDuplicateString();\\n\\n void testIsDuplicateMessageId();\\n\\n void testIsInOrderString();\\n\",\n \"file_path\": \"activemq-cpp/src/test/activemq/core/ActiveMQMessageAuditTest.h\",\n \"rank\": 42,\n \"score\": 312825.98034826474\n },\n {\n \"content\": \" class AMQCPP_API MessageDispatchMarshaller : public BaseCommandMarshaller {\\n\\n public:\\n\\n\\n\\n MessageDispatchMarshaller() {}\\n\\n virtual ~MessageDispatchMarshaller() {}\\n\\n\\n\\n virtual commands::DataStructure* createObject() const;\\n\\n\\n\\n virtual unsigned char getDataStructureType() const;\\n\\n\\n\\n virtual void tightUnmarshal(OpenWireFormat* wireFormat,\\n\\n commands::DataStructure* dataStructure,\\n\\n decaf::io::DataInputStream* dataIn,\\n\\n utils::BooleanStream* bs);\\n\\n\\n\\n virtual int tightMarshal1(OpenWireFormat* wireFormat,\\n\\n commands::DataStructure* dataStructure,\\n\\n utils::BooleanStream* bs);\\n\\n\\n\\n virtual void tightMarshal2(OpenWireFormat* wireFormat,\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/wireformat/openwire/marshal/generated/MessageDispatchMarshaller.h\",\n \"rank\": 43,\n \"score\": 312783.1097120461\n },\n {\n \"content\": \" class FifoMessageDispatchChannelTest : public CppUnit::TestFixture {\\n\\n\\n\\n CPPUNIT_TEST_SUITE( FifoMessageDispatchChannelTest );\\n\\n CPPUNIT_TEST( testCtor );\\n\\n CPPUNIT_TEST( testStart );\\n\\n CPPUNIT_TEST( testStop );\\n\\n CPPUNIT_TEST( testClose );\\n\\n CPPUNIT_TEST( testEnqueue );\\n\\n CPPUNIT_TEST( testEnqueueFront );\\n\\n CPPUNIT_TEST( testPeek );\\n\\n CPPUNIT_TEST( testDequeueNoWait );\\n\\n CPPUNIT_TEST( testDequeue );\\n\\n CPPUNIT_TEST( testRemoveAll );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n public:\\n\\n\\n\\n FifoMessageDispatchChannelTest() {}\\n\\n virtual ~FifoMessageDispatchChannelTest() {}\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/activemq/core/FifoMessageDispatchChannelTest.h\",\n \"rank\": 44,\n \"score\": 312783.1097120461\n },\n {\n \"content\": \" class ConstValueIterator : public Iterator<V>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstValueIterator(const ConstValueIterator&);\\n\\n ConstValueIterator& operator= (const ConstValueIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstValueIterator(const ConcurrentStlMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstValueIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual V next() {\\n\\n synchronized(&this->associatedMap->mutex) {\\n\\n this->makeNext();\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/ConcurrentStlMap.h\",\n \"rank\": 45,\n \"score\": 311964.85043618234\n },\n {\n \"content\": \" class ConstKeyIterator : public Iterator<K>, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstKeyIterator(const ConstKeyIterator&);\\n\\n ConstKeyIterator& operator= (const ConstKeyIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstKeyIterator(const ConcurrentStlMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstKeyIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual K next() {\\n\\n synchronized(&this->associatedMap->mutex) {\\n\\n this->makeNext();\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/ConcurrentStlMap.h\",\n \"rank\": 46,\n \"score\": 311964.85043618234\n },\n {\n \"content\": \" class DECAF_API Writer: public decaf::io::Closeable, public decaf::io::Flushable, public decaf::lang::Appendable {\\n\\n private:\\n\\n\\n\\n Writer(const Writer&);\\n\\n Writer& operator=(const Writer&);\\n\\n\\n\\n public:\\n\\n\\n\\n Writer();\\n\\n\\n\\n virtual ~Writer();\\n\\n\\n\\n /**\\n\\n * Writes an single byte char value.\\n\\n *\\n\\n * @param v\\n\\n * The value to be written.\\n\\n *\\n\\n * @throws IOException thrown if an error occurs.\\n\\n */\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/io/Writer.h\",\n \"rank\": 47,\n \"score\": 311087.47385014803\n },\n {\n \"content\": \" class MessageDispatchMarshallerTest : public CppUnit::TestFixture {\\n\\n\\n\\n CPPUNIT_TEST_SUITE( MessageDispatchMarshallerTest );\\n\\n CPPUNIT_TEST( test );\\n\\n CPPUNIT_TEST( testLooseMarshal );\\n\\n CPPUNIT_TEST( testTightMarshal );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n public:\\n\\n\\n\\n MessageDispatchMarshallerTest() {}\\n\\n virtual ~MessageDispatchMarshallerTest() {}\\n\\n\\n\\n /**\\n\\n * Test the marshaller and its marshalled type.\\n\\n */\\n\\n virtual void test();\\n\\n virtual void testLooseMarshal();\\n\\n virtual void testTightMarshal();\\n\\n\\n\\n };\\n\\n\\n\\n}}}}}\\n\\n\\n\\n#endif /*_ACTIVEMQ_WIREFORMAT_OPENWIRE_MARSAHAL_GENERATED_MESSAGEDISPATCHMARSHALLERTEST_H_*/\\n\",\n \"file_path\": \"activemq-cpp/src/test/activemq/wireformat/openwire/marshal/generated/MessageDispatchMarshallerTest.h\",\n \"rank\": 48,\n \"score\": 309950.28183336294\n },\n {\n \"content\": \" class AMQCPP_API MessageDispatchNotificationMarshaller : public BaseCommandMarshaller {\\n\\n public:\\n\\n\\n\\n MessageDispatchNotificationMarshaller() {}\\n\\n virtual ~MessageDispatchNotificationMarshaller() {}\\n\\n\\n\\n virtual commands::DataStructure* createObject() const;\\n\\n\\n\\n virtual unsigned char getDataStructureType() const;\\n\\n\\n\\n virtual void tightUnmarshal(OpenWireFormat* wireFormat,\\n\\n commands::DataStructure* dataStructure,\\n\\n decaf::io::DataInputStream* dataIn,\\n\\n utils::BooleanStream* bs);\\n\\n\\n\\n virtual int tightMarshal1(OpenWireFormat* wireFormat,\\n\\n commands::DataStructure* dataStructure,\\n\\n utils::BooleanStream* bs);\\n\\n\\n\\n virtual void tightMarshal2(OpenWireFormat* wireFormat,\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/wireformat/openwire/marshal/generated/MessageDispatchNotificationMarshaller.h\",\n \"rank\": 49,\n \"score\": 307186.95284556714\n },\n {\n \"content\": \" class SimplePriorityMessageDispatchChannelTest : public CppUnit::TestFixture {\\n\\n\\n\\n CPPUNIT_TEST_SUITE( SimplePriorityMessageDispatchChannelTest );\\n\\n CPPUNIT_TEST( testCtor );\\n\\n CPPUNIT_TEST( testStart );\\n\\n CPPUNIT_TEST( testStop );\\n\\n CPPUNIT_TEST( testClose );\\n\\n CPPUNIT_TEST( testEnqueue );\\n\\n CPPUNIT_TEST( testEnqueueFront );\\n\\n CPPUNIT_TEST( testPeek );\\n\\n CPPUNIT_TEST( testDequeueNoWait );\\n\\n CPPUNIT_TEST( testDequeue );\\n\\n CPPUNIT_TEST( testRemoveAll );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n public:\\n\\n\\n\\n SimplePriorityMessageDispatchChannelTest() {}\\n\\n virtual ~SimplePriorityMessageDispatchChannelTest() {}\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/activemq/core/SimplePriorityMessageDispatchChannelTest.h\",\n \"rank\": 50,\n \"score\": 307186.95284556714\n },\n {\n \"content\": \" class MessageDispatchNotificationMarshallerTest : public CppUnit::TestFixture {\\n\\n\\n\\n CPPUNIT_TEST_SUITE( MessageDispatchNotificationMarshallerTest );\\n\\n CPPUNIT_TEST( test );\\n\\n CPPUNIT_TEST( testLooseMarshal );\\n\\n CPPUNIT_TEST( testTightMarshal );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n public:\\n\\n\\n\\n MessageDispatchNotificationMarshallerTest() {}\\n\\n virtual ~MessageDispatchNotificationMarshallerTest() {}\\n\\n\\n\\n /**\\n\\n * Test the marshaller and its marshalled type.\\n\\n */\\n\\n virtual void test();\\n\\n virtual void testLooseMarshal();\\n\\n virtual void testTightMarshal();\\n\\n\\n\\n };\\n\\n\\n\\n}}}}}\\n\\n\\n\\n#endif /*_ACTIVEMQ_WIREFORMAT_OPENWIRE_MARSAHAL_GENERATED_MESSAGEDISPATCHNOTIFICATIONMARSHALLERTEST_H_*/\\n\",\n \"file_path\": \"activemq-cpp/src/test/activemq/wireformat/openwire/marshal/generated/MessageDispatchNotificationMarshallerTest.h\",\n \"rank\": 51,\n \"score\": 304490.4995546286\n },\n {\n \"content\": \" class MessageDigestTest : public CppUnit::TestFixture {\\n\\n\\n\\n CPPUNIT_TEST_SUITE( MessageDigestTest );\\n\\n CPPUNIT_TEST( testGetInstance1 );\\n\\n CPPUNIT_TEST( testGetInstance2 );\\n\\n CPPUNIT_TEST( testGetInstance3 );\\n\\n CPPUNIT_TEST( testGetInstance4 );\\n\\n CPPUNIT_TEST( testResults1 );\\n\\n CPPUNIT_TEST( testResults2 );\\n\\n CPPUNIT_TEST( testResults3 );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\n public:\\n\\n\\n\\n MessageDigestTest();\\n\\n virtual ~MessageDigestTest();\\n\\n\\n\\n void testGetInstance1();\\n\\n void testGetInstance2();\\n\\n void testGetInstance3();\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/security/MessageDigestTest.h\",\n \"rank\": 52,\n \"score\": 303709.3233578373\n },\n {\n \"content\": \" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstEntryIterator(const ConstEntryIterator&);\\n\\n ConstEntryIterator& operator= (const ConstEntryIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstEntryIterator(const StlMap* parent) : ConstAbstractMapIterator(parent) {}\\n\\n\\n\\n virtual ~ConstEntryIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual MapEntry<K, V> next() {\\n\\n this->makeNext();\\n\\n return MapEntry<K, V>(this->currentEntry->first, this->currentEntry->second);\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\" );\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/StlMap.h\",\n \"rank\": 53,\n \"score\": 301982.9478697166\n },\n {\n \"content\": \" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstEntryIterator(const ConstEntryIterator&);\\n\\n ConstEntryIterator& operator= (const ConstEntryIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstEntryIterator(const HashMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstEntryIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual MapEntry<K, V> next() {\\n\\n this->makeNext();\\n\\n return *(this->currentEntry);\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\");\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/HashMap.h\",\n \"rank\": 54,\n \"score\": 301982.9478697166\n },\n {\n \"content\": \" class MessagePullCache : public LinkedHashMap<std::string, Pointer<Command> > {\\n\\n protected:\\n\\n\\n\\n ConnectionStateTracker* parent;\\n\\n\\n\\n public:\\n\\n\\n\\n MessagePullCache(ConnectionStateTracker* parent) :\\n\\n LinkedHashMap<std::string, Pointer<Command> >(), parent(parent) {\\n\\n }\\n\\n\\n\\n virtual ~MessagePullCache() {}\\n\\n\\n\\n virtual bool removeEldestEntry(const MapEntry<std::string, Pointer<Command> >& eldest AMQCPP_UNUSED) {\\n\\n return size() > parent->getMaxMessagePullCacheSize();\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/state/ConnectionStateTracker.cpp\",\n \"rank\": 55,\n \"score\": 301246.5132193222\n },\n {\n \"content\": \" class ConstReverseIterator : public Iterator<E> {\\n\\n private:\\n\\n\\n\\n const LinkedList<E>* list;\\n\\n const ListNode<E>* current;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstReverseIterator(const ConstReverseIterator&);\\n\\n ConstReverseIterator operator=(const ConstReverseIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstReverseIterator(const LinkedList<E>* list) : Iterator<E>(), list(list), current(NULL) {\\n\\n\\n\\n if (list == NULL) {\\n\\n throw decaf::lang::exceptions::NullPointerException(\\n\\n __FILE__, __LINE__, \\\"Parent LinkedList pointer was Null.\\\" );\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/LinkedList.h\",\n \"rank\": 56,\n \"score\": 299381.5881249159\n },\n {\n \"content\": \" class ConstSetIterator : public Iterator<E> {\\n\\n private:\\n\\n\\n\\n typename std::set<E>::const_iterator current;\\n\\n typename std::set<E>::const_iterator previous;\\n\\n const typename std::set<E>* set;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstSetIterator(const ConstSetIterator&);\\n\\n ConstSetIterator operator=(const ConstSetIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstSetIterator(const typename std::set<E>* set) :\\n\\n Iterator<E>(), current(set->begin()), previous(set->begin()), set(set) {\\n\\n }\\n\\n\\n\\n virtual ~ConstSetIterator() {}\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/StlSet.h\",\n \"rank\": 57,\n \"score\": 299381.5881249159\n },\n {\n \"content\": \" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstEntryIterator(const ConstEntryIterator&);\\n\\n ConstEntryIterator& operator= (const ConstEntryIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstEntryIterator(const LinkedHashMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstEntryIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual MapEntry<K, V> next() {\\n\\n this->makeNext();\\n\\n return *(this->currentEntry);\\n\\n }\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__, \\\"Cannot write to a const Iterator.\\\" );\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/LinkedHashMap.h\",\n \"rank\": 58,\n \"score\": 299266.175104431\n },\n {\n \"content\": \" class TimerImpl: public decaf::lang::Thread, public SynchronizableImpl {\\n\\n public:\\n\\n\\n\\n TimerTaskHeap heap;\\n\\n bool cancelled;\\n\\n\\n\\n public:\\n\\n\\n\\n TimerImpl() : Thread(), heap(), cancelled(false) {}\\n\\n\\n\\n TimerImpl(const std::string& name) : Thread(name), heap(), cancelled(false) {}\\n\\n\\n\\n virtual ~TimerImpl() {\\n\\n try {\\n\\n this->cancel();\\n\\n this->join();\\n\\n }\\n\\n DECAF_CATCHALL_NOTHROW()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/Timer.cpp\",\n \"rank\": 59,\n \"score\": 298461.86373176664\n },\n {\n \"content\": \" class ConstPriorityQueueIterator : public PriorityQueueIterator {\\n\\n private:\\n\\n\\n\\n ConstPriorityQueueIterator( const ConstPriorityQueueIterator& );\\n\\n ConstPriorityQueueIterator& operator= ( const ConstPriorityQueueIterator& );\\n\\n\\n\\n public:\\n\\n\\n\\n ConstPriorityQueueIterator(const PriorityQueue* queue) :\\n\\n PriorityQueueIterator(const_cast<PriorityQueue*>(queue)) {}\\n\\n\\n\\n virtual void remove() {\\n\\n throw lang::exceptions::UnsupportedOperationException(\\n\\n __FILE__, __LINE__,\\n\\n \\\"PriorityQueue::Iterator::remove - Not Valid on a Const Iterator\\\");\\n\\n }\\n\\n };\\n\\n\\n\\n friend class PriorityQueueIterator;\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/PriorityQueue.h\",\n \"rank\": 60,\n \"score\": 297740.91988958255\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////\\n\\nclass MyIntRunnable: public Runnable {\\n\\nprivate:\\n\\n\\n\\n AtomicInteger* aip;\\n\\n\\n\\nprivate:\\n\\n\\n\\n MyIntRunnable(const MyIntRunnable&);\\n\\n MyIntRunnable operator= (const MyIntRunnable&);\\n\\n\\n\\npublic:\\n\\n\\n\\n MyIntRunnable( AtomicInteger* ai ) :\\n\\n aip( ai ) {\\n\\n }\\n\\n\\n\\n virtual void run() {\\n\\n while( !aip->compareAndSet( 2, 3 ) ) {\\n\\n Thread::yield();\\n\\n }\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/atomic/AtomicIntegerTest.cpp\",\n \"rank\": 61,\n \"score\": 297713.5014424042\n },\n {\n \"content\": \" class AMQCPP_API Transport : public activemq::util::Service, public decaf::io::Closeable {\\n\\n public:\\n\\n\\n\\n virtual ~Transport();\\n\\n\\n\\n /**\\n\\n * Starts the Transport, the send methods of a Transport will throw an exception\\n\\n * if used before the Transport is started.\\n\\n *\\n\\n * @throw IOException if and error occurs while starting the Transport.\\n\\n */\\n\\n virtual void start() = 0;\\n\\n\\n\\n /**\\n\\n * Stops the Transport.\\n\\n *\\n\\n * @throw IOException if an error occurs while stopping the transport.\\n\\n */\\n\\n virtual void stop() = 0;\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/transport/Transport.h\",\n \"rank\": 62,\n \"score\": 297645.46304079914\n },\n {\n \"content\": \" class ConstEntryIterator : public Iterator< MapEntry<K,V> >, public ConstAbstractMapIterator {\\n\\n private:\\n\\n\\n\\n ConstEntryIterator(const ConstEntryIterator&);\\n\\n ConstEntryIterator& operator= (const ConstEntryIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstEntryIterator(const ConcurrentStlMap* parent) : ConstAbstractMapIterator(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstEntryIterator() {}\\n\\n\\n\\n virtual bool hasNext() const {\\n\\n return this->checkHasNext();\\n\\n }\\n\\n\\n\\n virtual MapEntry<K, V> next() {\\n\\n synchronized(&this->associatedMap->mutex) {\\n\\n this->makeNext();\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/ConcurrentStlMap.h\",\n \"rank\": 63,\n \"score\": 296615.3541715774\n },\n {\n \"content\": \" class CmsMessageCreator : public activemq::cmsutil::MessageCreator {\\n\\n private:\\n\\n\\n\\n std::string text;\\n\\n\\n\\n public:\\n\\n\\n\\n CmsMessageCreator(const std::string& text);\\n\\n\\n\\n virtual ~CmsMessageCreator();\\n\\n virtual cms::Message* createMessage(cms::Session* session);\\n\\n\\n\\n };\\n\\n}\\n\\n\\n\\n#endif /** _CMSTEMPLATE_CMSMESSAGECREATOR_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/examples/cmstemplate-stress/CmsMessageCreator.h\",\n \"rank\": 64,\n \"score\": 295978.92297144467\n },\n {\n \"content\": \" class CmsMessageCreator: public activemq::cmsutil::MessageCreator {\\n\\n private:\\n\\n\\n\\n std::string text;\\n\\n std::string headerName;\\n\\n std::string headerValue;\\n\\n\\n\\n public:\\n\\n\\n\\n CmsMessageCreator(const std::string& txt,\\n\\n const std::string& name = \\\"\\\",\\n\\n const std::string& value = \\\"\\\");\\n\\n\\n\\n virtual ~CmsMessageCreator();\\n\\n\\n\\n virtual cms::Message* createMessage(cms::Session* session);\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n#endif /** _CMS_STRESS_CMSMESSAGECREATOR_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/examples/stress-test/CmsMessageCreator.h\",\n \"rank\": 65,\n \"score\": 295978.92297144467\n },\n {\n \"content\": \" class IntArrayBufferTest : public CppUnit::TestFixture {\\n\\n\\n\\n CPPUNIT_TEST_SUITE( IntArrayBufferTest );\\n\\n CPPUNIT_TEST( test );\\n\\n CPPUNIT_TEST( testArray );\\n\\n CPPUNIT_TEST( testArrayOffset );\\n\\n CPPUNIT_TEST( testReadOnlyArray );\\n\\n CPPUNIT_TEST( testAsReadOnlyBuffer );\\n\\n CPPUNIT_TEST( testCompact );\\n\\n CPPUNIT_TEST( testCompareTo );\\n\\n CPPUNIT_TEST( testDuplicate );\\n\\n CPPUNIT_TEST( testEquals );\\n\\n CPPUNIT_TEST( testHasArray );\\n\\n CPPUNIT_TEST( testGet );\\n\\n CPPUNIT_TEST( testGet2 );\\n\\n CPPUNIT_TEST( testGetIntArray );\\n\\n CPPUNIT_TEST( testGetIntArray2 );\\n\\n CPPUNIT_TEST( testGetWithIndex );\\n\\n CPPUNIT_TEST( testPutInt );\\n\\n CPPUNIT_TEST( testPutIntArray );\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/internal/nio/IntArrayBufferTest.h\",\n \"rank\": 66,\n \"score\": 294903.19044752506\n },\n {\n \"content\": \" class ConstLinkedIterator : public Iterator<E> {\\n\\n private:\\n\\n\\n\\n Pointer< QueueNode<E> > current;\\n\\n Pointer< QueueNode<E> > last;\\n\\n E currentElement;\\n\\n const LinkedBlockingQueue<E>* parent;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstLinkedIterator(const ConstLinkedIterator&);\\n\\n ConstLinkedIterator& operator= (const ConstLinkedIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstLinkedIterator(const LinkedBlockingQueue<E>* parent) : current(), last(),\\n\\n currentElement(),\\n\\n parent(parent) {\\n\\n TotalLock lock(parent);\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/LinkedBlockingQueue.h\",\n \"rank\": 67,\n \"score\": 292095.3373270766\n },\n {\n \"content\": \" class ConstSimpleListIterator : public ListIterator<E> {\\n\\n protected:\\n\\n\\n\\n const AbstractList<E>* parent;\\n\\n int numLeft;\\n\\n int expectedModCount;\\n\\n int lastPosition;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstSimpleListIterator(const ConstSimpleListIterator&);\\n\\n ConstSimpleListIterator operator=(const ConstSimpleListIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstSimpleListIterator(const AbstractList<E>* parent, int start) :\\n\\n ListIterator<E>(), parent(parent), numLeft(0), expectedModCount(0), lastPosition(-1) {\\n\\n\\n\\n if (parent == NULL) {\\n\\n throw decaf::lang::exceptions::NullPointerException(\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/AbstractList.h\",\n \"rank\": 68,\n \"score\": 292095.3373270766\n },\n {\n \"content\": \" class ConstLinkedListIterator : public ListIterator<E> {\\n\\n private:\\n\\n\\n\\n const LinkedList<E>* list;\\n\\n const ListNode<E>* current;\\n\\n const ListNode<E>* lastReturned;\\n\\n int index;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstLinkedListIterator(const ConstLinkedListIterator&);\\n\\n ConstLinkedListIterator operator=(const ConstLinkedListIterator&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstLinkedListIterator(const LinkedList<E>* list, int index) :\\n\\n ListIterator<E>(), list(list), current(NULL), lastReturned(NULL), index(-1) {\\n\\n\\n\\n if (list == NULL) {\\n\\n throw decaf::lang::exceptions::NullPointerException(\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/LinkedList.h\",\n \"rank\": 69,\n \"score\": 292095.3373270766\n },\n {\n \"content\": \" class DECAF_API DecafRuntime: public decaf::lang::Runtime {\\n\\n private:\\n\\n\\n\\n DecafRuntime(const DecafRuntime&);\\n\\n DecafRuntime& operator=(const DecafRuntime&);\\n\\n\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Initializes the APR Runtime for a library.\\n\\n */\\n\\n DecafRuntime();\\n\\n\\n\\n /**\\n\\n * Terminates the APR Runtime for a library.\\n\\n */\\n\\n virtual ~DecafRuntime();\\n\\n\\n\\n /**\\n\\n * Grants access to the Global APR Pool instance that should be\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/internal/DecafRuntime.h\",\n \"rank\": 70,\n \"score\": 291302.08694993856\n },\n {\n \"content\": \" class AMQCPP_API ActiveMQConsumerKernel : public cms::MessageConsumer, public Dispatcher {\\n\\n private:\\n\\n\\n\\n /**\\n\\n * Internal Class that holds Members of this class, allows for changes without API breakage.\\n\\n */\\n\\n ActiveMQConsumerKernelConfig* internal;\\n\\n\\n\\n /**\\n\\n * The ActiveMQSession that owns this class instance.\\n\\n */\\n\\n ActiveMQSessionKernel* session;\\n\\n\\n\\n /**\\n\\n * The ConsumerInfo object for this class instance.\\n\\n */\\n\\n Pointer<commands::ConsumerInfo> consumerInfo;\\n\\n\\n\\n private:\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/activemq/core/kernels/ActiveMQConsumerKernel.h\",\n \"rank\": 71,\n \"score\": 291013.71159581514\n },\n {\n \"content\": \" class RunnableFuture : public Future<T>, public decaf::lang::Runnable {\\n\\n public:\\n\\n\\n\\n virtual ~RunnableFuture() {}\\n\\n\\n\\n };\\n\\n\\n\\n}}}\\n\\n\\n\\n#endif /* _DECAF_UTIL_CONCURRENT_RUNNABLEFUTURE_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/RunnableFuture.h\",\n \"rank\": 72,\n \"score\": 290958.5628967306\n },\n {\n \"content\": \" class DECAF_API Socket : public decaf::io::Closeable {\\n\\n protected:\\n\\n\\n\\n // The actual Socket that this Socket represents.\\n\\n mutable SocketImpl* impl;\\n\\n\\n\\n private:\\n\\n\\n\\n // Factory for creating sockets, if not set a Plan TCP Socket is created\\n\\n static SocketImplFactory* factory;\\n\\n\\n\\n mutable volatile bool created;\\n\\n\\n\\n bool connected;\\n\\n bool closed;\\n\\n bool bound;\\n\\n bool inputShutdown;\\n\\n bool outputShutdown;\\n\\n\\n\\n friend class ServerSocket;\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/net/Socket.h\",\n \"rank\": 73,\n \"score\": 289658.59809460206\n },\n {\n \"content\": \" class ConstStlMapValueCollection : public AbstractCollection<V> {\\n\\n private:\\n\\n\\n\\n const StlMap* associatedMap;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstStlMapValueCollection(const ConstStlMapValueCollection&);\\n\\n ConstStlMapValueCollection& operator= (const ConstStlMapValueCollection&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstStlMapValueCollection(const StlMap* parent) : AbstractCollection<V>(), associatedMap(parent) {}\\n\\n\\n\\n virtual ~ConstStlMapValueCollection() {}\\n\\n\\n\\n virtual bool contains(const V& value) const {\\n\\n return this->associatedMap->containsValue(value);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/StlMap.h\",\n \"rank\": 74,\n \"score\": 288626.8894152502\n },\n {\n \"content\": \" class ConstHashMapKeySet : public AbstractSet<K> {\\n\\n private:\\n\\n\\n\\n const HashMap* associatedMap;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstHashMapKeySet(const ConstHashMapKeySet&);\\n\\n ConstHashMapKeySet& operator= (const ConstHashMapKeySet&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstHashMapKeySet(const HashMap* parent) : AbstractSet<K>(), associatedMap(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstHashMapKeySet() {}\\n\\n\\n\\n virtual bool contains(const K& key) const {\\n\\n return this->associatedMap->containsKey(key);\\n\\n }\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/HashMap.h\",\n \"rank\": 75,\n \"score\": 288626.8894152502\n },\n {\n \"content\": \" class ConstHashMapValueCollection : public AbstractCollection<V> {\\n\\n private:\\n\\n\\n\\n const HashMap* associatedMap;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstHashMapValueCollection(const ConstHashMapValueCollection&);\\n\\n ConstHashMapValueCollection& operator= (const ConstHashMapValueCollection&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstHashMapValueCollection(const HashMap* parent) : AbstractCollection<V>(), associatedMap(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ConstHashMapValueCollection() {}\\n\\n\\n\\n virtual bool contains(const V& value) const {\\n\\n return this->associatedMap->containsValue(value);\\n\\n }\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/HashMap.h\",\n \"rank\": 76,\n \"score\": 288626.8894152502\n },\n {\n \"content\": \" class ConstStlMapKeySet : public AbstractSet<K> {\\n\\n private:\\n\\n\\n\\n const StlMap* associatedMap;\\n\\n\\n\\n private:\\n\\n\\n\\n ConstStlMapKeySet(const ConstStlMapKeySet&);\\n\\n ConstStlMapKeySet& operator= (const ConstStlMapKeySet&);\\n\\n\\n\\n public:\\n\\n\\n\\n ConstStlMapKeySet(const StlMap* parent) : AbstractSet<K>(), associatedMap(parent) {}\\n\\n\\n\\n virtual ~ConstStlMapKeySet() {}\\n\\n\\n\\n virtual bool contains(const K& key) const {\\n\\n return this->associatedMap->containsKey(key);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/StlMap.h\",\n \"rank\": 77,\n \"score\": 288626.8894152502\n },\n {\n \"content\": \" class TextMessageCreator: public activemq::cmsutil::MessageCreator {\\n\\n public:\\n\\n\\n\\n TextMessageCreator() : MessageCreator() {}\\n\\n\\n\\n virtual ~TextMessageCreator() {}\\n\\n\\n\\n virtual cms::Message* createMessage( cms::Session* session ) {\\n\\n\\n\\n cms::Message* message = NULL;\\n\\n\\n\\n if( session != NULL ) {\\n\\n message = session->createTextMessage(\\\"test text message\\\");\\n\\n }\\n\\n\\n\\n return message;\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/examples/cmstemplate/CMSTemplateSender.cpp\",\n \"rank\": 78,\n \"score\": 288551.7731555651\n },\n {\n \"content\": \" class MockReader : public decaf::io::Reader {\\n\\n private:\\n\\n\\n\\n std::vector<char> contents;\\n\\n\\n\\n int current_offset;\\n\\n int length;\\n\\n\\n\\n public:\\n\\n\\n\\n MockReader() : Reader(), contents(), current_offset(0), length(0) {\\n\\n }\\n\\n\\n\\n MockReader( std::vector<char>& data ) : Reader(), contents(data), current_offset(0), length((int)contents.size()) {\\n\\n }\\n\\n\\n\\n virtual void close() {\\n\\n contents.clear();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/io/ReaderTest.cpp\",\n \"rank\": 79,\n \"score\": 287179.48452026525\n },\n {\n \"content\": \" class ShutdownTask : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n SocketFactory** defaultRef;\\n\\n\\n\\n private:\\n\\n\\n\\n ShutdownTask( const ShutdownTask& );\\n\\n ShutdownTask& operator= ( const ShutdownTask& );\\n\\n\\n\\n public:\\n\\n\\n\\n ShutdownTask( SocketFactory** defaultRef ) : defaultRef( defaultRef ) {}\\n\\n virtual ~ShutdownTask() {}\\n\\n\\n\\n virtual void run() {\\n\\n *defaultRef = NULL;\\n\\n }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/net/SocketFactory.cpp\",\n \"rank\": 80,\n \"score\": 287179.4845202652\n },\n {\n \"content\": \" class DECAF_API SecureRandom : public decaf::util::Random {\\n\\n private:\\n\\n\\n\\n std::auto_ptr<SecureRandomSpi> secureRandom;\\n\\n\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Creates a new instance of a secure random number generator that implements the\\n\\n * default random number algorithm.\\n\\n *\\n\\n * The SecureRandom instance that is created with this constructor is unseeded and\\n\\n * can be seeded by calling the setSeed method. Calls to nextBytes on an unseeded\\n\\n * SecureRandom result in the object seeding itself.\\n\\n */\\n\\n SecureRandom();\\n\\n\\n\\n /**\\n\\n * Creates a new instance of a secure random number generator that implements the\\n\\n * default random number algorithm.\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/security/SecureRandom.h\",\n \"rank\": 81,\n \"score\": 284780.7412498363\n },\n {\n \"content\": \" class NoOpRunnable : public decaf::lang::Runnable {\\n\\n public:\\n\\n\\n\\n NoOpRunnable() : decaf::lang::Runnable() {\\n\\n }\\n\\n\\n\\n virtual ~NoOpRunnable() {}\\n\\n\\n\\n virtual void run() {\\n\\n }\\n\\n };\\n\\n\\n\\n template<typename E>\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h\",\n \"rank\": 82,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \" class ShortRunnable : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n ExecutorsTestSupport* parent;\\n\\n\\n\\n private:\\n\\n\\n\\n ShortRunnable(const ShortRunnable&);\\n\\n ShortRunnable operator= (const ShortRunnable&);\\n\\n\\n\\n public:\\n\\n\\n\\n ShortRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\\n\\n }\\n\\n\\n\\n virtual ~ShortRunnable() {}\\n\\n\\n\\n virtual void run() {\\n\\n try {\\n\\n Thread::sleep(SHORT_DELAY_MS);\\n\\n } catch(decaf::lang::Exception& e) {\\n\\n parent->threadUnexpectedException(e);\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h\",\n \"rank\": 83,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \" class BenchmarkRunnable : public decaf::lang::Runnable {\\n\\n public:\\n\\n\\n\\n virtual void run() {\\n\\n Thread::sleep( 10 );\\n\\n }\\n\\n\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nThreadBenchmark::ThreadBenchmark() {\\n\\n}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\nThreadBenchmark::~ThreadBenchmark() {\\n\\n}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\",\n \"file_path\": \"activemq-cpp/src/test-benchmarks/decaf/lang/ThreadBenchmark.cpp\",\n \"rank\": 84,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \" class ShutdownTask : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n ServerSocketFactory** defaultRef;\\n\\n\\n\\n private:\\n\\n\\n\\n ShutdownTask( const ShutdownTask& );\\n\\n ShutdownTask& operator= ( const ShutdownTask& );\\n\\n\\n\\n public:\\n\\n\\n\\n ShutdownTask( ServerSocketFactory** defaultRef ) : defaultRef( defaultRef ) {}\\n\\n virtual ~ShutdownTask() {}\\n\\n\\n\\n virtual void run() {\\n\\n *defaultRef = NULL;\\n\\n }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/net/ServerSocketFactory.cpp\",\n \"rank\": 85,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \" class SmallRunnable : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n ExecutorsTestSupport* parent;\\n\\n\\n\\n private:\\n\\n\\n\\n SmallRunnable(const SmallRunnable&);\\n\\n SmallRunnable operator= (const SmallRunnable&);\\n\\n\\n\\n public:\\n\\n\\n\\n SmallRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\\n\\n }\\n\\n\\n\\n virtual ~SmallRunnable() {}\\n\\n\\n\\n virtual void run() {\\n\\n try {\\n\\n Thread::sleep(SMALL_DELAY_MS);\\n\\n } catch(decaf::lang::Exception& e) {\\n\\n parent->threadUnexpectedException(e);\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n template<typename E>\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h\",\n \"rank\": 86,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \"////////////////////////////////////////////////////////////////////////////////\\n\\nclass PointerTestRunnable : public decaf::lang::Runnable {\\n\\nprivate:\\n\\n\\n\\n Pointer<TestClassA> mine;\\n\\n\\n\\npublic:\\n\\n\\n\\n PointerTestRunnable( const Pointer<TestClassA>& value ) : mine( value ) {}\\n\\n\\n\\n void run() {\\n\\n\\n\\n for( int i = 0; i < 999; ++i ) {\\n\\n Pointer<TestClassBase> copy = this->mine;\\n\\n CPPUNIT_ASSERT( copy->returnHello() == \\\"Hello\\\" );\\n\\n copy.reset( new TestClassB() );\\n\\n CPPUNIT_ASSERT( copy->returnHello() == \\\"GoodBye\\\" );\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/lang/PointerTest.cpp\",\n \"rank\": 87,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \" class LongRunnable : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n ExecutorsTestSupport* parent;\\n\\n\\n\\n private:\\n\\n\\n\\n LongRunnable(const LongRunnable&);\\n\\n LongRunnable operator= (const LongRunnable&);\\n\\n\\n\\n public:\\n\\n\\n\\n LongRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\\n\\n }\\n\\n\\n\\n virtual ~LongRunnable() {}\\n\\n\\n\\n virtual void run() {\\n\\n try {\\n\\n Thread::sleep(LONG_DELAY_MS);\\n\\n } catch(decaf::lang::Exception& e) {\\n\\n parent->threadUnexpectedException(e);\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h\",\n \"rank\": 88,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \" class MediumRunnable : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n ExecutorsTestSupport* parent;\\n\\n\\n\\n private:\\n\\n\\n\\n MediumRunnable(const MediumRunnable&);\\n\\n MediumRunnable operator= (const MediumRunnable&);\\n\\n\\n\\n public:\\n\\n\\n\\n MediumRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\\n\\n }\\n\\n\\n\\n virtual ~MediumRunnable() {}\\n\\n\\n\\n virtual void run() {\\n\\n try {\\n\\n Thread::sleep(MEDIUM_DELAY_MS);\\n\\n } catch(decaf::lang::Exception& e) {\\n\\n parent->threadUnexpectedException(e);\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h\",\n \"rank\": 89,\n \"score\": 284647.8236890537\n },\n {\n \"content\": \" class TextMessageCreator : public activemq::cmsutil::MessageCreator {\\n\\n private:\\n\\n\\n\\n std::string text;\\n\\n\\n\\n public:\\n\\n\\n\\n TextMessageCreator(const std::string& text) :\\n\\n activemq::cmsutil::MessageCreator(), text(text) {\\n\\n }\\n\\n\\n\\n virtual ~TextMessageCreator() {\\n\\n }\\n\\n\\n\\n std::string getText() const {\\n\\n return text;\\n\\n }\\n\\n\\n\\n virtual cms::Message* createMessage(cms::Session* session) throw (cms::CMSException) {\\n\\n\\n\\n return session->createTextMessage(text);\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test-integration/activemq/test/CmsTemplateTest.cpp\",\n \"rank\": 90,\n \"score\": 284304.8306418946\n },\n {\n \"content\": \" class Less : public decaf::util::Comparator<E> {\\n\\n public:\\n\\n\\n\\n Less() {}\\n\\n virtual ~Less() {}\\n\\n\\n\\n virtual bool operator()(const E& left, const E& right) const {\\n\\n return left < right;\\n\\n }\\n\\n\\n\\n virtual int compare(const E& o1, const E& o2) const {\\n\\n\\n\\n if (o1 > o2) {\\n\\n return 1;\\n\\n } else if (o1 < o2) {\\n\\n return -1;\\n\\n }\\n\\n\\n\\n return 0;\\n\\n }\\n\\n\\n\\n };\\n\\n\\n\\n}}}\\n\\n\\n\\n#endif /* _DECAF_UTIL_COMPARATORS_LESS_H_ */\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/comparators/Less.h\",\n \"rank\": 91,\n \"score\": 283161.30317390535\n },\n {\n \"content\": \" class Equals : public decaf::util::Comparator<E> {\\n\\n public:\\n\\n\\n\\n Equals() {}\\n\\n virtual ~Equals() {}\\n\\n\\n\\n virtual bool operator()(const E& left, const E& right) const {\\n\\n return left == right;\\n\\n }\\n\\n\\n\\n virtual int compare(const E& o1, const E& o2) const {\\n\\n\\n\\n if (o1 == o2) {\\n\\n return 0;\\n\\n }\\n\\n\\n\\n if (o1 < o2) {\\n\\n return -1;\\n\\n }\\n\\n\\n\\n return 1;\\n\\n }\\n\\n\\n\\n };\\n\\n\\n\\n template< typename E >\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/comparators/Equals.h\",\n \"rank\": 92,\n \"score\": 283161.30317390535\n },\n {\n \"content\": \" class MyTransport : public Transport, public decaf::lang::Runnable {\\n\\n public:\\n\\n\\n\\n TransportListener* listener;\\n\\n decaf::lang::Thread* thread;\\n\\n decaf::util::concurrent::Mutex mutex;\\n\\n decaf::util::concurrent::Mutex startedMutex;\\n\\n bool done;\\n\\n std::queue< Pointer<commands::Command> > requests;\\n\\n\\n\\n private:\\n\\n\\n\\n MyTransport(const MyTransport&);\\n\\n MyTransport& operator= (const MyTransport&);\\n\\n\\n\\n public:\\n\\n\\n\\n MyTransport() : listener(NULL), thread(NULL), mutex(), startedMutex(), done(false), requests() {\\n\\n }\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/activemq/transport/correlator/ResponseCorrelatorTest.cpp\",\n \"rank\": 93,\n \"score\": 282778.7446210568\n },\n {\n \"content\": \" class DECAF_API CancellationException : public decaf::lang::Exception {\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Default Constructor\\n\\n */\\n\\n CancellationException();\\n\\n\\n\\n /**\\n\\n * Conversion Constructor from some other Exception\\n\\n *\\n\\n * @param ex An exception that should become this type of Exception\\n\\n */\\n\\n CancellationException(const decaf::lang::Exception& ex);\\n\\n\\n\\n /**\\n\\n * Copy Constructor\\n\\n *\\n\\n * @param ex - The Exception to copy in this new instance.\\n\\n */\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/CancellationException.h\",\n \"rank\": 94,\n \"score\": 282444.81469470053\n },\n {\n \"content\": \" class DECAF_API TimeoutException : public decaf::lang::Exception {\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Default Constructor\\n\\n */\\n\\n TimeoutException();\\n\\n\\n\\n /**\\n\\n * Conversion Constructor from some other Exception\\n\\n *\\n\\n * @param ex An exception that should become this type of Exception\\n\\n */\\n\\n TimeoutException(const decaf::lang::Exception& ex);\\n\\n\\n\\n /**\\n\\n * Copy Constructor\\n\\n *\\n\\n * @param ex\\n\\n * The exception to copy from.\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/TimeoutException.h\",\n \"rank\": 95,\n \"score\": 282444.81469470053\n },\n {\n \"content\": \" class DECAF_API ExecutionException : public decaf::lang::Exception {\\n\\n public:\\n\\n\\n\\n /**\\n\\n * Default Constructor\\n\\n */\\n\\n ExecutionException();\\n\\n\\n\\n /**\\n\\n * Conversion Constructor from some other Exception\\n\\n *\\n\\n * @param ex - An exception that should become this type of Exception\\n\\n */\\n\\n ExecutionException(const decaf::lang::Exception& ex);\\n\\n\\n\\n /**\\n\\n * Copy Constructor\\n\\n *\\n\\n * @param ex - The Exception to copy in this new instance.\\n\\n */\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/util/concurrent/ExecutionException.h\",\n \"rank\": 96,\n \"score\": 282444.81469470053\n },\n {\n \"content\": \" class MediumInterruptedRunnable : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n ExecutorsTestSupport* parent;\\n\\n\\n\\n private:\\n\\n\\n\\n MediumInterruptedRunnable(const MediumInterruptedRunnable&);\\n\\n MediumInterruptedRunnable operator= (const MediumInterruptedRunnable&);\\n\\n\\n\\n public:\\n\\n\\n\\n MediumInterruptedRunnable(ExecutorsTestSupport* parent) : decaf::lang::Runnable(), parent(parent) {\\n\\n }\\n\\n\\n\\n virtual ~MediumInterruptedRunnable() {}\\n\\n\\n\\n virtual void run() {\\n\\n try {\\n\\n Thread::sleep(MEDIUM_DELAY_MS);\\n\\n parent->threadShouldThrow();\\n\\n } catch(decaf::lang::Exception& e) {\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/ExecutorsTestSupport.h\",\n \"rank\": 97,\n \"score\": 282189.39530217357\n },\n {\n \"content\": \" class FutureRunnable : public decaf::lang::Runnable {\\n\\n public:\\n\\n\\n\\n FutureRunnable() {\\n\\n }\\n\\n\\n\\n virtual ~FutureRunnable() {\\n\\n }\\n\\n\\n\\n virtual void run() {\\n\\n }\\n\\n };\\n\\n\\n\\n template<typename E>\\n\",\n \"file_path\": \"activemq-cpp/src/test/decaf/util/concurrent/FutureTaskTest.cpp\",\n \"rank\": 98,\n \"score\": 282189.3953021735\n },\n {\n \"content\": \" class ShutdownTask : public decaf::lang::Runnable {\\n\\n private:\\n\\n\\n\\n SocketFactory** defaultRef;\\n\\n\\n\\n private:\\n\\n\\n\\n ShutdownTask( const ShutdownTask& );\\n\\n ShutdownTask& operator= ( const ShutdownTask& );\\n\\n\\n\\n public:\\n\\n\\n\\n ShutdownTask( SocketFactory** defaultRef ) : defaultRef( defaultRef ) {}\\n\\n virtual ~ShutdownTask() {}\\n\\n\\n\\n virtual void run() {\\n\\n *defaultRef = NULL;\\n\\n }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"activemq-cpp/src/main/decaf/net/ssl/SSLSocketFactory.cpp\",\n \"rank\": 99,\n \"score\": 282189.3953021735\n }\n]","isConversational":false}}},{"rowIdx":471,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"PlayTools/mainwindow.cpp"},"repo_name":{"kind":"string","value":"memorywalker/playtools"},"commit":{"kind":"string","value":"39441f3df16484a0784a5cc3b62c57af049fdc52"},"file_code":{"kind":"string","value":"#include \"mainwindow.h\"\n#include \"firewallrules.h\"\n#include \"ui_mainwindow.h\"\n#include <Windows.h>\n#include \"AutoMate.h\"\n#include <QDebug>\n#include <QHotkey>\n#include <QSound>\n\nMainWindow::MainWindow(QWidget *parent)\n : QMainWindow(parent)\n , ui(new Ui::MainWindow)\n\t, m_nLuckwheelInteval(4000)\n{\n ui->setupUi(this);\n m_AutoMate = new AutoMate();\n m_AutoMate->SetWindow(this);\n\n m_GtaProcessPath = \"I:\\\\SteamLibrary\\\\steamapps\\\\common\\\\Grand Theft Auto V\\\\GTA5.exe\";\n m_firewallRules.SetActionListener(this);\n\n InitUI();\n}\n\nMainWindow::~MainWindow()\n{\n\tfor (size_t i = 0; i < FunctionType_Max; i++)\n\t{\n\t\tdelete m_FuncHotkeys[i];\n\t\tm_FuncHotkeys[i] = nullptr;\n\t}\n delete ui;\n}\n\nvoid MainWindow::InitUI()\n{\n\t\n\t\n\t\n\n\tQString strluckyWheelInteval = ui->lineEditLuckyWheelInteval->text();\n\tm_nLuckwheelInteval = strluckyWheelInteval.toInt();\n\t\n\tBindHotKeys();\n}\n\nvoid MainWindow::PlaySoundPrompt()\n{\n\tQSound::play(\"c:/Windows/media/tada.wav\");\n}\n\nvoid MainWindow::BindHotKeys()\n{\n\tfor (size_t i = 0; i < FunctionType_Max; i++)\n\t{\n\t\tm_FuncHotkeys[i] = new QHotkey(this);\n\t}\n\n\t\n\tQString strKey = ui->lineEditSolo->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Solo]->setShortcut(QKeySequence(strKey), true);\n\tQMetaObject::Connection conn = QObject::connect(m_FuncHotkeys[FunctionType_Solo], &QHotkey::activated, this, &MainWindow::on_soloButton_clicked);\n\tQ_ASSERT(conn);\n\n\t\n\tstrKey = ui->lineEditDisconnectProcess->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Disconnect]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Disconnect], &QHotkey::activated, this, &MainWindow::on_disconnectProcessButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditFingerPrint->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Finger]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Finger], &QHotkey::activated, this, &MainWindow::on_fingerPrintButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditLuckyWheel->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Lucky]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Lucky], &QHotkey::activated, this, &MainWindow::on_luckyWheelButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditDoomsDayII->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_DoomsDayII]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_DoomsDayII], &QHotkey::activated, this, &MainWindow::on_doomsDay2Button_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditDoomsDayIII->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_DoomsDayIII]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_DoomsDayIII], &QHotkey::activated, this, &MainWindow::on_doomsDay3Button_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditSnack->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Snack]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Snack], &QHotkey::activated, this, &MainWindow::on_snackButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditArmor->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Armor]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Armor], &QHotkey::activated, this, &MainWindow::on_amorButton_clicked);\n\tQ_ASSERT(conn);\n}\n\nvoid MainWindow::UnBindHotKeys()\n{\n\tbool bRet = QObject::disconnect(m_FuncHotkeys[FunctionType_Solo], &QHotkey::activated, this, &MainWindow::on_soloButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Disconnect], &QHotkey::activated, this, &MainWindow::on_disconnectProcessButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Finger], &QHotkey::activated, this, &MainWindow::on_fingerPrintButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Lucky], &QHotkey::activated, this, &MainWindow::on_luckyWheelButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_DoomsDayII], &QHotkey::activated, this, &MainWindow::on_doomsDay2Button_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_DoomsDayIII], &QHotkey::activated, this, &MainWindow::on_doomsDay3Button_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Snack], &QHotkey::activated, this, &MainWindow::on_snackButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Armor], &QHotkey::activated, this, &MainWindow::on_amorButton_clicked);\n\n\tfor (size_t i = 0; i < FunctionType_Max; i++)\n\t{\n\t\tdelete m_FuncHotkeys[i];\n\t\tm_FuncHotkeys[i] = nullptr;\n\t}\n}\n\nvoid MainWindow::OnActionDone(QString& strOut)\n{\n ui->labelPrompt->setText(strOut);\n\tPlaySoundPrompt();\n}\n\nvoid MainWindow::closeEvent(QCloseEvent* e)\n{\n\tm_firewallRules.StopProcessOffine();\n\tm_firewallRules.StopSinglePublicSession();\n}\n\nvoid MainWindow::on_snackButton_clicked()\n{\n\tPlaySoundPrompt();\n if (m_AutoMate)\n {\n m_AutoMate->SendSnackCmd();\n }\n}\n\nvoid MainWindow::on_amorButton_clicked()\n{\n\tPlaySoundPrompt();\n if (m_AutoMate) \n\t{\t\t\n m_AutoMate->SendArmorCmd();\n }\n}\n\nvoid MainWindow::on_soloButton_clicked()\n{\n\tPlaySoundPrompt();\n\tstatic bool switchOn = false;\n\tif (!switchOn)\n\t{\t\t\n\t\tm_firewallRules.StartSinglePublicSession();\n\t}\n\telse\n\t{\n\t\tm_firewallRules.StopSinglePublicSession();\n\t}\n\tswitchOn = !switchOn;\n\n\tif (switchOn)\n\t{\n\t\tui->soloButton->setStyleSheet(\"background-color: rgb(255, 0, 0)\");\n\t}\n\telse\n\t{\n\t\tui->soloButton->setStyleSheet(\"background-color: rgb(23, 135, 6)\");\n\t}\n}\n\nvoid MainWindow::on_disconnectProcessButton_clicked()\n{ \n\tPlaySoundPrompt();\n static bool switchOn = false;\n if (!switchOn)\n {\n m_firewallRules.StartProcessOffline(m_GtaProcessPath);\n }\n else\n {\n m_firewallRules.StopProcessOffine();\n }\n switchOn = !switchOn;\n \n if (switchOn)\n {\n ui->disconnectProcessButton->setStyleSheet(\"background-color: rgb(255, 0, 0)\");\n }\n else\n {\n ui->disconnectProcessButton->setStyleSheet(\"background-color: rgb(23, 135, 6)\");\n }\n}\n\nvoid MainWindow::on_fingerPrintButton_clicked()\n{\n\tPlaySoundPrompt();\n}\n\nvoid MainWindow::on_luckyWheelButton_clicked()\n{\n\tPlaySoundPrompt();\n\tif (m_AutoMate)\n\t{\n\t \tm_AutoMate->SendLuckyWheelCmd(m_nLuckwheelInteval);\n\t}\n}\n\nvoid MainWindow::on_doomsDay2Button_clicked()\n{\n\tPlaySoundPrompt();\n\tif (m_AutoMate)\n\t{\n\t\tm_AutoMate->SendDoomsDayIICmd();\n\t}\n}\n\nvoid MainWindow::on_doomsDay3Button_clicked()\n{\n\tPlaySoundPrompt();\n\tif (m_AutoMate)\n\t{\n\t\tm_AutoMate->SendDoomsDayIIICmd();\n\t}\n}\n\nvoid MainWindow::on_lineEditLuckyWheelInteval_textChanged(const QString &arg1)\n{\n\tQString strluckyWheelInteval = ui->lineEditLuckyWheelInteval->text();\n\tm_nLuckwheelInteval = strluckyWheelInteval.toInt();\n}\n\nvoid MainWindow::on_pushButtonSave_clicked()\n{\n\tUnBindHotKeys();\n\tBindHotKeys();\n}\n"},"prefix":{"kind":"string","value":"#include \"mainwindow.h\"\n#include \"firewallrules.h\"\n#include \"ui_mainwindow.h\"\n#include <Windows.h>\n#include \"AutoMate.h\"\n#include <QDebug>\n#include <QHotkey>\n#include <QSound>\n\nMainWindow::MainWindow(QWidget *parent)\n : QMainWindow(parent)\n , ui(new Ui::MainWindow)\n\t, m_nLuckwheelInteval(4000)\n{\n ui->setupUi(this);\n m_AutoMate = new AutoMate();\n m_AutoMate->SetWindow(this);\n\n m_GtaProcessPath = \"I:\\\\SteamLibrary\\\\steamapps\\\\common\\\\Grand Theft Auto V\\\\GTA5.exe\";\n m_firewallRules.SetActionListener(this);\n\n InitUI();\n}\n\nMainWindow::~MainWindow()\n{\n\tfor (size_t i = 0; i < FunctionType_Max; i++)\n\t{\n\t\tdelete m_FuncHotkeys[i];\n\t\tm_FuncHotkeys[i] = nullptr;\n\t}\n delete ui;\n}\n\nvoid MainWindow::InitUI()\n{\n\t\n\t\n\t\n\n\tQString strluckyWheelInteval = ui->lineEditLuckyWheelInteval->text();\n\tm_nLuckwheelInteval = strluckyWheelInteval.toInt();\n\t\n\tBindHotKeys();\n}\n\nvoid MainWindow::PlaySoundPrompt()\n{\n\tQSound::play(\"c:/Windows/media/tada.wav\");\n}\n\nvoid MainWindow::BindHotKeys()\n{\n\tfor (size_t i = 0; i < FunctionType_Max; i++)\n\t{\n\t\tm_FuncHotkeys[i] = new QHotkey(this);\n\t}\n\n\t\n\tQString strKey = ui->lineEditSolo->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Solo]->setShortcut(QKeySequence(strKey), true);\n\tQMetaObject::Connection conn = QObject::connect(m_FuncHotkeys[FunctionType_Solo], &QHotkey::activated, this, &MainWindow::on_soloButton_clicked);\n\tQ_ASSERT(conn);\n\n\t\n\tstrKey = ui->lineEditDisconnectProcess->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Disconnect]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Disconnect], &QHotkey::activated, this, &MainWindow::on_disconnectProcessButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditFingerPrint->text().trimmed().toLower();\n\tm"},"suffix":{"kind":"string","value":"m_firewallRules.StartProcessOffline(m_GtaProcessPath);\n }\n else\n {\n m_firewallRules.StopProcessOffine();\n }\n switchOn = !switchOn;\n \n if (switchOn)\n {\n ui->disconnectProcessButton->setStyleSheet(\"background-color: rgb(255, 0, 0)\");\n }\n else\n {\n ui->disconnectProcessButton->setStyleSheet(\"background-color: rgb(23, 135, 6)\");\n }\n}\n\nvoid MainWindow::on_fingerPrintButton_clicked()\n{\n\tPlaySoundPrompt();\n}\n\nvoid MainWindow::on_luckyWheelButton_clicked()\n{\n\tPlaySoundPrompt();\n\tif (m_AutoMate)\n\t{\n\t \tm_AutoMate->SendLuckyWheelCmd(m_nLuckwheelInteval);\n\t}\n}\n\nvoid MainWindow::on_doomsDay2Button_clicked()\n{\n\tPlaySoundPrompt();\n\tif (m_AutoMate)\n\t{\n\t\tm_AutoMate->SendDoomsDayIICmd();\n\t}\n}\n\nvoid MainWindow::on_doomsDay3Button_clicked()\n{\n\tPlaySoundPrompt();\n\tif (m_AutoMate)\n\t{\n\t\tm_AutoMate->SendDoomsDayIIICmd();\n\t}\n}\n\nvoid MainWindow::on_lineEditLuckyWheelInteval_textChanged(const QString &arg1)\n{\n\tQString strluckyWheelInteval = ui->lineEditLuckyWheelInteval->text();\n\tm_nLuckwheelInteval = strluckyWheelInteval.toInt();\n}\n\nvoid MainWindow::on_pushButtonSave_clicked()\n{\n\tUnBindHotKeys();\n\tBindHotKeys();\n}\n"},"middle":{"kind":"string","value":"_FuncHotkeys[FunctionType_Finger]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Finger], &QHotkey::activated, this, &MainWindow::on_fingerPrintButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditLuckyWheel->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Lucky]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Lucky], &QHotkey::activated, this, &MainWindow::on_luckyWheelButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditDoomsDayII->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_DoomsDayII]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_DoomsDayII], &QHotkey::activated, this, &MainWindow::on_doomsDay2Button_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditDoomsDayIII->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_DoomsDayIII]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_DoomsDayIII], &QHotkey::activated, this, &MainWindow::on_doomsDay3Button_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditSnack->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Snack]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Snack], &QHotkey::activated, this, &MainWindow::on_snackButton_clicked);\n\tQ_ASSERT(conn);\n\n\tstrKey = ui->lineEditArmor->text().trimmed().toLower();\n\tm_FuncHotkeys[FunctionType_Armor]->setShortcut(QKeySequence(strKey), true);\n\tconn = QObject::connect(m_FuncHotkeys[FunctionType_Armor], &QHotkey::activated, this, &MainWindow::on_amorButton_clicked);\n\tQ_ASSERT(conn);\n}\n\nvoid MainWindow::UnBindHotKeys()\n{\n\tbool bRet = QObject::disconnect(m_FuncHotkeys[FunctionType_Solo], &QHotkey::activated, this, &MainWindow::on_soloButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Disconnect], &QHotkey::activated, this, &MainWindow::on_disconnectProcessButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Finger], &QHotkey::activated, this, &MainWindow::on_fingerPrintButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Lucky], &QHotkey::activated, this, &MainWindow::on_luckyWheelButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_DoomsDayII], &QHotkey::activated, this, &MainWindow::on_doomsDay2Button_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_DoomsDayIII], &QHotkey::activated, this, &MainWindow::on_doomsDay3Button_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Snack], &QHotkey::activated, this, &MainWindow::on_snackButton_clicked);\n\n\tbRet &= QObject::disconnect(m_FuncHotkeys[FunctionType_Armor], &QHotkey::activated, this, &MainWindow::on_amorButton_clicked);\n\n\tfor (size_t i = 0; i < FunctionType_Max; i++)\n\t{\n\t\tdelete m_FuncHotkeys[i];\n\t\tm_FuncHotkeys[i] = nullptr;\n\t}\n}\n\nvoid MainWindow::OnActionDone(QString& strOut)\n{\n ui->labelPrompt->setText(strOut);\n\tPlaySoundPrompt();\n}\n\nvoid MainWindow::closeEvent(QCloseEvent* e)\n{\n\tm_firewallRules.StopProcessOffine();\n\tm_firewallRules.StopSinglePublicSession();\n}\n\nvoid MainWindow::on_snackButton_clicked()\n{\n\tPlaySoundPrompt();\n if (m_AutoMate)\n {\n m_AutoMate->SendSnackCmd();\n }\n}\n\nvoid MainWindow::on_amorButton_clicked()\n{\n\tPlaySoundPrompt();\n if (m_AutoMate) \n\t{\t\t\n m_AutoMate->SendArmorCmd();\n }\n}\n\nvoid MainWindow::on_soloButton_clicked()\n{\n\tPlaySoundPrompt();\n\tstatic bool switchOn = false;\n\tif (!switchOn)\n\t{\t\t\n\t\tm_firewallRules.StartSinglePublicSession();\n\t}\n\telse\n\t{\n\t\tm_firewallRules.StopSinglePublicSession();\n\t}\n\tswitchOn = !switchOn;\n\n\tif (switchOn)\n\t{\n\t\tui->soloButton->setStyleSheet(\"background-color: rgb(255, 0, 0)\");\n\t}\n\telse\n\t{\n\t\tui->soloButton->setStyleSheet(\"background-color: rgb(23, 135, 6)\");\n\t}\n}\n\nvoid MainWindow::on_disconnectProcessButton_clicked()\n{ \n\tPlaySoundPrompt();\n static bool switchOn = false;\n if (!switchOn)\n {\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class AutoMate\n\n{\n\npublic:\n\n\tAutoMate();\n\n\t~AutoMate();\n\n\n\n\tvoid SetWindow(QObject* qObj);\n\n\n\n\tvoid SendTestCommand();\n\n\n\n\tvoid SendSnackCmd();\n\n\tvoid SendArmorCmd();\n\n\tvoid SendDoomsDayIICmd();\n\n\tvoid SendDoomsDayIIICmd();\n\n\tvoid SendLuckyWheelCmd(int millisec);\n\n\tvoid SendFingerPrintCmd();\n\n\n\nprivate:\n\n\tconst static char MAX_KEY_COUNT = 3;\n\n\t// Press down and up with interval; 3 key for most\n","file_path":"PlayTools/AutoMate.h","rank":0,"score":31311.14421347797},{"content":"//! A class to define global, systemwide Hotkeys\n\nclass QHOTKEY_SHARED_EXPORT QHotkey : public QObject\n\n{\n\n\tQ_OBJECT\n\n\tfriend class QHotkeyPrivate;\n\n\n\n\t//! Specifies whether this hotkey is currently registered or not\n\n\tQ_PROPERTY(bool registered READ isRegistered WRITE setRegistered NOTIFY registeredChanged)\n\n\t//! Holds the shortcut this hotkey will be triggered on\n\n\tQ_PROPERTY(QKeySequence shortcut READ shortcut WRITE setShortcut RESET resetShortcut)\n\n\n\npublic:\n","file_path":"PlayTools/QHotkey/qhotkey.h","rank":1,"score":30433.28993149334},{"content":"class Ui_MainWindow\n\n{\n\npublic:\n\n QWidget *centralwidget;\n\n QVBoxLayout *verticalLayout;\n\n QVBoxLayout *rootlayout;\n\n QHBoxLayout *toplayout;\n\n QVBoxLayout *mainlayout;\n\n QHBoxLayout *horizontalLayout_2;\n\n QPushButton *soloButton;\n\n QLineEdit *lineEditSolo;\n\n QHBoxLayout *horizontalLayout_4;\n\n QPushButton *disconnectProcessButton;\n\n QLineEdit *lineEditDisconnectProcess;\n\n QHBoxLayout *horizontalLayout_5;\n\n QPushButton *fingerPrintButton;\n\n QLineEdit *lineEditFingerPrint;\n\n QHBoxLayout *horizontalLayout_6;\n\n QPushButton *luckyWheelButton;\n\n QLineEdit *lineEditLuckyWheel;\n","file_path":"PlayTools/ui_mainwindow.h","rank":2,"score":29785.557245892072},{"content":" class MainWindow: public Ui_MainWindow {};\n\n} // namespace Ui\n\n\n\nQT_END_NAMESPACE\n\n\n\n#endif // UI_MAINWINDOW_H\n","file_path":"PlayTools/ui_mainwindow.h","rank":3,"score":26806.856360440997},{"content":"\t//! Defines shortcut with native keycodes\n\n\tclass QHOTKEY_SHARED_EXPORT NativeShortcut {\n\n\tpublic:\n\n\t\t//! The native keycode\n\n\t\tquint32 key;\n\n\t\t//! The native modifiers\n\n\t\tquint32 modifier;\n\n\n\n\t\t//! Creates an invalid native shortcut\n\n\t\tNativeShortcut();\n\n\t\t//! Creates a valid native shortcut, with the given key and modifiers\n\n\t\tNativeShortcut(quint32 key, quint32 modifier = 0);\n\n\n\n\t\t//! Checks, whether this shortcut is valid or not\n\n\t\tbool isValid() const;\n\n\n\n\t\t//! Equality operator\n\n\t\tbool operator ==(const NativeShortcut &other) const;\n\n\t\t//! Inequality operator\n\n\t\tbool operator !=(const NativeShortcut &other) const;\n\n\n","file_path":"PlayTools/QHotkey/qhotkey.h","rank":4,"score":26034.75649491446},{"content":"\tvoid SendKeyInput(WORD* keylist, char num);\n\n\tvoid KeyPress(WORD keyCode, bool bUp = false);\n\n\tvoid KeyDown(WORD keyCode);\n\n\tvoid KeyUp(WORD keyCode);\n\n\tvoid KeyClick(WORD keyCode);\n\n\n\n\n\n\tQObject* m_MainWindow;\n\n};\n\n\n","file_path":"PlayTools/AutoMate.h","rank":5,"score":25865.679453435187},{"content":"#pragma once\n\n\n","file_path":"PlayTools/AutoMate.h","rank":6,"score":25861.870763970215},{"content":"/********************************************************************************\n\n** Form generated from reading UI file 'mainwindow.ui'\n\n**\n\n** Created by: Qt User Interface Compiler version 5.15.0\n\n**\n\n** WARNING! All changes made in this file will be lost when recompiling UI file!\n\n********************************************************************************/\n\n\n\n#ifndef UI_MAINWINDOW_H\n\n#define UI_MAINWINDOW_H\n\n\n\n#include <QtCore/QVariant>\n\n#include <QtWidgets/QApplication>\n\n#include <QtWidgets/QHBoxLayout>\n\n#include <QtWidgets/QLabel>\n\n#include <QtWidgets/QLineEdit>\n\n#include <QtWidgets/QMainWindow>\n\n#include <QtWidgets/QMenuBar>\n\n#include <QtWidgets/QPushButton>\n\n#include <QtWidgets/QSpacerItem>\n\n#include <QtWidgets/QStatusBar>\n\n#include <QtWidgets/QVBoxLayout>\n\n#include <QtWidgets/QWidget>\n\n\n\nQT_BEGIN_NAMESPACE\n\n\n","file_path":"PlayTools/ui_mainwindow.h","rank":7,"score":25555.152935189013},{"content":" lineEditSnack->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+Alt+E\", nullptr));\n\n amorButton->setText(QCoreApplication::translate(\"MainWindow\", \"Armor\", nullptr));\n\n lineEditArmor->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+Alt+C\", nullptr));\n\n pushButtonSave->setText(QCoreApplication::translate(\"MainWindow\", \"Save\", nullptr));\n\n pushButton_2->setText(QCoreApplication::translate(\"MainWindow\", \"PushButton\", nullptr));\n\n labelPrompt->setText(QCoreApplication::translate(\"MainWindow\", \"Prompt\", nullptr));\n\n labelInfo->setText(QCoreApplication::translate(\"MainWindow\", \"Ver 0.1\", nullptr));\n\n } // retranslateUi\n\n\n\n};\n\n\n\nnamespace Ui {\n","file_path":"PlayTools/ui_mainwindow.h","rank":8,"score":25553.739088693394},{"content":" QHBoxLayout *bottomlayout;\n\n QMenuBar *menubar;\n\n QStatusBar *statusbar;\n\n\n\n void setupUi(QMainWindow *MainWindow)\n\n {\n\n if (MainWindow->objectName().isEmpty())\n\n MainWindow->setObjectName(QString::fromUtf8(\"MainWindow\"));\n\n MainWindow->resize(441, 666);\n\n centralwidget = new QWidget(MainWindow);\n\n centralwidget->setObjectName(QString::fromUtf8(\"centralwidget\"));\n\n verticalLayout = new QVBoxLayout(centralwidget);\n\n verticalLayout->setObjectName(QString::fromUtf8(\"verticalLayout\"));\n\n rootlayout = new QVBoxLayout();\n\n rootlayout->setObjectName(QString::fromUtf8(\"rootlayout\"));\n\n toplayout = new QHBoxLayout();\n\n toplayout->setObjectName(QString::fromUtf8(\"toplayout\"));\n\n\n\n rootlayout->addLayout(toplayout);\n\n\n","file_path":"PlayTools/ui_mainwindow.h","rank":9,"score":25553.569340463375},{"content":" } // setupUi\n\n\n\n void retranslateUi(QMainWindow *MainWindow)\n\n {\n\n MainWindow->setWindowTitle(QCoreApplication::translate(\"MainWindow\", \"Play Tools\", nullptr));\n\n soloButton->setText(QCoreApplication::translate(\"MainWindow\", \"Solo\", nullptr));\n\n lineEditSolo->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+Alt+S\", nullptr));\n\n disconnectProcessButton->setText(QCoreApplication::translate(\"MainWindow\", \"Disconnect Process\", nullptr));\n\n lineEditDisconnectProcess->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+Alt+O\", nullptr));\n\n fingerPrintButton->setText(QCoreApplication::translate(\"MainWindow\", \"FingerPrint\", nullptr));\n\n lineEditFingerPrint->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+P\", nullptr));\n\n luckyWheelButton->setText(QCoreApplication::translate(\"MainWindow\", \"Lucky Wheel\", nullptr));\n\n lineEditLuckyWheel->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+E\", nullptr));\n\n labelLuckWheel->setText(QCoreApplication::translate(\"MainWindow\", \"Inteval(ms)\", nullptr));\n\n lineEditLuckyWheelInteval->setText(QCoreApplication::translate(\"MainWindow\", \"4125\", nullptr));\n\n doomsDay2Button->setText(QCoreApplication::translate(\"MainWindow\", \"DoomsDay II\", nullptr));\n\n lineEditDoomsDayII->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+F2\", nullptr));\n\n doomsDay3Button->setText(QCoreApplication::translate(\"MainWindow\", \"DoomsDay III\", nullptr));\n\n lineEditDoomsDayIII->setText(QCoreApplication::translate(\"MainWindow\", \"Ctrl+F3\", nullptr));\n\n snackButton->setText(QCoreApplication::translate(\"MainWindow\", \"Sancks\", nullptr));\n","file_path":"PlayTools/ui_mainwindow.h","rank":10,"score":25553.482563925896},{"content":"\n\n mainlayout->addItem(verticalSpacer);\n\n\n\n labelPrompt = new QLabel(centralwidget);\n\n labelPrompt->setObjectName(QString::fromUtf8(\"labelPrompt\"));\n\n QFont font2;\n\n font2.setFamily(QString::fromUtf8(\"\\345\\276\\256\\350\\275\\257\\351\\233\\205\\351\\273\\221\"));\n\n labelPrompt->setFont(font2);\n\n\n\n mainlayout->addWidget(labelPrompt);\n\n\n\n labelInfo = new QLabel(centralwidget);\n\n labelInfo->setObjectName(QString::fromUtf8(\"labelInfo\"));\n\n QFont font3;\n\n font3.setFamily(QString::fromUtf8(\"Arial\"));\n\n font3.setPointSize(12);\n\n font3.setBold(true);\n\n font3.setWeight(75);\n\n labelInfo->setFont(font3);\n\n\n","file_path":"PlayTools/ui_mainwindow.h","rank":11,"score":25551.783101603975},{"content":" rootlayout->addLayout(bottomlayout);\n\n\n\n rootlayout->setStretch(0, 1);\n\n rootlayout->setStretch(1, 16);\n\n rootlayout->setStretch(2, 1);\n\n\n\n verticalLayout->addLayout(rootlayout);\n\n\n\n MainWindow->setCentralWidget(centralwidget);\n\n menubar = new QMenuBar(MainWindow);\n\n menubar->setObjectName(QString::fromUtf8(\"menubar\"));\n\n menubar->setGeometry(QRect(0, 0, 441, 21));\n\n MainWindow->setMenuBar(menubar);\n\n statusbar = new QStatusBar(MainWindow);\n\n statusbar->setObjectName(QString::fromUtf8(\"statusbar\"));\n\n MainWindow->setStatusBar(statusbar);\n\n\n\n retranslateUi(MainWindow);\n\n\n\n QMetaObject::connectSlotsByName(MainWindow);\n","file_path":"PlayTools/ui_mainwindow.h","rank":12,"score":25551.77516264384},{"content":" mainlayout = new QVBoxLayout();\n\n mainlayout->setObjectName(QString::fromUtf8(\"mainlayout\"));\n\n horizontalLayout_2 = new QHBoxLayout();\n\n horizontalLayout_2->setObjectName(QString::fromUtf8(\"horizontalLayout_2\"));\n\n horizontalLayout_2->setSizeConstraint(QLayout::SetFixedSize);\n\n soloButton = new QPushButton(centralwidget);\n\n soloButton->setObjectName(QString::fromUtf8(\"soloButton\"));\n\n QSizePolicy sizePolicy(QSizePolicy::Preferred, QSizePolicy::Preferred);\n\n sizePolicy.setHorizontalStretch(0);\n\n sizePolicy.setVerticalStretch(0);\n\n sizePolicy.setHeightForWidth(soloButton->sizePolicy().hasHeightForWidth());\n\n soloButton->setSizePolicy(sizePolicy);\n\n QFont font;\n\n font.setFamily(QString::fromUtf8(\"Arial\"));\n\n font.setPointSize(10);\n\n font.setBold(true);\n\n font.setWeight(75);\n\n soloButton->setFont(font);\n\n soloButton->setFocusPolicy(Qt::StrongFocus);\n\n soloButton->setStyleSheet(QString::fromUtf8(\"background-color: rgb(23, 135, 6);\"));\n","file_path":"PlayTools/ui_mainwindow.h","rank":13,"score":25551.234320690757},{"content":"\n\n horizontalLayout_2->addWidget(soloButton);\n\n\n\n lineEditSolo = new QLineEdit(centralwidget);\n\n lineEditSolo->setObjectName(QString::fromUtf8(\"lineEditSolo\"));\n\n QSizePolicy sizePolicy1(QSizePolicy::Expanding, QSizePolicy::Preferred);\n\n sizePolicy1.setHorizontalStretch(0);\n\n sizePolicy1.setVerticalStretch(0);\n\n sizePolicy1.setHeightForWidth(lineEditSolo->sizePolicy().hasHeightForWidth());\n\n lineEditSolo->setSizePolicy(sizePolicy1);\n\n QFont font1;\n\n font1.setFamily(QString::fromUtf8(\"Arial\"));\n\n font1.setPointSize(11);\n\n font1.setBold(true);\n\n font1.setWeight(75);\n\n lineEditSolo->setFont(font1);\n\n\n\n horizontalLayout_2->addWidget(lineEditSolo);\n\n\n\n horizontalLayout_2->setStretch(0, 1);\n","file_path":"PlayTools/ui_mainwindow.h","rank":14,"score":25550.547946993058},{"content":"\n\n lineEditArmor = new QLineEdit(centralwidget);\n\n lineEditArmor->setObjectName(QString::fromUtf8(\"lineEditArmor\"));\n\n sizePolicy1.setHeightForWidth(lineEditArmor->sizePolicy().hasHeightForWidth());\n\n lineEditArmor->setSizePolicy(sizePolicy1);\n\n lineEditArmor->setFont(font1);\n\n\n\n horizontalLayout_3->addWidget(lineEditArmor);\n\n\n\n horizontalLayout_3->setStretch(0, 1);\n\n horizontalLayout_3->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_3);\n\n\n\n horizontalLayout_11 = new QHBoxLayout();\n\n horizontalLayout_11->setObjectName(QString::fromUtf8(\"horizontalLayout_11\"));\n\n pushButtonSave = new QPushButton(centralwidget);\n\n pushButtonSave->setObjectName(QString::fromUtf8(\"pushButtonSave\"));\n\n QSizePolicy sizePolicy2(QSizePolicy::Minimum, QSizePolicy::Preferred);\n\n sizePolicy2.setHorizontalStretch(0);\n","file_path":"PlayTools/ui_mainwindow.h","rank":15,"score":25550.401684122702},{"content":" horizontalLayout_5->addWidget(fingerPrintButton);\n\n\n\n lineEditFingerPrint = new QLineEdit(centralwidget);\n\n lineEditFingerPrint->setObjectName(QString::fromUtf8(\"lineEditFingerPrint\"));\n\n sizePolicy1.setHeightForWidth(lineEditFingerPrint->sizePolicy().hasHeightForWidth());\n\n lineEditFingerPrint->setSizePolicy(sizePolicy1);\n\n lineEditFingerPrint->setFont(font1);\n\n\n\n horizontalLayout_5->addWidget(lineEditFingerPrint);\n\n\n\n horizontalLayout_5->setStretch(0, 1);\n\n horizontalLayout_5->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_5);\n\n\n\n horizontalLayout_6 = new QHBoxLayout();\n\n horizontalLayout_6->setObjectName(QString::fromUtf8(\"horizontalLayout_6\"));\n\n horizontalLayout_6->setSizeConstraint(QLayout::SetDefaultConstraint);\n\n luckyWheelButton = new QPushButton(centralwidget);\n\n luckyWheelButton->setObjectName(QString::fromUtf8(\"luckyWheelButton\"));\n","file_path":"PlayTools/ui_mainwindow.h","rank":16,"score":25550.348689056384},{"content":" horizontalLayout_7->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_7);\n\n\n\n horizontalLayout = new QHBoxLayout();\n\n horizontalLayout->setObjectName(QString::fromUtf8(\"horizontalLayout\"));\n\n horizontalLayout->setSizeConstraint(QLayout::SetDefaultConstraint);\n\n snackButton = new QPushButton(centralwidget);\n\n snackButton->setObjectName(QString::fromUtf8(\"snackButton\"));\n\n sizePolicy.setHeightForWidth(snackButton->sizePolicy().hasHeightForWidth());\n\n snackButton->setSizePolicy(sizePolicy);\n\n snackButton->setFont(font);\n\n snackButton->setFocusPolicy(Qt::StrongFocus);\n\n\n\n horizontalLayout->addWidget(snackButton);\n\n\n\n lineEditSnack = new QLineEdit(centralwidget);\n\n lineEditSnack->setObjectName(QString::fromUtf8(\"lineEditSnack\"));\n\n sizePolicy1.setHeightForWidth(lineEditSnack->sizePolicy().hasHeightForWidth());\n\n lineEditSnack->setSizePolicy(sizePolicy1);\n","file_path":"PlayTools/ui_mainwindow.h","rank":17,"score":25550.323083656323},{"content":"\n\n lineEditLuckyWheelInteval = new QLineEdit(centralwidget);\n\n lineEditLuckyWheelInteval->setObjectName(QString::fromUtf8(\"lineEditLuckyWheelInteval\"));\n\n sizePolicy1.setHeightForWidth(lineEditLuckyWheelInteval->sizePolicy().hasHeightForWidth());\n\n lineEditLuckyWheelInteval->setSizePolicy(sizePolicy1);\n\n lineEditLuckyWheelInteval->setFont(font);\n\n lineEditLuckyWheelInteval->setAlignment(Qt::AlignCenter);\n\n\n\n horizontalLayout_6->addWidget(lineEditLuckyWheelInteval);\n\n\n\n horizontalLayout_6->setStretch(0, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_6);\n\n\n\n horizontalLayout_8 = new QHBoxLayout();\n\n horizontalLayout_8->setObjectName(QString::fromUtf8(\"horizontalLayout_8\"));\n\n horizontalLayout_8->setSizeConstraint(QLayout::SetDefaultConstraint);\n\n doomsDay2Button = new QPushButton(centralwidget);\n\n doomsDay2Button->setObjectName(QString::fromUtf8(\"doomsDay2Button\"));\n\n sizePolicy.setHeightForWidth(doomsDay2Button->sizePolicy().hasHeightForWidth());\n","file_path":"PlayTools/ui_mainwindow.h","rank":18,"score":25550.203219563668},{"content":" horizontalLayout_2->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_2);\n\n\n\n horizontalLayout_4 = new QHBoxLayout();\n\n horizontalLayout_4->setObjectName(QString::fromUtf8(\"horizontalLayout_4\"));\n\n horizontalLayout_4->setSizeConstraint(QLayout::SetDefaultConstraint);\n\n disconnectProcessButton = new QPushButton(centralwidget);\n\n disconnectProcessButton->setObjectName(QString::fromUtf8(\"disconnectProcessButton\"));\n\n sizePolicy.setHeightForWidth(disconnectProcessButton->sizePolicy().hasHeightForWidth());\n\n disconnectProcessButton->setSizePolicy(sizePolicy);\n\n disconnectProcessButton->setFont(font);\n\n disconnectProcessButton->setFocusPolicy(Qt::StrongFocus);\n\n disconnectProcessButton->setStyleSheet(QString::fromUtf8(\"background-color: rgb(23, 135, 6);\"));\n\n\n\n horizontalLayout_4->addWidget(disconnectProcessButton);\n\n\n\n lineEditDisconnectProcess = new QLineEdit(centralwidget);\n\n lineEditDisconnectProcess->setObjectName(QString::fromUtf8(\"lineEditDisconnectProcess\"));\n\n sizePolicy1.setHeightForWidth(lineEditDisconnectProcess->sizePolicy().hasHeightForWidth());\n","file_path":"PlayTools/ui_mainwindow.h","rank":19,"score":25550.195679911343},{"content":" lineEditSnack->setFont(font1);\n\n\n\n horizontalLayout->addWidget(lineEditSnack);\n\n\n\n horizontalLayout->setStretch(0, 1);\n\n horizontalLayout->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout);\n\n\n\n horizontalLayout_3 = new QHBoxLayout();\n\n horizontalLayout_3->setObjectName(QString::fromUtf8(\"horizontalLayout_3\"));\n\n horizontalLayout_3->setSizeConstraint(QLayout::SetDefaultConstraint);\n\n amorButton = new QPushButton(centralwidget);\n\n amorButton->setObjectName(QString::fromUtf8(\"amorButton\"));\n\n sizePolicy.setHeightForWidth(amorButton->sizePolicy().hasHeightForWidth());\n\n amorButton->setSizePolicy(sizePolicy);\n\n amorButton->setFont(font);\n\n amorButton->setFocusPolicy(Qt::StrongFocus);\n\n\n\n horizontalLayout_3->addWidget(amorButton);\n","file_path":"PlayTools/ui_mainwindow.h","rank":20,"score":25550.05344826466},{"content":" sizePolicy2.setVerticalStretch(0);\n\n sizePolicy2.setHeightForWidth(pushButtonSave->sizePolicy().hasHeightForWidth());\n\n pushButtonSave->setSizePolicy(sizePolicy2);\n\n pushButtonSave->setFont(font);\n\n\n\n horizontalLayout_11->addWidget(pushButtonSave);\n\n\n\n pushButton_2 = new QPushButton(centralwidget);\n\n pushButton_2->setObjectName(QString::fromUtf8(\"pushButton_2\"));\n\n sizePolicy2.setHeightForWidth(pushButton_2->sizePolicy().hasHeightForWidth());\n\n pushButton_2->setSizePolicy(sizePolicy2);\n\n\n\n horizontalLayout_11->addWidget(pushButton_2);\n\n\n\n horizontalLayout_11->setStretch(0, 1);\n\n horizontalLayout_11->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_11);\n\n\n\n verticalSpacer = new QSpacerItem(20, 36, QSizePolicy::Minimum, QSizePolicy::Expanding);\n","file_path":"PlayTools/ui_mainwindow.h","rank":21,"score":25550.05344826466},{"content":" doomsDay2Button->setSizePolicy(sizePolicy);\n\n doomsDay2Button->setFont(font);\n\n doomsDay2Button->setFocusPolicy(Qt::StrongFocus);\n\n\n\n horizontalLayout_8->addWidget(doomsDay2Button);\n\n\n\n lineEditDoomsDayII = new QLineEdit(centralwidget);\n\n lineEditDoomsDayII->setObjectName(QString::fromUtf8(\"lineEditDoomsDayII\"));\n\n sizePolicy1.setHeightForWidth(lineEditDoomsDayII->sizePolicy().hasHeightForWidth());\n\n lineEditDoomsDayII->setSizePolicy(sizePolicy1);\n\n lineEditDoomsDayII->setFont(font1);\n\n\n\n horizontalLayout_8->addWidget(lineEditDoomsDayII);\n\n\n\n horizontalLayout_8->setStretch(0, 1);\n\n horizontalLayout_8->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_8);\n\n\n\n horizontalLayout_7 = new QHBoxLayout();\n","file_path":"PlayTools/ui_mainwindow.h","rank":22,"score":25549.959930873683},{"content":" lineEditDisconnectProcess->setSizePolicy(sizePolicy1);\n\n lineEditDisconnectProcess->setFont(font1);\n\n\n\n horizontalLayout_4->addWidget(lineEditDisconnectProcess);\n\n\n\n horizontalLayout_4->setStretch(0, 1);\n\n horizontalLayout_4->setStretch(1, 1);\n\n\n\n mainlayout->addLayout(horizontalLayout_4);\n\n\n\n horizontalLayout_5 = new QHBoxLayout();\n\n horizontalLayout_5->setObjectName(QString::fromUtf8(\"horizontalLayout_5\"));\n\n horizontalLayout_5->setSizeConstraint(QLayout::SetDefaultConstraint);\n\n fingerPrintButton = new QPushButton(centralwidget);\n\n fingerPrintButton->setObjectName(QString::fromUtf8(\"fingerPrintButton\"));\n\n sizePolicy.setHeightForWidth(fingerPrintButton->sizePolicy().hasHeightForWidth());\n\n fingerPrintButton->setSizePolicy(sizePolicy);\n\n fingerPrintButton->setFont(font);\n\n fingerPrintButton->setFocusPolicy(Qt::StrongFocus);\n\n\n","file_path":"PlayTools/ui_mainwindow.h","rank":23,"score":25549.94227423583},{"content":" mainlayout->addWidget(labelInfo);\n\n\n\n mainlayout->setStretch(0, 1);\n\n mainlayout->setStretch(1, 1);\n\n mainlayout->setStretch(2, 1);\n\n mainlayout->setStretch(3, 1);\n\n mainlayout->setStretch(4, 1);\n\n mainlayout->setStretch(5, 1);\n\n mainlayout->setStretch(6, 1);\n\n mainlayout->setStretch(7, 1);\n\n mainlayout->setStretch(8, 1);\n\n mainlayout->setStretch(9, 1);\n\n mainlayout->setStretch(10, 1);\n\n mainlayout->setStretch(11, 1);\n\n\n\n rootlayout->addLayout(mainlayout);\n\n\n\n bottomlayout = new QHBoxLayout();\n\n bottomlayout->setObjectName(QString::fromUtf8(\"bottomlayout\"));\n\n\n","file_path":"PlayTools/ui_mainwindow.h","rank":24,"score":25549.854142574684},{"content":" sizePolicy.setHeightForWidth(luckyWheelButton->sizePolicy().hasHeightForWidth());\n\n luckyWheelButton->setSizePolicy(sizePolicy);\n\n luckyWheelButton->setFont(font);\n\n luckyWheelButton->setFocusPolicy(Qt::StrongFocus);\n\n\n\n horizontalLayout_6->addWidget(luckyWheelButton);\n\n\n\n lineEditLuckyWheel = new QLineEdit(centralwidget);\n\n lineEditLuckyWheel->setObjectName(QString::fromUtf8(\"lineEditLuckyWheel\"));\n\n sizePolicy1.setHeightForWidth(lineEditLuckyWheel->sizePolicy().hasHeightForWidth());\n\n lineEditLuckyWheel->setSizePolicy(sizePolicy1);\n\n lineEditLuckyWheel->setFont(font1);\n\n\n\n horizontalLayout_6->addWidget(lineEditLuckyWheel);\n\n\n\n labelLuckWheel = new QLabel(centralwidget);\n\n labelLuckWheel->setObjectName(QString::fromUtf8(\"labelLuckWheel\"));\n\n labelLuckWheel->setFont(font);\n\n\n\n horizontalLayout_6->addWidget(labelLuckWheel);\n","file_path":"PlayTools/ui_mainwindow.h","rank":25,"score":25549.81205656967},{"content":" horizontalLayout_7->setObjectName(QString::fromUtf8(\"horizontalLayout_7\"));\n\n horizontalLayout_7->setSizeConstraint(QLayout::SetDefaultConstraint);\n\n doomsDay3Button = new QPushButton(centralwidget);\n\n doomsDay3Button->setObjectName(QString::fromUtf8(\"doomsDay3Button\"));\n\n sizePolicy.setHeightForWidth(doomsDay3Button->sizePolicy().hasHeightForWidth());\n\n doomsDay3Button->setSizePolicy(sizePolicy);\n\n doomsDay3Button->setFont(font);\n\n doomsDay3Button->setFocusPolicy(Qt::StrongFocus);\n\n\n\n horizontalLayout_7->addWidget(doomsDay3Button);\n\n\n\n lineEditDoomsDayIII = new QLineEdit(centralwidget);\n\n lineEditDoomsDayIII->setObjectName(QString::fromUtf8(\"lineEditDoomsDayIII\"));\n\n sizePolicy1.setHeightForWidth(lineEditDoomsDayIII->sizePolicy().hasHeightForWidth());\n\n lineEditDoomsDayIII->setSizePolicy(sizePolicy1);\n\n lineEditDoomsDayIII->setFont(font1);\n\n\n\n horizontalLayout_7->addWidget(lineEditDoomsDayIII);\n\n\n\n horizontalLayout_7->setStretch(0, 1);\n","file_path":"PlayTools/ui_mainwindow.h","rank":26,"score":25549.679123929003},{"content":" QLabel *labelLuckWheel;\n\n QLineEdit *lineEditLuckyWheelInteval;\n\n QHBoxLayout *horizontalLayout_8;\n\n QPushButton *doomsDay2Button;\n\n QLineEdit *lineEditDoomsDayII;\n\n QHBoxLayout *horizontalLayout_7;\n\n QPushButton *doomsDay3Button;\n\n QLineEdit *lineEditDoomsDayIII;\n\n QHBoxLayout *horizontalLayout;\n\n QPushButton *snackButton;\n\n QLineEdit *lineEditSnack;\n\n QHBoxLayout *horizontalLayout_3;\n\n QPushButton *amorButton;\n\n QLineEdit *lineEditArmor;\n\n QHBoxLayout *horizontalLayout_11;\n\n QPushButton *pushButtonSave;\n\n QPushButton *pushButton_2;\n\n QSpacerItem *verticalSpacer;\n\n QLabel *labelPrompt;\n\n QLabel *labelInfo;\n","file_path":"PlayTools/ui_mainwindow.h","rank":27,"score":25548.067146302317},{"content":"#include <Windows.h>\n\n#include \"AutoMate.h\"\n\n#include <QKeyEvent>\n\n#include <QCoreApplication>\n\n\n\n#include \"mainwindow.h\"\n\n\n\n// \n\nstatic const int KEY_PRESS_INTERVAL = 300;\n\n\n\nAutoMate::AutoMate():m_MainWindow(nullptr)\n\n{\n\n\n\n}\n\n\n\n\n\nAutoMate::~AutoMate()\n\n{\n\n}\n\n\n","file_path":"PlayTools/AutoMate.cpp","rank":28,"score":24327.17434815405},{"content":"}\n\n\n\nvoid AutoMate::KeyUp(WORD keyCode)\n\n{\n\n\tKeyPress(keyCode, true);\n\n}\n\n\n\nvoid AutoMate::KeyClick(WORD keyCode)\n\n{\n\n\tKeyPress(keyCode);\n\n\tSleep(100);\n\n\tKeyPress(keyCode, true);\n\n}\n\n\n\nvoid AutoMate::SendTestCommand()\n\n{\n\n\tSleep(KEY_PRESS_INTERVAL);\n\n\n\n\tint sleepTime = 100;\n\n\n","file_path":"PlayTools/AutoMate.cpp","rank":29,"score":24326.22542566198},{"content":"\n\nvoid AutoMate::SendDoomsDayIIICmd()\n\n{\n\n\tSleep(KEY_PRESS_INTERVAL);\n\n\n\n\tKeyDown(VK_SPACE);\n\n\tSleep(60);\n\n\tKeyDown('D');\n\n\tSleep(20);\n\n\tKeyDown('S');\n\n\tSleep(20);\n\n\tKeyUp(VK_SPACE);\n\n\tSleep(40);\n\n\tKeyUp('D');\n\n\tSleep(20);\n\n\tKeyUp('S');\n\n}\n\n\n\nvoid AutoMate::SendLuckyWheelCmd(int millisec)\n\n{\n","file_path":"PlayTools/AutoMate.cpp","rank":30,"score":24322.614790764186},{"content":"void AutoMate::SetWindow(QObject* qObj)\n\n{\n\n\tm_MainWindow = qObj;\n\n}\n\n\n\n\n\n\n\nvoid AutoMate::SendSnackCmd()\n\n{\n\n\t//keybd_event(VK_TAB, 0, 0, 0);\n\n\t//keybd_event(VK_TAB, 0, KEYEVENTF_KEYUP, 0);\n\n\n\n\t//keybd_event(VK_LSHIFT, 0, 0, 0);\n\n\t//keybd_event('M', 0, 0, 0);\n\n\n\n\t//keybd_event(VK_LSHIFT, 0, KEYEVENTF_KEYUP, 0);\n\n\t//keybd_event('M', 0, KEYEVENTF_KEYUP, 0);\n\n\n\n\t//// press down ctrl+A at the same time\n\n\t//keybd_event(VK_CONTROL, 0, 0, 0);\n","file_path":"PlayTools/AutoMate.cpp","rank":31,"score":24322.108782016112},{"content":"\tSleep(KEY_PRESS_INTERVAL);\n\n\n\n\tKeyClick('E');\n\n\tSleep(millisec);\n\n\tKeyClick('S');\n\n}\n\n\n\nvoid AutoMate::SendFingerPrintCmd()\n\n{\n\n}\n\n\n\nvoid AutoMate::KeyPress(WORD keyCode, bool bUp /*= false*/)\n\n{\n\n\tINPUT input;\n\n\tmemset(&input, 0, sizeof(input));\n\n\n\n\tinput.type = INPUT_KEYBOARD;\n\n\tinput.ki.dwExtraInfo = GetMessageExtraInfo();\n\n\t// for DirectInput App, use scan code instead of Virtual code\n\n\tinput.ki.wScan = static_cast<WORD>(MapVirtualKeyEx(keyCode, MAPVK_VK_TO_VSC, GetKeyboardLayout(0)));\n","file_path":"PlayTools/AutoMate.cpp","rank":32,"score":24321.45448002296},{"content":"\n\n\tfor (size_t i = 0; i < ARRAYSIZE(keySeq); i++)\n\n\t{\n\n\t\tKeyClick(keySeq[i]);\n\n\t\tSleep(50);\n\n\t}\n\n}\n\n\n\nvoid AutoMate::SendDoomsDayIICmd()\n\n{\n\n\tSleep(KEY_PRESS_INTERVAL);\n\n\n\n\tKeyDown(VK_SPACE);\n\n\tSleep(500);\n\n\tKeyDown('D');\n\n\tSleep(30);\n\n\tKeyUp(VK_SPACE);\n\n\tSleep(10);\n\n\tKeyUp('D');\n\n}\n","file_path":"PlayTools/AutoMate.cpp","rank":33,"score":24321.281571140767},{"content":"\t//keybd_event('A', 0, 0, 0);\n\n\n\n\t//Sleep(KEY_PRESS_INTERVAL);\n\n\n\n\t//// press up ctrl+A at the same time\n\n\t//keybd_event(VK_CONTROL, 0, KEYEVENTF_KEYUP, 0);\n\n\t//keybd_event('A', 0, KEYEVENTF_KEYUP, 0);\n\n\n\n\tSleep(KEY_PRESS_INTERVAL);\n\n\n\n\tWORD keySeq[] = { 'M', VK_DOWN, VK_DOWN, VK_RETURN, VK_DOWN, VK_DOWN, VK_RETURN, VK_RETURN, VK_ESCAPE, VK_ESCAPE, VK_ESCAPE };\n\n\n\n\tfor (size_t i = 0; i < ARRAYSIZE(keySeq); i++)\n\n\t{\n\n\t\tKeyClick(keySeq[i]);\n\n\t\tSleep(50);\n\n\t}\t\n\n}\n\n\n\nvoid AutoMate::SendArmorCmd()\n","file_path":"PlayTools/AutoMate.cpp","rank":34,"score":24320.325305477665},{"content":"\t// Specifies various aspects of a keystroke.This member can be certain combinations of the following values.\n\n\tDWORD dwFlags = KEYEVENTF_SCANCODE;\n\n\tif (bUp)\n\n\t{\n\n\t\tdwFlags |= KEYEVENTF_KEYUP;\n\n\t}\n\n\tif (VK_LEFT<=keyCode&&keyCode<=VK_DOWN)\n\n\t{\n\n\t\tdwFlags |= KEYEVENTF_EXTENDEDKEY;\n\n\t}\n\n\tinput.ki.dwFlags = dwFlags;\n\n\t// The time stamp for the event, in milliseconds. If this parameter is zero, the system will provide its own time stamp.\n\n\tinput.ki.time = 0;\n\n\n\n\tSendInput(1, &input, sizeof(INPUT));\n\n}\n\n\n\nvoid AutoMate::KeyDown(WORD keyCode)\n\n{\n\n\tKeyPress(keyCode);\n","file_path":"PlayTools/AutoMate.cpp","rank":35,"score":24320.091208424983},{"content":"\tWORD key = 'W';\n\n\tfor (int i = 0; i < 5; i++)\n\n\t{\n\n\t\tKeyPress(key);\n\n\t\tSleep(sleepTime);\n\n\t\tKeyPress(key, true);\n\n\t\tSleep(sleepTime);\n\n\t}\n\n\t\n\n\tkey = 'A';\n\n\tKeyPress(key);\n\n\tSleep(sleepTime);\n\n\tKeyPress(key, true);\n\n\t\n\n}\n","file_path":"PlayTools/AutoMate.cpp","rank":36,"score":24320.008683259388},{"content":"{\n\n\t//QKeyEvent keyTab(QEvent::KeyPress, Qt::Key_Tab, Qt::NoModifier);\n\n\t//QKeyEvent keyM(QEvent::KeyPress, Qt::Key_M, Qt::ShiftModifier);\n\n\n\n\t//QCoreApplication::sendEvent(m_MainWindow, &keyTab);\n\n\t//QCoreApplication::sendEvent(m_MainWindow, &keyM);\n\n\n\n\t//WORD tab = VK_TAB;\n\n\t//SendKeyInput(&tab, 1);\n\n\n\n\t//WORD combine[2] = { VK_LSHIFT, 'K' };\n\n\t//SendKeyInput(combine, 2);\n\n\n\n\t//WORD combine2[2] = { VK_CONTROL, 'A' };\n\n\t//SendKeyInput(combine2, 2);\n\n\n\n\tSleep(KEY_PRESS_INTERVAL);\n\n\n\n\tWORD keySeq[] = { 'M', VK_DOWN, VK_DOWN, VK_RETURN, VK_DOWN, VK_RETURN, \n\n\t\tVK_DOWN, VK_DOWN, VK_DOWN, VK_DOWN, VK_RETURN, VK_ESCAPE, VK_ESCAPE, VK_ESCAPE };\n","file_path":"PlayTools/AutoMate.cpp","rank":37,"score":24316.799613428193},{"content":"class AutoMate;\n","file_path":"PlayTools/mainwindow.h","rank":38,"score":24316.799613428193},{"content":"\tprivate:\n\n\t\tbool valid;\n\n\t};\n\n\n\n\t//! Constructor\n\n\texplicit QHotkey(QObject *parent = Q_NULLPTR);\n\n\t//! Constructs a hotkey with a shortcut and optionally registers it\n\n\texplicit QHotkey(const QKeySequence &shortcut, bool autoRegister = false, QObject *parent = Q_NULLPTR);\n\n\t//! Constructs a hotkey with a key and modifiers and optionally registers it\n\n\texplicit QHotkey(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister = false, QObject *parent = Q_NULLPTR);\n\n\t//! Constructs a hotkey from a native shortcut and optionally registers it\n\n\texplicit QHotkey(const NativeShortcut &shortcut, bool autoRegister = false, QObject *parent = Q_NULLPTR);\n\n\t//! Destructor\n\n\t~QHotkey();\n\n\n\n\t//! READ-Accessor for QHotkey::registered\n\n\tbool isRegistered() const;\n\n\t//! READ-Accessor for QHotkey::shortcut - the key and modifiers as a QKeySequence\n\n\tQKeySequence shortcut() const;\n\n\t//! READ-Accessor for QHotkey::shortcut - the key only\n","file_path":"PlayTools/QHotkey/qhotkey.h","rank":39,"score":23337.978811635025},{"content":"#ifndef QHOTKEY_P_H\n\n#define QHOTKEY_P_H\n\n\n\n#include \"qhotkey.h\"\n\n#include <QAbstractNativeEventFilter>\n\n#include <QMultiHash>\n\n#include <QMutex>\n\n#include <QGlobalStatic>\n\n\n","file_path":"PlayTools/QHotkey/qhotkey_p.h","rank":40,"score":23337.681059954724},{"content":"#ifndef QHOTKEY_H\n\n#define QHOTKEY_H\n\n\n\n#include <QObject>\n\n#include <QKeySequence>\n\n#include <QPair>\n\n#include <QLoggingCategory>\n\n\n\n#ifdef QHOTKEY_LIB\n\n\t#ifdef QHOTKEY_LIB_BUILD\n\n\t\t#define QHOTKEY_SHARED_EXPORT Q_DECL_EXPORT\n\n\t#else\n\n\t\t#define QHOTKEY_SHARED_EXPORT Q_DECL_IMPORT\n\n\t#endif\n\n#else\n\n\t#define QHOTKEY_SHARED_EXPORT\n\n#endif\n\n\n\n//! A class to define global, systemwide Hotkeys\n","file_path":"PlayTools/QHotkey/qhotkey.h","rank":41,"score":23337.47095158966},{"content":"\n\nsignals:\n\n\t//! Will be emitted if the shortcut is pressed\n\n\tvoid activated(QPrivateSignal);\n\n\n\n\t//! NOTIFY-Accessor for QHotkey::registered\n\n\tvoid registeredChanged(bool registered);\n\n\n\nprivate:\n\n\tQt::Key _keyCode;\n\n\tQt::KeyboardModifiers _modifiers;\n\n\n\n\tNativeShortcut _nativeShortcut;\n\n\tbool _registered;\n\n};\n\n\n\nuint QHOTKEY_SHARED_EXPORT qHash(const QHotkey::NativeShortcut &key);\n\nuint QHOTKEY_SHARED_EXPORT qHash(const QHotkey::NativeShortcut &key, uint seed);\n\n\n\nQHOTKEY_SHARED_EXPORT Q_DECLARE_LOGGING_CATEGORY(logQHotkey)\n\n\n\n#endif // QHOTKEY_H\n","file_path":"PlayTools/QHotkey/qhotkey.h","rank":42,"score":23335.56704063341},{"content":"\tQt::Key keyCode() const;\n\n\t//! READ-Accessor for QHotkey::shortcut - the modifiers only\n\n\tQt::KeyboardModifiers modifiers() const;\n\n\n\n\t//! Get the current native shortcut\n\n\tNativeShortcut currentNativeShortcut() const;\n\n\n\npublic slots:\n\n\t//! WRITE-Accessor for QHotkey::registered\n\n\tbool setRegistered(bool registered);\n\n\n\n\t//! WRITE-Accessor for QHotkey::shortcut\n\n\tbool setShortcut(const QKeySequence &shortcut, bool autoRegister = false);\n\n\t//! WRITE-Accessor for QHotkey::shortcut\n\n\tbool setShortcut(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister = false);\n\n\t//! RESET-Accessor for QHotkey::shortcut\n\n\tbool resetShortcut();\n\n\n\n\t//! Set this hotkey to a native shortcut\n\n\tbool setNativeShortcut(NativeShortcut nativeShortcut, bool autoRegister = false);\n","file_path":"PlayTools/QHotkey/qhotkey.h","rank":43,"score":23332.443711074768},{"content":"\n\n\tvirtual bool registerShortcut(QHotkey::NativeShortcut shortcut) = 0;//platform implement\n\n\tvirtual bool unregisterShortcut(QHotkey::NativeShortcut shortcut) = 0;//platform implement\n\n\n\nprivate:\n\n\tQMultiHash<QHotkey::NativeShortcut, QHotkey*> shortcuts;\n\n\n\n\tQ_INVOKABLE bool addShortcutInvoked(QHotkey *hotkey);\n\n\tQ_INVOKABLE bool removeShortcutInvoked(QHotkey *hotkey);\n\n\tQ_INVOKABLE QHotkey::NativeShortcut nativeShortcutInvoked(Qt::Key keycode, Qt::KeyboardModifiers modifiers);\n\n};\n\n\n\n#define NATIVE_INSTANCE(ClassName) \\\n\n\tQ_GLOBAL_STATIC(ClassName, hotkeyPrivate) \\\n\n\t\\\n\n\tQHotkeyPrivate *QHotkeyPrivate::instance()\\\n\n\t{\\\n\n\t\treturn hotkeyPrivate;\\\n\n\t}\n\n\n\n#endif // QHOTKEY_P_H\n","file_path":"PlayTools/QHotkey/qhotkey_p.h","rank":44,"score":23331.28458441044},{"content":"class QObject;\n\n\n","file_path":"PlayTools/AutoMate.h","rank":45,"score":22945.935776324022},{"content":"#include \"qhotkey.h\"\n\n#include \"qhotkey_p.h\"\n\n#include <QCoreApplication>\n\n#include <QAbstractEventDispatcher>\n\n#include <QMetaMethod>\n\n#include <QThread>\n\n#include <QDebug>\n\n\n\nQ_LOGGING_CATEGORY(logQHotkey, \"QHotkey\")\n\n\n\nQHotkey::QHotkey(QObject *parent) :\n\n\tQObject(parent),\n\n\t_keyCode(Qt::Key_unknown),\n\n\t_modifiers(Qt::NoModifier),\n\n\t_nativeShortcut(),\n\n\t_registered(false)\n\n{}\n\n\n\nQHotkey::QHotkey(const QKeySequence &sequence, bool autoRegister, QObject *parent) :\n\n\tQHotkey(parent)\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":46,"score":22025.80373232384},{"content":"{\n\n\tsetShortcut(sequence, autoRegister);\n\n}\n\n\n\nQHotkey::QHotkey(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister, QObject *parent) :\n\n\tQHotkey(parent)\n\n{\n\n\tsetShortcut(keyCode, modifiers, autoRegister);\n\n}\n\n\n\nQHotkey::QHotkey(const QHotkey::NativeShortcut &shortcut, bool autoRegister, QObject *parent) :\n\n\tQHotkey(parent)\n\n{\n\n\tsetNativeShortcut(shortcut, autoRegister);\n\n}\n\n\n\nQHotkey::~QHotkey()\n\n{\n\n\tif(_registered)\n\n\t\tQHotkeyPrivate::instance()->removeShortcut(this);\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":47,"score":22021.40591971448},{"content":"\t\t\tQt::KeyboardModifiers(shortcut[0] & Qt::KeyboardModifierMask),\n\n\t\t\tautoRegister);\n\n}\n\n\n\nbool QHotkey::setShortcut(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister)\n\n{\n\n\tif(_registered) {\n\n\t\tif(autoRegister) {\n\n\t\t\tif(!QHotkeyPrivate::instance()->removeShortcut(this))\n\n\t\t\t\treturn false;\n\n\t\t} else\n\n\t\t\treturn false;\n\n\t}\n\n\n\n\tif(keyCode == Qt::Key_unknown) {\n\n\t\t_keyCode = Qt::Key_unknown;\n\n\t\t_modifiers = Qt::NoModifier;\n\n\t\t_nativeShortcut = NativeShortcut();\n\n\t\treturn true;\n\n\t}\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":48,"score":22019.562718121564},{"content":"\n\n\tif(nativeShortcut.isValid()) {\n\n\t\t_keyCode = Qt::Key_unknown;\n\n\t\t_modifiers = Qt::NoModifier;\n\n\t\t_nativeShortcut = nativeShortcut;\n\n\t\tif(autoRegister)\n\n\t\t\treturn QHotkeyPrivate::instance()->addShortcut(this);\n\n\t\telse\n\n\t\t\treturn true;\n\n\t} else {\n\n\t\t_keyCode = Qt::Key_unknown;\n\n\t\t_modifiers = Qt::NoModifier;\n\n\t\t_nativeShortcut = NativeShortcut();\n\n\t\treturn true;\n\n\t}\n\n}\n\n\n\nbool QHotkey::setRegistered(bool registered)\n\n{\n\n\tif(_registered && !registered)\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":49,"score":22019.429811291455},{"content":"\tif(_registered &&\n\n\t !QHotkeyPrivate::instance()->removeShortcut(this)) {\n\n\t\treturn false;\n\n\t}\n\n\n\n\t_keyCode = Qt::Key_unknown;\n\n\t_modifiers = Qt::NoModifier;\n\n\t_nativeShortcut = NativeShortcut();\n\n\treturn true;\n\n}\n\n\n\nbool QHotkey::setNativeShortcut(QHotkey::NativeShortcut nativeShortcut, bool autoRegister)\n\n{\n\n\tif(_registered) {\n\n\t\tif(autoRegister) {\n\n\t\t\tif(!QHotkeyPrivate::instance()->removeShortcut(this))\n\n\t\t\t\treturn false;\n\n\t\t} else\n\n\t\t\treturn false;\n\n\t}\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":50,"score":22019.392114987248},{"content":"\n\n\t_keyCode = keyCode;\n\n\t_modifiers = modifiers;\n\n\t_nativeShortcut = QHotkeyPrivate::instance()->nativeShortcut(keyCode, modifiers);\n\n\tif(_nativeShortcut.isValid()) {\n\n\t\tif(autoRegister)\n\n\t\t\treturn QHotkeyPrivate::instance()->addShortcut(this);\n\n\t\telse\n\n\t\t\treturn true;\n\n\t} else {\n\n\t\tqCWarning(logQHotkey) << \"Unable to map shortcut to native keys. Key:\" << keyCode << \"Modifiers:\" << modifiers;\n\n\t\t_keyCode = Qt::Key_unknown;\n\n\t\t_modifiers = Qt::NoModifier;\n\n\t\t_nativeShortcut = NativeShortcut();\n\n\t\treturn false;\n\n\t}\n\n}\n\n\n\nbool QHotkey::resetShortcut()\n\n{\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":51,"score":22018.066587381203},{"content":"\tshortcuts.insert(shortcut, hotkey);\n\n\thotkey->_registered = true;\n\n\treturn true;\n\n}\n\n\n\nbool QHotkeyPrivate::removeShortcutInvoked(QHotkey *hotkey)\n\n{\n\n\tQHotkey::NativeShortcut shortcut = hotkey->_nativeShortcut;\n\n\n\n\tif(shortcuts.remove(shortcut, hotkey) == 0)\n\n\t\treturn false;\n\n\thotkey->_registered = false;\n\n\temit hotkey->registeredChanged(true);\n\n\tif(shortcuts.count(shortcut) == 0)\n\n\t\treturn unregisterShortcut(shortcut);\n\n\telse\n\n\t\treturn true;\n\n}\n\n\n\nQHotkey::NativeShortcut QHotkeyPrivate::nativeShortcutInvoked(Qt::Key keycode, Qt::KeyboardModifiers modifiers)\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":52,"score":22017.919077308954},{"content":"{\n\n\tbool ok1, ok2 = false;\n\n\tauto k = nativeKeycode(keycode, ok1);\n\n\tauto m = nativeModifiers(modifiers, ok2);\n\n\tif(ok1 && ok2)\n\n\t\treturn {k, m};\n\n\telse\n\n\t\treturn {};\n\n}\n\n\n\n\n\n\n\nQHotkey::NativeShortcut::NativeShortcut() :\n\n\tkey(),\n\n\tmodifier(),\n\n\tvalid(false)\n\n{}\n\n\n\nQHotkey::NativeShortcut::NativeShortcut(quint32 key, quint32 modifier) :\n\n\tkey(key),\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":53,"score":22017.612077618312},{"content":"\tmodifier(modifier),\n\n\tvalid(true)\n\n{}\n\n\n\nbool QHotkey::NativeShortcut::isValid() const\n\n{\n\n\treturn valid;\n\n}\n\n\n\nbool QHotkey::NativeShortcut::operator ==(const QHotkey::NativeShortcut &other) const\n\n{\n\n\treturn (key == other.key) &&\n\n\t\t (modifier == other.modifier) &&\n\n\t\t valid == other.valid;\n\n}\n\n\n\nbool QHotkey::NativeShortcut::operator !=(const QHotkey::NativeShortcut &other) const\n\n{\n\n\treturn (key != other.key) ||\n\n\t\t (modifier != other.modifier) ||\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":54,"score":22016.726845184043},{"content":"\t\treturn QHotkeyPrivate::instance()->removeShortcut(this);\n\n\telse if(!_registered && registered) {\n\n\t\tif(!_nativeShortcut.isValid())\n\n\t\t\treturn false;\n\n\t\telse\n\n\t\t\treturn QHotkeyPrivate::instance()->addShortcut(this);\n\n\t} else\n\n\t\treturn true;\n\n}\n\n\n\n\n\n\n\n// ---------- QHotkeyPrivate implementation ----------\n\n\n\nQHotkeyPrivate::QHotkeyPrivate() :\n\n\tshortcuts()\n\n{\n\n\tQ_ASSERT_X(qApp, Q_FUNC_INFO, \"QHotkey requires QCoreApplication to be instantiated\");\n\n\tqApp->eventDispatcher()->installNativeEventFilter(this);\n\n}\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":55,"score":22016.528679771745},{"content":"QHotkey::NativeShortcut QHotkey::currentNativeShortcut() const\n\n{\n\n\treturn _nativeShortcut;\n\n}\n\n\n\nbool QHotkey::isRegistered() const\n\n{\n\n\treturn _registered;\n\n}\n\n\n\nbool QHotkey::setShortcut(const QKeySequence &shortcut, bool autoRegister)\n\n{\n\n\tif(shortcut.isEmpty()) {\n\n\t\treturn resetShortcut();\n\n\t} else if(shortcut.count() > 1) {\n\n\t\tqCWarning(logQHotkey, \"Keysequences with multiple shortcuts are not allowed! \"\n\n\t\t\t\t\t\t\t \"Only the first shortcut will be used!\");\n\n\t}\n\n\n\n\treturn setShortcut(Qt::Key(shortcut[0] & ~Qt::KeyboardModifierMask),\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":56,"score":22016.446279582375},{"content":"\t} else\n\n\t\treturn res;\n\n}\n\n\n\nbool QHotkeyPrivate::addShortcut(QHotkey *hotkey)\n\n{\n\n\tif(hotkey->_registered)\n\n\t\treturn false;\n\n\n\n\tQt::ConnectionType conType = (QThread::currentThread() == thread() ?\n\n\t\t\t\t\t\t\t\t\t Qt::DirectConnection :\n\n\t\t\t\t\t\t\t\t\t Qt::BlockingQueuedConnection);\n\n\tbool res = false;\n\n\tif(!QMetaObject::invokeMethod(this, \"addShortcutInvoked\", conType,\n\n\t\t\t\t\t\t\t\t Q_RETURN_ARG(bool, res),\n\n\t\t\t\t\t\t\t\t Q_ARG(QHotkey*, hotkey))) {\n\n\t\treturn false;\n\n\t} else {\n\n\t\tif(res)\n\n\t\t\temit hotkey->registeredChanged(true);\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":57,"score":22016.379929397575},{"content":"\t\treturn res;\n\n\t}\n\n}\n\n\n\nvoid QHotkeyPrivate::activateShortcut(QHotkey::NativeShortcut shortcut)\n\n{\n\n\tQMetaMethod signal = QMetaMethod::fromSignal(&QHotkey::activated);\n\n\tfor(QHotkey *hkey : shortcuts.values(shortcut))\n\n\t\tsignal.invoke(hkey, Qt::QueuedConnection);\n\n}\n\n\n\nbool QHotkeyPrivate::addShortcutInvoked(QHotkey *hotkey)\n\n{\n\n\tQHotkey::NativeShortcut shortcut = hotkey->_nativeShortcut;\n\n\n\n\tif(!shortcuts.contains(shortcut)) {\n\n\t\tif(!registerShortcut(shortcut))\n\n\t\t\treturn false;\n\n\t}\n\n\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":58,"score":22016.3539882985},{"content":"\t\t valid != other.valid;\n\n}\n\n\n\nuint qHash(const QHotkey::NativeShortcut &key)\n\n{\n\n\treturn qHash(key.key) ^ qHash(key.modifier);\n\n}\n\n\n\nuint qHash(const QHotkey::NativeShortcut &key, uint seed)\n\n{\n\n\treturn qHash(key.key, seed) ^ qHash(key.modifier, seed);\n\n}\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":59,"score":22014.636467450335},{"content":"}\n\n\n\nQKeySequence QHotkey::shortcut() const\n\n{\n\n\tif(_keyCode == Qt::Key_unknown)\n\n\t\treturn QKeySequence();\n\n\telse\n\n\t\treturn QKeySequence(_keyCode | _modifiers);\n\n}\n\n\n\nQt::Key QHotkey::keyCode() const\n\n{\n\n\treturn _keyCode;\n\n}\n\n\n\nQt::KeyboardModifiers QHotkey::modifiers() const\n\n{\n\n\treturn _modifiers;\n\n}\n\n\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":60,"score":22014.636467450335},{"content":"\t\treturn res;\n\n\t}\n\n}\n\n\n\nbool QHotkeyPrivate::removeShortcut(QHotkey *hotkey)\n\n{\n\n\tif(!hotkey->_registered)\n\n\t\treturn false;\n\n\n\n\tQt::ConnectionType conType = (QThread::currentThread() == thread() ?\n\n\t\t\t\t\t\t\t\t\t Qt::DirectConnection :\n\n\t\t\t\t\t\t\t\t\t Qt::BlockingQueuedConnection);\n\n\tbool res = false;\n\n\tif(!QMetaObject::invokeMethod(this, \"removeShortcutInvoked\", conType,\n\n\t\t\t\t\t\t\t\t Q_RETURN_ARG(bool, res),\n\n\t\t\t\t\t\t\t\t Q_ARG(QHotkey*, hotkey))) {\n\n\t\treturn false;\n\n\t} else {\n\n\t\tif(res)\n\n\t\t\temit hotkey->registeredChanged(false);\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":61,"score":22014.636467450335},{"content":"\n\nQHotkeyPrivate::~QHotkeyPrivate()\n\n{\n\n\tif(!shortcuts.isEmpty())\n\n\t\tqCWarning(logQHotkey) << \"QHotkeyPrivate destroyed with registered shortcuts!\";\n\n\tif(qApp && qApp->eventDispatcher())\n\n\t\tqApp->eventDispatcher()->removeNativeEventFilter(this);\n\n}\n\n\n\nQHotkey::NativeShortcut QHotkeyPrivate::nativeShortcut(Qt::Key keycode, Qt::KeyboardModifiers modifiers)\n\n{\n\n\tQt::ConnectionType conType = (QThread::currentThread() == thread() ?\n\n\t\t\t\t\t\t\t\t\t Qt::DirectConnection :\n\n\t\t\t\t\t\t\t\t\t Qt::BlockingQueuedConnection);\n\n\tQHotkey::NativeShortcut res;\n\n\tif(!QMetaObject::invokeMethod(this, \"nativeShortcutInvoked\", conType,\n\n\t\t\t\t\t\t\t\t Q_RETURN_ARG(QHotkey::NativeShortcut, res),\n\n\t\t\t\t\t\t\t\t Q_ARG(Qt::Key, keycode),\n\n\t\t\t\t\t\t\t\t Q_ARG(Qt::KeyboardModifiers, modifiers))) {\n\n\t\treturn QHotkey::NativeShortcut();\n","file_path":"PlayTools/QHotkey/qhotkey.cpp","rank":62,"score":22014.636467450335},{"content":"#include \"qhotkey.h\"\n\n#include \"qhotkey_p.h\"\n\n#include <qt_windows.h>\n\n#include <QDebug>\n\n\n\n#define HKEY_ID(nativeShortcut) (((nativeShortcut.key ^ (nativeShortcut.modifier << 8)) & 0x0FFF) | 0x7000)\n\n\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":63,"score":20847.195006407463},{"content":"\tswitch (keycode)\n\n\t{\n\n\tcase Qt::Key_Escape:\n\n\t\treturn VK_ESCAPE;\n\n\tcase Qt::Key_Tab:\n\n\tcase Qt::Key_Backtab:\n\n\t\treturn VK_TAB;\n\n\tcase Qt::Key_Backspace:\n\n\t\treturn VK_BACK;\n\n\tcase Qt::Key_Return:\n\n\tcase Qt::Key_Enter:\n\n\t\treturn VK_RETURN;\n\n\tcase Qt::Key_Insert:\n\n\t\treturn VK_INSERT;\n\n\tcase Qt::Key_Delete:\n\n\t\treturn VK_DELETE;\n\n\tcase Qt::Key_Pause:\n\n\t\treturn VK_PAUSE;\n\n\tcase Qt::Key_Print:\n\n\t\treturn VK_PRINT;\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":64,"score":20842.453123250096},{"content":"\t\t\t\t\t\t\t HKEY_ID(shortcut),\n\n\t\t\t\t\t\t\t shortcut.modifier,\n\n\t\t\t\t\t\t\t shortcut.key);\n\n\tif(ok)\n\n\t\treturn true;\n\n\telse {\n\n\t\tqCWarning(logQHotkey) << \"Failed to register hotkey. Error:\"\n\n\t\t\t\t\t\t\t << qPrintable(QHotkeyPrivateWin::formatWinError(::GetLastError()));\n\n\t\treturn false;\n\n\t}\n\n}\n\n\n\nbool QHotkeyPrivateWin::unregisterShortcut(QHotkey::NativeShortcut shortcut)\n\n{\n\n\tBOOL ok = UnregisterHotKey(NULL, HKEY_ID(shortcut));\n\n\tif(ok)\n\n\t\treturn true;\n\n\telse {\n\n\t\tqCWarning(logQHotkey) << \"Failed to unregister hotkey. Error:\"\n\n\t\t\t\t\t\t\t << qPrintable(QHotkeyPrivateWin::formatWinError(::GetLastError()));\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":65,"score":20842.14627208188},{"content":"}\n\n\n\nquint32 QHotkeyPrivateWin::nativeModifiers(Qt::KeyboardModifiers modifiers, bool &ok)\n\n{\n\n\tquint32 nMods = 0;\n\n\tif (modifiers & Qt::ShiftModifier)\n\n\t\tnMods |= MOD_SHIFT;\n\n\tif (modifiers & Qt::ControlModifier)\n\n\t\tnMods |= MOD_CONTROL;\n\n\tif (modifiers & Qt::AltModifier)\n\n\t\tnMods |= MOD_ALT;\n\n\tif (modifiers & Qt::MetaModifier)\n\n\t\tnMods |= MOD_WIN;\n\n\tok = true;\n\n\treturn nMods;\n\n}\n\n\n\nbool QHotkeyPrivateWin::registerShortcut(QHotkey::NativeShortcut shortcut)\n\n{\n\n\tBOOL ok = RegisterHotKey(NULL,\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":66,"score":20841.47427882736},{"content":"\tQ_UNUSED(eventType);\n\n\tQ_UNUSED(result);\n\n\n\n\tMSG* msg = static_cast<MSG*>(message);\n\n\tif(msg->message == WM_HOTKEY)\n\n\t\tthis->activateShortcut({HIWORD(msg->lParam), LOWORD(msg->lParam)});\n\n\n\n\treturn false;\n\n}\n\n\n\nquint32 QHotkeyPrivateWin::nativeKeycode(Qt::Key keycode, bool &ok)\n\n{\n\n\tok = true;\n\n\tif(keycode <= 0xFFFF) {//Try to obtain the key from it's \"character\"\n\n\t\tconst SHORT vKey = VkKeyScanW(keycode);\n\n\t\tif(vKey > -1)\n\n\t\t\treturn LOBYTE(vKey);\n\n\t}\n\n\n\n\t//find key from switch/case --> Only finds a very small subset of keys\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":67,"score":20841.47427882736},{"content":"\tcase Qt::Key_Clear:\n\n\t\treturn VK_CLEAR;\n\n\tcase Qt::Key_Home:\n\n\t\treturn VK_HOME;\n\n\tcase Qt::Key_End:\n\n\t\treturn VK_END;\n\n\tcase Qt::Key_Left:\n\n\t\treturn VK_LEFT;\n\n\tcase Qt::Key_Up:\n\n\t\treturn VK_UP;\n\n\tcase Qt::Key_Right:\n\n\t\treturn VK_RIGHT;\n\n\tcase Qt::Key_Down:\n\n\t\treturn VK_DOWN;\n\n\tcase Qt::Key_PageUp:\n\n\t\treturn VK_PRIOR;\n\n\tcase Qt::Key_PageDown:\n\n\t\treturn VK_NEXT;\n\n\tcase Qt::Key_CapsLock:\n\n\t\treturn VK_CAPITAL;\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":68,"score":20839.789674617685},{"content":"\tcase Qt::Key_MediaPrevious:\n\n\t\treturn VK_MEDIA_PREV_TRACK;\n\n\tcase Qt::Key_MediaPlay:\n\n\t\treturn VK_MEDIA_PLAY_PAUSE;\n\n\tcase Qt::Key_MediaStop:\n\n\t\treturn VK_MEDIA_STOP;\n\n\tcase Qt::Key_VolumeDown:\n\n\t\treturn VK_VOLUME_DOWN;\n\n\tcase Qt::Key_VolumeUp:\n\n\t\treturn VK_VOLUME_UP;\n\n\tcase Qt::Key_VolumeMute:\n\n\t\treturn VK_VOLUME_MUTE;\n\n\tcase Qt::Key_Mode_switch:\n\n\t\treturn VK_MODECHANGE;\n\n\tcase Qt::Key_Select:\n\n\t\treturn VK_SELECT;\n\n\tcase Qt::Key_Printer:\n\n\t\treturn VK_PRINT;\n\n\tcase Qt::Key_Execute:\n\n\t\treturn VK_EXECUTE;\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":69,"score":20839.789674617685},{"content":"\tcase Qt::Key_NumLock:\n\n\t\treturn VK_NUMLOCK;\n\n\tcase Qt::Key_ScrollLock:\n\n\t\treturn VK_SCROLL;\n\n\n\n\tcase Qt::Key_F1:\n\n\t\treturn VK_F1;\n\n\tcase Qt::Key_F2:\n\n\t\treturn VK_F2;\n\n\tcase Qt::Key_F3:\n\n\t\treturn VK_F3;\n\n\tcase Qt::Key_F4:\n\n\t\treturn VK_F4;\n\n\tcase Qt::Key_F5:\n\n\t\treturn VK_F5;\n\n\tcase Qt::Key_F6:\n\n\t\treturn VK_F6;\n\n\tcase Qt::Key_F7:\n\n\t\treturn VK_F7;\n\n\tcase Qt::Key_F8:\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":70,"score":20839.789674617685},{"content":"\t\treturn VK_F8;\n\n\tcase Qt::Key_F9:\n\n\t\treturn VK_F9;\n\n\tcase Qt::Key_F10:\n\n\t\treturn VK_F10;\n\n\tcase Qt::Key_F11:\n\n\t\treturn VK_F11;\n\n\tcase Qt::Key_F12:\n\n\t\treturn VK_F12;\n\n\tcase Qt::Key_F13:\n\n\t\treturn VK_F13;\n\n\tcase Qt::Key_F14:\n\n\t\treturn VK_F14;\n\n\tcase Qt::Key_F15:\n\n\t\treturn VK_F15;\n\n\tcase Qt::Key_F16:\n\n\t\treturn VK_F16;\n\n\tcase Qt::Key_F17:\n\n\t\treturn VK_F17;\n\n\tcase Qt::Key_F18:\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":71,"score":20839.789674617685},{"content":"\t\treturn false;\n\n\t}\n\n}\n\n\n\nQString QHotkeyPrivateWin::formatWinError(DWORD winError)\n\n{\n\n\twchar_t *buffer = NULL;\n\n\tDWORD num = FormatMessageW(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM,\n\n\t\t\t\t\t\t\t NULL,\n\n\t\t\t\t\t\t\t winError,\n\n\t\t\t\t\t\t\t 0,\n\n\t\t\t\t\t\t\t (LPWSTR)&buffer,\n\n\t\t\t\t\t\t\t 0,\n\n\t\t\t\t\t\t\t NULL);\n\n\tif(buffer) {\n\n\t\tQString res = QString::fromWCharArray(buffer, num);\n\n\t\tLocalFree(buffer);\n\n\t\treturn res;\n\n\t} else\n\n\t\treturn QString();\n\n}\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":72,"score":20839.789674617685},{"content":"\t\treturn VK_BROWSER_HOME;\n\n\n\n\tcase Qt::Key_LaunchMail:\n\n\t\treturn VK_LAUNCH_MAIL;\n\n\tcase Qt::Key_LaunchMedia:\n\n\t\treturn VK_LAUNCH_MEDIA_SELECT;\n\n\tcase Qt::Key_Launch0:\n\n\t\treturn VK_LAUNCH_APP1;\n\n\tcase Qt::Key_Launch1:\n\n\t\treturn VK_LAUNCH_APP2;\n\n\n\n\tcase Qt::Key_Massyo:\n\n\t\treturn VK_OEM_FJ_MASSHOU;\n\n\tcase Qt::Key_Touroku:\n\n\t\treturn VK_OEM_FJ_TOUROKU;\n\n\n\n\tdefault:\n\n\t\tok = false;\n\n\t\treturn 0;\n\n\t}\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":73,"score":20839.789674617685},{"content":"\tcase Qt::Key_Sleep:\n\n\t\treturn VK_SLEEP;\n\n\tcase Qt::Key_Period:\n\n\t\treturn VK_DECIMAL;\n\n\tcase Qt::Key_Play:\n\n\t\treturn VK_PLAY;\n\n\tcase Qt::Key_Cancel:\n\n\t\treturn VK_CANCEL;\n\n\n\n\tcase Qt::Key_Forward:\n\n\t\treturn VK_BROWSER_FORWARD;\n\n\tcase Qt::Key_Refresh:\n\n\t\treturn VK_BROWSER_REFRESH;\n\n\tcase Qt::Key_Stop:\n\n\t\treturn VK_BROWSER_STOP;\n\n\tcase Qt::Key_Search:\n\n\t\treturn VK_BROWSER_SEARCH;\n\n\tcase Qt::Key_Favorites:\n\n\t\treturn VK_BROWSER_FAVORITES;\n\n\tcase Qt::Key_HomePage:\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":74,"score":20839.789674617685},{"content":"\t\treturn VK_F18;\n\n\tcase Qt::Key_F19:\n\n\t\treturn VK_F19;\n\n\tcase Qt::Key_F20:\n\n\t\treturn VK_F20;\n\n\tcase Qt::Key_F21:\n\n\t\treturn VK_F21;\n\n\tcase Qt::Key_F22:\n\n\t\treturn VK_F22;\n\n\tcase Qt::Key_F23:\n\n\t\treturn VK_F23;\n\n\tcase Qt::Key_F24:\n\n\t\treturn VK_F24;\n\n\n\n\tcase Qt::Key_Menu:\n\n\t\treturn VK_APPS;\n\n\tcase Qt::Key_Help:\n\n\t\treturn VK_HELP;\n\n\tcase Qt::Key_MediaNext:\n\n\t\treturn VK_MEDIA_NEXT_TRACK;\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":75,"score":20839.789674617685},{"content":"class QHOTKEY_SHARED_EXPORT QHotkeyPrivate : public QObject, public QAbstractNativeEventFilter\n\n{\n\n\tQ_OBJECT\n\n\n\npublic:\n\n\tQHotkeyPrivate();//singleton!!!\n\n\t~QHotkeyPrivate();\n\n\n\n\tstatic QHotkeyPrivate *instance();\n\n\n\n\tQHotkey::NativeShortcut nativeShortcut(Qt::Key keycode, Qt::KeyboardModifiers modifiers);\n\n\n\n\tbool addShortcut(QHotkey *hotkey);\n\n\tbool removeShortcut(QHotkey *hotkey);\n\n\n\nprotected:\n\n\tvoid activateShortcut(QHotkey::NativeShortcut shortcut);\n\n\n\n\tvirtual quint32 nativeKeycode(Qt::Key keycode, bool &ok) = 0;//platform implement\n\n\tvirtual quint32 nativeModifiers(Qt::KeyboardModifiers modifiers, bool &ok) = 0;//platform implement\n","file_path":"PlayTools/QHotkey/qhotkey_p.h","rank":76,"score":19525.829471806344},{"content":"class QHotkeyPrivateWin : public QHotkeyPrivate\n\n{\n\npublic:\n\n\t// QAbstractNativeEventFilter interface\n\n\tbool nativeEventFilter(const QByteArray &eventType, void *message, long *result) Q_DECL_OVERRIDE;\n\n\n\nprotected:\n\n\t// QHotkeyPrivate interface\n\n\tquint32 nativeKeycode(Qt::Key keycode, bool &ok) Q_DECL_OVERRIDE;\n\n\tquint32 nativeModifiers(Qt::KeyboardModifiers modifiers, bool &ok) Q_DECL_OVERRIDE;\n\n\tbool registerShortcut(QHotkey::NativeShortcut shortcut) Q_DECL_OVERRIDE;\n\n\tbool unregisterShortcut(QHotkey::NativeShortcut shortcut) Q_DECL_OVERRIDE;\n\n\n\nprivate:\n\n\tstatic QString formatWinError(DWORD winError);\n\n};\n\nNATIVE_INSTANCE(QHotkeyPrivateWin)\n\n\n\nbool QHotkeyPrivateWin::nativeEventFilter(const QByteArray &eventType, void *message, long *result)\n\n{\n","file_path":"PlayTools/QHotkey/qhotkey_win.cpp","rank":77,"score":14604.602999594015},{"content":"class QHotkey;\n\n\n","file_path":"PlayTools/mainwindow.h","rank":78,"score":12819.092319040657},{"content":"#ifndef MAINWINDOW_H\n\n#define MAINWINDOW_H\n\n\n\n#include <QMainWindow>\n\n#include \"firewallrules.h\"\n\n\n\nQT_BEGIN_NAMESPACE\n\nnamespace Ui { class MainWindow; }\n\nQT_END_NAMESPACE\n\n\n","file_path":"PlayTools/mainwindow.h","rank":87,"score":6.077993113161154},{"content":" void on_disconnectProcessButton_clicked();\n\n\n\n void on_fingerPrintButton_clicked();\n\n\n\n void on_luckyWheelButton_clicked();\n\n\n\n void on_doomsDay2Button_clicked();\n\n\n\n void on_doomsDay3Button_clicked();\n\n\n\n void on_lineEditLuckyWheelInteval_textChanged(const QString &arg1);\n\n\n\n void on_pushButtonSave_clicked();\n\n\n\nprivate:\n\n void InitUI();\n\n void PlaySoundPrompt();\n\n void BindHotKeys();\n\n void UnBindHotKeys();\n\n\n","file_path":"PlayTools/mainwindow.h","rank":89,"score":5.885538089636221},{"content":" enum FunctionType\n\n {\n\n FunctionType_Solo,\n\n FunctionType_Disconnect,\n\n\t\tFunctionType_Finger,\n\n\t\tFunctionType_Lucky,\n\n\t\tFunctionType_DoomsDayII,\n\n\t\tFunctionType_DoomsDayIII,\n\n\t\tFunctionType_Snack,\n\n\t\tFunctionType_Armor,\n\n\t\tFunctionType_Max,\n\n\n\n };\n\n\n\nprivate:\n\n Ui::MainWindow *ui;\n\n AutoMate* m_AutoMate;\n\n FirewallRules m_firewallRules;\n\n QString m_GtaProcessPath;\n\n QHotkey* m_FuncHotkeys[FunctionType_Max];\n\n int m_nLuckwheelInteval;\n\n};\n\n#endif // MAINWINDOW_H\n","file_path":"PlayTools/mainwindow.h","rank":90,"score":5.071498423346587},{"content":" RunFirewallCmd(outCmd);\n\n}\n\n\n\nvoid FirewallRules::StopSinglePublicSession()\n\n{\n\n QString cmd = QString(\"netsh advfirewall firewall delete rule name=\\\"%1\\\" \").arg(SINGLE_PUBLIC_SESSION_NAME);\n\n RunFirewallCmd(cmd);\n\n}\n\n\n\nvoid FirewallRules::StartProcessOffline(QString& processName)\n\n{\n\n\tQString outCmd = QString(\"netsh advfirewall firewall add rule name=\\\"%1\\\" dir=out program=\\\"%2\\\" action=block enable=yes\").arg(PROCESS_OFFLINE_NAME, processName);\n\n\tRunFirewallCmd(outCmd);\n\n}\n\n\n\nvoid FirewallRules::StopProcessOffine()\n\n{\n\n\tQString cmd = QString(\"netsh advfirewall firewall delete rule name=\\\"%1\\\" \").arg(PROCESS_OFFLINE_NAME);\n\n\tRunFirewallCmd(cmd);\n\n}\n","file_path":"PlayTools/firewallrules.cpp","rank":91,"score":4.721488455666886},{"content":"#include \"firewallrules.h\"\n\n#include <qprocess.h>\n\n#include <QDebug>\n\n#include <windows.h>\n\n#include <stdio.h>\n\n#include <netfw.h>\n\n#include <crtdbg.h>\n\n\n\n\n\n#pragma comment( lib, \"ole32.lib\" )\n\n#pragma comment( lib, \"oleaut32.lib\" )\n\n\n\n// https://docs.microsoft.com/en-us/previous-versions/windows/desktop/ics/c-adding-an-outbound-rule?redirectedfrom=MSDN\n\n\n\n\n\n// Instantiate INetFwPolicy2\n\nHRESULT WFCOMInitialize(INetFwPolicy2** ppNetFwPolicy2)\n\n{\n\n HRESULT hr = S_OK;\n\n\n","file_path":"PlayTools/firewallrules.cpp","rank":94,"score":3.906990842963106},{"content":"#ifndef FIREWALLRULES_H\n\n#define FIREWALLRULES_H\n\n\n\n#include <QString>\n\n#include <QProcess>\n\n\n","file_path":"PlayTools/firewallrules.h","rank":95,"score":3.758345705246968},{"content":"#include \"mainwindow.h\"\n\n\n\n#include <QApplication>\n\n\n\nint main(int argc, char *argv[])\n\n{\n\n QApplication a(argc, argv);\n\n MainWindow w;\n\n w.show();\n\n return a.exec();\n\n}\n","file_path":"PlayTools/main.cpp","rank":96,"score":3.530368228026565},{"content":" CurrentProfilesBitMask ^= NET_FW_PROFILE2_PUBLIC;\n\n }\n\n\n\n // Create a new Firewall Rule object.\n\n INetFwRule* pFwRule = NULL;\n\n hr = CoCreateInstance(\n\n __uuidof(NetFwRule),\n\n NULL,\n\n CLSCTX_INPROC_SERVER,\n\n __uuidof(INetFwRule),\n\n (void**)&pFwRule);\n\n if (FAILED(hr))\n\n {\n\n printf(\"CoCreateInstance for Firewall Rule failed: 0x%08lx\\n\", hr);\n\n goto Cleanup;\n\n }\n\n\n\n BSTR bstrRuleName = SysAllocString(L\"OUTBOUND_RULE\");\n\n BSTR bstrRuleDescription = SysAllocString(L\"Allow outbound network traffic from my Application over TCP port 4000\");\n\n BSTR bstrRuleGroup = SysAllocString(L\"Sample Rule Group\");\n","file_path":"PlayTools/firewallrules.cpp","rank":98,"score":2.8304919841006475},{"content":"{\n\n\n\n}\n\n\n\nFirewallRules::~FirewallRules()\n\n{\n\n}\n\n\n\nvoid FirewallRules::SetActionListener(IFirewallActionListener* listener)\n\n{\n\n m_pListener = listener;\n\n}\n\n\n\nvoid FirewallRules::SetFireWallRules()\n\n{\n\n QProcess cmd;\n\n //cmd.start(QString(\"netsh interface ip set address \\\"%1\\\" dhcp\").arg(\"WLAN\"));\n\n cmd.start(QString(\"netsh advfirewall firewall add rule name=\\\"%1\\\" dir=in program=\\\"%2\\\" action=allow\")\n\n .arg(\"fwtest\", \"C:\\\\Users\\\\happycastpc.exe\"));\n\n \n","file_path":"PlayTools/firewallrules.cpp","rank":99,"score":2.563676421724908}],"string":"[\n {\n \"content\": \"class AutoMate\\n\\n{\\n\\npublic:\\n\\n\\tAutoMate();\\n\\n\\t~AutoMate();\\n\\n\\n\\n\\tvoid SetWindow(QObject* qObj);\\n\\n\\n\\n\\tvoid SendTestCommand();\\n\\n\\n\\n\\tvoid SendSnackCmd();\\n\\n\\tvoid SendArmorCmd();\\n\\n\\tvoid SendDoomsDayIICmd();\\n\\n\\tvoid SendDoomsDayIIICmd();\\n\\n\\tvoid SendLuckyWheelCmd(int millisec);\\n\\n\\tvoid SendFingerPrintCmd();\\n\\n\\n\\nprivate:\\n\\n\\tconst static char MAX_KEY_COUNT = 3;\\n\\n\\t// Press down and up with interval; 3 key for most\\n\",\n \"file_path\": \"PlayTools/AutoMate.h\",\n \"rank\": 0,\n \"score\": 31311.14421347797\n },\n {\n \"content\": \"//! A class to define global, systemwide Hotkeys\\n\\nclass QHOTKEY_SHARED_EXPORT QHotkey : public QObject\\n\\n{\\n\\n\\tQ_OBJECT\\n\\n\\tfriend class QHotkeyPrivate;\\n\\n\\n\\n\\t//! Specifies whether this hotkey is currently registered or not\\n\\n\\tQ_PROPERTY(bool registered READ isRegistered WRITE setRegistered NOTIFY registeredChanged)\\n\\n\\t//! Holds the shortcut this hotkey will be triggered on\\n\\n\\tQ_PROPERTY(QKeySequence shortcut READ shortcut WRITE setShortcut RESET resetShortcut)\\n\\n\\n\\npublic:\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.h\",\n \"rank\": 1,\n \"score\": 30433.28993149334\n },\n {\n \"content\": \"class Ui_MainWindow\\n\\n{\\n\\npublic:\\n\\n QWidget *centralwidget;\\n\\n QVBoxLayout *verticalLayout;\\n\\n QVBoxLayout *rootlayout;\\n\\n QHBoxLayout *toplayout;\\n\\n QVBoxLayout *mainlayout;\\n\\n QHBoxLayout *horizontalLayout_2;\\n\\n QPushButton *soloButton;\\n\\n QLineEdit *lineEditSolo;\\n\\n QHBoxLayout *horizontalLayout_4;\\n\\n QPushButton *disconnectProcessButton;\\n\\n QLineEdit *lineEditDisconnectProcess;\\n\\n QHBoxLayout *horizontalLayout_5;\\n\\n QPushButton *fingerPrintButton;\\n\\n QLineEdit *lineEditFingerPrint;\\n\\n QHBoxLayout *horizontalLayout_6;\\n\\n QPushButton *luckyWheelButton;\\n\\n QLineEdit *lineEditLuckyWheel;\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 2,\n \"score\": 29785.557245892072\n },\n {\n \"content\": \" class MainWindow: public Ui_MainWindow {};\\n\\n} // namespace Ui\\n\\n\\n\\nQT_END_NAMESPACE\\n\\n\\n\\n#endif // UI_MAINWINDOW_H\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 3,\n \"score\": 26806.856360440997\n },\n {\n \"content\": \"\\t//! Defines shortcut with native keycodes\\n\\n\\tclass QHOTKEY_SHARED_EXPORT NativeShortcut {\\n\\n\\tpublic:\\n\\n\\t\\t//! The native keycode\\n\\n\\t\\tquint32 key;\\n\\n\\t\\t//! The native modifiers\\n\\n\\t\\tquint32 modifier;\\n\\n\\n\\n\\t\\t//! Creates an invalid native shortcut\\n\\n\\t\\tNativeShortcut();\\n\\n\\t\\t//! Creates a valid native shortcut, with the given key and modifiers\\n\\n\\t\\tNativeShortcut(quint32 key, quint32 modifier = 0);\\n\\n\\n\\n\\t\\t//! Checks, whether this shortcut is valid or not\\n\\n\\t\\tbool isValid() const;\\n\\n\\n\\n\\t\\t//! Equality operator\\n\\n\\t\\tbool operator ==(const NativeShortcut &other) const;\\n\\n\\t\\t//! Inequality operator\\n\\n\\t\\tbool operator !=(const NativeShortcut &other) const;\\n\\n\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.h\",\n \"rank\": 4,\n \"score\": 26034.75649491446\n },\n {\n \"content\": \"\\tvoid SendKeyInput(WORD* keylist, char num);\\n\\n\\tvoid KeyPress(WORD keyCode, bool bUp = false);\\n\\n\\tvoid KeyDown(WORD keyCode);\\n\\n\\tvoid KeyUp(WORD keyCode);\\n\\n\\tvoid KeyClick(WORD keyCode);\\n\\n\\n\\n\\n\\n\\tQObject* m_MainWindow;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"PlayTools/AutoMate.h\",\n \"rank\": 5,\n \"score\": 25865.679453435187\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\",\n \"file_path\": \"PlayTools/AutoMate.h\",\n \"rank\": 6,\n \"score\": 25861.870763970215\n },\n {\n \"content\": \"/********************************************************************************\\n\\n** Form generated from reading UI file 'mainwindow.ui'\\n\\n**\\n\\n** Created by: Qt User Interface Compiler version 5.15.0\\n\\n**\\n\\n** WARNING! All changes made in this file will be lost when recompiling UI file!\\n\\n********************************************************************************/\\n\\n\\n\\n#ifndef UI_MAINWINDOW_H\\n\\n#define UI_MAINWINDOW_H\\n\\n\\n\\n#include <QtCore/QVariant>\\n\\n#include <QtWidgets/QApplication>\\n\\n#include <QtWidgets/QHBoxLayout>\\n\\n#include <QtWidgets/QLabel>\\n\\n#include <QtWidgets/QLineEdit>\\n\\n#include <QtWidgets/QMainWindow>\\n\\n#include <QtWidgets/QMenuBar>\\n\\n#include <QtWidgets/QPushButton>\\n\\n#include <QtWidgets/QSpacerItem>\\n\\n#include <QtWidgets/QStatusBar>\\n\\n#include <QtWidgets/QVBoxLayout>\\n\\n#include <QtWidgets/QWidget>\\n\\n\\n\\nQT_BEGIN_NAMESPACE\\n\\n\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 7,\n \"score\": 25555.152935189013\n },\n {\n \"content\": \" lineEditSnack->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+Alt+E\\\", nullptr));\\n\\n amorButton->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Armor\\\", nullptr));\\n\\n lineEditArmor->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+Alt+C\\\", nullptr));\\n\\n pushButtonSave->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Save\\\", nullptr));\\n\\n pushButton_2->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"PushButton\\\", nullptr));\\n\\n labelPrompt->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Prompt\\\", nullptr));\\n\\n labelInfo->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ver 0.1\\\", nullptr));\\n\\n } // retranslateUi\\n\\n\\n\\n};\\n\\n\\n\\nnamespace Ui {\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 8,\n \"score\": 25553.739088693394\n },\n {\n \"content\": \" QHBoxLayout *bottomlayout;\\n\\n QMenuBar *menubar;\\n\\n QStatusBar *statusbar;\\n\\n\\n\\n void setupUi(QMainWindow *MainWindow)\\n\\n {\\n\\n if (MainWindow->objectName().isEmpty())\\n\\n MainWindow->setObjectName(QString::fromUtf8(\\\"MainWindow\\\"));\\n\\n MainWindow->resize(441, 666);\\n\\n centralwidget = new QWidget(MainWindow);\\n\\n centralwidget->setObjectName(QString::fromUtf8(\\\"centralwidget\\\"));\\n\\n verticalLayout = new QVBoxLayout(centralwidget);\\n\\n verticalLayout->setObjectName(QString::fromUtf8(\\\"verticalLayout\\\"));\\n\\n rootlayout = new QVBoxLayout();\\n\\n rootlayout->setObjectName(QString::fromUtf8(\\\"rootlayout\\\"));\\n\\n toplayout = new QHBoxLayout();\\n\\n toplayout->setObjectName(QString::fromUtf8(\\\"toplayout\\\"));\\n\\n\\n\\n rootlayout->addLayout(toplayout);\\n\\n\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 9,\n \"score\": 25553.569340463375\n },\n {\n \"content\": \" } // setupUi\\n\\n\\n\\n void retranslateUi(QMainWindow *MainWindow)\\n\\n {\\n\\n MainWindow->setWindowTitle(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Play Tools\\\", nullptr));\\n\\n soloButton->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Solo\\\", nullptr));\\n\\n lineEditSolo->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+Alt+S\\\", nullptr));\\n\\n disconnectProcessButton->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Disconnect Process\\\", nullptr));\\n\\n lineEditDisconnectProcess->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+Alt+O\\\", nullptr));\\n\\n fingerPrintButton->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"FingerPrint\\\", nullptr));\\n\\n lineEditFingerPrint->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+P\\\", nullptr));\\n\\n luckyWheelButton->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Lucky Wheel\\\", nullptr));\\n\\n lineEditLuckyWheel->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+E\\\", nullptr));\\n\\n labelLuckWheel->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Inteval(ms)\\\", nullptr));\\n\\n lineEditLuckyWheelInteval->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"4125\\\", nullptr));\\n\\n doomsDay2Button->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"DoomsDay II\\\", nullptr));\\n\\n lineEditDoomsDayII->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+F2\\\", nullptr));\\n\\n doomsDay3Button->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"DoomsDay III\\\", nullptr));\\n\\n lineEditDoomsDayIII->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Ctrl+F3\\\", nullptr));\\n\\n snackButton->setText(QCoreApplication::translate(\\\"MainWindow\\\", \\\"Sancks\\\", nullptr));\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 10,\n \"score\": 25553.482563925896\n },\n {\n \"content\": \"\\n\\n mainlayout->addItem(verticalSpacer);\\n\\n\\n\\n labelPrompt = new QLabel(centralwidget);\\n\\n labelPrompt->setObjectName(QString::fromUtf8(\\\"labelPrompt\\\"));\\n\\n QFont font2;\\n\\n font2.setFamily(QString::fromUtf8(\\\"\\\\345\\\\276\\\\256\\\\350\\\\275\\\\257\\\\351\\\\233\\\\205\\\\351\\\\273\\\\221\\\"));\\n\\n labelPrompt->setFont(font2);\\n\\n\\n\\n mainlayout->addWidget(labelPrompt);\\n\\n\\n\\n labelInfo = new QLabel(centralwidget);\\n\\n labelInfo->setObjectName(QString::fromUtf8(\\\"labelInfo\\\"));\\n\\n QFont font3;\\n\\n font3.setFamily(QString::fromUtf8(\\\"Arial\\\"));\\n\\n font3.setPointSize(12);\\n\\n font3.setBold(true);\\n\\n font3.setWeight(75);\\n\\n labelInfo->setFont(font3);\\n\\n\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 11,\n \"score\": 25551.783101603975\n },\n {\n \"content\": \" rootlayout->addLayout(bottomlayout);\\n\\n\\n\\n rootlayout->setStretch(0, 1);\\n\\n rootlayout->setStretch(1, 16);\\n\\n rootlayout->setStretch(2, 1);\\n\\n\\n\\n verticalLayout->addLayout(rootlayout);\\n\\n\\n\\n MainWindow->setCentralWidget(centralwidget);\\n\\n menubar = new QMenuBar(MainWindow);\\n\\n menubar->setObjectName(QString::fromUtf8(\\\"menubar\\\"));\\n\\n menubar->setGeometry(QRect(0, 0, 441, 21));\\n\\n MainWindow->setMenuBar(menubar);\\n\\n statusbar = new QStatusBar(MainWindow);\\n\\n statusbar->setObjectName(QString::fromUtf8(\\\"statusbar\\\"));\\n\\n MainWindow->setStatusBar(statusbar);\\n\\n\\n\\n retranslateUi(MainWindow);\\n\\n\\n\\n QMetaObject::connectSlotsByName(MainWindow);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 12,\n \"score\": 25551.77516264384\n },\n {\n \"content\": \" mainlayout = new QVBoxLayout();\\n\\n mainlayout->setObjectName(QString::fromUtf8(\\\"mainlayout\\\"));\\n\\n horizontalLayout_2 = new QHBoxLayout();\\n\\n horizontalLayout_2->setObjectName(QString::fromUtf8(\\\"horizontalLayout_2\\\"));\\n\\n horizontalLayout_2->setSizeConstraint(QLayout::SetFixedSize);\\n\\n soloButton = new QPushButton(centralwidget);\\n\\n soloButton->setObjectName(QString::fromUtf8(\\\"soloButton\\\"));\\n\\n QSizePolicy sizePolicy(QSizePolicy::Preferred, QSizePolicy::Preferred);\\n\\n sizePolicy.setHorizontalStretch(0);\\n\\n sizePolicy.setVerticalStretch(0);\\n\\n sizePolicy.setHeightForWidth(soloButton->sizePolicy().hasHeightForWidth());\\n\\n soloButton->setSizePolicy(sizePolicy);\\n\\n QFont font;\\n\\n font.setFamily(QString::fromUtf8(\\\"Arial\\\"));\\n\\n font.setPointSize(10);\\n\\n font.setBold(true);\\n\\n font.setWeight(75);\\n\\n soloButton->setFont(font);\\n\\n soloButton->setFocusPolicy(Qt::StrongFocus);\\n\\n soloButton->setStyleSheet(QString::fromUtf8(\\\"background-color: rgb(23, 135, 6);\\\"));\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 13,\n \"score\": 25551.234320690757\n },\n {\n \"content\": \"\\n\\n horizontalLayout_2->addWidget(soloButton);\\n\\n\\n\\n lineEditSolo = new QLineEdit(centralwidget);\\n\\n lineEditSolo->setObjectName(QString::fromUtf8(\\\"lineEditSolo\\\"));\\n\\n QSizePolicy sizePolicy1(QSizePolicy::Expanding, QSizePolicy::Preferred);\\n\\n sizePolicy1.setHorizontalStretch(0);\\n\\n sizePolicy1.setVerticalStretch(0);\\n\\n sizePolicy1.setHeightForWidth(lineEditSolo->sizePolicy().hasHeightForWidth());\\n\\n lineEditSolo->setSizePolicy(sizePolicy1);\\n\\n QFont font1;\\n\\n font1.setFamily(QString::fromUtf8(\\\"Arial\\\"));\\n\\n font1.setPointSize(11);\\n\\n font1.setBold(true);\\n\\n font1.setWeight(75);\\n\\n lineEditSolo->setFont(font1);\\n\\n\\n\\n horizontalLayout_2->addWidget(lineEditSolo);\\n\\n\\n\\n horizontalLayout_2->setStretch(0, 1);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 14,\n \"score\": 25550.547946993058\n },\n {\n \"content\": \"\\n\\n lineEditArmor = new QLineEdit(centralwidget);\\n\\n lineEditArmor->setObjectName(QString::fromUtf8(\\\"lineEditArmor\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditArmor->sizePolicy().hasHeightForWidth());\\n\\n lineEditArmor->setSizePolicy(sizePolicy1);\\n\\n lineEditArmor->setFont(font1);\\n\\n\\n\\n horizontalLayout_3->addWidget(lineEditArmor);\\n\\n\\n\\n horizontalLayout_3->setStretch(0, 1);\\n\\n horizontalLayout_3->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_3);\\n\\n\\n\\n horizontalLayout_11 = new QHBoxLayout();\\n\\n horizontalLayout_11->setObjectName(QString::fromUtf8(\\\"horizontalLayout_11\\\"));\\n\\n pushButtonSave = new QPushButton(centralwidget);\\n\\n pushButtonSave->setObjectName(QString::fromUtf8(\\\"pushButtonSave\\\"));\\n\\n QSizePolicy sizePolicy2(QSizePolicy::Minimum, QSizePolicy::Preferred);\\n\\n sizePolicy2.setHorizontalStretch(0);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 15,\n \"score\": 25550.401684122702\n },\n {\n \"content\": \" horizontalLayout_5->addWidget(fingerPrintButton);\\n\\n\\n\\n lineEditFingerPrint = new QLineEdit(centralwidget);\\n\\n lineEditFingerPrint->setObjectName(QString::fromUtf8(\\\"lineEditFingerPrint\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditFingerPrint->sizePolicy().hasHeightForWidth());\\n\\n lineEditFingerPrint->setSizePolicy(sizePolicy1);\\n\\n lineEditFingerPrint->setFont(font1);\\n\\n\\n\\n horizontalLayout_5->addWidget(lineEditFingerPrint);\\n\\n\\n\\n horizontalLayout_5->setStretch(0, 1);\\n\\n horizontalLayout_5->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_5);\\n\\n\\n\\n horizontalLayout_6 = new QHBoxLayout();\\n\\n horizontalLayout_6->setObjectName(QString::fromUtf8(\\\"horizontalLayout_6\\\"));\\n\\n horizontalLayout_6->setSizeConstraint(QLayout::SetDefaultConstraint);\\n\\n luckyWheelButton = new QPushButton(centralwidget);\\n\\n luckyWheelButton->setObjectName(QString::fromUtf8(\\\"luckyWheelButton\\\"));\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 16,\n \"score\": 25550.348689056384\n },\n {\n \"content\": \" horizontalLayout_7->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_7);\\n\\n\\n\\n horizontalLayout = new QHBoxLayout();\\n\\n horizontalLayout->setObjectName(QString::fromUtf8(\\\"horizontalLayout\\\"));\\n\\n horizontalLayout->setSizeConstraint(QLayout::SetDefaultConstraint);\\n\\n snackButton = new QPushButton(centralwidget);\\n\\n snackButton->setObjectName(QString::fromUtf8(\\\"snackButton\\\"));\\n\\n sizePolicy.setHeightForWidth(snackButton->sizePolicy().hasHeightForWidth());\\n\\n snackButton->setSizePolicy(sizePolicy);\\n\\n snackButton->setFont(font);\\n\\n snackButton->setFocusPolicy(Qt::StrongFocus);\\n\\n\\n\\n horizontalLayout->addWidget(snackButton);\\n\\n\\n\\n lineEditSnack = new QLineEdit(centralwidget);\\n\\n lineEditSnack->setObjectName(QString::fromUtf8(\\\"lineEditSnack\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditSnack->sizePolicy().hasHeightForWidth());\\n\\n lineEditSnack->setSizePolicy(sizePolicy1);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 17,\n \"score\": 25550.323083656323\n },\n {\n \"content\": \"\\n\\n lineEditLuckyWheelInteval = new QLineEdit(centralwidget);\\n\\n lineEditLuckyWheelInteval->setObjectName(QString::fromUtf8(\\\"lineEditLuckyWheelInteval\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditLuckyWheelInteval->sizePolicy().hasHeightForWidth());\\n\\n lineEditLuckyWheelInteval->setSizePolicy(sizePolicy1);\\n\\n lineEditLuckyWheelInteval->setFont(font);\\n\\n lineEditLuckyWheelInteval->setAlignment(Qt::AlignCenter);\\n\\n\\n\\n horizontalLayout_6->addWidget(lineEditLuckyWheelInteval);\\n\\n\\n\\n horizontalLayout_6->setStretch(0, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_6);\\n\\n\\n\\n horizontalLayout_8 = new QHBoxLayout();\\n\\n horizontalLayout_8->setObjectName(QString::fromUtf8(\\\"horizontalLayout_8\\\"));\\n\\n horizontalLayout_8->setSizeConstraint(QLayout::SetDefaultConstraint);\\n\\n doomsDay2Button = new QPushButton(centralwidget);\\n\\n doomsDay2Button->setObjectName(QString::fromUtf8(\\\"doomsDay2Button\\\"));\\n\\n sizePolicy.setHeightForWidth(doomsDay2Button->sizePolicy().hasHeightForWidth());\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 18,\n \"score\": 25550.203219563668\n },\n {\n \"content\": \" horizontalLayout_2->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_2);\\n\\n\\n\\n horizontalLayout_4 = new QHBoxLayout();\\n\\n horizontalLayout_4->setObjectName(QString::fromUtf8(\\\"horizontalLayout_4\\\"));\\n\\n horizontalLayout_4->setSizeConstraint(QLayout::SetDefaultConstraint);\\n\\n disconnectProcessButton = new QPushButton(centralwidget);\\n\\n disconnectProcessButton->setObjectName(QString::fromUtf8(\\\"disconnectProcessButton\\\"));\\n\\n sizePolicy.setHeightForWidth(disconnectProcessButton->sizePolicy().hasHeightForWidth());\\n\\n disconnectProcessButton->setSizePolicy(sizePolicy);\\n\\n disconnectProcessButton->setFont(font);\\n\\n disconnectProcessButton->setFocusPolicy(Qt::StrongFocus);\\n\\n disconnectProcessButton->setStyleSheet(QString::fromUtf8(\\\"background-color: rgb(23, 135, 6);\\\"));\\n\\n\\n\\n horizontalLayout_4->addWidget(disconnectProcessButton);\\n\\n\\n\\n lineEditDisconnectProcess = new QLineEdit(centralwidget);\\n\\n lineEditDisconnectProcess->setObjectName(QString::fromUtf8(\\\"lineEditDisconnectProcess\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditDisconnectProcess->sizePolicy().hasHeightForWidth());\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 19,\n \"score\": 25550.195679911343\n },\n {\n \"content\": \" lineEditSnack->setFont(font1);\\n\\n\\n\\n horizontalLayout->addWidget(lineEditSnack);\\n\\n\\n\\n horizontalLayout->setStretch(0, 1);\\n\\n horizontalLayout->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout);\\n\\n\\n\\n horizontalLayout_3 = new QHBoxLayout();\\n\\n horizontalLayout_3->setObjectName(QString::fromUtf8(\\\"horizontalLayout_3\\\"));\\n\\n horizontalLayout_3->setSizeConstraint(QLayout::SetDefaultConstraint);\\n\\n amorButton = new QPushButton(centralwidget);\\n\\n amorButton->setObjectName(QString::fromUtf8(\\\"amorButton\\\"));\\n\\n sizePolicy.setHeightForWidth(amorButton->sizePolicy().hasHeightForWidth());\\n\\n amorButton->setSizePolicy(sizePolicy);\\n\\n amorButton->setFont(font);\\n\\n amorButton->setFocusPolicy(Qt::StrongFocus);\\n\\n\\n\\n horizontalLayout_3->addWidget(amorButton);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 20,\n \"score\": 25550.05344826466\n },\n {\n \"content\": \" sizePolicy2.setVerticalStretch(0);\\n\\n sizePolicy2.setHeightForWidth(pushButtonSave->sizePolicy().hasHeightForWidth());\\n\\n pushButtonSave->setSizePolicy(sizePolicy2);\\n\\n pushButtonSave->setFont(font);\\n\\n\\n\\n horizontalLayout_11->addWidget(pushButtonSave);\\n\\n\\n\\n pushButton_2 = new QPushButton(centralwidget);\\n\\n pushButton_2->setObjectName(QString::fromUtf8(\\\"pushButton_2\\\"));\\n\\n sizePolicy2.setHeightForWidth(pushButton_2->sizePolicy().hasHeightForWidth());\\n\\n pushButton_2->setSizePolicy(sizePolicy2);\\n\\n\\n\\n horizontalLayout_11->addWidget(pushButton_2);\\n\\n\\n\\n horizontalLayout_11->setStretch(0, 1);\\n\\n horizontalLayout_11->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_11);\\n\\n\\n\\n verticalSpacer = new QSpacerItem(20, 36, QSizePolicy::Minimum, QSizePolicy::Expanding);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 21,\n \"score\": 25550.05344826466\n },\n {\n \"content\": \" doomsDay2Button->setSizePolicy(sizePolicy);\\n\\n doomsDay2Button->setFont(font);\\n\\n doomsDay2Button->setFocusPolicy(Qt::StrongFocus);\\n\\n\\n\\n horizontalLayout_8->addWidget(doomsDay2Button);\\n\\n\\n\\n lineEditDoomsDayII = new QLineEdit(centralwidget);\\n\\n lineEditDoomsDayII->setObjectName(QString::fromUtf8(\\\"lineEditDoomsDayII\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditDoomsDayII->sizePolicy().hasHeightForWidth());\\n\\n lineEditDoomsDayII->setSizePolicy(sizePolicy1);\\n\\n lineEditDoomsDayII->setFont(font1);\\n\\n\\n\\n horizontalLayout_8->addWidget(lineEditDoomsDayII);\\n\\n\\n\\n horizontalLayout_8->setStretch(0, 1);\\n\\n horizontalLayout_8->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_8);\\n\\n\\n\\n horizontalLayout_7 = new QHBoxLayout();\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 22,\n \"score\": 25549.959930873683\n },\n {\n \"content\": \" lineEditDisconnectProcess->setSizePolicy(sizePolicy1);\\n\\n lineEditDisconnectProcess->setFont(font1);\\n\\n\\n\\n horizontalLayout_4->addWidget(lineEditDisconnectProcess);\\n\\n\\n\\n horizontalLayout_4->setStretch(0, 1);\\n\\n horizontalLayout_4->setStretch(1, 1);\\n\\n\\n\\n mainlayout->addLayout(horizontalLayout_4);\\n\\n\\n\\n horizontalLayout_5 = new QHBoxLayout();\\n\\n horizontalLayout_5->setObjectName(QString::fromUtf8(\\\"horizontalLayout_5\\\"));\\n\\n horizontalLayout_5->setSizeConstraint(QLayout::SetDefaultConstraint);\\n\\n fingerPrintButton = new QPushButton(centralwidget);\\n\\n fingerPrintButton->setObjectName(QString::fromUtf8(\\\"fingerPrintButton\\\"));\\n\\n sizePolicy.setHeightForWidth(fingerPrintButton->sizePolicy().hasHeightForWidth());\\n\\n fingerPrintButton->setSizePolicy(sizePolicy);\\n\\n fingerPrintButton->setFont(font);\\n\\n fingerPrintButton->setFocusPolicy(Qt::StrongFocus);\\n\\n\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 23,\n \"score\": 25549.94227423583\n },\n {\n \"content\": \" mainlayout->addWidget(labelInfo);\\n\\n\\n\\n mainlayout->setStretch(0, 1);\\n\\n mainlayout->setStretch(1, 1);\\n\\n mainlayout->setStretch(2, 1);\\n\\n mainlayout->setStretch(3, 1);\\n\\n mainlayout->setStretch(4, 1);\\n\\n mainlayout->setStretch(5, 1);\\n\\n mainlayout->setStretch(6, 1);\\n\\n mainlayout->setStretch(7, 1);\\n\\n mainlayout->setStretch(8, 1);\\n\\n mainlayout->setStretch(9, 1);\\n\\n mainlayout->setStretch(10, 1);\\n\\n mainlayout->setStretch(11, 1);\\n\\n\\n\\n rootlayout->addLayout(mainlayout);\\n\\n\\n\\n bottomlayout = new QHBoxLayout();\\n\\n bottomlayout->setObjectName(QString::fromUtf8(\\\"bottomlayout\\\"));\\n\\n\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 24,\n \"score\": 25549.854142574684\n },\n {\n \"content\": \" sizePolicy.setHeightForWidth(luckyWheelButton->sizePolicy().hasHeightForWidth());\\n\\n luckyWheelButton->setSizePolicy(sizePolicy);\\n\\n luckyWheelButton->setFont(font);\\n\\n luckyWheelButton->setFocusPolicy(Qt::StrongFocus);\\n\\n\\n\\n horizontalLayout_6->addWidget(luckyWheelButton);\\n\\n\\n\\n lineEditLuckyWheel = new QLineEdit(centralwidget);\\n\\n lineEditLuckyWheel->setObjectName(QString::fromUtf8(\\\"lineEditLuckyWheel\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditLuckyWheel->sizePolicy().hasHeightForWidth());\\n\\n lineEditLuckyWheel->setSizePolicy(sizePolicy1);\\n\\n lineEditLuckyWheel->setFont(font1);\\n\\n\\n\\n horizontalLayout_6->addWidget(lineEditLuckyWheel);\\n\\n\\n\\n labelLuckWheel = new QLabel(centralwidget);\\n\\n labelLuckWheel->setObjectName(QString::fromUtf8(\\\"labelLuckWheel\\\"));\\n\\n labelLuckWheel->setFont(font);\\n\\n\\n\\n horizontalLayout_6->addWidget(labelLuckWheel);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 25,\n \"score\": 25549.81205656967\n },\n {\n \"content\": \" horizontalLayout_7->setObjectName(QString::fromUtf8(\\\"horizontalLayout_7\\\"));\\n\\n horizontalLayout_7->setSizeConstraint(QLayout::SetDefaultConstraint);\\n\\n doomsDay3Button = new QPushButton(centralwidget);\\n\\n doomsDay3Button->setObjectName(QString::fromUtf8(\\\"doomsDay3Button\\\"));\\n\\n sizePolicy.setHeightForWidth(doomsDay3Button->sizePolicy().hasHeightForWidth());\\n\\n doomsDay3Button->setSizePolicy(sizePolicy);\\n\\n doomsDay3Button->setFont(font);\\n\\n doomsDay3Button->setFocusPolicy(Qt::StrongFocus);\\n\\n\\n\\n horizontalLayout_7->addWidget(doomsDay3Button);\\n\\n\\n\\n lineEditDoomsDayIII = new QLineEdit(centralwidget);\\n\\n lineEditDoomsDayIII->setObjectName(QString::fromUtf8(\\\"lineEditDoomsDayIII\\\"));\\n\\n sizePolicy1.setHeightForWidth(lineEditDoomsDayIII->sizePolicy().hasHeightForWidth());\\n\\n lineEditDoomsDayIII->setSizePolicy(sizePolicy1);\\n\\n lineEditDoomsDayIII->setFont(font1);\\n\\n\\n\\n horizontalLayout_7->addWidget(lineEditDoomsDayIII);\\n\\n\\n\\n horizontalLayout_7->setStretch(0, 1);\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 26,\n \"score\": 25549.679123929003\n },\n {\n \"content\": \" QLabel *labelLuckWheel;\\n\\n QLineEdit *lineEditLuckyWheelInteval;\\n\\n QHBoxLayout *horizontalLayout_8;\\n\\n QPushButton *doomsDay2Button;\\n\\n QLineEdit *lineEditDoomsDayII;\\n\\n QHBoxLayout *horizontalLayout_7;\\n\\n QPushButton *doomsDay3Button;\\n\\n QLineEdit *lineEditDoomsDayIII;\\n\\n QHBoxLayout *horizontalLayout;\\n\\n QPushButton *snackButton;\\n\\n QLineEdit *lineEditSnack;\\n\\n QHBoxLayout *horizontalLayout_3;\\n\\n QPushButton *amorButton;\\n\\n QLineEdit *lineEditArmor;\\n\\n QHBoxLayout *horizontalLayout_11;\\n\\n QPushButton *pushButtonSave;\\n\\n QPushButton *pushButton_2;\\n\\n QSpacerItem *verticalSpacer;\\n\\n QLabel *labelPrompt;\\n\\n QLabel *labelInfo;\\n\",\n \"file_path\": \"PlayTools/ui_mainwindow.h\",\n \"rank\": 27,\n \"score\": 25548.067146302317\n },\n {\n \"content\": \"#include <Windows.h>\\n\\n#include \\\"AutoMate.h\\\"\\n\\n#include <QKeyEvent>\\n\\n#include <QCoreApplication>\\n\\n\\n\\n#include \\\"mainwindow.h\\\"\\n\\n\\n\\n// \\n\\nstatic const int KEY_PRESS_INTERVAL = 300;\\n\\n\\n\\nAutoMate::AutoMate():m_MainWindow(nullptr)\\n\\n{\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\nAutoMate::~AutoMate()\\n\\n{\\n\\n}\\n\\n\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 28,\n \"score\": 24327.17434815405\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid AutoMate::KeyUp(WORD keyCode)\\n\\n{\\n\\n\\tKeyPress(keyCode, true);\\n\\n}\\n\\n\\n\\nvoid AutoMate::KeyClick(WORD keyCode)\\n\\n{\\n\\n\\tKeyPress(keyCode);\\n\\n\\tSleep(100);\\n\\n\\tKeyPress(keyCode, true);\\n\\n}\\n\\n\\n\\nvoid AutoMate::SendTestCommand()\\n\\n{\\n\\n\\tSleep(KEY_PRESS_INTERVAL);\\n\\n\\n\\n\\tint sleepTime = 100;\\n\\n\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 29,\n \"score\": 24326.22542566198\n },\n {\n \"content\": \"\\n\\nvoid AutoMate::SendDoomsDayIIICmd()\\n\\n{\\n\\n\\tSleep(KEY_PRESS_INTERVAL);\\n\\n\\n\\n\\tKeyDown(VK_SPACE);\\n\\n\\tSleep(60);\\n\\n\\tKeyDown('D');\\n\\n\\tSleep(20);\\n\\n\\tKeyDown('S');\\n\\n\\tSleep(20);\\n\\n\\tKeyUp(VK_SPACE);\\n\\n\\tSleep(40);\\n\\n\\tKeyUp('D');\\n\\n\\tSleep(20);\\n\\n\\tKeyUp('S');\\n\\n}\\n\\n\\n\\nvoid AutoMate::SendLuckyWheelCmd(int millisec)\\n\\n{\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 30,\n \"score\": 24322.614790764186\n },\n {\n \"content\": \"void AutoMate::SetWindow(QObject* qObj)\\n\\n{\\n\\n\\tm_MainWindow = qObj;\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\nvoid AutoMate::SendSnackCmd()\\n\\n{\\n\\n\\t//keybd_event(VK_TAB, 0, 0, 0);\\n\\n\\t//keybd_event(VK_TAB, 0, KEYEVENTF_KEYUP, 0);\\n\\n\\n\\n\\t//keybd_event(VK_LSHIFT, 0, 0, 0);\\n\\n\\t//keybd_event('M', 0, 0, 0);\\n\\n\\n\\n\\t//keybd_event(VK_LSHIFT, 0, KEYEVENTF_KEYUP, 0);\\n\\n\\t//keybd_event('M', 0, KEYEVENTF_KEYUP, 0);\\n\\n\\n\\n\\t//// press down ctrl+A at the same time\\n\\n\\t//keybd_event(VK_CONTROL, 0, 0, 0);\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 31,\n \"score\": 24322.108782016112\n },\n {\n \"content\": \"\\tSleep(KEY_PRESS_INTERVAL);\\n\\n\\n\\n\\tKeyClick('E');\\n\\n\\tSleep(millisec);\\n\\n\\tKeyClick('S');\\n\\n}\\n\\n\\n\\nvoid AutoMate::SendFingerPrintCmd()\\n\\n{\\n\\n}\\n\\n\\n\\nvoid AutoMate::KeyPress(WORD keyCode, bool bUp /*= false*/)\\n\\n{\\n\\n\\tINPUT input;\\n\\n\\tmemset(&input, 0, sizeof(input));\\n\\n\\n\\n\\tinput.type = INPUT_KEYBOARD;\\n\\n\\tinput.ki.dwExtraInfo = GetMessageExtraInfo();\\n\\n\\t// for DirectInput App, use scan code instead of Virtual code\\n\\n\\tinput.ki.wScan = static_cast<WORD>(MapVirtualKeyEx(keyCode, MAPVK_VK_TO_VSC, GetKeyboardLayout(0)));\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 32,\n \"score\": 24321.45448002296\n },\n {\n \"content\": \"\\n\\n\\tfor (size_t i = 0; i < ARRAYSIZE(keySeq); i++)\\n\\n\\t{\\n\\n\\t\\tKeyClick(keySeq[i]);\\n\\n\\t\\tSleep(50);\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid AutoMate::SendDoomsDayIICmd()\\n\\n{\\n\\n\\tSleep(KEY_PRESS_INTERVAL);\\n\\n\\n\\n\\tKeyDown(VK_SPACE);\\n\\n\\tSleep(500);\\n\\n\\tKeyDown('D');\\n\\n\\tSleep(30);\\n\\n\\tKeyUp(VK_SPACE);\\n\\n\\tSleep(10);\\n\\n\\tKeyUp('D');\\n\\n}\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 33,\n \"score\": 24321.281571140767\n },\n {\n \"content\": \"\\t//keybd_event('A', 0, 0, 0);\\n\\n\\n\\n\\t//Sleep(KEY_PRESS_INTERVAL);\\n\\n\\n\\n\\t//// press up ctrl+A at the same time\\n\\n\\t//keybd_event(VK_CONTROL, 0, KEYEVENTF_KEYUP, 0);\\n\\n\\t//keybd_event('A', 0, KEYEVENTF_KEYUP, 0);\\n\\n\\n\\n\\tSleep(KEY_PRESS_INTERVAL);\\n\\n\\n\\n\\tWORD keySeq[] = { 'M', VK_DOWN, VK_DOWN, VK_RETURN, VK_DOWN, VK_DOWN, VK_RETURN, VK_RETURN, VK_ESCAPE, VK_ESCAPE, VK_ESCAPE };\\n\\n\\n\\n\\tfor (size_t i = 0; i < ARRAYSIZE(keySeq); i++)\\n\\n\\t{\\n\\n\\t\\tKeyClick(keySeq[i]);\\n\\n\\t\\tSleep(50);\\n\\n\\t}\\t\\n\\n}\\n\\n\\n\\nvoid AutoMate::SendArmorCmd()\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 34,\n \"score\": 24320.325305477665\n },\n {\n \"content\": \"\\t// Specifies various aspects of a keystroke.This member can be certain combinations of the following values.\\n\\n\\tDWORD dwFlags = KEYEVENTF_SCANCODE;\\n\\n\\tif (bUp)\\n\\n\\t{\\n\\n\\t\\tdwFlags |= KEYEVENTF_KEYUP;\\n\\n\\t}\\n\\n\\tif (VK_LEFT<=keyCode&&keyCode<=VK_DOWN)\\n\\n\\t{\\n\\n\\t\\tdwFlags |= KEYEVENTF_EXTENDEDKEY;\\n\\n\\t}\\n\\n\\tinput.ki.dwFlags = dwFlags;\\n\\n\\t// The time stamp for the event, in milliseconds. If this parameter is zero, the system will provide its own time stamp.\\n\\n\\tinput.ki.time = 0;\\n\\n\\n\\n\\tSendInput(1, &input, sizeof(INPUT));\\n\\n}\\n\\n\\n\\nvoid AutoMate::KeyDown(WORD keyCode)\\n\\n{\\n\\n\\tKeyPress(keyCode);\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 35,\n \"score\": 24320.091208424983\n },\n {\n \"content\": \"\\tWORD key = 'W';\\n\\n\\tfor (int i = 0; i < 5; i++)\\n\\n\\t{\\n\\n\\t\\tKeyPress(key);\\n\\n\\t\\tSleep(sleepTime);\\n\\n\\t\\tKeyPress(key, true);\\n\\n\\t\\tSleep(sleepTime);\\n\\n\\t}\\n\\n\\t\\n\\n\\tkey = 'A';\\n\\n\\tKeyPress(key);\\n\\n\\tSleep(sleepTime);\\n\\n\\tKeyPress(key, true);\\n\\n\\t\\n\\n}\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 36,\n \"score\": 24320.008683259388\n },\n {\n \"content\": \"{\\n\\n\\t//QKeyEvent keyTab(QEvent::KeyPress, Qt::Key_Tab, Qt::NoModifier);\\n\\n\\t//QKeyEvent keyM(QEvent::KeyPress, Qt::Key_M, Qt::ShiftModifier);\\n\\n\\n\\n\\t//QCoreApplication::sendEvent(m_MainWindow, &keyTab);\\n\\n\\t//QCoreApplication::sendEvent(m_MainWindow, &keyM);\\n\\n\\n\\n\\t//WORD tab = VK_TAB;\\n\\n\\t//SendKeyInput(&tab, 1);\\n\\n\\n\\n\\t//WORD combine[2] = { VK_LSHIFT, 'K' };\\n\\n\\t//SendKeyInput(combine, 2);\\n\\n\\n\\n\\t//WORD combine2[2] = { VK_CONTROL, 'A' };\\n\\n\\t//SendKeyInput(combine2, 2);\\n\\n\\n\\n\\tSleep(KEY_PRESS_INTERVAL);\\n\\n\\n\\n\\tWORD keySeq[] = { 'M', VK_DOWN, VK_DOWN, VK_RETURN, VK_DOWN, VK_RETURN, \\n\\n\\t\\tVK_DOWN, VK_DOWN, VK_DOWN, VK_DOWN, VK_RETURN, VK_ESCAPE, VK_ESCAPE, VK_ESCAPE };\\n\",\n \"file_path\": \"PlayTools/AutoMate.cpp\",\n \"rank\": 37,\n \"score\": 24316.799613428193\n },\n {\n \"content\": \"class AutoMate;\\n\",\n \"file_path\": \"PlayTools/mainwindow.h\",\n \"rank\": 38,\n \"score\": 24316.799613428193\n },\n {\n \"content\": \"\\tprivate:\\n\\n\\t\\tbool valid;\\n\\n\\t};\\n\\n\\n\\n\\t//! Constructor\\n\\n\\texplicit QHotkey(QObject *parent = Q_NULLPTR);\\n\\n\\t//! Constructs a hotkey with a shortcut and optionally registers it\\n\\n\\texplicit QHotkey(const QKeySequence &shortcut, bool autoRegister = false, QObject *parent = Q_NULLPTR);\\n\\n\\t//! Constructs a hotkey with a key and modifiers and optionally registers it\\n\\n\\texplicit QHotkey(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister = false, QObject *parent = Q_NULLPTR);\\n\\n\\t//! Constructs a hotkey from a native shortcut and optionally registers it\\n\\n\\texplicit QHotkey(const NativeShortcut &shortcut, bool autoRegister = false, QObject *parent = Q_NULLPTR);\\n\\n\\t//! Destructor\\n\\n\\t~QHotkey();\\n\\n\\n\\n\\t//! READ-Accessor for QHotkey::registered\\n\\n\\tbool isRegistered() const;\\n\\n\\t//! READ-Accessor for QHotkey::shortcut - the key and modifiers as a QKeySequence\\n\\n\\tQKeySequence shortcut() const;\\n\\n\\t//! READ-Accessor for QHotkey::shortcut - the key only\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.h\",\n \"rank\": 39,\n \"score\": 23337.978811635025\n },\n {\n \"content\": \"#ifndef QHOTKEY_P_H\\n\\n#define QHOTKEY_P_H\\n\\n\\n\\n#include \\\"qhotkey.h\\\"\\n\\n#include <QAbstractNativeEventFilter>\\n\\n#include <QMultiHash>\\n\\n#include <QMutex>\\n\\n#include <QGlobalStatic>\\n\\n\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_p.h\",\n \"rank\": 40,\n \"score\": 23337.681059954724\n },\n {\n \"content\": \"#ifndef QHOTKEY_H\\n\\n#define QHOTKEY_H\\n\\n\\n\\n#include <QObject>\\n\\n#include <QKeySequence>\\n\\n#include <QPair>\\n\\n#include <QLoggingCategory>\\n\\n\\n\\n#ifdef QHOTKEY_LIB\\n\\n\\t#ifdef QHOTKEY_LIB_BUILD\\n\\n\\t\\t#define QHOTKEY_SHARED_EXPORT Q_DECL_EXPORT\\n\\n\\t#else\\n\\n\\t\\t#define QHOTKEY_SHARED_EXPORT Q_DECL_IMPORT\\n\\n\\t#endif\\n\\n#else\\n\\n\\t#define QHOTKEY_SHARED_EXPORT\\n\\n#endif\\n\\n\\n\\n//! A class to define global, systemwide Hotkeys\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.h\",\n \"rank\": 41,\n \"score\": 23337.47095158966\n },\n {\n \"content\": \"\\n\\nsignals:\\n\\n\\t//! Will be emitted if the shortcut is pressed\\n\\n\\tvoid activated(QPrivateSignal);\\n\\n\\n\\n\\t//! NOTIFY-Accessor for QHotkey::registered\\n\\n\\tvoid registeredChanged(bool registered);\\n\\n\\n\\nprivate:\\n\\n\\tQt::Key _keyCode;\\n\\n\\tQt::KeyboardModifiers _modifiers;\\n\\n\\n\\n\\tNativeShortcut _nativeShortcut;\\n\\n\\tbool _registered;\\n\\n};\\n\\n\\n\\nuint QHOTKEY_SHARED_EXPORT qHash(const QHotkey::NativeShortcut &key);\\n\\nuint QHOTKEY_SHARED_EXPORT qHash(const QHotkey::NativeShortcut &key, uint seed);\\n\\n\\n\\nQHOTKEY_SHARED_EXPORT Q_DECLARE_LOGGING_CATEGORY(logQHotkey)\\n\\n\\n\\n#endif // QHOTKEY_H\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.h\",\n \"rank\": 42,\n \"score\": 23335.56704063341\n },\n {\n \"content\": \"\\tQt::Key keyCode() const;\\n\\n\\t//! READ-Accessor for QHotkey::shortcut - the modifiers only\\n\\n\\tQt::KeyboardModifiers modifiers() const;\\n\\n\\n\\n\\t//! Get the current native shortcut\\n\\n\\tNativeShortcut currentNativeShortcut() const;\\n\\n\\n\\npublic slots:\\n\\n\\t//! WRITE-Accessor for QHotkey::registered\\n\\n\\tbool setRegistered(bool registered);\\n\\n\\n\\n\\t//! WRITE-Accessor for QHotkey::shortcut\\n\\n\\tbool setShortcut(const QKeySequence &shortcut, bool autoRegister = false);\\n\\n\\t//! WRITE-Accessor for QHotkey::shortcut\\n\\n\\tbool setShortcut(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister = false);\\n\\n\\t//! RESET-Accessor for QHotkey::shortcut\\n\\n\\tbool resetShortcut();\\n\\n\\n\\n\\t//! Set this hotkey to a native shortcut\\n\\n\\tbool setNativeShortcut(NativeShortcut nativeShortcut, bool autoRegister = false);\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.h\",\n \"rank\": 43,\n \"score\": 23332.443711074768\n },\n {\n \"content\": \"\\n\\n\\tvirtual bool registerShortcut(QHotkey::NativeShortcut shortcut) = 0;//platform implement\\n\\n\\tvirtual bool unregisterShortcut(QHotkey::NativeShortcut shortcut) = 0;//platform implement\\n\\n\\n\\nprivate:\\n\\n\\tQMultiHash<QHotkey::NativeShortcut, QHotkey*> shortcuts;\\n\\n\\n\\n\\tQ_INVOKABLE bool addShortcutInvoked(QHotkey *hotkey);\\n\\n\\tQ_INVOKABLE bool removeShortcutInvoked(QHotkey *hotkey);\\n\\n\\tQ_INVOKABLE QHotkey::NativeShortcut nativeShortcutInvoked(Qt::Key keycode, Qt::KeyboardModifiers modifiers);\\n\\n};\\n\\n\\n\\n#define NATIVE_INSTANCE(ClassName) \\\\\\n\\n\\tQ_GLOBAL_STATIC(ClassName, hotkeyPrivate) \\\\\\n\\n\\t\\\\\\n\\n\\tQHotkeyPrivate *QHotkeyPrivate::instance()\\\\\\n\\n\\t{\\\\\\n\\n\\t\\treturn hotkeyPrivate;\\\\\\n\\n\\t}\\n\\n\\n\\n#endif // QHOTKEY_P_H\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_p.h\",\n \"rank\": 44,\n \"score\": 23331.28458441044\n },\n {\n \"content\": \"class QObject;\\n\\n\\n\",\n \"file_path\": \"PlayTools/AutoMate.h\",\n \"rank\": 45,\n \"score\": 22945.935776324022\n },\n {\n \"content\": \"#include \\\"qhotkey.h\\\"\\n\\n#include \\\"qhotkey_p.h\\\"\\n\\n#include <QCoreApplication>\\n\\n#include <QAbstractEventDispatcher>\\n\\n#include <QMetaMethod>\\n\\n#include <QThread>\\n\\n#include <QDebug>\\n\\n\\n\\nQ_LOGGING_CATEGORY(logQHotkey, \\\"QHotkey\\\")\\n\\n\\n\\nQHotkey::QHotkey(QObject *parent) :\\n\\n\\tQObject(parent),\\n\\n\\t_keyCode(Qt::Key_unknown),\\n\\n\\t_modifiers(Qt::NoModifier),\\n\\n\\t_nativeShortcut(),\\n\\n\\t_registered(false)\\n\\n{}\\n\\n\\n\\nQHotkey::QHotkey(const QKeySequence &sequence, bool autoRegister, QObject *parent) :\\n\\n\\tQHotkey(parent)\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 46,\n \"score\": 22025.80373232384\n },\n {\n \"content\": \"{\\n\\n\\tsetShortcut(sequence, autoRegister);\\n\\n}\\n\\n\\n\\nQHotkey::QHotkey(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister, QObject *parent) :\\n\\n\\tQHotkey(parent)\\n\\n{\\n\\n\\tsetShortcut(keyCode, modifiers, autoRegister);\\n\\n}\\n\\n\\n\\nQHotkey::QHotkey(const QHotkey::NativeShortcut &shortcut, bool autoRegister, QObject *parent) :\\n\\n\\tQHotkey(parent)\\n\\n{\\n\\n\\tsetNativeShortcut(shortcut, autoRegister);\\n\\n}\\n\\n\\n\\nQHotkey::~QHotkey()\\n\\n{\\n\\n\\tif(_registered)\\n\\n\\t\\tQHotkeyPrivate::instance()->removeShortcut(this);\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 47,\n \"score\": 22021.40591971448\n },\n {\n \"content\": \"\\t\\t\\tQt::KeyboardModifiers(shortcut[0] & Qt::KeyboardModifierMask),\\n\\n\\t\\t\\tautoRegister);\\n\\n}\\n\\n\\n\\nbool QHotkey::setShortcut(Qt::Key keyCode, Qt::KeyboardModifiers modifiers, bool autoRegister)\\n\\n{\\n\\n\\tif(_registered) {\\n\\n\\t\\tif(autoRegister) {\\n\\n\\t\\t\\tif(!QHotkeyPrivate::instance()->removeShortcut(this))\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t} else\\n\\n\\t\\t\\treturn false;\\n\\n\\t}\\n\\n\\n\\n\\tif(keyCode == Qt::Key_unknown) {\\n\\n\\t\\t_keyCode = Qt::Key_unknown;\\n\\n\\t\\t_modifiers = Qt::NoModifier;\\n\\n\\t\\t_nativeShortcut = NativeShortcut();\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 48,\n \"score\": 22019.562718121564\n },\n {\n \"content\": \"\\n\\n\\tif(nativeShortcut.isValid()) {\\n\\n\\t\\t_keyCode = Qt::Key_unknown;\\n\\n\\t\\t_modifiers = Qt::NoModifier;\\n\\n\\t\\t_nativeShortcut = nativeShortcut;\\n\\n\\t\\tif(autoRegister)\\n\\n\\t\\t\\treturn QHotkeyPrivate::instance()->addShortcut(this);\\n\\n\\t\\telse\\n\\n\\t\\t\\treturn true;\\n\\n\\t} else {\\n\\n\\t\\t_keyCode = Qt::Key_unknown;\\n\\n\\t\\t_modifiers = Qt::NoModifier;\\n\\n\\t\\t_nativeShortcut = NativeShortcut();\\n\\n\\t\\treturn true;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nbool QHotkey::setRegistered(bool registered)\\n\\n{\\n\\n\\tif(_registered && !registered)\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 49,\n \"score\": 22019.429811291455\n },\n {\n \"content\": \"\\tif(_registered &&\\n\\n\\t !QHotkeyPrivate::instance()->removeShortcut(this)) {\\n\\n\\t\\treturn false;\\n\\n\\t}\\n\\n\\n\\n\\t_keyCode = Qt::Key_unknown;\\n\\n\\t_modifiers = Qt::NoModifier;\\n\\n\\t_nativeShortcut = NativeShortcut();\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\nbool QHotkey::setNativeShortcut(QHotkey::NativeShortcut nativeShortcut, bool autoRegister)\\n\\n{\\n\\n\\tif(_registered) {\\n\\n\\t\\tif(autoRegister) {\\n\\n\\t\\t\\tif(!QHotkeyPrivate::instance()->removeShortcut(this))\\n\\n\\t\\t\\t\\treturn false;\\n\\n\\t\\t} else\\n\\n\\t\\t\\treturn false;\\n\\n\\t}\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 50,\n \"score\": 22019.392114987248\n },\n {\n \"content\": \"\\n\\n\\t_keyCode = keyCode;\\n\\n\\t_modifiers = modifiers;\\n\\n\\t_nativeShortcut = QHotkeyPrivate::instance()->nativeShortcut(keyCode, modifiers);\\n\\n\\tif(_nativeShortcut.isValid()) {\\n\\n\\t\\tif(autoRegister)\\n\\n\\t\\t\\treturn QHotkeyPrivate::instance()->addShortcut(this);\\n\\n\\t\\telse\\n\\n\\t\\t\\treturn true;\\n\\n\\t} else {\\n\\n\\t\\tqCWarning(logQHotkey) << \\\"Unable to map shortcut to native keys. Key:\\\" << keyCode << \\\"Modifiers:\\\" << modifiers;\\n\\n\\t\\t_keyCode = Qt::Key_unknown;\\n\\n\\t\\t_modifiers = Qt::NoModifier;\\n\\n\\t\\t_nativeShortcut = NativeShortcut();\\n\\n\\t\\treturn false;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nbool QHotkey::resetShortcut()\\n\\n{\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 51,\n \"score\": 22018.066587381203\n },\n {\n \"content\": \"\\tshortcuts.insert(shortcut, hotkey);\\n\\n\\thotkey->_registered = true;\\n\\n\\treturn true;\\n\\n}\\n\\n\\n\\nbool QHotkeyPrivate::removeShortcutInvoked(QHotkey *hotkey)\\n\\n{\\n\\n\\tQHotkey::NativeShortcut shortcut = hotkey->_nativeShortcut;\\n\\n\\n\\n\\tif(shortcuts.remove(shortcut, hotkey) == 0)\\n\\n\\t\\treturn false;\\n\\n\\thotkey->_registered = false;\\n\\n\\temit hotkey->registeredChanged(true);\\n\\n\\tif(shortcuts.count(shortcut) == 0)\\n\\n\\t\\treturn unregisterShortcut(shortcut);\\n\\n\\telse\\n\\n\\t\\treturn true;\\n\\n}\\n\\n\\n\\nQHotkey::NativeShortcut QHotkeyPrivate::nativeShortcutInvoked(Qt::Key keycode, Qt::KeyboardModifiers modifiers)\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 52,\n \"score\": 22017.919077308954\n },\n {\n \"content\": \"{\\n\\n\\tbool ok1, ok2 = false;\\n\\n\\tauto k = nativeKeycode(keycode, ok1);\\n\\n\\tauto m = nativeModifiers(modifiers, ok2);\\n\\n\\tif(ok1 && ok2)\\n\\n\\t\\treturn {k, m};\\n\\n\\telse\\n\\n\\t\\treturn {};\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\nQHotkey::NativeShortcut::NativeShortcut() :\\n\\n\\tkey(),\\n\\n\\tmodifier(),\\n\\n\\tvalid(false)\\n\\n{}\\n\\n\\n\\nQHotkey::NativeShortcut::NativeShortcut(quint32 key, quint32 modifier) :\\n\\n\\tkey(key),\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 53,\n \"score\": 22017.612077618312\n },\n {\n \"content\": \"\\tmodifier(modifier),\\n\\n\\tvalid(true)\\n\\n{}\\n\\n\\n\\nbool QHotkey::NativeShortcut::isValid() const\\n\\n{\\n\\n\\treturn valid;\\n\\n}\\n\\n\\n\\nbool QHotkey::NativeShortcut::operator ==(const QHotkey::NativeShortcut &other) const\\n\\n{\\n\\n\\treturn (key == other.key) &&\\n\\n\\t\\t (modifier == other.modifier) &&\\n\\n\\t\\t valid == other.valid;\\n\\n}\\n\\n\\n\\nbool QHotkey::NativeShortcut::operator !=(const QHotkey::NativeShortcut &other) const\\n\\n{\\n\\n\\treturn (key != other.key) ||\\n\\n\\t\\t (modifier != other.modifier) ||\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 54,\n \"score\": 22016.726845184043\n },\n {\n \"content\": \"\\t\\treturn QHotkeyPrivate::instance()->removeShortcut(this);\\n\\n\\telse if(!_registered && registered) {\\n\\n\\t\\tif(!_nativeShortcut.isValid())\\n\\n\\t\\t\\treturn false;\\n\\n\\t\\telse\\n\\n\\t\\t\\treturn QHotkeyPrivate::instance()->addShortcut(this);\\n\\n\\t} else\\n\\n\\t\\treturn true;\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\n// ---------- QHotkeyPrivate implementation ----------\\n\\n\\n\\nQHotkeyPrivate::QHotkeyPrivate() :\\n\\n\\tshortcuts()\\n\\n{\\n\\n\\tQ_ASSERT_X(qApp, Q_FUNC_INFO, \\\"QHotkey requires QCoreApplication to be instantiated\\\");\\n\\n\\tqApp->eventDispatcher()->installNativeEventFilter(this);\\n\\n}\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 55,\n \"score\": 22016.528679771745\n },\n {\n \"content\": \"QHotkey::NativeShortcut QHotkey::currentNativeShortcut() const\\n\\n{\\n\\n\\treturn _nativeShortcut;\\n\\n}\\n\\n\\n\\nbool QHotkey::isRegistered() const\\n\\n{\\n\\n\\treturn _registered;\\n\\n}\\n\\n\\n\\nbool QHotkey::setShortcut(const QKeySequence &shortcut, bool autoRegister)\\n\\n{\\n\\n\\tif(shortcut.isEmpty()) {\\n\\n\\t\\treturn resetShortcut();\\n\\n\\t} else if(shortcut.count() > 1) {\\n\\n\\t\\tqCWarning(logQHotkey, \\\"Keysequences with multiple shortcuts are not allowed! \\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t \\\"Only the first shortcut will be used!\\\");\\n\\n\\t}\\n\\n\\n\\n\\treturn setShortcut(Qt::Key(shortcut[0] & ~Qt::KeyboardModifierMask),\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 56,\n \"score\": 22016.446279582375\n },\n {\n \"content\": \"\\t} else\\n\\n\\t\\treturn res;\\n\\n}\\n\\n\\n\\nbool QHotkeyPrivate::addShortcut(QHotkey *hotkey)\\n\\n{\\n\\n\\tif(hotkey->_registered)\\n\\n\\t\\treturn false;\\n\\n\\n\\n\\tQt::ConnectionType conType = (QThread::currentThread() == thread() ?\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t Qt::DirectConnection :\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t Qt::BlockingQueuedConnection);\\n\\n\\tbool res = false;\\n\\n\\tif(!QMetaObject::invokeMethod(this, \\\"addShortcutInvoked\\\", conType,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t Q_RETURN_ARG(bool, res),\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t Q_ARG(QHotkey*, hotkey))) {\\n\\n\\t\\treturn false;\\n\\n\\t} else {\\n\\n\\t\\tif(res)\\n\\n\\t\\t\\temit hotkey->registeredChanged(true);\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 57,\n \"score\": 22016.379929397575\n },\n {\n \"content\": \"\\t\\treturn res;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid QHotkeyPrivate::activateShortcut(QHotkey::NativeShortcut shortcut)\\n\\n{\\n\\n\\tQMetaMethod signal = QMetaMethod::fromSignal(&QHotkey::activated);\\n\\n\\tfor(QHotkey *hkey : shortcuts.values(shortcut))\\n\\n\\t\\tsignal.invoke(hkey, Qt::QueuedConnection);\\n\\n}\\n\\n\\n\\nbool QHotkeyPrivate::addShortcutInvoked(QHotkey *hotkey)\\n\\n{\\n\\n\\tQHotkey::NativeShortcut shortcut = hotkey->_nativeShortcut;\\n\\n\\n\\n\\tif(!shortcuts.contains(shortcut)) {\\n\\n\\t\\tif(!registerShortcut(shortcut))\\n\\n\\t\\t\\treturn false;\\n\\n\\t}\\n\\n\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 58,\n \"score\": 22016.3539882985\n },\n {\n \"content\": \"\\t\\t valid != other.valid;\\n\\n}\\n\\n\\n\\nuint qHash(const QHotkey::NativeShortcut &key)\\n\\n{\\n\\n\\treturn qHash(key.key) ^ qHash(key.modifier);\\n\\n}\\n\\n\\n\\nuint qHash(const QHotkey::NativeShortcut &key, uint seed)\\n\\n{\\n\\n\\treturn qHash(key.key, seed) ^ qHash(key.modifier, seed);\\n\\n}\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 59,\n \"score\": 22014.636467450335\n },\n {\n \"content\": \"}\\n\\n\\n\\nQKeySequence QHotkey::shortcut() const\\n\\n{\\n\\n\\tif(_keyCode == Qt::Key_unknown)\\n\\n\\t\\treturn QKeySequence();\\n\\n\\telse\\n\\n\\t\\treturn QKeySequence(_keyCode | _modifiers);\\n\\n}\\n\\n\\n\\nQt::Key QHotkey::keyCode() const\\n\\n{\\n\\n\\treturn _keyCode;\\n\\n}\\n\\n\\n\\nQt::KeyboardModifiers QHotkey::modifiers() const\\n\\n{\\n\\n\\treturn _modifiers;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 60,\n \"score\": 22014.636467450335\n },\n {\n \"content\": \"\\t\\treturn res;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nbool QHotkeyPrivate::removeShortcut(QHotkey *hotkey)\\n\\n{\\n\\n\\tif(!hotkey->_registered)\\n\\n\\t\\treturn false;\\n\\n\\n\\n\\tQt::ConnectionType conType = (QThread::currentThread() == thread() ?\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t Qt::DirectConnection :\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t Qt::BlockingQueuedConnection);\\n\\n\\tbool res = false;\\n\\n\\tif(!QMetaObject::invokeMethod(this, \\\"removeShortcutInvoked\\\", conType,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t Q_RETURN_ARG(bool, res),\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t Q_ARG(QHotkey*, hotkey))) {\\n\\n\\t\\treturn false;\\n\\n\\t} else {\\n\\n\\t\\tif(res)\\n\\n\\t\\t\\temit hotkey->registeredChanged(false);\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 61,\n \"score\": 22014.636467450335\n },\n {\n \"content\": \"\\n\\nQHotkeyPrivate::~QHotkeyPrivate()\\n\\n{\\n\\n\\tif(!shortcuts.isEmpty())\\n\\n\\t\\tqCWarning(logQHotkey) << \\\"QHotkeyPrivate destroyed with registered shortcuts!\\\";\\n\\n\\tif(qApp && qApp->eventDispatcher())\\n\\n\\t\\tqApp->eventDispatcher()->removeNativeEventFilter(this);\\n\\n}\\n\\n\\n\\nQHotkey::NativeShortcut QHotkeyPrivate::nativeShortcut(Qt::Key keycode, Qt::KeyboardModifiers modifiers)\\n\\n{\\n\\n\\tQt::ConnectionType conType = (QThread::currentThread() == thread() ?\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t Qt::DirectConnection :\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t Qt::BlockingQueuedConnection);\\n\\n\\tQHotkey::NativeShortcut res;\\n\\n\\tif(!QMetaObject::invokeMethod(this, \\\"nativeShortcutInvoked\\\", conType,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t Q_RETURN_ARG(QHotkey::NativeShortcut, res),\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t Q_ARG(Qt::Key, keycode),\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t Q_ARG(Qt::KeyboardModifiers, modifiers))) {\\n\\n\\t\\treturn QHotkey::NativeShortcut();\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey.cpp\",\n \"rank\": 62,\n \"score\": 22014.636467450335\n },\n {\n \"content\": \"#include \\\"qhotkey.h\\\"\\n\\n#include \\\"qhotkey_p.h\\\"\\n\\n#include <qt_windows.h>\\n\\n#include <QDebug>\\n\\n\\n\\n#define HKEY_ID(nativeShortcut) (((nativeShortcut.key ^ (nativeShortcut.modifier << 8)) & 0x0FFF) | 0x7000)\\n\\n\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 63,\n \"score\": 20847.195006407463\n },\n {\n \"content\": \"\\tswitch (keycode)\\n\\n\\t{\\n\\n\\tcase Qt::Key_Escape:\\n\\n\\t\\treturn VK_ESCAPE;\\n\\n\\tcase Qt::Key_Tab:\\n\\n\\tcase Qt::Key_Backtab:\\n\\n\\t\\treturn VK_TAB;\\n\\n\\tcase Qt::Key_Backspace:\\n\\n\\t\\treturn VK_BACK;\\n\\n\\tcase Qt::Key_Return:\\n\\n\\tcase Qt::Key_Enter:\\n\\n\\t\\treturn VK_RETURN;\\n\\n\\tcase Qt::Key_Insert:\\n\\n\\t\\treturn VK_INSERT;\\n\\n\\tcase Qt::Key_Delete:\\n\\n\\t\\treturn VK_DELETE;\\n\\n\\tcase Qt::Key_Pause:\\n\\n\\t\\treturn VK_PAUSE;\\n\\n\\tcase Qt::Key_Print:\\n\\n\\t\\treturn VK_PRINT;\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 64,\n \"score\": 20842.453123250096\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t HKEY_ID(shortcut),\\n\\n\\t\\t\\t\\t\\t\\t\\t shortcut.modifier,\\n\\n\\t\\t\\t\\t\\t\\t\\t shortcut.key);\\n\\n\\tif(ok)\\n\\n\\t\\treturn true;\\n\\n\\telse {\\n\\n\\t\\tqCWarning(logQHotkey) << \\\"Failed to register hotkey. Error:\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t << qPrintable(QHotkeyPrivateWin::formatWinError(::GetLastError()));\\n\\n\\t\\treturn false;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nbool QHotkeyPrivateWin::unregisterShortcut(QHotkey::NativeShortcut shortcut)\\n\\n{\\n\\n\\tBOOL ok = UnregisterHotKey(NULL, HKEY_ID(shortcut));\\n\\n\\tif(ok)\\n\\n\\t\\treturn true;\\n\\n\\telse {\\n\\n\\t\\tqCWarning(logQHotkey) << \\\"Failed to unregister hotkey. Error:\\\"\\n\\n\\t\\t\\t\\t\\t\\t\\t << qPrintable(QHotkeyPrivateWin::formatWinError(::GetLastError()));\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 65,\n \"score\": 20842.14627208188\n },\n {\n \"content\": \"}\\n\\n\\n\\nquint32 QHotkeyPrivateWin::nativeModifiers(Qt::KeyboardModifiers modifiers, bool &ok)\\n\\n{\\n\\n\\tquint32 nMods = 0;\\n\\n\\tif (modifiers & Qt::ShiftModifier)\\n\\n\\t\\tnMods |= MOD_SHIFT;\\n\\n\\tif (modifiers & Qt::ControlModifier)\\n\\n\\t\\tnMods |= MOD_CONTROL;\\n\\n\\tif (modifiers & Qt::AltModifier)\\n\\n\\t\\tnMods |= MOD_ALT;\\n\\n\\tif (modifiers & Qt::MetaModifier)\\n\\n\\t\\tnMods |= MOD_WIN;\\n\\n\\tok = true;\\n\\n\\treturn nMods;\\n\\n}\\n\\n\\n\\nbool QHotkeyPrivateWin::registerShortcut(QHotkey::NativeShortcut shortcut)\\n\\n{\\n\\n\\tBOOL ok = RegisterHotKey(NULL,\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 66,\n \"score\": 20841.47427882736\n },\n {\n \"content\": \"\\tQ_UNUSED(eventType);\\n\\n\\tQ_UNUSED(result);\\n\\n\\n\\n\\tMSG* msg = static_cast<MSG*>(message);\\n\\n\\tif(msg->message == WM_HOTKEY)\\n\\n\\t\\tthis->activateShortcut({HIWORD(msg->lParam), LOWORD(msg->lParam)});\\n\\n\\n\\n\\treturn false;\\n\\n}\\n\\n\\n\\nquint32 QHotkeyPrivateWin::nativeKeycode(Qt::Key keycode, bool &ok)\\n\\n{\\n\\n\\tok = true;\\n\\n\\tif(keycode <= 0xFFFF) {//Try to obtain the key from it's \\\"character\\\"\\n\\n\\t\\tconst SHORT vKey = VkKeyScanW(keycode);\\n\\n\\t\\tif(vKey > -1)\\n\\n\\t\\t\\treturn LOBYTE(vKey);\\n\\n\\t}\\n\\n\\n\\n\\t//find key from switch/case --> Only finds a very small subset of keys\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 67,\n \"score\": 20841.47427882736\n },\n {\n \"content\": \"\\tcase Qt::Key_Clear:\\n\\n\\t\\treturn VK_CLEAR;\\n\\n\\tcase Qt::Key_Home:\\n\\n\\t\\treturn VK_HOME;\\n\\n\\tcase Qt::Key_End:\\n\\n\\t\\treturn VK_END;\\n\\n\\tcase Qt::Key_Left:\\n\\n\\t\\treturn VK_LEFT;\\n\\n\\tcase Qt::Key_Up:\\n\\n\\t\\treturn VK_UP;\\n\\n\\tcase Qt::Key_Right:\\n\\n\\t\\treturn VK_RIGHT;\\n\\n\\tcase Qt::Key_Down:\\n\\n\\t\\treturn VK_DOWN;\\n\\n\\tcase Qt::Key_PageUp:\\n\\n\\t\\treturn VK_PRIOR;\\n\\n\\tcase Qt::Key_PageDown:\\n\\n\\t\\treturn VK_NEXT;\\n\\n\\tcase Qt::Key_CapsLock:\\n\\n\\t\\treturn VK_CAPITAL;\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 68,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"\\tcase Qt::Key_MediaPrevious:\\n\\n\\t\\treturn VK_MEDIA_PREV_TRACK;\\n\\n\\tcase Qt::Key_MediaPlay:\\n\\n\\t\\treturn VK_MEDIA_PLAY_PAUSE;\\n\\n\\tcase Qt::Key_MediaStop:\\n\\n\\t\\treturn VK_MEDIA_STOP;\\n\\n\\tcase Qt::Key_VolumeDown:\\n\\n\\t\\treturn VK_VOLUME_DOWN;\\n\\n\\tcase Qt::Key_VolumeUp:\\n\\n\\t\\treturn VK_VOLUME_UP;\\n\\n\\tcase Qt::Key_VolumeMute:\\n\\n\\t\\treturn VK_VOLUME_MUTE;\\n\\n\\tcase Qt::Key_Mode_switch:\\n\\n\\t\\treturn VK_MODECHANGE;\\n\\n\\tcase Qt::Key_Select:\\n\\n\\t\\treturn VK_SELECT;\\n\\n\\tcase Qt::Key_Printer:\\n\\n\\t\\treturn VK_PRINT;\\n\\n\\tcase Qt::Key_Execute:\\n\\n\\t\\treturn VK_EXECUTE;\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 69,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"\\tcase Qt::Key_NumLock:\\n\\n\\t\\treturn VK_NUMLOCK;\\n\\n\\tcase Qt::Key_ScrollLock:\\n\\n\\t\\treturn VK_SCROLL;\\n\\n\\n\\n\\tcase Qt::Key_F1:\\n\\n\\t\\treturn VK_F1;\\n\\n\\tcase Qt::Key_F2:\\n\\n\\t\\treturn VK_F2;\\n\\n\\tcase Qt::Key_F3:\\n\\n\\t\\treturn VK_F3;\\n\\n\\tcase Qt::Key_F4:\\n\\n\\t\\treturn VK_F4;\\n\\n\\tcase Qt::Key_F5:\\n\\n\\t\\treturn VK_F5;\\n\\n\\tcase Qt::Key_F6:\\n\\n\\t\\treturn VK_F6;\\n\\n\\tcase Qt::Key_F7:\\n\\n\\t\\treturn VK_F7;\\n\\n\\tcase Qt::Key_F8:\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 70,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"\\t\\treturn VK_F8;\\n\\n\\tcase Qt::Key_F9:\\n\\n\\t\\treturn VK_F9;\\n\\n\\tcase Qt::Key_F10:\\n\\n\\t\\treturn VK_F10;\\n\\n\\tcase Qt::Key_F11:\\n\\n\\t\\treturn VK_F11;\\n\\n\\tcase Qt::Key_F12:\\n\\n\\t\\treturn VK_F12;\\n\\n\\tcase Qt::Key_F13:\\n\\n\\t\\treturn VK_F13;\\n\\n\\tcase Qt::Key_F14:\\n\\n\\t\\treturn VK_F14;\\n\\n\\tcase Qt::Key_F15:\\n\\n\\t\\treturn VK_F15;\\n\\n\\tcase Qt::Key_F16:\\n\\n\\t\\treturn VK_F16;\\n\\n\\tcase Qt::Key_F17:\\n\\n\\t\\treturn VK_F17;\\n\\n\\tcase Qt::Key_F18:\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 71,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"\\t\\treturn false;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nQString QHotkeyPrivateWin::formatWinError(DWORD winError)\\n\\n{\\n\\n\\twchar_t *buffer = NULL;\\n\\n\\tDWORD num = FormatMessageW(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM,\\n\\n\\t\\t\\t\\t\\t\\t\\t NULL,\\n\\n\\t\\t\\t\\t\\t\\t\\t winError,\\n\\n\\t\\t\\t\\t\\t\\t\\t 0,\\n\\n\\t\\t\\t\\t\\t\\t\\t (LPWSTR)&buffer,\\n\\n\\t\\t\\t\\t\\t\\t\\t 0,\\n\\n\\t\\t\\t\\t\\t\\t\\t NULL);\\n\\n\\tif(buffer) {\\n\\n\\t\\tQString res = QString::fromWCharArray(buffer, num);\\n\\n\\t\\tLocalFree(buffer);\\n\\n\\t\\treturn res;\\n\\n\\t} else\\n\\n\\t\\treturn QString();\\n\\n}\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 72,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"\\t\\treturn VK_BROWSER_HOME;\\n\\n\\n\\n\\tcase Qt::Key_LaunchMail:\\n\\n\\t\\treturn VK_LAUNCH_MAIL;\\n\\n\\tcase Qt::Key_LaunchMedia:\\n\\n\\t\\treturn VK_LAUNCH_MEDIA_SELECT;\\n\\n\\tcase Qt::Key_Launch0:\\n\\n\\t\\treturn VK_LAUNCH_APP1;\\n\\n\\tcase Qt::Key_Launch1:\\n\\n\\t\\treturn VK_LAUNCH_APP2;\\n\\n\\n\\n\\tcase Qt::Key_Massyo:\\n\\n\\t\\treturn VK_OEM_FJ_MASSHOU;\\n\\n\\tcase Qt::Key_Touroku:\\n\\n\\t\\treturn VK_OEM_FJ_TOUROKU;\\n\\n\\n\\n\\tdefault:\\n\\n\\t\\tok = false;\\n\\n\\t\\treturn 0;\\n\\n\\t}\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 73,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"\\tcase Qt::Key_Sleep:\\n\\n\\t\\treturn VK_SLEEP;\\n\\n\\tcase Qt::Key_Period:\\n\\n\\t\\treturn VK_DECIMAL;\\n\\n\\tcase Qt::Key_Play:\\n\\n\\t\\treturn VK_PLAY;\\n\\n\\tcase Qt::Key_Cancel:\\n\\n\\t\\treturn VK_CANCEL;\\n\\n\\n\\n\\tcase Qt::Key_Forward:\\n\\n\\t\\treturn VK_BROWSER_FORWARD;\\n\\n\\tcase Qt::Key_Refresh:\\n\\n\\t\\treturn VK_BROWSER_REFRESH;\\n\\n\\tcase Qt::Key_Stop:\\n\\n\\t\\treturn VK_BROWSER_STOP;\\n\\n\\tcase Qt::Key_Search:\\n\\n\\t\\treturn VK_BROWSER_SEARCH;\\n\\n\\tcase Qt::Key_Favorites:\\n\\n\\t\\treturn VK_BROWSER_FAVORITES;\\n\\n\\tcase Qt::Key_HomePage:\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 74,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"\\t\\treturn VK_F18;\\n\\n\\tcase Qt::Key_F19:\\n\\n\\t\\treturn VK_F19;\\n\\n\\tcase Qt::Key_F20:\\n\\n\\t\\treturn VK_F20;\\n\\n\\tcase Qt::Key_F21:\\n\\n\\t\\treturn VK_F21;\\n\\n\\tcase Qt::Key_F22:\\n\\n\\t\\treturn VK_F22;\\n\\n\\tcase Qt::Key_F23:\\n\\n\\t\\treturn VK_F23;\\n\\n\\tcase Qt::Key_F24:\\n\\n\\t\\treturn VK_F24;\\n\\n\\n\\n\\tcase Qt::Key_Menu:\\n\\n\\t\\treturn VK_APPS;\\n\\n\\tcase Qt::Key_Help:\\n\\n\\t\\treturn VK_HELP;\\n\\n\\tcase Qt::Key_MediaNext:\\n\\n\\t\\treturn VK_MEDIA_NEXT_TRACK;\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 75,\n \"score\": 20839.789674617685\n },\n {\n \"content\": \"class QHOTKEY_SHARED_EXPORT QHotkeyPrivate : public QObject, public QAbstractNativeEventFilter\\n\\n{\\n\\n\\tQ_OBJECT\\n\\n\\n\\npublic:\\n\\n\\tQHotkeyPrivate();//singleton!!!\\n\\n\\t~QHotkeyPrivate();\\n\\n\\n\\n\\tstatic QHotkeyPrivate *instance();\\n\\n\\n\\n\\tQHotkey::NativeShortcut nativeShortcut(Qt::Key keycode, Qt::KeyboardModifiers modifiers);\\n\\n\\n\\n\\tbool addShortcut(QHotkey *hotkey);\\n\\n\\tbool removeShortcut(QHotkey *hotkey);\\n\\n\\n\\nprotected:\\n\\n\\tvoid activateShortcut(QHotkey::NativeShortcut shortcut);\\n\\n\\n\\n\\tvirtual quint32 nativeKeycode(Qt::Key keycode, bool &ok) = 0;//platform implement\\n\\n\\tvirtual quint32 nativeModifiers(Qt::KeyboardModifiers modifiers, bool &ok) = 0;//platform implement\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_p.h\",\n \"rank\": 76,\n \"score\": 19525.829471806344\n },\n {\n \"content\": \"class QHotkeyPrivateWin : public QHotkeyPrivate\\n\\n{\\n\\npublic:\\n\\n\\t// QAbstractNativeEventFilter interface\\n\\n\\tbool nativeEventFilter(const QByteArray &eventType, void *message, long *result) Q_DECL_OVERRIDE;\\n\\n\\n\\nprotected:\\n\\n\\t// QHotkeyPrivate interface\\n\\n\\tquint32 nativeKeycode(Qt::Key keycode, bool &ok) Q_DECL_OVERRIDE;\\n\\n\\tquint32 nativeModifiers(Qt::KeyboardModifiers modifiers, bool &ok) Q_DECL_OVERRIDE;\\n\\n\\tbool registerShortcut(QHotkey::NativeShortcut shortcut) Q_DECL_OVERRIDE;\\n\\n\\tbool unregisterShortcut(QHotkey::NativeShortcut shortcut) Q_DECL_OVERRIDE;\\n\\n\\n\\nprivate:\\n\\n\\tstatic QString formatWinError(DWORD winError);\\n\\n};\\n\\nNATIVE_INSTANCE(QHotkeyPrivateWin)\\n\\n\\n\\nbool QHotkeyPrivateWin::nativeEventFilter(const QByteArray &eventType, void *message, long *result)\\n\\n{\\n\",\n \"file_path\": \"PlayTools/QHotkey/qhotkey_win.cpp\",\n \"rank\": 77,\n \"score\": 14604.602999594015\n },\n {\n \"content\": \"class QHotkey;\\n\\n\\n\",\n \"file_path\": \"PlayTools/mainwindow.h\",\n \"rank\": 78,\n \"score\": 12819.092319040657\n },\n {\n \"content\": \"#ifndef MAINWINDOW_H\\n\\n#define MAINWINDOW_H\\n\\n\\n\\n#include <QMainWindow>\\n\\n#include \\\"firewallrules.h\\\"\\n\\n\\n\\nQT_BEGIN_NAMESPACE\\n\\nnamespace Ui { class MainWindow; }\\n\\nQT_END_NAMESPACE\\n\\n\\n\",\n \"file_path\": \"PlayTools/mainwindow.h\",\n \"rank\": 87,\n \"score\": 6.077993113161154\n },\n {\n \"content\": \" void on_disconnectProcessButton_clicked();\\n\\n\\n\\n void on_fingerPrintButton_clicked();\\n\\n\\n\\n void on_luckyWheelButton_clicked();\\n\\n\\n\\n void on_doomsDay2Button_clicked();\\n\\n\\n\\n void on_doomsDay3Button_clicked();\\n\\n\\n\\n void on_lineEditLuckyWheelInteval_textChanged(const QString &arg1);\\n\\n\\n\\n void on_pushButtonSave_clicked();\\n\\n\\n\\nprivate:\\n\\n void InitUI();\\n\\n void PlaySoundPrompt();\\n\\n void BindHotKeys();\\n\\n void UnBindHotKeys();\\n\\n\\n\",\n \"file_path\": \"PlayTools/mainwindow.h\",\n \"rank\": 89,\n \"score\": 5.885538089636221\n },\n {\n \"content\": \" enum FunctionType\\n\\n {\\n\\n FunctionType_Solo,\\n\\n FunctionType_Disconnect,\\n\\n\\t\\tFunctionType_Finger,\\n\\n\\t\\tFunctionType_Lucky,\\n\\n\\t\\tFunctionType_DoomsDayII,\\n\\n\\t\\tFunctionType_DoomsDayIII,\\n\\n\\t\\tFunctionType_Snack,\\n\\n\\t\\tFunctionType_Armor,\\n\\n\\t\\tFunctionType_Max,\\n\\n\\n\\n };\\n\\n\\n\\nprivate:\\n\\n Ui::MainWindow *ui;\\n\\n AutoMate* m_AutoMate;\\n\\n FirewallRules m_firewallRules;\\n\\n QString m_GtaProcessPath;\\n\\n QHotkey* m_FuncHotkeys[FunctionType_Max];\\n\\n int m_nLuckwheelInteval;\\n\\n};\\n\\n#endif // MAINWINDOW_H\\n\",\n \"file_path\": \"PlayTools/mainwindow.h\",\n \"rank\": 90,\n \"score\": 5.071498423346587\n },\n {\n \"content\": \" RunFirewallCmd(outCmd);\\n\\n}\\n\\n\\n\\nvoid FirewallRules::StopSinglePublicSession()\\n\\n{\\n\\n QString cmd = QString(\\\"netsh advfirewall firewall delete rule name=\\\\\\\"%1\\\\\\\" \\\").arg(SINGLE_PUBLIC_SESSION_NAME);\\n\\n RunFirewallCmd(cmd);\\n\\n}\\n\\n\\n\\nvoid FirewallRules::StartProcessOffline(QString& processName)\\n\\n{\\n\\n\\tQString outCmd = QString(\\\"netsh advfirewall firewall add rule name=\\\\\\\"%1\\\\\\\" dir=out program=\\\\\\\"%2\\\\\\\" action=block enable=yes\\\").arg(PROCESS_OFFLINE_NAME, processName);\\n\\n\\tRunFirewallCmd(outCmd);\\n\\n}\\n\\n\\n\\nvoid FirewallRules::StopProcessOffine()\\n\\n{\\n\\n\\tQString cmd = QString(\\\"netsh advfirewall firewall delete rule name=\\\\\\\"%1\\\\\\\" \\\").arg(PROCESS_OFFLINE_NAME);\\n\\n\\tRunFirewallCmd(cmd);\\n\\n}\\n\",\n \"file_path\": \"PlayTools/firewallrules.cpp\",\n \"rank\": 91,\n \"score\": 4.721488455666886\n },\n {\n \"content\": \"#include \\\"firewallrules.h\\\"\\n\\n#include <qprocess.h>\\n\\n#include <QDebug>\\n\\n#include <windows.h>\\n\\n#include <stdio.h>\\n\\n#include <netfw.h>\\n\\n#include <crtdbg.h>\\n\\n\\n\\n\\n\\n#pragma comment( lib, \\\"ole32.lib\\\" )\\n\\n#pragma comment( lib, \\\"oleaut32.lib\\\" )\\n\\n\\n\\n// https://docs.microsoft.com/en-us/previous-versions/windows/desktop/ics/c-adding-an-outbound-rule?redirectedfrom=MSDN\\n\\n\\n\\n\\n\\n// Instantiate INetFwPolicy2\\n\\nHRESULT WFCOMInitialize(INetFwPolicy2** ppNetFwPolicy2)\\n\\n{\\n\\n HRESULT hr = S_OK;\\n\\n\\n\",\n \"file_path\": \"PlayTools/firewallrules.cpp\",\n \"rank\": 94,\n \"score\": 3.906990842963106\n },\n {\n \"content\": \"#ifndef FIREWALLRULES_H\\n\\n#define FIREWALLRULES_H\\n\\n\\n\\n#include <QString>\\n\\n#include <QProcess>\\n\\n\\n\",\n \"file_path\": \"PlayTools/firewallrules.h\",\n \"rank\": 95,\n \"score\": 3.758345705246968\n },\n {\n \"content\": \"#include \\\"mainwindow.h\\\"\\n\\n\\n\\n#include <QApplication>\\n\\n\\n\\nint main(int argc, char *argv[])\\n\\n{\\n\\n QApplication a(argc, argv);\\n\\n MainWindow w;\\n\\n w.show();\\n\\n return a.exec();\\n\\n}\\n\",\n \"file_path\": \"PlayTools/main.cpp\",\n \"rank\": 96,\n \"score\": 3.530368228026565\n },\n {\n \"content\": \" CurrentProfilesBitMask ^= NET_FW_PROFILE2_PUBLIC;\\n\\n }\\n\\n\\n\\n // Create a new Firewall Rule object.\\n\\n INetFwRule* pFwRule = NULL;\\n\\n hr = CoCreateInstance(\\n\\n __uuidof(NetFwRule),\\n\\n NULL,\\n\\n CLSCTX_INPROC_SERVER,\\n\\n __uuidof(INetFwRule),\\n\\n (void**)&pFwRule);\\n\\n if (FAILED(hr))\\n\\n {\\n\\n printf(\\\"CoCreateInstance for Firewall Rule failed: 0x%08lx\\\\n\\\", hr);\\n\\n goto Cleanup;\\n\\n }\\n\\n\\n\\n BSTR bstrRuleName = SysAllocString(L\\\"OUTBOUND_RULE\\\");\\n\\n BSTR bstrRuleDescription = SysAllocString(L\\\"Allow outbound network traffic from my Application over TCP port 4000\\\");\\n\\n BSTR bstrRuleGroup = SysAllocString(L\\\"Sample Rule Group\\\");\\n\",\n \"file_path\": \"PlayTools/firewallrules.cpp\",\n \"rank\": 98,\n \"score\": 2.8304919841006475\n },\n {\n \"content\": \"{\\n\\n\\n\\n}\\n\\n\\n\\nFirewallRules::~FirewallRules()\\n\\n{\\n\\n}\\n\\n\\n\\nvoid FirewallRules::SetActionListener(IFirewallActionListener* listener)\\n\\n{\\n\\n m_pListener = listener;\\n\\n}\\n\\n\\n\\nvoid FirewallRules::SetFireWallRules()\\n\\n{\\n\\n QProcess cmd;\\n\\n //cmd.start(QString(\\\"netsh interface ip set address \\\\\\\"%1\\\\\\\" dhcp\\\").arg(\\\"WLAN\\\"));\\n\\n cmd.start(QString(\\\"netsh advfirewall firewall add rule name=\\\\\\\"%1\\\\\\\" dir=in program=\\\\\\\"%2\\\\\\\" action=allow\\\")\\n\\n .arg(\\\"fwtest\\\", \\\"C:\\\\\\\\Users\\\\\\\\happycastpc.exe\\\"));\\n\\n \\n\",\n \"file_path\": \"PlayTools/firewallrules.cpp\",\n \"rank\": 99,\n \"score\": 2.563676421724908\n }\n]","isConversational":false}}},{"rowIdx":472,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"fltl/include/mpl/Static.hpp"},"repo_name":{"kind":"string","value":"iambrosie/Grail-Plus"},"commit":{"kind":"string","value":"e102de735e86df241e4311394190ad39181f073b"},"file_code":{"kind":"string","value":"\n\n#ifndef FLTL_STATIC_HPP_\n#define FLTL_STATIC_HPP_\n\n#include <new>\n\nnamespace fltl { namespace mpl {\n\n namespace detail {\n\n template <typename T>\n class StaticValue {\n public:\n inline static T &default_value(void) throw() {\n static T val;\n static bool is_initialized(false);\n if(!is_initialized) {\n is_initialized = true;\n new (&val) T;\n }\n return val;\n }\n };\n\n template <typename T>\n class StaticValue<T *> {\n public:\n inline static T *&default_value(void) throw() {\n static T *val(0);\n return val;\n }\n };\n\n template <>\n class StaticValue<char> {\n public:\n inline static char &default_value(void) throw() {\n static char val('\\0');\n return val;\n }\n };\n\n template <>\n class StaticValue<unsigned char> {\n public:\n inline static unsigned char &default_value(void) throw() {\n static unsigned char val(0U);\n return val;\n }\n };\n\n template <>\n class StaticValue<short> {\n public:\n inline static short &default_value(void) throw() {\n static short val(0);\n return val;\n }\n };\n\n template <>\n class StaticValue<unsigned short> {\n public:\n inline static unsigned short &default_value(void) throw() {\n static unsigned short val(0U);\n return val;\n }\n };\n\n template <>\n class StaticValue<int> {\n public:\n inline static int &default_value(void) throw() {\n static int val(0);\n return val;\n }\n };\n\n template <>\n class StaticValue<unsigned> {\n public:\n inline static unsigned &default_value(void) throw() {\n static unsigned val(0U);\n return val;\n }\n };\n\n template <>\n class StaticValue<long> {\n public:\n inline static long &default_value(void) throw() {\n static long val(0L);\n return val;\n }\n };\n\n template <>\n class StaticValue<unsigned long> {\n public:\n inline static unsigned long &default_value(void) throw() {\n static unsigned long val(0UL);\n return val;\n }\n };\n\n template <>\n class StaticValue<float> {\n public:\n inline static float &default_value(void) throw() {\n static float val(0.0);\n return val;\n }\n };\n\n template <>\n class StaticValue<double> {\n public:\n inline static double &default_value(void) throw() {\n static double val(0.0);\n return val;\n }\n };\n }\n\n \n template <typename T>\n class Static {\n public:\n static const T &VALUE;\n };\n\n template <typename T>\n const T &Static<T>::VALUE(detail::StaticValue<T>::default_value());\n}}\n\n#endif \n"},"prefix":{"kind":"string","value":"\n\n#ifndef FLTL_STATIC_HPP_\n#define FLTL_STATIC_HPP_\n\n#include <new>\n\nnamespace fltl { namespace mpl {\n\n namespace detail {\n\n template <typename T>\n class StaticValue {\n public:\n inline static T &default_value(void) throw() {\n static T val;\n static bool is_initialized(false);\n if(!is_initialized) {\n is_initialized = true;\n new (&val) T;\n }\n return val;\n }\n };\n\n template <typename T>\n class StaticValue<T *> {\n"},"suffix":{"kind":"string","value":"taticValue<unsigned short> {\n public:\n inline static unsigned short &default_value(void) throw() {\n static unsigned short val(0U);\n return val;\n }\n };\n\n template <>\n class StaticValue<int> {\n public:\n inline static int &default_value(void) throw() {\n static int val(0);\n return val;\n }\n };\n\n template <>\n class StaticValue<unsigned> {\n public:\n inline static unsigned &default_value(void) throw() {\n static unsigned val(0U);\n return val;\n }\n };\n\n template <>\n class StaticValue<long> {\n public:\n inline static long &default_value(void) throw() {\n static long val(0L);\n return val;\n }\n };\n\n template <>\n class StaticValue<unsigned long> {\n public:\n inline static unsigned long &default_value(void) throw() {\n static unsigned long val(0UL);\n return val;\n }\n };\n\n template <>\n class StaticValue<float> {\n public:\n inline static float &default_value(void) throw() {\n static float val(0.0);\n return val;\n }\n };\n\n template <>\n class StaticValue<double> {\n public:\n inline static double &default_value(void) throw() {\n static double val(0.0);\n return val;\n }\n };\n }\n\n \n template <typename T>\n class Static {\n public:\n static const T &VALUE;\n };\n\n template <typename T>\n const T &Static<T>::VALUE(detail::StaticValue<T>::default_value());\n}}\n\n#endif \n"},"middle":{"kind":"string","value":" public:\n inline static T *&default_value(void) throw() {\n static T *val(0);\n return val;\n }\n };\n\n template <>\n class StaticValue<char> {\n public:\n inline static char &default_value(void) throw() {\n static char val('\\0');\n return val;\n }\n };\n\n template <>\n class StaticValue<unsigned char> {\n public:\n inline static unsigned char &default_value(void) throw() {\n static unsigned char val(0U);\n return val;\n }\n };\n\n template <>\n class StaticValue<short> {\n public:\n inline static short &default_value(void) throw() {\n static short val(0);\n return val;\n }\n };\n\n template <>\n class S"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":" class IfTrue<true,ThenT,ElseT> {\n\n public:\n\n typedef ThenT type;\n\n };\n\n\n\n template <typename T0, typename T2, typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":1,"score":226457.0076507059},{"content":" class Alphabet<unsigned> : public detail::AlphabetBase<unsigned> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":2,"score":223286.52019498567},{"content":" class Alphabet<short> : public detail::AlphabetBase<short> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":3,"score":223286.52019498567},{"content":" class Alphabet<long> : public detail::AlphabetBase<long> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":4,"score":223286.52019498567},{"content":" class Alphabet<char> : public detail::AlphabetBase<char> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":5,"score":223286.52019498567},{"content":" class Alphabet<int> : public detail::AlphabetBase<int> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":6,"score":223286.52019498567},{"content":" class TestCase : public detail::TestBase {\n\n public:\n\n\n\n static TestCase<TEST_FUNC> self;\n\n\n\n static const char *func_name;\n\n static const char *message;\n\n static bool added_already;\n\n\n\n TestCase<TEST_FUNC> *get_this(void) throw() {\n\n return this;\n\n }\n\n\n\n /// constructor that gets called at runtime when the tests are\n\n /// run\n\n TestCase(const char *_func_name, const char *_message) throw()\n\n : TestBase(get_this())\n\n {\n\n if(!added_already) {\n\n\n","file_path":"fltl/test/Test.hpp","rank":7,"score":213423.31858625574},{"content":" class Alphabet<unsigned short> : public detail::AlphabetBase<unsigned short> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":8,"score":209035.89650685448},{"content":" class Alphabet<unsigned char> : public detail::AlphabetBase<unsigned char> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":9,"score":209035.89650685445},{"content":" class Alphabet<unsigned long> : public detail::AlphabetBase<unsigned long> { };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":10,"score":209035.89650685448},{"content":" class IfTrue {\n\n public:\n\n typedef ElseT type;\n\n };\n\n\n\n template <typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":11,"score":208571.16920689394},{"content":" class SizeOf<IfEqual<void,Unit,detail::sizeof_centinel,Unit>::type> {\n\n public:\n\n enum {\n\n VALUE = 0\n\n };\n\n };\n\n}}\n\n\n\n#endif /* FLTL_MPL_SIZEOF_HPP_ */\n","file_path":"fltl/include/mpl/SizeOf.hpp","rank":24,"score":184801.85542147892},{"content":" class Max : private trait::StaticOnly {\n\n public:\n\n enum {\n\n VALUE = FLTL_FOLD_LEFT(\n\n FLTL_MAX_TEMPLATE_VARIABLE_LIMIT,\n\n FLTL_MAX_OF_2,\n\n FLTL_PACK_0,\n\n v0\n\n )\n\n };\n\n };\n\n}}\n\n\n\n#endif /* FLTL_MPL_MAX_HPP_ */\n","file_path":"fltl/include/mpl/Max.hpp","rank":25,"score":184151.60562454193},{"content":" class Alphabet : public T {\n\n public:\n\n using typename T::alphabet_type;\n\n using typename T::less_type;\n\n using typename T::scope_type;\n\n };\n\n\n\n template<>\n","file_path":"fltl/include/trait/Alphabet.hpp","rank":26,"score":181161.7752890143},{"content":" class AlphaMap : public std::map<\n\n K,\n\n V,\n\n typename trait::Alphabet<K>::less_type\n\n > { };\n\n }\n\n\n\n /// represents a TDOP \"grammar\" of parser categories and their rules.\n\n template <typename AlphaT>\n","file_path":"fltl/include/TDOP.hpp","rank":27,"score":174630.50285953653},{"content":" class Symbol : public Term<AlphaT> {\n\n private:\n\n\n\n friend class TDOP<AlphaT>;\n\n friend class Term<AlphaT>;\n\n friend class Operator<AlphaT>;\n\n friend class detail::SymbolGenerator<AlphaT>;\n\n\n\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\n\n\n\n Symbol(unsigned id) throw()\n\n : Term<AlphaT>(static_cast<int32_t>(id) * -1)\n\n { }\n\n\n\n public:\n\n\n\n typedef symbol_tag tag_type;\n\n\n\n /// constructors\n\n\n","file_path":"fltl/include/tdop/Symbol.hpp","rank":28,"score":170696.76267529235},{"content":" class StaticOnly {\n\n private:\n\n StaticOnly(void) throw() { }\n\n StaticOnly(const StaticOnly &) throw() { }\n\n ~StaticOnly(void) throw() { }\n\n };\n\n\n\n}}\n\n\n\n#endif /* FLTL_TRAIT_STATICONLY_HPP_ */\n","file_path":"fltl/include/trait/StaticOnly.hpp","rank":29,"score":169421.22519320832},{"content":" class Or;\n\n\n\n template <typename T0>\n","file_path":"fltl/include/mpl/Or.hpp","rank":30,"score":168571.751247329},{"content":" class Or {\n\n public:\n\n enum {\n\n RESULT = (T0::RESULT || T1::RESULT || T2::RESULT)\n\n };\n\n };\n\n}}\n\n\n\n#endif /* FLTL_OR_HPP_ */\n","file_path":"fltl/include/mpl/Or.hpp","rank":31,"score":168571.751247329},{"content":" class ProductionBuilder : public trait::Uncopyable {\n\n private:\n\n\n\n friend class CFG<AlphaT>;\n\n\n\n typedef Symbol<AlphaT> symbol_type;\n\n typedef SymbolString<AlphaT> symbol_string_type;\n\n typedef ProductionBuilder<AlphaT> self_type;\n\n\n\n helper::Array<symbol_type> buffer;\n\n\n\n public:\n\n\n\n ProductionBuilder(void) throw()\n\n : buffer()\n\n {\n\n buffer.reserve(32U);\n\n }\n\n\n\n inline self_type &clear(void) throw() {\n","file_path":"fltl/include/cfg/ProductionBuilder.hpp","rank":32,"score":166976.979492891},{"content":" class OpaqueCategory : public Term<AlphaT> {\n\n private:\n\n\n\n friend class TDOP<AlphaT>;\n\n friend class Term<AlphaT>;\n\n friend class Operator<AlphaT>;\n\n friend class OpaqueRule<AlphaT>;\n\n\n\n friend class detail::CategoryGenerator<AlphaT>;\n\n\n\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\n\n\n\n /// construction from other places, e.g. OpaqueRule.\n\n OpaqueCategory(unsigned num) throw()\n\n : Term<AlphaT>(static_cast<int32_t>(num))\n\n { }\n\n\n\n OpaqueCategory(Category<AlphaT> *cat) throw()\n\n : Term<AlphaT>(static_cast<int32_t>(cat->number))\n\n { }\n","file_path":"fltl/include/tdop/OpaqueCategory.hpp","rank":33,"score":163454.15970220845},{"content":" class VariableSymbol : public Symbol<AlphaT> {\n\n private:\n\n\n\n friend class CFG<AlphaT>;\n\n friend class OpaqueProduction<AlphaT>;\n\n friend class detail::PatternData<AlphaT>;\n\n\n\n typedef VariableSymbol<AlphaT> self_type;\n\n\n\n explicit VariableSymbol(const internal_sym_type _value) throw()\n\n : Symbol<AlphaT>(_value)\n\n { }\n\n\n\n public:\n\n\n\n VariableSymbol(void) throw()\n\n : Symbol<AlphaT>(1)\n\n { }\n\n\n\n VariableSymbol(const self_type &that) throw()\n","file_path":"fltl/include/cfg/VariableSymbol.hpp","rank":34,"score":163454.15970220845},{"content":" class TerminalSymbol : public Symbol<AlphaT> {\n\n private:\n\n\n\n friend class CFG<AlphaT>;\n\n friend class detail::PatternData<AlphaT>;\n\n\n\n typedef TerminalSymbol<AlphaT> self_type;\n\n\n\n explicit TerminalSymbol(const internal_sym_type _value) throw()\n\n : cfg::Symbol<AlphaT>(_value)\n\n { }\n\n\n\n public:\n\n\n\n TerminalSymbol(void) throw()\n\n : Symbol<AlphaT>(-1)\n\n { }\n\n\n\n TerminalSymbol(const self_type &that) throw()\n\n : Symbol<AlphaT>(that)\n","file_path":"fltl/include/cfg/TerminalSymbol.hpp","rank":35,"score":163454.15970220845},{"content":" class IfEqual {\n\n public:\n\n typedef ElseT type;\n\n };\n\n\n\n template <typename T0, typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":36,"score":163238.88449801865},{"content":" class IfZero {\n\n public:\n\n typedef ElseT type;\n\n };\n\n\n\n template <typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":37,"score":163238.88449801865},{"content":" class IfUZero {\n\n public:\n\n typedef ElseT type;\n\n };\n\n\n\n template <typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":40,"score":158241.72098946996},{"content":" class IfTypesEqual {\n\n public:\n\n enum {\n\n RESULT = 0\n\n };\n\n };\n\n\n\n template <typename T0, typename T1>\n","file_path":"fltl/include/mpl/If.hpp","rank":41,"score":158241.72098946996},{"content":" class Max2 {\n\n public:\n\n enum {\n\n VALUE = (v0 > v1 ? v0 : v1)\n\n };\n\n };\n\n }\n\n\n\n /// Compute the maximum of 1 to FLTL_MAX_TEMPLATE_VARIABLE_LIMIT values at\n\n /// compile time.\n\n template <\n\n const std::size_t v0\n\n FLTL_ENUMERATE_VALUE_PARAMS(\n\n FLTL_MAX_TEMPLATE_VARIABLE_LIMIT,\n\n v,\n\n const std::size_t,\n\n = 0\n\n )\n\n >\n","file_path":"fltl/include/mpl/Max.hpp","rank":42,"score":158241.72098946996},{"content":" class SizeOf {\n\n public:\n\n enum {\n\n VALUE = sizeof(T)\n\n };\n\n };\n\n\n\n template <typename T>\n","file_path":"fltl/include/mpl/SizeOf.hpp","rank":43,"score":158241.72098946993},{"content":" class PatternBuilder<AlphaT,CatTagT,void,true> {\n\n private:\n\n\n\n friend class AnyOperator<AlphaT>;\n\n friend class AnyOperatorString<AlphaT>;\n\n friend class OpaqueCategory<AlphaT>;\n\n friend class Unbound<AlphaT,category_tag>;\n\n friend class Unbound<AlphaT,category_lb_tag>;\n\n friend class Bound<AlphaT,category_lb_tag>;\n\n friend class OpaquePattern<AlphaT>;\n\n\n\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\n\n typedef PatternBuilder<AlphaT,CatTagT,void,true> self_type;\n\n\n\n PatternData<AlphaT> *pattern;\n\n\n\n PatternBuilder(PatternData<AlphaT> *_pattern) throw()\n\n : pattern(_pattern)\n\n {\n\n PatternData<AlphaT>::incref(pattern);\n","file_path":"fltl/include/tdop/Pattern.hpp","rank":44,"score":155101.9107038744},{"content":" class sizeof_centinel { };\n\n }\n\n\n\n /// Get the byte size for a particular type. this allows us to say that\n\n /// specific types have zero size, which happens to be useful for other\n\n /// mpl classes.\n\n template <typename T>\n","file_path":"fltl/include/mpl/SizeOf.hpp","rank":45,"score":153549.5292812735},{"content":" class SizeOf<void> {\n\n public:\n\n enum {\n\n VALUE = 0\n\n };\n\n };\n\n\n\n // set the size of the Unit type, assuming it's distinct from void.\n\n template <>\n","file_path":"fltl/include/mpl/SizeOf.hpp","rank":46,"score":153214.34483649515},{"content":" class Or<T0,T1,void> {\n\n public:\n\n enum {\n\n RESULT = (T0::RESULT || T1::RESULT)\n\n };\n\n };\n\n\n\n template <typename T0, typename T1, typename T2>\n","file_path":"fltl/include/mpl/Or.hpp","rank":47,"score":152675.05088307703},{"content":" class Or<T0,void,void> {\n\n public:\n\n enum {\n\n RESULT = T0::RESULT\n\n };\n\n };\n\n\n\n template <typename T0, typename T1>\n","file_path":"fltl/include/mpl/Or.hpp","rank":48,"score":152675.05088307703},{"content":" class RemoveReference {\n\n public:\n\n typedef T type;\n\n typedef const T const_type;\n\n };\n\n\n\n template <typename T>\n","file_path":"fltl/include/mpl/RemoveReference.hpp","rank":49,"score":149135.21787895236},{"content":" class AddReference {\n\n public:\n\n typedef T &type;\n\n typedef const T &const_type;\n\n };\n\n\n\n template <typename T>\n","file_path":"fltl/include/mpl/AddReference.hpp","rank":50,"score":149135.21787895236},{"content":" class unusable_type {\n\n private:\n\n explicit unusable_type(void) throw() { }\n\n unusable_type &operator=(const unusable_type &) throw() {\n\n return *this;\n\n }\n\n public:\n\n unusable_type(const unusable_type &) throw() { }\n\n };\n\n }\n\n\n","file_path":"fltl/include/mpl/UserOperators.hpp","rank":51,"score":149135.21787895236},{"content":" class RemoveConst {\n\n public:\n\n typedef T type;\n\n };\n\n\n\n template <typename T>\n","file_path":"fltl/include/mpl/RemoveConst.hpp","rank":52,"score":149135.21787895236},{"content":" class Op ## name { \\\n\n public: \\\n\n typedef void return_type; \\\n\n typedef const OpParamT param_type; \\\n\n FLTL_FORCE_INLINE static void run( \\\n\n const void *, \\\n\n const OpParamT \\\n\n ) throw() { } \\\n\n }\n\n\n\n#define FLTL_USER_OPERATOR0(trait,tag,name,func) \\\n\n FLTL_USER_OPERATOR0_TYPE_SUFFIX(trait,tag,name,func,void,const throw())\n\n\n\n#define FLTL_USER_OPERATOR0_MUT(trait,tag,name,func) \\\n\n FLTL_USER_OPERATOR0_TYPE_SUFFIX(trait,tag,name,func,void,throw())\n\n\n\n#define FLTL_USER_OPERATOR0_TYPE(trait,tag,name,func,tt) \\\n\n FLTL_USER_OPERATOR0_TYPE_SUFFIX(trait,tag,name,func,tt,const throw())\n\n\n\n#define FLTL_USER_OPERATOR0_MUT_TYPE(trait,tag,name,func,tt) \\\n","file_path":"fltl/include/mpl/UserOperators.hpp","rank":53,"score":148800.033434174},{"content":" class IfTypesEqual<T0,T0> {\n\n public:\n\n enum {\n\n RESULT = 1\n\n };\n\n };\n\n}}\n\n\n\n#endif /* FLTL_IF_HPP_ */\n","file_path":"fltl/include/mpl/If.hpp","rank":54,"score":148511.58679592703},{"content":" class SizeOf<const T> {\n\n public:\n\n enum {\n\n VALUE = SizeOf<T>::VALUE\n\n };\n\n };\n\n\n\n template <>\n","file_path":"fltl/include/mpl/SizeOf.hpp","rank":55,"score":148511.58679592703},{"content":" class IfZero<0,ThenT,ElseT> {\n\n public:\n\n typedef ThenT type;\n\n };\n\n\n\n template <const unsigned val, typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":56,"score":148260.7394807559},{"content":" // tag for the \"global\" scope\n\n class global_scope_type { };\n\n\n\n FLTL_MAKE_USER_OP0(UnaryPlus);\n\n FLTL_MAKE_USER_OP0(UnaryMinus);\n\n FLTL_MAKE_USER_OP0(UnaryPreIncrement);\n\n FLTL_MAKE_USER_OP0(UnaryPostIncrement);\n\n FLTL_MAKE_USER_OP0(UnaryPreDecrement);\n\n FLTL_MAKE_USER_OP0(UnaryPostDecrement);\n\n FLTL_MAKE_USER_OP0(UnaryLogicalNot);\n\n FLTL_MAKE_USER_OP0(UnaryBitwiseNot);\n\n FLTL_MAKE_USER_OP0(UnaryIndirection);\n\n FLTL_MAKE_USER_OP0(UnaryReference);\n\n\n\n FLTL_MAKE_USER_OP0(BinaryIndirection); // a->b\n\n\n\n FLTL_MAKE_USER_OP1(BinaryPlus);\n\n FLTL_MAKE_USER_OP1(BinaryMinus);\n\n FLTL_MAKE_USER_OP1(BinaryMult);\n\n FLTL_MAKE_USER_OP1(BinaryDiv);\n\n FLTL_MAKE_USER_OP1(BinaryMod);\n","file_path":"fltl/include/mpl/UserOperators.hpp","rank":57,"score":144974.8118217894},{"content":" class AddReference<T &> {\n\n public:\n\n typedef T &type;\n\n typedef const T &const_type;\n\n };\n\n}}\n\n\n\n#endif /* FLTL_ADDREFERENCE_HPP_ */\n","file_path":"fltl/include/mpl/AddReference.hpp","rank":58,"score":144639.62737701103},{"content":" class RemoveReference<T &> {\n\n public:\n\n typedef T type;\n\n typedef const T const_type;\n\n };\n\n}}\n\n\n\n\n\n#endif /* Grail_Plus_REMOVEREFERENCE_HPP_ */\n","file_path":"fltl/include/mpl/RemoveReference.hpp","rank":59,"score":144639.627377011},{"content":" class IfTypesEqual<T0, const T1> {\n\n public:\n\n enum {\n\n RESULT = IfTypesEqual<T0,T1>::RESULT\n\n };\n\n };\n\n\n\n template <typename T0>\n","file_path":"fltl/include/mpl/If.hpp","rank":60,"score":144100.3334235929},{"content":" class IfTypesEqual<const T0, T1> {\n\n public:\n\n enum {\n\n RESULT = IfTypesEqual<T0,T1>::RESULT\n\n };\n\n };\n\n\n\n template <typename T0, typename T1>\n","file_path":"fltl/include/mpl/If.hpp","rank":61,"score":144100.3334235929},{"content":" class RemoveConst<const T> {\n\n public:\n\n typedef T type;\n\n };\n\n\n\n}}\n\n\n\n#endif /* FLTL_REMOVECONST_HPP_ */\n","file_path":"fltl/include/mpl/RemoveConst.hpp","rank":62,"score":140423.3859806841},{"content":" class IfUZero<0U,ThenT,ElseT> {\n\n public:\n\n typedef ThenT type;\n\n };\n\n\n\n template <typename T0, typename T1>\n","file_path":"fltl/include/mpl/If.hpp","rank":63,"score":140172.53866551293},{"content":" class IfEqual<T0,T0,ThenT,ElseT> {\n\n public:\n\n typedef ThenT type;\n\n };\n\n\n\n template <const int val, typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":64,"score":139952.3888371868},{"content":" class IfTypesEqual<const T0, const T1> {\n\n public:\n\n enum {\n\n RESULT = IfTypesEqual<T0,T1>::RESULT\n\n };\n\n };\n\n\n\n template <typename T0, typename T1>\n","file_path":"fltl/include/mpl/If.hpp","rank":65,"score":139952.3888371868},{"content":" * 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\n\n#ifndef FLTL_IF_HPP_\n\n#define FLTL_IF_HPP_\n\n\n\nnamespace fltl { namespace mpl {\n\n\n\n template <const bool cond, typename ThenT, typename ElseT>\n","file_path":"fltl/include/mpl/If.hpp","rank":66,"score":118993.70568769235},{"content":" * 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\n\n#ifndef FLTL_OR_HPP_\n\n#define FLTL_OR_HPP_\n\n\n\nnamespace fltl { namespace mpl {\n\n\n\n template <typename T0, typename T1=void, typename T2=void>\n","file_path":"fltl/include/mpl/Or.hpp","rank":67,"score":118990.10513004947},{"content":"/*\n\n * Or.hpp\n\n *\n\n * Created on: Mar 3, 2011\n\n * Author: Peter Goodman\n\n * Version: $Id$\n\n *\n\n * Copyright 2011 Peter Goodman, all rights reserved.\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","file_path":"fltl/include/mpl/Or.hpp","rank":68,"score":118974.26359574408},{"content":"/*\n\n * If.hpp\n\n *\n\n * Created on: Jan 17, 2011\n\n * Author: Peter Goodman\n\n * Version: $Id$\n\n *\n\n * Copyright 2011 Peter Goodman, all rights reserved.\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","file_path":"fltl/include/mpl/If.hpp","rank":69,"score":118974.26359574408},{"content":" class AnyOperator {\n\n public:\n\n\n\n typedef AnyOperator<AlphaT> self_type;\n\n typedef any_operator_tag tag_type;\n\n\n\n // any initial rule, regardless of category\n\n FLTL_TDOP_RULE_PATTERN(any_operator_tag)\n\n };\n\n\n\n template <typename AlphaT>\n","file_path":"fltl/include/tdop/Any.hpp","rank":70,"score":118200.88899917314},{"content":" /// offsets into CFG symbol strings\n\n class str {\n\n public:\n\n enum {\n\n REF_COUNT = 0,\n\n HASH = 1,\n\n LENGTH = 2,\n\n FIRST_SYMBOL = 3\n\n };\n\n };\n\n }\n\n\n\n}\n\n\n\n#include \"fltl/include/helper/Pattern.hpp\"\n\n\n\n#include \"fltl/include/cfg/Symbol.hpp\"\n\n#include \"fltl/include/cfg/TerminalSymbol.hpp\"\n\n#include \"fltl/include/cfg/VariableSymbol.hpp\"\n\n#include \"fltl/include/cfg/Production.hpp\"\n\n#include \"fltl/include/cfg/Variable.hpp\"\n\n\n\nnamespace fltl {\n\n\n\n /// context-free grammar type.\n\n ///\n\n /// Assumptions:\n\n /// - AlphaT has a strict weak ordering.\n\n /// - AlphaT is default constructible\n\n /// - AlphaT is copy constructible\n\n template <typename AlphaT>\n","file_path":"fltl/include/CFG.hpp","rank":71,"score":118200.88899917314},{"content":" class AnySymbol {\n\n public:\n\n typedef AnySymbol self_type;\n\n FLTL_CFG_PRODUCTION_PATTERN(any_symbol_tag)\n\n };\n\n\n\n template <typename AlphaT>\n","file_path":"fltl/include/cfg/Any.hpp","rank":72,"score":118200.88899917314},{"content":" class Match;\n\n\n\n template <typename, typename, typename, const unsigned>\n","file_path":"fltl/include/CFG.hpp","rank":73,"score":118200.88899917314},{"content":" * 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\n\n#ifndef FLTL_NO_INLINE_HPP_\n\n#define FLTL_NO_INLINE_HPP_\n\n\n\n#if defined(__INTEL_COMPILER)\n\n#define FLTL_NO_INLINE\n\n#elif defined(_WIN32)\n\n#define FLTL_NO_INLINE __declspec(noinline)\n\n#elif defined(__GNUC__) || defined(__GNUG__)\n\n#define FLTL_NO_INLINE __attribute__((noinline))\n\n#elif defined(__clang__)\n\n#define FLTL_NO_INLINE __attribute__((noinline))\n\n#else\n\n#define FLTL_NO_INLINE\n\n#endif\n\n\n\n#endif /* FLTL_NO_INLINE_HPP_ */\n","file_path":"fltl/include/preprocessor/NO_INLINE.hpp","rank":74,"score":115408.36549629862},{"content":"/*\n\n * NO_INLINE.hpp\n\n *\n\n * Created on: Jan 21, 2011\n\n * Author: Peter Goodman\n\n * Version: $Id$\n\n *\n\n * Copyright 2011 Peter Goodman, all rights reserved.\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","file_path":"fltl/include/preprocessor/NO_INLINE.hpp","rank":75,"score":115401.08564956243},{"content":" * 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\n\n#ifndef FLTL_TRAIT_STATICONLY_HPP_\n\n#define FLTL_TRAIT_STATICONLY_HPP_\n\n\n\nnamespace fltl { namespace trait {\n\n\n","file_path":"fltl/include/trait/StaticOnly.hpp","rank":76,"score":115336.80363407079},{"content":"/*\n\n * StaticOnly.hpp\n\n *\n\n * Created on: Sep 17, 2010\n\n * Author: Peter Goodman\n\n * Version: $Id$\n\n *\n\n * Copyright 2011 Peter Goodman, all rights reserved.\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","file_path":"fltl/include/trait/StaticOnly.hpp","rank":77,"score":115330.56320809183},{"content":" * 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\n\n#ifndef FLTL_MPL_SIZEOF_HPP_\n\n#define FLTL_MPL_SIZEOF_HPP_\n\n\n\n#include \"fltl/include/mpl/If.hpp\"\n\n#include \"fltl/include/mpl/Unit.hpp\"\n\n\n\nnamespace fltl { namespace mpl {\n\n\n\n namespace detail {\n","file_path":"fltl/include/mpl/SizeOf.hpp","rank":78,"score":115128.95823503606},{"content":"#define FLTL_MAX_TEMPLATE_VARIABLE_LIMIT 10\n\n\n\n#if FLTL_TEMPLATE_VARIABLE_LIMIT > (FLTL_MAX_TEMPLATE_VARIABLE_LIMIT - 3)\n\n#error \"The Max template must accept more template arguments.\"\n\n#endif\n\n\n\n/// the fold function for computing the max value of N numbers by computing\n\n/// the value one pair at a time.\n\n#define FLTL_MAX_OF_2(n, _, rest) (detail::Max2<v ## n, rest>::VALUE)\n\n\n\nnamespace fltl { namespace mpl {\n\n\n\n namespace detail {\n\n\n\n /// compute the maximum of two values at compile time.\n\n template <const std::size_t v0, const std::size_t v1>\n","file_path":"fltl/include/mpl/Max.hpp","rank":79,"score":115127.51015726865},{"content":" * 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\n\n#ifndef FLTL_MPL_MAX_HPP_\n\n#define FLTL_MPL_MAX_HPP_\n\n\n\n#include <cstddef>\n\n\n\n#include \"fltl/include/preprocessor/TEMPLATE_VARIABLE_LIMIT.hpp\"\n\n#include \"fltl/include/preprocessor/ENUMERATE_VALUE_PARAMS.hpp\"\n\n#include \"fltl/include/preprocessor/FOLD_LEFT.hpp\"\n\n#include \"fltl/include/preprocessor/PACK.hpp\"\n\n\n\n#include \"fltl/include/trait/StaticOnly.hpp\"\n\n\n","file_path":"fltl/include/mpl/Max.hpp","rank":80,"score":115125.32653526832},{"content":" * 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\n\n#ifndef FLTL_MPL_UNIT_HPP_\n\n#define FLTL_MPL_UNIT_HPP_\n\n\n\nnamespace fltl { namespace mpl {\n\n\n\n typedef void Unit;\n\n}}\n\n\n\n#endif /* FLTL_MPL_UNIT_HPP_ */\n","file_path":"fltl/include/mpl/Unit.hpp","rank":81,"score":115122.68432343363},{"content":"/*\n\n * Max.hpp\n\n *\n\n * Created on: Sep 14, 2010\n\n * Author: Peter Goodman\n\n * Version: $Id$\n\n *\n\n * Copyright 2011 Peter Goodman, all rights reserved.\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","file_path":"fltl/include/mpl/Max.hpp","rank":82,"score":115107.97881819172},{"content":"/*\n\n * SizeOf.hpp\n\n *\n\n * Created on: Sep 15, 2010\n\n * Author: Peter Goodman\n\n * Version: $Id$\n\n *\n\n * Copyright 2011 Peter Goodman, all rights reserved.\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","file_path":"fltl/include/mpl/SizeOf.hpp","rank":83,"score":115107.97881819172},{"content":"/*\n\n * Unit.hpp\n\n *\n\n * Created on: Sep 14, 2010\n\n * Author: Peter Goodman\n\n * Version: $Id$\n\n *\n\n * Copyright 2011 Peter Goodman, all rights reserved.\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","file_path":"fltl/include/mpl/Unit.hpp","rank":84,"score":115107.97881819172},{"content":" class category_tag { };\n","file_path":"fltl/include/TDOP.hpp","rank":85,"score":114621.2933539436},{"content":" /// Don't allow for subtypes of this type to be copied\n\n class Uncopyable {\n\n protected:\n\n\n\n Uncopyable(void) throw() { }\n\n\n\n ~Uncopyable(void) throw() { }\n\n\n\n private:\n\n\n\n Uncopyable(const Uncopyable &) throw() { }\n\n\n\n Uncopyable &operator=(const Uncopyable &) throw() {\n\n return *this;\n\n }\n\n };\n\n\n\n}}\n\n\n\n#endif /* FLTL_TRAIT_UNCOPYABLE_HPP_ */\n","file_path":"fltl/include/trait/Uncopyable.hpp","rank":86,"score":114621.2933539436},{"content":" class rule_tag { };\n\n\n","file_path":"fltl/include/TDOP.hpp","rank":87,"score":114621.2933539436},{"content":" class term_tag { };\n","file_path":"fltl/include/TDOP.hpp","rank":88,"score":114621.2933539436},{"content":" class operator_tag { };\n","file_path":"fltl/include/TDOP.hpp","rank":89,"score":114621.2933539436},{"content":" class symbol_tag { };\n","file_path":"fltl/include/CFG.hpp","rank":90,"score":114621.2933539436},{"content":" class any_operator_tag { };\n","file_path":"fltl/include/TDOP.hpp","rank":91,"score":114621.2933539436},{"content":" class terminal_tag { };\n","file_path":"fltl/include/CFG.hpp","rank":92,"score":114621.2933539436},{"content":" class PatternBuilder;\n\n\n\n template <typename> class PatternData;\n\n\n\n template <typename> class CategoryGenerator;\n\n template <typename> class SymbolGenerator;\n\n template <typename> class RuleGenerator;\n\n template <typename,const bool> class PatternGenerator;\n\n }\n\n\n\n // forward eclaractions\n\n template <typename> class Category;\n\n template <typename> class OpaqueCategory;\n\n template <typename> class Symbol;\n\n template <typename> class Rule;\n\n template <typename> class OpaqueRule;\n\n template <typename> class Term;\n\n\n\n template <typename> class Operator;\n\n template <typename> class OperatorString;\n","file_path":"fltl/include/TDOP.hpp","rank":93,"score":114621.2933539436},{"content":" class Symbol {\n\n protected:\n\n\n\n mutable internal_sym_type value;\n\n\n\n friend class CFG<AlphaT>;\n\n friend class Variable<AlphaT>;\n\n friend class Production<AlphaT>;\n\n friend class OpaqueProduction<AlphaT>;\n\n friend class ProductionBuilder<AlphaT>;\n\n friend class SymbolString<AlphaT>;\n\n friend class VariableSymbol<AlphaT>;\n\n friend class TerminalSymbol<AlphaT>;\n\n friend class detail::SimpleGenerator<AlphaT>;\n\n friend class detail::PatternData<AlphaT>;\n\n\n\n template <typename, typename>\n\n friend class detail::PatternGenerator;\n\n\n\n template <typename, typename, typename, typename>\n","file_path":"fltl/include/cfg/Symbol.hpp","rank":94,"score":114621.2933539436},{"content":" class Generator {\n\n private:\n\n\n\n typedef Generator<AlphaT> self_type;\n\n\n\n friend class detail::CategoryGenerator<AlphaT>;\n\n friend class detail::SymbolGenerator<AlphaT>;\n\n friend class detail::RuleGenerator<AlphaT>;\n\n friend class detail::PatternGenerator<AlphaT,true>;\n\n friend class detail::PatternGenerator<AlphaT,false>;\n\n friend class TDOP<AlphaT>;\n\n\n\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\n\n\n\n // location/navigation information\n\n TDOP<AlphaT> *machine;\n\n tdop::Category<AlphaT> *category;\n\n\n\n union {\n\n tdop::Rule<AlphaT> *rule;\n","file_path":"fltl/include/tdop/Generator.hpp","rank":95,"score":114621.2933539436},{"content":" class symbol_tag { };\n","file_path":"fltl/include/TDOP.hpp","rank":96,"score":114621.2933539436},{"content":" class Category {\n\n private:\n\n\n\n friend class TDOP<AlphaT>;\n\n friend class Term<AlphaT>;\n\n friend class OpaqueCategory<AlphaT>;\n\n friend class OpaqueRule<AlphaT>;\n\n friend class Rule<AlphaT>;\n\n\n\n friend class detail::CategoryGenerator<AlphaT>;\n\n friend class detail::SymbolGenerator<AlphaT>;\n\n friend class detail::RuleGenerator<AlphaT>;\n\n friend class detail::PatternGenerator<AlphaT,true>;\n\n friend class detail::PatternGenerator<AlphaT,false>;\n\n\n\n typedef Category<AlphaT> self_type;\n\n\n\n unsigned ref_count;\n\n\n\n /// the \"number\"/id of this parsercategory\n","file_path":"fltl/include/tdop/Category.hpp","rank":97,"score":114621.2933539436},{"content":" class AnyOperatorString {\n\n public:\n\n\n\n typedef AnyOperatorString<AlphaT> self_type;\n\n typedef any_operator_string_tag tag_type;\n\n\n\n const AnyOperatorStringOfLength<AlphaT>\n\n operator()(unsigned &len) const throw() {\n\n return AnyOperatorStringOfLength<AlphaT>(&len);\n\n }\n\n\n\n // any extension rule, regardless of category\n\n FLTL_TDOP_RULE_PATTERN(any_operator_string_tag)\n\n };\n\n\n\n template <typename AlphaT>\n","file_path":"fltl/include/tdop/Any.hpp","rank":98,"score":114621.2933539436},{"content":" * 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\n\n#ifndef FLTL_FIND_BALANCED_HPP_\n\n#define FLTL_FIND_BALANCED_HPP_\n\n\n\n#include \"grail/include/io/UTF8FileBuffer.hpp\"\n\n\n\nnamespace grail { namespace io { namespace detail {\n\n\n\n /// try to find something that needs to be balanced; assumes non-null\n\n /// ascii\n\n template <const unsigned BUFFER_SIZE, const bool LOOK_FOR_ERRORS>\n\n static bool find_balanced(\n\n UTF8FileBuffer<BUFFER_SIZE> &buffer,\n","file_path":"grail/include/io/detail/find_balanced.hpp","rank":99,"score":25.71117500511673}],"string":"[\n {\n \"content\": \" class IfTrue<true,ThenT,ElseT> {\\n\\n public:\\n\\n typedef ThenT type;\\n\\n };\\n\\n\\n\\n template <typename T0, typename T2, typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 1,\n \"score\": 226457.0076507059\n },\n {\n \"content\": \" class Alphabet<unsigned> : public detail::AlphabetBase<unsigned> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 2,\n \"score\": 223286.52019498567\n },\n {\n \"content\": \" class Alphabet<short> : public detail::AlphabetBase<short> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 3,\n \"score\": 223286.52019498567\n },\n {\n \"content\": \" class Alphabet<long> : public detail::AlphabetBase<long> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 4,\n \"score\": 223286.52019498567\n },\n {\n \"content\": \" class Alphabet<char> : public detail::AlphabetBase<char> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 5,\n \"score\": 223286.52019498567\n },\n {\n \"content\": \" class Alphabet<int> : public detail::AlphabetBase<int> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 6,\n \"score\": 223286.52019498567\n },\n {\n \"content\": \" class TestCase : public detail::TestBase {\\n\\n public:\\n\\n\\n\\n static TestCase<TEST_FUNC> self;\\n\\n\\n\\n static const char *func_name;\\n\\n static const char *message;\\n\\n static bool added_already;\\n\\n\\n\\n TestCase<TEST_FUNC> *get_this(void) throw() {\\n\\n return this;\\n\\n }\\n\\n\\n\\n /// constructor that gets called at runtime when the tests are\\n\\n /// run\\n\\n TestCase(const char *_func_name, const char *_message) throw()\\n\\n : TestBase(get_this())\\n\\n {\\n\\n if(!added_already) {\\n\\n\\n\",\n \"file_path\": \"fltl/test/Test.hpp\",\n \"rank\": 7,\n \"score\": 213423.31858625574\n },\n {\n \"content\": \" class Alphabet<unsigned short> : public detail::AlphabetBase<unsigned short> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 8,\n \"score\": 209035.89650685448\n },\n {\n \"content\": \" class Alphabet<unsigned char> : public detail::AlphabetBase<unsigned char> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 9,\n \"score\": 209035.89650685445\n },\n {\n \"content\": \" class Alphabet<unsigned long> : public detail::AlphabetBase<unsigned long> { };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 10,\n \"score\": 209035.89650685448\n },\n {\n \"content\": \" class IfTrue {\\n\\n public:\\n\\n typedef ElseT type;\\n\\n };\\n\\n\\n\\n template <typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 11,\n \"score\": 208571.16920689394\n },\n {\n \"content\": \" class SizeOf<IfEqual<void,Unit,detail::sizeof_centinel,Unit>::type> {\\n\\n public:\\n\\n enum {\\n\\n VALUE = 0\\n\\n };\\n\\n };\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_MPL_SIZEOF_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/SizeOf.hpp\",\n \"rank\": 24,\n \"score\": 184801.85542147892\n },\n {\n \"content\": \" class Max : private trait::StaticOnly {\\n\\n public:\\n\\n enum {\\n\\n VALUE = FLTL_FOLD_LEFT(\\n\\n FLTL_MAX_TEMPLATE_VARIABLE_LIMIT,\\n\\n FLTL_MAX_OF_2,\\n\\n FLTL_PACK_0,\\n\\n v0\\n\\n )\\n\\n };\\n\\n };\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_MPL_MAX_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/Max.hpp\",\n \"rank\": 25,\n \"score\": 184151.60562454193\n },\n {\n \"content\": \" class Alphabet : public T {\\n\\n public:\\n\\n using typename T::alphabet_type;\\n\\n using typename T::less_type;\\n\\n using typename T::scope_type;\\n\\n };\\n\\n\\n\\n template<>\\n\",\n \"file_path\": \"fltl/include/trait/Alphabet.hpp\",\n \"rank\": 26,\n \"score\": 181161.7752890143\n },\n {\n \"content\": \" class AlphaMap : public std::map<\\n\\n K,\\n\\n V,\\n\\n typename trait::Alphabet<K>::less_type\\n\\n > { };\\n\\n }\\n\\n\\n\\n /// represents a TDOP \\\"grammar\\\" of parser categories and their rules.\\n\\n template <typename AlphaT>\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 27,\n \"score\": 174630.50285953653\n },\n {\n \"content\": \" class Symbol : public Term<AlphaT> {\\n\\n private:\\n\\n\\n\\n friend class TDOP<AlphaT>;\\n\\n friend class Term<AlphaT>;\\n\\n friend class Operator<AlphaT>;\\n\\n friend class detail::SymbolGenerator<AlphaT>;\\n\\n\\n\\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\\n\\n\\n\\n Symbol(unsigned id) throw()\\n\\n : Term<AlphaT>(static_cast<int32_t>(id) * -1)\\n\\n { }\\n\\n\\n\\n public:\\n\\n\\n\\n typedef symbol_tag tag_type;\\n\\n\\n\\n /// constructors\\n\\n\\n\",\n \"file_path\": \"fltl/include/tdop/Symbol.hpp\",\n \"rank\": 28,\n \"score\": 170696.76267529235\n },\n {\n \"content\": \" class StaticOnly {\\n\\n private:\\n\\n StaticOnly(void) throw() { }\\n\\n StaticOnly(const StaticOnly &) throw() { }\\n\\n ~StaticOnly(void) throw() { }\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_TRAIT_STATICONLY_HPP_ */\\n\",\n \"file_path\": \"fltl/include/trait/StaticOnly.hpp\",\n \"rank\": 29,\n \"score\": 169421.22519320832\n },\n {\n \"content\": \" class Or;\\n\\n\\n\\n template <typename T0>\\n\",\n \"file_path\": \"fltl/include/mpl/Or.hpp\",\n \"rank\": 30,\n \"score\": 168571.751247329\n },\n {\n \"content\": \" class Or {\\n\\n public:\\n\\n enum {\\n\\n RESULT = (T0::RESULT || T1::RESULT || T2::RESULT)\\n\\n };\\n\\n };\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_OR_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/Or.hpp\",\n \"rank\": 31,\n \"score\": 168571.751247329\n },\n {\n \"content\": \" class ProductionBuilder : public trait::Uncopyable {\\n\\n private:\\n\\n\\n\\n friend class CFG<AlphaT>;\\n\\n\\n\\n typedef Symbol<AlphaT> symbol_type;\\n\\n typedef SymbolString<AlphaT> symbol_string_type;\\n\\n typedef ProductionBuilder<AlphaT> self_type;\\n\\n\\n\\n helper::Array<symbol_type> buffer;\\n\\n\\n\\n public:\\n\\n\\n\\n ProductionBuilder(void) throw()\\n\\n : buffer()\\n\\n {\\n\\n buffer.reserve(32U);\\n\\n }\\n\\n\\n\\n inline self_type &clear(void) throw() {\\n\",\n \"file_path\": \"fltl/include/cfg/ProductionBuilder.hpp\",\n \"rank\": 32,\n \"score\": 166976.979492891\n },\n {\n \"content\": \" class OpaqueCategory : public Term<AlphaT> {\\n\\n private:\\n\\n\\n\\n friend class TDOP<AlphaT>;\\n\\n friend class Term<AlphaT>;\\n\\n friend class Operator<AlphaT>;\\n\\n friend class OpaqueRule<AlphaT>;\\n\\n\\n\\n friend class detail::CategoryGenerator<AlphaT>;\\n\\n\\n\\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\\n\\n\\n\\n /// construction from other places, e.g. OpaqueRule.\\n\\n OpaqueCategory(unsigned num) throw()\\n\\n : Term<AlphaT>(static_cast<int32_t>(num))\\n\\n { }\\n\\n\\n\\n OpaqueCategory(Category<AlphaT> *cat) throw()\\n\\n : Term<AlphaT>(static_cast<int32_t>(cat->number))\\n\\n { }\\n\",\n \"file_path\": \"fltl/include/tdop/OpaqueCategory.hpp\",\n \"rank\": 33,\n \"score\": 163454.15970220845\n },\n {\n \"content\": \" class VariableSymbol : public Symbol<AlphaT> {\\n\\n private:\\n\\n\\n\\n friend class CFG<AlphaT>;\\n\\n friend class OpaqueProduction<AlphaT>;\\n\\n friend class detail::PatternData<AlphaT>;\\n\\n\\n\\n typedef VariableSymbol<AlphaT> self_type;\\n\\n\\n\\n explicit VariableSymbol(const internal_sym_type _value) throw()\\n\\n : Symbol<AlphaT>(_value)\\n\\n { }\\n\\n\\n\\n public:\\n\\n\\n\\n VariableSymbol(void) throw()\\n\\n : Symbol<AlphaT>(1)\\n\\n { }\\n\\n\\n\\n VariableSymbol(const self_type &that) throw()\\n\",\n \"file_path\": \"fltl/include/cfg/VariableSymbol.hpp\",\n \"rank\": 34,\n \"score\": 163454.15970220845\n },\n {\n \"content\": \" class TerminalSymbol : public Symbol<AlphaT> {\\n\\n private:\\n\\n\\n\\n friend class CFG<AlphaT>;\\n\\n friend class detail::PatternData<AlphaT>;\\n\\n\\n\\n typedef TerminalSymbol<AlphaT> self_type;\\n\\n\\n\\n explicit TerminalSymbol(const internal_sym_type _value) throw()\\n\\n : cfg::Symbol<AlphaT>(_value)\\n\\n { }\\n\\n\\n\\n public:\\n\\n\\n\\n TerminalSymbol(void) throw()\\n\\n : Symbol<AlphaT>(-1)\\n\\n { }\\n\\n\\n\\n TerminalSymbol(const self_type &that) throw()\\n\\n : Symbol<AlphaT>(that)\\n\",\n \"file_path\": \"fltl/include/cfg/TerminalSymbol.hpp\",\n \"rank\": 35,\n \"score\": 163454.15970220845\n },\n {\n \"content\": \" class IfEqual {\\n\\n public:\\n\\n typedef ElseT type;\\n\\n };\\n\\n\\n\\n template <typename T0, typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 36,\n \"score\": 163238.88449801865\n },\n {\n \"content\": \" class IfZero {\\n\\n public:\\n\\n typedef ElseT type;\\n\\n };\\n\\n\\n\\n template <typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 37,\n \"score\": 163238.88449801865\n },\n {\n \"content\": \" class IfUZero {\\n\\n public:\\n\\n typedef ElseT type;\\n\\n };\\n\\n\\n\\n template <typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 40,\n \"score\": 158241.72098946996\n },\n {\n \"content\": \" class IfTypesEqual {\\n\\n public:\\n\\n enum {\\n\\n RESULT = 0\\n\\n };\\n\\n };\\n\\n\\n\\n template <typename T0, typename T1>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 41,\n \"score\": 158241.72098946996\n },\n {\n \"content\": \" class Max2 {\\n\\n public:\\n\\n enum {\\n\\n VALUE = (v0 > v1 ? v0 : v1)\\n\\n };\\n\\n };\\n\\n }\\n\\n\\n\\n /// Compute the maximum of 1 to FLTL_MAX_TEMPLATE_VARIABLE_LIMIT values at\\n\\n /// compile time.\\n\\n template <\\n\\n const std::size_t v0\\n\\n FLTL_ENUMERATE_VALUE_PARAMS(\\n\\n FLTL_MAX_TEMPLATE_VARIABLE_LIMIT,\\n\\n v,\\n\\n const std::size_t,\\n\\n = 0\\n\\n )\\n\\n >\\n\",\n \"file_path\": \"fltl/include/mpl/Max.hpp\",\n \"rank\": 42,\n \"score\": 158241.72098946996\n },\n {\n \"content\": \" class SizeOf {\\n\\n public:\\n\\n enum {\\n\\n VALUE = sizeof(T)\\n\\n };\\n\\n };\\n\\n\\n\\n template <typename T>\\n\",\n \"file_path\": \"fltl/include/mpl/SizeOf.hpp\",\n \"rank\": 43,\n \"score\": 158241.72098946993\n },\n {\n \"content\": \" class PatternBuilder<AlphaT,CatTagT,void,true> {\\n\\n private:\\n\\n\\n\\n friend class AnyOperator<AlphaT>;\\n\\n friend class AnyOperatorString<AlphaT>;\\n\\n friend class OpaqueCategory<AlphaT>;\\n\\n friend class Unbound<AlphaT,category_tag>;\\n\\n friend class Unbound<AlphaT,category_lb_tag>;\\n\\n friend class Bound<AlphaT,category_lb_tag>;\\n\\n friend class OpaquePattern<AlphaT>;\\n\\n\\n\\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\\n\\n typedef PatternBuilder<AlphaT,CatTagT,void,true> self_type;\\n\\n\\n\\n PatternData<AlphaT> *pattern;\\n\\n\\n\\n PatternBuilder(PatternData<AlphaT> *_pattern) throw()\\n\\n : pattern(_pattern)\\n\\n {\\n\\n PatternData<AlphaT>::incref(pattern);\\n\",\n \"file_path\": \"fltl/include/tdop/Pattern.hpp\",\n \"rank\": 44,\n \"score\": 155101.9107038744\n },\n {\n \"content\": \" class sizeof_centinel { };\\n\\n }\\n\\n\\n\\n /// Get the byte size for a particular type. this allows us to say that\\n\\n /// specific types have zero size, which happens to be useful for other\\n\\n /// mpl classes.\\n\\n template <typename T>\\n\",\n \"file_path\": \"fltl/include/mpl/SizeOf.hpp\",\n \"rank\": 45,\n \"score\": 153549.5292812735\n },\n {\n \"content\": \" class SizeOf<void> {\\n\\n public:\\n\\n enum {\\n\\n VALUE = 0\\n\\n };\\n\\n };\\n\\n\\n\\n // set the size of the Unit type, assuming it's distinct from void.\\n\\n template <>\\n\",\n \"file_path\": \"fltl/include/mpl/SizeOf.hpp\",\n \"rank\": 46,\n \"score\": 153214.34483649515\n },\n {\n \"content\": \" class Or<T0,T1,void> {\\n\\n public:\\n\\n enum {\\n\\n RESULT = (T0::RESULT || T1::RESULT)\\n\\n };\\n\\n };\\n\\n\\n\\n template <typename T0, typename T1, typename T2>\\n\",\n \"file_path\": \"fltl/include/mpl/Or.hpp\",\n \"rank\": 47,\n \"score\": 152675.05088307703\n },\n {\n \"content\": \" class Or<T0,void,void> {\\n\\n public:\\n\\n enum {\\n\\n RESULT = T0::RESULT\\n\\n };\\n\\n };\\n\\n\\n\\n template <typename T0, typename T1>\\n\",\n \"file_path\": \"fltl/include/mpl/Or.hpp\",\n \"rank\": 48,\n \"score\": 152675.05088307703\n },\n {\n \"content\": \" class RemoveReference {\\n\\n public:\\n\\n typedef T type;\\n\\n typedef const T const_type;\\n\\n };\\n\\n\\n\\n template <typename T>\\n\",\n \"file_path\": \"fltl/include/mpl/RemoveReference.hpp\",\n \"rank\": 49,\n \"score\": 149135.21787895236\n },\n {\n \"content\": \" class AddReference {\\n\\n public:\\n\\n typedef T &type;\\n\\n typedef const T &const_type;\\n\\n };\\n\\n\\n\\n template <typename T>\\n\",\n \"file_path\": \"fltl/include/mpl/AddReference.hpp\",\n \"rank\": 50,\n \"score\": 149135.21787895236\n },\n {\n \"content\": \" class unusable_type {\\n\\n private:\\n\\n explicit unusable_type(void) throw() { }\\n\\n unusable_type &operator=(const unusable_type &) throw() {\\n\\n return *this;\\n\\n }\\n\\n public:\\n\\n unusable_type(const unusable_type &) throw() { }\\n\\n };\\n\\n }\\n\\n\\n\",\n \"file_path\": \"fltl/include/mpl/UserOperators.hpp\",\n \"rank\": 51,\n \"score\": 149135.21787895236\n },\n {\n \"content\": \" class RemoveConst {\\n\\n public:\\n\\n typedef T type;\\n\\n };\\n\\n\\n\\n template <typename T>\\n\",\n \"file_path\": \"fltl/include/mpl/RemoveConst.hpp\",\n \"rank\": 52,\n \"score\": 149135.21787895236\n },\n {\n \"content\": \" class Op ## name { \\\\\\n\\n public: \\\\\\n\\n typedef void return_type; \\\\\\n\\n typedef const OpParamT param_type; \\\\\\n\\n FLTL_FORCE_INLINE static void run( \\\\\\n\\n const void *, \\\\\\n\\n const OpParamT \\\\\\n\\n ) throw() { } \\\\\\n\\n }\\n\\n\\n\\n#define FLTL_USER_OPERATOR0(trait,tag,name,func) \\\\\\n\\n FLTL_USER_OPERATOR0_TYPE_SUFFIX(trait,tag,name,func,void,const throw())\\n\\n\\n\\n#define FLTL_USER_OPERATOR0_MUT(trait,tag,name,func) \\\\\\n\\n FLTL_USER_OPERATOR0_TYPE_SUFFIX(trait,tag,name,func,void,throw())\\n\\n\\n\\n#define FLTL_USER_OPERATOR0_TYPE(trait,tag,name,func,tt) \\\\\\n\\n FLTL_USER_OPERATOR0_TYPE_SUFFIX(trait,tag,name,func,tt,const throw())\\n\\n\\n\\n#define FLTL_USER_OPERATOR0_MUT_TYPE(trait,tag,name,func,tt) \\\\\\n\",\n \"file_path\": \"fltl/include/mpl/UserOperators.hpp\",\n \"rank\": 53,\n \"score\": 148800.033434174\n },\n {\n \"content\": \" class IfTypesEqual<T0,T0> {\\n\\n public:\\n\\n enum {\\n\\n RESULT = 1\\n\\n };\\n\\n };\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_IF_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 54,\n \"score\": 148511.58679592703\n },\n {\n \"content\": \" class SizeOf<const T> {\\n\\n public:\\n\\n enum {\\n\\n VALUE = SizeOf<T>::VALUE\\n\\n };\\n\\n };\\n\\n\\n\\n template <>\\n\",\n \"file_path\": \"fltl/include/mpl/SizeOf.hpp\",\n \"rank\": 55,\n \"score\": 148511.58679592703\n },\n {\n \"content\": \" class IfZero<0,ThenT,ElseT> {\\n\\n public:\\n\\n typedef ThenT type;\\n\\n };\\n\\n\\n\\n template <const unsigned val, typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 56,\n \"score\": 148260.7394807559\n },\n {\n \"content\": \" // tag for the \\\"global\\\" scope\\n\\n class global_scope_type { };\\n\\n\\n\\n FLTL_MAKE_USER_OP0(UnaryPlus);\\n\\n FLTL_MAKE_USER_OP0(UnaryMinus);\\n\\n FLTL_MAKE_USER_OP0(UnaryPreIncrement);\\n\\n FLTL_MAKE_USER_OP0(UnaryPostIncrement);\\n\\n FLTL_MAKE_USER_OP0(UnaryPreDecrement);\\n\\n FLTL_MAKE_USER_OP0(UnaryPostDecrement);\\n\\n FLTL_MAKE_USER_OP0(UnaryLogicalNot);\\n\\n FLTL_MAKE_USER_OP0(UnaryBitwiseNot);\\n\\n FLTL_MAKE_USER_OP0(UnaryIndirection);\\n\\n FLTL_MAKE_USER_OP0(UnaryReference);\\n\\n\\n\\n FLTL_MAKE_USER_OP0(BinaryIndirection); // a->b\\n\\n\\n\\n FLTL_MAKE_USER_OP1(BinaryPlus);\\n\\n FLTL_MAKE_USER_OP1(BinaryMinus);\\n\\n FLTL_MAKE_USER_OP1(BinaryMult);\\n\\n FLTL_MAKE_USER_OP1(BinaryDiv);\\n\\n FLTL_MAKE_USER_OP1(BinaryMod);\\n\",\n \"file_path\": \"fltl/include/mpl/UserOperators.hpp\",\n \"rank\": 57,\n \"score\": 144974.8118217894\n },\n {\n \"content\": \" class AddReference<T &> {\\n\\n public:\\n\\n typedef T &type;\\n\\n typedef const T &const_type;\\n\\n };\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_ADDREFERENCE_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/AddReference.hpp\",\n \"rank\": 58,\n \"score\": 144639.62737701103\n },\n {\n \"content\": \" class RemoveReference<T &> {\\n\\n public:\\n\\n typedef T type;\\n\\n typedef const T const_type;\\n\\n };\\n\\n}}\\n\\n\\n\\n\\n\\n#endif /* Grail_Plus_REMOVEREFERENCE_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/RemoveReference.hpp\",\n \"rank\": 59,\n \"score\": 144639.627377011\n },\n {\n \"content\": \" class IfTypesEqual<T0, const T1> {\\n\\n public:\\n\\n enum {\\n\\n RESULT = IfTypesEqual<T0,T1>::RESULT\\n\\n };\\n\\n };\\n\\n\\n\\n template <typename T0>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 60,\n \"score\": 144100.3334235929\n },\n {\n \"content\": \" class IfTypesEqual<const T0, T1> {\\n\\n public:\\n\\n enum {\\n\\n RESULT = IfTypesEqual<T0,T1>::RESULT\\n\\n };\\n\\n };\\n\\n\\n\\n template <typename T0, typename T1>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 61,\n \"score\": 144100.3334235929\n },\n {\n \"content\": \" class RemoveConst<const T> {\\n\\n public:\\n\\n typedef T type;\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_REMOVECONST_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/RemoveConst.hpp\",\n \"rank\": 62,\n \"score\": 140423.3859806841\n },\n {\n \"content\": \" class IfUZero<0U,ThenT,ElseT> {\\n\\n public:\\n\\n typedef ThenT type;\\n\\n };\\n\\n\\n\\n template <typename T0, typename T1>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 63,\n \"score\": 140172.53866551293\n },\n {\n \"content\": \" class IfEqual<T0,T0,ThenT,ElseT> {\\n\\n public:\\n\\n typedef ThenT type;\\n\\n };\\n\\n\\n\\n template <const int val, typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 64,\n \"score\": 139952.3888371868\n },\n {\n \"content\": \" class IfTypesEqual<const T0, const T1> {\\n\\n public:\\n\\n enum {\\n\\n RESULT = IfTypesEqual<T0,T1>::RESULT\\n\\n };\\n\\n };\\n\\n\\n\\n template <typename T0, typename T1>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 65,\n \"score\": 139952.3888371868\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_IF_HPP_\\n\\n#define FLTL_IF_HPP_\\n\\n\\n\\nnamespace fltl { namespace mpl {\\n\\n\\n\\n template <const bool cond, typename ThenT, typename ElseT>\\n\",\n \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 66,\n \"score\": 118993.70568769235\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_OR_HPP_\\n\\n#define FLTL_OR_HPP_\\n\\n\\n\\nnamespace fltl { namespace mpl {\\n\\n\\n\\n template <typename T0, typename T1=void, typename T2=void>\\n\",\n \"file_path\": \"fltl/include/mpl/Or.hpp\",\n \"rank\": 67,\n \"score\": 118990.10513004947\n },\n {\n \"content\": \"/*\\n\\n * Or.hpp\\n\\n *\\n\\n * Created on: Mar 3, 2011\\n\\n * Author: Peter Goodman\\n\\n * Version: $Id$\\n\\n *\\n\\n * Copyright 2011 Peter Goodman, all rights reserved.\\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 \"file_path\": \"fltl/include/mpl/Or.hpp\",\n \"rank\": 68,\n \"score\": 118974.26359574408\n },\n {\n \"content\": \"/*\\n\\n * If.hpp\\n\\n *\\n\\n * Created on: Jan 17, 2011\\n\\n * Author: Peter Goodman\\n\\n * Version: $Id$\\n\\n *\\n\\n * Copyright 2011 Peter Goodman, all rights reserved.\\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 \"file_path\": \"fltl/include/mpl/If.hpp\",\n \"rank\": 69,\n \"score\": 118974.26359574408\n },\n {\n \"content\": \" class AnyOperator {\\n\\n public:\\n\\n\\n\\n typedef AnyOperator<AlphaT> self_type;\\n\\n typedef any_operator_tag tag_type;\\n\\n\\n\\n // any initial rule, regardless of category\\n\\n FLTL_TDOP_RULE_PATTERN(any_operator_tag)\\n\\n };\\n\\n\\n\\n template <typename AlphaT>\\n\",\n \"file_path\": \"fltl/include/tdop/Any.hpp\",\n \"rank\": 70,\n \"score\": 118200.88899917314\n },\n {\n \"content\": \" /// offsets into CFG symbol strings\\n\\n class str {\\n\\n public:\\n\\n enum {\\n\\n REF_COUNT = 0,\\n\\n HASH = 1,\\n\\n LENGTH = 2,\\n\\n FIRST_SYMBOL = 3\\n\\n };\\n\\n };\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\n#include \\\"fltl/include/helper/Pattern.hpp\\\"\\n\\n\\n\\n#include \\\"fltl/include/cfg/Symbol.hpp\\\"\\n\\n#include \\\"fltl/include/cfg/TerminalSymbol.hpp\\\"\\n\\n#include \\\"fltl/include/cfg/VariableSymbol.hpp\\\"\\n\\n#include \\\"fltl/include/cfg/Production.hpp\\\"\\n\\n#include \\\"fltl/include/cfg/Variable.hpp\\\"\\n\\n\\n\\nnamespace fltl {\\n\\n\\n\\n /// context-free grammar type.\\n\\n ///\\n\\n /// Assumptions:\\n\\n /// - AlphaT has a strict weak ordering.\\n\\n /// - AlphaT is default constructible\\n\\n /// - AlphaT is copy constructible\\n\\n template <typename AlphaT>\\n\",\n \"file_path\": \"fltl/include/CFG.hpp\",\n \"rank\": 71,\n \"score\": 118200.88899917314\n },\n {\n \"content\": \" class AnySymbol {\\n\\n public:\\n\\n typedef AnySymbol self_type;\\n\\n FLTL_CFG_PRODUCTION_PATTERN(any_symbol_tag)\\n\\n };\\n\\n\\n\\n template <typename AlphaT>\\n\",\n \"file_path\": \"fltl/include/cfg/Any.hpp\",\n \"rank\": 72,\n \"score\": 118200.88899917314\n },\n {\n \"content\": \" class Match;\\n\\n\\n\\n template <typename, typename, typename, const unsigned>\\n\",\n \"file_path\": \"fltl/include/CFG.hpp\",\n \"rank\": 73,\n \"score\": 118200.88899917314\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_NO_INLINE_HPP_\\n\\n#define FLTL_NO_INLINE_HPP_\\n\\n\\n\\n#if defined(__INTEL_COMPILER)\\n\\n#define FLTL_NO_INLINE\\n\\n#elif defined(_WIN32)\\n\\n#define FLTL_NO_INLINE __declspec(noinline)\\n\\n#elif defined(__GNUC__) || defined(__GNUG__)\\n\\n#define FLTL_NO_INLINE __attribute__((noinline))\\n\\n#elif defined(__clang__)\\n\\n#define FLTL_NO_INLINE __attribute__((noinline))\\n\\n#else\\n\\n#define FLTL_NO_INLINE\\n\\n#endif\\n\\n\\n\\n#endif /* FLTL_NO_INLINE_HPP_ */\\n\",\n \"file_path\": \"fltl/include/preprocessor/NO_INLINE.hpp\",\n \"rank\": 74,\n \"score\": 115408.36549629862\n },\n {\n \"content\": \"/*\\n\\n * NO_INLINE.hpp\\n\\n *\\n\\n * Created on: Jan 21, 2011\\n\\n * Author: Peter Goodman\\n\\n * Version: $Id$\\n\\n *\\n\\n * Copyright 2011 Peter Goodman, all rights reserved.\\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 \"file_path\": \"fltl/include/preprocessor/NO_INLINE.hpp\",\n \"rank\": 75,\n \"score\": 115401.08564956243\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_TRAIT_STATICONLY_HPP_\\n\\n#define FLTL_TRAIT_STATICONLY_HPP_\\n\\n\\n\\nnamespace fltl { namespace trait {\\n\\n\\n\",\n \"file_path\": \"fltl/include/trait/StaticOnly.hpp\",\n \"rank\": 76,\n \"score\": 115336.80363407079\n },\n {\n \"content\": \"/*\\n\\n * StaticOnly.hpp\\n\\n *\\n\\n * Created on: Sep 17, 2010\\n\\n * Author: Peter Goodman\\n\\n * Version: $Id$\\n\\n *\\n\\n * Copyright 2011 Peter Goodman, all rights reserved.\\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 \"file_path\": \"fltl/include/trait/StaticOnly.hpp\",\n \"rank\": 77,\n \"score\": 115330.56320809183\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_MPL_SIZEOF_HPP_\\n\\n#define FLTL_MPL_SIZEOF_HPP_\\n\\n\\n\\n#include \\\"fltl/include/mpl/If.hpp\\\"\\n\\n#include \\\"fltl/include/mpl/Unit.hpp\\\"\\n\\n\\n\\nnamespace fltl { namespace mpl {\\n\\n\\n\\n namespace detail {\\n\",\n \"file_path\": \"fltl/include/mpl/SizeOf.hpp\",\n \"rank\": 78,\n \"score\": 115128.95823503606\n },\n {\n \"content\": \"#define FLTL_MAX_TEMPLATE_VARIABLE_LIMIT 10\\n\\n\\n\\n#if FLTL_TEMPLATE_VARIABLE_LIMIT > (FLTL_MAX_TEMPLATE_VARIABLE_LIMIT - 3)\\n\\n#error \\\"The Max template must accept more template arguments.\\\"\\n\\n#endif\\n\\n\\n\\n/// the fold function for computing the max value of N numbers by computing\\n\\n/// the value one pair at a time.\\n\\n#define FLTL_MAX_OF_2(n, _, rest) (detail::Max2<v ## n, rest>::VALUE)\\n\\n\\n\\nnamespace fltl { namespace mpl {\\n\\n\\n\\n namespace detail {\\n\\n\\n\\n /// compute the maximum of two values at compile time.\\n\\n template <const std::size_t v0, const std::size_t v1>\\n\",\n \"file_path\": \"fltl/include/mpl/Max.hpp\",\n \"rank\": 79,\n \"score\": 115127.51015726865\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_MPL_MAX_HPP_\\n\\n#define FLTL_MPL_MAX_HPP_\\n\\n\\n\\n#include <cstddef>\\n\\n\\n\\n#include \\\"fltl/include/preprocessor/TEMPLATE_VARIABLE_LIMIT.hpp\\\"\\n\\n#include \\\"fltl/include/preprocessor/ENUMERATE_VALUE_PARAMS.hpp\\\"\\n\\n#include \\\"fltl/include/preprocessor/FOLD_LEFT.hpp\\\"\\n\\n#include \\\"fltl/include/preprocessor/PACK.hpp\\\"\\n\\n\\n\\n#include \\\"fltl/include/trait/StaticOnly.hpp\\\"\\n\\n\\n\",\n \"file_path\": \"fltl/include/mpl/Max.hpp\",\n \"rank\": 80,\n \"score\": 115125.32653526832\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_MPL_UNIT_HPP_\\n\\n#define FLTL_MPL_UNIT_HPP_\\n\\n\\n\\nnamespace fltl { namespace mpl {\\n\\n\\n\\n typedef void Unit;\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_MPL_UNIT_HPP_ */\\n\",\n \"file_path\": \"fltl/include/mpl/Unit.hpp\",\n \"rank\": 81,\n \"score\": 115122.68432343363\n },\n {\n \"content\": \"/*\\n\\n * Max.hpp\\n\\n *\\n\\n * Created on: Sep 14, 2010\\n\\n * Author: Peter Goodman\\n\\n * Version: $Id$\\n\\n *\\n\\n * Copyright 2011 Peter Goodman, all rights reserved.\\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 \"file_path\": \"fltl/include/mpl/Max.hpp\",\n \"rank\": 82,\n \"score\": 115107.97881819172\n },\n {\n \"content\": \"/*\\n\\n * SizeOf.hpp\\n\\n *\\n\\n * Created on: Sep 15, 2010\\n\\n * Author: Peter Goodman\\n\\n * Version: $Id$\\n\\n *\\n\\n * Copyright 2011 Peter Goodman, all rights reserved.\\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 \"file_path\": \"fltl/include/mpl/SizeOf.hpp\",\n \"rank\": 83,\n \"score\": 115107.97881819172\n },\n {\n \"content\": \"/*\\n\\n * Unit.hpp\\n\\n *\\n\\n * Created on: Sep 14, 2010\\n\\n * Author: Peter Goodman\\n\\n * Version: $Id$\\n\\n *\\n\\n * Copyright 2011 Peter Goodman, all rights reserved.\\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 \"file_path\": \"fltl/include/mpl/Unit.hpp\",\n \"rank\": 84,\n \"score\": 115107.97881819172\n },\n {\n \"content\": \" class category_tag { };\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 85,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" /// Don't allow for subtypes of this type to be copied\\n\\n class Uncopyable {\\n\\n protected:\\n\\n\\n\\n Uncopyable(void) throw() { }\\n\\n\\n\\n ~Uncopyable(void) throw() { }\\n\\n\\n\\n private:\\n\\n\\n\\n Uncopyable(const Uncopyable &) throw() { }\\n\\n\\n\\n Uncopyable &operator=(const Uncopyable &) throw() {\\n\\n return *this;\\n\\n }\\n\\n };\\n\\n\\n\\n}}\\n\\n\\n\\n#endif /* FLTL_TRAIT_UNCOPYABLE_HPP_ */\\n\",\n \"file_path\": \"fltl/include/trait/Uncopyable.hpp\",\n \"rank\": 86,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class rule_tag { };\\n\\n\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 87,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class term_tag { };\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 88,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class operator_tag { };\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 89,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class symbol_tag { };\\n\",\n \"file_path\": \"fltl/include/CFG.hpp\",\n \"rank\": 90,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class any_operator_tag { };\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 91,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class terminal_tag { };\\n\",\n \"file_path\": \"fltl/include/CFG.hpp\",\n \"rank\": 92,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class PatternBuilder;\\n\\n\\n\\n template <typename> class PatternData;\\n\\n\\n\\n template <typename> class CategoryGenerator;\\n\\n template <typename> class SymbolGenerator;\\n\\n template <typename> class RuleGenerator;\\n\\n template <typename,const bool> class PatternGenerator;\\n\\n }\\n\\n\\n\\n // forward eclaractions\\n\\n template <typename> class Category;\\n\\n template <typename> class OpaqueCategory;\\n\\n template <typename> class Symbol;\\n\\n template <typename> class Rule;\\n\\n template <typename> class OpaqueRule;\\n\\n template <typename> class Term;\\n\\n\\n\\n template <typename> class Operator;\\n\\n template <typename> class OperatorString;\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 93,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class Symbol {\\n\\n protected:\\n\\n\\n\\n mutable internal_sym_type value;\\n\\n\\n\\n friend class CFG<AlphaT>;\\n\\n friend class Variable<AlphaT>;\\n\\n friend class Production<AlphaT>;\\n\\n friend class OpaqueProduction<AlphaT>;\\n\\n friend class ProductionBuilder<AlphaT>;\\n\\n friend class SymbolString<AlphaT>;\\n\\n friend class VariableSymbol<AlphaT>;\\n\\n friend class TerminalSymbol<AlphaT>;\\n\\n friend class detail::SimpleGenerator<AlphaT>;\\n\\n friend class detail::PatternData<AlphaT>;\\n\\n\\n\\n template <typename, typename>\\n\\n friend class detail::PatternGenerator;\\n\\n\\n\\n template <typename, typename, typename, typename>\\n\",\n \"file_path\": \"fltl/include/cfg/Symbol.hpp\",\n \"rank\": 94,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class Generator {\\n\\n private:\\n\\n\\n\\n typedef Generator<AlphaT> self_type;\\n\\n\\n\\n friend class detail::CategoryGenerator<AlphaT>;\\n\\n friend class detail::SymbolGenerator<AlphaT>;\\n\\n friend class detail::RuleGenerator<AlphaT>;\\n\\n friend class detail::PatternGenerator<AlphaT,true>;\\n\\n friend class detail::PatternGenerator<AlphaT,false>;\\n\\n friend class TDOP<AlphaT>;\\n\\n\\n\\n FLTL_TDOP_USE_TYPES(TDOP<AlphaT>);\\n\\n\\n\\n // location/navigation information\\n\\n TDOP<AlphaT> *machine;\\n\\n tdop::Category<AlphaT> *category;\\n\\n\\n\\n union {\\n\\n tdop::Rule<AlphaT> *rule;\\n\",\n \"file_path\": \"fltl/include/tdop/Generator.hpp\",\n \"rank\": 95,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class symbol_tag { };\\n\",\n \"file_path\": \"fltl/include/TDOP.hpp\",\n \"rank\": 96,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class Category {\\n\\n private:\\n\\n\\n\\n friend class TDOP<AlphaT>;\\n\\n friend class Term<AlphaT>;\\n\\n friend class OpaqueCategory<AlphaT>;\\n\\n friend class OpaqueRule<AlphaT>;\\n\\n friend class Rule<AlphaT>;\\n\\n\\n\\n friend class detail::CategoryGenerator<AlphaT>;\\n\\n friend class detail::SymbolGenerator<AlphaT>;\\n\\n friend class detail::RuleGenerator<AlphaT>;\\n\\n friend class detail::PatternGenerator<AlphaT,true>;\\n\\n friend class detail::PatternGenerator<AlphaT,false>;\\n\\n\\n\\n typedef Category<AlphaT> self_type;\\n\\n\\n\\n unsigned ref_count;\\n\\n\\n\\n /// the \\\"number\\\"/id of this parsercategory\\n\",\n \"file_path\": \"fltl/include/tdop/Category.hpp\",\n \"rank\": 97,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" class AnyOperatorString {\\n\\n public:\\n\\n\\n\\n typedef AnyOperatorString<AlphaT> self_type;\\n\\n typedef any_operator_string_tag tag_type;\\n\\n\\n\\n const AnyOperatorStringOfLength<AlphaT>\\n\\n operator()(unsigned &len) const throw() {\\n\\n return AnyOperatorStringOfLength<AlphaT>(&len);\\n\\n }\\n\\n\\n\\n // any extension rule, regardless of category\\n\\n FLTL_TDOP_RULE_PATTERN(any_operator_string_tag)\\n\\n };\\n\\n\\n\\n template <typename AlphaT>\\n\",\n \"file_path\": \"fltl/include/tdop/Any.hpp\",\n \"rank\": 98,\n \"score\": 114621.2933539436\n },\n {\n \"content\": \" * 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\\n\\n#ifndef FLTL_FIND_BALANCED_HPP_\\n\\n#define FLTL_FIND_BALANCED_HPP_\\n\\n\\n\\n#include \\\"grail/include/io/UTF8FileBuffer.hpp\\\"\\n\\n\\n\\nnamespace grail { namespace io { namespace detail {\\n\\n\\n\\n /// try to find something that needs to be balanced; assumes non-null\\n\\n /// ascii\\n\\n template <const unsigned BUFFER_SIZE, const bool LOOK_FOR_ERRORS>\\n\\n static bool find_balanced(\\n\\n UTF8FileBuffer<BUFFER_SIZE> &buffer,\\n\",\n \"file_path\": \"grail/include/io/detail/find_balanced.hpp\",\n \"rank\": 99,\n \"score\": 25.71117500511673\n }\n]","isConversational":false}}},{"rowIdx":473,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/chwSurfaceTweak.cpp"},"repo_name":{"kind":"string","value":"bradleyhenke/chwtools"},"commit":{"kind":"string","value":"733e346b4dc6452954b6ba19899d2ccf0a0cd79f"},"file_code":{"kind":"string","value":"\n\n#include \"chwSurfaceTweak.h\"\n\nconst MTypeId chwSurfaceTweak::typeId( 0x89007 );\nconst MString chwSurfaceTweak::typeName( \"chwSurfaceTweak\" );\n\nMObject chwSurfaceTweak::aInVert;\nMObject chwSurfaceTweak::aFalloffMode;\nMObject chwSurfaceTweak::aFalloffCurve;\nMObject chwSurfaceTweak::aFalloffRadius;\nMObject chwSurfaceTweak::aRelativeMatrix;\nMObject chwSurfaceTweak::aDeformMatrix;\n\nMObject chwSurfaceTweak::aOutTranslate;\nMObject chwSurfaceTweak::aOutTranslateX;\nMObject chwSurfaceTweak::aOutTranslateY;\nMObject chwSurfaceTweak::aOutTranslateZ;\n\nMObject chwSurfaceTweak::aOutRotate;\nMObject chwSurfaceTweak::aOutRotateX;\nMObject chwSurfaceTweak::aOutRotateY;\nMObject chwSurfaceTweak::aOutRotateZ;\n\nchwSurfaceTweak::chwSurfaceTweak()\n{\n\tm_data = new chwSurfaceTweakData;\n}\n\nchwSurfaceTweak::~chwSurfaceTweak()\n{\n\tdelete m_data;\n}\n\nvoid* chwSurfaceTweak::creator(){ return new chwSurfaceTweak(); }\n\nMStatus chwSurfaceTweak::initialize()\n{\n\tMFnNumericAttribute\t\tnAttr;\n\tMFnEnumAttribute\t\teAttr;\n\tMFnMatrixAttribute\t\tmAttr;\n\tMRampAttribute\t\t\trAttr;\n\tMFnUnitAttribute\t\tuAttr;\n\n\taInVert = nAttr.create( \"vertex\", \"v\", MFnNumericData::kLong );\n\tnAttr.setKeyable(true);\n\tnAttr.setStorable(true);\n\tnAttr.setMin(0);\n\tnAttr.setDefault(0);\n\tnAttr.setReadable(true);\n\tnAttr.setWritable(true);\n\taddAttribute(aInVert);\n\n\taFalloffMode = eAttr.create( \"falloffMode\", \"fom\" );\n\teAttr.addField(\t\"Volume\", 0);\n\teAttr.setKeyable(true);\n\teAttr.setStorable(true);\n\teAttr.setReadable(true);\n\teAttr.setWritable(true);\n\teAttr.setDefault(0);\n\taddAttribute(aFalloffMode);\n\n\taFalloffRadius = nAttr.create( \"falloffRadius\", \"for\", MFnNumericData::kFloat, 1.0 );\n\tnAttr.setWritable(true);\n\tnAttr.setStorable(true);\n\tnAttr.setKeyable (true);\n\tnAttr.setConnectable(true);\n\tnAttr.setMin(0.0);\n\tnAttr.setDefault(1.0);\n\taddAttribute(aFalloffRadius);\n\n\taFalloffCurve = rAttr.createCurveRamp(\"falloffCurve\", \"foc\");\n\taddAttribute(aFalloffCurve);\n\n\taRelativeMatrix = mAttr.create( \"relativeMatrix\", \"rm\" );\n\tmAttr.setConnectable(true);\n\taddAttribute(aRelativeMatrix);\n\n\taDeformMatrix = mAttr.create( \"deformMatrix\", \"dm\" );\n\tmAttr.setConnectable(true);\n\taddAttribute(aDeformMatrix);\n\n\taOutTranslateX = nAttr.create( \"outTranslateX\", \"ostx\", MFnNumericData::kDouble, 0.0 );\n\taOutTranslateY = nAttr.create( \"outTranslateY\", \"osty\", MFnNumericData::kDouble, 0.0 );\n\taOutTranslateZ = nAttr.create( \"outTranslateZ\", \"ostz\", MFnNumericData::kDouble, 0.0 );\n\taOutTranslate = nAttr.create( \"outTranslate\", \"os\", aOutTranslateX, aOutTranslateY, aOutTranslateZ );\n\taddAttribute(aOutTranslate);\n\n\taOutRotateX = uAttr.create( \"outRotateX\", \"osrx\", MFnUnitAttribute::kAngle, 0.0 );\n\taOutRotateY = uAttr.create( \"outRotateY\", \"osry\", MFnUnitAttribute::kAngle, 0.0 );\n\taOutRotateZ = uAttr.create( \"outRotateZ\", \"osrz\", MFnUnitAttribute::kAngle, 0.0 );\n\taOutRotate = nAttr.create( \"outRotate\", \"osr\", aOutRotateX, aOutRotateY, aOutRotateZ );\n\taddAttribute(aOutRotate);\n\n\tattributeAffects( chwSurfaceTweak::aInVert, chwSurfaceTweak::aOutTranslate );\n\tattributeAffects( chwSurfaceTweak::aInVert, chwSurfaceTweak::aOutRotate );\n\n\tattributeAffects( chwSurfaceTweak::inputGeom, chwSurfaceTweak::aOutTranslate );\n\tattributeAffects( chwSurfaceTweak::inputGeom, chwSurfaceTweak::aOutRotate );\n\n\tattributeAffects( chwSurfaceTweak::aRelativeMatrix, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aDeformMatrix, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aFalloffMode, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aFalloffCurve, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aFalloffRadius, chwSurfaceTweak::outputGeom );\n\n\tMGlobal::executeCommand( \"makePaintable -attrType \\\"multiFloat\\\" -sm \\\"deformer\\\" \\\"chwSurfaceTweak\\\" \\\"weights\\\";\" );\n\n\treturn MStatus::kSuccess;\n}\n\nMStatus chwSurfaceTweak::compute(const MPlug& plug, MDataBlock& data)\n{\n\tMStatus status;\n\n\tMObject thisNode = this->thisMObject();\n\n\tm_data->m_env = data.inputValue(envelope).asFloat();\n\tm_data->m_vert = data.inputValue( aInVert ).asInt();\n\n\tif (plug == aOutTranslate || plug == aOutRotate || plug.parent() == aOutTranslate || plug.parent() == aOutRotate )\n\t{\n\t\tMDataHandle outTranslateHnd = data.outputValue( aOutTranslate );\n\t\tMDataHandle outRotateHnd = data.outputValue( aOutRotate );\n\n\t\tMPlug inPlug(thisNode,input);\n\t\tinPlug.selectAncestorLogicalIndex(0,input);\n\t\tMDataHandle hInput = data.inputValue(inPlug, &status);\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\tMDataHandle hGeom = hInput.child(inputGeom);\n\t\tMObject mesh = hGeom.asMesh();\n\n\t\tif (!mesh.isNull())\n\t\t{\n\t\t\tMFnMesh meshFn(mesh, &status);\n\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\tm_data->m_numverts = meshFn.numVertices();\n\t\t\tstatus = meshFn.getPoints(m_data->m_points, MSpace::kWorld);\n\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\tstatus = meshFn.getVertexNormals(false, m_data->m_normals, MSpace::kWorld);\n\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\tint prev;\n\t\t\tMItMeshVertex iter(mesh);\n\t\t\titer.setIndex(m_data->m_vert, prev);\n\t\t\titer.getConnectedVertices(m_data->m_conids);\n\n\t\t\tif (m_data->m_conids.length() > 1)\n\t\t\t{\n\t\t\t\tm_data->m_aimvert = m_data->m_conids[0];\n\t\t\t\tm_data->m_upvert = m_data->m_conids[1];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn MStatus::kFailure;\n\t\t\t}\n\n\t\t\tif (m_data->m_vert < m_data->m_numverts)\n\t\t\t{\n\t\t\t\tMMatrix\t\tm;\n\t\t\t\tMVector\t\tvx, vy, vz;\n\n\t\t\t\tMPoint outTranslate;\n\t\t\t\tdouble outRotate[3];\n\n\t\t\t\t\n\t\t\t\tvx = m_data->m_normals[m_data->m_vert];\n\t\t\t\t\n\t\t\t\tvy = (m_data->m_points[m_data->m_upvert] - m_data->m_points[m_data->m_vert]).normal();\n\t\t\t\t\n\t\t\t\tvz = (vx ^ vy).normal();\n\t\t\t\t\n\t\t\t\tvy = (vx ^ vz).normal();\n\n\t\t\t\tm[0][0] = vx[0];\n\t\t\t\tm[0][1] = vx[1];\n\t\t\t\tm[0][2] = vx[2];\n\t\t\t\tm[0][3] = 0.f;\n\n\t\t\t\tm[1][0] = vy[0];\n\t\t\t\tm[1][1] = vy[1];\n\t\t\t\tm[1][2] = vy[2];\n\t\t\t\tm[1][3] = 0.f;\n\n\t\t\t\tm[2][0] = vz[0];\n\t\t\t\tm[2][1] = vz[1];\n\t\t\t\tm[2][2] = vz[2];\n\t\t\t\tm[2][3] = 0.f;\n\n\t\t\t\tm[3][0] = m_data->m_points[m_data->m_vert][0];\n\t\t\t\tm[3][1] = m_data->m_points[m_data->m_vert][1];\n\t\t\t\tm[3][2] = m_data->m_points[m_data->m_vert][2];\n\t\t\t\tm[3][3] = 1.f;\n\n\t\t\t\tMTransformationMatrix outMatrix(m);\n\t\t\t\tMTransformationMatrix::RotationOrder order;\n\n\t\t\t\toutMatrix.getRotation(outRotate, order, MSpace::kWorld);\n\t\t\t\toutTranslate = outMatrix.getTranslation(MSpace::kWorld);\n\n\t\t\t\toutRotateHnd.set3Double(outRotate[0], outRotate[1], outRotate[2]);\n\t\t\t\toutTranslateHnd.set3Double(outTranslate[0],outTranslate[1],outTranslate[2]);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\toutTranslateHnd.set(0.0, 0.0, 0.0);\n\t\t\t\toutRotateHnd.set(0.0, 0.0, 0.0);\n\t\t\t}\n\t\t}\n\t\toutTranslateHnd.setClean();\n\t\toutRotateHnd.setClean();\n\t}\n\telse if (plug.attribute() == outputGeom)\n\t{\n\t\tunsigned int index = plug.logicalIndex();\n\t\tMPlug inPlug(thisNode,input);\n\t\tinPlug.selectAncestorLogicalIndex(index,input);\n\t\tMDataHandle hInput = data.inputValue(inPlug);\n\n\t\tMDataHandle hGeom = hInput.child(inputGeom);\n\t\tm_data->m_localToWorldMatrix = hGeom.geometryTransformMatrix();\n\t\tMDataHandle hOutput = data.outputValue(plug);\n\t\thOutput.copy(hGeom);\n\t\tMObject mesh = hGeom.asMesh();\n\n\t\tif (!mesh.isNull())\n\t\t{\n\t\t\tif (m_data->m_env > 0.0)\n\t\t\t{\n\t\t\t\tm_data->m_falloffMode = data.inputValue( aFalloffMode ).asShort();\n\t\t\t\tm_data->m_falloffRadius = data.inputValue( aFalloffRadius ).asFloat();\n\t\t\t\tm_data->m_falloffCurve = MRampAttribute(thisNode, aFalloffCurve, &status);\n\n\t\t\t\tm_data->m_relativeMatrix = data.inputValue( aRelativeMatrix ).asMatrix();\n\t\t\t\tm_data->m_deformMatrix = data.inputValue( aDeformMatrix ).asMatrix();\n\t\t\t\tm_data->m_relativeInverseMatrix = m_data->m_relativeMatrix.inverse();\n\t\t\t\tm_data->m_localToWorldMatrixInverse = m_data->m_localToWorldMatrix.inverse();\n\n\t\t\t\tMTransformationMatrix defMat(m_data->m_relativeMatrix);\n\t\t\t\tm_data->m_relativeMatrixTranslate = defMat.translation(MSpace::kWorld);\n\n\t\t\t\tMFnMesh meshFn(mesh, &status);\n\t\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\t\tm_data->m_numverts = meshFn.numVertices();\n\t\t\t\tstatus = meshFn.getPoints(m_data->m_points, MSpace::kWorld);\n\t\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\t\tm_data->m_weights.setLength(m_data->m_numverts);\n\t\t\t\tfor (unsigned int idx=0; idx < m_data->m_numverts; idx++)\n\t\t\t\t{\n\t\t\t\t\tm_data->m_weights[idx]= weightValue(data,index,idx);\n\t\t\t\t}\n\n\t\t\t\t\n\t\t\t\tThreadedDeform td;\n\t\t\t\ttd.data = m_data;\n\t\t\t\tparallel_for( blocked_range<int>( 0, m_data->m_numverts ), td );\n\n\t\t\t\tstatus = meshFn.setPoints(m_data->m_points, MSpace::kWorld);\n\t\t\t}\n\t\t}\n\t}\n\tdata.setClean(plug);\n\n\treturn status;\n}\n\nMStatus chwSurfaceTweak::postConstructor_initialise_ramp_curve( MObject &rampObj, int index, float position, float value, int interpolation)\n{\n\tMStatus status;\n\n\tMObject thisNode = this->thisMObject();\n\n\tMPlug rampPlug( thisNode, rampObj );\n\tMPlug elementPlug = rampPlug.elementByLogicalIndex( index, &status );\n\n\tMPlug positionPlug = elementPlug.child(0, &status);\n\tstatus = positionPlug.setFloat(position);\n\n\tMPlug valuePlug = elementPlug.child(1);\n\tstatus = valuePlug.setFloat(value);\n\n\tMPlug interpPlug = elementPlug.child(2);\n\tinterpPlug.setInt(interpolation);\n\n\treturn MS::kSuccess;\n}\n\nvoid chwSurfaceTweak::postConstructor()\n{\n\tMStatus status;\n\n\tstatus = postConstructor_initialise_ramp_curve( aFalloffCurve, 0, 0.0f, 1.0f, 2 );\n\tCHECK_MSTATUS(status);\n\tstatus = postConstructor_initialise_ramp_curve( aFalloffCurve, 1, 1.0f, 0.0f, 2 );\n\tCHECK_MSTATUS(status);\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"chwSurfaceTweak.h\"\n\nconst MTypeId chwSurfaceTweak::typeId( 0x89007 );\nconst MString chwSurfaceTweak::typeName( \"chwSurfaceTweak\" );\n\nMObject chwSurfaceTweak::aInVert;\nMObject chwSurfaceTweak::aFalloffMode;\nMObject chwSurfaceTweak::aFalloffCurve;\nMObject chwSurfaceTweak::aFalloffRadius;\nMObject chwSurfaceTweak::aRelativeMatrix;\nMObject chwSurfaceTweak::aDeformMatrix;\n\nMObject chwSurfaceTweak::aOutTranslate;\nMObject chwSurfaceTweak::aOutTranslateX;\nMObject chwSurfaceTweak::aOutTranslateY;\nMObject chwSurfaceTweak::aOutTranslateZ;\n\nMObject chwSurfaceTweak::aOutRotate;\nMObject chwSurfaceTweak::aOutRotateX;\nMObject chwSurfaceTweak::aOutRotateY;\nMObject chwSurfaceTweak::aOutRotateZ;\n\nchwSurfaceTweak::chwSurfaceTweak()\n{\n\tm_data = new chwSurfaceTweakData;\n}\n\nchwSurfaceTweak::~chwSurfaceTweak()\n{\n\tdelete m_data;\n}\n\nvoid* chwSurfaceTweak::creator(){ return new chwSurfaceTweak(); }\n\nMStatus chwSurfaceTweak::initialize()\n{\n\tMFnNumericAttribute\t\tnAttr;\n\tMFnEnumAttribute\t\teAttr;\n\tMFnMatrixAttribute\t\tmAttr;\n\tMRampAttribute\t\t\trAttr;\n\tMFnUnitAttribute\t\tuAttr;\n\n\taInVert = nAttr.create( \"vertex\", \"v\", MFnNumericData::kLong );\n\tnAttr.setKeyable(true);\n\tnAttr.setStorable(true);\n\tnAttr.setMin(0);\n\tnAttr.setDefault(0);\n\tnAttr.setReadable(true);\n\tnAttr.setWritable(true);\n\taddAttribute(aInVert);\n\n\taFalloffMode = eAttr.create( \"falloffMode\", \"fom\" );\n\teAttr.addField(\t\"Volume\", 0);\n\teAttr.setKeyable(true);\n\teAttr.setStorable(true);\n\teAttr.setReadable(true);\n\teAttr.setWritable(true);\n\teAttr.setDefault(0);\n\taddAttribute(aFalloffMode);\n\n\taFalloffRadius = nAttr.create( \"falloffRadius\", \"for\", MFnNumericData::kFloat, 1.0 );\n\tnAttr.setWritable(true);\n\tnAttr.setStorable(true);\n\tnAttr.setKeyable (true);\n\tnAttr.setConnectable(true);\n\tnAttr.setMin(0.0);\n\tnAttr.setDefault(1.0);\n\taddAttribute(aFalloffRadius);\n\n\taFalloffCurve = rAttr.createCurveRamp(\"falloffCurve\", \"foc\");\n\taddAttribute(aFalloffCurve);\n\n\taRelativeMatrix = mAttr.create( \"relativeMatrix\", \"rm\" );\n\tmAttr.setConnectable(true);\n\taddAttribute(aRelativeMatrix);\n\n\taDeformMatrix = mAttr.create( \"deformMatrix\", \"dm\" );\n\tmAttr.setConnectable(true);\n\taddAttribute(aDeformMatrix);\n\n\taOutTranslateX = nAttr.create( \"outTranslateX\", \"ostx\", MFnNumericData::kDouble, 0.0 );\n\taOutTranslateY = nAttr.create( \"outTranslateY\", \"osty\", MFnNumericData::kDouble, 0.0 );\n\taOutTranslateZ = nAttr.create( \"outTranslateZ\", \"ostz\", MFnNumericData::kDouble, 0.0 );\n\taOutTranslate = nAttr.create( \"outTranslate\", \"os\", aOutTranslateX, aOutTranslateY, aOutTranslateZ );\n\taddAttribute(aOutTranslate);\n\n\taOutRotateX = uAttr.create( \"outRotateX\", \"osrx\", MFnUnitAttribute::kAngle, 0.0 );\n\taOutRotateY = uAttr.create( \"outRotateY\", \"osry\", MFnUnitAttribute::kAngle, 0.0 );\n\taOutRotateZ = uAttr.create( \"outRotateZ\", \"osrz\", MFnUnitAttribute::kAngle, 0.0 );\n\taOutRotate = nAttr.create( \"outRotate\", \"osr\", aOutRotateX, aOutRotateY, aOutRotateZ );\n\taddAttribute(aOutRotate);\n\n\tattributeAffects( chwSurfaceTweak::aInVert, chwSurfaceTweak::aOutTranslate );\n\tattributeAffects( chwSurfaceTweak::aInVert, chwSurfaceTweak::aOutRotate );\n\n\tattributeAffects( chwSurfaceTweak::inputGeom, chwSurfaceTweak::aOutTranslate );\n\tattributeAffects( chwSurfaceTweak::inputGeom, chwSurfaceTweak::aOutRotate );\n\n\tattributeAffects( chwSurfaceTweak::aRelativeMatrix, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aDeformMatrix, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aFalloffMode, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aFalloffCurve, chwSurfaceTweak::outputGeom );\n\tattributeAffects( chwSurfaceTweak::aFalloffRadius, chwSurfaceTweak::outputGeom );\n\n\tMGlobal::executeCommand( \"makePaintable -attrType \\\"multiFloat\\\" -sm \\\"deformer\\\" \\\"chwSurfaceTweak\\\" \\\"weights\\\";\" );\n\n\treturn MStatus::kSuccess;\n}\n\nMStatus chwSurfaceTweak::compute(const MPlug& plug, MDataBlock& data)\n{\n\tMStatus status;\n\n\tMObject thisNode = this->thisMObject();\n\n\tm_data->m_env = data.inputValue(envelope).asFloat();\n\tm_data->m_vert = data.inputValue( aInVert ).asInt();\n\n\tif (plug == aOutTranslate || plug == aOutRotate || plug.parent() == aOutTranslate || plug.parent() == aOutRotate )\n\t{\n\t\tMDataHandle outTranslateHnd = data.outputValue( aOutTranslate );\n\t\tMDataHandle outRotateHnd = data.outputValue( aOutRotate );\n\n\t\tMPlug inPlug(thisNode,input);\n\t\tinPlug.selectAncestorLogicalIndex(0,input);\n\t\tMDataHandle hInput = data.inputValue(inPlug, &status);\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\tMDataHandle hGeom = hInput.child(inputGeom);\n\t\tMObject mesh = hGeom.asMesh();\n\n\t\tif (!mesh.isNull())\n\t\t{\n\t\t\tMFnMesh meshFn(mesh, &status);\n\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\tm_data->m_numverts = meshFn.numVertices();\n\t\t\tstatus = meshFn.getPoints(m_data->m_points, MSpace::kWorld);\n\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\tstatus = meshFn.getVertexNormals(false, m_data->m_normals, MSpace::kWorld);\n\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\tint prev;\n\t\t\tMItMeshVertex iter(mesh);\n\t\t\titer.setIndex(m_data->m_vert, prev);\n\t\t\titer.getConnectedVertices(m_data->m_conids);\n\n\t\t\tif (m_data->m_conids.length() > 1)\n\t\t\t{\n\t\t\t\tm_data->m_aimvert = m_data->m_conids[0];\n\t\t\t\tm_data->m_upvert = m_data->m_conids[1];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn MStatus::kFailure;\n\t\t\t}\n\n\t\t\tif (m_data->m_vert < m_data->m_numverts)\n\t\t\t{\n\t\t\t\tMMatrix\t\tm;\n\t\t\t\tMVector\t\tvx, vy, vz;\n\n\t\t\t\tMPoint outTranslate;\n\t\t\t\tdouble outRotate[3];\n\n\t\t\t\t\n\t\t\t\tvx = m_data->m_normals[m_data->m_vert];\n\t\t\t\t\n\t\t\t\tvy = (m_data->m_points[m_data->m_upvert] - m_data->m_points[m_data->m_vert]).normal();\n\t\t\t\t\n\t\t\t\tvz = (vx ^ vy).normal();\n\t\t\t\t\n\t\t\t\tvy = (vx ^ vz).normal();\n\n\t\t\t\tm[0][0] = vx[0];\n\t\t\t\tm[0][1] = vx[1];\n\t\t\t\tm[0][2] = vx[2];\n\t\t\t\tm[0][3] = 0.f;\n\n\t\t\t\tm[1][0] = vy[0];\n\t\t\t\tm[1][1] = vy[1];\n\t\t\t\tm[1][2] = vy[2];\n\t\t\t\tm[1][3] = 0.f;\n\n\t\t\t\tm[2][0] = vz[0];\n\t\t\t\tm[2][1] = vz[1];\n\t\t\t\tm[2][2] = vz[2];\n\t\t\t\tm[2][3] = 0.f;\n\n\t\t\t\tm[3][0] = m_data->m_points[m_data->m_vert][0];\n\t\t\t\tm[3][1] = m_data->m_points[m_data->m_vert][1];\n\t\t\t\tm[3][2] = m_data->m_points[m_data->m_vert][2];\n\t\t\t\tm[3][3] = 1.f;\n\n\t\t\t\tMTransformationMatrix outMatrix(m);\n\t\t\t\tMTransformationMatrix::RotationOrder order;\n\n\t\t\t\toutMatrix.getRotation(outRotate, order, MSpace::kWorld);\n\t\t\t\toutTranslate = outMatrix.getTranslation(MSpace::kWorld);\n\n\t\t\t\toutRotateHnd.set3Double(outRotate[0], outRotate[1], outRotate[2]);\n\t\t\t\toutTranslateHnd.set3Double(outTranslate[0],outTranslate[1],outTranslate[2]);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\toutTranslateHnd.set(0.0, 0.0, 0.0);\n\t\t\t\toutRotateHnd.set(0.0, 0.0, 0.0);\n\t\t\t}\n\t\t}\n\t\toutTranslateHnd.setClean();\n\t\toutRotateHnd.setClean();\n\t}\n\telse if (plug.attribute() == outputGeom)\n\t{\n\t\tunsigned int index = plug.logicalIndex();\n\t\tMPlug inPlug(thisNode,input);\n\t\tinPlug.selectAncestorLogicalIndex(index,input);\n\t\tMDataHandle hInput = data.inputValue(inPlug);\n\n\t\tMDataHandle hGeom = hInput.child(inputGeom);\n\t\tm_data->m_localToWorldMatrix = hGeom.geometryTransformMatrix();\n\t\tMDataHandle hOutput = data.outputValue(plug);\n\t\thOutput.copy(hGeom);\n\t\tMObject mesh = hGeom.asMesh();\n\n\t\tif (!mesh.isNull())\n\t\t{\n\t\t\tif (m_data->m_env > 0.0)\n\t\t\t{\n\t\t\t\tm_data->m_falloffMode = data.inputValue( aFalloffMode ).asShort();\n\t\t\t\tm_data->m_falloffRadius = data.inputValue( aFalloffRadius ).asFloat();\n\t\t\t\tm_data->m_falloffCurve = MRampAttribute(thisNode, aFalloffCurve, &status);\n\n\t\t\t\tm_data->m_relativeMatrix = data.inputValue( aRelativeMatrix ).asMatrix();\n\t\t\t\tm_data->m_deformMatrix = data.inputValue( aDeformMatrix ).asMatrix();\n\t\t\t\tm_data->m_relativeInverseMatrix = m_data->m_relativeMatrix.inverse();\n\t\t\t\tm_data->m_localToWorldMatrixInverse = m_data->m_localToWorldMatrix.inverse();\n\n\t\t\t\tMTransformationMatrix defMat(m_data->m_relativeMatrix);\n\t\t\t\tm_data->m_relativeMatrixTranslate = defMat.translation(MSpace::kWorld);\n\n\t\t\t\tMFnMesh meshFn(mesh, &status);\n\t\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\t\tm_data->m_numverts = meshFn.numVertices();\n\t\t\t\tstatus = meshFn.getPoints(m_data->m_points, MSpace::kWorld);\n\t\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\t\t\t\tm_data->m_weights.setLength(m_data->m_numverts);\n\t\t\t\tfor (unsigned int idx=0; idx < m_data->m_numverts; idx++)\n\t\t\t\t{\n\t\t\t\t\tm_data->m_weights[idx]= weightValue(data,index,idx);\n\t\t\t\t}\n\n\t\t\t\t\n\t\t\t\tThreadedDeform td;\n\t\t\t\ttd.data = m_data;\n\t\t\t\tparallel_for( blocked_range<int>( 0, m_data->m_numverts ), td );\n\n\t\t\t\tstatus = meshFn.setPoints(m_data->m_points, MSpace::kWorld);\n\t\t\t}\n\t\t}\n\t}\n\tdata.setClean(plug);\n\n\treturn status;\n}\n\n"},"suffix":{"kind":"string","value":"\n\nvoid chwSurfaceTweak::postConstructor()\n{\n\tMStatus status;\n\n\tstatus = postConstructor_initialise_ramp_curve( aFalloffCurve, 0, 0.0f, 1.0f, 2 );\n\tCHECK_MSTATUS(status);\n\tstatus = postConstructor_initialise_ramp_curve( aFalloffCurve, 1, 1.0f, 0.0f, 2 );\n\tCHECK_MSTATUS(status);\n}\n"},"middle":{"kind":"string","value":"MStatus chwSurfaceTweak::postConstructor_initialise_ramp_curve( MObject &rampObj, int index, float position, float value, int interpolation)\n{\n\tMStatus status;\n\n\tMObject thisNode = this->thisMObject();\n\n\tMPlug rampPlug( thisNode, rampObj );\n\tMPlug elementPlug = rampPlug.elementByLogicalIndex( index, &status );\n\n\tMPlug positionPlug = elementPlug.child(0, &status);\n\tstatus = positionPlug.setFloat(position);\n\n\tMPlug valuePlug = elementPlug.child(1);\n\tstatus = valuePlug.setFloat(value);\n\n\tMPlug interpPlug = elementPlug.child(2);\n\tinterpPlug.setInt(interpolation);\n\n\treturn MS::kSuccess;\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"class chwVertexBindData\n\n{\n\n\tpublic:\n\n\t\tMPointArray\t\tm_drvpoints;\n\n\t\tMPointArray\t\tm_defpoints;\n\n\t\tMFloatArray\t\tm_weights;\n\n\t\tMIntArray\t\tm_mapping;\n\n\t\tMMatrix\t\t\tm_localToWorldMatrix;\n\n\t\tfloat\t\t\tm_cutoffDistance;\n\n\t\tfloat\t\t\tm_searchDistance;\n\n};\n\n\n","file_path":"include/chwVertexBind.h","rank":0,"score":71214.335526944},{"content":"class chwMeshRelax : public MPxDeformerNode\n\n{\n\n\tpublic:\n\n\t\t\t\t\tchwMeshRelax();\n\n\t\t\tvirtual ~chwMeshRelax();\n\n\n\n\t\t\tvirtual MStatus \tcompute(const MPlug& plug, MDataBlock& data);\n\n\t\t\tstatic void* \t\tcreator();\n\n\t\t\tstatic MStatus \tinitialize();\n\n\n\n\tpublic:\n\n\t\tstatic MObject \t\taIterations;\n\n\t\tstatic const MTypeId \ttypeId;\n\n\t\tstatic const MString \ttypeName;\n\n\tprivate:\n\n\t\tchwEdgeRelax m_relax;\n\n};\n\n\n\n#endif // CHWMESHRELAX_H\n","file_path":"include/chwMeshRelax.h","rank":1,"score":61325.964982955564},{"content":"class chwVertexBind : public MPxDeformerNode\n\n{\n\n\tpublic:\n\n\t\t\t\t\t\t\t\tchwVertexBind();\n\n\t\tvirtual\t\t\t\t\t~chwVertexBind();\n\n\t\tstatic void*\t\t\tcreator();\n\n\t\tstatic MStatus\t\t\tinitialize();\n\n\n\n\t\tvirtual MStatus\t\t\tdeform(MDataBlock& data,\n\n\t\t\t\t\t\t\t\t\tMItGeometry& iter,\n\n\t\t\t\t\t\t\t\t\tconst MMatrix& mat,\n\n\t\t\t\t\t\t\t\t\tunsigned int mIndex);\n\n\n\n\t\tvirtual MStatus\t\t\tinitializeMapping( MDataBlock& data, MItGeometry& iter, const MMatrix &localToWorldMatrix);\n\n\n\n\t\tstatic int\t\t\t\tgetClosestPoint( MPoint &pt, MPointArray &points ) ;\n\n\n\n\t\tvirtual MObject&\t\taccessoryAttribute() const;\n\n\n\n\t\t// Attributes\n","file_path":"include/chwVertexBind.h","rank":2,"score":60907.16995348032},{"content":"class chwSurfaceTweakData\n\n{\n\n\tpublic:\n\n\t\tunsigned int\t\t\tm_vert;\n\n\t\tunsigned int\t\t\tm_upvert;\n\n\t\tunsigned int\t\t\tm_aimvert;\n\n\n\n\t\tunsigned int\t\t\tm_numverts;\n\n\n\n\t\tfloat\t\t\t\t\tm_env;\n\n\t\tshort\t\t\t\t\tm_falloffMode;\n\n\t\tfloat\t\t\t\t\tm_falloffRadius;\n\n\t\tMRampAttribute\t\t\tm_falloffCurve;\n\n\n\n\t\tMMatrix\t\t\t\t\tm_deformMatrix;\n\n\t\tMMatrix\t\t\t\t\tm_relativeMatrix;\n\n\t\tMMatrix\t\t\t\t\tm_relativeInverseMatrix;\n\n\t\tMMatrix\t\t\t\t\tm_localToWorldMatrix;\n\n\t\tMMatrix\t\t\t\t\tm_localToWorldMatrixInverse;\n\n\n\n\t\tMVector\t\t\t\t\tm_relativeMatrixTranslate;\n\n\n\n\t\tMPointArray\t\t\t\tm_points;\n\n\t\tMFloatVectorArray\t\tm_normals;\n\n\t\tMFloatArray\t\t\t\tm_weights;\n\n\n\n\t\tMIntArray\t\t\t\tm_conids;\n\n};\n\n\n","file_path":"include/chwSurfaceTweak.h","rank":3,"score":58972.80964150416},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWMESHRELAX_H\n\n#define CHWMESHRELAX_H\n\n\n\n#include <maya/MPxDeformerNode.h>\n\n#include <maya/MItGeometry.h>\n\n#include <maya/MTypeId.h>\n\n#include <maya/MPlug.h>\n\n#include <maya/MDataBlock.h>\n\n#include <maya/MDataHandle.h>\n\n#include <maya/MPoint.h>\n\n#include <maya/MPointArray.h>\n\n#include <maya/MFnMesh.h>\n\n#include <maya/MVector.h>\n\n#include <maya/MFloatVectorArray.h>\n\n#include <maya/MGlobal.h>\n\n#include <maya/MMatrix.h>\n\n#include <maya/MFnNumericAttribute.h>\n\n#include <maya/MIOStream.h>\n\n#include <chwEdgeRelax.h>\n\n\n\n\n","file_path":"include/chwMeshRelax.h","rank":4,"score":51510.89715532284},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwMeshRelax.h","rank":5,"score":51503.246659614466},{"content":"\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\tdata->m_mapping[idx] = -1;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t};\n\n\t\tstruct ThreadedDeform\n\n\t\t{\n\n\t\t\tchwVertexBindData *data;\n\n\t\t\tvoid operator()( const blocked_range<int>& range ) const {\n\n\t\t\t\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\n\n\t\t\t\t{\n\n\t\t\t\t\tif (data->m_weights[idx] != 0.f)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tif (data->m_mapping[idx] >= 0)\n\n\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\tdata->m_defpoints[idx] *= data->m_localToWorldMatrix;\n\n\t\t\t\t\t\t\tdata->m_defpoints[idx] += ((data->m_drvpoints[data->m_mapping[idx]] - data->m_defpoints[idx]) * data->m_weights[idx]);\n\n\t\t\t\t\t\t\tdata->m_defpoints[idx] *= data->m_localToWorldMatrix.inverse();\n","file_path":"include/chwVertexBind.h","rank":6,"score":51097.1070476012},{"content":"\t\tstatic MObject \t\taDriverMesh;\n\n\t\tstatic MObject \t\taCutoffDistance;\n\n\t\tstatic MObject \t\taSearchDistance;\n\n\t\tstatic MObject \t\taInitialize;\n\n\t\tstatic MObject \t\taVertexMap;\n\n\n\n\t\t// PLUGIN\n\n\t\tstatic MTypeId \t\ttypeId;\n\n\t\tstatic const MString \ttypeName;\n\n\tprivate:\n\n\t\tchwVertexBindData *m_data;\n\n\n\n\t\tstruct ThreadedInitialize\n\n\t\t{\n\n\t\t\tchwVertexBindData *data;\n\n\t\t\tvoid operator()( const blocked_range<int>& range ) const {\n\n\t\t\t\tfloat maxdistance;\n\n\t\t\t\tfloat curdistance;\n\n\t\t\t\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\n\n\t\t\t\t{\n","file_path":"include/chwVertexBind.h","rank":7,"score":51093.46988950799},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWVERTEXBIND_H\n\n#define CHWVERTEXBIND_H\n\n\n\n#include <maya/MStatus.h>\n\n#include <maya/MObject.h>\n\n#include <maya/MPoint.h>\n\n#include <maya/MTypeId.h>\n\n#include <maya/MString.h>\n\n#include <maya/MPointArray.h>\n\n#include <maya/MDataBlock.h>\n\n#include <maya/MItGeometry.h>\n\n#include <maya/MFnTypedAttribute.h>\n\n#include <maya/MFnEnumAttribute.h>\n\n#include <maya/MFnNumericAttribute.h>\n\n#include <maya/MPxDeformerNode.h>\n\n#include <maya/MGlobal.h>\n\n#include <maya/MItMeshVertex.h>\n\n#include <maya/MMatrix.h>\n\n#include <maya/MArrayDataBuilder.h>\n\n\n\n#include \"float.h\"\n\n\n\n// THREADING\n\n#include \"tbb/tbb.h\"\n\nusing namespace tbb;\n\n\n","file_path":"include/chwVertexBind.h","rank":8,"score":51088.71918057718},{"content":"\t\t\t\t\tmaxdistance = FLT_MAX;\n\n\t\t\t\t\tcurdistance = FLT_MIN;\n\n\n\n\t\t\t\t\tdata->m_mapping[idx] = -1;\n\n\t\t\t\t\tMPoint defpoint = data->m_defpoints[idx] * data->m_localToWorldMatrix;\n\n\n\n\t\t\t\t\tfor ( int idy = 0; idy < data->m_drvpoints.length(); idy++ )\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tcurdistance = defpoint.distanceTo( data->m_drvpoints[idy] );\n\n\t\t\t\t\t\tif (curdistance <= data->m_cutoffDistance)\n\n\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\tdata->m_mapping[idx] = idy;\n\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (curdistance < maxdistance)\n\n\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\tmaxdistance = curdistance;\n\n\t\t\t\t\t\t\tdata->m_mapping[idx] = idy;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(maxdistance > data->m_searchDistance)\n","file_path":"include/chwVertexBind.h","rank":9,"score":51087.37520128013},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwVertexBind.h","rank":10,"score":51081.49583903719},{"content":"\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t};\n\n\n\n};\n\n\n\n#endif // CHWVERTEXBIND_H\n","file_path":"include/chwVertexBind.h","rank":11,"score":51078.921846586},{"content":"class chwSurfaceTweak : public MPxDeformerNode\n\n{\n\n\tpublic:\n\n\t\t\t\t\t\t\tchwSurfaceTweak();\n\n\t\tvirtual\t\t\t\t~chwSurfaceTweak();\n\n\t\tstatic void*\t\tcreator();\n\n\t\tstatic MStatus\t\tinitialize();\n\n\n\n\t\tvirtual MStatus\t\tcompute( const MPlug& plug, MDataBlock& data );\n\n\t\tvirtual\tvoid\t\tpostConstructor();\n\n\n\n\t\tstatic MObject aInVert;\n\n\n\n\t\tstatic MObject aFalloffMode;\n\n\t\tstatic MObject aFalloffCurve;\n\n\t\tstatic MObject aFalloffRadius;\n\n\t\tstatic MObject aRelativeMatrix;\n\n\t\tstatic MObject aDeformMatrix;\n\n\n\n\t\tstatic MObject aOutTranslate;\n","file_path":"include/chwSurfaceTweak.h","rank":12,"score":47502.733300620705},{"content":"class chwCollisionData\n\n{\n\n\tpublic:\n\n\t\tMFloatPointArray\t\t\tm_points;\n\n\t\tMFloatVectorArray\t\t\tm_normals;\n\n\t\tMFloatArray\t\t\t\t\tm_weights;\n\n\t\tMMeshIntersector\t\t\tm_intersector;\n\n\t\tMMeshIsectAccelParams\t\tm_mmAccelParams;\n\n\t\tMIntArray\t\t\t\t\tm_collided;\n\n\t\tMRampAttribute\t\t\t\tm_bulgeRampAttribute;\n\n\n\n\t\tunsigned int\t\t\t\tm_numpoints;\n\n\n\n\t\t// USER SETTINGS\n\n\t\tfloat\t\t\t\t\t\tm_collisionStrength;\n\n\t\tfloat\t\t\t\t\t\tm_bulgeStrength;\n\n\t\tfloat\t\t\t\t\t\tm_bulgeDistance;\n\n\n\n\t\tMBoundingBox\t\t\t\tm_boxin;\n\n\t\tMBoundingBox\t\t\t\tm_boxcol;\n\n\n\n\t\tfloat\t\t\t\t\t\tm_defmax;\n\n};\n\n\n","file_path":"include/chwCollision.h","rank":13,"score":46212.838111551115},{"content":"class chwNormalOffsetData\n\n{\n\n\tpublic:\n\n\t\tunsigned int\t\tm_numverts;\n\n\t\tunsigned int\t\tm_smooth;\n\n\t\tfloat\t\t\t\tm_env;\n\n\t\tfloat\t\t\t\tm_strength;\n\n\t\tMPointArray\t\t\tm_points;\n\n\t\tMFloatVectorArray\tm_normals;\n\n\t\tMFloatArray\t\t\tm_weights;\n\n};\n\n\n","file_path":"include/chwNormalOffset.h","rank":14,"score":41803.72970493951},{"content":"class chwEdgeRelaxData\n\n{\n\n\tpublic:\n\n\t\tunsigned int\t\t\t\t\tm_vertcount;\n\n\t\tunsigned int\t\t\t\t\tm_cachedcount;\n\n\t\tunsigned int\t\t\t\t\tm_iterations;\n\n\t\tMPointArray\t\t\t\t\t\tm_points;\n\n\t\tMPointArray\t\t\t\t\t\tm_relaxpoints;\n\n\t\tstd::vector<std::vector<int>>\tm_conids;\n\n\t\tMFloatArray\t\t\t\t\t\tm_weights;\n\n};\n\n\n","file_path":"include/chwEdgeRelax.h","rank":15,"score":41803.72970493951},{"content":"class chwCollision : public MPxDeformerNode\n\n{\n\npublic:\n\n\t\t\t\t\tchwCollision();\n\n\t\tvirtual\t\t~chwCollision();\n\n\n\n\t\tvirtual MStatus\t\tcompute(const MPlug& plug, MDataBlock& data);\n\n\t\tstatic void*\t\tcreator();\n\n\t\tstatic MStatus\t\tinitialize();\n\n\n\n\t\tvirtual\tvoid\t\tpostConstructor();\n\n\n\npublic:\n\n\t\tstatic MObject\t\taCollisionStrength;\n\n\t\tstatic MObject\t\taCollisionMesh;\n\n\t\tstatic MObject\t\taCollisionMeshName;\n\n\t\tstatic MObject\t\taCollisionMeshList;\n\n\t\tstatic MObject\t\taCollisionBulgeStrength;\n\n\t\tstatic MObject\t\taCollisionBulgeDistance;\n\n\t\tstatic MObject\t\taCollisionBulgeRamp;\n","file_path":"include/chwCollision.h","rank":16,"score":37983.22345352918},{"content":"def chwSurfaceTweak():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 1:\n\n\t\tselection = selection[0]\n\n\t\tif selection.count('vtx'):\n\n\t\t\tsplits = selection.split('.')\n\n\t\t\tmesh = splits[0]\n\n\t\t\tvtx = re.sub(\"[^0-9]\", \"\", splits[1])\n\n\t\t\tname = util.nextName('chwSurfaceTweak_'+mesh)\n\n\t\t\tss = cmds.deformer(mesh, type='chwSurfaceTweak')[0]\n\n\t\t\tcmds.setAttr(ss+'.vertex', int(vtx))\n\n\t\t\tpivot_ctrl = cmds.group(em=True, name=name)\n\n\t\t\toffset_ctrl = util.makeControlSphere(name+'_Offset', 0.25)\n\n\t\t\tsticky_ctrl = util.makeControlSphere(name+'_Deform')\n\n\t\t\tcmds.parent(sticky_ctrl, offset_ctrl)\n\n\t\t\tcmds.parent(offset_ctrl, pivot_ctrl)\n\n\t\t\tcmds.addAttr(sticky_ctrl, at='double', ln='envelope', k=1, dv=1, min=0, max=1)\n\n\t\t\tcmds.addAttr(sticky_ctrl, at='enum', ln='falloffMode', k=1, en='Volume')\n\n\t\t\tcmds.addAttr(sticky_ctrl, at='double', ln='falloffRadius', k=1, dv=1, min=0)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.falloffMode', ss+'.falloffMode', f=True)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.falloffRadius', ss+'.falloffRadius', f=True)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.envelope', ss+'.envelope', f=True)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.worldMatrix[0]', ss+'.deformMatrix')\n\n\t\t\tcmds.connectAttr(offset_ctrl+'.worldMatrix[0]', ss+'.relativeMatrix')\n\n\t\t\tcmds.connectAttr(ss+'.outRotate', pivot_ctrl+'.rotate')\n\n\t\t\tcmds.connectAttr(ss+'.outTranslate', pivot_ctrl+'.translate')\n\n\t\t\tcmds.select(sticky_ctrl, r=True)\n\n\t\t\treturn [pivot_ctrl, offset_ctrl, sticky_ctrl, ss]\n\n\t\telse:\n\n\t\t\tprint \"chwSurfaceTweak: You need to select a mesh vertex!\\n\"\n\n\telse:\n","file_path":"chwTools/scripts/chwTools/deformers.py","rank":17,"score":37921.35208660156},{"content":"class chwNormalOffset : public MPxDeformerNode\n\n{\n\n\tpublic:\n\n\t\t\t\t\t\t\t\tchwNormalOffset();\n\n\t\tvirtual\t\t\t\t\t~chwNormalOffset();\n\n\n\n\t\tvirtual MStatus\t\t\tcompute(const MPlug& plug, MDataBlock& data);\n\n\t\tstatic void*\t\t\tcreator();\n\n\t\tstatic MStatus\t\t\tinitialize();\n\n\n\n\tpublic:\n\n\t\tstatic MObject\t\t\taStrength;\n\n\t\tstatic MObject\t\t\taNormalSmooth;\n\n\n\n\t\tstatic const MTypeId\ttypeId;\n\n\t\tstatic const MString\ttypeName;\n\n\n\n\tprivate:\n\n\t\t\tchwEdgeRelax m_relax;\n\n\t\t\tchwNormalOffsetData *m_data;\n","file_path":"include/chwNormalOffset.h","rank":18,"score":34939.99358871753},{"content":"def chwMeshRelax():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 1:\n\n\t\tcmds.deformer(selection, type='chwMeshRelax')\n\n\telse:\n","file_path":"chwTools/scripts/chwTools/deformers.py","rank":19,"score":34668.12466557332},{"content":"def chwVertexBind():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 2:\n\n\t\tvs = cmds.deformer(selection[-1], type='chwVertexBind')\n\n\t\tcmds.connectAttr(selection[0]+'.worldMesh[0]', vs[0]+'.driverMesh')\n\n\t\tcmds.setAttr(vs[0]+'.initialize', 1)\n\n\telse:\n","file_path":"chwTools/scripts/chwTools/deformers.py","rank":20,"score":34392.57571173141},{"content":"\t\t\t\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\n\n\t\t\t\t{\n\n\t\t\t\t\tdata->m_collided[idx] = 0;\n\n\t\t\t\t\tif (data->m_boxcol.contains(data->m_points[idx]))\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tbool bAllIntersections = colFn->allIntersections(data->m_points[idx], data->m_normals[idx], NULL, NULL, false, MSpace::kWorld, 9999.f, false,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t&data->m_mmAccelParams, false, m_hitPoints, &m_faHitRayParams, &m_iaHitFaces,\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t&m_iaHitTriangles, &m_faHitBary1, &m_faHitBary2, 0.000001f, &m_status);\n\n\t\t\t\t\t\tCHECK_MSTATUS(m_status);\n\n\t\t\t\t\t\tif (bAllIntersections)\n\n\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\tunsigned int numHits = m_hitPoints.length();\n\n\t\t\t\t\t\t\tif ((numHits % 2) != 0)\n\n\t\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\t\tdata->m_intersector.getClosestPoint(data->m_points[idx], m_pointOnMesh);\n\n\t\t\t\t\t\t\t\tMFloatPoint colpoint = m_pointOnMesh.getPoint();\n\n\t\t\t\t\t\t\t\tMFloatVector offset = colpoint - data->m_points[idx];\n\n\t\t\t\t\t\t\t\tdata->m_points[idx] += offset * data->m_weights[idx] * data->m_collisionStrength;\n\n\t\t\t\t\t\t\t\tfloat l = offset.length();\n\n\t\t\t\t\t\t\t\ttbb::mutex::scoped_lock lock;\n","file_path":"include/chwCollision.h","rank":21,"score":26503.166183592464},{"content":"\t\t\t\t\t\t\t\tlock.acquire(m_mutex);\n\n\t\t\t\t\t\t\t\tif (l > data->m_defmax)\n\n\t\t\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\t\t\tdata->m_defmax = l;\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tlock.release();\n\n\t\t\t\t\t\t\t\tdata->m_collided[idx] = 1;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t};\n\n\n\n\t\tstruct ThreadedBulge\n\n\t\t{\n\n\t\t\tchwCollisionData *data;\n\n\t\t\tvoid operator()( const blocked_range<int>& range ) const {\n\n\t\t\t\tMStatus\t\t\t\t\t\tm_status;\n\n\t\t\t\tMPointOnMesh\t\t\t\tm_pointOnMesh;\n","file_path":"include/chwCollision.h","rank":22,"score":26503.119155387176},{"content":"\t\t\t\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\n\n\t\t\t\t{\n\n\t\t\t\t\tif (!data->m_collided[idx])\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tfloat rampval;\n\n\t\t\t\t\t\tdata->m_intersector.getClosestPoint(data->m_points[idx], m_pointOnMesh);\n\n\t\t\t\t\t\tMFloatPoint colpoint = m_pointOnMesh.getPoint();\n\n\t\t\t\t\t\tMFloatVector offset = colpoint - data->m_points[idx];\n\n\t\t\t\t\t\tfloat ramppos = offset.length() / data->m_bulgeDistance;\n\n\t\t\t\t\t\tdata->m_bulgeRampAttribute.getValueAtPosition(ramppos, rampval, &m_status);\n\n\t\t\t\t\t\tCHECK_MSTATUS(m_status);\n\n\t\t\t\t\t\tfloat bulgestr = rampval * data->m_defmax * data->m_bulgeStrength;\n\n\t\t\t\t\t\tdata->m_points[idx] += data->m_normals[idx] * data->m_weights[idx] * data->m_collisionStrength * bulgestr;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t};\n\n};\n\n\n\n#endif // CHWCOLLISION_H\n","file_path":"include/chwCollision.h","rank":23,"score":26502.34334556681},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWCOLLISION_H\n\n#define CHWCOLLISION_H\n\n\n\n#include <string>\n\n#include <iostream>\n\n#include <sstream>\n\n\n\n#include <maya/MPxDeformerNode.h>\n\n#include <maya/MItGeometry.h>\n\n#include <maya/MTypeId.h>\n\n#include <maya/MPlug.h>\n\n#include <maya/MDataBlock.h>\n\n#include <maya/MDataHandle.h>\n\n#include <maya/MPoint.h>\n\n#include <maya/MPointArray.h>\n\n#include <maya/MFloatArray.h>\n\n#include <maya/MFnMesh.h>\n","file_path":"include/chwCollision.h","rank":24,"score":26501.349918099313},{"content":"\n\n\t\tstatic const MTypeId typeId;\n\n\t\tstatic const MString typeName;\n\nprivate:\n\n\t\tchwCollisionData *m_data;\n\n\t\tMStatus postConstructor_initialise_ramp_curve(MObject &rampObj, int index, float position, float value, int interpolation);\n\n\n\n\t\tstruct ThreadedCollide\n\n\t\t{\n\n\t\t\tchwCollisionData *data;\n\n\t\t\tMFnMesh *colFn;\n\n\t\t\tvoid operator()( const blocked_range<int>& range ) const {\n\n\t\t\t\tMFloatPointArray\t\t\tm_hitPoints;\n\n\t\t\t\tMFloatArray\t\t\t\t\tm_faHitRayParams;\n\n\t\t\t\tMIntArray\t\t\t\t\tm_iaHitFaces;\n\n\t\t\t\tMIntArray\t\t\t\t\tm_iaHitTriangles;\n\n\t\t\t\tMFloatArray\t\t\t\t\tm_faHitBary1;\n\n\t\t\t\tMFloatArray\t\t\t\t\tm_faHitBary2;\n\n\t\t\t\tMStatus\t\t\t\t\t\tm_status;\n\n\t\t\t\tMPointOnMesh\t\t\t\tm_pointOnMesh;\n","file_path":"include/chwCollision.h","rank":25,"score":26500.88406020844},{"content":"#include <maya/MVector.h>\n\n#include <maya/MFloatVectorArray.h>\n\n#include <maya/MFloatPointArray.h>\n\n#include <maya/MGlobal.h>\n\n#include <maya/MMatrix.h>\n\n#include <maya/MFnNumericAttribute.h>\n\n#include <maya/MFnTypedAttribute.h>\n\n#include <maya/MFnCompoundAttribute.h>\n\n#include <maya/MMeshIntersector.h>\n\n#include <maya/MBoundingBox.h>\n\n#include <maya/MDagPath.h>\n\n#include <maya/MRampAttribute.h>\n\n#include <maya/MFnStringData.h>\n\n\n\n// THREADING\n\n#include \"tbb/tbb.h\"\n\nusing namespace tbb;\n\n\n\ntypedef mutex mMutex;\n\nstatic mMutex m_mutex;\n\n\n","file_path":"include/chwCollision.h","rank":26,"score":26496.762395767484},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwCollision.h","rank":27,"score":26492.742647899955},{"content":"\n\n\t\tMFloatArray w(vertCount);\n\n\t\tif(env != 0.00 && iterations != 0)\n\n\t\t{\n\n\t\t\tfor (unsigned int idx=0; idx < vertCount; idx++)\n\n\t\t\t{\n\n\t\t\t\tw[idx] = weightValue(data,index,idx) * env;\n\n\t\t\t}\n\n\t\t\tMObject relaxMesh(outMesh);\n\n\t\t\tm_relax.relax(relaxMesh, iterations, rpts, w);\n\n\t\t\tmeshFn.setPoints(rpts, MSpace::kObject);\n\n\t\t}\n\n\t}\n\n\tdata.setClean(plug);\n\n\treturn MS::kSuccess;\n\n}\n","file_path":"src/chwMeshRelax.cpp","rank":28,"score":25112.26954649401},{"content":"\tunsigned int vertCount;\n\n\n\n\tif (plug.attribute() == outputGeom)\n\n\t{\n\n\t\tunsigned int index = plug.logicalIndex();\n\n\t\tMObject thisNode = this->thisMObject();\n\n\t\tMPlug inPlug(thisNode,input);\n\n\t\tinPlug.selectAncestorLogicalIndex(index,input);\n\n\t\tMDataHandle hInput = data.inputValue(inPlug, &stat );\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(stat)\n\n\n\n\t\tMDataHandle hGeom = hInput.child(inputGeom);\n\n\t\tMMatrix m = hGeom.geometryTransformMatrix();\n\n\t\tMDataHandle hOutput = data.outputValue(plug);\n\n\t\thOutput.copy(hGeom);\n\n\t\tMObject outMesh = hGeom.asMesh();\n\n\t\tMFnMesh meshFn(outMesh);\n\n\t\tvertCount = meshFn.numVertices();\n\n\t\tmeshFn.getPoints(pts, MSpace::kObject);\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(stat)\n","file_path":"src/chwMeshRelax.cpp","rank":29,"score":25111.315088238123},{"content":"\tnAttr.setStorable(true);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setConnectable(true);\n\n\tnAttr.setMin(0);\n\n\taddAttribute( aIterations );\n\n\n\n\tattributeAffects( chwMeshRelax::aIterations, chwMeshRelax::outputGeom );\n\n\n\n\tMGlobal::executeCommand(\"makePaintable -attrType multiFloat -sm deformer chwMeshRelax weights\");\n\n\n\n\treturn MStatus::kSuccess;\n\n}\n\n\n\nMStatus chwMeshRelax::compute(const MPlug& plug, MDataBlock& data)\n\n{\n\n\tMStatus stat;\n\n\tMPointArray pts;\n\n\tMPointArray rpts;\n\n\tfloat env = data.inputValue(envelope).asFloat();\n\n\tunsigned int iterations = data.inputValue(aIterations).asInt();\n","file_path":"src/chwMeshRelax.cpp","rank":30,"score":25109.89172127793},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#include <chwMeshRelax.h>\n\n\n\nconst MTypeId\tchwMeshRelax::typeId( 0x89002 );\n\nconst MString\tchwMeshRelax::typeName( \"chwMeshRelax\" );\n\n\n\nMObject \t\tchwMeshRelax::aIterations;\n\n\n\nchwMeshRelax::chwMeshRelax(){}\n\nchwMeshRelax::~chwMeshRelax(){}\n\nvoid* chwMeshRelax::creator(){ return new chwMeshRelax(); }\n\n\n\nMStatus chwMeshRelax::initialize()\n\n{\n\n\tMFnNumericAttribute nAttr;\n\n\n\n\taIterations = nAttr.create( \"iterations\", \"it\", MFnNumericData::kInt );\n\n\tnAttr.setKeyable(true);\n","file_path":"src/chwMeshRelax.cpp","rank":31,"score":25105.874567652736},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"src/chwMeshRelax.cpp","rank":32,"score":25095.45347962712},{"content":"\t\t\tstruct ThreadedDeform\n\n\t\t\t{\n\n\t\t\t\tchwNormalOffsetData *data;\n\n\t\t\t\tvoid operator()( const blocked_range<int>& range ) const {\n\n\t\t\t\t\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tdata->m_points[idx] += data->m_normals[idx] * data->m_weights[idx];\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t};\n\n};\n\n\n\n#endif // CHWNORMALOFFSET_H\n","file_path":"include/chwNormalOffset.h","rank":33,"score":24945.721613029953},{"content":"\t\t\t\tvoid operator()( const blocked_range<int>& range ) const {\n\n\t\t\t\t\tMStatus status;\n\n\t\t\t\t\tMPoint point;\n\n\t\t\t\t\tfloat dist,ramppos, rampval;\n\n\t\t\t\t\tfloat w;\n\n\t\t\t\t\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tw = data->m_weights[idx] * data->m_env;\n\n\t\t\t\t\t\tif ((w > 0.f) && (data->m_falloffRadius > 0.f))\n\n\t\t\t\t\t\t{\n\n\t\t\t\t\t\t\tdist = (data->m_relativeMatrixTranslate - data->m_points[idx]).length();\n\n\t\t\t\t\t\t\tramppos = dist / data->m_falloffRadius;\n\n\t\t\t\t\t\t\tdata->m_falloffCurve.getValueAtPosition(ramppos, rampval, &status);\n\n\n\n\t\t\t\t\t\t\tpoint = data->m_points[idx] * data->m_relativeInverseMatrix * data->m_deformMatrix;\n\n\t\t\t\t\t\t\tdata->m_points[idx] += ((point - data->m_points[idx]) * w * rampval);\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t};\n\n};\n\n\n\n#endif // CHWSURFACETWEAK_H\n","file_path":"include/chwSurfaceTweak.h","rank":34,"score":24944.252573776626},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWSURFACETWEAK_H\n\n#define CHWSURFACETWEAK_H\n\n\n\n#include <string.h>\n\n#include <math.h>\n\n#include <maya/MPxNode.h>\n\n#include <maya/MArrayDataBuilder.h>\n\n#include <maya/MPxDeformerNode.h>\n\n#include <maya/MMeshIntersector.h>\n\n#include <maya/MFnSingleIndexedComponent.h>\n\n#include <maya/MItGeometry.h>\n\n#include <maya/MItMeshVertex.h>\n\n#include <maya/MItMeshPolygon.h>\n\n#include <maya/MFnNumericAttribute.h>\n\n#include <maya/MFnEnumAttribute.h>\n\n#include <maya/MFnTypedAttribute.h>\n\n#include <maya/MTypeId.h>\n","file_path":"include/chwSurfaceTweak.h","rank":35,"score":24943.39292940774},{"content":"\t\t\t\t{\n\n\t\t\t\t\tnumcons = data->m_conids[idx].size();\n\n\t\t\t\t\tdata->m_relaxpoints[idx] = MPoint();\n\n\t\t\t\t\tfor (unsigned int idy=0; idy < numcons; idy++)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tidz = data->m_conids[idx][idy];\n\n\t\t\t\t\t\tdata->m_relaxpoints[idx] += data->m_points[idz];\n\n\t\t\t\t\t}\n\n\t\t\t\t\tdata->m_relaxpoints[idx] = data->m_points[idx] + ((data->m_relaxpoints[idx] / float(numcons)) - data->m_points[idx]) * data->m_weights[idx];\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t};\n\n};\n\n\n\n#endif // CHWEDGERELAX_H\n","file_path":"include/chwEdgeRelax.h","rank":36,"score":24941.870087191888},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWEDGERELAX_H\n\n#define CHWEDGERELAX_H\n\n\n\n#include <string.h>\n\n#include <math.h>\n\n#include <float.h>\n\n#include <vector>\n\n#include <iostream>\n\n#include <algorithm>\n\n\n\n#include <maya/MFnMesh.h>\n\n#include <maya/MVector.h>\n\n#include <maya/MIntArray.h>\n\n#include <maya/MFloatArray.h>\n\n#include <maya/MPointArray.h>\n\n#include <maya/MItMeshVertex.h>\n\n\n\n// THREADING\n\n#include \"tbb/tbb.h\"\n\nusing namespace tbb;\n\n\n","file_path":"include/chwEdgeRelax.h","rank":37,"score":24938.500676218486},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWNORMALOFFSET_H\n\n#define CHWNORMALOFFSET_H\n\n\n\n#include <maya/MPxDeformerNode.h>\n\n#include <maya/MItGeometry.h>\n\n#include <maya/MTypeId.h>\n\n#include <maya/MPlug.h>\n\n#include <maya/MDataBlock.h>\n\n#include <maya/MDataHandle.h>\n\n#include <maya/MPoint.h>\n\n#include <maya/MPointArray.h>\n\n#include <maya/MFnMesh.h>\n\n#include <maya/MVector.h>\n\n#include <maya/MFloatVectorArray.h>\n\n#include <maya/MGlobal.h>\n\n#include <maya/MMatrix.h>\n\n#include <maya/MFnNumericAttribute.h>\n\n#include <maya/MFloatArray.h>\n\n#include \"chwEdgeRelax.h\"\n\n\n\n// THREADING\n\n#include \"tbb/tbb.h\"\n\nusing namespace tbb;\n\n\n","file_path":"include/chwNormalOffset.h","rank":38,"score":24938.393131305573},{"content":"#include <maya/MDataBlock.h>\n\n#include <maya/MDataHandle.h>\n\n#include <maya/MDagPath.h>\n\n#include <maya/MGlobal.h>\n\n#include <maya/MArrayDataHandle.h>\n\n#include <maya/MPointArray.h>\n\n#include <maya/MPoint.h>\n\n#include <maya/MVector.h>\n\n#include <maya/MMatrix.h>\n\n#include <maya/MObject.h>\n\n#include <maya/MRampAttribute.h>\n\n#include <maya/MFnUnitAttribute.h>\n\n#include <maya/MFnMesh.h>\n\n#include <maya/MItMeshVertex.h>\n\n#include <maya/MFnMatrixAttribute.h>\n\n#include <maya/MAngle.h>\n\n\n\n// THREADING\n\n#include \"tbb/tbb.h\"\n\nusing namespace tbb;\n\n\n","file_path":"include/chwSurfaceTweak.h","rank":39,"score":24938.307543054045},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWMATRIXSELECTOR_H\n\n#define CHWMATRIXSELECTOR_H\n\n\n\n#include <math.h>\n\n#include <maya/MPxNode.h>\n\n#include <maya/MItGeometry.h>\n\n#include <maya/MTypeId.h>\n\n#include <maya/MPlug.h>\n\n#include <maya/MPlugArray.h>\n\n#include <maya/MDataBlock.h>\n\n#include <maya/MDataHandle.h>\n\n#include <maya/MPoint.h>\n\n#include <maya/MPointArray.h>\n\n#include <maya/MFnMesh.h>\n\n#include <maya/MVector.h>\n\n#include <maya/MFloatVectorArray.h>\n\n#include <maya/MGlobal.h>\n","file_path":"include/chwMatrixSelector.h","rank":40,"score":24938.306447232524},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#ifndef CHWCURVESAMPLER_H\n\n#define CHWCURVESAMPLER_H\n\n\n\n#include <math.h>\n\n#include <maya/MPxNode.h>\n\n#include <maya/MTypeId.h>\n\n#include <maya/MPlug.h>\n\n#include <maya/MPlugArray.h>\n\n#include <maya/MDataBlock.h>\n\n#include <maya/MDataHandle.h>\n\n#include <maya/MGlobal.h>\n\n#include <maya/MMatrix.h>\n\n#include <maya/MFnNumericAttribute.h>\n\n#include <maya/MFnUnitAttribute.h>\n\n#include <maya/MFnTypedAttribute.h>\n\n#include <maya/MQuaternion.h>\n\n#include <maya/MIOStream.h>\n\n#include <maya/MEulerRotation.h>\n\n#include <maya/MFnNurbsCurve.h>\n\n#include <maya/MArrayDataBuilder.h>\n\n#include <maya/MArrayDataHandle.h>\n\n#include <maya/MVector.h>\n\n\n","file_path":"include/chwCurveSampler.h","rank":41,"score":24936.82182656532},{"content":"\t\tstatic MObject aOutTranslateX;\n\n\t\tstatic MObject aOutTranslateY;\n\n\t\tstatic MObject aOutTranslateZ;\n\n\n\n\t\tstatic MObject aOutRotate;\n\n\t\tstatic MObject aOutRotateX;\n\n\t\tstatic MObject aOutRotateY;\n\n\t\tstatic MObject aOutRotateZ;\n\n\n\n\t\tstatic const MTypeId typeId;\n\n\t\tstatic const MString typeName;\n\n\n\n\t\tprivate:\n\n\t\t\tchwSurfaceTweakData\t*m_data;\n\n\n\n\t\t\tMStatus\t\tpostConstructor_initialise_ramp_curve(MObject &rampObj, int index, float position, float value, int interpolation);\n\n\n\n\t\t\tstruct ThreadedDeform\n\n\t\t\t{\n\n\t\t\t\tchwSurfaceTweakData *data;\n","file_path":"include/chwSurfaceTweak.h","rank":42,"score":24936.5903580128},{"content":"#include <maya/MMatrix.h>\n\n#include <maya/MFnNumericAttribute.h>\n\n#include <maya/MFnMatrixAttribute.h>\n\n#include <maya/MFnEnumAttribute.h>\n\n#include <maya/MFnCompoundAttribute.h>\n\n#include <maya/MFnUnitAttribute.h>\n\n#include <maya/MQuaternion.h>\n\n#include <maya/MIOStream.h>\n\n#include <maya/MEulerRotation.h>\n\n\n","file_path":"include/chwMatrixSelector.h","rank":43,"score":24932.35501295421},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwCurveSampler.h","rank":44,"score":24931.047125173533},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwNormalOffset.h","rank":45,"score":24931.047125173533},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwMatrixSelector.h","rank":46,"score":24931.047125173533},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwSurfaceTweak.h","rank":47,"score":24931.047125173533},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"include/chwEdgeRelax.h","rank":48,"score":24931.047125173533},{"content":"\t\tdrvIter.allPositions(m_data->m_drvpoints, MSpace::kWorld);\n\n\t\titer.allPositions(m_data->m_defpoints);\n\n\t\tm_data->m_mapping.setLength(m_data->m_defpoints.length());\n\n\t\tm_data->m_weights.setLength(m_data->m_defpoints.length());\n\n\t\tm_data->m_localToWorldMatrix = localToWorldMatrix;\n\n\n\n\t\tfor ( unsigned int idx = 0; idx < m_data->m_defpoints.length(); idx++ )\n\n\t\t{\n\n\t\t\tvertMapArrayData.jumpToElement(idx);\n\n\t\t\tm_data->m_mapping[idx] = vertMapArrayData.inputValue().asInt();\n\n\t\t\tm_data->m_weights[idx] = weightValue( data, mIndex, idx ) * env;\n\n\t\t}\n\n\n\n\t\tThreadedDeform td;\n\n\t\ttd.data = m_data;\n\n\t\tparallel_for( blocked_range<int>( 0, m_data->m_defpoints.length() ), td );\n\n\n\n\t\titer.setAllPositions(m_data->m_defpoints);\n\n\t}\n\n\treturn status;\n","file_path":"src/chwVertexBind.cpp","rank":49,"score":24714.089628848742},{"content":"\tdelete m_data;\n\n}\n\nvoid* chwVertexBind::creator(){ return new chwVertexBind(); }\n\n\n\nMStatus chwVertexBind::initialize()\n\n{\n\n\tMFnTypedAttribute \t\ttAttr;\n\n\tMFnEnumAttribute \t\teAttr;\n\n\tMFnNumericAttribute \tnAttr;\n\n\n\n\taDriverMesh = tAttr.create( \"driverMesh\", \"drv\", MFnData::kMesh );\n\n\ttAttr.setStorable(false);\n\n\ttAttr.setConnectable(true);\n\n\taddAttribute( aDriverMesh );\n\n\n\n\taSearchDistance = nAttr.create( \"SearchDistance\", \"sd\", MFnNumericData::kFloat, 0.01);\n\n\tnAttr.setStorable(true);\n\n\tnAttr.setReadable(true);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setKeyable(true);\n","file_path":"src/chwVertexBind.cpp","rank":50,"score":24710.480721599015},{"content":"\tm_data->m_localToWorldMatrix = localToWorldMatrix;\n\n\n\n\tThreadedInitialize ti;\n\n\tti.data = m_data;\n\n\tparallel_for( blocked_range<int>( 0, m_data->m_defpoints.length() ), ti );\n\n\n\n\tMArrayDataHandle vertMapOutArrayHandle = data.outputArrayValue( aVertexMap, &status );\n\n\tCHECK_MSTATUS(status);\n\n\tMArrayDataBuilder vertMapOutArrayBuilder = vertMapOutArrayHandle.builder(&status);\n\n\tCHECK_MSTATUS(status);\n\n\n\n\tfor ( unsigned int idx = 0; idx < m_data->m_defpoints.length(); idx++ )\n\n\t{\n\n\t\tMDataHandle initIndexData = vertMapOutArrayBuilder.addElement( idx, &status );\n\n\t\tCHECK_MSTATUS(status);\n\n\t\tinitIndexData.setInt(m_data->m_mapping[idx]);\n\n\t\tinitIndexData.setClean();\n\n\t}\n\n\n\n\tvertMapOutArrayHandle.set( vertMapOutArrayBuilder );\n","file_path":"src/chwVertexBind.cpp","rank":51,"score":24708.510571151768},{"content":"\taddAttribute( aInitialize );\n\n\n\n\taVertexMap = nAttr.create( \"vtxIndexMap\", \"vtximp\", MFnNumericData::kLong, -9999 );\n\n\tnAttr.setKeyable(false);\n\n\tnAttr.setArray(true);\n\n\tnAttr.setStorable(true);\n\n\tnAttr.setReadable(true);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setUsesArrayDataBuilder(true);\n\n\taddAttribute( aVertexMap );\n\n\n\n\tattributeAffects(chwVertexBind::aDriverMesh, \tchwVertexBind::outputGeom);\n\n\tattributeAffects(chwVertexBind::aSearchDistance,\tchwVertexBind::outputGeom);\n\n\tattributeAffects(chwVertexBind::aCutoffDistance,\tchwVertexBind::outputGeom);\n\n\tattributeAffects(chwVertexBind::aInitialize, \tchwVertexBind::outputGeom);\n\n\tattributeAffects(chwVertexBind::aVertexMap,\t\tchwVertexBind::outputGeom);\n\n\n\n\tMGlobal::executeCommand( \"makePaintable -attrType \\\"multiFloat\\\" -sm \\\"deformer\\\" \\\"chwVertexBind\\\" \\\"weights\\\";\" );\n\n\n\n\treturn MStatus::kSuccess;\n","file_path":"src/chwVertexBind.cpp","rank":52,"score":24707.703119478007},{"content":"}\n\n\n\nMStatus chwVertexBind::deform( MDataBlock& data, MItGeometry& iter, const MMatrix& localToWorldMatrix, unsigned int mIndex)\n\n{\n\n\tMStatus status;\n\n\tshort initialized_mapping = data.inputValue( aInitialize ).asShort();\n\n\n\n\tif( initialized_mapping == 1 )\n\n\t{\n\n\t\tstatus = initializeMapping(data, iter, localToWorldMatrix);\n\n\t\tinitialized_mapping = data.inputValue( aInitialize ).asShort();\n\n\t}\n\n\tif( initialized_mapping == 2 )\n\n\t{\n\n\t\tfloat env = data.inputValue(envelope).asFloat();\n\n\t\tMArrayDataHandle vertMapArrayData = data.inputArrayValue( aVertexMap );\n\n\n\n\t\tMDataHandle meshAttrHandle = data.inputValue( aDriverMesh, &status );\n\n\t\tMItGeometry drvIter( meshAttrHandle );\n\n\n","file_path":"src/chwVertexBind.cpp","rank":53,"score":24706.690965313304},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#include <chwVertexBind.h>\n\n\n\nMTypeId \t\tchwVertexBind::typeId ( 0x89001 );\n\nconst MString \tchwVertexBind::typeName( \"chwVertexBind\" );\n\n\n\nMObject \t\tchwVertexBind::aDriverMesh;\n\nMObject \t\tchwVertexBind::aSearchDistance;\n\nMObject \t\tchwVertexBind::aCutoffDistance;\n\nMObject \t\tchwVertexBind::aInitialize;\n\nMObject \t\tchwVertexBind::aVertexMap;\n\n\n\nchwVertexBind::chwVertexBind()\n\n{\n\n\tm_data = new chwVertexBindData;\n\n}\n\nchwVertexBind::~chwVertexBind()\n\n{\n","file_path":"src/chwVertexBind.cpp","rank":54,"score":24705.284695790295},{"content":"\n\n\tMObject tObj = thisMObject();\n\n\tMPlug setInitMode( tObj, aInitialize );\n\n\tsetInitMode.setValue( 2 );\n\n\n\n\tdata.setClean(aVertexMap);\n\n\treturn status;\n\n}\n\n\n\nMObject& chwVertexBind::accessoryAttribute() const\n\n{\n\n\treturn chwVertexBind::aDriverMesh ;\n\n}\n","file_path":"src/chwVertexBind.cpp","rank":55,"score":24704.269664053714},{"content":"}\n\n\n\n\n\n\n\nMStatus chwVertexBind::initializeMapping( MDataBlock& data, MItGeometry& iter, const MMatrix& localToWorldMatrix)\n\n{\n\n\tMStatus status;\n\n\n\n\tMDataHandle cutoffDistanceHnd = data.inputValue(aCutoffDistance, &status);\n\n\tm_data->m_cutoffDistance = cutoffDistanceHnd.asFloat();\n\n\n\n\tMDataHandle searchDistanceHnd = data.inputValue(aSearchDistance, &status);\n\n\tm_data->m_searchDistance = searchDistanceHnd.asFloat();\n\n\n\n\tMDataHandle meshAttrHandle = data.inputValue( aDriverMesh, &status );\n\n\tMItGeometry drvIter( meshAttrHandle );\n\n\n\n\tdrvIter.allPositions(m_data->m_drvpoints, MSpace::kWorld);\n\n\titer.allPositions(m_data->m_defpoints);\n\n\tm_data->m_mapping.setLength(m_data->m_defpoints.length());\n","file_path":"src/chwVertexBind.cpp","rank":56,"score":24701.599111190706},{"content":"\tnAttr.setMin(0.0);\n\n\taddAttribute(aSearchDistance);\n\n\n\n\taCutoffDistance = nAttr.create( \"Cutoff\", \"cof\", MFnNumericData::kFloat, 0.0);\n\n\tnAttr.setStorable(true);\n\n\tnAttr.setReadable(true);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setKeyable(true);\n\n\tnAttr.setMin(0.0);\n\n\taddAttribute(aCutoffDistance);\n\n\n\n\taInitialize = eAttr.create( \"initialize\", \"inl\" );\n\n\teAttr.addField(\t\"Off\", 0);\n\n\teAttr.addField(\t\"Re-Set Bind\", 1);\n\n\teAttr.addField(\t\"Bound\", 2);\n\n\teAttr.setKeyable(true);\n\n\teAttr.setStorable(true);\n\n\teAttr.setReadable(true);\n\n\teAttr.setWritable(true);\n\n\teAttr.setDefault(0);\n","file_path":"src/chwVertexBind.cpp","rank":57,"score":24699.62749734655},{"content":"/***********************************************************************************\n\n* Copyright (c) 2018 Cristian Hinz Welkens.\n\n*\n\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n*\n\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n* this software and associated documentation files (the \"Software\"), to deal in\n\n* the Software without restriction, including without limitation the rights to \n\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n* of the Software, and to permit persons to whom the Software is furnished to do\n\n* so, subject to the following conditions:\n\n*\n\n* The above copyright notice and this permission notice shall be included in all\n\n* copies or substantial portions of the Software.\n\n*\n\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n","file_path":"src/chwVertexBind.cpp","rank":58,"score":24697.182252563416},{"content":"class chwEdgeRelax\n\n{\n\n\tpublic:\n\n\t\t\t\tchwEdgeRelax();\n\n\t\tvirtual\t~chwEdgeRelax();\n\n\t\tvoid relax(MObject&, unsigned int);\n\n\t\tvoid relax(MObject&, unsigned int, MFloatArray &weights);\n\n\t\tvoid relax(MObject&, unsigned int, MPointArray&);\n\n\t\tvoid relax(MObject&, unsigned int, MPointArray&, MFloatArray &weights);\n\n\tprivate:\n\n\t\tchwEdgeRelaxData *m_relaxData;\n\n\t\tvoid\tbuildTopology(MObject &mesh);\n\n\t\tvoid\tdoRelax();\n\n\t\tstruct ThreadedDeform\n\n\t\t{\n\n\t\t\tchwEdgeRelaxData *data;\n\n\t\t\tvoid operator()( const blocked_range<int>& range ) const {\n\n\t\t\t\tunsigned int idz;\n\n\t\t\t\tunsigned int numcons;\n\n\t\t\t\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\n","file_path":"include/chwEdgeRelax.h","rank":59,"score":21182.16684584333},{"content":"#/***********************************************************************************\n\n#* Copyright (c) 2018 Cristian Hinz Welkens.\n\n#*\n\n#* This file is part of chwTools (https://github.com/chinzw/chwtools).\n\n#*\n\n#* Permission is hereby granted, free of charge, to any person obtaining a copy of\n\n#* this software and associated documentation files (the \"Software\"), to deal in\n\n#* the Software without restriction, including without limitation the rights to \n\n#* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\n\n#* of the Software, and to permit persons to whom the Software is furnished to do\n\n#* so, subject to the following conditions:\n\n#*\n\n#* The above copyright notice and this permission notice shall be included in all\n\n#* copies or substantial portions of the Software.\n\n#*\n\n#* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n\n#* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\n#* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\n#* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n\n#* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n\n#* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n#***********************************************************************************/\n\n\n\n\n\nimport re\n\nimport util\n\nfrom maya import cmds\n\n\n\nutil.loadPlugin()\n\n\n\ndef chwMeshRelax():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 1:\n\n\t\tcmds.deformer(selection, type='chwMeshRelax')\n\n\telse:\n\n\t\tprint \"chwMeshRelax: You need to select one mesh!\\n\"\n\n\n\ndef chwNormalOffset():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 1:\n\n\t\tcmds.deformer(selection, type='chwNormalOffset')\n\n\telse:\n\n\t\tprint \"chwNormalOffset: You need to select one mesh!\\n\"\n\n\n\ndef chwVertexBind():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 2:\n\n\t\tvs = cmds.deformer(selection[-1], type='chwVertexBind')\n\n\t\tcmds.connectAttr(selection[0]+'.worldMesh[0]', vs[0]+'.driverMesh')\n\n\t\tcmds.setAttr(vs[0]+'.initialize', 1)\n\n\telse:\n\n\t\tprint \"chwVertexBind: You need to select a driver and a target!\\n\"\n\n\n\ndef chwSurfaceTweak():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 1:\n\n\t\tselection = selection[0]\n\n\t\tif selection.count('vtx'):\n\n\t\t\tsplits = selection.split('.')\n\n\t\t\tmesh = splits[0]\n\n\t\t\tvtx = re.sub(\"[^0-9]\", \"\", splits[1])\n\n\t\t\tname = util.nextName('chwSurfaceTweak_'+mesh)\n\n\t\t\tss = cmds.deformer(mesh, type='chwSurfaceTweak')[0]\n\n\t\t\tcmds.setAttr(ss+'.vertex', int(vtx))\n\n\t\t\tpivot_ctrl = cmds.group(em=True, name=name)\n\n\t\t\toffset_ctrl = util.makeControlSphere(name+'_Offset', 0.25)\n\n\t\t\tsticky_ctrl = util.makeControlSphere(name+'_Deform')\n\n\t\t\tcmds.parent(sticky_ctrl, offset_ctrl)\n\n\t\t\tcmds.parent(offset_ctrl, pivot_ctrl)\n\n\t\t\tcmds.addAttr(sticky_ctrl, at='double', ln='envelope', k=1, dv=1, min=0, max=1)\n\n\t\t\tcmds.addAttr(sticky_ctrl, at='enum', ln='falloffMode', k=1, en='Volume')\n\n\t\t\tcmds.addAttr(sticky_ctrl, at='double', ln='falloffRadius', k=1, dv=1, min=0)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.falloffMode', ss+'.falloffMode', f=True)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.falloffRadius', ss+'.falloffRadius', f=True)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.envelope', ss+'.envelope', f=True)\n\n\t\t\tcmds.connectAttr(sticky_ctrl+'.worldMatrix[0]', ss+'.deformMatrix')\n\n\t\t\tcmds.connectAttr(offset_ctrl+'.worldMatrix[0]', ss+'.relativeMatrix')\n\n\t\t\tcmds.connectAttr(ss+'.outRotate', pivot_ctrl+'.rotate')\n\n\t\t\tcmds.connectAttr(ss+'.outTranslate', pivot_ctrl+'.translate')\n\n\t\t\tcmds.select(sticky_ctrl, r=True)\n\n\t\t\treturn [pivot_ctrl, offset_ctrl, sticky_ctrl, ss]\n\n\t\telse:\n\n\t\t\tprint \"chwSurfaceTweak: You need to select a mesh vertex!\\n\"\n\n\telse:\n\n\t\tprint \"chwSurfaceTweak: You need to select a mesh vertex!\\n\"\n\n\n\n\n\ndef chwCollision():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) > 1:\n\n\t\tdefmesh = selection[0]\n\n\t\tselection.pop(0)\n\n\t\tcolDefs = [x for x in cmds.listHistory(defmesh) if cmds.nodeType(x) == 'chwCollision']\n\n\t\tif colDefs:\n\n\t\t\tnextIdx = 0\n\n\t\t\tcoldef = colDefs[0]\n\n\t\t\tindices = cmds.getAttr(coldef+'.collisionMeshList', mi=True)\n\n\t\t\tif indices:\n\n\t\t\t\tnextIdx = indices[-1]+1\n\n\t\t\tfor idx in xrange(0, len(selection)):\n\n\t\t\t\tmidx = idx + nextIdx\n\n\t\t\t\tcmds.getAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName')\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=False)\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', selection[idx], type='string')\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=True)\n\n\t\t\t\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(midx)+'].collisionMesh', f=True)\n\n\t\telse:\n\n\t\t\tcoldef = cmds.deformer(defmesh, type='chwCollision')[0]\n\n\t\t\tfor idx in xrange(0, len(selection)):\n\n\t\t\t\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(idx)+'].collisionMesh', f=True)\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(idx)+'].collisionMeshName', selection[idx], type='string')\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(idx)+'].collisionMeshName', l=True)\n\n\n","file_path":"chwTools/scripts/chwTools/deformers.py","rank":60,"score":19568.467078856134},{"content":"def chwCollision():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) > 1:\n\n\t\tdefmesh = selection[0]\n\n\t\tselection.pop(0)\n\n\t\tcolDefs = [x for x in cmds.listHistory(defmesh) if cmds.nodeType(x) == 'chwCollision']\n\n\t\tif colDefs:\n\n\t\t\tnextIdx = 0\n\n\t\t\tcoldef = colDefs[0]\n\n\t\t\tindices = cmds.getAttr(coldef+'.collisionMeshList', mi=True)\n\n\t\t\tif indices:\n\n\t\t\t\tnextIdx = indices[-1]+1\n\n\t\t\tfor idx in xrange(0, len(selection)):\n\n\t\t\t\tmidx = idx + nextIdx\n\n\t\t\t\tcmds.getAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName')\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=False)\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', selection[idx], type='string')\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=True)\n\n\t\t\t\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(midx)+'].collisionMesh', f=True)\n\n\t\telse:\n\n\t\t\tcoldef = cmds.deformer(defmesh, type='chwCollision')[0]\n\n\t\t\tfor idx in xrange(0, len(selection)):\n\n\t\t\t\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(idx)+'].collisionMesh', f=True)\n\n\t\t\t\tcmds.setAttr(coldef+'.collisionMeshList['+str(idx)+'].collisionMeshName', selection[idx], type='string')\n","file_path":"chwTools/scripts/chwTools/deformers.py","rank":61,"score":18000.634282995168},{"content":"class chwCurveSampler : public MPxNode\n\n{\n\n\tpublic:\n\n\t\t\t\tchwCurveSampler();\n\n\t\tvirtual ~chwCurveSampler();\n\n\n\n\t\tvirtual MStatus \tcompute(const MPlug& plug, MDataBlock& data);\n\n\t\tstatic void* \t\tcreator();\n\n\t\tstatic MStatus \tinitialize();\n\n\n\n\tpublic:\n\n\t\tstatic\tMObject\t\t\taInCurve;\n\n\t\tstatic\tMObject\t\t\taInUpCurve;\n\n\t\tstatic\tMObject\t\t\taInNumSamples;\n\n\t\tstatic\tMObject\t\t\taOutRotate;\n\n\t\tstatic\tMObject\t\t\taOutRotateX;\n\n\t\tstatic\tMObject\t\t\taOutRotateY;\n\n\t\tstatic\tMObject\t\t\taOutRotateZ;\n\n\t\tstatic\tMObject\t\t\taOutTranslate;\n\n\t\tstatic\tMObject\t\t\taOutTranslateX;\n\n\t\tstatic\tMObject\t\t\taOutTranslateY;\n\n\t\tstatic\tMObject\t\t\taOutTranslateZ;\n\n\n\n\t\tstatic const MTypeId \ttypeId;\n\n\t\tstatic const MString \ttypeName;\n\n};\n\n\n\n#endif // CHWCURVESAMPLER_H\n","file_path":"include/chwCurveSampler.h","rank":62,"score":17646.27222345726},{"content":"class chwMatrixSelector : public MPxNode\n\n{\n\n\tpublic:\n\n\t\t\t\tchwMatrixSelector();\n\n\t\tvirtual ~chwMatrixSelector();\n\n\n\n\t\tvirtual MStatus \tcompute(const MPlug& plug, MDataBlock& data);\n\n\t\tstatic void* \t\tcreator();\n\n\t\tstatic MStatus \tinitialize();\n\n\n\n\tpublic:\n\n\t\tstatic\tMObject\t\t\taInMatrix;\n\n\t\tstatic\tMObject\t\t\taInMatrixList;\n\n\t\tstatic\tMObject\t\t\taOutRotate;\n\n\t\tstatic\tMObject\t\t\taOutRotateX;\n\n\t\tstatic\tMObject\t\t\taOutRotateY;\n\n\t\tstatic\tMObject\t\t\taOutRotateZ;\n\n\t\tstatic\tMObject\t\t\taOutTranslate;\n\n\t\tstatic\tMObject\t\t\taOutTranslateX;\n\n\t\tstatic\tMObject\t\t\taOutTranslateY;\n\n\t\tstatic\tMObject\t\t\taOutTranslateZ;\n\n\t\tstatic\tMObject\t\t\taInMatrixIndex;\n\n\n\n\n\n\t\tstatic const MTypeId \ttypeId;\n\n\t\tstatic const MString \ttypeName;\n\n};\n\n\n\n#endif // CHWMATRIXSELECTOR_H\n","file_path":"include/chwMatrixSelector.h","rank":63,"score":17646.27222345726},{"content":"def chwNormalOffset():\n\n\tselection = cmds.ls(sl=True)\n\n\tif len(selection) == 1:\n\n\t\tcmds.deformer(selection, type='chwNormalOffset')\n\n\telse:\n","file_path":"chwTools/scripts/chwTools/deformers.py","rank":64,"score":17307.300629780348},{"content":"\toutput.setLength(m_relaxData->m_vertcount);\n\n\toutput = m_relaxData->m_relaxpoints;\n\n}\n\n\n\nvoid chwEdgeRelax::doRelax()\n\n{\n\n\tfor (unsigned int idx=0; idx < m_relaxData->m_iterations; ++idx)\n\n\t{\n\n\t\tThreadedDeform td;\n\n\t\ttd.data = m_relaxData;\n\n\t\tparallel_for( blocked_range<int>( 0, m_relaxData->m_vertcount ), td );\n\n\t\tm_relaxData->m_points = m_relaxData->m_relaxpoints;\n\n\t}\n\n}\n\n\n\nvoid chwEdgeRelax::buildTopology(MObject &mesh)\n\n{\n\n\tMItMeshVertex \titer(mesh);\n\n\tMFnMesh\t\t\tmeshfn(mesh);\n\n\tMIntArray \t\tconVerts;\n","file_path":"src/chwEdgeRelax.cpp","rank":65,"score":22.69602579917136},{"content":"\n\n\t\tstatus = meshFn.getVertexNormals(false, m_data->m_normals, MSpace::kWorld);\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\t// RESIZE ALL ARRAYS\n\n\t\tm_data->m_numpoints = m_data->m_points.length();\n\n\t\tm_data->m_weights.setLength(m_data->m_numpoints);\n\n\t\tm_data->m_collided.setLength(m_data->m_numpoints);\n\n\n\n\t\tif(env > 0)\n\n\t\t{\n\n\t\t\tfor (unsigned int idx=0; idx<m_data->m_numpoints; idx++)\n\n\t\t\t{\n\n\t\t\t\tm_data->m_boxin.expand(m_data->m_points[idx]);\n\n\t\t\t\tm_data->m_weights[idx] = weightValue(data,index,idx) * env;\n\n\t\t\t}\n\n\n\n\t\t\tMArrayDataHandle arrayHandle = data.inputArrayValue(aCollisionMeshList, &status);\n\n\t\t\tunsigned int count = arrayHandle.elementCount();\n\n\t\t\tfor (unsigned int midx=0; midx < count; midx++)\n","file_path":"src/chwCollision.cpp","rank":66,"score":21.456760560591995},{"content":"\t\tm_data->m_numverts = meshFn.numVertices();\n\n\n\n\t\tif(m_data->m_env != 0.00 && m_data->m_strength != 0.00)\n\n\t\t{\n\n\t\t\tm_data->m_weights.setLength(m_data->m_numverts);\n\n\t\t\tfor (unsigned int idx=0; idx < m_data->m_numverts; idx++)\n\n\t\t\t{\n\n\t\t\t\tm_data->m_weights[idx] = weightValue(data,index,idx) * m_data->m_env * m_data->m_strength;\n\n\t\t\t}\n\n\t\t\tif (m_data->m_smooth > 0)\n\n\t\t\t{\n\n\t\t\t\tMObject relaxMesh(inMesh);\n\n\t\t\t\tm_relax.relax(relaxMesh, m_data->m_smooth);\n\n\t\t\t\tMFnMesh relaxFn(relaxMesh, &status);\n\n\t\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\t\t\trelaxFn.getVertexNormals(false, m_data->m_normals, MSpace::kObject);\n\n\t\t\t}\n\n\t\t\telse\n\n\t\t\t{\n","file_path":"src/chwNormalOffset.cpp","rank":67,"score":21.213864473710814},{"content":"\t\t\t\tmeshFn.getVertexNormals(false, m_data->m_normals, MSpace::kObject);\n\n\t\t\t}\n\n\n\n\t\t\t// THREADED DEFORMATION\n\n\t\t\tThreadedDeform td;\n\n\t\t\ttd.data = m_data;\n\n\t\t\tparallel_for( blocked_range<int>( 0, m_data->m_numverts ), td );\n\n\t\t}\n\n\t\tmeshFn.setPoints(m_data->m_points, MSpace::kObject);\n\n\t}\n\n\tdata.setClean(plug);\n\n\treturn MS::kSuccess;\n\n}\n","file_path":"src/chwNormalOffset.cpp","rank":69,"score":18.567517505983094},{"content":"\tm_data->m_smooth = data.inputValue(aNormalSmooth).asInt();\n\n\n\n\tif (plug.attribute() == outputGeom)\n\n\t{\n\n\t\tunsigned int index = plug.logicalIndex();\n\n\t\tMObject thisNode = this->thisMObject();\n\n\t\tMPlug inPlug(thisNode,input);\n\n\t\tinPlug.selectAncestorLogicalIndex(index,input);\n\n\t\tMDataHandle hInput = data.inputValue(inPlug, &status );\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\tMDataHandle hGeom = hInput.child(inputGeom);\n\n\t\tMMatrix m = hGeom.geometryTransformMatrix();\n\n\t\tMDataHandle hOutput = data.outputValue(plug);\n\n\t\thOutput.copy(hGeom);\n\n\t\tMObject inMesh = hGeom.asMesh();\n\n\t\tMFnMesh meshFn(inMesh, &status);\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\tmeshFn.getPoints(m_data->m_points, MSpace::kObject);\n","file_path":"src/chwNormalOffset.cpp","rank":70,"score":17.904318846198596},{"content":"\tif (plug.attribute() == outputGeom)\n\n\t{\n\n\t\tfloat env = data.inputValue(envelope).asFloat();\n\n\n\n\t\tm_data->m_bulgeRampAttribute = MRampAttribute(thisNode, aCollisionBulgeRamp, &status);\n\n\n\n\t\tunsigned int index = plug.logicalIndex();\n\n\t\tMPlug inPlug(thisNode,input);\n\n\t\tinPlug.selectAncestorLogicalIndex(index,input);\n\n\t\tMDataHandle hInput = data.inputValue(inPlug, &status );\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\tMDataHandle hGeom = hInput.child(inputGeom);\n\n\t\tMDataHandle hOutput = data.outputValue(plug);\n\n\t\thOutput.copy(hGeom);\n\n\t\tMObject outMesh = hGeom.asMesh();\n\n\t\tMFnMesh meshFn(outMesh);\n\n\n\n\t\tstatus = meshFn.getPoints(m_data->m_points, MSpace::kWorld);\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n","file_path":"src/chwCollision.cpp","rank":74,"score":17.202457895892735},{"content":"\tMFnMesh meshfn(mesh);\n\n\tmeshfn.setPoints(m_relaxData->m_relaxpoints);\n\n}\n\n\n\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations, MFloatArray &weights)\n\n{\n\n\tm_relaxData->m_iterations = iterations;\n\n\n\n\tbuildTopology(mesh);\n\n\n\n\tm_relaxData->m_weights = weights;\n\n\n\n\tdoRelax();\n\n\n\n\tMFnMesh meshfn(mesh);\n\n\tmeshfn.setPoints(m_relaxData->m_relaxpoints);\n\n}\n\n\n\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations, MPointArray &output)\n\n{\n","file_path":"src/chwEdgeRelax.cpp","rank":76,"score":16.648200688453837},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#include \"chwEdgeRelax.h\"\n\n\n\nchwEdgeRelax::chwEdgeRelax()\n\n{\n\n\tm_relaxData = new chwEdgeRelaxData;\n\n\tm_relaxData->m_cachedcount = 0;\n\n}\n\nchwEdgeRelax::~chwEdgeRelax() { }\n\n\n\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations)\n\n{\n\n\tm_relaxData->m_iterations = iterations;\n\n\n\n\tbuildTopology(mesh);\n\n\n\n\tdoRelax();\n\n\n","file_path":"src/chwEdgeRelax.cpp","rank":77,"score":15.266012504650387},{"content":"\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\tdouble min, max = 0.f;\n\n\t\tdouble param = 0.f;\n\n\t\tMVector\t\tinCurveTangent(0.f,0.f,0.f);\n\n\t\tMPoint\t\tinCurvePoint(0.f,0.f,0.f);\n\n\t\tMPoint\t\tinUpCurvePoint(0.f,0.f,0.f);\n\n\n\n\t\tMVector\t\tvx, vy, vz;\n\n\n\n\t\tMPoint outTranslate;\n\n\t\tdouble outRotate[3];\n\n\n\n\t\tinCurveFn.getKnotDomain(min, max);\n\n\n\n\t\tfloat step = max / (inNumSamples-1);\n\n\n\n\t\tfor (unsigned int idx=0; idx < inNumSamples; idx++)\n\n\t\t{\n\n\t\t\tparam = min + (idx * step);\n","file_path":"src/chwCurveSampler.cpp","rank":78,"score":15.067917224489126},{"content":"\tm_relaxData->m_iterations = iterations;\n\n\n\n\tbuildTopology(mesh);\n\n\n\n\tdoRelax();\n\n\n\n\toutput.setLength(m_relaxData->m_vertcount);\n\n\toutput = m_relaxData->m_relaxpoints;\n\n}\n\n\n\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations, MPointArray &output, MFloatArray &weights)\n\n{\n\n\tm_relaxData->m_iterations = iterations;\n\n\n\n\tbuildTopology(mesh);\n\n\n\n\tm_relaxData->m_weights = weights;\n\n\n\n\tdoRelax();\n\n\n","file_path":"src/chwEdgeRelax.cpp","rank":79,"score":15.045322833624525},{"content":"MObject \t\tchwMatrixSelector::aInMatrixIndex;\n\n\n\nchwMatrixSelector::chwMatrixSelector(){}\n\nchwMatrixSelector::~chwMatrixSelector(){}\n\nvoid* chwMatrixSelector::creator(){ return new chwMatrixSelector(); }\n\n\n\nMStatus chwMatrixSelector::compute(const MPlug& plug, MDataBlock& data)\n\n{\n\n\tMStatus status;\n\n\n\n\tif(plug == aOutRotate || plug == aOutTranslate || plug.parent() == aOutRotate || plug.parent() == aOutTranslate) {\n\n\t\tunsigned int matrixIndex = data.inputValue( aInMatrixIndex ).asShort();\n\n\t\tMArrayDataHandle arrayHandle = data.inputArrayValue(aInMatrixList, &status);\n\n\t\tif (status == MS::kSuccess) {\n\n\t\t\tunsigned int count = arrayHandle.elementCount();\n\n\t\t\tif (matrixIndex<count) {\n\n\t\t\t\tarrayHandle.jumpToArrayElement(matrixIndex);\n\n\t\t\t\tMDataHandle inputHandle = arrayHandle.inputValue(&status).child(aInMatrix);\n\n\t\t\t\tif (status == MS::kSuccess) {\n\n\t\t\t\t\tMTransformationMatrix matrix = inputHandle.asMatrix();\n","file_path":"src/chwMatrixSelector.cpp","rank":80,"score":14.951340062788235},{"content":"\t\t\t\tm_data->m_collisionStrength = collisionStrengthHnd.asFloat();\n\n\t\t\t\tm_data->m_bulgeStrength = collisionBulgeStrengthHnd.asFloat();\n\n\t\t\t\tm_data->m_bulgeDistance = collisionBulgeDistanceHnd.asFloat();\n\n\t\t\t\tm_data->m_defmax = 0.f;\n\n\n\n\t\t\t\tif ((m_data->m_collisionStrength > 0.f) && !collisionMeshHnd.data().isNull())\n\n\t\t\t\t{\n\n\t\t\t\t\tMFloatPointArray pointsCol;\n\n\t\t\t\t\tMObject\tcolMesh = collisionMeshHnd.asMeshTransformed();\n\n\t\t\t\t\ttc.colFn = new MFnMesh(colMesh);\n\n\n\n\t\t\t\t\tstatus = tc.colFn->getPoints(pointsCol, MSpace::kWorld);\n\n\t\t\t\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\t\t\t\tfor (unsigned int idx=0; idx<pointsCol.length(); idx++)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tm_data->m_boxcol.expand(pointsCol[idx]);\n\n\t\t\t\t\t}\n\n\n\n\t\t\t\t\tm_data->m_mmAccelParams = tc.colFn->autoUniformGridParams();\n","file_path":"src/chwCollision.cpp","rank":83,"score":14.519192903052751},{"content":"MObject \t\tchwCurveSampler::aOutTranslateZ;\n\n\n\nchwCurveSampler::chwCurveSampler(){}\n\nchwCurveSampler::~chwCurveSampler(){}\n\nvoid* chwCurveSampler::creator(){ return new chwCurveSampler(); }\n\n\n\nMStatus chwCurveSampler::compute(const MPlug& plug, MDataBlock& data)\n\n{\n\n\tMStatus status;\n\n\n\n\tif(plug == aOutRotate || plug == aOutTranslate || plug.parent() == aOutRotate || plug.parent() == aOutTranslate) {\n\n\t\t// GET NUM SAMPLES\n\n\t\tunsigned int inNumSamples = data.inputValue(aInNumSamples).asInt();\n\n\n\n\t\t// SETUP ARRAY DATA HANDLE\n\n\t\tMArrayDataHandle outRotateArray = data.outputArrayValue(aOutRotate, &status);\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n\n\n\n\t\tMArrayDataHandle outTranslateArray = data.outputArrayValue(aOutTranslate, &status);\n\n\t\tCHECK_MSTATUS_AND_RETURN_IT(status);\n","file_path":"src/chwCurveSampler.cpp","rank":84,"score":14.334236951924755},{"content":"\t\t\t\t\tm_data->m_intersector.create(colMesh);\n\n\n\n\t\t\t\t\tif (m_data->m_boxin.intersects(m_data->m_boxcol))\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tparallel_for( blocked_range<int>( 0, m_data->m_numpoints ), tc );\n\n\t\t\t\t\t\tparallel_for( blocked_range<int>( 0, m_data->m_numpoints ), tb );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tmeshFn.setPoints(m_data->m_points, MSpace::kWorld);\n\n\t}\n\n\tdata.setClean(plug);\n\n\treturn MS::kSuccess;\n\n}\n\n\n\nvoid chwCollision::postConstructor()\n\n{\n\n\tMStatus status;\n\n\n","file_path":"src/chwCollision.cpp","rank":86,"score":12.494921731601483},{"content":"chwCollision::~chwCollision()\n\n{\n\n\tdelete m_data;\n\n}\n\nvoid* chwCollision::creator(){ return new chwCollision(); }\n\n\n\nMStatus chwCollision::initialize()\n\n{\n\n\tMFnTypedAttribute\t\ttAttr;\n\n\tMFnNumericAttribute\t\tnAttr;\n\n\tMFnCompoundAttribute\tcAttr;\n\n\tMRampAttribute\t\t\trAttr;\n\n\tMFnStringData\t\t\tstringdata;\n\n\n\n\taCollisionMesh = tAttr.create( \"collisionMesh\", \"cm\", MFnData::kMesh );\n\n\ttAttr.setStorable(false);\n\n\ttAttr.setConnectable(true);\n\n\taddAttribute( aCollisionMesh );\n\n\n\n\taCollisionMeshName = tAttr.create( \"collisionMeshName\", \"cmn\", MFnData::kString, stringdata.create() );\n","file_path":"src/chwCollision.cpp","rank":87,"score":12.134161223076516},{"content":"\n\n\t\t\tm[2][0] = vz[0];\n\n\t\t\tm[2][1] = vz[1];\n\n\t\t\tm[2][2] = vz[2];\n\n\t\t\tm[2][3] = 0.f;\n\n\n\n\t\t\tm[3][0] = inCurvePoint[0];\n\n\t\t\tm[3][1] = inCurvePoint[1];\n\n\t\t\tm[3][2] = inCurvePoint[2];\n\n\t\t\tm[3][3] = 1.f;\n\n\n\n\t\t\tMDataHandle outRotateHnd = outRotateBuilder.addElement(idx);\n\n\t\t\tMDataHandle outTranslateHnd = outTranslateBuilder.addElement(idx);\n\n\n\n\t\t\tMTransformationMatrix outMatrix(m);\n\n\t\t\tMTransformationMatrix::RotationOrder order;\n\n\n\n\t\t\toutMatrix.getRotation(outRotate, order, MSpace::kWorld);\n\n\t\t\toutTranslate = outMatrix.getTranslation(MSpace::kWorld);\n\n\n","file_path":"src/chwCurveSampler.cpp","rank":88,"score":11.403400283474532},{"content":"\n\n\tmeshfn.getPoints(m_relaxData->m_points, MSpace::kObject);\n\n\n\n\tm_relaxData->m_vertcount = iter.count();\n\n\tm_relaxData->m_points.clear();\n\n\tm_relaxData->m_relaxpoints.clear();\n\n\tm_relaxData->m_weights.clear();\n\n\tm_relaxData->m_points.setLength(m_relaxData->m_vertcount);\n\n\tm_relaxData->m_relaxpoints.setLength(m_relaxData->m_vertcount);\n\n\tm_relaxData->m_weights.setLength(m_relaxData->m_vertcount);\n\n\n\n\tm_relaxData->m_weights = MFloatArray(m_relaxData->m_vertcount, 1.f);\n\n\n\n\tif (m_relaxData->m_vertcount != m_relaxData->m_cachedcount)\n\n\t{\n\n\t\tm_relaxData->m_conids.clear();\n\n\t\tm_relaxData->m_conids.resize(m_relaxData->m_vertcount);\n\n\t\tfor (unsigned int idx=0; !iter.isDone(); iter.next(),++idx)\n\n\t\t{\n\n\t\t\t\titer.getConnectedVertices(conVerts);\n","file_path":"src/chwEdgeRelax.cpp","rank":89,"score":11.103473489102276},{"content":"\n\nvoid* chwNormalOffset::creator()\n\n{\n\n\treturn new chwNormalOffset();\n\n}\n\n\n\n\n\nMStatus chwNormalOffset::initialize()\n\n{\n\n\tMFnNumericAttribute nAttr;\n\n\n\n\taStrength = nAttr.create( \"strength\", \"str\", MFnNumericData::kFloat );\n\n\tnAttr.setKeyable(true);\n\n\tnAttr.setStorable(true);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setConnectable(true);\n\n\taddAttribute( aStrength );\n\n\n\n\taNormalSmooth = nAttr.create( \"normalSmooth\", \"ns\", MFnNumericData::kInt );\n\n\tnAttr.setKeyable(true);\n","file_path":"src/chwNormalOffset.cpp","rank":90,"score":10.752410281520898},{"content":"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n***********************************************************************************/\n\n\n\n#include <maya/MFnPlugin.h>\n\n#include <chwVertexBind.h>\n\n#include <chwMeshRelax.h>\n\n#include <chwNormalOffset.h>\n\n#include <chwMatrixSelector.h>\n\n#include <chwCurveSampler.h>\n\n#include <chwCollision.h>\n\n#include <chwSurfaceTweak.h>\n\n\n\nMStatus initializePlugin( MObject obj )\n\n{\n\n\tMFnPlugin plugin( obj, \"Cristian Hinz Welkens\", \"1.0\", \"Any\");\n\n\n\n\tCHECK_MSTATUS ( plugin.registerNode( chwVertexBind::typeName, chwVertexBind::typeId,\n\n\t\t\t\t\tchwVertexBind::creator, chwVertexBind::initialize, MPxNode::kDeformerNode ) );\n\n\n\n\tCHECK_MSTATUS ( plugin.registerNode( chwMeshRelax::typeName, chwMeshRelax::typeId,\n","file_path":"src/chwTools.cpp","rank":91,"score":10.692089496458017},{"content":"\tnAttr.setStorable(true);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setConnectable(true);\n\n\tnAttr.setMin(0);\n\n\taddAttribute( aNormalSmooth );\n\n\n\n\tattributeAffects( chwNormalOffset::aStrength, chwNormalOffset::outputGeom );\n\n\tattributeAffects( chwNormalOffset::aNormalSmooth, chwNormalOffset::outputGeom );\n\n\n\n\tMGlobal::executeCommand(\"makePaintable -attrType multiFloat -sm deformer chwNormalOffset weights\");\n\n\n\n\treturn MStatus::kSuccess;\n\n}\n\n\n\nMStatus chwNormalOffset::compute(const MPlug& plug, MDataBlock& data)\n\n{\n\n\n\n\tMStatus status;\n\n\tm_data->m_env = data.inputValue(envelope).asFloat();\n\n\tm_data->m_strength = data.inputValue(aStrength).asFloat();\n","file_path":"src/chwNormalOffset.cpp","rank":92,"score":10.658778140880191},{"content":"\t\t\t\tfor (unsigned int idz=0;idz<conVerts.length();++idz)\n\n\t\t\t\t{\n\n\t\t\t\t\tm_relaxData->m_conids[idx].push_back(conVerts[idz]);\n\n\t\t\t\t}\n\n\t\t}\n\n\t\titer.reset();\n\n\t}\n\n\tm_relaxData->m_cachedcount = m_relaxData->m_vertcount;\n\n}\n","file_path":"src/chwEdgeRelax.cpp","rank":93,"score":10.386067077330875},{"content":"\t\t\tinCurveTangent = inCurveFn.tangent(param, MSpace::kWorld);\n\n\t\t\tinCurveFn.getPointAtParam(param, inCurvePoint, MSpace::kWorld);\n\n\t\t\tinUpCurveFn.getPointAtParam(param, inUpCurvePoint, MSpace::kWorld);\n\n\n\n\n\n\t\t\tMMatrix m;\n\n\n\n\t\t\tvx = inCurveTangent.normal();\n\n\t\t\tvy = (inUpCurvePoint - inCurvePoint).normal();\n\n\t\t\tvz = (vx ^ vy).normal();\n\n\n\n\t\t\tm[0][0] = vx[0];\n\n\t\t\tm[0][1] = vx[1];\n\n\t\t\tm[0][2] = vx[2];\n\n\t\t\tm[0][3] = 0.f;\n\n\n\n\t\t\tm[1][0] = vy[0];\n\n\t\t\tm[1][1] = vy[1];\n\n\t\t\tm[1][2] = vy[2];\n\n\t\t\tm[1][3] = 0.f;\n","file_path":"src/chwCurveSampler.cpp","rank":95,"score":9.474514580096084},{"content":"\tuAttr.setConnectable(true);\n\n\taOutRotate = nAttr.create( \"outRotate\", \"or\", aOutRotateX, aOutRotateY, aOutRotateZ);\n\n\tnAttr.setArray(true);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setStorable(true);\n\n\tnAttr.setConnectable(true);\n\n\tnAttr.setUsesArrayDataBuilder(true);\n\n\taddAttribute( aOutRotate );\n\n\n\n\n\n\taOutTranslateX = nAttr.create( \"outTranslateX\", \"otx\", MFnNumericData::kDouble, 0.0);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setStorable(true);\n\n\tnAttr.setConnectable(true);\n\n\taOutTranslateY = nAttr.create( \"outTranslateY\", \"oty\", MFnNumericData::kDouble, 0.0);\n\n\tnAttr.setWritable(true);\n\n\tnAttr.setStorable(true);\n\n\tnAttr.setConnectable(true);\n\n\taOutTranslateZ = nAttr.create( \"outTranslateZ\", \"otz\", MFnNumericData::kDouble, 0.0);\n\n\tnAttr.setWritable(true);\n","file_path":"src/chwCurveSampler.cpp","rank":97,"score":8.829101889861452},{"content":"\tstatus = postConstructor_initialise_ramp_curve( aCollisionBulgeRamp, 0, 0.0f, 0.0f, 2 );\n\n\tCHECK_MSTATUS(status);\n\n\tstatus = postConstructor_initialise_ramp_curve( aCollisionBulgeRamp, 1, 0.3f, 0.8f, 2 );\n\n\tCHECK_MSTATUS(status);\n\n\tstatus = postConstructor_initialise_ramp_curve( aCollisionBulgeRamp, 2, 1.0f, 0.0f, 2 );\n\n\tCHECK_MSTATUS(status);\n\n}\n\n\n\nMStatus chwCollision::postConstructor_initialise_ramp_curve( MObject &rampObj, int index, float position, float value, int interpolation)\n\n{\n\n\tMStatus status;\n\n\n\n\tMObject thisNode = this->thisMObject();\n\n\n\n\tMPlug rampPlug( thisNode, rampObj );\n\n\tMPlug elementPlug = rampPlug.elementByLogicalIndex( index, &status );\n\n\n\n\tMPlug positionPlug = elementPlug.child(0, &status);\n\n\tstatus = positionPlug.setFloat(position);\n\n\n\n\tMPlug valuePlug = elementPlug.child(1);\n\n\tstatus = valuePlug.setFloat(value);\n\n\n\n\tMPlug interpPlug = elementPlug.child(2);\n\n\tinterpPlug.setInt(interpolation);\n\n\n\n\treturn MS::kSuccess;\n\n}\n","file_path":"src/chwCollision.cpp","rank":99,"score":8.504856191374927}],"string":"[\n {\n \"content\": \"class chwVertexBindData\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\tMPointArray\\t\\tm_drvpoints;\\n\\n\\t\\tMPointArray\\t\\tm_defpoints;\\n\\n\\t\\tMFloatArray\\t\\tm_weights;\\n\\n\\t\\tMIntArray\\t\\tm_mapping;\\n\\n\\t\\tMMatrix\\t\\t\\tm_localToWorldMatrix;\\n\\n\\t\\tfloat\\t\\t\\tm_cutoffDistance;\\n\\n\\t\\tfloat\\t\\t\\tm_searchDistance;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 0,\n \"score\": 71214.335526944\n },\n {\n \"content\": \"class chwMeshRelax : public MPxDeformerNode\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\t\\t\\t\\tchwMeshRelax();\\n\\n\\t\\t\\tvirtual ~chwMeshRelax();\\n\\n\\n\\n\\t\\t\\tvirtual MStatus \\tcompute(const MPlug& plug, MDataBlock& data);\\n\\n\\t\\t\\tstatic void* \\t\\tcreator();\\n\\n\\t\\t\\tstatic MStatus \\tinitialize();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tstatic MObject \\t\\taIterations;\\n\\n\\t\\tstatic const MTypeId \\ttypeId;\\n\\n\\t\\tstatic const MString \\ttypeName;\\n\\n\\tprivate:\\n\\n\\t\\tchwEdgeRelax m_relax;\\n\\n};\\n\\n\\n\\n#endif // CHWMESHRELAX_H\\n\",\n \"file_path\": \"include/chwMeshRelax.h\",\n \"rank\": 1,\n \"score\": 61325.964982955564\n },\n {\n \"content\": \"class chwVertexBind : public MPxDeformerNode\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tchwVertexBind();\\n\\n\\t\\tvirtual\\t\\t\\t\\t\\t~chwVertexBind();\\n\\n\\t\\tstatic void*\\t\\t\\tcreator();\\n\\n\\t\\tstatic MStatus\\t\\t\\tinitialize();\\n\\n\\n\\n\\t\\tvirtual MStatus\\t\\t\\tdeform(MDataBlock& data,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tMItGeometry& iter,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tconst MMatrix& mat,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tunsigned int mIndex);\\n\\n\\n\\n\\t\\tvirtual MStatus\\t\\t\\tinitializeMapping( MDataBlock& data, MItGeometry& iter, const MMatrix &localToWorldMatrix);\\n\\n\\n\\n\\t\\tstatic int\\t\\t\\t\\tgetClosestPoint( MPoint &pt, MPointArray &points ) ;\\n\\n\\n\\n\\t\\tvirtual MObject&\\t\\taccessoryAttribute() const;\\n\\n\\n\\n\\t\\t// Attributes\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 2,\n \"score\": 60907.16995348032\n },\n {\n \"content\": \"class chwSurfaceTweakData\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\tunsigned int\\t\\t\\tm_vert;\\n\\n\\t\\tunsigned int\\t\\t\\tm_upvert;\\n\\n\\t\\tunsigned int\\t\\t\\tm_aimvert;\\n\\n\\n\\n\\t\\tunsigned int\\t\\t\\tm_numverts;\\n\\n\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tm_env;\\n\\n\\t\\tshort\\t\\t\\t\\t\\tm_falloffMode;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\tm_falloffRadius;\\n\\n\\t\\tMRampAttribute\\t\\t\\tm_falloffCurve;\\n\\n\\n\\n\\t\\tMMatrix\\t\\t\\t\\t\\tm_deformMatrix;\\n\\n\\t\\tMMatrix\\t\\t\\t\\t\\tm_relativeMatrix;\\n\\n\\t\\tMMatrix\\t\\t\\t\\t\\tm_relativeInverseMatrix;\\n\\n\\t\\tMMatrix\\t\\t\\t\\t\\tm_localToWorldMatrix;\\n\\n\\t\\tMMatrix\\t\\t\\t\\t\\tm_localToWorldMatrixInverse;\\n\\n\\n\\n\\t\\tMVector\\t\\t\\t\\t\\tm_relativeMatrixTranslate;\\n\\n\\n\\n\\t\\tMPointArray\\t\\t\\t\\tm_points;\\n\\n\\t\\tMFloatVectorArray\\t\\tm_normals;\\n\\n\\t\\tMFloatArray\\t\\t\\t\\tm_weights;\\n\\n\\n\\n\\t\\tMIntArray\\t\\t\\t\\tm_conids;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/chwSurfaceTweak.h\",\n \"rank\": 3,\n \"score\": 58972.80964150416\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWMESHRELAX_H\\n\\n#define CHWMESHRELAX_H\\n\\n\\n\\n#include <maya/MPxDeformerNode.h>\\n\\n#include <maya/MItGeometry.h>\\n\\n#include <maya/MTypeId.h>\\n\\n#include <maya/MPlug.h>\\n\\n#include <maya/MDataBlock.h>\\n\\n#include <maya/MDataHandle.h>\\n\\n#include <maya/MPoint.h>\\n\\n#include <maya/MPointArray.h>\\n\\n#include <maya/MFnMesh.h>\\n\\n#include <maya/MVector.h>\\n\\n#include <maya/MFloatVectorArray.h>\\n\\n#include <maya/MGlobal.h>\\n\\n#include <maya/MMatrix.h>\\n\\n#include <maya/MFnNumericAttribute.h>\\n\\n#include <maya/MIOStream.h>\\n\\n#include <chwEdgeRelax.h>\\n\\n\\n\\n\\n\",\n \"file_path\": \"include/chwMeshRelax.h\",\n \"rank\": 4,\n \"score\": 51510.89715532284\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwMeshRelax.h\",\n \"rank\": 5,\n \"score\": 51503.246659614466\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_mapping[idx] = -1;\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t};\\n\\n\\t\\tstruct ThreadedDeform\\n\\n\\t\\t{\\n\\n\\t\\t\\tchwVertexBindData *data;\\n\\n\\t\\t\\tvoid operator()( const blocked_range<int>& range ) const {\\n\\n\\t\\t\\t\\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tif (data->m_weights[idx] != 0.f)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tif (data->m_mapping[idx] >= 0)\\n\\n\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_defpoints[idx] *= data->m_localToWorldMatrix;\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_defpoints[idx] += ((data->m_drvpoints[data->m_mapping[idx]] - data->m_defpoints[idx]) * data->m_weights[idx]);\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_defpoints[idx] *= data->m_localToWorldMatrix.inverse();\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 6,\n \"score\": 51097.1070476012\n },\n {\n \"content\": \"\\t\\tstatic MObject \\t\\taDriverMesh;\\n\\n\\t\\tstatic MObject \\t\\taCutoffDistance;\\n\\n\\t\\tstatic MObject \\t\\taSearchDistance;\\n\\n\\t\\tstatic MObject \\t\\taInitialize;\\n\\n\\t\\tstatic MObject \\t\\taVertexMap;\\n\\n\\n\\n\\t\\t// PLUGIN\\n\\n\\t\\tstatic MTypeId \\t\\ttypeId;\\n\\n\\t\\tstatic const MString \\ttypeName;\\n\\n\\tprivate:\\n\\n\\t\\tchwVertexBindData *m_data;\\n\\n\\n\\n\\t\\tstruct ThreadedInitialize\\n\\n\\t\\t{\\n\\n\\t\\t\\tchwVertexBindData *data;\\n\\n\\t\\t\\tvoid operator()( const blocked_range<int>& range ) const {\\n\\n\\t\\t\\t\\tfloat maxdistance;\\n\\n\\t\\t\\t\\tfloat curdistance;\\n\\n\\t\\t\\t\\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\\n\\n\\t\\t\\t\\t{\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 7,\n \"score\": 51093.46988950799\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWVERTEXBIND_H\\n\\n#define CHWVERTEXBIND_H\\n\\n\\n\\n#include <maya/MStatus.h>\\n\\n#include <maya/MObject.h>\\n\\n#include <maya/MPoint.h>\\n\\n#include <maya/MTypeId.h>\\n\\n#include <maya/MString.h>\\n\\n#include <maya/MPointArray.h>\\n\\n#include <maya/MDataBlock.h>\\n\\n#include <maya/MItGeometry.h>\\n\\n#include <maya/MFnTypedAttribute.h>\\n\\n#include <maya/MFnEnumAttribute.h>\\n\\n#include <maya/MFnNumericAttribute.h>\\n\\n#include <maya/MPxDeformerNode.h>\\n\\n#include <maya/MGlobal.h>\\n\\n#include <maya/MItMeshVertex.h>\\n\\n#include <maya/MMatrix.h>\\n\\n#include <maya/MArrayDataBuilder.h>\\n\\n\\n\\n#include \\\"float.h\\\"\\n\\n\\n\\n// THREADING\\n\\n#include \\\"tbb/tbb.h\\\"\\n\\nusing namespace tbb;\\n\\n\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 8,\n \"score\": 51088.71918057718\n },\n {\n \"content\": \"\\t\\t\\t\\t\\tmaxdistance = FLT_MAX;\\n\\n\\t\\t\\t\\t\\tcurdistance = FLT_MIN;\\n\\n\\n\\n\\t\\t\\t\\t\\tdata->m_mapping[idx] = -1;\\n\\n\\t\\t\\t\\t\\tMPoint defpoint = data->m_defpoints[idx] * data->m_localToWorldMatrix;\\n\\n\\n\\n\\t\\t\\t\\t\\tfor ( int idy = 0; idy < data->m_drvpoints.length(); idy++ )\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tcurdistance = defpoint.distanceTo( data->m_drvpoints[idy] );\\n\\n\\t\\t\\t\\t\\t\\tif (curdistance <= data->m_cutoffDistance)\\n\\n\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_mapping[idx] = idy;\\n\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif (curdistance < maxdistance)\\n\\n\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\tmaxdistance = curdistance;\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_mapping[idx] = idy;\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(maxdistance > data->m_searchDistance)\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 9,\n \"score\": 51087.37520128013\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 10,\n \"score\": 51081.49583903719\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t};\\n\\n\\n\\n};\\n\\n\\n\\n#endif // CHWVERTEXBIND_H\\n\",\n \"file_path\": \"include/chwVertexBind.h\",\n \"rank\": 11,\n \"score\": 51078.921846586\n },\n {\n \"content\": \"class chwSurfaceTweak : public MPxDeformerNode\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\t\\t\\t\\t\\t\\tchwSurfaceTweak();\\n\\n\\t\\tvirtual\\t\\t\\t\\t~chwSurfaceTweak();\\n\\n\\t\\tstatic void*\\t\\tcreator();\\n\\n\\t\\tstatic MStatus\\t\\tinitialize();\\n\\n\\n\\n\\t\\tvirtual MStatus\\t\\tcompute( const MPlug& plug, MDataBlock& data );\\n\\n\\t\\tvirtual\\tvoid\\t\\tpostConstructor();\\n\\n\\n\\n\\t\\tstatic MObject aInVert;\\n\\n\\n\\n\\t\\tstatic MObject aFalloffMode;\\n\\n\\t\\tstatic MObject aFalloffCurve;\\n\\n\\t\\tstatic MObject aFalloffRadius;\\n\\n\\t\\tstatic MObject aRelativeMatrix;\\n\\n\\t\\tstatic MObject aDeformMatrix;\\n\\n\\n\\n\\t\\tstatic MObject aOutTranslate;\\n\",\n \"file_path\": \"include/chwSurfaceTweak.h\",\n \"rank\": 12,\n \"score\": 47502.733300620705\n },\n {\n \"content\": \"class chwCollisionData\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\tMFloatPointArray\\t\\t\\tm_points;\\n\\n\\t\\tMFloatVectorArray\\t\\t\\tm_normals;\\n\\n\\t\\tMFloatArray\\t\\t\\t\\t\\tm_weights;\\n\\n\\t\\tMMeshIntersector\\t\\t\\tm_intersector;\\n\\n\\t\\tMMeshIsectAccelParams\\t\\tm_mmAccelParams;\\n\\n\\t\\tMIntArray\\t\\t\\t\\t\\tm_collided;\\n\\n\\t\\tMRampAttribute\\t\\t\\t\\tm_bulgeRampAttribute;\\n\\n\\n\\n\\t\\tunsigned int\\t\\t\\t\\tm_numpoints;\\n\\n\\n\\n\\t\\t// USER SETTINGS\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\tm_collisionStrength;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\tm_bulgeStrength;\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\tm_bulgeDistance;\\n\\n\\n\\n\\t\\tMBoundingBox\\t\\t\\t\\tm_boxin;\\n\\n\\t\\tMBoundingBox\\t\\t\\t\\tm_boxcol;\\n\\n\\n\\n\\t\\tfloat\\t\\t\\t\\t\\t\\tm_defmax;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 13,\n \"score\": 46212.838111551115\n },\n {\n \"content\": \"class chwNormalOffsetData\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\tunsigned int\\t\\tm_numverts;\\n\\n\\t\\tunsigned int\\t\\tm_smooth;\\n\\n\\t\\tfloat\\t\\t\\t\\tm_env;\\n\\n\\t\\tfloat\\t\\t\\t\\tm_strength;\\n\\n\\t\\tMPointArray\\t\\t\\tm_points;\\n\\n\\t\\tMFloatVectorArray\\tm_normals;\\n\\n\\t\\tMFloatArray\\t\\t\\tm_weights;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/chwNormalOffset.h\",\n \"rank\": 14,\n \"score\": 41803.72970493951\n },\n {\n \"content\": \"class chwEdgeRelaxData\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\tunsigned int\\t\\t\\t\\t\\tm_vertcount;\\n\\n\\t\\tunsigned int\\t\\t\\t\\t\\tm_cachedcount;\\n\\n\\t\\tunsigned int\\t\\t\\t\\t\\tm_iterations;\\n\\n\\t\\tMPointArray\\t\\t\\t\\t\\t\\tm_points;\\n\\n\\t\\tMPointArray\\t\\t\\t\\t\\t\\tm_relaxpoints;\\n\\n\\t\\tstd::vector<std::vector<int>>\\tm_conids;\\n\\n\\t\\tMFloatArray\\t\\t\\t\\t\\t\\tm_weights;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/chwEdgeRelax.h\",\n \"rank\": 15,\n \"score\": 41803.72970493951\n },\n {\n \"content\": \"class chwCollision : public MPxDeformerNode\\n\\n{\\n\\npublic:\\n\\n\\t\\t\\t\\t\\tchwCollision();\\n\\n\\t\\tvirtual\\t\\t~chwCollision();\\n\\n\\n\\n\\t\\tvirtual MStatus\\t\\tcompute(const MPlug& plug, MDataBlock& data);\\n\\n\\t\\tstatic void*\\t\\tcreator();\\n\\n\\t\\tstatic MStatus\\t\\tinitialize();\\n\\n\\n\\n\\t\\tvirtual\\tvoid\\t\\tpostConstructor();\\n\\n\\n\\npublic:\\n\\n\\t\\tstatic MObject\\t\\taCollisionStrength;\\n\\n\\t\\tstatic MObject\\t\\taCollisionMesh;\\n\\n\\t\\tstatic MObject\\t\\taCollisionMeshName;\\n\\n\\t\\tstatic MObject\\t\\taCollisionMeshList;\\n\\n\\t\\tstatic MObject\\t\\taCollisionBulgeStrength;\\n\\n\\t\\tstatic MObject\\t\\taCollisionBulgeDistance;\\n\\n\\t\\tstatic MObject\\t\\taCollisionBulgeRamp;\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 16,\n \"score\": 37983.22345352918\n },\n {\n \"content\": \"def chwSurfaceTweak():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 1:\\n\\n\\t\\tselection = selection[0]\\n\\n\\t\\tif selection.count('vtx'):\\n\\n\\t\\t\\tsplits = selection.split('.')\\n\\n\\t\\t\\tmesh = splits[0]\\n\\n\\t\\t\\tvtx = re.sub(\\\"[^0-9]\\\", \\\"\\\", splits[1])\\n\\n\\t\\t\\tname = util.nextName('chwSurfaceTweak_'+mesh)\\n\\n\\t\\t\\tss = cmds.deformer(mesh, type='chwSurfaceTweak')[0]\\n\\n\\t\\t\\tcmds.setAttr(ss+'.vertex', int(vtx))\\n\\n\\t\\t\\tpivot_ctrl = cmds.group(em=True, name=name)\\n\\n\\t\\t\\toffset_ctrl = util.makeControlSphere(name+'_Offset', 0.25)\\n\\n\\t\\t\\tsticky_ctrl = util.makeControlSphere(name+'_Deform')\\n\\n\\t\\t\\tcmds.parent(sticky_ctrl, offset_ctrl)\\n\\n\\t\\t\\tcmds.parent(offset_ctrl, pivot_ctrl)\\n\\n\\t\\t\\tcmds.addAttr(sticky_ctrl, at='double', ln='envelope', k=1, dv=1, min=0, max=1)\\n\\n\\t\\t\\tcmds.addAttr(sticky_ctrl, at='enum', ln='falloffMode', k=1, en='Volume')\\n\\n\\t\\t\\tcmds.addAttr(sticky_ctrl, at='double', ln='falloffRadius', k=1, dv=1, min=0)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.falloffMode', ss+'.falloffMode', f=True)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.falloffRadius', ss+'.falloffRadius', f=True)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.envelope', ss+'.envelope', f=True)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.worldMatrix[0]', ss+'.deformMatrix')\\n\\n\\t\\t\\tcmds.connectAttr(offset_ctrl+'.worldMatrix[0]', ss+'.relativeMatrix')\\n\\n\\t\\t\\tcmds.connectAttr(ss+'.outRotate', pivot_ctrl+'.rotate')\\n\\n\\t\\t\\tcmds.connectAttr(ss+'.outTranslate', pivot_ctrl+'.translate')\\n\\n\\t\\t\\tcmds.select(sticky_ctrl, r=True)\\n\\n\\t\\t\\treturn [pivot_ctrl, offset_ctrl, sticky_ctrl, ss]\\n\\n\\t\\telse:\\n\\n\\t\\t\\tprint \\\"chwSurfaceTweak: You need to select a mesh vertex!\\\\n\\\"\\n\\n\\telse:\\n\",\n \"file_path\": \"chwTools/scripts/chwTools/deformers.py\",\n \"rank\": 17,\n \"score\": 37921.35208660156\n },\n {\n \"content\": \"class chwNormalOffset : public MPxDeformerNode\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tchwNormalOffset();\\n\\n\\t\\tvirtual\\t\\t\\t\\t\\t~chwNormalOffset();\\n\\n\\n\\n\\t\\tvirtual MStatus\\t\\t\\tcompute(const MPlug& plug, MDataBlock& data);\\n\\n\\t\\tstatic void*\\t\\t\\tcreator();\\n\\n\\t\\tstatic MStatus\\t\\t\\tinitialize();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tstatic MObject\\t\\t\\taStrength;\\n\\n\\t\\tstatic MObject\\t\\t\\taNormalSmooth;\\n\\n\\n\\n\\t\\tstatic const MTypeId\\ttypeId;\\n\\n\\t\\tstatic const MString\\ttypeName;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\t\\tchwEdgeRelax m_relax;\\n\\n\\t\\t\\tchwNormalOffsetData *m_data;\\n\",\n \"file_path\": \"include/chwNormalOffset.h\",\n \"rank\": 18,\n \"score\": 34939.99358871753\n },\n {\n \"content\": \"def chwMeshRelax():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 1:\\n\\n\\t\\tcmds.deformer(selection, type='chwMeshRelax')\\n\\n\\telse:\\n\",\n \"file_path\": \"chwTools/scripts/chwTools/deformers.py\",\n \"rank\": 19,\n \"score\": 34668.12466557332\n },\n {\n \"content\": \"def chwVertexBind():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 2:\\n\\n\\t\\tvs = cmds.deformer(selection[-1], type='chwVertexBind')\\n\\n\\t\\tcmds.connectAttr(selection[0]+'.worldMesh[0]', vs[0]+'.driverMesh')\\n\\n\\t\\tcmds.setAttr(vs[0]+'.initialize', 1)\\n\\n\\telse:\\n\",\n \"file_path\": \"chwTools/scripts/chwTools/deformers.py\",\n \"rank\": 20,\n \"score\": 34392.57571173141\n },\n {\n \"content\": \"\\t\\t\\t\\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tdata->m_collided[idx] = 0;\\n\\n\\t\\t\\t\\t\\tif (data->m_boxcol.contains(data->m_points[idx]))\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tbool bAllIntersections = colFn->allIntersections(data->m_points[idx], data->m_normals[idx], NULL, NULL, false, MSpace::kWorld, 9999.f, false,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&data->m_mmAccelParams, false, m_hitPoints, &m_faHitRayParams, &m_iaHitFaces,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&m_iaHitTriangles, &m_faHitBary1, &m_faHitBary2, 0.000001f, &m_status);\\n\\n\\t\\t\\t\\t\\t\\tCHECK_MSTATUS(m_status);\\n\\n\\t\\t\\t\\t\\t\\tif (bAllIntersections)\\n\\n\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\tunsigned int numHits = m_hitPoints.length();\\n\\n\\t\\t\\t\\t\\t\\t\\tif ((numHits % 2) != 0)\\n\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tdata->m_intersector.getClosestPoint(data->m_points[idx], m_pointOnMesh);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tMFloatPoint colpoint = m_pointOnMesh.getPoint();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tMFloatVector offset = colpoint - data->m_points[idx];\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tdata->m_points[idx] += offset * data->m_weights[idx] * data->m_collisionStrength;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tfloat l = offset.length();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\ttbb::mutex::scoped_lock lock;\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 21,\n \"score\": 26503.166183592464\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\t\\t\\tlock.acquire(m_mutex);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tif (l > data->m_defmax)\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdata->m_defmax = l;\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tlock.release();\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tdata->m_collided[idx] = 1;\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tstruct ThreadedBulge\\n\\n\\t\\t{\\n\\n\\t\\t\\tchwCollisionData *data;\\n\\n\\t\\t\\tvoid operator()( const blocked_range<int>& range ) const {\\n\\n\\t\\t\\t\\tMStatus\\t\\t\\t\\t\\t\\tm_status;\\n\\n\\t\\t\\t\\tMPointOnMesh\\t\\t\\t\\tm_pointOnMesh;\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 22,\n \"score\": 26503.119155387176\n },\n {\n \"content\": \"\\t\\t\\t\\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tif (!data->m_collided[idx])\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tfloat rampval;\\n\\n\\t\\t\\t\\t\\t\\tdata->m_intersector.getClosestPoint(data->m_points[idx], m_pointOnMesh);\\n\\n\\t\\t\\t\\t\\t\\tMFloatPoint colpoint = m_pointOnMesh.getPoint();\\n\\n\\t\\t\\t\\t\\t\\tMFloatVector offset = colpoint - data->m_points[idx];\\n\\n\\t\\t\\t\\t\\t\\tfloat ramppos = offset.length() / data->m_bulgeDistance;\\n\\n\\t\\t\\t\\t\\t\\tdata->m_bulgeRampAttribute.getValueAtPosition(ramppos, rampval, &m_status);\\n\\n\\t\\t\\t\\t\\t\\tCHECK_MSTATUS(m_status);\\n\\n\\t\\t\\t\\t\\t\\tfloat bulgestr = rampval * data->m_defmax * data->m_bulgeStrength;\\n\\n\\t\\t\\t\\t\\t\\tdata->m_points[idx] += data->m_normals[idx] * data->m_weights[idx] * data->m_collisionStrength * bulgestr;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t};\\n\\n};\\n\\n\\n\\n#endif // CHWCOLLISION_H\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 23,\n \"score\": 26502.34334556681\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWCOLLISION_H\\n\\n#define CHWCOLLISION_H\\n\\n\\n\\n#include <string>\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n\\n\\n#include <maya/MPxDeformerNode.h>\\n\\n#include <maya/MItGeometry.h>\\n\\n#include <maya/MTypeId.h>\\n\\n#include <maya/MPlug.h>\\n\\n#include <maya/MDataBlock.h>\\n\\n#include <maya/MDataHandle.h>\\n\\n#include <maya/MPoint.h>\\n\\n#include <maya/MPointArray.h>\\n\\n#include <maya/MFloatArray.h>\\n\\n#include <maya/MFnMesh.h>\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 24,\n \"score\": 26501.349918099313\n },\n {\n \"content\": \"\\n\\n\\t\\tstatic const MTypeId typeId;\\n\\n\\t\\tstatic const MString typeName;\\n\\nprivate:\\n\\n\\t\\tchwCollisionData *m_data;\\n\\n\\t\\tMStatus postConstructor_initialise_ramp_curve(MObject &rampObj, int index, float position, float value, int interpolation);\\n\\n\\n\\n\\t\\tstruct ThreadedCollide\\n\\n\\t\\t{\\n\\n\\t\\t\\tchwCollisionData *data;\\n\\n\\t\\t\\tMFnMesh *colFn;\\n\\n\\t\\t\\tvoid operator()( const blocked_range<int>& range ) const {\\n\\n\\t\\t\\t\\tMFloatPointArray\\t\\t\\tm_hitPoints;\\n\\n\\t\\t\\t\\tMFloatArray\\t\\t\\t\\t\\tm_faHitRayParams;\\n\\n\\t\\t\\t\\tMIntArray\\t\\t\\t\\t\\tm_iaHitFaces;\\n\\n\\t\\t\\t\\tMIntArray\\t\\t\\t\\t\\tm_iaHitTriangles;\\n\\n\\t\\t\\t\\tMFloatArray\\t\\t\\t\\t\\tm_faHitBary1;\\n\\n\\t\\t\\t\\tMFloatArray\\t\\t\\t\\t\\tm_faHitBary2;\\n\\n\\t\\t\\t\\tMStatus\\t\\t\\t\\t\\t\\tm_status;\\n\\n\\t\\t\\t\\tMPointOnMesh\\t\\t\\t\\tm_pointOnMesh;\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 25,\n \"score\": 26500.88406020844\n },\n {\n \"content\": \"#include <maya/MVector.h>\\n\\n#include <maya/MFloatVectorArray.h>\\n\\n#include <maya/MFloatPointArray.h>\\n\\n#include <maya/MGlobal.h>\\n\\n#include <maya/MMatrix.h>\\n\\n#include <maya/MFnNumericAttribute.h>\\n\\n#include <maya/MFnTypedAttribute.h>\\n\\n#include <maya/MFnCompoundAttribute.h>\\n\\n#include <maya/MMeshIntersector.h>\\n\\n#include <maya/MBoundingBox.h>\\n\\n#include <maya/MDagPath.h>\\n\\n#include <maya/MRampAttribute.h>\\n\\n#include <maya/MFnStringData.h>\\n\\n\\n\\n// THREADING\\n\\n#include \\\"tbb/tbb.h\\\"\\n\\nusing namespace tbb;\\n\\n\\n\\ntypedef mutex mMutex;\\n\\nstatic mMutex m_mutex;\\n\\n\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 26,\n \"score\": 26496.762395767484\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwCollision.h\",\n \"rank\": 27,\n \"score\": 26492.742647899955\n },\n {\n \"content\": \"\\n\\n\\t\\tMFloatArray w(vertCount);\\n\\n\\t\\tif(env != 0.00 && iterations != 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\tfor (unsigned int idx=0; idx < vertCount; idx++)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tw[idx] = weightValue(data,index,idx) * env;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tMObject relaxMesh(outMesh);\\n\\n\\t\\t\\tm_relax.relax(relaxMesh, iterations, rpts, w);\\n\\n\\t\\t\\tmeshFn.setPoints(rpts, MSpace::kObject);\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\tdata.setClean(plug);\\n\\n\\treturn MS::kSuccess;\\n\\n}\\n\",\n \"file_path\": \"src/chwMeshRelax.cpp\",\n \"rank\": 28,\n \"score\": 25112.26954649401\n },\n {\n \"content\": \"\\tunsigned int vertCount;\\n\\n\\n\\n\\tif (plug.attribute() == outputGeom)\\n\\n\\t{\\n\\n\\t\\tunsigned int index = plug.logicalIndex();\\n\\n\\t\\tMObject thisNode = this->thisMObject();\\n\\n\\t\\tMPlug inPlug(thisNode,input);\\n\\n\\t\\tinPlug.selectAncestorLogicalIndex(index,input);\\n\\n\\t\\tMDataHandle hInput = data.inputValue(inPlug, &stat );\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(stat)\\n\\n\\n\\n\\t\\tMDataHandle hGeom = hInput.child(inputGeom);\\n\\n\\t\\tMMatrix m = hGeom.geometryTransformMatrix();\\n\\n\\t\\tMDataHandle hOutput = data.outputValue(plug);\\n\\n\\t\\thOutput.copy(hGeom);\\n\\n\\t\\tMObject outMesh = hGeom.asMesh();\\n\\n\\t\\tMFnMesh meshFn(outMesh);\\n\\n\\t\\tvertCount = meshFn.numVertices();\\n\\n\\t\\tmeshFn.getPoints(pts, MSpace::kObject);\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(stat)\\n\",\n \"file_path\": \"src/chwMeshRelax.cpp\",\n \"rank\": 29,\n \"score\": 25111.315088238123\n },\n {\n \"content\": \"\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setConnectable(true);\\n\\n\\tnAttr.setMin(0);\\n\\n\\taddAttribute( aIterations );\\n\\n\\n\\n\\tattributeAffects( chwMeshRelax::aIterations, chwMeshRelax::outputGeom );\\n\\n\\n\\n\\tMGlobal::executeCommand(\\\"makePaintable -attrType multiFloat -sm deformer chwMeshRelax weights\\\");\\n\\n\\n\\n\\treturn MStatus::kSuccess;\\n\\n}\\n\\n\\n\\nMStatus chwMeshRelax::compute(const MPlug& plug, MDataBlock& data)\\n\\n{\\n\\n\\tMStatus stat;\\n\\n\\tMPointArray pts;\\n\\n\\tMPointArray rpts;\\n\\n\\tfloat env = data.inputValue(envelope).asFloat();\\n\\n\\tunsigned int iterations = data.inputValue(aIterations).asInt();\\n\",\n \"file_path\": \"src/chwMeshRelax.cpp\",\n \"rank\": 30,\n \"score\": 25109.89172127793\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#include <chwMeshRelax.h>\\n\\n\\n\\nconst MTypeId\\tchwMeshRelax::typeId( 0x89002 );\\n\\nconst MString\\tchwMeshRelax::typeName( \\\"chwMeshRelax\\\" );\\n\\n\\n\\nMObject \\t\\tchwMeshRelax::aIterations;\\n\\n\\n\\nchwMeshRelax::chwMeshRelax(){}\\n\\nchwMeshRelax::~chwMeshRelax(){}\\n\\nvoid* chwMeshRelax::creator(){ return new chwMeshRelax(); }\\n\\n\\n\\nMStatus chwMeshRelax::initialize()\\n\\n{\\n\\n\\tMFnNumericAttribute nAttr;\\n\\n\\n\\n\\taIterations = nAttr.create( \\\"iterations\\\", \\\"it\\\", MFnNumericData::kInt );\\n\\n\\tnAttr.setKeyable(true);\\n\",\n \"file_path\": \"src/chwMeshRelax.cpp\",\n \"rank\": 31,\n \"score\": 25105.874567652736\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"src/chwMeshRelax.cpp\",\n \"rank\": 32,\n \"score\": 25095.45347962712\n },\n {\n \"content\": \"\\t\\t\\tstruct ThreadedDeform\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tchwNormalOffsetData *data;\\n\\n\\t\\t\\t\\tvoid operator()( const blocked_range<int>& range ) const {\\n\\n\\t\\t\\t\\t\\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tdata->m_points[idx] += data->m_normals[idx] * data->m_weights[idx];\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t};\\n\\n};\\n\\n\\n\\n#endif // CHWNORMALOFFSET_H\\n\",\n \"file_path\": \"include/chwNormalOffset.h\",\n \"rank\": 33,\n \"score\": 24945.721613029953\n },\n {\n \"content\": \"\\t\\t\\t\\tvoid operator()( const blocked_range<int>& range ) const {\\n\\n\\t\\t\\t\\t\\tMStatus status;\\n\\n\\t\\t\\t\\t\\tMPoint point;\\n\\n\\t\\t\\t\\t\\tfloat dist,ramppos, rampval;\\n\\n\\t\\t\\t\\t\\tfloat w;\\n\\n\\t\\t\\t\\t\\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tw = data->m_weights[idx] * data->m_env;\\n\\n\\t\\t\\t\\t\\t\\tif ((w > 0.f) && (data->m_falloffRadius > 0.f))\\n\\n\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\tdist = (data->m_relativeMatrixTranslate - data->m_points[idx]).length();\\n\\n\\t\\t\\t\\t\\t\\t\\tramppos = dist / data->m_falloffRadius;\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_falloffCurve.getValueAtPosition(ramppos, rampval, &status);\\n\\n\\n\\n\\t\\t\\t\\t\\t\\t\\tpoint = data->m_points[idx] * data->m_relativeInverseMatrix * data->m_deformMatrix;\\n\\n\\t\\t\\t\\t\\t\\t\\tdata->m_points[idx] += ((point - data->m_points[idx]) * w * rampval);\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t};\\n\\n};\\n\\n\\n\\n#endif // CHWSURFACETWEAK_H\\n\",\n \"file_path\": \"include/chwSurfaceTweak.h\",\n \"rank\": 34,\n \"score\": 24944.252573776626\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWSURFACETWEAK_H\\n\\n#define CHWSURFACETWEAK_H\\n\\n\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n#include <maya/MPxNode.h>\\n\\n#include <maya/MArrayDataBuilder.h>\\n\\n#include <maya/MPxDeformerNode.h>\\n\\n#include <maya/MMeshIntersector.h>\\n\\n#include <maya/MFnSingleIndexedComponent.h>\\n\\n#include <maya/MItGeometry.h>\\n\\n#include <maya/MItMeshVertex.h>\\n\\n#include <maya/MItMeshPolygon.h>\\n\\n#include <maya/MFnNumericAttribute.h>\\n\\n#include <maya/MFnEnumAttribute.h>\\n\\n#include <maya/MFnTypedAttribute.h>\\n\\n#include <maya/MTypeId.h>\\n\",\n \"file_path\": \"include/chwSurfaceTweak.h\",\n \"rank\": 35,\n \"score\": 24943.39292940774\n },\n {\n \"content\": \"\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tnumcons = data->m_conids[idx].size();\\n\\n\\t\\t\\t\\t\\tdata->m_relaxpoints[idx] = MPoint();\\n\\n\\t\\t\\t\\t\\tfor (unsigned int idy=0; idy < numcons; idy++)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tidz = data->m_conids[idx][idy];\\n\\n\\t\\t\\t\\t\\t\\tdata->m_relaxpoints[idx] += data->m_points[idz];\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tdata->m_relaxpoints[idx] = data->m_points[idx] + ((data->m_relaxpoints[idx] / float(numcons)) - data->m_points[idx]) * data->m_weights[idx];\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t};\\n\\n};\\n\\n\\n\\n#endif // CHWEDGERELAX_H\\n\",\n \"file_path\": \"include/chwEdgeRelax.h\",\n \"rank\": 36,\n \"score\": 24941.870087191888\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWEDGERELAX_H\\n\\n#define CHWEDGERELAX_H\\n\\n\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n#include <float.h>\\n\\n#include <vector>\\n\\n#include <iostream>\\n\\n#include <algorithm>\\n\\n\\n\\n#include <maya/MFnMesh.h>\\n\\n#include <maya/MVector.h>\\n\\n#include <maya/MIntArray.h>\\n\\n#include <maya/MFloatArray.h>\\n\\n#include <maya/MPointArray.h>\\n\\n#include <maya/MItMeshVertex.h>\\n\\n\\n\\n// THREADING\\n\\n#include \\\"tbb/tbb.h\\\"\\n\\nusing namespace tbb;\\n\\n\\n\",\n \"file_path\": \"include/chwEdgeRelax.h\",\n \"rank\": 37,\n \"score\": 24938.500676218486\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWNORMALOFFSET_H\\n\\n#define CHWNORMALOFFSET_H\\n\\n\\n\\n#include <maya/MPxDeformerNode.h>\\n\\n#include <maya/MItGeometry.h>\\n\\n#include <maya/MTypeId.h>\\n\\n#include <maya/MPlug.h>\\n\\n#include <maya/MDataBlock.h>\\n\\n#include <maya/MDataHandle.h>\\n\\n#include <maya/MPoint.h>\\n\\n#include <maya/MPointArray.h>\\n\\n#include <maya/MFnMesh.h>\\n\\n#include <maya/MVector.h>\\n\\n#include <maya/MFloatVectorArray.h>\\n\\n#include <maya/MGlobal.h>\\n\\n#include <maya/MMatrix.h>\\n\\n#include <maya/MFnNumericAttribute.h>\\n\\n#include <maya/MFloatArray.h>\\n\\n#include \\\"chwEdgeRelax.h\\\"\\n\\n\\n\\n// THREADING\\n\\n#include \\\"tbb/tbb.h\\\"\\n\\nusing namespace tbb;\\n\\n\\n\",\n \"file_path\": \"include/chwNormalOffset.h\",\n \"rank\": 38,\n \"score\": 24938.393131305573\n },\n {\n \"content\": \"#include <maya/MDataBlock.h>\\n\\n#include <maya/MDataHandle.h>\\n\\n#include <maya/MDagPath.h>\\n\\n#include <maya/MGlobal.h>\\n\\n#include <maya/MArrayDataHandle.h>\\n\\n#include <maya/MPointArray.h>\\n\\n#include <maya/MPoint.h>\\n\\n#include <maya/MVector.h>\\n\\n#include <maya/MMatrix.h>\\n\\n#include <maya/MObject.h>\\n\\n#include <maya/MRampAttribute.h>\\n\\n#include <maya/MFnUnitAttribute.h>\\n\\n#include <maya/MFnMesh.h>\\n\\n#include <maya/MItMeshVertex.h>\\n\\n#include <maya/MFnMatrixAttribute.h>\\n\\n#include <maya/MAngle.h>\\n\\n\\n\\n// THREADING\\n\\n#include \\\"tbb/tbb.h\\\"\\n\\nusing namespace tbb;\\n\\n\\n\",\n \"file_path\": \"include/chwSurfaceTweak.h\",\n \"rank\": 39,\n \"score\": 24938.307543054045\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWMATRIXSELECTOR_H\\n\\n#define CHWMATRIXSELECTOR_H\\n\\n\\n\\n#include <math.h>\\n\\n#include <maya/MPxNode.h>\\n\\n#include <maya/MItGeometry.h>\\n\\n#include <maya/MTypeId.h>\\n\\n#include <maya/MPlug.h>\\n\\n#include <maya/MPlugArray.h>\\n\\n#include <maya/MDataBlock.h>\\n\\n#include <maya/MDataHandle.h>\\n\\n#include <maya/MPoint.h>\\n\\n#include <maya/MPointArray.h>\\n\\n#include <maya/MFnMesh.h>\\n\\n#include <maya/MVector.h>\\n\\n#include <maya/MFloatVectorArray.h>\\n\\n#include <maya/MGlobal.h>\\n\",\n \"file_path\": \"include/chwMatrixSelector.h\",\n \"rank\": 40,\n \"score\": 24938.306447232524\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#ifndef CHWCURVESAMPLER_H\\n\\n#define CHWCURVESAMPLER_H\\n\\n\\n\\n#include <math.h>\\n\\n#include <maya/MPxNode.h>\\n\\n#include <maya/MTypeId.h>\\n\\n#include <maya/MPlug.h>\\n\\n#include <maya/MPlugArray.h>\\n\\n#include <maya/MDataBlock.h>\\n\\n#include <maya/MDataHandle.h>\\n\\n#include <maya/MGlobal.h>\\n\\n#include <maya/MMatrix.h>\\n\\n#include <maya/MFnNumericAttribute.h>\\n\\n#include <maya/MFnUnitAttribute.h>\\n\\n#include <maya/MFnTypedAttribute.h>\\n\\n#include <maya/MQuaternion.h>\\n\\n#include <maya/MIOStream.h>\\n\\n#include <maya/MEulerRotation.h>\\n\\n#include <maya/MFnNurbsCurve.h>\\n\\n#include <maya/MArrayDataBuilder.h>\\n\\n#include <maya/MArrayDataHandle.h>\\n\\n#include <maya/MVector.h>\\n\\n\\n\",\n \"file_path\": \"include/chwCurveSampler.h\",\n \"rank\": 41,\n \"score\": 24936.82182656532\n },\n {\n \"content\": \"\\t\\tstatic MObject aOutTranslateX;\\n\\n\\t\\tstatic MObject aOutTranslateY;\\n\\n\\t\\tstatic MObject aOutTranslateZ;\\n\\n\\n\\n\\t\\tstatic MObject aOutRotate;\\n\\n\\t\\tstatic MObject aOutRotateX;\\n\\n\\t\\tstatic MObject aOutRotateY;\\n\\n\\t\\tstatic MObject aOutRotateZ;\\n\\n\\n\\n\\t\\tstatic const MTypeId typeId;\\n\\n\\t\\tstatic const MString typeName;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tchwSurfaceTweakData\\t*m_data;\\n\\n\\n\\n\\t\\t\\tMStatus\\t\\tpostConstructor_initialise_ramp_curve(MObject &rampObj, int index, float position, float value, int interpolation);\\n\\n\\n\\n\\t\\t\\tstruct ThreadedDeform\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tchwSurfaceTweakData *data;\\n\",\n \"file_path\": \"include/chwSurfaceTweak.h\",\n \"rank\": 42,\n \"score\": 24936.5903580128\n },\n {\n \"content\": \"#include <maya/MMatrix.h>\\n\\n#include <maya/MFnNumericAttribute.h>\\n\\n#include <maya/MFnMatrixAttribute.h>\\n\\n#include <maya/MFnEnumAttribute.h>\\n\\n#include <maya/MFnCompoundAttribute.h>\\n\\n#include <maya/MFnUnitAttribute.h>\\n\\n#include <maya/MQuaternion.h>\\n\\n#include <maya/MIOStream.h>\\n\\n#include <maya/MEulerRotation.h>\\n\\n\\n\",\n \"file_path\": \"include/chwMatrixSelector.h\",\n \"rank\": 43,\n \"score\": 24932.35501295421\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwCurveSampler.h\",\n \"rank\": 44,\n \"score\": 24931.047125173533\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwNormalOffset.h\",\n \"rank\": 45,\n \"score\": 24931.047125173533\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwMatrixSelector.h\",\n \"rank\": 46,\n \"score\": 24931.047125173533\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwSurfaceTweak.h\",\n \"rank\": 47,\n \"score\": 24931.047125173533\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"include/chwEdgeRelax.h\",\n \"rank\": 48,\n \"score\": 24931.047125173533\n },\n {\n \"content\": \"\\t\\tdrvIter.allPositions(m_data->m_drvpoints, MSpace::kWorld);\\n\\n\\t\\titer.allPositions(m_data->m_defpoints);\\n\\n\\t\\tm_data->m_mapping.setLength(m_data->m_defpoints.length());\\n\\n\\t\\tm_data->m_weights.setLength(m_data->m_defpoints.length());\\n\\n\\t\\tm_data->m_localToWorldMatrix = localToWorldMatrix;\\n\\n\\n\\n\\t\\tfor ( unsigned int idx = 0; idx < m_data->m_defpoints.length(); idx++ )\\n\\n\\t\\t{\\n\\n\\t\\t\\tvertMapArrayData.jumpToElement(idx);\\n\\n\\t\\t\\tm_data->m_mapping[idx] = vertMapArrayData.inputValue().asInt();\\n\\n\\t\\t\\tm_data->m_weights[idx] = weightValue( data, mIndex, idx ) * env;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tThreadedDeform td;\\n\\n\\t\\ttd.data = m_data;\\n\\n\\t\\tparallel_for( blocked_range<int>( 0, m_data->m_defpoints.length() ), td );\\n\\n\\n\\n\\t\\titer.setAllPositions(m_data->m_defpoints);\\n\\n\\t}\\n\\n\\treturn status;\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 49,\n \"score\": 24714.089628848742\n },\n {\n \"content\": \"\\tdelete m_data;\\n\\n}\\n\\nvoid* chwVertexBind::creator(){ return new chwVertexBind(); }\\n\\n\\n\\nMStatus chwVertexBind::initialize()\\n\\n{\\n\\n\\tMFnTypedAttribute \\t\\ttAttr;\\n\\n\\tMFnEnumAttribute \\t\\teAttr;\\n\\n\\tMFnNumericAttribute \\tnAttr;\\n\\n\\n\\n\\taDriverMesh = tAttr.create( \\\"driverMesh\\\", \\\"drv\\\", MFnData::kMesh );\\n\\n\\ttAttr.setStorable(false);\\n\\n\\ttAttr.setConnectable(true);\\n\\n\\taddAttribute( aDriverMesh );\\n\\n\\n\\n\\taSearchDistance = nAttr.create( \\\"SearchDistance\\\", \\\"sd\\\", MFnNumericData::kFloat, 0.01);\\n\\n\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setReadable(true);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setKeyable(true);\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 50,\n \"score\": 24710.480721599015\n },\n {\n \"content\": \"\\tm_data->m_localToWorldMatrix = localToWorldMatrix;\\n\\n\\n\\n\\tThreadedInitialize ti;\\n\\n\\tti.data = m_data;\\n\\n\\tparallel_for( blocked_range<int>( 0, m_data->m_defpoints.length() ), ti );\\n\\n\\n\\n\\tMArrayDataHandle vertMapOutArrayHandle = data.outputArrayValue( aVertexMap, &status );\\n\\n\\tCHECK_MSTATUS(status);\\n\\n\\tMArrayDataBuilder vertMapOutArrayBuilder = vertMapOutArrayHandle.builder(&status);\\n\\n\\tCHECK_MSTATUS(status);\\n\\n\\n\\n\\tfor ( unsigned int idx = 0; idx < m_data->m_defpoints.length(); idx++ )\\n\\n\\t{\\n\\n\\t\\tMDataHandle initIndexData = vertMapOutArrayBuilder.addElement( idx, &status );\\n\\n\\t\\tCHECK_MSTATUS(status);\\n\\n\\t\\tinitIndexData.setInt(m_data->m_mapping[idx]);\\n\\n\\t\\tinitIndexData.setClean();\\n\\n\\t}\\n\\n\\n\\n\\tvertMapOutArrayHandle.set( vertMapOutArrayBuilder );\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 51,\n \"score\": 24708.510571151768\n },\n {\n \"content\": \"\\taddAttribute( aInitialize );\\n\\n\\n\\n\\taVertexMap = nAttr.create( \\\"vtxIndexMap\\\", \\\"vtximp\\\", MFnNumericData::kLong, -9999 );\\n\\n\\tnAttr.setKeyable(false);\\n\\n\\tnAttr.setArray(true);\\n\\n\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setReadable(true);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setUsesArrayDataBuilder(true);\\n\\n\\taddAttribute( aVertexMap );\\n\\n\\n\\n\\tattributeAffects(chwVertexBind::aDriverMesh, \\tchwVertexBind::outputGeom);\\n\\n\\tattributeAffects(chwVertexBind::aSearchDistance,\\tchwVertexBind::outputGeom);\\n\\n\\tattributeAffects(chwVertexBind::aCutoffDistance,\\tchwVertexBind::outputGeom);\\n\\n\\tattributeAffects(chwVertexBind::aInitialize, \\tchwVertexBind::outputGeom);\\n\\n\\tattributeAffects(chwVertexBind::aVertexMap,\\t\\tchwVertexBind::outputGeom);\\n\\n\\n\\n\\tMGlobal::executeCommand( \\\"makePaintable -attrType \\\\\\\"multiFloat\\\\\\\" -sm \\\\\\\"deformer\\\\\\\" \\\\\\\"chwVertexBind\\\\\\\" \\\\\\\"weights\\\\\\\";\\\" );\\n\\n\\n\\n\\treturn MStatus::kSuccess;\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 52,\n \"score\": 24707.703119478007\n },\n {\n \"content\": \"}\\n\\n\\n\\nMStatus chwVertexBind::deform( MDataBlock& data, MItGeometry& iter, const MMatrix& localToWorldMatrix, unsigned int mIndex)\\n\\n{\\n\\n\\tMStatus status;\\n\\n\\tshort initialized_mapping = data.inputValue( aInitialize ).asShort();\\n\\n\\n\\n\\tif( initialized_mapping == 1 )\\n\\n\\t{\\n\\n\\t\\tstatus = initializeMapping(data, iter, localToWorldMatrix);\\n\\n\\t\\tinitialized_mapping = data.inputValue( aInitialize ).asShort();\\n\\n\\t}\\n\\n\\tif( initialized_mapping == 2 )\\n\\n\\t{\\n\\n\\t\\tfloat env = data.inputValue(envelope).asFloat();\\n\\n\\t\\tMArrayDataHandle vertMapArrayData = data.inputArrayValue( aVertexMap );\\n\\n\\n\\n\\t\\tMDataHandle meshAttrHandle = data.inputValue( aDriverMesh, &status );\\n\\n\\t\\tMItGeometry drvIter( meshAttrHandle );\\n\\n\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 53,\n \"score\": 24706.690965313304\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#include <chwVertexBind.h>\\n\\n\\n\\nMTypeId \\t\\tchwVertexBind::typeId ( 0x89001 );\\n\\nconst MString \\tchwVertexBind::typeName( \\\"chwVertexBind\\\" );\\n\\n\\n\\nMObject \\t\\tchwVertexBind::aDriverMesh;\\n\\nMObject \\t\\tchwVertexBind::aSearchDistance;\\n\\nMObject \\t\\tchwVertexBind::aCutoffDistance;\\n\\nMObject \\t\\tchwVertexBind::aInitialize;\\n\\nMObject \\t\\tchwVertexBind::aVertexMap;\\n\\n\\n\\nchwVertexBind::chwVertexBind()\\n\\n{\\n\\n\\tm_data = new chwVertexBindData;\\n\\n}\\n\\nchwVertexBind::~chwVertexBind()\\n\\n{\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 54,\n \"score\": 24705.284695790295\n },\n {\n \"content\": \"\\n\\n\\tMObject tObj = thisMObject();\\n\\n\\tMPlug setInitMode( tObj, aInitialize );\\n\\n\\tsetInitMode.setValue( 2 );\\n\\n\\n\\n\\tdata.setClean(aVertexMap);\\n\\n\\treturn status;\\n\\n}\\n\\n\\n\\nMObject& chwVertexBind::accessoryAttribute() const\\n\\n{\\n\\n\\treturn chwVertexBind::aDriverMesh ;\\n\\n}\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 55,\n \"score\": 24704.269664053714\n },\n {\n \"content\": \"}\\n\\n\\n\\n\\n\\n\\n\\nMStatus chwVertexBind::initializeMapping( MDataBlock& data, MItGeometry& iter, const MMatrix& localToWorldMatrix)\\n\\n{\\n\\n\\tMStatus status;\\n\\n\\n\\n\\tMDataHandle cutoffDistanceHnd = data.inputValue(aCutoffDistance, &status);\\n\\n\\tm_data->m_cutoffDistance = cutoffDistanceHnd.asFloat();\\n\\n\\n\\n\\tMDataHandle searchDistanceHnd = data.inputValue(aSearchDistance, &status);\\n\\n\\tm_data->m_searchDistance = searchDistanceHnd.asFloat();\\n\\n\\n\\n\\tMDataHandle meshAttrHandle = data.inputValue( aDriverMesh, &status );\\n\\n\\tMItGeometry drvIter( meshAttrHandle );\\n\\n\\n\\n\\tdrvIter.allPositions(m_data->m_drvpoints, MSpace::kWorld);\\n\\n\\titer.allPositions(m_data->m_defpoints);\\n\\n\\tm_data->m_mapping.setLength(m_data->m_defpoints.length());\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 56,\n \"score\": 24701.599111190706\n },\n {\n \"content\": \"\\tnAttr.setMin(0.0);\\n\\n\\taddAttribute(aSearchDistance);\\n\\n\\n\\n\\taCutoffDistance = nAttr.create( \\\"Cutoff\\\", \\\"cof\\\", MFnNumericData::kFloat, 0.0);\\n\\n\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setReadable(true);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setKeyable(true);\\n\\n\\tnAttr.setMin(0.0);\\n\\n\\taddAttribute(aCutoffDistance);\\n\\n\\n\\n\\taInitialize = eAttr.create( \\\"initialize\\\", \\\"inl\\\" );\\n\\n\\teAttr.addField(\\t\\\"Off\\\", 0);\\n\\n\\teAttr.addField(\\t\\\"Re-Set Bind\\\", 1);\\n\\n\\teAttr.addField(\\t\\\"Bound\\\", 2);\\n\\n\\teAttr.setKeyable(true);\\n\\n\\teAttr.setStorable(true);\\n\\n\\teAttr.setReadable(true);\\n\\n\\teAttr.setWritable(true);\\n\\n\\teAttr.setDefault(0);\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 57,\n \"score\": 24699.62749734655\n },\n {\n \"content\": \"/***********************************************************************************\\n\\n* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n*\\n\\n* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n*\\n\\n* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n* the Software without restriction, including without limitation the rights to \\n\\n* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n* so, subject to the following conditions:\\n\\n*\\n\\n* The above copyright notice and this permission notice shall be included in all\\n\\n* copies or substantial portions of the Software.\\n\\n*\\n\\n* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\",\n \"file_path\": \"src/chwVertexBind.cpp\",\n \"rank\": 58,\n \"score\": 24697.182252563416\n },\n {\n \"content\": \"class chwEdgeRelax\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\t\\t\\tchwEdgeRelax();\\n\\n\\t\\tvirtual\\t~chwEdgeRelax();\\n\\n\\t\\tvoid relax(MObject&, unsigned int);\\n\\n\\t\\tvoid relax(MObject&, unsigned int, MFloatArray &weights);\\n\\n\\t\\tvoid relax(MObject&, unsigned int, MPointArray&);\\n\\n\\t\\tvoid relax(MObject&, unsigned int, MPointArray&, MFloatArray &weights);\\n\\n\\tprivate:\\n\\n\\t\\tchwEdgeRelaxData *m_relaxData;\\n\\n\\t\\tvoid\\tbuildTopology(MObject &mesh);\\n\\n\\t\\tvoid\\tdoRelax();\\n\\n\\t\\tstruct ThreadedDeform\\n\\n\\t\\t{\\n\\n\\t\\t\\tchwEdgeRelaxData *data;\\n\\n\\t\\t\\tvoid operator()( const blocked_range<int>& range ) const {\\n\\n\\t\\t\\t\\tunsigned int idz;\\n\\n\\t\\t\\t\\tunsigned int numcons;\\n\\n\\t\\t\\t\\tfor ( int idx = range.begin(); idx!=range.end(); ++idx )\\n\",\n \"file_path\": \"include/chwEdgeRelax.h\",\n \"rank\": 59,\n \"score\": 21182.16684584333\n },\n {\n \"content\": \"#/***********************************************************************************\\n\\n#* Copyright (c) 2018 Cristian Hinz Welkens.\\n\\n#*\\n\\n#* This file is part of chwTools (https://github.com/chinzw/chwtools).\\n\\n#*\\n\\n#* Permission is hereby granted, free of charge, to any person obtaining a copy of\\n\\n#* this software and associated documentation files (the \\\"Software\\\"), to deal in\\n\\n#* the Software without restriction, including without limitation the rights to \\n\\n#* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies\\n\\n#* of the Software, and to permit persons to whom the Software is furnished to do\\n\\n#* so, subject to the following conditions:\\n\\n#*\\n\\n#* The above copyright notice and this permission notice shall be included in all\\n\\n#* copies or substantial portions of the Software.\\n\\n#*\\n\\n#* THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\\n\\n#* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\\n\\n#* PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\\n\\n#* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\\n\\n#* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\n\\n#* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n#***********************************************************************************/\\n\\n\\n\\n\\n\\nimport re\\n\\nimport util\\n\\nfrom maya import cmds\\n\\n\\n\\nutil.loadPlugin()\\n\\n\\n\\ndef chwMeshRelax():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 1:\\n\\n\\t\\tcmds.deformer(selection, type='chwMeshRelax')\\n\\n\\telse:\\n\\n\\t\\tprint \\\"chwMeshRelax: You need to select one mesh!\\\\n\\\"\\n\\n\\n\\ndef chwNormalOffset():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 1:\\n\\n\\t\\tcmds.deformer(selection, type='chwNormalOffset')\\n\\n\\telse:\\n\\n\\t\\tprint \\\"chwNormalOffset: You need to select one mesh!\\\\n\\\"\\n\\n\\n\\ndef chwVertexBind():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 2:\\n\\n\\t\\tvs = cmds.deformer(selection[-1], type='chwVertexBind')\\n\\n\\t\\tcmds.connectAttr(selection[0]+'.worldMesh[0]', vs[0]+'.driverMesh')\\n\\n\\t\\tcmds.setAttr(vs[0]+'.initialize', 1)\\n\\n\\telse:\\n\\n\\t\\tprint \\\"chwVertexBind: You need to select a driver and a target!\\\\n\\\"\\n\\n\\n\\ndef chwSurfaceTweak():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 1:\\n\\n\\t\\tselection = selection[0]\\n\\n\\t\\tif selection.count('vtx'):\\n\\n\\t\\t\\tsplits = selection.split('.')\\n\\n\\t\\t\\tmesh = splits[0]\\n\\n\\t\\t\\tvtx = re.sub(\\\"[^0-9]\\\", \\\"\\\", splits[1])\\n\\n\\t\\t\\tname = util.nextName('chwSurfaceTweak_'+mesh)\\n\\n\\t\\t\\tss = cmds.deformer(mesh, type='chwSurfaceTweak')[0]\\n\\n\\t\\t\\tcmds.setAttr(ss+'.vertex', int(vtx))\\n\\n\\t\\t\\tpivot_ctrl = cmds.group(em=True, name=name)\\n\\n\\t\\t\\toffset_ctrl = util.makeControlSphere(name+'_Offset', 0.25)\\n\\n\\t\\t\\tsticky_ctrl = util.makeControlSphere(name+'_Deform')\\n\\n\\t\\t\\tcmds.parent(sticky_ctrl, offset_ctrl)\\n\\n\\t\\t\\tcmds.parent(offset_ctrl, pivot_ctrl)\\n\\n\\t\\t\\tcmds.addAttr(sticky_ctrl, at='double', ln='envelope', k=1, dv=1, min=0, max=1)\\n\\n\\t\\t\\tcmds.addAttr(sticky_ctrl, at='enum', ln='falloffMode', k=1, en='Volume')\\n\\n\\t\\t\\tcmds.addAttr(sticky_ctrl, at='double', ln='falloffRadius', k=1, dv=1, min=0)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.falloffMode', ss+'.falloffMode', f=True)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.falloffRadius', ss+'.falloffRadius', f=True)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.envelope', ss+'.envelope', f=True)\\n\\n\\t\\t\\tcmds.connectAttr(sticky_ctrl+'.worldMatrix[0]', ss+'.deformMatrix')\\n\\n\\t\\t\\tcmds.connectAttr(offset_ctrl+'.worldMatrix[0]', ss+'.relativeMatrix')\\n\\n\\t\\t\\tcmds.connectAttr(ss+'.outRotate', pivot_ctrl+'.rotate')\\n\\n\\t\\t\\tcmds.connectAttr(ss+'.outTranslate', pivot_ctrl+'.translate')\\n\\n\\t\\t\\tcmds.select(sticky_ctrl, r=True)\\n\\n\\t\\t\\treturn [pivot_ctrl, offset_ctrl, sticky_ctrl, ss]\\n\\n\\t\\telse:\\n\\n\\t\\t\\tprint \\\"chwSurfaceTweak: You need to select a mesh vertex!\\\\n\\\"\\n\\n\\telse:\\n\\n\\t\\tprint \\\"chwSurfaceTweak: You need to select a mesh vertex!\\\\n\\\"\\n\\n\\n\\n\\n\\ndef chwCollision():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) > 1:\\n\\n\\t\\tdefmesh = selection[0]\\n\\n\\t\\tselection.pop(0)\\n\\n\\t\\tcolDefs = [x for x in cmds.listHistory(defmesh) if cmds.nodeType(x) == 'chwCollision']\\n\\n\\t\\tif colDefs:\\n\\n\\t\\t\\tnextIdx = 0\\n\\n\\t\\t\\tcoldef = colDefs[0]\\n\\n\\t\\t\\tindices = cmds.getAttr(coldef+'.collisionMeshList', mi=True)\\n\\n\\t\\t\\tif indices:\\n\\n\\t\\t\\t\\tnextIdx = indices[-1]+1\\n\\n\\t\\t\\tfor idx in xrange(0, len(selection)):\\n\\n\\t\\t\\t\\tmidx = idx + nextIdx\\n\\n\\t\\t\\t\\tcmds.getAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName')\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=False)\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', selection[idx], type='string')\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=True)\\n\\n\\t\\t\\t\\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(midx)+'].collisionMesh', f=True)\\n\\n\\t\\telse:\\n\\n\\t\\t\\tcoldef = cmds.deformer(defmesh, type='chwCollision')[0]\\n\\n\\t\\t\\tfor idx in xrange(0, len(selection)):\\n\\n\\t\\t\\t\\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(idx)+'].collisionMesh', f=True)\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(idx)+'].collisionMeshName', selection[idx], type='string')\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(idx)+'].collisionMeshName', l=True)\\n\\n\\n\",\n \"file_path\": \"chwTools/scripts/chwTools/deformers.py\",\n \"rank\": 60,\n \"score\": 19568.467078856134\n },\n {\n \"content\": \"def chwCollision():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) > 1:\\n\\n\\t\\tdefmesh = selection[0]\\n\\n\\t\\tselection.pop(0)\\n\\n\\t\\tcolDefs = [x for x in cmds.listHistory(defmesh) if cmds.nodeType(x) == 'chwCollision']\\n\\n\\t\\tif colDefs:\\n\\n\\t\\t\\tnextIdx = 0\\n\\n\\t\\t\\tcoldef = colDefs[0]\\n\\n\\t\\t\\tindices = cmds.getAttr(coldef+'.collisionMeshList', mi=True)\\n\\n\\t\\t\\tif indices:\\n\\n\\t\\t\\t\\tnextIdx = indices[-1]+1\\n\\n\\t\\t\\tfor idx in xrange(0, len(selection)):\\n\\n\\t\\t\\t\\tmidx = idx + nextIdx\\n\\n\\t\\t\\t\\tcmds.getAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName')\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=False)\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', selection[idx], type='string')\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(midx)+'].collisionMeshName', l=True)\\n\\n\\t\\t\\t\\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(midx)+'].collisionMesh', f=True)\\n\\n\\t\\telse:\\n\\n\\t\\t\\tcoldef = cmds.deformer(defmesh, type='chwCollision')[0]\\n\\n\\t\\t\\tfor idx in xrange(0, len(selection)):\\n\\n\\t\\t\\t\\tcmds.connectAttr(selection[idx]+'.worldMesh[0]', coldef+'.collisionMeshList['+str(idx)+'].collisionMesh', f=True)\\n\\n\\t\\t\\t\\tcmds.setAttr(coldef+'.collisionMeshList['+str(idx)+'].collisionMeshName', selection[idx], type='string')\\n\",\n \"file_path\": \"chwTools/scripts/chwTools/deformers.py\",\n \"rank\": 61,\n \"score\": 18000.634282995168\n },\n {\n \"content\": \"class chwCurveSampler : public MPxNode\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\t\\t\\tchwCurveSampler();\\n\\n\\t\\tvirtual ~chwCurveSampler();\\n\\n\\n\\n\\t\\tvirtual MStatus \\tcompute(const MPlug& plug, MDataBlock& data);\\n\\n\\t\\tstatic void* \\t\\tcreator();\\n\\n\\t\\tstatic MStatus \\tinitialize();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taInCurve;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taInUpCurve;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taInNumSamples;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotate;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotateX;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotateY;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotateZ;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslate;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslateX;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslateY;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslateZ;\\n\\n\\n\\n\\t\\tstatic const MTypeId \\ttypeId;\\n\\n\\t\\tstatic const MString \\ttypeName;\\n\\n};\\n\\n\\n\\n#endif // CHWCURVESAMPLER_H\\n\",\n \"file_path\": \"include/chwCurveSampler.h\",\n \"rank\": 62,\n \"score\": 17646.27222345726\n },\n {\n \"content\": \"class chwMatrixSelector : public MPxNode\\n\\n{\\n\\n\\tpublic:\\n\\n\\t\\t\\t\\tchwMatrixSelector();\\n\\n\\t\\tvirtual ~chwMatrixSelector();\\n\\n\\n\\n\\t\\tvirtual MStatus \\tcompute(const MPlug& plug, MDataBlock& data);\\n\\n\\t\\tstatic void* \\t\\tcreator();\\n\\n\\t\\tstatic MStatus \\tinitialize();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taInMatrix;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taInMatrixList;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotate;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotateX;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotateY;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutRotateZ;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslate;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslateX;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslateY;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taOutTranslateZ;\\n\\n\\t\\tstatic\\tMObject\\t\\t\\taInMatrixIndex;\\n\\n\\n\\n\\n\\n\\t\\tstatic const MTypeId \\ttypeId;\\n\\n\\t\\tstatic const MString \\ttypeName;\\n\\n};\\n\\n\\n\\n#endif // CHWMATRIXSELECTOR_H\\n\",\n \"file_path\": \"include/chwMatrixSelector.h\",\n \"rank\": 63,\n \"score\": 17646.27222345726\n },\n {\n \"content\": \"def chwNormalOffset():\\n\\n\\tselection = cmds.ls(sl=True)\\n\\n\\tif len(selection) == 1:\\n\\n\\t\\tcmds.deformer(selection, type='chwNormalOffset')\\n\\n\\telse:\\n\",\n \"file_path\": \"chwTools/scripts/chwTools/deformers.py\",\n \"rank\": 64,\n \"score\": 17307.300629780348\n },\n {\n \"content\": \"\\toutput.setLength(m_relaxData->m_vertcount);\\n\\n\\toutput = m_relaxData->m_relaxpoints;\\n\\n}\\n\\n\\n\\nvoid chwEdgeRelax::doRelax()\\n\\n{\\n\\n\\tfor (unsigned int idx=0; idx < m_relaxData->m_iterations; ++idx)\\n\\n\\t{\\n\\n\\t\\tThreadedDeform td;\\n\\n\\t\\ttd.data = m_relaxData;\\n\\n\\t\\tparallel_for( blocked_range<int>( 0, m_relaxData->m_vertcount ), td );\\n\\n\\t\\tm_relaxData->m_points = m_relaxData->m_relaxpoints;\\n\\n\\t}\\n\\n}\\n\\n\\n\\nvoid chwEdgeRelax::buildTopology(MObject &mesh)\\n\\n{\\n\\n\\tMItMeshVertex \\titer(mesh);\\n\\n\\tMFnMesh\\t\\t\\tmeshfn(mesh);\\n\\n\\tMIntArray \\t\\tconVerts;\\n\",\n \"file_path\": \"src/chwEdgeRelax.cpp\",\n \"rank\": 65,\n \"score\": 22.69602579917136\n },\n {\n \"content\": \"\\n\\n\\t\\tstatus = meshFn.getVertexNormals(false, m_data->m_normals, MSpace::kWorld);\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\t// RESIZE ALL ARRAYS\\n\\n\\t\\tm_data->m_numpoints = m_data->m_points.length();\\n\\n\\t\\tm_data->m_weights.setLength(m_data->m_numpoints);\\n\\n\\t\\tm_data->m_collided.setLength(m_data->m_numpoints);\\n\\n\\n\\n\\t\\tif(env > 0)\\n\\n\\t\\t{\\n\\n\\t\\t\\tfor (unsigned int idx=0; idx<m_data->m_numpoints; idx++)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tm_data->m_boxin.expand(m_data->m_points[idx]);\\n\\n\\t\\t\\t\\tm_data->m_weights[idx] = weightValue(data,index,idx) * env;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tMArrayDataHandle arrayHandle = data.inputArrayValue(aCollisionMeshList, &status);\\n\\n\\t\\t\\tunsigned int count = arrayHandle.elementCount();\\n\\n\\t\\t\\tfor (unsigned int midx=0; midx < count; midx++)\\n\",\n \"file_path\": \"src/chwCollision.cpp\",\n \"rank\": 66,\n \"score\": 21.456760560591995\n },\n {\n \"content\": \"\\t\\tm_data->m_numverts = meshFn.numVertices();\\n\\n\\n\\n\\t\\tif(m_data->m_env != 0.00 && m_data->m_strength != 0.00)\\n\\n\\t\\t{\\n\\n\\t\\t\\tm_data->m_weights.setLength(m_data->m_numverts);\\n\\n\\t\\t\\tfor (unsigned int idx=0; idx < m_data->m_numverts; idx++)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tm_data->m_weights[idx] = weightValue(data,index,idx) * m_data->m_env * m_data->m_strength;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (m_data->m_smooth > 0)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tMObject relaxMesh(inMesh);\\n\\n\\t\\t\\t\\tm_relax.relax(relaxMesh, m_data->m_smooth);\\n\\n\\t\\t\\t\\tMFnMesh relaxFn(relaxMesh, &status);\\n\\n\\t\\t\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\t\\t\\trelaxFn.getVertexNormals(false, m_data->m_normals, MSpace::kObject);\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\telse\\n\\n\\t\\t\\t{\\n\",\n \"file_path\": \"src/chwNormalOffset.cpp\",\n \"rank\": 67,\n \"score\": 21.213864473710814\n },\n {\n \"content\": \"\\t\\t\\t\\tmeshFn.getVertexNormals(false, m_data->m_normals, MSpace::kObject);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t// THREADED DEFORMATION\\n\\n\\t\\t\\tThreadedDeform td;\\n\\n\\t\\t\\ttd.data = m_data;\\n\\n\\t\\t\\tparallel_for( blocked_range<int>( 0, m_data->m_numverts ), td );\\n\\n\\t\\t}\\n\\n\\t\\tmeshFn.setPoints(m_data->m_points, MSpace::kObject);\\n\\n\\t}\\n\\n\\tdata.setClean(plug);\\n\\n\\treturn MS::kSuccess;\\n\\n}\\n\",\n \"file_path\": \"src/chwNormalOffset.cpp\",\n \"rank\": 69,\n \"score\": 18.567517505983094\n },\n {\n \"content\": \"\\tm_data->m_smooth = data.inputValue(aNormalSmooth).asInt();\\n\\n\\n\\n\\tif (plug.attribute() == outputGeom)\\n\\n\\t{\\n\\n\\t\\tunsigned int index = plug.logicalIndex();\\n\\n\\t\\tMObject thisNode = this->thisMObject();\\n\\n\\t\\tMPlug inPlug(thisNode,input);\\n\\n\\t\\tinPlug.selectAncestorLogicalIndex(index,input);\\n\\n\\t\\tMDataHandle hInput = data.inputValue(inPlug, &status );\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\tMDataHandle hGeom = hInput.child(inputGeom);\\n\\n\\t\\tMMatrix m = hGeom.geometryTransformMatrix();\\n\\n\\t\\tMDataHandle hOutput = data.outputValue(plug);\\n\\n\\t\\thOutput.copy(hGeom);\\n\\n\\t\\tMObject inMesh = hGeom.asMesh();\\n\\n\\t\\tMFnMesh meshFn(inMesh, &status);\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\tmeshFn.getPoints(m_data->m_points, MSpace::kObject);\\n\",\n \"file_path\": \"src/chwNormalOffset.cpp\",\n \"rank\": 70,\n \"score\": 17.904318846198596\n },\n {\n \"content\": \"\\tif (plug.attribute() == outputGeom)\\n\\n\\t{\\n\\n\\t\\tfloat env = data.inputValue(envelope).asFloat();\\n\\n\\n\\n\\t\\tm_data->m_bulgeRampAttribute = MRampAttribute(thisNode, aCollisionBulgeRamp, &status);\\n\\n\\n\\n\\t\\tunsigned int index = plug.logicalIndex();\\n\\n\\t\\tMPlug inPlug(thisNode,input);\\n\\n\\t\\tinPlug.selectAncestorLogicalIndex(index,input);\\n\\n\\t\\tMDataHandle hInput = data.inputValue(inPlug, &status );\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\tMDataHandle hGeom = hInput.child(inputGeom);\\n\\n\\t\\tMDataHandle hOutput = data.outputValue(plug);\\n\\n\\t\\thOutput.copy(hGeom);\\n\\n\\t\\tMObject outMesh = hGeom.asMesh();\\n\\n\\t\\tMFnMesh meshFn(outMesh);\\n\\n\\n\\n\\t\\tstatus = meshFn.getPoints(m_data->m_points, MSpace::kWorld);\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\",\n \"file_path\": \"src/chwCollision.cpp\",\n \"rank\": 74,\n \"score\": 17.202457895892735\n },\n {\n \"content\": \"\\tMFnMesh meshfn(mesh);\\n\\n\\tmeshfn.setPoints(m_relaxData->m_relaxpoints);\\n\\n}\\n\\n\\n\\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations, MFloatArray &weights)\\n\\n{\\n\\n\\tm_relaxData->m_iterations = iterations;\\n\\n\\n\\n\\tbuildTopology(mesh);\\n\\n\\n\\n\\tm_relaxData->m_weights = weights;\\n\\n\\n\\n\\tdoRelax();\\n\\n\\n\\n\\tMFnMesh meshfn(mesh);\\n\\n\\tmeshfn.setPoints(m_relaxData->m_relaxpoints);\\n\\n}\\n\\n\\n\\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations, MPointArray &output)\\n\\n{\\n\",\n \"file_path\": \"src/chwEdgeRelax.cpp\",\n \"rank\": 76,\n \"score\": 16.648200688453837\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#include \\\"chwEdgeRelax.h\\\"\\n\\n\\n\\nchwEdgeRelax::chwEdgeRelax()\\n\\n{\\n\\n\\tm_relaxData = new chwEdgeRelaxData;\\n\\n\\tm_relaxData->m_cachedcount = 0;\\n\\n}\\n\\nchwEdgeRelax::~chwEdgeRelax() { }\\n\\n\\n\\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations)\\n\\n{\\n\\n\\tm_relaxData->m_iterations = iterations;\\n\\n\\n\\n\\tbuildTopology(mesh);\\n\\n\\n\\n\\tdoRelax();\\n\\n\\n\",\n \"file_path\": \"src/chwEdgeRelax.cpp\",\n \"rank\": 77,\n \"score\": 15.266012504650387\n },\n {\n \"content\": \"\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\tdouble min, max = 0.f;\\n\\n\\t\\tdouble param = 0.f;\\n\\n\\t\\tMVector\\t\\tinCurveTangent(0.f,0.f,0.f);\\n\\n\\t\\tMPoint\\t\\tinCurvePoint(0.f,0.f,0.f);\\n\\n\\t\\tMPoint\\t\\tinUpCurvePoint(0.f,0.f,0.f);\\n\\n\\n\\n\\t\\tMVector\\t\\tvx, vy, vz;\\n\\n\\n\\n\\t\\tMPoint outTranslate;\\n\\n\\t\\tdouble outRotate[3];\\n\\n\\n\\n\\t\\tinCurveFn.getKnotDomain(min, max);\\n\\n\\n\\n\\t\\tfloat step = max / (inNumSamples-1);\\n\\n\\n\\n\\t\\tfor (unsigned int idx=0; idx < inNumSamples; idx++)\\n\\n\\t\\t{\\n\\n\\t\\t\\tparam = min + (idx * step);\\n\",\n \"file_path\": \"src/chwCurveSampler.cpp\",\n \"rank\": 78,\n \"score\": 15.067917224489126\n },\n {\n \"content\": \"\\tm_relaxData->m_iterations = iterations;\\n\\n\\n\\n\\tbuildTopology(mesh);\\n\\n\\n\\n\\tdoRelax();\\n\\n\\n\\n\\toutput.setLength(m_relaxData->m_vertcount);\\n\\n\\toutput = m_relaxData->m_relaxpoints;\\n\\n}\\n\\n\\n\\nvoid chwEdgeRelax::relax(MObject& mesh, unsigned int iterations, MPointArray &output, MFloatArray &weights)\\n\\n{\\n\\n\\tm_relaxData->m_iterations = iterations;\\n\\n\\n\\n\\tbuildTopology(mesh);\\n\\n\\n\\n\\tm_relaxData->m_weights = weights;\\n\\n\\n\\n\\tdoRelax();\\n\\n\\n\",\n \"file_path\": \"src/chwEdgeRelax.cpp\",\n \"rank\": 79,\n \"score\": 15.045322833624525\n },\n {\n \"content\": \"MObject \\t\\tchwMatrixSelector::aInMatrixIndex;\\n\\n\\n\\nchwMatrixSelector::chwMatrixSelector(){}\\n\\nchwMatrixSelector::~chwMatrixSelector(){}\\n\\nvoid* chwMatrixSelector::creator(){ return new chwMatrixSelector(); }\\n\\n\\n\\nMStatus chwMatrixSelector::compute(const MPlug& plug, MDataBlock& data)\\n\\n{\\n\\n\\tMStatus status;\\n\\n\\n\\n\\tif(plug == aOutRotate || plug == aOutTranslate || plug.parent() == aOutRotate || plug.parent() == aOutTranslate) {\\n\\n\\t\\tunsigned int matrixIndex = data.inputValue( aInMatrixIndex ).asShort();\\n\\n\\t\\tMArrayDataHandle arrayHandle = data.inputArrayValue(aInMatrixList, &status);\\n\\n\\t\\tif (status == MS::kSuccess) {\\n\\n\\t\\t\\tunsigned int count = arrayHandle.elementCount();\\n\\n\\t\\t\\tif (matrixIndex<count) {\\n\\n\\t\\t\\t\\tarrayHandle.jumpToArrayElement(matrixIndex);\\n\\n\\t\\t\\t\\tMDataHandle inputHandle = arrayHandle.inputValue(&status).child(aInMatrix);\\n\\n\\t\\t\\t\\tif (status == MS::kSuccess) {\\n\\n\\t\\t\\t\\t\\tMTransformationMatrix matrix = inputHandle.asMatrix();\\n\",\n \"file_path\": \"src/chwMatrixSelector.cpp\",\n \"rank\": 80,\n \"score\": 14.951340062788235\n },\n {\n \"content\": \"\\t\\t\\t\\tm_data->m_collisionStrength = collisionStrengthHnd.asFloat();\\n\\n\\t\\t\\t\\tm_data->m_bulgeStrength = collisionBulgeStrengthHnd.asFloat();\\n\\n\\t\\t\\t\\tm_data->m_bulgeDistance = collisionBulgeDistanceHnd.asFloat();\\n\\n\\t\\t\\t\\tm_data->m_defmax = 0.f;\\n\\n\\n\\n\\t\\t\\t\\tif ((m_data->m_collisionStrength > 0.f) && !collisionMeshHnd.data().isNull())\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tMFloatPointArray pointsCol;\\n\\n\\t\\t\\t\\t\\tMObject\\tcolMesh = collisionMeshHnd.asMeshTransformed();\\n\\n\\t\\t\\t\\t\\ttc.colFn = new MFnMesh(colMesh);\\n\\n\\n\\n\\t\\t\\t\\t\\tstatus = tc.colFn->getPoints(pointsCol, MSpace::kWorld);\\n\\n\\t\\t\\t\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\t\\t\\t\\tfor (unsigned int idx=0; idx<pointsCol.length(); idx++)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tm_data->m_boxcol.expand(pointsCol[idx]);\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\tm_data->m_mmAccelParams = tc.colFn->autoUniformGridParams();\\n\",\n \"file_path\": \"src/chwCollision.cpp\",\n \"rank\": 83,\n \"score\": 14.519192903052751\n },\n {\n \"content\": \"MObject \\t\\tchwCurveSampler::aOutTranslateZ;\\n\\n\\n\\nchwCurveSampler::chwCurveSampler(){}\\n\\nchwCurveSampler::~chwCurveSampler(){}\\n\\nvoid* chwCurveSampler::creator(){ return new chwCurveSampler(); }\\n\\n\\n\\nMStatus chwCurveSampler::compute(const MPlug& plug, MDataBlock& data)\\n\\n{\\n\\n\\tMStatus status;\\n\\n\\n\\n\\tif(plug == aOutRotate || plug == aOutTranslate || plug.parent() == aOutRotate || plug.parent() == aOutTranslate) {\\n\\n\\t\\t// GET NUM SAMPLES\\n\\n\\t\\tunsigned int inNumSamples = data.inputValue(aInNumSamples).asInt();\\n\\n\\n\\n\\t\\t// SETUP ARRAY DATA HANDLE\\n\\n\\t\\tMArrayDataHandle outRotateArray = data.outputArrayValue(aOutRotate, &status);\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\\n\\n\\n\\t\\tMArrayDataHandle outTranslateArray = data.outputArrayValue(aOutTranslate, &status);\\n\\n\\t\\tCHECK_MSTATUS_AND_RETURN_IT(status);\\n\",\n \"file_path\": \"src/chwCurveSampler.cpp\",\n \"rank\": 84,\n \"score\": 14.334236951924755\n },\n {\n \"content\": \"\\t\\t\\t\\t\\tm_data->m_intersector.create(colMesh);\\n\\n\\n\\n\\t\\t\\t\\t\\tif (m_data->m_boxin.intersects(m_data->m_boxcol))\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tparallel_for( blocked_range<int>( 0, m_data->m_numpoints ), tc );\\n\\n\\t\\t\\t\\t\\t\\tparallel_for( blocked_range<int>( 0, m_data->m_numpoints ), tb );\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tmeshFn.setPoints(m_data->m_points, MSpace::kWorld);\\n\\n\\t}\\n\\n\\tdata.setClean(plug);\\n\\n\\treturn MS::kSuccess;\\n\\n}\\n\\n\\n\\nvoid chwCollision::postConstructor()\\n\\n{\\n\\n\\tMStatus status;\\n\\n\\n\",\n \"file_path\": \"src/chwCollision.cpp\",\n \"rank\": 86,\n \"score\": 12.494921731601483\n },\n {\n \"content\": \"chwCollision::~chwCollision()\\n\\n{\\n\\n\\tdelete m_data;\\n\\n}\\n\\nvoid* chwCollision::creator(){ return new chwCollision(); }\\n\\n\\n\\nMStatus chwCollision::initialize()\\n\\n{\\n\\n\\tMFnTypedAttribute\\t\\ttAttr;\\n\\n\\tMFnNumericAttribute\\t\\tnAttr;\\n\\n\\tMFnCompoundAttribute\\tcAttr;\\n\\n\\tMRampAttribute\\t\\t\\trAttr;\\n\\n\\tMFnStringData\\t\\t\\tstringdata;\\n\\n\\n\\n\\taCollisionMesh = tAttr.create( \\\"collisionMesh\\\", \\\"cm\\\", MFnData::kMesh );\\n\\n\\ttAttr.setStorable(false);\\n\\n\\ttAttr.setConnectable(true);\\n\\n\\taddAttribute( aCollisionMesh );\\n\\n\\n\\n\\taCollisionMeshName = tAttr.create( \\\"collisionMeshName\\\", \\\"cmn\\\", MFnData::kString, stringdata.create() );\\n\",\n \"file_path\": \"src/chwCollision.cpp\",\n \"rank\": 87,\n \"score\": 12.134161223076516\n },\n {\n \"content\": \"\\n\\n\\t\\t\\tm[2][0] = vz[0];\\n\\n\\t\\t\\tm[2][1] = vz[1];\\n\\n\\t\\t\\tm[2][2] = vz[2];\\n\\n\\t\\t\\tm[2][3] = 0.f;\\n\\n\\n\\n\\t\\t\\tm[3][0] = inCurvePoint[0];\\n\\n\\t\\t\\tm[3][1] = inCurvePoint[1];\\n\\n\\t\\t\\tm[3][2] = inCurvePoint[2];\\n\\n\\t\\t\\tm[3][3] = 1.f;\\n\\n\\n\\n\\t\\t\\tMDataHandle outRotateHnd = outRotateBuilder.addElement(idx);\\n\\n\\t\\t\\tMDataHandle outTranslateHnd = outTranslateBuilder.addElement(idx);\\n\\n\\n\\n\\t\\t\\tMTransformationMatrix outMatrix(m);\\n\\n\\t\\t\\tMTransformationMatrix::RotationOrder order;\\n\\n\\n\\n\\t\\t\\toutMatrix.getRotation(outRotate, order, MSpace::kWorld);\\n\\n\\t\\t\\toutTranslate = outMatrix.getTranslation(MSpace::kWorld);\\n\\n\\n\",\n \"file_path\": \"src/chwCurveSampler.cpp\",\n \"rank\": 88,\n \"score\": 11.403400283474532\n },\n {\n \"content\": \"\\n\\n\\tmeshfn.getPoints(m_relaxData->m_points, MSpace::kObject);\\n\\n\\n\\n\\tm_relaxData->m_vertcount = iter.count();\\n\\n\\tm_relaxData->m_points.clear();\\n\\n\\tm_relaxData->m_relaxpoints.clear();\\n\\n\\tm_relaxData->m_weights.clear();\\n\\n\\tm_relaxData->m_points.setLength(m_relaxData->m_vertcount);\\n\\n\\tm_relaxData->m_relaxpoints.setLength(m_relaxData->m_vertcount);\\n\\n\\tm_relaxData->m_weights.setLength(m_relaxData->m_vertcount);\\n\\n\\n\\n\\tm_relaxData->m_weights = MFloatArray(m_relaxData->m_vertcount, 1.f);\\n\\n\\n\\n\\tif (m_relaxData->m_vertcount != m_relaxData->m_cachedcount)\\n\\n\\t{\\n\\n\\t\\tm_relaxData->m_conids.clear();\\n\\n\\t\\tm_relaxData->m_conids.resize(m_relaxData->m_vertcount);\\n\\n\\t\\tfor (unsigned int idx=0; !iter.isDone(); iter.next(),++idx)\\n\\n\\t\\t{\\n\\n\\t\\t\\t\\titer.getConnectedVertices(conVerts);\\n\",\n \"file_path\": \"src/chwEdgeRelax.cpp\",\n \"rank\": 89,\n \"score\": 11.103473489102276\n },\n {\n \"content\": \"\\n\\nvoid* chwNormalOffset::creator()\\n\\n{\\n\\n\\treturn new chwNormalOffset();\\n\\n}\\n\\n\\n\\n\\n\\nMStatus chwNormalOffset::initialize()\\n\\n{\\n\\n\\tMFnNumericAttribute nAttr;\\n\\n\\n\\n\\taStrength = nAttr.create( \\\"strength\\\", \\\"str\\\", MFnNumericData::kFloat );\\n\\n\\tnAttr.setKeyable(true);\\n\\n\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setConnectable(true);\\n\\n\\taddAttribute( aStrength );\\n\\n\\n\\n\\taNormalSmooth = nAttr.create( \\\"normalSmooth\\\", \\\"ns\\\", MFnNumericData::kInt );\\n\\n\\tnAttr.setKeyable(true);\\n\",\n \"file_path\": \"src/chwNormalOffset.cpp\",\n \"rank\": 90,\n \"score\": 10.752410281520898\n },\n {\n \"content\": \"* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n***********************************************************************************/\\n\\n\\n\\n#include <maya/MFnPlugin.h>\\n\\n#include <chwVertexBind.h>\\n\\n#include <chwMeshRelax.h>\\n\\n#include <chwNormalOffset.h>\\n\\n#include <chwMatrixSelector.h>\\n\\n#include <chwCurveSampler.h>\\n\\n#include <chwCollision.h>\\n\\n#include <chwSurfaceTweak.h>\\n\\n\\n\\nMStatus initializePlugin( MObject obj )\\n\\n{\\n\\n\\tMFnPlugin plugin( obj, \\\"Cristian Hinz Welkens\\\", \\\"1.0\\\", \\\"Any\\\");\\n\\n\\n\\n\\tCHECK_MSTATUS ( plugin.registerNode( chwVertexBind::typeName, chwVertexBind::typeId,\\n\\n\\t\\t\\t\\t\\tchwVertexBind::creator, chwVertexBind::initialize, MPxNode::kDeformerNode ) );\\n\\n\\n\\n\\tCHECK_MSTATUS ( plugin.registerNode( chwMeshRelax::typeName, chwMeshRelax::typeId,\\n\",\n \"file_path\": \"src/chwTools.cpp\",\n \"rank\": 91,\n \"score\": 10.692089496458017\n },\n {\n \"content\": \"\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setConnectable(true);\\n\\n\\tnAttr.setMin(0);\\n\\n\\taddAttribute( aNormalSmooth );\\n\\n\\n\\n\\tattributeAffects( chwNormalOffset::aStrength, chwNormalOffset::outputGeom );\\n\\n\\tattributeAffects( chwNormalOffset::aNormalSmooth, chwNormalOffset::outputGeom );\\n\\n\\n\\n\\tMGlobal::executeCommand(\\\"makePaintable -attrType multiFloat -sm deformer chwNormalOffset weights\\\");\\n\\n\\n\\n\\treturn MStatus::kSuccess;\\n\\n}\\n\\n\\n\\nMStatus chwNormalOffset::compute(const MPlug& plug, MDataBlock& data)\\n\\n{\\n\\n\\n\\n\\tMStatus status;\\n\\n\\tm_data->m_env = data.inputValue(envelope).asFloat();\\n\\n\\tm_data->m_strength = data.inputValue(aStrength).asFloat();\\n\",\n \"file_path\": \"src/chwNormalOffset.cpp\",\n \"rank\": 92,\n \"score\": 10.658778140880191\n },\n {\n \"content\": \"\\t\\t\\t\\tfor (unsigned int idz=0;idz<conVerts.length();++idz)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tm_relaxData->m_conids[idx].push_back(conVerts[idz]);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\titer.reset();\\n\\n\\t}\\n\\n\\tm_relaxData->m_cachedcount = m_relaxData->m_vertcount;\\n\\n}\\n\",\n \"file_path\": \"src/chwEdgeRelax.cpp\",\n \"rank\": 93,\n \"score\": 10.386067077330875\n },\n {\n \"content\": \"\\t\\t\\tinCurveTangent = inCurveFn.tangent(param, MSpace::kWorld);\\n\\n\\t\\t\\tinCurveFn.getPointAtParam(param, inCurvePoint, MSpace::kWorld);\\n\\n\\t\\t\\tinUpCurveFn.getPointAtParam(param, inUpCurvePoint, MSpace::kWorld);\\n\\n\\n\\n\\n\\n\\t\\t\\tMMatrix m;\\n\\n\\n\\n\\t\\t\\tvx = inCurveTangent.normal();\\n\\n\\t\\t\\tvy = (inUpCurvePoint - inCurvePoint).normal();\\n\\n\\t\\t\\tvz = (vx ^ vy).normal();\\n\\n\\n\\n\\t\\t\\tm[0][0] = vx[0];\\n\\n\\t\\t\\tm[0][1] = vx[1];\\n\\n\\t\\t\\tm[0][2] = vx[2];\\n\\n\\t\\t\\tm[0][3] = 0.f;\\n\\n\\n\\n\\t\\t\\tm[1][0] = vy[0];\\n\\n\\t\\t\\tm[1][1] = vy[1];\\n\\n\\t\\t\\tm[1][2] = vy[2];\\n\\n\\t\\t\\tm[1][3] = 0.f;\\n\",\n \"file_path\": \"src/chwCurveSampler.cpp\",\n \"rank\": 95,\n \"score\": 9.474514580096084\n },\n {\n \"content\": \"\\tuAttr.setConnectable(true);\\n\\n\\taOutRotate = nAttr.create( \\\"outRotate\\\", \\\"or\\\", aOutRotateX, aOutRotateY, aOutRotateZ);\\n\\n\\tnAttr.setArray(true);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setConnectable(true);\\n\\n\\tnAttr.setUsesArrayDataBuilder(true);\\n\\n\\taddAttribute( aOutRotate );\\n\\n\\n\\n\\n\\n\\taOutTranslateX = nAttr.create( \\\"outTranslateX\\\", \\\"otx\\\", MFnNumericData::kDouble, 0.0);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setConnectable(true);\\n\\n\\taOutTranslateY = nAttr.create( \\\"outTranslateY\\\", \\\"oty\\\", MFnNumericData::kDouble, 0.0);\\n\\n\\tnAttr.setWritable(true);\\n\\n\\tnAttr.setStorable(true);\\n\\n\\tnAttr.setConnectable(true);\\n\\n\\taOutTranslateZ = nAttr.create( \\\"outTranslateZ\\\", \\\"otz\\\", MFnNumericData::kDouble, 0.0);\\n\\n\\tnAttr.setWritable(true);\\n\",\n \"file_path\": \"src/chwCurveSampler.cpp\",\n \"rank\": 97,\n \"score\": 8.829101889861452\n },\n {\n \"content\": \"\\tstatus = postConstructor_initialise_ramp_curve( aCollisionBulgeRamp, 0, 0.0f, 0.0f, 2 );\\n\\n\\tCHECK_MSTATUS(status);\\n\\n\\tstatus = postConstructor_initialise_ramp_curve( aCollisionBulgeRamp, 1, 0.3f, 0.8f, 2 );\\n\\n\\tCHECK_MSTATUS(status);\\n\\n\\tstatus = postConstructor_initialise_ramp_curve( aCollisionBulgeRamp, 2, 1.0f, 0.0f, 2 );\\n\\n\\tCHECK_MSTATUS(status);\\n\\n}\\n\\n\\n\\nMStatus chwCollision::postConstructor_initialise_ramp_curve( MObject &rampObj, int index, float position, float value, int interpolation)\\n\\n{\\n\\n\\tMStatus status;\\n\\n\\n\\n\\tMObject thisNode = this->thisMObject();\\n\\n\\n\\n\\tMPlug rampPlug( thisNode, rampObj );\\n\\n\\tMPlug elementPlug = rampPlug.elementByLogicalIndex( index, &status );\\n\\n\\n\\n\\tMPlug positionPlug = elementPlug.child(0, &status);\\n\\n\\tstatus = positionPlug.setFloat(position);\\n\\n\\n\\n\\tMPlug valuePlug = elementPlug.child(1);\\n\\n\\tstatus = valuePlug.setFloat(value);\\n\\n\\n\\n\\tMPlug interpPlug = elementPlug.child(2);\\n\\n\\tinterpPlug.setInt(interpolation);\\n\\n\\n\\n\\treturn MS::kSuccess;\\n\\n}\\n\",\n \"file_path\": \"src/chwCollision.cpp\",\n \"rank\": 99,\n \"score\": 8.504856191374927\n }\n]","isConversational":false}}},{"rowIdx":474,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/transpiler/transpiler.cpp"},"repo_name":{"kind":"string","value":"GeminiLab/afbd"},"commit":{"kind":"string","value":"6855eedd6e3b1309adea2071074d0ce0003e6079"},"file_code":{"kind":"string","value":"#include <transpiler/transpiler.h>\n#include <llvm/IR/TypeBuilder.h>\n\n#include <queue>\n#include <set>\n#include <sstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace afbd;\n\nvoid print_common_header(fstream &fs) {\n \n}\n\nshared_ptr<set<shared_ptr<Instruction>>> get_all_instrs(shared_ptr<Instruction> root) {\n auto _instrs = make_shared<set<shared_ptr<Instruction>>>();\n queue<shared_ptr<Instruction>> _instr_to_visit;\n\n _instrs->insert(root);\n _instr_to_visit.push(root);\n while (!_instr_to_visit.empty()) {\n auto u = _instr_to_visit.front();\n _instr_to_visit.pop();\n\n for (auto& e: *u->succs()) {\n auto nx = e.first;\n\n if (_instrs->find(nx) == _instrs->end()) {\n _instrs->insert(nx);\n _instr_to_visit.push(nx);\n }\n }\n }\n\n return _instrs;\n}\n\nllvm::Function *Transpiler::transpile_process(shared_ptr<Process> proc) {\n std::ostringstream ss;\n ss << \"process_\" << rand() << \"_\" << time(nullptr);\n auto process = llvm::Function::Create(\n process_type,\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n ss.str(),\n m\n );\n\n llvm::IRBuilder<> builder(context);\n\n auto bbEntry = llvm::BasicBlock::Create(context, \"\", process);\n auto bbLoop = llvm::BasicBlock::Create(context, \"\", process);\n llvm::BasicBlock* bbEnd;\n\n if (proc->type() == ProcessType::Always) {\n bbEnd = bbLoop;\n } else {\n bbEnd = llvm::BasicBlock::Create(context, \"\", process);\n }\n\n builder.SetInsertPoint(bbEntry);\n\n auto sim = process->arg_begin();\n map<shared_ptr<Var>, llvm::Value*> varAddr;\n for (auto &v: *var_id) {\n varAddr[v.first] = builder.CreateInBoundsGEP(sim, llvm::ArrayRef<llvm::Value*> {\n builder.getInt32(0),\n builder.getInt32(v.second)\n });\n }\n\n function<llvm::Value*(shared_ptr<Expr>)> eval = [&](shared_ptr<Expr> expr) -> llvm::Value* {\n auto type = expr->type();\n\n if (type == ExprType::VAR) {\n return builder.CreateLoad(varAddr[expr->as_var()]);\n } else if (type == ExprType::CONSTANT) {\n return builder.getInt32(expr->as_constant()->value());\n } else {\n if (type == ExprType::NOT) {\n return builder.CreateNot(eval(expr->get_operand(0)));\n } else if (type == ExprType::REDUCE_BOOL) {\n return builder.CreateIntCast(eval(expr->get_operand(0)), builder.getInt32Ty(), false);\n } else if (type == ExprType::COND) {\n return builder.CreateSelect(eval(expr->get_operand(0)), eval(expr->get_operand(1)), eval(expr->get_operand(2)));\n } else {\n auto opl = eval(expr->get_operand(0));\n auto opr = eval(expr->get_operand(1));\n\n \n\n switch (type) {\n case ExprType::ADD:\n return builder.CreateAdd(opl, opr);\n case ExprType::SUB:\n return builder.CreateSub(opl, opr);\n case ExprType::MUL:\n return builder.CreateMul(opl, opr);\n case ExprType::DIV:\n return builder.CreateUDiv(opl, opr);\n case ExprType::MOD:\n return builder.CreateURem(opl, opr);\n case ExprType::EQ:\n return builder.CreateICmpEQ(opl, opr);\n case ExprType::NE:\n return builder.CreateICmpNE(opl, opr);\n case ExprType::GT:\n return builder.CreateICmpUGT(opl, opr);\n case ExprType::GE:\n return builder.CreateICmpUGE(opl, opr);\n case ExprType::LT:\n return builder.CreateICmpULT(opl, opr);\n case ExprType::LE:\n return builder.CreateICmpULE(opl, opr);\n case ExprType::AND:\n return builder.CreateAnd(opl, opr);\n case ExprType::OR:\n return builder.CreateOr(opl, opr);\n case ExprType::XOR:\n return builder.CreateXor(opl, opr);\n case ExprType::SHL:\n return builder.CreateShl(opl, opr);\n case ExprType::LSHR:\n return builder.CreateLShr(opl, opr);\n case ExprType::ASHR:\n return builder.CreateAShr(opl, opr);\n }\n }\n }\n };\n\n function<llvm::Value*(llvm::Value*, int32_t)> shrink_to_width = [&](llvm::Value *v, int32_t width) -> llvm::Value* {\n return builder.CreateAnd(v, builder.getInt32((uint32_t)((1ull << width) - 1)));\n };\n\n auto instrs = get_all_instrs(proc->begin());\n map<shared_ptr<Instruction>, llvm::BasicBlock*> instr_bb;\n for (auto &x: *instrs) {\n instr_bb[x] = llvm::BasicBlock::Create(context, \"\", process);\n }\n\n builder.CreateBr(bbLoop);\n builder.SetInsertPoint(bbLoop);\n builder.CreateBr(instr_bb[proc->begin()]);\n\n for (auto &x: *instrs) {\n builder.SetInsertPoint(instr_bb[x]);\n\n auto type = x->type();\n auto instr_delay = x->delay();\n auto has_delay = instr_delay >= 0;\n instr_delay = has_delay ? instr_delay : 0;\n\n if (type == InstructionType::Delay) {\n if (instr_delay > 0) {\n builder.CreateCall(delay, llvm::ArrayRef<llvm::Value*> { builder.getInt32(instr_delay) });\n }\n } else if (type == InstructionType::Trigger) {\n if (x->triggers()->size() > 0) {\n builder.CreateCall(prepare_wait);\n for (auto &w: *x->triggers()) {\n builder.CreateCall(\n add_wait,\n llvm::ArrayRef<llvm::Value*> {\n builder.getInt32(var_id->at(w.first)),\n builder.getInt32((int32_t)w.second),\n }\n );\n }\n builder.CreateCall(do_wait);\n }\n } else {\n auto assign_type = x->assign_type();\n auto dst = x->dst()->as_var();\n\n if (assign_type == AssignType::Blocking) {\n if (has_delay) {\n auto temp = builder.CreateAlloca(builder.getInt32Ty());\n builder.CreateStore(shrink_to_width(eval(x->expr()), dst->bit()), temp);\n if (instr_delay == 0) {\n builder.CreateCall(delay_for_explicit_zero_delay);\n } else {\n builder.CreateCall(delay, llvm::ArrayRef<llvm::Value*> { builder.getInt32(instr_delay) });\n }\n builder.CreateCall(\n update,\n llvm::ArrayRef<llvm::Value*> {\n varAddr[x->dst()->as_var()],\n builder.CreateLoad(temp),\n builder.getInt32(var_id->at(dst)),\n }\n );\n } else {\n builder.CreateCall(\n update,\n llvm::ArrayRef<llvm::Value*> {\n varAddr[x->dst()->as_var()],\n shrink_to_width(eval(x->expr()), dst->bit()),\n builder.getInt32(var_id->at(dst)),\n }\n );\n }\n } else {\n builder.CreateCall(\n delayed_nonblocking_assign_update,\n llvm::ArrayRef<llvm::Value*> {\n varAddr[x->dst()->as_var()],\n shrink_to_width(eval(x->expr()), dst->bit()),\n builder.getInt32(var_id->at(dst)),\n builder.getInt32(instr_delay),\n }\n );\n }\n }\n\n auto bbcd = llvm::BasicBlock::Create(context, \"\", process);\n builder.CreateBr(bbcd);\n builder.SetInsertPoint(bbcd);\n\n bool end = false;\n for (auto &s: *x->succs()) {\n auto instr = s.first;\n auto cond = s.second;\n\n if (cond == nullptr) { \n builder.CreateBr(instr_bb[instr]);\n end = true;\n break;\n } else {\n bbcd = llvm::BasicBlock::Create(context, \"\", process);\n builder.CreateCondBr(eval(cond), instr_bb[instr], bbcd);\n builder.SetInsertPoint(bbcd);\n }\n }\n\n if (!end) builder.CreateBr(bbEnd);\n }\n\n if (bbEnd != bbLoop) {\n builder.SetInsertPoint(bbEnd);\n builder.CreateCall(process_end);\n builder.CreateRetVoid();\n }\n\n return process;\n}\n\nvoid Transpiler::load_static_functions() {\n auto voidTy = llvm::TypeBuilder<void, false>::get(context);\n auto tickTy = llvm::TypeBuilder<int32_t, false>::get(context);\n auto valTy = llvm::TypeBuilder<int32_t, false>::get(context);\n auto valPtrTy = valTy->getPointerTo();\n auto varIdTy = llvm::TypeBuilder<int32_t, false>::get(context);\n auto edgeTy = llvm::TypeBuilder<int32_t, false>::get(context);\n\n process_type = llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{sim_type->getPointerTo()},\n false\n );\n\n set_var_count = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{varIdTy},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"set_var_count\",\n m\n );\n\n push_process = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{process_type->getPointerTo(), sim_type->getPointerTo()},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"push_process\",\n m\n );\n\n process_end = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"process_end\",\n m\n );\n\n reset = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"reset\",\n m\n );\n\n delay = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { tickTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delay\",\n m\n );\n\n delay_for_explicit_zero_delay = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delay_for_explicit_zero_delay\",\n m\n );\n\n delay_for_nonblocking_assign_update = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { tickTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delay_for_nonblocking_assign_update\",\n m\n );\n\n delayed_nonblocking_assign_update = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { valPtrTy, valTy, varIdTy, tickTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delayed_nonblocking_assign_update\",\n m\n );\n\n prepare_wait = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"prepare_wait\",\n m\n );\n\n add_wait = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{ varIdTy, edgeTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"add_wait\",\n m\n );\n\n do_wait = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"do_wait\",\n m\n );\n\n update = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { valPtrTy, valTy, varIdTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"update\",\n m\n );\n}\n\nllvm::Module *Transpiler::transpile(shared_ptr<Module> module, shared_ptr<fstream> fs) {\n auto simName = \"sim_\" + module->name();\n m = new llvm::Module(\"sim_\" + simName, context);\n llvm::IRBuilder<> builder(context);\n\n print_common_header(*fs);\n\n var_id = make_shared<map<shared_ptr<Var>, int>>();\n\n *fs << \"struct \" << simName << \" {\" << endl;\n\n vector<llvm::Type *> member;\n for (auto &var: *module->vars()) {\n (*var_id)[var] = member.size();\n member.push_back(builder.getInt32Ty());\n *fs << \"int \" << *var->name() << \";\" << endl;\n }\n\n *fs << \"};\" << endl;\n\n sim_type = llvm::StructType::create(context, llvm::ArrayRef<llvm::Type *>(member), simName);\n auto initializer = llvm::Function::Create(\n llvm::FunctionType::get(builder.getVoidTy(), llvm::ArrayRef<llvm::Type *>{sim_type->getPointerTo()}, false),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"initialize_sim\",\n m\n );\n\n *fs << \"extern \\\"C\\\" void initialize_sim(\" << simName << \"*);\" << endl;\n\n load_static_functions();\n\n auto bb = llvm::BasicBlock::Create(context, \"\", initializer);\n builder.SetInsertPoint(bb);\n\n initializer->arg_begin()->setName(\"s\");\n\n builder.CreateCall(set_var_count, llvm::ArrayRef<llvm::Value*> { builder.getInt32(module->vars()->size()) });\n\n for (auto &proc: *module->procs()) {\n builder.CreateCall(push_process, llvm::ArrayRef<llvm::Value*> { transpile_process(proc), initializer->arg_begin() });\n }\n\n builder.CreateRetVoid();\n\n fs->close();\n\n return m;\n}\n"},"prefix":{"kind":"string","value":"#include <transpiler/transpiler.h>\n#include <llvm/IR/TypeBuilder.h>\n\n#include <queue>\n#include <set>\n#include <sstream>\n#include <iostream>\n\nusing namespace std;\nusing namespace afbd;\n\nvoid print_common_header(fstream &fs) {\n \n}\n\nshared_ptr<set<shared_ptr<Instruction>>> get_all_instrs(shared_ptr<Instruction> root) {\n auto _instrs = make_shared<set<shared_ptr<Instruction>>>();\n queue<shared_ptr<Instruction>> _instr_to_visit;\n\n _instrs->insert(root);\n _instr_to_visit.push(root);\n while (!_instr_to_visit.empty()) {\n auto u = _instr_to_visit.front();\n _instr_to_visit.pop();\n\n for (auto& e: *u->succs()) {\n auto nx = e.first;\n\n if (_instrs->find(nx) == _instrs->end()) {\n _instrs->insert(nx);\n _instr_to_visit.push(nx);\n }\n }\n }\n\n return _instrs;\n}\n\nllvm::Function *Transpiler::transpile_process(shared_ptr<Process> proc) {\n std::ostringstream ss;\n ss << \"process_\" << rand() << \"_\" << time(nullptr);\n auto process = llvm::Function::Create(\n process_type,\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n ss.str(),\n m\n );\n\n llvm::IRBuilder<> builder(context);\n\n auto bbEntry = llvm::BasicBlock::Create(context, \"\", process);\n auto bbLoop = llvm::BasicBlock::Create(context, \"\", process);\n llvm::BasicBlock* bbEnd;\n\n if (proc->type() == ProcessType::Always) {\n bbEnd = bbLoop;\n } else {\n bbEnd = llvm::BasicBlock::Create(context, \"\", process);\n }\n\n builder.SetInsertPoint(bbEntry);\n\n auto sim = process->arg_begin();\n map<shared_ptr<Var>, llvm::Value*> varAddr;\n for (auto &v: *var_id) {\n varAddr[v.first] = builder.CreateInBoundsGEP(sim, llvm::ArrayRef<llvm::Value*> {\n builder.getInt32(0),\n builder.getInt32(v.second)\n });\n }\n\n function<llvm::Value*(shared_ptr<Expr>)> eval = [&](shared_ptr<Expr> expr) -> llvm::Value* {\n auto type = expr->type();\n\n if (type == ExprType::VAR) {\n return builder.CreateLoad(varAddr[expr->as_var()]);\n } else if (type == ExprType::CONSTANT) {\n return builder.getInt32(expr->as_constant()->value());\n } else {\n if (type == ExprType::NOT) {\n return builder.CreateNot(eval(expr->get_operand(0)));\n } else if (type == ExprType::REDUCE_BOOL) {\n return builder.CreateIntCast(eval(expr->get_operand(0)), builder.getInt32Ty(), false);\n } else if (type == ExprType::COND) {\n return builder.CreateSelect(eval(expr->get_operand(0)), eval(expr->get_operand(1)), eval(expr->get_operand(2)));\n } else {\n auto opl = eval(expr->get_operand(0));\n auto opr = eval(expr->get_operand(1));\n\n \n\n switch (type) {\n case ExprType::ADD:\n return builder.CreateAdd(opl, opr);\n case ExprType::SUB:\n return builder.CreateSub(opl, opr);\n case ExprType::MUL:\n return builder.CreateMul(opl, opr);\n case ExprType::DIV:\n return builder.CreateUDiv(opl, opr);\n case ExprType::MOD:\n return builder.CreateURem(opl, opr);\n case ExprType::EQ:\n return builder.CreateICmpEQ(opl, opr);\n case ExprType::NE:\n return builder.CreateICmpNE(opl, opr);\n case ExprType::GT:\n return builder.CreateICmpUGT(opl, opr);\n case ExprType::GE:\n return builder.CreateICmpUGE(opl, opr);\n case ExprType::LT:\n return builder.CreateICmpULT(opl, opr);\n case ExprType::LE:\n return builder.CreateICmpULE(opl, opr);\n case ExprType::AND:\n return builder.CreateAnd(opl, opr);\n case ExprType::OR:\n return builder.CreateOr(opl, opr);\n case ExprType::XOR:\n return builder.CreateXor(opl, opr);\n case ExprType::SHL:\n return builder.CreateShl(opl, opr);\n case ExprType::LSHR:\n return builder.CreateLShr(opl, opr);\n case ExprType::ASHR:\n return builder.CreateAShr(opl, opr);\n }\n }\n }\n };\n\n function<llvm::Value*(llvm::Value*, int32_t)> shrink_to_width = [&](llvm::Value *v, int32_t width) -> llvm::Value* {\n return builder.CreateAnd(v, builder.getInt32((uint32_t)((1ull << width) - 1)));\n };\n\n auto instrs = get_all_instrs(proc->begin());\n map<shared_ptr<Instruction>, llvm::BasicBlock*> instr_bb;\n for (auto &x: *instrs) {\n instr_bb[x] = llvm::BasicBlock::Create(context, \"\", process);\n }\n\n builder.CreateBr(bbLoop);\n builder.SetInsertPoint(bbLoop);\n builder.CreateBr(instr_bb[proc->begin()]);\n\n for (auto &x: *instrs) {\n builder.SetInsertPoint(instr_bb[x]);\n\n auto type = x->type();\n auto instr_delay = x->delay();\n auto has_delay = instr_delay >= 0;\n instr_delay = has_delay ? instr_delay : 0;\n\n if (type == InstructionType::Delay) {\n if (instr_delay > 0) {\n builder.CreateCall(delay, llvm::ArrayRef<llvm::Value*> { builder.getInt32(instr_delay) });\n }\n } else if (type == InstructionType::Trigger) {\n if"},"suffix":{"kind":"string","value":"\n process_type = llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{sim_type->getPointerTo()},\n false\n );\n\n set_var_count = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{varIdTy},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"set_var_count\",\n m\n );\n\n push_process = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{process_type->getPointerTo(), sim_type->getPointerTo()},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"push_process\",\n m\n );\n\n process_end = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"process_end\",\n m\n );\n\n reset = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"reset\",\n m\n );\n\n delay = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { tickTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delay\",\n m\n );\n\n delay_for_explicit_zero_delay = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delay_for_explicit_zero_delay\",\n m\n );\n\n delay_for_nonblocking_assign_update = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { tickTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delay_for_nonblocking_assign_update\",\n m\n );\n\n delayed_nonblocking_assign_update = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { valPtrTy, valTy, varIdTy, tickTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"delayed_nonblocking_assign_update\",\n m\n );\n\n prepare_wait = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"prepare_wait\",\n m\n );\n\n add_wait = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{ varIdTy, edgeTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"add_wait\",\n m\n );\n\n do_wait = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type *>{},\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"do_wait\",\n m\n );\n\n update = llvm::Function::Create(\n llvm::FunctionType::get(\n voidTy,\n llvm::ArrayRef<llvm::Type*> { valPtrTy, valTy, varIdTy },\n false\n ),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"update\",\n m\n );\n}\n\nllvm::Module *Transpiler::transpile(shared_ptr<Module> module, shared_ptr<fstream> fs) {\n auto simName = \"sim_\" + module->name();\n m = new llvm::Module(\"sim_\" + simName, context);\n llvm::IRBuilder<> builder(context);\n\n print_common_header(*fs);\n\n var_id = make_shared<map<shared_ptr<Var>, int>>();\n\n *fs << \"struct \" << simName << \" {\" << endl;\n\n vector<llvm::Type *> member;\n for (auto &var: *module->vars()) {\n (*var_id)[var] = member.size();\n member.push_back(builder.getInt32Ty());\n *fs << \"int \" << *var->name() << \";\" << endl;\n }\n\n *fs << \"};\" << endl;\n\n sim_type = llvm::StructType::create(context, llvm::ArrayRef<llvm::Type *>(member), simName);\n auto initializer = llvm::Function::Create(\n llvm::FunctionType::get(builder.getVoidTy(), llvm::ArrayRef<llvm::Type *>{sim_type->getPointerTo()}, false),\n llvm::GlobalValue::LinkageTypes::ExternalLinkage,\n \"initialize_sim\",\n m\n );\n\n *fs << \"extern \\\"C\\\" void initialize_sim(\" << simName << \"*);\" << endl;\n\n load_static_functions();\n\n auto bb = llvm::BasicBlock::Create(context, \"\", initializer);\n builder.SetInsertPoint(bb);\n\n initializer->arg_begin()->setName(\"s\");\n\n builder.CreateCall(set_var_count, llvm::ArrayRef<llvm::Value*> { builder.getInt32(module->vars()->size()) });\n\n for (auto &proc: *module->procs()) {\n builder.CreateCall(push_process, llvm::ArrayRef<llvm::Value*> { transpile_process(proc), initializer->arg_begin() });\n }\n\n builder.CreateRetVoid();\n\n fs->close();\n\n return m;\n}\n"},"middle":{"kind":"string","value":" (x->triggers()->size() > 0) {\n builder.CreateCall(prepare_wait);\n for (auto &w: *x->triggers()) {\n builder.CreateCall(\n add_wait,\n llvm::ArrayRef<llvm::Value*> {\n builder.getInt32(var_id->at(w.first)),\n builder.getInt32((int32_t)w.second),\n }\n );\n }\n builder.CreateCall(do_wait);\n }\n } else {\n auto assign_type = x->assign_type();\n auto dst = x->dst()->as_var();\n\n if (assign_type == AssignType::Blocking) {\n if (has_delay) {\n auto temp = builder.CreateAlloca(builder.getInt32Ty());\n builder.CreateStore(shrink_to_width(eval(x->expr()), dst->bit()), temp);\n if (instr_delay == 0) {\n builder.CreateCall(delay_for_explicit_zero_delay);\n } else {\n builder.CreateCall(delay, llvm::ArrayRef<llvm::Value*> { builder.getInt32(instr_delay) });\n }\n builder.CreateCall(\n update,\n llvm::ArrayRef<llvm::Value*> {\n varAddr[x->dst()->as_var()],\n builder.CreateLoad(temp),\n builder.getInt32(var_id->at(dst)),\n }\n );\n } else {\n builder.CreateCall(\n update,\n llvm::ArrayRef<llvm::Value*> {\n varAddr[x->dst()->as_var()],\n shrink_to_width(eval(x->expr()), dst->bit()),\n builder.getInt32(var_id->at(dst)),\n }\n );\n }\n } else {\n builder.CreateCall(\n delayed_nonblocking_assign_update,\n llvm::ArrayRef<llvm::Value*> {\n varAddr[x->dst()->as_var()],\n shrink_to_width(eval(x->expr()), dst->bit()),\n builder.getInt32(var_id->at(dst)),\n builder.getInt32(instr_delay),\n }\n );\n }\n }\n\n auto bbcd = llvm::BasicBlock::Create(context, \"\", process);\n builder.CreateBr(bbcd);\n builder.SetInsertPoint(bbcd);\n\n bool end = false;\n for (auto &s: *x->succs()) {\n auto instr = s.first;\n auto cond = s.second;\n\n if (cond == nullptr) { \n builder.CreateBr(instr_bb[instr]);\n end = true;\n break;\n } else {\n bbcd = llvm::BasicBlock::Create(context, \"\", process);\n builder.CreateCondBr(eval(cond), instr_bb[instr], bbcd);\n builder.SetInsertPoint(bbcd);\n }\n }\n\n if (!end) builder.CreateBr(bbEnd);\n }\n\n if (bbEnd != bbLoop) {\n builder.SetInsertPoint(bbEnd);\n builder.CreateCall(process_end);\n builder.CreateRetVoid();\n }\n\n return process;\n}\n\nvoid Transpiler::load_static_functions() {\n auto voidTy = llvm::TypeBuilder<void, false>::get(context);\n auto tickTy = llvm::TypeBuilder<int32_t, false>::get(context);\n auto valTy = llvm::TypeBuilder<int32_t, false>::get(context);\n auto valPtrTy = valTy->getPointerTo();\n auto varIdTy = llvm::TypeBuilder<int32_t, false>::get(context);\n auto edgeTy = llvm::TypeBuilder<int32_t, false>::get(context);\n"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class SigSet<T, typename std::enable_if<!std::is_pointer<T>::value>::type> : public SigSet<T, std::less<T>> {};\n\ntemplate<typename T>\n\nusing sort_by_name_id_guard = typename std::enable_if<std::is_same<T,RTLIL::Cell*>::value>::type;\n\ntemplate<typename T>\n","file_path":"3rd/yosys/include/sigtools.h","rank":0,"score":180007.15396701597},{"content":"struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleObjectType,\n\n typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":1,"score":179867.43734223006},{"content":"\t\tAstNodeType type;\n","file_path":"3rd/yosys/include/ast.h","rank":2,"score":163788.14090654557},{"content":"using std::max;\n","file_path":"3rd/yosys/include/yosys.h","rank":3,"score":163632.2245210259},{"content":"struct is_complete_type : std::false_type {};\n\n\n\ntemplate <typename T>\n","file_path":"3rd/include/json/json.hpp","rank":4,"score":156990.97360035335},{"content":"enum ProcessType {\n\n Initial,\n\n Always,\n\n};\n\n\n\n//std::string proc_type_to_str(ProcessType type);\n\n\n\nProcessType str_to_proc_type(std::string str);\n\n\n\n#define MAX_INST_NUM 10000\n\n\n","file_path":"include/afbdil/process.h","rank":5,"score":156754.22649043097},{"content":"struct is_compatible_type_impl: std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleType>\n","file_path":"3rd/include/json/json.hpp","rank":6,"score":153349.00334085766},{"content":"enum class ExprType {\n\n //terminal\n\n CONSTANT,\n\n VAR,\n\n\n\n //non-terminal\n\n ADD,\n\n SUB,\n\n MUL,\n\n DIV,\n\n MOD,\n\n SHL,\n\n LSHR,\n\n ASHR,\n\n\n\n AND,\n\n OR,\n\n XOR,\n\n NOT,\n\n\n","file_path":"include/afbdil/expr.h","rank":7,"score":151765.98218634046},{"content":"struct is_constructible_object_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleObjectType>\n","file_path":"3rd/include/json/json.hpp","rank":8,"score":149904.79958923694},{"content":"struct is_compatible_string_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleStringType>\n","file_path":"3rd/include/json/json.hpp","rank":9,"score":149904.79958923694},{"content":"struct is_compatible_object_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleObjectType>\n","file_path":"3rd/include/json/json.hpp","rank":10,"score":149904.79958923694},{"content":"struct is_constructible_array_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleArrayType>\n","file_path":"3rd/include/json/json.hpp","rank":11,"score":149904.79958923694},{"content":"struct is_compatible_integer_type_impl : std::false_type {};\n\n\n\ntemplate <typename RealIntegerType, typename CompatibleNumberIntegerType>\n","file_path":"3rd/include/json/json.hpp","rank":12,"score":149904.79958923694},{"content":"struct is_compatible_array_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleArrayType>\n","file_path":"3rd/include/json/json.hpp","rank":13,"score":149904.79958923694},{"content":"struct is_constructible_string_type_impl : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleStringType>\n","file_path":"3rd/include/json/json.hpp","rank":14,"score":149904.79958923694},{"content":"struct has_to_json : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename T>\n","file_path":"3rd/include/json/json.hpp","rank":15,"score":147192.7048842536},{"content":"struct has_from_json : std::false_type {};\n\n\n\ntemplate <typename BasicJsonType, typename T>\n","file_path":"3rd/include/json/json.hpp","rank":16,"score":147192.7048842536},{"content":" class NumberIntegerType = std::int64_t,\n","file_path":"3rd/include/json/json.hpp","rank":17,"score":143174.19757787322},{"content":"struct is_constructible_tuple : std::false_type {};\n\n\n\ntemplate <typename T1, typename... Args>\n","file_path":"3rd/include/json/json.hpp","rank":18,"score":143174.19757787322},{"content":"struct is_iterator_traits : std::false_type {};\n\n\n\ntemplate <typename T>\n","file_path":"3rd/include/json/json.hpp","rank":19,"score":143174.19757787322},{"content":" class NumberUnsignedType = std::uint64_t,\n","file_path":"3rd/include/json/json.hpp","rank":20,"score":143174.19757787322},{"content":"class Process {\n\n std::shared_ptr<Instruction> _begin;\n\n ProcessType _type;\n\npublic:\n\n Process();\n\n\n\n int inst_num;\n\n\n\n [[nodiscard]]\n\n ProcessType type() const;\n\n\n\n void type(ProcessType type);\n\n\n\n [[nodiscard]]\n\n std::shared_ptr<Instruction> begin() const;\n\n void begin(const std::shared_ptr<Instruction> &begin);\n\n\n\n std::shared_ptr<Process> substitute_clone(std::map<std::shared_ptr<Var>, std::shared_ptr<Expr>>& substitute_map);\n\n\n\n\tjson11::Json to_json();\n\n\n\n std::vector<std::shared_ptr<Instruction>> all_instructions();\n\n\n\n void to_smv(std::vector<std::shared_ptr<Expr>>& expressions, std::map<std::shared_ptr<Var>, int>& vars_next, std::map<std::shared_ptr<Var>, int>& vars_init, std::set<std::shared_ptr<Var>>& edge_vars, std::vector<std::pair<int, std::shared_ptr<Expr>>>& countdowns, std::vector<std::shared_ptr<Var>>& vars, int& temp_var_num, std::set<std::string>& conditions);\n\n};\n\n\n\n}\n","file_path":"include/afbdil/process.h","rank":21,"score":142358.58824152095},{"content":"class Expr {\n\n ExprType _type;\n\n std::shared_ptr<std::vector<std::shared_ptr<Expr>>> _operands;\n\n std::shared_ptr<Var> _var;\n\n std::shared_ptr<Constant> _constant;\n\n\n\npublic:\n\n Expr(std::shared_ptr<Var> var);\n\n Expr(std::shared_ptr<Constant> constant);\n\n Expr(ExprType type, std::initializer_list<std::shared_ptr<Expr>> operands);\n\n Expr(ExprType type, std::vector<std::shared_ptr<Expr>> operands);\n\n\n\n ExprType type() const;\n\n std::shared_ptr<Var> as_var() const;\n\n std::shared_ptr<Constant> as_constant() const;\n\n int operand_num() const;\n\n std::shared_ptr<Expr>& get_operand(int i) const;\n\n inline void add_operand(std::shared_ptr<Expr> operand) { _operands->push_back(operand); }\n\n\n\n bool is_true() const;\n","file_path":"include/afbdil/expr.h","rank":22,"score":142324.04959020176},{"content":" class StringType = std::string, class BooleanType = bool,\n","file_path":"3rd/include/json/json.hpp","rank":23,"score":139968.33736120502},{"content":"struct has_non_default_from_json : std::false_type {};\n\n\n\ntemplate<typename BasicJsonType, typename T>\n","file_path":"3rd/include/json/json.hpp","rank":24,"score":139405.9794356057},{"content":"class SigSet<T, sort_by_name_id_guard<T>> : public SigSet<T, RTLIL::sort_by_name_id<typename std::remove_pointer<T>::type>> {};\n\n\n","file_path":"3rd/yosys/include/sigtools.h","rank":25,"score":138162.99222854446},{"content":"class Process;\n","file_path":"include/afbdil/def.h","rank":26,"score":130225.17623551063},{"content":"class Expr;\n","file_path":"include/afbdil/def.h","rank":27,"score":130197.26789711507},{"content":"using namespace afbd;\n","file_path":"include/afbdil/patternmatching.h","rank":28,"score":129017.14243532556},{"content":"USING_YOSYS_NAMESPACE\n\n\n\nnamespace afbd\n\n{\n\n\ttypedef std::pair<std::shared_ptr<Expr>, std::shared_ptr<Expr>> ExprPair;\n\n\n\n\tstruct afbdilPass : public Pass\n\n\t{\n\n\t\tafbdilPass() : Pass(\"afbdilPass\") { }\n\n\n\n\t\tstd::map<std::string, std::shared_ptr<Module>> str2module;\n\n\t\tstd::vector<std::shared_ptr<Module>> unfolded_modules;\n\n\t\tstd::map<std::shared_ptr<Module>, int> module_occurence;\n\n\n\n\t\tstd::shared_ptr<Expr> parse_identifier(AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr);\n\n\t\tstd::shared_ptr<Expr> parse_constant(AST::AstNode* astnode);\n\n\t\tExprPair parse_range(AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr);\n\n\t\tstd::shared_ptr<Expr> parse_expr(AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr);\n\n\t\tstd::shared_ptr<Instruction> parse_block(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond);\n\n\t\tstd::shared_ptr<Instruction> parse_assign(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond, bool is_blocking);\n\n\t\tstd::shared_ptr<Instruction> parse_case(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond);\n\n\t\tstd::shared_ptr<Instruction> parse_statement(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond);\n\n\n\n void execute(vector<string> args, RTLIL::Design* design) override;\n\n\n\n\t\tvoid execute_cell(std::shared_ptr<Module>& curr, std::shared_ptr<std::vector<std::shared_ptr<Expr>>>& cell_vector);\n\n\n\n std::shared_ptr<Module> res;\n\n\t};\n","file_path":"include/transpiler/afbdilpass.h","rank":29,"score":129017.14243532556},{"content":"struct is_basic_json<NLOHMANN_BASIC_JSON_TPL> : std::true_type {};\n\n\n\n//////////////////////////\n\n// aliases for detected //\n\n//////////////////////////\n\n\n\ntemplate <typename T>\n\nusing mapped_type_t = typename T::mapped_type;\n\n\n\ntemplate <typename T>\n\nusing key_type_t = typename T::key_type;\n\n\n\ntemplate <typename T>\n\nusing value_type_t = typename T::value_type;\n\n\n\ntemplate <typename T>\n\nusing difference_type_t = typename T::difference_type;\n\n\n\ntemplate <typename T>\n\nusing pointer_t = typename T::pointer;\n","file_path":"3rd/include/json/json.hpp","rank":30,"score":126606.10024646524},{"content":"YOSYS_NAMESPACE_BEGIN\n\n\n","file_path":"3rd/yosys/include/yosys.h","rank":31,"score":124736.54234612796},{"content":"YOSYS_NAMESPACE_BEGIN\n\n\n\nnamespace AST\n\n{\n\n\t// all node types, type2str() must be extended\n\n\t// whenever a new node type is added here\n\n\tenum AstNodeType\n\n\t{\n\n\t\tAST_NONE,\n\n\t\tAST_DESIGN,\n\n\t\tAST_MODULE,\n\n\t\tAST_TASK,\n\n\t\tAST_FUNCTION,\n\n\t\tAST_DPI_FUNCTION,\n\n\n\n\t\tAST_WIRE,\n\n\t\tAST_MEMORY,\n\n\t\tAST_AUTOWIRE,\n\n\t\tAST_PARAMETER,\n\n\t\tAST_LOCALPARAM,\n\n\t\tAST_DEFPARAM,\n\n\t\tAST_PARASET,\n\n\t\tAST_ARGUMENT,\n\n\t\tAST_RANGE,\n\n\t\tAST_MULTIRANGE,\n\n\t\tAST_CONSTANT,\n\n\t\tAST_REALVALUE,\n\n\t\tAST_CELLTYPE,\n\n\t\tAST_IDENTIFIER,\n\n\t\tAST_PREFIX,\n\n\t\tAST_ASSERT,\n\n\t\tAST_ASSUME,\n\n\t\tAST_LIVE,\n\n\t\tAST_FAIR,\n\n\t\tAST_COVER,\n\n\t\tAST_ENUM,\n\n\t\tAST_ENUM_ITEM,\n\n\n\n\t\tAST_FCALL,\n\n\t\tAST_TO_BITS,\n\n\t\tAST_TO_SIGNED,\n\n\t\tAST_TO_UNSIGNED,\n\n\t\tAST_CONCAT,\n\n\t\tAST_REPLICATE,\n\n\t\tAST_BIT_NOT,\n\n\t\tAST_BIT_AND,\n\n\t\tAST_BIT_OR,\n\n\t\tAST_BIT_XOR,\n\n\t\tAST_BIT_XNOR,\n\n\t\tAST_REDUCE_AND,\n\n\t\tAST_REDUCE_OR,\n\n\t\tAST_REDUCE_XOR,\n\n\t\tAST_REDUCE_XNOR,\n\n\t\tAST_REDUCE_BOOL,\n\n\t\tAST_SHIFT_LEFT,\n\n\t\tAST_SHIFT_RIGHT,\n\n\t\tAST_SHIFT_SLEFT,\n\n\t\tAST_SHIFT_SRIGHT,\n\n\t\tAST_LT,\n\n\t\tAST_LE,\n\n\t\tAST_EQ,\n\n\t\tAST_NE,\n\n\t\tAST_EQX,\n\n\t\tAST_NEX,\n\n\t\tAST_GE,\n\n\t\tAST_GT,\n\n\t\tAST_ADD,\n\n\t\tAST_SUB,\n\n\t\tAST_MUL,\n\n\t\tAST_DIV,\n\n\t\tAST_MOD,\n\n\t\tAST_POW,\n\n\t\tAST_POS,\n\n\t\tAST_NEG,\n\n\t\tAST_LOGIC_AND,\n\n\t\tAST_LOGIC_OR,\n\n\t\tAST_LOGIC_NOT,\n\n\t\tAST_TERNARY,\n\n\t\tAST_MEMRD,\n\n\t\tAST_MEMWR,\n\n\t\tAST_MEMINIT,\n\n\n\n\t\tAST_TCALL,\n\n\t\tAST_ASSIGN,\n\n\t\tAST_CELL,\n\n\t\tAST_PRIMITIVE,\n\n\t\tAST_CELLARRAY,\n\n\t\tAST_ALWAYS,\n\n\t\tAST_INITIAL,\n\n\t\tAST_BLOCK,\n\n\t\tAST_ASSIGN_EQ,\n\n\t\tAST_ASSIGN_LE,\n\n\t\tAST_CASE,\n\n\t\tAST_COND,\n\n\t\tAST_CONDX,\n\n\t\tAST_CONDZ,\n\n\t\tAST_DEFAULT,\n\n\t\tAST_FOR,\n\n\t\tAST_WHILE,\n\n\t\tAST_REPEAT,\n\n\n\n\t\tAST_GENVAR,\n\n\t\tAST_GENFOR,\n\n\t\tAST_GENIF,\n\n\t\tAST_GENCASE,\n\n\t\tAST_GENBLOCK,\n\n\t\tAST_TECALL,\n\n\t\t\n\n\t\tAST_POSEDGE,\n\n\t\tAST_NEGEDGE,\n\n\t\tAST_EDGE,\n\n\n\n\t\tAST_INTERFACE,\n\n\t\tAST_INTERFACEPORT,\n\n\t\tAST_INTERFACEPORTTYPE,\n\n\t\tAST_MODPORT,\n\n\t\tAST_MODPORTMEMBER,\n\n\t\tAST_PACKAGE,\n\n\n\n\t\tAST_WIRETYPE,\n\n\t\tAST_TYPEDEF\n\n\t};\n\n\n\n\tstruct AstSrcLocType {\n\n\t\tunsigned int first_line, last_line;\n\n\t\tunsigned int first_column, last_column;\n\n\t\tAstSrcLocType() : first_line(0), last_line(0), first_column(0), last_column(0) {}\n\n\t\tAstSrcLocType(int _first_line, int _first_column, int _last_line, int _last_column) : first_line(_first_line), last_line(_last_line), first_column(_first_column), last_column(_last_column) {}\n\n\t};\n\n\n\n\t// convert an node type to a string (e.g. for debug output)\n\n\tstd::string type2str(AstNodeType type);\n\n\n\n\t// The AST is built using instances of this struct\n\n\tstruct AstNode\n\n\t{\n\n\t\t// for dict<> and pool<>\n\n\t\tunsigned int hashidx_;\n\n\t\tunsigned int hash() const { return hashidx_; }\n\n\n\n\t\tint during_delay;\n\n\t\tint after_delay;\n\n\n\n\t\t// this nodes type\n\n\t\tAstNodeType type;\n\n\n\n\t\t// the list of child nodes for this node\n\n\t\tstd::vector<AstNode*> children;\n\n\n\n\t\t// the list of attributes assigned to this node\n\n\t\tstd::map<RTLIL::IdString, AstNode*> attributes;\n\n\t\tbool get_bool_attribute(RTLIL::IdString id);\n\n\n\n\t\t// node content - most of it is unused in most node types\n\n\t\tstd::string str;\n\n\t\tstd::vector<RTLIL::State> bits;\n\n\t\tbool is_input, is_output, is_reg, is_logic, is_signed, is_string, is_wand, is_wor, range_valid, range_swapped, was_checked, is_unsized, is_custom_type;\n\n\t\tint port_id, range_left, range_right;\n\n\t\tuint32_t integer;\n\n\t\tdouble realvalue;\n\n\t\t// set for IDs typed to an enumeration, not used\n\n\t\tbool is_enum;\n\n\n\n\t\t// if this is a multirange memory then this vector contains offset and length of each dimension\n\n\t\tstd::vector<int> multirange_dimensions;\n\n\n\n\t\t// this is set by simplify and used during RTLIL generation\n\n\t\tAstNode *id2ast;\n\n\n\n\t\t// this is used by simplify to detect if basic analysis has been performed already on the node\n\n\t\tbool basic_prep;\n\n\n\n\t\t// this is the original sourcecode location that resulted in this AST node\n\n\t\t// it is automatically set by the constructor using AST::current_filename and\n\n\t\t// the AST::get_line_num() callback function.\n\n\t\tstd::string filename;\n\n\t\tAstSrcLocType location;\n\n\n\n\t\t// creating and deleting nodes\n\n\t\tAstNode(AstNodeType type = AST_NONE, AstNode *child1 = NULL, AstNode *child2 = NULL, AstNode *child3 = NULL);\n\n\t\tAstNode *clone() const;\n\n\t\tvoid cloneInto(AstNode *other) const;\n\n\t\tvoid delete_children();\n\n\t\t~AstNode();\n\n\n\n\t\tenum mem2reg_flags\n\n\t\t{\n\n\t\t\t/* status flags */\n\n\t\t\tMEM2REG_FL_ALL = 0x00000001,\n\n\t\t\tMEM2REG_FL_ASYNC = 0x00000002,\n\n\t\t\tMEM2REG_FL_INIT = 0x00000004,\n\n\n\n\t\t\t/* candidate flags */\n\n\t\t\tMEM2REG_FL_FORCED = 0x00000100,\n\n\t\t\tMEM2REG_FL_SET_INIT = 0x00000200,\n\n\t\t\tMEM2REG_FL_SET_ELSE = 0x00000400,\n\n\t\t\tMEM2REG_FL_SET_ASYNC = 0x00000800,\n\n\t\t\tMEM2REG_FL_EQ2 = 0x00001000,\n\n\t\t\tMEM2REG_FL_CMPLX_LHS = 0x00002000,\n\n\t\t\tMEM2REG_FL_CONST_LHS = 0x00004000,\n\n\t\t\tMEM2REG_FL_VAR_LHS = 0x00008000,\n\n\n\n\t\t\t/* proc flags */\n\n\t\t\tMEM2REG_FL_EQ1 = 0x01000000,\n\n\t\t};\n\n\n\n\t\t// simplify() creates a simpler AST by unrolling for-loops, expanding generate blocks, etc.\n\n\t\t// it also sets the id2ast pointers so that identifier lookups are fast in genRTLIL()\n\n\t\tbool simplify(bool const_fold, bool at_zero, bool in_lvalue, int stage, int width_hint, bool sign_hint, bool in_param);\n\n\t\tAstNode *readmem(bool is_readmemh, std::string mem_filename, AstNode *memory, int start_addr, int finish_addr, bool unconditional_init);\n\n\t\tvoid expand_genblock(std::string index_var, std::string prefix, std::map<std::string, std::string> &name_map);\n\n\t\tvoid replace_ids(const std::string &prefix, const std::map<std::string, std::string> &rules);\n\n\t\tvoid mem2reg_as_needed_pass1(dict<AstNode*, pool<std::string>> &mem2reg_places,\n\n\t\t\t\tdict<AstNode*, uint32_t> &mem2reg_flags, dict<AstNode*, uint32_t> &proc_flags, uint32_t &status_flags);\n\n\t\tbool mem2reg_as_needed_pass2(pool<AstNode*> &mem2reg_set, AstNode *mod, AstNode *block, AstNode *&async_block);\n\n\t\tbool mem2reg_check(pool<AstNode*> &mem2reg_set);\n\n\t\tvoid mem2reg_remove(pool<AstNode*> &mem2reg_set, vector<AstNode*> &delnodes);\n\n\t\tvoid meminfo(int &mem_width, int &mem_size, int &addr_bits);\n\n\n\n\t\t// additional functionality for evaluating constant functions\n\n\t\tstruct varinfo_t { RTLIL::Const val; int offset; bool is_signed; };\n\n\t\tbool has_const_only_constructs(bool &recommend_const_eval);\n\n\t\tvoid replace_variables(std::map<std::string, varinfo_t> &variables, AstNode *fcall);\n\n\t\tAstNode *eval_const_function(AstNode *fcall);\n\n\t\tbool is_simple_const_expr();\n\n\t\tstd::string process_format_str(const std::string &sformat, int next_arg, int stage, int width_hint, bool sign_hint);\n\n\n\n\t\t// create a human-readable text representation of the AST (for debugging)\n\n\t\tvoid dumpAst(FILE *f, std::string indent) const;\n\n\t\tvoid dumpVlog(FILE *f, std::string indent) const;\n\n\n\n\t\t// used by genRTLIL() for detecting expression width and sign\n\n\t\tvoid detectSignWidthWorker(int &width_hint, bool &sign_hint, bool *found_real = NULL);\n\n\t\tvoid detectSignWidth(int &width_hint, bool &sign_hint, bool *found_real = NULL);\n\n\n\n\t\t// create RTLIL code for this AST node\n\n\t\t// for expressions the resulting signal vector is returned\n\n\t\t// all generated cell instances, etc. are written to the RTLIL::Module pointed to by AST_INTERNAL::current_module\n\n\t\tRTLIL::SigSpec genRTLIL(int width_hint = -1, bool sign_hint = false);\n\n\t\tRTLIL::SigSpec genWidthRTLIL(int width, const dict<RTLIL::SigBit, RTLIL::SigBit> *new_subst_ptr = NULL);\n\n\n\n\t\t// compare AST nodes\n\n\t\tbool operator==(const AstNode &other) const;\n\n\t\tbool operator!=(const AstNode &other) const;\n\n\t\tbool contains(const AstNode *other) const;\n\n\n\n\t\t// helper functions for creating AST nodes for constants\n\n\t\tstatic AstNode *mkconst_int(uint32_t v, bool is_signed, int width = 32);\n\n\t\tstatic AstNode *mkconst_bits(const std::vector<RTLIL::State> &v, bool is_signed, bool is_unsized);\n\n\t\tstatic AstNode *mkconst_bits(const std::vector<RTLIL::State> &v, bool is_signed);\n\n\t\tstatic AstNode *mkconst_str(const std::vector<RTLIL::State> &v);\n\n\t\tstatic AstNode *mkconst_str(const std::string &str);\n\n\n\n\t\t// helper function for creating sign-extended const objects\n\n\t\tRTLIL::Const bitsAsConst(int width, bool is_signed);\n\n\t\tRTLIL::Const bitsAsConst(int width = -1);\n\n\t\tRTLIL::Const bitsAsUnsizedConst(int width);\n\n\t\tRTLIL::Const asAttrConst();\n\n\t\tRTLIL::Const asParaConst();\n\n\t\tuint64_t asInt(bool is_signed);\n\n\t\tbool bits_only_01() const;\n\n\t\tbool asBool() const;\n\n\n\n\t\t// helper functions for real valued const eval\n\n\t\tint isConst() const; // return '1' for AST_CONSTANT and '2' for AST_REALVALUE\n\n\t\tdouble asReal(bool is_signed);\n\n\t\tRTLIL::Const realAsConst(int width);\n\n\n\n\t\t// helpers for enum\n\n\t\tvoid allocateDefaultEnumValues();\n\n\t};\n\n\n\n\t// process an AST tree (ast must point to an AST_DESIGN node) and generate RTLIL code\n\n\tvoid process(RTLIL::Design *design, AstNode *ast, bool dump_ast1, bool dump_ast2, bool no_dump_ptr, bool dump_vlog1, bool dump_vlog2, bool dump_rtlil, bool nolatches, bool nomeminit,\n\n\t\t\tbool nomem2reg, bool mem2reg, bool noblackbox, bool lib, bool nowb, bool noopt, bool icells, bool pwires, bool nooverwrite, bool overwrite, bool defer, bool autowire);\n\n\n\n\t// parametric modules are supported directly by the AST library\n\n\t// therefore we need our own derivate of RTLIL::Module with overloaded virtual functions\n\n\tstruct AstModule : RTLIL::Module {\n\n\t\tAstNode *ast;\n\n\t\tbool nolatches, nomeminit, nomem2reg, mem2reg, noblackbox, lib, nowb, noopt, icells, pwires, autowire;\n\n\t\t~AstModule() YS_OVERRIDE;\n\n\t\tRTLIL::IdString derive(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Const> parameters, bool mayfail) YS_OVERRIDE;\n\n\t\tRTLIL::IdString derive(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Const> parameters, dict<RTLIL::IdString, RTLIL::Module*> interfaces, dict<RTLIL::IdString, RTLIL::IdString> modports, bool mayfail) YS_OVERRIDE;\n\n\t\tstd::string derive_common(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Const> parameters, AstNode **new_ast_out, bool quiet = false);\n\n\t\tvoid reprocess_module(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Module *> local_interfaces) YS_OVERRIDE;\n\n\t\tRTLIL::Module *clone() const YS_OVERRIDE;\n\n\t\tvoid loadconfig() const;\n\n\t};\n\n\n\n\t// this must be set by the language frontend before parsing the sources\n\n\t// the AstNode constructor then uses current_filename and get_line_num()\n\n\t// to initialize the filename and linenum properties of new nodes\n\n\textern std::string current_filename;\n\n\textern void (*set_line_num)(int);\n\n\textern int (*get_line_num)();\n\n\n\n\t// set set_line_num and get_line_num to internal dummy functions (done by simplify() and AstModule::derive\n\n\t// to control the filename and linenum properties of new nodes not generated by a frontend parser)\n\n\tvoid use_internal_line_num();\n\n\n\n\t// call a DPI function\n\n\tAstNode *dpi_call(const std::string &rtype, const std::string &fname, const std::vector<std::string> &argtypes, const std::vector<AstNode*> &args);\n\n\n\n\t// Helper functions related to handling SystemVerilog interfaces\n\n\tstd::pair<std::string,std::string> split_modport_from_type(std::string name_type);\n\n\tAstNode * find_modport(AstNode *intf, std::string name);\n\n\tvoid explode_interface_port(AstNode *module_ast, RTLIL::Module * intfmodule, std::string intfname, AstNode *modport);\n","file_path":"3rd/yosys/include/ast.h","rank":32,"score":124732.41268810771},{"content":"void typeCheck(std::shared_ptr<afbd::Module> module);\n","file_path":"include/afbdil/patternmatching.h","rank":33,"score":124626.04926715035},{"content":"YOSYS_NAMESPACE_BEGIN\n\n\n\nnamespace RTLIL\n\n{\n\n\tenum State : unsigned char {\n\n\t\tS0 = 0,\n\n\t\tS1 = 1,\n\n\t\tSx = 2, // undefined value or conflict\n\n\t\tSz = 3, // high-impedance / not-connected\n\n\t\tSa = 4, // don't care (used only in cases)\n\n\t\tSm = 5 // marker (used internally by some passes)\n\n\t};\n\n\n\n\tenum SyncType : unsigned char {\n\n\t\tST0 = 0, // level sensitive: 0\n\n\t\tST1 = 1, // level sensitive: 1\n\n\t\tSTp = 2, // edge sensitive: posedge\n\n\t\tSTn = 3, // edge sensitive: negedge\n\n\t\tSTe = 4, // edge sensitive: both edges\n\n\t\tSTa = 5, // always active\n\n\t\tSTg = 6, // global clock\n\n\t\tSTi = 7 // init\n\n\t};\n\n\n\n\tenum ConstFlags : unsigned char {\n\n\t\tCONST_FLAG_NONE = 0,\n\n\t\tCONST_FLAG_STRING = 1,\n\n\t\tCONST_FLAG_SIGNED = 2, // only used for parameters\n\n\t\tCONST_FLAG_REAL = 4 // only used for parameters\n\n\t};\n\n\n\n\tstruct Const;\n\n\tstruct AttrObject;\n\n\tstruct Selection;\n\n\tstruct Monitor;\n\n\tstruct Design;\n\n\tstruct Module;\n\n\tstruct Wire;\n\n\tstruct Memory;\n\n\tstruct Cell;\n\n\tstruct SigChunk;\n\n\tstruct SigBit;\n\n\tstruct SigSpecIterator;\n\n\tstruct SigSpecConstIterator;\n\n\tstruct SigSpec;\n\n\tstruct CaseRule;\n\n\tstruct SwitchRule;\n\n\tstruct SyncRule;\n\n\tstruct Process;\n\n\n\n\ttypedef std::pair<SigSpec, SigSpec> SigSig;\n\n\n\n\tstruct IdString\n\n\t{\n\n\t\t#undef YOSYS_XTRACE_GET_PUT\n\n\t\t#undef YOSYS_SORT_ID_FREE_LIST\n\n\t\t#undef YOSYS_USE_STICKY_IDS\n\n\t\t#undef YOSYS_NO_IDS_REFCNT\n\n\n\n\t\t// the global id string cache\n\n\n\n\t\tstatic struct destruct_guard_t {\n\n\t\t\tbool ok; // POD, will be initialized to zero\n\n\t\t\tdestruct_guard_t() { ok = true; }\n\n\t\t\t~destruct_guard_t() { ok = false; }\n\n\t\t} destruct_guard;\n\n\n\n\t\tstatic std::vector<char*> global_id_storage_;\n\n\t\tstatic dict<char*, int, hash_cstr_ops> global_id_index_;\n\n\t#ifndef YOSYS_NO_IDS_REFCNT\n\n\t\tstatic std::vector<int> global_refcount_storage_;\n\n\t\tstatic std::vector<int> global_free_idx_list_;\n\n\t#endif\n\n\n\n\t#ifdef YOSYS_USE_STICKY_IDS\n\n\t\tstatic int last_created_idx_ptr_;\n\n\t\tstatic int last_created_idx_[8];\n\n\t#endif\n\n\n\n\t\tstatic inline void xtrace_db_dump()\n\n\t\t{\n\n\t\t#ifdef YOSYS_XTRACE_GET_PUT\n\n\t\t\tfor (int idx = 0; idx < GetSize(global_id_storage_); idx++)\n\n\t\t\t{\n\n\t\t\t\tif (global_id_storage_.at(idx) == nullptr)\n\n\t\t\t\t\tlog(\"#X# DB-DUMP index %d: FREE\\n\", idx);\n\n\t\t\t\telse\n\n\t\t\t\t\tlog(\"#X# DB-DUMP index %d: '%s' (ref %d)\\n\", idx, global_id_storage_.at(idx), global_refcount_storage_.at(idx));\n\n\t\t\t}\n\n\t\t#endif\n\n\t\t}\n\n\n\n\t\tstatic inline void checkpoint()\n\n\t\t{\n\n\t\t#ifdef YOSYS_USE_STICKY_IDS\n\n\t\t\tlast_created_idx_ptr_ = 0;\n\n\t\t\tfor (int i = 0; i < 8; i++) {\n\n\t\t\t\tif (last_created_idx_[i])\n\n\t\t\t\t\tput_reference(last_created_idx_[i]);\n\n\t\t\t\tlast_created_idx_[i] = 0;\n\n\t\t\t}\n\n\t\t#endif\n\n\t\t#ifdef YOSYS_SORT_ID_FREE_LIST\n\n\t\t\tstd::sort(global_free_idx_list_.begin(), global_free_idx_list_.end(), std::greater<int>());\n\n\t\t#endif\n\n\t\t}\n\n\n\n\t\tstatic inline int get_reference(int idx)\n\n\t\t{\n\n\t\t\tif (idx) {\n\n\t\t#ifndef YOSYS_NO_IDS_REFCNT\n\n\t\t\t\tglobal_refcount_storage_[idx]++;\n\n\t\t#endif\n\n\t\t#ifdef YOSYS_XTRACE_GET_PUT\n\n\t\t\t\tif (yosys_xtrace)\n\n\t\t\t\t\tlog(\"#X# GET-BY-INDEX '%s' (index %d, refcount %d)\\n\", global_id_storage_.at(idx), idx, global_refcount_storage_.at(idx));\n\n\t\t#endif\n\n\t\t\t}\n\n\t\t\treturn idx;\n\n\t\t}\n\n\n\n\t\tstatic int get_reference(const char *p)\n\n\t\t{\n\n\t\t\tlog_assert(destruct_guard.ok);\n\n\n\n\t\t\tif (!p[0])\n\n\t\t\t\treturn 0;\n\n\n\n\t\t\tlog_assert(p[0] == '$' || p[0] == '\\\\');\n\n\t\t\tlog_assert(p[1] != 0);\n\n\n\n\t\t\tauto it = global_id_index_.find((char*)p);\n\n\t\t\tif (it != global_id_index_.end()) {\n\n\t\t#ifndef YOSYS_NO_IDS_REFCNT\n\n\t\t\t\tglobal_refcount_storage_.at(it->second)++;\n\n\t\t#endif\n\n\t\t#ifdef YOSYS_XTRACE_GET_PUT\n\n\t\t\t\tif (yosys_xtrace)\n\n\t\t\t\t\tlog(\"#X# GET-BY-NAME '%s' (index %d, refcount %d)\\n\", global_id_storage_.at(it->second), it->second, global_refcount_storage_.at(it->second));\n\n\t\t#endif\n\n\t\t\t\treturn it->second;\n\n\t\t\t}\n\n\n\n\t\t#ifndef YOSYS_NO_IDS_REFCNT\n\n\t\t\tif (global_free_idx_list_.empty()) {\n\n\t\t\t\tif (global_id_storage_.empty()) {\n\n\t\t\t\t\tglobal_refcount_storage_.push_back(0);\n\n\t\t\t\t\tglobal_id_storage_.push_back((char*)\"\");\n\n\t\t\t\t\tglobal_id_index_[global_id_storage_.back()] = 0;\n\n\t\t\t\t}\n\n\t\t\t\tlog_assert(global_id_storage_.size() < 0x40000000);\n\n\t\t\t\tglobal_free_idx_list_.push_back(global_id_storage_.size());\n\n\t\t\t\tglobal_id_storage_.push_back(nullptr);\n\n\t\t\t\tglobal_refcount_storage_.push_back(0);\n\n\t\t\t}\n\n\n\n\t\t\tint idx = global_free_idx_list_.back();\n\n\t\t\tglobal_free_idx_list_.pop_back();\n\n\t\t\tglobal_id_storage_.at(idx) = strdup(p);\n\n\t\t\tglobal_id_index_[global_id_storage_.at(idx)] = idx;\n\n\t\t\tglobal_refcount_storage_.at(idx)++;\n\n\t\t#else\n\n\t\t\tif (global_id_storage_.empty()) {\n\n\t\t\t\tglobal_id_storage_.push_back((char*)\"\");\n\n\t\t\t\tglobal_id_index_[global_id_storage_.back()] = 0;\n\n\t\t\t}\n\n\t\t\tint idx = global_id_storage_.size();\n\n\t\t\tglobal_id_storage_.push_back(strdup(p));\n\n\t\t\tglobal_id_index_[global_id_storage_.back()] = idx;\n\n\t\t#endif\n\n\n\n\t\t\tif (yosys_xtrace) {\n\n\t\t\t\tlog(\"#X# New IdString '%s' with index %d.\\n\", p, idx);\n\n\t\t\t\tlog_backtrace(\"-X- \", yosys_xtrace-1);\n\n\t\t\t}\n\n\n\n\t\t#ifdef YOSYS_XTRACE_GET_PUT\n\n\t\t\tif (yosys_xtrace)\n\n\t\t\t\tlog(\"#X# GET-BY-NAME '%s' (index %d, refcount %d)\\n\", global_id_storage_.at(idx), idx, global_refcount_storage_.at(idx));\n\n\t\t#endif\n\n\n\n\t\t#ifdef YOSYS_USE_STICKY_IDS\n\n\t\t\t// Avoid Create->Delete->Create pattern\n\n\t\t\tif (last_created_idx_[last_created_idx_ptr_])\n\n\t\t\t\tput_reference(last_created_idx_[last_created_idx_ptr_]);\n\n\t\t\tlast_created_idx_[last_created_idx_ptr_] = idx;\n\n\t\t\tget_reference(last_created_idx_[last_created_idx_ptr_]);\n\n\t\t\tlast_created_idx_ptr_ = (last_created_idx_ptr_ + 1) & 7;\n\n\t\t#endif\n\n\n\n\t\t\treturn idx;\n\n\t\t}\n\n\n\n\t#ifndef YOSYS_NO_IDS_REFCNT\n\n\t\tstatic inline void put_reference(int idx)\n\n\t\t{\n\n\t\t\t// put_reference() may be called from destructors after the destructor of\n\n\t\t\t// global_refcount_storage_ has been run. in this case we simply do nothing.\n\n\t\t\tif (!destruct_guard.ok || !idx)\n\n\t\t\t\treturn;\n\n\n\n\t\t#ifdef YOSYS_XTRACE_GET_PUT\n\n\t\t\tif (yosys_xtrace) {\n\n\t\t\t\tlog(\"#X# PUT '%s' (index %d, refcount %d)\\n\", global_id_storage_.at(idx), idx, global_refcount_storage_.at(idx));\n\n\t\t\t}\n\n\t\t#endif\n\n\n\n\t\t\tint &refcount = global_refcount_storage_[idx];\n\n\n\n\t\t\tif (--refcount > 0)\n\n\t\t\t\treturn;\n\n\n\n\t\t\tlog_assert(refcount == 0);\n\n\n\n\t\t\tif (yosys_xtrace) {\n\n\t\t\t\tlog(\"#X# Removed IdString '%s' with index %d.\\n\", global_id_storage_.at(idx), idx);\n\n\t\t\t\tlog_backtrace(\"-X- \", yosys_xtrace-1);\n\n\t\t\t}\n\n\n\n\t\t\tglobal_id_index_.erase(global_id_storage_.at(idx));\n\n\t\t\tfree(global_id_storage_.at(idx));\n\n\t\t\tglobal_id_storage_.at(idx) = nullptr;\n\n\t\t\tglobal_free_idx_list_.push_back(idx);\n\n\t\t}\n\n\t#else\n\n\t\tstatic inline void put_reference(int) { }\n\n\t#endif\n\n\n\n\t\t// the actual IdString object is just is a single int\n\n\n\n\t\tint index_;\n\n\n\n\t\tinline IdString() : index_(0) { }\n\n\t\tinline IdString(const char *str) : index_(get_reference(str)) { }\n\n\t\tinline IdString(const IdString &str) : index_(get_reference(str.index_)) { }\n","file_path":"3rd/yosys/include/yosys_rtlil.h","rank":34,"score":120723.13157047177},{"content":"\t\tvoid detectSignWidth(int &width_hint, bool &sign_hint, bool *found_real = NULL);\n","file_path":"3rd/yosys/include/ast.h","rank":35,"score":116966.07574002919},{"content":"extern void eval_select_op(vector<RTLIL::Selection> &work, const string &op, RTLIL::Design *design);\n","file_path":"3rd/yosys/include/register.h","rank":36,"score":116964.80525650896},{"content":"\t\tAstNode *eval_const_function(AstNode *fcall);\n","file_path":"3rd/yosys/include/ast.h","rank":37,"score":116964.80525650896},{"content":"extern RTLIL::Selection eval_select_args(const vector<string> &args, RTLIL::Design *design);\n","file_path":"3rd/yosys/include/register.h","rank":38,"score":116964.80525650896},{"content":"\t\tbool is_simple_const_expr();\n","file_path":"3rd/yosys/include/ast.h","rank":39,"score":116913.89609344055},{"content":"\tclass iterator : public std::iterator<std::forward_iterator_tag, std::pair<K, T>>\n\n\t{\n\n\t\tfriend class dict;\n\n\tprotected:\n\n\t\tdict *ptr;\n\n\t\tint index;\n\n\t\titerator(dict *ptr, int index) : ptr(ptr), index(index) { }\n\n\tpublic:\n\n\t\titerator() { }\n\n\t\titerator operator++() { index--; return *this; }\n\n\t\tbool operator<(const iterator &other) const { return index > other.index; }\n\n\t\tbool operator==(const iterator &other) const { return index == other.index; }\n\n\t\tbool operator!=(const iterator &other) const { return index != other.index; }\n\n\t\tstd::pair<K, T> &operator*() { return ptr->entries[index].udata; }\n\n\t\tstd::pair<K, T> *operator->() { return &ptr->entries[index].udata; }\n\n\t\tconst std::pair<K, T> &operator*() const { return ptr->entries[index].udata; }\n\n\t\tconst std::pair<K, T> *operator->() const { return &ptr->entries[index].udata; }\n\n\t\toperator const_iterator() const { return const_iterator(ptr, index); }\n\n\t};\n\n\n","file_path":"3rd/yosys/include/hashlib.h","rank":40,"score":113924.15528256545},{"content":"\t\tvoid detectSignWidthWorker(int &width_hint, bool &sign_hint, bool *found_real = NULL);\n","file_path":"3rd/yosys/include/ast.h","rank":41,"score":113444.95392681987},{"content":"\tclass const_iterator : public std::iterator<std::forward_iterator_tag, std::pair<K, T>>\n\n\t{\n\n\t\tfriend class dict;\n\n\tprotected:\n\n\t\tconst dict *ptr;\n\n\t\tint index;\n\n\t\tconst_iterator(const dict *ptr, int index) : ptr(ptr), index(index) { }\n\n\tpublic:\n\n\t\tconst_iterator() { }\n\n\t\tconst_iterator operator++() { index--; return *this; }\n\n\t\tbool operator<(const const_iterator &other) const { return index > other.index; }\n\n\t\tbool operator==(const const_iterator &other) const { return index == other.index; }\n\n\t\tbool operator!=(const const_iterator &other) const { return index != other.index; }\n\n\t\tconst std::pair<K, T> &operator*() const { return ptr->entries[index].udata; }\n\n\t\tconst std::pair<K, T> *operator->() const { return &ptr->entries[index].udata; }\n\n\t};\n\n\n","file_path":"3rd/yosys/include/hashlib.h","rank":42,"score":112255.60473917167},{"content":"\tclass iterator : public std::iterator<std::forward_iterator_tag, K>\n\n\t{\n\n\t\tfriend class pool;\n\n\tprotected:\n\n\t\tpool *ptr;\n\n\t\tint index;\n\n\t\titerator(pool *ptr, int index) : ptr(ptr), index(index) { }\n\n\tpublic:\n\n\t\titerator() { }\n\n\t\titerator operator++() { index--; return *this; }\n\n\t\tbool operator==(const iterator &other) const { return index == other.index; }\n\n\t\tbool operator!=(const iterator &other) const { return index != other.index; }\n\n\t\tK &operator*() { return ptr->entries[index].udata; }\n\n\t\tK *operator->() { return &ptr->entries[index].udata; }\n\n\t\tconst K &operator*() const { return ptr->entries[index].udata; }\n\n\t\tconst K *operator->() const { return &ptr->entries[index].udata; }\n\n\t\toperator const_iterator() const { return const_iterator(ptr, index); }\n\n\t};\n\n\n\n\tpool()\n","file_path":"3rd/yosys/include/hashlib.h","rank":43,"score":110280.51974004788},{"content":"\tclass const_iterator : public std::iterator<std::forward_iterator_tag, K>\n\n\t{\n\n\t\tfriend class pool;\n\n\tprotected:\n\n\t\tconst pool *ptr;\n\n\t\tint index;\n\n\t\tconst_iterator(const pool *ptr, int index) : ptr(ptr), index(index) { }\n\n\tpublic:\n\n\t\tconst_iterator() { }\n\n\t\tconst_iterator operator++() { index--; return *this; }\n\n\t\tbool operator==(const const_iterator &other) const { return index == other.index; }\n\n\t\tbool operator!=(const const_iterator &other) const { return index != other.index; }\n\n\t\tconst K &operator*() const { return ptr->entries[index].udata; }\n\n\t\tconst K *operator->() const { return &ptr->entries[index].udata; }\n\n\t};\n\n\n","file_path":"3rd/yosys/include/hashlib.h","rank":44,"score":108254.26653221584},{"content":"#pragma once\n\n\n\n#include <afbdil/def.h>\n\n#include <afbdil/instruction.h>\n\n#include <afbdil/var.h>\n\n#include <afbdil/module.h>\n\n\n\n#include <memory>\n\n#include <set>\n\n\n\nnamespace afbd {\n\n\n","file_path":"include/afbdil/process.h","rank":45,"score":103073.8349775987},{"content":"\n\n\tstd::shared_ptr<Expr> substitute_clone(std::map<std::shared_ptr<Var>, std::shared_ptr<Expr>>& substitute_map);\n\n\n\n void simplify();\n\n\n\n int bit() const;\n\n\n\n json11::Json to_json();\n\n\n\n void all_as_sens(std::shared_ptr<Module>& module, std::shared_ptr<Process>& proc);\n\n\n\n\tstd::string children_to_smv(std::string delim);\n\n\n\n std::string binary_to_smv(std::string delim);\n\n\n\n\tstd::string to_smv(bool as_bool = false);\n\n\n\n\tbool operator==(const Expr& right) const;\n\n};\n\n\n","file_path":"include/afbdil/expr.h","rank":46,"score":103046.80434779671},{"content":"#pragma once\n\n\n\n#include <afbdil/def.h>\n\n\n\n#include <memory>\n\n\n\nnamespace afbd {\n\n\n","file_path":"include/afbdil/expr.h","rank":47,"score":103039.80444901537},{"content":" EQ,\n\n NE,\n\n GT,\n\n GE,\n\n LT,\n\n LE,\n\n\n\n COND,\n\n SUBVEC,\n\n CONCAT,\n\n REDUCE_BOOL,\n\n\n\n UNKNOWN\n\n};\n\n\n","file_path":"include/afbdil/expr.h","rank":48,"score":103021.51458000821},{"content":"class exception : public std::exception\n\n{\n\n public:\n\n /// returns the explanatory string\n\n JSON_HEDLEY_RETURNS_NON_NULL\n\n const char* what() const noexcept override\n\n {\n\n return m.what();\n\n }\n\n\n\n /// the id of the exception\n\n const int id;\n\n\n\n protected:\n\n JSON_HEDLEY_NON_NULL(3)\n\n exception(int id_, const char* what_arg) : id(id_), m(what_arg) {}\n\n\n\n static std::string name(const std::string& ename, int id_)\n\n {\n\n return \"[json.exception.\" + ename + \".\" + std::to_string(id_) + \"] \";\n","file_path":"3rd/include/json/json.hpp","rank":49,"score":101894.91224593663},{"content":"enum class value_t : std::uint8_t\n\n{\n\n null, ///< null value\n\n object, ///< object (unordered set of name/value pairs)\n\n array, ///< array (ordered collection of values)\n\n string, ///< string value\n\n boolean, ///< boolean value\n\n number_integer, ///< number value (signed integer)\n\n number_unsigned, ///< number value (unsigned integer)\n\n number_float, ///< number value (floating-point)\n\n discarded ///< discarded by the the parser callback function\n\n};\n\n\n\n/*!\n\n@brief comparison operator for JSON types\n\n\n\nReturns an ordering that is similar to Python:\n\n- order: null < boolean < number < object < array < string\n\n- furthermore, each type is not smaller than itself\n\n- discarded values are not comparable\n","file_path":"3rd/include/json/json.hpp","rank":50,"score":101894.91224593663},{"content":"struct is_constructible_tuple<T1, std::tuple<Args...>> : conjunction<std::is_constructible<T1, Args>...> {};\n\n} // namespace detail\n\n} // namespace nlohmann\n\n\n\n// #include <nlohmann/detail/value_t.hpp>\n\n\n\n\n\n#include <array> // array\n\n#include <ciso646> // and\n\n#include <cstddef> // size_t\n\n#include <cstdint> // uint8_t\n\n#include <string> // string\n\n\n\nnamespace nlohmann\n\n{\n\nnamespace detail\n\n{\n\n///////////////////////////\n\n// JSON type enumeration //\n\n///////////////////////////\n","file_path":"3rd/include/json/json.hpp","rank":51,"score":100175.5123634206},{"content":"class Constant {\n\n int _bit;\n\n int _value;\n\npublic:\n\n Constant(int bit, int value);\n\n\n\n int bit() const;\n\n inline void bit(int v) { _bit = v; }\n\n int value() const;\n\n};\n\n\n\ntypedef std::initializer_list<std::shared_ptr<Expr>> exl;\n\n\n\nstd::shared_ptr<Expr> double_fold(ExprType type, std::vector<std::shared_ptr<Expr>>& operands);\n\n\n\nstd::string to_string(ExprType type);\n\n}\n","file_path":"include/afbdil/expr.h","rank":52,"score":98918.8562040442},{"content":"class Queue {\n\n vec<T> buf;\n\n int first;\n\n int end;\n\n\n\npublic:\n\n typedef T Key;\n\n\n\n Queue() : buf(1), first(0), end(0) {}\n\n\n\n void clear (bool dealloc = false) { buf.clear(dealloc); buf.growTo(1); first = end = 0; }\n\n int size () const { return (end >= first) ? end - first : end - first + buf.size(); }\n\n\n\n const T& operator [] (int index) const { assert(index >= 0); assert(index < size()); return buf[(first + index) % buf.size()]; }\n\n T& operator [] (int index) { assert(index >= 0); assert(index < size()); return buf[(first + index) % buf.size()]; }\n\n\n\n T peek () const { assert(first != end); return buf[first]; }\n\n void pop () { assert(first != end); first++; if (first == buf.size()) first = 0; }\n\n void insert(T elem) { // INVARIANT: buf[end] is always unused\n\n buf[end++] = elem;\n","file_path":"3rd/libs/minisat/Queue.h","rank":53,"score":93012.52875437865},{"content":" class StringType, class BooleanType, class NumberIntegerType, \\\n","file_path":"3rd/include/json/json.hpp","rank":54,"score":92383.64567070475},{"content":"struct SigSet\n\n{\n\n\tstatic_assert(!std::is_same<Compare,void>::value, \"Default value for `Compare' class not found for SigSet<T>. Please specify.\");\n\n\n\n\tstruct bitDef_t : public std::pair<RTLIL::Wire*, int> {\n\n\t\tbitDef_t() : std::pair<RTLIL::Wire*, int>(NULL, 0) { }\n\n\t\tbitDef_t(const RTLIL::SigBit &bit) : std::pair<RTLIL::Wire*, int>(bit.wire, bit.offset) { }\n\n\t\tunsigned int hash() const { return first->name.hash() + second; }\n\n\t};\n\n\n\n\tdict<bitDef_t, std::set<T, Compare>> bits;\n\n\n\n\tvoid clear()\n\n\t{\n\n\t\tbits.clear();\n\n\t}\n\n\n\n\tvoid insert(RTLIL::SigSpec sig, T data)\n\n\t{\n\n\t\tfor (auto &bit : sig)\n","file_path":"3rd/yosys/include/sigtools.h","rank":55,"score":91678.88755182407},{"content":"enum class AssignType {\n\n\tBlocking,\n\n\tNonBlocking\n\n};\n\n\n\nstd::string instruction_type_to_str(InstructionType type);\n\nInstructionType str_to_instruction_type(std::string str);\n\n\n","file_path":"include/afbdil/instruction.h","rank":56,"score":91562.20728633343},{"content":"enum class InstructionType {\n\n Assign,\n\n Delay,\n\n Trigger,\n\n};\n\n\n","file_path":"include/afbdil/instruction.h","rank":57,"score":91562.20728633343},{"content":"class json_reverse_iterator : public std::reverse_iterator<Base>\n\n{\n\n public:\n\n using difference_type = std::ptrdiff_t;\n\n /// shortcut to the reverse iterator adapter\n\n using base_iterator = std::reverse_iterator<Base>;\n\n /// the reference type for the pointed-to element\n\n using reference = typename Base::reference;\n\n\n\n /// create reverse iterator from iterator\n\n explicit json_reverse_iterator(const typename base_iterator::iterator_type& it) noexcept\n\n : base_iterator(it) {}\n\n\n\n /// create reverse iterator from base class\n\n explicit json_reverse_iterator(const base_iterator& it) noexcept : base_iterator(it) {}\n\n\n\n /// post-increment (it++)\n\n json_reverse_iterator const operator++(int)\n\n {\n\n return static_cast<json_reverse_iterator>(base_iterator::operator++(1));\n","file_path":"3rd/include/json/json.hpp","rank":58,"score":90057.66507841679},{"content":" class NumberUnsignedType, class NumberFloatType, \\\n\n template<typename> class AllocatorType, \\\n\n template<typename, typename = void> class JSONSerializer>\n\n\n\n#define NLOHMANN_BASIC_JSON_TPL \\\n\n basic_json<ObjectType, ArrayType, StringType, BooleanType, \\\n\n NumberIntegerType, NumberUnsignedType, NumberFloatType, \\\n\n AllocatorType, JSONSerializer>\n\n\n\n\n\nnamespace nlohmann\n\n{\n\nnamespace detail\n\n{\n\n////////////////\n\n// exceptions //\n\n////////////////\n\n\n\n/*!\n\n@brief general exception of the @ref basic_json class\n","file_path":"3rd/include/json/json.hpp","rank":59,"score":89009.72719035934},{"content":" class AlwaysVoid,\n\n template <class...> class Op,\n\n class... Args>\n","file_path":"3rd/include/json/json.hpp","rank":60,"score":88420.37879388429},{"content":"struct is_compatible_type\n\n : is_compatible_type_impl<BasicJsonType, CompatibleType> {};\n\n\n\n// https://en.cppreference.com/w/cpp/types/conjunction\n\ntemplate<class...> struct conjunction : std::true_type { };\n\ntemplate<class B1> struct conjunction<B1> : B1 { };\n\ntemplate<class B1, class... Bn>\n","file_path":"3rd/include/json/json.hpp","rank":61,"score":88305.03119376206},{"content":"struct iterator_types <\n\n It,\n\n void_t<typename It::difference_type, typename It::value_type, typename It::pointer,\n\n typename It::reference, typename It::iterator_category >>\n\n{\n\n using difference_type = typename It::difference_type;\n\n using value_type = typename It::value_type;\n\n using pointer = typename It::pointer;\n\n using reference = typename It::reference;\n\n using iterator_category = typename It::iterator_category;\n\n};\n\n\n\n// This is required as some compilers implement std::iterator_traits in a way that\n\n// doesn't work with SFINAE. See https://github.com/nlohmann/json/issues/1341.\n\ntemplate <typename T, typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":62,"score":88305.03119376206},{"content":"struct iterator_types {};\n\n\n\ntemplate <typename It>\n","file_path":"3rd/include/json/json.hpp","rank":63,"score":88305.03119376206},{"content":"class LSet : public IntSet<Lit, MkIndexLit>{};\n\n\n\n//=================================================================================================\n\n// Lifted booleans:\n\n//\n\n// NOTE: this implementation is optimized for the case when comparisons between values are mostly\n\n// between one variable and one constant. Some care had to be taken to make sure that gcc \n\n// does enough constant propagation to produce sensible code, and this appears to be somewhat\n\n// fragile unfortunately.\n\n\n","file_path":"3rd/libs/minisat/SolverTypes.h","rank":64,"score":87203.6431966791},{"content":"struct iterator_traits < T, enable_if_t < !std::is_pointer<T>::value >>\n\n : iterator_types<T>\n\n{\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"3rd/include/json/json.hpp","rank":65,"score":86915.94268814361},{"content":"struct iterator_traits<T*, enable_if_t<std::is_object<T>::value>>\n\n{\n\n using iterator_category = std::random_access_iterator_tag;\n\n using value_type = T;\n\n using difference_type = ptrdiff_t;\n\n using pointer = T*;\n\n using reference = T&;\n\n};\n\n} // namespace detail\n\n} // namespace nlohmann\n\n\n\n// #include <nlohmann/detail/macro_scope.hpp>\n\n\n\n// #include <nlohmann/detail/meta/cpp_future.hpp>\n\n\n\n// #include <nlohmann/detail/meta/detected.hpp>\n\n\n\n\n\n#include <type_traits>\n\n\n\n// #include <nlohmann/detail/meta/void_t.hpp>\n\n\n\n\n\n// http://en.cppreference.com/w/cpp/experimental/is_detected\n\nnamespace nlohmann\n\n{\n\nnamespace detail\n\n{\n","file_path":"3rd/include/json/json.hpp","rank":66,"score":86915.94268814361},{"content":" /// token types for the parser\n\n enum class token_type\n\n {\n\n uninitialized, ///< indicating the scanner is uninitialized\n\n literal_true, ///< the `true` literal\n\n literal_false, ///< the `false` literal\n\n literal_null, ///< the `null` literal\n\n value_string, ///< a string -- use get_string() for actual value\n\n value_unsigned, ///< an unsigned integer -- use get_number_unsigned() for actual value\n\n value_integer, ///< a signed integer -- use get_number_integer() for actual value\n\n value_float, ///< an floating point number -- use get_number_float() for actual value\n\n begin_array, ///< the character for array begin `[`\n\n begin_object, ///< the character for object begin `{`\n\n end_array, ///< the character for array end `]`\n\n end_object, ///< the character for object end `}`\n\n name_separator, ///< the name separator `:`\n\n value_separator, ///< the value separator `,`\n\n parse_error, ///< indicating a parse error\n\n end_of_input, ///< indicating the end of the input buffer\n\n literal_or_value ///< a literal or the begin of a value (only for diagnostics)\n\n };\n","file_path":"3rd/include/json/json.hpp","rank":67,"score":85277.51902910654},{"content":"struct is_compatible_integer_type\n\n : is_compatible_integer_type_impl<RealIntegerType,\n\n CompatibleNumberIntegerType> {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleType, typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":68,"score":85271.63204889819},{"content":"struct is_constructible_object_type\n\n : is_constructible_object_type_impl<BasicJsonType,\n\n ConstructibleObjectType> {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleStringType,\n\n typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":69,"score":85271.63204889819},{"content":"struct is_compatible_array_type\n\n : is_compatible_array_type_impl<BasicJsonType, CompatibleArrayType> {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleArrayType, typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":70,"score":85271.63204889819},{"content":"struct is_compatible_type_impl <\n\n BasicJsonType, CompatibleType,\n\n enable_if_t<is_complete_type<CompatibleType>::value >>\n\n{\n\n static constexpr bool value =\n\n has_to_json<BasicJsonType, CompatibleType>::value;\n\n};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleType>\n","file_path":"3rd/include/json/json.hpp","rank":71,"score":85271.63204889819},{"content":"struct is_compatible_string_type\n\n : is_compatible_string_type_impl<BasicJsonType, ConstructibleStringType> {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleStringType,\n\n typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":72,"score":85271.63204889819},{"content":"struct is_compatible_object_type\n\n : is_compatible_object_type_impl<BasicJsonType, CompatibleObjectType> {};\n\n\n\ntemplate <typename BasicJsonType, typename ConstructibleObjectType,\n\n typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":73,"score":85271.63204889819},{"content":"struct is_constructible_array_type\n\n : is_constructible_array_type_impl<BasicJsonType, ConstructibleArrayType> {};\n\n\n\ntemplate <typename RealIntegerType, typename CompatibleNumberIntegerType,\n\n typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":74,"score":85271.63204889819},{"content":"struct is_constructible_string_type\n\n : is_constructible_string_type_impl<BasicJsonType, ConstructibleStringType> {};\n\n\n\ntemplate <typename BasicJsonType, typename CompatibleArrayType, typename = void>\n","file_path":"3rd/include/json/json.hpp","rank":75,"score":85271.63204889819},{"content":"\t\tstd::string str;\n","file_path":"3rd/yosys/include/ast.h","rank":76,"score":84937.76237081223},{"content":"\t\tRTLIL::SigSpec in_a, in_b;\n","file_path":"3rd/yosys/include/macc.h","rank":77,"score":84931.99857690121},{"content":"\tCellTypes()\n\n\t{\n\n\t}\n\n\n\n\tCellTypes(RTLIL::Design *design)\n\n\t{\n","file_path":"3rd/yosys/include/celltypes.h","rank":78,"score":84931.99857690121},{"content":"#include <afbdil/expr.h>\n\n#include <afbdil/var.h>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <algorithm>\n\n\n\nusing namespace std;\n\nusing namespace afbd;\n\n\n\n\n\nExpr::Expr(shared_ptr<Var> var): _type(ExprType::VAR), _var(var) {\n\n _constant = nullptr;\n\n _operands = nullptr;\n\n}\n\n\n\nExpr::Expr(shared_ptr<Constant> constant): _type(ExprType::CONSTANT), _constant(constant) {\n\n _var = nullptr;\n\n _operands = nullptr;\n\n}\n\n\n","file_path":"src/afbdil/expr.cpp","rank":80,"score":47.21986580153234},{"content":"#include <afbdil/process.h>\n\n\n\n#include <cstdlib>\n\n#include <cstring>\n\n#include <iostream>\n\n#include <list>\n\n#include <set>\n\n\n\nusing namespace std;\n\nusing namespace afbd;\n\n\n\nnamespace afbd {\n\n\textern std::shared_ptr<Expr> expr_true;\n\n extern std::shared_ptr<Expr> expr_int_zero;\n\n extern std::shared_ptr<Expr> expr_int_one;\n\n extern std::shared_ptr<Expr> expr_int_minus_one;\n\n extern std::shared_ptr<Expr> expr_nobit_zero;\n\n extern std::shared_ptr<Expr> expr_nobit_one;\n\n extern std::shared_ptr<Expr> expr_nobit_minus_one;\n\n}\n","file_path":"src/afbdil/process.cpp","rank":81,"score":45.300674191601274},{"content":" ret_map[\"operands\"] = json11::Json(operands_vec);\n\n return json11::Json(ret_map);\n\n }\n\n}\n\n\n\nvoid Expr::all_as_sens(std::shared_ptr<Module>& module, std::shared_ptr<Process>& proc)\n\n{\n\n auto begin = proc->begin();\n\n if(begin->type() != InstructionType::Trigger)\n\n {\n\n std::cout << \"shit! begin of a process is not a trigger, during all_as_sens\\n\";\n\n return;\n\n }\n\n\n\n switch(_type)\n\n {\n\n case ExprType::VAR:\n\n begin->triggers()->push_back(std::make_pair(as_var(), Edge::EDGE));\n\n return;\n\n case ExprType::CONSTANT:\n","file_path":"src/afbdil/expr.cpp","rank":82,"score":44.816696764079225},{"content":"#include <afbdil/instruction.h>\n\n\n\nusing namespace std;\n\nusing namespace afbd;\n\n\n\nstd::string instruction_type_to_str(InstructionType type)\n\n{\n\n\tswitch(type)\n\n\t{\n\n\tcase InstructionType::Assign:\n\n\t\treturn \"assign\";\n\n\tcase InstructionType::Delay:\n\n\t\treturn \"delay\";\n\n\tcase InstructionType::Trigger:\n\n\t\treturn \"trigger\";\n\n\t}\n\n}\n\n\n\nInstructionType str_to_instruction_type(std::string str)\n\n{\n","file_path":"src/afbdil/instruction.cpp","rank":83,"score":43.21114781406223},{"content":"#include <afbdil/module.h>\n\n#include <iostream>\n\n#include <sstream>\n\n#include <sys/time.h>\n\n\n\nusing namespace std;\n\nusing namespace afbd;\n\n\n\nextern std::string no_slash(std::string& str);\n\n\n\nModule::Module(std::string name) {\n\n _vars = make_shared<VarContainer>();\n\n _procs = make_shared<ProcContainer>();\n\n\n\n _name = no_slash(name);\n\n _has_error = false;\n\n}\n\n\n\nshared_ptr<VarContainer> Module::vars() const {\n\n return _vars;\n","file_path":"src/afbdil/module.cpp","rank":85,"score":41.470189549295625},{"content":" for(auto& child : *_operands)\n\n {\n\n int child_bit = child->bit();\n\n if(child_bit > ret)\n\n ret = child_bit;\n\n }\n\n return ret;\n\n}\n\n\n\nnamespace afbd {\n\n std::string to_string(ExprType type) {\n\n switch (type) {\n\n case ExprType::VAR:\n\n return \"var\";\n\n case ExprType::CONSTANT:\n\n return \"constant\";\n\n\n\n case ExprType::ADD:\n\n return \"add\";\n\n case ExprType::SUB:\n","file_path":"src/afbdil/expr.cpp","rank":86,"score":41.14330836663208},{"content":"}\n\n\n\nvoid typeCheck(std::shared_ptr<afbd::Module> module)\n\n{\n\n\tfor(auto process: *(module->procs()))\n\n\t{\n\n\t\tauto instructions = process->all_instructions();\n\n\t\tfor(auto instruction: instructions)\n\n\t\t{\n\n\t\t\tauto expr = instruction->expr();\n\n\t\t\tauto dst = instruction->dst();\n\n\t\t\tif(expr)\n\n\t\t\t{\n\n\t\t\t\tint expr_len = exprCheck(module, expr, instruction->line());\n\n\t\t\t\tif(expr_len != -1 && dst && dst->type() == ExprType::VAR)\n\n\t\t\t\t{\n\n\t\t\t\t\tint dst_len = dst->as_var()->bit();\n\n\t\t\t\t\tif(dst_len != expr_len)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tstd::string str = \"type mismatch in assign \";\n","file_path":"src/afbdil/patternmatching.cpp","rank":87,"score":39.09170072217145},{"content":"#include <memory>\n\n\n\n#include \"../../include/afbdil/patternmatching.h\"\n\n#include \"../../include/afbdil/expr.h\"\n\n#include \"../../include/afbdil/instruction.h\"\n\n\n\nusing namespace afbd;\n\n\n\nvoid reportDefect(std::shared_ptr<Module> module, std::string str, bool is_error, int line)\n\n{\n\n if(is_error)\n\n {\n\n std::cout << \"Error: \";\n\n module->set_error();\n\n }\n\n else\n\n std::cout << \"Warning: \";\n\n\tstd::cout << str << \" in line \" << line << \".\\n\";\n\n}\n\n\n","file_path":"src/afbdil/patternmatching.cpp","rank":89,"score":38.34594776393211},{"content":"\n\nstd::string Expr::binary_to_smv(std::string delim)\n\n{\n\n auto opl = get_operand(0);\n\n auto opr = get_operand(1);\n\n\n\n //std::cout << \"binary_to_smv called opl is \" << to_string(opl->type()) << \" opr is \" << to_string(opr->type()) << \"\\n\";\n\n //std::cout << to_json().dump() << \"\\n\";\n\n\n\n if(opr->type() == ExprType::CONSTANT)\n\n {\n\n while(opl->type() == ExprType::REDUCE_BOOL)\n\n opl = opl->get_operand(0);\n\n\n\n if(opl->type() >= ExprType::EQ && opr->type() <= ExprType::LE)\n\n return std::string(\"(\") + opl->to_smv() + \" \" + delim + \" \" + opr->to_smv(true) + \")\";\n\n }\n\n if(opl->type() == ExprType::CONSTANT)\n\n {\n\n while(opr->type() == ExprType::REDUCE_BOOL)\n","file_path":"src/afbdil/expr.cpp","rank":90,"score":38.22569587292211},{"content":" return;\n\n default:\n\n for(auto& child : *_operands)\n\n child->all_as_sens(module, proc);\n\n return;\n\n }\n\n}\n\n\n\nstd::shared_ptr<Expr> Expr::substitute_clone(std::map<std::shared_ptr<Var>, std::shared_ptr<Expr>>& substitute_map)\n\n{\n\n switch(_type)\n\n {\n\n case ExprType::CONSTANT:\n\n {\n\n auto constant = as_constant();\n\n return std::make_shared<Expr>(std::make_shared<Constant>(constant->bit(), constant->value()));\n\n }\n\n case ExprType::VAR:\n\n return substitute_map[_var];\n\n default:\n","file_path":"src/afbdil/expr.cpp","rank":93,"score":37.41974106773634},{"content":" llvm::Function *delayed_nonblocking_assign_update;\n\n llvm::Function *prepare_wait;\n\n llvm::Function *add_wait;\n\n llvm::Function *do_wait;\n\n\n\n llvm::Function *update;\n\n llvm::Function *mark_updated;\n\n\n\n void load_static_functions();\n\n\n\n\n\n llvm::Value *eval_expr(llvm::IRBuilder<> &builder, std::shared_ptr<afbd::Expr> expr);\n\n llvm::Function *transpile_process(std::shared_ptr<afbd::Process> proc);\n\npublic:\n\n llvm::Module* transpile(std::shared_ptr<afbd::Module> module, std::shared_ptr<std::fstream> fs);\n\n};\n","file_path":"include/transpiler/transpiler.h","rank":94,"score":36.94466638023935},{"content":"void clkCheck(std::shared_ptr<afbd::Module> module)\n\n{\n\n\tstd::set<std::shared_ptr<Var>> clk_vars;\n\n\n\n\tfor(auto process : (*module->procs()))\n\n\t{\n\n\t\tauto begin = process->begin();\n\n\t\tauto triggers = begin->triggers();\n\n\t\tif(triggers)\n\n\t\t{\n\n\t\t\tfor(auto trigger: *triggers)\n\n\t\t\t{\n\n\t\t\t\tif(trigger.second != Edge::EDGE)\n\n\t\t\t\t\tclk_vars.insert(trigger.first);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\tfor(auto process : (*module->procs()))\n\n\t{\n","file_path":"src/afbdil/patternmatching.cpp","rank":95,"score":36.91181171505654},{"content":"\t//For trigger\n\n std::shared_ptr<TriggerContainer> _triggers;\n\n\n\npublic:\n\n\texplicit Instruction(std::shared_ptr<Process> proc);\n\n\texplicit Instruction(Process* proc);\n\n\n\n [[nodiscard]]\n\n std::shared_ptr<Expr> dst() const;\n\n void dst(const std::shared_ptr<Expr> &dst);\n\n\n\n [[nodiscard]]\n\n std::shared_ptr<Expr> expr() const;\n\n void expr(const std::shared_ptr<Expr> &expr);\n\n\n\n\t[[nodiscard]]\n\n\tAssignType assign_type() const;\n\n\tvoid assign_type(AssignType assign_type);\n\n\n\n [[nodiscard]]\n","file_path":"include/afbdil/instruction.h","rank":97,"score":36.07117724841817},{"content":"#include <fstream>\n\n#include <memory>\n\nusing namespace std;\n\nusing namespace afbd;\n\n\n\nUSING_YOSYS_NAMESPACE\n\n\n\ntypedef initializer_list<shared_ptr<Expr>> exl;\n\n#define lexpr(...) initializer_list<shared_ptr<Expr>> { __VA_ARGS__ }\n\n#define nexpr(...) make_shared<Expr>(__VA_ARGS__)\n\n#define nconst(...) make_shared<Constant>(__VA_ARGS__)\n\n\n\nint main(int argc, char** argv) {\n\n /*\n\n auto m2 = make_shared<afbd::Module>(\"counter\");\n\n auto a = m2->add_var(1, \"clk\");\n\n auto b = m2->add_var(1, \"rst\");\n\n auto t = m2->add_var(32, \"cnt\");\n\n auto t2 = m2->add_var(32, \"cn2\");\n\n\n","file_path":"main.cpp","rank":98,"score":35.69949226852871},{"content":"\n\nstd::string proc_type_to_str(ProcessType type)\n\n{\n\n\tswitch(type)\n\n\t{\n\n\tcase ProcessType::Initial:\n\n\t\treturn \"initial\";\n\n\tcase ProcessType::Always:\n\n\t\treturn \"always\";\n\n\t}\n\n}\n\n\n\nProcessType str_to_proc_type(std::string str)\n\n{\n\n\tif(str == \"initial\")\n\n\t\treturn ProcessType::Initial;\n\n\telse if(str == \"always\")\n\n\t\treturn ProcessType::Always;\n\n}\n\n\n","file_path":"src/afbdil/process.cpp","rank":99,"score":35.565097749114884}],"string":"[\n {\n \"content\": \"class SigSet<T, typename std::enable_if<!std::is_pointer<T>::value>::type> : public SigSet<T, std::less<T>> {};\\n\\ntemplate<typename T>\\n\\nusing sort_by_name_id_guard = typename std::enable_if<std::is_same<T,RTLIL::Cell*>::value>::type;\\n\\ntemplate<typename T>\\n\",\n \"file_path\": \"3rd/yosys/include/sigtools.h\",\n \"rank\": 0,\n \"score\": 180007.15396701597\n },\n {\n \"content\": \"struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleObjectType,\\n\\n typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 1,\n \"score\": 179867.43734223006\n },\n {\n \"content\": \"\\t\\tAstNodeType type;\\n\",\n \"file_path\": \"3rd/yosys/include/ast.h\",\n \"rank\": 2,\n \"score\": 163788.14090654557\n },\n {\n \"content\": \"using std::max;\\n\",\n \"file_path\": \"3rd/yosys/include/yosys.h\",\n \"rank\": 3,\n \"score\": 163632.2245210259\n },\n {\n \"content\": \"struct is_complete_type : std::false_type {};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 4,\n \"score\": 156990.97360035335\n },\n {\n \"content\": \"enum ProcessType {\\n\\n Initial,\\n\\n Always,\\n\\n};\\n\\n\\n\\n//std::string proc_type_to_str(ProcessType type);\\n\\n\\n\\nProcessType str_to_proc_type(std::string str);\\n\\n\\n\\n#define MAX_INST_NUM 10000\\n\\n\\n\",\n \"file_path\": \"include/afbdil/process.h\",\n \"rank\": 5,\n \"score\": 156754.22649043097\n },\n {\n \"content\": \"struct is_compatible_type_impl: std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 6,\n \"score\": 153349.00334085766\n },\n {\n \"content\": \"enum class ExprType {\\n\\n //terminal\\n\\n CONSTANT,\\n\\n VAR,\\n\\n\\n\\n //non-terminal\\n\\n ADD,\\n\\n SUB,\\n\\n MUL,\\n\\n DIV,\\n\\n MOD,\\n\\n SHL,\\n\\n LSHR,\\n\\n ASHR,\\n\\n\\n\\n AND,\\n\\n OR,\\n\\n XOR,\\n\\n NOT,\\n\\n\\n\",\n \"file_path\": \"include/afbdil/expr.h\",\n \"rank\": 7,\n \"score\": 151765.98218634046\n },\n {\n \"content\": \"struct is_constructible_object_type_impl : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename ConstructibleObjectType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 8,\n \"score\": 149904.79958923694\n },\n {\n \"content\": \"struct is_compatible_string_type_impl : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleStringType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 9,\n \"score\": 149904.79958923694\n },\n {\n \"content\": \"struct is_compatible_object_type_impl : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleObjectType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 10,\n \"score\": 149904.79958923694\n },\n {\n \"content\": \"struct is_constructible_array_type_impl : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename ConstructibleArrayType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 11,\n \"score\": 149904.79958923694\n },\n {\n \"content\": \"struct is_compatible_integer_type_impl : std::false_type {};\\n\\n\\n\\ntemplate <typename RealIntegerType, typename CompatibleNumberIntegerType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 12,\n \"score\": 149904.79958923694\n },\n {\n \"content\": \"struct is_compatible_array_type_impl : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleArrayType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 13,\n \"score\": 149904.79958923694\n },\n {\n \"content\": \"struct is_constructible_string_type_impl : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename ConstructibleStringType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 14,\n \"score\": 149904.79958923694\n },\n {\n \"content\": \"struct has_to_json : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename T>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 15,\n \"score\": 147192.7048842536\n },\n {\n \"content\": \"struct has_from_json : std::false_type {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename T>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 16,\n \"score\": 147192.7048842536\n },\n {\n \"content\": \" class NumberIntegerType = std::int64_t,\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 17,\n \"score\": 143174.19757787322\n },\n {\n \"content\": \"struct is_constructible_tuple : std::false_type {};\\n\\n\\n\\ntemplate <typename T1, typename... Args>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 18,\n \"score\": 143174.19757787322\n },\n {\n \"content\": \"struct is_iterator_traits : std::false_type {};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 19,\n \"score\": 143174.19757787322\n },\n {\n \"content\": \" class NumberUnsignedType = std::uint64_t,\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 20,\n \"score\": 143174.19757787322\n },\n {\n \"content\": \"class Process {\\n\\n std::shared_ptr<Instruction> _begin;\\n\\n ProcessType _type;\\n\\npublic:\\n\\n Process();\\n\\n\\n\\n int inst_num;\\n\\n\\n\\n [[nodiscard]]\\n\\n ProcessType type() const;\\n\\n\\n\\n void type(ProcessType type);\\n\\n\\n\\n [[nodiscard]]\\n\\n std::shared_ptr<Instruction> begin() const;\\n\\n void begin(const std::shared_ptr<Instruction> &begin);\\n\\n\\n\\n std::shared_ptr<Process> substitute_clone(std::map<std::shared_ptr<Var>, std::shared_ptr<Expr>>& substitute_map);\\n\\n\\n\\n\\tjson11::Json to_json();\\n\\n\\n\\n std::vector<std::shared_ptr<Instruction>> all_instructions();\\n\\n\\n\\n void to_smv(std::vector<std::shared_ptr<Expr>>& expressions, std::map<std::shared_ptr<Var>, int>& vars_next, std::map<std::shared_ptr<Var>, int>& vars_init, std::set<std::shared_ptr<Var>>& edge_vars, std::vector<std::pair<int, std::shared_ptr<Expr>>>& countdowns, std::vector<std::shared_ptr<Var>>& vars, int& temp_var_num, std::set<std::string>& conditions);\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"include/afbdil/process.h\",\n \"rank\": 21,\n \"score\": 142358.58824152095\n },\n {\n \"content\": \"class Expr {\\n\\n ExprType _type;\\n\\n std::shared_ptr<std::vector<std::shared_ptr<Expr>>> _operands;\\n\\n std::shared_ptr<Var> _var;\\n\\n std::shared_ptr<Constant> _constant;\\n\\n\\n\\npublic:\\n\\n Expr(std::shared_ptr<Var> var);\\n\\n Expr(std::shared_ptr<Constant> constant);\\n\\n Expr(ExprType type, std::initializer_list<std::shared_ptr<Expr>> operands);\\n\\n Expr(ExprType type, std::vector<std::shared_ptr<Expr>> operands);\\n\\n\\n\\n ExprType type() const;\\n\\n std::shared_ptr<Var> as_var() const;\\n\\n std::shared_ptr<Constant> as_constant() const;\\n\\n int operand_num() const;\\n\\n std::shared_ptr<Expr>& get_operand(int i) const;\\n\\n inline void add_operand(std::shared_ptr<Expr> operand) { _operands->push_back(operand); }\\n\\n\\n\\n bool is_true() const;\\n\",\n \"file_path\": \"include/afbdil/expr.h\",\n \"rank\": 22,\n \"score\": 142324.04959020176\n },\n {\n \"content\": \" class StringType = std::string, class BooleanType = bool,\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 23,\n \"score\": 139968.33736120502\n },\n {\n \"content\": \"struct has_non_default_from_json : std::false_type {};\\n\\n\\n\\ntemplate<typename BasicJsonType, typename T>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 24,\n \"score\": 139405.9794356057\n },\n {\n \"content\": \"class SigSet<T, sort_by_name_id_guard<T>> : public SigSet<T, RTLIL::sort_by_name_id<typename std::remove_pointer<T>::type>> {};\\n\\n\\n\",\n \"file_path\": \"3rd/yosys/include/sigtools.h\",\n \"rank\": 25,\n \"score\": 138162.99222854446\n },\n {\n \"content\": \"class Process;\\n\",\n \"file_path\": \"include/afbdil/def.h\",\n \"rank\": 26,\n \"score\": 130225.17623551063\n },\n {\n \"content\": \"class Expr;\\n\",\n \"file_path\": \"include/afbdil/def.h\",\n \"rank\": 27,\n \"score\": 130197.26789711507\n },\n {\n \"content\": \"using namespace afbd;\\n\",\n \"file_path\": \"include/afbdil/patternmatching.h\",\n \"rank\": 28,\n \"score\": 129017.14243532556\n },\n {\n \"content\": \"USING_YOSYS_NAMESPACE\\n\\n\\n\\nnamespace afbd\\n\\n{\\n\\n\\ttypedef std::pair<std::shared_ptr<Expr>, std::shared_ptr<Expr>> ExprPair;\\n\\n\\n\\n\\tstruct afbdilPass : public Pass\\n\\n\\t{\\n\\n\\t\\tafbdilPass() : Pass(\\\"afbdilPass\\\") { }\\n\\n\\n\\n\\t\\tstd::map<std::string, std::shared_ptr<Module>> str2module;\\n\\n\\t\\tstd::vector<std::shared_ptr<Module>> unfolded_modules;\\n\\n\\t\\tstd::map<std::shared_ptr<Module>, int> module_occurence;\\n\\n\\n\\n\\t\\tstd::shared_ptr<Expr> parse_identifier(AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr);\\n\\n\\t\\tstd::shared_ptr<Expr> parse_constant(AST::AstNode* astnode);\\n\\n\\t\\tExprPair parse_range(AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr);\\n\\n\\t\\tstd::shared_ptr<Expr> parse_expr(AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr);\\n\\n\\t\\tstd::shared_ptr<Instruction> parse_block(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond);\\n\\n\\t\\tstd::shared_ptr<Instruction> parse_assign(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond, bool is_blocking);\\n\\n\\t\\tstd::shared_ptr<Instruction> parse_case(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond);\\n\\n\\t\\tstd::shared_ptr<Instruction> parse_statement(std::shared_ptr<Instruction> begin, AST::AstNode* astnode, std::map<std::string, std::shared_ptr<Expr>>& str2expr, std::shared_ptr<Expr> cond);\\n\\n\\n\\n void execute(vector<string> args, RTLIL::Design* design) override;\\n\\n\\n\\n\\t\\tvoid execute_cell(std::shared_ptr<Module>& curr, std::shared_ptr<std::vector<std::shared_ptr<Expr>>>& cell_vector);\\n\\n\\n\\n std::shared_ptr<Module> res;\\n\\n\\t};\\n\",\n \"file_path\": \"include/transpiler/afbdilpass.h\",\n \"rank\": 29,\n \"score\": 129017.14243532556\n },\n {\n \"content\": \"struct is_basic_json<NLOHMANN_BASIC_JSON_TPL> : std::true_type {};\\n\\n\\n\\n//////////////////////////\\n\\n// aliases for detected //\\n\\n//////////////////////////\\n\\n\\n\\ntemplate <typename T>\\n\\nusing mapped_type_t = typename T::mapped_type;\\n\\n\\n\\ntemplate <typename T>\\n\\nusing key_type_t = typename T::key_type;\\n\\n\\n\\ntemplate <typename T>\\n\\nusing value_type_t = typename T::value_type;\\n\\n\\n\\ntemplate <typename T>\\n\\nusing difference_type_t = typename T::difference_type;\\n\\n\\n\\ntemplate <typename T>\\n\\nusing pointer_t = typename T::pointer;\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 30,\n \"score\": 126606.10024646524\n },\n {\n \"content\": \"YOSYS_NAMESPACE_BEGIN\\n\\n\\n\",\n \"file_path\": \"3rd/yosys/include/yosys.h\",\n \"rank\": 31,\n \"score\": 124736.54234612796\n },\n {\n \"content\": \"YOSYS_NAMESPACE_BEGIN\\n\\n\\n\\nnamespace AST\\n\\n{\\n\\n\\t// all node types, type2str() must be extended\\n\\n\\t// whenever a new node type is added here\\n\\n\\tenum AstNodeType\\n\\n\\t{\\n\\n\\t\\tAST_NONE,\\n\\n\\t\\tAST_DESIGN,\\n\\n\\t\\tAST_MODULE,\\n\\n\\t\\tAST_TASK,\\n\\n\\t\\tAST_FUNCTION,\\n\\n\\t\\tAST_DPI_FUNCTION,\\n\\n\\n\\n\\t\\tAST_WIRE,\\n\\n\\t\\tAST_MEMORY,\\n\\n\\t\\tAST_AUTOWIRE,\\n\\n\\t\\tAST_PARAMETER,\\n\\n\\t\\tAST_LOCALPARAM,\\n\\n\\t\\tAST_DEFPARAM,\\n\\n\\t\\tAST_PARASET,\\n\\n\\t\\tAST_ARGUMENT,\\n\\n\\t\\tAST_RANGE,\\n\\n\\t\\tAST_MULTIRANGE,\\n\\n\\t\\tAST_CONSTANT,\\n\\n\\t\\tAST_REALVALUE,\\n\\n\\t\\tAST_CELLTYPE,\\n\\n\\t\\tAST_IDENTIFIER,\\n\\n\\t\\tAST_PREFIX,\\n\\n\\t\\tAST_ASSERT,\\n\\n\\t\\tAST_ASSUME,\\n\\n\\t\\tAST_LIVE,\\n\\n\\t\\tAST_FAIR,\\n\\n\\t\\tAST_COVER,\\n\\n\\t\\tAST_ENUM,\\n\\n\\t\\tAST_ENUM_ITEM,\\n\\n\\n\\n\\t\\tAST_FCALL,\\n\\n\\t\\tAST_TO_BITS,\\n\\n\\t\\tAST_TO_SIGNED,\\n\\n\\t\\tAST_TO_UNSIGNED,\\n\\n\\t\\tAST_CONCAT,\\n\\n\\t\\tAST_REPLICATE,\\n\\n\\t\\tAST_BIT_NOT,\\n\\n\\t\\tAST_BIT_AND,\\n\\n\\t\\tAST_BIT_OR,\\n\\n\\t\\tAST_BIT_XOR,\\n\\n\\t\\tAST_BIT_XNOR,\\n\\n\\t\\tAST_REDUCE_AND,\\n\\n\\t\\tAST_REDUCE_OR,\\n\\n\\t\\tAST_REDUCE_XOR,\\n\\n\\t\\tAST_REDUCE_XNOR,\\n\\n\\t\\tAST_REDUCE_BOOL,\\n\\n\\t\\tAST_SHIFT_LEFT,\\n\\n\\t\\tAST_SHIFT_RIGHT,\\n\\n\\t\\tAST_SHIFT_SLEFT,\\n\\n\\t\\tAST_SHIFT_SRIGHT,\\n\\n\\t\\tAST_LT,\\n\\n\\t\\tAST_LE,\\n\\n\\t\\tAST_EQ,\\n\\n\\t\\tAST_NE,\\n\\n\\t\\tAST_EQX,\\n\\n\\t\\tAST_NEX,\\n\\n\\t\\tAST_GE,\\n\\n\\t\\tAST_GT,\\n\\n\\t\\tAST_ADD,\\n\\n\\t\\tAST_SUB,\\n\\n\\t\\tAST_MUL,\\n\\n\\t\\tAST_DIV,\\n\\n\\t\\tAST_MOD,\\n\\n\\t\\tAST_POW,\\n\\n\\t\\tAST_POS,\\n\\n\\t\\tAST_NEG,\\n\\n\\t\\tAST_LOGIC_AND,\\n\\n\\t\\tAST_LOGIC_OR,\\n\\n\\t\\tAST_LOGIC_NOT,\\n\\n\\t\\tAST_TERNARY,\\n\\n\\t\\tAST_MEMRD,\\n\\n\\t\\tAST_MEMWR,\\n\\n\\t\\tAST_MEMINIT,\\n\\n\\n\\n\\t\\tAST_TCALL,\\n\\n\\t\\tAST_ASSIGN,\\n\\n\\t\\tAST_CELL,\\n\\n\\t\\tAST_PRIMITIVE,\\n\\n\\t\\tAST_CELLARRAY,\\n\\n\\t\\tAST_ALWAYS,\\n\\n\\t\\tAST_INITIAL,\\n\\n\\t\\tAST_BLOCK,\\n\\n\\t\\tAST_ASSIGN_EQ,\\n\\n\\t\\tAST_ASSIGN_LE,\\n\\n\\t\\tAST_CASE,\\n\\n\\t\\tAST_COND,\\n\\n\\t\\tAST_CONDX,\\n\\n\\t\\tAST_CONDZ,\\n\\n\\t\\tAST_DEFAULT,\\n\\n\\t\\tAST_FOR,\\n\\n\\t\\tAST_WHILE,\\n\\n\\t\\tAST_REPEAT,\\n\\n\\n\\n\\t\\tAST_GENVAR,\\n\\n\\t\\tAST_GENFOR,\\n\\n\\t\\tAST_GENIF,\\n\\n\\t\\tAST_GENCASE,\\n\\n\\t\\tAST_GENBLOCK,\\n\\n\\t\\tAST_TECALL,\\n\\n\\t\\t\\n\\n\\t\\tAST_POSEDGE,\\n\\n\\t\\tAST_NEGEDGE,\\n\\n\\t\\tAST_EDGE,\\n\\n\\n\\n\\t\\tAST_INTERFACE,\\n\\n\\t\\tAST_INTERFACEPORT,\\n\\n\\t\\tAST_INTERFACEPORTTYPE,\\n\\n\\t\\tAST_MODPORT,\\n\\n\\t\\tAST_MODPORTMEMBER,\\n\\n\\t\\tAST_PACKAGE,\\n\\n\\n\\n\\t\\tAST_WIRETYPE,\\n\\n\\t\\tAST_TYPEDEF\\n\\n\\t};\\n\\n\\n\\n\\tstruct AstSrcLocType {\\n\\n\\t\\tunsigned int first_line, last_line;\\n\\n\\t\\tunsigned int first_column, last_column;\\n\\n\\t\\tAstSrcLocType() : first_line(0), last_line(0), first_column(0), last_column(0) {}\\n\\n\\t\\tAstSrcLocType(int _first_line, int _first_column, int _last_line, int _last_column) : first_line(_first_line), last_line(_last_line), first_column(_first_column), last_column(_last_column) {}\\n\\n\\t};\\n\\n\\n\\n\\t// convert an node type to a string (e.g. for debug output)\\n\\n\\tstd::string type2str(AstNodeType type);\\n\\n\\n\\n\\t// The AST is built using instances of this struct\\n\\n\\tstruct AstNode\\n\\n\\t{\\n\\n\\t\\t// for dict<> and pool<>\\n\\n\\t\\tunsigned int hashidx_;\\n\\n\\t\\tunsigned int hash() const { return hashidx_; }\\n\\n\\n\\n\\t\\tint during_delay;\\n\\n\\t\\tint after_delay;\\n\\n\\n\\n\\t\\t// this nodes type\\n\\n\\t\\tAstNodeType type;\\n\\n\\n\\n\\t\\t// the list of child nodes for this node\\n\\n\\t\\tstd::vector<AstNode*> children;\\n\\n\\n\\n\\t\\t// the list of attributes assigned to this node\\n\\n\\t\\tstd::map<RTLIL::IdString, AstNode*> attributes;\\n\\n\\t\\tbool get_bool_attribute(RTLIL::IdString id);\\n\\n\\n\\n\\t\\t// node content - most of it is unused in most node types\\n\\n\\t\\tstd::string str;\\n\\n\\t\\tstd::vector<RTLIL::State> bits;\\n\\n\\t\\tbool is_input, is_output, is_reg, is_logic, is_signed, is_string, is_wand, is_wor, range_valid, range_swapped, was_checked, is_unsized, is_custom_type;\\n\\n\\t\\tint port_id, range_left, range_right;\\n\\n\\t\\tuint32_t integer;\\n\\n\\t\\tdouble realvalue;\\n\\n\\t\\t// set for IDs typed to an enumeration, not used\\n\\n\\t\\tbool is_enum;\\n\\n\\n\\n\\t\\t// if this is a multirange memory then this vector contains offset and length of each dimension\\n\\n\\t\\tstd::vector<int> multirange_dimensions;\\n\\n\\n\\n\\t\\t// this is set by simplify and used during RTLIL generation\\n\\n\\t\\tAstNode *id2ast;\\n\\n\\n\\n\\t\\t// this is used by simplify to detect if basic analysis has been performed already on the node\\n\\n\\t\\tbool basic_prep;\\n\\n\\n\\n\\t\\t// this is the original sourcecode location that resulted in this AST node\\n\\n\\t\\t// it is automatically set by the constructor using AST::current_filename and\\n\\n\\t\\t// the AST::get_line_num() callback function.\\n\\n\\t\\tstd::string filename;\\n\\n\\t\\tAstSrcLocType location;\\n\\n\\n\\n\\t\\t// creating and deleting nodes\\n\\n\\t\\tAstNode(AstNodeType type = AST_NONE, AstNode *child1 = NULL, AstNode *child2 = NULL, AstNode *child3 = NULL);\\n\\n\\t\\tAstNode *clone() const;\\n\\n\\t\\tvoid cloneInto(AstNode *other) const;\\n\\n\\t\\tvoid delete_children();\\n\\n\\t\\t~AstNode();\\n\\n\\n\\n\\t\\tenum mem2reg_flags\\n\\n\\t\\t{\\n\\n\\t\\t\\t/* status flags */\\n\\n\\t\\t\\tMEM2REG_FL_ALL = 0x00000001,\\n\\n\\t\\t\\tMEM2REG_FL_ASYNC = 0x00000002,\\n\\n\\t\\t\\tMEM2REG_FL_INIT = 0x00000004,\\n\\n\\n\\n\\t\\t\\t/* candidate flags */\\n\\n\\t\\t\\tMEM2REG_FL_FORCED = 0x00000100,\\n\\n\\t\\t\\tMEM2REG_FL_SET_INIT = 0x00000200,\\n\\n\\t\\t\\tMEM2REG_FL_SET_ELSE = 0x00000400,\\n\\n\\t\\t\\tMEM2REG_FL_SET_ASYNC = 0x00000800,\\n\\n\\t\\t\\tMEM2REG_FL_EQ2 = 0x00001000,\\n\\n\\t\\t\\tMEM2REG_FL_CMPLX_LHS = 0x00002000,\\n\\n\\t\\t\\tMEM2REG_FL_CONST_LHS = 0x00004000,\\n\\n\\t\\t\\tMEM2REG_FL_VAR_LHS = 0x00008000,\\n\\n\\n\\n\\t\\t\\t/* proc flags */\\n\\n\\t\\t\\tMEM2REG_FL_EQ1 = 0x01000000,\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\t// simplify() creates a simpler AST by unrolling for-loops, expanding generate blocks, etc.\\n\\n\\t\\t// it also sets the id2ast pointers so that identifier lookups are fast in genRTLIL()\\n\\n\\t\\tbool simplify(bool const_fold, bool at_zero, bool in_lvalue, int stage, int width_hint, bool sign_hint, bool in_param);\\n\\n\\t\\tAstNode *readmem(bool is_readmemh, std::string mem_filename, AstNode *memory, int start_addr, int finish_addr, bool unconditional_init);\\n\\n\\t\\tvoid expand_genblock(std::string index_var, std::string prefix, std::map<std::string, std::string> &name_map);\\n\\n\\t\\tvoid replace_ids(const std::string &prefix, const std::map<std::string, std::string> &rules);\\n\\n\\t\\tvoid mem2reg_as_needed_pass1(dict<AstNode*, pool<std::string>> &mem2reg_places,\\n\\n\\t\\t\\t\\tdict<AstNode*, uint32_t> &mem2reg_flags, dict<AstNode*, uint32_t> &proc_flags, uint32_t &status_flags);\\n\\n\\t\\tbool mem2reg_as_needed_pass2(pool<AstNode*> &mem2reg_set, AstNode *mod, AstNode *block, AstNode *&async_block);\\n\\n\\t\\tbool mem2reg_check(pool<AstNode*> &mem2reg_set);\\n\\n\\t\\tvoid mem2reg_remove(pool<AstNode*> &mem2reg_set, vector<AstNode*> &delnodes);\\n\\n\\t\\tvoid meminfo(int &mem_width, int &mem_size, int &addr_bits);\\n\\n\\n\\n\\t\\t// additional functionality for evaluating constant functions\\n\\n\\t\\tstruct varinfo_t { RTLIL::Const val; int offset; bool is_signed; };\\n\\n\\t\\tbool has_const_only_constructs(bool &recommend_const_eval);\\n\\n\\t\\tvoid replace_variables(std::map<std::string, varinfo_t> &variables, AstNode *fcall);\\n\\n\\t\\tAstNode *eval_const_function(AstNode *fcall);\\n\\n\\t\\tbool is_simple_const_expr();\\n\\n\\t\\tstd::string process_format_str(const std::string &sformat, int next_arg, int stage, int width_hint, bool sign_hint);\\n\\n\\n\\n\\t\\t// create a human-readable text representation of the AST (for debugging)\\n\\n\\t\\tvoid dumpAst(FILE *f, std::string indent) const;\\n\\n\\t\\tvoid dumpVlog(FILE *f, std::string indent) const;\\n\\n\\n\\n\\t\\t// used by genRTLIL() for detecting expression width and sign\\n\\n\\t\\tvoid detectSignWidthWorker(int &width_hint, bool &sign_hint, bool *found_real = NULL);\\n\\n\\t\\tvoid detectSignWidth(int &width_hint, bool &sign_hint, bool *found_real = NULL);\\n\\n\\n\\n\\t\\t// create RTLIL code for this AST node\\n\\n\\t\\t// for expressions the resulting signal vector is returned\\n\\n\\t\\t// all generated cell instances, etc. are written to the RTLIL::Module pointed to by AST_INTERNAL::current_module\\n\\n\\t\\tRTLIL::SigSpec genRTLIL(int width_hint = -1, bool sign_hint = false);\\n\\n\\t\\tRTLIL::SigSpec genWidthRTLIL(int width, const dict<RTLIL::SigBit, RTLIL::SigBit> *new_subst_ptr = NULL);\\n\\n\\n\\n\\t\\t// compare AST nodes\\n\\n\\t\\tbool operator==(const AstNode &other) const;\\n\\n\\t\\tbool operator!=(const AstNode &other) const;\\n\\n\\t\\tbool contains(const AstNode *other) const;\\n\\n\\n\\n\\t\\t// helper functions for creating AST nodes for constants\\n\\n\\t\\tstatic AstNode *mkconst_int(uint32_t v, bool is_signed, int width = 32);\\n\\n\\t\\tstatic AstNode *mkconst_bits(const std::vector<RTLIL::State> &v, bool is_signed, bool is_unsized);\\n\\n\\t\\tstatic AstNode *mkconst_bits(const std::vector<RTLIL::State> &v, bool is_signed);\\n\\n\\t\\tstatic AstNode *mkconst_str(const std::vector<RTLIL::State> &v);\\n\\n\\t\\tstatic AstNode *mkconst_str(const std::string &str);\\n\\n\\n\\n\\t\\t// helper function for creating sign-extended const objects\\n\\n\\t\\tRTLIL::Const bitsAsConst(int width, bool is_signed);\\n\\n\\t\\tRTLIL::Const bitsAsConst(int width = -1);\\n\\n\\t\\tRTLIL::Const bitsAsUnsizedConst(int width);\\n\\n\\t\\tRTLIL::Const asAttrConst();\\n\\n\\t\\tRTLIL::Const asParaConst();\\n\\n\\t\\tuint64_t asInt(bool is_signed);\\n\\n\\t\\tbool bits_only_01() const;\\n\\n\\t\\tbool asBool() const;\\n\\n\\n\\n\\t\\t// helper functions for real valued const eval\\n\\n\\t\\tint isConst() const; // return '1' for AST_CONSTANT and '2' for AST_REALVALUE\\n\\n\\t\\tdouble asReal(bool is_signed);\\n\\n\\t\\tRTLIL::Const realAsConst(int width);\\n\\n\\n\\n\\t\\t// helpers for enum\\n\\n\\t\\tvoid allocateDefaultEnumValues();\\n\\n\\t};\\n\\n\\n\\n\\t// process an AST tree (ast must point to an AST_DESIGN node) and generate RTLIL code\\n\\n\\tvoid process(RTLIL::Design *design, AstNode *ast, bool dump_ast1, bool dump_ast2, bool no_dump_ptr, bool dump_vlog1, bool dump_vlog2, bool dump_rtlil, bool nolatches, bool nomeminit,\\n\\n\\t\\t\\tbool nomem2reg, bool mem2reg, bool noblackbox, bool lib, bool nowb, bool noopt, bool icells, bool pwires, bool nooverwrite, bool overwrite, bool defer, bool autowire);\\n\\n\\n\\n\\t// parametric modules are supported directly by the AST library\\n\\n\\t// therefore we need our own derivate of RTLIL::Module with overloaded virtual functions\\n\\n\\tstruct AstModule : RTLIL::Module {\\n\\n\\t\\tAstNode *ast;\\n\\n\\t\\tbool nolatches, nomeminit, nomem2reg, mem2reg, noblackbox, lib, nowb, noopt, icells, pwires, autowire;\\n\\n\\t\\t~AstModule() YS_OVERRIDE;\\n\\n\\t\\tRTLIL::IdString derive(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Const> parameters, bool mayfail) YS_OVERRIDE;\\n\\n\\t\\tRTLIL::IdString derive(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Const> parameters, dict<RTLIL::IdString, RTLIL::Module*> interfaces, dict<RTLIL::IdString, RTLIL::IdString> modports, bool mayfail) YS_OVERRIDE;\\n\\n\\t\\tstd::string derive_common(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Const> parameters, AstNode **new_ast_out, bool quiet = false);\\n\\n\\t\\tvoid reprocess_module(RTLIL::Design *design, dict<RTLIL::IdString, RTLIL::Module *> local_interfaces) YS_OVERRIDE;\\n\\n\\t\\tRTLIL::Module *clone() const YS_OVERRIDE;\\n\\n\\t\\tvoid loadconfig() const;\\n\\n\\t};\\n\\n\\n\\n\\t// this must be set by the language frontend before parsing the sources\\n\\n\\t// the AstNode constructor then uses current_filename and get_line_num()\\n\\n\\t// to initialize the filename and linenum properties of new nodes\\n\\n\\textern std::string current_filename;\\n\\n\\textern void (*set_line_num)(int);\\n\\n\\textern int (*get_line_num)();\\n\\n\\n\\n\\t// set set_line_num and get_line_num to internal dummy functions (done by simplify() and AstModule::derive\\n\\n\\t// to control the filename and linenum properties of new nodes not generated by a frontend parser)\\n\\n\\tvoid use_internal_line_num();\\n\\n\\n\\n\\t// call a DPI function\\n\\n\\tAstNode *dpi_call(const std::string &rtype, const std::string &fname, const std::vector<std::string> &argtypes, const std::vector<AstNode*> &args);\\n\\n\\n\\n\\t// Helper functions related to handling SystemVerilog interfaces\\n\\n\\tstd::pair<std::string,std::string> split_modport_from_type(std::string name_type);\\n\\n\\tAstNode * find_modport(AstNode *intf, std::string name);\\n\\n\\tvoid explode_interface_port(AstNode *module_ast, RTLIL::Module * intfmodule, std::string intfname, AstNode *modport);\\n\",\n \"file_path\": \"3rd/yosys/include/ast.h\",\n \"rank\": 32,\n \"score\": 124732.41268810771\n },\n {\n \"content\": \"void typeCheck(std::shared_ptr<afbd::Module> module);\\n\",\n \"file_path\": \"include/afbdil/patternmatching.h\",\n \"rank\": 33,\n \"score\": 124626.04926715035\n },\n {\n \"content\": \"YOSYS_NAMESPACE_BEGIN\\n\\n\\n\\nnamespace RTLIL\\n\\n{\\n\\n\\tenum State : unsigned char {\\n\\n\\t\\tS0 = 0,\\n\\n\\t\\tS1 = 1,\\n\\n\\t\\tSx = 2, // undefined value or conflict\\n\\n\\t\\tSz = 3, // high-impedance / not-connected\\n\\n\\t\\tSa = 4, // don't care (used only in cases)\\n\\n\\t\\tSm = 5 // marker (used internally by some passes)\\n\\n\\t};\\n\\n\\n\\n\\tenum SyncType : unsigned char {\\n\\n\\t\\tST0 = 0, // level sensitive: 0\\n\\n\\t\\tST1 = 1, // level sensitive: 1\\n\\n\\t\\tSTp = 2, // edge sensitive: posedge\\n\\n\\t\\tSTn = 3, // edge sensitive: negedge\\n\\n\\t\\tSTe = 4, // edge sensitive: both edges\\n\\n\\t\\tSTa = 5, // always active\\n\\n\\t\\tSTg = 6, // global clock\\n\\n\\t\\tSTi = 7 // init\\n\\n\\t};\\n\\n\\n\\n\\tenum ConstFlags : unsigned char {\\n\\n\\t\\tCONST_FLAG_NONE = 0,\\n\\n\\t\\tCONST_FLAG_STRING = 1,\\n\\n\\t\\tCONST_FLAG_SIGNED = 2, // only used for parameters\\n\\n\\t\\tCONST_FLAG_REAL = 4 // only used for parameters\\n\\n\\t};\\n\\n\\n\\n\\tstruct Const;\\n\\n\\tstruct AttrObject;\\n\\n\\tstruct Selection;\\n\\n\\tstruct Monitor;\\n\\n\\tstruct Design;\\n\\n\\tstruct Module;\\n\\n\\tstruct Wire;\\n\\n\\tstruct Memory;\\n\\n\\tstruct Cell;\\n\\n\\tstruct SigChunk;\\n\\n\\tstruct SigBit;\\n\\n\\tstruct SigSpecIterator;\\n\\n\\tstruct SigSpecConstIterator;\\n\\n\\tstruct SigSpec;\\n\\n\\tstruct CaseRule;\\n\\n\\tstruct SwitchRule;\\n\\n\\tstruct SyncRule;\\n\\n\\tstruct Process;\\n\\n\\n\\n\\ttypedef std::pair<SigSpec, SigSpec> SigSig;\\n\\n\\n\\n\\tstruct IdString\\n\\n\\t{\\n\\n\\t\\t#undef YOSYS_XTRACE_GET_PUT\\n\\n\\t\\t#undef YOSYS_SORT_ID_FREE_LIST\\n\\n\\t\\t#undef YOSYS_USE_STICKY_IDS\\n\\n\\t\\t#undef YOSYS_NO_IDS_REFCNT\\n\\n\\n\\n\\t\\t// the global id string cache\\n\\n\\n\\n\\t\\tstatic struct destruct_guard_t {\\n\\n\\t\\t\\tbool ok; // POD, will be initialized to zero\\n\\n\\t\\t\\tdestruct_guard_t() { ok = true; }\\n\\n\\t\\t\\t~destruct_guard_t() { ok = false; }\\n\\n\\t\\t} destruct_guard;\\n\\n\\n\\n\\t\\tstatic std::vector<char*> global_id_storage_;\\n\\n\\t\\tstatic dict<char*, int, hash_cstr_ops> global_id_index_;\\n\\n\\t#ifndef YOSYS_NO_IDS_REFCNT\\n\\n\\t\\tstatic std::vector<int> global_refcount_storage_;\\n\\n\\t\\tstatic std::vector<int> global_free_idx_list_;\\n\\n\\t#endif\\n\\n\\n\\n\\t#ifdef YOSYS_USE_STICKY_IDS\\n\\n\\t\\tstatic int last_created_idx_ptr_;\\n\\n\\t\\tstatic int last_created_idx_[8];\\n\\n\\t#endif\\n\\n\\n\\n\\t\\tstatic inline void xtrace_db_dump()\\n\\n\\t\\t{\\n\\n\\t\\t#ifdef YOSYS_XTRACE_GET_PUT\\n\\n\\t\\t\\tfor (int idx = 0; idx < GetSize(global_id_storage_); idx++)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif (global_id_storage_.at(idx) == nullptr)\\n\\n\\t\\t\\t\\t\\tlog(\\\"#X# DB-DUMP index %d: FREE\\\\n\\\", idx);\\n\\n\\t\\t\\t\\telse\\n\\n\\t\\t\\t\\t\\tlog(\\\"#X# DB-DUMP index %d: '%s' (ref %d)\\\\n\\\", idx, global_id_storage_.at(idx), global_refcount_storage_.at(idx));\\n\\n\\t\\t\\t}\\n\\n\\t\\t#endif\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic inline void checkpoint()\\n\\n\\t\\t{\\n\\n\\t\\t#ifdef YOSYS_USE_STICKY_IDS\\n\\n\\t\\t\\tlast_created_idx_ptr_ = 0;\\n\\n\\t\\t\\tfor (int i = 0; i < 8; i++) {\\n\\n\\t\\t\\t\\tif (last_created_idx_[i])\\n\\n\\t\\t\\t\\t\\tput_reference(last_created_idx_[i]);\\n\\n\\t\\t\\t\\tlast_created_idx_[i] = 0;\\n\\n\\t\\t\\t}\\n\\n\\t\\t#endif\\n\\n\\t\\t#ifdef YOSYS_SORT_ID_FREE_LIST\\n\\n\\t\\t\\tstd::sort(global_free_idx_list_.begin(), global_free_idx_list_.end(), std::greater<int>());\\n\\n\\t\\t#endif\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic inline int get_reference(int idx)\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (idx) {\\n\\n\\t\\t#ifndef YOSYS_NO_IDS_REFCNT\\n\\n\\t\\t\\t\\tglobal_refcount_storage_[idx]++;\\n\\n\\t\\t#endif\\n\\n\\t\\t#ifdef YOSYS_XTRACE_GET_PUT\\n\\n\\t\\t\\t\\tif (yosys_xtrace)\\n\\n\\t\\t\\t\\t\\tlog(\\\"#X# GET-BY-INDEX '%s' (index %d, refcount %d)\\\\n\\\", global_id_storage_.at(idx), idx, global_refcount_storage_.at(idx));\\n\\n\\t\\t#endif\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn idx;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tstatic int get_reference(const char *p)\\n\\n\\t\\t{\\n\\n\\t\\t\\tlog_assert(destruct_guard.ok);\\n\\n\\n\\n\\t\\t\\tif (!p[0])\\n\\n\\t\\t\\t\\treturn 0;\\n\\n\\n\\n\\t\\t\\tlog_assert(p[0] == '$' || p[0] == '\\\\\\\\');\\n\\n\\t\\t\\tlog_assert(p[1] != 0);\\n\\n\\n\\n\\t\\t\\tauto it = global_id_index_.find((char*)p);\\n\\n\\t\\t\\tif (it != global_id_index_.end()) {\\n\\n\\t\\t#ifndef YOSYS_NO_IDS_REFCNT\\n\\n\\t\\t\\t\\tglobal_refcount_storage_.at(it->second)++;\\n\\n\\t\\t#endif\\n\\n\\t\\t#ifdef YOSYS_XTRACE_GET_PUT\\n\\n\\t\\t\\t\\tif (yosys_xtrace)\\n\\n\\t\\t\\t\\t\\tlog(\\\"#X# GET-BY-NAME '%s' (index %d, refcount %d)\\\\n\\\", global_id_storage_.at(it->second), it->second, global_refcount_storage_.at(it->second));\\n\\n\\t\\t#endif\\n\\n\\t\\t\\t\\treturn it->second;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t#ifndef YOSYS_NO_IDS_REFCNT\\n\\n\\t\\t\\tif (global_free_idx_list_.empty()) {\\n\\n\\t\\t\\t\\tif (global_id_storage_.empty()) {\\n\\n\\t\\t\\t\\t\\tglobal_refcount_storage_.push_back(0);\\n\\n\\t\\t\\t\\t\\tglobal_id_storage_.push_back((char*)\\\"\\\");\\n\\n\\t\\t\\t\\t\\tglobal_id_index_[global_id_storage_.back()] = 0;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tlog_assert(global_id_storage_.size() < 0x40000000);\\n\\n\\t\\t\\t\\tglobal_free_idx_list_.push_back(global_id_storage_.size());\\n\\n\\t\\t\\t\\tglobal_id_storage_.push_back(nullptr);\\n\\n\\t\\t\\t\\tglobal_refcount_storage_.push_back(0);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tint idx = global_free_idx_list_.back();\\n\\n\\t\\t\\tglobal_free_idx_list_.pop_back();\\n\\n\\t\\t\\tglobal_id_storage_.at(idx) = strdup(p);\\n\\n\\t\\t\\tglobal_id_index_[global_id_storage_.at(idx)] = idx;\\n\\n\\t\\t\\tglobal_refcount_storage_.at(idx)++;\\n\\n\\t\\t#else\\n\\n\\t\\t\\tif (global_id_storage_.empty()) {\\n\\n\\t\\t\\t\\tglobal_id_storage_.push_back((char*)\\\"\\\");\\n\\n\\t\\t\\t\\tglobal_id_index_[global_id_storage_.back()] = 0;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tint idx = global_id_storage_.size();\\n\\n\\t\\t\\tglobal_id_storage_.push_back(strdup(p));\\n\\n\\t\\t\\tglobal_id_index_[global_id_storage_.back()] = idx;\\n\\n\\t\\t#endif\\n\\n\\n\\n\\t\\t\\tif (yosys_xtrace) {\\n\\n\\t\\t\\t\\tlog(\\\"#X# New IdString '%s' with index %d.\\\\n\\\", p, idx);\\n\\n\\t\\t\\t\\tlog_backtrace(\\\"-X- \\\", yosys_xtrace-1);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t#ifdef YOSYS_XTRACE_GET_PUT\\n\\n\\t\\t\\tif (yosys_xtrace)\\n\\n\\t\\t\\t\\tlog(\\\"#X# GET-BY-NAME '%s' (index %d, refcount %d)\\\\n\\\", global_id_storage_.at(idx), idx, global_refcount_storage_.at(idx));\\n\\n\\t\\t#endif\\n\\n\\n\\n\\t\\t#ifdef YOSYS_USE_STICKY_IDS\\n\\n\\t\\t\\t// Avoid Create->Delete->Create pattern\\n\\n\\t\\t\\tif (last_created_idx_[last_created_idx_ptr_])\\n\\n\\t\\t\\t\\tput_reference(last_created_idx_[last_created_idx_ptr_]);\\n\\n\\t\\t\\tlast_created_idx_[last_created_idx_ptr_] = idx;\\n\\n\\t\\t\\tget_reference(last_created_idx_[last_created_idx_ptr_]);\\n\\n\\t\\t\\tlast_created_idx_ptr_ = (last_created_idx_ptr_ + 1) & 7;\\n\\n\\t\\t#endif\\n\\n\\n\\n\\t\\t\\treturn idx;\\n\\n\\t\\t}\\n\\n\\n\\n\\t#ifndef YOSYS_NO_IDS_REFCNT\\n\\n\\t\\tstatic inline void put_reference(int idx)\\n\\n\\t\\t{\\n\\n\\t\\t\\t// put_reference() may be called from destructors after the destructor of\\n\\n\\t\\t\\t// global_refcount_storage_ has been run. in this case we simply do nothing.\\n\\n\\t\\t\\tif (!destruct_guard.ok || !idx)\\n\\n\\t\\t\\t\\treturn;\\n\\n\\n\\n\\t\\t#ifdef YOSYS_XTRACE_GET_PUT\\n\\n\\t\\t\\tif (yosys_xtrace) {\\n\\n\\t\\t\\t\\tlog(\\\"#X# PUT '%s' (index %d, refcount %d)\\\\n\\\", global_id_storage_.at(idx), idx, global_refcount_storage_.at(idx));\\n\\n\\t\\t\\t}\\n\\n\\t\\t#endif\\n\\n\\n\\n\\t\\t\\tint &refcount = global_refcount_storage_[idx];\\n\\n\\n\\n\\t\\t\\tif (--refcount > 0)\\n\\n\\t\\t\\t\\treturn;\\n\\n\\n\\n\\t\\t\\tlog_assert(refcount == 0);\\n\\n\\n\\n\\t\\t\\tif (yosys_xtrace) {\\n\\n\\t\\t\\t\\tlog(\\\"#X# Removed IdString '%s' with index %d.\\\\n\\\", global_id_storage_.at(idx), idx);\\n\\n\\t\\t\\t\\tlog_backtrace(\\\"-X- \\\", yosys_xtrace-1);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tglobal_id_index_.erase(global_id_storage_.at(idx));\\n\\n\\t\\t\\tfree(global_id_storage_.at(idx));\\n\\n\\t\\t\\tglobal_id_storage_.at(idx) = nullptr;\\n\\n\\t\\t\\tglobal_free_idx_list_.push_back(idx);\\n\\n\\t\\t}\\n\\n\\t#else\\n\\n\\t\\tstatic inline void put_reference(int) { }\\n\\n\\t#endif\\n\\n\\n\\n\\t\\t// the actual IdString object is just is a single int\\n\\n\\n\\n\\t\\tint index_;\\n\\n\\n\\n\\t\\tinline IdString() : index_(0) { }\\n\\n\\t\\tinline IdString(const char *str) : index_(get_reference(str)) { }\\n\\n\\t\\tinline IdString(const IdString &str) : index_(get_reference(str.index_)) { }\\n\",\n \"file_path\": \"3rd/yosys/include/yosys_rtlil.h\",\n \"rank\": 34,\n \"score\": 120723.13157047177\n },\n {\n \"content\": \"\\t\\tvoid detectSignWidth(int &width_hint, bool &sign_hint, bool *found_real = NULL);\\n\",\n \"file_path\": \"3rd/yosys/include/ast.h\",\n \"rank\": 35,\n \"score\": 116966.07574002919\n },\n {\n \"content\": \"extern void eval_select_op(vector<RTLIL::Selection> &work, const string &op, RTLIL::Design *design);\\n\",\n \"file_path\": \"3rd/yosys/include/register.h\",\n \"rank\": 36,\n \"score\": 116964.80525650896\n },\n {\n \"content\": \"\\t\\tAstNode *eval_const_function(AstNode *fcall);\\n\",\n \"file_path\": \"3rd/yosys/include/ast.h\",\n \"rank\": 37,\n \"score\": 116964.80525650896\n },\n {\n \"content\": \"extern RTLIL::Selection eval_select_args(const vector<string> &args, RTLIL::Design *design);\\n\",\n \"file_path\": \"3rd/yosys/include/register.h\",\n \"rank\": 38,\n \"score\": 116964.80525650896\n },\n {\n \"content\": \"\\t\\tbool is_simple_const_expr();\\n\",\n \"file_path\": \"3rd/yosys/include/ast.h\",\n \"rank\": 39,\n \"score\": 116913.89609344055\n },\n {\n \"content\": \"\\tclass iterator : public std::iterator<std::forward_iterator_tag, std::pair<K, T>>\\n\\n\\t{\\n\\n\\t\\tfriend class dict;\\n\\n\\tprotected:\\n\\n\\t\\tdict *ptr;\\n\\n\\t\\tint index;\\n\\n\\t\\titerator(dict *ptr, int index) : ptr(ptr), index(index) { }\\n\\n\\tpublic:\\n\\n\\t\\titerator() { }\\n\\n\\t\\titerator operator++() { index--; return *this; }\\n\\n\\t\\tbool operator<(const iterator &other) const { return index > other.index; }\\n\\n\\t\\tbool operator==(const iterator &other) const { return index == other.index; }\\n\\n\\t\\tbool operator!=(const iterator &other) const { return index != other.index; }\\n\\n\\t\\tstd::pair<K, T> &operator*() { return ptr->entries[index].udata; }\\n\\n\\t\\tstd::pair<K, T> *operator->() { return &ptr->entries[index].udata; }\\n\\n\\t\\tconst std::pair<K, T> &operator*() const { return ptr->entries[index].udata; }\\n\\n\\t\\tconst std::pair<K, T> *operator->() const { return &ptr->entries[index].udata; }\\n\\n\\t\\toperator const_iterator() const { return const_iterator(ptr, index); }\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"3rd/yosys/include/hashlib.h\",\n \"rank\": 40,\n \"score\": 113924.15528256545\n },\n {\n \"content\": \"\\t\\tvoid detectSignWidthWorker(int &width_hint, bool &sign_hint, bool *found_real = NULL);\\n\",\n \"file_path\": \"3rd/yosys/include/ast.h\",\n \"rank\": 41,\n \"score\": 113444.95392681987\n },\n {\n \"content\": \"\\tclass const_iterator : public std::iterator<std::forward_iterator_tag, std::pair<K, T>>\\n\\n\\t{\\n\\n\\t\\tfriend class dict;\\n\\n\\tprotected:\\n\\n\\t\\tconst dict *ptr;\\n\\n\\t\\tint index;\\n\\n\\t\\tconst_iterator(const dict *ptr, int index) : ptr(ptr), index(index) { }\\n\\n\\tpublic:\\n\\n\\t\\tconst_iterator() { }\\n\\n\\t\\tconst_iterator operator++() { index--; return *this; }\\n\\n\\t\\tbool operator<(const const_iterator &other) const { return index > other.index; }\\n\\n\\t\\tbool operator==(const const_iterator &other) const { return index == other.index; }\\n\\n\\t\\tbool operator!=(const const_iterator &other) const { return index != other.index; }\\n\\n\\t\\tconst std::pair<K, T> &operator*() const { return ptr->entries[index].udata; }\\n\\n\\t\\tconst std::pair<K, T> *operator->() const { return &ptr->entries[index].udata; }\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"3rd/yosys/include/hashlib.h\",\n \"rank\": 42,\n \"score\": 112255.60473917167\n },\n {\n \"content\": \"\\tclass iterator : public std::iterator<std::forward_iterator_tag, K>\\n\\n\\t{\\n\\n\\t\\tfriend class pool;\\n\\n\\tprotected:\\n\\n\\t\\tpool *ptr;\\n\\n\\t\\tint index;\\n\\n\\t\\titerator(pool *ptr, int index) : ptr(ptr), index(index) { }\\n\\n\\tpublic:\\n\\n\\t\\titerator() { }\\n\\n\\t\\titerator operator++() { index--; return *this; }\\n\\n\\t\\tbool operator==(const iterator &other) const { return index == other.index; }\\n\\n\\t\\tbool operator!=(const iterator &other) const { return index != other.index; }\\n\\n\\t\\tK &operator*() { return ptr->entries[index].udata; }\\n\\n\\t\\tK *operator->() { return &ptr->entries[index].udata; }\\n\\n\\t\\tconst K &operator*() const { return ptr->entries[index].udata; }\\n\\n\\t\\tconst K *operator->() const { return &ptr->entries[index].udata; }\\n\\n\\t\\toperator const_iterator() const { return const_iterator(ptr, index); }\\n\\n\\t};\\n\\n\\n\\n\\tpool()\\n\",\n \"file_path\": \"3rd/yosys/include/hashlib.h\",\n \"rank\": 43,\n \"score\": 110280.51974004788\n },\n {\n \"content\": \"\\tclass const_iterator : public std::iterator<std::forward_iterator_tag, K>\\n\\n\\t{\\n\\n\\t\\tfriend class pool;\\n\\n\\tprotected:\\n\\n\\t\\tconst pool *ptr;\\n\\n\\t\\tint index;\\n\\n\\t\\tconst_iterator(const pool *ptr, int index) : ptr(ptr), index(index) { }\\n\\n\\tpublic:\\n\\n\\t\\tconst_iterator() { }\\n\\n\\t\\tconst_iterator operator++() { index--; return *this; }\\n\\n\\t\\tbool operator==(const const_iterator &other) const { return index == other.index; }\\n\\n\\t\\tbool operator!=(const const_iterator &other) const { return index != other.index; }\\n\\n\\t\\tconst K &operator*() const { return ptr->entries[index].udata; }\\n\\n\\t\\tconst K *operator->() const { return &ptr->entries[index].udata; }\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"3rd/yosys/include/hashlib.h\",\n \"rank\": 44,\n \"score\": 108254.26653221584\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <afbdil/def.h>\\n\\n#include <afbdil/instruction.h>\\n\\n#include <afbdil/var.h>\\n\\n#include <afbdil/module.h>\\n\\n\\n\\n#include <memory>\\n\\n#include <set>\\n\\n\\n\\nnamespace afbd {\\n\\n\\n\",\n \"file_path\": \"include/afbdil/process.h\",\n \"rank\": 45,\n \"score\": 103073.8349775987\n },\n {\n \"content\": \"\\n\\n\\tstd::shared_ptr<Expr> substitute_clone(std::map<std::shared_ptr<Var>, std::shared_ptr<Expr>>& substitute_map);\\n\\n\\n\\n void simplify();\\n\\n\\n\\n int bit() const;\\n\\n\\n\\n json11::Json to_json();\\n\\n\\n\\n void all_as_sens(std::shared_ptr<Module>& module, std::shared_ptr<Process>& proc);\\n\\n\\n\\n\\tstd::string children_to_smv(std::string delim);\\n\\n\\n\\n std::string binary_to_smv(std::string delim);\\n\\n\\n\\n\\tstd::string to_smv(bool as_bool = false);\\n\\n\\n\\n\\tbool operator==(const Expr& right) const;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/afbdil/expr.h\",\n \"rank\": 46,\n \"score\": 103046.80434779671\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n#include <afbdil/def.h>\\n\\n\\n\\n#include <memory>\\n\\n\\n\\nnamespace afbd {\\n\\n\\n\",\n \"file_path\": \"include/afbdil/expr.h\",\n \"rank\": 47,\n \"score\": 103039.80444901537\n },\n {\n \"content\": \" EQ,\\n\\n NE,\\n\\n GT,\\n\\n GE,\\n\\n LT,\\n\\n LE,\\n\\n\\n\\n COND,\\n\\n SUBVEC,\\n\\n CONCAT,\\n\\n REDUCE_BOOL,\\n\\n\\n\\n UNKNOWN\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/afbdil/expr.h\",\n \"rank\": 48,\n \"score\": 103021.51458000821\n },\n {\n \"content\": \"class exception : public std::exception\\n\\n{\\n\\n public:\\n\\n /// returns the explanatory string\\n\\n JSON_HEDLEY_RETURNS_NON_NULL\\n\\n const char* what() const noexcept override\\n\\n {\\n\\n return m.what();\\n\\n }\\n\\n\\n\\n /// the id of the exception\\n\\n const int id;\\n\\n\\n\\n protected:\\n\\n JSON_HEDLEY_NON_NULL(3)\\n\\n exception(int id_, const char* what_arg) : id(id_), m(what_arg) {}\\n\\n\\n\\n static std::string name(const std::string& ename, int id_)\\n\\n {\\n\\n return \\\"[json.exception.\\\" + ename + \\\".\\\" + std::to_string(id_) + \\\"] \\\";\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 49,\n \"score\": 101894.91224593663\n },\n {\n \"content\": \"enum class value_t : std::uint8_t\\n\\n{\\n\\n null, ///< null value\\n\\n object, ///< object (unordered set of name/value pairs)\\n\\n array, ///< array (ordered collection of values)\\n\\n string, ///< string value\\n\\n boolean, ///< boolean value\\n\\n number_integer, ///< number value (signed integer)\\n\\n number_unsigned, ///< number value (unsigned integer)\\n\\n number_float, ///< number value (floating-point)\\n\\n discarded ///< discarded by the the parser callback function\\n\\n};\\n\\n\\n\\n/*!\\n\\n@brief comparison operator for JSON types\\n\\n\\n\\nReturns an ordering that is similar to Python:\\n\\n- order: null < boolean < number < object < array < string\\n\\n- furthermore, each type is not smaller than itself\\n\\n- discarded values are not comparable\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 50,\n \"score\": 101894.91224593663\n },\n {\n \"content\": \"struct is_constructible_tuple<T1, std::tuple<Args...>> : conjunction<std::is_constructible<T1, Args>...> {};\\n\\n} // namespace detail\\n\\n} // namespace nlohmann\\n\\n\\n\\n// #include <nlohmann/detail/value_t.hpp>\\n\\n\\n\\n\\n\\n#include <array> // array\\n\\n#include <ciso646> // and\\n\\n#include <cstddef> // size_t\\n\\n#include <cstdint> // uint8_t\\n\\n#include <string> // string\\n\\n\\n\\nnamespace nlohmann\\n\\n{\\n\\nnamespace detail\\n\\n{\\n\\n///////////////////////////\\n\\n// JSON type enumeration //\\n\\n///////////////////////////\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 51,\n \"score\": 100175.5123634206\n },\n {\n \"content\": \"class Constant {\\n\\n int _bit;\\n\\n int _value;\\n\\npublic:\\n\\n Constant(int bit, int value);\\n\\n\\n\\n int bit() const;\\n\\n inline void bit(int v) { _bit = v; }\\n\\n int value() const;\\n\\n};\\n\\n\\n\\ntypedef std::initializer_list<std::shared_ptr<Expr>> exl;\\n\\n\\n\\nstd::shared_ptr<Expr> double_fold(ExprType type, std::vector<std::shared_ptr<Expr>>& operands);\\n\\n\\n\\nstd::string to_string(ExprType type);\\n\\n}\\n\",\n \"file_path\": \"include/afbdil/expr.h\",\n \"rank\": 52,\n \"score\": 98918.8562040442\n },\n {\n \"content\": \"class Queue {\\n\\n vec<T> buf;\\n\\n int first;\\n\\n int end;\\n\\n\\n\\npublic:\\n\\n typedef T Key;\\n\\n\\n\\n Queue() : buf(1), first(0), end(0) {}\\n\\n\\n\\n void clear (bool dealloc = false) { buf.clear(dealloc); buf.growTo(1); first = end = 0; }\\n\\n int size () const { return (end >= first) ? end - first : end - first + buf.size(); }\\n\\n\\n\\n const T& operator [] (int index) const { assert(index >= 0); assert(index < size()); return buf[(first + index) % buf.size()]; }\\n\\n T& operator [] (int index) { assert(index >= 0); assert(index < size()); return buf[(first + index) % buf.size()]; }\\n\\n\\n\\n T peek () const { assert(first != end); return buf[first]; }\\n\\n void pop () { assert(first != end); first++; if (first == buf.size()) first = 0; }\\n\\n void insert(T elem) { // INVARIANT: buf[end] is always unused\\n\\n buf[end++] = elem;\\n\",\n \"file_path\": \"3rd/libs/minisat/Queue.h\",\n \"rank\": 53,\n \"score\": 93012.52875437865\n },\n {\n \"content\": \" class StringType, class BooleanType, class NumberIntegerType, \\\\\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 54,\n \"score\": 92383.64567070475\n },\n {\n \"content\": \"struct SigSet\\n\\n{\\n\\n\\tstatic_assert(!std::is_same<Compare,void>::value, \\\"Default value for `Compare' class not found for SigSet<T>. Please specify.\\\");\\n\\n\\n\\n\\tstruct bitDef_t : public std::pair<RTLIL::Wire*, int> {\\n\\n\\t\\tbitDef_t() : std::pair<RTLIL::Wire*, int>(NULL, 0) { }\\n\\n\\t\\tbitDef_t(const RTLIL::SigBit &bit) : std::pair<RTLIL::Wire*, int>(bit.wire, bit.offset) { }\\n\\n\\t\\tunsigned int hash() const { return first->name.hash() + second; }\\n\\n\\t};\\n\\n\\n\\n\\tdict<bitDef_t, std::set<T, Compare>> bits;\\n\\n\\n\\n\\tvoid clear()\\n\\n\\t{\\n\\n\\t\\tbits.clear();\\n\\n\\t}\\n\\n\\n\\n\\tvoid insert(RTLIL::SigSpec sig, T data)\\n\\n\\t{\\n\\n\\t\\tfor (auto &bit : sig)\\n\",\n \"file_path\": \"3rd/yosys/include/sigtools.h\",\n \"rank\": 55,\n \"score\": 91678.88755182407\n },\n {\n \"content\": \"enum class AssignType {\\n\\n\\tBlocking,\\n\\n\\tNonBlocking\\n\\n};\\n\\n\\n\\nstd::string instruction_type_to_str(InstructionType type);\\n\\nInstructionType str_to_instruction_type(std::string str);\\n\\n\\n\",\n \"file_path\": \"include/afbdil/instruction.h\",\n \"rank\": 56,\n \"score\": 91562.20728633343\n },\n {\n \"content\": \"enum class InstructionType {\\n\\n Assign,\\n\\n Delay,\\n\\n Trigger,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/afbdil/instruction.h\",\n \"rank\": 57,\n \"score\": 91562.20728633343\n },\n {\n \"content\": \"class json_reverse_iterator : public std::reverse_iterator<Base>\\n\\n{\\n\\n public:\\n\\n using difference_type = std::ptrdiff_t;\\n\\n /// shortcut to the reverse iterator adapter\\n\\n using base_iterator = std::reverse_iterator<Base>;\\n\\n /// the reference type for the pointed-to element\\n\\n using reference = typename Base::reference;\\n\\n\\n\\n /// create reverse iterator from iterator\\n\\n explicit json_reverse_iterator(const typename base_iterator::iterator_type& it) noexcept\\n\\n : base_iterator(it) {}\\n\\n\\n\\n /// create reverse iterator from base class\\n\\n explicit json_reverse_iterator(const base_iterator& it) noexcept : base_iterator(it) {}\\n\\n\\n\\n /// post-increment (it++)\\n\\n json_reverse_iterator const operator++(int)\\n\\n {\\n\\n return static_cast<json_reverse_iterator>(base_iterator::operator++(1));\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 58,\n \"score\": 90057.66507841679\n },\n {\n \"content\": \" class NumberUnsignedType, class NumberFloatType, \\\\\\n\\n template<typename> class AllocatorType, \\\\\\n\\n template<typename, typename = void> class JSONSerializer>\\n\\n\\n\\n#define NLOHMANN_BASIC_JSON_TPL \\\\\\n\\n basic_json<ObjectType, ArrayType, StringType, BooleanType, \\\\\\n\\n NumberIntegerType, NumberUnsignedType, NumberFloatType, \\\\\\n\\n AllocatorType, JSONSerializer>\\n\\n\\n\\n\\n\\nnamespace nlohmann\\n\\n{\\n\\nnamespace detail\\n\\n{\\n\\n////////////////\\n\\n// exceptions //\\n\\n////////////////\\n\\n\\n\\n/*!\\n\\n@brief general exception of the @ref basic_json class\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 59,\n \"score\": 89009.72719035934\n },\n {\n \"content\": \" class AlwaysVoid,\\n\\n template <class...> class Op,\\n\\n class... Args>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 60,\n \"score\": 88420.37879388429\n },\n {\n \"content\": \"struct is_compatible_type\\n\\n : is_compatible_type_impl<BasicJsonType, CompatibleType> {};\\n\\n\\n\\n// https://en.cppreference.com/w/cpp/types/conjunction\\n\\ntemplate<class...> struct conjunction : std::true_type { };\\n\\ntemplate<class B1> struct conjunction<B1> : B1 { };\\n\\ntemplate<class B1, class... Bn>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 61,\n \"score\": 88305.03119376206\n },\n {\n \"content\": \"struct iterator_types <\\n\\n It,\\n\\n void_t<typename It::difference_type, typename It::value_type, typename It::pointer,\\n\\n typename It::reference, typename It::iterator_category >>\\n\\n{\\n\\n using difference_type = typename It::difference_type;\\n\\n using value_type = typename It::value_type;\\n\\n using pointer = typename It::pointer;\\n\\n using reference = typename It::reference;\\n\\n using iterator_category = typename It::iterator_category;\\n\\n};\\n\\n\\n\\n// This is required as some compilers implement std::iterator_traits in a way that\\n\\n// doesn't work with SFINAE. See https://github.com/nlohmann/json/issues/1341.\\n\\ntemplate <typename T, typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 62,\n \"score\": 88305.03119376206\n },\n {\n \"content\": \"struct iterator_types {};\\n\\n\\n\\ntemplate <typename It>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 63,\n \"score\": 88305.03119376206\n },\n {\n \"content\": \"class LSet : public IntSet<Lit, MkIndexLit>{};\\n\\n\\n\\n//=================================================================================================\\n\\n// Lifted booleans:\\n\\n//\\n\\n// NOTE: this implementation is optimized for the case when comparisons between values are mostly\\n\\n// between one variable and one constant. Some care had to be taken to make sure that gcc \\n\\n// does enough constant propagation to produce sensible code, and this appears to be somewhat\\n\\n// fragile unfortunately.\\n\\n\\n\",\n \"file_path\": \"3rd/libs/minisat/SolverTypes.h\",\n \"rank\": 64,\n \"score\": 87203.6431966791\n },\n {\n \"content\": \"struct iterator_traits < T, enable_if_t < !std::is_pointer<T>::value >>\\n\\n : iterator_types<T>\\n\\n{\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 65,\n \"score\": 86915.94268814361\n },\n {\n \"content\": \"struct iterator_traits<T*, enable_if_t<std::is_object<T>::value>>\\n\\n{\\n\\n using iterator_category = std::random_access_iterator_tag;\\n\\n using value_type = T;\\n\\n using difference_type = ptrdiff_t;\\n\\n using pointer = T*;\\n\\n using reference = T&;\\n\\n};\\n\\n} // namespace detail\\n\\n} // namespace nlohmann\\n\\n\\n\\n// #include <nlohmann/detail/macro_scope.hpp>\\n\\n\\n\\n// #include <nlohmann/detail/meta/cpp_future.hpp>\\n\\n\\n\\n// #include <nlohmann/detail/meta/detected.hpp>\\n\\n\\n\\n\\n\\n#include <type_traits>\\n\\n\\n\\n// #include <nlohmann/detail/meta/void_t.hpp>\\n\\n\\n\\n\\n\\n// http://en.cppreference.com/w/cpp/experimental/is_detected\\n\\nnamespace nlohmann\\n\\n{\\n\\nnamespace detail\\n\\n{\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 66,\n \"score\": 86915.94268814361\n },\n {\n \"content\": \" /// token types for the parser\\n\\n enum class token_type\\n\\n {\\n\\n uninitialized, ///< indicating the scanner is uninitialized\\n\\n literal_true, ///< the `true` literal\\n\\n literal_false, ///< the `false` literal\\n\\n literal_null, ///< the `null` literal\\n\\n value_string, ///< a string -- use get_string() for actual value\\n\\n value_unsigned, ///< an unsigned integer -- use get_number_unsigned() for actual value\\n\\n value_integer, ///< a signed integer -- use get_number_integer() for actual value\\n\\n value_float, ///< an floating point number -- use get_number_float() for actual value\\n\\n begin_array, ///< the character for array begin `[`\\n\\n begin_object, ///< the character for object begin `{`\\n\\n end_array, ///< the character for array end `]`\\n\\n end_object, ///< the character for object end `}`\\n\\n name_separator, ///< the name separator `:`\\n\\n value_separator, ///< the value separator `,`\\n\\n parse_error, ///< indicating a parse error\\n\\n end_of_input, ///< indicating the end of the input buffer\\n\\n literal_or_value ///< a literal or the begin of a value (only for diagnostics)\\n\\n };\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 67,\n \"score\": 85277.51902910654\n },\n {\n \"content\": \"struct is_compatible_integer_type\\n\\n : is_compatible_integer_type_impl<RealIntegerType,\\n\\n CompatibleNumberIntegerType> {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleType, typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 68,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"struct is_constructible_object_type\\n\\n : is_constructible_object_type_impl<BasicJsonType,\\n\\n ConstructibleObjectType> {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleStringType,\\n\\n typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 69,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"struct is_compatible_array_type\\n\\n : is_compatible_array_type_impl<BasicJsonType, CompatibleArrayType> {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename ConstructibleArrayType, typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 70,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"struct is_compatible_type_impl <\\n\\n BasicJsonType, CompatibleType,\\n\\n enable_if_t<is_complete_type<CompatibleType>::value >>\\n\\n{\\n\\n static constexpr bool value =\\n\\n has_to_json<BasicJsonType, CompatibleType>::value;\\n\\n};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleType>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 71,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"struct is_compatible_string_type\\n\\n : is_compatible_string_type_impl<BasicJsonType, ConstructibleStringType> {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename ConstructibleStringType,\\n\\n typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 72,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"struct is_compatible_object_type\\n\\n : is_compatible_object_type_impl<BasicJsonType, CompatibleObjectType> {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename ConstructibleObjectType,\\n\\n typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 73,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"struct is_constructible_array_type\\n\\n : is_constructible_array_type_impl<BasicJsonType, ConstructibleArrayType> {};\\n\\n\\n\\ntemplate <typename RealIntegerType, typename CompatibleNumberIntegerType,\\n\\n typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 74,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"struct is_constructible_string_type\\n\\n : is_constructible_string_type_impl<BasicJsonType, ConstructibleStringType> {};\\n\\n\\n\\ntemplate <typename BasicJsonType, typename CompatibleArrayType, typename = void>\\n\",\n \"file_path\": \"3rd/include/json/json.hpp\",\n \"rank\": 75,\n \"score\": 85271.63204889819\n },\n {\n \"content\": \"\\t\\tstd::string str;\\n\",\n \"file_path\": \"3rd/yosys/include/ast.h\",\n \"rank\": 76,\n \"score\": 84937.76237081223\n },\n {\n \"content\": \"\\t\\tRTLIL::SigSpec in_a, in_b;\\n\",\n \"file_path\": \"3rd/yosys/include/macc.h\",\n \"rank\": 77,\n \"score\": 84931.99857690121\n },\n {\n \"content\": \"\\tCellTypes()\\n\\n\\t{\\n\\n\\t}\\n\\n\\n\\n\\tCellTypes(RTLIL::Design *design)\\n\\n\\t{\\n\",\n \"file_path\": \"3rd/yosys/include/celltypes.h\",\n \"rank\": 78,\n \"score\": 84931.99857690121\n },\n {\n \"content\": \"#include <afbdil/expr.h>\\n\\n#include <afbdil/var.h>\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n#include <algorithm>\\n\\n\\n\\nusing namespace std;\\n\\nusing namespace afbd;\\n\\n\\n\\n\\n\\nExpr::Expr(shared_ptr<Var> var): _type(ExprType::VAR), _var(var) {\\n\\n _constant = nullptr;\\n\\n _operands = nullptr;\\n\\n}\\n\\n\\n\\nExpr::Expr(shared_ptr<Constant> constant): _type(ExprType::CONSTANT), _constant(constant) {\\n\\n _var = nullptr;\\n\\n _operands = nullptr;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/afbdil/expr.cpp\",\n \"rank\": 80,\n \"score\": 47.21986580153234\n },\n {\n \"content\": \"#include <afbdil/process.h>\\n\\n\\n\\n#include <cstdlib>\\n\\n#include <cstring>\\n\\n#include <iostream>\\n\\n#include <list>\\n\\n#include <set>\\n\\n\\n\\nusing namespace std;\\n\\nusing namespace afbd;\\n\\n\\n\\nnamespace afbd {\\n\\n\\textern std::shared_ptr<Expr> expr_true;\\n\\n extern std::shared_ptr<Expr> expr_int_zero;\\n\\n extern std::shared_ptr<Expr> expr_int_one;\\n\\n extern std::shared_ptr<Expr> expr_int_minus_one;\\n\\n extern std::shared_ptr<Expr> expr_nobit_zero;\\n\\n extern std::shared_ptr<Expr> expr_nobit_one;\\n\\n extern std::shared_ptr<Expr> expr_nobit_minus_one;\\n\\n}\\n\",\n \"file_path\": \"src/afbdil/process.cpp\",\n \"rank\": 81,\n \"score\": 45.300674191601274\n },\n {\n \"content\": \" ret_map[\\\"operands\\\"] = json11::Json(operands_vec);\\n\\n return json11::Json(ret_map);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid Expr::all_as_sens(std::shared_ptr<Module>& module, std::shared_ptr<Process>& proc)\\n\\n{\\n\\n auto begin = proc->begin();\\n\\n if(begin->type() != InstructionType::Trigger)\\n\\n {\\n\\n std::cout << \\\"shit! begin of a process is not a trigger, during all_as_sens\\\\n\\\";\\n\\n return;\\n\\n }\\n\\n\\n\\n switch(_type)\\n\\n {\\n\\n case ExprType::VAR:\\n\\n begin->triggers()->push_back(std::make_pair(as_var(), Edge::EDGE));\\n\\n return;\\n\\n case ExprType::CONSTANT:\\n\",\n \"file_path\": \"src/afbdil/expr.cpp\",\n \"rank\": 82,\n \"score\": 44.816696764079225\n },\n {\n \"content\": \"#include <afbdil/instruction.h>\\n\\n\\n\\nusing namespace std;\\n\\nusing namespace afbd;\\n\\n\\n\\nstd::string instruction_type_to_str(InstructionType type)\\n\\n{\\n\\n\\tswitch(type)\\n\\n\\t{\\n\\n\\tcase InstructionType::Assign:\\n\\n\\t\\treturn \\\"assign\\\";\\n\\n\\tcase InstructionType::Delay:\\n\\n\\t\\treturn \\\"delay\\\";\\n\\n\\tcase InstructionType::Trigger:\\n\\n\\t\\treturn \\\"trigger\\\";\\n\\n\\t}\\n\\n}\\n\\n\\n\\nInstructionType str_to_instruction_type(std::string str)\\n\\n{\\n\",\n \"file_path\": \"src/afbdil/instruction.cpp\",\n \"rank\": 83,\n \"score\": 43.21114781406223\n },\n {\n \"content\": \"#include <afbdil/module.h>\\n\\n#include <iostream>\\n\\n#include <sstream>\\n\\n#include <sys/time.h>\\n\\n\\n\\nusing namespace std;\\n\\nusing namespace afbd;\\n\\n\\n\\nextern std::string no_slash(std::string& str);\\n\\n\\n\\nModule::Module(std::string name) {\\n\\n _vars = make_shared<VarContainer>();\\n\\n _procs = make_shared<ProcContainer>();\\n\\n\\n\\n _name = no_slash(name);\\n\\n _has_error = false;\\n\\n}\\n\\n\\n\\nshared_ptr<VarContainer> Module::vars() const {\\n\\n return _vars;\\n\",\n \"file_path\": \"src/afbdil/module.cpp\",\n \"rank\": 85,\n \"score\": 41.470189549295625\n },\n {\n \"content\": \" for(auto& child : *_operands)\\n\\n {\\n\\n int child_bit = child->bit();\\n\\n if(child_bit > ret)\\n\\n ret = child_bit;\\n\\n }\\n\\n return ret;\\n\\n}\\n\\n\\n\\nnamespace afbd {\\n\\n std::string to_string(ExprType type) {\\n\\n switch (type) {\\n\\n case ExprType::VAR:\\n\\n return \\\"var\\\";\\n\\n case ExprType::CONSTANT:\\n\\n return \\\"constant\\\";\\n\\n\\n\\n case ExprType::ADD:\\n\\n return \\\"add\\\";\\n\\n case ExprType::SUB:\\n\",\n \"file_path\": \"src/afbdil/expr.cpp\",\n \"rank\": 86,\n \"score\": 41.14330836663208\n },\n {\n \"content\": \"}\\n\\n\\n\\nvoid typeCheck(std::shared_ptr<afbd::Module> module)\\n\\n{\\n\\n\\tfor(auto process: *(module->procs()))\\n\\n\\t{\\n\\n\\t\\tauto instructions = process->all_instructions();\\n\\n\\t\\tfor(auto instruction: instructions)\\n\\n\\t\\t{\\n\\n\\t\\t\\tauto expr = instruction->expr();\\n\\n\\t\\t\\tauto dst = instruction->dst();\\n\\n\\t\\t\\tif(expr)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tint expr_len = exprCheck(module, expr, instruction->line());\\n\\n\\t\\t\\t\\tif(expr_len != -1 && dst && dst->type() == ExprType::VAR)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tint dst_len = dst->as_var()->bit();\\n\\n\\t\\t\\t\\t\\tif(dst_len != expr_len)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tstd::string str = \\\"type mismatch in assign \\\";\\n\",\n \"file_path\": \"src/afbdil/patternmatching.cpp\",\n \"rank\": 87,\n \"score\": 39.09170072217145\n },\n {\n \"content\": \"#include <memory>\\n\\n\\n\\n#include \\\"../../include/afbdil/patternmatching.h\\\"\\n\\n#include \\\"../../include/afbdil/expr.h\\\"\\n\\n#include \\\"../../include/afbdil/instruction.h\\\"\\n\\n\\n\\nusing namespace afbd;\\n\\n\\n\\nvoid reportDefect(std::shared_ptr<Module> module, std::string str, bool is_error, int line)\\n\\n{\\n\\n if(is_error)\\n\\n {\\n\\n std::cout << \\\"Error: \\\";\\n\\n module->set_error();\\n\\n }\\n\\n else\\n\\n std::cout << \\\"Warning: \\\";\\n\\n\\tstd::cout << str << \\\" in line \\\" << line << \\\".\\\\n\\\";\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/afbdil/patternmatching.cpp\",\n \"rank\": 89,\n \"score\": 38.34594776393211\n },\n {\n \"content\": \"\\n\\nstd::string Expr::binary_to_smv(std::string delim)\\n\\n{\\n\\n auto opl = get_operand(0);\\n\\n auto opr = get_operand(1);\\n\\n\\n\\n //std::cout << \\\"binary_to_smv called opl is \\\" << to_string(opl->type()) << \\\" opr is \\\" << to_string(opr->type()) << \\\"\\\\n\\\";\\n\\n //std::cout << to_json().dump() << \\\"\\\\n\\\";\\n\\n\\n\\n if(opr->type() == ExprType::CONSTANT)\\n\\n {\\n\\n while(opl->type() == ExprType::REDUCE_BOOL)\\n\\n opl = opl->get_operand(0);\\n\\n\\n\\n if(opl->type() >= ExprType::EQ && opr->type() <= ExprType::LE)\\n\\n return std::string(\\\"(\\\") + opl->to_smv() + \\\" \\\" + delim + \\\" \\\" + opr->to_smv(true) + \\\")\\\";\\n\\n }\\n\\n if(opl->type() == ExprType::CONSTANT)\\n\\n {\\n\\n while(opr->type() == ExprType::REDUCE_BOOL)\\n\",\n \"file_path\": \"src/afbdil/expr.cpp\",\n \"rank\": 90,\n \"score\": 38.22569587292211\n },\n {\n \"content\": \" return;\\n\\n default:\\n\\n for(auto& child : *_operands)\\n\\n child->all_as_sens(module, proc);\\n\\n return;\\n\\n }\\n\\n}\\n\\n\\n\\nstd::shared_ptr<Expr> Expr::substitute_clone(std::map<std::shared_ptr<Var>, std::shared_ptr<Expr>>& substitute_map)\\n\\n{\\n\\n switch(_type)\\n\\n {\\n\\n case ExprType::CONSTANT:\\n\\n {\\n\\n auto constant = as_constant();\\n\\n return std::make_shared<Expr>(std::make_shared<Constant>(constant->bit(), constant->value()));\\n\\n }\\n\\n case ExprType::VAR:\\n\\n return substitute_map[_var];\\n\\n default:\\n\",\n \"file_path\": \"src/afbdil/expr.cpp\",\n \"rank\": 93,\n \"score\": 37.41974106773634\n },\n {\n \"content\": \" llvm::Function *delayed_nonblocking_assign_update;\\n\\n llvm::Function *prepare_wait;\\n\\n llvm::Function *add_wait;\\n\\n llvm::Function *do_wait;\\n\\n\\n\\n llvm::Function *update;\\n\\n llvm::Function *mark_updated;\\n\\n\\n\\n void load_static_functions();\\n\\n\\n\\n\\n\\n llvm::Value *eval_expr(llvm::IRBuilder<> &builder, std::shared_ptr<afbd::Expr> expr);\\n\\n llvm::Function *transpile_process(std::shared_ptr<afbd::Process> proc);\\n\\npublic:\\n\\n llvm::Module* transpile(std::shared_ptr<afbd::Module> module, std::shared_ptr<std::fstream> fs);\\n\\n};\\n\",\n \"file_path\": \"include/transpiler/transpiler.h\",\n \"rank\": 94,\n \"score\": 36.94466638023935\n },\n {\n \"content\": \"void clkCheck(std::shared_ptr<afbd::Module> module)\\n\\n{\\n\\n\\tstd::set<std::shared_ptr<Var>> clk_vars;\\n\\n\\n\\n\\tfor(auto process : (*module->procs()))\\n\\n\\t{\\n\\n\\t\\tauto begin = process->begin();\\n\\n\\t\\tauto triggers = begin->triggers();\\n\\n\\t\\tif(triggers)\\n\\n\\t\\t{\\n\\n\\t\\t\\tfor(auto trigger: *triggers)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif(trigger.second != Edge::EDGE)\\n\\n\\t\\t\\t\\t\\tclk_vars.insert(trigger.first);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\tfor(auto process : (*module->procs()))\\n\\n\\t{\\n\",\n \"file_path\": \"src/afbdil/patternmatching.cpp\",\n \"rank\": 95,\n \"score\": 36.91181171505654\n },\n {\n \"content\": \"\\t//For trigger\\n\\n std::shared_ptr<TriggerContainer> _triggers;\\n\\n\\n\\npublic:\\n\\n\\texplicit Instruction(std::shared_ptr<Process> proc);\\n\\n\\texplicit Instruction(Process* proc);\\n\\n\\n\\n [[nodiscard]]\\n\\n std::shared_ptr<Expr> dst() const;\\n\\n void dst(const std::shared_ptr<Expr> &dst);\\n\\n\\n\\n [[nodiscard]]\\n\\n std::shared_ptr<Expr> expr() const;\\n\\n void expr(const std::shared_ptr<Expr> &expr);\\n\\n\\n\\n\\t[[nodiscard]]\\n\\n\\tAssignType assign_type() const;\\n\\n\\tvoid assign_type(AssignType assign_type);\\n\\n\\n\\n [[nodiscard]]\\n\",\n \"file_path\": \"include/afbdil/instruction.h\",\n \"rank\": 97,\n \"score\": 36.07117724841817\n },\n {\n \"content\": \"#include <fstream>\\n\\n#include <memory>\\n\\nusing namespace std;\\n\\nusing namespace afbd;\\n\\n\\n\\nUSING_YOSYS_NAMESPACE\\n\\n\\n\\ntypedef initializer_list<shared_ptr<Expr>> exl;\\n\\n#define lexpr(...) initializer_list<shared_ptr<Expr>> { __VA_ARGS__ }\\n\\n#define nexpr(...) make_shared<Expr>(__VA_ARGS__)\\n\\n#define nconst(...) make_shared<Constant>(__VA_ARGS__)\\n\\n\\n\\nint main(int argc, char** argv) {\\n\\n /*\\n\\n auto m2 = make_shared<afbd::Module>(\\\"counter\\\");\\n\\n auto a = m2->add_var(1, \\\"clk\\\");\\n\\n auto b = m2->add_var(1, \\\"rst\\\");\\n\\n auto t = m2->add_var(32, \\\"cnt\\\");\\n\\n auto t2 = m2->add_var(32, \\\"cn2\\\");\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 98,\n \"score\": 35.69949226852871\n },\n {\n \"content\": \"\\n\\nstd::string proc_type_to_str(ProcessType type)\\n\\n{\\n\\n\\tswitch(type)\\n\\n\\t{\\n\\n\\tcase ProcessType::Initial:\\n\\n\\t\\treturn \\\"initial\\\";\\n\\n\\tcase ProcessType::Always:\\n\\n\\t\\treturn \\\"always\\\";\\n\\n\\t}\\n\\n}\\n\\n\\n\\nProcessType str_to_proc_type(std::string str)\\n\\n{\\n\\n\\tif(str == \\\"initial\\\")\\n\\n\\t\\treturn ProcessType::Initial;\\n\\n\\telse if(str == \\\"always\\\")\\n\\n\\t\\treturn ProcessType::Always;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/afbdil/process.cpp\",\n \"rank\": 99,\n \"score\": 35.565097749114884\n }\n]","isConversational":false}}},{"rowIdx":475,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Editor/HairParticleWindow.cpp"},"repo_name":{"kind":"string","value":"mewbak/WickedEngine"},"commit":{"kind":"string","value":"572bc7836fa14793b1c3b3b4733ddc61f1da5887"},"file_code":{"kind":"string","value":"#include \"stdafx.h\"\n#include \"HairParticleWindow.h\"\n\nusing namespace std;\nusing namespace wiECS;\nusing namespace wiScene;\n\nHairParticleWindow::HairParticleWindow(wiGUI* gui) : GUI(gui)\n{\n\tassert(GUI && \"Invalid GUI!\");\n\n\tfloat screenW = (float)wiRenderer::GetDevice()->GetScreenWidth();\n\tfloat screenH = (float)wiRenderer::GetDevice()->GetScreenHeight();\n\n\thairWindow = new wiWindow(GUI, \"Hair Particle System Window\");\n\thairWindow->SetSize(XMFLOAT2(800, 600));\n\tGUI->AddWidget(hairWindow);\n\n\tfloat x = 150;\n\tfloat y = 20;\n\tfloat step = 35;\n\n\taddButton = new wiButton(\"Add Hair Particle System\");\n\taddButton->SetPos(XMFLOAT2(x, y += step));\n\taddButton->SetSize(XMFLOAT2(200, 30));\n\taddButton->OnClick([&](wiEventArgs args) {\n\t\tScene& scene = wiScene::GetScene();\n\t\tscene.Entity_CreateHair(\"editorHair\");\n\t});\n\taddButton->SetTooltip(\"Add new hair particle system.\");\n\thairWindow->AddWidget(addButton);\n\n\tmeshComboBox = new wiComboBox(\"Mesh: \");\n\tmeshComboBox->SetSize(XMFLOAT2(300, 25));\n\tmeshComboBox->SetPos(XMFLOAT2(x, y += step));\n\tmeshComboBox->SetEnabled(false);\n\tmeshComboBox->OnSelect([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\tif (args.iValue == 0)\n\t\t\t{\n\t\t\t\thair->meshID = INVALID_ENTITY;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tScene& scene = wiScene::GetScene();\n\t\t\t\thair->meshID = scene.meshes.GetEntity(args.iValue - 1);\n\t\t\t}\n\t\t}\n\t});\n\tmeshComboBox->SetTooltip(\"Choose a mesh where hair will grow from...\");\n\thairWindow->AddWidget(meshComboBox);\n\n\tcountSlider = new wiSlider(0, 100000, 1000, 100000, \"Strand Count: \");\n\tcountSlider->SetSize(XMFLOAT2(360, 30));\n\tcountSlider->SetPos(XMFLOAT2(x, y += step * 2));\n\tcountSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->strandCount = (uint32_t)args.iValue;\n\t\t}\n\t});\n\tcountSlider->SetEnabled(false);\n\tcountSlider->SetTooltip(\"Set hair strand count\");\n\thairWindow->AddWidget(countSlider);\n\n\tlengthSlider = new wiSlider(0, 4, 1, 100000, \"Particle Length: \");\n\tlengthSlider->SetSize(XMFLOAT2(360, 30));\n\tlengthSlider->SetPos(XMFLOAT2(x, y += step));\n\tlengthSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->length = args.fValue;\n\t\t}\n\t});\n\tlengthSlider->SetEnabled(false);\n\tlengthSlider->SetTooltip(\"Set hair strand length\");\n\thairWindow->AddWidget(lengthSlider);\n\n\tstiffnessSlider = new wiSlider(0, 20, 5, 100000, \"Particle Stiffness: \");\n\tstiffnessSlider->SetSize(XMFLOAT2(360, 30));\n\tstiffnessSlider->SetPos(XMFLOAT2(x, y += step * 2));\n\tstiffnessSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->stiffness = args.fValue;\n\t\t}\n\t});\n\tstiffnessSlider->SetEnabled(false);\n\tstiffnessSlider->SetTooltip(\"Set hair strand stiffness, how much it tries to get back to rest position.\");\n\thairWindow->AddWidget(stiffnessSlider);\n\n\trandomnessSlider = new wiSlider(0, 1, 0.2f, 100000, \"Particle Randomness: \");\n\trandomnessSlider->SetSize(XMFLOAT2(360, 30));\n\trandomnessSlider->SetPos(XMFLOAT2(x, y += step));\n\trandomnessSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->randomness = args.fValue;\n\t\t}\n\t});\n\trandomnessSlider->SetEnabled(false);\n\trandomnessSlider->SetTooltip(\"Set hair length randomization factor. This will affect randomness of hair lengths.\");\n\thairWindow->AddWidget(randomnessSlider);\n\n\tsegmentcountSlider = new wiSlider(1, 10, 1, 9, \"Segment Count: \");\n\tsegmentcountSlider->SetSize(XMFLOAT2(360, 30));\n\tsegmentcountSlider->SetPos(XMFLOAT2(x, y += step));\n\tsegmentcountSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->segmentCount = (uint32_t)args.iValue;\n\t\t}\n\t});\n\tsegmentcountSlider->SetEnabled(false);\n\tsegmentcountSlider->SetTooltip(\"Set hair strand segment count. This will affect simulation quality and performance.\");\n\thairWindow->AddWidget(segmentcountSlider);\n\n\trandomSeedSlider = new wiSlider(1, 12345, 1, 12344, \"Random seed: \");\n\trandomSeedSlider->SetSize(XMFLOAT2(360, 30));\n\trandomSeedSlider->SetPos(XMFLOAT2(x, y += step));\n\trandomSeedSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->randomSeed = (uint32_t)args.iValue;\n\t\t}\n\t});\n\trandomSeedSlider->SetEnabled(false);\n\trandomSeedSlider->SetTooltip(\"Set hair system-wide random seed value. This will affect hair patch placement randomization.\");\n\thairWindow->AddWidget(randomSeedSlider);\n\n\tviewDistanceSlider = new wiSlider(0, 1000, 100, 10000, \"View distance: \");\n\tviewDistanceSlider->SetSize(XMFLOAT2(360, 30));\n\tviewDistanceSlider->SetPos(XMFLOAT2(x, y += step));\n\tviewDistanceSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->viewDistance = args.fValue;\n\t\t}\n\t\t});\n\tviewDistanceSlider->SetEnabled(false);\n\tviewDistanceSlider->SetTooltip(\"Set view distance. After this, particles will be faded out.\");\n\thairWindow->AddWidget(viewDistanceSlider);\n\n\thairWindow->Translate(XMFLOAT3(200, 50, 0));\n\thairWindow->SetVisible(false);\n\n\tSetEntity(entity);\n}\n\nHairParticleWindow::~HairParticleWindow()\n{\n\thairWindow->RemoveWidgets(true);\n\tGUI->RemoveWidget(hairWindow);\n\tSAFE_DELETE(hairWindow);\n}\n\nvoid HairParticleWindow::SetEntity(Entity entity)\n{\n\tthis->entity = entity;\n\n\tauto hair = GetHair();\n\n\tif (hair != nullptr)\n\t{\n\t\tlengthSlider->SetValue(hair->length);\n\t\tstiffnessSlider->SetValue(hair->stiffness);\n\t\trandomnessSlider->SetValue(hair->randomness);\n\t\tcountSlider->SetValue((float)hair->strandCount);\n\t\tsegmentcountSlider->SetValue((float)hair->segmentCount);\n\t\trandomSeedSlider->SetValue((float)hair->randomSeed);\n\t\tviewDistanceSlider->SetValue(hair->viewDistance);\n\t}\n\telse\n\t{\n\t}\n\n}\n\nwiHairParticle* HairParticleWindow::GetHair()\n{\n\tif (entity == INVALID_ENTITY)\n\t{\n\t\treturn nullptr;\n\t}\n\n\tScene& scene = wiScene::GetScene();\n\twiHairParticle* hair = scene.hairs.GetComponent(entity);\n\n\treturn hair;\n}\n\nvoid HairParticleWindow::UpdateData()\n{\n\tauto emitter = GetHair();\n\tif (emitter == nullptr)\n\t{\n\t\treturn;\n\t}\n\n\tScene& scene = wiScene::GetScene();\n\n\tmeshComboBox->ClearItems();\n\tmeshComboBox->AddItem(\"NO MESH\");\n\tfor (size_t i = 0; i < scene.meshes.GetCount(); ++i)\n\t{\n\t\tEntity entity = scene.meshes.GetEntity(i);\n\t\tconst NameComponent& name = *scene.names.GetComponent(entity);\n\t\tmeshComboBox->AddItem(name.name);\n\n\t\tif (emitter->meshID == entity)\n\t\t{\n\t\t\tmeshComboBox->SetSelected((int)i + 1);\n\t\t}\n\t}\n}\n"},"prefix":{"kind":"string","value":"#include \"stdafx.h\"\n#include \"HairParticleWindow.h\"\n\nusing namespace std;\nusing namespace wiECS;\nusing namespace wiScene;\n\nHairParticleWindow::HairParticleWindow(wiGUI* gui) : GUI(gui)\n{\n\tassert(GUI && \"Invalid GUI!\");\n\n\tfloat screenW = (float)wiRenderer::GetDevice()->GetScreenWidth();\n\tfloat screenH = (float)wiRenderer::GetDevice()->GetScreenHeight();\n\n\thairWindow = new wiWindow(GUI, \"Hair Particle System Window\");\n\thairWindow->SetSize(XMFLOAT2(800, 600));\n\tGUI->AddWidget(hairWindow);\n\n\tfloat x = 150;\n\tfloat y = 20;\n\tfloat step = 35;\n\n\taddButton = new wiButton(\"Add Hair Particle System\");\n\taddButton->SetPos(XMFLOAT2(x, y += step));\n\taddButton->SetSize(XMFLOAT2(200, 30));\n\t"},"suffix":{"kind":"string","value":";\n\taddButton->SetTooltip(\"Add new hair particle system.\");\n\thairWindow->AddWidget(addButton);\n\n\tmeshComboBox = new wiComboBox(\"Mesh: \");\n\tmeshComboBox->SetSize(XMFLOAT2(300, 25));\n\tmeshComboBox->SetPos(XMFLOAT2(x, y += step));\n\tmeshComboBox->SetEnabled(false);\n\tmeshComboBox->OnSelect([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\tif (args.iValue == 0)\n\t\t\t{\n\t\t\t\thair->meshID = INVALID_ENTITY;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tScene& scene = wiScene::GetScene();\n\t\t\t\thair->meshID = scene.meshes.GetEntity(args.iValue - 1);\n\t\t\t}\n\t\t}\n\t});\n\tmeshComboBox->SetTooltip(\"Choose a mesh where hair will grow from...\");\n\thairWindow->AddWidget(meshComboBox);\n\n\tcountSlider = new wiSlider(0, 100000, 1000, 100000, \"Strand Count: \");\n\tcountSlider->SetSize(XMFLOAT2(360, 30));\n\tcountSlider->SetPos(XMFLOAT2(x, y += step * 2));\n\tcountSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->strandCount = (uint32_t)args.iValue;\n\t\t}\n\t});\n\tcountSlider->SetEnabled(false);\n\tcountSlider->SetTooltip(\"Set hair strand count\");\n\thairWindow->AddWidget(countSlider);\n\n\tlengthSlider = new wiSlider(0, 4, 1, 100000, \"Particle Length: \");\n\tlengthSlider->SetSize(XMFLOAT2(360, 30));\n\tlengthSlider->SetPos(XMFLOAT2(x, y += step));\n\tlengthSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->length = args.fValue;\n\t\t}\n\t});\n\tlengthSlider->SetEnabled(false);\n\tlengthSlider->SetTooltip(\"Set hair strand length\");\n\thairWindow->AddWidget(lengthSlider);\n\n\tstiffnessSlider = new wiSlider(0, 20, 5, 100000, \"Particle Stiffness: \");\n\tstiffnessSlider->SetSize(XMFLOAT2(360, 30));\n\tstiffnessSlider->SetPos(XMFLOAT2(x, y += step * 2));\n\tstiffnessSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->stiffness = args.fValue;\n\t\t}\n\t});\n\tstiffnessSlider->SetEnabled(false);\n\tstiffnessSlider->SetTooltip(\"Set hair strand stiffness, how much it tries to get back to rest position.\");\n\thairWindow->AddWidget(stiffnessSlider);\n\n\trandomnessSlider = new wiSlider(0, 1, 0.2f, 100000, \"Particle Randomness: \");\n\trandomnessSlider->SetSize(XMFLOAT2(360, 30));\n\trandomnessSlider->SetPos(XMFLOAT2(x, y += step));\n\trandomnessSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->randomness = args.fValue;\n\t\t}\n\t});\n\trandomnessSlider->SetEnabled(false);\n\trandomnessSlider->SetTooltip(\"Set hair length randomization factor. This will affect randomness of hair lengths.\");\n\thairWindow->AddWidget(randomnessSlider);\n\n\tsegmentcountSlider = new wiSlider(1, 10, 1, 9, \"Segment Count: \");\n\tsegmentcountSlider->SetSize(XMFLOAT2(360, 30));\n\tsegmentcountSlider->SetPos(XMFLOAT2(x, y += step));\n\tsegmentcountSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->segmentCount = (uint32_t)args.iValue;\n\t\t}\n\t});\n\tsegmentcountSlider->SetEnabled(false);\n\tsegmentcountSlider->SetTooltip(\"Set hair strand segment count. This will affect simulation quality and performance.\");\n\thairWindow->AddWidget(segmentcountSlider);\n\n\trandomSeedSlider = new wiSlider(1, 12345, 1, 12344, \"Random seed: \");\n\trandomSeedSlider->SetSize(XMFLOAT2(360, 30));\n\trandomSeedSlider->SetPos(XMFLOAT2(x, y += step));\n\trandomSeedSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->randomSeed = (uint32_t)args.iValue;\n\t\t}\n\t});\n\trandomSeedSlider->SetEnabled(false);\n\trandomSeedSlider->SetTooltip(\"Set hair system-wide random seed value. This will affect hair patch placement randomization.\");\n\thairWindow->AddWidget(randomSeedSlider);\n\n\tviewDistanceSlider = new wiSlider(0, 1000, 100, 10000, \"View distance: \");\n\tviewDistanceSlider->SetSize(XMFLOAT2(360, 30));\n\tviewDistanceSlider->SetPos(XMFLOAT2(x, y += step));\n\tviewDistanceSlider->OnSlide([&](wiEventArgs args) {\n\t\tauto hair = GetHair();\n\t\tif (hair != nullptr)\n\t\t{\n\t\t\thair->viewDistance = args.fValue;\n\t\t}\n\t\t});\n\tviewDistanceSlider->SetEnabled(false);\n\tviewDistanceSlider->SetTooltip(\"Set view distance. After this, particles will be faded out.\");\n\thairWindow->AddWidget(viewDistanceSlider);\n\n\thairWindow->Translate(XMFLOAT3(200, 50, 0));\n\thairWindow->SetVisible(false);\n\n\tSetEntity(entity);\n}\n\nHairParticleWindow::~HairParticleWindow()\n{\n\thairWindow->RemoveWidgets(true);\n\tGUI->RemoveWidget(hairWindow);\n\tSAFE_DELETE(hairWindow);\n}\n\nvoid HairParticleWindow::SetEntity(Entity entity)\n{\n\tthis->entity = entity;\n\n\tauto hair = GetHair();\n\n\tif (hair != nullptr)\n\t{\n\t\tlengthSlider->SetValue(hair->length);\n\t\tstiffnessSlider->SetValue(hair->stiffness);\n\t\trandomnessSlider->SetValue(hair->randomness);\n\t\tcountSlider->SetValue((float)hair->strandCount);\n\t\tsegmentcountSlider->SetValue((float)hair->segmentCount);\n\t\trandomSeedSlider->SetValue((float)hair->randomSeed);\n\t\tviewDistanceSlider->SetValue(hair->viewDistance);\n\t}\n\telse\n\t{\n\t}\n\n}\n\nwiHairParticle* HairParticleWindow::GetHair()\n{\n\tif (entity == INVALID_ENTITY)\n\t{\n\t\treturn nullptr;\n\t}\n\n\tScene& scene = wiScene::GetScene();\n\twiHairParticle* hair = scene.hairs.GetComponent(entity);\n\n\treturn hair;\n}\n\nvoid HairParticleWindow::UpdateData()\n{\n\tauto emitter = GetHair();\n\tif (emitter == nullptr)\n\t{\n\t\treturn;\n\t}\n\n\tScene& scene = wiScene::GetScene();\n\n\tmeshComboBox->ClearItems();\n\tmeshComboBox->AddItem(\"NO MESH\");\n\tfor (size_t i = 0; i < scene.meshes.GetCount(); ++i)\n\t{\n\t\tEntity entity = scene.meshes.GetEntity(i);\n\t\tconst NameComponent& name = *scene.names.GetComponent(entity);\n\t\tmeshComboBox->AddItem(name.name);\n\n\t\tif (emitter->meshID == entity)\n\t\t{\n\t\t\tmeshComboBox->SetSelected((int)i + 1);\n\t\t}\n\t}\n}\n"},"middle":{"kind":"string","value":"addButton->OnClick([&](wiEventArgs args) {\n\t\tScene& scene = wiScene::GetScene();\n\t\tscene.Entity_CreateHair(\"editorHair\");\n\t})"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"class wiGUI;\n","file_path":"Editor/HairParticleWindow.h","rank":0,"score":231629.97973045165},{"content":"class HairParticleWindow\n\n{\n\npublic:\n\n\tHairParticleWindow(wiGUI* gui);\n\n\t~HairParticleWindow();\n\n\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\tvoid UpdateData();\n\n\n\n\twiScene::wiHairParticle* GetHair();\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiWindow*\thairWindow;\n\n\n\n\twiButton* addButton;\n\n\twiComboBox*\tmeshComboBox;\n\n\twiSlider* lengthSlider;\n\n\twiSlider* stiffnessSlider;\n\n\twiSlider* randomnessSlider;\n\n\twiSlider* countSlider;\n\n\twiSlider* segmentcountSlider;\n\n\twiSlider* randomSeedSlider;\n\n\twiSlider* viewDistanceSlider;\n\n\n\n};\n\n\n","file_path":"Editor/HairParticleWindow.h","rank":1,"score":212444.14969631986},{"content":"class MaterialWindow;\n\n\n","file_path":"Editor/HairParticleWindow.h","rank":2,"score":187915.48251923},{"content":"class wiWindow;\n","file_path":"Editor/HairParticleWindow.h","rank":3,"score":187915.48251923},{"content":"#pragma once\n\n\n","file_path":"Editor/HairParticleWindow.h","rank":4,"score":184998.02468382282},{"content":"class HairParticleWindow;\n","file_path":"Editor/Editor.h","rank":16,"score":179151.22972069826},{"content":"class wiLabel;\n","file_path":"Editor/HairParticleWindow.h","rank":17,"score":173662.68405565852},{"content":"class wiSlider;\n","file_path":"Editor/HairParticleWindow.h","rank":18,"score":173662.68405565852},{"content":"class wiButton;\n\n\n","file_path":"Editor/HairParticleWindow.h","rank":19,"score":173662.68405565852},{"content":"class wiColorPicker;\n","file_path":"Editor/HairParticleWindow.h","rank":20,"score":168500.4400604978},{"content":"class wiCheckBox;\n","file_path":"Editor/HairParticleWindow.h","rank":21,"score":168500.4400604978},{"content":"class wiComboBox;\n","file_path":"Editor/HairParticleWindow.h","rank":22,"score":168500.4400604978},{"content":"class wiHairParticle\n\n{\n\nprivate:\n\n\tstd::unique_ptr<wiGraphics::GPUBuffer> cb;\n\n\tstd::unique_ptr<wiGraphics::GPUBuffer> particleBuffer;\n\n\tstd::unique_ptr<wiGraphics::GPUBuffer> simulationBuffer;\n\npublic:\n\n\n\n\tvoid UpdateCPU(const TransformComponent& transform, const MeshComponent& mesh, float dt);\n\n\tvoid UpdateGPU(const MeshComponent& mesh, const MaterialComponent& material, wiGraphics::CommandList cmd) const;\n\n\tvoid Draw(const CameraComponent& camera, const MaterialComponent& material, RENDERPASS renderPass, bool transparent, wiGraphics::CommandList cmd) const;\n\n\n\n\tenum FLAGS\n\n\t{\n\n\t\tEMPTY = 0,\n\n\t\tREGENERATE_FRAME = 1 << 0,\n\n\t};\n\n\tuint32_t _flags = EMPTY;\n\n\n\n\twiECS::Entity meshID = wiECS::INVALID_ENTITY;\n","file_path":"WickedEngine/wiHairParticle.h","rank":23,"score":139154.2027310102},{"content":"#pragma once\n\n#include \"CommonInclude.h\"\n\n#include \"wiGraphicsDevice.h\"\n\n#include \"wiEnums.h\"\n\n#include \"wiECS.h\"\n\n#include \"wiScene_Decl.h\"\n\n#include \"wiIntersect.h\"\n\n\n\n#include <memory>\n\n\n","file_path":"WickedEngine/wiHairParticle.h","rank":24,"score":119554.29850783893},{"content":"\n\n\tuint32_t strandCount = 0;\n\n\tuint32_t segmentCount = 1;\n\n\tuint32_t randomSeed = 1;\n\n\tfloat length = 1.0f;\n\n\tfloat stiffness = 10.0f;\n\n\tfloat randomness = 0.2f;\n\n\tfloat viewDistance = 200;\n\n\n\n\t// Non-serialized attributes:\n\n\tXMFLOAT4X4 world;\n\n\tXMFLOAT4X4 worldPrev;\n\n\tAABB aabb;\n\n\n\n\tvoid Serialize(wiArchive& archive, uint32_t seed = 0);\n\n\n\n\tstatic void LoadShaders();\n\n\tstatic void Initialize();\n\n};\n\n\n\n}\n","file_path":"WickedEngine/wiHairParticle.h","rank":25,"score":119553.06701506878},{"content":"class wiGUI;\n","file_path":"Editor/LightWindow.h","rank":26,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/CameraWindow.h","rank":27,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/EmitterWindow.h","rank":28,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/RendererWindow.h","rank":29,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/OceanWindow.h","rank":30,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/DecalWindow.h","rank":31,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/ObjectWindow.h","rank":32,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/WeatherWindow.h","rank":33,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/PostprocessWindow.h","rank":34,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/SoundWindow.h","rank":35,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/MeshWindow.h","rank":36,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/MaterialWindow.h","rank":37,"score":119404.77633694654},{"content":"class wiGUI;\n","file_path":"Editor/AnimationWindow.h","rank":38,"score":119404.77633694654},{"content":"#include \"wiHairParticle.h\"\n\n#include \"wiRenderer.h\"\n\n#include \"wiResourceManager.h\"\n\n#include \"wiMath.h\"\n\n#include \"wiIntersect.h\"\n\n#include \"wiRandom.h\"\n\n#include \"ResourceMapping.h\"\n\n#include \"wiArchive.h\"\n\n#include \"ShaderInterop.h\"\n\n#include \"wiTextureHelper.h\"\n\n#include \"wiScene.h\"\n\n#include \"ShaderInterop_HairParticle.h\"\n\n#include \"wiBackLog.h\"\n\n\n\nusing namespace std;\n\nusing namespace wiGraphics;\n\n\n\nnamespace wiScene\n\n{\n\n\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":39,"score":115918.96405765248},{"content":"\n\n\tdevice->BindComputeShader(&cs_simulate, cmd);\n\n\n\n\tHairParticleCB hcb;\n\n\thcb.xWorld = world;\n\n\thcb.xColor = material.baseColor;\n\n\thcb.xHairRegenerate = (_flags & REGENERATE_FRAME) ? 1 : 0;\n\n\thcb.xLength = length;\n\n\thcb.xStiffness = stiffness;\n\n\thcb.xHairRandomness = randomness;\n\n\thcb.xHairStrandCount = strandCount;\n\n\thcb.xHairSegmentCount = std::max(segmentCount, 1u);\n\n\thcb.xHairParticleCount = hcb.xHairStrandCount * hcb.xHairSegmentCount;\n\n\thcb.xHairRandomSeed = randomSeed;\n\n\thcb.xHairViewDistance = viewDistance;\n\n\thcb.xHairBaseMeshIndexCount = (uint)mesh.indices.size();\n\n\thcb.xHairBaseMeshVertexPositionStride = sizeof(MeshComponent::Vertex_POS);\n\n\t// segmentCount will be loop in the shader, not a threadgroup so we don't need it here:\n\n\thcb.xHairNumDispatchGroups = (uint)ceilf((float)strandCount / (float)THREADCOUNT_SIMULATEHAIR);\n\n\tdevice->UpdateBuffer(cb.get(), &hcb, cmd);\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":40,"score":115901.83683463967},{"content":"\n\n\t\t\tbd.Usage = USAGE_DEFAULT;\n\n\t\t\tbd.ByteWidth = sizeof(HairParticleCB);\n\n\t\t\tbd.BindFlags = BIND_CONSTANT_BUFFER;\n\n\t\t\tbd.CPUAccessFlags = 0;\n\n\t\t\tbd.MiscFlags = 0;\n\n\t\t\twiRenderer::GetDevice()->CreateBuffer(&bd, nullptr, cb.get());\n\n\t\t}\n\n\t}\n\n\n\n}\n\nvoid wiHairParticle::UpdateGPU(const MeshComponent& mesh, const MaterialComponent& material, CommandList cmd) const\n\n{\n\n\tif (strandCount == 0 || particleBuffer == nullptr)\n\n\t{\n\n\t\treturn;\n\n\t}\n\n\n\n\tGraphicsDevice* device = wiRenderer::GetDevice();\n\n\tdevice->EventBegin(\"HairParticle - UpdateRenderData\", cmd);\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":41,"score":115896.08290720379},{"content":"\t{\n\n\t\tarchive << _flags;\n\n\t\twiECS::SerializeEntity(archive, meshID, seed);\n\n\t\tarchive << strandCount;\n\n\t\tarchive << segmentCount;\n\n\t\tarchive << randomSeed;\n\n\t\tarchive << length;\n\n\t\tarchive << stiffness;\n\n\t\tarchive << randomness;\n\n\t\tarchive << viewDistance;\n\n\t}\n\n}\n\n\n\n\n\nvoid wiHairParticle::LoadShaders()\n\n{\n\n\tstd::string path = wiRenderer::GetShaderPath();\n\n\n\n\twiRenderer::LoadVertexShader(vs, \"hairparticleVS.cso\");\n\n\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":42,"score":115895.73615551925},{"content":"\t\t}\n\n\t\tdevice->BindPipelineState(&PSO_wire, cmd);\n\n\t\tdevice->BindResource(VS, wiTextureHelper::getWhite(), TEXSLOT_ONDEMAND0, cmd);\n\n\t}\n\n\telse\n\n\t{\n\n\t\tdevice->BindPipelineState(&PSO[renderPass][transparent], cmd);\n\n\n\n\t\tconst GPUResource* res[] = {\n\n\t\t\tmaterial.GetBaseColorMap()\n\n\t\t};\n\n\t\tdevice->BindResources(PS, res, TEXSLOT_ONDEMAND0, arraysize(res), cmd);\n\n\t\tdevice->BindResources(VS, res, TEXSLOT_ONDEMAND0, arraysize(res), cmd);\n\n\t}\n\n\n\n\tdevice->BindConstantBuffer(VS, cb.get(), CB_GETBINDSLOT(HairParticleCB), cmd);\n\n\n\n\tdevice->BindResource(VS, particleBuffer.get(), 0, cmd);\n\n\n\n\tdevice->Draw(strandCount * 12 * std::max(segmentCount, 1u), 0, cmd);\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":43,"score":115894.5111853809},{"content":"\tdevice->EventEnd(cmd);\n\n}\n\n\n\nvoid wiHairParticle::Draw(const CameraComponent& camera, const MaterialComponent& material, RENDERPASS renderPass, bool transparent, CommandList cmd) const\n\n{\n\n\tif (strandCount == 0 || cb == nullptr)\n\n\t{\n\n\t\treturn;\n\n\t}\n\n\n\n\tGraphicsDevice* device = wiRenderer::GetDevice();\n\n\tdevice->EventBegin(\"HairParticle - Draw\", cmd);\n\n\n\n\tdevice->BindStencilRef(STENCILREF_DEFAULT, cmd);\n\n\n\n\tif (wiRenderer::IsWireRender())\n\n\t{\n\n\t\tif (transparent || renderPass == RENDERPASS_DEPTHONLY)\n\n\t\t{\n\n\t\t\treturn;\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":44,"score":115894.43957590112},{"content":"\tbld.IndependentBlendEnable = false;\n\n\twiRenderer::GetDevice()->CreateBlendState(&bld, &bs[1]);\n\n\n\n\tLoadShaders();\n\n\n\n\twiBackLog::post(\"wiHairParticle Initialized\");\n\n}\n\n\n\n}\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":45,"score":115894.02306004026},{"content":"\t\t\tcb.reset(new GPUBuffer);\n\n\t\t\tparticleBuffer.reset(new GPUBuffer);\n\n\t\t\tsimulationBuffer.reset(new GPUBuffer);\n\n\n\n\t\t\tGPUBufferDesc bd;\n\n\t\t\tbd.Usage = USAGE_DEFAULT;\n\n\t\t\tbd.BindFlags = BIND_SHADER_RESOURCE | BIND_UNORDERED_ACCESS;\n\n\t\t\tbd.CPUAccessFlags = 0;\n\n\t\t\tbd.MiscFlags = RESOURCE_MISC_BUFFER_STRUCTURED;\n\n\n\n\t\t\tif (strandCount*segmentCount > 0)\n\n\t\t\t{\n\n\t\t\t\tbd.StructureByteStride = sizeof(Patch);\n\n\t\t\t\tbd.ByteWidth = bd.StructureByteStride * strandCount * segmentCount;\n\n\t\t\t\twiRenderer::GetDevice()->CreateBuffer(&bd, nullptr, particleBuffer.get());\n\n\n\n\t\t\t\tbd.StructureByteStride = sizeof(PatchSimulationData);\n\n\t\t\t\tbd.ByteWidth = bd.StructureByteStride * strandCount * segmentCount;\n\n\t\t\t\twiRenderer::GetDevice()->CreateBuffer(&bd, nullptr, simulationBuffer.get());\n\n\t\t\t}\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":46,"score":115892.91929072587},{"content":"\n\n\tdevice->BindConstantBuffer(CS, cb.get(), CB_GETBINDSLOT(HairParticleCB), cmd);\n\n\n\n\tGPUResource* uavs[] = {\n\n\t\tparticleBuffer.get(),\n\n\t\tsimulationBuffer.get()\n\n\t};\n\n\tdevice->BindUAVs(CS, uavs, 0, arraysize(uavs), cmd);\n\n\n\n\tGPUResource* res[] = {\n\n\t\tmesh.indexBuffer.get(),\n\n\t\tmesh.streamoutBuffer_POS != nullptr ? mesh.streamoutBuffer_POS.get() : mesh.vertexBuffer_POS.get(),\n\n\t};\n\n\tdevice->BindResources(CS, res, TEXSLOT_ONDEMAND0, arraysize(res), cmd);\n\n\n\n\tdevice->Dispatch(hcb.xHairNumDispatchGroups, 1, 1, cmd);\n\n\n\n\tdevice->UnbindUAVs(0, arraysize(uavs), cmd);\n\n\tdevice->UnbindResources(TEXSLOT_ONDEMAND0, arraysize(res), cmd);\n\n\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":47,"score":115892.89619821782},{"content":"static VertexShader vs;\n\nstatic PixelShader ps_alphatestonly;\n\nstatic PixelShader ps_deferred;\n\nstatic PixelShader ps_forward;\n\nstatic PixelShader ps_forward_transparent;\n\nstatic PixelShader ps_tiledforward;\n\nstatic PixelShader ps_tiledforward_transparent;\n\nstatic PixelShader ps_simplest;\n\nstatic ComputeShader cs_simulate;\n\nstatic DepthStencilState dss_default, dss_equal, dss_rejectopaque_keeptransparent;\n\nstatic RasterizerState rs, ncrs, wirers;\n\nstatic BlendState bs[2]; \n\nstatic PipelineState PSO[RENDERPASS_COUNT][2];\n\nstatic PipelineState PSO_wire;\n\n\n\nvoid wiHairParticle::UpdateCPU(const TransformComponent& transform, const MeshComponent& mesh, float dt)\n\n{\n\n\tworld = transform.world;\n\n\n\n\tXMFLOAT3 _min = mesh.aabb.getMin();\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":48,"score":115892.09147867565},{"content":"\n\n\tdevice->EventEnd(cmd);\n\n}\n\n\n\n\n\nvoid wiHairParticle::Serialize(wiArchive& archive, uint32_t seed)\n\n{\n\n\tif (archive.IsReadMode())\n\n\t{\n\n\t\tarchive >> _flags;\n\n\t\twiECS::SerializeEntity(archive, meshID, seed);\n\n\t\tarchive >> strandCount;\n\n\t\tarchive >> segmentCount;\n\n\t\tarchive >> randomSeed;\n\n\t\tarchive >> length;\n\n\t\tarchive >> stiffness;\n\n\t\tarchive >> randomness;\n\n\t\tarchive >> viewDistance;\n\n\t}\n\n\telse\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":49,"score":115892.05982738202},{"content":"\n\n\n\n}\n\nvoid wiHairParticle::Initialize()\n\n{\n\n\n\n\tRasterizerStateDesc rsd;\n\n\trsd.FillMode = FILL_SOLID;\n\n\trsd.CullMode = CULL_BACK;\n\n\trsd.FrontCounterClockwise = true;\n\n\trsd.DepthBias = 0;\n\n\trsd.DepthBiasClamp = 0;\n\n\trsd.SlopeScaledDepthBias = 0;\n\n\trsd.DepthClipEnable = true;\n\n\trsd.MultisampleEnable = false;\n\n\trsd.AntialiasedLineEnable = false;\n\n\twiRenderer::GetDevice()->CreateRasterizerState(&rsd, &rs);\n\n\n\n\trsd.FillMode = FILL_SOLID;\n\n\trsd.CullMode = CULL_NONE;\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":50,"score":115890.54598057654},{"content":"\tXMFLOAT3 _max = mesh.aabb.getMax();\n\n\n\n\t_max.x += length;\n\n\t_max.y += length;\n\n\t_max.z += length;\n\n\n\n\t_min.x -= length;\n\n\t_min.y -= length;\n\n\t_min.z -= length;\n\n\n\n\taabb = AABB(_min, _max);\n\n\taabb = aabb.transform(world);\n\n\n\n\tif (dt > 0)\n\n\t{\n\n\t\t_flags &= ~REGENERATE_FRAME;\n\n\t\tif (cb == nullptr || (strandCount * segmentCount) != particleBuffer->GetDesc().ByteWidth / sizeof(Patch))\n\n\t\t{\n\n\t\t\t_flags |= REGENERATE_FRAME;\n\n\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":51,"score":115887.6209926083},{"content":"\n\n\t\t\t\tif (j == 1)\n\n\t\t\t\t{\n\n\t\t\t\t\tdesc.dss = &dss_rejectopaque_keeptransparent; // transparent\n\n\t\t\t\t}\n\n\n\n\t\t\t\tdevice->CreatePipelineState(&desc, &PSO[i][j]);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\n\n\t{\n\n\t\tPipelineStateDesc desc;\n\n\t\tdesc.vs = &vs;\n\n\t\tdesc.ps = &ps_simplest;\n\n\t\tdesc.bs = &bs[0];\n\n\t\tdesc.rs = &wirers;\n\n\t\tdesc.dss = &dss_default;\n\n\t\tdevice->CreatePipelineState(&desc, &PSO_wire);\n\n\t}\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":52,"score":115883.33383766063},{"content":"\trsd.FrontCounterClockwise = true;\n\n\trsd.DepthBias = 0;\n\n\trsd.DepthBiasClamp = 0;\n\n\trsd.SlopeScaledDepthBias = 0;\n\n\trsd.DepthClipEnable = true;\n\n\trsd.MultisampleEnable = false;\n\n\trsd.AntialiasedLineEnable = false;\n\n\twiRenderer::GetDevice()->CreateRasterizerState(&rsd, &ncrs);\n\n\n\n\trsd.FillMode = FILL_WIREFRAME;\n\n\trsd.CullMode = CULL_NONE;\n\n\trsd.FrontCounterClockwise = true;\n\n\trsd.DepthBias = 0;\n\n\trsd.DepthBiasClamp = 0;\n\n\trsd.SlopeScaledDepthBias = 0;\n\n\trsd.DepthClipEnable = true;\n\n\trsd.MultisampleEnable = false;\n\n\trsd.AntialiasedLineEnable = false;\n\n\twiRenderer::GetDevice()->CreateRasterizerState(&rsd, &wirers);\n\n\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":53,"score":115883.33383766063},{"content":"\n\n\tDepthStencilStateDesc dsd;\n\n\tdsd.DepthEnable = true;\n\n\tdsd.DepthWriteMask = DEPTH_WRITE_MASK_ALL;\n\n\tdsd.DepthFunc = COMPARISON_GREATER;\n\n\n\n\tdsd.StencilEnable = true;\n\n\tdsd.StencilReadMask = 0xFF;\n\n\tdsd.StencilWriteMask = 0xFF;\n\n\tdsd.FrontFace.StencilFunc = COMPARISON_ALWAYS;\n\n\tdsd.FrontFace.StencilPassOp = STENCIL_OP_REPLACE;\n\n\tdsd.FrontFace.StencilFailOp = STENCIL_OP_KEEP;\n\n\tdsd.FrontFace.StencilDepthFailOp = STENCIL_OP_KEEP;\n\n\tdsd.BackFace.StencilFunc = COMPARISON_ALWAYS;\n\n\tdsd.BackFace.StencilPassOp = STENCIL_OP_REPLACE;\n\n\tdsd.BackFace.StencilFailOp = STENCIL_OP_KEEP;\n\n\tdsd.BackFace.StencilDepthFailOp = STENCIL_OP_KEEP;\n\n\twiRenderer::GetDevice()->CreateDepthStencilState(&dsd, &dss_default);\n\n\n\n\tdsd.DepthWriteMask = DEPTH_WRITE_MASK_ZERO;\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":54,"score":115883.33383766063},{"content":"\twiRenderer::LoadPixelShader(ps_simplest, \"hairparticlePS_simplest.cso\");\n\n\twiRenderer::LoadPixelShader(ps_alphatestonly, \"hairparticlePS_alphatestonly.cso\");\n\n\twiRenderer::LoadPixelShader(ps_deferred, \"hairparticlePS_deferred.cso\");\n\n\twiRenderer::LoadPixelShader(ps_forward, \"hairparticlePS_forward.cso\");\n\n\twiRenderer::LoadPixelShader(ps_forward_transparent, \"hairparticlePS_forward_transparent.cso\");\n\n\twiRenderer::LoadPixelShader(ps_tiledforward, \"hairparticlePS_tiledforward.cso\");\n\n\twiRenderer::LoadPixelShader(ps_tiledforward_transparent, \"hairparticlePS_tiledforward_transparent.cso\");\n\n\n\n\twiRenderer::LoadComputeShader(cs_simulate, \"hairparticle_simulateCS.cso\");\n\n\n\n\tGraphicsDevice* device = wiRenderer::GetDevice();\n\n\n\n\tfor (int i = 0; i < RENDERPASS_COUNT; ++i)\n\n\t{\n\n\t\tif (i == RENDERPASS_DEPTHONLY || i == RENDERPASS_DEFERRED || i == RENDERPASS_FORWARD || i == RENDERPASS_TILEDFORWARD)\n\n\t\t{\n\n\t\t\tfor (int j = 0; j < 2; ++j)\n\n\t\t\t{\n\n\t\t\t\tif ((i == RENDERPASS_DEPTHONLY || i == RENDERPASS_DEFERRED) && j == 1)\n\n\t\t\t\t{\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":55,"score":115883.33383766063},{"content":"\tdsd.DepthFunc = COMPARISON_EQUAL;\n\n\twiRenderer::GetDevice()->CreateDepthStencilState(&dsd, &dss_equal);\n\n\tdsd.DepthFunc = COMPARISON_GREATER;\n\n\twiRenderer::GetDevice()->CreateDepthStencilState(&dsd, &dss_rejectopaque_keeptransparent);\n\n\n\n\n\n\tBlendStateDesc bld;\n\n\tbld.RenderTarget[0].BlendEnable = false;\n\n\tbld.AlphaToCoverageEnable = false; // maybe for msaa\n\n\twiRenderer::GetDevice()->CreateBlendState(&bld, &bs[0]);\n\n\n\n\tbld.RenderTarget[0].SrcBlend = BLEND_SRC_ALPHA;\n\n\tbld.RenderTarget[0].DestBlend = BLEND_INV_SRC_ALPHA;\n\n\tbld.RenderTarget[0].BlendOp = BLEND_OP_ADD;\n\n\tbld.RenderTarget[0].SrcBlendAlpha = BLEND_ONE;\n\n\tbld.RenderTarget[0].DestBlendAlpha = BLEND_ONE;\n\n\tbld.RenderTarget[0].BlendOpAlpha = BLEND_OP_ADD;\n\n\tbld.RenderTarget[0].BlendEnable = true;\n\n\tbld.RenderTarget[0].RenderTargetWriteMask = COLOR_WRITE_ENABLE_ALL;\n\n\tbld.AlphaToCoverageEnable = false;\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":56,"score":115883.33383766063},{"content":"\t\t\t\t\t\tdesc.ps = &ps_forward;\n\n\t\t\t\t\t\tdesc.dss = &dss_equal;\n\n\t\t\t\t\t}\n\n\t\t\t\t\telse\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tdesc.ps = &ps_forward_transparent;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase RENDERPASS_TILEDFORWARD:\n\n\t\t\t\t\tif (j == 0)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tdesc.ps = &ps_tiledforward;\n\n\t\t\t\t\t\tdesc.dss = &dss_equal;\n\n\t\t\t\t\t}\n\n\t\t\t\t\telse\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tdesc.ps = &ps_tiledforward_transparent;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":57,"score":115883.33383766063},{"content":"\t\t\t\t\tcontinue;\n\n\t\t\t\t}\n\n\n\n\t\t\t\tPipelineStateDesc desc;\n\n\t\t\t\tdesc.vs = &vs;\n\n\t\t\t\tdesc.bs = &bs[j];\n\n\t\t\t\tdesc.rs = &ncrs;\n\n\t\t\t\tdesc.dss = &dss_default;\n\n\n\n\t\t\t\tswitch (i)\n\n\t\t\t\t{\n\n\t\t\t\tcase RENDERPASS_DEPTHONLY:\n\n\t\t\t\t\tdesc.ps = &ps_alphatestonly;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase RENDERPASS_DEFERRED:\n\n\t\t\t\t\tdesc.ps = &ps_deferred;\n\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase RENDERPASS_FORWARD:\n\n\t\t\t\t\tif (j == 0)\n\n\t\t\t\t\t{\n","file_path":"WickedEngine/wiHairParticle.cpp","rank":58,"score":115883.33383766063},{"content":"class wiGUI;\n","file_path":"Editor/ForceFieldWindow.h","rank":59,"score":115746.64589279103},{"content":"class wiGUI;\n","file_path":"Editor/EnvProbeWindow.h","rank":60,"score":115746.64589279103},{"content":"class wiArchive;\n\n\n\nnamespace wiScene\n\n{\n\n\n","file_path":"WickedEngine/wiHairParticle.h","rank":61,"score":112438.62118971524},{"content":"using namespace DirectX;\n","file_path":"WickedEngine/CommonInclude.h","rank":62,"score":106196.93651265175},{"content":"\tclass wiHairParticle; // todo: rename\n\n}\n","file_path":"WickedEngine/wiScene_Decl.h","rank":63,"score":103232.63563804142},{"content":"#ifndef WI_SHADERINTEROP_HAIRPARTICLE_H\n\n#define WI_SHADERINTEROP_HAIRPARTICLE_H\n\n\n\n#include \"ShaderInterop.h\"\n\n\n\n#define THREADCOUNT_SIMULATEHAIR 256\n\n\n\nstruct Patch\n\n{\n\n\tfloat3 position;\n\n\tuint tangent_random;\n\n\tfloat3 normal; // need high precision for the simulation!\n\n\tuint binormal_length;\n\n};\n\n\n\nstruct PatchSimulationData\n\n{\n\n\tfloat3 velocity;\n\n\tuint padding;\n\n};\n\n\n\nCBUFFER(HairParticleCB, CBSLOT_OTHER_HAIRPARTICLE)\n\n{\n\n\tfloat4x4 xWorld;\n\n\tfloat4 xColor;\n\n\n\n\tuint xHairRegenerate;\n\n\tfloat xLength;\n\n\tfloat xStiffness;\n\n\tfloat xHairRandomness;\n\n\n\n\tuint xHairParticleCount;\n\n\tuint xHairStrandCount;\n\n\tuint xHairSegmentCount;\n\n\tuint xHairRandomSeed;\n\n\n\n\tfloat xHairViewDistance;\n\n\tuint xHairBaseMeshIndexCount;\n\n\tuint xHairBaseMeshVertexPositionStride;\n\n\tuint xHairNumDispatchGroups;\n\n};\n\n\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":64,"score":100490.07220501051},{"content":"\tfloat3 normal; // need high precision for the simulation!\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":65,"score":100490.07220501051},{"content":"\tfloat3 position;\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":66,"score":100490.07220501051},{"content":"\tuint padding;\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":67,"score":100490.07220501051},{"content":"\tfloat3 velocity;\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":68,"score":100490.07220501051},{"content":"\tuint binormal_length;\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":69,"score":97889.45998792688},{"content":"\tuint tangent_random;\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":70,"score":97889.45998792688},{"content":"#ifndef WI_SHADERINTEROP_HAIRPARTICLE_H\n\n#define WI_SHADERINTEROP_HAIRPARTICLE_H\n\n\n\n#include \"ShaderInterop.h\"\n\n\n\n#define THREADCOUNT_SIMULATEHAIR 256\n\n\n\nstruct Patch\n\n{\n\n\tfloat3 position;\n\n\tuint tangent_random;\n\n\tfloat3 normal; // need high precision for the simulation!\n\n\tuint binormal_length;\n\n};\n\n\n\nstruct PatchSimulationData\n\n{\n\n\tfloat3 velocity;\n\n\tuint padding;\n\n};\n\n\n\nCBUFFER(HairParticleCB, CBSLOT_OTHER_HAIRPARTICLE)\n\n{\n\n\tfloat4x4 xWorld;\n\n\tfloat4 xColor;\n\n\n\n\tuint xHairRegenerate;\n\n\tfloat xLength;\n\n\tfloat xStiffness;\n\n\tfloat xHairRandomness;\n\n\n\n\tuint xHairParticleCount;\n\n\tuint xHairStrandCount;\n\n\tuint xHairSegmentCount;\n\n\tuint xHairRandomSeed;\n\n\n\n\tfloat xHairViewDistance;\n\n\tuint xHairBaseMeshIndexCount;\n\n\tuint xHairBaseMeshVertexPositionStride;\n\n\tuint xHairNumDispatchGroups;\n\n};\n\n\n","file_path":"WickedEngine/ShaderInterop_HairParticle.h","rank":71,"score":95420.05621012289},{"content":"class iter_impl : public std::iterator<std::bidirectional_iterator_tag, BasicJsonType>\n\n{\n\n /// allow basic_json to access private members\n\n friend iter_impl<typename std::conditional<std::is_const<BasicJsonType>::value, typename std::remove_const<BasicJsonType>::type, const BasicJsonType>::type>;\n\n friend BasicJsonType;\n\n friend iteration_proxy<iter_impl>;\n\n\n\n using object_t = typename BasicJsonType::object_t;\n\n using array_t = typename BasicJsonType::array_t;\n\n // make sure BasicJsonType is basic_json or const basic_json\n\n static_assert(is_basic_json<typename std::remove_const<BasicJsonType>::type>::value,\n\n \"iter_impl only accepts (const) basic_json\");\n\n\n\n public:\n\n /// the type of the values when the iterator is dereferenced\n\n using value_type = typename BasicJsonType::value_type;\n\n /// a type to represent differences between iterators\n\n using difference_type = typename BasicJsonType::difference_type;\n\n /// defines a pointer to the type iterated over (value_type)\n\n using pointer = typename std::conditional<std::is_const<BasicJsonType>::value,\n","file_path":"Editor/json.hpp","rank":72,"score":87462.61827541719},{"content":" class NumberIntegerType = std::int64_t,\n","file_path":"Editor/json.hpp","rank":73,"score":79296.03776719881},{"content":" class NumberUnsignedType = std::uint64_t,\n","file_path":"Editor/json.hpp","rank":74,"score":79296.03776719881},{"content":"class exception : public std::exception\n\n{\n\n public:\n\n /// returns the explanatory string\n\n const char* what() const noexcept override\n\n {\n\n return m.what();\n\n }\n\n\n\n /// the id of the exception\n\n const int id;\n\n\n\n protected:\n\n exception(int id_, const char* what_arg) : id(id_), m(what_arg) {}\n\n\n\n static std::string name(const std::string& ename, int id_)\n\n {\n\n return \"[json.exception.\" + ename + \".\" + std::to_string(id_) + \"] \";\n\n }\n\n\n","file_path":"Editor/json.hpp","rank":75,"score":77590.76226523776},{"content":"struct is_compatible_integer_type_impl : std::false_type {};\n\n\n\ntemplate<typename RealIntegerType, typename CompatibleNumberIntegerType>\n","file_path":"Editor/json.hpp","rank":76,"score":76314.23957686411},{"content":"struct is_compatible_object_type_impl : std::false_type {};\n\n\n\ntemplate<class RealType, class CompatibleObjectType>\n","file_path":"Editor/json.hpp","rank":77,"score":76314.23957686411},{"content":"class wiWindow;\n","file_path":"Editor/SoundWindow.h","rank":78,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/DecalWindow.h","rank":79,"score":73434.51489258007},{"content":"class DecalWindow\n\n{\n\npublic:\n\n\tDecalWindow(wiGUI* gui);\n\n\t~DecalWindow();\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\twiTextInputField*\tdecalNameField;\n\n\n\n\twiWindow*\tdecalWindow;\n\n};\n\n\n","file_path":"Editor/DecalWindow.h","rank":80,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/MeshWindow.h","rank":81,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/PostprocessWindow.h","rank":82,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/OceanWindow.h","rank":83,"score":73434.51489258007},{"content":"class CameraWindow\n\n{\n\npublic:\n\n\tCameraWindow(wiGUI* gui);\n\n\t~CameraWindow();\n\n\n\n\tvoid ResetCam();\n\n\n\n\twiECS::Entity proxy = wiECS::INVALID_ENTITY;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\n\n\twiScene::TransformComponent camera_transform;\n\n\twiScene::TransformComponent camera_target;\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiWindow* cameraWindow;\n\n\twiSlider* farPlaneSlider;\n\n\twiSlider* nearPlaneSlider;\n","file_path":"Editor/CameraWindow.h","rank":84,"score":73434.51489258007},{"content":"class LightWindow\n\n{\n\npublic:\n\n\tLightWindow(wiGUI* gui);\n\n\t~LightWindow();\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\tvoid SetLightType(wiScene::LightComponent::LightType type);\n\n\n\n\twiWindow*\tlightWindow;\n\n\twiSlider*\tenergySlider;\n\n\twiSlider*\trangeSlider;\n\n\twiSlider*\tradiusSlider;\n\n\twiSlider*\twidthSlider;\n\n\twiSlider*\theightSlider;\n\n\twiSlider*\tfovSlider;\n","file_path":"Editor/LightWindow.h","rank":85,"score":73434.51489258007},{"content":"class OceanWindow\n\n{\n\npublic:\n\n\tOceanWindow(wiGUI* gui);\n\n\t~OceanWindow();\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiWindow* oceanWindow;\n\n\twiCheckBox* enabledCheckBox;\n\n\twiSlider*\tpatchSizeSlider;\n\n\twiSlider*\twaveAmplitudeSlider;\n\n\twiSlider*\tchoppyScaleSlider;\n\n\twiSlider*\twindDependencySlider;\n\n\twiSlider*\ttimeScaleSlider;\n\n\twiSlider*\theightSlider;\n\n\twiSlider*\tdetailSlider;\n\n\twiSlider*\ttoleranceSlider;\n\n\twiColorPicker* colorPicker;\n\n};\n\n\n","file_path":"Editor/OceanWindow.h","rank":86,"score":73434.51489258007},{"content":"class SoundWindow\n\n{\n\npublic:\n\n\tSoundWindow(wiGUI* gui);\n\n\t~SoundWindow();\n\n\n\n\twiECS::Entity entity = wiECS::INVALID_ENTITY;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiWindow* soundWindow;\n\n\twiComboBox* reverbComboBox;\n\n\twiButton* addButton;\n\n\twiLabel* filenameLabel;\n\n\twiTextInputField* nameField;\n\n\twiButton* playstopButton;\n\n\twiCheckBox* loopedCheckbox;\n\n\twiSlider* volumeSlider;\n\n};\n","file_path":"Editor/SoundWindow.h","rank":87,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/ObjectWindow.h","rank":88,"score":73434.51489258007},{"content":"class MaterialWindow\n\n{\n\npublic:\n\n\tMaterialWindow(wiGUI* gui);\n\n\t~MaterialWindow();\n\n\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiWindow*\tmaterialWindow;\n\n\twiTextInputField*\tmaterialNameField;\n\n\twiCheckBox* waterCheckBox;\n\n\twiCheckBox* planarReflCheckBox;\n\n\twiCheckBox* shadowCasterCheckBox;\n\n\twiCheckBox* flipNormalMapCheckBox;\n\n\twiCheckBox* useVertexColorsCheckBox;\n\n\twiCheckBox* specularGlossinessCheckBox;\n\n\twiCheckBox* occlusionPrimaryCheckBox;\n","file_path":"Editor/MaterialWindow.h","rank":89,"score":73434.51489258007},{"content":"class MaterialWindow;\n\n\n","file_path":"Editor/EmitterWindow.h","rank":90,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/MaterialWindow.h","rank":91,"score":73434.51489258007},{"content":"class AnimationWindow\n\n{\n\npublic:\n\n\tAnimationWindow(wiGUI* gui);\n\n\t~AnimationWindow();\n\n\n\n\twiGUI* GUI;\n\n\t\n\n\twiECS::Entity entity = wiECS::INVALID_ENTITY;\n\n\n\n\twiWindow*\tanimWindow;\n\n\twiComboBox*\tanimationsComboBox;\n\n\twiCheckBox* loopedCheckBox;\n\n\twiButton*\tplayButton;\n\n\twiButton*\tstopButton;\n\n\twiSlider*\ttimerSlider;\n\n\n\n\tvoid Update();\n\n};\n\n\n","file_path":"Editor/AnimationWindow.h","rank":92,"score":73434.51489258007},{"content":"class ObjectWindow\n\n{\n\npublic:\n\n\tObjectWindow(EditorComponent* editor);\n\n\t~ObjectWindow();\n\n\n\n\tEditorComponent* editor;\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiWindow*\tobjectWindow;\n\n\n\n\twiLabel*\tnameLabel;\n\n\twiCheckBox* renderableCheckBox;\n\n\twiSlider*\tditherSlider;\n\n\twiSlider*\tcascadeMaskSlider;\n\n\twiColorPicker* colorPicker;\n\n\n","file_path":"Editor/ObjectWindow.h","rank":93,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/EmitterWindow.h","rank":94,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/AnimationWindow.h","rank":95,"score":73434.51489258007},{"content":"class MeshWindow\n\n{\n\npublic:\n\n\tMeshWindow(wiGUI* gui);\n\n\t~MeshWindow();\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\twiWindow*\tmeshWindow;\n\n\twiLabel*\tmeshInfoLabel;\n\n\twiCheckBox* doubleSidedCheckBox;\n\n\twiCheckBox* softbodyCheckBox;\n\n\twiSlider*\tmassSlider;\n\n\twiSlider*\tfrictionSlider;\n\n\twiButton*\timpostorCreateButton;\n\n\twiSlider*\timpostorDistanceSlider;\n\n\twiSlider*\ttessellationFactorSlider;\n\n\twiButton*\tflipCullingButton;\n\n\twiButton*\tflipNormalsButton;\n\n\twiButton*\tcomputeNormalsSmoothButton;\n\n\twiButton*\tcomputeNormalsHardButton;\n\n\twiButton*\trecenterButton;\n\n\twiButton*\trecenterToBottomButton;\n\n};\n\n\n","file_path":"Editor/MeshWindow.h","rank":96,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/CameraWindow.h","rank":97,"score":73434.51489258007},{"content":"class EmitterWindow\n\n{\n\npublic:\n\n\tEmitterWindow(wiGUI* gui);\n\n\t~EmitterWindow();\n\n\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiECS::Entity entity);\n\n\n\n\tvoid UpdateData();\n\n\n\n\twiScene::wiEmittedParticle* GetEmitter();\n\n\n\n\twiGUI* GUI;\n\n\n\n\twiWindow*\temitterWindow;\n\n\n\n\twiTextInputField*\temitterNameField;\n\n\twiButton* addButton;\n\n\twiButton* restartButton;\n","file_path":"Editor/EmitterWindow.h","rank":98,"score":73434.51489258007},{"content":"class wiWindow;\n","file_path":"Editor/LightWindow.h","rank":99,"score":73434.51489258007}],"string":"[\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 0,\n \"score\": 231629.97973045165\n },\n {\n \"content\": \"class HairParticleWindow\\n\\n{\\n\\npublic:\\n\\n\\tHairParticleWindow(wiGUI* gui);\\n\\n\\t~HairParticleWindow();\\n\\n\\n\\n\\twiECS::Entity entity;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\tvoid UpdateData();\\n\\n\\n\\n\\twiScene::wiHairParticle* GetHair();\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiWindow*\\thairWindow;\\n\\n\\n\\n\\twiButton* addButton;\\n\\n\\twiComboBox*\\tmeshComboBox;\\n\\n\\twiSlider* lengthSlider;\\n\\n\\twiSlider* stiffnessSlider;\\n\\n\\twiSlider* randomnessSlider;\\n\\n\\twiSlider* countSlider;\\n\\n\\twiSlider* segmentcountSlider;\\n\\n\\twiSlider* randomSeedSlider;\\n\\n\\twiSlider* viewDistanceSlider;\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 1,\n \"score\": 212444.14969631986\n },\n {\n \"content\": \"class MaterialWindow;\\n\\n\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 2,\n \"score\": 187915.48251923\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 3,\n \"score\": 187915.48251923\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 4,\n \"score\": 184998.02468382282\n },\n {\n \"content\": \"class HairParticleWindow;\\n\",\n \"file_path\": \"Editor/Editor.h\",\n \"rank\": 16,\n \"score\": 179151.22972069826\n },\n {\n \"content\": \"class wiLabel;\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 17,\n \"score\": 173662.68405565852\n },\n {\n \"content\": \"class wiSlider;\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 18,\n \"score\": 173662.68405565852\n },\n {\n \"content\": \"class wiButton;\\n\\n\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 19,\n \"score\": 173662.68405565852\n },\n {\n \"content\": \"class wiColorPicker;\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 20,\n \"score\": 168500.4400604978\n },\n {\n \"content\": \"class wiCheckBox;\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 21,\n \"score\": 168500.4400604978\n },\n {\n \"content\": \"class wiComboBox;\\n\",\n \"file_path\": \"Editor/HairParticleWindow.h\",\n \"rank\": 22,\n \"score\": 168500.4400604978\n },\n {\n \"content\": \"class wiHairParticle\\n\\n{\\n\\nprivate:\\n\\n\\tstd::unique_ptr<wiGraphics::GPUBuffer> cb;\\n\\n\\tstd::unique_ptr<wiGraphics::GPUBuffer> particleBuffer;\\n\\n\\tstd::unique_ptr<wiGraphics::GPUBuffer> simulationBuffer;\\n\\npublic:\\n\\n\\n\\n\\tvoid UpdateCPU(const TransformComponent& transform, const MeshComponent& mesh, float dt);\\n\\n\\tvoid UpdateGPU(const MeshComponent& mesh, const MaterialComponent& material, wiGraphics::CommandList cmd) const;\\n\\n\\tvoid Draw(const CameraComponent& camera, const MaterialComponent& material, RENDERPASS renderPass, bool transparent, wiGraphics::CommandList cmd) const;\\n\\n\\n\\n\\tenum FLAGS\\n\\n\\t{\\n\\n\\t\\tEMPTY = 0,\\n\\n\\t\\tREGENERATE_FRAME = 1 << 0,\\n\\n\\t};\\n\\n\\tuint32_t _flags = EMPTY;\\n\\n\\n\\n\\twiECS::Entity meshID = wiECS::INVALID_ENTITY;\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.h\",\n \"rank\": 23,\n \"score\": 139154.2027310102\n },\n {\n \"content\": \"#pragma once\\n\\n#include \\\"CommonInclude.h\\\"\\n\\n#include \\\"wiGraphicsDevice.h\\\"\\n\\n#include \\\"wiEnums.h\\\"\\n\\n#include \\\"wiECS.h\\\"\\n\\n#include \\\"wiScene_Decl.h\\\"\\n\\n#include \\\"wiIntersect.h\\\"\\n\\n\\n\\n#include <memory>\\n\\n\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.h\",\n \"rank\": 24,\n \"score\": 119554.29850783893\n },\n {\n \"content\": \"\\n\\n\\tuint32_t strandCount = 0;\\n\\n\\tuint32_t segmentCount = 1;\\n\\n\\tuint32_t randomSeed = 1;\\n\\n\\tfloat length = 1.0f;\\n\\n\\tfloat stiffness = 10.0f;\\n\\n\\tfloat randomness = 0.2f;\\n\\n\\tfloat viewDistance = 200;\\n\\n\\n\\n\\t// Non-serialized attributes:\\n\\n\\tXMFLOAT4X4 world;\\n\\n\\tXMFLOAT4X4 worldPrev;\\n\\n\\tAABB aabb;\\n\\n\\n\\n\\tvoid Serialize(wiArchive& archive, uint32_t seed = 0);\\n\\n\\n\\n\\tstatic void LoadShaders();\\n\\n\\tstatic void Initialize();\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.h\",\n \"rank\": 25,\n \"score\": 119553.06701506878\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/LightWindow.h\",\n \"rank\": 26,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/CameraWindow.h\",\n \"rank\": 27,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/EmitterWindow.h\",\n \"rank\": 28,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/RendererWindow.h\",\n \"rank\": 29,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/OceanWindow.h\",\n \"rank\": 30,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/DecalWindow.h\",\n \"rank\": 31,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/ObjectWindow.h\",\n \"rank\": 32,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/WeatherWindow.h\",\n \"rank\": 33,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/PostprocessWindow.h\",\n \"rank\": 34,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/SoundWindow.h\",\n \"rank\": 35,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/MeshWindow.h\",\n \"rank\": 36,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/MaterialWindow.h\",\n \"rank\": 37,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/AnimationWindow.h\",\n \"rank\": 38,\n \"score\": 119404.77633694654\n },\n {\n \"content\": \"#include \\\"wiHairParticle.h\\\"\\n\\n#include \\\"wiRenderer.h\\\"\\n\\n#include \\\"wiResourceManager.h\\\"\\n\\n#include \\\"wiMath.h\\\"\\n\\n#include \\\"wiIntersect.h\\\"\\n\\n#include \\\"wiRandom.h\\\"\\n\\n#include \\\"ResourceMapping.h\\\"\\n\\n#include \\\"wiArchive.h\\\"\\n\\n#include \\\"ShaderInterop.h\\\"\\n\\n#include \\\"wiTextureHelper.h\\\"\\n\\n#include \\\"wiScene.h\\\"\\n\\n#include \\\"ShaderInterop_HairParticle.h\\\"\\n\\n#include \\\"wiBackLog.h\\\"\\n\\n\\n\\nusing namespace std;\\n\\nusing namespace wiGraphics;\\n\\n\\n\\nnamespace wiScene\\n\\n{\\n\\n\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 39,\n \"score\": 115918.96405765248\n },\n {\n \"content\": \"\\n\\n\\tdevice->BindComputeShader(&cs_simulate, cmd);\\n\\n\\n\\n\\tHairParticleCB hcb;\\n\\n\\thcb.xWorld = world;\\n\\n\\thcb.xColor = material.baseColor;\\n\\n\\thcb.xHairRegenerate = (_flags & REGENERATE_FRAME) ? 1 : 0;\\n\\n\\thcb.xLength = length;\\n\\n\\thcb.xStiffness = stiffness;\\n\\n\\thcb.xHairRandomness = randomness;\\n\\n\\thcb.xHairStrandCount = strandCount;\\n\\n\\thcb.xHairSegmentCount = std::max(segmentCount, 1u);\\n\\n\\thcb.xHairParticleCount = hcb.xHairStrandCount * hcb.xHairSegmentCount;\\n\\n\\thcb.xHairRandomSeed = randomSeed;\\n\\n\\thcb.xHairViewDistance = viewDistance;\\n\\n\\thcb.xHairBaseMeshIndexCount = (uint)mesh.indices.size();\\n\\n\\thcb.xHairBaseMeshVertexPositionStride = sizeof(MeshComponent::Vertex_POS);\\n\\n\\t// segmentCount will be loop in the shader, not a threadgroup so we don't need it here:\\n\\n\\thcb.xHairNumDispatchGroups = (uint)ceilf((float)strandCount / (float)THREADCOUNT_SIMULATEHAIR);\\n\\n\\tdevice->UpdateBuffer(cb.get(), &hcb, cmd);\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 40,\n \"score\": 115901.83683463967\n },\n {\n \"content\": \"\\n\\n\\t\\t\\tbd.Usage = USAGE_DEFAULT;\\n\\n\\t\\t\\tbd.ByteWidth = sizeof(HairParticleCB);\\n\\n\\t\\t\\tbd.BindFlags = BIND_CONSTANT_BUFFER;\\n\\n\\t\\t\\tbd.CPUAccessFlags = 0;\\n\\n\\t\\t\\tbd.MiscFlags = 0;\\n\\n\\t\\t\\twiRenderer::GetDevice()->CreateBuffer(&bd, nullptr, cb.get());\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n}\\n\\nvoid wiHairParticle::UpdateGPU(const MeshComponent& mesh, const MaterialComponent& material, CommandList cmd) const\\n\\n{\\n\\n\\tif (strandCount == 0 || particleBuffer == nullptr)\\n\\n\\t{\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\tGraphicsDevice* device = wiRenderer::GetDevice();\\n\\n\\tdevice->EventBegin(\\\"HairParticle - UpdateRenderData\\\", cmd);\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 41,\n \"score\": 115896.08290720379\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tarchive << _flags;\\n\\n\\t\\twiECS::SerializeEntity(archive, meshID, seed);\\n\\n\\t\\tarchive << strandCount;\\n\\n\\t\\tarchive << segmentCount;\\n\\n\\t\\tarchive << randomSeed;\\n\\n\\t\\tarchive << length;\\n\\n\\t\\tarchive << stiffness;\\n\\n\\t\\tarchive << randomness;\\n\\n\\t\\tarchive << viewDistance;\\n\\n\\t}\\n\\n}\\n\\n\\n\\n\\n\\nvoid wiHairParticle::LoadShaders()\\n\\n{\\n\\n\\tstd::string path = wiRenderer::GetShaderPath();\\n\\n\\n\\n\\twiRenderer::LoadVertexShader(vs, \\\"hairparticleVS.cso\\\");\\n\\n\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 42,\n \"score\": 115895.73615551925\n },\n {\n \"content\": \"\\t\\t}\\n\\n\\t\\tdevice->BindPipelineState(&PSO_wire, cmd);\\n\\n\\t\\tdevice->BindResource(VS, wiTextureHelper::getWhite(), TEXSLOT_ONDEMAND0, cmd);\\n\\n\\t}\\n\\n\\telse\\n\\n\\t{\\n\\n\\t\\tdevice->BindPipelineState(&PSO[renderPass][transparent], cmd);\\n\\n\\n\\n\\t\\tconst GPUResource* res[] = {\\n\\n\\t\\t\\tmaterial.GetBaseColorMap()\\n\\n\\t\\t};\\n\\n\\t\\tdevice->BindResources(PS, res, TEXSLOT_ONDEMAND0, arraysize(res), cmd);\\n\\n\\t\\tdevice->BindResources(VS, res, TEXSLOT_ONDEMAND0, arraysize(res), cmd);\\n\\n\\t}\\n\\n\\n\\n\\tdevice->BindConstantBuffer(VS, cb.get(), CB_GETBINDSLOT(HairParticleCB), cmd);\\n\\n\\n\\n\\tdevice->BindResource(VS, particleBuffer.get(), 0, cmd);\\n\\n\\n\\n\\tdevice->Draw(strandCount * 12 * std::max(segmentCount, 1u), 0, cmd);\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 43,\n \"score\": 115894.5111853809\n },\n {\n \"content\": \"\\tdevice->EventEnd(cmd);\\n\\n}\\n\\n\\n\\nvoid wiHairParticle::Draw(const CameraComponent& camera, const MaterialComponent& material, RENDERPASS renderPass, bool transparent, CommandList cmd) const\\n\\n{\\n\\n\\tif (strandCount == 0 || cb == nullptr)\\n\\n\\t{\\n\\n\\t\\treturn;\\n\\n\\t}\\n\\n\\n\\n\\tGraphicsDevice* device = wiRenderer::GetDevice();\\n\\n\\tdevice->EventBegin(\\\"HairParticle - Draw\\\", cmd);\\n\\n\\n\\n\\tdevice->BindStencilRef(STENCILREF_DEFAULT, cmd);\\n\\n\\n\\n\\tif (wiRenderer::IsWireRender())\\n\\n\\t{\\n\\n\\t\\tif (transparent || renderPass == RENDERPASS_DEPTHONLY)\\n\\n\\t\\t{\\n\\n\\t\\t\\treturn;\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 44,\n \"score\": 115894.43957590112\n },\n {\n \"content\": \"\\tbld.IndependentBlendEnable = false;\\n\\n\\twiRenderer::GetDevice()->CreateBlendState(&bld, &bs[1]);\\n\\n\\n\\n\\tLoadShaders();\\n\\n\\n\\n\\twiBackLog::post(\\\"wiHairParticle Initialized\\\");\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 45,\n \"score\": 115894.02306004026\n },\n {\n \"content\": \"\\t\\t\\tcb.reset(new GPUBuffer);\\n\\n\\t\\t\\tparticleBuffer.reset(new GPUBuffer);\\n\\n\\t\\t\\tsimulationBuffer.reset(new GPUBuffer);\\n\\n\\n\\n\\t\\t\\tGPUBufferDesc bd;\\n\\n\\t\\t\\tbd.Usage = USAGE_DEFAULT;\\n\\n\\t\\t\\tbd.BindFlags = BIND_SHADER_RESOURCE | BIND_UNORDERED_ACCESS;\\n\\n\\t\\t\\tbd.CPUAccessFlags = 0;\\n\\n\\t\\t\\tbd.MiscFlags = RESOURCE_MISC_BUFFER_STRUCTURED;\\n\\n\\n\\n\\t\\t\\tif (strandCount*segmentCount > 0)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tbd.StructureByteStride = sizeof(Patch);\\n\\n\\t\\t\\t\\tbd.ByteWidth = bd.StructureByteStride * strandCount * segmentCount;\\n\\n\\t\\t\\t\\twiRenderer::GetDevice()->CreateBuffer(&bd, nullptr, particleBuffer.get());\\n\\n\\n\\n\\t\\t\\t\\tbd.StructureByteStride = sizeof(PatchSimulationData);\\n\\n\\t\\t\\t\\tbd.ByteWidth = bd.StructureByteStride * strandCount * segmentCount;\\n\\n\\t\\t\\t\\twiRenderer::GetDevice()->CreateBuffer(&bd, nullptr, simulationBuffer.get());\\n\\n\\t\\t\\t}\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 46,\n \"score\": 115892.91929072587\n },\n {\n \"content\": \"\\n\\n\\tdevice->BindConstantBuffer(CS, cb.get(), CB_GETBINDSLOT(HairParticleCB), cmd);\\n\\n\\n\\n\\tGPUResource* uavs[] = {\\n\\n\\t\\tparticleBuffer.get(),\\n\\n\\t\\tsimulationBuffer.get()\\n\\n\\t};\\n\\n\\tdevice->BindUAVs(CS, uavs, 0, arraysize(uavs), cmd);\\n\\n\\n\\n\\tGPUResource* res[] = {\\n\\n\\t\\tmesh.indexBuffer.get(),\\n\\n\\t\\tmesh.streamoutBuffer_POS != nullptr ? mesh.streamoutBuffer_POS.get() : mesh.vertexBuffer_POS.get(),\\n\\n\\t};\\n\\n\\tdevice->BindResources(CS, res, TEXSLOT_ONDEMAND0, arraysize(res), cmd);\\n\\n\\n\\n\\tdevice->Dispatch(hcb.xHairNumDispatchGroups, 1, 1, cmd);\\n\\n\\n\\n\\tdevice->UnbindUAVs(0, arraysize(uavs), cmd);\\n\\n\\tdevice->UnbindResources(TEXSLOT_ONDEMAND0, arraysize(res), cmd);\\n\\n\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 47,\n \"score\": 115892.89619821782\n },\n {\n \"content\": \"static VertexShader vs;\\n\\nstatic PixelShader ps_alphatestonly;\\n\\nstatic PixelShader ps_deferred;\\n\\nstatic PixelShader ps_forward;\\n\\nstatic PixelShader ps_forward_transparent;\\n\\nstatic PixelShader ps_tiledforward;\\n\\nstatic PixelShader ps_tiledforward_transparent;\\n\\nstatic PixelShader ps_simplest;\\n\\nstatic ComputeShader cs_simulate;\\n\\nstatic DepthStencilState dss_default, dss_equal, dss_rejectopaque_keeptransparent;\\n\\nstatic RasterizerState rs, ncrs, wirers;\\n\\nstatic BlendState bs[2]; \\n\\nstatic PipelineState PSO[RENDERPASS_COUNT][2];\\n\\nstatic PipelineState PSO_wire;\\n\\n\\n\\nvoid wiHairParticle::UpdateCPU(const TransformComponent& transform, const MeshComponent& mesh, float dt)\\n\\n{\\n\\n\\tworld = transform.world;\\n\\n\\n\\n\\tXMFLOAT3 _min = mesh.aabb.getMin();\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 48,\n \"score\": 115892.09147867565\n },\n {\n \"content\": \"\\n\\n\\tdevice->EventEnd(cmd);\\n\\n}\\n\\n\\n\\n\\n\\nvoid wiHairParticle::Serialize(wiArchive& archive, uint32_t seed)\\n\\n{\\n\\n\\tif (archive.IsReadMode())\\n\\n\\t{\\n\\n\\t\\tarchive >> _flags;\\n\\n\\t\\twiECS::SerializeEntity(archive, meshID, seed);\\n\\n\\t\\tarchive >> strandCount;\\n\\n\\t\\tarchive >> segmentCount;\\n\\n\\t\\tarchive >> randomSeed;\\n\\n\\t\\tarchive >> length;\\n\\n\\t\\tarchive >> stiffness;\\n\\n\\t\\tarchive >> randomness;\\n\\n\\t\\tarchive >> viewDistance;\\n\\n\\t}\\n\\n\\telse\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 49,\n \"score\": 115892.05982738202\n },\n {\n \"content\": \"\\n\\n\\n\\n}\\n\\nvoid wiHairParticle::Initialize()\\n\\n{\\n\\n\\n\\n\\tRasterizerStateDesc rsd;\\n\\n\\trsd.FillMode = FILL_SOLID;\\n\\n\\trsd.CullMode = CULL_BACK;\\n\\n\\trsd.FrontCounterClockwise = true;\\n\\n\\trsd.DepthBias = 0;\\n\\n\\trsd.DepthBiasClamp = 0;\\n\\n\\trsd.SlopeScaledDepthBias = 0;\\n\\n\\trsd.DepthClipEnable = true;\\n\\n\\trsd.MultisampleEnable = false;\\n\\n\\trsd.AntialiasedLineEnable = false;\\n\\n\\twiRenderer::GetDevice()->CreateRasterizerState(&rsd, &rs);\\n\\n\\n\\n\\trsd.FillMode = FILL_SOLID;\\n\\n\\trsd.CullMode = CULL_NONE;\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 50,\n \"score\": 115890.54598057654\n },\n {\n \"content\": \"\\tXMFLOAT3 _max = mesh.aabb.getMax();\\n\\n\\n\\n\\t_max.x += length;\\n\\n\\t_max.y += length;\\n\\n\\t_max.z += length;\\n\\n\\n\\n\\t_min.x -= length;\\n\\n\\t_min.y -= length;\\n\\n\\t_min.z -= length;\\n\\n\\n\\n\\taabb = AABB(_min, _max);\\n\\n\\taabb = aabb.transform(world);\\n\\n\\n\\n\\tif (dt > 0)\\n\\n\\t{\\n\\n\\t\\t_flags &= ~REGENERATE_FRAME;\\n\\n\\t\\tif (cb == nullptr || (strandCount * segmentCount) != particleBuffer->GetDesc().ByteWidth / sizeof(Patch))\\n\\n\\t\\t{\\n\\n\\t\\t\\t_flags |= REGENERATE_FRAME;\\n\\n\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 51,\n \"score\": 115887.6209926083\n },\n {\n \"content\": \"\\n\\n\\t\\t\\t\\tif (j == 1)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tdesc.dss = &dss_rejectopaque_keeptransparent; // transparent\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\tdevice->CreatePipelineState(&desc, &PSO[i][j]);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n\\n\\n\\t{\\n\\n\\t\\tPipelineStateDesc desc;\\n\\n\\t\\tdesc.vs = &vs;\\n\\n\\t\\tdesc.ps = &ps_simplest;\\n\\n\\t\\tdesc.bs = &bs[0];\\n\\n\\t\\tdesc.rs = &wirers;\\n\\n\\t\\tdesc.dss = &dss_default;\\n\\n\\t\\tdevice->CreatePipelineState(&desc, &PSO_wire);\\n\\n\\t}\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 52,\n \"score\": 115883.33383766063\n },\n {\n \"content\": \"\\trsd.FrontCounterClockwise = true;\\n\\n\\trsd.DepthBias = 0;\\n\\n\\trsd.DepthBiasClamp = 0;\\n\\n\\trsd.SlopeScaledDepthBias = 0;\\n\\n\\trsd.DepthClipEnable = true;\\n\\n\\trsd.MultisampleEnable = false;\\n\\n\\trsd.AntialiasedLineEnable = false;\\n\\n\\twiRenderer::GetDevice()->CreateRasterizerState(&rsd, &ncrs);\\n\\n\\n\\n\\trsd.FillMode = FILL_WIREFRAME;\\n\\n\\trsd.CullMode = CULL_NONE;\\n\\n\\trsd.FrontCounterClockwise = true;\\n\\n\\trsd.DepthBias = 0;\\n\\n\\trsd.DepthBiasClamp = 0;\\n\\n\\trsd.SlopeScaledDepthBias = 0;\\n\\n\\trsd.DepthClipEnable = true;\\n\\n\\trsd.MultisampleEnable = false;\\n\\n\\trsd.AntialiasedLineEnable = false;\\n\\n\\twiRenderer::GetDevice()->CreateRasterizerState(&rsd, &wirers);\\n\\n\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 53,\n \"score\": 115883.33383766063\n },\n {\n \"content\": \"\\n\\n\\tDepthStencilStateDesc dsd;\\n\\n\\tdsd.DepthEnable = true;\\n\\n\\tdsd.DepthWriteMask = DEPTH_WRITE_MASK_ALL;\\n\\n\\tdsd.DepthFunc = COMPARISON_GREATER;\\n\\n\\n\\n\\tdsd.StencilEnable = true;\\n\\n\\tdsd.StencilReadMask = 0xFF;\\n\\n\\tdsd.StencilWriteMask = 0xFF;\\n\\n\\tdsd.FrontFace.StencilFunc = COMPARISON_ALWAYS;\\n\\n\\tdsd.FrontFace.StencilPassOp = STENCIL_OP_REPLACE;\\n\\n\\tdsd.FrontFace.StencilFailOp = STENCIL_OP_KEEP;\\n\\n\\tdsd.FrontFace.StencilDepthFailOp = STENCIL_OP_KEEP;\\n\\n\\tdsd.BackFace.StencilFunc = COMPARISON_ALWAYS;\\n\\n\\tdsd.BackFace.StencilPassOp = STENCIL_OP_REPLACE;\\n\\n\\tdsd.BackFace.StencilFailOp = STENCIL_OP_KEEP;\\n\\n\\tdsd.BackFace.StencilDepthFailOp = STENCIL_OP_KEEP;\\n\\n\\twiRenderer::GetDevice()->CreateDepthStencilState(&dsd, &dss_default);\\n\\n\\n\\n\\tdsd.DepthWriteMask = DEPTH_WRITE_MASK_ZERO;\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 54,\n \"score\": 115883.33383766063\n },\n {\n \"content\": \"\\twiRenderer::LoadPixelShader(ps_simplest, \\\"hairparticlePS_simplest.cso\\\");\\n\\n\\twiRenderer::LoadPixelShader(ps_alphatestonly, \\\"hairparticlePS_alphatestonly.cso\\\");\\n\\n\\twiRenderer::LoadPixelShader(ps_deferred, \\\"hairparticlePS_deferred.cso\\\");\\n\\n\\twiRenderer::LoadPixelShader(ps_forward, \\\"hairparticlePS_forward.cso\\\");\\n\\n\\twiRenderer::LoadPixelShader(ps_forward_transparent, \\\"hairparticlePS_forward_transparent.cso\\\");\\n\\n\\twiRenderer::LoadPixelShader(ps_tiledforward, \\\"hairparticlePS_tiledforward.cso\\\");\\n\\n\\twiRenderer::LoadPixelShader(ps_tiledforward_transparent, \\\"hairparticlePS_tiledforward_transparent.cso\\\");\\n\\n\\n\\n\\twiRenderer::LoadComputeShader(cs_simulate, \\\"hairparticle_simulateCS.cso\\\");\\n\\n\\n\\n\\tGraphicsDevice* device = wiRenderer::GetDevice();\\n\\n\\n\\n\\tfor (int i = 0; i < RENDERPASS_COUNT; ++i)\\n\\n\\t{\\n\\n\\t\\tif (i == RENDERPASS_DEPTHONLY || i == RENDERPASS_DEFERRED || i == RENDERPASS_FORWARD || i == RENDERPASS_TILEDFORWARD)\\n\\n\\t\\t{\\n\\n\\t\\t\\tfor (int j = 0; j < 2; ++j)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif ((i == RENDERPASS_DEPTHONLY || i == RENDERPASS_DEFERRED) && j == 1)\\n\\n\\t\\t\\t\\t{\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 55,\n \"score\": 115883.33383766063\n },\n {\n \"content\": \"\\tdsd.DepthFunc = COMPARISON_EQUAL;\\n\\n\\twiRenderer::GetDevice()->CreateDepthStencilState(&dsd, &dss_equal);\\n\\n\\tdsd.DepthFunc = COMPARISON_GREATER;\\n\\n\\twiRenderer::GetDevice()->CreateDepthStencilState(&dsd, &dss_rejectopaque_keeptransparent);\\n\\n\\n\\n\\n\\n\\tBlendStateDesc bld;\\n\\n\\tbld.RenderTarget[0].BlendEnable = false;\\n\\n\\tbld.AlphaToCoverageEnable = false; // maybe for msaa\\n\\n\\twiRenderer::GetDevice()->CreateBlendState(&bld, &bs[0]);\\n\\n\\n\\n\\tbld.RenderTarget[0].SrcBlend = BLEND_SRC_ALPHA;\\n\\n\\tbld.RenderTarget[0].DestBlend = BLEND_INV_SRC_ALPHA;\\n\\n\\tbld.RenderTarget[0].BlendOp = BLEND_OP_ADD;\\n\\n\\tbld.RenderTarget[0].SrcBlendAlpha = BLEND_ONE;\\n\\n\\tbld.RenderTarget[0].DestBlendAlpha = BLEND_ONE;\\n\\n\\tbld.RenderTarget[0].BlendOpAlpha = BLEND_OP_ADD;\\n\\n\\tbld.RenderTarget[0].BlendEnable = true;\\n\\n\\tbld.RenderTarget[0].RenderTargetWriteMask = COLOR_WRITE_ENABLE_ALL;\\n\\n\\tbld.AlphaToCoverageEnable = false;\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 56,\n \"score\": 115883.33383766063\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t\\tdesc.ps = &ps_forward;\\n\\n\\t\\t\\t\\t\\t\\tdesc.dss = &dss_equal;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\telse\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tdesc.ps = &ps_forward_transparent;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase RENDERPASS_TILEDFORWARD:\\n\\n\\t\\t\\t\\t\\tif (j == 0)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tdesc.ps = &ps_tiledforward;\\n\\n\\t\\t\\t\\t\\t\\tdesc.dss = &dss_equal;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\telse\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tdesc.ps = &ps_tiledforward_transparent;\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t}\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 57,\n \"score\": 115883.33383766063\n },\n {\n \"content\": \"\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\tPipelineStateDesc desc;\\n\\n\\t\\t\\t\\tdesc.vs = &vs;\\n\\n\\t\\t\\t\\tdesc.bs = &bs[j];\\n\\n\\t\\t\\t\\tdesc.rs = &ncrs;\\n\\n\\t\\t\\t\\tdesc.dss = &dss_default;\\n\\n\\n\\n\\t\\t\\t\\tswitch (i)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\tcase RENDERPASS_DEPTHONLY:\\n\\n\\t\\t\\t\\t\\tdesc.ps = &ps_alphatestonly;\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase RENDERPASS_DEFERRED:\\n\\n\\t\\t\\t\\t\\tdesc.ps = &ps_deferred;\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase RENDERPASS_FORWARD:\\n\\n\\t\\t\\t\\t\\tif (j == 0)\\n\\n\\t\\t\\t\\t\\t{\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.cpp\",\n \"rank\": 58,\n \"score\": 115883.33383766063\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/ForceFieldWindow.h\",\n \"rank\": 59,\n \"score\": 115746.64589279103\n },\n {\n \"content\": \"class wiGUI;\\n\",\n \"file_path\": \"Editor/EnvProbeWindow.h\",\n \"rank\": 60,\n \"score\": 115746.64589279103\n },\n {\n \"content\": \"class wiArchive;\\n\\n\\n\\nnamespace wiScene\\n\\n{\\n\\n\\n\",\n \"file_path\": \"WickedEngine/wiHairParticle.h\",\n \"rank\": 61,\n \"score\": 112438.62118971524\n },\n {\n \"content\": \"using namespace DirectX;\\n\",\n \"file_path\": \"WickedEngine/CommonInclude.h\",\n \"rank\": 62,\n \"score\": 106196.93651265175\n },\n {\n \"content\": \"\\tclass wiHairParticle; // todo: rename\\n\\n}\\n\",\n \"file_path\": \"WickedEngine/wiScene_Decl.h\",\n \"rank\": 63,\n \"score\": 103232.63563804142\n },\n {\n \"content\": \"#ifndef WI_SHADERINTEROP_HAIRPARTICLE_H\\n\\n#define WI_SHADERINTEROP_HAIRPARTICLE_H\\n\\n\\n\\n#include \\\"ShaderInterop.h\\\"\\n\\n\\n\\n#define THREADCOUNT_SIMULATEHAIR 256\\n\\n\\n\\nstruct Patch\\n\\n{\\n\\n\\tfloat3 position;\\n\\n\\tuint tangent_random;\\n\\n\\tfloat3 normal; // need high precision for the simulation!\\n\\n\\tuint binormal_length;\\n\\n};\\n\\n\\n\\nstruct PatchSimulationData\\n\\n{\\n\\n\\tfloat3 velocity;\\n\\n\\tuint padding;\\n\\n};\\n\\n\\n\\nCBUFFER(HairParticleCB, CBSLOT_OTHER_HAIRPARTICLE)\\n\\n{\\n\\n\\tfloat4x4 xWorld;\\n\\n\\tfloat4 xColor;\\n\\n\\n\\n\\tuint xHairRegenerate;\\n\\n\\tfloat xLength;\\n\\n\\tfloat xStiffness;\\n\\n\\tfloat xHairRandomness;\\n\\n\\n\\n\\tuint xHairParticleCount;\\n\\n\\tuint xHairStrandCount;\\n\\n\\tuint xHairSegmentCount;\\n\\n\\tuint xHairRandomSeed;\\n\\n\\n\\n\\tfloat xHairViewDistance;\\n\\n\\tuint xHairBaseMeshIndexCount;\\n\\n\\tuint xHairBaseMeshVertexPositionStride;\\n\\n\\tuint xHairNumDispatchGroups;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 64,\n \"score\": 100490.07220501051\n },\n {\n \"content\": \"\\tfloat3 normal; // need high precision for the simulation!\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 65,\n \"score\": 100490.07220501051\n },\n {\n \"content\": \"\\tfloat3 position;\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 66,\n \"score\": 100490.07220501051\n },\n {\n \"content\": \"\\tuint padding;\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 67,\n \"score\": 100490.07220501051\n },\n {\n \"content\": \"\\tfloat3 velocity;\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 68,\n \"score\": 100490.07220501051\n },\n {\n \"content\": \"\\tuint binormal_length;\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 69,\n \"score\": 97889.45998792688\n },\n {\n \"content\": \"\\tuint tangent_random;\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 70,\n \"score\": 97889.45998792688\n },\n {\n \"content\": \"#ifndef WI_SHADERINTEROP_HAIRPARTICLE_H\\n\\n#define WI_SHADERINTEROP_HAIRPARTICLE_H\\n\\n\\n\\n#include \\\"ShaderInterop.h\\\"\\n\\n\\n\\n#define THREADCOUNT_SIMULATEHAIR 256\\n\\n\\n\\nstruct Patch\\n\\n{\\n\\n\\tfloat3 position;\\n\\n\\tuint tangent_random;\\n\\n\\tfloat3 normal; // need high precision for the simulation!\\n\\n\\tuint binormal_length;\\n\\n};\\n\\n\\n\\nstruct PatchSimulationData\\n\\n{\\n\\n\\tfloat3 velocity;\\n\\n\\tuint padding;\\n\\n};\\n\\n\\n\\nCBUFFER(HairParticleCB, CBSLOT_OTHER_HAIRPARTICLE)\\n\\n{\\n\\n\\tfloat4x4 xWorld;\\n\\n\\tfloat4 xColor;\\n\\n\\n\\n\\tuint xHairRegenerate;\\n\\n\\tfloat xLength;\\n\\n\\tfloat xStiffness;\\n\\n\\tfloat xHairRandomness;\\n\\n\\n\\n\\tuint xHairParticleCount;\\n\\n\\tuint xHairStrandCount;\\n\\n\\tuint xHairSegmentCount;\\n\\n\\tuint xHairRandomSeed;\\n\\n\\n\\n\\tfloat xHairViewDistance;\\n\\n\\tuint xHairBaseMeshIndexCount;\\n\\n\\tuint xHairBaseMeshVertexPositionStride;\\n\\n\\tuint xHairNumDispatchGroups;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"WickedEngine/ShaderInterop_HairParticle.h\",\n \"rank\": 71,\n \"score\": 95420.05621012289\n },\n {\n \"content\": \"class iter_impl : public std::iterator<std::bidirectional_iterator_tag, BasicJsonType>\\n\\n{\\n\\n /// allow basic_json to access private members\\n\\n friend iter_impl<typename std::conditional<std::is_const<BasicJsonType>::value, typename std::remove_const<BasicJsonType>::type, const BasicJsonType>::type>;\\n\\n friend BasicJsonType;\\n\\n friend iteration_proxy<iter_impl>;\\n\\n\\n\\n using object_t = typename BasicJsonType::object_t;\\n\\n using array_t = typename BasicJsonType::array_t;\\n\\n // make sure BasicJsonType is basic_json or const basic_json\\n\\n static_assert(is_basic_json<typename std::remove_const<BasicJsonType>::type>::value,\\n\\n \\\"iter_impl only accepts (const) basic_json\\\");\\n\\n\\n\\n public:\\n\\n /// the type of the values when the iterator is dereferenced\\n\\n using value_type = typename BasicJsonType::value_type;\\n\\n /// a type to represent differences between iterators\\n\\n using difference_type = typename BasicJsonType::difference_type;\\n\\n /// defines a pointer to the type iterated over (value_type)\\n\\n using pointer = typename std::conditional<std::is_const<BasicJsonType>::value,\\n\",\n \"file_path\": \"Editor/json.hpp\",\n \"rank\": 72,\n \"score\": 87462.61827541719\n },\n {\n \"content\": \" class NumberIntegerType = std::int64_t,\\n\",\n \"file_path\": \"Editor/json.hpp\",\n \"rank\": 73,\n \"score\": 79296.03776719881\n },\n {\n \"content\": \" class NumberUnsignedType = std::uint64_t,\\n\",\n \"file_path\": \"Editor/json.hpp\",\n \"rank\": 74,\n \"score\": 79296.03776719881\n },\n {\n \"content\": \"class exception : public std::exception\\n\\n{\\n\\n public:\\n\\n /// returns the explanatory string\\n\\n const char* what() const noexcept override\\n\\n {\\n\\n return m.what();\\n\\n }\\n\\n\\n\\n /// the id of the exception\\n\\n const int id;\\n\\n\\n\\n protected:\\n\\n exception(int id_, const char* what_arg) : id(id_), m(what_arg) {}\\n\\n\\n\\n static std::string name(const std::string& ename, int id_)\\n\\n {\\n\\n return \\\"[json.exception.\\\" + ename + \\\".\\\" + std::to_string(id_) + \\\"] \\\";\\n\\n }\\n\\n\\n\",\n \"file_path\": \"Editor/json.hpp\",\n \"rank\": 75,\n \"score\": 77590.76226523776\n },\n {\n \"content\": \"struct is_compatible_integer_type_impl : std::false_type {};\\n\\n\\n\\ntemplate<typename RealIntegerType, typename CompatibleNumberIntegerType>\\n\",\n \"file_path\": \"Editor/json.hpp\",\n \"rank\": 76,\n \"score\": 76314.23957686411\n },\n {\n \"content\": \"struct is_compatible_object_type_impl : std::false_type {};\\n\\n\\n\\ntemplate<class RealType, class CompatibleObjectType>\\n\",\n \"file_path\": \"Editor/json.hpp\",\n \"rank\": 77,\n \"score\": 76314.23957686411\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/SoundWindow.h\",\n \"rank\": 78,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/DecalWindow.h\",\n \"rank\": 79,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class DecalWindow\\n\\n{\\n\\npublic:\\n\\n\\tDecalWindow(wiGUI* gui);\\n\\n\\t~DecalWindow();\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiECS::Entity entity;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\twiTextInputField*\\tdecalNameField;\\n\\n\\n\\n\\twiWindow*\\tdecalWindow;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Editor/DecalWindow.h\",\n \"rank\": 80,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/MeshWindow.h\",\n \"rank\": 81,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/PostprocessWindow.h\",\n \"rank\": 82,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/OceanWindow.h\",\n \"rank\": 83,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class CameraWindow\\n\\n{\\n\\npublic:\\n\\n\\tCameraWindow(wiGUI* gui);\\n\\n\\t~CameraWindow();\\n\\n\\n\\n\\tvoid ResetCam();\\n\\n\\n\\n\\twiECS::Entity proxy = wiECS::INVALID_ENTITY;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\n\\n\\twiScene::TransformComponent camera_transform;\\n\\n\\twiScene::TransformComponent camera_target;\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiWindow* cameraWindow;\\n\\n\\twiSlider* farPlaneSlider;\\n\\n\\twiSlider* nearPlaneSlider;\\n\",\n \"file_path\": \"Editor/CameraWindow.h\",\n \"rank\": 84,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class LightWindow\\n\\n{\\n\\npublic:\\n\\n\\tLightWindow(wiGUI* gui);\\n\\n\\t~LightWindow();\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiECS::Entity entity;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\tvoid SetLightType(wiScene::LightComponent::LightType type);\\n\\n\\n\\n\\twiWindow*\\tlightWindow;\\n\\n\\twiSlider*\\tenergySlider;\\n\\n\\twiSlider*\\trangeSlider;\\n\\n\\twiSlider*\\tradiusSlider;\\n\\n\\twiSlider*\\twidthSlider;\\n\\n\\twiSlider*\\theightSlider;\\n\\n\\twiSlider*\\tfovSlider;\\n\",\n \"file_path\": \"Editor/LightWindow.h\",\n \"rank\": 85,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class OceanWindow\\n\\n{\\n\\npublic:\\n\\n\\tOceanWindow(wiGUI* gui);\\n\\n\\t~OceanWindow();\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiWindow* oceanWindow;\\n\\n\\twiCheckBox* enabledCheckBox;\\n\\n\\twiSlider*\\tpatchSizeSlider;\\n\\n\\twiSlider*\\twaveAmplitudeSlider;\\n\\n\\twiSlider*\\tchoppyScaleSlider;\\n\\n\\twiSlider*\\twindDependencySlider;\\n\\n\\twiSlider*\\ttimeScaleSlider;\\n\\n\\twiSlider*\\theightSlider;\\n\\n\\twiSlider*\\tdetailSlider;\\n\\n\\twiSlider*\\ttoleranceSlider;\\n\\n\\twiColorPicker* colorPicker;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Editor/OceanWindow.h\",\n \"rank\": 86,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class SoundWindow\\n\\n{\\n\\npublic:\\n\\n\\tSoundWindow(wiGUI* gui);\\n\\n\\t~SoundWindow();\\n\\n\\n\\n\\twiECS::Entity entity = wiECS::INVALID_ENTITY;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiWindow* soundWindow;\\n\\n\\twiComboBox* reverbComboBox;\\n\\n\\twiButton* addButton;\\n\\n\\twiLabel* filenameLabel;\\n\\n\\twiTextInputField* nameField;\\n\\n\\twiButton* playstopButton;\\n\\n\\twiCheckBox* loopedCheckbox;\\n\\n\\twiSlider* volumeSlider;\\n\\n};\\n\",\n \"file_path\": \"Editor/SoundWindow.h\",\n \"rank\": 87,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/ObjectWindow.h\",\n \"rank\": 88,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class MaterialWindow\\n\\n{\\n\\npublic:\\n\\n\\tMaterialWindow(wiGUI* gui);\\n\\n\\t~MaterialWindow();\\n\\n\\n\\n\\twiECS::Entity entity;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiWindow*\\tmaterialWindow;\\n\\n\\twiTextInputField*\\tmaterialNameField;\\n\\n\\twiCheckBox* waterCheckBox;\\n\\n\\twiCheckBox* planarReflCheckBox;\\n\\n\\twiCheckBox* shadowCasterCheckBox;\\n\\n\\twiCheckBox* flipNormalMapCheckBox;\\n\\n\\twiCheckBox* useVertexColorsCheckBox;\\n\\n\\twiCheckBox* specularGlossinessCheckBox;\\n\\n\\twiCheckBox* occlusionPrimaryCheckBox;\\n\",\n \"file_path\": \"Editor/MaterialWindow.h\",\n \"rank\": 89,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class MaterialWindow;\\n\\n\\n\",\n \"file_path\": \"Editor/EmitterWindow.h\",\n \"rank\": 90,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/MaterialWindow.h\",\n \"rank\": 91,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class AnimationWindow\\n\\n{\\n\\npublic:\\n\\n\\tAnimationWindow(wiGUI* gui);\\n\\n\\t~AnimationWindow();\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\t\\n\\n\\twiECS::Entity entity = wiECS::INVALID_ENTITY;\\n\\n\\n\\n\\twiWindow*\\tanimWindow;\\n\\n\\twiComboBox*\\tanimationsComboBox;\\n\\n\\twiCheckBox* loopedCheckBox;\\n\\n\\twiButton*\\tplayButton;\\n\\n\\twiButton*\\tstopButton;\\n\\n\\twiSlider*\\ttimerSlider;\\n\\n\\n\\n\\tvoid Update();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Editor/AnimationWindow.h\",\n \"rank\": 92,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class ObjectWindow\\n\\n{\\n\\npublic:\\n\\n\\tObjectWindow(EditorComponent* editor);\\n\\n\\t~ObjectWindow();\\n\\n\\n\\n\\tEditorComponent* editor;\\n\\n\\twiECS::Entity entity;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiWindow*\\tobjectWindow;\\n\\n\\n\\n\\twiLabel*\\tnameLabel;\\n\\n\\twiCheckBox* renderableCheckBox;\\n\\n\\twiSlider*\\tditherSlider;\\n\\n\\twiSlider*\\tcascadeMaskSlider;\\n\\n\\twiColorPicker* colorPicker;\\n\\n\\n\",\n \"file_path\": \"Editor/ObjectWindow.h\",\n \"rank\": 93,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/EmitterWindow.h\",\n \"rank\": 94,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/AnimationWindow.h\",\n \"rank\": 95,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class MeshWindow\\n\\n{\\n\\npublic:\\n\\n\\tMeshWindow(wiGUI* gui);\\n\\n\\t~MeshWindow();\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiECS::Entity entity;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\twiWindow*\\tmeshWindow;\\n\\n\\twiLabel*\\tmeshInfoLabel;\\n\\n\\twiCheckBox* doubleSidedCheckBox;\\n\\n\\twiCheckBox* softbodyCheckBox;\\n\\n\\twiSlider*\\tmassSlider;\\n\\n\\twiSlider*\\tfrictionSlider;\\n\\n\\twiButton*\\timpostorCreateButton;\\n\\n\\twiSlider*\\timpostorDistanceSlider;\\n\\n\\twiSlider*\\ttessellationFactorSlider;\\n\\n\\twiButton*\\tflipCullingButton;\\n\\n\\twiButton*\\tflipNormalsButton;\\n\\n\\twiButton*\\tcomputeNormalsSmoothButton;\\n\\n\\twiButton*\\tcomputeNormalsHardButton;\\n\\n\\twiButton*\\trecenterButton;\\n\\n\\twiButton*\\trecenterToBottomButton;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Editor/MeshWindow.h\",\n \"rank\": 96,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/CameraWindow.h\",\n \"rank\": 97,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class EmitterWindow\\n\\n{\\n\\npublic:\\n\\n\\tEmitterWindow(wiGUI* gui);\\n\\n\\t~EmitterWindow();\\n\\n\\n\\n\\twiECS::Entity entity;\\n\\n\\tvoid SetEntity(wiECS::Entity entity);\\n\\n\\n\\n\\tvoid UpdateData();\\n\\n\\n\\n\\twiScene::wiEmittedParticle* GetEmitter();\\n\\n\\n\\n\\twiGUI* GUI;\\n\\n\\n\\n\\twiWindow*\\temitterWindow;\\n\\n\\n\\n\\twiTextInputField*\\temitterNameField;\\n\\n\\twiButton* addButton;\\n\\n\\twiButton* restartButton;\\n\",\n \"file_path\": \"Editor/EmitterWindow.h\",\n \"rank\": 98,\n \"score\": 73434.51489258007\n },\n {\n \"content\": \"class wiWindow;\\n\",\n \"file_path\": \"Editor/LightWindow.h\",\n \"rank\": 99,\n \"score\": 73434.51489258007\n }\n]","isConversational":false}}},{"rowIdx":476,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"libmarch/include/march/python/wrapper_core.hpp"},"repo_name":{"kind":"string","value":"j8xixo12/solvcon"},"commit":{"kind":"string","value":"a8bf3a54d4b1ed91d292e0cdbcb6f2710d33d99a"},"file_code":{"kind":"string","value":"#pragma once\n\n#include <pybind11/pybind11.h>\n#include <pybind11/stl.h>\n\n#include <utility>\n#include <memory>\n#include <vector>\n#include <algorithm>\n#include <cstring>\n\n#include \"march.hpp\"\n#include \"march/python/WrapBase.hpp\"\n\nnamespace march {\n\nnamespace python {\n\nclass\nMARCH_PYTHON_WRAPPER_VISIBILITY\nWrapBuffer\n : public WrapBase< WrapBuffer, Buffer, std::shared_ptr<Buffer> >\n{\n\n friend base_type;\n\n WrapBuffer(pybind11::module & mod, const char * pyname, const char * clsdoc)\n : base_type(mod, pyname, clsdoc)\n {\n }\n\n}; \n\nclass\nMARCH_PYTHON_WRAPPER_VISIBILITY\nWrapLookupTableCore\n : public WrapBase< WrapLookupTableCore, LookupTableCore >\n{\n\n friend base_type;\n\n WrapLookupTableCore(pybind11::module & mod, const char * pyname, const char * clsdoc)\n : base_type(mod, pyname, clsdoc)\n {\n namespace py = pybind11;\n (*this)\n .init()\n .def_property_readonly(\"nghost\", &LookupTableCore::nghost)\n .def_property_readonly(\"nbody\", &LookupTableCore::nbody)\n .def_property_readonly(\"ncolumn\", &LookupTableCore::ncolumn)\n .array_readwrite()\n .array_readonly()\n .pickle()\n .address()\n .def(\"__getattr__\", [](LookupTableCore & tbl, py::object key) {\n return py::object(Table(tbl).full().attr(key));\n })\n .def_property_readonly(\"_nda\", [](LookupTableCore & tbl) {\n return Table(tbl).full();\n })\n ;\n }\n\n wrapper_type & init() {\n namespace py = pybind11;\n return def(py::init([](py::args args, py::kwargs kwargs) {\n std::vector<index_type> dims(args.size()-1);\n index_type nghost = args[0].cast<index_type>();\n index_type nbody = args[1].cast<index_type>();\n dims[0] = nghost + nbody;\n for (size_t it=1; it<dims.size(); ++it) {\n dims[it] = args[it+1].cast<index_type>();\n }\n\n PyArray_Descr * descr = nullptr;\n if (kwargs && kwargs.contains(\"dtype\")) {\n PyArray_DescrConverter(py::object(kwargs[\"dtype\"]).ptr(), &descr);\n }\n if (nullptr == descr) {\n descr = PyArray_DescrFromType(NPY_INT);\n }\n DataTypeId dtid = static_cast<DataTypeId>(descr->type_num);\n Py_DECREF(descr);\n\n LookupTableCore table(nghost, nbody, dims, dtid);\n\n std::string creation(\"empty\");\n if (kwargs && kwargs.contains(\"creation\")) {\n creation = kwargs[\"creation\"].cast<std::string>();\n }\n if (\"zeros\" == creation) {\n memset(table.buffer()->template data<char>(), 0, table.buffer()->nbyte());\n } else if (\"empty\" == creation) {\n \n } else {\n throw py::value_error(\"invalid creation type\");\n }\n\n return table;\n }));\n }\n\n wrapper_type & array_readwrite() {\n namespace py = pybind11;\n return def_property(\n \"F\",\n [](LookupTableCore & tbl) { return Table(tbl).full(); },\n [](LookupTableCore & tbl, py::array src) { Table::CopyInto(Table(tbl).full(), src); },\n \"Full array.\")\n .def_property(\n \"G\",\n [](LookupTableCore & tbl) { return Table(tbl).ghost(); },\n [](LookupTableCore & tbl, py::array src) {\n if (tbl.nghost()) {\n Table::CopyInto(Table(tbl).ghost(), src);\n } else {\n throw py::index_error(\"ghost is zero\");\n }\n },\n \"Ghost-part array.\")\n .def_property(\n \"B\",\n [](LookupTableCore & tbl) { return Table(tbl).body(); },\n [](LookupTableCore & tbl, py::array src) { Table::CopyInto(Table(tbl).body(), src); },\n \"Body-part array.\")\n ;\n }\n\n wrapper_type & array_readonly() {\n return def_property_readonly(\n \"_ghostpart\",\n [](LookupTableCore & tbl) { return Table(tbl).ghost(); },\n \"Ghost-part array without setter.\")\n .def_property_readonly(\n \"_bodypart\",\n [](LookupTableCore & tbl) { return Table(tbl).body(); },\n \"Body-part array without setter.\")\n ;\n }\n\n wrapper_type & pickle() {\n namespace py = pybind11;\n return def(py::pickle(\n [](LookupTableCore & tbl){\n return py::make_tuple(tbl.nghost(), tbl.nbody(), tbl.dims(), (long)tbl.datatypeid(), Table(tbl).full());\n },\n [](py::tuple tpl){\n if (tpl.size() != 5) { throw std::runtime_error(\"Invalid state for Table (LookupTableCore)!\"); }\n index_type nghost = tpl[0].cast<index_type>();\n index_type nbody = tpl[1].cast<index_type>();\n std::vector<index_type> dims = tpl[2].cast<std::vector<index_type>>();\n DataTypeId datatypeid = static_cast<DataTypeId>(tpl[3].cast<long>());\n py::array src = tpl[4].cast<py::array>();\n LookupTableCore tbl(nghost, nbody, dims, datatypeid);\n Table::CopyInto(Table(tbl).full(), src);\n return tbl;\n }\n ));\n }\n\n wrapper_type & address() {\n return def_property_readonly(\n \"offset\",\n [](LookupTableCore & tbl) { return tbl.nghost() * tbl.ncolumn(); },\n \"Element offset from the head of the ndarray to where the body starts.\")\n .def_property_readonly(\n \"_ghostaddr\",\n [](LookupTableCore & tbl) { return (Py_intptr_t) Table::BYTES(Table(tbl).full()); })\n .def_property_readonly(\n \"_bodyaddr\",\n [](LookupTableCore & tbl) { return (Py_intptr_t) Table::BYTES(Table(tbl).body()); })\n ;\n }\n\n}; \n\ntemplate< size_t NDIM >\nclass\nMARCH_PYTHON_WRAPPER_VISIBILITY\nWrapVector\n : public WrapBase< WrapVector<NDIM>, Vector<NDIM> >\n{\n\n \n using base_type = WrapBase< WrapVector<NDIM>, Vector<NDIM> >;\n using wrapper_type = typename base_type::wrapper_type;\n using wrapped_type = typename base_type::wrapped_type;\n\n friend base_type;\n\n WrapVector(pybind11::module & mod, const char * pyname, const char * clsdoc)\n : base_type(mod, pyname, clsdoc)\n {\n namespace py = pybind11;\n\n wrapped_type dummy;\n\n#define MARCH_PYBIND_VECTOR_SCALAR_OP(PYNAME, CXXOP) \\\n .def(\"__i\" #PYNAME \"__\", [](wrapped_type & self, real_type v) { self CXXOP v; return self; }) \\\n .def(\"__\" #PYNAME \"__\", [](wrapped_type & self, real_type v) { auto ret(self); ret CXXOP v; return ret; })\n\n#define MARCH_PYBIND_VECTOR_VECTOR_OP(PYNAME, CXXOP) \\\n .def(\"__i\" #PYNAME \"__\", [](wrapped_type & self, wrapped_type const & v) { self CXXOP v; return self; }) \\\n .def(\"__\" #PYNAME \"__\", [](wrapped_type & self, wrapped_type const & v) { auto ret(self); ret CXXOP v; return ret; })\n\n (*this)\n .def(py::init([]() { return wrapped_type(); }))\n .def(py::init([](wrapped_type & other) { return wrapped_type(other); }))\n .add_element_init(dummy)\n .def(\"repr\", &wrapped_type::repr, py::arg(\"indent\")=0, py::arg(\"precision\")=0)\n .def(\"__repr__\", [](wrapped_type & self){ return self.repr(); })\n .def(\"__eq__\", &wrapped_type::operator==)\n .def(\n \"__hash__\",\n [](wrapped_type const & self) {\n py::list tmp;\n for (size_t it=0; it<self.size(); ++it) {\n tmp.append(self[it]);\n }\n return py::hash(tmp);\n }\n )\n .def(\"is_close_to\", &wrapped_type::is_close_to)\n .def(\"__len__\", &wrapped_type::size)\n .def(\n \"__getitem__\",\n [](wrapped_type & self, index_type i) { return self.at(i); },\n py::return_value_policy::copy\n )\n .def(\n \"__setitem__\",\n [](wrapped_type & self, index_type i, real_type v) { self.at(i) = v; }\n )\n MARCH_PYBIND_VECTOR_VECTOR_OP(add, +=)\n MARCH_PYBIND_VECTOR_VECTOR_OP(sub, -=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(add, +=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(sub, -=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(mul, *=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(div, /=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(truediv, /=)\n \n ;\n\n#undef MARCH_PYBIND_VECTOR_SCALAR_OP\n#undef MARCH_PYBIND_VECTOR_VECTOR_OP\n }\n\n wrapper_type & add_element_init(Vector<3> const &) {\n namespace py = pybind11;\n (*this)\n .def(py::init([](real_type v0, real_type v1, real_type v2) { return wrapped_type(v0, v1, v2); }))\n ;\n return *this;\n }\n\n wrapper_type & add_element_init(Vector<2> const &) {\n namespace py = pybind11;\n (*this)\n .def(py::init([](real_type v0, real_type v1) { return wrapped_type(v0, v1); }))\n ;\n return *this;\n }\n\n}; \n\n} \n\n} \n\n"},"prefix":{"kind":"string","value":"#pragma once\n\n#include <pybind11/pybind11.h>\n#include <pybind11/stl.h>\n\n#include <utility>\n#include <memory>\n#include <vector>\n#include <algorithm>\n#include <cstring>\n\n#include \"march.hpp\"\n#include \"march/python/WrapBase.hpp\"\n\nnamespace march {\n\nnamespace python {\n\nclass\nMARCH_PYTHON_WRAPPER_VISIBILITY\nWrapBuffer\n : public WrapBase< WrapBuffer, Buffer, std::shared_ptr<Buffer> >\n{\n\n friend base_type;\n\n WrapBuffer(pybind11::module & mod, const char * pyname, const char * clsdoc)\n : base_type(mod, pyname, clsdoc)\n {\n }\n\n}; \n\nclass\nMARCH_PYTHON_WRAPPER_VISIBILITY\nWrapLookupTableCore\n : public WrapBase< WrapLookupTableCore, LookupTableCore >\n{\n\n friend base_type;\n\n WrapLookupTableCore(pybind11::module & mod, const char * pyname, const char * clsdoc)\n : base_type(mod, pyname, clsdoc)\n {\n namespace py = pybind11;\n (*this)\n .init()\n .def_property_readonly(\"nghost\", &LookupTableCore::nghost)\n .def_property_readonly(\"nbody\", &LookupTableCore::nbody)\n .def_property_readonly(\"ncolumn\", &LookupTableCore::ncolumn)\n .array_readwrite()\n .array_readonly()\n .pickle()\n .address()\n .def(\"__getattr__\", [](LookupTableCore & tbl, py::object key) {\n return py::object(Table(tbl).full().attr(key));\n })\n .def_property_readonly(\"_nda\", [](LookupTableCore & tbl) {\n return Table(tbl).full();\n })\n ;\n }\n\n wrapper_type & init() {\n namespace py = pybind11;\n return def(py::init([](py::args args, py::kwargs kwargs) {\n std::vector<index_type> dims(args.size()-1);\n index_type nghost = args[0].cast<index_type>();\n index_type nbody = args[1].cast<index_type>();\n dims[0] = nghost + nbody;\n for (size_t it=1; it<dims.size(); ++it) {\n dims[it] = args[it+1].cast<index_type>();\n }\n\n PyArray_Descr * descr = nullptr;\n if (kwargs && kwargs.contains(\"dtype\")) {\n PyArray_DescrConverter(py::object(kwargs[\"dtype\"]).ptr(), &descr);\n }\n if (nullptr == descr) {\n descr = PyArray_DescrFromType(NPY_INT);\n }\n DataTypeId dtid = static_cast<DataTypeId>(descr->type_num);\n Py_DECREF(descr);\n\n LookupTableCore table(nghost, nbody, dims, dtid);\n\n std::string creation(\"empty\");\n if (kwargs && kwargs.contains(\"creation\")) {\n creation = kwargs[\"creation\"].cast<std::string>();\n }\n if (\"zeros\" == creation) {\n memset(table.buffer()->template data<char>(), 0, table.buffer()->nbyte());\n } else if (\"empty\" == creation) {\n \n } else {\n throw py::value_error(\"invalid creation type\");\n }\n\n return table;\n }));\n }\n\n wrapper_type & array_readwrite() {\n namespace py = pybind11;\n return def_property(\n \"F\",\n [](LookupTableCore & tbl) { return Table(tbl).full(); },\n [](LookupTableCore & tbl, py::array src) { Table::CopyInto(Table(tbl).full(), src); },\n \"Full array.\")\n .def_property(\n \"G\",\n [](LookupTableCore & tbl) { return Table(tbl).ghost(); },\n [](LookupTableCore & tbl, py::array src) {\n "},"suffix":{"kind":"string","value":"\n },\n \"Ghost-part array.\")\n .def_property(\n \"B\",\n [](LookupTableCore & tbl) { return Table(tbl).body(); },\n [](LookupTableCore & tbl, py::array src) { Table::CopyInto(Table(tbl).body(), src); },\n \"Body-part array.\")\n ;\n }\n\n wrapper_type & array_readonly() {\n return def_property_readonly(\n \"_ghostpart\",\n [](LookupTableCore & tbl) { return Table(tbl).ghost(); },\n \"Ghost-part array without setter.\")\n .def_property_readonly(\n \"_bodypart\",\n [](LookupTableCore & tbl) { return Table(tbl).body(); },\n \"Body-part array without setter.\")\n ;\n }\n\n wrapper_type & pickle() {\n namespace py = pybind11;\n return def(py::pickle(\n [](LookupTableCore & tbl){\n return py::make_tuple(tbl.nghost(), tbl.nbody(), tbl.dims(), (long)tbl.datatypeid(), Table(tbl).full());\n },\n [](py::tuple tpl){\n if (tpl.size() != 5) { throw std::runtime_error(\"Invalid state for Table (LookupTableCore)!\"); }\n index_type nghost = tpl[0].cast<index_type>();\n index_type nbody = tpl[1].cast<index_type>();\n std::vector<index_type> dims = tpl[2].cast<std::vector<index_type>>();\n DataTypeId datatypeid = static_cast<DataTypeId>(tpl[3].cast<long>());\n py::array src = tpl[4].cast<py::array>();\n LookupTableCore tbl(nghost, nbody, dims, datatypeid);\n Table::CopyInto(Table(tbl).full(), src);\n return tbl;\n }\n ));\n }\n\n wrapper_type & address() {\n return def_property_readonly(\n \"offset\",\n [](LookupTableCore & tbl) { return tbl.nghost() * tbl.ncolumn(); },\n \"Element offset from the head of the ndarray to where the body starts.\")\n .def_property_readonly(\n \"_ghostaddr\",\n [](LookupTableCore & tbl) { return (Py_intptr_t) Table::BYTES(Table(tbl).full()); })\n .def_property_readonly(\n \"_bodyaddr\",\n [](LookupTableCore & tbl) { return (Py_intptr_t) Table::BYTES(Table(tbl).body()); })\n ;\n }\n\n}; \n\ntemplate< size_t NDIM >\nclass\nMARCH_PYTHON_WRAPPER_VISIBILITY\nWrapVector\n : public WrapBase< WrapVector<NDIM>, Vector<NDIM> >\n{\n\n \n using base_type = WrapBase< WrapVector<NDIM>, Vector<NDIM> >;\n using wrapper_type = typename base_type::wrapper_type;\n using wrapped_type = typename base_type::wrapped_type;\n\n friend base_type;\n\n WrapVector(pybind11::module & mod, const char * pyname, const char * clsdoc)\n : base_type(mod, pyname, clsdoc)\n {\n namespace py = pybind11;\n\n wrapped_type dummy;\n\n#define MARCH_PYBIND_VECTOR_SCALAR_OP(PYNAME, CXXOP) \\\n .def(\"__i\" #PYNAME \"__\", [](wrapped_type & self, real_type v) { self CXXOP v; return self; }) \\\n .def(\"__\" #PYNAME \"__\", [](wrapped_type & self, real_type v) { auto ret(self); ret CXXOP v; return ret; })\n\n#define MARCH_PYBIND_VECTOR_VECTOR_OP(PYNAME, CXXOP) \\\n .def(\"__i\" #PYNAME \"__\", [](wrapped_type & self, wrapped_type const & v) { self CXXOP v; return self; }) \\\n .def(\"__\" #PYNAME \"__\", [](wrapped_type & self, wrapped_type const & v) { auto ret(self); ret CXXOP v; return ret; })\n\n (*this)\n .def(py::init([]() { return wrapped_type(); }))\n .def(py::init([](wrapped_type & other) { return wrapped_type(other); }))\n .add_element_init(dummy)\n .def(\"repr\", &wrapped_type::repr, py::arg(\"indent\")=0, py::arg(\"precision\")=0)\n .def(\"__repr__\", [](wrapped_type & self){ return self.repr(); })\n .def(\"__eq__\", &wrapped_type::operator==)\n .def(\n \"__hash__\",\n [](wrapped_type const & self) {\n py::list tmp;\n for (size_t it=0; it<self.size(); ++it) {\n tmp.append(self[it]);\n }\n return py::hash(tmp);\n }\n )\n .def(\"is_close_to\", &wrapped_type::is_close_to)\n .def(\"__len__\", &wrapped_type::size)\n .def(\n \"__getitem__\",\n [](wrapped_type & self, index_type i) { return self.at(i); },\n py::return_value_policy::copy\n )\n .def(\n \"__setitem__\",\n [](wrapped_type & self, index_type i, real_type v) { self.at(i) = v; }\n )\n MARCH_PYBIND_VECTOR_VECTOR_OP(add, +=)\n MARCH_PYBIND_VECTOR_VECTOR_OP(sub, -=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(add, +=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(sub, -=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(mul, *=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(div, /=)\n MARCH_PYBIND_VECTOR_SCALAR_OP(truediv, /=)\n \n ;\n\n#undef MARCH_PYBIND_VECTOR_SCALAR_OP\n#undef MARCH_PYBIND_VECTOR_VECTOR_OP\n }\n\n wrapper_type & add_element_init(Vector<3> const &) {\n namespace py = pybind11;\n (*this)\n .def(py::init([](real_type v0, real_type v1, real_type v2) { return wrapped_type(v0, v1, v2); }))\n ;\n return *this;\n }\n\n wrapper_type & add_element_init(Vector<2> const &) {\n namespace py = pybind11;\n (*this)\n .def(py::init([](real_type v0, real_type v1) { return wrapped_type(v0, v1); }))\n ;\n return *this;\n }\n\n}; \n\n} \n\n} \n\n"},"middle":{"kind":"string","value":"if (tbl.nghost()) {\n Table::CopyInto(Table(tbl).ghost(), src);\n } else {\n throw py::index_error(\"ghost is zero\");\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"class LookupTable<ElemType, 0>: public LookupTableCore\n\n{\n\n\n\npublic:\n\n\n\n using elem_type = ElemType;\n\n\n\n typedef elem_type (&row_type);\n\n typedef const elem_type (&const_row_type);\n\n\n\n LookupTable() {}\n\n\n\n LookupTable(index_type nghost, index_type nbody)\n\n : LookupTableCore(nghost, nbody, std::vector<index_type>({nghost+nbody}), type_to<ElemType>::id)\n\n {}\n\n\n\n row_type operator[](index_type loc) {\n\n return *reinterpret_cast<elem_type *>(row(loc));\n\n }\n\n\n","file_path":"libmarch/include/march/core/LookupTable.hpp","rank":0,"score":350371.82836060657},{"content":"class Buffer: public std::enable_shared_from_this<Buffer> {\n\n\n\nprivate:\n\n\n\n size_t m_length = 0;\n\n char * m_data = nullptr;\n\n\n\n struct ctor_passkey {};\n\n\n\npublic:\n\n\n\n Buffer(const ctor_passkey &) { }\n\n\n\n static std::shared_ptr<Buffer> construct() {\n\n return std::make_shared<Buffer>(ctor_passkey());\n\n }\n\n\n\n /**\n\n * \\param[in] length Memory buffer length.\n\n */\n","file_path":"libmarch/include/march/core/Buffer.hpp","rank":1,"score":335039.3033220356},{"content":"class LookupTable: public LookupTableCore\n\n{\n\n\n\npublic:\n\n\n\n using elem_type = ElemType;\n\n\n\n typedef elem_type (&row_type)[NCOLUMN];\n\n typedef const elem_type (&const_row_type)[NCOLUMN];\n\n\n\n LookupTable() {}\n\n\n\n LookupTable(index_type nghost, index_type nbody)\n\n : LookupTableCore(nghost, nbody, std::vector<index_type>({nghost+nbody, NCOLUMN}), type_to<ElemType>::id)\n\n {}\n\n\n\n row_type operator[](index_type loc) {\n\n return *reinterpret_cast<elem_type(*)[NCOLUMN]>(row(loc));\n\n }\n\n\n","file_path":"libmarch/include/march/core/LookupTable.hpp","rank":2,"score":304842.5503635246},{"content":"class Order1Hand : public HandCRTP< Order1Hand<NDIM>, HandTraits<SolutionOrder1Table<real_type, NDIM>, Vector<NDIM>> >\n\n{\n\npublic:\n\n using base_type = HandCRTP< Order1Hand<NDIM>, HandTraits<SolutionOrder1Table<real_type, NDIM>, Vector<NDIM>> >;\n\n using base_type::base_type;\n\n using trait_type = HandTraits<SolutionOrder1Table<real_type, NDIM>, Vector<NDIM>>;\n\n using vector_type = Vector<NDIM>;\n\n using matrix_type = Matrix<NDIM>;\n\n Order1Hand & operator=(vector_type const & value) {\n\n for (index_type it=0; it<trait_type::neq; ++it) { (**this)[it] = value; }\n\n return *this;\n\n }\n\n Order1Hand & operator=(real_type value) {\n\n for (index_type it=0; it<trait_type::neq; ++it) { (**this)[it] = value; }\n\n return *this;\n\n }\n\n vector_type & density() { return (**this)[0]; }\n\n vector_type const & density() const { return (**this)[0]; }\n\n matrix_type & momentum() { return *reinterpret_cast<matrix_type *>(&(**this)[1]); }\n\n matrix_type const & momentum() const { return *reinterpret_cast<matrix_type const *>(&(**this)[1]); }\n\n vector_type & energy() { return (**this)[NDIM+1]; }\n\n vector_type const & energy() const { return (**this)[NDIM+1]; }\n\n}; /* end class Order1Hand */\n\n\n\n/**\n\n * Solution arrays.\n\n */\n\ntemplate< size_t NDIM >\n","file_path":"libmarch/include/march/gas/Solution.hpp","rank":3,"score":295000.73254999385},{"content":"class Table {\n\n\n\nprivate:\n\n\n\n enum array_flavor { FULL = 0, GHOST = 1, BODY = 2 };\n\n\n\npublic:\n\n\n\n Table(LookupTableCore & table) : m_table(table) {}\n\n\n\n Table(Table const & ) = delete;\n\n Table(Table &&) = delete;\n\n Table & operator=(Table const & ) = delete;\n\n Table & operator=(Table &&) = delete;\n\n\n\n pybind11::array full () { return from(FULL ); }\n\n pybind11::array ghost() { return from(GHOST); }\n\n pybind11::array body () { return from(BODY ); }\n\n\n\n static int NDIM (pybind11::array arr) { return PyArray_NDIM ((PyArrayObject *) arr.ptr()); }\n","file_path":"libmarch/include/march/python/WrapBase.hpp","rank":4,"score":292538.4033486382},{"content":"class PythonAnchor : public gas::CommonAnchor\n\n{\n\n\n\npublic:\n\n\n\n virtual ~PythonAnchor() {}\n\n\n\n template <size_t NDIM> PythonAnchor(ctor_passkey const & pk, gas::Solver<NDIM> & svr)\n\n : CommonAnchor(pk, svr) {}\n\n\n\n template <size_t NDIM>\n\n static std::shared_ptr<PythonAnchor> construct(gas::Solver<NDIM> & svr) {\n\n return std::make_shared<PythonAnchor>(ctor_passkey(), svr);\n\n }\n\n\n\n#define DECL_MARCH_GAS_PYTHON_ANCHOR_METHOD(NAME) \\\n\n void NAME() override { PYBIND11_OVERLOAD(void, CommonAnchor, NAME); }\n\n\n\n DECL_MARCH_GAS_PYTHON_ANCHOR_METHOD(provide)\n\n DECL_MARCH_GAS_PYTHON_ANCHOR_METHOD(preloop)\n","file_path":"libmarch/include/march/python/wrapper_gas.hpp","rank":5,"score":290983.1737255276},{"content":"class FooTest : public ::testing::TestWithParam<const char*> {\n\n // You can implement all the usual class fixture members here.\n\n};\n\n\n\n// Then, use the TEST_P macro to define as many parameterized tests\n\n// for this fixture as you want. The _P suffix is for \"parameterized\"\n\n// or \"pattern\", whichever you prefer to think.\n\n\n\nTEST_P(FooTest, DoesBlah) {\n\n // Inside a test, access the test parameter with the GetParam() method\n\n // of the TestWithParam<T> class:\n\n EXPECT_TRUE(foo.Blah(GetParam()));\n\n ...\n\n}\n\n\n\nTEST_P(FooTest, HasBlahBlah) {\n\n ...\n\n}\n\n\n\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\n","file_path":"libmarch/tests/gtest/gtest.h","rank":6,"score":271620.3838763124},{"content":"class PythonAnchorManager : public gas::AnchorChain<NDIM>::LifeManager {\n\n\n\npublic:\n\n\n\n void append(pybind11::object const & pyobj) { m_list.push_back(pyobj); }\n\n\n\nprivate:\n\n\n\n std::list<pybind11::object> m_list;\n\n\n\n}; /* class PythonAnchorManager */\n\n\n\ntemplate< size_t NDIM >\n\nclass\n\nMARCH_PYTHON_WRAPPER_VISIBILITY\n\nWrapGasAnchorChain\n\n : public WrapBase< WrapGasAnchorChain<NDIM>, gas::AnchorChain<NDIM> >\n\n{\n\n\n\n /* aliases for dependent type name lookup */\n","file_path":"libmarch/include/march/python/wrapper_gas.hpp","rank":7,"score":262708.0908330167},{"content":"class Order0Hand : public HandCRTP< Order0Hand<NDIM>, HandTraits<SolutionOrder0Table<real_type, NDIM>, real_type> >\n\n{\n\npublic:\n\n using base_type = HandCRTP< Order0Hand<NDIM>, HandTraits<SolutionOrder0Table<real_type, NDIM>, real_type> >;\n\n using base_type::base_type;\n\n using trait_type = HandTraits<SolutionOrder0Table<real_type, NDIM>, real_type>;\n\n using vector_type = Vector<NDIM>;\n\n Order0Hand & operator=(real_type value) {\n\n for (index_type it=0; it<trait_type::neq; ++it) { (**this)[it] = value; }\n\n return *this;\n\n }\n\n // accessors to solution quantities.\n\n real_type & density() { return (**this)[0]; }\n\n real_type const & density() const { return (**this)[0]; }\n\n vector_type & momentum() { return *reinterpret_cast<vector_type *>(&(**this)[1]); }\n\n vector_type const & momentum() const { return *reinterpret_cast<vector_type const *>(&(**this)[1]); }\n\n real_type & energy() { return (**this)[NDIM+1]; }\n\n real_type const & energy() const { return (**this)[NDIM+1]; }\n\n // accessors physics values.\n\n real_type pressure(real_type gamma /* ratio of specific heat */) const {\n","file_path":"libmarch/include/march/gas/Solution.hpp","rank":8,"score":260702.7733387092},{"content":"struct array_assign_< ElemType, NCOLUMN, 0 > {\n\n typedef ElemType (&array_type)[NCOLUMN];\n\n typedef const ElemType (&const_array_type)[NCOLUMN];\n\n static void act(array_type row_out, const_array_type row_in) {\n\n row_out[0] = row_in[0];\n\n }\n\n}; /* end struct array_assign_ specialization */\n\n\n\ntemplate < typename ElemType, size_t NCOLUMN >\n\nvoid array_assign(ElemType (&row_out)[NCOLUMN], const ElemType (&row_in)[NCOLUMN]) {\n\n array_assign_<ElemType, NCOLUMN, NCOLUMN-1>::act(row_out, row_in);\n\n}\n\n\n\n} /* end namespace aux */\n\n\n\n/**\n\n * Typed unresizeable lookup table.\n\n */\n\ntemplate< typename ElemType, size_t NCOLUMN >\n","file_path":"libmarch/include/march/core/LookupTable.hpp","rank":9,"score":255680.31241844862},{"content":"class HandCRTP : public HandBase {\n\n\n\npublic:\n\n\n\n using derived_type = Derived;\n\n using trait_type = Traits;\n\n using table_type = typename trait_type::table_type;\n\n using item_reference = typename trait_type::item_reference;\n\n using item_const_reference = typename trait_type::item_const_reference;\n\n using row_type = typename trait_type::row_type;\n\n using row_pointer = typename trait_type::row_pointer;\n\n using row_reference = typename trait_type::row_reference;\n\n using row_const_reference = typename trait_type::row_const_reference;\n\n\n\n HandCRTP(table_type & table, index_type irow) : HandCRTP(&table[irow]) {}\n\n HandCRTP(table_type const & table, index_type irow) : HandCRTP(&table[irow]) {}\n\n\n\n derived_type & assign(derived_type && other) { this->m_ptr = other.m_ptr; }\n\n\n\n HandCRTP(HandCRTP && other) : HandCRTP(other.ptr()) {}\n","file_path":"libmarch/include/march/gas/Solution.hpp","rank":10,"score":247669.4657521054},{"content":"class LookupTableCore {\n\n\n\nprivate:\n\n\n\n std::shared_ptr<Buffer> m_buffer;\n\n std::vector<index_type> m_dims;\n\n index_type m_nghost = 0;\n\n index_type m_nbody = 0;\n\n index_type m_ncolumn = 0;\n\n index_type m_elsize = 1; ///< Element size in bytes.\n\n DataTypeId m_datatypeid = MH_INT8;\n\n\n\npublic:\n\n\n\n LookupTableCore() : m_buffer(Buffer::construct()), m_dims() { }\n\n\n\n /**\n\n * \\param[in] nghost Number of ghost (negative index) rows.\n\n * \\param[in] nbody Number of body (non-negative index) rows.\n\n * \\param[in] dims The shape of the table, including the combined row\n","file_path":"libmarch/include/march/core/LookupTable.hpp","rank":11,"score":245626.06455222395},{"content":"class CellTypeGroup {\n\n\n\npublic:\n\n\n\n CellTypeGroup(CellTypeGroup const & ) = delete;\n\n CellTypeGroup(CellTypeGroup &&) = delete;\n\n CellTypeGroup const & operator=(CellTypeGroup const & ) = delete;\n\n CellTypeGroup && operator=(CellTypeGroup &&) = delete;\n\n\n\n CellType const & point () const { return m_cell_types[CellType::POINT ]; }\n\n CellType const & line () const { return m_cell_types[CellType::LINE ]; }\n\n CellType const & quadrilateral() const { return m_cell_types[CellType::QUADRILATERAL]; }\n\n CellType const & triangle () const { return m_cell_types[CellType::TRIANGLE ]; }\n\n CellType const & hexahedron () const { return m_cell_types[CellType::HEXAHEDRON ]; }\n\n CellType const & tetrahedron () const { return m_cell_types[CellType::TETRAHEDRON ]; }\n\n CellType const & prism () const { return m_cell_types[CellType::PRISM ]; }\n\n CellType const & pyramid () const { return m_cell_types[CellType::PYRAMID ]; }\n\n\n\n CellType const & operator[](size_t id) const { return m_cell_types[id]; }\n\n size_t size() const { return sizeof(m_cell_types) / sizeof(CellType); }\n","file_path":"libmarch/include/march/mesh/CellType.hpp","rank":12,"score":245516.99247212458},{"content":"class InstanceCounter {\n\n\n\npublic:\n\n\n\n InstanceCounter() { ++m_active_instance_count; }\n\n InstanceCounter(InstanceCounter const &) { ++m_active_instance_count; }\n\n ~InstanceCounter() { --m_active_instance_count; }\n\n\n\n static size_t active_instance_count() { return m_active_instance_count; }\n\n\n\nprivate:\n\n\n\n static size_t m_active_instance_count;\n\n\n\n}; /* end class InstanceCounter */\n\n\n\ntemplate< class T > size_t InstanceCounter<T>::m_active_instance_count = 0;\n\n\n\n} /* end namespace march */\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/include/march/core/memory.hpp","rank":13,"score":242051.1529434481},{"content":" class Resizer {\n\n public:\n\n Resizer(LookupTableCore & table) : m_table(table) {}\n\n LookupTableCore operator()(index_type nghost, index_type nbody) {\n\n LookupTableCore newtable = new_table(m_table, nghost, nbody);\n\n copy(newtable, m_table);\n\n return newtable;\n\n }\n\n template< class ValueType >\n\n LookupTableCore operator()(index_type nghost, index_type nbody, ValueType initial) {\n\n LookupTableCore newtable = new_table(m_table, nghost, nbody);\n\n fill(newtable, initial);\n\n copy(newtable, m_table);\n\n return newtable;\n\n }\n\n private:\n\n static LookupTableCore new_table(LookupTableCore const & src, index_type nghost, index_type nbody) {\n\n std::vector<index_type> dims(src.m_dims);\n\n dims[0] = nghost + nbody;\n\n return LookupTableCore(nghost, nbody, dims, src.m_datatypeid);\n","file_path":"libmarch/include/march/core/LookupTable.hpp","rank":14,"score":241987.21942185902},{"content":"class UniversalTersePrinter<const char*> {\n\n public:\n\n static void Print(const char* str, ::std::ostream* os) {\n\n if (str == NULL) {\n\n *os << \"NULL\";\n\n } else {\n\n UniversalPrint(string(str), os);\n\n }\n\n }\n\n};\n\ntemplate <>\n","file_path":"libmarch/tests/gtest/gtest.h","rank":15,"score":239571.6495064805},{"content":"struct SolutionOrder0Table : public LookupTable< ElemType, SolutionTableTraits<NDIM>::neq >\n\n{\n\n using table_traits = SolutionTableTraits<NDIM>;\n\n constexpr static size_t ndim = table_traits::ndim;\n\n constexpr static size_t neq = table_traits::neq;\n\n using base_type = LookupTable<ElemType, neq>;\n\n using hand_type = Order0Hand<ndim>;\n\n SolutionOrder0Table(index_type nghost, index_type nbody) : base_type(nghost, nbody) {}\n\n hand_type hat(index_type irow) { return hand_type(*this, irow); }\n\n hand_type const hat(index_type irow) const { return hand_type(*this, irow); }\n\n}; /* end struct SolutionOrder0Table */\n\n\n\ntemplate< size_t NDIM > class Order1Hand;\n\n\n\ntemplate< typename ElemType, size_t NDIM >\n","file_path":"libmarch/include/march/gas/Solution.hpp","rank":16,"score":238671.83435348305},{"content":"class ModuleInitializer {\n\n\n\npublic:\n\n\n\n static ModuleInitializer & get_instance() {\n\n static ModuleInitializer inst;\n\n return inst;\n\n }\n\n\n\n void initialize(pybind11::module & topmod) {\n\n if (!m_initialized) {\n\n initialize_march(topmod);\n\n initialize_march_gas(topmod);\n\n }\n\n }\n\n\n\n bool is_initialized() const { return m_initialized; }\n\n\n\nprivate:\n\n\n","file_path":"libmarch/include/march/python/WrapBase.hpp","rank":17,"score":236886.61123442376},{"content":"class TrimInterface : public TrimBase<NDIM> {\n\n\n\npublic:\n\n\n\n using base_type = TrimBase<NDIM>;\n\n using solver_type = typename base_type::solver_type;\n\n using block_type = typename base_type::block_type;\n\n using pointer = typename base_type::pointer;\n\n\n\n TrimInterface(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\n\n static_assert(sizeof(TrimInterface<NDIM>) == sizeof(base_type), \"TrimInterface size mismatch\");\n\n }\n\n ~TrimInterface() override {}\n\n std::string type_name() override { return string::get_type_name(*this); }\n\n void apply_do0() override { /* FIXME: add code */ }\n\n void apply_do1() override { /* FIXME: add code */ }\n\n\n\n}; /* end class TrimInterface */\n\n\n\n\n\ntemplate< size_t NDIM >\n","file_path":"libmarch/include/march/gas/Trim.hpp","rank":18,"score":236354.4027404365},{"content":"class TrimInlet : public TrimBase<NDIM> {\n\n\n\npublic:\n\n\n\n constexpr static size_t NVALUE = 6;\n\n\n\n using base_type = TrimBase<NDIM>;\n\n using solver_type = typename base_type::solver_type;\n\n using block_type = typename base_type::block_type;\n\n using pointer = typename base_type::pointer;\n\n\n\n TrimInlet(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\n\n static_assert(sizeof(TrimInlet<NDIM>) == sizeof(base_type), \"TrimInlet size mismatch\");\n\n }\n\n\n\n ~TrimInlet() override {}\n\n std::string type_name() override { return string::get_type_name(*this); }\n\n void apply_do0() override;\n\n void apply_do1() override;\n\n\n","file_path":"libmarch/include/march/gas/Trim.hpp","rank":19,"score":236354.4027404365},{"content":"class TrimNoOp : public TrimBase<NDIM> {\n\n\n\npublic:\n\n\n\n using base_type = TrimBase<NDIM>;\n\n using solver_type = typename base_type::solver_type;\n\n using block_type = typename base_type::block_type;\n\n using pointer = typename base_type::pointer;\n\n\n\n TrimNoOp(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\n\n static_assert(sizeof(TrimNoOp<NDIM>) == sizeof(base_type), \"TrimNoOp size mismatch\");\n\n }\n\n ~TrimNoOp() override {}\n\n std::string type_name() override { return string::get_type_name(*this); }\n\n void apply_do0() override {}\n\n void apply_do1() override {}\n\n\n\n}; /* end class TrimNoOp */\n\n\n\n\n\ntemplate< size_t NDIM >\n","file_path":"libmarch/include/march/gas/Trim.hpp","rank":20,"score":236354.4027404365},{"content":"struct SolutionOrder1Table : public LookupTable< ElemType, NDIM*SolutionTableTraits<NDIM>::neq >\n\n{\n\n using table_traits = SolutionTableTraits<NDIM>;\n\n constexpr static size_t ndim = table_traits::ndim;\n\n constexpr static size_t neq = table_traits::neq;\n\n using base_type = LookupTable<ElemType, ndim*neq>;\n\n using hand_type = Order1Hand<ndim>;\n\n SolutionOrder1Table(index_type nghost, index_type nbody) : base_type(nghost, nbody) {}\n\n hand_type hat(index_type irow) { return hand_type(*this, irow); }\n\n hand_type const hat(index_type irow) const { return hand_type(*this, irow); }\n\n}; /* end struct SolutionOrder0Table */\n\n\n","file_path":"libmarch/include/march/gas/Solution.hpp","rank":21,"score":233360.5811058531},{"content":"class TrimSlipWall : public TrimBase<NDIM> {\n\n\n\npublic:\n\n\n\n using base_type = TrimBase<NDIM>;\n\n using solver_type = typename base_type::solver_type;\n\n using block_type = typename base_type::block_type;\n\n using pointer = typename base_type::pointer;\n\n\n\n TrimSlipWall(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\n\n static_assert(sizeof(TrimSlipWall<NDIM>) == sizeof(base_type), \"TrimSlipWall size mismatch\");\n\n }\n\n\n\n ~TrimSlipWall() override {}\n\n std::string type_name() override { return string::get_type_name(*this); }\n\n void apply_do0() override;\n\n void apply_do1() override;\n\n\n\n}; /* end class TrimSlipWall */\n\n\n","file_path":"libmarch/include/march/gas/Trim.hpp","rank":22,"score":232190.06122849713},{"content":"class TrimNonRefl : public TrimBase<NDIM> {\n\n\n\npublic:\n\n\n\n using base_type = TrimBase<NDIM>;\n\n using pointer = typename base_type::pointer;\n\n using solver_type = typename base_type::solver_type;\n\n using block_type = typename base_type::block_type;\n\n\n\n TrimNonRefl(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\n\n static_assert(sizeof(TrimNonRefl<NDIM>) == sizeof(base_type), \"TrimNonRefl size mismatch\");\n\n }\n\n\n\n ~TrimNonRefl() override {}\n\n std::string type_name() override { return string::get_type_name(*this); }\n\n void apply_do0() override;\n\n void apply_do1() override;\n\n\n\n}; /* end class TrimNonRefl */\n\n\n","file_path":"libmarch/include/march/gas/Trim.hpp","rank":23,"score":232190.06122849713},{"content":"#define MH_DECL_CELL_TYPE(NAME, TYPE, DIM, NNODE, NEDGE, NSURFACE) \\\n\nstruct NAME##CellType : public CellType { \\\n\n NAME##CellType() : CellType(TYPE, DIM, NNODE, NEDGE, NSURFACE) {} \\\n\n};\n\n// id, ndim, nnode, nedge, nsurface\n\nMH_DECL_CELL_TYPE(Point , 0, 0, 1, 0, 0 ) // point/node/vertex\n\nMH_DECL_CELL_TYPE(Line , 1, 1, 2, 0, 0 ) // line/edge\n\nMH_DECL_CELL_TYPE(Quadrilateral, 2, 2, 4, 4, 0 )\n\nMH_DECL_CELL_TYPE(Triangle , 3, 2, 3, 3, 0 )\n\nMH_DECL_CELL_TYPE(Hexahedron , 4, 3, 8, 12, 6 ) // hexahedron/brick\n\nMH_DECL_CELL_TYPE(Tetrahedron , 5, 3, 4, 6, 4 )\n\nMH_DECL_CELL_TYPE(Prism , 6, 3, 6, 9, 5 )\n\nMH_DECL_CELL_TYPE(Pyramid , 7, 3, 5, 8, 5 )\n\n#undef MH_DECL_CELL_TYPE\n\n\n\nnamespace detail {\n\n\n","file_path":"libmarch/include/march/mesh/CellType.hpp","rank":24,"score":226373.0651716724},{"content":"class GETypeGroup {\n\n\n\npublic:\n\n\n\n GEType const & operator[](size_t id) const { return m_ge_types[id]; }\n\n size_t size() const { return sizeof(m_ge_types) / sizeof(GEType); }\n\n \n\n static const GETypeGroup & get_instance() {\n\n static GETypeGroup inst;\n\n return inst;\n\n }\n\n\n\nprivate:\n\n\n\n GETypeGroup()\n\n : m_ge_types{\n\n GEType(0, 0, 0 ) // point\n\n , GEType(1, 1, 1 ) // line\n\n , GEType(2, 4, 1.0/4) // quadrilateral\n\n , GEType(3, 3, 1.0/3) // triangle\n","file_path":"libmarch/include/march/mesh/ConservationElement/GradientElement.hpp","rank":25,"score":223098.4735375644},{"content":"class FaceHand : public BlockHandBase< NDIM, FaceHand<NDIM> > {\n\n\n\npublic:\n\n\n\n using base_type = BlockHandBase<NDIM, FaceHand<NDIM>>;\n\n using base_type::base_type;\n\n\n\n using block_type = UnstructuredBlock<NDIM>;\n\n using vector_type = Vector<NDIM>;\n\n\n\n std::string repr(size_t indent=0, size_t precision=0) const;\n\n\n\n index_type tpn() const { return this->block().fctpn()[this->index()]; }\n\n\n\n CellType const & type() const { return celltype(tpn()); }\n\n\n\n vector_type const & cnd() const { return this->row_as_vector(this->block().fccnd()[this->index()]); }\n\n vector_type const & nml() const { return this->row_as_vector(this->block().fcnml()[this->index()]); }\n\n real_type ara() const { return this->block().fcara()[this->index()]; }\n\n\n","file_path":"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp","rank":26,"score":203896.44827277877},{"content":"class CellHand : public BlockHandBase< NDIM, CellHand<NDIM> > {\n\n\n\npublic:\n\n\n\n using base_type = BlockHandBase<NDIM, CellHand<NDIM>>;\n\n using base_type::base_type;\n\n\n\n using block_type = UnstructuredBlock<NDIM>;\n\n using vector_type = Vector<NDIM>;\n\n\n\n std::string repr(size_t indent=0, size_t precision=0) const;\n\n\n\n index_type tpn() const { return this->block().cltpn()[this->index()]; }\n\n\n\n CellType const & type() const { return celltype(tpn()); }\n\n\n\n vector_type const & cnd() const {\n\n return *reinterpret_cast<vector_type const *>(&(this->block().clcnd()[this->index()][0]));\n\n }\n\n\n","file_path":"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp","rank":27,"score":203896.44827277877},{"content":"class NodeHand : public BlockHandBase< NDIM, NodeHand<NDIM> > {\n\n\n\npublic:\n\n\n\n using base_type = BlockHandBase<NDIM, NodeHand<NDIM>>;\n\n using base_type::base_type;\n\n\n\n using block_type = UnstructuredBlock<NDIM>;\n\n using vector_type = Vector<NDIM>;\n\n\n\n std::string repr(size_t indent=0, size_t precision=0) const;\n\n\n\n vector_type const & crd() const { return this->row_as_vector(this->block().ndcrd()[this->index()]); }\n\n\n\n}; /* end class NodeHand */\n\n\n\ntemplate< size_t NDIM >\n\nstd::string NodeHand<NDIM>::repr(size_t indent, size_t precision) const {\n\n std::string ret(string::format(\"NodeHand%ldD(index=%d\", NDIM, this->index()));\n\n ret += \", crd=\" + crd().repr(indent, precision) + \")\";\n\n return ret;\n\n}\n\n\n\ntemplate< size_t NDIM > class CellHand;\n\n\n\ntemplate< size_t NDIM >\n","file_path":"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp","rank":28,"score":203896.44827277877},{"content":"enum DataTypeId {\n\n MH_BOOL=0,\n\n MH_INT8, MH_UINT8,\n\n MH_INT16, MH_UINT16,\n\n MH_INT32, MH_UINT32,\n\n MH_LONG, MH_ULONG,\n\n MH_INT64, MH_UINT64,\n\n MH_FLOAT, MH_DOUBLE, MH_LONGDOUBLE,\n\n MH_CFLOAT, MH_CDOUBLE, MH_CLONGDOUBLE\n\n};\n\n\n\ninline size_t data_type_size(const DataTypeId dtid) {\n\n size_t ret = 0;\n\n switch (dtid) {\n\n case MH_BOOL:\n\n case MH_INT8:\n\n case MH_UINT8:\n\n ret = 1;\n\n break;\n\n case MH_INT16:\n","file_path":"libmarch/include/march/core/types.hpp","rank":29,"score":201609.49496733624},{"content":"// The convenience class for users who need to override just one or two\n\n// methods and are not concerned that a possible change to a signature of\n\n// the methods they override will not be caught during the build. For\n\n// comments about each method please see the definition of TestEventListener\n\n// above.\n\nclass EmptyTestEventListener : public TestEventListener {\n\n public:\n\n virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {}\n\n virtual void OnTestIterationStart(const UnitTest& /*unit_test*/,\n\n int /*iteration*/) {}\n\n virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {}\n\n virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {}\n\n virtual void OnTestCaseStart(const TestCase& /*test_case*/) {}\n\n virtual void OnTestStart(const TestInfo& /*test_info*/) {}\n\n virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {}\n\n virtual void OnTestEnd(const TestInfo& /*test_info*/) {}\n\n virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {}\n\n virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {}\n\n virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {}\n\n virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/,\n\n int /*iteration*/) {}\n\n virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {}\n\n};\n\n\n","file_path":"libmarch/tests/gtest/gtest.h","rank":30,"score":198338.2324460745},{"content":"class UnstructuredBlock\n\n : public std::enable_shared_from_this<UnstructuredBlock<NDIM>>\n\n{\n\n\n\npublic:\n\n\n\n static_assert(2 == NDIM || 3 == NDIM, \"not 2 or 3 dimensional\");\n\n\n\n static constexpr index_type FCMND = CellType::FCNND_MAX;\n\n static constexpr index_type CLMND = CellType::CLNND_MAX;\n\n static constexpr index_type CLMFC = CellType::CLNFC_MAX;\n\n static constexpr index_type FCNCL = 4;\n\n static constexpr index_type FCREL = 4;\n\n static constexpr index_type BFREL = BoundaryData::BFREL;\n\n\n\n // TODO: move to UnstructuredBlock.\n\n // @[\n\n void locate_point(const real_type (& crd)[NDIM]) const;\n\n\n\n // moved to mesh: void prepare_ce();\n","file_path":"libmarch/include/march/mesh/UnstructuredBlock/class.hpp","rank":31,"score":197416.0682546721},{"content":" class ctor_passkey {\n\n private:\n\n ctor_passkey() = default;\n\n friend UnstructuredBlock<NDIM>;\n\n };\n\n\n\n UnstructuredBlock(\n\n const ctor_passkey &\n\n , index_type nnode, index_type nface, index_type ncell, index_type nbound\n\n , index_type ngstnode, index_type ngstface, index_type ngstcell\n\n , bool use_incenter\n\n ) : std::enable_shared_from_this<UnstructuredBlock<NDIM>>()\n\n , m_nnode(nnode), m_nface(nface), m_ncell(ncell), m_nbound(nbound)\n\n , m_ngstnode(ngstnode), m_ngstface(ngstface), m_ngstcell(ngstcell)\n\n , m_use_incenter(use_incenter)\n\n {\n\n build_tables();\n\n }\n\n\n\n UnstructuredBlock() = delete;\n","file_path":"libmarch/include/march/mesh/UnstructuredBlock/class.hpp","rank":32,"score":197416.0682546721},{"content":"struct array_assign_ {\n\n typedef ElemType (&array_type)[NCOLUMN];\n\n typedef const ElemType (&const_array_type)[NCOLUMN];\n\n static void act(array_type row_out, const_array_type row_in) {\n\n array_assign_<ElemType, NCOLUMN, INDEX-1>::act(row_out, row_in);\n\n row_out[INDEX] = row_in[INDEX];\n\n }\n\n}; /* end struct array_assign_ */\n\n\n\ntemplate < typename ElemType, size_t NCOLUMN >\n","file_path":"libmarch/include/march/core/LookupTable.hpp","rank":33,"score":196446.04053268413},{"content":"class Anchor\n\n : public std::enable_shared_from_this<Anchor<NDIM>>\n\n{\n\n\n\npublic:\n\n\n\n using solver_type = Solver<NDIM>;\n\n\n\n Anchor() = delete;\n\n Anchor(Anchor const & ) = delete;\n\n Anchor(Anchor &&) = delete;\n\n Anchor & operator=(Anchor const & ) = delete;\n\n Anchor & operator=(Anchor &&) = delete;\n\n\n\nprotected:\n\n\n","file_path":"libmarch/include/march/gas/Anchor.hpp","rank":34,"score":195375.60519170674},{"content":"class Solution {\n\n\n\npublic:\n\n\n\n using table_traits = SolutionTableTraits<NDIM>;\n\n static constexpr size_t ndim=table_traits::ndim;\n\n static constexpr size_t neq=table_traits::neq;\n\n\n\n using o0table_type = SolutionOrder0Table<real_type, ndim>;\n\n using o1table_type = SolutionOrder1Table<real_type, ndim>;\n\n using o0hand_type = typename o0table_type::hand_type;\n\n using o1hand_type = typename o1table_type::hand_type;\n\n\n\n Solution(index_type ngstcell, index_type ncell)\n\n : m_so0c(ngstcell, ncell), m_so0n(ngstcell, ncell), m_so0t(ngstcell, ncell)\n\n , m_so1c(ngstcell, ncell), m_so1n(ngstcell, ncell)\n\n , m_stm(ngstcell, ncell), m_cflo(ngstcell, ncell), m_cflc(ngstcell, ncell)\n\n , m_gamma(ngstcell, ncell)\n\n {}\n\n\n","file_path":"libmarch/include/march/gas/Solution.hpp","rank":35,"score":195375.60519170674},{"content":"class Quantity\n\n : public InstanceCounter<Quantity<NDIM>>\n\n , public std::enable_shared_from_this<Quantity<NDIM>>\n\n{\n\n\n\npublic:\n\n\n\n using solver_type = Solver<NDIM>;\n\n using solution_type = typename solver_type::solution_type;\n\n using block_type = UnstructuredBlock<NDIM>;\n\n using vector_type = Vector<NDIM>;\n\n\n\n using o0hand_type = typename solution_type::o0hand_type;\n\n using o1hand_type = typename solution_type::o1hand_type;\n\n\n\n static constexpr real_type ALMOST_ZERO = solver_type::ALMOST_ZERO;\n\n\n","file_path":"libmarch/include/march/gas/Quantity.hpp","rank":36,"score":195375.60519170674},{"content":" class Iterator : public ParamIteratorInterface<ParamType> {\n\n public:\n\n Iterator(const ParamGeneratorInterface<ParamType>* base,\n\n const ParamGenerator<T1>& g1,\n\n const typename ParamGenerator<T1>::iterator& current1,\n\n const ParamGenerator<T2>& g2,\n\n const typename ParamGenerator<T2>::iterator& current2,\n\n const ParamGenerator<T3>& g3,\n\n const typename ParamGenerator<T3>::iterator& current3,\n\n const ParamGenerator<T4>& g4,\n\n const typename ParamGenerator<T4>::iterator& current4,\n\n const ParamGenerator<T5>& g5,\n\n const typename ParamGenerator<T5>::iterator& current5,\n\n const ParamGenerator<T6>& g6,\n\n const typename ParamGenerator<T6>::iterator& current6,\n\n const ParamGenerator<T7>& g7,\n\n const typename ParamGenerator<T7>::iterator& current7,\n\n const ParamGenerator<T8>& g8,\n\n const typename ParamGenerator<T8>::iterator& current8,\n\n const ParamGenerator<T9>& g9,\n","file_path":"libmarch/tests/gtest/gtest.h","rank":37,"score":194530.23771151976},{"content":"class Solver\n\n : public InstanceCounter<Solver<NDIM>>\n\n , public std::enable_shared_from_this<Solver<NDIM>>\n\n{\n\n\n\npublic:\n\n\n\n using int_type = State::int_type;\n\n using block_type = UnstructuredBlock<NDIM>;\n\n using anchor_chain_type = AnchorChain<NDIM>;\n\n using vector_type = Vector<NDIM>;\n\n using solution_type = Solution<NDIM>;\n\n\n\n static constexpr size_t ndim = solution_type::ndim;\n\n static constexpr size_t neq = solution_type::neq;\n\n static constexpr real_type TINY = 1.e-60;\n\n static constexpr real_type ALMOST_ZERO = 1.e-200;\n\n\n\n static constexpr index_type FCMND = block_type::FCMND;\n\n static constexpr index_type CLMND = block_type::CLMND;\n\n static constexpr index_type CLMFC = block_type::CLMFC;\n\n static constexpr index_type FCNCL = block_type::FCNCL;\n\n static constexpr index_type FCREL = block_type::FCREL;\n\n static constexpr index_type BFREL = block_type::BFREL;\n\n\n","file_path":"libmarch/include/march/gas/Solver_decl.hpp","rank":38,"score":191390.8563949837},{"content":" class ctor_passkey {\n\n ctor_passkey() = default;\n\n friend Quantity<NDIM>;\n\n };\n\n\n\n Quantity(ctor_passkey const &, solver_type const & solver)\n\n : m_solver(solver)\n\n , m_density (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_velocity (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_vorticity (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_vorticity_magnitude (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_ke (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_pressure (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_temperature (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_soundspeed (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_mach (solver.block()->ngstcell(), solver.block()->ncell())\n\n , m_schlieren (solver.block()->ngstcell(), solver.block()->ncell())\n\n {}\n\n\n\n Quantity() = delete;\n","file_path":"libmarch/include/march/gas/Quantity.hpp","rank":39,"score":191390.8563949837},{"content":"class AnchorChain\n\n{\n\n\n\npublic:\n\n\n\n using anchor_type = Anchor<NDIM>;\n\n using anchor_ptr = std::shared_ptr<anchor_type>;\n\n\n\n struct LifeManager { virtual ~LifeManager() {} };\n\n\n\n std::unique_ptr<LifeManager> & life_manager() { return m_life_manager; }\n\n std::unique_ptr<LifeManager> const & life_manager() const { return m_life_manager; }\n\n\n\n void push_back(anchor_ptr const & ptr) { m_anchors.push_back(ptr); }\n\n void append(anchor_ptr const & ptr, std::string const & name) {\n\n m_anchors.push_back(ptr);\n\n m_names.emplace(name, ptr);\n\n }\n\n\n\n#define DECL_MARCH_GAS_ANCHOR_CALL_FORWARD(NAME) \\\n","file_path":"libmarch/include/march/gas/Anchor.hpp","rank":40,"score":191390.8563949837},{"content":"class CommonAnchor\n\n : public std::enable_shared_from_this<CommonAnchor>\n\n{\n\n\n\npublic:\n\n\n\n CommonAnchor() = delete;\n\n CommonAnchor(CommonAnchor const & ) = delete;\n\n CommonAnchor(CommonAnchor &&) = delete;\n\n CommonAnchor & operator=(CommonAnchor const & ) = delete;\n\n CommonAnchor & operator=(CommonAnchor &&) = delete;\n\n\n\n virtual ~CommonAnchor() {}\n\n\n\nprotected:\n\n\n","file_path":"libmarch/include/march/gas/Anchor.hpp","rank":41,"score":191390.8563949837},{"content":"class HandBase {\n\npublic:\n\n HandBase() : m_ptr(nullptr) {}\n\n operator bool() const { return m_ptr; }\n\nprotected:\n\n template<class T> HandBase(T * ptr) : m_ptr((void *)ptr) {}\n\n template<class T> T * ptr() { return reinterpret_cast<T *>(m_ptr); }\n\n template<class T> T * ptr() const { return reinterpret_cast<T *>(m_ptr); }\n\nprivate:\n\n void * m_ptr;\n\n}; /* end class HandBase */\n\n\n\n/**\n\n * Hand is a handle to solution arrays. The copy and move constructors copy\n\n * the pointer inside the other object, but assignment operators deep copy the\n\n * contents of the array.\n\n */\n\ntemplate< class Derived, class Traits >\n","file_path":"libmarch/include/march/gas/Solution.hpp","rank":42,"score":191390.8563949837},{"content":"class TrimInternal {\n\n\n\npublic:\n\n\n\n using solver_type = Solver<NDIM>;\n\n using block_type = typename solver_type::block_type;\n\n using o0hand_type = typename Solution<NDIM>::o0hand_type;\n\n using o1hand_type = typename Solution<NDIM>::o1hand_type;\n\n\n\n constexpr static index_type FCNCL = block_type::FCNCL;\n\n\n\n using fccls_row_const_reference = index_type const (&)[FCNCL];\n\n template< size_t NVALUE > using boundary_value_type = real_type[NVALUE];\n\n\n\n TrimInternal(solver_type & solver, BoundaryData & boundary)\n\n : m_solver(solver)\n\n , m_block(*solver.block())\n\n , m_boundary(boundary)\n\n {}\n\n\n","file_path":"libmarch/include/march/gas/Trim.hpp","rank":43,"score":191390.8563949837},{"content":"class TrimBase {\n\n\n\npublic:\n\n\n\n using pointer = std::unique_ptr<TrimBase<NDIM>>;\n\n\n\n using internal_type = TrimInternal<NDIM>;\n\n using solver_type = typename internal_type::solver_type;\n\n using block_type = typename internal_type::block_type;\n\n\n\n TrimBase(solver_type & solver, BoundaryData & boundary): m_internal(solver, boundary) {}\n\n\n\n TrimBase() = delete;\n\n TrimBase(TrimBase const & other) : m_internal(other.m_internal) {}\n\n TrimBase(TrimBase && other) : m_internal(other.m_internal) {}\n\n TrimBase & operator=(TrimBase const & ) = delete;\n\n TrimBase & operator=(TrimBase &&) = delete;\n\n\n\n virtual ~TrimBase() {}\n\n\n","file_path":"libmarch/include/march/gas/Trim.hpp","rank":44,"score":191390.8563949837},{"content":"class Parameter\n\n{\n\n\n\npublic:\n\n\n\n using int_type = int32_t;\n\n\n\n Parameter() = default;\n\n Parameter(Parameter const & ) = default;\n\n Parameter(Parameter &&) = delete;\n\n Parameter & operator=(Parameter const & ) = default;\n\n Parameter & operator=(Parameter &&) = delete;\n\n\n\n real_type sigma0() const { return m_sigma0; }\n\n real_type & sigma0() { return m_sigma0; }\n\n real_type taumin() const { return m_taumin; }\n\n real_type & taumin() { return m_taumin; }\n\n real_type tauscale() const { return m_tauscale; }\n\n real_type & tauscale() { return m_tauscale; }\n\n\n","file_path":"libmarch/include/march/gas/Solver_decl.hpp","rank":45,"score":191390.8563949837},{"content":" class ctor_passkey {};\n\n\n\npublic:\n\n\n\n Anchor(ctor_passkey const &, solver_type & svr, std::shared_ptr<CommonAnchor> const & common)\n\n : m_solver(svr), m_common(common) {}\n\n\n\n static std::shared_ptr<Anchor<NDIM>> construct(\n\n solver_type & svr\n\n , std::shared_ptr<CommonAnchor> const & common = std::shared_ptr<CommonAnchor>()\n\n ) {\n\n return std::make_shared<Anchor<NDIM>>(ctor_passkey(), svr, common);\n\n }\n\n\n\n virtual ~Anchor() = default;\n\n\n\n solver_type const & solver() const { return m_solver; }\n\n solver_type & solver() { return m_solver; }\n\n\n\n#define DECL_MARCH_GAS_ANCHOR_METHOD(NAME) \\\n","file_path":"libmarch/include/march/gas/Anchor.hpp","rank":46,"score":191390.8563949837},{"content":" class TestName : public CaseName<gtest_TypeParam_> { \\\n\n private: \\\n\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\n\n typedef gtest_TypeParam_ TypeParam; \\\n\n virtual void TestBody(); \\\n\n }; \\\n\n static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \\\n\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\\\n\n __FILE__, __LINE__, #CaseName, #TestName); \\\n\n } \\\n\n template <typename gtest_TypeParam_> \\\n\n void GTEST_CASE_NAMESPACE_(CaseName)::TestName<gtest_TypeParam_>::TestBody()\n\n\n\n# define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \\\n\n namespace GTEST_CASE_NAMESPACE_(CaseName) { \\\n\n typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \\\n\n } \\\n\n static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \\\n\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\\\n\n __FILE__, __LINE__, #__VA_ARGS__)\n","file_path":"libmarch/tests/gtest/gtest.h","rank":47,"score":191246.4017458324},{"content":"// This class generates an XML output file.\n\nclass XmlUnitTestResultPrinter : public EmptyTestEventListener {\n\n public:\n\n explicit XmlUnitTestResultPrinter(const char* output_file);\n\n\n\n virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration);\n\n\n\n private:\n\n // Is c a whitespace character that is normalized to a space character\n\n // when it appears in an XML attribute value?\n\n static bool IsNormalizableWhitespace(char c) {\n\n return c == 0x9 || c == 0xA || c == 0xD;\n\n }\n\n\n\n // May c appear in a well-formed XML document?\n\n static bool IsValidXmlCharacter(char c) {\n\n return IsNormalizableWhitespace(c) || c >= 0x20;\n\n }\n\n\n\n // Returns an XML-escaped copy of the input string str. If\n\n // is_attribute is true, the text is meant to appear as an attribute\n","file_path":"libmarch/tests/gtest/gtest-all.cc","rank":48,"score":189339.9243148903},{"content":" class FormatForComparison<CharType*, OtherStringType> { \\\n\n public: \\\n\n static ::std::string Format(CharType* value) { \\\n\n return ::testing::PrintToString(value); \\\n\n } \\\n\n }\n\n\n\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(char, ::std::string);\n\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(const char, ::std::string);\n\n\n\n#if GTEST_HAS_GLOBAL_STRING\n\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(char, ::string);\n\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(const char, ::string);\n\n#endif\n\n\n\n#if GTEST_HAS_GLOBAL_WSTRING\n\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(wchar_t, ::wstring);\n\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(const wchar_t, ::wstring);\n\n#endif\n\n\n","file_path":"libmarch/tests/gtest/gtest.h","rank":49,"score":187827.21713612135},{"content":" class ctor_passkey {\n\n ctor_passkey() = default;\n\n friend Solver<NDIM>;\n\n };\n\n\n\n Solver(const ctor_passkey &, const std::shared_ptr<block_type> & block);\n\n\n\n Solver() = delete;\n\n Solver(Solver const & ) = delete;\n\n Solver(Solver &&) = delete;\n\n Solver & operator=(Solver const & ) = delete;\n\n Solver & operator=(Solver &&) = delete;\n\n\n\n static std::shared_ptr<Solver<NDIM>> construct(const std::shared_ptr<block_type> & block) {\n\n return std::make_shared<Solver<NDIM>>(ctor_passkey(), block);\n\n }\n\n\n\n std::shared_ptr<block_type> const & block() const { return m_block; }\n\n std::vector<std::unique_ptr<TrimBase<NDIM>>> const & trims() const { return m_trims; }\n\n std::vector<std::unique_ptr<TrimBase<NDIM>>> & trims() { return m_trims; }\n","file_path":"libmarch/include/march/gas/Solver_decl.hpp","rank":50,"score":187606.49383784318},{"content":"class BoundaryData {\n\n\n\npublic:\n\n\n\n static constexpr index_type BFREL = 3;\n\n\n\nprivate:\n\n\n\n /**\n\n * First column is the face index in block. The second column is the face\n\n * index in bndfcs. The third column is the face index of the related\n\n * block (if exists).\n\n */\n\n LookupTable<index_type, BFREL> m_facn;\n\n\n\n /**\n\n * Values attached (specified) for each boundary face. Each row is a\n\n * boundary face, and each column is a value.\n\n */\n\n LookupTableCore m_values;\n","file_path":"libmarch/include/march/mesh/BoundaryData.hpp","rank":51,"score":187606.49383784318},{"content":"// Streams test results to the given port on the given host machine.\n\nclass GTEST_API_ StreamingListener : public EmptyTestEventListener {\n\n public:\n","file_path":"libmarch/tests/gtest/gtest-all.cc","rank":52,"score":185248.78596570904},{"content":"class BlockHandBase {\n\n\n\npublic:\n\n\n\n using block_type = UnstructuredBlock<NDIM>;\n\n using vector_type = Vector<NDIM>;\n\n\n\n BlockHandBase(block_type const & block, index_type index)\n\n : m_block(&const_cast<block_type &>(block))\n\n , m_index(index)\n\n {}\n\n\n\n block_type & block() { return *m_block; }\n\n block_type const & block() const { return *m_block; }\n\n\n\n index_type index() const { return m_index; }\n\n void set_index(index_type index) { m_index = index; }\n\n\n\n bool operator==(HandType const & other) { return (m_block == other.m_block) && (m_index == other.m_index); }\n\n bool operator!=(HandType const & other) { return (m_block != other.m_block) || (m_index == other.m_index); }\n","file_path":"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp","rank":53,"score":180581.35991629318},{"content":" class FormatForComparison<CharType*, OtherOperand> { \\\n\n public: \\\n\n static ::std::string Format(CharType* value) { \\\n\n return ::testing::PrintToString(static_cast<const void*>(value)); \\\n\n } \\\n\n }\n\n\n\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(char);\n\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(const char);\n\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(wchar_t);\n\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(const wchar_t);\n\n\n\n#undef GTEST_IMPL_FORMAT_C_STRING_AS_POINTER_\n\n\n\n// If a C string is compared with an STL string object, we know it's meant\n\n// to point to a NUL-terminated string, and thus can print it as a string.\n\n\n\n#define GTEST_IMPL_FORMAT_C_STRING_AS_STRING_(CharType, OtherStringType) \\\n\n template <> \\\n","file_path":"libmarch/tests/gtest/gtest.h","rank":54,"score":177967.2902887777},{"content":"class UniversalTersePrinter<char*> {\n\n public:\n\n static void Print(char* str, ::std::ostream* os) {\n\n UniversalTersePrinter<const char*>::Print(str, os);\n\n }\n\n};\n\n\n\n#if GTEST_HAS_STD_WSTRING\n\ntemplate <>\n","file_path":"libmarch/tests/gtest/gtest.h","rank":55,"score":171013.96285844286},{"content":"#pragma once\n\n\n\n/*\n\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n#include <pybind11/pybind11.h>\n\n\n\n#include \"march/python/WrapBase.hpp\"\n\n#include \"march/python/wrapper_core.hpp\"\n\n#include \"march/python/wrapper_mesh.hpp\"\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/include/march/python/wrapper_march.hpp","rank":56,"score":167447.89759325483},{"content":"/*\n\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n#include <pybind11/pybind11.h>\n\n#define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION\n\n#include <numpy/arrayobject.h>\n\n\n\n#include <utility>\n\n#include <memory>\n\n#include <vector>\n\n#include <algorithm>\n\n#include <cstring>\n\n\n\n#include \"march.hpp\"\n\n#include \"march/python/wrapper_march.hpp\"\n\n\n\nnamespace march {\n\n\n","file_path":"libmarch/src/python/march.cpp","rank":57,"score":163821.0366078412},{"content":"namespace python {\n\n\n\nPyObject * ModuleInitializer::initialize_march(pybind11::module & mod) {\n\n#if defined(Py_DEBUG)\n\n ::march::setup_debug();\n\n#endif // Py_DEBUG\n\n\n\n import_array1(nullptr); // or numpy c api segfault.\n\n\n\n mod.doc() = \"libmarch wrapper\";\n\n\n\n // section: core\n\n WrapBuffer::commit(mod, \"Buffer\", \"Internal data buffer\");\n\n WrapLookupTableCore::commit(mod, \"Table\", \"Lookup table that allows ghost entity.\");\n\n WrapVector<2>::commit(mod, \"Vector2D\", \"Cartesian vector (2D).\");\n\n WrapVector<3>::commit(mod, \"Vector3D\", \"Cartesian vector (3D).\");\n\n\n\n // section: mesh\n\n WrapBoundaryData::commit(mod, \"BoundaryData\", \"Data of a boundary condition.\");\n\n WrapUnstructuredBlock<2>::commit(mod, \"UnstructuredBlock2D\", \"Unstructured mesh block (2D).\");\n","file_path":"libmarch/src/python/march.cpp","rank":58,"score":163817.76959659482},{"content":" WrapUnstructuredBlock<3>::commit(mod, \"UnstructuredBlock3D\", \"Unstructured mesh block (3D).\");\n\n WrapNodeHand<2>::commit(mod, \"NodeHand2D\", \"Hand to a node (2D).\");\n\n WrapNodeHand<3>::commit(mod, \"NodeHand3D\", \"Hand to a node (3D).\");\n\n WrapFaceHand<2>::commit(mod, \"FaceHand2D\", \"Hand to a face (2D).\");\n\n WrapFaceHand<3>::commit(mod, \"FaceHand3D\", \"Hand to a face (3D).\");\n\n WrapCellHand<2>::commit(mod, \"CellHand2D\", \"Hand to a cell (2D).\");\n\n WrapCellHand<3>::commit(mod, \"CellHand3D\", \"Hand to a cell (3D).\");\n\n WrapBasicCE<2>::commit(mod, \"BasicCE2D\", \"Basic conservation element (2D).\");\n\n WrapBasicCE<3>::commit(mod, \"BasicCE3D\", \"Basic conservation element (3D).\");\n\n WrapConservationElement<2>::commit(mod, \"ConservationElement2D\", \"Conservation element (2D).\");\n\n WrapConservationElement<3>::commit(mod, \"ConservationElement3D\", \"Conservation element (3D).\");\n\n\n\n return mod.ptr();\n\n}\n\n\n\n} /* end namespace python */\n\n\n\n} /* end namespace march */\n\n\n\nPYBIND11_MODULE(libmarch, mod) {\n\n ::march::python::ModuleInitializer::get_instance().initialize(mod);\n\n}\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/src/python/march.cpp","rank":59,"score":163794.78222399004},{"content":"class TestWithParam : public Test, public WithParamInterface<T> {\n\n};\n\n\n\n#endif // GTEST_HAS_PARAM_TEST\n\n\n\n// Macros for indicating success/failure in test code.\n\n\n\n// ADD_FAILURE unconditionally adds a failure to the current test.\n\n// SUCCEED generates a success - it doesn't automatically make the\n\n// current test successful, as a test is only successful when it has\n\n// no failure.\n\n//\n\n// EXPECT_* verifies that a certain condition is satisfied. If not,\n\n// it behaves like ADD_FAILURE. In particular:\n\n//\n\n// EXPECT_TRUE verifies that a Boolean condition is true.\n\n// EXPECT_FALSE verifies that a Boolean condition is false.\n\n//\n\n// FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except\n\n// that they will also abort the current function on failure. People\n","file_path":"libmarch/tests/gtest/gtest.h","rank":60,"score":162026.0995064851},{"content":"// The Mutex class can only be used for mutexes created at runtime. It\n\n// shares its API with MutexBase otherwise.\n\nclass Mutex : public MutexBase {\n\n public:\n\n Mutex() {\n\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL));\n\n has_owner_ = false;\n\n }\n\n ~Mutex() {\n\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_));\n\n }\n\n\n\n private:\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex);\n\n};\n\n\n","file_path":"libmarch/tests/gtest/gtest.h","rank":61,"score":161847.83467165002},{"content":" class RunnableImpl : public Runnable {\n\n public:\n\n RunnableImpl(UserThreadFunc* func, T param)\n\n : func_(func),\n\n param_(param) {\n\n }\n\n virtual ~RunnableImpl() {}\n\n virtual void Run() {\n\n func_(param_);\n\n }\n\n\n\n private:\n\n UserThreadFunc* const func_;\n\n const T param_;\n\n\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(RunnableImpl);\n\n };\n\n\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadWithParam);\n\n};\n","file_path":"libmarch/tests/gtest/gtest.h","rank":62,"score":161842.6626818435},{"content":"struct CellType {\n\n\n\n static constexpr size_t NVALUE = 5;\n\n\n\n CellType(\n\n index_type const id_in\n\n , index_type const dim_in\n\n , index_type const nnode_in\n\n , index_type const nedge_in\n\n , index_type const nsurface_in\n\n ) : m_data{id_in, dim_in, nnode_in, nedge_in, nsurface_in} {}\n\n\n\n CellType() = default;\n\n\n\n index_type id () const { return m_data[0]; }\n\n index_type ndim () const { return m_data[1]; }\n\n index_type nnode () const { return m_data[2]; }\n\n index_type nedge () const { return m_data[3]; }\n\n index_type nsurface() const { return m_data[4]; }\n\n\n","file_path":"libmarch/include/march/mesh/CellType.hpp","rank":63,"score":160238.13734868704},{"content":"class UniversalTersePrinter<const wchar_t*> {\n\n public:\n\n static void Print(const wchar_t* str, ::std::ostream* os) {\n\n if (str == NULL) {\n\n *os << \"NULL\";\n\n } else {\n\n UniversalPrint(::std::wstring(str), os);\n\n }\n\n }\n\n};\n\n#endif\n\n\n\ntemplate <>\n","file_path":"libmarch/tests/gtest/gtest.h","rank":64,"score":159456.32983645902},{"content":"/*\n\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n#include <pybind11/pybind11.h>\n\n\n\n#include \"march.hpp\"\n\n#include \"march/gas.hpp\"\n\n#include \"march/python/wrapper_gas.hpp\"\n\n\n\nnamespace march {\n\n\n\nnamespace python {\n\n\n\nPyObject * ModuleInitializer::initialize_march_gas(pybind11::module & marchmod) {\n\n auto gasmod = marchmod.def_submodule(\"gas\", \"Gas dynamic solver\");\n\n\n\n // section: solver and associated data\n\n WrapGasSolver<2>::commit(gasmod, \"Solver2D\", \"Gas-dynamics solver (2D).\");\n","file_path":"libmarch/src/python/march_gas.cpp","rank":65,"score":159352.30676443953},{"content":" WrapGasTrimNonRefl<2>::commit(gasmod, \"TrimNonRefl2D\", \"Gas-dynamics non-reflective trim (2D).\");\n\n WrapGasTrimNonRefl<3>::commit(gasmod, \"TrimNonRefl3D\", \"Gas-dynamics non-reflective trim (3D).\");\n\n WrapGasTrimSlipWall<2>::commit(gasmod, \"TrimSlipWall2D\", \"Gas-dynamics slip wall trim (2D).\");\n\n WrapGasTrimSlipWall<3>::commit(gasmod, \"TrimSlipWall3D\", \"Gas-dynamics slip wall trim (3D).\");\n\n WrapGasTrimInlet<2>::commit(gasmod, \"TrimInlet2D\", \"Gas-dynamics inlet trim (2D).\");\n\n WrapGasTrimInlet<3>::commit(gasmod, \"TrimInlet3D\", \"Gas-dynamics inlet trim (3D).\");\n\n\n\n return gasmod.ptr();\n\n}\n\n\n\n} /* end namespace python */\n\n\n\n} /* end namespace march */\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/src/python/march_gas.cpp","rank":66,"score":159331.1763804525},{"content":" WrapGasSolver<3>::commit(gasmod, \"Solver3D\", \"Gas-dynamics solver (3D).\");\n\n WrapGasCommonAnchor::commit(gasmod, \"CommonAnchor\", \"Gas-dynamics multi-dimensional anchor.\");\n\n WrapGasAnchor<2>::commit(gasmod, \"Anchor2D\", \"Gas-dynamics anchor (2D).\");\n\n WrapGasAnchor<3>::commit(gasmod, \"Anchor3D\", \"Gas-dynamics anchor (3D).\");\n\n WrapGasAnchorChain<2>::commit(gasmod, \"AnchorChain2D\", \"Gas-dynamics sequential container for anchors (2D).\");\n\n WrapGasAnchorChain<3>::commit(gasmod, \"AnchorChain3D\", \"Gas-dynamics sequential container for anchors (3D).\");\n\n WrapGasParameter::commit(gasmod, \"Parameter\", \"Gas-dynamics solver parameters.\");\n\n WrapGasState::commit(gasmod, \"State\", \"Gas-dynamics solver states.\");\n\n WrapGasSolution<2>::commit(gasmod, \"Solution2D\", \"Gas-dynamics solution data (2D).\");\n\n WrapGasSolution<3>::commit(gasmod, \"Solution3D\", \"Gas-dynamics solution data (3D).\");\n\n WrapGasQuantity<2>::commit(gasmod, \"Quantity2D\", \"Gas-dynamics quantities (2D).\");\n\n WrapGasQuantity<3>::commit(gasmod, \"Quantity3D\", \"Gas-dynamics quantities (3D).\");\n\n\n\n // section: boundary-condition treatments\n\n WrapGasTrimBase<gas::TrimBase<2>, 2>::commit(gasmod, \"TrimBase2D\", \"Gas-dynamics trim base type (2D).\");\n\n WrapGasTrimBase<gas::TrimBase<3>, 3>::commit(gasmod, \"TrimBase3D\", \"Gas-dynamics trim base type (3D).\");\n\n WrapGasTrimInterface<2>::commit(gasmod, \"TrimInterface2D\", \"Gas-dynamics interface trim (2D).\");\n\n WrapGasTrimInterface<3>::commit(gasmod, \"TrimInterface3D\", \"Gas-dynamics interface trim (3D).\");\n\n WrapGasTrimNoOp<2>::commit(gasmod, \"TrimNoOp2D\", \"Gas-dynamics no-op trim (2D).\");\n\n WrapGasTrimNoOp<3>::commit(gasmod, \"TrimNoOp3D\", \"Gas-dynamics no-op trim (3D).\");\n","file_path":"libmarch/src/python/march_gas.cpp","rank":67,"score":159322.67505550434},{"content":"#pragma once\n\n\n\n/*\n\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see LICENSE.txt\n\n */\n\n\n\n#include <stdexcept>\n\n#include <memory>\n\n\n\nnamespace march\n\n{\n\n\n\n/**\n\n * Untyped and unresizeable memory buffer for data storage.\n\n */\n","file_path":"libmarch/include/march/core/Buffer.hpp","rank":68,"score":159162.63136559582},{"content":"#pragma once\n\n\n\n/*\n\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n/**\n\n * \\file\n\n * Utilities.\n\n */\n\n\n\n#include <utility>\n\n#include <memory>\n\n\n\n#include <cstdio>\n\n#include <sstream>\n\n#include <iostream>\n\n#include <iomanip>\n\n\n","file_path":"libmarch/include/march/core/utility.hpp","rank":69,"score":159158.41472418632},{"content":"#pragma once\n\n\n\n/*\n\n * Copyright (c) 2018, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n/**\n\n * \\file\n\n * Memory facilities.\n\n */\n\n\n\nnamespace march {\n\n\n\n/**\n\n * Mixin to help track the active instance count.\n\n */\n\ntemplate< class T >\n","file_path":"libmarch/include/march/core/memory.hpp","rank":70,"score":159156.02285743385},{"content":"\n\nnamespace detail {\n\n\n\ninline static constexpr size_t log2(size_t n, int k = 0) { return (n <= 1) ? k : log2(n >> 1, k + 1); }\n\n\n\n} /* end namespace detail */\n\n\n\ntemplate<typename ElementType>\n\nvoid fill_sentinel(ElementType *arr, size_t nelem, ElementType sentinel) {\n\n std::fill(arr, arr + nelem, sentinel);\n\n}\n\n\n\ntemplate<typename ElementType>\n\nvoid fill_sentinel(ElementType *arr, size_t nelem) {\n\n if (true == std::is_floating_point<ElementType>::value) {\n\n fill_sentinel(arr, nelem, std::numeric_limits<ElementType>::quiet_NaN());\n\n } else if (true == std::is_arithmetic<ElementType>::value) {\n\n char * carr = reinterpret_cast<char *>(arr);\n\n fill_sentinel(carr, nelem*sizeof(ElementType), static_cast<char>(-1));\n\n } else {\n\n throw std::runtime_error(\"cannot fill sentinel for unsupported type\");\n\n }\n\n}\n\n\n\n} /* end namespace march */\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/include/march/core/utility.hpp","rank":71,"score":159154.70384380504},{"content":"#pragma once\n\n\n\n/*\n\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n#include <array>\n\n#include <string>\n\n\n\n#include \"march/core/types.hpp\"\n\n#include \"march/core/utility.hpp\"\n\n#include \"march/core/string.hpp\"\n\n\n\nnamespace march {\n\n\n\n#pragma GCC diagnostic push\n\n#ifndef __clang__\n\n#pragma GCC diagnostic ignored \"-Wmaybe-uninitialized\"\n\n#endif // __clang__\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":72,"score":159152.18332767588},{"content":"#if !defined(_MSC_VER) && !defined(__INTEL_COMPILER)\n\n# if __cplusplus >= 201402L\n\n# define MH_CPP14\n\n# endif\n\n#elif defined(_MSC_VER)\n\n# if _MSVC_LANG >= 201402L\n\n# define MH_CPP14\n\n# endif\n\n#endif\n\n\n\nnamespace march {\n\n\n\n#ifdef MH_CPP14\n\nusing std::make_unique;\n\n#else // MH_CPP14\n\ntemplate<typename T, typename... Args>\n\nstd::unique_ptr<T> make_unique(Args&&... args) {\n\n return std::unique_ptr<T>(new T(std::forward<Args>(args)...));\n\n}\n\n#endif // MH_CPP14\n","file_path":"libmarch/include/march/core/utility.hpp","rank":73,"score":159150.12373941034},{"content":" Buffer(size_t length, const ctor_passkey &) : m_length(length) { m_data = new char[length](); }\n\n\n\n static std::shared_ptr<Buffer> construct(size_t length) {\n\n return std::make_shared<Buffer>(length, ctor_passkey());\n\n }\n\n\n\n ~Buffer() {\n\n if (nullptr != m_data) {\n\n delete[] m_data;\n\n m_data = nullptr;\n\n }\n\n }\n\n\n\n Buffer() = delete;\n\n\n\n Buffer(Buffer const & ) = delete;\n\n\n\n Buffer(Buffer &&) = delete;\n\n\n\n Buffer & operator=(Buffer const & ) = delete;\n","file_path":"libmarch/include/march/core/Buffer.hpp","rank":74,"score":159149.42237675545},{"content":"\n\n Buffer & operator=(Buffer &&) = delete;\n\n\n\n explicit operator bool() const { return nullptr == m_data; }\n\n\n\n size_t nbyte() const { return m_length; }\n\n\n\n template< typename T >\n\n size_t length() const {\n\n size_t result = m_length / sizeof(T);\n\n if (result * sizeof(T) != m_length) {\n\n throw std::length_error(\"length not divisible\");\n\n }\n\n return result;\n\n }\n\n\n\n template< typename T, size_t LENGTH >\n\n T (& array() const) [LENGTH] {\n\n if (LENGTH * sizeof(T) != m_length) {\n\n throw std::length_error(\"array byte count mismatches buffer\");\n","file_path":"libmarch/include/march/core/Buffer.hpp","rank":75,"score":159147.40391029505},{"content":" }\n\n return *reinterpret_cast<T(*)[LENGTH]>(data<T>());\n\n }\n\n\n\n /** Backdoor */\n\n template< typename T >\n\n T * data() const { return reinterpret_cast<T*>(m_data); }\n\n\n\n}; /* end class Buffer */\n\n\n\n} /* end namespace march */\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/include/march/core/Buffer.hpp","rank":76,"score":159146.3538672961},{"content":"\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator/(Vector<NDIM> lhs, real_type rhs) { lhs /= rhs; return lhs; }\n\n\n\ninline real_type cross(Vector<2> const & lhs, Vector<2> const & rhs) {\n\n return lhs[0]*rhs[1] - lhs[1]*rhs[0];\n\n}\n\n\n\ninline Vector<3> cross(Vector<3> const & lhs, Vector<3> const & rhs) {\n\n return Vector<3>(lhs[1]*rhs[2] - lhs[2]*rhs[1], lhs[2]*rhs[0] - lhs[0]*rhs[2], lhs[0]*rhs[1] - lhs[1]*rhs[0]);\n\n}\n\n\n\n#pragma GCC diagnostic pop\n\n\n\n} /* end namespace march */\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":77,"score":159143.64574366156},{"content":" }\n\n Vector(real_type v0, real_type v1, real_type v2) : data{v0, v1, v2} {\n\n static_assert(3 == NDIM, \"only valid for 3 dimensional\");\n\n }\n\n Vector(const Vector & other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] = other.data[it]; }\n\n }\n\n Vector(const real_type (&other)[NDIM]) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] = other[it]; }\n\n }\n\n Vector(const real_type * other) { // I don't like this danger.\n\n for (size_t it=0; it<NDIM; ++it) { data[it] = other[it]; }\n\n }\n\n\n\n /* assignment operators */\n\n Vector & operator=(Vector const & other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] = other.data[it]; }\n\n return *this;\n\n }\n\n Vector & operator=(real_type const (&other)[NDIM]) {\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":78,"score":159135.7699067491},{"content":" }\n\n Vector & operator+=(real_type other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] += other; }\n\n return *this;\n\n }\n\n Vector & operator-=(Vector const & other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] -= other.data[it]; }\n\n return *this;\n\n }\n\n Vector & operator-=(real_type other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] -= other; }\n\n return *this;\n\n }\n\n Vector & operator*=(real_type other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] *= other; }\n\n return *this;\n\n }\n\n Vector & operator/=(real_type other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] /= other; }\n\n return *this;\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":79,"score":159135.68443256494},{"content":"\n\n/**\n\n * Cartesian vector in two or three dimensional space.\n\n */\n\ntemplate< size_t NDIM > struct Vector {\n\n\n\n static_assert(2 == NDIM || 3 == NDIM, \"not 2 or 3 dimensional\");\n\n\n\n typedef real_type value_type;\n\n typedef value_type & reference;\n\n typedef const value_type & const_reference;\n\n typedef size_t size_type;\n\n\n\n value_type data[NDIM];\n\n\n\n /* constructors */\n\n Vector() = default;\n\n Vector(real_type v) { for (size_t it=0; it<NDIM; ++it) { data[it] = v; } }\n\n Vector(real_type v0, real_type v1) : data{v0, v1} {\n\n static_assert(2 == NDIM, \"only valid for 2 dimensional\");\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":80,"score":159135.4749128757},{"content":" }\n\n return ret;\n\n}\n\n\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator+(Vector<NDIM> lhs, Vector<NDIM> const & rhs) { lhs += rhs; return lhs; }\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator+(Vector<NDIM> lhs, real_type rhs) { lhs += rhs; return lhs; }\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator+(real_type lhs, Vector<NDIM> rhs) { rhs += lhs; return rhs; }\n\n\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator-(Vector<NDIM> lhs, Vector<NDIM> const & rhs) { lhs -= rhs; return lhs; }\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator-(Vector<NDIM> lhs, real_type rhs) { lhs -= rhs; return lhs; }\n\n\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator*(Vector<NDIM> lhs, real_type rhs) { lhs *= rhs; return lhs; }\n\ntemplate< size_t NDIM >\n\nVector<NDIM> operator*(real_type lhs, Vector<NDIM> rhs) { rhs *= lhs; return rhs; }\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":81,"score":159134.9192346858},{"content":" return true;\n\n }\n\n\n\n /* accessors */\n\n constexpr size_type size() const { return NDIM; }\n\n reference operator[](size_type n) { return data[n]; }\n\n constexpr const_reference operator[](size_type n) const { return data[n]; }\n\n reference at(size_type n) {\n\n if (n < NDIM) { return data[n]; }\n\n else { throw std::out_of_range(string::format(\"Vector%ldD doesn't have %d-th element\", NDIM, n)); }\n\n }\n\n const_reference at(size_type n) const {\n\n if (n < NDIM) { return data[n]; }\n\n else { throw std::out_of_range(string::format(\"Vector%ldD doesn't have %d-th element\", NDIM, n)); }\n\n }\n\n\n\n /* arithmetic operators */\n\n Vector & operator+=(Vector const & other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] += other.data[it]; }\n\n return *this;\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":82,"score":159134.58035694083},{"content":" for (size_t it=0; it<NDIM; ++it) { data[it] = other[it]; }\n\n return *this;\n\n }\n\n Vector & operator=(real_type other) {\n\n for (size_t it=0; it<NDIM; ++it) { data[it] = other; }\n\n return *this;\n\n }\n\n\n\n bool operator==(Vector const & other) {\n\n for (size_t it=0; it<NDIM; ++it) { if (data[it] != other.data[it]) { return false; } }\n\n return true;\n\n }\n\n\n\n bool operator!=(Vector const & other) {\n\n for (size_t it=0; it<NDIM; ++it) { if (data[it] != other.data[it]) { return true; } }\n\n return false;\n\n }\n\n\n\n bool is_close_to(Vector const & other, real_type epsilon) {\n\n for (size_t it=0; it<NDIM; ++it) { if (std::abs(data[it] - other.data[it]) > epsilon) { return false; } }\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":83,"score":159133.93817301097},{"content":" }\n\n real_type dot(Vector const & rhs) const {\n\n if (3 == NDIM) { return this->data[0]*rhs.data[0] + this->data[1]*rhs.data[1] + this->data[2]*rhs.data[2]; }\n\n else { return this->data[0]*rhs.data[0] + this->data[1]*rhs.data[1]; }\n\n }\n\n real_type square() const {\n\n if (3 == NDIM) { return data[0]*data[0] + data[1]*data[1] + data[2]*data[2]; }\n\n else { return data[0]*data[0] + data[1]*data[1]; }\n\n }\n\n real_type length() const { return sqrt(square()); }\n\n\n\n std::string repr(size_t indent=0, size_t precision=0) const;\n\n\n\n}; /* end struct Vector */\n\n\n\ntemplate< size_t NDIM > std::string Vector<NDIM>::repr(size_t, size_t precision) const {\n\n std::string ret(NDIM == 3 ? \"Vector3D(\" : \"Vector2D(\");\n\n for (size_t it=0; it<NDIM; ++it) {\n\n ret += string::from_double(data[it], precision);\n\n ret += NDIM-1 == it ? \")\" : \",\";\n","file_path":"libmarch/include/march/core/Vector.hpp","rank":84,"score":159132.7513062051},{"content":"#pragma once\n\n\n\n/*\n\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n#include <pybind11/pybind11.h>\n\n\n\nPYBIND11_DECLARE_HOLDER_TYPE(T, std::unique_ptr<T>);\n\nPYBIND11_DECLARE_HOLDER_TYPE(T, std::shared_ptr<T>);\n\n\n\n#ifdef __GNUG__\n\n# define MARCH_PYTHON_WRAPPER_VISIBILITY __attribute__((visibility(\"hidden\")))\n\n#else\n\n# define MARCH_PYTHON_WRAPPER_VISIBILITY\n\n#endif\n\n\n\nnamespace march {\n\n\n","file_path":"libmarch/include/march/python/common.hpp","rank":85,"score":159055.17309650008},{"content":"namespace python {\n\n\n\nnamespace py = pybind11;\n\n\n\n} /* end namespace python */\n\n\n\n} /* end namespace march */\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/include/march/python/common.hpp","rank":86,"score":159050.20559797416},{"content":"#pragma once\n\n\n\n/*\n\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\n\n * BSD 3-Clause License, see COPYING\n\n */\n\n\n\n/**\n\n * \\file\n\n * Basic typedefs and constants for libmarch.\n\n */\n\n\n\n#include <cstdint>\n\n#include <complex>\n\n#include <limits>\n\n\n\n#include \"march/core/utility.hpp\"\n\n\n\nnamespace march\n\n{\n\n\n\n/**\n\n * The enum is compatible to numpy NPY_TYPES.\n\n *\n\n * MH_LONG, MH_ULONG, MH_LONGDOUBLE, MH_CLONGDOUBLE aren't used.\n\n */\n","file_path":"libmarch/include/march/core/types.hpp","rank":87,"score":159002.43461430227},{"content":"template <> struct id_to<MH_FLOAT> { typedef float type; };\n\ntemplate <> struct id_to<MH_DOUBLE> { typedef double type; };\n\ntemplate <> struct id_to<MH_CFLOAT> { typedef std::complex<float> type; };\n\ntemplate <> struct id_to<MH_CDOUBLE> { typedef std::complex<double> type; };\n\n\n\n/**\n\n * The primitive data type for lookup-table indices.\n\n */\n\ntypedef int32_t index_type;\n\nstatic constexpr index_type MH_INDEX_SENTINEL = INT32_MAX;\n\nstatic constexpr index_type INVALID_INDEX = MH_INDEX_SENTINEL;\n\n\n\n/**\n\n * The primitive data type for element shape type. May use only a single byte\n\n * but now take 4 bytes for legacy compatibility.\n\n */\n\ntypedef int32_t shape_type;\n\n\n\ntypedef double real_type;\n\n\n\nconstexpr static real_type MH_REAL_SENTINEL = -std::numeric_limits<real_type>::infinity();\n\n\n\n} /* end namespace march */\n\n\n\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\n","file_path":"libmarch/include/march/core/types.hpp","rank":88,"score":158989.81174682803},{"content":" return ret;\n\n}\n\n\n\n/**\n\n * Convert type to ID.\n\n */\n\ntemplate <typename type, typename SFINAE = void> struct type_to { };\n\n\n\ntemplate <typename T> struct type_to<T, typename std::enable_if<std::is_integral<T>::value>::type> {\n\nprivate:\n\n constexpr static DataTypeId ids[8] = {\n\n MH_INT8, MH_UINT8, MH_INT16, MH_UINT16,\n\n MH_INT32, MH_UINT32, MH_INT64, MH_UINT64\n\n };\n\npublic:\n\n constexpr static DataTypeId id = ids[detail::log2(sizeof(T)) * 2 + (std::is_unsigned<T>::value ? 1 : 0)];\n\n};\n\n\n\n#define MARCH_DECL_TYPEID(Type, ID) \\\n\n template <> struct type_to<Type> { constexpr static DataTypeId id = ID; };\n","file_path":"libmarch/include/march/core/types.hpp","rank":89,"score":158985.15979943852},{"content":"MARCH_DECL_TYPEID(bool, MH_BOOL)\n\nMARCH_DECL_TYPEID(float, MH_FLOAT)\n\nMARCH_DECL_TYPEID(double, MH_DOUBLE)\n\nMARCH_DECL_TYPEID(std::complex<float>, MH_CFLOAT)\n\nMARCH_DECL_TYPEID(std::complex<double>, MH_CDOUBLE)\n\n#undef MARCH_DECL_TYPEID\n\n\n\n/**\n\n * Convert ID to type.\n\n */\n\ntemplate <int ID> struct id_to { };\n\ntemplate <> struct id_to<MH_BOOL> { typedef bool type; };\n\ntemplate <> struct id_to<MH_INT8> { typedef int8_t type; };\n\ntemplate <> struct id_to<MH_UINT8> { typedef uint8_t type; };\n\ntemplate <> struct id_to<MH_INT16> { typedef int16_t type; };\n\ntemplate <> struct id_to<MH_UINT16> { typedef uint16_t type; };\n\ntemplate <> struct id_to<MH_INT32> { typedef int32_t type; };\n\ntemplate <> struct id_to<MH_UINT32> { typedef uint32_t type; };\n\ntemplate <> struct id_to<MH_INT64> { typedef int64_t type; };\n\ntemplate <> struct id_to<MH_UINT64> { typedef uint64_t type; };\n","file_path":"libmarch/include/march/core/types.hpp","rank":90,"score":158982.1406521851},{"content":"class\n\nMARCH_PYTHON_WRAPPER_VISIBILITY\n\nWrapBoundaryData\n\n : public WrapBase< WrapBoundaryData, BoundaryData >\n\n{\n\n\n\n friend base_type;\n\n\n\n WrapBoundaryData(pybind11::module & mod, const char * pyname, const char * clsdoc)\n\n : base_type(mod, pyname, clsdoc)\n\n {\n\n namespace py = pybind11;\n\n (*this)\n\n .def(\n\n py::init([] (index_type nvalue, const std::string & name) {\n\n return make_unique<BoundaryData>(nvalue, name);\n\n }),\n\n py::arg(\"nvalue\"), py::arg(\"name\")=\"None\"\n\n )\n\n .def_property_readonly_static(\"BFREL\", [](py::object const & /* self */) { return BoundaryData::BFREL; })\n","file_path":"libmarch/include/march/python/wrapper_mesh.hpp","rank":97,"score":55.72222230413941},{"content":"\n\n WrapGasQuantity(pybind11::module & mod, const char * pyname, const char * clsdoc)\n\n : base_type(mod, pyname, clsdoc)\n\n {\n\n namespace py = pybind11;\n\n\n\n#define DECL_MARCH_PYBIND_GAS_QUANTITY_REAL(NAME) \\\n\n .def_property( \\\n\n #NAME, \\\n\n [](wrapped_type const & self ) { return self.NAME(); }, \\\n\n [](wrapped_type & self, real_type val) { return self.NAME() = val; } \\\n\n )\n\n// FIXME: change the properties to be like those of Solution\n\n#define DECL_MARCH_PYBIND_GAS_QUANTITY_ARRAY(NAME, ARR) \\\n\n .def_property( \\\n\n #NAME, \\\n\n [](wrapped_type & qty) { return Table(qty.NAME()).ARR(); }, \\\n\n [](wrapped_type & qty, py::array src) { Table::CopyInto(Table(qty.NAME()).ARR(), src); }, \\\n\n #NAME \" \" #ARR \" array\")\n\n\n","file_path":"libmarch/include/march/python/wrapper_gas.hpp","rank":98,"score":53.77865210371527},{"content":"\n\n friend base_type;\n\n\n\n WrapBlockHand(pybind11::module & mod, const char * pyname, const char * clsdoc)\n\n : base_type(mod, pyname, clsdoc)\n\n {\n\n namespace py = pybind11;\n\n (*this)\n\n .def(\n\n py::init([](block_type & block, index_type index) {\n\n return wrapped_type(block, index);\n\n }),\n\n py::arg(\"block\"), py::arg(\"index\")\n\n )\n\n .def(\"repr\", &wrapped_type::repr, py::arg(\"indent\")=0, py::arg(\"precision\")=0)\n\n .def(\"__repr__\", [](wrapped_type & self){ return self.repr(); })\n\n .def(\"__eq__\", &wrapped_type::operator==)\n\n .def(\n\n \"__hash__\",\n\n [](wrapped_type const & self) {\n","file_path":"libmarch/include/march/python/wrapper_mesh.hpp","rank":99,"score":52.646649145389404}],"string":"[\n {\n \"content\": \"class LookupTable<ElemType, 0>: public LookupTableCore\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n using elem_type = ElemType;\\n\\n\\n\\n typedef elem_type (&row_type);\\n\\n typedef const elem_type (&const_row_type);\\n\\n\\n\\n LookupTable() {}\\n\\n\\n\\n LookupTable(index_type nghost, index_type nbody)\\n\\n : LookupTableCore(nghost, nbody, std::vector<index_type>({nghost+nbody}), type_to<ElemType>::id)\\n\\n {}\\n\\n\\n\\n row_type operator[](index_type loc) {\\n\\n return *reinterpret_cast<elem_type *>(row(loc));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/core/LookupTable.hpp\",\n \"rank\": 0,\n \"score\": 350371.82836060657\n },\n {\n \"content\": \"class Buffer: public std::enable_shared_from_this<Buffer> {\\n\\n\\n\\nprivate:\\n\\n\\n\\n size_t m_length = 0;\\n\\n char * m_data = nullptr;\\n\\n\\n\\n struct ctor_passkey {};\\n\\n\\n\\npublic:\\n\\n\\n\\n Buffer(const ctor_passkey &) { }\\n\\n\\n\\n static std::shared_ptr<Buffer> construct() {\\n\\n return std::make_shared<Buffer>(ctor_passkey());\\n\\n }\\n\\n\\n\\n /**\\n\\n * \\\\param[in] length Memory buffer length.\\n\\n */\\n\",\n \"file_path\": \"libmarch/include/march/core/Buffer.hpp\",\n \"rank\": 1,\n \"score\": 335039.3033220356\n },\n {\n \"content\": \"class LookupTable: public LookupTableCore\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n using elem_type = ElemType;\\n\\n\\n\\n typedef elem_type (&row_type)[NCOLUMN];\\n\\n typedef const elem_type (&const_row_type)[NCOLUMN];\\n\\n\\n\\n LookupTable() {}\\n\\n\\n\\n LookupTable(index_type nghost, index_type nbody)\\n\\n : LookupTableCore(nghost, nbody, std::vector<index_type>({nghost+nbody, NCOLUMN}), type_to<ElemType>::id)\\n\\n {}\\n\\n\\n\\n row_type operator[](index_type loc) {\\n\\n return *reinterpret_cast<elem_type(*)[NCOLUMN]>(row(loc));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/core/LookupTable.hpp\",\n \"rank\": 2,\n \"score\": 304842.5503635246\n },\n {\n \"content\": \"class Order1Hand : public HandCRTP< Order1Hand<NDIM>, HandTraits<SolutionOrder1Table<real_type, NDIM>, Vector<NDIM>> >\\n\\n{\\n\\npublic:\\n\\n using base_type = HandCRTP< Order1Hand<NDIM>, HandTraits<SolutionOrder1Table<real_type, NDIM>, Vector<NDIM>> >;\\n\\n using base_type::base_type;\\n\\n using trait_type = HandTraits<SolutionOrder1Table<real_type, NDIM>, Vector<NDIM>>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n using matrix_type = Matrix<NDIM>;\\n\\n Order1Hand & operator=(vector_type const & value) {\\n\\n for (index_type it=0; it<trait_type::neq; ++it) { (**this)[it] = value; }\\n\\n return *this;\\n\\n }\\n\\n Order1Hand & operator=(real_type value) {\\n\\n for (index_type it=0; it<trait_type::neq; ++it) { (**this)[it] = value; }\\n\\n return *this;\\n\\n }\\n\\n vector_type & density() { return (**this)[0]; }\\n\\n vector_type const & density() const { return (**this)[0]; }\\n\\n matrix_type & momentum() { return *reinterpret_cast<matrix_type *>(&(**this)[1]); }\\n\\n matrix_type const & momentum() const { return *reinterpret_cast<matrix_type const *>(&(**this)[1]); }\\n\\n vector_type & energy() { return (**this)[NDIM+1]; }\\n\\n vector_type const & energy() const { return (**this)[NDIM+1]; }\\n\\n}; /* end class Order1Hand */\\n\\n\\n\\n/**\\n\\n * Solution arrays.\\n\\n */\\n\\ntemplate< size_t NDIM >\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solution.hpp\",\n \"rank\": 3,\n \"score\": 295000.73254999385\n },\n {\n \"content\": \"class Table {\\n\\n\\n\\nprivate:\\n\\n\\n\\n enum array_flavor { FULL = 0, GHOST = 1, BODY = 2 };\\n\\n\\n\\npublic:\\n\\n\\n\\n Table(LookupTableCore & table) : m_table(table) {}\\n\\n\\n\\n Table(Table const & ) = delete;\\n\\n Table(Table &&) = delete;\\n\\n Table & operator=(Table const & ) = delete;\\n\\n Table & operator=(Table &&) = delete;\\n\\n\\n\\n pybind11::array full () { return from(FULL ); }\\n\\n pybind11::array ghost() { return from(GHOST); }\\n\\n pybind11::array body () { return from(BODY ); }\\n\\n\\n\\n static int NDIM (pybind11::array arr) { return PyArray_NDIM ((PyArrayObject *) arr.ptr()); }\\n\",\n \"file_path\": \"libmarch/include/march/python/WrapBase.hpp\",\n \"rank\": 4,\n \"score\": 292538.4033486382\n },\n {\n \"content\": \"class PythonAnchor : public gas::CommonAnchor\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n virtual ~PythonAnchor() {}\\n\\n\\n\\n template <size_t NDIM> PythonAnchor(ctor_passkey const & pk, gas::Solver<NDIM> & svr)\\n\\n : CommonAnchor(pk, svr) {}\\n\\n\\n\\n template <size_t NDIM>\\n\\n static std::shared_ptr<PythonAnchor> construct(gas::Solver<NDIM> & svr) {\\n\\n return std::make_shared<PythonAnchor>(ctor_passkey(), svr);\\n\\n }\\n\\n\\n\\n#define DECL_MARCH_GAS_PYTHON_ANCHOR_METHOD(NAME) \\\\\\n\\n void NAME() override { PYBIND11_OVERLOAD(void, CommonAnchor, NAME); }\\n\\n\\n\\n DECL_MARCH_GAS_PYTHON_ANCHOR_METHOD(provide)\\n\\n DECL_MARCH_GAS_PYTHON_ANCHOR_METHOD(preloop)\\n\",\n \"file_path\": \"libmarch/include/march/python/wrapper_gas.hpp\",\n \"rank\": 5,\n \"score\": 290983.1737255276\n },\n {\n \"content\": \"class FooTest : public ::testing::TestWithParam<const char*> {\\n\\n // You can implement all the usual class fixture members here.\\n\\n};\\n\\n\\n\\n// Then, use the TEST_P macro to define as many parameterized tests\\n\\n// for this fixture as you want. The _P suffix is for \\\"parameterized\\\"\\n\\n// or \\\"pattern\\\", whichever you prefer to think.\\n\\n\\n\\nTEST_P(FooTest, DoesBlah) {\\n\\n // Inside a test, access the test parameter with the GetParam() method\\n\\n // of the TestWithParam<T> class:\\n\\n EXPECT_TRUE(foo.Blah(GetParam()));\\n\\n ...\\n\\n}\\n\\n\\n\\nTEST_P(FooTest, HasBlahBlah) {\\n\\n ...\\n\\n}\\n\\n\\n\\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 6,\n \"score\": 271620.3838763124\n },\n {\n \"content\": \"class PythonAnchorManager : public gas::AnchorChain<NDIM>::LifeManager {\\n\\n\\n\\npublic:\\n\\n\\n\\n void append(pybind11::object const & pyobj) { m_list.push_back(pyobj); }\\n\\n\\n\\nprivate:\\n\\n\\n\\n std::list<pybind11::object> m_list;\\n\\n\\n\\n}; /* class PythonAnchorManager */\\n\\n\\n\\ntemplate< size_t NDIM >\\n\\nclass\\n\\nMARCH_PYTHON_WRAPPER_VISIBILITY\\n\\nWrapGasAnchorChain\\n\\n : public WrapBase< WrapGasAnchorChain<NDIM>, gas::AnchorChain<NDIM> >\\n\\n{\\n\\n\\n\\n /* aliases for dependent type name lookup */\\n\",\n \"file_path\": \"libmarch/include/march/python/wrapper_gas.hpp\",\n \"rank\": 7,\n \"score\": 262708.0908330167\n },\n {\n \"content\": \"class Order0Hand : public HandCRTP< Order0Hand<NDIM>, HandTraits<SolutionOrder0Table<real_type, NDIM>, real_type> >\\n\\n{\\n\\npublic:\\n\\n using base_type = HandCRTP< Order0Hand<NDIM>, HandTraits<SolutionOrder0Table<real_type, NDIM>, real_type> >;\\n\\n using base_type::base_type;\\n\\n using trait_type = HandTraits<SolutionOrder0Table<real_type, NDIM>, real_type>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n Order0Hand & operator=(real_type value) {\\n\\n for (index_type it=0; it<trait_type::neq; ++it) { (**this)[it] = value; }\\n\\n return *this;\\n\\n }\\n\\n // accessors to solution quantities.\\n\\n real_type & density() { return (**this)[0]; }\\n\\n real_type const & density() const { return (**this)[0]; }\\n\\n vector_type & momentum() { return *reinterpret_cast<vector_type *>(&(**this)[1]); }\\n\\n vector_type const & momentum() const { return *reinterpret_cast<vector_type const *>(&(**this)[1]); }\\n\\n real_type & energy() { return (**this)[NDIM+1]; }\\n\\n real_type const & energy() const { return (**this)[NDIM+1]; }\\n\\n // accessors physics values.\\n\\n real_type pressure(real_type gamma /* ratio of specific heat */) const {\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solution.hpp\",\n \"rank\": 8,\n \"score\": 260702.7733387092\n },\n {\n \"content\": \"struct array_assign_< ElemType, NCOLUMN, 0 > {\\n\\n typedef ElemType (&array_type)[NCOLUMN];\\n\\n typedef const ElemType (&const_array_type)[NCOLUMN];\\n\\n static void act(array_type row_out, const_array_type row_in) {\\n\\n row_out[0] = row_in[0];\\n\\n }\\n\\n}; /* end struct array_assign_ specialization */\\n\\n\\n\\ntemplate < typename ElemType, size_t NCOLUMN >\\n\\nvoid array_assign(ElemType (&row_out)[NCOLUMN], const ElemType (&row_in)[NCOLUMN]) {\\n\\n array_assign_<ElemType, NCOLUMN, NCOLUMN-1>::act(row_out, row_in);\\n\\n}\\n\\n\\n\\n} /* end namespace aux */\\n\\n\\n\\n/**\\n\\n * Typed unresizeable lookup table.\\n\\n */\\n\\ntemplate< typename ElemType, size_t NCOLUMN >\\n\",\n \"file_path\": \"libmarch/include/march/core/LookupTable.hpp\",\n \"rank\": 9,\n \"score\": 255680.31241844862\n },\n {\n \"content\": \"class HandCRTP : public HandBase {\\n\\n\\n\\npublic:\\n\\n\\n\\n using derived_type = Derived;\\n\\n using trait_type = Traits;\\n\\n using table_type = typename trait_type::table_type;\\n\\n using item_reference = typename trait_type::item_reference;\\n\\n using item_const_reference = typename trait_type::item_const_reference;\\n\\n using row_type = typename trait_type::row_type;\\n\\n using row_pointer = typename trait_type::row_pointer;\\n\\n using row_reference = typename trait_type::row_reference;\\n\\n using row_const_reference = typename trait_type::row_const_reference;\\n\\n\\n\\n HandCRTP(table_type & table, index_type irow) : HandCRTP(&table[irow]) {}\\n\\n HandCRTP(table_type const & table, index_type irow) : HandCRTP(&table[irow]) {}\\n\\n\\n\\n derived_type & assign(derived_type && other) { this->m_ptr = other.m_ptr; }\\n\\n\\n\\n HandCRTP(HandCRTP && other) : HandCRTP(other.ptr()) {}\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solution.hpp\",\n \"rank\": 10,\n \"score\": 247669.4657521054\n },\n {\n \"content\": \"class LookupTableCore {\\n\\n\\n\\nprivate:\\n\\n\\n\\n std::shared_ptr<Buffer> m_buffer;\\n\\n std::vector<index_type> m_dims;\\n\\n index_type m_nghost = 0;\\n\\n index_type m_nbody = 0;\\n\\n index_type m_ncolumn = 0;\\n\\n index_type m_elsize = 1; ///< Element size in bytes.\\n\\n DataTypeId m_datatypeid = MH_INT8;\\n\\n\\n\\npublic:\\n\\n\\n\\n LookupTableCore() : m_buffer(Buffer::construct()), m_dims() { }\\n\\n\\n\\n /**\\n\\n * \\\\param[in] nghost Number of ghost (negative index) rows.\\n\\n * \\\\param[in] nbody Number of body (non-negative index) rows.\\n\\n * \\\\param[in] dims The shape of the table, including the combined row\\n\",\n \"file_path\": \"libmarch/include/march/core/LookupTable.hpp\",\n \"rank\": 11,\n \"score\": 245626.06455222395\n },\n {\n \"content\": \"class CellTypeGroup {\\n\\n\\n\\npublic:\\n\\n\\n\\n CellTypeGroup(CellTypeGroup const & ) = delete;\\n\\n CellTypeGroup(CellTypeGroup &&) = delete;\\n\\n CellTypeGroup const & operator=(CellTypeGroup const & ) = delete;\\n\\n CellTypeGroup && operator=(CellTypeGroup &&) = delete;\\n\\n\\n\\n CellType const & point () const { return m_cell_types[CellType::POINT ]; }\\n\\n CellType const & line () const { return m_cell_types[CellType::LINE ]; }\\n\\n CellType const & quadrilateral() const { return m_cell_types[CellType::QUADRILATERAL]; }\\n\\n CellType const & triangle () const { return m_cell_types[CellType::TRIANGLE ]; }\\n\\n CellType const & hexahedron () const { return m_cell_types[CellType::HEXAHEDRON ]; }\\n\\n CellType const & tetrahedron () const { return m_cell_types[CellType::TETRAHEDRON ]; }\\n\\n CellType const & prism () const { return m_cell_types[CellType::PRISM ]; }\\n\\n CellType const & pyramid () const { return m_cell_types[CellType::PYRAMID ]; }\\n\\n\\n\\n CellType const & operator[](size_t id) const { return m_cell_types[id]; }\\n\\n size_t size() const { return sizeof(m_cell_types) / sizeof(CellType); }\\n\",\n \"file_path\": \"libmarch/include/march/mesh/CellType.hpp\",\n \"rank\": 12,\n \"score\": 245516.99247212458\n },\n {\n \"content\": \"class InstanceCounter {\\n\\n\\n\\npublic:\\n\\n\\n\\n InstanceCounter() { ++m_active_instance_count; }\\n\\n InstanceCounter(InstanceCounter const &) { ++m_active_instance_count; }\\n\\n ~InstanceCounter() { --m_active_instance_count; }\\n\\n\\n\\n static size_t active_instance_count() { return m_active_instance_count; }\\n\\n\\n\\nprivate:\\n\\n\\n\\n static size_t m_active_instance_count;\\n\\n\\n\\n}; /* end class InstanceCounter */\\n\\n\\n\\ntemplate< class T > size_t InstanceCounter<T>::m_active_instance_count = 0;\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/include/march/core/memory.hpp\",\n \"rank\": 13,\n \"score\": 242051.1529434481\n },\n {\n \"content\": \" class Resizer {\\n\\n public:\\n\\n Resizer(LookupTableCore & table) : m_table(table) {}\\n\\n LookupTableCore operator()(index_type nghost, index_type nbody) {\\n\\n LookupTableCore newtable = new_table(m_table, nghost, nbody);\\n\\n copy(newtable, m_table);\\n\\n return newtable;\\n\\n }\\n\\n template< class ValueType >\\n\\n LookupTableCore operator()(index_type nghost, index_type nbody, ValueType initial) {\\n\\n LookupTableCore newtable = new_table(m_table, nghost, nbody);\\n\\n fill(newtable, initial);\\n\\n copy(newtable, m_table);\\n\\n return newtable;\\n\\n }\\n\\n private:\\n\\n static LookupTableCore new_table(LookupTableCore const & src, index_type nghost, index_type nbody) {\\n\\n std::vector<index_type> dims(src.m_dims);\\n\\n dims[0] = nghost + nbody;\\n\\n return LookupTableCore(nghost, nbody, dims, src.m_datatypeid);\\n\",\n \"file_path\": \"libmarch/include/march/core/LookupTable.hpp\",\n \"rank\": 14,\n \"score\": 241987.21942185902\n },\n {\n \"content\": \"class UniversalTersePrinter<const char*> {\\n\\n public:\\n\\n static void Print(const char* str, ::std::ostream* os) {\\n\\n if (str == NULL) {\\n\\n *os << \\\"NULL\\\";\\n\\n } else {\\n\\n UniversalPrint(string(str), os);\\n\\n }\\n\\n }\\n\\n};\\n\\ntemplate <>\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 15,\n \"score\": 239571.6495064805\n },\n {\n \"content\": \"struct SolutionOrder0Table : public LookupTable< ElemType, SolutionTableTraits<NDIM>::neq >\\n\\n{\\n\\n using table_traits = SolutionTableTraits<NDIM>;\\n\\n constexpr static size_t ndim = table_traits::ndim;\\n\\n constexpr static size_t neq = table_traits::neq;\\n\\n using base_type = LookupTable<ElemType, neq>;\\n\\n using hand_type = Order0Hand<ndim>;\\n\\n SolutionOrder0Table(index_type nghost, index_type nbody) : base_type(nghost, nbody) {}\\n\\n hand_type hat(index_type irow) { return hand_type(*this, irow); }\\n\\n hand_type const hat(index_type irow) const { return hand_type(*this, irow); }\\n\\n}; /* end struct SolutionOrder0Table */\\n\\n\\n\\ntemplate< size_t NDIM > class Order1Hand;\\n\\n\\n\\ntemplate< typename ElemType, size_t NDIM >\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solution.hpp\",\n \"rank\": 16,\n \"score\": 238671.83435348305\n },\n {\n \"content\": \"class ModuleInitializer {\\n\\n\\n\\npublic:\\n\\n\\n\\n static ModuleInitializer & get_instance() {\\n\\n static ModuleInitializer inst;\\n\\n return inst;\\n\\n }\\n\\n\\n\\n void initialize(pybind11::module & topmod) {\\n\\n if (!m_initialized) {\\n\\n initialize_march(topmod);\\n\\n initialize_march_gas(topmod);\\n\\n }\\n\\n }\\n\\n\\n\\n bool is_initialized() const { return m_initialized; }\\n\\n\\n\\nprivate:\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/python/WrapBase.hpp\",\n \"rank\": 17,\n \"score\": 236886.61123442376\n },\n {\n \"content\": \"class TrimInterface : public TrimBase<NDIM> {\\n\\n\\n\\npublic:\\n\\n\\n\\n using base_type = TrimBase<NDIM>;\\n\\n using solver_type = typename base_type::solver_type;\\n\\n using block_type = typename base_type::block_type;\\n\\n using pointer = typename base_type::pointer;\\n\\n\\n\\n TrimInterface(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\\n\\n static_assert(sizeof(TrimInterface<NDIM>) == sizeof(base_type), \\\"TrimInterface size mismatch\\\");\\n\\n }\\n\\n ~TrimInterface() override {}\\n\\n std::string type_name() override { return string::get_type_name(*this); }\\n\\n void apply_do0() override { /* FIXME: add code */ }\\n\\n void apply_do1() override { /* FIXME: add code */ }\\n\\n\\n\\n}; /* end class TrimInterface */\\n\\n\\n\\n\\n\\ntemplate< size_t NDIM >\\n\",\n \"file_path\": \"libmarch/include/march/gas/Trim.hpp\",\n \"rank\": 18,\n \"score\": 236354.4027404365\n },\n {\n \"content\": \"class TrimInlet : public TrimBase<NDIM> {\\n\\n\\n\\npublic:\\n\\n\\n\\n constexpr static size_t NVALUE = 6;\\n\\n\\n\\n using base_type = TrimBase<NDIM>;\\n\\n using solver_type = typename base_type::solver_type;\\n\\n using block_type = typename base_type::block_type;\\n\\n using pointer = typename base_type::pointer;\\n\\n\\n\\n TrimInlet(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\\n\\n static_assert(sizeof(TrimInlet<NDIM>) == sizeof(base_type), \\\"TrimInlet size mismatch\\\");\\n\\n }\\n\\n\\n\\n ~TrimInlet() override {}\\n\\n std::string type_name() override { return string::get_type_name(*this); }\\n\\n void apply_do0() override;\\n\\n void apply_do1() override;\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Trim.hpp\",\n \"rank\": 19,\n \"score\": 236354.4027404365\n },\n {\n \"content\": \"class TrimNoOp : public TrimBase<NDIM> {\\n\\n\\n\\npublic:\\n\\n\\n\\n using base_type = TrimBase<NDIM>;\\n\\n using solver_type = typename base_type::solver_type;\\n\\n using block_type = typename base_type::block_type;\\n\\n using pointer = typename base_type::pointer;\\n\\n\\n\\n TrimNoOp(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\\n\\n static_assert(sizeof(TrimNoOp<NDIM>) == sizeof(base_type), \\\"TrimNoOp size mismatch\\\");\\n\\n }\\n\\n ~TrimNoOp() override {}\\n\\n std::string type_name() override { return string::get_type_name(*this); }\\n\\n void apply_do0() override {}\\n\\n void apply_do1() override {}\\n\\n\\n\\n}; /* end class TrimNoOp */\\n\\n\\n\\n\\n\\ntemplate< size_t NDIM >\\n\",\n \"file_path\": \"libmarch/include/march/gas/Trim.hpp\",\n \"rank\": 20,\n \"score\": 236354.4027404365\n },\n {\n \"content\": \"struct SolutionOrder1Table : public LookupTable< ElemType, NDIM*SolutionTableTraits<NDIM>::neq >\\n\\n{\\n\\n using table_traits = SolutionTableTraits<NDIM>;\\n\\n constexpr static size_t ndim = table_traits::ndim;\\n\\n constexpr static size_t neq = table_traits::neq;\\n\\n using base_type = LookupTable<ElemType, ndim*neq>;\\n\\n using hand_type = Order1Hand<ndim>;\\n\\n SolutionOrder1Table(index_type nghost, index_type nbody) : base_type(nghost, nbody) {}\\n\\n hand_type hat(index_type irow) { return hand_type(*this, irow); }\\n\\n hand_type const hat(index_type irow) const { return hand_type(*this, irow); }\\n\\n}; /* end struct SolutionOrder0Table */\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solution.hpp\",\n \"rank\": 21,\n \"score\": 233360.5811058531\n },\n {\n \"content\": \"class TrimSlipWall : public TrimBase<NDIM> {\\n\\n\\n\\npublic:\\n\\n\\n\\n using base_type = TrimBase<NDIM>;\\n\\n using solver_type = typename base_type::solver_type;\\n\\n using block_type = typename base_type::block_type;\\n\\n using pointer = typename base_type::pointer;\\n\\n\\n\\n TrimSlipWall(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\\n\\n static_assert(sizeof(TrimSlipWall<NDIM>) == sizeof(base_type), \\\"TrimSlipWall size mismatch\\\");\\n\\n }\\n\\n\\n\\n ~TrimSlipWall() override {}\\n\\n std::string type_name() override { return string::get_type_name(*this); }\\n\\n void apply_do0() override;\\n\\n void apply_do1() override;\\n\\n\\n\\n}; /* end class TrimSlipWall */\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Trim.hpp\",\n \"rank\": 22,\n \"score\": 232190.06122849713\n },\n {\n \"content\": \"class TrimNonRefl : public TrimBase<NDIM> {\\n\\n\\n\\npublic:\\n\\n\\n\\n using base_type = TrimBase<NDIM>;\\n\\n using pointer = typename base_type::pointer;\\n\\n using solver_type = typename base_type::solver_type;\\n\\n using block_type = typename base_type::block_type;\\n\\n\\n\\n TrimNonRefl(solver_type & solver, BoundaryData & boundary): base_type(solver, boundary) {\\n\\n static_assert(sizeof(TrimNonRefl<NDIM>) == sizeof(base_type), \\\"TrimNonRefl size mismatch\\\");\\n\\n }\\n\\n\\n\\n ~TrimNonRefl() override {}\\n\\n std::string type_name() override { return string::get_type_name(*this); }\\n\\n void apply_do0() override;\\n\\n void apply_do1() override;\\n\\n\\n\\n}; /* end class TrimNonRefl */\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Trim.hpp\",\n \"rank\": 23,\n \"score\": 232190.06122849713\n },\n {\n \"content\": \"#define MH_DECL_CELL_TYPE(NAME, TYPE, DIM, NNODE, NEDGE, NSURFACE) \\\\\\n\\nstruct NAME##CellType : public CellType { \\\\\\n\\n NAME##CellType() : CellType(TYPE, DIM, NNODE, NEDGE, NSURFACE) {} \\\\\\n\\n};\\n\\n// id, ndim, nnode, nedge, nsurface\\n\\nMH_DECL_CELL_TYPE(Point , 0, 0, 1, 0, 0 ) // point/node/vertex\\n\\nMH_DECL_CELL_TYPE(Line , 1, 1, 2, 0, 0 ) // line/edge\\n\\nMH_DECL_CELL_TYPE(Quadrilateral, 2, 2, 4, 4, 0 )\\n\\nMH_DECL_CELL_TYPE(Triangle , 3, 2, 3, 3, 0 )\\n\\nMH_DECL_CELL_TYPE(Hexahedron , 4, 3, 8, 12, 6 ) // hexahedron/brick\\n\\nMH_DECL_CELL_TYPE(Tetrahedron , 5, 3, 4, 6, 4 )\\n\\nMH_DECL_CELL_TYPE(Prism , 6, 3, 6, 9, 5 )\\n\\nMH_DECL_CELL_TYPE(Pyramid , 7, 3, 5, 8, 5 )\\n\\n#undef MH_DECL_CELL_TYPE\\n\\n\\n\\nnamespace detail {\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/mesh/CellType.hpp\",\n \"rank\": 24,\n \"score\": 226373.0651716724\n },\n {\n \"content\": \"class GETypeGroup {\\n\\n\\n\\npublic:\\n\\n\\n\\n GEType const & operator[](size_t id) const { return m_ge_types[id]; }\\n\\n size_t size() const { return sizeof(m_ge_types) / sizeof(GEType); }\\n\\n \\n\\n static const GETypeGroup & get_instance() {\\n\\n static GETypeGroup inst;\\n\\n return inst;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n\\n\\n GETypeGroup()\\n\\n : m_ge_types{\\n\\n GEType(0, 0, 0 ) // point\\n\\n , GEType(1, 1, 1 ) // line\\n\\n , GEType(2, 4, 1.0/4) // quadrilateral\\n\\n , GEType(3, 3, 1.0/3) // triangle\\n\",\n \"file_path\": \"libmarch/include/march/mesh/ConservationElement/GradientElement.hpp\",\n \"rank\": 25,\n \"score\": 223098.4735375644\n },\n {\n \"content\": \"class FaceHand : public BlockHandBase< NDIM, FaceHand<NDIM> > {\\n\\n\\n\\npublic:\\n\\n\\n\\n using base_type = BlockHandBase<NDIM, FaceHand<NDIM>>;\\n\\n using base_type::base_type;\\n\\n\\n\\n using block_type = UnstructuredBlock<NDIM>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n\\n\\n std::string repr(size_t indent=0, size_t precision=0) const;\\n\\n\\n\\n index_type tpn() const { return this->block().fctpn()[this->index()]; }\\n\\n\\n\\n CellType const & type() const { return celltype(tpn()); }\\n\\n\\n\\n vector_type const & cnd() const { return this->row_as_vector(this->block().fccnd()[this->index()]); }\\n\\n vector_type const & nml() const { return this->row_as_vector(this->block().fcnml()[this->index()]); }\\n\\n real_type ara() const { return this->block().fcara()[this->index()]; }\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp\",\n \"rank\": 26,\n \"score\": 203896.44827277877\n },\n {\n \"content\": \"class CellHand : public BlockHandBase< NDIM, CellHand<NDIM> > {\\n\\n\\n\\npublic:\\n\\n\\n\\n using base_type = BlockHandBase<NDIM, CellHand<NDIM>>;\\n\\n using base_type::base_type;\\n\\n\\n\\n using block_type = UnstructuredBlock<NDIM>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n\\n\\n std::string repr(size_t indent=0, size_t precision=0) const;\\n\\n\\n\\n index_type tpn() const { return this->block().cltpn()[this->index()]; }\\n\\n\\n\\n CellType const & type() const { return celltype(tpn()); }\\n\\n\\n\\n vector_type const & cnd() const {\\n\\n return *reinterpret_cast<vector_type const *>(&(this->block().clcnd()[this->index()][0]));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp\",\n \"rank\": 27,\n \"score\": 203896.44827277877\n },\n {\n \"content\": \"class NodeHand : public BlockHandBase< NDIM, NodeHand<NDIM> > {\\n\\n\\n\\npublic:\\n\\n\\n\\n using base_type = BlockHandBase<NDIM, NodeHand<NDIM>>;\\n\\n using base_type::base_type;\\n\\n\\n\\n using block_type = UnstructuredBlock<NDIM>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n\\n\\n std::string repr(size_t indent=0, size_t precision=0) const;\\n\\n\\n\\n vector_type const & crd() const { return this->row_as_vector(this->block().ndcrd()[this->index()]); }\\n\\n\\n\\n}; /* end class NodeHand */\\n\\n\\n\\ntemplate< size_t NDIM >\\n\\nstd::string NodeHand<NDIM>::repr(size_t indent, size_t precision) const {\\n\\n std::string ret(string::format(\\\"NodeHand%ldD(index=%d\\\", NDIM, this->index()));\\n\\n ret += \\\", crd=\\\" + crd().repr(indent, precision) + \\\")\\\";\\n\\n return ret;\\n\\n}\\n\\n\\n\\ntemplate< size_t NDIM > class CellHand;\\n\\n\\n\\ntemplate< size_t NDIM >\\n\",\n \"file_path\": \"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp\",\n \"rank\": 28,\n \"score\": 203896.44827277877\n },\n {\n \"content\": \"enum DataTypeId {\\n\\n MH_BOOL=0,\\n\\n MH_INT8, MH_UINT8,\\n\\n MH_INT16, MH_UINT16,\\n\\n MH_INT32, MH_UINT32,\\n\\n MH_LONG, MH_ULONG,\\n\\n MH_INT64, MH_UINT64,\\n\\n MH_FLOAT, MH_DOUBLE, MH_LONGDOUBLE,\\n\\n MH_CFLOAT, MH_CDOUBLE, MH_CLONGDOUBLE\\n\\n};\\n\\n\\n\\ninline size_t data_type_size(const DataTypeId dtid) {\\n\\n size_t ret = 0;\\n\\n switch (dtid) {\\n\\n case MH_BOOL:\\n\\n case MH_INT8:\\n\\n case MH_UINT8:\\n\\n ret = 1;\\n\\n break;\\n\\n case MH_INT16:\\n\",\n \"file_path\": \"libmarch/include/march/core/types.hpp\",\n \"rank\": 29,\n \"score\": 201609.49496733624\n },\n {\n \"content\": \"// The convenience class for users who need to override just one or two\\n\\n// methods and are not concerned that a possible change to a signature of\\n\\n// the methods they override will not be caught during the build. For\\n\\n// comments about each method please see the definition of TestEventListener\\n\\n// above.\\n\\nclass EmptyTestEventListener : public TestEventListener {\\n\\n public:\\n\\n virtual void OnTestProgramStart(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnTestIterationStart(const UnitTest& /*unit_test*/,\\n\\n int /*iteration*/) {}\\n\\n virtual void OnEnvironmentsSetUpStart(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnEnvironmentsSetUpEnd(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnTestCaseStart(const TestCase& /*test_case*/) {}\\n\\n virtual void OnTestStart(const TestInfo& /*test_info*/) {}\\n\\n virtual void OnTestPartResult(const TestPartResult& /*test_part_result*/) {}\\n\\n virtual void OnTestEnd(const TestInfo& /*test_info*/) {}\\n\\n virtual void OnTestCaseEnd(const TestCase& /*test_case*/) {}\\n\\n virtual void OnEnvironmentsTearDownStart(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnEnvironmentsTearDownEnd(const UnitTest& /*unit_test*/) {}\\n\\n virtual void OnTestIterationEnd(const UnitTest& /*unit_test*/,\\n\\n int /*iteration*/) {}\\n\\n virtual void OnTestProgramEnd(const UnitTest& /*unit_test*/) {}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 30,\n \"score\": 198338.2324460745\n },\n {\n \"content\": \"class UnstructuredBlock\\n\\n : public std::enable_shared_from_this<UnstructuredBlock<NDIM>>\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n static_assert(2 == NDIM || 3 == NDIM, \\\"not 2 or 3 dimensional\\\");\\n\\n\\n\\n static constexpr index_type FCMND = CellType::FCNND_MAX;\\n\\n static constexpr index_type CLMND = CellType::CLNND_MAX;\\n\\n static constexpr index_type CLMFC = CellType::CLNFC_MAX;\\n\\n static constexpr index_type FCNCL = 4;\\n\\n static constexpr index_type FCREL = 4;\\n\\n static constexpr index_type BFREL = BoundaryData::BFREL;\\n\\n\\n\\n // TODO: move to UnstructuredBlock.\\n\\n // @[\\n\\n void locate_point(const real_type (& crd)[NDIM]) const;\\n\\n\\n\\n // moved to mesh: void prepare_ce();\\n\",\n \"file_path\": \"libmarch/include/march/mesh/UnstructuredBlock/class.hpp\",\n \"rank\": 31,\n \"score\": 197416.0682546721\n },\n {\n \"content\": \" class ctor_passkey {\\n\\n private:\\n\\n ctor_passkey() = default;\\n\\n friend UnstructuredBlock<NDIM>;\\n\\n };\\n\\n\\n\\n UnstructuredBlock(\\n\\n const ctor_passkey &\\n\\n , index_type nnode, index_type nface, index_type ncell, index_type nbound\\n\\n , index_type ngstnode, index_type ngstface, index_type ngstcell\\n\\n , bool use_incenter\\n\\n ) : std::enable_shared_from_this<UnstructuredBlock<NDIM>>()\\n\\n , m_nnode(nnode), m_nface(nface), m_ncell(ncell), m_nbound(nbound)\\n\\n , m_ngstnode(ngstnode), m_ngstface(ngstface), m_ngstcell(ngstcell)\\n\\n , m_use_incenter(use_incenter)\\n\\n {\\n\\n build_tables();\\n\\n }\\n\\n\\n\\n UnstructuredBlock() = delete;\\n\",\n \"file_path\": \"libmarch/include/march/mesh/UnstructuredBlock/class.hpp\",\n \"rank\": 32,\n \"score\": 197416.0682546721\n },\n {\n \"content\": \"struct array_assign_ {\\n\\n typedef ElemType (&array_type)[NCOLUMN];\\n\\n typedef const ElemType (&const_array_type)[NCOLUMN];\\n\\n static void act(array_type row_out, const_array_type row_in) {\\n\\n array_assign_<ElemType, NCOLUMN, INDEX-1>::act(row_out, row_in);\\n\\n row_out[INDEX] = row_in[INDEX];\\n\\n }\\n\\n}; /* end struct array_assign_ */\\n\\n\\n\\ntemplate < typename ElemType, size_t NCOLUMN >\\n\",\n \"file_path\": \"libmarch/include/march/core/LookupTable.hpp\",\n \"rank\": 33,\n \"score\": 196446.04053268413\n },\n {\n \"content\": \"class Anchor\\n\\n : public std::enable_shared_from_this<Anchor<NDIM>>\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n using solver_type = Solver<NDIM>;\\n\\n\\n\\n Anchor() = delete;\\n\\n Anchor(Anchor const & ) = delete;\\n\\n Anchor(Anchor &&) = delete;\\n\\n Anchor & operator=(Anchor const & ) = delete;\\n\\n Anchor & operator=(Anchor &&) = delete;\\n\\n\\n\\nprotected:\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Anchor.hpp\",\n \"rank\": 34,\n \"score\": 195375.60519170674\n },\n {\n \"content\": \"class Solution {\\n\\n\\n\\npublic:\\n\\n\\n\\n using table_traits = SolutionTableTraits<NDIM>;\\n\\n static constexpr size_t ndim=table_traits::ndim;\\n\\n static constexpr size_t neq=table_traits::neq;\\n\\n\\n\\n using o0table_type = SolutionOrder0Table<real_type, ndim>;\\n\\n using o1table_type = SolutionOrder1Table<real_type, ndim>;\\n\\n using o0hand_type = typename o0table_type::hand_type;\\n\\n using o1hand_type = typename o1table_type::hand_type;\\n\\n\\n\\n Solution(index_type ngstcell, index_type ncell)\\n\\n : m_so0c(ngstcell, ncell), m_so0n(ngstcell, ncell), m_so0t(ngstcell, ncell)\\n\\n , m_so1c(ngstcell, ncell), m_so1n(ngstcell, ncell)\\n\\n , m_stm(ngstcell, ncell), m_cflo(ngstcell, ncell), m_cflc(ngstcell, ncell)\\n\\n , m_gamma(ngstcell, ncell)\\n\\n {}\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solution.hpp\",\n \"rank\": 35,\n \"score\": 195375.60519170674\n },\n {\n \"content\": \"class Quantity\\n\\n : public InstanceCounter<Quantity<NDIM>>\\n\\n , public std::enable_shared_from_this<Quantity<NDIM>>\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n using solver_type = Solver<NDIM>;\\n\\n using solution_type = typename solver_type::solution_type;\\n\\n using block_type = UnstructuredBlock<NDIM>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n\\n\\n using o0hand_type = typename solution_type::o0hand_type;\\n\\n using o1hand_type = typename solution_type::o1hand_type;\\n\\n\\n\\n static constexpr real_type ALMOST_ZERO = solver_type::ALMOST_ZERO;\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Quantity.hpp\",\n \"rank\": 36,\n \"score\": 195375.60519170674\n },\n {\n \"content\": \" class Iterator : public ParamIteratorInterface<ParamType> {\\n\\n public:\\n\\n Iterator(const ParamGeneratorInterface<ParamType>* base,\\n\\n const ParamGenerator<T1>& g1,\\n\\n const typename ParamGenerator<T1>::iterator& current1,\\n\\n const ParamGenerator<T2>& g2,\\n\\n const typename ParamGenerator<T2>::iterator& current2,\\n\\n const ParamGenerator<T3>& g3,\\n\\n const typename ParamGenerator<T3>::iterator& current3,\\n\\n const ParamGenerator<T4>& g4,\\n\\n const typename ParamGenerator<T4>::iterator& current4,\\n\\n const ParamGenerator<T5>& g5,\\n\\n const typename ParamGenerator<T5>::iterator& current5,\\n\\n const ParamGenerator<T6>& g6,\\n\\n const typename ParamGenerator<T6>::iterator& current6,\\n\\n const ParamGenerator<T7>& g7,\\n\\n const typename ParamGenerator<T7>::iterator& current7,\\n\\n const ParamGenerator<T8>& g8,\\n\\n const typename ParamGenerator<T8>::iterator& current8,\\n\\n const ParamGenerator<T9>& g9,\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 37,\n \"score\": 194530.23771151976\n },\n {\n \"content\": \"class Solver\\n\\n : public InstanceCounter<Solver<NDIM>>\\n\\n , public std::enable_shared_from_this<Solver<NDIM>>\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n using int_type = State::int_type;\\n\\n using block_type = UnstructuredBlock<NDIM>;\\n\\n using anchor_chain_type = AnchorChain<NDIM>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n using solution_type = Solution<NDIM>;\\n\\n\\n\\n static constexpr size_t ndim = solution_type::ndim;\\n\\n static constexpr size_t neq = solution_type::neq;\\n\\n static constexpr real_type TINY = 1.e-60;\\n\\n static constexpr real_type ALMOST_ZERO = 1.e-200;\\n\\n\\n\\n static constexpr index_type FCMND = block_type::FCMND;\\n\\n static constexpr index_type CLMND = block_type::CLMND;\\n\\n static constexpr index_type CLMFC = block_type::CLMFC;\\n\\n static constexpr index_type FCNCL = block_type::FCNCL;\\n\\n static constexpr index_type FCREL = block_type::FCREL;\\n\\n static constexpr index_type BFREL = block_type::BFREL;\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solver_decl.hpp\",\n \"rank\": 38,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \" class ctor_passkey {\\n\\n ctor_passkey() = default;\\n\\n friend Quantity<NDIM>;\\n\\n };\\n\\n\\n\\n Quantity(ctor_passkey const &, solver_type const & solver)\\n\\n : m_solver(solver)\\n\\n , m_density (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_velocity (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_vorticity (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_vorticity_magnitude (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_ke (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_pressure (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_temperature (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_soundspeed (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_mach (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n , m_schlieren (solver.block()->ngstcell(), solver.block()->ncell())\\n\\n {}\\n\\n\\n\\n Quantity() = delete;\\n\",\n \"file_path\": \"libmarch/include/march/gas/Quantity.hpp\",\n \"rank\": 39,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \"class AnchorChain\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n using anchor_type = Anchor<NDIM>;\\n\\n using anchor_ptr = std::shared_ptr<anchor_type>;\\n\\n\\n\\n struct LifeManager { virtual ~LifeManager() {} };\\n\\n\\n\\n std::unique_ptr<LifeManager> & life_manager() { return m_life_manager; }\\n\\n std::unique_ptr<LifeManager> const & life_manager() const { return m_life_manager; }\\n\\n\\n\\n void push_back(anchor_ptr const & ptr) { m_anchors.push_back(ptr); }\\n\\n void append(anchor_ptr const & ptr, std::string const & name) {\\n\\n m_anchors.push_back(ptr);\\n\\n m_names.emplace(name, ptr);\\n\\n }\\n\\n\\n\\n#define DECL_MARCH_GAS_ANCHOR_CALL_FORWARD(NAME) \\\\\\n\",\n \"file_path\": \"libmarch/include/march/gas/Anchor.hpp\",\n \"rank\": 40,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \"class CommonAnchor\\n\\n : public std::enable_shared_from_this<CommonAnchor>\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n CommonAnchor() = delete;\\n\\n CommonAnchor(CommonAnchor const & ) = delete;\\n\\n CommonAnchor(CommonAnchor &&) = delete;\\n\\n CommonAnchor & operator=(CommonAnchor const & ) = delete;\\n\\n CommonAnchor & operator=(CommonAnchor &&) = delete;\\n\\n\\n\\n virtual ~CommonAnchor() {}\\n\\n\\n\\nprotected:\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Anchor.hpp\",\n \"rank\": 41,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \"class HandBase {\\n\\npublic:\\n\\n HandBase() : m_ptr(nullptr) {}\\n\\n operator bool() const { return m_ptr; }\\n\\nprotected:\\n\\n template<class T> HandBase(T * ptr) : m_ptr((void *)ptr) {}\\n\\n template<class T> T * ptr() { return reinterpret_cast<T *>(m_ptr); }\\n\\n template<class T> T * ptr() const { return reinterpret_cast<T *>(m_ptr); }\\n\\nprivate:\\n\\n void * m_ptr;\\n\\n}; /* end class HandBase */\\n\\n\\n\\n/**\\n\\n * Hand is a handle to solution arrays. The copy and move constructors copy\\n\\n * the pointer inside the other object, but assignment operators deep copy the\\n\\n * contents of the array.\\n\\n */\\n\\ntemplate< class Derived, class Traits >\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solution.hpp\",\n \"rank\": 42,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \"class TrimInternal {\\n\\n\\n\\npublic:\\n\\n\\n\\n using solver_type = Solver<NDIM>;\\n\\n using block_type = typename solver_type::block_type;\\n\\n using o0hand_type = typename Solution<NDIM>::o0hand_type;\\n\\n using o1hand_type = typename Solution<NDIM>::o1hand_type;\\n\\n\\n\\n constexpr static index_type FCNCL = block_type::FCNCL;\\n\\n\\n\\n using fccls_row_const_reference = index_type const (&)[FCNCL];\\n\\n template< size_t NVALUE > using boundary_value_type = real_type[NVALUE];\\n\\n\\n\\n TrimInternal(solver_type & solver, BoundaryData & boundary)\\n\\n : m_solver(solver)\\n\\n , m_block(*solver.block())\\n\\n , m_boundary(boundary)\\n\\n {}\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Trim.hpp\",\n \"rank\": 43,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \"class TrimBase {\\n\\n\\n\\npublic:\\n\\n\\n\\n using pointer = std::unique_ptr<TrimBase<NDIM>>;\\n\\n\\n\\n using internal_type = TrimInternal<NDIM>;\\n\\n using solver_type = typename internal_type::solver_type;\\n\\n using block_type = typename internal_type::block_type;\\n\\n\\n\\n TrimBase(solver_type & solver, BoundaryData & boundary): m_internal(solver, boundary) {}\\n\\n\\n\\n TrimBase() = delete;\\n\\n TrimBase(TrimBase const & other) : m_internal(other.m_internal) {}\\n\\n TrimBase(TrimBase && other) : m_internal(other.m_internal) {}\\n\\n TrimBase & operator=(TrimBase const & ) = delete;\\n\\n TrimBase & operator=(TrimBase &&) = delete;\\n\\n\\n\\n virtual ~TrimBase() {}\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Trim.hpp\",\n \"rank\": 44,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \"class Parameter\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n using int_type = int32_t;\\n\\n\\n\\n Parameter() = default;\\n\\n Parameter(Parameter const & ) = default;\\n\\n Parameter(Parameter &&) = delete;\\n\\n Parameter & operator=(Parameter const & ) = default;\\n\\n Parameter & operator=(Parameter &&) = delete;\\n\\n\\n\\n real_type sigma0() const { return m_sigma0; }\\n\\n real_type & sigma0() { return m_sigma0; }\\n\\n real_type taumin() const { return m_taumin; }\\n\\n real_type & taumin() { return m_taumin; }\\n\\n real_type tauscale() const { return m_tauscale; }\\n\\n real_type & tauscale() { return m_tauscale; }\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solver_decl.hpp\",\n \"rank\": 45,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \" class ctor_passkey {};\\n\\n\\n\\npublic:\\n\\n\\n\\n Anchor(ctor_passkey const &, solver_type & svr, std::shared_ptr<CommonAnchor> const & common)\\n\\n : m_solver(svr), m_common(common) {}\\n\\n\\n\\n static std::shared_ptr<Anchor<NDIM>> construct(\\n\\n solver_type & svr\\n\\n , std::shared_ptr<CommonAnchor> const & common = std::shared_ptr<CommonAnchor>()\\n\\n ) {\\n\\n return std::make_shared<Anchor<NDIM>>(ctor_passkey(), svr, common);\\n\\n }\\n\\n\\n\\n virtual ~Anchor() = default;\\n\\n\\n\\n solver_type const & solver() const { return m_solver; }\\n\\n solver_type & solver() { return m_solver; }\\n\\n\\n\\n#define DECL_MARCH_GAS_ANCHOR_METHOD(NAME) \\\\\\n\",\n \"file_path\": \"libmarch/include/march/gas/Anchor.hpp\",\n \"rank\": 46,\n \"score\": 191390.8563949837\n },\n {\n \"content\": \" class TestName : public CaseName<gtest_TypeParam_> { \\\\\\n\\n private: \\\\\\n\\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\\\\n\\n typedef gtest_TypeParam_ TypeParam; \\\\\\n\\n virtual void TestBody(); \\\\\\n\\n }; \\\\\\n\\n static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \\\\\\n\\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\\\\\\n\\n __FILE__, __LINE__, #CaseName, #TestName); \\\\\\n\\n } \\\\\\n\\n template <typename gtest_TypeParam_> \\\\\\n\\n void GTEST_CASE_NAMESPACE_(CaseName)::TestName<gtest_TypeParam_>::TestBody()\\n\\n\\n\\n# define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \\\\\\n\\n namespace GTEST_CASE_NAMESPACE_(CaseName) { \\\\\\n\\n typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \\\\\\n\\n } \\\\\\n\\n static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \\\\\\n\\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\\\\\\n\\n __FILE__, __LINE__, #__VA_ARGS__)\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 47,\n \"score\": 191246.4017458324\n },\n {\n \"content\": \"// This class generates an XML output file.\\n\\nclass XmlUnitTestResultPrinter : public EmptyTestEventListener {\\n\\n public:\\n\\n explicit XmlUnitTestResultPrinter(const char* output_file);\\n\\n\\n\\n virtual void OnTestIterationEnd(const UnitTest& unit_test, int iteration);\\n\\n\\n\\n private:\\n\\n // Is c a whitespace character that is normalized to a space character\\n\\n // when it appears in an XML attribute value?\\n\\n static bool IsNormalizableWhitespace(char c) {\\n\\n return c == 0x9 || c == 0xA || c == 0xD;\\n\\n }\\n\\n\\n\\n // May c appear in a well-formed XML document?\\n\\n static bool IsValidXmlCharacter(char c) {\\n\\n return IsNormalizableWhitespace(c) || c >= 0x20;\\n\\n }\\n\\n\\n\\n // Returns an XML-escaped copy of the input string str. If\\n\\n // is_attribute is true, the text is meant to appear as an attribute\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest-all.cc\",\n \"rank\": 48,\n \"score\": 189339.9243148903\n },\n {\n \"content\": \" class FormatForComparison<CharType*, OtherStringType> { \\\\\\n\\n public: \\\\\\n\\n static ::std::string Format(CharType* value) { \\\\\\n\\n return ::testing::PrintToString(value); \\\\\\n\\n } \\\\\\n\\n }\\n\\n\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(char, ::std::string);\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(const char, ::std::string);\\n\\n\\n\\n#if GTEST_HAS_GLOBAL_STRING\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(char, ::string);\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(const char, ::string);\\n\\n#endif\\n\\n\\n\\n#if GTEST_HAS_GLOBAL_WSTRING\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(wchar_t, ::wstring);\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_STRING_(const wchar_t, ::wstring);\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 49,\n \"score\": 187827.21713612135\n },\n {\n \"content\": \" class ctor_passkey {\\n\\n ctor_passkey() = default;\\n\\n friend Solver<NDIM>;\\n\\n };\\n\\n\\n\\n Solver(const ctor_passkey &, const std::shared_ptr<block_type> & block);\\n\\n\\n\\n Solver() = delete;\\n\\n Solver(Solver const & ) = delete;\\n\\n Solver(Solver &&) = delete;\\n\\n Solver & operator=(Solver const & ) = delete;\\n\\n Solver & operator=(Solver &&) = delete;\\n\\n\\n\\n static std::shared_ptr<Solver<NDIM>> construct(const std::shared_ptr<block_type> & block) {\\n\\n return std::make_shared<Solver<NDIM>>(ctor_passkey(), block);\\n\\n }\\n\\n\\n\\n std::shared_ptr<block_type> const & block() const { return m_block; }\\n\\n std::vector<std::unique_ptr<TrimBase<NDIM>>> const & trims() const { return m_trims; }\\n\\n std::vector<std::unique_ptr<TrimBase<NDIM>>> & trims() { return m_trims; }\\n\",\n \"file_path\": \"libmarch/include/march/gas/Solver_decl.hpp\",\n \"rank\": 50,\n \"score\": 187606.49383784318\n },\n {\n \"content\": \"class BoundaryData {\\n\\n\\n\\npublic:\\n\\n\\n\\n static constexpr index_type BFREL = 3;\\n\\n\\n\\nprivate:\\n\\n\\n\\n /**\\n\\n * First column is the face index in block. The second column is the face\\n\\n * index in bndfcs. The third column is the face index of the related\\n\\n * block (if exists).\\n\\n */\\n\\n LookupTable<index_type, BFREL> m_facn;\\n\\n\\n\\n /**\\n\\n * Values attached (specified) for each boundary face. Each row is a\\n\\n * boundary face, and each column is a value.\\n\\n */\\n\\n LookupTableCore m_values;\\n\",\n \"file_path\": \"libmarch/include/march/mesh/BoundaryData.hpp\",\n \"rank\": 51,\n \"score\": 187606.49383784318\n },\n {\n \"content\": \"// Streams test results to the given port on the given host machine.\\n\\nclass GTEST_API_ StreamingListener : public EmptyTestEventListener {\\n\\n public:\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest-all.cc\",\n \"rank\": 52,\n \"score\": 185248.78596570904\n },\n {\n \"content\": \"class BlockHandBase {\\n\\n\\n\\npublic:\\n\\n\\n\\n using block_type = UnstructuredBlock<NDIM>;\\n\\n using vector_type = Vector<NDIM>;\\n\\n\\n\\n BlockHandBase(block_type const & block, index_type index)\\n\\n : m_block(&const_cast<block_type &>(block))\\n\\n , m_index(index)\\n\\n {}\\n\\n\\n\\n block_type & block() { return *m_block; }\\n\\n block_type const & block() const { return *m_block; }\\n\\n\\n\\n index_type index() const { return m_index; }\\n\\n void set_index(index_type index) { m_index = index; }\\n\\n\\n\\n bool operator==(HandType const & other) { return (m_block == other.m_block) && (m_index == other.m_index); }\\n\\n bool operator!=(HandType const & other) { return (m_block != other.m_block) || (m_index == other.m_index); }\\n\",\n \"file_path\": \"libmarch/include/march/mesh/UnstructuredBlock/hand.hpp\",\n \"rank\": 53,\n \"score\": 180581.35991629318\n },\n {\n \"content\": \" class FormatForComparison<CharType*, OtherOperand> { \\\\\\n\\n public: \\\\\\n\\n static ::std::string Format(CharType* value) { \\\\\\n\\n return ::testing::PrintToString(static_cast<const void*>(value)); \\\\\\n\\n } \\\\\\n\\n }\\n\\n\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(char);\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(const char);\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(wchar_t);\\n\\nGTEST_IMPL_FORMAT_C_STRING_AS_POINTER_(const wchar_t);\\n\\n\\n\\n#undef GTEST_IMPL_FORMAT_C_STRING_AS_POINTER_\\n\\n\\n\\n// If a C string is compared with an STL string object, we know it's meant\\n\\n// to point to a NUL-terminated string, and thus can print it as a string.\\n\\n\\n\\n#define GTEST_IMPL_FORMAT_C_STRING_AS_STRING_(CharType, OtherStringType) \\\\\\n\\n template <> \\\\\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 54,\n \"score\": 177967.2902887777\n },\n {\n \"content\": \"class UniversalTersePrinter<char*> {\\n\\n public:\\n\\n static void Print(char* str, ::std::ostream* os) {\\n\\n UniversalTersePrinter<const char*>::Print(str, os);\\n\\n }\\n\\n};\\n\\n\\n\\n#if GTEST_HAS_STD_WSTRING\\n\\ntemplate <>\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 55,\n \"score\": 171013.96285844286\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n#include <pybind11/pybind11.h>\\n\\n\\n\\n#include \\\"march/python/WrapBase.hpp\\\"\\n\\n#include \\\"march/python/wrapper_core.hpp\\\"\\n\\n#include \\\"march/python/wrapper_mesh.hpp\\\"\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/include/march/python/wrapper_march.hpp\",\n \"rank\": 56,\n \"score\": 167447.89759325483\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n#include <pybind11/pybind11.h>\\n\\n#define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION\\n\\n#include <numpy/arrayobject.h>\\n\\n\\n\\n#include <utility>\\n\\n#include <memory>\\n\\n#include <vector>\\n\\n#include <algorithm>\\n\\n#include <cstring>\\n\\n\\n\\n#include \\\"march.hpp\\\"\\n\\n#include \\\"march/python/wrapper_march.hpp\\\"\\n\\n\\n\\nnamespace march {\\n\\n\\n\",\n \"file_path\": \"libmarch/src/python/march.cpp\",\n \"rank\": 57,\n \"score\": 163821.0366078412\n },\n {\n \"content\": \"namespace python {\\n\\n\\n\\nPyObject * ModuleInitializer::initialize_march(pybind11::module & mod) {\\n\\n#if defined(Py_DEBUG)\\n\\n ::march::setup_debug();\\n\\n#endif // Py_DEBUG\\n\\n\\n\\n import_array1(nullptr); // or numpy c api segfault.\\n\\n\\n\\n mod.doc() = \\\"libmarch wrapper\\\";\\n\\n\\n\\n // section: core\\n\\n WrapBuffer::commit(mod, \\\"Buffer\\\", \\\"Internal data buffer\\\");\\n\\n WrapLookupTableCore::commit(mod, \\\"Table\\\", \\\"Lookup table that allows ghost entity.\\\");\\n\\n WrapVector<2>::commit(mod, \\\"Vector2D\\\", \\\"Cartesian vector (2D).\\\");\\n\\n WrapVector<3>::commit(mod, \\\"Vector3D\\\", \\\"Cartesian vector (3D).\\\");\\n\\n\\n\\n // section: mesh\\n\\n WrapBoundaryData::commit(mod, \\\"BoundaryData\\\", \\\"Data of a boundary condition.\\\");\\n\\n WrapUnstructuredBlock<2>::commit(mod, \\\"UnstructuredBlock2D\\\", \\\"Unstructured mesh block (2D).\\\");\\n\",\n \"file_path\": \"libmarch/src/python/march.cpp\",\n \"rank\": 58,\n \"score\": 163817.76959659482\n },\n {\n \"content\": \" WrapUnstructuredBlock<3>::commit(mod, \\\"UnstructuredBlock3D\\\", \\\"Unstructured mesh block (3D).\\\");\\n\\n WrapNodeHand<2>::commit(mod, \\\"NodeHand2D\\\", \\\"Hand to a node (2D).\\\");\\n\\n WrapNodeHand<3>::commit(mod, \\\"NodeHand3D\\\", \\\"Hand to a node (3D).\\\");\\n\\n WrapFaceHand<2>::commit(mod, \\\"FaceHand2D\\\", \\\"Hand to a face (2D).\\\");\\n\\n WrapFaceHand<3>::commit(mod, \\\"FaceHand3D\\\", \\\"Hand to a face (3D).\\\");\\n\\n WrapCellHand<2>::commit(mod, \\\"CellHand2D\\\", \\\"Hand to a cell (2D).\\\");\\n\\n WrapCellHand<3>::commit(mod, \\\"CellHand3D\\\", \\\"Hand to a cell (3D).\\\");\\n\\n WrapBasicCE<2>::commit(mod, \\\"BasicCE2D\\\", \\\"Basic conservation element (2D).\\\");\\n\\n WrapBasicCE<3>::commit(mod, \\\"BasicCE3D\\\", \\\"Basic conservation element (3D).\\\");\\n\\n WrapConservationElement<2>::commit(mod, \\\"ConservationElement2D\\\", \\\"Conservation element (2D).\\\");\\n\\n WrapConservationElement<3>::commit(mod, \\\"ConservationElement3D\\\", \\\"Conservation element (3D).\\\");\\n\\n\\n\\n return mod.ptr();\\n\\n}\\n\\n\\n\\n} /* end namespace python */\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\nPYBIND11_MODULE(libmarch, mod) {\\n\\n ::march::python::ModuleInitializer::get_instance().initialize(mod);\\n\\n}\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/src/python/march.cpp\",\n \"rank\": 59,\n \"score\": 163794.78222399004\n },\n {\n \"content\": \"class TestWithParam : public Test, public WithParamInterface<T> {\\n\\n};\\n\\n\\n\\n#endif // GTEST_HAS_PARAM_TEST\\n\\n\\n\\n// Macros for indicating success/failure in test code.\\n\\n\\n\\n// ADD_FAILURE unconditionally adds a failure to the current test.\\n\\n// SUCCEED generates a success - it doesn't automatically make the\\n\\n// current test successful, as a test is only successful when it has\\n\\n// no failure.\\n\\n//\\n\\n// EXPECT_* verifies that a certain condition is satisfied. If not,\\n\\n// it behaves like ADD_FAILURE. In particular:\\n\\n//\\n\\n// EXPECT_TRUE verifies that a Boolean condition is true.\\n\\n// EXPECT_FALSE verifies that a Boolean condition is false.\\n\\n//\\n\\n// FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except\\n\\n// that they will also abort the current function on failure. People\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 60,\n \"score\": 162026.0995064851\n },\n {\n \"content\": \"// The Mutex class can only be used for mutexes created at runtime. It\\n\\n// shares its API with MutexBase otherwise.\\n\\nclass Mutex : public MutexBase {\\n\\n public:\\n\\n Mutex() {\\n\\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_init(&mutex_, NULL));\\n\\n has_owner_ = false;\\n\\n }\\n\\n ~Mutex() {\\n\\n GTEST_CHECK_POSIX_SUCCESS_(pthread_mutex_destroy(&mutex_));\\n\\n }\\n\\n\\n\\n private:\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(Mutex);\\n\\n};\\n\\n\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 61,\n \"score\": 161847.83467165002\n },\n {\n \"content\": \" class RunnableImpl : public Runnable {\\n\\n public:\\n\\n RunnableImpl(UserThreadFunc* func, T param)\\n\\n : func_(func),\\n\\n param_(param) {\\n\\n }\\n\\n virtual ~RunnableImpl() {}\\n\\n virtual void Run() {\\n\\n func_(param_);\\n\\n }\\n\\n\\n\\n private:\\n\\n UserThreadFunc* const func_;\\n\\n const T param_;\\n\\n\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(RunnableImpl);\\n\\n };\\n\\n\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ThreadWithParam);\\n\\n};\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 62,\n \"score\": 161842.6626818435\n },\n {\n \"content\": \"struct CellType {\\n\\n\\n\\n static constexpr size_t NVALUE = 5;\\n\\n\\n\\n CellType(\\n\\n index_type const id_in\\n\\n , index_type const dim_in\\n\\n , index_type const nnode_in\\n\\n , index_type const nedge_in\\n\\n , index_type const nsurface_in\\n\\n ) : m_data{id_in, dim_in, nnode_in, nedge_in, nsurface_in} {}\\n\\n\\n\\n CellType() = default;\\n\\n\\n\\n index_type id () const { return m_data[0]; }\\n\\n index_type ndim () const { return m_data[1]; }\\n\\n index_type nnode () const { return m_data[2]; }\\n\\n index_type nedge () const { return m_data[3]; }\\n\\n index_type nsurface() const { return m_data[4]; }\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/mesh/CellType.hpp\",\n \"rank\": 63,\n \"score\": 160238.13734868704\n },\n {\n \"content\": \"class UniversalTersePrinter<const wchar_t*> {\\n\\n public:\\n\\n static void Print(const wchar_t* str, ::std::ostream* os) {\\n\\n if (str == NULL) {\\n\\n *os << \\\"NULL\\\";\\n\\n } else {\\n\\n UniversalPrint(::std::wstring(str), os);\\n\\n }\\n\\n }\\n\\n};\\n\\n#endif\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"libmarch/tests/gtest/gtest.h\",\n \"rank\": 64,\n \"score\": 159456.32983645902\n },\n {\n \"content\": \"/*\\n\\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n#include <pybind11/pybind11.h>\\n\\n\\n\\n#include \\\"march.hpp\\\"\\n\\n#include \\\"march/gas.hpp\\\"\\n\\n#include \\\"march/python/wrapper_gas.hpp\\\"\\n\\n\\n\\nnamespace march {\\n\\n\\n\\nnamespace python {\\n\\n\\n\\nPyObject * ModuleInitializer::initialize_march_gas(pybind11::module & marchmod) {\\n\\n auto gasmod = marchmod.def_submodule(\\\"gas\\\", \\\"Gas dynamic solver\\\");\\n\\n\\n\\n // section: solver and associated data\\n\\n WrapGasSolver<2>::commit(gasmod, \\\"Solver2D\\\", \\\"Gas-dynamics solver (2D).\\\");\\n\",\n \"file_path\": \"libmarch/src/python/march_gas.cpp\",\n \"rank\": 65,\n \"score\": 159352.30676443953\n },\n {\n \"content\": \" WrapGasTrimNonRefl<2>::commit(gasmod, \\\"TrimNonRefl2D\\\", \\\"Gas-dynamics non-reflective trim (2D).\\\");\\n\\n WrapGasTrimNonRefl<3>::commit(gasmod, \\\"TrimNonRefl3D\\\", \\\"Gas-dynamics non-reflective trim (3D).\\\");\\n\\n WrapGasTrimSlipWall<2>::commit(gasmod, \\\"TrimSlipWall2D\\\", \\\"Gas-dynamics slip wall trim (2D).\\\");\\n\\n WrapGasTrimSlipWall<3>::commit(gasmod, \\\"TrimSlipWall3D\\\", \\\"Gas-dynamics slip wall trim (3D).\\\");\\n\\n WrapGasTrimInlet<2>::commit(gasmod, \\\"TrimInlet2D\\\", \\\"Gas-dynamics inlet trim (2D).\\\");\\n\\n WrapGasTrimInlet<3>::commit(gasmod, \\\"TrimInlet3D\\\", \\\"Gas-dynamics inlet trim (3D).\\\");\\n\\n\\n\\n return gasmod.ptr();\\n\\n}\\n\\n\\n\\n} /* end namespace python */\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/src/python/march_gas.cpp\",\n \"rank\": 66,\n \"score\": 159331.1763804525\n },\n {\n \"content\": \" WrapGasSolver<3>::commit(gasmod, \\\"Solver3D\\\", \\\"Gas-dynamics solver (3D).\\\");\\n\\n WrapGasCommonAnchor::commit(gasmod, \\\"CommonAnchor\\\", \\\"Gas-dynamics multi-dimensional anchor.\\\");\\n\\n WrapGasAnchor<2>::commit(gasmod, \\\"Anchor2D\\\", \\\"Gas-dynamics anchor (2D).\\\");\\n\\n WrapGasAnchor<3>::commit(gasmod, \\\"Anchor3D\\\", \\\"Gas-dynamics anchor (3D).\\\");\\n\\n WrapGasAnchorChain<2>::commit(gasmod, \\\"AnchorChain2D\\\", \\\"Gas-dynamics sequential container for anchors (2D).\\\");\\n\\n WrapGasAnchorChain<3>::commit(gasmod, \\\"AnchorChain3D\\\", \\\"Gas-dynamics sequential container for anchors (3D).\\\");\\n\\n WrapGasParameter::commit(gasmod, \\\"Parameter\\\", \\\"Gas-dynamics solver parameters.\\\");\\n\\n WrapGasState::commit(gasmod, \\\"State\\\", \\\"Gas-dynamics solver states.\\\");\\n\\n WrapGasSolution<2>::commit(gasmod, \\\"Solution2D\\\", \\\"Gas-dynamics solution data (2D).\\\");\\n\\n WrapGasSolution<3>::commit(gasmod, \\\"Solution3D\\\", \\\"Gas-dynamics solution data (3D).\\\");\\n\\n WrapGasQuantity<2>::commit(gasmod, \\\"Quantity2D\\\", \\\"Gas-dynamics quantities (2D).\\\");\\n\\n WrapGasQuantity<3>::commit(gasmod, \\\"Quantity3D\\\", \\\"Gas-dynamics quantities (3D).\\\");\\n\\n\\n\\n // section: boundary-condition treatments\\n\\n WrapGasTrimBase<gas::TrimBase<2>, 2>::commit(gasmod, \\\"TrimBase2D\\\", \\\"Gas-dynamics trim base type (2D).\\\");\\n\\n WrapGasTrimBase<gas::TrimBase<3>, 3>::commit(gasmod, \\\"TrimBase3D\\\", \\\"Gas-dynamics trim base type (3D).\\\");\\n\\n WrapGasTrimInterface<2>::commit(gasmod, \\\"TrimInterface2D\\\", \\\"Gas-dynamics interface trim (2D).\\\");\\n\\n WrapGasTrimInterface<3>::commit(gasmod, \\\"TrimInterface3D\\\", \\\"Gas-dynamics interface trim (3D).\\\");\\n\\n WrapGasTrimNoOp<2>::commit(gasmod, \\\"TrimNoOp2D\\\", \\\"Gas-dynamics no-op trim (2D).\\\");\\n\\n WrapGasTrimNoOp<3>::commit(gasmod, \\\"TrimNoOp3D\\\", \\\"Gas-dynamics no-op trim (3D).\\\");\\n\",\n \"file_path\": \"libmarch/src/python/march_gas.cpp\",\n \"rank\": 67,\n \"score\": 159322.67505550434\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see LICENSE.txt\\n\\n */\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <memory>\\n\\n\\n\\nnamespace march\\n\\n{\\n\\n\\n\\n/**\\n\\n * Untyped and unresizeable memory buffer for data storage.\\n\\n */\\n\",\n \"file_path\": \"libmarch/include/march/core/Buffer.hpp\",\n \"rank\": 68,\n \"score\": 159162.63136559582\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n/**\\n\\n * \\\\file\\n\\n * Utilities.\\n\\n */\\n\\n\\n\\n#include <utility>\\n\\n#include <memory>\\n\\n\\n\\n#include <cstdio>\\n\\n#include <sstream>\\n\\n#include <iostream>\\n\\n#include <iomanip>\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/core/utility.hpp\",\n \"rank\": 69,\n \"score\": 159158.41472418632\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\n * Copyright (c) 2018, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n/**\\n\\n * \\\\file\\n\\n * Memory facilities.\\n\\n */\\n\\n\\n\\nnamespace march {\\n\\n\\n\\n/**\\n\\n * Mixin to help track the active instance count.\\n\\n */\\n\\ntemplate< class T >\\n\",\n \"file_path\": \"libmarch/include/march/core/memory.hpp\",\n \"rank\": 70,\n \"score\": 159156.02285743385\n },\n {\n \"content\": \"\\n\\nnamespace detail {\\n\\n\\n\\ninline static constexpr size_t log2(size_t n, int k = 0) { return (n <= 1) ? k : log2(n >> 1, k + 1); }\\n\\n\\n\\n} /* end namespace detail */\\n\\n\\n\\ntemplate<typename ElementType>\\n\\nvoid fill_sentinel(ElementType *arr, size_t nelem, ElementType sentinel) {\\n\\n std::fill(arr, arr + nelem, sentinel);\\n\\n}\\n\\n\\n\\ntemplate<typename ElementType>\\n\\nvoid fill_sentinel(ElementType *arr, size_t nelem) {\\n\\n if (true == std::is_floating_point<ElementType>::value) {\\n\\n fill_sentinel(arr, nelem, std::numeric_limits<ElementType>::quiet_NaN());\\n\\n } else if (true == std::is_arithmetic<ElementType>::value) {\\n\\n char * carr = reinterpret_cast<char *>(arr);\\n\\n fill_sentinel(carr, nelem*sizeof(ElementType), static_cast<char>(-1));\\n\\n } else {\\n\\n throw std::runtime_error(\\\"cannot fill sentinel for unsupported type\\\");\\n\\n }\\n\\n}\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/include/march/core/utility.hpp\",\n \"rank\": 71,\n \"score\": 159154.70384380504\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n#include <array>\\n\\n#include <string>\\n\\n\\n\\n#include \\\"march/core/types.hpp\\\"\\n\\n#include \\\"march/core/utility.hpp\\\"\\n\\n#include \\\"march/core/string.hpp\\\"\\n\\n\\n\\nnamespace march {\\n\\n\\n\\n#pragma GCC diagnostic push\\n\\n#ifndef __clang__\\n\\n#pragma GCC diagnostic ignored \\\"-Wmaybe-uninitialized\\\"\\n\\n#endif // __clang__\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 72,\n \"score\": 159152.18332767588\n },\n {\n \"content\": \"#if !defined(_MSC_VER) && !defined(__INTEL_COMPILER)\\n\\n# if __cplusplus >= 201402L\\n\\n# define MH_CPP14\\n\\n# endif\\n\\n#elif defined(_MSC_VER)\\n\\n# if _MSVC_LANG >= 201402L\\n\\n# define MH_CPP14\\n\\n# endif\\n\\n#endif\\n\\n\\n\\nnamespace march {\\n\\n\\n\\n#ifdef MH_CPP14\\n\\nusing std::make_unique;\\n\\n#else // MH_CPP14\\n\\ntemplate<typename T, typename... Args>\\n\\nstd::unique_ptr<T> make_unique(Args&&... args) {\\n\\n return std::unique_ptr<T>(new T(std::forward<Args>(args)...));\\n\\n}\\n\\n#endif // MH_CPP14\\n\",\n \"file_path\": \"libmarch/include/march/core/utility.hpp\",\n \"rank\": 73,\n \"score\": 159150.12373941034\n },\n {\n \"content\": \" Buffer(size_t length, const ctor_passkey &) : m_length(length) { m_data = new char[length](); }\\n\\n\\n\\n static std::shared_ptr<Buffer> construct(size_t length) {\\n\\n return std::make_shared<Buffer>(length, ctor_passkey());\\n\\n }\\n\\n\\n\\n ~Buffer() {\\n\\n if (nullptr != m_data) {\\n\\n delete[] m_data;\\n\\n m_data = nullptr;\\n\\n }\\n\\n }\\n\\n\\n\\n Buffer() = delete;\\n\\n\\n\\n Buffer(Buffer const & ) = delete;\\n\\n\\n\\n Buffer(Buffer &&) = delete;\\n\\n\\n\\n Buffer & operator=(Buffer const & ) = delete;\\n\",\n \"file_path\": \"libmarch/include/march/core/Buffer.hpp\",\n \"rank\": 74,\n \"score\": 159149.42237675545\n },\n {\n \"content\": \"\\n\\n Buffer & operator=(Buffer &&) = delete;\\n\\n\\n\\n explicit operator bool() const { return nullptr == m_data; }\\n\\n\\n\\n size_t nbyte() const { return m_length; }\\n\\n\\n\\n template< typename T >\\n\\n size_t length() const {\\n\\n size_t result = m_length / sizeof(T);\\n\\n if (result * sizeof(T) != m_length) {\\n\\n throw std::length_error(\\\"length not divisible\\\");\\n\\n }\\n\\n return result;\\n\\n }\\n\\n\\n\\n template< typename T, size_t LENGTH >\\n\\n T (& array() const) [LENGTH] {\\n\\n if (LENGTH * sizeof(T) != m_length) {\\n\\n throw std::length_error(\\\"array byte count mismatches buffer\\\");\\n\",\n \"file_path\": \"libmarch/include/march/core/Buffer.hpp\",\n \"rank\": 75,\n \"score\": 159147.40391029505\n },\n {\n \"content\": \" }\\n\\n return *reinterpret_cast<T(*)[LENGTH]>(data<T>());\\n\\n }\\n\\n\\n\\n /** Backdoor */\\n\\n template< typename T >\\n\\n T * data() const { return reinterpret_cast<T*>(m_data); }\\n\\n\\n\\n}; /* end class Buffer */\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/include/march/core/Buffer.hpp\",\n \"rank\": 76,\n \"score\": 159146.3538672961\n },\n {\n \"content\": \"\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator/(Vector<NDIM> lhs, real_type rhs) { lhs /= rhs; return lhs; }\\n\\n\\n\\ninline real_type cross(Vector<2> const & lhs, Vector<2> const & rhs) {\\n\\n return lhs[0]*rhs[1] - lhs[1]*rhs[0];\\n\\n}\\n\\n\\n\\ninline Vector<3> cross(Vector<3> const & lhs, Vector<3> const & rhs) {\\n\\n return Vector<3>(lhs[1]*rhs[2] - lhs[2]*rhs[1], lhs[2]*rhs[0] - lhs[0]*rhs[2], lhs[0]*rhs[1] - lhs[1]*rhs[0]);\\n\\n}\\n\\n\\n\\n#pragma GCC diagnostic pop\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 77,\n \"score\": 159143.64574366156\n },\n {\n \"content\": \" }\\n\\n Vector(real_type v0, real_type v1, real_type v2) : data{v0, v1, v2} {\\n\\n static_assert(3 == NDIM, \\\"only valid for 3 dimensional\\\");\\n\\n }\\n\\n Vector(const Vector & other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] = other.data[it]; }\\n\\n }\\n\\n Vector(const real_type (&other)[NDIM]) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] = other[it]; }\\n\\n }\\n\\n Vector(const real_type * other) { // I don't like this danger.\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] = other[it]; }\\n\\n }\\n\\n\\n\\n /* assignment operators */\\n\\n Vector & operator=(Vector const & other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] = other.data[it]; }\\n\\n return *this;\\n\\n }\\n\\n Vector & operator=(real_type const (&other)[NDIM]) {\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 78,\n \"score\": 159135.7699067491\n },\n {\n \"content\": \" }\\n\\n Vector & operator+=(real_type other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] += other; }\\n\\n return *this;\\n\\n }\\n\\n Vector & operator-=(Vector const & other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] -= other.data[it]; }\\n\\n return *this;\\n\\n }\\n\\n Vector & operator-=(real_type other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] -= other; }\\n\\n return *this;\\n\\n }\\n\\n Vector & operator*=(real_type other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] *= other; }\\n\\n return *this;\\n\\n }\\n\\n Vector & operator/=(real_type other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] /= other; }\\n\\n return *this;\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 79,\n \"score\": 159135.68443256494\n },\n {\n \"content\": \"\\n\\n/**\\n\\n * Cartesian vector in two or three dimensional space.\\n\\n */\\n\\ntemplate< size_t NDIM > struct Vector {\\n\\n\\n\\n static_assert(2 == NDIM || 3 == NDIM, \\\"not 2 or 3 dimensional\\\");\\n\\n\\n\\n typedef real_type value_type;\\n\\n typedef value_type & reference;\\n\\n typedef const value_type & const_reference;\\n\\n typedef size_t size_type;\\n\\n\\n\\n value_type data[NDIM];\\n\\n\\n\\n /* constructors */\\n\\n Vector() = default;\\n\\n Vector(real_type v) { for (size_t it=0; it<NDIM; ++it) { data[it] = v; } }\\n\\n Vector(real_type v0, real_type v1) : data{v0, v1} {\\n\\n static_assert(2 == NDIM, \\\"only valid for 2 dimensional\\\");\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 80,\n \"score\": 159135.4749128757\n },\n {\n \"content\": \" }\\n\\n return ret;\\n\\n}\\n\\n\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator+(Vector<NDIM> lhs, Vector<NDIM> const & rhs) { lhs += rhs; return lhs; }\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator+(Vector<NDIM> lhs, real_type rhs) { lhs += rhs; return lhs; }\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator+(real_type lhs, Vector<NDIM> rhs) { rhs += lhs; return rhs; }\\n\\n\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator-(Vector<NDIM> lhs, Vector<NDIM> const & rhs) { lhs -= rhs; return lhs; }\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator-(Vector<NDIM> lhs, real_type rhs) { lhs -= rhs; return lhs; }\\n\\n\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator*(Vector<NDIM> lhs, real_type rhs) { lhs *= rhs; return lhs; }\\n\\ntemplate< size_t NDIM >\\n\\nVector<NDIM> operator*(real_type lhs, Vector<NDIM> rhs) { rhs *= lhs; return rhs; }\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 81,\n \"score\": 159134.9192346858\n },\n {\n \"content\": \" return true;\\n\\n }\\n\\n\\n\\n /* accessors */\\n\\n constexpr size_type size() const { return NDIM; }\\n\\n reference operator[](size_type n) { return data[n]; }\\n\\n constexpr const_reference operator[](size_type n) const { return data[n]; }\\n\\n reference at(size_type n) {\\n\\n if (n < NDIM) { return data[n]; }\\n\\n else { throw std::out_of_range(string::format(\\\"Vector%ldD doesn't have %d-th element\\\", NDIM, n)); }\\n\\n }\\n\\n const_reference at(size_type n) const {\\n\\n if (n < NDIM) { return data[n]; }\\n\\n else { throw std::out_of_range(string::format(\\\"Vector%ldD doesn't have %d-th element\\\", NDIM, n)); }\\n\\n }\\n\\n\\n\\n /* arithmetic operators */\\n\\n Vector & operator+=(Vector const & other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] += other.data[it]; }\\n\\n return *this;\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 82,\n \"score\": 159134.58035694083\n },\n {\n \"content\": \" for (size_t it=0; it<NDIM; ++it) { data[it] = other[it]; }\\n\\n return *this;\\n\\n }\\n\\n Vector & operator=(real_type other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { data[it] = other; }\\n\\n return *this;\\n\\n }\\n\\n\\n\\n bool operator==(Vector const & other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { if (data[it] != other.data[it]) { return false; } }\\n\\n return true;\\n\\n }\\n\\n\\n\\n bool operator!=(Vector const & other) {\\n\\n for (size_t it=0; it<NDIM; ++it) { if (data[it] != other.data[it]) { return true; } }\\n\\n return false;\\n\\n }\\n\\n\\n\\n bool is_close_to(Vector const & other, real_type epsilon) {\\n\\n for (size_t it=0; it<NDIM; ++it) { if (std::abs(data[it] - other.data[it]) > epsilon) { return false; } }\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 83,\n \"score\": 159133.93817301097\n },\n {\n \"content\": \" }\\n\\n real_type dot(Vector const & rhs) const {\\n\\n if (3 == NDIM) { return this->data[0]*rhs.data[0] + this->data[1]*rhs.data[1] + this->data[2]*rhs.data[2]; }\\n\\n else { return this->data[0]*rhs.data[0] + this->data[1]*rhs.data[1]; }\\n\\n }\\n\\n real_type square() const {\\n\\n if (3 == NDIM) { return data[0]*data[0] + data[1]*data[1] + data[2]*data[2]; }\\n\\n else { return data[0]*data[0] + data[1]*data[1]; }\\n\\n }\\n\\n real_type length() const { return sqrt(square()); }\\n\\n\\n\\n std::string repr(size_t indent=0, size_t precision=0) const;\\n\\n\\n\\n}; /* end struct Vector */\\n\\n\\n\\ntemplate< size_t NDIM > std::string Vector<NDIM>::repr(size_t, size_t precision) const {\\n\\n std::string ret(NDIM == 3 ? \\\"Vector3D(\\\" : \\\"Vector2D(\\\");\\n\\n for (size_t it=0; it<NDIM; ++it) {\\n\\n ret += string::from_double(data[it], precision);\\n\\n ret += NDIM-1 == it ? \\\")\\\" : \\\",\\\";\\n\",\n \"file_path\": \"libmarch/include/march/core/Vector.hpp\",\n \"rank\": 84,\n \"score\": 159132.7513062051\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\n * Copyright (c) 2017, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n#include <pybind11/pybind11.h>\\n\\n\\n\\nPYBIND11_DECLARE_HOLDER_TYPE(T, std::unique_ptr<T>);\\n\\nPYBIND11_DECLARE_HOLDER_TYPE(T, std::shared_ptr<T>);\\n\\n\\n\\n#ifdef __GNUG__\\n\\n# define MARCH_PYTHON_WRAPPER_VISIBILITY __attribute__((visibility(\\\"hidden\\\")))\\n\\n#else\\n\\n# define MARCH_PYTHON_WRAPPER_VISIBILITY\\n\\n#endif\\n\\n\\n\\nnamespace march {\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/python/common.hpp\",\n \"rank\": 85,\n \"score\": 159055.17309650008\n },\n {\n \"content\": \"namespace python {\\n\\n\\n\\nnamespace py = pybind11;\\n\\n\\n\\n} /* end namespace python */\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/include/march/python/common.hpp\",\n \"rank\": 86,\n \"score\": 159050.20559797416\n },\n {\n \"content\": \"#pragma once\\n\\n\\n\\n/*\\n\\n * Copyright (c) 2016, Yung-Yu Chen <yyc@solvcon.net>\\n\\n * BSD 3-Clause License, see COPYING\\n\\n */\\n\\n\\n\\n/**\\n\\n * \\\\file\\n\\n * Basic typedefs and constants for libmarch.\\n\\n */\\n\\n\\n\\n#include <cstdint>\\n\\n#include <complex>\\n\\n#include <limits>\\n\\n\\n\\n#include \\\"march/core/utility.hpp\\\"\\n\\n\\n\\nnamespace march\\n\\n{\\n\\n\\n\\n/**\\n\\n * The enum is compatible to numpy NPY_TYPES.\\n\\n *\\n\\n * MH_LONG, MH_ULONG, MH_LONGDOUBLE, MH_CLONGDOUBLE aren't used.\\n\\n */\\n\",\n \"file_path\": \"libmarch/include/march/core/types.hpp\",\n \"rank\": 87,\n \"score\": 159002.43461430227\n },\n {\n \"content\": \"template <> struct id_to<MH_FLOAT> { typedef float type; };\\n\\ntemplate <> struct id_to<MH_DOUBLE> { typedef double type; };\\n\\ntemplate <> struct id_to<MH_CFLOAT> { typedef std::complex<float> type; };\\n\\ntemplate <> struct id_to<MH_CDOUBLE> { typedef std::complex<double> type; };\\n\\n\\n\\n/**\\n\\n * The primitive data type for lookup-table indices.\\n\\n */\\n\\ntypedef int32_t index_type;\\n\\nstatic constexpr index_type MH_INDEX_SENTINEL = INT32_MAX;\\n\\nstatic constexpr index_type INVALID_INDEX = MH_INDEX_SENTINEL;\\n\\n\\n\\n/**\\n\\n * The primitive data type for element shape type. May use only a single byte\\n\\n * but now take 4 bytes for legacy compatibility.\\n\\n */\\n\\ntypedef int32_t shape_type;\\n\\n\\n\\ntypedef double real_type;\\n\\n\\n\\nconstexpr static real_type MH_REAL_SENTINEL = -std::numeric_limits<real_type>::infinity();\\n\\n\\n\\n} /* end namespace march */\\n\\n\\n\\n// vim: set ff=unix fenc=utf8 nobomb et sw=4 ts=4:\\n\",\n \"file_path\": \"libmarch/include/march/core/types.hpp\",\n \"rank\": 88,\n \"score\": 158989.81174682803\n },\n {\n \"content\": \" return ret;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Convert type to ID.\\n\\n */\\n\\ntemplate <typename type, typename SFINAE = void> struct type_to { };\\n\\n\\n\\ntemplate <typename T> struct type_to<T, typename std::enable_if<std::is_integral<T>::value>::type> {\\n\\nprivate:\\n\\n constexpr static DataTypeId ids[8] = {\\n\\n MH_INT8, MH_UINT8, MH_INT16, MH_UINT16,\\n\\n MH_INT32, MH_UINT32, MH_INT64, MH_UINT64\\n\\n };\\n\\npublic:\\n\\n constexpr static DataTypeId id = ids[detail::log2(sizeof(T)) * 2 + (std::is_unsigned<T>::value ? 1 : 0)];\\n\\n};\\n\\n\\n\\n#define MARCH_DECL_TYPEID(Type, ID) \\\\\\n\\n template <> struct type_to<Type> { constexpr static DataTypeId id = ID; };\\n\",\n \"file_path\": \"libmarch/include/march/core/types.hpp\",\n \"rank\": 89,\n \"score\": 158985.15979943852\n },\n {\n \"content\": \"MARCH_DECL_TYPEID(bool, MH_BOOL)\\n\\nMARCH_DECL_TYPEID(float, MH_FLOAT)\\n\\nMARCH_DECL_TYPEID(double, MH_DOUBLE)\\n\\nMARCH_DECL_TYPEID(std::complex<float>, MH_CFLOAT)\\n\\nMARCH_DECL_TYPEID(std::complex<double>, MH_CDOUBLE)\\n\\n#undef MARCH_DECL_TYPEID\\n\\n\\n\\n/**\\n\\n * Convert ID to type.\\n\\n */\\n\\ntemplate <int ID> struct id_to { };\\n\\ntemplate <> struct id_to<MH_BOOL> { typedef bool type; };\\n\\ntemplate <> struct id_to<MH_INT8> { typedef int8_t type; };\\n\\ntemplate <> struct id_to<MH_UINT8> { typedef uint8_t type; };\\n\\ntemplate <> struct id_to<MH_INT16> { typedef int16_t type; };\\n\\ntemplate <> struct id_to<MH_UINT16> { typedef uint16_t type; };\\n\\ntemplate <> struct id_to<MH_INT32> { typedef int32_t type; };\\n\\ntemplate <> struct id_to<MH_UINT32> { typedef uint32_t type; };\\n\\ntemplate <> struct id_to<MH_INT64> { typedef int64_t type; };\\n\\ntemplate <> struct id_to<MH_UINT64> { typedef uint64_t type; };\\n\",\n \"file_path\": \"libmarch/include/march/core/types.hpp\",\n \"rank\": 90,\n \"score\": 158982.1406521851\n },\n {\n \"content\": \"class\\n\\nMARCH_PYTHON_WRAPPER_VISIBILITY\\n\\nWrapBoundaryData\\n\\n : public WrapBase< WrapBoundaryData, BoundaryData >\\n\\n{\\n\\n\\n\\n friend base_type;\\n\\n\\n\\n WrapBoundaryData(pybind11::module & mod, const char * pyname, const char * clsdoc)\\n\\n : base_type(mod, pyname, clsdoc)\\n\\n {\\n\\n namespace py = pybind11;\\n\\n (*this)\\n\\n .def(\\n\\n py::init([] (index_type nvalue, const std::string & name) {\\n\\n return make_unique<BoundaryData>(nvalue, name);\\n\\n }),\\n\\n py::arg(\\\"nvalue\\\"), py::arg(\\\"name\\\")=\\\"None\\\"\\n\\n )\\n\\n .def_property_readonly_static(\\\"BFREL\\\", [](py::object const & /* self */) { return BoundaryData::BFREL; })\\n\",\n \"file_path\": \"libmarch/include/march/python/wrapper_mesh.hpp\",\n \"rank\": 97,\n \"score\": 55.72222230413941\n },\n {\n \"content\": \"\\n\\n WrapGasQuantity(pybind11::module & mod, const char * pyname, const char * clsdoc)\\n\\n : base_type(mod, pyname, clsdoc)\\n\\n {\\n\\n namespace py = pybind11;\\n\\n\\n\\n#define DECL_MARCH_PYBIND_GAS_QUANTITY_REAL(NAME) \\\\\\n\\n .def_property( \\\\\\n\\n #NAME, \\\\\\n\\n [](wrapped_type const & self ) { return self.NAME(); }, \\\\\\n\\n [](wrapped_type & self, real_type val) { return self.NAME() = val; } \\\\\\n\\n )\\n\\n// FIXME: change the properties to be like those of Solution\\n\\n#define DECL_MARCH_PYBIND_GAS_QUANTITY_ARRAY(NAME, ARR) \\\\\\n\\n .def_property( \\\\\\n\\n #NAME, \\\\\\n\\n [](wrapped_type & qty) { return Table(qty.NAME()).ARR(); }, \\\\\\n\\n [](wrapped_type & qty, py::array src) { Table::CopyInto(Table(qty.NAME()).ARR(), src); }, \\\\\\n\\n #NAME \\\" \\\" #ARR \\\" array\\\")\\n\\n\\n\",\n \"file_path\": \"libmarch/include/march/python/wrapper_gas.hpp\",\n \"rank\": 98,\n \"score\": 53.77865210371527\n },\n {\n \"content\": \"\\n\\n friend base_type;\\n\\n\\n\\n WrapBlockHand(pybind11::module & mod, const char * pyname, const char * clsdoc)\\n\\n : base_type(mod, pyname, clsdoc)\\n\\n {\\n\\n namespace py = pybind11;\\n\\n (*this)\\n\\n .def(\\n\\n py::init([](block_type & block, index_type index) {\\n\\n return wrapped_type(block, index);\\n\\n }),\\n\\n py::arg(\\\"block\\\"), py::arg(\\\"index\\\")\\n\\n )\\n\\n .def(\\\"repr\\\", &wrapped_type::repr, py::arg(\\\"indent\\\")=0, py::arg(\\\"precision\\\")=0)\\n\\n .def(\\\"__repr__\\\", [](wrapped_type & self){ return self.repr(); })\\n\\n .def(\\\"__eq__\\\", &wrapped_type::operator==)\\n\\n .def(\\n\\n \\\"__hash__\\\",\\n\\n [](wrapped_type const & self) {\\n\",\n \"file_path\": \"libmarch/include/march/python/wrapper_mesh.hpp\",\n \"rank\": 99,\n \"score\": 52.646649145389404\n }\n]","isConversational":false}}},{"rowIdx":477,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"cpp/mindalpha/dense_tensor.cpp"},"repo_name":{"kind":"string","value":"mindalpha/MindAlpha"},"commit":{"kind":"string","value":"5b6fe017a37238884a6e963fd6b0a1492938e186"},"file_code":{"kind":"string","value":"\n\n#include <string.h>\n#include <json11.hpp>\n#include <mindalpha/dense_tensor.h>\n#include <mindalpha/file_utils.h>\n#include <mindalpha/tensor_utils.h>\n\nnamespace mindalpha\n{\n\nvoid DenseTensor::Init(std::function<void()> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DenseInit\" },\n { \"meta\", GetMeta() },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [cb](PSMessage req, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::Dispose(std::function<void()> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DenseDispose\" },\n { \"name\", GetMeta().GetName() },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [cb](PSMessage req, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::Push(SmartArray<uint8_t> in, std::function<void()> cb, bool is_value, bool is_state)\n{\n const size_t name_hash = GetMeta().GetNameHash();\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t slice_items = SliceElements(is_state ? GetMeta().GetStateShape() : GetMeta().GetDataShape());\n const size_t slice_length = item_size * slice_items;\n const int num_parts = GetMeta().GetPartitionCount();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePush\" },\n { \"name\", GetMeta().GetName() },\n { \"is_value\", is_value },\n { \"is_state\", is_state },\n };\n std::string command = json.dump();\n std::vector<PSMessage> reqs;\n reqs.reserve(num_parts);\n for (int k = 0; k < num_parts; k++)\n {\n PSMessage req = std::make_shared<Message>();\n req->GetMessageMeta().SetReceiver(ServerRankToNodeId(k));\n req->GetMessageMeta().SetBody(command);\n size_t begin = 0;\n size_t end = 0;\n GetMeta().ComputePartitionShapesWithHash(name_hash, k, begin, end, nullptr, nullptr);\n begin *= slice_length;\n end *= slice_length;\n SmartArray<uint8_t> k_in = in.Slice(begin, end);\n req->AddTypedSlice(k_in, GetMeta().GetDataType());\n reqs.push_back(req);\n }\n agent_->SendAllRequests(std::move(reqs), [cb](std::vector<PSMessage> reqs, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::Pull(std::function<void(SmartArray<uint8_t> out)> cb, bool is_state)\n{\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePull\" },\n { \"name\", GetMeta().GetName() },\n { \"is_state\", is_state },\n };\n PSMessage req = std::make_shared<Message>();\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [this, cb, is_state](PSMessage req, std::vector<PSMessage> ress) {\n const size_t name_hash = GetMeta().GetNameHash();\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t slice_items = SliceElements(is_state ? GetMeta().GetStateShape() : GetMeta().GetDataShape());\n const size_t slice_length = item_size * slice_items;\n const size_t total_items = TotalElements(is_state ? GetMeta().GetStateShape() : GetMeta().GetDataShape());\n const size_t total_length = item_size * total_items;\n const int num_parts = GetMeta().GetPartitionCount();\n SmartArray<uint8_t> out(total_length);\n for (int k = 0; k < num_parts; k++)\n {\n PSMessage res = ress.at(k);\n SmartArray<uint8_t> k_out = res->GetTypedSlice(0, GetMeta().GetDataType());\n const int sender = res->GetMessageMeta().GetSender();\n const int rank = NodeIdToRank(sender);\n size_t begin = 0;\n size_t end = 0;\n GetMeta().ComputePartitionShapesWithHash(name_hash, rank, begin, end, nullptr, nullptr);\n begin *= slice_length;\n end *= slice_length;\n memcpy(out.data() + begin, k_out.data(), end - begin);\n }\n cb(out);\n });\n}\n\nvoid DenseTensor::PushMeta(const DenseTensorMeta& meta, std::function<void()> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePushMeta\" },\n { \"name\", GetMeta().GetName() },\n { \"meta\", meta },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [cb](PSMessage req, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::PullMeta(std::function<void (DenseTensorMeta meta)> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePullMeta\" },\n { \"name\", GetMeta().GetName() },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [this, cb](PSMessage req, std::vector<PSMessage> ress) {\n for (size_t k = 0; k < ress.size(); k++)\n {\n const std::string& body1 = ress.at(0)->GetMessageMeta().GetBody();\n const std::string& body2 = ress.at(k)->GetMessageMeta().GetBody();\n if (body1 != body2)\n {\n const int nodeId1 = ress.at(0)->GetMessageMeta().GetSender();\n const int nodeId2 = ress.at(k)->GetMessageMeta().GetSender();\n std::string serr;\n serr.append(\"Meta of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' on node \");\n serr.append(NodeIdToString(nodeId1));\n serr.append(\" and \");\n serr.append(NodeIdToString(nodeId2));\n serr.append(\" mismatch.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n }\n const std::string& body = ress.at(0)->GetMessageMeta().GetBody();\n DenseTensorMeta meta = DenseTensorMeta::FromJsonString(body);\n cb(std::move(meta));\n });\n}\n\nvoid DenseTensor::Load(const std::string& dir_path, std::function<void()> cb, bool keep_meta)\n{\n std::string meta_path = GetDenseMetaPath(dir_path);\n std::string str = StreamReadAll(meta_path);\n DenseTensorMeta meta = DenseTensorMeta::FromJsonString(str);\n if (!meta.IsCompatible(meta_))\n {\n std::string serr;\n serr.append(\"Incompatible meta detected in '\");\n serr.append(meta_path);\n serr.append(\"', can not load dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n auto push_data_and_state = [this, dir_path, cb] {\n \n \n if (agent_->GetAgentRank() != 0)\n {\n cb();\n return;\n }\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t total_items = TotalElements(GetMeta().GetDataShape());\n const size_t total_length = item_size * total_items;\n SmartArray<uint8_t> data(total_length);\n std::string data_path = GetDenseDataPath(dir_path);\n if (!data.empty() && LoadAsSArray(data_path, &data) < 0)\n {\n std::string serr;\n serr.append(\"Fail to load data file of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' from '\");\n serr.append(data_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n Push(data, [this, dir_path, cb] {\n if (GetMeta().GetStateShape().empty())\n {\n cb();\n return;\n }\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t total_items = TotalElements(GetMeta().GetStateShape());\n const size_t total_length = item_size * total_items;\n SmartArray<uint8_t> state(total_length);\n std::string state_path = GetDenseStatePath(dir_path);\n if (!state.empty() && LoadAsSArray(state_path, &state) < 0)\n {\n std::string serr;\n serr.append(\"Fail to load state file of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' from '\");\n serr.append(state_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n Push(state, [cb] {\n cb();\n }, false, true);\n }, true, false);\n };\n if (!keep_meta)\n {\n GetMeta().SetInitializerByData(meta.GetInitializerAsData());\n GetMeta().SetUpdaterByData(meta.GetUpdaterAsData());\n }\n if (keep_meta || agent_->GetAgentRank() != 0)\n push_data_and_state();\n else\n {\n meta.SetName(GetMeta().GetName());\n meta.SetPartitionCount(agent_->GetServerCount());\n PushMeta(meta, push_data_and_state);\n }\n}\n\nvoid DenseTensor::Save(const std::string& dir_path, std::function<void()> cb)\n{\n PullMeta([this, dir_path, cb](DenseTensorMeta meta) {\n std::string meta_path = GetDenseMetaPath(dir_path);\n std::string str = meta.ToJsonString();\n EnsureLocalDirectory(dir_path);\n StreamWriteAll(meta_path, str);\n Pull([this, dir_path, cb](SmartArray<uint8_t> data) {\n std::string data_path = GetDenseDataPath(dir_path);\n if (!data.empty() && SaveAsSArray(data_path, data) < 0)\n {\n std::string serr;\n serr.append(\"Fail to save data file of dense tensor \");\n serr.append(GetMeta().GetName());\n serr.append(\"' to '\");\n serr.append(data_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n Pull([this, dir_path, cb](SmartArray<uint8_t> state) {\n std::string state_path = GetDenseStatePath(dir_path);\n if (!state.empty() && SaveAsSArray(state_path, state) < 0)\n {\n std::string serr;\n serr.append(\"Fail to save state file of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' to '\");\n serr.append(state_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n cb();\n }, true);\n }, false);\n });\n}\n\nstd::string DenseTensor::GetDenseMetaPath(const std::string& dir_path) const\n{\n std::string file_name = fmt::format(\"{}__dense_meta.json\", GetMeta().GetName());\n std::string file_path = JoinPath(dir_path, file_name);\n return file_path;\n}\n\nstd::string DenseTensor::GetDenseDataPath(const std::string& dir_path) const\n{\n std::string file_name = fmt::format(\"{}__dense_data.dat\", GetMeta().GetName());\n std::string file_path = JoinPath(dir_path, file_name);\n return file_path;\n}\n\nstd::string DenseTensor::GetDenseStatePath(const std::string& dir_path) const\n{\n std::string file_name = fmt::format(\"{}__dense_state.dat\", GetMeta().GetName());\n std::string file_path = JoinPath(dir_path, file_name);\n return file_path;\n}\n\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <string.h>\n#include <json11.hpp>\n#include <mindalpha/dense_tensor.h>\n#include <mindalpha/file_utils.h>\n#include <mindalpha/tensor_utils.h>\n\nnamespace mindalpha\n{\n\nvoid DenseTensor::Init(std::function<void()> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DenseInit\" },\n { \"meta\", GetMeta() },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [cb](PSMessage req, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::Dispose(std::function<void()> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DenseDispose\" },\n { \"name\", GetMeta().GetName() },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [cb](PSMessage req, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::Push(SmartArray<uint8_t> in, std::function<void()> cb, bool is_value, bool is_state)\n{\n const size_t name_hash = GetMeta().GetNameHash();\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t slice_items = SliceElements(is_state ? GetMeta().GetStateShape() : GetMeta().GetDataShape());\n const size_t slice_length = item_size * slice_items;\n const int num_parts = GetMeta().GetPartitionCount();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePush\" },\n { \"name\", GetMeta().GetName() },\n { \"is_value\", is_value },\n { \"is_state\", is_state },\n };\n std::string command = json.dump();\n std::vector<PSMessage> reqs;\n reqs.reserve(num_parts);\n for (int k = 0; k < num_parts; k++)\n {\n PSMessage req = std::make_shared<Message>();\n req->GetMessageMeta().SetReceiver(ServerRankToNodeId(k));\n req->GetMessageMeta().SetBody(command);\n size_t begin = 0;\n size_t end = 0;\n GetMeta().ComputePartitionShapesWithHash(name_hash, k, begin, end, nullptr, nullptr);\n begin *= slice_length;\n end *= slice_length;\n SmartArray<uint8_t> k_in = in.Slice(begin, end);\n req->AddTypedSlice(k_in, GetMeta().GetDataType());\n reqs.push_back(req);\n }\n agent_->SendAllRequests(std::move(reqs), [cb](std::vector<PSMessage> reqs, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::Pull(std::function<void(SmartArray<uint8_t> out)> cb, bool is_state)\n{\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePull\" },\n { \"name\", GetMeta().GetName() },\n { \"is_state\", is_state },\n };\n PSMessage req = std::make_shared<Message>();\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [this, cb, is_state](PSMessage req, std::vector<PSMessage> ress) {\n const size_t name_hash = GetMeta().GetNameHash();\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t slice_items = SliceElements(is_state ? GetMeta().GetStateShape() : GetMeta().GetDataShape());\n const size_t slice_length = item_size * slice_items;\n const size_t total_items = TotalElements(is_state ? GetMeta().GetStateShape() : GetMeta().GetDataShape());\n const size_t total_length = item_size * total_items;\n const int num_parts = GetMeta().GetPartitionCount();\n SmartArray<uint8_t> out(total_length);\n for (int k = 0; k < num_parts; k++)\n {\n PSMessage res = ress.at(k);\n SmartArray<uint8_t> k_out = res->GetTypedSlice(0, GetMeta().GetDataType());\n const int sender = res->GetMessageMeta().GetSender();\n const int rank = NodeIdToRank(sender);\n size_t begin = 0;\n size_t end = 0;\n GetMeta().ComputePartitionShapesWithHash(name_hash, rank, begin, end, nullptr, nullptr);\n begin *= slice_length;\n end *= slice_length;\n memcpy(out.data() + begin, k_out.data(), end - begin);\n }\n cb(out);\n });\n}\n\nvoid DenseTensor::PushMeta(const DenseTensorMeta& meta, std::function<void()> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePushMeta\" },\n { \"name\", GetMeta().GetName() },\n { \"meta\", meta },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [cb](PSMessage req, std::vector<PSMessage> ress) {\n cb();\n });\n}\n\nvoid DenseTensor::PullMeta(std::function<void (DenseTensorMeta meta)> cb)\n{\n PSMessage req = std::make_shared<Message>();\n json11::Json json = json11::Json::object\n {\n { \"command\", \"DensePullMeta\" },\n { \"name\", GetMeta().GetName() },\n };\n req->GetMessageMeta().SetReceiver(ServerGroup);\n req->GetMessageMeta().SetBody(json.dump());\n agent_->BroadcastRequest(req, [this, cb](PSMessage req, std::vector<PSMessage> ress) {\n for (size_t k = 0; k < ress.size(); k++)\n {\n const std::string& body1 = ress.at(0)->GetMessageMeta().GetBody();\n const std::string& body2 = ress.at(k)->GetMessageMeta().GetBody();\n if (body1 != body2)\n {\n const int nodeId1 = ress.at(0)->GetMessageMeta().GetSender();\n const int nodeId2 = ress.at(k)->GetMessageMeta().GetSender();\n std::string serr;\n serr.append(\"Meta of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' on node \");\n serr.append(NodeIdToString(nodeId1));\n serr.append(\" and \");\n serr.append(NodeIdToString(nodeId2));\n serr.append(\" mismatch.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n }\n const std::string& body = ress.at(0)->GetMessageMeta().GetBody();\n DenseTensorMeta meta = DenseTensorMeta::FromJsonString(body);\n cb(std::move(meta));\n });\n}\n\nvoid DenseTensor::Load(const std::string& dir_path, std::function<void()> cb, bool keep_meta)\n{\n std::string meta_path = GetDenseMetaPath(dir_path);\n std::string str = StreamReadAll(meta_path);\n DenseTensorMeta meta = DenseTensorMeta::FromJsonString(str);\n if (!meta.IsCompatible(meta_))\n {\n std::string serr;\n serr.append(\"Incompatible meta detected in '\");\n serr.append(meta_path);\n serr.append(\"', can not load dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n auto push_data_and_state = [this, dir_path, cb] {\n \n \n if (agent_->GetAgentRank() != 0)\n {\n cb();\n return;\n }\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t total_items = TotalElements(GetMeta().GetDataShape());\n const size_t total_length = item_size * total_items;\n SmartArray<uint8_t> data(total_length);\n std::string data_path = GetDenseDataPath(dir_path);\n if (!data.empty() && LoadAsSArray(data_path, &data) < 0)\n {\n std::string serr;\n serr.append(\"Fail to load data file of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' from '\");\n serr.append(data_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n Push(data, [this, dir_path, cb] {\n if (GetMeta().GetStateShape().empty())\n {\n cb();\n return;\n }\n const size_t item_size = DataTypeToSize(GetMeta().GetDataType());\n const size_t total_items = TotalElements(GetMeta().GetStateShape());\n const size_t total_length = item_size * total_items;\n SmartArray<uint8_t> state(total_length);\n std::string state_path = GetDenseStatePath(dir_path);\n if (!state.empty() && LoadAsSArray(state_path, &state) < 0)\n {\n std::string serr;\n serr.append(\"Fail to load state file of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' from '\");\n serr.append(state_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n Push(state, [cb] {\n cb();\n }, false, true);\n }, true, false);\n };\n if (!keep_meta)\n {\n GetMeta().SetInitializerByData(meta.GetInitializerAsData());\n GetMeta().SetUpdaterByData(meta.GetUpdaterAsData());\n }\n "},"suffix":{"kind":"string","value":"\n}\n\nvoid DenseTensor::Save(const std::string& dir_path, std::function<void()> cb)\n{\n PullMeta([this, dir_path, cb](DenseTensorMeta meta) {\n std::string meta_path = GetDenseMetaPath(dir_path);\n std::string str = meta.ToJsonString();\n EnsureLocalDirectory(dir_path);\n StreamWriteAll(meta_path, str);\n Pull([this, dir_path, cb](SmartArray<uint8_t> data) {\n std::string data_path = GetDenseDataPath(dir_path);\n if (!data.empty() && SaveAsSArray(data_path, data) < 0)\n {\n std::string serr;\n serr.append(\"Fail to save data file of dense tensor \");\n serr.append(GetMeta().GetName());\n serr.append(\"' to '\");\n serr.append(data_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n Pull([this, dir_path, cb](SmartArray<uint8_t> state) {\n std::string state_path = GetDenseStatePath(dir_path);\n if (!state.empty() && SaveAsSArray(state_path, state) < 0)\n {\n std::string serr;\n serr.append(\"Fail to save state file of dense tensor '\");\n serr.append(GetMeta().GetName());\n serr.append(\"' to '\");\n serr.append(state_path);\n serr.append(\"'.\\n\\n\");\n serr.append(GetStackTrace());\n spdlog::error(serr);\n throw std::runtime_error(serr);\n }\n cb();\n }, true);\n }, false);\n });\n}\n\nstd::string DenseTensor::GetDenseMetaPath(const std::string& dir_path) const\n{\n std::string file_name = fmt::format(\"{}__dense_meta.json\", GetMeta().GetName());\n std::string file_path = JoinPath(dir_path, file_name);\n return file_path;\n}\n\nstd::string DenseTensor::GetDenseDataPath(const std::string& dir_path) const\n{\n std::string file_name = fmt::format(\"{}__dense_data.dat\", GetMeta().GetName());\n std::string file_path = JoinPath(dir_path, file_name);\n return file_path;\n}\n\nstd::string DenseTensor::GetDenseStatePath(const std::string& dir_path) const\n{\n std::string file_name = fmt::format(\"{}__dense_state.dat\", GetMeta().GetName());\n std::string file_path = JoinPath(dir_path, file_name);\n return file_path;\n}\n\n}\n"},"middle":{"kind":"string","value":"if (keep_meta || agent_->GetAgentRank() != 0)\n push_data_and_state();\n else\n {\n meta.SetName(GetMeta().GetName());\n meta.SetPartitionCount(agent_->GetServerCount());\n PushMeta(meta, push_data_and_state);\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"class DenseTensorMeta\n\n{\n\npublic:\n\n const std::string& GetName() const { return name_; }\n\n void SetName(std::string value) { name_ = std::move(value); }\n\n\n\n DataType GetDataType() const { return data_type_; }\n\n void SetDataType(DataType value) { data_type_ = value; }\n\n\n\n const std::vector<size_t>& GetDataShape() const { return data_shape_; }\n\n void SetDataShape(std::vector<size_t> value) { data_shape_ = std::move(value); }\n\n\n\n const std::vector<size_t>& GetStateShape() const { return state_shape_; }\n\n void SetStateShape(std::vector<size_t> value) { state_shape_ = std::move(value); }\n\n\n\n DenseInitializer GetInitializer() const { return initializer_; }\n\n void SetInitializer(DenseInitializer value) { initializer_ = std::move(value); }\n\n\n\n DenseUpdater GetUpdater() const { return updater_; }\n\n void SetUpdater(DenseUpdater value) { updater_ = std::move(value); }\n","file_path":"cpp/mindalpha/dense_tensor_meta.h","rank":0,"score":137043.0683102511},{"content":"namespace mindalpha\n\n{\n\n\n\n//\n\n// Use the X Macro technique to simplify code. See the following page\n\n// for more information about X Macros:\n\n//\n\n// https://en.wikipedia.org/wiki/X_Macro\n\n//\n\n\n\n#define MINDALPHA_NODE_CONTROL_COMMANDS(X) \\\n\n X(Terminate) \\\n\n X(AddNode) \\\n\n X(Barrier) \\\n\n /**/\n\n\n\nenum class NodeControlCommand\n\n{\n\n#undef MINDALPHA_NODE_CONTROL_COMMAND_DEF\n\n#define MINDALPHA_NODE_CONTROL_COMMAND_DEF(n) n,\n\n MINDALPHA_NODE_CONTROL_COMMANDS(MINDALPHA_NODE_CONTROL_COMMAND_DEF)\n\n};\n\n\n\n// A missing ``NodeControlCommand`` is represented by ``NodeControlCommand(-1)``.\n\nconstexpr NodeControlCommand NullNodeControlCommand = static_cast<NodeControlCommand>(-1);\n\nconstexpr const char* NullNodeControlCommandString = \"null\";\n\n\n\n// Functions to convert ``NodeControlCommand`` to and from strings.\n\nstd::string NodeControlCommandToString(NodeControlCommand command);\n\nNodeControlCommand NodeControlCommandFromString(const std::string& str);\n\n\n\nstd::string NullableNodeControlCommandToString(NodeControlCommand command);\n\nNodeControlCommand NullableNodeControlCommandFromString(const std::string& str);\n\n\n","file_path":"cpp/mindalpha/node_control_command.h","rank":1,"score":120981.43064771511},{"content":" def name(self):\n","file_path":"python/mindalpha/distributed_tensor.py","rank":2,"score":119853.9328093584},{"content":"class SparseTensorMeta\n\n{\n\npublic:\n\n const std::string& GetName() const { return name_; }\n\n void SetName(std::string value) { name_ = std::move(value); }\n\n\n\n DataType GetDataType() const { return data_type_; }\n\n void SetDataType(DataType value) { data_type_ = value; }\n\n\n\n const std::vector<size_t>& GetSliceDataShape() const { return slice_data_shape_; }\n\n void SetSliceDataShape(std::vector<size_t> value) { slice_data_shape_ = std::move(value); }\n\n\n\n const std::vector<size_t>& GetSliceStateShape() const { return slice_state_shape_; }\n\n void SetSliceStateShape(std::vector<size_t> value) { slice_state_shape_ = std::move(value); }\n\n\n\n SparseInitializer GetInitializer() const { return initializer_; }\n\n void SetInitializer(SparseInitializer value) { initializer_ = std::move(value); }\n\n\n\n SparseUpdater GetUpdater() const { return updater_; }\n\n void SetUpdater(SparseUpdater value) { updater_ = std::move(value); }\n","file_path":"cpp/mindalpha/sparse_tensor_meta.h","rank":3,"score":108505.23685784862},{"content":"#include <vector>\n\n#include <functional>\n\n#include <any>\n\n#include <json11.hpp>\n\n#include <mindalpha/data_type.h>\n\n#include <mindalpha/smart_array.h>\n\n#include <mindalpha/string_utils.h>\n\n\n\nnamespace mindalpha\n\n{\n\n\n\nusing DenseInitializer = std::function<void(const std::string& name,\n\n SmartArray<uint8_t> data,\n\n const class DenseTensorMeta& meta)>;\n\n\n\nusing DenseUpdater = std::function<void(const std::string& name,\n\n SmartArray<uint8_t> param,\n\n SmartArray<uint8_t> grad,\n\n SmartArray<uint8_t> state,\n\n const class DenseTensorMeta& meta)>;\n\n\n","file_path":"cpp/mindalpha/dense_tensor_meta.h","rank":4,"score":94261.35003564467},{"content":" std::string GetUpdaterAsData() const;\n\n\n\n std::string ToString() const;\n\n std::string ToJsonString() const;\n\n json11::Json to_json() const;\n\n\n\n static DenseTensorMeta FromJsonString(const std::string& str);\n\n static DenseTensorMeta FromJson(json11::Json json);\n\n\n\n bool IsCompatible(const DenseTensorMeta& rhs) const;\n\n\n\n bool operator==(const DenseTensorMeta& rhs) const;\n\n bool operator!=(const DenseTensorMeta& rhs) const { return !(*this == rhs); }\n\n\n\nprivate:\n\n std::string name_;\n\n DataType data_type_ = NullDataType;\n\n std::vector<size_t> data_shape_;\n\n std::vector<size_t> state_shape_;\n\n DenseInitializer initializer_;\n\n DenseUpdater updater_;\n\n std::any initializer_object_;\n\n std::any updater_object_;\n\n int partition_count_ = -1;\n\n};\n\n\n\n}\n","file_path":"cpp/mindalpha/dense_tensor_meta.h","rank":5,"score":94258.89443701657},{"content":" std::string ToJsonString() const;\n\n json11::Json to_json() const;\n\n\n\n static SparseTensorMeta FromJsonString(const std::string& str);\n\n static SparseTensorMeta FromJson(json11::Json json);\n\n\n\n bool IsCompatible(const SparseTensorMeta& rhs) const;\n\n bool IsCompatibleRelaxed(const SparseTensorMeta& rhs, bool data_only) const;\n\n\n\n bool operator==(const SparseTensorMeta& rhs) const;\n\n bool operator!=(const SparseTensorMeta& rhs) const { return !(*this == rhs); }\n\n\n\nprivate:\n\n std::string name_;\n\n DataType data_type_ = NullDataType;\n\n std::vector<size_t> slice_data_shape_;\n\n std::vector<size_t> slice_state_shape_;\n\n SparseInitializer initializer_;\n\n SparseUpdater updater_;\n\n std::any initializer_object_;\n","file_path":"cpp/mindalpha/sparse_tensor_meta.h","rank":6,"score":94257.99943043414},{"content":"#include <vector>\n\n#include <functional>\n\n#include <any>\n\n#include <json11.hpp>\n\n#include <mindalpha/data_type.h>\n\n#include <mindalpha/smart_array.h>\n\n\n\nnamespace mindalpha\n\n{\n\n\n\nusing SparseInitializer = std::function<void(const std::string& name,\n\n SmartArray<uint8_t> data,\n\n SmartArray<uint8_t> keys,\n\n const class SparseTensorMeta& meta)>;\n\n\n\nusing SparseUpdater = std::function<void(const std::string& name,\n\n SmartArray<uint8_t> param,\n\n SmartArray<uint8_t> grad,\n\n SmartArray<uint8_t> indices,\n\n SmartArray<uint8_t> keys,\n\n const class SparseTensorMeta& meta)>;\n\n\n","file_path":"cpp/mindalpha/sparse_tensor_meta.h","rank":7,"score":94257.5904482217},{"content":"\n\n int GetPartitionCount() const { return partition_count_; }\n\n void SetPartitionCount(int value) { partition_count_ = value; }\n\n\n\n void CheckDenseTensorMeta(int index) const;\n\n\n\n void ComputePartitionShapesWithHash(size_t hash, int index, size_t& begin, size_t& end,\n\n std::vector<size_t>* partition_data_shape,\n\n std::vector<size_t>* partition_state_shape) const;\n\n\n\n void ComputePartitionShapes(int index, size_t& begin, size_t& end,\n\n std::vector<size_t>* partition_data_shape,\n\n std::vector<size_t>* partition_state_shape) const;\n\n\n\n size_t GetNameHash() const { return BKDRHash(name_); }\n\n\n\n void SetInitializerByData(std::string data);\n\n void SetUpdaterByData(std::string data);\n\n\n\n std::string GetInitializerAsData() const;\n","file_path":"cpp/mindalpha/dense_tensor_meta.h","rank":8,"score":94255.1447154551},{"content":"\n\n int GetPartitionCount() const { return partition_count_; }\n\n void SetPartitionCount(int value) { partition_count_ = value; }\n\n\n\n void CheckSparseTensorMeta(int index) const;\n\n void ComputeSliceInfo();\n\n\n\n size_t GetSliceDataLength() const { return slice_data_length_; }\n\n size_t GetSliceStateLength() const { return slice_state_length_; }\n\n size_t GetSliceAgeOffset() const { return slice_age_offset_; }\n\n size_t GetSliceTotalBytes() const { return slice_total_bytes_; }\n\n size_t GetSliceDataStateBytes() const { return GetSliceAgeOffset(); }\n\n\n\n void SetInitializerByData(std::string data);\n\n void SetUpdaterByData(std::string data);\n\n\n\n std::string GetInitializerAsData() const;\n\n std::string GetUpdaterAsData() const;\n\n\n\n std::string ToString() const;\n","file_path":"cpp/mindalpha/sparse_tensor_meta.h","rank":9,"score":94248.36119122537},{"content":" std::any updater_object_;\n\n int partition_count_ = -1;\n\n size_t slice_data_length_ = size_t(-1);\n\n size_t slice_state_length_ = size_t(-1);\n\n size_t slice_age_offset_ = size_t(-1);\n\n size_t slice_total_bytes_ = size_t(-1);\n\n};\n\n\n\n}\n","file_path":"cpp/mindalpha/sparse_tensor_meta.h","rank":10,"score":94237.51614977562},{"content":"//\n\n// Copyright 2021 Mobvista\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\n#pragma once\n\n\n\n#include <stdint.h>\n\n#include <string>\n","file_path":"cpp/mindalpha/dense_tensor_meta.h","rank":11,"score":94230.50846983212},{"content":"//\n\n// Copyright 2021 Mobvista\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\n#pragma once\n\n\n\n#include <stdint.h>\n\n#include <string>\n","file_path":"cpp/mindalpha/sparse_tensor_meta.h","rank":12,"score":94230.50846983212},{"content":"\n\nnamespace mindalpha\n\n{\n\n\n\nstd::string NodeControlCommandToString(NodeControlCommand command)\n\n{\n\n switch (command)\n\n {\n\n#undef MINDALPHA_NODE_CONTROL_COMMAND_DEF\n\n#define MINDALPHA_NODE_CONTROL_COMMAND_DEF(n) case NodeControlCommand::n: return #n;\n\n MINDALPHA_NODE_CONTROL_COMMANDS(MINDALPHA_NODE_CONTROL_COMMAND_DEF)\n\n default:\n\n std::string serr;\n\n serr.append(\"Invalid NodeControlCommand enum value: \");\n\n serr.append(std::to_string(static_cast<int>(command)));\n\n serr.append(\".\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n","file_path":"cpp/mindalpha/node_control_command.cpp","rank":13,"score":92677.97463280222},{"content":"}\n\n\n\nNodeControlCommand NodeControlCommandFromString(const std::string& str)\n\n{\n\n#undef MINDALPHA_NODE_CONTROL_COMMAND_DEF\n\n#define MINDALPHA_NODE_CONTROL_COMMAND_DEF(n) if (str == #n) return NodeControlCommand::n;\n\n MINDALPHA_NODE_CONTROL_COMMANDS(MINDALPHA_NODE_CONTROL_COMMAND_DEF)\n\n std::string serr;\n\n serr.append(\"Invalid NodeControlCommand enum value: \");\n\n serr.append(str);\n\n serr.append(\".\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n}\n\n\n\nstd::string NullableNodeControlCommandToString(NodeControlCommand command)\n\n{\n\n if (command == NullNodeControlCommand)\n\n return NullNodeControlCommandString;\n","file_path":"cpp/mindalpha/node_control_command.cpp","rank":14,"score":92676.7876888065},{"content":" return NodeControlCommandToString(command);\n\n}\n\n\n\nNodeControlCommand NullableNodeControlCommandFromString(const std::string& str)\n\n{\n\n if (str == NullNodeControlCommandString)\n\n return NullNodeControlCommand;\n\n return NodeControlCommandFromString(str);\n\n}\n\n\n\n}\n","file_path":"cpp/mindalpha/node_control_command.cpp","rank":15,"score":92668.34049937388},{"content":"//\n\n// Copyright 2021 Mobvista\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\n#include <stdexcept>\n\n#include <spdlog/spdlog.h>\n\n#include <mindalpha/node_control_command.h>\n\n#include <mindalpha/stack_trace_utils.h>\n","file_path":"cpp/mindalpha/node_control_command.cpp","rank":16,"score":92665.72327975839},{"content":" def _load_tensor(self, dir_path, *, keep_meta=False):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def load_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n self._handle.load(dir_path, load_tensor_done, keep_meta)\n","file_path":"python/mindalpha/distributed_tensor.py","rank":17,"score":92428.73178062242},{"content":"#include <mindalpha/dense_tensor_meta.h>\n\n#include <mindalpha/stack_trace_utils.h>\n\n\n\nnamespace mindalpha\n\n{\n\n\n\nvoid DenseTensorMeta::CheckDenseTensorMeta(int index) const\n\n{\n\n if (GetName().empty())\n\n {\n\n std::string serr;\n\n serr.append(\"Can not compute dense tensor partition shapes, \");\n\n serr.append(\"as the name is empty.\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n const int n = GetPartitionCount();\n\n if (n <= 0)\n\n {\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":18,"score":91462.87682499735},{"content":"#include <mindalpha/sparse_tensor_meta.h>\n\n#include <mindalpha/stack_trace_utils.h>\n\n\n\nnamespace mindalpha\n\n{\n\n\n\nvoid SparseTensorMeta::CheckSparseTensorMeta(int index) const\n\n{\n\n if (GetName().empty())\n\n {\n\n std::string serr;\n\n serr.append(\"Can not compute sparse tensor slice support info, \");\n\n serr.append(\"as the name is empty.\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n const int n = GetPartitionCount();\n\n if (n <= 0)\n\n {\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":19,"score":91462.71136761784},{"content":" {\n\n { \"name\", name_ },\n\n { \"data_type\", NullableDataTypeToString(data_type_) },\n\n { \"data_shape\", ShapeToString(data_shape_) },\n\n { \"state_shape\", ShapeToString(state_shape_) },\n\n { \"initializer_data\", GetInitializerAsData() },\n\n { \"updater_data\", GetUpdaterAsData() },\n\n { \"partition_count\", partition_count_ },\n\n };\n\n}\n\n\n\nDenseTensorMeta DenseTensorMeta::FromJsonString(const std::string& str)\n\n{\n\n std::string err;\n\n json11::Json json = json11::Json::parse(str, err);\n\n if (!err.empty())\n\n {\n\n std::string serr;\n\n serr.append(\"Unable to create DenseTensorMeta from JSON string; str: \");\n\n serr.append(str);\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":20,"score":91460.94176224488},{"content":" serr.append(\", err: \");\n\n serr.append(err);\n\n serr.append(\".\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n return FromJson(std::move(json));\n\n}\n\n\n\nDenseTensorMeta DenseTensorMeta::FromJson(json11::Json json)\n\n{\n\n DenseTensorMeta meta;\n\n meta.SetName(json[\"name\"].string_value());\n\n meta.SetDataType(DataTypeFromString(json[\"data_type\"].string_value()));\n\n meta.SetDataShape(ShapeFromString(json[\"data_shape\"].string_value()));\n\n meta.SetStateShape(ShapeFromString(json[\"state_shape\"].string_value()));\n\n meta.SetInitializerByData(json[\"initializer_data\"].string_value());\n\n meta.SetUpdaterByData(json[\"updater_data\"].string_value());\n\n meta.SetPartitionCount(json[\"partition_count\"].int_value());\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":21,"score":91459.15178321234},{"content":" meta.SetName(json[\"name\"].string_value());\n\n meta.SetDataType(DataTypeFromString(json[\"data_type\"].string_value()));\n\n meta.SetSliceDataShape(ShapeFromString(json[\"slice_data_shape\"].string_value()));\n\n meta.SetSliceStateShape(ShapeFromString(json[\"slice_state_shape\"].string_value()));\n\n meta.SetInitializerByData(json[\"initializer_data\"].string_value());\n\n meta.SetUpdaterByData(json[\"updater_data\"].string_value());\n\n meta.SetPartitionCount(json[\"partition_count\"].int_value());\n\n meta.ComputeSliceInfo();\n\n return meta;\n\n}\n\n\n\nbool SparseTensorMeta::IsCompatible(const SparseTensorMeta& rhs) const\n\n{\n\n return data_type_ == rhs.data_type_\n\n && slice_data_shape_ == rhs.slice_data_shape_\n\n && slice_state_shape_ == rhs.slice_state_shape_;\n\n}\n\n\n\nbool SparseTensorMeta::IsCompatibleRelaxed(const SparseTensorMeta& rhs, bool data_only) const\n\n{\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":22,"score":91458.90764054922},{"content":"{\n\n return to_json().dump();\n\n}\n\n\n\njson11::Json SparseTensorMeta::to_json() const\n\n{\n\n return json11::Json::object\n\n {\n\n { \"name\", name_ },\n\n { \"data_type\", NullableDataTypeToString(data_type_) },\n\n { \"slice_data_shape\", ShapeToString(slice_data_shape_) },\n\n { \"slice_state_shape\", ShapeToString(slice_state_shape_) },\n\n { \"initializer_data\", GetInitializerAsData() },\n\n { \"updater_data\", GetUpdaterAsData() },\n\n { \"partition_count\", partition_count_ },\n\n };\n\n}\n\n\n\nSparseTensorMeta SparseTensorMeta::FromJsonString(const std::string& str)\n\n{\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":23,"score":91456.34642857032},{"content":" const size_t hash = GetNameHash();\n\n ComputePartitionShapesWithHash(hash, index, begin, end,\n\n partition_data_shape, partition_state_shape);\n\n}\n\n\n\nvoid DenseTensorMeta::SetInitializerByData(std::string data)\n\n{\n\n namespace py = pybind11;\n\n using namespace py::literals;\n\n if (data.empty())\n\n {\n\n initializer_ = {};\n\n initializer_object_ = {};\n\n }\n\n else\n\n {\n\n py::gil_scoped_acquire gil;\n\n py::object obj = mindalpha::deserialize_pyobject(data);\n\n MakeInitializerReady(obj);\n\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":24,"score":91455.24518572514},{"content":" return meta;\n\n}\n\n\n\nbool DenseTensorMeta::IsCompatible(const DenseTensorMeta& rhs) const\n\n{\n\n return data_type_ == rhs.data_type_\n\n && data_shape_ == rhs.data_shape_\n\n && state_shape_ == rhs.state_shape_;\n\n}\n\n\n\nbool DenseTensorMeta::operator==(const DenseTensorMeta& rhs) const\n\n{\n\n return name_ == rhs.name_\n\n && data_type_ == rhs.data_type_\n\n && data_shape_ == rhs.data_shape_\n\n && state_shape_ == rhs.state_shape_\n\n && GetInitializerAsData() == rhs.GetInitializerAsData()\n\n && GetUpdaterAsData() == rhs.GetUpdaterAsData()\n\n && partition_count_ == rhs.partition_count_;\n\n}\n\n\n\n}\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":25,"score":91453.59342159057},{"content":" initializer_ = [func](const std::string& name,\n\n mindalpha::SmartArray<uint8_t> data,\n\n const DenseTensorMeta& meta)\n\n {\n\n py::gil_scoped_acquire gil;\n\n py::array data_arr = mindalpha::make_numpy_array(data, meta.data_type_);\n\n py::tuple data_shape(meta.data_shape_.size());\n\n for (size_t i = 0; i < meta.data_shape_.size(); i++)\n\n data_shape[i] = (i == 0) ? -1 : static_cast<int64_t>(meta.data_shape_.at(i));\n\n data_arr = data_arr.attr(\"reshape\")(data_shape);\n\n (*func)(\"name\"_a=name, \"data\"_a=data_arr, \"keys\"_a=py::none());\n\n };\n\n initializer_object_ = std::move(func);\n\n }\n\n}\n\n\n\nvoid DenseTensorMeta::SetUpdaterByData(std::string data)\n\n{\n\n namespace py = pybind11;\n\n using namespace py::literals;\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":26,"score":91453.57559213898},{"content":" begin = avg_items * i + std::min(i, remainder);\n\n end = begin + my_items;\n\n if (partition_data_shape)\n\n {\n\n *partition_data_shape = GetDataShape();\n\n partition_data_shape->at(0) = end - begin;\n\n }\n\n if (partition_state_shape)\n\n {\n\n *partition_state_shape = GetStateShape();\n\n if (!GetStateShape().empty())\n\n partition_state_shape->at(0) = end - begin;\n\n }\n\n}\n\n\n\nvoid DenseTensorMeta::ComputePartitionShapes(\n\n int index, size_t& begin, size_t& end,\n\n std::vector<size_t>* partition_data_shape,\n\n std::vector<size_t>* partition_state_shape) const\n\n{\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":27,"score":91452.77641736313},{"content":" state_arr = state_arr.attr(\"reshape\")(state_shape);\n\n (*func)(\"name\"_a=name, \"param\"_a=param_arr, \"grad\"_a=grad_arr,\n\n \"state\"_a=state_arr, \"indices\"_a=py::none(), \"keys\"_a=py::none());\n\n }\n\n };\n\n updater_object_ = std::move(func);\n\n }\n\n}\n\n\n\nstd::string DenseTensorMeta::GetInitializerAsData() const\n\n{\n\n pybind11::gil_scoped_acquire gil;\n\n if (!initializer_object_.has_value())\n\n return {};\n\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(initializer_object_);\n\n return mindalpha::serialize_pyobject(*func);\n\n}\n\n\n\nstd::string DenseTensorMeta::GetUpdaterAsData() const\n\n{\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":28,"score":91451.79531416223},{"content":" serr.append(\"].\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n}\n\n\n\nvoid DenseTensorMeta::ComputePartitionShapesWithHash(\n\n size_t hash, int index, size_t& begin, size_t& end,\n\n std::vector<size_t>* partition_data_shape,\n\n std::vector<size_t>* partition_state_shape) const\n\n{\n\n size_t m = GetDataShape().at(0);\n\n size_t n = GetPartitionCount();\n\n size_t i = index;\n\n size_t h = hash;\n\n i = (i + h) % n;\n\n size_t my_items = (m + n - 1 - i) / n;\n\n size_t avg_items = m / n;\n\n size_t remainder = m % n;\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":29,"score":91451.67751319871},{"content":" std::string err;\n\n json11::Json json = json11::Json::parse(str, err);\n\n if (!err.empty())\n\n {\n\n std::string serr;\n\n serr.append(\"Unable to create SparseTensorMeta from JSON string; str: \");\n\n serr.append(str);\n\n serr.append(\", err: \");\n\n serr.append(err);\n\n serr.append(\".\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n return FromJson(std::move(json));\n\n}\n\n\n\nSparseTensorMeta SparseTensorMeta::FromJson(json11::Json json)\n\n{\n\n SparseTensorMeta meta;\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":30,"score":91451.53731241683},{"content":" serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n}\n\n\n\nvoid SparseTensorMeta::ComputeSliceInfo()\n\n{\n\n const size_t item_size = DataTypeToSize(data_type_);\n\n slice_data_length_ = item_size * TotalElements(slice_data_shape_);\n\n slice_state_length_ = item_size * TotalElements(slice_state_shape_);\n\n const size_t age_offset = slice_data_length_ + slice_state_length_;\n\n const size_t age_size = std::max(item_size, sizeof(int));\n\n const size_t age_mask = age_size - 1;\n\n slice_age_offset_ = (age_offset + age_mask) & ~age_mask;\n\n slice_total_bytes_ = slice_age_offset_ + age_size;\n\n}\n\n\n\nvoid SparseTensorMeta::SetInitializerByData(std::string data)\n\n{\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":31,"score":91451.0353985987},{"content":" return {};\n\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(initializer_object_);\n\n return mindalpha::serialize_pyobject(*func);\n\n}\n\n\n\nstd::string SparseTensorMeta::GetUpdaterAsData() const\n\n{\n\n pybind11::gil_scoped_acquire gil;\n\n if (!updater_object_.has_value())\n\n return {};\n\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(updater_object_);\n\n return mindalpha::serialize_pyobject(*func);\n\n}\n\n\n\nstd::string SparseTensorMeta::ToString() const\n\n{\n\n return ToJsonString();\n\n}\n\n\n\nstd::string SparseTensorMeta::ToJsonString() const\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":32,"score":91450.26490529186},{"content":" if (!data_only)\n\n return IsCompatible(rhs);\n\n return data_type_ == rhs.data_type_\n\n && slice_data_shape_ == rhs.slice_data_shape_;\n\n}\n\n\n\nbool SparseTensorMeta::operator==(const SparseTensorMeta& rhs) const\n\n{\n\n return name_ == rhs.name_\n\n && data_type_ == rhs.data_type_\n\n && slice_data_shape_ == rhs.slice_data_shape_\n\n && slice_state_shape_ == rhs.slice_state_shape_\n\n && GetInitializerAsData() == rhs.GetInitializerAsData()\n\n && GetUpdaterAsData() == rhs.GetUpdaterAsData()\n\n && partition_count_ == rhs.partition_count_;\n\n}\n\n\n\n}\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":33,"score":91449.89845983424},{"content":" namespace py = pybind11;\n\n using namespace py::literals;\n\n if (data.empty())\n\n {\n\n initializer_ = {};\n\n initializer_object_ = {};\n\n }\n\n else\n\n {\n\n py::gil_scoped_acquire gil;\n\n py::object obj = mindalpha::deserialize_pyobject(data);\n\n MakeInitializerReady(obj);\n\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\n\n initializer_ = [func](const std::string& name,\n\n mindalpha::SmartArray<uint8_t> data,\n\n mindalpha::SmartArray<uint8_t> keys,\n\n const SparseTensorMeta& meta)\n\n {\n\n {\n\n py::gil_scoped_acquire gil;\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":34,"score":91449.07627067118},{"content":" mindalpha::SmartArray<uint8_t> grad_clone = grad.Copy();\n\n py::gil_scoped_acquire gil;\n\n py::array param_arr = mindalpha::make_numpy_array(param, meta.data_type_);\n\n py::array grad_arr = mindalpha::make_numpy_array(grad_clone, meta.data_type_);\n\n py::tuple data_shape(meta.data_shape_.size());\n\n for (size_t i = 0; i < meta.data_shape_.size(); i++)\n\n data_shape[i] = (i == 0) ? -1 : static_cast<int64_t>(meta.data_shape_.at(i));\n\n param_arr = param_arr.attr(\"reshape\")(data_shape);\n\n grad_arr = grad_arr.attr(\"reshape\")(data_shape);\n\n if (meta.state_shape_.empty())\n\n {\n\n (*func)(\"name\"_a=name, \"param\"_a=param_arr, \"grad\"_a=grad_arr,\n\n \"state\"_a=py::none(), \"indices\"_a=py::none(), \"keys\"_a=py::none());\n\n }\n\n else\n\n {\n\n py::array state_arr = mindalpha::make_numpy_array(state, meta.data_type_);\n\n py::tuple state_shape(meta.state_shape_.size());\n\n for (size_t i = 0; i < meta.state_shape_.size(); i++)\n\n state_shape[i] = (i == 0) ? -1 : static_cast<int64_t>(meta.state_shape_.at(i));\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":35,"score":91448.58609957375},{"content":" pybind11::gil_scoped_acquire gil;\n\n if (!updater_object_.has_value())\n\n return {};\n\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(updater_object_);\n\n return mindalpha::serialize_pyobject(*func);\n\n}\n\n\n\nstd::string DenseTensorMeta::ToString() const\n\n{\n\n return ToJsonString();\n\n}\n\n\n\nstd::string DenseTensorMeta::ToJsonString() const\n\n{\n\n return to_json().dump();\n\n}\n\n\n\njson11::Json DenseTensorMeta::to_json() const\n\n{\n\n return json11::Json::object\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":36,"score":91447.62549574758},{"content":" py::slice data_slice(0, data_cols, 1);\n\n py::tuple data_subscript = py::make_tuple(py::ellipsis(), data_slice);\n\n py::array data_arr = blob_arr[data_subscript];\n\n py::tuple data_shape(1 + meta.slice_data_shape_.size());\n\n data_shape[0] = -1;\n\n for (size_t i = 0; i < meta.slice_data_shape_.size(); i++)\n\n data_shape[1 + i] = static_cast<int64_t>(meta.slice_data_shape_.at(i));\n\n data_arr = data_arr.attr(\"reshape\")(data_shape);\n\n py::array grad_arr = mindalpha::make_numpy_array(grad_clone, meta.data_type_);\n\n grad_arr = grad_arr.attr(\"reshape\")(data_shape);\n\n py::array indices_arr = mindalpha::make_numpy_array(indices, mindalpha::DataType::UInt64);\n\n py::array keys_arr = mindalpha::make_numpy_array(keys, mindalpha::DataType::UInt64);\n\n if (meta.slice_state_shape_.empty())\n\n {\n\n (*func)(\"name\"_a=name, \"param\"_a=data_arr, \"grad\"_a=grad_arr,\n\n \"state\"_a=py::none(), \"indices\"_a=indices_arr, \"keys\"_a=keys_arr);\n\n }\n\n else\n\n {\n\n const size_t state_cols = meta.slice_state_length_ / item_size;\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":37,"score":91447.41545511539},{"content":" memset(slice_ptr + meta.slice_data_length_, 0, meta.slice_total_bytes_ - meta.slice_data_length_);\n\n slice_ptr += meta.slice_total_bytes_;\n\n }\n\n };\n\n initializer_object_ = std::move(func);\n\n }\n\n}\n\n\n\nvoid SparseTensorMeta::SetUpdaterByData(std::string data)\n\n{\n\n namespace py = pybind11;\n\n using namespace py::literals;\n\n if (data.empty())\n\n {\n\n updater_ = {};\n\n updater_object_ = {};\n\n }\n\n else\n\n {\n\n py::gil_scoped_acquire gil;\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":38,"score":91446.60909096469},{"content":" if (data.empty())\n\n {\n\n updater_ = {};\n\n updater_object_ = {};\n\n }\n\n else\n\n {\n\n py::gil_scoped_acquire gil;\n\n py::object obj = mindalpha::deserialize_pyobject(data);\n\n MakeUpdaterReady(obj);\n\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\n\n updater_ = [func](const std::string& name,\n\n mindalpha::SmartArray<uint8_t> param,\n\n mindalpha::SmartArray<uint8_t> grad,\n\n mindalpha::SmartArray<uint8_t> state,\n\n const DenseTensorMeta& meta)\n\n {\n\n // Some PyTorch operations such as ``grad.clone()`` and ``XXX + grad``\n\n // require memory alignment, we use ``SmartArray::Copy`` to use GLIBC allocated\n\n // memory which is 16 bytes aligned.\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":39,"score":91446.2924018183},{"content":" {\n\n std::string serr;\n\n serr.append(\"Can not compute partition shapes for dense tensor '\");\n\n serr.append(GetName());\n\n serr.append(\"', as the tensor state shape [\");\n\n for (size_t i = 0; i < GetStateShape().size(); i++)\n\n {\n\n serr.append(i ? \", \" : \"\");\n\n serr.append(std::to_string(GetStateShape().at(i)));\n\n }\n\n serr.append(\"] is invalid; partition_count = \");\n\n serr.append(std::to_string(GetPartitionCount()));\n\n serr.append(\", partition_index = \");\n\n serr.append(std::to_string(index));\n\n serr.append(\", shape = [\");\n\n for (size_t i = 0; i < GetDataShape().size(); i++)\n\n {\n\n serr.append(i ? \", \" : \"\");\n\n serr.append(std::to_string(GetDataShape().at(i)));\n\n }\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":40,"score":91446.26150067018},{"content":" py::slice state_slice(data_cols, data_cols + state_cols, 1);\n\n py::tuple state_subscript = py::make_tuple(py::ellipsis(), state_slice);\n\n py::array state_arr = blob_arr[state_subscript];\n\n py::tuple state_shape(1 + meta.slice_state_shape_.size());\n\n state_shape[0] = -1;\n\n for (size_t i = 0; i < meta.slice_state_shape_.size(); i++)\n\n state_shape[1 + i] = static_cast<int64_t>(meta.slice_state_shape_.at(i));\n\n state_arr = state_arr.attr(\"reshape\")(state_shape);\n\n (*func)(\"name\"_a=name, \"param\"_a=data_arr, \"grad\"_a=grad_arr,\n\n \"state\"_a=state_arr, \"indices\"_a=indices_arr, \"keys\"_a=keys_arr);\n\n }\n\n };\n\n updater_object_ = std::move(func);\n\n }\n\n}\n\n\n\nstd::string SparseTensorMeta::GetInitializerAsData() const\n\n{\n\n pybind11::gil_scoped_acquire gil;\n\n if (!initializer_object_.has_value())\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":41,"score":91446.14403030487},{"content":" {\n\n std::string serr;\n\n serr.append(\"Can not compute partition shapes for dense tensor '\");\n\n serr.append(GetName());\n\n serr.append(\"', as the tensor data shape [\");\n\n for (size_t i = 0; i < GetDataShape().size(); i++)\n\n {\n\n serr.append(i ? \", \" : \"\");\n\n serr.append(std::to_string(GetDataShape().at(i)));\n\n }\n\n serr.append(\"] is invalid; partition_count = \");\n\n serr.append(std::to_string(GetPartitionCount()));\n\n serr.append(\", partition_index = \");\n\n serr.append(std::to_string(index));\n\n serr.append(\".\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n if (!GetStateShape().empty() && GetStateShape().at(0) != m)\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":42,"score":91445.99452441961},{"content":" py::object obj = mindalpha::deserialize_pyobject(data);\n\n MakeUpdaterReady(obj);\n\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\n\n updater_ = [func](const std::string& name,\n\n mindalpha::SmartArray<uint8_t> param,\n\n mindalpha::SmartArray<uint8_t> grad,\n\n mindalpha::SmartArray<uint8_t> indices,\n\n mindalpha::SmartArray<uint8_t> keys,\n\n const SparseTensorMeta& meta)\n\n {\n\n // Some PyTorch operations such as ``grad.clone()`` and ``XXX + grad``\n\n // require memory alignment, we use ``SmartArray::Copy`` to use GLIBC allocated\n\n // memory which is 16 bytes aligned.\n\n mindalpha::SmartArray<uint8_t> grad_clone = grad.Copy();\n\n py::gil_scoped_acquire gil;\n\n const size_t item_size = mindalpha::DataTypeToSize(meta.data_type_);\n\n const size_t cols = meta.slice_total_bytes_ / item_size;\n\n const size_t data_cols = meta.slice_data_length_ / item_size;\n\n py::array blob_arr = mindalpha::make_numpy_array(param, meta.data_type_);\n\n blob_arr = blob_arr.attr(\"reshape\")(-1, cols);\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":43,"score":91444.29731075646},{"content":" const size_t item_size = mindalpha::DataTypeToSize(meta.data_type_);\n\n const size_t cols = meta.slice_total_bytes_ / item_size;\n\n const size_t data_cols = meta.slice_data_length_ / item_size;\n\n py::array blob_arr = mindalpha::make_numpy_array(data, meta.data_type_);\n\n blob_arr = blob_arr.attr(\"reshape\")(-1, cols);\n\n py::slice data_slice(0, data_cols, 1);\n\n py::tuple data_subscript = py::make_tuple(py::ellipsis(), data_slice);\n\n py::array data_arr = blob_arr[data_subscript];\n\n py::tuple data_shape(1 + meta.slice_data_shape_.size());\n\n data_shape[0] = -1;\n\n for (size_t i = 0; i < meta.slice_data_shape_.size(); i++)\n\n data_shape[1 + i] = static_cast<int64_t>(meta.slice_data_shape_.at(i));\n\n data_arr = data_arr.attr(\"reshape\")(data_shape);\n\n py::array keys_arr = mindalpha::make_numpy_array(keys, mindalpha::DataType::UInt64);\n\n (*func)(\"name\"_a=name, \"data\"_a=data_arr, \"keys\"_a=keys_arr);\n\n }\n\n const size_t slice_count = data.size() / meta.slice_total_bytes_;\n\n uint8_t* slice_ptr = data.data();\n\n for (size_t i = 0; i < slice_count; i++)\n\n {\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":44,"score":91443.50327305484},{"content":" serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n if (GetDataShape().empty())\n\n {\n\n std::string serr;\n\n serr.append(\"Can not compute partition shapes for dense tensor '\");\n\n serr.append(GetName());\n\n serr.append(\"', as the tensor data shape is empty; partition_count = \");\n\n serr.append(std::to_string(GetPartitionCount()));\n\n serr.append(\", partition_index = \");\n\n serr.append(std::to_string(index));\n\n serr.append(\".\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n const size_t m = GetDataShape().at(0);\n\n if (m == 0)\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":45,"score":91442.55107093079},{"content":" std::string serr;\n\n serr.append(\"Can not compute partition shapes for dense tensor '\");\n\n serr.append(GetName());\n\n serr.append(\"', as the partition count \");\n\n serr.append(std::to_string(n));\n\n serr.append(\" is invalid.\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n if (index < 0 || index >= n)\n\n {\n\n std::string serr;\n\n serr.append(\"Can not compute partition shapes for dense tensor '\");\n\n serr.append(GetName());\n\n serr.append(\"', as the partition index \");\n\n serr.append(std::to_string(index));\n\n serr.append(\" is invalid; partition_count = \");\n\n serr.append(std::to_string(GetPartitionCount()));\n\n serr.append(\".\\n\\n\");\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":46,"score":91439.39790939364},{"content":" std::string serr;\n\n serr.append(\"Can not compute slice support info for sparse tensor '\");\n\n serr.append(GetName());\n\n serr.append(\"', as the partition count \");\n\n serr.append(std::to_string(n));\n\n serr.append(\" is invalid.\\n\\n\");\n\n serr.append(GetStackTrace());\n\n spdlog::error(serr);\n\n throw std::runtime_error(serr);\n\n }\n\n if (index < 0 || index >= n)\n\n {\n\n std::string serr;\n\n serr.append(\"Can not compute slice support info for sparse tensor '\");\n\n serr.append(GetName());\n\n serr.append(\"', as the partition index \");\n\n serr.append(std::to_string(index));\n\n serr.append(\" is invalid; partition_count = \");\n\n serr.append(std::to_string(GetPartitionCount()));\n\n serr.append(\".\\n\\n\");\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":47,"score":91439.32316933275},{"content":"//\n\n// Copyright 2021 Mobvista\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\n#include <stdexcept>\n\n#include <spdlog/spdlog.h>\n\n#include <mindalpha/pybind_utils.h>\n\n#include <mindalpha/tensor_utils.h>\n","file_path":"cpp/mindalpha/dense_tensor_meta.cpp","rank":48,"score":91437.94147361857},{"content":"//\n\n// Copyright 2021 Mobvista\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n\n\n#include <stdexcept>\n\n#include <spdlog/spdlog.h>\n\n#include <mindalpha/tensor_utils.h>\n\n#include <mindalpha/pybind_utils.h>\n","file_path":"cpp/mindalpha/sparse_tensor_meta.cpp","rank":49,"score":91437.94147361857},{"content":" def load_tensor_done():\n","file_path":"python/mindalpha/distributed_tensor.py","rank":50,"score":90561.01444281661},{"content":" async def _load_tensors(self, dir_path, *, keep_meta=False):\n\n futures = []\n\n for tensor in self._tensors:\n\n if not tensor.is_backing:\n\n future = tensor._load_tensor(dir_path, keep_meta=keep_meta)\n\n futures.append(future)\n","file_path":"python/mindalpha/model.py","rank":51,"score":83009.7846229963},{"content":"namespace mindalpha\n\n{\n\n\n\n//\n\n// Use the X Macro technique to simplify code. See the following page\n\n// for more information about X Macros:\n\n//\n\n// https://en.wikipedia.org/wiki/X_Macro\n\n//\n\n\n\n#define MINDALPHA_INTEGRAL_DATA_TYPES(X) \\\n\n X(int8_t, int8, Int8) \\\n\n X(int16_t, int16, Int16) \\\n\n X(int32_t, int32, Int32) \\\n\n X(int64_t, int64, Int64) \\\n\n X(uint8_t, uint8, UInt8) \\\n\n X(uint16_t, uint16, UInt16) \\\n\n X(uint32_t, uint32, UInt32) \\\n\n X(uint64_t, uint64, UInt64) \\\n\n /**/\n\n\n\n#define MINDALPHA_FLOATING_DATA_TYPES(X) \\\n\n X(float, float32, Float32) \\\n\n X(double, float64, Float64) \\\n\n /**/\n\n\n\n#define MINDALPHA_DATA_TYPES(X) \\\n\n MINDALPHA_INTEGRAL_DATA_TYPES(X) \\\n\n MINDALPHA_FLOATING_DATA_TYPES(X) \\\n\n /**/\n\n\n\nenum class DataType\n\n{\n\n#undef MINDALPHA_DATA_TYPE_DEF\n\n#define MINDALPHA_DATA_TYPE_DEF(t, l, u) u,\n\n MINDALPHA_DATA_TYPES(MINDALPHA_DATA_TYPE_DEF)\n\n};\n\n\n\n// A missing ``DataType`` is represented by ``DataType(-1)``.\n\nconstexpr DataType NullDataType = static_cast<DataType>(-1);\n\nconstexpr const char* NullDataTypeString = \"null\";\n\n\n\n// Functions to convert ``DataType`` to and from strings.\n\nstd::string DataTypeToString(DataType type);\n\nDataType DataTypeFromString(const std::string& str);\n\n\n\nstd::string NullableDataTypeToString(DataType type);\n\nDataType NullableDataTypeFromString(const std::string& str);\n\n\n\n// This class template computes the ``DataType`` code of a numeric type.\n\ntemplate<typename T>\n\nstruct DataTypeToCode;\n\n\n\n#undef MINDALPHA_DATA_TYPE_DEF\n\n#define MINDALPHA_DATA_TYPE_DEF(t, l, u) \\\n\n template<> \\\n\n struct DataTypeToCode<t> \\\n\n { \\\n\n static constexpr DataType value = DataType::u; \\\n\n }; \\\n\n /**/\n\n MINDALPHA_DATA_TYPES(MINDALPHA_DATA_TYPE_DEF)\n\n\n\n// Compute the size in bytes of a value of ``type``.\n\nsize_t DataTypeToSize(DataType type);\n\n\n\n// This function template and two function overloads ensure ``value``\n\n// can be output as numbers. Output ``int8_t``/``uint8_t`` directly to\n\n// ``std::ostream`` will cause problems as they are character types\n\n// actually.\n\ntemplate<typename T>\n\ninline T AsNumber(T value) { return value; }\n\n\n\ninline int32_t AsNumber(int8_t value) { return static_cast<int32_t>(value); }\n\ninline uint32_t AsNumber(uint8_t value) { return static_cast<uint32_t>(value); }\n\n\n","file_path":"cpp/mindalpha/data_type.h","rank":52,"score":82665.60836220431},{"content":"namespace mindalpha\n\n{\n\n\n\n// Integer encodings of node group of the same role.\n\n#undef MINDALPHA_NODE_ROLE_DEF\n\n#define MINDALPHA_NODE_ROLE_DEF(n) constexpr int n##Group = 1 << static_cast<int>(NodeRole::n);\n\nMINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\n\n\n\n// Tag value specify that this integer encoding identify a single node.\n\nconstexpr int SingleNodeIdTag = 1 << (static_cast<int>(NodeRole::Worker) + 1);\n\n\n\n// Tag value specify that this integer encoding identify a node of the specific role.\n\n#undef MINDALPHA_NODE_ROLE_DEF\n\n#define MINDALPHA_NODE_ROLE_DEF(n) constexpr int n##NodeIdTag = 1 << static_cast<int>(NodeRole::n) | SingleNodeIdTag;\n\nMINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\n\n\n\n// Encode node numbered ``rank`` as a node id, which is an integer. ``rank`` is zero-based.\n\n#undef MINDALPHA_NODE_ROLE_DEF\n\n#define MINDALPHA_NODE_ROLE_DEF(n) constexpr int n##RankToNodeId(int rank) { return rank << 4 | n##NodeIdTag; }\n\nMINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\n\n\n\n// Get the zero-based ``rank`` from node id ``id``.\n\nconstexpr int NodeIdToRank(int id) { return id >> 4; }\n\n\n\n// Node id of the coordinator node. Since there is a single coordinator node\n\n// in the Parameter Server system, its node id can be pre-computed.\n\nconstexpr int CoordinatorNodeId = CoordinatorRankToNodeId(0);\n\n\n\n// Convert integer node id to a descriptive string.\n\nstd::string NodeIdToString(int node_id);\n\n\n","file_path":"cpp/mindalpha/node_encoding.h","rank":53,"score":82539.09941880858},{"content":"namespace mindalpha\n\n{\n\n\n\n//\n\n// Use the X Macro technique to simplify code. See the following page\n\n// for more information about X Macros:\n\n//\n\n// https://en.wikipedia.org/wiki/X_Macro\n\n//\n\n\n\n#define MINDALPHA_NODE_ROLES(X) \\\n\n X(Coordinator) \\\n\n X(Server) \\\n\n X(Worker) \\\n\n /**/\n\n\n\nenum class NodeRole\n\n{\n\n#undef MINDALPHA_NODE_ROLE_DEF\n\n#define MINDALPHA_NODE_ROLE_DEF(n) n,\n\n MINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\n\n};\n\n\n\n// A missing ``NodeRole`` is represented by ``NodeRole(-1)``.\n\nconstexpr NodeRole NullNodeRole = static_cast<NodeRole>(-1);\n\nconstexpr const char* NullNodeRoleString = \"null\";\n\n\n\n// Functions to convert ``NodeRole`` to and from strings.\n\nstd::string NodeRoleToString(NodeRole role);\n\nNodeRole NodeRoleFromString(const std::string& str);\n\n\n\nstd::string NullableNodeRoleToString(NodeRole role);\n\nNodeRole NullableNodeRoleFromString(const std::string& str);\n\n\n","file_path":"cpp/mindalpha/node_role.h","rank":54,"score":82539.09941880858},{"content":" def data(self):\n\n self._check_clean()\n","file_path":"python/mindalpha/embedding.py","rank":55,"score":82509.05630239297},{"content":"namespace mindalpha\n\n{\n\n\n\nstruct FileHeader {\n\n uint32_t magic;\n\n uint32_t patch;\n\n uint64_t size;\n\n static const uint32_t kMagicNum = 0xffffeeee;\n\n bool Check() {\n\n return magic == kMagicNum &&\n\n size > 0;\n\n }\n\n inline uint64_t Size() {\n\n return size;\n\n }\n","file_path":"cpp/mindalpha/file_utils.h","rank":56,"score":82486.9059677107},{"content":" def rank(self):\n","file_path":"python/mindalpha/agent.py","rank":57,"score":82362.52998376961},{"content":" def load_pickle_file(pickler_path):\n\n job_instance = None\n\n with open(pickler_path, 'rb') as f:\n\n try:\n\n job_instance = pickle.load(f)\n\n except Exception as err:\n\n raise Exception(f\"load {pickler_path} err: {err}\")\n","file_path":"python/mindalpha/experiment.py","rank":58,"score":81727.66145860594},{"content":" def pickle_file_name(self):\n","file_path":"python/mindalpha/experiment.py","rank":59,"score":81686.70427350655},{"content":"namespace mindalpha\n\n{\n\n\n\nsize_t SliceElements(const std::vector<size_t>& shape);\n\nsize_t TotalElements(const std::vector<size_t>& shape);\n\nstd::string ShapeToString(const std::vector<size_t>& shape);\n\nstd::vector<size_t> ShapeFromString(const std::string& str);\n\nvoid FillNaN(uint8_t* buffer, size_t size, DataType type);\n\nvoid MakeInitializerReady(pybind11::object initializer);\n\nvoid MakeUpdaterReady(pybind11::object udpater);\n\n\n","file_path":"cpp/mindalpha/tensor_utils.h","rank":60,"score":81620.57049188393},{"content":" def load(self, dir_path, *, keep_meta=False):\n\n # When spare tensors are repartitioned, we need to make\n\n # sure sparse tensors are cleared, as ``import_from``\n\n # won't clear or override existing keys. Make sure this\n\n # in C++ is a bit complicated, so we do it here.\n\n self.agent.barrier()\n\n if self.agent.rank == 0:\n\n asyncio.run(self.model._clear_tensors())\n\n # When spare tensors are repartitioned, they must be loaded\n\n # and pushed to servers later by all workers, so we do not\n\n # use ``if self.agent.rank == 0:`` here, instead this will\n\n # be checked in C++ code when necessary.\n\n self.agent.barrier()\n\n asyncio.run(self.model._load_tensors(dir_path, keep_meta=keep_meta))\n\n self.agent.barrier()\n\n asyncio.run(self.model._pull_tensors(force_mode=True))\n","file_path":"python/mindalpha/distributed_trainer.py","rank":61,"score":81344.01730649409},{"content":"namespace mindalpha\n\n{\n\n\n\nconst uint64_t map_file_signature_size = 32;\n\n\n\nstruct MapFileHeader\n\n{\n\n char signature[map_file_signature_size];\n\n uint64_t version;\n\n uint64_t reserved_; // for backward compatibility\n\n uint64_t key_type;\n\n uint64_t value_type;\n\n uint64_t key_count;\n\n uint64_t bucket_count;\n\n uint64_t value_count;\n\n uint64_t value_count_per_key;\n\n\n\n void FillBasicFields();\n\n bool IsSignatureValid() const;\n\n void Validate(const std::string& hint) const;\n\n};\n\n\n\nconst uint64_t map_file_header_size = sizeof(MapFileHeader);\n\n\n\nextern const char map_file_signature[map_file_signature_size];\n\nextern const uint64_t map_file_version;\n\n\n","file_path":"cpp/mindalpha/map_file_header.h","rank":62,"score":81342.3305264719},{"content":" def get_state_tensor(self, state, index):\n\n num = self.states_per_param\n\n dim = state.shape[-1]\n\n subscript = list(slice(None) for d in state.shape)\n\n subscript[-1] = slice(dim // num * index, dim // num * (index + 1))\n\n subscript = tuple(subscript)\n\n tensor = operator.getitem(state, subscript)\n","file_path":"python/mindalpha/updater.py","rank":63,"score":80906.15025491941},{"content":" def _load_column_name_map(self):\n\n if self._column_name_map is not None:\n\n raise RuntimeError(\"column map has been loaded\")\n\n column_name_file_path = self._checked_get_column_name_file_path()\n\n combine_schema = CombineSchema()\n\n combine_schema.load_column_name_from_file(use_s3(column_name_file_path))\n\n self._column_name_map = combine_schema.get_column_name_map()\n\n string = f\"\\033[32mloaded column name map from \\033[m{column_name_file_path!r}\"\n\n print(string)\n\n keys = tuple(item for item in self._selected_columns if item not in self._column_name_map)\n\n if keys:\n\n raise ValueError(f\"the following columns are not defined in {self._column_name_file_path!r}: \"\n","file_path":"python/mindalpha/cast.py","rank":64,"score":79833.24617827602},{"content":" def column_name_file_path(self, value):\n\n if value is not None:\n\n if not isinstance(value, str) or not file_exists(value):\n\n raise RuntimeError(f\"column name file {value!r} not found\")\n\n if self._column_name_file_path is not None:\n\n raise RuntimeError(f\"can not reset column_name_file_path {self._column_name_file_path!r} to {value!r}\")\n","file_path":"python/mindalpha/embedding.py","rank":65,"score":79668.0631530426},{"content":" def get_sparse_state_tensor(self, state, index):\n","file_path":"python/mindalpha/updater.py","rank":66,"score":78907.19288115755},{"content":" def get_dense_state_tensor(self, state, index):\n","file_path":"python/mindalpha/updater.py","rank":67,"score":78907.19288115755},{"content":" def _ensure_column_name_map_loaded(self):\n\n if self._column_name_map is None:\n","file_path":"python/mindalpha/cast.py","rank":68,"score":77908.53094834955},{"content":" def has_alternative_column_name_file_path(self):\n","file_path":"python/mindalpha/embedding.py","rank":69,"score":77747.41099158055},{"content":" def alternative_column_name_file_path(self, value):\n\n if value is not None:\n\n if not isinstance(value, str) or not file_exists(value):\n\n raise RuntimeError(f\"alternative column name file {value!r} not found\")\n\n if self._alternative_column_name_file_path is not None:\n\n raise RuntimeError(f\"can not reset alternative_column_name_file_path {self._alternative_column_name_file_path!r} to {value!r}\")\n","file_path":"python/mindalpha/embedding.py","rank":70,"score":77747.41099158055},{"content":"#\n\n# Copyright 2021 Mobvista\n\n#\n\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n\n# you may not use this file except in compliance with the License.\n\n# You may obtain a copy of the License at\n\n#\n\n# http://www.apache.org/licenses/LICENSE-2.0\n\n#\n\n# Unless required by applicable law or agreed to in writing, software\n\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n# See the License for the specific language governing permissions and\n\n# limitations under the License.\n\n#\n\n\n\nimport re\n\n\n\ndef is_valid_qualified_name(name):\n\n pattern = r'^[A-Za-z_.\\-][A-Za-z0-9_.\\-]*$'\n\n match = re.match(pattern, name)\n\n return match is not None\n","file_path":"python/mindalpha/name_utils.py","rank":71,"score":76436.84878000808},{"content":"#\n\n# Copyright 2021 Mobvista\n\n#\n\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n\n# you may not use this file except in compliance with the License.\n\n# You may obtain a copy of the License at\n\n#\n\n# http://www.apache.org/licenses/LICENSE-2.0\n\n#\n\n# Unless required by applicable law or agreed to in writing, software\n\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n# See the License for the specific language governing permissions and\n\n# limitations under the License.\n\n#\n\n\n\ndef file_exists(url):\n\n import os\n\n from .s3_utils import s3_file_exists\n\n if url.startswith('s3://') or url.startswith('s3a://'):\n\n return s3_file_exists(url)\n\n else:\n\n return os.path.isfile(url)\n\n\n\ndef dir_exists(url):\n\n import os\n\n from .s3_utils import get_s3_dir_size\n\n if url.startswith('s3://') or url.startswith('s3a://'):\n\n return get_s3_dir_size(url) > 0\n\n else:\n\n return os.path.isdir(url)\n\n\n\ndef delete_dir(url):\n\n import os\n\n import shutil\n\n from .s3_utils import delete_s3_dir\n\n if url.startswith('s3://') or url.startswith('s3a://'):\n\n delete_s3_dir(url)\n\n else:\n\n if os.path.isdir(url):\n\n shutil.rmtree(url)\n\n\n\ndef delete_file(url):\n\n import os\n\n from .s3_utils import delete_s3_file\n\n if url.startswith('s3://') or url.startswith('s3a://'):\n\n delete_s3_file(url)\n\n else:\n\n if os.path.isfile(url):\n\n os.remove(url)\n\n\n\ndef copy_dir(src_url, dst_url):\n\n import shutil\n\n from .s3_utils import copy_s3_dir\n\n from .s3_utils import download_s3_dir\n\n from .s3_utils import upload_s3_dir\n\n if src_url.startswith('s3://') or src_url.startswith('s3a://'):\n\n if dst_url.startswith('s3://') or dst_url.startswith('s3a://'):\n\n copy_s3_dir(src_url, dst_url)\n\n else:\n\n download_s3_dir(src_url, dst_url)\n\n else:\n\n if dst_url.startswith('s3://') or dst_url.startswith('s3a://'):\n\n upload_s3_dir(src_url, dst_url)\n\n else:\n\n shutil.copytree(src_url, dst_url)\n","file_path":"python/mindalpha/file_utils.py","rank":72,"score":76301.33832529862},{"content":" def _checked_get_column_name_file_path(self):\n\n if self._column_name_file_path is None:\n\n raise RuntimeError(\"column_name_file_path is not set\")\n","file_path":"python/mindalpha/cast.py","rank":73,"score":75917.75263006195},{"content":" def _checked_get_column_name_file_path(self):\n\n if self._column_name_file_path is None:\n\n raise RuntimeError(\"column_name_file_path is not set\")\n","file_path":"python/mindalpha/embedding.py","rank":74,"score":75917.75263006195},{"content":"#\n\n# Copyright 2021 Mobvista\n\n#\n\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n\n# you may not use this file except in compliance with the License.\n\n# You may obtain a copy of the License at\n\n#\n\n# http://www.apache.org/licenses/LICENSE-2.0\n\n#\n\n# Unless required by applicable law or agreed to in writing, software\n\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n# See the License for the specific language governing permissions and\n\n# limitations under the License.\n\n#\n\n\n\nimport asyncio\n\nimport torch\n\nfrom ._mindalpha import DenseTensor\n\nfrom ._mindalpha import SparseTensor\n\nfrom .embedding import EmbeddingOperator\n\nfrom .url_utils import use_s3\n\n\n\nclass DistributedTensor(object):\n\n def __init__(self, name, item, name_prefix):\n\n self.__name = name if name_prefix is None else name_prefix + name\n\n self.__item = item\n\n self.__handle = None\n\n\n\n @property\n\n def name(self):\n\n return self.__name\n\n\n\n @property\n\n def item(self):\n\n return self.__item\n\n\n\n @property\n\n def _handle(self):\n\n return self.__handle\n\n\n\n @property\n\n def is_dense(self):\n\n return isinstance(self.item, torch.Tensor)\n\n\n\n @property\n\n def is_dense_parameter(self):\n\n return isinstance(self.item, torch.nn.Parameter)\n\n\n\n @property\n\n def is_dense_buffer(self):\n\n return self.is_dense and not self.is_dense_parameter\n\n\n\n @property\n\n def is_sparse(self):\n\n return isinstance(self.item, EmbeddingOperator)\n\n\n\n @property\n\n def is_backing(self):\n\n return self.is_sparse and self.item.is_backing\n\n\n\n @property\n\n def is_exported(self):\n\n return self.is_sparse and self.item.is_exported\n\n\n\n def _zero_grad(self):\n\n if self.is_dense_parameter or self.is_sparse:\n\n if self.item.grad is not None:\n\n self.item.grad.detach_()\n\n self.item.grad.zero_()\n\n\n\n def _init_tensor(self, trainer):\n\n if self.is_dense:\n\n return self._init_dense_tensor(trainer)\n\n else:\n\n return self._init_sparse_tensor(trainer)\n\n\n\n def _init_tensor_log(self, x):\n\n if self.is_dense_parameter:\n\n string = \"\\033[38;5;046m\"\n\n elif self.is_dense_buffer:\n\n string = \"\\033[38;5;051m\"\n\n else:\n\n string = \"\\033[38;5;196m\"\n\n if self.is_dense:\n\n string += f\"init dense tensor {x.name} with shape {x.data_shape}, \"\n\n else:\n\n string += f\"init sparse tensor {x.name} with slice shape {x.slice_data_shape}, \"\n\n string += f\"updater {x.updater} and \"\n\n string += f\"initializer {x.initializer}\"\n\n string += \"\\033[m\"\n\n print(string)\n\n\n\n def _init_dense_tensor(self, trainer):\n\n x = DenseTensor()\n\n x.name = self.name\n\n x.data_type = trainer._get_dtype_name(self)\n\n x.data_shape = trainer._get_dense_data_shape(self)\n\n x.state_shape = trainer._get_dense_state_shape(self)\n\n x.initializer = trainer._get_dense_initializer(self)\n\n x.updater = trainer._get_dense_updater(self)\n\n x.partition_count = trainer.agent.server_count\n\n x.agent = trainer.agent._cxx_agent\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def init_dense_tensor_done():\n\n self.__handle = x\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._init_tensor_log(x)\n\n x.init(init_dense_tensor_done)\n\n return future\n\n\n\n def _init_sparse_tensor(self, trainer):\n\n x = SparseTensor()\n\n x.name = self.name\n\n x.data_type = trainer._get_dtype_name(self)\n\n x.slice_data_shape = trainer._get_sparse_slice_data_shape(self)\n\n x.slice_state_shape = trainer._get_sparse_slice_state_shape(self)\n\n x.initializer = trainer._get_sparse_initializer(self)\n\n x.updater = trainer._get_sparse_updater(self)\n\n x.partition_count = trainer.agent.server_count\n\n x.agent = trainer.agent._cxx_agent\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def init_sparse_tensor_done():\n\n self.__handle = x\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._init_tensor_log(x)\n\n x.init(init_sparse_tensor_done)\n\n return future\n\n\n\n def _pull_tensor(self):\n\n if self.is_dense:\n\n return self._pull_dense_tensor()\n\n else:\n\n return self._pull_sparse_tensor()\n\n\n\n def _pull_dense_tensor(self):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def pull_dense_tensor_done(data):\n\n data = torch.from_numpy(data)\n\n data = data.view(self.item.shape)\n\n self.item.data.copy_(data)\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.pull(pull_dense_tensor_done, False)\n\n return future\n\n\n\n async def _pull_sparse_tensor(self):\n\n op = self.item\n\n keys = op.keys\n\n if keys is None:\n\n return\n\n read_only = not op.training or not op.requires_grad\n\n nan_fill = read_only and op.use_nan_fill\n\n def pull_sparse_tensor():\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def pull_sparse_tensor_done(data):\n\n op._check_dtype_and_shape(keys, data)\n\n op._update_data(data)\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.pull(keys, pull_sparse_tensor_done, read_only, nan_fill)\n\n return future\n\n await pull_sparse_tensor()\n\n\n\n def _push_tensor(self, *, is_value=False, skip_no_grad=True):\n\n if self.is_dense:\n\n return self._push_dense_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\n\n else:\n\n return self._push_sparse_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\n\n\n\n async def _push_dense_tensor(self, *, is_value=False, skip_no_grad=True):\n\n data = self.item\n\n if self.is_dense_parameter:\n\n if not is_value and data.grad is None:\n\n if skip_no_grad:\n\n return\n\n raise RuntimeError(f\"the gradient of parameter {self.name!r} is not available\")\n\n # For dense buffers, use .data to fake gradients.\n\n # But we still need to pass is_value=False, otherwise updaters on server won't be called.\n\n data = data.data.numpy() if self.is_dense_buffer or is_value else data.grad.data.numpy()\n\n def push_dense_tensor():\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def push_dense_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.push(data, push_dense_tensor_done, is_value, False)\n\n return future\n\n await push_dense_tensor()\n\n\n\n async def _push_sparse_tensor(self, *, is_value=False, skip_no_grad=True):\n\n op = self.item\n\n keys, data = op.keys_and_data\n\n if keys is None:\n\n return\n\n if not is_value and data.grad is None:\n\n if skip_no_grad:\n\n return\n\n raise RuntimeError(f\"the gradient of operator {op!r} is not available\")\n\n data = data.data.numpy() if is_value else data.grad.data.numpy()\n\n op._check_dtype_and_shape(keys, data)\n\n def push_sparse_tensor():\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def push_sparse_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.push(keys, data, push_sparse_tensor_done, is_value)\n\n return future\n\n await push_sparse_tensor()\n\n\n\n def _load_tensor(self, dir_path, *, keep_meta=False):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def load_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n self._handle.load(dir_path, load_tensor_done, keep_meta)\n\n return future\n\n\n\n def _save_tensor(self, dir_path):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def save_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n if self.is_sparse:\n\n text_mode = self.item.save_as_text\n\n self._handle.save(dir_path, save_tensor_done, text_mode)\n\n else:\n\n self._handle.save(dir_path, save_tensor_done)\n\n return future\n\n\n\n def _sparse_tensor_clear(self):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_clear_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.clear(sparse_tensor_clear_done)\n\n return future\n\n\n\n def _sparse_tensor_export(self, dir_path):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_export_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n self._handle.export(dir_path, sparse_tensor_export_done)\n\n return future\n\n\n\n def _sparse_tensor_import_from(self, meta_file_path, *,\n\n data_only=False, skip_existing=False,\n\n transform_key=False, feature_name=''):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_import_from_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n meta_file_path = use_s3(meta_file_path)\n\n self._handle.import_from(meta_file_path, sparse_tensor_import_from_done,\n\n data_only, skip_existing,\n\n transform_key, feature_name)\n\n return future\n\n\n\n def _sparse_tensor_prune_small(self, epsilon):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_prune_small_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.prune_small(epsilon, sparse_tensor_prune_small_done)\n\n return future\n\n\n\n def _sparse_tensor_prune_old(self, max_age):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_prune_old_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.prune_old(max_age, sparse_tensor_prune_old_done)\n\n return future\n","file_path":"python/mindalpha/distributed_tensor.py","rank":75,"score":75435.00284947186},{"content":"#\n\n# Copyright 2021 Mobvista\n\n#\n\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n\n# you may not use this file except in compliance with the License.\n\n# You may obtain a copy of the License at\n\n#\n\n# http://www.apache.org/licenses/LICENSE-2.0\n\n#\n\n# Unless required by applicable law or agreed to in writing, software\n\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n# See the License for the specific language governing permissions and\n\n# limitations under the License.\n\n#\n\n\n\nimport asyncio\n\nimport torch\n\nimport pyspark\n\nfrom .embedding import EmbeddingOperator\n\nfrom .estimator import PyTorchAgent\n\nfrom .estimator import PyTorchLauncher\n\nfrom .estimator import PyTorchModel\n\nfrom .estimator import PyTorchEstimator\n\n\n\nclass TwoTowerRankingModule(torch.nn.Module):\n\n def __init__(self, user_module, item_module, item_embedding_module, similarity_module):\n\n super().__init__()\n\n if not isinstance(user_module, torch.nn.Module):\n\n raise TypeError(f\"user_module must be torch.nn.Module; {user_module!r} is invalid\")\n\n if not isinstance(item_module, torch.nn.Module):\n\n raise TypeError(f\"item_module must be torch.nn.Module; {item_module!r} is invalid\")\n\n if not isinstance(item_embedding_module, torch.nn.Module):\n\n raise TypeError(f\"item_embedding_module must be torch.nn.Module; {item_embedding_module!r} is invalid\")\n\n if not isinstance(similarity_module, torch.nn.Module):\n\n raise TypeError(f\"similarity_module must be torch.nn.Module; {similarity_module!r} is invalid\")\n\n self._user_module = user_module\n\n self._item_module = item_module\n\n self._item_embedding_module = item_embedding_module\n\n self._similarity_module = similarity_module\n\n\n\n @property\n\n def user_module(self):\n\n return self._user_module\n\n\n\n @property\n\n def item_module(self):\n\n return self._item_module\n\n\n\n @property\n\n def item_embedding_module(self):\n\n return self._item_embedding_module\n\n\n\n @property\n\n def similarity_module(self):\n\n return self._similarity_module\n\n\n\n def _get_item_embedding(self, x):\n\n if self.training or self._item_embedding_module is None:\n\n if self._item_module is None:\n\n raise RuntimeError(\"item_module is None\")\n\n item_emb = self._item_module(x)\n\n else:\n\n if self._item_embedding_module is None:\n\n raise RuntimeError(\"item_embedding_module is None\")\n\n item_emb = self._item_embedding_module(x)\n\n return item_emb\n\n\n\n def forward(self, x):\n\n user_emb = self._user_module(x)\n\n item_emb = self._get_item_embedding(x)\n\n sim = self._similarity_module(user_emb, item_emb)\n\n return sim\n\n\n\nclass TwoTowerRankingAgent(PyTorchAgent):\n\n def _mark_unexported_operators(self, module):\n\n for name, mod in module.named_modules():\n\n if isinstance(mod, EmbeddingOperator):\n\n mod.is_exported = False\n\n\n\n def _unmark_unexported_operators(self, module):\n\n for name, mod in module.named_modules():\n\n if isinstance(mod, EmbeddingOperator):\n\n mod.is_exported = True\n\n\n\n def _mark_backing_operators(self, module):\n\n for name, mod in module.named_modules():\n\n if isinstance(mod, EmbeddingOperator):\n\n mod.is_backing = True\n\n\n\n def _unmark_backing_operators(self, module):\n\n for name, mod in module.named_modules():\n\n if isinstance(mod, EmbeddingOperator):\n\n mod.is_backing = False\n\n\n\n def _reload_combine_schemas(self, module, use_alternative_column_name_file):\n\n for name, mod in module.named_modules():\n\n if isinstance(mod, EmbeddingOperator):\n\n if mod.has_alternative_column_name_file_path:\n\n mod.reload_combine_schema(use_alternative_column_name_file)\n\n\n\n ## train\n\n\n\n @classmethod\n\n def _handle_item_embedding_module_for_train(cls, _):\n\n self = __class__.get_instance()\n\n self._mark_backing_operators(self.module.item_embedding_module)\n\n return _\n\n\n\n @classmethod\n\n def _restore_handle_item_embedding_module_for_train(cls, _):\n\n self = __class__.get_instance()\n\n self._unmark_backing_operators(self.module.item_embedding_module)\n\n return _\n\n\n\n def feed_training_dataset(self):\n\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\n\n rdd.barrier().mapPartitions(self._handle_item_embedding_module_for_train).collect()\n\n super().feed_training_dataset()\n\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\n\n rdd.barrier().mapPartitions(self._restore_handle_item_embedding_module_for_train).collect()\n\n self.feed_item_dataset()\n\n\n\n ## item_predict\n\n\n\n @classmethod\n\n def _pull_model_for_item_predict(cls, _):\n\n self = __class__.get_instance()\n\n asyncio.run(self.model._pull_tensors(force_mode=True))\n\n return _\n\n\n\n @classmethod\n\n def _handle_submodel_for_item_predict(cls, _):\n\n self = __class__.get_instance()\n\n self._reload_combine_schemas(self.module.item_module, True)\n\n self._reload_combine_schemas(self.module.item_embedding_module, True)\n\n self._item_predict_submodel = self.model.get_submodel(self.module.item_module, '_item_module.')\n\n return _\n\n\n\n @classmethod\n\n def _restore_handle_submodel_for_item_predict(cls, _):\n\n self = __class__.get_instance()\n\n self._reload_combine_schemas(self.module.item_module, False)\n\n self._reload_combine_schemas(self.module.item_embedding_module, False)\n\n del self._item_predict_submodel\n\n return _\n\n\n\n def feed_item_dataset(self):\n\n if self.item_dataset is not None:\n\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\n\n rdd.barrier().mapPartitions(self._pull_model_for_item_predict).collect()\n\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\n\n rdd.barrier().mapPartitions(self._handle_submodel_for_item_predict).collect()\n\n df = self.item_dataset.select(self.feed_item_minibatch()(*self.item_dataset.columns).alias('item_predict'))\n\n df.write.format('noop').mode('overwrite').save()\n\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\n\n rdd.barrier().mapPartitions(self._restore_handle_submodel_for_item_predict).collect()\n\n\n\n ## online_predict\n\n\n\n def _handle_item_module_for_online_predict(self):\n\n self._mark_unexported_operators(self.module.item_module)\n\n self._saved_item_module = self.module._item_module\n\n self.module._item_module = None\n\n\n\n def _restore_handle_item_module_for_online_predict(self):\n\n self.module._item_module = self._saved_item_module\n\n del self._saved_item_module\n\n self._unmark_unexported_operators(self.module.item_module)\n\n\n\n def export_model(self):\n\n if self.model_export_path is not None:\n\n self._handle_item_module_for_online_predict()\n\n super().export_model()\n\n self._restore_handle_item_module_for_online_predict()\n\n\n\n ## offline_predict\n\n\n\n def _handle_module_for_offline_predict(self):\n\n if self.use_amended_module_for_offline_predict:\n\n self._saved_item_module = self.module._item_module\n\n self.module._item_module = None\n\n else:\n\n self._saved_item_embedding_module = self.module._item_embedding_module\n\n self.module._item_embedding_module = None\n\n\n\n def _restore_handle_module_for_offline_predict(self):\n\n if self.use_amended_module_for_offline_predict:\n\n self.module._item_module = self._saved_item_module\n\n del self._saved_item_module\n\n else:\n\n self.module._item_embedding_module = self._saved_item_embedding_module\n\n del self._saved_item_embedding_module\n\n\n\n def setup_trainer(self):\n\n if not self.is_training_mode:\n\n self._handle_module_for_offline_predict()\n\n super().setup_trainer()\n\n\n\n def worker_stop(self):\n\n if not self.is_training_mode:\n\n self._restore_handle_module_for_offline_predict()\n\n super().worker_stop()\n\n\n\n ## helper methods for item_predict\n\n\n\n def feed_item_minibatch(self):\n\n from pyspark.sql.types import FloatType\n\n from pyspark.sql.functions import pandas_udf\n\n @pandas_udf(returnType=FloatType())\n\n def _feed_item_minibatch(*minibatch):\n\n self = __class__.get_instance()\n\n result = self.predict_item_minibatch(minibatch)\n\n result = self.process_minibatch_result(minibatch, result)\n\n return result\n\n return _feed_item_minibatch\n\n\n\n def _execute_combine(self, module, ndarrays):\n\n for name, mod in module.named_modules():\n\n if isinstance(mod, EmbeddingOperator):\n\n indices, offsets = mod._do_combine(ndarrays)\n\n return indices\n\n\n\n def _execute_push(self, module, keys, embeddings):\n\n for name, mod in module.named_modules():\n\n if isinstance(mod, EmbeddingOperator):\n\n mod.keys_and_data = keys, embeddings\n\n tensor = mod._distributed_tensor\n\n asyncio.run(tensor._push_tensor(is_value=True))\n\n mod._clean()\n\n return\n\n\n\n def _execute_item_embedding_combine(self, ndarrays):\n\n keys = self._execute_combine(self.module.item_embedding_module, ndarrays)\n\n return keys\n\n\n\n def _execute_item_embedding_push(self, keys, embeddings):\n\n self._execute_push(self.module.item_embedding_module, keys, embeddings)\n\n\n\n def predict_item_minibatch(self, minibatch):\n\n self._item_predict_submodel.eval()\n\n ndarrays = [col.values for col in minibatch]\n\n predictions = self._item_predict_submodel(ndarrays)\n\n embeddings = predictions.detach().numpy()\n\n keys = self._execute_item_embedding_combine(ndarrays)\n\n self._execute_item_embedding_push(keys, embeddings)\n\n\n\nclass TwoTowerRankingLauncher(PyTorchLauncher):\n\n def __init__(self):\n\n super().__init__()\n\n self.item_dataset = None\n\n\n\n def _initialize_agent(self, agent):\n\n agent.item_dataset = self.item_dataset\n\n super()._initialize_agent(agent)\n\n\n\nclass TwoTowerRankingHelperMixin(object):\n\n def __init__(self, item_dataset=None, use_amended_module_for_offline_predict=False, **kwargs):\n\n super().__init__(**kwargs)\n\n self.item_dataset = item_dataset\n\n self.use_amended_module_for_offline_predict = use_amended_module_for_offline_predict\n\n self.extra_agent_attributes['use_amended_module_for_offline_predict'] = self.use_amended_module_for_offline_predict\n\n\n\n def _check_properties(self):\n\n super()._check_properties()\n\n if not isinstance(self.module, TwoTowerRankingModule):\n\n raise TypeError(f\"module must be TwoTowerRankingModule; {self.module!r} is invalid\")\n\n if self.item_dataset is not None and not isinstance(self.item_dataset, pyspark.sql.DataFrame):\n\n raise TypeError(f\"item_dataset must be pyspark.sql.DataFrame; {self.item_dataset!r} is invalid\")\n\n\n\n def _get_launcher_class(self):\n\n return TwoTowerRankingLauncher\n\n\n\n def _get_model_class(self):\n\n return TwoTowerRankingModel\n\n\n\n def _get_agent_class(self):\n\n return self.agent_class or TwoTowerRankingAgent\n\n\n\n def _get_model_arguments(self, module):\n\n args = super()._get_model_arguments(module)\n\n args['item_dataset'] = self.item_dataset\n\n args['use_amended_module_for_offline_predict'] = self.use_amended_module_for_offline_predict\n\n return args\n\n\n\n def _create_launcher(self, dataset, is_training_mode):\n\n launcher = super()._create_launcher(dataset, is_training_mode)\n\n if is_training_mode:\n\n launcher.item_dataset = self.item_dataset\n\n return launcher\n\n\n\nclass TwoTowerRankingModel(TwoTowerRankingHelperMixin, PyTorchModel):\n\n pass\n\n\n\nclass TwoTowerRankingEstimator(TwoTowerRankingHelperMixin, PyTorchEstimator):\n\n def _check_properties(self):\n\n super()._check_properties()\n\n if self.model_export_path is not None and self.item_dataset is None:\n\n raise RuntimeError(\"item_dataset must be specified to export model\")\n\n if self.use_amended_module_for_offline_predict and self.item_dataset is None:\n\n raise RuntimeError(\"item_dataset must be specified to use amended module for offline predict\")\n","file_path":"python/mindalpha/two_tower_ranking.py","rank":76,"score":75172.36671581458},{"content":" def _checked_get_alternative_column_name_file_path(self):\n\n if self._alternative_column_name_file_path is None:\n\n raise RuntimeError(\"alternative_column_name_file_path is not set\")\n","file_path":"python/mindalpha/embedding.py","rank":77,"score":74172.74505025278},{"content":" class ActorProcess* actor_process_ = nullptr;\n\n\n\n struct TrackerEntry\n\n {\n\n int total = 0;\n\n std::vector<PSMessage> responses;\n\n\n\n void Clear()\n\n {\n\n responses.clear();\n\n }\n\n };\n\n\n\n std::mutex tracker_mutex_;\n\n std::condition_variable tracker_cv_;\n\n std::unordered_map<int64_t, TrackerEntry> tracker_;\n\n\n\n bool is_coordinator_ = false;\n\n bool is_server_ = false;\n\n bool is_worker_ = false;\n\n\n\n int server_count_ = 0;\n\n int worker_count_ = 0;\n\n};\n\n\n\n}\n","file_path":"cpp/mindalpha/ps_agent.h","rank":78,"score":64223.99688488009},{"content":"class NodeInfo\n\n{\n\npublic:\n\n NodeRole GetRole() const { return role_; }\n\n void SetRole(NodeRole value) { role_ = value; }\n\n\n\n int GetNodeId() const { return node_id_; }\n\n void SetNodeId(int value) { node_id_ = value; }\n\n\n\n const std::string& GetHostName() const { return host_name_; }\n\n void SetHostName(std::string value) { host_name_ = std::move(value); }\n\n\n\n int GetPort() const { return port_; }\n\n void SetPort(int value) { port_ = value; }\n\n\n\n std::string GetAddress() const { return host_name_ + \":\" + std::to_string(port_); }\n\n\n\n std::string ToString() const;\n\n std::string ToShortString() const;\n\n std::string ToJsonString() const;\n","file_path":"cpp/mindalpha/node_info.h","rank":79,"score":59075.37796274977},{"content":"class NodeControl\n\n{\n\npublic:\n\n bool IsEmpty() const { return command_ == NullNodeControlCommand; }\n\n\n\n NodeControlCommand GetCommand() const { return command_; }\n\n void SetCommand(NodeControlCommand value) { command_ = value; }\n\n\n\n //\n\n // Methods related to node info.\n\n //\n\n std::vector<NodeInfo>& GetNodes() { return nodes_; }\n\n const std::vector<NodeInfo>& GetNodes() const { return nodes_; }\n\n void SetNodes(std::vector<NodeInfo> value) { nodes_ = std::move(value); }\n\n\n\n void ClearNodes() { nodes_.clear(); }\n\n void AddNode(NodeInfo value) { nodes_.push_back(std::move(value)); }\n\n\n\n //\n\n // Methods related to barrier group.\n","file_path":"cpp/mindalpha/node_control.h","rank":80,"score":59075.37796274977},{"content":"class NodeManager\n\n{\n\npublic:\n\n explicit NodeManager(std::shared_ptr<ActorConfig> config);\n\n\n\n std::shared_ptr<ActorConfig> GetConfig() const { return config_; }\n\n void SetConfig(std::shared_ptr<ActorConfig> value) { config_ = std::move(value); }\n\n\n\n const std::vector<int>& GetNodeIds(int group) const;\n\n void Barrier(int group, ActorProcess& process);\n\n void NotifyBarrierDone(const Message& msg);\n\n void UpdateHeartbeat(int nodeId, time_t t);\n\n std::vector<int> GetDeadNodes(int timeout);\n\n\n\nprivate:\n\n void InitNodeIds();\n\n\n\n std::shared_ptr<ActorConfig> config_;\n\n std::mutex start_mutex_;\n\n time_t start_time_ = 0;\n\n std::unordered_map<int, std::vector<int>> node_ids_;\n\n std::mutex barrier_mutex_;\n\n std::condition_variable barrier_cv_;\n\n bool barrier_done_;\n\n std::mutex heartbeat_mutex_;\n\n std::unordered_map<int, time_t> heartbeats_;\n\n};\n\n\n\n}\n","file_path":"cpp/mindalpha/node_manager.h","rank":81,"score":59075.37796274977},{"content":"class MessageMeta\n\n{\n\npublic:\n\n int GetMessageId() const { return message_id_; }\n\n void SetMessageId(int value) { message_id_ = value; }\n\n\n\n int GetSender() const { return sender_; }\n\n void SetSender(int value) { sender_ = value; }\n\n\n\n int GetReceiver() const { return receiver_; }\n\n void SetReceiver(int value) { receiver_ = value; }\n\n\n\n bool IsRequest() const { return is_request_; }\n\n void SetIsRequest(bool value) { is_request_ = value; }\n\n\n\n bool IsException() const { return is_exception_; }\n\n void SetIsException(bool value) { is_exception_ = value; }\n\n\n\n const std::string& GetBody() const { return body_; }\n\n void SetBody(std::string value) { body_ = std::move(value); }\n","file_path":"cpp/mindalpha/message_meta.h","rank":82,"score":58993.800792978516},{"content":"class DenseTensor\n\n{\n\npublic:\n\n DenseTensorMeta& GetMeta() { return meta_; }\n\n const DenseTensorMeta& GetMeta() const { return meta_; }\n\n void SetMeta(DenseTensorMeta value) { meta_ = std::move(value); }\n\n\n\n std::shared_ptr<PSAgent> GetAgent() const { return agent_; }\n\n void SetAgent(std::shared_ptr<PSAgent> value) { agent_ = std::move(value); }\n\n\n\n void Init(std::function<void()> cb);\n\n void Dispose(std::function<void()> cb);\n\n void Push(SmartArray<uint8_t> in, std::function<void()> cb, bool is_value = false, bool is_state = false);\n\n void Pull(std::function<void(SmartArray<uint8_t> out)> cb, bool is_state = false);\n\n void PushMeta(const DenseTensorMeta& meta, std::function<void()> cb);\n\n void PullMeta(std::function<void(DenseTensorMeta meta)> cb);\n\n void Load(const std::string& dir_path, std::function<void()> cb, bool keep_meta = false);\n\n void Save(const std::string& dir_path, std::function<void()> cb);\n\n\n\nprivate:\n\n std::string GetDenseMetaPath(const std::string& dir_path) const;\n\n std::string GetDenseDataPath(const std::string& dir_path) const;\n\n std::string GetDenseStatePath(const std::string& dir_path) const;\n\n\n\n DenseTensorMeta meta_;\n\n std::shared_ptr<PSAgent> agent_;\n\n};\n\n\n\n}\n","file_path":"cpp/mindalpha/dense_tensor.h","rank":83,"score":57832.04558497133},{"content":"class SparseTensor\n\n{\n\npublic:\n\n SparseTensorMeta& GetMeta() { return meta_; }\n\n const SparseTensorMeta& GetMeta() const { return meta_; }\n\n void SetMeta(SparseTensorMeta value) { meta_ = std::move(value); }\n\n\n\n std::shared_ptr<PSAgent> GetAgent() const { return agent_; }\n\n void SetAgent(std::shared_ptr<PSAgent> value) { agent_ = std::move(value); }\n\n\n\n void Init(std::function<void()> cb);\n\n void Dispose(std::function<void()> cb);\n\n void Clear(std::function<void()> cb);\n\n void Push(SmartArray<uint8_t> keys, SmartArray<uint8_t> in, std::function<void()> cb,\n\n bool is_value = false);\n\n void Pull(SmartArray<uint8_t> keys, std::function<void(SmartArray<uint8_t> out)> cb,\n\n bool read_only = false, bool nan_fill = false);\n\n void PushPartition(ArrayHashMap<uint64_t, uint8_t>& data, std::function<void()> cb,\n\n bool data_only = false, bool skip_existing = false);\n\n void PullPartition(ArrayHashMap<uint64_t, uint8_t>& data, std::function<void()> cb,\n","file_path":"cpp/mindalpha/sparse_tensor.h","rank":84,"score":57832.04558497133},{"content":"class TensorPartitionStore\n\n{\n\npublic:\n\n int GetPartitionCount() const { return partition_count_; }\n\n void SetPartitionCount(int value) { partition_count_ = value; }\n\n\n\n int GetPartitionIndex() const { return partition_index_; }\n\n void SetPartitionIndex(int value) { partition_index_ = value; }\n\n\n\n void DenseInit(const DenseTensorMeta& meta);\n\n void DenseDispose(const std::string& name);\n\n void DensePush(const std::string& name, PSMessage req, bool is_value, bool is_state);\n\n PSMessage DensePull(const std::string& name, bool is_state);\n\n void DensePushMeta(const std::string& name, const DenseTensorMeta& meta);\n\n PSMessage DensePullMeta(const std::string& name);\n\n\n\n void SparseInit(const SparseTensorMeta& meta);\n\n void SparseDispose(const std::string& name);\n\n void SparseClear(const std::string& name);\n\n void SparsePush(const std::string& name, PSMessage req, bool is_value);\n","file_path":"cpp/mindalpha/tensor_partition_store.h","rank":85,"score":55685.93481683781},{"content":"class SparseTensorPartition\n\n{\n\npublic:\n\n SparseTensorMeta& GetMeta() { return meta_; }\n\n const SparseTensorMeta& GetMeta() const { return meta_; }\n\n void SetMeta(SparseTensorMeta value) { meta_ = std::move(value); }\n\n\n\n int GetPartitionIndex() const { return partition_index_; }\n\n void SetPartitionIndex(int value) { partition_index_ = value; }\n\n\n\n void AllocateHashMap();\n\n void Clear();\n\n void HandlePush(SmartArray<uint8_t> keys, SmartArray<uint8_t> in, bool is_value);\n\n SmartArray<uint8_t> HandlePull(SmartArray<uint8_t> keys, bool read_only, bool nan_fill);\n\n void HandlePushPartition(SmartArray<uint8_t> keys, SmartArray<uint8_t> in, bool data_only, bool skip_existing);\n\n SmartArray<uint8_t> HandlePullPartition(bool data_only, int index, int count, SmartArray<uint8_t>& keys);\n\n void HandlePushMeta(const SparseTensorMeta& meta);\n\n const SparseTensorMeta& HandlePullMeta();\n\n void Load(const std::string& dir_path);\n\n void Save(const std::string& dir_path, bool text_mode);\n","file_path":"cpp/mindalpha/sparse_tensor_partition.h","rank":86,"score":55685.93481683781},{"content":"class DenseTensorPartition\n\n{\n\npublic:\n\n DenseTensorMeta& GetMeta() { return meta_; }\n\n const DenseTensorMeta& GetMeta() const { return meta_; }\n\n void SetMeta(DenseTensorMeta value) { meta_ = std::move(value); }\n\n\n\n std::vector<size_t>& GetPartitionDataShape() { return partition_data_shape_; }\n\n const std::vector<size_t>& GetPartitionDataShape() const { return partition_data_shape_; }\n\n void SetPartitionDataShape(std::vector<size_t> value) { partition_data_shape_ = std::move(value); }\n\n\n\n std::vector<size_t>& GetPartitionStateShape() { return partition_state_shape_; }\n\n const std::vector<size_t>& GetPartitionStateShape() const { return partition_state_shape_; }\n\n void SetPartitionStateShape(std::vector<size_t> value) { partition_state_shape_ = std::move(value); }\n\n\n\n int GetPartitionIndex() const { return partition_index_; }\n\n void SetPartitionIndex(int value) { partition_index_ = value; }\n\n\n\n size_t GetOffset() const { return offset_; }\n\n void SetOffset(size_t value) { offset_ = value; }\n","file_path":"cpp/mindalpha/dense_tensor_partition.h","rank":87,"score":55685.93481683781},{"content":"def file_exists(url):\n\n import os\n\n from .s3_utils import s3_file_exists\n\n if url.startswith('s3://') or url.startswith('s3a://'):\n\n return s3_file_exists(url)\n\n else:\n","file_path":"python/mindalpha/file_utils.py","rank":88,"score":54956.713616043155},{"content":"def delete_file(url):\n\n import os\n\n from .s3_utils import delete_s3_file\n\n if url.startswith('s3://') or url.startswith('s3a://'):\n\n delete_s3_file(url)\n\n else:\n\n if os.path.isfile(url):\n","file_path":"python/mindalpha/file_utils.py","rank":89,"score":54956.713616043155},{"content":"class LocalFileSystem : public FileSystem {\n\npublic:\n\n /*! \\brief destructor */\n\n virtual ~LocalFileSystem() {\n\n }\n\n /*!\n\n * \\brief get information about a path\n\n * \\param path the path to the file\n\n * \\return the information about the file\n\n */\n\n virtual FileInfo GetPathInfo(const URI &path);\n\n /*!\n\n * \\brief list files in a directory\n\n * \\param path to the file\n\n * \\param out_list the output information about the files\n\n */\n\n virtual void ListDirectory(const URI &path, std::vector<FileInfo> *out_list);\n\n /*!\n\n * \\brief open a stream, will report error and exit if bad thing happens\n\n * NOTE: the IStream can continue to work even when filesystem was destructed\n","file_path":"cpp/mindalpha/local_filesys.h","rank":90,"score":54788.33024675009},{"content":"def is_valid_qualified_name(name):\n\n pattern = r'^[A-Za-z_.\\-][A-Za-z0-9_.\\-]*$'\n\n match = re.match(pattern, name)\n","file_path":"python/mindalpha/name_utils.py","rank":91,"score":54208.31422425268},{"content":" def _push_tensor(self, *, is_value=False, skip_no_grad=True):\n\n if self.is_dense:\n\n return self._push_dense_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\n\n else:\n","file_path":"python/mindalpha/distributed_tensor.py","rank":92,"score":53883.14474432791},{"content":"class DistributedTensor(object):\n\n def __init__(self, name, item, name_prefix):\n\n self.__name = name if name_prefix is None else name_prefix + name\n\n self.__item = item\n\n self.__handle = None\n\n\n\n @property\n\n def name(self):\n\n return self.__name\n\n\n\n @property\n\n def item(self):\n\n return self.__item\n\n\n\n @property\n\n def _handle(self):\n\n return self.__handle\n\n\n\n @property\n\n def is_dense(self):\n\n return isinstance(self.item, torch.Tensor)\n\n\n\n @property\n\n def is_dense_parameter(self):\n\n return isinstance(self.item, torch.nn.Parameter)\n\n\n\n @property\n\n def is_dense_buffer(self):\n\n return self.is_dense and not self.is_dense_parameter\n\n\n\n @property\n\n def is_sparse(self):\n\n return isinstance(self.item, EmbeddingOperator)\n\n\n\n @property\n\n def is_backing(self):\n\n return self.is_sparse and self.item.is_backing\n\n\n\n @property\n\n def is_exported(self):\n\n return self.is_sparse and self.item.is_exported\n\n\n\n def _zero_grad(self):\n\n if self.is_dense_parameter or self.is_sparse:\n\n if self.item.grad is not None:\n\n self.item.grad.detach_()\n\n self.item.grad.zero_()\n\n\n\n def _init_tensor(self, trainer):\n\n if self.is_dense:\n\n return self._init_dense_tensor(trainer)\n\n else:\n\n return self._init_sparse_tensor(trainer)\n\n\n\n def _init_tensor_log(self, x):\n\n if self.is_dense_parameter:\n\n string = \"\\033[38;5;046m\"\n\n elif self.is_dense_buffer:\n\n string = \"\\033[38;5;051m\"\n\n else:\n\n string = \"\\033[38;5;196m\"\n\n if self.is_dense:\n\n string += f\"init dense tensor {x.name} with shape {x.data_shape}, \"\n\n else:\n\n string += f\"init sparse tensor {x.name} with slice shape {x.slice_data_shape}, \"\n\n string += f\"updater {x.updater} and \"\n\n string += f\"initializer {x.initializer}\"\n\n string += \"\\033[m\"\n\n print(string)\n\n\n\n def _init_dense_tensor(self, trainer):\n\n x = DenseTensor()\n\n x.name = self.name\n\n x.data_type = trainer._get_dtype_name(self)\n\n x.data_shape = trainer._get_dense_data_shape(self)\n\n x.state_shape = trainer._get_dense_state_shape(self)\n\n x.initializer = trainer._get_dense_initializer(self)\n\n x.updater = trainer._get_dense_updater(self)\n\n x.partition_count = trainer.agent.server_count\n\n x.agent = trainer.agent._cxx_agent\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def init_dense_tensor_done():\n\n self.__handle = x\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._init_tensor_log(x)\n\n x.init(init_dense_tensor_done)\n\n return future\n\n\n\n def _init_sparse_tensor(self, trainer):\n\n x = SparseTensor()\n\n x.name = self.name\n\n x.data_type = trainer._get_dtype_name(self)\n\n x.slice_data_shape = trainer._get_sparse_slice_data_shape(self)\n\n x.slice_state_shape = trainer._get_sparse_slice_state_shape(self)\n\n x.initializer = trainer._get_sparse_initializer(self)\n\n x.updater = trainer._get_sparse_updater(self)\n\n x.partition_count = trainer.agent.server_count\n\n x.agent = trainer.agent._cxx_agent\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def init_sparse_tensor_done():\n\n self.__handle = x\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._init_tensor_log(x)\n\n x.init(init_sparse_tensor_done)\n\n return future\n\n\n\n def _pull_tensor(self):\n\n if self.is_dense:\n\n return self._pull_dense_tensor()\n\n else:\n\n return self._pull_sparse_tensor()\n\n\n\n def _pull_dense_tensor(self):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def pull_dense_tensor_done(data):\n\n data = torch.from_numpy(data)\n\n data = data.view(self.item.shape)\n\n self.item.data.copy_(data)\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.pull(pull_dense_tensor_done, False)\n\n return future\n\n\n\n async def _pull_sparse_tensor(self):\n\n op = self.item\n\n keys = op.keys\n\n if keys is None:\n\n return\n\n read_only = not op.training or not op.requires_grad\n\n nan_fill = read_only and op.use_nan_fill\n\n def pull_sparse_tensor():\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def pull_sparse_tensor_done(data):\n\n op._check_dtype_and_shape(keys, data)\n\n op._update_data(data)\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.pull(keys, pull_sparse_tensor_done, read_only, nan_fill)\n\n return future\n\n await pull_sparse_tensor()\n\n\n\n def _push_tensor(self, *, is_value=False, skip_no_grad=True):\n\n if self.is_dense:\n\n return self._push_dense_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\n\n else:\n\n return self._push_sparse_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\n\n\n\n async def _push_dense_tensor(self, *, is_value=False, skip_no_grad=True):\n\n data = self.item\n\n if self.is_dense_parameter:\n\n if not is_value and data.grad is None:\n\n if skip_no_grad:\n\n return\n\n raise RuntimeError(f\"the gradient of parameter {self.name!r} is not available\")\n\n # For dense buffers, use .data to fake gradients.\n\n # But we still need to pass is_value=False, otherwise updaters on server won't be called.\n\n data = data.data.numpy() if self.is_dense_buffer or is_value else data.grad.data.numpy()\n\n def push_dense_tensor():\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def push_dense_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.push(data, push_dense_tensor_done, is_value, False)\n\n return future\n\n await push_dense_tensor()\n\n\n\n async def _push_sparse_tensor(self, *, is_value=False, skip_no_grad=True):\n\n op = self.item\n\n keys, data = op.keys_and_data\n\n if keys is None:\n\n return\n\n if not is_value and data.grad is None:\n\n if skip_no_grad:\n\n return\n\n raise RuntimeError(f\"the gradient of operator {op!r} is not available\")\n\n data = data.data.numpy() if is_value else data.grad.data.numpy()\n\n op._check_dtype_and_shape(keys, data)\n\n def push_sparse_tensor():\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def push_sparse_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.push(keys, data, push_sparse_tensor_done, is_value)\n\n return future\n\n await push_sparse_tensor()\n\n\n\n def _load_tensor(self, dir_path, *, keep_meta=False):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def load_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n self._handle.load(dir_path, load_tensor_done, keep_meta)\n\n return future\n\n\n\n def _save_tensor(self, dir_path):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def save_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n if self.is_sparse:\n\n text_mode = self.item.save_as_text\n\n self._handle.save(dir_path, save_tensor_done, text_mode)\n\n else:\n\n self._handle.save(dir_path, save_tensor_done)\n\n return future\n\n\n\n def _sparse_tensor_clear(self):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_clear_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.clear(sparse_tensor_clear_done)\n\n return future\n\n\n\n def _sparse_tensor_export(self, dir_path):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_export_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n self._handle.export(dir_path, sparse_tensor_export_done)\n\n return future\n\n\n\n def _sparse_tensor_import_from(self, meta_file_path, *,\n\n data_only=False, skip_existing=False,\n\n transform_key=False, feature_name=''):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_import_from_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n meta_file_path = use_s3(meta_file_path)\n\n self._handle.import_from(meta_file_path, sparse_tensor_import_from_done,\n\n data_only, skip_existing,\n\n transform_key, feature_name)\n\n return future\n\n\n\n def _sparse_tensor_prune_small(self, epsilon):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_prune_small_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.prune_small(epsilon, sparse_tensor_prune_small_done)\n\n return future\n\n\n\n def _sparse_tensor_prune_old(self, max_age):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def sparse_tensor_prune_old_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n self._handle.prune_old(max_age, sparse_tensor_prune_old_done)\n","file_path":"python/mindalpha/distributed_tensor.py","rank":93,"score":53883.14474432791},{"content":" def _init_tensor(self, trainer):\n\n if self.is_dense:\n\n return self._init_dense_tensor(trainer)\n\n else:\n","file_path":"python/mindalpha/distributed_tensor.py","rank":94,"score":53883.14474432791},{"content":" def _pull_tensor(self):\n\n if self.is_dense:\n\n return self._pull_dense_tensor()\n\n else:\n","file_path":"python/mindalpha/distributed_tensor.py","rank":95,"score":53883.14474432791},{"content":" def _save_tensor(self, dir_path):\n\n loop = asyncio.get_running_loop()\n\n future = loop.create_future()\n\n def save_tensor_done():\n\n loop.call_soon_threadsafe(future.set_result, None)\n\n dir_path = use_s3(dir_path)\n\n if self.is_sparse:\n\n text_mode = self.item.save_as_text\n\n self._handle.save(dir_path, save_tensor_done, text_mode)\n\n else:\n\n self._handle.save(dir_path, save_tensor_done)\n","file_path":"python/mindalpha/distributed_tensor.py","rank":96,"score":53883.14474432791},{"content":"class S3FileSystem : public FileSystem {\n\n public:\n\n /*! \\brief destructor */\n\n virtual ~S3FileSystem() {}\n\n /*!\n\n * \\brief get information about a path\n\n * \\param path the path to the file\n\n * \\return the information about the file\n\n */\n\n virtual FileInfo GetPathInfo(const URI &path) override;\n\n /*!\n\n * \\brief list files in a directory\n\n * \\param path to the file\n\n * \\param out_list the output information about the files\n\n */\n\n virtual void ListDirectory(const URI &path, std::vector<FileInfo> *out_list) override;\n\n /*!\n\n * \\brief open a stream, will report error and exit if bad thing happens\n\n * NOTE: the Stream can continue to work even when filesystem was destructed\n\n * \\param path path to file\n","file_path":"cpp/mindalpha/s3_sdk_filesys.h","rank":97,"score":53828.35101683957},{"content":" { \"name\", GetMeta().GetName() },\n\n };\n\n req->GetMessageMeta().SetReceiver(ServerGroup);\n\n req->GetMessageMeta().SetBody(json.dump());\n\n agent_->BroadcastRequest(req, [this, cb](PSMessage req, std::vector<PSMessage> ress) {\n\n for (size_t k = 0; k < ress.size(); k++)\n\n {\n\n const std::string& body1 = ress.at(0)->GetMessageMeta().GetBody();\n\n const std::string& body2 = ress.at(k)->GetMessageMeta().GetBody();\n\n if (body1 != body2)\n\n {\n\n const int nodeId1 = ress.at(0)->GetMessageMeta().GetSender();\n\n const int nodeId2 = ress.at(k)->GetMessageMeta().GetSender();\n\n std::string serr;\n\n serr.append(\"Meta of sparse tensor '\");\n\n serr.append(GetMeta().GetName());\n\n serr.append(\"' on node \");\n\n serr.append(NodeIdToString(nodeId1));\n\n serr.append(\" and \");\n\n serr.append(NodeIdToString(nodeId2));\n","file_path":"cpp/mindalpha/sparse_tensor.cpp","rank":98,"score":49.91848310427618}],"string":"[\n {\n \"content\": \"class DenseTensorMeta\\n\\n{\\n\\npublic:\\n\\n const std::string& GetName() const { return name_; }\\n\\n void SetName(std::string value) { name_ = std::move(value); }\\n\\n\\n\\n DataType GetDataType() const { return data_type_; }\\n\\n void SetDataType(DataType value) { data_type_ = value; }\\n\\n\\n\\n const std::vector<size_t>& GetDataShape() const { return data_shape_; }\\n\\n void SetDataShape(std::vector<size_t> value) { data_shape_ = std::move(value); }\\n\\n\\n\\n const std::vector<size_t>& GetStateShape() const { return state_shape_; }\\n\\n void SetStateShape(std::vector<size_t> value) { state_shape_ = std::move(value); }\\n\\n\\n\\n DenseInitializer GetInitializer() const { return initializer_; }\\n\\n void SetInitializer(DenseInitializer value) { initializer_ = std::move(value); }\\n\\n\\n\\n DenseUpdater GetUpdater() const { return updater_; }\\n\\n void SetUpdater(DenseUpdater value) { updater_ = std::move(value); }\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.h\",\n \"rank\": 0,\n \"score\": 137043.0683102511\n },\n {\n \"content\": \"namespace mindalpha\\n\\n{\\n\\n\\n\\n//\\n\\n// Use the X Macro technique to simplify code. See the following page\\n\\n// for more information about X Macros:\\n\\n//\\n\\n// https://en.wikipedia.org/wiki/X_Macro\\n\\n//\\n\\n\\n\\n#define MINDALPHA_NODE_CONTROL_COMMANDS(X) \\\\\\n\\n X(Terminate) \\\\\\n\\n X(AddNode) \\\\\\n\\n X(Barrier) \\\\\\n\\n /**/\\n\\n\\n\\nenum class NodeControlCommand\\n\\n{\\n\\n#undef MINDALPHA_NODE_CONTROL_COMMAND_DEF\\n\\n#define MINDALPHA_NODE_CONTROL_COMMAND_DEF(n) n,\\n\\n MINDALPHA_NODE_CONTROL_COMMANDS(MINDALPHA_NODE_CONTROL_COMMAND_DEF)\\n\\n};\\n\\n\\n\\n// A missing ``NodeControlCommand`` is represented by ``NodeControlCommand(-1)``.\\n\\nconstexpr NodeControlCommand NullNodeControlCommand = static_cast<NodeControlCommand>(-1);\\n\\nconstexpr const char* NullNodeControlCommandString = \\\"null\\\";\\n\\n\\n\\n// Functions to convert ``NodeControlCommand`` to and from strings.\\n\\nstd::string NodeControlCommandToString(NodeControlCommand command);\\n\\nNodeControlCommand NodeControlCommandFromString(const std::string& str);\\n\\n\\n\\nstd::string NullableNodeControlCommandToString(NodeControlCommand command);\\n\\nNodeControlCommand NullableNodeControlCommandFromString(const std::string& str);\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/node_control_command.h\",\n \"rank\": 1,\n \"score\": 120981.43064771511\n },\n {\n \"content\": \" def name(self):\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 2,\n \"score\": 119853.9328093584\n },\n {\n \"content\": \"class SparseTensorMeta\\n\\n{\\n\\npublic:\\n\\n const std::string& GetName() const { return name_; }\\n\\n void SetName(std::string value) { name_ = std::move(value); }\\n\\n\\n\\n DataType GetDataType() const { return data_type_; }\\n\\n void SetDataType(DataType value) { data_type_ = value; }\\n\\n\\n\\n const std::vector<size_t>& GetSliceDataShape() const { return slice_data_shape_; }\\n\\n void SetSliceDataShape(std::vector<size_t> value) { slice_data_shape_ = std::move(value); }\\n\\n\\n\\n const std::vector<size_t>& GetSliceStateShape() const { return slice_state_shape_; }\\n\\n void SetSliceStateShape(std::vector<size_t> value) { slice_state_shape_ = std::move(value); }\\n\\n\\n\\n SparseInitializer GetInitializer() const { return initializer_; }\\n\\n void SetInitializer(SparseInitializer value) { initializer_ = std::move(value); }\\n\\n\\n\\n SparseUpdater GetUpdater() const { return updater_; }\\n\\n void SetUpdater(SparseUpdater value) { updater_ = std::move(value); }\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.h\",\n \"rank\": 3,\n \"score\": 108505.23685784862\n },\n {\n \"content\": \"#include <vector>\\n\\n#include <functional>\\n\\n#include <any>\\n\\n#include <json11.hpp>\\n\\n#include <mindalpha/data_type.h>\\n\\n#include <mindalpha/smart_array.h>\\n\\n#include <mindalpha/string_utils.h>\\n\\n\\n\\nnamespace mindalpha\\n\\n{\\n\\n\\n\\nusing DenseInitializer = std::function<void(const std::string& name,\\n\\n SmartArray<uint8_t> data,\\n\\n const class DenseTensorMeta& meta)>;\\n\\n\\n\\nusing DenseUpdater = std::function<void(const std::string& name,\\n\\n SmartArray<uint8_t> param,\\n\\n SmartArray<uint8_t> grad,\\n\\n SmartArray<uint8_t> state,\\n\\n const class DenseTensorMeta& meta)>;\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.h\",\n \"rank\": 4,\n \"score\": 94261.35003564467\n },\n {\n \"content\": \" std::string GetUpdaterAsData() const;\\n\\n\\n\\n std::string ToString() const;\\n\\n std::string ToJsonString() const;\\n\\n json11::Json to_json() const;\\n\\n\\n\\n static DenseTensorMeta FromJsonString(const std::string& str);\\n\\n static DenseTensorMeta FromJson(json11::Json json);\\n\\n\\n\\n bool IsCompatible(const DenseTensorMeta& rhs) const;\\n\\n\\n\\n bool operator==(const DenseTensorMeta& rhs) const;\\n\\n bool operator!=(const DenseTensorMeta& rhs) const { return !(*this == rhs); }\\n\\n\\n\\nprivate:\\n\\n std::string name_;\\n\\n DataType data_type_ = NullDataType;\\n\\n std::vector<size_t> data_shape_;\\n\\n std::vector<size_t> state_shape_;\\n\\n DenseInitializer initializer_;\\n\\n DenseUpdater updater_;\\n\\n std::any initializer_object_;\\n\\n std::any updater_object_;\\n\\n int partition_count_ = -1;\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.h\",\n \"rank\": 5,\n \"score\": 94258.89443701657\n },\n {\n \"content\": \" std::string ToJsonString() const;\\n\\n json11::Json to_json() const;\\n\\n\\n\\n static SparseTensorMeta FromJsonString(const std::string& str);\\n\\n static SparseTensorMeta FromJson(json11::Json json);\\n\\n\\n\\n bool IsCompatible(const SparseTensorMeta& rhs) const;\\n\\n bool IsCompatibleRelaxed(const SparseTensorMeta& rhs, bool data_only) const;\\n\\n\\n\\n bool operator==(const SparseTensorMeta& rhs) const;\\n\\n bool operator!=(const SparseTensorMeta& rhs) const { return !(*this == rhs); }\\n\\n\\n\\nprivate:\\n\\n std::string name_;\\n\\n DataType data_type_ = NullDataType;\\n\\n std::vector<size_t> slice_data_shape_;\\n\\n std::vector<size_t> slice_state_shape_;\\n\\n SparseInitializer initializer_;\\n\\n SparseUpdater updater_;\\n\\n std::any initializer_object_;\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.h\",\n \"rank\": 6,\n \"score\": 94257.99943043414\n },\n {\n \"content\": \"#include <vector>\\n\\n#include <functional>\\n\\n#include <any>\\n\\n#include <json11.hpp>\\n\\n#include <mindalpha/data_type.h>\\n\\n#include <mindalpha/smart_array.h>\\n\\n\\n\\nnamespace mindalpha\\n\\n{\\n\\n\\n\\nusing SparseInitializer = std::function<void(const std::string& name,\\n\\n SmartArray<uint8_t> data,\\n\\n SmartArray<uint8_t> keys,\\n\\n const class SparseTensorMeta& meta)>;\\n\\n\\n\\nusing SparseUpdater = std::function<void(const std::string& name,\\n\\n SmartArray<uint8_t> param,\\n\\n SmartArray<uint8_t> grad,\\n\\n SmartArray<uint8_t> indices,\\n\\n SmartArray<uint8_t> keys,\\n\\n const class SparseTensorMeta& meta)>;\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.h\",\n \"rank\": 7,\n \"score\": 94257.5904482217\n },\n {\n \"content\": \"\\n\\n int GetPartitionCount() const { return partition_count_; }\\n\\n void SetPartitionCount(int value) { partition_count_ = value; }\\n\\n\\n\\n void CheckDenseTensorMeta(int index) const;\\n\\n\\n\\n void ComputePartitionShapesWithHash(size_t hash, int index, size_t& begin, size_t& end,\\n\\n std::vector<size_t>* partition_data_shape,\\n\\n std::vector<size_t>* partition_state_shape) const;\\n\\n\\n\\n void ComputePartitionShapes(int index, size_t& begin, size_t& end,\\n\\n std::vector<size_t>* partition_data_shape,\\n\\n std::vector<size_t>* partition_state_shape) const;\\n\\n\\n\\n size_t GetNameHash() const { return BKDRHash(name_); }\\n\\n\\n\\n void SetInitializerByData(std::string data);\\n\\n void SetUpdaterByData(std::string data);\\n\\n\\n\\n std::string GetInitializerAsData() const;\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.h\",\n \"rank\": 8,\n \"score\": 94255.1447154551\n },\n {\n \"content\": \"\\n\\n int GetPartitionCount() const { return partition_count_; }\\n\\n void SetPartitionCount(int value) { partition_count_ = value; }\\n\\n\\n\\n void CheckSparseTensorMeta(int index) const;\\n\\n void ComputeSliceInfo();\\n\\n\\n\\n size_t GetSliceDataLength() const { return slice_data_length_; }\\n\\n size_t GetSliceStateLength() const { return slice_state_length_; }\\n\\n size_t GetSliceAgeOffset() const { return slice_age_offset_; }\\n\\n size_t GetSliceTotalBytes() const { return slice_total_bytes_; }\\n\\n size_t GetSliceDataStateBytes() const { return GetSliceAgeOffset(); }\\n\\n\\n\\n void SetInitializerByData(std::string data);\\n\\n void SetUpdaterByData(std::string data);\\n\\n\\n\\n std::string GetInitializerAsData() const;\\n\\n std::string GetUpdaterAsData() const;\\n\\n\\n\\n std::string ToString() const;\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.h\",\n \"rank\": 9,\n \"score\": 94248.36119122537\n },\n {\n \"content\": \" std::any updater_object_;\\n\\n int partition_count_ = -1;\\n\\n size_t slice_data_length_ = size_t(-1);\\n\\n size_t slice_state_length_ = size_t(-1);\\n\\n size_t slice_age_offset_ = size_t(-1);\\n\\n size_t slice_total_bytes_ = size_t(-1);\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.h\",\n \"rank\": 10,\n \"score\": 94237.51614977562\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Mobvista\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <stdint.h>\\n\\n#include <string>\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.h\",\n \"rank\": 11,\n \"score\": 94230.50846983212\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Mobvista\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\n#pragma once\\n\\n\\n\\n#include <stdint.h>\\n\\n#include <string>\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.h\",\n \"rank\": 12,\n \"score\": 94230.50846983212\n },\n {\n \"content\": \"\\n\\nnamespace mindalpha\\n\\n{\\n\\n\\n\\nstd::string NodeControlCommandToString(NodeControlCommand command)\\n\\n{\\n\\n switch (command)\\n\\n {\\n\\n#undef MINDALPHA_NODE_CONTROL_COMMAND_DEF\\n\\n#define MINDALPHA_NODE_CONTROL_COMMAND_DEF(n) case NodeControlCommand::n: return #n;\\n\\n MINDALPHA_NODE_CONTROL_COMMANDS(MINDALPHA_NODE_CONTROL_COMMAND_DEF)\\n\\n default:\\n\\n std::string serr;\\n\\n serr.append(\\\"Invalid NodeControlCommand enum value: \\\");\\n\\n serr.append(std::to_string(static_cast<int>(command)));\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\",\n \"file_path\": \"cpp/mindalpha/node_control_command.cpp\",\n \"rank\": 13,\n \"score\": 92677.97463280222\n },\n {\n \"content\": \"}\\n\\n\\n\\nNodeControlCommand NodeControlCommandFromString(const std::string& str)\\n\\n{\\n\\n#undef MINDALPHA_NODE_CONTROL_COMMAND_DEF\\n\\n#define MINDALPHA_NODE_CONTROL_COMMAND_DEF(n) if (str == #n) return NodeControlCommand::n;\\n\\n MINDALPHA_NODE_CONTROL_COMMANDS(MINDALPHA_NODE_CONTROL_COMMAND_DEF)\\n\\n std::string serr;\\n\\n serr.append(\\\"Invalid NodeControlCommand enum value: \\\");\\n\\n serr.append(str);\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n}\\n\\n\\n\\nstd::string NullableNodeControlCommandToString(NodeControlCommand command)\\n\\n{\\n\\n if (command == NullNodeControlCommand)\\n\\n return NullNodeControlCommandString;\\n\",\n \"file_path\": \"cpp/mindalpha/node_control_command.cpp\",\n \"rank\": 14,\n \"score\": 92676.7876888065\n },\n {\n \"content\": \" return NodeControlCommandToString(command);\\n\\n}\\n\\n\\n\\nNodeControlCommand NullableNodeControlCommandFromString(const std::string& str)\\n\\n{\\n\\n if (str == NullNodeControlCommandString)\\n\\n return NullNodeControlCommand;\\n\\n return NodeControlCommandFromString(str);\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/node_control_command.cpp\",\n \"rank\": 15,\n \"score\": 92668.34049937388\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Mobvista\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <spdlog/spdlog.h>\\n\\n#include <mindalpha/node_control_command.h>\\n\\n#include <mindalpha/stack_trace_utils.h>\\n\",\n \"file_path\": \"cpp/mindalpha/node_control_command.cpp\",\n \"rank\": 16,\n \"score\": 92665.72327975839\n },\n {\n \"content\": \" def _load_tensor(self, dir_path, *, keep_meta=False):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def load_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n self._handle.load(dir_path, load_tensor_done, keep_meta)\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 17,\n \"score\": 92428.73178062242\n },\n {\n \"content\": \"#include <mindalpha/dense_tensor_meta.h>\\n\\n#include <mindalpha/stack_trace_utils.h>\\n\\n\\n\\nnamespace mindalpha\\n\\n{\\n\\n\\n\\nvoid DenseTensorMeta::CheckDenseTensorMeta(int index) const\\n\\n{\\n\\n if (GetName().empty())\\n\\n {\\n\\n std::string serr;\\n\\n serr.append(\\\"Can not compute dense tensor partition shapes, \\\");\\n\\n serr.append(\\\"as the name is empty.\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n const int n = GetPartitionCount();\\n\\n if (n <= 0)\\n\\n {\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 18,\n \"score\": 91462.87682499735\n },\n {\n \"content\": \"#include <mindalpha/sparse_tensor_meta.h>\\n\\n#include <mindalpha/stack_trace_utils.h>\\n\\n\\n\\nnamespace mindalpha\\n\\n{\\n\\n\\n\\nvoid SparseTensorMeta::CheckSparseTensorMeta(int index) const\\n\\n{\\n\\n if (GetName().empty())\\n\\n {\\n\\n std::string serr;\\n\\n serr.append(\\\"Can not compute sparse tensor slice support info, \\\");\\n\\n serr.append(\\\"as the name is empty.\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n const int n = GetPartitionCount();\\n\\n if (n <= 0)\\n\\n {\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 19,\n \"score\": 91462.71136761784\n },\n {\n \"content\": \" {\\n\\n { \\\"name\\\", name_ },\\n\\n { \\\"data_type\\\", NullableDataTypeToString(data_type_) },\\n\\n { \\\"data_shape\\\", ShapeToString(data_shape_) },\\n\\n { \\\"state_shape\\\", ShapeToString(state_shape_) },\\n\\n { \\\"initializer_data\\\", GetInitializerAsData() },\\n\\n { \\\"updater_data\\\", GetUpdaterAsData() },\\n\\n { \\\"partition_count\\\", partition_count_ },\\n\\n };\\n\\n}\\n\\n\\n\\nDenseTensorMeta DenseTensorMeta::FromJsonString(const std::string& str)\\n\\n{\\n\\n std::string err;\\n\\n json11::Json json = json11::Json::parse(str, err);\\n\\n if (!err.empty())\\n\\n {\\n\\n std::string serr;\\n\\n serr.append(\\\"Unable to create DenseTensorMeta from JSON string; str: \\\");\\n\\n serr.append(str);\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 20,\n \"score\": 91460.94176224488\n },\n {\n \"content\": \" serr.append(\\\", err: \\\");\\n\\n serr.append(err);\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n return FromJson(std::move(json));\\n\\n}\\n\\n\\n\\nDenseTensorMeta DenseTensorMeta::FromJson(json11::Json json)\\n\\n{\\n\\n DenseTensorMeta meta;\\n\\n meta.SetName(json[\\\"name\\\"].string_value());\\n\\n meta.SetDataType(DataTypeFromString(json[\\\"data_type\\\"].string_value()));\\n\\n meta.SetDataShape(ShapeFromString(json[\\\"data_shape\\\"].string_value()));\\n\\n meta.SetStateShape(ShapeFromString(json[\\\"state_shape\\\"].string_value()));\\n\\n meta.SetInitializerByData(json[\\\"initializer_data\\\"].string_value());\\n\\n meta.SetUpdaterByData(json[\\\"updater_data\\\"].string_value());\\n\\n meta.SetPartitionCount(json[\\\"partition_count\\\"].int_value());\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 21,\n \"score\": 91459.15178321234\n },\n {\n \"content\": \" meta.SetName(json[\\\"name\\\"].string_value());\\n\\n meta.SetDataType(DataTypeFromString(json[\\\"data_type\\\"].string_value()));\\n\\n meta.SetSliceDataShape(ShapeFromString(json[\\\"slice_data_shape\\\"].string_value()));\\n\\n meta.SetSliceStateShape(ShapeFromString(json[\\\"slice_state_shape\\\"].string_value()));\\n\\n meta.SetInitializerByData(json[\\\"initializer_data\\\"].string_value());\\n\\n meta.SetUpdaterByData(json[\\\"updater_data\\\"].string_value());\\n\\n meta.SetPartitionCount(json[\\\"partition_count\\\"].int_value());\\n\\n meta.ComputeSliceInfo();\\n\\n return meta;\\n\\n}\\n\\n\\n\\nbool SparseTensorMeta::IsCompatible(const SparseTensorMeta& rhs) const\\n\\n{\\n\\n return data_type_ == rhs.data_type_\\n\\n && slice_data_shape_ == rhs.slice_data_shape_\\n\\n && slice_state_shape_ == rhs.slice_state_shape_;\\n\\n}\\n\\n\\n\\nbool SparseTensorMeta::IsCompatibleRelaxed(const SparseTensorMeta& rhs, bool data_only) const\\n\\n{\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 22,\n \"score\": 91458.90764054922\n },\n {\n \"content\": \"{\\n\\n return to_json().dump();\\n\\n}\\n\\n\\n\\njson11::Json SparseTensorMeta::to_json() const\\n\\n{\\n\\n return json11::Json::object\\n\\n {\\n\\n { \\\"name\\\", name_ },\\n\\n { \\\"data_type\\\", NullableDataTypeToString(data_type_) },\\n\\n { \\\"slice_data_shape\\\", ShapeToString(slice_data_shape_) },\\n\\n { \\\"slice_state_shape\\\", ShapeToString(slice_state_shape_) },\\n\\n { \\\"initializer_data\\\", GetInitializerAsData() },\\n\\n { \\\"updater_data\\\", GetUpdaterAsData() },\\n\\n { \\\"partition_count\\\", partition_count_ },\\n\\n };\\n\\n}\\n\\n\\n\\nSparseTensorMeta SparseTensorMeta::FromJsonString(const std::string& str)\\n\\n{\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 23,\n \"score\": 91456.34642857032\n },\n {\n \"content\": \" const size_t hash = GetNameHash();\\n\\n ComputePartitionShapesWithHash(hash, index, begin, end,\\n\\n partition_data_shape, partition_state_shape);\\n\\n}\\n\\n\\n\\nvoid DenseTensorMeta::SetInitializerByData(std::string data)\\n\\n{\\n\\n namespace py = pybind11;\\n\\n using namespace py::literals;\\n\\n if (data.empty())\\n\\n {\\n\\n initializer_ = {};\\n\\n initializer_object_ = {};\\n\\n }\\n\\n else\\n\\n {\\n\\n py::gil_scoped_acquire gil;\\n\\n py::object obj = mindalpha::deserialize_pyobject(data);\\n\\n MakeInitializerReady(obj);\\n\\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 24,\n \"score\": 91455.24518572514\n },\n {\n \"content\": \" return meta;\\n\\n}\\n\\n\\n\\nbool DenseTensorMeta::IsCompatible(const DenseTensorMeta& rhs) const\\n\\n{\\n\\n return data_type_ == rhs.data_type_\\n\\n && data_shape_ == rhs.data_shape_\\n\\n && state_shape_ == rhs.state_shape_;\\n\\n}\\n\\n\\n\\nbool DenseTensorMeta::operator==(const DenseTensorMeta& rhs) const\\n\\n{\\n\\n return name_ == rhs.name_\\n\\n && data_type_ == rhs.data_type_\\n\\n && data_shape_ == rhs.data_shape_\\n\\n && state_shape_ == rhs.state_shape_\\n\\n && GetInitializerAsData() == rhs.GetInitializerAsData()\\n\\n && GetUpdaterAsData() == rhs.GetUpdaterAsData()\\n\\n && partition_count_ == rhs.partition_count_;\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 25,\n \"score\": 91453.59342159057\n },\n {\n \"content\": \" initializer_ = [func](const std::string& name,\\n\\n mindalpha::SmartArray<uint8_t> data,\\n\\n const DenseTensorMeta& meta)\\n\\n {\\n\\n py::gil_scoped_acquire gil;\\n\\n py::array data_arr = mindalpha::make_numpy_array(data, meta.data_type_);\\n\\n py::tuple data_shape(meta.data_shape_.size());\\n\\n for (size_t i = 0; i < meta.data_shape_.size(); i++)\\n\\n data_shape[i] = (i == 0) ? -1 : static_cast<int64_t>(meta.data_shape_.at(i));\\n\\n data_arr = data_arr.attr(\\\"reshape\\\")(data_shape);\\n\\n (*func)(\\\"name\\\"_a=name, \\\"data\\\"_a=data_arr, \\\"keys\\\"_a=py::none());\\n\\n };\\n\\n initializer_object_ = std::move(func);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid DenseTensorMeta::SetUpdaterByData(std::string data)\\n\\n{\\n\\n namespace py = pybind11;\\n\\n using namespace py::literals;\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 26,\n \"score\": 91453.57559213898\n },\n {\n \"content\": \" begin = avg_items * i + std::min(i, remainder);\\n\\n end = begin + my_items;\\n\\n if (partition_data_shape)\\n\\n {\\n\\n *partition_data_shape = GetDataShape();\\n\\n partition_data_shape->at(0) = end - begin;\\n\\n }\\n\\n if (partition_state_shape)\\n\\n {\\n\\n *partition_state_shape = GetStateShape();\\n\\n if (!GetStateShape().empty())\\n\\n partition_state_shape->at(0) = end - begin;\\n\\n }\\n\\n}\\n\\n\\n\\nvoid DenseTensorMeta::ComputePartitionShapes(\\n\\n int index, size_t& begin, size_t& end,\\n\\n std::vector<size_t>* partition_data_shape,\\n\\n std::vector<size_t>* partition_state_shape) const\\n\\n{\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 27,\n \"score\": 91452.77641736313\n },\n {\n \"content\": \" state_arr = state_arr.attr(\\\"reshape\\\")(state_shape);\\n\\n (*func)(\\\"name\\\"_a=name, \\\"param\\\"_a=param_arr, \\\"grad\\\"_a=grad_arr,\\n\\n \\\"state\\\"_a=state_arr, \\\"indices\\\"_a=py::none(), \\\"keys\\\"_a=py::none());\\n\\n }\\n\\n };\\n\\n updater_object_ = std::move(func);\\n\\n }\\n\\n}\\n\\n\\n\\nstd::string DenseTensorMeta::GetInitializerAsData() const\\n\\n{\\n\\n pybind11::gil_scoped_acquire gil;\\n\\n if (!initializer_object_.has_value())\\n\\n return {};\\n\\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(initializer_object_);\\n\\n return mindalpha::serialize_pyobject(*func);\\n\\n}\\n\\n\\n\\nstd::string DenseTensorMeta::GetUpdaterAsData() const\\n\\n{\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 28,\n \"score\": 91451.79531416223\n },\n {\n \"content\": \" serr.append(\\\"].\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid DenseTensorMeta::ComputePartitionShapesWithHash(\\n\\n size_t hash, int index, size_t& begin, size_t& end,\\n\\n std::vector<size_t>* partition_data_shape,\\n\\n std::vector<size_t>* partition_state_shape) const\\n\\n{\\n\\n size_t m = GetDataShape().at(0);\\n\\n size_t n = GetPartitionCount();\\n\\n size_t i = index;\\n\\n size_t h = hash;\\n\\n i = (i + h) % n;\\n\\n size_t my_items = (m + n - 1 - i) / n;\\n\\n size_t avg_items = m / n;\\n\\n size_t remainder = m % n;\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 29,\n \"score\": 91451.67751319871\n },\n {\n \"content\": \" std::string err;\\n\\n json11::Json json = json11::Json::parse(str, err);\\n\\n if (!err.empty())\\n\\n {\\n\\n std::string serr;\\n\\n serr.append(\\\"Unable to create SparseTensorMeta from JSON string; str: \\\");\\n\\n serr.append(str);\\n\\n serr.append(\\\", err: \\\");\\n\\n serr.append(err);\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n return FromJson(std::move(json));\\n\\n}\\n\\n\\n\\nSparseTensorMeta SparseTensorMeta::FromJson(json11::Json json)\\n\\n{\\n\\n SparseTensorMeta meta;\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 30,\n \"score\": 91451.53731241683\n },\n {\n \"content\": \" serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid SparseTensorMeta::ComputeSliceInfo()\\n\\n{\\n\\n const size_t item_size = DataTypeToSize(data_type_);\\n\\n slice_data_length_ = item_size * TotalElements(slice_data_shape_);\\n\\n slice_state_length_ = item_size * TotalElements(slice_state_shape_);\\n\\n const size_t age_offset = slice_data_length_ + slice_state_length_;\\n\\n const size_t age_size = std::max(item_size, sizeof(int));\\n\\n const size_t age_mask = age_size - 1;\\n\\n slice_age_offset_ = (age_offset + age_mask) & ~age_mask;\\n\\n slice_total_bytes_ = slice_age_offset_ + age_size;\\n\\n}\\n\\n\\n\\nvoid SparseTensorMeta::SetInitializerByData(std::string data)\\n\\n{\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 31,\n \"score\": 91451.0353985987\n },\n {\n \"content\": \" return {};\\n\\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(initializer_object_);\\n\\n return mindalpha::serialize_pyobject(*func);\\n\\n}\\n\\n\\n\\nstd::string SparseTensorMeta::GetUpdaterAsData() const\\n\\n{\\n\\n pybind11::gil_scoped_acquire gil;\\n\\n if (!updater_object_.has_value())\\n\\n return {};\\n\\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(updater_object_);\\n\\n return mindalpha::serialize_pyobject(*func);\\n\\n}\\n\\n\\n\\nstd::string SparseTensorMeta::ToString() const\\n\\n{\\n\\n return ToJsonString();\\n\\n}\\n\\n\\n\\nstd::string SparseTensorMeta::ToJsonString() const\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 32,\n \"score\": 91450.26490529186\n },\n {\n \"content\": \" if (!data_only)\\n\\n return IsCompatible(rhs);\\n\\n return data_type_ == rhs.data_type_\\n\\n && slice_data_shape_ == rhs.slice_data_shape_;\\n\\n}\\n\\n\\n\\nbool SparseTensorMeta::operator==(const SparseTensorMeta& rhs) const\\n\\n{\\n\\n return name_ == rhs.name_\\n\\n && data_type_ == rhs.data_type_\\n\\n && slice_data_shape_ == rhs.slice_data_shape_\\n\\n && slice_state_shape_ == rhs.slice_state_shape_\\n\\n && GetInitializerAsData() == rhs.GetInitializerAsData()\\n\\n && GetUpdaterAsData() == rhs.GetUpdaterAsData()\\n\\n && partition_count_ == rhs.partition_count_;\\n\\n}\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 33,\n \"score\": 91449.89845983424\n },\n {\n \"content\": \" namespace py = pybind11;\\n\\n using namespace py::literals;\\n\\n if (data.empty())\\n\\n {\\n\\n initializer_ = {};\\n\\n initializer_object_ = {};\\n\\n }\\n\\n else\\n\\n {\\n\\n py::gil_scoped_acquire gil;\\n\\n py::object obj = mindalpha::deserialize_pyobject(data);\\n\\n MakeInitializerReady(obj);\\n\\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\\n\\n initializer_ = [func](const std::string& name,\\n\\n mindalpha::SmartArray<uint8_t> data,\\n\\n mindalpha::SmartArray<uint8_t> keys,\\n\\n const SparseTensorMeta& meta)\\n\\n {\\n\\n {\\n\\n py::gil_scoped_acquire gil;\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 34,\n \"score\": 91449.07627067118\n },\n {\n \"content\": \" mindalpha::SmartArray<uint8_t> grad_clone = grad.Copy();\\n\\n py::gil_scoped_acquire gil;\\n\\n py::array param_arr = mindalpha::make_numpy_array(param, meta.data_type_);\\n\\n py::array grad_arr = mindalpha::make_numpy_array(grad_clone, meta.data_type_);\\n\\n py::tuple data_shape(meta.data_shape_.size());\\n\\n for (size_t i = 0; i < meta.data_shape_.size(); i++)\\n\\n data_shape[i] = (i == 0) ? -1 : static_cast<int64_t>(meta.data_shape_.at(i));\\n\\n param_arr = param_arr.attr(\\\"reshape\\\")(data_shape);\\n\\n grad_arr = grad_arr.attr(\\\"reshape\\\")(data_shape);\\n\\n if (meta.state_shape_.empty())\\n\\n {\\n\\n (*func)(\\\"name\\\"_a=name, \\\"param\\\"_a=param_arr, \\\"grad\\\"_a=grad_arr,\\n\\n \\\"state\\\"_a=py::none(), \\\"indices\\\"_a=py::none(), \\\"keys\\\"_a=py::none());\\n\\n }\\n\\n else\\n\\n {\\n\\n py::array state_arr = mindalpha::make_numpy_array(state, meta.data_type_);\\n\\n py::tuple state_shape(meta.state_shape_.size());\\n\\n for (size_t i = 0; i < meta.state_shape_.size(); i++)\\n\\n state_shape[i] = (i == 0) ? -1 : static_cast<int64_t>(meta.state_shape_.at(i));\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 35,\n \"score\": 91448.58609957375\n },\n {\n \"content\": \" pybind11::gil_scoped_acquire gil;\\n\\n if (!updater_object_.has_value())\\n\\n return {};\\n\\n auto func = std::any_cast<std::shared_ptr<pybind11::object>>(updater_object_);\\n\\n return mindalpha::serialize_pyobject(*func);\\n\\n}\\n\\n\\n\\nstd::string DenseTensorMeta::ToString() const\\n\\n{\\n\\n return ToJsonString();\\n\\n}\\n\\n\\n\\nstd::string DenseTensorMeta::ToJsonString() const\\n\\n{\\n\\n return to_json().dump();\\n\\n}\\n\\n\\n\\njson11::Json DenseTensorMeta::to_json() const\\n\\n{\\n\\n return json11::Json::object\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 36,\n \"score\": 91447.62549574758\n },\n {\n \"content\": \" py::slice data_slice(0, data_cols, 1);\\n\\n py::tuple data_subscript = py::make_tuple(py::ellipsis(), data_slice);\\n\\n py::array data_arr = blob_arr[data_subscript];\\n\\n py::tuple data_shape(1 + meta.slice_data_shape_.size());\\n\\n data_shape[0] = -1;\\n\\n for (size_t i = 0; i < meta.slice_data_shape_.size(); i++)\\n\\n data_shape[1 + i] = static_cast<int64_t>(meta.slice_data_shape_.at(i));\\n\\n data_arr = data_arr.attr(\\\"reshape\\\")(data_shape);\\n\\n py::array grad_arr = mindalpha::make_numpy_array(grad_clone, meta.data_type_);\\n\\n grad_arr = grad_arr.attr(\\\"reshape\\\")(data_shape);\\n\\n py::array indices_arr = mindalpha::make_numpy_array(indices, mindalpha::DataType::UInt64);\\n\\n py::array keys_arr = mindalpha::make_numpy_array(keys, mindalpha::DataType::UInt64);\\n\\n if (meta.slice_state_shape_.empty())\\n\\n {\\n\\n (*func)(\\\"name\\\"_a=name, \\\"param\\\"_a=data_arr, \\\"grad\\\"_a=grad_arr,\\n\\n \\\"state\\\"_a=py::none(), \\\"indices\\\"_a=indices_arr, \\\"keys\\\"_a=keys_arr);\\n\\n }\\n\\n else\\n\\n {\\n\\n const size_t state_cols = meta.slice_state_length_ / item_size;\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 37,\n \"score\": 91447.41545511539\n },\n {\n \"content\": \" memset(slice_ptr + meta.slice_data_length_, 0, meta.slice_total_bytes_ - meta.slice_data_length_);\\n\\n slice_ptr += meta.slice_total_bytes_;\\n\\n }\\n\\n };\\n\\n initializer_object_ = std::move(func);\\n\\n }\\n\\n}\\n\\n\\n\\nvoid SparseTensorMeta::SetUpdaterByData(std::string data)\\n\\n{\\n\\n namespace py = pybind11;\\n\\n using namespace py::literals;\\n\\n if (data.empty())\\n\\n {\\n\\n updater_ = {};\\n\\n updater_object_ = {};\\n\\n }\\n\\n else\\n\\n {\\n\\n py::gil_scoped_acquire gil;\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 38,\n \"score\": 91446.60909096469\n },\n {\n \"content\": \" if (data.empty())\\n\\n {\\n\\n updater_ = {};\\n\\n updater_object_ = {};\\n\\n }\\n\\n else\\n\\n {\\n\\n py::gil_scoped_acquire gil;\\n\\n py::object obj = mindalpha::deserialize_pyobject(data);\\n\\n MakeUpdaterReady(obj);\\n\\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\\n\\n updater_ = [func](const std::string& name,\\n\\n mindalpha::SmartArray<uint8_t> param,\\n\\n mindalpha::SmartArray<uint8_t> grad,\\n\\n mindalpha::SmartArray<uint8_t> state,\\n\\n const DenseTensorMeta& meta)\\n\\n {\\n\\n // Some PyTorch operations such as ``grad.clone()`` and ``XXX + grad``\\n\\n // require memory alignment, we use ``SmartArray::Copy`` to use GLIBC allocated\\n\\n // memory which is 16 bytes aligned.\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 39,\n \"score\": 91446.2924018183\n },\n {\n \"content\": \" {\\n\\n std::string serr;\\n\\n serr.append(\\\"Can not compute partition shapes for dense tensor '\\\");\\n\\n serr.append(GetName());\\n\\n serr.append(\\\"', as the tensor state shape [\\\");\\n\\n for (size_t i = 0; i < GetStateShape().size(); i++)\\n\\n {\\n\\n serr.append(i ? \\\", \\\" : \\\"\\\");\\n\\n serr.append(std::to_string(GetStateShape().at(i)));\\n\\n }\\n\\n serr.append(\\\"] is invalid; partition_count = \\\");\\n\\n serr.append(std::to_string(GetPartitionCount()));\\n\\n serr.append(\\\", partition_index = \\\");\\n\\n serr.append(std::to_string(index));\\n\\n serr.append(\\\", shape = [\\\");\\n\\n for (size_t i = 0; i < GetDataShape().size(); i++)\\n\\n {\\n\\n serr.append(i ? \\\", \\\" : \\\"\\\");\\n\\n serr.append(std::to_string(GetDataShape().at(i)));\\n\\n }\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 40,\n \"score\": 91446.26150067018\n },\n {\n \"content\": \" py::slice state_slice(data_cols, data_cols + state_cols, 1);\\n\\n py::tuple state_subscript = py::make_tuple(py::ellipsis(), state_slice);\\n\\n py::array state_arr = blob_arr[state_subscript];\\n\\n py::tuple state_shape(1 + meta.slice_state_shape_.size());\\n\\n state_shape[0] = -1;\\n\\n for (size_t i = 0; i < meta.slice_state_shape_.size(); i++)\\n\\n state_shape[1 + i] = static_cast<int64_t>(meta.slice_state_shape_.at(i));\\n\\n state_arr = state_arr.attr(\\\"reshape\\\")(state_shape);\\n\\n (*func)(\\\"name\\\"_a=name, \\\"param\\\"_a=data_arr, \\\"grad\\\"_a=grad_arr,\\n\\n \\\"state\\\"_a=state_arr, \\\"indices\\\"_a=indices_arr, \\\"keys\\\"_a=keys_arr);\\n\\n }\\n\\n };\\n\\n updater_object_ = std::move(func);\\n\\n }\\n\\n}\\n\\n\\n\\nstd::string SparseTensorMeta::GetInitializerAsData() const\\n\\n{\\n\\n pybind11::gil_scoped_acquire gil;\\n\\n if (!initializer_object_.has_value())\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 41,\n \"score\": 91446.14403030487\n },\n {\n \"content\": \" {\\n\\n std::string serr;\\n\\n serr.append(\\\"Can not compute partition shapes for dense tensor '\\\");\\n\\n serr.append(GetName());\\n\\n serr.append(\\\"', as the tensor data shape [\\\");\\n\\n for (size_t i = 0; i < GetDataShape().size(); i++)\\n\\n {\\n\\n serr.append(i ? \\\", \\\" : \\\"\\\");\\n\\n serr.append(std::to_string(GetDataShape().at(i)));\\n\\n }\\n\\n serr.append(\\\"] is invalid; partition_count = \\\");\\n\\n serr.append(std::to_string(GetPartitionCount()));\\n\\n serr.append(\\\", partition_index = \\\");\\n\\n serr.append(std::to_string(index));\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n if (!GetStateShape().empty() && GetStateShape().at(0) != m)\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 42,\n \"score\": 91445.99452441961\n },\n {\n \"content\": \" py::object obj = mindalpha::deserialize_pyobject(data);\\n\\n MakeUpdaterReady(obj);\\n\\n std::shared_ptr<py::object> func = mindalpha::make_shared_pyobject(obj);\\n\\n updater_ = [func](const std::string& name,\\n\\n mindalpha::SmartArray<uint8_t> param,\\n\\n mindalpha::SmartArray<uint8_t> grad,\\n\\n mindalpha::SmartArray<uint8_t> indices,\\n\\n mindalpha::SmartArray<uint8_t> keys,\\n\\n const SparseTensorMeta& meta)\\n\\n {\\n\\n // Some PyTorch operations such as ``grad.clone()`` and ``XXX + grad``\\n\\n // require memory alignment, we use ``SmartArray::Copy`` to use GLIBC allocated\\n\\n // memory which is 16 bytes aligned.\\n\\n mindalpha::SmartArray<uint8_t> grad_clone = grad.Copy();\\n\\n py::gil_scoped_acquire gil;\\n\\n const size_t item_size = mindalpha::DataTypeToSize(meta.data_type_);\\n\\n const size_t cols = meta.slice_total_bytes_ / item_size;\\n\\n const size_t data_cols = meta.slice_data_length_ / item_size;\\n\\n py::array blob_arr = mindalpha::make_numpy_array(param, meta.data_type_);\\n\\n blob_arr = blob_arr.attr(\\\"reshape\\\")(-1, cols);\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 43,\n \"score\": 91444.29731075646\n },\n {\n \"content\": \" const size_t item_size = mindalpha::DataTypeToSize(meta.data_type_);\\n\\n const size_t cols = meta.slice_total_bytes_ / item_size;\\n\\n const size_t data_cols = meta.slice_data_length_ / item_size;\\n\\n py::array blob_arr = mindalpha::make_numpy_array(data, meta.data_type_);\\n\\n blob_arr = blob_arr.attr(\\\"reshape\\\")(-1, cols);\\n\\n py::slice data_slice(0, data_cols, 1);\\n\\n py::tuple data_subscript = py::make_tuple(py::ellipsis(), data_slice);\\n\\n py::array data_arr = blob_arr[data_subscript];\\n\\n py::tuple data_shape(1 + meta.slice_data_shape_.size());\\n\\n data_shape[0] = -1;\\n\\n for (size_t i = 0; i < meta.slice_data_shape_.size(); i++)\\n\\n data_shape[1 + i] = static_cast<int64_t>(meta.slice_data_shape_.at(i));\\n\\n data_arr = data_arr.attr(\\\"reshape\\\")(data_shape);\\n\\n py::array keys_arr = mindalpha::make_numpy_array(keys, mindalpha::DataType::UInt64);\\n\\n (*func)(\\\"name\\\"_a=name, \\\"data\\\"_a=data_arr, \\\"keys\\\"_a=keys_arr);\\n\\n }\\n\\n const size_t slice_count = data.size() / meta.slice_total_bytes_;\\n\\n uint8_t* slice_ptr = data.data();\\n\\n for (size_t i = 0; i < slice_count; i++)\\n\\n {\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 44,\n \"score\": 91443.50327305484\n },\n {\n \"content\": \" serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n if (GetDataShape().empty())\\n\\n {\\n\\n std::string serr;\\n\\n serr.append(\\\"Can not compute partition shapes for dense tensor '\\\");\\n\\n serr.append(GetName());\\n\\n serr.append(\\\"', as the tensor data shape is empty; partition_count = \\\");\\n\\n serr.append(std::to_string(GetPartitionCount()));\\n\\n serr.append(\\\", partition_index = \\\");\\n\\n serr.append(std::to_string(index));\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n const size_t m = GetDataShape().at(0);\\n\\n if (m == 0)\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 45,\n \"score\": 91442.55107093079\n },\n {\n \"content\": \" std::string serr;\\n\\n serr.append(\\\"Can not compute partition shapes for dense tensor '\\\");\\n\\n serr.append(GetName());\\n\\n serr.append(\\\"', as the partition count \\\");\\n\\n serr.append(std::to_string(n));\\n\\n serr.append(\\\" is invalid.\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n if (index < 0 || index >= n)\\n\\n {\\n\\n std::string serr;\\n\\n serr.append(\\\"Can not compute partition shapes for dense tensor '\\\");\\n\\n serr.append(GetName());\\n\\n serr.append(\\\"', as the partition index \\\");\\n\\n serr.append(std::to_string(index));\\n\\n serr.append(\\\" is invalid; partition_count = \\\");\\n\\n serr.append(std::to_string(GetPartitionCount()));\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 46,\n \"score\": 91439.39790939364\n },\n {\n \"content\": \" std::string serr;\\n\\n serr.append(\\\"Can not compute slice support info for sparse tensor '\\\");\\n\\n serr.append(GetName());\\n\\n serr.append(\\\"', as the partition count \\\");\\n\\n serr.append(std::to_string(n));\\n\\n serr.append(\\\" is invalid.\\\\n\\\\n\\\");\\n\\n serr.append(GetStackTrace());\\n\\n spdlog::error(serr);\\n\\n throw std::runtime_error(serr);\\n\\n }\\n\\n if (index < 0 || index >= n)\\n\\n {\\n\\n std::string serr;\\n\\n serr.append(\\\"Can not compute slice support info for sparse tensor '\\\");\\n\\n serr.append(GetName());\\n\\n serr.append(\\\"', as the partition index \\\");\\n\\n serr.append(std::to_string(index));\\n\\n serr.append(\\\" is invalid; partition_count = \\\");\\n\\n serr.append(std::to_string(GetPartitionCount()));\\n\\n serr.append(\\\".\\\\n\\\\n\\\");\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 47,\n \"score\": 91439.32316933275\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Mobvista\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <spdlog/spdlog.h>\\n\\n#include <mindalpha/pybind_utils.h>\\n\\n#include <mindalpha/tensor_utils.h>\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_meta.cpp\",\n \"rank\": 48,\n \"score\": 91437.94147361857\n },\n {\n \"content\": \"//\\n\\n// Copyright 2021 Mobvista\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <spdlog/spdlog.h>\\n\\n#include <mindalpha/tensor_utils.h>\\n\\n#include <mindalpha/pybind_utils.h>\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_meta.cpp\",\n \"rank\": 49,\n \"score\": 91437.94147361857\n },\n {\n \"content\": \" def load_tensor_done():\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 50,\n \"score\": 90561.01444281661\n },\n {\n \"content\": \" async def _load_tensors(self, dir_path, *, keep_meta=False):\\n\\n futures = []\\n\\n for tensor in self._tensors:\\n\\n if not tensor.is_backing:\\n\\n future = tensor._load_tensor(dir_path, keep_meta=keep_meta)\\n\\n futures.append(future)\\n\",\n \"file_path\": \"python/mindalpha/model.py\",\n \"rank\": 51,\n \"score\": 83009.7846229963\n },\n {\n \"content\": \"namespace mindalpha\\n\\n{\\n\\n\\n\\n//\\n\\n// Use the X Macro technique to simplify code. See the following page\\n\\n// for more information about X Macros:\\n\\n//\\n\\n// https://en.wikipedia.org/wiki/X_Macro\\n\\n//\\n\\n\\n\\n#define MINDALPHA_INTEGRAL_DATA_TYPES(X) \\\\\\n\\n X(int8_t, int8, Int8) \\\\\\n\\n X(int16_t, int16, Int16) \\\\\\n\\n X(int32_t, int32, Int32) \\\\\\n\\n X(int64_t, int64, Int64) \\\\\\n\\n X(uint8_t, uint8, UInt8) \\\\\\n\\n X(uint16_t, uint16, UInt16) \\\\\\n\\n X(uint32_t, uint32, UInt32) \\\\\\n\\n X(uint64_t, uint64, UInt64) \\\\\\n\\n /**/\\n\\n\\n\\n#define MINDALPHA_FLOATING_DATA_TYPES(X) \\\\\\n\\n X(float, float32, Float32) \\\\\\n\\n X(double, float64, Float64) \\\\\\n\\n /**/\\n\\n\\n\\n#define MINDALPHA_DATA_TYPES(X) \\\\\\n\\n MINDALPHA_INTEGRAL_DATA_TYPES(X) \\\\\\n\\n MINDALPHA_FLOATING_DATA_TYPES(X) \\\\\\n\\n /**/\\n\\n\\n\\nenum class DataType\\n\\n{\\n\\n#undef MINDALPHA_DATA_TYPE_DEF\\n\\n#define MINDALPHA_DATA_TYPE_DEF(t, l, u) u,\\n\\n MINDALPHA_DATA_TYPES(MINDALPHA_DATA_TYPE_DEF)\\n\\n};\\n\\n\\n\\n// A missing ``DataType`` is represented by ``DataType(-1)``.\\n\\nconstexpr DataType NullDataType = static_cast<DataType>(-1);\\n\\nconstexpr const char* NullDataTypeString = \\\"null\\\";\\n\\n\\n\\n// Functions to convert ``DataType`` to and from strings.\\n\\nstd::string DataTypeToString(DataType type);\\n\\nDataType DataTypeFromString(const std::string& str);\\n\\n\\n\\nstd::string NullableDataTypeToString(DataType type);\\n\\nDataType NullableDataTypeFromString(const std::string& str);\\n\\n\\n\\n// This class template computes the ``DataType`` code of a numeric type.\\n\\ntemplate<typename T>\\n\\nstruct DataTypeToCode;\\n\\n\\n\\n#undef MINDALPHA_DATA_TYPE_DEF\\n\\n#define MINDALPHA_DATA_TYPE_DEF(t, l, u) \\\\\\n\\n template<> \\\\\\n\\n struct DataTypeToCode<t> \\\\\\n\\n { \\\\\\n\\n static constexpr DataType value = DataType::u; \\\\\\n\\n }; \\\\\\n\\n /**/\\n\\n MINDALPHA_DATA_TYPES(MINDALPHA_DATA_TYPE_DEF)\\n\\n\\n\\n// Compute the size in bytes of a value of ``type``.\\n\\nsize_t DataTypeToSize(DataType type);\\n\\n\\n\\n// This function template and two function overloads ensure ``value``\\n\\n// can be output as numbers. Output ``int8_t``/``uint8_t`` directly to\\n\\n// ``std::ostream`` will cause problems as they are character types\\n\\n// actually.\\n\\ntemplate<typename T>\\n\\ninline T AsNumber(T value) { return value; }\\n\\n\\n\\ninline int32_t AsNumber(int8_t value) { return static_cast<int32_t>(value); }\\n\\ninline uint32_t AsNumber(uint8_t value) { return static_cast<uint32_t>(value); }\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/data_type.h\",\n \"rank\": 52,\n \"score\": 82665.60836220431\n },\n {\n \"content\": \"namespace mindalpha\\n\\n{\\n\\n\\n\\n// Integer encodings of node group of the same role.\\n\\n#undef MINDALPHA_NODE_ROLE_DEF\\n\\n#define MINDALPHA_NODE_ROLE_DEF(n) constexpr int n##Group = 1 << static_cast<int>(NodeRole::n);\\n\\nMINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\\n\\n\\n\\n// Tag value specify that this integer encoding identify a single node.\\n\\nconstexpr int SingleNodeIdTag = 1 << (static_cast<int>(NodeRole::Worker) + 1);\\n\\n\\n\\n// Tag value specify that this integer encoding identify a node of the specific role.\\n\\n#undef MINDALPHA_NODE_ROLE_DEF\\n\\n#define MINDALPHA_NODE_ROLE_DEF(n) constexpr int n##NodeIdTag = 1 << static_cast<int>(NodeRole::n) | SingleNodeIdTag;\\n\\nMINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\\n\\n\\n\\n// Encode node numbered ``rank`` as a node id, which is an integer. ``rank`` is zero-based.\\n\\n#undef MINDALPHA_NODE_ROLE_DEF\\n\\n#define MINDALPHA_NODE_ROLE_DEF(n) constexpr int n##RankToNodeId(int rank) { return rank << 4 | n##NodeIdTag; }\\n\\nMINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\\n\\n\\n\\n// Get the zero-based ``rank`` from node id ``id``.\\n\\nconstexpr int NodeIdToRank(int id) { return id >> 4; }\\n\\n\\n\\n// Node id of the coordinator node. Since there is a single coordinator node\\n\\n// in the Parameter Server system, its node id can be pre-computed.\\n\\nconstexpr int CoordinatorNodeId = CoordinatorRankToNodeId(0);\\n\\n\\n\\n// Convert integer node id to a descriptive string.\\n\\nstd::string NodeIdToString(int node_id);\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/node_encoding.h\",\n \"rank\": 53,\n \"score\": 82539.09941880858\n },\n {\n \"content\": \"namespace mindalpha\\n\\n{\\n\\n\\n\\n//\\n\\n// Use the X Macro technique to simplify code. See the following page\\n\\n// for more information about X Macros:\\n\\n//\\n\\n// https://en.wikipedia.org/wiki/X_Macro\\n\\n//\\n\\n\\n\\n#define MINDALPHA_NODE_ROLES(X) \\\\\\n\\n X(Coordinator) \\\\\\n\\n X(Server) \\\\\\n\\n X(Worker) \\\\\\n\\n /**/\\n\\n\\n\\nenum class NodeRole\\n\\n{\\n\\n#undef MINDALPHA_NODE_ROLE_DEF\\n\\n#define MINDALPHA_NODE_ROLE_DEF(n) n,\\n\\n MINDALPHA_NODE_ROLES(MINDALPHA_NODE_ROLE_DEF)\\n\\n};\\n\\n\\n\\n// A missing ``NodeRole`` is represented by ``NodeRole(-1)``.\\n\\nconstexpr NodeRole NullNodeRole = static_cast<NodeRole>(-1);\\n\\nconstexpr const char* NullNodeRoleString = \\\"null\\\";\\n\\n\\n\\n// Functions to convert ``NodeRole`` to and from strings.\\n\\nstd::string NodeRoleToString(NodeRole role);\\n\\nNodeRole NodeRoleFromString(const std::string& str);\\n\\n\\n\\nstd::string NullableNodeRoleToString(NodeRole role);\\n\\nNodeRole NullableNodeRoleFromString(const std::string& str);\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/node_role.h\",\n \"rank\": 54,\n \"score\": 82539.09941880858\n },\n {\n \"content\": \" def data(self):\\n\\n self._check_clean()\\n\",\n \"file_path\": \"python/mindalpha/embedding.py\",\n \"rank\": 55,\n \"score\": 82509.05630239297\n },\n {\n \"content\": \"namespace mindalpha\\n\\n{\\n\\n\\n\\nstruct FileHeader {\\n\\n uint32_t magic;\\n\\n uint32_t patch;\\n\\n uint64_t size;\\n\\n static const uint32_t kMagicNum = 0xffffeeee;\\n\\n bool Check() {\\n\\n return magic == kMagicNum &&\\n\\n size > 0;\\n\\n }\\n\\n inline uint64_t Size() {\\n\\n return size;\\n\\n }\\n\",\n \"file_path\": \"cpp/mindalpha/file_utils.h\",\n \"rank\": 56,\n \"score\": 82486.9059677107\n },\n {\n \"content\": \" def rank(self):\\n\",\n \"file_path\": \"python/mindalpha/agent.py\",\n \"rank\": 57,\n \"score\": 82362.52998376961\n },\n {\n \"content\": \" def load_pickle_file(pickler_path):\\n\\n job_instance = None\\n\\n with open(pickler_path, 'rb') as f:\\n\\n try:\\n\\n job_instance = pickle.load(f)\\n\\n except Exception as err:\\n\\n raise Exception(f\\\"load {pickler_path} err: {err}\\\")\\n\",\n \"file_path\": \"python/mindalpha/experiment.py\",\n \"rank\": 58,\n \"score\": 81727.66145860594\n },\n {\n \"content\": \" def pickle_file_name(self):\\n\",\n \"file_path\": \"python/mindalpha/experiment.py\",\n \"rank\": 59,\n \"score\": 81686.70427350655\n },\n {\n \"content\": \"namespace mindalpha\\n\\n{\\n\\n\\n\\nsize_t SliceElements(const std::vector<size_t>& shape);\\n\\nsize_t TotalElements(const std::vector<size_t>& shape);\\n\\nstd::string ShapeToString(const std::vector<size_t>& shape);\\n\\nstd::vector<size_t> ShapeFromString(const std::string& str);\\n\\nvoid FillNaN(uint8_t* buffer, size_t size, DataType type);\\n\\nvoid MakeInitializerReady(pybind11::object initializer);\\n\\nvoid MakeUpdaterReady(pybind11::object udpater);\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/tensor_utils.h\",\n \"rank\": 60,\n \"score\": 81620.57049188393\n },\n {\n \"content\": \" def load(self, dir_path, *, keep_meta=False):\\n\\n # When spare tensors are repartitioned, we need to make\\n\\n # sure sparse tensors are cleared, as ``import_from``\\n\\n # won't clear or override existing keys. Make sure this\\n\\n # in C++ is a bit complicated, so we do it here.\\n\\n self.agent.barrier()\\n\\n if self.agent.rank == 0:\\n\\n asyncio.run(self.model._clear_tensors())\\n\\n # When spare tensors are repartitioned, they must be loaded\\n\\n # and pushed to servers later by all workers, so we do not\\n\\n # use ``if self.agent.rank == 0:`` here, instead this will\\n\\n # be checked in C++ code when necessary.\\n\\n self.agent.barrier()\\n\\n asyncio.run(self.model._load_tensors(dir_path, keep_meta=keep_meta))\\n\\n self.agent.barrier()\\n\\n asyncio.run(self.model._pull_tensors(force_mode=True))\\n\",\n \"file_path\": \"python/mindalpha/distributed_trainer.py\",\n \"rank\": 61,\n \"score\": 81344.01730649409\n },\n {\n \"content\": \"namespace mindalpha\\n\\n{\\n\\n\\n\\nconst uint64_t map_file_signature_size = 32;\\n\\n\\n\\nstruct MapFileHeader\\n\\n{\\n\\n char signature[map_file_signature_size];\\n\\n uint64_t version;\\n\\n uint64_t reserved_; // for backward compatibility\\n\\n uint64_t key_type;\\n\\n uint64_t value_type;\\n\\n uint64_t key_count;\\n\\n uint64_t bucket_count;\\n\\n uint64_t value_count;\\n\\n uint64_t value_count_per_key;\\n\\n\\n\\n void FillBasicFields();\\n\\n bool IsSignatureValid() const;\\n\\n void Validate(const std::string& hint) const;\\n\\n};\\n\\n\\n\\nconst uint64_t map_file_header_size = sizeof(MapFileHeader);\\n\\n\\n\\nextern const char map_file_signature[map_file_signature_size];\\n\\nextern const uint64_t map_file_version;\\n\\n\\n\",\n \"file_path\": \"cpp/mindalpha/map_file_header.h\",\n \"rank\": 62,\n \"score\": 81342.3305264719\n },\n {\n \"content\": \" def get_state_tensor(self, state, index):\\n\\n num = self.states_per_param\\n\\n dim = state.shape[-1]\\n\\n subscript = list(slice(None) for d in state.shape)\\n\\n subscript[-1] = slice(dim // num * index, dim // num * (index + 1))\\n\\n subscript = tuple(subscript)\\n\\n tensor = operator.getitem(state, subscript)\\n\",\n \"file_path\": \"python/mindalpha/updater.py\",\n \"rank\": 63,\n \"score\": 80906.15025491941\n },\n {\n \"content\": \" def _load_column_name_map(self):\\n\\n if self._column_name_map is not None:\\n\\n raise RuntimeError(\\\"column map has been loaded\\\")\\n\\n column_name_file_path = self._checked_get_column_name_file_path()\\n\\n combine_schema = CombineSchema()\\n\\n combine_schema.load_column_name_from_file(use_s3(column_name_file_path))\\n\\n self._column_name_map = combine_schema.get_column_name_map()\\n\\n string = f\\\"\\\\033[32mloaded column name map from \\\\033[m{column_name_file_path!r}\\\"\\n\\n print(string)\\n\\n keys = tuple(item for item in self._selected_columns if item not in self._column_name_map)\\n\\n if keys:\\n\\n raise ValueError(f\\\"the following columns are not defined in {self._column_name_file_path!r}: \\\"\\n\",\n \"file_path\": \"python/mindalpha/cast.py\",\n \"rank\": 64,\n \"score\": 79833.24617827602\n },\n {\n \"content\": \" def column_name_file_path(self, value):\\n\\n if value is not None:\\n\\n if not isinstance(value, str) or not file_exists(value):\\n\\n raise RuntimeError(f\\\"column name file {value!r} not found\\\")\\n\\n if self._column_name_file_path is not None:\\n\\n raise RuntimeError(f\\\"can not reset column_name_file_path {self._column_name_file_path!r} to {value!r}\\\")\\n\",\n \"file_path\": \"python/mindalpha/embedding.py\",\n \"rank\": 65,\n \"score\": 79668.0631530426\n },\n {\n \"content\": \" def get_sparse_state_tensor(self, state, index):\\n\",\n \"file_path\": \"python/mindalpha/updater.py\",\n \"rank\": 66,\n \"score\": 78907.19288115755\n },\n {\n \"content\": \" def get_dense_state_tensor(self, state, index):\\n\",\n \"file_path\": \"python/mindalpha/updater.py\",\n \"rank\": 67,\n \"score\": 78907.19288115755\n },\n {\n \"content\": \" def _ensure_column_name_map_loaded(self):\\n\\n if self._column_name_map is None:\\n\",\n \"file_path\": \"python/mindalpha/cast.py\",\n \"rank\": 68,\n \"score\": 77908.53094834955\n },\n {\n \"content\": \" def has_alternative_column_name_file_path(self):\\n\",\n \"file_path\": \"python/mindalpha/embedding.py\",\n \"rank\": 69,\n \"score\": 77747.41099158055\n },\n {\n \"content\": \" def alternative_column_name_file_path(self, value):\\n\\n if value is not None:\\n\\n if not isinstance(value, str) or not file_exists(value):\\n\\n raise RuntimeError(f\\\"alternative column name file {value!r} not found\\\")\\n\\n if self._alternative_column_name_file_path is not None:\\n\\n raise RuntimeError(f\\\"can not reset alternative_column_name_file_path {self._alternative_column_name_file_path!r} to {value!r}\\\")\\n\",\n \"file_path\": \"python/mindalpha/embedding.py\",\n \"rank\": 70,\n \"score\": 77747.41099158055\n },\n {\n \"content\": \"#\\n\\n# Copyright 2021 Mobvista\\n\\n#\\n\\n# Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n# you may not use this file except in compliance with the License.\\n\\n# You may obtain a copy of the License at\\n\\n#\\n\\n# http://www.apache.org/licenses/LICENSE-2.0\\n\\n#\\n\\n# Unless required by applicable law or agreed to in writing, software\\n\\n# distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n# See the License for the specific language governing permissions and\\n\\n# limitations under the License.\\n\\n#\\n\\n\\n\\nimport re\\n\\n\\n\\ndef is_valid_qualified_name(name):\\n\\n pattern = r'^[A-Za-z_.\\\\-][A-Za-z0-9_.\\\\-]*$'\\n\\n match = re.match(pattern, name)\\n\\n return match is not None\\n\",\n \"file_path\": \"python/mindalpha/name_utils.py\",\n \"rank\": 71,\n \"score\": 76436.84878000808\n },\n {\n \"content\": \"#\\n\\n# Copyright 2021 Mobvista\\n\\n#\\n\\n# Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n# you may not use this file except in compliance with the License.\\n\\n# You may obtain a copy of the License at\\n\\n#\\n\\n# http://www.apache.org/licenses/LICENSE-2.0\\n\\n#\\n\\n# Unless required by applicable law or agreed to in writing, software\\n\\n# distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n# See the License for the specific language governing permissions and\\n\\n# limitations under the License.\\n\\n#\\n\\n\\n\\ndef file_exists(url):\\n\\n import os\\n\\n from .s3_utils import s3_file_exists\\n\\n if url.startswith('s3://') or url.startswith('s3a://'):\\n\\n return s3_file_exists(url)\\n\\n else:\\n\\n return os.path.isfile(url)\\n\\n\\n\\ndef dir_exists(url):\\n\\n import os\\n\\n from .s3_utils import get_s3_dir_size\\n\\n if url.startswith('s3://') or url.startswith('s3a://'):\\n\\n return get_s3_dir_size(url) > 0\\n\\n else:\\n\\n return os.path.isdir(url)\\n\\n\\n\\ndef delete_dir(url):\\n\\n import os\\n\\n import shutil\\n\\n from .s3_utils import delete_s3_dir\\n\\n if url.startswith('s3://') or url.startswith('s3a://'):\\n\\n delete_s3_dir(url)\\n\\n else:\\n\\n if os.path.isdir(url):\\n\\n shutil.rmtree(url)\\n\\n\\n\\ndef delete_file(url):\\n\\n import os\\n\\n from .s3_utils import delete_s3_file\\n\\n if url.startswith('s3://') or url.startswith('s3a://'):\\n\\n delete_s3_file(url)\\n\\n else:\\n\\n if os.path.isfile(url):\\n\\n os.remove(url)\\n\\n\\n\\ndef copy_dir(src_url, dst_url):\\n\\n import shutil\\n\\n from .s3_utils import copy_s3_dir\\n\\n from .s3_utils import download_s3_dir\\n\\n from .s3_utils import upload_s3_dir\\n\\n if src_url.startswith('s3://') or src_url.startswith('s3a://'):\\n\\n if dst_url.startswith('s3://') or dst_url.startswith('s3a://'):\\n\\n copy_s3_dir(src_url, dst_url)\\n\\n else:\\n\\n download_s3_dir(src_url, dst_url)\\n\\n else:\\n\\n if dst_url.startswith('s3://') or dst_url.startswith('s3a://'):\\n\\n upload_s3_dir(src_url, dst_url)\\n\\n else:\\n\\n shutil.copytree(src_url, dst_url)\\n\",\n \"file_path\": \"python/mindalpha/file_utils.py\",\n \"rank\": 72,\n \"score\": 76301.33832529862\n },\n {\n \"content\": \" def _checked_get_column_name_file_path(self):\\n\\n if self._column_name_file_path is None:\\n\\n raise RuntimeError(\\\"column_name_file_path is not set\\\")\\n\",\n \"file_path\": \"python/mindalpha/cast.py\",\n \"rank\": 73,\n \"score\": 75917.75263006195\n },\n {\n \"content\": \" def _checked_get_column_name_file_path(self):\\n\\n if self._column_name_file_path is None:\\n\\n raise RuntimeError(\\\"column_name_file_path is not set\\\")\\n\",\n \"file_path\": \"python/mindalpha/embedding.py\",\n \"rank\": 74,\n \"score\": 75917.75263006195\n },\n {\n \"content\": \"#\\n\\n# Copyright 2021 Mobvista\\n\\n#\\n\\n# Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n# you may not use this file except in compliance with the License.\\n\\n# You may obtain a copy of the License at\\n\\n#\\n\\n# http://www.apache.org/licenses/LICENSE-2.0\\n\\n#\\n\\n# Unless required by applicable law or agreed to in writing, software\\n\\n# distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n# See the License for the specific language governing permissions and\\n\\n# limitations under the License.\\n\\n#\\n\\n\\n\\nimport asyncio\\n\\nimport torch\\n\\nfrom ._mindalpha import DenseTensor\\n\\nfrom ._mindalpha import SparseTensor\\n\\nfrom .embedding import EmbeddingOperator\\n\\nfrom .url_utils import use_s3\\n\\n\\n\\nclass DistributedTensor(object):\\n\\n def __init__(self, name, item, name_prefix):\\n\\n self.__name = name if name_prefix is None else name_prefix + name\\n\\n self.__item = item\\n\\n self.__handle = None\\n\\n\\n\\n @property\\n\\n def name(self):\\n\\n return self.__name\\n\\n\\n\\n @property\\n\\n def item(self):\\n\\n return self.__item\\n\\n\\n\\n @property\\n\\n def _handle(self):\\n\\n return self.__handle\\n\\n\\n\\n @property\\n\\n def is_dense(self):\\n\\n return isinstance(self.item, torch.Tensor)\\n\\n\\n\\n @property\\n\\n def is_dense_parameter(self):\\n\\n return isinstance(self.item, torch.nn.Parameter)\\n\\n\\n\\n @property\\n\\n def is_dense_buffer(self):\\n\\n return self.is_dense and not self.is_dense_parameter\\n\\n\\n\\n @property\\n\\n def is_sparse(self):\\n\\n return isinstance(self.item, EmbeddingOperator)\\n\\n\\n\\n @property\\n\\n def is_backing(self):\\n\\n return self.is_sparse and self.item.is_backing\\n\\n\\n\\n @property\\n\\n def is_exported(self):\\n\\n return self.is_sparse and self.item.is_exported\\n\\n\\n\\n def _zero_grad(self):\\n\\n if self.is_dense_parameter or self.is_sparse:\\n\\n if self.item.grad is not None:\\n\\n self.item.grad.detach_()\\n\\n self.item.grad.zero_()\\n\\n\\n\\n def _init_tensor(self, trainer):\\n\\n if self.is_dense:\\n\\n return self._init_dense_tensor(trainer)\\n\\n else:\\n\\n return self._init_sparse_tensor(trainer)\\n\\n\\n\\n def _init_tensor_log(self, x):\\n\\n if self.is_dense_parameter:\\n\\n string = \\\"\\\\033[38;5;046m\\\"\\n\\n elif self.is_dense_buffer:\\n\\n string = \\\"\\\\033[38;5;051m\\\"\\n\\n else:\\n\\n string = \\\"\\\\033[38;5;196m\\\"\\n\\n if self.is_dense:\\n\\n string += f\\\"init dense tensor {x.name} with shape {x.data_shape}, \\\"\\n\\n else:\\n\\n string += f\\\"init sparse tensor {x.name} with slice shape {x.slice_data_shape}, \\\"\\n\\n string += f\\\"updater {x.updater} and \\\"\\n\\n string += f\\\"initializer {x.initializer}\\\"\\n\\n string += \\\"\\\\033[m\\\"\\n\\n print(string)\\n\\n\\n\\n def _init_dense_tensor(self, trainer):\\n\\n x = DenseTensor()\\n\\n x.name = self.name\\n\\n x.data_type = trainer._get_dtype_name(self)\\n\\n x.data_shape = trainer._get_dense_data_shape(self)\\n\\n x.state_shape = trainer._get_dense_state_shape(self)\\n\\n x.initializer = trainer._get_dense_initializer(self)\\n\\n x.updater = trainer._get_dense_updater(self)\\n\\n x.partition_count = trainer.agent.server_count\\n\\n x.agent = trainer.agent._cxx_agent\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def init_dense_tensor_done():\\n\\n self.__handle = x\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._init_tensor_log(x)\\n\\n x.init(init_dense_tensor_done)\\n\\n return future\\n\\n\\n\\n def _init_sparse_tensor(self, trainer):\\n\\n x = SparseTensor()\\n\\n x.name = self.name\\n\\n x.data_type = trainer._get_dtype_name(self)\\n\\n x.slice_data_shape = trainer._get_sparse_slice_data_shape(self)\\n\\n x.slice_state_shape = trainer._get_sparse_slice_state_shape(self)\\n\\n x.initializer = trainer._get_sparse_initializer(self)\\n\\n x.updater = trainer._get_sparse_updater(self)\\n\\n x.partition_count = trainer.agent.server_count\\n\\n x.agent = trainer.agent._cxx_agent\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def init_sparse_tensor_done():\\n\\n self.__handle = x\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._init_tensor_log(x)\\n\\n x.init(init_sparse_tensor_done)\\n\\n return future\\n\\n\\n\\n def _pull_tensor(self):\\n\\n if self.is_dense:\\n\\n return self._pull_dense_tensor()\\n\\n else:\\n\\n return self._pull_sparse_tensor()\\n\\n\\n\\n def _pull_dense_tensor(self):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def pull_dense_tensor_done(data):\\n\\n data = torch.from_numpy(data)\\n\\n data = data.view(self.item.shape)\\n\\n self.item.data.copy_(data)\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.pull(pull_dense_tensor_done, False)\\n\\n return future\\n\\n\\n\\n async def _pull_sparse_tensor(self):\\n\\n op = self.item\\n\\n keys = op.keys\\n\\n if keys is None:\\n\\n return\\n\\n read_only = not op.training or not op.requires_grad\\n\\n nan_fill = read_only and op.use_nan_fill\\n\\n def pull_sparse_tensor():\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def pull_sparse_tensor_done(data):\\n\\n op._check_dtype_and_shape(keys, data)\\n\\n op._update_data(data)\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.pull(keys, pull_sparse_tensor_done, read_only, nan_fill)\\n\\n return future\\n\\n await pull_sparse_tensor()\\n\\n\\n\\n def _push_tensor(self, *, is_value=False, skip_no_grad=True):\\n\\n if self.is_dense:\\n\\n return self._push_dense_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\\n\\n else:\\n\\n return self._push_sparse_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\\n\\n\\n\\n async def _push_dense_tensor(self, *, is_value=False, skip_no_grad=True):\\n\\n data = self.item\\n\\n if self.is_dense_parameter:\\n\\n if not is_value and data.grad is None:\\n\\n if skip_no_grad:\\n\\n return\\n\\n raise RuntimeError(f\\\"the gradient of parameter {self.name!r} is not available\\\")\\n\\n # For dense buffers, use .data to fake gradients.\\n\\n # But we still need to pass is_value=False, otherwise updaters on server won't be called.\\n\\n data = data.data.numpy() if self.is_dense_buffer or is_value else data.grad.data.numpy()\\n\\n def push_dense_tensor():\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def push_dense_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.push(data, push_dense_tensor_done, is_value, False)\\n\\n return future\\n\\n await push_dense_tensor()\\n\\n\\n\\n async def _push_sparse_tensor(self, *, is_value=False, skip_no_grad=True):\\n\\n op = self.item\\n\\n keys, data = op.keys_and_data\\n\\n if keys is None:\\n\\n return\\n\\n if not is_value and data.grad is None:\\n\\n if skip_no_grad:\\n\\n return\\n\\n raise RuntimeError(f\\\"the gradient of operator {op!r} is not available\\\")\\n\\n data = data.data.numpy() if is_value else data.grad.data.numpy()\\n\\n op._check_dtype_and_shape(keys, data)\\n\\n def push_sparse_tensor():\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def push_sparse_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.push(keys, data, push_sparse_tensor_done, is_value)\\n\\n return future\\n\\n await push_sparse_tensor()\\n\\n\\n\\n def _load_tensor(self, dir_path, *, keep_meta=False):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def load_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n self._handle.load(dir_path, load_tensor_done, keep_meta)\\n\\n return future\\n\\n\\n\\n def _save_tensor(self, dir_path):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def save_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n if self.is_sparse:\\n\\n text_mode = self.item.save_as_text\\n\\n self._handle.save(dir_path, save_tensor_done, text_mode)\\n\\n else:\\n\\n self._handle.save(dir_path, save_tensor_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_clear(self):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_clear_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.clear(sparse_tensor_clear_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_export(self, dir_path):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_export_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n self._handle.export(dir_path, sparse_tensor_export_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_import_from(self, meta_file_path, *,\\n\\n data_only=False, skip_existing=False,\\n\\n transform_key=False, feature_name=''):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_import_from_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n meta_file_path = use_s3(meta_file_path)\\n\\n self._handle.import_from(meta_file_path, sparse_tensor_import_from_done,\\n\\n data_only, skip_existing,\\n\\n transform_key, feature_name)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_prune_small(self, epsilon):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_prune_small_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.prune_small(epsilon, sparse_tensor_prune_small_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_prune_old(self, max_age):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_prune_old_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.prune_old(max_age, sparse_tensor_prune_old_done)\\n\\n return future\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 75,\n \"score\": 75435.00284947186\n },\n {\n \"content\": \"#\\n\\n# Copyright 2021 Mobvista\\n\\n#\\n\\n# Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n# you may not use this file except in compliance with the License.\\n\\n# You may obtain a copy of the License at\\n\\n#\\n\\n# http://www.apache.org/licenses/LICENSE-2.0\\n\\n#\\n\\n# Unless required by applicable law or agreed to in writing, software\\n\\n# distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n# See the License for the specific language governing permissions and\\n\\n# limitations under the License.\\n\\n#\\n\\n\\n\\nimport asyncio\\n\\nimport torch\\n\\nimport pyspark\\n\\nfrom .embedding import EmbeddingOperator\\n\\nfrom .estimator import PyTorchAgent\\n\\nfrom .estimator import PyTorchLauncher\\n\\nfrom .estimator import PyTorchModel\\n\\nfrom .estimator import PyTorchEstimator\\n\\n\\n\\nclass TwoTowerRankingModule(torch.nn.Module):\\n\\n def __init__(self, user_module, item_module, item_embedding_module, similarity_module):\\n\\n super().__init__()\\n\\n if not isinstance(user_module, torch.nn.Module):\\n\\n raise TypeError(f\\\"user_module must be torch.nn.Module; {user_module!r} is invalid\\\")\\n\\n if not isinstance(item_module, torch.nn.Module):\\n\\n raise TypeError(f\\\"item_module must be torch.nn.Module; {item_module!r} is invalid\\\")\\n\\n if not isinstance(item_embedding_module, torch.nn.Module):\\n\\n raise TypeError(f\\\"item_embedding_module must be torch.nn.Module; {item_embedding_module!r} is invalid\\\")\\n\\n if not isinstance(similarity_module, torch.nn.Module):\\n\\n raise TypeError(f\\\"similarity_module must be torch.nn.Module; {similarity_module!r} is invalid\\\")\\n\\n self._user_module = user_module\\n\\n self._item_module = item_module\\n\\n self._item_embedding_module = item_embedding_module\\n\\n self._similarity_module = similarity_module\\n\\n\\n\\n @property\\n\\n def user_module(self):\\n\\n return self._user_module\\n\\n\\n\\n @property\\n\\n def item_module(self):\\n\\n return self._item_module\\n\\n\\n\\n @property\\n\\n def item_embedding_module(self):\\n\\n return self._item_embedding_module\\n\\n\\n\\n @property\\n\\n def similarity_module(self):\\n\\n return self._similarity_module\\n\\n\\n\\n def _get_item_embedding(self, x):\\n\\n if self.training or self._item_embedding_module is None:\\n\\n if self._item_module is None:\\n\\n raise RuntimeError(\\\"item_module is None\\\")\\n\\n item_emb = self._item_module(x)\\n\\n else:\\n\\n if self._item_embedding_module is None:\\n\\n raise RuntimeError(\\\"item_embedding_module is None\\\")\\n\\n item_emb = self._item_embedding_module(x)\\n\\n return item_emb\\n\\n\\n\\n def forward(self, x):\\n\\n user_emb = self._user_module(x)\\n\\n item_emb = self._get_item_embedding(x)\\n\\n sim = self._similarity_module(user_emb, item_emb)\\n\\n return sim\\n\\n\\n\\nclass TwoTowerRankingAgent(PyTorchAgent):\\n\\n def _mark_unexported_operators(self, module):\\n\\n for name, mod in module.named_modules():\\n\\n if isinstance(mod, EmbeddingOperator):\\n\\n mod.is_exported = False\\n\\n\\n\\n def _unmark_unexported_operators(self, module):\\n\\n for name, mod in module.named_modules():\\n\\n if isinstance(mod, EmbeddingOperator):\\n\\n mod.is_exported = True\\n\\n\\n\\n def _mark_backing_operators(self, module):\\n\\n for name, mod in module.named_modules():\\n\\n if isinstance(mod, EmbeddingOperator):\\n\\n mod.is_backing = True\\n\\n\\n\\n def _unmark_backing_operators(self, module):\\n\\n for name, mod in module.named_modules():\\n\\n if isinstance(mod, EmbeddingOperator):\\n\\n mod.is_backing = False\\n\\n\\n\\n def _reload_combine_schemas(self, module, use_alternative_column_name_file):\\n\\n for name, mod in module.named_modules():\\n\\n if isinstance(mod, EmbeddingOperator):\\n\\n if mod.has_alternative_column_name_file_path:\\n\\n mod.reload_combine_schema(use_alternative_column_name_file)\\n\\n\\n\\n ## train\\n\\n\\n\\n @classmethod\\n\\n def _handle_item_embedding_module_for_train(cls, _):\\n\\n self = __class__.get_instance()\\n\\n self._mark_backing_operators(self.module.item_embedding_module)\\n\\n return _\\n\\n\\n\\n @classmethod\\n\\n def _restore_handle_item_embedding_module_for_train(cls, _):\\n\\n self = __class__.get_instance()\\n\\n self._unmark_backing_operators(self.module.item_embedding_module)\\n\\n return _\\n\\n\\n\\n def feed_training_dataset(self):\\n\\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\\n\\n rdd.barrier().mapPartitions(self._handle_item_embedding_module_for_train).collect()\\n\\n super().feed_training_dataset()\\n\\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\\n\\n rdd.barrier().mapPartitions(self._restore_handle_item_embedding_module_for_train).collect()\\n\\n self.feed_item_dataset()\\n\\n\\n\\n ## item_predict\\n\\n\\n\\n @classmethod\\n\\n def _pull_model_for_item_predict(cls, _):\\n\\n self = __class__.get_instance()\\n\\n asyncio.run(self.model._pull_tensors(force_mode=True))\\n\\n return _\\n\\n\\n\\n @classmethod\\n\\n def _handle_submodel_for_item_predict(cls, _):\\n\\n self = __class__.get_instance()\\n\\n self._reload_combine_schemas(self.module.item_module, True)\\n\\n self._reload_combine_schemas(self.module.item_embedding_module, True)\\n\\n self._item_predict_submodel = self.model.get_submodel(self.module.item_module, '_item_module.')\\n\\n return _\\n\\n\\n\\n @classmethod\\n\\n def _restore_handle_submodel_for_item_predict(cls, _):\\n\\n self = __class__.get_instance()\\n\\n self._reload_combine_schemas(self.module.item_module, False)\\n\\n self._reload_combine_schemas(self.module.item_embedding_module, False)\\n\\n del self._item_predict_submodel\\n\\n return _\\n\\n\\n\\n def feed_item_dataset(self):\\n\\n if self.item_dataset is not None:\\n\\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\\n\\n rdd.barrier().mapPartitions(self._pull_model_for_item_predict).collect()\\n\\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\\n\\n rdd.barrier().mapPartitions(self._handle_submodel_for_item_predict).collect()\\n\\n df = self.item_dataset.select(self.feed_item_minibatch()(*self.item_dataset.columns).alias('item_predict'))\\n\\n df.write.format('noop').mode('overwrite').save()\\n\\n rdd = self.spark_context.parallelize(range(self.worker_count), self.worker_count)\\n\\n rdd.barrier().mapPartitions(self._restore_handle_submodel_for_item_predict).collect()\\n\\n\\n\\n ## online_predict\\n\\n\\n\\n def _handle_item_module_for_online_predict(self):\\n\\n self._mark_unexported_operators(self.module.item_module)\\n\\n self._saved_item_module = self.module._item_module\\n\\n self.module._item_module = None\\n\\n\\n\\n def _restore_handle_item_module_for_online_predict(self):\\n\\n self.module._item_module = self._saved_item_module\\n\\n del self._saved_item_module\\n\\n self._unmark_unexported_operators(self.module.item_module)\\n\\n\\n\\n def export_model(self):\\n\\n if self.model_export_path is not None:\\n\\n self._handle_item_module_for_online_predict()\\n\\n super().export_model()\\n\\n self._restore_handle_item_module_for_online_predict()\\n\\n\\n\\n ## offline_predict\\n\\n\\n\\n def _handle_module_for_offline_predict(self):\\n\\n if self.use_amended_module_for_offline_predict:\\n\\n self._saved_item_module = self.module._item_module\\n\\n self.module._item_module = None\\n\\n else:\\n\\n self._saved_item_embedding_module = self.module._item_embedding_module\\n\\n self.module._item_embedding_module = None\\n\\n\\n\\n def _restore_handle_module_for_offline_predict(self):\\n\\n if self.use_amended_module_for_offline_predict:\\n\\n self.module._item_module = self._saved_item_module\\n\\n del self._saved_item_module\\n\\n else:\\n\\n self.module._item_embedding_module = self._saved_item_embedding_module\\n\\n del self._saved_item_embedding_module\\n\\n\\n\\n def setup_trainer(self):\\n\\n if not self.is_training_mode:\\n\\n self._handle_module_for_offline_predict()\\n\\n super().setup_trainer()\\n\\n\\n\\n def worker_stop(self):\\n\\n if not self.is_training_mode:\\n\\n self._restore_handle_module_for_offline_predict()\\n\\n super().worker_stop()\\n\\n\\n\\n ## helper methods for item_predict\\n\\n\\n\\n def feed_item_minibatch(self):\\n\\n from pyspark.sql.types import FloatType\\n\\n from pyspark.sql.functions import pandas_udf\\n\\n @pandas_udf(returnType=FloatType())\\n\\n def _feed_item_minibatch(*minibatch):\\n\\n self = __class__.get_instance()\\n\\n result = self.predict_item_minibatch(minibatch)\\n\\n result = self.process_minibatch_result(minibatch, result)\\n\\n return result\\n\\n return _feed_item_minibatch\\n\\n\\n\\n def _execute_combine(self, module, ndarrays):\\n\\n for name, mod in module.named_modules():\\n\\n if isinstance(mod, EmbeddingOperator):\\n\\n indices, offsets = mod._do_combine(ndarrays)\\n\\n return indices\\n\\n\\n\\n def _execute_push(self, module, keys, embeddings):\\n\\n for name, mod in module.named_modules():\\n\\n if isinstance(mod, EmbeddingOperator):\\n\\n mod.keys_and_data = keys, embeddings\\n\\n tensor = mod._distributed_tensor\\n\\n asyncio.run(tensor._push_tensor(is_value=True))\\n\\n mod._clean()\\n\\n return\\n\\n\\n\\n def _execute_item_embedding_combine(self, ndarrays):\\n\\n keys = self._execute_combine(self.module.item_embedding_module, ndarrays)\\n\\n return keys\\n\\n\\n\\n def _execute_item_embedding_push(self, keys, embeddings):\\n\\n self._execute_push(self.module.item_embedding_module, keys, embeddings)\\n\\n\\n\\n def predict_item_minibatch(self, minibatch):\\n\\n self._item_predict_submodel.eval()\\n\\n ndarrays = [col.values for col in minibatch]\\n\\n predictions = self._item_predict_submodel(ndarrays)\\n\\n embeddings = predictions.detach().numpy()\\n\\n keys = self._execute_item_embedding_combine(ndarrays)\\n\\n self._execute_item_embedding_push(keys, embeddings)\\n\\n\\n\\nclass TwoTowerRankingLauncher(PyTorchLauncher):\\n\\n def __init__(self):\\n\\n super().__init__()\\n\\n self.item_dataset = None\\n\\n\\n\\n def _initialize_agent(self, agent):\\n\\n agent.item_dataset = self.item_dataset\\n\\n super()._initialize_agent(agent)\\n\\n\\n\\nclass TwoTowerRankingHelperMixin(object):\\n\\n def __init__(self, item_dataset=None, use_amended_module_for_offline_predict=False, **kwargs):\\n\\n super().__init__(**kwargs)\\n\\n self.item_dataset = item_dataset\\n\\n self.use_amended_module_for_offline_predict = use_amended_module_for_offline_predict\\n\\n self.extra_agent_attributes['use_amended_module_for_offline_predict'] = self.use_amended_module_for_offline_predict\\n\\n\\n\\n def _check_properties(self):\\n\\n super()._check_properties()\\n\\n if not isinstance(self.module, TwoTowerRankingModule):\\n\\n raise TypeError(f\\\"module must be TwoTowerRankingModule; {self.module!r} is invalid\\\")\\n\\n if self.item_dataset is not None and not isinstance(self.item_dataset, pyspark.sql.DataFrame):\\n\\n raise TypeError(f\\\"item_dataset must be pyspark.sql.DataFrame; {self.item_dataset!r} is invalid\\\")\\n\\n\\n\\n def _get_launcher_class(self):\\n\\n return TwoTowerRankingLauncher\\n\\n\\n\\n def _get_model_class(self):\\n\\n return TwoTowerRankingModel\\n\\n\\n\\n def _get_agent_class(self):\\n\\n return self.agent_class or TwoTowerRankingAgent\\n\\n\\n\\n def _get_model_arguments(self, module):\\n\\n args = super()._get_model_arguments(module)\\n\\n args['item_dataset'] = self.item_dataset\\n\\n args['use_amended_module_for_offline_predict'] = self.use_amended_module_for_offline_predict\\n\\n return args\\n\\n\\n\\n def _create_launcher(self, dataset, is_training_mode):\\n\\n launcher = super()._create_launcher(dataset, is_training_mode)\\n\\n if is_training_mode:\\n\\n launcher.item_dataset = self.item_dataset\\n\\n return launcher\\n\\n\\n\\nclass TwoTowerRankingModel(TwoTowerRankingHelperMixin, PyTorchModel):\\n\\n pass\\n\\n\\n\\nclass TwoTowerRankingEstimator(TwoTowerRankingHelperMixin, PyTorchEstimator):\\n\\n def _check_properties(self):\\n\\n super()._check_properties()\\n\\n if self.model_export_path is not None and self.item_dataset is None:\\n\\n raise RuntimeError(\\\"item_dataset must be specified to export model\\\")\\n\\n if self.use_amended_module_for_offline_predict and self.item_dataset is None:\\n\\n raise RuntimeError(\\\"item_dataset must be specified to use amended module for offline predict\\\")\\n\",\n \"file_path\": \"python/mindalpha/two_tower_ranking.py\",\n \"rank\": 76,\n \"score\": 75172.36671581458\n },\n {\n \"content\": \" def _checked_get_alternative_column_name_file_path(self):\\n\\n if self._alternative_column_name_file_path is None:\\n\\n raise RuntimeError(\\\"alternative_column_name_file_path is not set\\\")\\n\",\n \"file_path\": \"python/mindalpha/embedding.py\",\n \"rank\": 77,\n \"score\": 74172.74505025278\n },\n {\n \"content\": \" class ActorProcess* actor_process_ = nullptr;\\n\\n\\n\\n struct TrackerEntry\\n\\n {\\n\\n int total = 0;\\n\\n std::vector<PSMessage> responses;\\n\\n\\n\\n void Clear()\\n\\n {\\n\\n responses.clear();\\n\\n }\\n\\n };\\n\\n\\n\\n std::mutex tracker_mutex_;\\n\\n std::condition_variable tracker_cv_;\\n\\n std::unordered_map<int64_t, TrackerEntry> tracker_;\\n\\n\\n\\n bool is_coordinator_ = false;\\n\\n bool is_server_ = false;\\n\\n bool is_worker_ = false;\\n\\n\\n\\n int server_count_ = 0;\\n\\n int worker_count_ = 0;\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/ps_agent.h\",\n \"rank\": 78,\n \"score\": 64223.99688488009\n },\n {\n \"content\": \"class NodeInfo\\n\\n{\\n\\npublic:\\n\\n NodeRole GetRole() const { return role_; }\\n\\n void SetRole(NodeRole value) { role_ = value; }\\n\\n\\n\\n int GetNodeId() const { return node_id_; }\\n\\n void SetNodeId(int value) { node_id_ = value; }\\n\\n\\n\\n const std::string& GetHostName() const { return host_name_; }\\n\\n void SetHostName(std::string value) { host_name_ = std::move(value); }\\n\\n\\n\\n int GetPort() const { return port_; }\\n\\n void SetPort(int value) { port_ = value; }\\n\\n\\n\\n std::string GetAddress() const { return host_name_ + \\\":\\\" + std::to_string(port_); }\\n\\n\\n\\n std::string ToString() const;\\n\\n std::string ToShortString() const;\\n\\n std::string ToJsonString() const;\\n\",\n \"file_path\": \"cpp/mindalpha/node_info.h\",\n \"rank\": 79,\n \"score\": 59075.37796274977\n },\n {\n \"content\": \"class NodeControl\\n\\n{\\n\\npublic:\\n\\n bool IsEmpty() const { return command_ == NullNodeControlCommand; }\\n\\n\\n\\n NodeControlCommand GetCommand() const { return command_; }\\n\\n void SetCommand(NodeControlCommand value) { command_ = value; }\\n\\n\\n\\n //\\n\\n // Methods related to node info.\\n\\n //\\n\\n std::vector<NodeInfo>& GetNodes() { return nodes_; }\\n\\n const std::vector<NodeInfo>& GetNodes() const { return nodes_; }\\n\\n void SetNodes(std::vector<NodeInfo> value) { nodes_ = std::move(value); }\\n\\n\\n\\n void ClearNodes() { nodes_.clear(); }\\n\\n void AddNode(NodeInfo value) { nodes_.push_back(std::move(value)); }\\n\\n\\n\\n //\\n\\n // Methods related to barrier group.\\n\",\n \"file_path\": \"cpp/mindalpha/node_control.h\",\n \"rank\": 80,\n \"score\": 59075.37796274977\n },\n {\n \"content\": \"class NodeManager\\n\\n{\\n\\npublic:\\n\\n explicit NodeManager(std::shared_ptr<ActorConfig> config);\\n\\n\\n\\n std::shared_ptr<ActorConfig> GetConfig() const { return config_; }\\n\\n void SetConfig(std::shared_ptr<ActorConfig> value) { config_ = std::move(value); }\\n\\n\\n\\n const std::vector<int>& GetNodeIds(int group) const;\\n\\n void Barrier(int group, ActorProcess& process);\\n\\n void NotifyBarrierDone(const Message& msg);\\n\\n void UpdateHeartbeat(int nodeId, time_t t);\\n\\n std::vector<int> GetDeadNodes(int timeout);\\n\\n\\n\\nprivate:\\n\\n void InitNodeIds();\\n\\n\\n\\n std::shared_ptr<ActorConfig> config_;\\n\\n std::mutex start_mutex_;\\n\\n time_t start_time_ = 0;\\n\\n std::unordered_map<int, std::vector<int>> node_ids_;\\n\\n std::mutex barrier_mutex_;\\n\\n std::condition_variable barrier_cv_;\\n\\n bool barrier_done_;\\n\\n std::mutex heartbeat_mutex_;\\n\\n std::unordered_map<int, time_t> heartbeats_;\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/node_manager.h\",\n \"rank\": 81,\n \"score\": 59075.37796274977\n },\n {\n \"content\": \"class MessageMeta\\n\\n{\\n\\npublic:\\n\\n int GetMessageId() const { return message_id_; }\\n\\n void SetMessageId(int value) { message_id_ = value; }\\n\\n\\n\\n int GetSender() const { return sender_; }\\n\\n void SetSender(int value) { sender_ = value; }\\n\\n\\n\\n int GetReceiver() const { return receiver_; }\\n\\n void SetReceiver(int value) { receiver_ = value; }\\n\\n\\n\\n bool IsRequest() const { return is_request_; }\\n\\n void SetIsRequest(bool value) { is_request_ = value; }\\n\\n\\n\\n bool IsException() const { return is_exception_; }\\n\\n void SetIsException(bool value) { is_exception_ = value; }\\n\\n\\n\\n const std::string& GetBody() const { return body_; }\\n\\n void SetBody(std::string value) { body_ = std::move(value); }\\n\",\n \"file_path\": \"cpp/mindalpha/message_meta.h\",\n \"rank\": 82,\n \"score\": 58993.800792978516\n },\n {\n \"content\": \"class DenseTensor\\n\\n{\\n\\npublic:\\n\\n DenseTensorMeta& GetMeta() { return meta_; }\\n\\n const DenseTensorMeta& GetMeta() const { return meta_; }\\n\\n void SetMeta(DenseTensorMeta value) { meta_ = std::move(value); }\\n\\n\\n\\n std::shared_ptr<PSAgent> GetAgent() const { return agent_; }\\n\\n void SetAgent(std::shared_ptr<PSAgent> value) { agent_ = std::move(value); }\\n\\n\\n\\n void Init(std::function<void()> cb);\\n\\n void Dispose(std::function<void()> cb);\\n\\n void Push(SmartArray<uint8_t> in, std::function<void()> cb, bool is_value = false, bool is_state = false);\\n\\n void Pull(std::function<void(SmartArray<uint8_t> out)> cb, bool is_state = false);\\n\\n void PushMeta(const DenseTensorMeta& meta, std::function<void()> cb);\\n\\n void PullMeta(std::function<void(DenseTensorMeta meta)> cb);\\n\\n void Load(const std::string& dir_path, std::function<void()> cb, bool keep_meta = false);\\n\\n void Save(const std::string& dir_path, std::function<void()> cb);\\n\\n\\n\\nprivate:\\n\\n std::string GetDenseMetaPath(const std::string& dir_path) const;\\n\\n std::string GetDenseDataPath(const std::string& dir_path) const;\\n\\n std::string GetDenseStatePath(const std::string& dir_path) const;\\n\\n\\n\\n DenseTensorMeta meta_;\\n\\n std::shared_ptr<PSAgent> agent_;\\n\\n};\\n\\n\\n\\n}\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor.h\",\n \"rank\": 83,\n \"score\": 57832.04558497133\n },\n {\n \"content\": \"class SparseTensor\\n\\n{\\n\\npublic:\\n\\n SparseTensorMeta& GetMeta() { return meta_; }\\n\\n const SparseTensorMeta& GetMeta() const { return meta_; }\\n\\n void SetMeta(SparseTensorMeta value) { meta_ = std::move(value); }\\n\\n\\n\\n std::shared_ptr<PSAgent> GetAgent() const { return agent_; }\\n\\n void SetAgent(std::shared_ptr<PSAgent> value) { agent_ = std::move(value); }\\n\\n\\n\\n void Init(std::function<void()> cb);\\n\\n void Dispose(std::function<void()> cb);\\n\\n void Clear(std::function<void()> cb);\\n\\n void Push(SmartArray<uint8_t> keys, SmartArray<uint8_t> in, std::function<void()> cb,\\n\\n bool is_value = false);\\n\\n void Pull(SmartArray<uint8_t> keys, std::function<void(SmartArray<uint8_t> out)> cb,\\n\\n bool read_only = false, bool nan_fill = false);\\n\\n void PushPartition(ArrayHashMap<uint64_t, uint8_t>& data, std::function<void()> cb,\\n\\n bool data_only = false, bool skip_existing = false);\\n\\n void PullPartition(ArrayHashMap<uint64_t, uint8_t>& data, std::function<void()> cb,\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor.h\",\n \"rank\": 84,\n \"score\": 57832.04558497133\n },\n {\n \"content\": \"class TensorPartitionStore\\n\\n{\\n\\npublic:\\n\\n int GetPartitionCount() const { return partition_count_; }\\n\\n void SetPartitionCount(int value) { partition_count_ = value; }\\n\\n\\n\\n int GetPartitionIndex() const { return partition_index_; }\\n\\n void SetPartitionIndex(int value) { partition_index_ = value; }\\n\\n\\n\\n void DenseInit(const DenseTensorMeta& meta);\\n\\n void DenseDispose(const std::string& name);\\n\\n void DensePush(const std::string& name, PSMessage req, bool is_value, bool is_state);\\n\\n PSMessage DensePull(const std::string& name, bool is_state);\\n\\n void DensePushMeta(const std::string& name, const DenseTensorMeta& meta);\\n\\n PSMessage DensePullMeta(const std::string& name);\\n\\n\\n\\n void SparseInit(const SparseTensorMeta& meta);\\n\\n void SparseDispose(const std::string& name);\\n\\n void SparseClear(const std::string& name);\\n\\n void SparsePush(const std::string& name, PSMessage req, bool is_value);\\n\",\n \"file_path\": \"cpp/mindalpha/tensor_partition_store.h\",\n \"rank\": 85,\n \"score\": 55685.93481683781\n },\n {\n \"content\": \"class SparseTensorPartition\\n\\n{\\n\\npublic:\\n\\n SparseTensorMeta& GetMeta() { return meta_; }\\n\\n const SparseTensorMeta& GetMeta() const { return meta_; }\\n\\n void SetMeta(SparseTensorMeta value) { meta_ = std::move(value); }\\n\\n\\n\\n int GetPartitionIndex() const { return partition_index_; }\\n\\n void SetPartitionIndex(int value) { partition_index_ = value; }\\n\\n\\n\\n void AllocateHashMap();\\n\\n void Clear();\\n\\n void HandlePush(SmartArray<uint8_t> keys, SmartArray<uint8_t> in, bool is_value);\\n\\n SmartArray<uint8_t> HandlePull(SmartArray<uint8_t> keys, bool read_only, bool nan_fill);\\n\\n void HandlePushPartition(SmartArray<uint8_t> keys, SmartArray<uint8_t> in, bool data_only, bool skip_existing);\\n\\n SmartArray<uint8_t> HandlePullPartition(bool data_only, int index, int count, SmartArray<uint8_t>& keys);\\n\\n void HandlePushMeta(const SparseTensorMeta& meta);\\n\\n const SparseTensorMeta& HandlePullMeta();\\n\\n void Load(const std::string& dir_path);\\n\\n void Save(const std::string& dir_path, bool text_mode);\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor_partition.h\",\n \"rank\": 86,\n \"score\": 55685.93481683781\n },\n {\n \"content\": \"class DenseTensorPartition\\n\\n{\\n\\npublic:\\n\\n DenseTensorMeta& GetMeta() { return meta_; }\\n\\n const DenseTensorMeta& GetMeta() const { return meta_; }\\n\\n void SetMeta(DenseTensorMeta value) { meta_ = std::move(value); }\\n\\n\\n\\n std::vector<size_t>& GetPartitionDataShape() { return partition_data_shape_; }\\n\\n const std::vector<size_t>& GetPartitionDataShape() const { return partition_data_shape_; }\\n\\n void SetPartitionDataShape(std::vector<size_t> value) { partition_data_shape_ = std::move(value); }\\n\\n\\n\\n std::vector<size_t>& GetPartitionStateShape() { return partition_state_shape_; }\\n\\n const std::vector<size_t>& GetPartitionStateShape() const { return partition_state_shape_; }\\n\\n void SetPartitionStateShape(std::vector<size_t> value) { partition_state_shape_ = std::move(value); }\\n\\n\\n\\n int GetPartitionIndex() const { return partition_index_; }\\n\\n void SetPartitionIndex(int value) { partition_index_ = value; }\\n\\n\\n\\n size_t GetOffset() const { return offset_; }\\n\\n void SetOffset(size_t value) { offset_ = value; }\\n\",\n \"file_path\": \"cpp/mindalpha/dense_tensor_partition.h\",\n \"rank\": 87,\n \"score\": 55685.93481683781\n },\n {\n \"content\": \"def file_exists(url):\\n\\n import os\\n\\n from .s3_utils import s3_file_exists\\n\\n if url.startswith('s3://') or url.startswith('s3a://'):\\n\\n return s3_file_exists(url)\\n\\n else:\\n\",\n \"file_path\": \"python/mindalpha/file_utils.py\",\n \"rank\": 88,\n \"score\": 54956.713616043155\n },\n {\n \"content\": \"def delete_file(url):\\n\\n import os\\n\\n from .s3_utils import delete_s3_file\\n\\n if url.startswith('s3://') or url.startswith('s3a://'):\\n\\n delete_s3_file(url)\\n\\n else:\\n\\n if os.path.isfile(url):\\n\",\n \"file_path\": \"python/mindalpha/file_utils.py\",\n \"rank\": 89,\n \"score\": 54956.713616043155\n },\n {\n \"content\": \"class LocalFileSystem : public FileSystem {\\n\\npublic:\\n\\n /*! \\\\brief destructor */\\n\\n virtual ~LocalFileSystem() {\\n\\n }\\n\\n /*!\\n\\n * \\\\brief get information about a path\\n\\n * \\\\param path the path to the file\\n\\n * \\\\return the information about the file\\n\\n */\\n\\n virtual FileInfo GetPathInfo(const URI &path);\\n\\n /*!\\n\\n * \\\\brief list files in a directory\\n\\n * \\\\param path to the file\\n\\n * \\\\param out_list the output information about the files\\n\\n */\\n\\n virtual void ListDirectory(const URI &path, std::vector<FileInfo> *out_list);\\n\\n /*!\\n\\n * \\\\brief open a stream, will report error and exit if bad thing happens\\n\\n * NOTE: the IStream can continue to work even when filesystem was destructed\\n\",\n \"file_path\": \"cpp/mindalpha/local_filesys.h\",\n \"rank\": 90,\n \"score\": 54788.33024675009\n },\n {\n \"content\": \"def is_valid_qualified_name(name):\\n\\n pattern = r'^[A-Za-z_.\\\\-][A-Za-z0-9_.\\\\-]*$'\\n\\n match = re.match(pattern, name)\\n\",\n \"file_path\": \"python/mindalpha/name_utils.py\",\n \"rank\": 91,\n \"score\": 54208.31422425268\n },\n {\n \"content\": \" def _push_tensor(self, *, is_value=False, skip_no_grad=True):\\n\\n if self.is_dense:\\n\\n return self._push_dense_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\\n\\n else:\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 92,\n \"score\": 53883.14474432791\n },\n {\n \"content\": \"class DistributedTensor(object):\\n\\n def __init__(self, name, item, name_prefix):\\n\\n self.__name = name if name_prefix is None else name_prefix + name\\n\\n self.__item = item\\n\\n self.__handle = None\\n\\n\\n\\n @property\\n\\n def name(self):\\n\\n return self.__name\\n\\n\\n\\n @property\\n\\n def item(self):\\n\\n return self.__item\\n\\n\\n\\n @property\\n\\n def _handle(self):\\n\\n return self.__handle\\n\\n\\n\\n @property\\n\\n def is_dense(self):\\n\\n return isinstance(self.item, torch.Tensor)\\n\\n\\n\\n @property\\n\\n def is_dense_parameter(self):\\n\\n return isinstance(self.item, torch.nn.Parameter)\\n\\n\\n\\n @property\\n\\n def is_dense_buffer(self):\\n\\n return self.is_dense and not self.is_dense_parameter\\n\\n\\n\\n @property\\n\\n def is_sparse(self):\\n\\n return isinstance(self.item, EmbeddingOperator)\\n\\n\\n\\n @property\\n\\n def is_backing(self):\\n\\n return self.is_sparse and self.item.is_backing\\n\\n\\n\\n @property\\n\\n def is_exported(self):\\n\\n return self.is_sparse and self.item.is_exported\\n\\n\\n\\n def _zero_grad(self):\\n\\n if self.is_dense_parameter or self.is_sparse:\\n\\n if self.item.grad is not None:\\n\\n self.item.grad.detach_()\\n\\n self.item.grad.zero_()\\n\\n\\n\\n def _init_tensor(self, trainer):\\n\\n if self.is_dense:\\n\\n return self._init_dense_tensor(trainer)\\n\\n else:\\n\\n return self._init_sparse_tensor(trainer)\\n\\n\\n\\n def _init_tensor_log(self, x):\\n\\n if self.is_dense_parameter:\\n\\n string = \\\"\\\\033[38;5;046m\\\"\\n\\n elif self.is_dense_buffer:\\n\\n string = \\\"\\\\033[38;5;051m\\\"\\n\\n else:\\n\\n string = \\\"\\\\033[38;5;196m\\\"\\n\\n if self.is_dense:\\n\\n string += f\\\"init dense tensor {x.name} with shape {x.data_shape}, \\\"\\n\\n else:\\n\\n string += f\\\"init sparse tensor {x.name} with slice shape {x.slice_data_shape}, \\\"\\n\\n string += f\\\"updater {x.updater} and \\\"\\n\\n string += f\\\"initializer {x.initializer}\\\"\\n\\n string += \\\"\\\\033[m\\\"\\n\\n print(string)\\n\\n\\n\\n def _init_dense_tensor(self, trainer):\\n\\n x = DenseTensor()\\n\\n x.name = self.name\\n\\n x.data_type = trainer._get_dtype_name(self)\\n\\n x.data_shape = trainer._get_dense_data_shape(self)\\n\\n x.state_shape = trainer._get_dense_state_shape(self)\\n\\n x.initializer = trainer._get_dense_initializer(self)\\n\\n x.updater = trainer._get_dense_updater(self)\\n\\n x.partition_count = trainer.agent.server_count\\n\\n x.agent = trainer.agent._cxx_agent\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def init_dense_tensor_done():\\n\\n self.__handle = x\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._init_tensor_log(x)\\n\\n x.init(init_dense_tensor_done)\\n\\n return future\\n\\n\\n\\n def _init_sparse_tensor(self, trainer):\\n\\n x = SparseTensor()\\n\\n x.name = self.name\\n\\n x.data_type = trainer._get_dtype_name(self)\\n\\n x.slice_data_shape = trainer._get_sparse_slice_data_shape(self)\\n\\n x.slice_state_shape = trainer._get_sparse_slice_state_shape(self)\\n\\n x.initializer = trainer._get_sparse_initializer(self)\\n\\n x.updater = trainer._get_sparse_updater(self)\\n\\n x.partition_count = trainer.agent.server_count\\n\\n x.agent = trainer.agent._cxx_agent\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def init_sparse_tensor_done():\\n\\n self.__handle = x\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._init_tensor_log(x)\\n\\n x.init(init_sparse_tensor_done)\\n\\n return future\\n\\n\\n\\n def _pull_tensor(self):\\n\\n if self.is_dense:\\n\\n return self._pull_dense_tensor()\\n\\n else:\\n\\n return self._pull_sparse_tensor()\\n\\n\\n\\n def _pull_dense_tensor(self):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def pull_dense_tensor_done(data):\\n\\n data = torch.from_numpy(data)\\n\\n data = data.view(self.item.shape)\\n\\n self.item.data.copy_(data)\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.pull(pull_dense_tensor_done, False)\\n\\n return future\\n\\n\\n\\n async def _pull_sparse_tensor(self):\\n\\n op = self.item\\n\\n keys = op.keys\\n\\n if keys is None:\\n\\n return\\n\\n read_only = not op.training or not op.requires_grad\\n\\n nan_fill = read_only and op.use_nan_fill\\n\\n def pull_sparse_tensor():\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def pull_sparse_tensor_done(data):\\n\\n op._check_dtype_and_shape(keys, data)\\n\\n op._update_data(data)\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.pull(keys, pull_sparse_tensor_done, read_only, nan_fill)\\n\\n return future\\n\\n await pull_sparse_tensor()\\n\\n\\n\\n def _push_tensor(self, *, is_value=False, skip_no_grad=True):\\n\\n if self.is_dense:\\n\\n return self._push_dense_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\\n\\n else:\\n\\n return self._push_sparse_tensor(is_value=is_value, skip_no_grad=skip_no_grad)\\n\\n\\n\\n async def _push_dense_tensor(self, *, is_value=False, skip_no_grad=True):\\n\\n data = self.item\\n\\n if self.is_dense_parameter:\\n\\n if not is_value and data.grad is None:\\n\\n if skip_no_grad:\\n\\n return\\n\\n raise RuntimeError(f\\\"the gradient of parameter {self.name!r} is not available\\\")\\n\\n # For dense buffers, use .data to fake gradients.\\n\\n # But we still need to pass is_value=False, otherwise updaters on server won't be called.\\n\\n data = data.data.numpy() if self.is_dense_buffer or is_value else data.grad.data.numpy()\\n\\n def push_dense_tensor():\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def push_dense_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.push(data, push_dense_tensor_done, is_value, False)\\n\\n return future\\n\\n await push_dense_tensor()\\n\\n\\n\\n async def _push_sparse_tensor(self, *, is_value=False, skip_no_grad=True):\\n\\n op = self.item\\n\\n keys, data = op.keys_and_data\\n\\n if keys is None:\\n\\n return\\n\\n if not is_value and data.grad is None:\\n\\n if skip_no_grad:\\n\\n return\\n\\n raise RuntimeError(f\\\"the gradient of operator {op!r} is not available\\\")\\n\\n data = data.data.numpy() if is_value else data.grad.data.numpy()\\n\\n op._check_dtype_and_shape(keys, data)\\n\\n def push_sparse_tensor():\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def push_sparse_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.push(keys, data, push_sparse_tensor_done, is_value)\\n\\n return future\\n\\n await push_sparse_tensor()\\n\\n\\n\\n def _load_tensor(self, dir_path, *, keep_meta=False):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def load_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n self._handle.load(dir_path, load_tensor_done, keep_meta)\\n\\n return future\\n\\n\\n\\n def _save_tensor(self, dir_path):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def save_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n if self.is_sparse:\\n\\n text_mode = self.item.save_as_text\\n\\n self._handle.save(dir_path, save_tensor_done, text_mode)\\n\\n else:\\n\\n self._handle.save(dir_path, save_tensor_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_clear(self):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_clear_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.clear(sparse_tensor_clear_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_export(self, dir_path):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_export_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n self._handle.export(dir_path, sparse_tensor_export_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_import_from(self, meta_file_path, *,\\n\\n data_only=False, skip_existing=False,\\n\\n transform_key=False, feature_name=''):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_import_from_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n meta_file_path = use_s3(meta_file_path)\\n\\n self._handle.import_from(meta_file_path, sparse_tensor_import_from_done,\\n\\n data_only, skip_existing,\\n\\n transform_key, feature_name)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_prune_small(self, epsilon):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_prune_small_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.prune_small(epsilon, sparse_tensor_prune_small_done)\\n\\n return future\\n\\n\\n\\n def _sparse_tensor_prune_old(self, max_age):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def sparse_tensor_prune_old_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n self._handle.prune_old(max_age, sparse_tensor_prune_old_done)\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 93,\n \"score\": 53883.14474432791\n },\n {\n \"content\": \" def _init_tensor(self, trainer):\\n\\n if self.is_dense:\\n\\n return self._init_dense_tensor(trainer)\\n\\n else:\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 94,\n \"score\": 53883.14474432791\n },\n {\n \"content\": \" def _pull_tensor(self):\\n\\n if self.is_dense:\\n\\n return self._pull_dense_tensor()\\n\\n else:\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 95,\n \"score\": 53883.14474432791\n },\n {\n \"content\": \" def _save_tensor(self, dir_path):\\n\\n loop = asyncio.get_running_loop()\\n\\n future = loop.create_future()\\n\\n def save_tensor_done():\\n\\n loop.call_soon_threadsafe(future.set_result, None)\\n\\n dir_path = use_s3(dir_path)\\n\\n if self.is_sparse:\\n\\n text_mode = self.item.save_as_text\\n\\n self._handle.save(dir_path, save_tensor_done, text_mode)\\n\\n else:\\n\\n self._handle.save(dir_path, save_tensor_done)\\n\",\n \"file_path\": \"python/mindalpha/distributed_tensor.py\",\n \"rank\": 96,\n \"score\": 53883.14474432791\n },\n {\n \"content\": \"class S3FileSystem : public FileSystem {\\n\\n public:\\n\\n /*! \\\\brief destructor */\\n\\n virtual ~S3FileSystem() {}\\n\\n /*!\\n\\n * \\\\brief get information about a path\\n\\n * \\\\param path the path to the file\\n\\n * \\\\return the information about the file\\n\\n */\\n\\n virtual FileInfo GetPathInfo(const URI &path) override;\\n\\n /*!\\n\\n * \\\\brief list files in a directory\\n\\n * \\\\param path to the file\\n\\n * \\\\param out_list the output information about the files\\n\\n */\\n\\n virtual void ListDirectory(const URI &path, std::vector<FileInfo> *out_list) override;\\n\\n /*!\\n\\n * \\\\brief open a stream, will report error and exit if bad thing happens\\n\\n * NOTE: the Stream can continue to work even when filesystem was destructed\\n\\n * \\\\param path path to file\\n\",\n \"file_path\": \"cpp/mindalpha/s3_sdk_filesys.h\",\n \"rank\": 97,\n \"score\": 53828.35101683957\n },\n {\n \"content\": \" { \\\"name\\\", GetMeta().GetName() },\\n\\n };\\n\\n req->GetMessageMeta().SetReceiver(ServerGroup);\\n\\n req->GetMessageMeta().SetBody(json.dump());\\n\\n agent_->BroadcastRequest(req, [this, cb](PSMessage req, std::vector<PSMessage> ress) {\\n\\n for (size_t k = 0; k < ress.size(); k++)\\n\\n {\\n\\n const std::string& body1 = ress.at(0)->GetMessageMeta().GetBody();\\n\\n const std::string& body2 = ress.at(k)->GetMessageMeta().GetBody();\\n\\n if (body1 != body2)\\n\\n {\\n\\n const int nodeId1 = ress.at(0)->GetMessageMeta().GetSender();\\n\\n const int nodeId2 = ress.at(k)->GetMessageMeta().GetSender();\\n\\n std::string serr;\\n\\n serr.append(\\\"Meta of sparse tensor '\\\");\\n\\n serr.append(GetMeta().GetName());\\n\\n serr.append(\\\"' on node \\\");\\n\\n serr.append(NodeIdToString(nodeId1));\\n\\n serr.append(\\\" and \\\");\\n\\n serr.append(NodeIdToString(nodeId2));\\n\",\n \"file_path\": \"cpp/mindalpha/sparse_tensor.cpp\",\n \"rank\": 98,\n \"score\": 49.91848310427618\n }\n]","isConversational":false}}},{"rowIdx":478,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"chrome/browser/ui/views/tabs/color_picker_view.cc"},"repo_name":{"kind":"string","value":"sarang-apps/darshan_browser"},"commit":{"kind":"string","value":"173649bb8a7c656dc60784d19e7bb73e07c20daa"},"file_code":{"kind":"string","value":"\n\n#include \"chrome/browser/ui/views/tabs/color_picker_view.h\"\n\n#include <memory>\n#include <vector>\n\n#include \"base/bind.h\"\n#include \"base/callback.h\"\n#include \"base/containers/span.h\"\n#include \"chrome/browser/themes/theme_properties.h\"\n#include \"chrome/browser/ui/tabs/tab_group_theme.h\"\n#include \"chrome/browser/ui/views/chrome_layout_provider.h\"\n#include \"components/tab_groups/tab_group_color.h\"\n#include \"ui/accessibility/ax_enums.mojom.h\"\n#include \"ui/accessibility/ax_node_data.h\"\n#include \"ui/base/pointer/touch_ui_controller.h\"\n#include \"ui/base/theme_provider.h\"\n#include \"ui/gfx/animation/tween.h\"\n#include \"ui/gfx/canvas.h\"\n#include \"ui/gfx/color_palette.h\"\n#include \"ui/gfx/color_utils.h\"\n#include \"ui/gfx/favicon_size.h\"\n#include \"ui/views/border.h\"\n#include \"ui/views/controls/button/button.h\"\n#include \"ui/views/controls/highlight_path_generator.h\"\n#include \"ui/views/layout/box_layout.h\"\n#include \"ui/views/layout/flex_layout.h\"\n#include \"ui/views/layout/flex_layout_types.h\"\n#include \"ui/views/view_class_properties.h\"\n\nnamespace {\n\nclass ColorPickerHighlightPathGenerator : public views::HighlightPathGenerator {\n public:\n ColorPickerHighlightPathGenerator() = default;\n\n \n SkPath GetHighlightPath(const views::View* view) override {\n \n gfx::RectF bounds(view->GetContentsBounds());\n bounds.Inset(gfx::Insets(-2.0f));\n const gfx::PointF center = bounds.CenterPoint();\n return SkPath().addCircle(center.x(), center.y(), bounds.width() / 2.0f);\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(ColorPickerHighlightPathGenerator);\n};\n\n} \n\nclass ColorPickerElementView : public views::Button,\n public views::ButtonListener {\n public:\n ColorPickerElementView(\n base::RepeatingCallback<void(ColorPickerElementView*)> selected_callback,\n const views::BubbleDialogDelegateView* bubble_view,\n tab_groups::TabGroupColorId color_id,\n base::string16 color_name)\n : Button(this),\n selected_callback_(std::move(selected_callback)),\n bubble_view_(bubble_view),\n color_id_(color_id),\n color_name_(color_name) {\n DCHECK(selected_callback_);\n\n SetAccessibleName(color_name);\n SetFocusForPlatform();\n SetInstallFocusRingOnFocus(true);\n views::HighlightPathGenerator::Install(\n this, std::make_unique<ColorPickerHighlightPathGenerator>());\n\n \n \n const int padding = ChromeLayoutProvider::Get()->GetDistanceMetric(\n views::DISTANCE_RELATED_BUTTON_HORIZONTAL) /\n 2;\n \n \n gfx::Insets insets = ui::TouchUiController::Get()->touch_ui()\n ? gfx::Insets(padding * 2)\n : gfx::Insets(padding);\n SetBorder(views::CreateEmptyBorder(insets));\n\n SetInkDropMode(InkDropMode::OFF);\n set_animate_on_state_change(true);\n }\n\n void SetSelected(bool selected) {\n if (selected_ == selected)\n return;\n selected_ = selected;\n SchedulePaint();\n }\n\n bool selected() const { return selected_; }\n\n \n bool IsGroupFocusTraversable() const override {\n \n return false;\n }\n\n views::View* GetSelectedViewForGroup(int group) override {\n DCHECK(parent());\n return parent()->GetSelectedViewForGroup(group);\n }\n\n void GetAccessibleNodeData(ui::AXNodeData* node_data) override {\n views::Button::GetAccessibleNodeData(node_data);\n node_data->role = ax::mojom::Role::kRadioButton;\n node_data->SetCheckedState(selected() ? ax::mojom::CheckedState::kTrue\n : ax::mojom::CheckedState::kFalse);\n }\n\n base::string16 GetTooltipText(const gfx::Point& p) const override {\n return color_name_;\n }\n\n gfx::Size CalculatePreferredSize() const override {\n const gfx::Insets insets = GetInsets();\n \n \n const int circle_size = ui::TouchUiController::Get()->touch_ui()\n ? 3 * gfx::kFaviconSize / 2\n : gfx::kFaviconSize;\n gfx::Size size(circle_size, circle_size);\n size.Enlarge(insets.width(), insets.height());\n return size;\n }\n\n int GetHeightForWidth(int width) const override { return width; }\n\n void PaintButtonContents(gfx::Canvas* canvas) override {\n \n gfx::RectF bounds(GetContentsBounds());\n\n \n DCHECK_EQ(bounds.width(), bounds.height());\n\n const SkColor color =\n GetThemeProvider()->GetColor(GetTabGroupDialogColorId(color_id_));\n\n cc::PaintFlags flags;\n flags.setStyle(cc::PaintFlags::kFill_Style);\n flags.setColor(color);\n flags.setAntiAlias(true);\n canvas->DrawCircle(bounds.CenterPoint(), bounds.width() / 2.0f, flags);\n\n PaintSelectionIndicator(canvas);\n }\n\n \n void ButtonPressed(Button* sender, const ui::Event& event) override {\n DCHECK_EQ(this, sender);\n\n \n if (!selected_) {\n selected_ = true;\n SchedulePaint();\n selected_callback_.Run(this);\n }\n }\n\n private:\n \n \n void PaintSelectionIndicator(gfx::Canvas* canvas) {\n if (!selected_) {\n return;\n }\n\n \n constexpr float kInset = 3.0f;\n constexpr float kThickness = 2.0f;\n cc::PaintFlags flags;\n flags.setStyle(cc::PaintFlags::kStroke_Style);\n flags.setStrokeWidth(kThickness);\n flags.setAntiAlias(true);\n flags.setColor(bubble_view_->color());\n\n gfx::RectF indicator_bounds(GetContentsBounds());\n indicator_bounds.Inset(gfx::InsetsF(kInset));\n DCHECK(!indicator_bounds.size().IsEmpty());\n canvas->DrawCircle(indicator_bounds.CenterPoint(),\n indicator_bounds.width() / 2.0f, flags);\n }\n\n const base::RepeatingCallback<void(ColorPickerElementView*)>\n selected_callback_;\n const views::BubbleDialogDelegateView* bubble_view_;\n const tab_groups::TabGroupColorId color_id_;\n const base::string16 color_name_;\n bool selected_ = false;\n};\n\nColorPickerView::ColorPickerView(\n const views::BubbleDialogDelegateView* bubble_view,\n const TabGroupEditorBubbleView::Colors& colors,\n tab_groups::TabGroupColorId initial_color_id,\n ColorSelectedCallback callback)\n : callback_(std::move(callback)) {\n DCHECK(!colors.empty());\n\n elements_.reserve(colors.size());\n for (const auto& color : colors) {\n \n \n \n elements_.push_back(AddChildView(std::make_unique<ColorPickerElementView>(\n base::Bind(&ColorPickerView::OnColorSelected, base::Unretained(this)),\n bubble_view, color.first, color.second)));\n if (initial_color_id == color.first)\n elements_.back()->SetSelected(true);\n }\n\n \n \n \n gfx::Insets child_insets = elements_[0]->GetInsets();\n SetProperty(views::kInternalPaddingKey,\n gfx::Insets(0, child_insets.left(), 0, child_insets.right()));\n\n \n SetFocusBehavior(views::View::FocusBehavior::NEVER);\n for (View* view : elements_) {\n \n view->SetGroup(0);\n }\n\n auto* layout = SetLayoutManager(std::make_unique<views::FlexLayout>());\n layout->SetOrientation(views::LayoutOrientation::kHorizontal)\n .SetDefault(\n views::kFlexBehaviorKey,\n views::FlexSpecification(views::MinimumFlexSizeRule::kPreferred,\n views::MaximumFlexSizeRule::kUnbounded)\n .WithAlignment(views::LayoutAlignment::kCenter)\n .WithWeight(1));\n}\n\nColorPickerView::~ColorPickerView() {\n \n \n RemoveAllChildViews(true);\n}\n\nbase::Optional<int> ColorPickerView::GetSelectedElement() const {\n for (size_t i = 0; i < elements_.size(); ++i) {\n if (elements_[i]->selected())\n return static_cast<int>(i);\n }\n return base::nullopt;\n}\n\nviews::View* ColorPickerView::GetSelectedViewForGroup(int group) {\n for (ColorPickerElementView* element : elements_) {\n if (element->selected())\n return element;\n }\n return nullptr;\n}\n\nviews::Button* ColorPickerView::GetElementAtIndexForTesting(int index) {\n DCHECK_GE(index, 0);\n DCHECK_LT(index, static_cast<int>(elements_.size()));\n return elements_[index];\n}\n\nvoid ColorPickerView::OnColorSelected(ColorPickerElementView* element) {\n \n for (ColorPickerElementView* other_element : elements_) {\n if (other_element != element)\n other_element->SetSelected(false);\n }\n\n if (callback_)\n callback_.Run();\n}\n"},"prefix":{"kind":"string","value":"\n\n#include \"chrome/browser/ui/views/tabs/color_picker_view.h\"\n\n#include <memory>\n#include <vector>\n\n#include \"base/bind.h\"\n#include \"base/callback.h\"\n#include \"base/containers/span.h\"\n#include \"chrome/browser/themes/theme_properties.h\"\n#include \"chrome/browser/ui/tabs/tab_group_theme.h\"\n#include \"chrome/browser/ui/views/chrome_layout_provider.h\"\n#include \"components/tab_groups/tab_group_color.h\"\n#include \"ui/accessibility/ax_enums.mojom.h\"\n#include \"ui/accessibility/ax_node_data.h\"\n#include \"ui/base/pointer/touch_ui_controller.h\"\n#include \"ui/base/theme_provider.h\"\n#include \"ui/gfx/animation/tween.h\"\n#include \"ui/gfx/canvas.h\"\n#include \"ui/gfx/color_palette.h\"\n#include \"ui/gfx/color_utils.h\"\n#include \"ui/gfx/favicon_size.h\"\n#include \"ui/views/border.h\"\n#include \"ui/views/controls/button/button.h\"\n#include \"ui/views/controls/highlight_path_generator.h\"\n#include \"ui/views/layout/box_layout.h\"\n#include \"ui/views/layout/flex_layout.h\"\n#include \"ui/views/layout/flex_layout_types.h\"\n#include \"ui/views/view_class_properties.h\"\n\nnamespace {\n\nclass ColorPickerHighlightPathGenerator : public views::HighlightPathGenerator {\n public:\n ColorPickerHighlightPathGenerator() = default;\n\n \n SkPath GetHighlightPath(const views::View* view) override {\n \n gfx::RectF bounds(view->GetContentsBounds());\n bounds.Inset(gfx::Insets(-2.0f));\n const gfx::PointF center = bounds.CenterPoint();\n return SkPath().addCircle(center.x(), center.y(), bounds.width() / 2.0f);\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(ColorPickerHighlightPathGenerator);\n};\n\n} \n\nclass ColorPickerElementView : public views::Button,\n public views::ButtonListener {\n public:\n ColorPickerElementView(\n base::RepeatingCallback<void(ColorPickerElementView*)> selected_callback,\n const views::BubbleDialogDelegateView* bubble_view,\n tab_groups::TabGroupColorId color_id,\n base::string16 color_name)\n : Button(this),\n selected_callback_(std::move(selected_callback)),\n bubble_view_(bubble_view),\n color_id_(color_id),\n color_name_(color_name) {\n DCHECK(selected_callback_);\n\n SetAccessibleName(color_name);\n SetFocusForPlatform();\n SetInstallFocusRingOnFocus(true);\n views::HighlightPathGenerator::Install(\n this, std::make_unique<ColorPickerHighlightPathGenerator>());\n\n \n \n const int padding = ChromeLayoutProvider::Get()->GetDistanceMetric(\n views::DISTANCE_RELATED_BUTTON_HORIZONTAL) /\n 2;\n \n \n gfx::Insets insets = ui::TouchUiController::Get()->touch_ui()\n ? gfx::Insets(padding * 2)\n : gfx::Insets(padding);\n SetBorder(views::CreateEmptyBorder(insets));\n\n SetInkDropMode(InkDropMode::OFF);\n set_animate_on_state_change(true);\n }\n\n void SetSelected(bool selected) {\n if (selected_ == selected)\n return;\n selected_ = selected;\n SchedulePaint();\n }\n\n bool selected() const { return selected_; }\n\n \n bool IsGroupFocusTraversable() const override {\n \n return false;\n }\n\n views::View* GetSelectedViewForGroup(int group) override {\n DCHECK(parent());\n return parent()->GetSelectedViewForGroup(group);\n }\n\n void GetAccessibleNodeData(ui::AXNodeData* node_data) override {\n views::Button::GetAccessibleNodeData(node_data);\n node_data->role = ax::mojom::Role::kRadioButton;\n node_data->SetCheckedState(selected() ? ax::mojom::CheckedState::kTrue\n : ax::mojom::CheckedState::kFalse);\n }\n\n base::string16 GetTooltipText(const gfx::Point& p) const override {\n return color_name_;\n }\n\n gfx::Size CalculatePreferredSize() const override {\n const gfx::Insets insets = GetInsets();\n \n \n const int circle_size = ui::TouchUiController::Get()->touch_ui()\n ? 3 * gfx::kFaviconSize / 2\n : gfx::kFaviconSize;\n gfx::Size size(circle_size, circle_size);\n size.Enlarge(insets.width(), insets.height());\n return size;\n }\n\n int GetHeightForWidth(int width) const override { return width; }\n\n void PaintButtonContents(gfx::Canvas* canvas) override {\n \n gfx::RectF bounds(GetContentsBounds());\n\n \n DCHECK_EQ(bounds.width(), bounds.height());\n\n const SkColor color =\n GetThemeProvider()->GetColor(GetTabGroupDialogColorId(color_id_));\n\n cc::PaintFlags flags;\n flags.setStyle(cc::PaintFlags::kFil"},"suffix":{"kind":"string","value":"\n\n \n void ButtonPressed(Button* sender, const ui::Event& event) override {\n DCHECK_EQ(this, sender);\n\n \n if (!selected_) {\n selected_ = true;\n SchedulePaint();\n selected_callback_.Run(this);\n }\n }\n\n private:\n \n \n void PaintSelectionIndicator(gfx::Canvas* canvas) {\n if (!selected_) {\n return;\n }\n\n \n constexpr float kInset = 3.0f;\n constexpr float kThickness = 2.0f;\n cc::PaintFlags flags;\n flags.setStyle(cc::PaintFlags::kStroke_Style);\n flags.setStrokeWidth(kThickness);\n flags.setAntiAlias(true);\n flags.setColor(bubble_view_->color());\n\n gfx::RectF indicator_bounds(GetContentsBounds());\n indicator_bounds.Inset(gfx::InsetsF(kInset));\n DCHECK(!indicator_bounds.size().IsEmpty());\n canvas->DrawCircle(indicator_bounds.CenterPoint(),\n indicator_bounds.width() / 2.0f, flags);\n }\n\n const base::RepeatingCallback<void(ColorPickerElementView*)>\n selected_callback_;\n const views::BubbleDialogDelegateView* bubble_view_;\n const tab_groups::TabGroupColorId color_id_;\n const base::string16 color_name_;\n bool selected_ = false;\n};\n\nColorPickerView::ColorPickerView(\n const views::BubbleDialogDelegateView* bubble_view,\n const TabGroupEditorBubbleView::Colors& colors,\n tab_groups::TabGroupColorId initial_color_id,\n ColorSelectedCallback callback)\n : callback_(std::move(callback)) {\n DCHECK(!colors.empty());\n\n elements_.reserve(colors.size());\n for (const auto& color : colors) {\n \n \n \n elements_.push_back(AddChildView(std::make_unique<ColorPickerElementView>(\n base::Bind(&ColorPickerView::OnColorSelected, base::Unretained(this)),\n bubble_view, color.first, color.second)));\n if (initial_color_id == color.first)\n elements_.back()->SetSelected(true);\n }\n\n \n \n \n gfx::Insets child_insets = elements_[0]->GetInsets();\n SetProperty(views::kInternalPaddingKey,\n gfx::Insets(0, child_insets.left(), 0, child_insets.right()));\n\n \n SetFocusBehavior(views::View::FocusBehavior::NEVER);\n for (View* view : elements_) {\n \n view->SetGroup(0);\n }\n\n auto* layout = SetLayoutManager(std::make_unique<views::FlexLayout>());\n layout->SetOrientation(views::LayoutOrientation::kHorizontal)\n .SetDefault(\n views::kFlexBehaviorKey,\n views::FlexSpecification(views::MinimumFlexSizeRule::kPreferred,\n views::MaximumFlexSizeRule::kUnbounded)\n .WithAlignment(views::LayoutAlignment::kCenter)\n .WithWeight(1));\n}\n\nColorPickerView::~ColorPickerView() {\n \n \n RemoveAllChildViews(true);\n}\n\nbase::Optional<int> ColorPickerView::GetSelectedElement() const {\n for (size_t i = 0; i < elements_.size(); ++i) {\n if (elements_[i]->selected())\n return static_cast<int>(i);\n }\n return base::nullopt;\n}\n\nviews::View* ColorPickerView::GetSelectedViewForGroup(int group) {\n for (ColorPickerElementView* element : elements_) {\n if (element->selected())\n return element;\n }\n return nullptr;\n}\n\nviews::Button* ColorPickerView::GetElementAtIndexForTesting(int index) {\n DCHECK_GE(index, 0);\n DCHECK_LT(index, static_cast<int>(elements_.size()));\n return elements_[index];\n}\n\nvoid ColorPickerView::OnColorSelected(ColorPickerElementView* element) {\n \n for (ColorPickerElementView* other_element : elements_) {\n if (other_element != element)\n other_element->SetSelected(false);\n }\n\n if (callback_)\n callback_.Run();\n}\n"},"middle":{"kind":"string","value":"l_Style);\n flags.setColor(color);\n flags.setAntiAlias(true);\n canvas->DrawCircle(bounds.CenterPoint(), bounds.width() / 2.0f, flags);\n\n PaintSelectionIndicator(canvas);\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":479,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/libmv/simple_pipeline/camera_intrinsics.cc"},"repo_name":{"kind":"string","value":"Matthias-Fauconneau/libmv"},"commit":{"kind":"string","value":"531c79bf95fddaaa70707d1abcd4fdafda16bbf0"},"file_code":{"kind":"string","value":"\n\n#include \"libmv/simple_pipeline/camera_intrinsics.h\"\n#include \"libmv/numeric/levenberg_marquardt.h\"\n\nnamespace libmv {\n\nstruct Offset { signed char ix,iy; unsigned char fx,fy; };\n\nCameraIntrinsics::CameraIntrinsics()\n : K_(Mat3::Identity()),\n image_width_(0),\n image_height_(0),\n k1_(0),\n k2_(0),\n k3_(0),\n p1_(0),\n p2_(0),\n distort_(0),\n undistort_(0) {}\n\nCameraIntrinsics::~CameraIntrinsics() {\n if(distort_) delete[] distort_;\n if(undistort_) delete[] undistort_;\n}\n\nvoid CameraIntrinsics::SetK(const Mat3 new_k) {\n K_ = new_k;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetFocalLength(double focal_x, double focal_y) {\n K_(0, 0) = focal_x;\n K_(1, 1) = focal_y;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetPrincipalPoint(double cx, double cy) {\n K_(0, 2) = cx;\n K_(1, 2) = cy;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetImageSize(int width, int height) {\n image_width_ = width;\n image_height_ = height;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetRadialDistortion(double k1, double k2, double k3) {\n k1_ = k1;\n k2_ = k2;\n k3_ = k3;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetTangentialDistortion(double p1, double p2) {\n p1_ = p1;\n p2_ = p2;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::ApplyIntrinsics(double normalized_x,\n double normalized_y,\n double *image_x,\n double *image_y) const {\n double x = normalized_x;\n double y = normalized_y;\n\n \n double r2 = x*x + y*y;\n double r4 = r2 * r2;\n double r6 = r4 * r2;\n double r_coeff = (1 + k1_*r2 + k2_*r4 + k3_*r6);\n double xd = x * r_coeff + 2*p1_*x*y + p2_*(r2 + 2*x*x);\n double yd = y * r_coeff + 2*p2_*x*y + p1_*(r2 + 2*y*y);\n\n \n *image_x = focal_length_x() * xd + principal_point_x();\n *image_y = focal_length_y() * yd + principal_point_y();\n}\n\nstruct InvertIntrinsicsCostFunction {\n public:\n typedef Vec2 FMatrixType;\n typedef Vec2 XMatrixType;\n\n InvertIntrinsicsCostFunction(const CameraIntrinsics &intrinsics,\n double image_x, double image_y)\n : intrinsics(intrinsics), x(image_x), y(image_y) {}\n\n Vec2 operator()(const Vec2 &u) const {\n double xx, yy;\n intrinsics.ApplyIntrinsics(u(0), u(1), &xx, &yy);\n Vec2 fx;\n fx << (xx - x), (yy - y);\n return fx;\n }\n const CameraIntrinsics &intrinsics;\n double x, y;\n};\n\nvoid CameraIntrinsics::InvertIntrinsics(double image_x,\n double image_y,\n double *normalized_x,\n double *normalized_y) const {\n \n \n Vec2 normalized;\n normalized(0) = (image_x - principal_point_x()) / focal_length_x();\n normalized(1) = (image_y - principal_point_y()) / focal_length_y();\n\n typedef LevenbergMarquardt<InvertIntrinsicsCostFunction> Solver;\n\n InvertIntrinsicsCostFunction intrinsics_cost(*this, image_x, image_y);\n Solver::SolverParameters params;\n Solver solver(intrinsics_cost);\n\n solver.minimize(params, &normalized);\n\n \n\n *normalized_x = normalized(0);\n *normalized_y = normalized(1);\n}\n\ntemplate<typename WarpFunction>\nvoid CameraIntrinsics::ComputeLookupGrid(Offset* grid, int width, int height) {\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n double warp_x, warp_y;\n WarpFunction(this,x,y,&warp_x,&warp_y);\n int ix = int(warp_x), iy = int(warp_y);\n int fx = round((warp_x-ix)*256), fy = round((warp_y-iy)*256);\n if(fx == 256) { fx=0; ix++; }\n if(fy == 256) { fy=0; iy++; }\n \n if( ix < 0 ) { ix = 0, fx = 0; }\n if( iy < 0 ) { iy = 0, fy = 0; }\n if( ix >= width-2 ) ix = width-2;\n if( iy >= height-2 ) iy = height-2;\n \n Offset offset = { ix-x, iy-y, fx, fy };\n grid[y*width+x] = offset;\n }\n }\n}\n\ntemplate<typename T,int N>\nstatic void Warp(const Offset* grid, const T* src, T* dst,\n int width, int height) {\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n Offset offset = grid[y*width+x];\n const T* s = &src[((y+offset.iy)*width+(x+offset.ix))*N];\n for (int i = 0; i < N; i++) {\n dst[(y*width+x)*N+i] = ((s[ i] * (256-offset.fx) + s[ N+i] * offset.fx) * (256-offset.fy)\n +(s[width*N+i] * (256-offset.fx) + s[width*N+N+i] * offset.fx) * offset.fy) / (256*256);\n }\n }\n }\n}\n\nvoid CameraIntrinsics::FreeLookupGrid() {\n if(distort_) delete distort_, distort_=0;\n if(undistort_) delete undistort_, undistort_=0;\n}\n\nstruct ApplyIntrinsicsFunction {\n ApplyIntrinsicsFunction(CameraIntrinsics* intrinsics, double x, double y,\n double *warp_x, double *warp_y) {\n intrinsics->ApplyIntrinsics(\n (x-intrinsics->principal_point_x())/intrinsics->focal_length_x(),\n (y-intrinsics->principal_point_y())/intrinsics->focal_length_y(),\n warp_x, warp_y);\n }\n};\nstruct InvertIntrinsicsFunction {\n InvertIntrinsicsFunction(CameraIntrinsics* intrinsics, double x, double y,\n double *warp_x, double *warp_y) {\n intrinsics->InvertIntrinsics(x,y,warp_x,warp_y);\n *warp_x = *warp_x*intrinsics->focal_length_x()+intrinsics->principal_point_x();\n *warp_y = *warp_y*intrinsics->focal_length_y()+intrinsics->principal_point_y();\n }\n};\n\nvoid CameraIntrinsics::Distort(const float* src, float* dst, int width, int height, int channels) {\n if(!distort_) {\n distort_ = new Offset[width*height];\n ComputeLookupGrid<InvertIntrinsicsFunction>(distort_,width,height);\n }\n if(channels==1) Warp<float,1>(distort_,src,dst,width,height);\n else if(channels==2) Warp<float,2>(distort_,src,dst,width,height);\n else if(channels==3) Warp<float,3>(distort_,src,dst,width,height);\n else if(channels==4) Warp<float,4>(distort_,src,dst,width,height);\n \n}\n\nvoid CameraIntrinsics::Distort(const unsigned char* src, unsigned char* dst, int width, int height, int channels) {\n if(!distort_) {\n distort_ = new Offset[width*height];\n ComputeLookupGrid<InvertIntrinsicsFunction>(distort_,width,height);\n }\n if(channels==1) Warp<unsigned char,1>(distort_,src,dst,width,height);\n else if(channels==2) Warp<unsigned char,2>(distort_,src,dst,width,height);\n else if(channels==3) Warp<unsigned char,3>(distort_,src,dst,width,height);\n else if(channels==4) Warp<unsigned char,4>(distort_,src,dst,width,height);\n \n}\n\nvoid CameraIntrinsics::Undistort(const float* src, float* dst, int width, int height, int channels) {\n if(!undistort_) {\n undistort_ = new Offset[width*height];\n ComputeLookupGrid<ApplyIntrinsicsFunction>(undistort_,width,height);\n }\n if(channels==1) Warp<float,1>(undistort_,src,dst,width,height);\n else if(channels==2) Warp<float,2>(undistort_,src,dst,width,height);\n else if(channels==3) Warp<float,3>(undistort_,src,dst,width,height);\n else if(channels==4) Warp<float,4>(undistort_,src,dst,width,height);\n \n}\n\nvoid CameraIntrinsics::Undistort(const unsigned char* src, unsigned char* dst, int width, int height, int channels) {\n if(!undistort_) {\n undistort_ = new Offset[width*height];\n ComputeLookupGrid<ApplyIntrinsicsFunction>(undistort_,width,height);\n }\n if(channels==1) Warp<unsigned char,1>(undistort_,src,dst,width,height);\n else if(channels==2) Warp<unsigned char,2>(undistort_,src,dst,width,height);\n else if(channels==3) Warp<unsigned char,3>(undistort_,src,dst,width,height);\n else if(channels==4) Warp<unsigned char,4>(undistort_,src,dst,width,height);\n \n}\n\n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"libmv/simple_pipeline/camera_intrinsics.h\"\n#include \"libmv/numeric/levenberg_marquardt.h\"\n\nnamespace libmv {\n\nstruct Offset { signed char ix,iy; unsigned char fx,fy; };\n\nCameraIntrinsics::CameraIntrinsics()\n : K_(Mat3::Identity()),\n image_width_(0),\n image_height_(0),\n k1_(0),\n k2_(0),\n k3_(0),\n p1_(0),\n p2_(0),\n distort_(0),\n undistort_(0) {}\n\nCameraIntrinsics::~CameraIntrinsics() {\n if(distort_) delete[] distort_;\n if(undistort_) delete[] undistort_;\n}\n\nvoid CameraIntrinsics::SetK(const Mat3 new_k) {\n K_ = new_k;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetFocalLength(double focal_x, double focal_y) {\n K_(0, 0) = focal_x;\n K_(1, 1) = focal_y;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetPrincipalPoint(double cx, double cy) {\n K_(0, 2) = cx;\n K_(1, 2) = cy;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetImageSize(int width, int height) {\n image_width_ = width;\n image_height_ = height;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetRadialDistortion(double k1, double k2, double k3) {\n k1_ = k1;\n k2_ = k2;\n k3_ = k3;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::SetTangentialDistortion(double p1, double p2) {\n p1_ = p1;\n p2_ = p2;\n FreeLookupGrid();\n}\n\nvoid CameraIntrinsics::ApplyIntrinsics(double normalized_x,\n double normalized_y,\n double *image_x,\n double *image_y) const {\n double x = normalized_x;\n double y = normalized_y;\n\n \n double r2 = x*x + y*y;\n double r4 = r2 * r2;\n double r6 = r4 * r2;\n double r_coeff = (1 + k1_*r2 + k2_*r4 + k3_*r6);\n double xd = x * r_coeff + 2*p1_*x*y + p2_*(r2 + 2*x*x);\n double yd = y * r_coeff + 2*p2_*x*y + p1_*(r2 + 2*y*y);\n\n \n *image_x = focal_length_x() * xd + principal_point_x();\n *image_y = focal_length_y() * yd + principal_point_y();\n}\n\nstruct InvertIntrinsicsCostFunction {\n public:\n typedef Vec2 FMatrixType;\n typedef Vec2 XMatrixType;\n\n InvertIntrinsicsCostFunction(const CameraIntrinsics &intrinsics,\n double image_x, double image_y)\n : intrinsics(intrinsics), x(image_x), y(image_y) {}\n\n Vec2 operator()(const Vec2 &u) const {\n double xx, yy;\n intrinsics.ApplyIntrinsics(u(0), u(1), &xx, &yy);\n Vec2 fx;\n fx << (xx - x), (yy - y);\n return fx;\n }\n const CameraIntrinsics &intrinsics;\n double x, y;\n};\n\nvoid CameraIntrinsics::InvertIntrinsics(double image_x,\n double image_y,\n double *normalized_x,\n double *normalized_y) const {\n \n \n Vec2 normalized;\n normalized(0) = (image_x - principal_point_x()) / focal_length_x();\n normalized(1) = (image_y - principal_point_y()) / focal_length_y();\n\n typedef LevenbergMarquardt<InvertIntrinsicsCostFunction> Solver;\n\n InvertIntrinsicsCostFunction intrinsics_cost(*this, image_x, image_y);\n Solver::SolverParameters params;\n Solver solver(intrinsics_cost);\n\n solver.minimize(params, &normalized);\n\n \n\n *normalized_x = normalized(0);\n *normalized_y = normalized(1);\n}\n\ntemplate<typename WarpFunction>\nvoid CameraIntrinsics::ComputeLookupGrid(Offset* grid, int width, int height) {\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n double warp_x, warp_y;\n WarpFunction(this,x,y,&warp_x,&warp_y);\n int ix = int(warp_x), iy = int(warp_y);\n int fx = round((warp_x-ix)*256), fy = round((warp_y-iy)*256);\n if(fx == 256) { fx=0; ix++; }\n if(fy == 256) { fy=0; iy++; }\n \n if( ix < 0 ) { ix = 0, fx = 0; }\n if( iy < 0 ) { iy = 0, fy = 0; }\n if( ix >= width-2 ) ix = width-2;\n if( iy >= height-2 ) iy = height-2;\n \n Offset offset = { ix-x, iy-y, fx, fy };\n grid[y*width+x] = offset;\n }\n }\n}\n\ntemplate<typename T,int N>\nstatic void Warp(const Offset* grid, const T* src, T* dst,\n int width, int height) {\n for (int y = 0; y < height; y++) {\n for (int x = 0; x < width; x++) {\n Offset offset = grid[y*width+x];\n const T* s = &src[((y+offset.iy)*width+(x+offset.ix))*N];\n for (in"},"suffix":{"kind":"string","value":"(undistort_,src,dst,width,height);\n \n}\n\n} \n"},"middle":{"kind":"string","value":"t i = 0; i < N; i++) {\n dst[(y*width+x)*N+i] = ((s[ i] * (256-offset.fx) + s[ N+i] * offset.fx) * (256-offset.fy)\n +(s[width*N+i] * (256-offset.fx) + s[width*N+N+i] * offset.fx) * offset.fy) / (256*256);\n }\n }\n }\n}\n\nvoid CameraIntrinsics::FreeLookupGrid() {\n if(distort_) delete distort_, distort_=0;\n if(undistort_) delete undistort_, undistort_=0;\n}\n\nstruct ApplyIntrinsicsFunction {\n ApplyIntrinsicsFunction(CameraIntrinsics* intrinsics, double x, double y,\n double *warp_x, double *warp_y) {\n intrinsics->ApplyIntrinsics(\n (x-intrinsics->principal_point_x())/intrinsics->focal_length_x(),\n (y-intrinsics->principal_point_y())/intrinsics->focal_length_y(),\n warp_x, warp_y);\n }\n};\nstruct InvertIntrinsicsFunction {\n InvertIntrinsicsFunction(CameraIntrinsics* intrinsics, double x, double y,\n double *warp_x, double *warp_y) {\n intrinsics->InvertIntrinsics(x,y,warp_x,warp_y);\n *warp_x = *warp_x*intrinsics->focal_length_x()+intrinsics->principal_point_x();\n *warp_y = *warp_y*intrinsics->focal_length_y()+intrinsics->principal_point_y();\n }\n};\n\nvoid CameraIntrinsics::Distort(const float* src, float* dst, int width, int height, int channels) {\n if(!distort_) {\n distort_ = new Offset[width*height];\n ComputeLookupGrid<InvertIntrinsicsFunction>(distort_,width,height);\n }\n if(channels==1) Warp<float,1>(distort_,src,dst,width,height);\n else if(channels==2) Warp<float,2>(distort_,src,dst,width,height);\n else if(channels==3) Warp<float,3>(distort_,src,dst,width,height);\n else if(channels==4) Warp<float,4>(distort_,src,dst,width,height);\n \n}\n\nvoid CameraIntrinsics::Distort(const unsigned char* src, unsigned char* dst, int width, int height, int channels) {\n if(!distort_) {\n distort_ = new Offset[width*height];\n ComputeLookupGrid<InvertIntrinsicsFunction>(distort_,width,height);\n }\n if(channels==1) Warp<unsigned char,1>(distort_,src,dst,width,height);\n else if(channels==2) Warp<unsigned char,2>(distort_,src,dst,width,height);\n else if(channels==3) Warp<unsigned char,3>(distort_,src,dst,width,height);\n else if(channels==4) Warp<unsigned char,4>(distort_,src,dst,width,height);\n \n}\n\nvoid CameraIntrinsics::Undistort(const float* src, float* dst, int width, int height, int channels) {\n if(!undistort_) {\n undistort_ = new Offset[width*height];\n ComputeLookupGrid<ApplyIntrinsicsFunction>(undistort_,width,height);\n }\n if(channels==1) Warp<float,1>(undistort_,src,dst,width,height);\n else if(channels==2) Warp<float,2>(undistort_,src,dst,width,height);\n else if(channels==3) Warp<float,3>(undistort_,src,dst,width,height);\n else if(channels==4) Warp<float,4>(undistort_,src,dst,width,height);\n \n}\n\nvoid CameraIntrinsics::Undistort(const unsigned char* src, unsigned char* dst, int width, int height, int channels) {\n if(!undistort_) {\n undistort_ = new Offset[width*height];\n ComputeLookupGrid<ApplyIntrinsicsFunction>(undistort_,width,height);\n }\n if(channels==1) Warp<unsigned char,1>(undistort_,src,dst,width,height);\n else if(channels==2) Warp<unsigned char,2>(undistort_,src,dst,width,height);\n else if(channels==3) Warp<unsigned char,3>(undistort_,src,dst,width,height);\n else if(channels==4) Warp<unsigned char,4>"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"struct tuple_size<GTEST_2_TUPLE_(T)> { static const int value = 2; };\n\n\n\ntemplate <GTEST_3_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":1,"score":343036.2119991771},{"content":"struct tuple_size<GTEST_0_TUPLE_(T)> { static const int value = 0; };\n\n\n\ntemplate <GTEST_1_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":2,"score":343033.30679670157},{"content":"struct tuple_size<GTEST_1_TUPLE_(T)> { static const int value = 1; };\n\n\n\ntemplate <GTEST_2_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":3,"score":343032.98447604134},{"content":"class FooTest : public ::testing::TestWithParam<const char*> {\n\n // You can implement all the usual class fixture members here.\n\n};\n\n\n\n// Then, use the TEST_P macro to define as many parameterized tests\n\n// for this fixture as you want. The _P suffix is for \"parameterized\"\n\n// or \"pattern\", whichever you prefer to think.\n\n\n\nTEST_P(FooTest, DoesBlah) {\n\n // Inside a test, access the test parameter with the GetParam() method\n\n // of the TestWithParam<T> class:\n\n EXPECT_TRUE(foo.Blah(GetParam()));\n\n ...\n\n}\n\n\n\nTEST_P(FooTest, HasBlahBlah) {\n\n ...\n\n}\n\n\n\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\n","file_path":"src/third_party/gtest/include/gtest/gtest-param-test.h","rank":4,"score":339193.0221307178},{"content":"struct tuple_size<GTEST_5_TUPLE_(T)> { static const int value = 5; };\n\n\n\ntemplate <GTEST_6_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":5,"score":325761.37279787177},{"content":"struct tuple_size<GTEST_3_TUPLE_(T)> { static const int value = 3; };\n\n\n\ntemplate <GTEST_4_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":6,"score":325761.37279787177},{"content":"struct tuple_size<GTEST_4_TUPLE_(T)> { static const int value = 4; };\n\n\n\ntemplate <GTEST_5_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":7,"score":325761.3727978718},{"content":"struct tuple_size<GTEST_8_TUPLE_(T)> { static const int value = 8; };\n\n\n\ntemplate <GTEST_9_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":8,"score":325761.37279787177},{"content":"struct tuple_size<GTEST_6_TUPLE_(T)> { static const int value = 6; };\n\n\n\ntemplate <GTEST_7_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":9,"score":325761.37279787177},{"content":"struct tuple_size<GTEST_7_TUPLE_(T)> { static const int value = 7; };\n\n\n\ntemplate <GTEST_8_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":10,"score":325761.37279787177},{"content":"struct tuple_size<GTEST_10_TUPLE_(T)> { static const int value = 10; };\n\n\n\ntemplate <int k, class Tuple>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":11,"score":325761.37279787177},{"content":"struct tuple_size<GTEST_9_TUPLE_(T)> { static const int value = 9; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":12,"score":325761.3727978718},{"content":"struct RemoveConst<const T[N]> {\n\n typedef typename RemoveConst<T>::type type[N];\n\n};\n\n#endif\n\n\n\n// A handy wrapper around RemoveConst that works when the argument\n\n// T depends on template parameters.\n\n#define GTEST_REMOVE_CONST_(T) \\\n\n typename ::testing::internal::RemoveConst<T>::type\n\n\n\n// Turns const U&, U&, const U, and U all into U.\n\n#define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \\\n\n GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T))\n\n\n\n// Adds reference to a type if it is not a reference type,\n\n// otherwise leaves it unchanged. This is the same as\n\n// tr1::add_reference, which is not widely available yet.\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":13,"score":317694.731590732},{"content":"struct NormalizedSolver {\n\n enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n\n static void Solve(const Mat &x1, const Mat &x2, vector<Mat3> *models) {\n\n assert(2 == x1.rows());\n\n assert(MINIMUM_SAMPLES <= x1.cols());\n\n assert(x1.rows() == x2.rows());\n\n assert(x1.cols() == x2.cols());\n\n\n\n // Normalize the data.\n\n Mat3 T1, T2;\n\n Mat x1_normalized, x2_normalized;\n\n NormalizePoints(x1, &x1_normalized, &T1);\n\n NormalizePoints(x2, &x2_normalized, &T2);\n\n\n\n Solver::Solve(x1_normalized, x2_normalized, models);\n\n\n\n for (int i = 0; i < models->size(); ++i) {\n\n Unnormalizer::Unnormalize(T1, T2, &(*models)[i]);\n\n }\n\n }\n\n};\n\n\n\ntemplate<typename Solver, typename Unnormalizer>\n","file_path":"src/libmv/multiview/two_view_kernel.h","rank":14,"score":292259.34240833856},{"content":"struct IsotropicNormalizedSolver {\n\n enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\n\n static void Solve(const Mat &x1, const Mat &x2, vector<Mat3> *models) {\n\n assert(2 == x1.rows());\n\n assert(MINIMUM_SAMPLES <= x1.cols());\n\n assert(x1.rows() == x2.rows());\n\n assert(x1.cols() == x2.cols());\n\n\n\n // Normalize the data.\n\n Mat3 T1, T2;\n\n Mat x1_normalized, x2_normalized;\n\n NormalizeIsotropicPoints(x1, &x1_normalized, &T1);\n\n NormalizeIsotropicPoints(x2, &x2_normalized, &T2);\n\n\n\n Solver::Solve(x1_normalized, x2_normalized, models);\n\n\n\n for (int i = 0; i < models->size(); ++i) {\n\n Unnormalizer::Unnormalize(T1, T2, &(*models)[i]);\n\n }\n\n }\n","file_path":"src/libmv/multiview/two_view_kernel.h","rank":15,"score":286783.9462379181},{"content":"class DerivedTest : public BaseTest, public ::testing::WithParamInterface<int> {\n\n // The usual test fixture members go here too.\n\n};\n\n\n\nTEST_F(BaseTest, HasFoo) {\n\n // This is an ordinary non-parameterized test.\n\n}\n\n\n\nTEST_P(DerivedTest, DoesBlah) {\n\n // GetParam works just the same here as if you inherit from TestWithParam.\n\n EXPECT_TRUE(foo.Blah(GetParam()));\n\n}\n\n\n\n#endif // 0\n\n\n\n#include \"gtest/internal/gtest-port.h\"\n\n\n\n#if !GTEST_OS_SYMBIAN\n\n# include <utility>\n\n#endif\n","file_path":"src/third_party/gtest/include/gtest/gtest-param-test.h","rank":16,"score":286610.0542397736},{"content":"struct RemoveConst<const T> { typedef T type; }; // NOLINT\n\n\n\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\n\n// definition to fail to remove the const in 'const int[3]' and 'const\n\n// char[3][4]'. The following specialization works around the bug.\n\n// However, it causes trouble with GCC and thus needs to be\n\n// conditionally compiled.\n\n#if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__)\n\ntemplate <typename T, size_t N>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":17,"score":284762.96454498696},{"content":"struct vec2 {\n\n float x,y;\n\n inline vec2(float x, float y):x(x),y(y){}\n\n};\n\ninline vec2 operator*(mat32 m, vec2 v) {\n\n return vec2(v.x*m(0,0)+v.y*m(0,1)+m(0,2),v.x*m(1,0)+v.y*m(1,1)+m(1,2));\n\n}\n\n\n\n//! fixed point bilinear sample with precision k\n\ntemplate <int k> inline int sample(const ubyte* image,int stride, int x, int y, int u, int v) {\n\n const ubyte* s = &image[y*stride+x];\n\n return ((s[ 0] * (k-u) + s[ 1] * u) * (k-v)\n\n + (s[stride] * (k-u) + s[stride+1] * u) * ( v) ) / (k*k);\n\n}\n\n\n\n#ifdef __SSE__\n\n#include <xmmintrin.h>\n\nint lround(float x) { return _mm_cvtss_si32(_mm_set_ss(x)); }\n\n#elif defined(_MSC_VER)\n\nint lround(float x) { return x+0.5; }\n","file_path":"src/libmv/tracking/sad.cc","rank":18,"score":283572.3485166205},{"content":"struct ByRef { typedef const T& type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":19,"score":282784.30618238845},{"content":"struct Offset;\n\n\n","file_path":"src/libmv/simple_pipeline/camera_intrinsics.h","rank":20,"score":278967.47144128813},{"content":"struct RemoveConst { typedef T type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":21,"score":266655.4776928237},{"content":"// Helper for suppressing false warning from Clang on a const char*\n\n// variable declared in a conditional expression always being NULL in\n\n// the else branch.\n\nstruct GTEST_API_ ConstCharPtr {\n\n ConstCharPtr(const char* str) : value(str) {}\n\n operator bool() const { return true; }\n\n const char* value;\n\n};\n\n\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":22,"score":259234.63678365923},{"content":"// A derived feature with a tag, so that it is possible to check that the right\n\n// features are produced by the iterators.\n\nstruct MyPoint : public Feature {\n\n virtual ~MyPoint() {}\n\n MyPoint(int the_tag) : tag(the_tag) {}\n\n int tag;\n\n};\n\n\n","file_path":"src/libmv/correspondence/matches_test.cc","rank":23,"score":247280.1636746919},{"content":"// A derived feature with a tag, so that it is possible to check that the right\n\n// features are produced by the iterators.\n\nstruct MyPoint : public Feature {\n\n virtual ~MyPoint() {}\n\n MyPoint() {}\n\n MyPoint(int the_tag) : tag(the_tag) {}\n\n int tag;\n\n};\n\n\n","file_path":"src/libmv/correspondence/feature_set_test.cc","rank":24,"score":243260.07501348708},{"content":"struct SiblingTestFeature : public Feature {\n\n virtual ~SiblingTestFeature() {}\n\n};\n\n\n\nTEST(Matches, Views) {\n\n Matches matches;\n\n matches.Insert(1, 1, new SiblingTestFeature);\n\n matches.Insert(1, 2, new MyPoint(30));\n\n matches.Insert(1, 4, new SiblingTestFeature);\n\n Matches::Features<Feature> r1 = matches.All<Feature>();\n\n ++r1; // Ordering means the test feature will be 2nd.\n\n ASSERT_TRUE(r1);\n\n EXPECT_TRUE(r1.feature() != NULL);\n\n EXPECT_EQ(1, r1.image());\n\n EXPECT_EQ(2, r1.track());\n\n\n\n Matches::Features<MyPoint> r = matches.All<MyPoint>();\n\n ASSERT_TRUE(r);\n\n ASSERT_TRUE(r.feature() != NULL);\n\n EXPECT_EQ(30, r.feature()->tag);\n","file_path":"src/libmv/correspondence/matches_test.cc","rank":25,"score":239407.62100615233},{"content":"struct SiblingTestFeature : public Feature {\n\n virtual ~SiblingTestFeature() {}\n\n};\n\n\n\n\n\nTEST(FeatureSet, New) {\n\n FeatureSet features;\n\n\n\n // Create a feature.\n\n FeatureSet::Iterator<MyPoint> it = features.New<MyPoint>();\n\n // Use it.\n\n it.feature().tag = 3;\n\n}\n\n\n\nTEST(FeatureSet, Insert) {\n\n FeatureSet features;\n\n // Insert a feature by copying its contents.\n\n FeatureSet::Iterator<MyPoint> it = features.Insert<MyPoint>(MyPoint(1));\n\n EXPECT_EQ(1, it.feature().tag);\n\n it = features.Insert<MyPoint>(MyPoint(2));\n","file_path":"src/libmv/correspondence/feature_set_test.cc","rank":26,"score":235712.53044621047},{"content":"struct IteratorTraits<const T*> {\n\n typedef T value_type;\n\n};\n\n\n\n#if GTEST_OS_WINDOWS\n\n# define GTEST_PATH_SEP_ \"\\\\\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 1\n\n// The biggest signed integer type the compiler supports.\n\ntypedef __int64 BiggestInt;\n\n#else\n\n# define GTEST_PATH_SEP_ \"/\"\n\n# define GTEST_HAS_ALT_PATH_SEP_ 0\n\ntypedef long long BiggestInt; // NOLINT\n\n#endif // GTEST_OS_WINDOWS\n\n\n\n// Utilities for char.\n\n\n\n// isspace(int ch) and friends accept an unsigned char or EOF. char\n\n// may be signed, depending on the compiler (or compiler flags).\n\n// Therefore we need to cast a char to unsigned char before calling\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-port.h","rank":27,"score":235534.03955138955},{"content":"struct is_pointer : public false_type {};\n\n\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-port.h","rank":28,"score":235442.537816223},{"content":"class TestWithParam : public Test, public WithParamInterface<T> {\n\n};\n\n\n\n#endif // GTEST_HAS_PARAM_TEST\n\n\n\n// Macros for indicating success/failure in test code.\n\n\n\n// ADD_FAILURE unconditionally adds a failure to the current test.\n\n// SUCCEED generates a success - it doesn't automatically make the\n\n// current test successful, as a test is only successful when it has\n\n// no failure.\n\n//\n\n// EXPECT_* verifies that a certain condition is satisfied. If not,\n\n// it behaves like ADD_FAILURE. In particular:\n\n//\n\n// EXPECT_TRUE verifies that a Boolean condition is true.\n\n// EXPECT_FALSE verifies that a Boolean condition is false.\n\n//\n\n// FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except\n\n// that they will also abort the current function on failure. People\n","file_path":"src/third_party/gtest/include/gtest/gtest.h","rank":29,"score":234386.31551681436},{"content":"struct VectorTest : public testing::Test {\n\n VectorTest() {\n\n foo_construct_calls = 0;\n\n foo_destruct_calls = 0;\n\n }\n\n};\n\n\n\nTEST_F(VectorTest, EmptyVectorDoesNotConstruct) {\n\n {\n\n vector<Foo> v;\n\n EXPECT_EQ(0, v.size());\n\n EXPECT_EQ(0, v.capacity());\n\n }\n\n EXPECT_EQ(0, foo_construct_calls);\n\n EXPECT_EQ(0, foo_destruct_calls);\n\n}\n\n\n\nTEST_F(VectorTest, DestructorGetsCalled) {\n\n {\n\n vector<Foo> v;\n","file_path":"src/libmv/base/vector_test.cc","rank":30,"score":232203.80611773022},{"content":"struct vec2 {\n\n float x, y;\n\n inline vec2() : x(0), y(0) {}\n\n inline vec2(float x, float y) : x(x), y(y) {}\n\n inline vec2(float v[2]) : x(v[0]), y(v[1]) {}\n\n#ifdef QSTRING_H\n\n inline QString toString() const {\n\n return QString(\"%1 %2\").arg(x, 0, 'f', 2).arg(y, 0, 'f', 2);\n\n }\n\n#endif\n\n};\n\ninline vec2 operator -( vec2 a ) { return vec2( -a.x, -a.y ); }\n\ninline vec2 operator +( vec2 a, vec2 b ) { return vec2( a.x+b.x, a.y+b.y ); }\n\ninline vec2 operator +( vec2 a, float b ) { return vec2( a.x+b, a.y+b ); }\n\ninline vec2 operator -( vec2 a, vec2 b ) { return vec2( a.x-b.x, a.y-b.y ); }\n\ninline vec2 operator -( vec2 a, float b ) { return vec2( a.x-b, a.y-b ); }\n\ninline vec2 operator *( float b, vec2 a ) { return vec2( a.x*b, a.y*b ); }\n\ninline vec2 operator /( vec2 a, float b ) { return vec2( a.x/b, a.y/b ); }\n\ninline vec2 operator /( float a, vec2 b ) { return vec2( a/b.x, a/b.y ); }\n\ninline vec2 operator /( vec2 a, vec2 b ) { return vec2( a.x/b.x, a.y/b.y ); }\n\ninline bool operator <( vec2 a, vec2 b ) { return a.x < b.x && a.y < b.y; }\n\ninline bool operator >( vec2 a, vec2 b ) { return a.x > b.x && a.y > b.y; }\n\n\n","file_path":"src/ui/tracker/gl.h","rank":31,"score":230041.56244879367},{"content":" struct sched_param param;\n","file_path":"src/third_party/pthreads-w32/include/implement.h","rank":32,"score":227651.59242372168},{"content":" const MatrixType& pseudoEigenvectors() const\n\n {\n\n eigen_assert(m_isInitialized && \"EigenSolver is not initialized.\");\n\n eigen_assert(m_eigenvectorsOk && \"The eigenvectors have not been computed together with the eigenvalues.\");\n\n return m_eivec;\n","file_path":"src/third_party/eigen/Eigen/src/Eigenvalues/EigenSolver.h","rank":33,"score":226779.45656848067},{"content":"struct EightPointRelativePoseSolver {\n\n enum { MINIMUM_SAMPLES = 8 };\n\n static void Solve(const Mat &x1, const Mat &x2, vector<Mat3> *E);\n\n};\n\n\n\n//-- Generic Solver for the 5pt Essential Matrix Estimation.\n\n//-- Need a new Class that inherit of two_view::kernel::kernel.\n\n// Error must be overwrite in order to compute F from E and K's.\n\n//-- Fitting must normalize image values to camera values.\n\ntemplate<typename SolverArg,\n\n typename ErrorArg,\n\n typename ModelArg = Mat3>\n","file_path":"src/libmv/multiview/essential_kernel.h","rank":34,"score":225391.3955036822},{"content":"struct SevenPointTest : public testing::Test {\n\n void ExpectKernelProperties(const Mat &x1,\n\n const Mat &x2,\n\n Mat3 *F_expected = NULL) {\n\n Kernel kernel(x1, x2);\n\n vector<int> samples;\n\n for (int i = 0; i < x1.cols(); ++i) {\n\n samples.push_back(i);\n\n }\n\n vector<Mat3> Fs;\n\n kernel.Fit(samples, &Fs);\n\n bool found = false; // Need to search for expected answer.\n\n EXPECT_TRUE(Fs.size() != 0);\n\n for (int i = 0; i < Fs.size(); ++i) {\n\n ExpectFundamentalProperties(Fs[i], x1, x2, 1e-8);\n\n if (F_expected) {\n\n found |= Colinear(Fs[i], *F_expected, 1e-6);\n\n }\n\n }\n\n if (F_expected) {\n","file_path":"src/libmv/multiview/fundamental_kernel_test.cc","rank":35,"score":224961.5395519921},{"content":"struct MatchingKernelTest : public testing::Test {\n\n};\n\n\n\n// Test :\n\n// - Libmv Kdtree,\n\n// - Linear matching FLANN,\n\n// - FLANN Kdtree.\n\ntypedef Types< ArrayMatcher_Kdtree<float>,\n\n ArrayMatcher_BruteForce<float>,\n\n ArrayMatcher_Kdtree_Flann<float>\n\n > MatchingKernelImpl;\n\n\n\nTYPED_TEST_CASE(MatchingKernelTest, MatchingKernelImpl);\n\n\n\nTYPED_TEST(MatchingKernelTest, MatcherInterfaceSymmetry)\n\n{\n\n int descriptorSize = 2;\n\n // Build one feature set.\n\n FeatureSet featureSet;\n\n for (int i=0; i < 4; ++i)\n","file_path":"src/libmv/correspondence/Array_Matcher_test.cc","rank":36,"score":224961.5395519921},{"content":"struct EuclideanKernelTest : public testing::Test {\n\n};\n\n\n\ntypedef Types<Kernel>\n\n EuclideanKernelImplementations;\n\n\n\nTYPED_TEST_CASE(EuclideanKernelTest, EuclideanKernelImplementations);\n\n\n\nTYPED_TEST(EuclideanKernelTest, Fitting) {\n\n // Define a few euclidean transformations.\n\n vector<Mat3> H_gt(3);\n\n\n\n H_gt[0] = Mat3::Identity();\n\n \n\n H_gt[1] << 1, 0, -4,\n\n 0, 1, 5,\n\n 0, 0, 1;\n\n double angle = 0.3;\n\n H_gt[2] << cos(angle),-sin(angle), 3,\n\n sin(angle), cos(angle), -6,\n","file_path":"src/libmv/multiview/euclidean_kernel_test.cc","rank":37,"score":224961.5395519921},{"content":"struct SimilarityKernelTest : public testing::Test {\n\n};\n\n\n\ntypedef Types<Kernel,\n\n UnnormalizedKernel>\n\n SimilarityKernelImplementations;\n\n\n\nTYPED_TEST_CASE(SimilarityKernelTest, SimilarityKernelImplementations);\n\n\n\nTYPED_TEST(SimilarityKernelTest, Fitting) {\n\n // Define a few similarities.\n\n vector<Mat3> H_gt(3);\n\n\n\n H_gt[0] = Mat3::Identity();\n\n \n\n double angle = 0.3;\n\n double scale = 1;\n\n H_gt[1] << scale*cos(angle),-scale*sin(angle), -4,\n\n scale*sin(angle), scale*cos(angle), 5,\n\n 0, 0, 1;\n","file_path":"src/libmv/multiview/similarity_kernel_test.cc","rank":38,"score":224961.5395519921},{"content":"struct AffineKernelTest : public testing::Test {\n\n};\n\n\n\ntypedef Types<Kernel,\n\n UnnormalizedKernel>\n\n AffineKernelImplementations;\n\n\n\nTYPED_TEST_CASE(AffineKernelTest, AffineKernelImplementations);\n\n\n\nTYPED_TEST(AffineKernelTest, Fitting) {\n\n // Define a few affinities.\n\n vector<Mat3> H_gt(3);\n\n\n\n H_gt[0] = Mat3::Identity();\n\n H_gt[1] << 1, 0, -4,\n\n 0, 1, 5,\n\n 0, 0, 1;\n\n H_gt[2] << 1, -2, 3,\n\n 4, 5, -6,\n\n 0, 0, 1;\n","file_path":"src/libmv/multiview/affine_kernel_test.cc","rank":39,"score":224961.5395519921},{"content":"struct HomographyKernelTest : public testing::Test {\n\n};\n\n\n\ntypedef Types<Kernel,\n\n UnnormalizedKernel>\n\n HomographyKernelImplementations;\n\n\n\nTYPED_TEST_CASE(HomographyKernelTest, HomographyKernelImplementations);\n\n\n\nTYPED_TEST(HomographyKernelTest, Fitting) {\n\n // Define a few homographies.\n\n vector<Mat3> H_gt(3);\n\n\n\n H_gt[0] = Mat3::Identity();\n\n H_gt[1] << 1, 0, -4,\n\n 0, 1, 5,\n\n 0, 0, 1;\n\n H_gt[2] << 1, -2, 3,\n\n 4, 5, -6,\n\n -7, 8, 1;\n","file_path":"src/libmv/multiview/homography_kernel_test.cc","rank":40,"score":224961.5395519921},{"content":"struct FundamentalErrorTest : public testing::Test {\n\n};\n\n\n\ntypedef Types<SampsonError,\n\n SymmetricEpipolarDistanceError>\n\n FundamentalErrorImplementations;\n\n\n\nTYPED_TEST_CASE(FundamentalErrorTest, FundamentalErrorImplementations);\n\nTYPED_TEST(FundamentalErrorTest, FundamentalErrorTest2) {\n\n Vec3 t(1, 0, 0);\n\n Mat3 F = CrossProductMatrix(t); // Fundamental matrix corresponding to pure\n\n // translation.\n\n\n\n Vec2 x0(0, 0), y0( 0, 0); // Good match (at infinity).\n\n Vec2 x1(0, 0), y1(100, 0); // Good match (no vertical disparity).\n\n Vec2 x2(0, 0), y2(0.0, 0.1); // Small error (a bit of vertical disparity).\n\n Vec2 x3(0, 0), y3( 0, 1); // Bigger error.\n\n Vec2 x4(0, 0), y4( 0, 10); // Biggest error.\n\n Vec2 x5(0, 0), y5(100, 10); // Biggest error with horizontal disparity.\n\n\n","file_path":"src/libmv/multiview/fundamental_kernel_test.cc","rank":41,"score":224961.5395519921},{"content":"struct is_pointer<T*> : public true_type {};\n\n\n\ntemplate <typename Iterator>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-port.h","rank":42,"score":224766.44843841885},{"content":" long height;\n","file_path":"src/third_party/daisy/include/kutility/image_io_png.h","rank":43,"score":220840.26162789448},{"content":" long width;\n","file_path":"src/third_party/daisy/include/kutility/image_io_png.h","rank":44,"score":220838.50891298958},{"content":"struct EightPointTest : public SevenPointTest<Kernel> {\n\n};\n\n\n\ntypedef Types<EightPointKernel,\n\n NormalizedEightPointKernel>\n\n EightPointImplementations;\n\n\n\nTYPED_TEST_CASE(EightPointTest, EightPointImplementations);\n\nTYPED_TEST(EightPointTest, EasyCase) {\n\n Mat x1(2, 8);\n\n Mat x2(2, 8);\n\n x1 << 0, 0, 0, 1, 1, 1, 2, 2,\n\n 0, 1, 2, 0, 1, 2, 0, 1;\n\n x2 << 0, 0, 0, 1, 1, 1, 2, 2,\n\n 1, 2, 3, 1, 2, 3, 1, 2;\n\n this->ExpectKernelProperties(x1, x2);\n\n}\n\n\n\n\n\nTYPED_TEST(EightPointTest, RealistCaseWith30Points) {\n\n TwoViewDataSet d = TwoRealisticCameras();\n\n this->ExpectKernelProperties(d.x1, d.x2, &d.F);\n\n}\n\n\n\ntemplate <class Kernel>\n","file_path":"src/libmv/multiview/fundamental_kernel_test.cc","rank":45,"score":218276.7724421604},{"content":"struct AddReference { typedef T& type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":46,"score":215952.30973640824},{"content":"struct AddRef { typedef T& type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":47,"score":215952.30973640824},{"content":"struct RemoveReference { typedef T type; }; // NOLINT\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":48,"score":215952.30973640824},{"content":"class ThreadWithParam : public ThreadWithParamBase {\n\n public:\n\n typedef void (*UserThreadFunc)(T);\n\n\n\n ThreadWithParam(\n\n UserThreadFunc func, T param, Notification* thread_can_start)\n\n : func_(func),\n\n param_(param),\n\n thread_can_start_(thread_can_start),\n\n finished_(false) {\n\n ThreadWithParamBase* const base = this;\n\n // The thread can be created only after all fields except thread_\n\n // have been initialized.\n\n GTEST_CHECK_POSIX_SUCCESS_(\n\n pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base));\n\n }\n\n ~ThreadWithParam() { Join(); }\n\n\n\n void Join() {\n\n if (!finished_) {\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-port.h","rank":49,"score":214899.54350370832},{"content":"struct StaticAssertTypeEqHelper;\n\n\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-port.h","rank":50,"score":214152.1554432972},{"content":"struct TupleElement<true, 2, GTEST_10_TUPLE_(T)> { typedef T2 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":51,"score":212614.16172251722},{"content":"struct TupleElement<true, 0, GTEST_10_TUPLE_(T)> { typedef T0 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":52,"score":212611.25652004164},{"content":"struct TupleElement<true, 1, GTEST_10_TUPLE_(T)> { typedef T1 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":53,"score":212610.93419938145},{"content":"struct has_none {int a[1];};\n","file_path":"src/third_party/eigen/Eigen/src/Core/util/Meta.h","rank":54,"score":212517.55153563494},{"content":"struct ByRef<T&> { typedef T& type; }; // NOLINT\n\n\n\n// A handy wrapper for ByRef.\n\n#define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef<T>::type\n\n\n\n// AddRef<T>::type is T if T is a reference; otherwise it's T&. This\n\n// is the same as tr1::add_reference<T>::type.\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":55,"score":211432.29491379164},{"content":"struct LazyProductReturnType : public ProductReturnType<Lhs,Rhs,LazyCoeffBasedProductMode>\n\n{};\n\n\n\n/***********************************************************************\n\n* Implementation of Inner Vector Vector Product\n\n***********************************************************************/\n\n\n\n// FIXME : maybe the \"inner product\" could return a Scalar\n\n// instead of a 1x1 matrix ??\n\n// Pro: more natural for the user\n\n// Cons: this could be a problem if in a meta unrolled algorithm a matrix-matrix\n\n// product ends up to a row-vector times col-vector product... To tackle this use\n\n// case, we could have a specialization for Block<MatrixType,1,1> with: operator=(Scalar x);\n\n\n\nnamespace internal {\n\n\n\ntemplate<typename Lhs, typename Rhs>\n","file_path":"src/third_party/eigen/Eigen/src/Core/Product.h","rank":56,"score":211153.28704641882},{"content":" class Iterator : public ParamIteratorInterface<ParamType> {\n\n public:\n\n Iterator(const ParamGeneratorInterface<ParamType>* base,\n\n const ParamGenerator<T1>& g1,\n\n const typename ParamGenerator<T1>::iterator& current1,\n\n const ParamGenerator<T2>& g2,\n\n const typename ParamGenerator<T2>::iterator& current2,\n\n const ParamGenerator<T3>& g3,\n\n const typename ParamGenerator<T3>::iterator& current3,\n\n const ParamGenerator<T4>& g4,\n\n const typename ParamGenerator<T4>::iterator& current4,\n\n const ParamGenerator<T5>& g5,\n\n const typename ParamGenerator<T5>::iterator& current5,\n\n const ParamGenerator<T6>& g6,\n\n const typename ParamGenerator<T6>::iterator& current6,\n\n const ParamGenerator<T7>& g7,\n\n const typename ParamGenerator<T7>::iterator& current7,\n\n const ParamGenerator<T8>& g8,\n\n const typename ParamGenerator<T8>::iterator& current8,\n\n const ParamGenerator<T9>& g9,\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-param-util-generated.h","rank":57,"score":210245.4281016344},{"content":"struct AddReference<T&> { typedef T& type; }; // NOLINT\n\n\n\n// A handy wrapper around AddReference that works when the argument T\n\n// depends on template parameters.\n\n#define GTEST_ADD_REFERENCE_(T) \\\n\n typename ::testing::internal::AddReference<T>::type\n\n\n\n// Adds a reference to const on top of T as necessary. For example,\n\n// it transforms\n\n//\n\n// char ==> const char&\n\n// const char ==> const char&\n\n// char& ==> const char&\n\n// const char& ==> const char&\n\n//\n\n// The argument T must depend on some template parameters.\n\n#define GTEST_REFERENCE_TO_CONST_(T) \\\n\n GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T))\n\n\n\n// ImplicitlyConvertible<From, To>::value is a compile-time bool\n\n// constant that's true iff type From can be implicitly converted to\n\n// type To.\n\ntemplate <typename From, typename To>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":58,"score":208218.41866646786},{"content":"struct AddRef<T&> { typedef T& type; }; // NOLINT\n\n\n\n// A handy wrapper for AddRef.\n\n#define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef<T>::type\n\n\n\n// A helper for implementing get<k>().\n\ntemplate <int k> class Get;\n\n\n\n// A helper for implementing tuple_element<k, T>. kIndexValid is true\n\n// iff k < the number of fields in tuple type T.\n\ntemplate <bool kIndexValid, int kIndex, class Tuple>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":59,"score":208218.41866646786},{"content":"struct RemoveReference<T&> { typedef T type; }; // NOLINT\n\n\n\n// A handy wrapper around RemoveReference that works when the argument\n\n// T depends on template parameters.\n\n#define GTEST_REMOVE_REFERENCE_(T) \\\n\n typename ::testing::internal::RemoveReference<T>::type\n\n\n\n// Removes const from a type if it is a const type, otherwise leaves\n\n// it unchanged. This is the same as tr1::remove_const, which is not\n\n// widely available yet.\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-internal.h","rank":60,"score":208218.41866646786},{"content":" class Iterator : public ParamIteratorInterface<T> {\n\n public:\n\n Iterator(const ParamGeneratorInterface<T>* base,\n\n typename ContainerType::const_iterator iterator)\n\n : base_(base), iterator_(iterator) {}\n\n virtual ~Iterator() {}\n\n\n\n virtual const ParamGeneratorInterface<T>* BaseGenerator() const {\n\n return base_;\n\n }\n\n virtual void Advance() {\n\n ++iterator_;\n\n value_.reset();\n\n }\n\n virtual ParamIteratorInterface<T>* Clone() const {\n\n return new Iterator(*this);\n\n }\n\n // We need to use cached value referenced by iterator_ because *iterator_\n\n // can return a temporary object (and of type other then T), so just\n\n // having \"return &*iterator_;\" doesn't work.\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-param-util.h","rank":61,"score":208214.66940753855},{"content":"struct has_std_result_type {int a[2];};\n","file_path":"src/third_party/eigen/Eigen/src/Core/util/Meta.h","rank":62,"score":207468.68356254126},{"content":"class RangeGenerator : public ParamGeneratorInterface<T> {\n\n public:\n\n RangeGenerator(T begin, T end, IncrementT step)\n\n : begin_(begin), end_(end),\n\n step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}\n\n virtual ~RangeGenerator() {}\n\n\n\n virtual ParamIteratorInterface<T>* Begin() const {\n\n return new Iterator(this, begin_, 0, step_);\n\n }\n\n virtual ParamIteratorInterface<T>* End() const {\n\n return new Iterator(this, end_, end_index_, step_);\n\n }\n\n\n\n private:\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-param-util.h","rank":63,"score":205241.87380426304},{"content":"class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface<T> {\n\n public:\n\n template <typename ForwardIterator>\n\n ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end)\n\n : container_(begin, end) {}\n\n virtual ~ValuesInIteratorRangeGenerator() {}\n\n\n\n virtual ParamIteratorInterface<T>* Begin() const {\n\n return new Iterator(this, container_.begin());\n\n }\n\n virtual ParamIteratorInterface<T>* End() const {\n\n return new Iterator(this, container_.end());\n\n }\n\n\n\n private:\n\n typedef typename ::std::vector<T> ContainerType;\n\n\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-param-util.h","rank":64,"score":199586.66588546993},{"content":"class BaseTest : public ::testing::Test {\n\n // You can inherit all the usual members for a non-parameterized test\n\n // fixture here.\n\n};\n\n\n","file_path":"src/third_party/gtest/include/gtest/gtest-param-test.h","rank":65,"score":199186.17146323342},{"content":"struct TuplePrefixPrinter<0> {\n\n template <typename Tuple>\n\n static void PrintPrefixTo(const Tuple&, ::std::ostream*) {}\n\n\n\n template <typename Tuple>\n\n static void TersePrintPrefixToStrings(const Tuple&, Strings*) {}\n\n};\n\n// We have to specialize the entire TuplePrefixPrinter<> class\n\n// template here, even though the definition of\n\n// TersePrintPrefixToStrings() is the same as the generic version, as\n\n// Embarcadero (formerly CodeGear, formerly Borland) C++ doesn't\n\n// support specializing a method template of a class template.\n\ntemplate <>\n","file_path":"src/third_party/gtest/include/gtest/gtest-printers.h","rank":66,"score":197611.20092292287},{"content":"struct TuplePrefixPrinter<1> {\n\n template <typename Tuple>\n\n static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) {\n\n UniversalPrinter<typename ::std::tr1::tuple_element<0, Tuple>::type>::\n\n Print(::std::tr1::get<0>(t), os);\n\n }\n\n\n\n template <typename Tuple>\n\n static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) {\n\n ::std::stringstream ss;\n\n UniversalTersePrint(::std::tr1::get<0>(t), &ss);\n\n strings->push_back(ss.str());\n\n }\n\n};\n\n\n\n// Helper function for printing a tuple. T must be instantiated with\n\n// a tuple type.\n\ntemplate <typename T>\n\nvoid PrintTupleTo(const T& t, ::std::ostream* os) {\n\n *os << \"(\";\n","file_path":"src/third_party/gtest/include/gtest/gtest-printers.h","rank":67,"score":197610.56254259608},{"content":"struct SameSizeTuplePrefixComparator<0, 0> {\n\n template <class Tuple1, class Tuple2>\n\n static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) {\n\n return true;\n\n }\n\n};\n\n\n\ntemplate <int k>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":68,"score":197433.93964030355},{"content":"struct StaticAssertTypeEqHelper<T, T> {};\n\n\n\n#if GTEST_HAS_GLOBAL_STRING\n\ntypedef ::string string;\n\n#else\n\ntypedef ::std::string string;\n\n#endif // GTEST_HAS_GLOBAL_STRING\n\n\n\n#if GTEST_HAS_GLOBAL_WSTRING\n\ntypedef ::wstring wstring;\n\n#elif GTEST_HAS_STD_WSTRING\n\ntypedef ::std::wstring wstring;\n\n#endif // GTEST_HAS_GLOBAL_WSTRING\n\n\n\n// A helper for suppressing warnings on constant condition. It just\n\n// returns 'condition'.\n\nGTEST_API_ bool IsTrue(bool condition);\n\n\n\n// Defines scoped_ptr.\n\n\n\n// This implementation of scoped_ptr is PARTIAL - it only contains\n\n// enough stuff to satisfy Google Test's need.\n\ntemplate <typename T>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-port.h","rank":69,"score":196192.9215452183},{"content":" Mat46 X;\n","file_path":"src/libmv/multiview/sixpointnview.h","rank":70,"score":195738.85546696547},{"content":"struct TupleElement<true, 5, GTEST_10_TUPLE_(T)> { typedef T5 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":71,"score":195339.32252121187},{"content":"struct TupleElement<true, 4, GTEST_10_TUPLE_(T)> { typedef T4 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":72,"score":195339.32252121187},{"content":"struct TupleElement<true, 8, GTEST_10_TUPLE_(T)> { typedef T8 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":73,"score":195339.32252121187},{"content":"struct TupleElement<true, 3, GTEST_10_TUPLE_(T)> { typedef T3 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":74,"score":195339.32252121187},{"content":"struct TupleElement<true, 6, GTEST_10_TUPLE_(T)> { typedef T6 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":75,"score":195339.32252121187},{"content":"struct TupleElement<true, 9, GTEST_10_TUPLE_(T)> { typedef T9 type; };\n\n\n\n} // namespace gtest_internal\n\n\n\ntemplate <>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":76,"score":195339.32252121187},{"content":"struct TupleElement<true, 7, GTEST_10_TUPLE_(T)> { typedef T7 type; };\n\n\n\ntemplate <GTEST_10_TYPENAMES_(T)>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-tuple.h","rank":77,"score":195339.32252121187},{"content":"class ParameterizedTestFactory : public TestFactoryBase {\n\n public:\n\n typedef typename TestClass::ParamType ParamType;\n\n explicit ParameterizedTestFactory(ParamType parameter) :\n\n parameter_(parameter) {}\n\n virtual Test* CreateTest() {\n\n TestClass::SetParam(¶meter_);\n\n return new TestClass();\n\n }\n\n\n\n private:\n\n const ParamType parameter_;\n\n\n\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory);\n\n};\n\n\n\n// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE.\n\n//\n\n// TestMetaFactoryBase is a base class for meta-factories that create\n\n// test factories for passing into MakeAndRegisterTestInfo function.\n\ntemplate <class ParamType>\n","file_path":"src/third_party/gtest/include/gtest/internal/gtest-param-util.h","rank":78,"score":193148.9906074502},{"content":"class PolynomialSolver<_Scalar,1> : public PolynomialSolverBase<_Scalar,1>\n\n{\n\n public:\n\n typedef PolynomialSolverBase<_Scalar,1> PS_Base;\n\n EIGEN_POLYNOMIAL_SOLVER_BASE_INHERITED_TYPES( PS_Base )\n\n\n\n public:\n\n /** Computes the complex roots of a new polynomial. */\n\n template< typename OtherPolynomial >\n\n void compute( const OtherPolynomial& poly )\n\n {\n\n assert( Scalar(0) != poly[poly.size()-1] );\n\n m_roots[0] = -poly[0]/poly[poly.size()-1];\n\n }\n\n\n\n protected:\n\n using PS_Base::m_roots;\n\n};\n\n\n\n#endif // EIGEN_POLYNOMIAL_SOLVER_H\n","file_path":"src/third_party/eigen/unsupported/Eigen/src/Polynomials/PolynomialSolver.h","rank":79,"score":192683.69739125262},{"content":"class Calibration : public QWidget, public libmv::CameraIntrinsics {\n\n Q_OBJECT\n\n public:\n\n Calibration(QString path, QSize size);\n\n double Value(int i);\n\n\n\n public slots:\n\n void updateSettings();\n\n\n\n signals:\n\n void settingsChanged();\n\n\n\n private:\n\n QString path_;\n\n QDoubleSpinBox* spinbox_[11];\n\n\n\n};\n\n\n\n#endif\n","file_path":"src/ui/tracker/calibration.h","rank":80,"score":192463.38856202114},{"content":"/// an image in the match graph\n\nstruct Node : public QGraphicsPixmapItem {\n\n//Springs\n\n QMap<Node*,Edge*> edges;\n\n\n\n//RK4 integration\n\n QVector2D position[4];\n\n QVector2D velocity[4];\n\n QVector2D acceleration[4];\n\n};\n\n\n","file_path":"src/ui/nvr/nview.h","rank":81,"score":191125.72178236695},{"content":"// TODO(julien) put this (Edge, node, graph, GraphView) in a widget (.h/.cc)\n\n/// a line linking two nodes\n\nstruct Edge : public QGraphicsLineItem {\n\n Edge(Node* a, Node* b) : a(a), b(b) { setZValue(-1); }\n\n Node* a;\n\n Node* b;\n\n};\n\n\n","file_path":"src/ui/nvr/nview.h","rank":82,"score":191125.72178236695},{"content":" Mat34 P1, P2; // Projection matrix, P = K(R|t)\n","file_path":"src/libmv/multiview/test_data_sets.h","rank":83,"score":190730.9296564619},{"content":" Mat3 K1, K2; // Internal parameters.\n","file_path":"src/libmv/multiview/test_data_sets.h","rank":84,"score":190729.38573998408},{"content":" Mat3X X; // 3D points.\n","file_path":"src/libmv/multiview/test_data_sets.h","rank":85,"score":190710.15470986185},{"content":" class TestName : public CaseName<gtest_TypeParam_> { \\\n\n private: \\\n\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\n\n typedef gtest_TypeParam_ TypeParam; \\\n\n virtual void TestBody(); \\\n\n }; \\\n\n static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \\\n\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\\\n\n __FILE__, __LINE__, #CaseName, #TestName); \\\n\n } \\\n\n template <typename gtest_TypeParam_> \\\n\n void GTEST_CASE_NAMESPACE_(CaseName)::TestName<gtest_TypeParam_>::TestBody()\n\n\n\n# define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \\\n\n namespace GTEST_CASE_NAMESPACE_(CaseName) { \\\n\n typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \\\n\n } \\\n\n static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \\\n\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\\\n\n __FILE__, __LINE__, #__VA_ARGS__)\n","file_path":"src/third_party/gtest/include/gtest/gtest-typed-test.h","rank":86,"score":189540.64648862006},{"content":"struct nested<ReturnByValue<Derived>, n, PlainObject>\n\n{\n\n typedef typename traits<Derived>::ReturnType type;\n\n};\n\n\n\n} // end namespace internal\n\n\n\ntemplate<typename Derived> class ReturnByValue\n\n : public internal::dense_xpr_base< ReturnByValue<Derived> >::type\n\n{\n\n public:\n\n typedef typename internal::traits<Derived>::ReturnType ReturnType;\n\n\n\n typedef typename internal::dense_xpr_base<ReturnByValue>::type Base;\n\n EIGEN_DENSE_PUBLIC_INTERFACE(ReturnByValue)\n\n\n\n template<typename Dest>\n\n inline void evalTo(Dest& dst) const\n\n { static_cast<const Derived*>(this)->evalTo(dst); }\n\n inline Index rows() const { return static_cast<const Derived*>(this)->rows(); }\n\n inline Index cols() const { return static_cast<const Derived*>(this)->cols(); }\n\n\n","file_path":"src/third_party/eigen/Eigen/src/Core/ReturnByValue.h","rank":87,"score":186855.92595096395},{"content":"struct blas_traits<const T>\n\n : blas_traits<T>\n\n{};\n\n\n\ntemplate<typename T, bool HasUsableDirectAccess=blas_traits<T>::HasUsableDirectAccess>\n","file_path":"src/third_party/eigen/Eigen/src/Core/util/BlasUtil.h","rank":88,"score":186430.01658238308},{"content":" */\n\n void Undistort(const float* src, float* dst,\n\n int width, int height, int channels);\n\n /*!\n\n Undistort an image using the current camera instrinsics\n\n\n\n The undistorted image is computed in \\a dst using samples from \\a src.\n\n both buffers should be \\a width x \\a height x \\a channels sized.\n\n\n\n \\note This version is much faster.\n\n */\n\n void Undistort(const unsigned char* src, unsigned char* dst,\n\n int width, int height, int channels);\n\n\n\n private:\n\n template<typename WarpFunction> void ComputeLookupGrid(Offset* grid, int width, int height);\n\n void FreeLookupGrid();\n\n\n\n // The traditional intrinsics matrix from x = K[R|t]X.\n\n Mat3 K_;\n","file_path":"src/libmv/simple_pipeline/camera_intrinsics.h","rank":91,"score":72.20606147585795},{"content":" /// Set the entire calibration matrix at once.\n\n void SetK(const Mat3 new_k);\n\n\n\n /// Set both x and y focal length in pixels.\n\n void SetFocalLength(double focal_x, double focal_y);\n\n\n\n void SetPrincipalPoint(double cx, double cy);\n\n\n\n void SetImageSize(int width, int height);\n\n\n\n void SetRadialDistortion(double k1, double k2, double k3 = 0);\n\n\n\n void SetTangentialDistortion(double p1, double p2);\n\n\n\n /*!\n\n Apply camera intrinsics to the normalized point to get image coordinates.\n\n\n\n This applies the lens distortion to a point which is in normalized\n\n camera coordinates (i.e. the principal point is at (0, 0)) to get image\n\n coordinates in pixels.\n","file_path":"src/libmv/simple_pipeline/camera_intrinsics.h","rank":96,"score":59.67982473890387},{"content":"\n\n // This is the size of the image. This is necessary to, for example, handle\n\n // the case of processing a scaled image.\n\n int image_width_;\n\n int image_height_;\n\n\n\n // OpenCV's distortion model with third order polynomial radial distortion\n\n // terms and second order tangential distortion. The distortion is applied to\n\n // the normalized coordinates before the focal length, which makes them\n\n // independent of image size.\n\n double k1_, k2_, k3_, p1_, p2_;\n\n\n\n Offset* distort_;\n\n Offset* undistort_;\n\n};\n\n\n\n} // namespace libmv\n\n\n\n#endif // LIBMV_SIMPLE_PIPELINE_CAMERA_INTRINSICS_H_\n","file_path":"src/libmv/simple_pipeline/camera_intrinsics.h","rank":97,"score":59.67786224844623},{"content":"** IN THE SOFTWARE.\n\n**\n\n****************************************************************************/\n\n\n\n#include \"libmv/tracking/sad.h\"\n\n#include <stdlib.h>\n\n#include <math.h>\n\n\n\nnamespace libmv {\n\n\n\nvoid LaplaceFilter(ubyte* src, ubyte* dst, int width, int height, int strength) {\n\n for(int y=1; y<height-1; y++) for(int x=1; x<width-1; x++) {\n\n const ubyte* s = &src[y*width+x];\n\n int l = 128 +\n\n s[-width-1] + s[-width] + s[-width+1] +\n\n s[1] - 8*s[0] + s[1] +\n\n s[ width-1] + s[ width] + s[ width+1] ;\n\n int d = ((256-strength)*s[0] + strength*l) / 256;\n\n if(d < 0) d=0;\n\n if(d > 255) d=255;\n\n dst[y*width+x] = d;\n\n }\n\n}\n\n\n","file_path":"src/libmv/tracking/sad.cc","rank":98,"score":59.38872621136846},{"content":"#include \"libmv/numeric/numeric.h\"\n\n#include \"libmv/multiview/projection.h\"\n\n#include \"libmv/multiview/triangulation.h\"\n\n\n\nnamespace libmv {\n\n\n\n// HZ 12.2 pag.312\n\nvoid TriangulateDLT(const Mat34 &P1, const Vec2 &x1,\n\n const Mat34 &P2, const Vec2 &x2,\n\n Vec4 *X_homogeneous) {\n\n Mat4 design;\n\n for (int i = 0; i < 4; ++i) {\n\n design(0,i) = x1(0) * P1(2,i) - P1(0,i);\n\n design(1,i) = x1(1) * P1(2,i) - P1(1,i);\n\n design(2,i) = x2(0) * P2(2,i) - P2(0,i);\n\n design(3,i) = x2(1) * P2(2,i) - P2(1,i);\n\n }\n\n Nullspace(&design, X_homogeneous);\n\n}\n\n\n","file_path":"src/libmv/multiview/triangulation.cc","rank":99,"score":55.98353866653488}],"string":"[\n {\n \"content\": \"struct tuple_size<GTEST_2_TUPLE_(T)> { static const int value = 2; };\\n\\n\\n\\ntemplate <GTEST_3_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 1,\n \"score\": 343036.2119991771\n },\n {\n \"content\": \"struct tuple_size<GTEST_0_TUPLE_(T)> { static const int value = 0; };\\n\\n\\n\\ntemplate <GTEST_1_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 2,\n \"score\": 343033.30679670157\n },\n {\n \"content\": \"struct tuple_size<GTEST_1_TUPLE_(T)> { static const int value = 1; };\\n\\n\\n\\ntemplate <GTEST_2_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 3,\n \"score\": 343032.98447604134\n },\n {\n \"content\": \"class FooTest : public ::testing::TestWithParam<const char*> {\\n\\n // You can implement all the usual class fixture members here.\\n\\n};\\n\\n\\n\\n// Then, use the TEST_P macro to define as many parameterized tests\\n\\n// for this fixture as you want. The _P suffix is for \\\"parameterized\\\"\\n\\n// or \\\"pattern\\\", whichever you prefer to think.\\n\\n\\n\\nTEST_P(FooTest, DoesBlah) {\\n\\n // Inside a test, access the test parameter with the GetParam() method\\n\\n // of the TestWithParam<T> class:\\n\\n EXPECT_TRUE(foo.Blah(GetParam()));\\n\\n ...\\n\\n}\\n\\n\\n\\nTEST_P(FooTest, HasBlahBlah) {\\n\\n ...\\n\\n}\\n\\n\\n\\n// Finally, you can use INSTANTIATE_TEST_CASE_P to instantiate the test\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/gtest-param-test.h\",\n \"rank\": 4,\n \"score\": 339193.0221307178\n },\n {\n \"content\": \"struct tuple_size<GTEST_5_TUPLE_(T)> { static const int value = 5; };\\n\\n\\n\\ntemplate <GTEST_6_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 5,\n \"score\": 325761.37279787177\n },\n {\n \"content\": \"struct tuple_size<GTEST_3_TUPLE_(T)> { static const int value = 3; };\\n\\n\\n\\ntemplate <GTEST_4_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 6,\n \"score\": 325761.37279787177\n },\n {\n \"content\": \"struct tuple_size<GTEST_4_TUPLE_(T)> { static const int value = 4; };\\n\\n\\n\\ntemplate <GTEST_5_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 7,\n \"score\": 325761.3727978718\n },\n {\n \"content\": \"struct tuple_size<GTEST_8_TUPLE_(T)> { static const int value = 8; };\\n\\n\\n\\ntemplate <GTEST_9_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 8,\n \"score\": 325761.37279787177\n },\n {\n \"content\": \"struct tuple_size<GTEST_6_TUPLE_(T)> { static const int value = 6; };\\n\\n\\n\\ntemplate <GTEST_7_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 9,\n \"score\": 325761.37279787177\n },\n {\n \"content\": \"struct tuple_size<GTEST_7_TUPLE_(T)> { static const int value = 7; };\\n\\n\\n\\ntemplate <GTEST_8_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 10,\n \"score\": 325761.37279787177\n },\n {\n \"content\": \"struct tuple_size<GTEST_10_TUPLE_(T)> { static const int value = 10; };\\n\\n\\n\\ntemplate <int k, class Tuple>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 11,\n \"score\": 325761.37279787177\n },\n {\n \"content\": \"struct tuple_size<GTEST_9_TUPLE_(T)> { static const int value = 9; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 12,\n \"score\": 325761.3727978718\n },\n {\n \"content\": \"struct RemoveConst<const T[N]> {\\n\\n typedef typename RemoveConst<T>::type type[N];\\n\\n};\\n\\n#endif\\n\\n\\n\\n// A handy wrapper around RemoveConst that works when the argument\\n\\n// T depends on template parameters.\\n\\n#define GTEST_REMOVE_CONST_(T) \\\\\\n\\n typename ::testing::internal::RemoveConst<T>::type\\n\\n\\n\\n// Turns const U&, U&, const U, and U all into U.\\n\\n#define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \\\\\\n\\n GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T))\\n\\n\\n\\n// Adds reference to a type if it is not a reference type,\\n\\n// otherwise leaves it unchanged. This is the same as\\n\\n// tr1::add_reference, which is not widely available yet.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 13,\n \"score\": 317694.731590732\n },\n {\n \"content\": \"struct NormalizedSolver {\\n\\n enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\\n\\n static void Solve(const Mat &x1, const Mat &x2, vector<Mat3> *models) {\\n\\n assert(2 == x1.rows());\\n\\n assert(MINIMUM_SAMPLES <= x1.cols());\\n\\n assert(x1.rows() == x2.rows());\\n\\n assert(x1.cols() == x2.cols());\\n\\n\\n\\n // Normalize the data.\\n\\n Mat3 T1, T2;\\n\\n Mat x1_normalized, x2_normalized;\\n\\n NormalizePoints(x1, &x1_normalized, &T1);\\n\\n NormalizePoints(x2, &x2_normalized, &T2);\\n\\n\\n\\n Solver::Solve(x1_normalized, x2_normalized, models);\\n\\n\\n\\n for (int i = 0; i < models->size(); ++i) {\\n\\n Unnormalizer::Unnormalize(T1, T2, &(*models)[i]);\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate<typename Solver, typename Unnormalizer>\\n\",\n \"file_path\": \"src/libmv/multiview/two_view_kernel.h\",\n \"rank\": 14,\n \"score\": 292259.34240833856\n },\n {\n \"content\": \"struct IsotropicNormalizedSolver {\\n\\n enum { MINIMUM_SAMPLES = Solver::MINIMUM_SAMPLES };\\n\\n static void Solve(const Mat &x1, const Mat &x2, vector<Mat3> *models) {\\n\\n assert(2 == x1.rows());\\n\\n assert(MINIMUM_SAMPLES <= x1.cols());\\n\\n assert(x1.rows() == x2.rows());\\n\\n assert(x1.cols() == x2.cols());\\n\\n\\n\\n // Normalize the data.\\n\\n Mat3 T1, T2;\\n\\n Mat x1_normalized, x2_normalized;\\n\\n NormalizeIsotropicPoints(x1, &x1_normalized, &T1);\\n\\n NormalizeIsotropicPoints(x2, &x2_normalized, &T2);\\n\\n\\n\\n Solver::Solve(x1_normalized, x2_normalized, models);\\n\\n\\n\\n for (int i = 0; i < models->size(); ++i) {\\n\\n Unnormalizer::Unnormalize(T1, T2, &(*models)[i]);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/libmv/multiview/two_view_kernel.h\",\n \"rank\": 15,\n \"score\": 286783.9462379181\n },\n {\n \"content\": \"class DerivedTest : public BaseTest, public ::testing::WithParamInterface<int> {\\n\\n // The usual test fixture members go here too.\\n\\n};\\n\\n\\n\\nTEST_F(BaseTest, HasFoo) {\\n\\n // This is an ordinary non-parameterized test.\\n\\n}\\n\\n\\n\\nTEST_P(DerivedTest, DoesBlah) {\\n\\n // GetParam works just the same here as if you inherit from TestWithParam.\\n\\n EXPECT_TRUE(foo.Blah(GetParam()));\\n\\n}\\n\\n\\n\\n#endif // 0\\n\\n\\n\\n#include \\\"gtest/internal/gtest-port.h\\\"\\n\\n\\n\\n#if !GTEST_OS_SYMBIAN\\n\\n# include <utility>\\n\\n#endif\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/gtest-param-test.h\",\n \"rank\": 16,\n \"score\": 286610.0542397736\n },\n {\n \"content\": \"struct RemoveConst<const T> { typedef T type; }; // NOLINT\\n\\n\\n\\n// MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above\\n\\n// definition to fail to remove the const in 'const int[3]' and 'const\\n\\n// char[3][4]'. The following specialization works around the bug.\\n\\n// However, it causes trouble with GCC and thus needs to be\\n\\n// conditionally compiled.\\n\\n#if defined(_MSC_VER) || defined(__SUNPRO_CC) || defined(__IBMCPP__)\\n\\ntemplate <typename T, size_t N>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 17,\n \"score\": 284762.96454498696\n },\n {\n \"content\": \"struct vec2 {\\n\\n float x,y;\\n\\n inline vec2(float x, float y):x(x),y(y){}\\n\\n};\\n\\ninline vec2 operator*(mat32 m, vec2 v) {\\n\\n return vec2(v.x*m(0,0)+v.y*m(0,1)+m(0,2),v.x*m(1,0)+v.y*m(1,1)+m(1,2));\\n\\n}\\n\\n\\n\\n//! fixed point bilinear sample with precision k\\n\\ntemplate <int k> inline int sample(const ubyte* image,int stride, int x, int y, int u, int v) {\\n\\n const ubyte* s = &image[y*stride+x];\\n\\n return ((s[ 0] * (k-u) + s[ 1] * u) * (k-v)\\n\\n + (s[stride] * (k-u) + s[stride+1] * u) * ( v) ) / (k*k);\\n\\n}\\n\\n\\n\\n#ifdef __SSE__\\n\\n#include <xmmintrin.h>\\n\\nint lround(float x) { return _mm_cvtss_si32(_mm_set_ss(x)); }\\n\\n#elif defined(_MSC_VER)\\n\\nint lround(float x) { return x+0.5; }\\n\",\n \"file_path\": \"src/libmv/tracking/sad.cc\",\n \"rank\": 18,\n \"score\": 283572.3485166205\n },\n {\n \"content\": \"struct ByRef { typedef const T& type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 19,\n \"score\": 282784.30618238845\n },\n {\n \"content\": \"struct Offset;\\n\\n\\n\",\n \"file_path\": \"src/libmv/simple_pipeline/camera_intrinsics.h\",\n \"rank\": 20,\n \"score\": 278967.47144128813\n },\n {\n \"content\": \"struct RemoveConst { typedef T type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 21,\n \"score\": 266655.4776928237\n },\n {\n \"content\": \"// Helper for suppressing false warning from Clang on a const char*\\n\\n// variable declared in a conditional expression always being NULL in\\n\\n// the else branch.\\n\\nstruct GTEST_API_ ConstCharPtr {\\n\\n ConstCharPtr(const char* str) : value(str) {}\\n\\n operator bool() const { return true; }\\n\\n const char* value;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 22,\n \"score\": 259234.63678365923\n },\n {\n \"content\": \"// A derived feature with a tag, so that it is possible to check that the right\\n\\n// features are produced by the iterators.\\n\\nstruct MyPoint : public Feature {\\n\\n virtual ~MyPoint() {}\\n\\n MyPoint(int the_tag) : tag(the_tag) {}\\n\\n int tag;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/libmv/correspondence/matches_test.cc\",\n \"rank\": 23,\n \"score\": 247280.1636746919\n },\n {\n \"content\": \"// A derived feature with a tag, so that it is possible to check that the right\\n\\n// features are produced by the iterators.\\n\\nstruct MyPoint : public Feature {\\n\\n virtual ~MyPoint() {}\\n\\n MyPoint() {}\\n\\n MyPoint(int the_tag) : tag(the_tag) {}\\n\\n int tag;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/libmv/correspondence/feature_set_test.cc\",\n \"rank\": 24,\n \"score\": 243260.07501348708\n },\n {\n \"content\": \"struct SiblingTestFeature : public Feature {\\n\\n virtual ~SiblingTestFeature() {}\\n\\n};\\n\\n\\n\\nTEST(Matches, Views) {\\n\\n Matches matches;\\n\\n matches.Insert(1, 1, new SiblingTestFeature);\\n\\n matches.Insert(1, 2, new MyPoint(30));\\n\\n matches.Insert(1, 4, new SiblingTestFeature);\\n\\n Matches::Features<Feature> r1 = matches.All<Feature>();\\n\\n ++r1; // Ordering means the test feature will be 2nd.\\n\\n ASSERT_TRUE(r1);\\n\\n EXPECT_TRUE(r1.feature() != NULL);\\n\\n EXPECT_EQ(1, r1.image());\\n\\n EXPECT_EQ(2, r1.track());\\n\\n\\n\\n Matches::Features<MyPoint> r = matches.All<MyPoint>();\\n\\n ASSERT_TRUE(r);\\n\\n ASSERT_TRUE(r.feature() != NULL);\\n\\n EXPECT_EQ(30, r.feature()->tag);\\n\",\n \"file_path\": \"src/libmv/correspondence/matches_test.cc\",\n \"rank\": 25,\n \"score\": 239407.62100615233\n },\n {\n \"content\": \"struct SiblingTestFeature : public Feature {\\n\\n virtual ~SiblingTestFeature() {}\\n\\n};\\n\\n\\n\\n\\n\\nTEST(FeatureSet, New) {\\n\\n FeatureSet features;\\n\\n\\n\\n // Create a feature.\\n\\n FeatureSet::Iterator<MyPoint> it = features.New<MyPoint>();\\n\\n // Use it.\\n\\n it.feature().tag = 3;\\n\\n}\\n\\n\\n\\nTEST(FeatureSet, Insert) {\\n\\n FeatureSet features;\\n\\n // Insert a feature by copying its contents.\\n\\n FeatureSet::Iterator<MyPoint> it = features.Insert<MyPoint>(MyPoint(1));\\n\\n EXPECT_EQ(1, it.feature().tag);\\n\\n it = features.Insert<MyPoint>(MyPoint(2));\\n\",\n \"file_path\": \"src/libmv/correspondence/feature_set_test.cc\",\n \"rank\": 26,\n \"score\": 235712.53044621047\n },\n {\n \"content\": \"struct IteratorTraits<const T*> {\\n\\n typedef T value_type;\\n\\n};\\n\\n\\n\\n#if GTEST_OS_WINDOWS\\n\\n# define GTEST_PATH_SEP_ \\\"\\\\\\\\\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 1\\n\\n// The biggest signed integer type the compiler supports.\\n\\ntypedef __int64 BiggestInt;\\n\\n#else\\n\\n# define GTEST_PATH_SEP_ \\\"/\\\"\\n\\n# define GTEST_HAS_ALT_PATH_SEP_ 0\\n\\ntypedef long long BiggestInt; // NOLINT\\n\\n#endif // GTEST_OS_WINDOWS\\n\\n\\n\\n// Utilities for char.\\n\\n\\n\\n// isspace(int ch) and friends accept an unsigned char or EOF. char\\n\\n// may be signed, depending on the compiler (or compiler flags).\\n\\n// Therefore we need to cast a char to unsigned char before calling\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 27,\n \"score\": 235534.03955138955\n },\n {\n \"content\": \"struct is_pointer : public false_type {};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 28,\n \"score\": 235442.537816223\n },\n {\n \"content\": \"class TestWithParam : public Test, public WithParamInterface<T> {\\n\\n};\\n\\n\\n\\n#endif // GTEST_HAS_PARAM_TEST\\n\\n\\n\\n// Macros for indicating success/failure in test code.\\n\\n\\n\\n// ADD_FAILURE unconditionally adds a failure to the current test.\\n\\n// SUCCEED generates a success - it doesn't automatically make the\\n\\n// current test successful, as a test is only successful when it has\\n\\n// no failure.\\n\\n//\\n\\n// EXPECT_* verifies that a certain condition is satisfied. If not,\\n\\n// it behaves like ADD_FAILURE. In particular:\\n\\n//\\n\\n// EXPECT_TRUE verifies that a Boolean condition is true.\\n\\n// EXPECT_FALSE verifies that a Boolean condition is false.\\n\\n//\\n\\n// FAIL and ASSERT_* are similar to ADD_FAILURE and EXPECT_*, except\\n\\n// that they will also abort the current function on failure. People\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/gtest.h\",\n \"rank\": 29,\n \"score\": 234386.31551681436\n },\n {\n \"content\": \"struct VectorTest : public testing::Test {\\n\\n VectorTest() {\\n\\n foo_construct_calls = 0;\\n\\n foo_destruct_calls = 0;\\n\\n }\\n\\n};\\n\\n\\n\\nTEST_F(VectorTest, EmptyVectorDoesNotConstruct) {\\n\\n {\\n\\n vector<Foo> v;\\n\\n EXPECT_EQ(0, v.size());\\n\\n EXPECT_EQ(0, v.capacity());\\n\\n }\\n\\n EXPECT_EQ(0, foo_construct_calls);\\n\\n EXPECT_EQ(0, foo_destruct_calls);\\n\\n}\\n\\n\\n\\nTEST_F(VectorTest, DestructorGetsCalled) {\\n\\n {\\n\\n vector<Foo> v;\\n\",\n \"file_path\": \"src/libmv/base/vector_test.cc\",\n \"rank\": 30,\n \"score\": 232203.80611773022\n },\n {\n \"content\": \"struct vec2 {\\n\\n float x, y;\\n\\n inline vec2() : x(0), y(0) {}\\n\\n inline vec2(float x, float y) : x(x), y(y) {}\\n\\n inline vec2(float v[2]) : x(v[0]), y(v[1]) {}\\n\\n#ifdef QSTRING_H\\n\\n inline QString toString() const {\\n\\n return QString(\\\"%1 %2\\\").arg(x, 0, 'f', 2).arg(y, 0, 'f', 2);\\n\\n }\\n\\n#endif\\n\\n};\\n\\ninline vec2 operator -( vec2 a ) { return vec2( -a.x, -a.y ); }\\n\\ninline vec2 operator +( vec2 a, vec2 b ) { return vec2( a.x+b.x, a.y+b.y ); }\\n\\ninline vec2 operator +( vec2 a, float b ) { return vec2( a.x+b, a.y+b ); }\\n\\ninline vec2 operator -( vec2 a, vec2 b ) { return vec2( a.x-b.x, a.y-b.y ); }\\n\\ninline vec2 operator -( vec2 a, float b ) { return vec2( a.x-b, a.y-b ); }\\n\\ninline vec2 operator *( float b, vec2 a ) { return vec2( a.x*b, a.y*b ); }\\n\\ninline vec2 operator /( vec2 a, float b ) { return vec2( a.x/b, a.y/b ); }\\n\\ninline vec2 operator /( float a, vec2 b ) { return vec2( a/b.x, a/b.y ); }\\n\\ninline vec2 operator /( vec2 a, vec2 b ) { return vec2( a.x/b.x, a.y/b.y ); }\\n\\ninline bool operator <( vec2 a, vec2 b ) { return a.x < b.x && a.y < b.y; }\\n\\ninline bool operator >( vec2 a, vec2 b ) { return a.x > b.x && a.y > b.y; }\\n\\n\\n\",\n \"file_path\": \"src/ui/tracker/gl.h\",\n \"rank\": 31,\n \"score\": 230041.56244879367\n },\n {\n \"content\": \" struct sched_param param;\\n\",\n \"file_path\": \"src/third_party/pthreads-w32/include/implement.h\",\n \"rank\": 32,\n \"score\": 227651.59242372168\n },\n {\n \"content\": \" const MatrixType& pseudoEigenvectors() const\\n\\n {\\n\\n eigen_assert(m_isInitialized && \\\"EigenSolver is not initialized.\\\");\\n\\n eigen_assert(m_eigenvectorsOk && \\\"The eigenvectors have not been computed together with the eigenvalues.\\\");\\n\\n return m_eivec;\\n\",\n \"file_path\": \"src/third_party/eigen/Eigen/src/Eigenvalues/EigenSolver.h\",\n \"rank\": 33,\n \"score\": 226779.45656848067\n },\n {\n \"content\": \"struct EightPointRelativePoseSolver {\\n\\n enum { MINIMUM_SAMPLES = 8 };\\n\\n static void Solve(const Mat &x1, const Mat &x2, vector<Mat3> *E);\\n\\n};\\n\\n\\n\\n//-- Generic Solver for the 5pt Essential Matrix Estimation.\\n\\n//-- Need a new Class that inherit of two_view::kernel::kernel.\\n\\n// Error must be overwrite in order to compute F from E and K's.\\n\\n//-- Fitting must normalize image values to camera values.\\n\\ntemplate<typename SolverArg,\\n\\n typename ErrorArg,\\n\\n typename ModelArg = Mat3>\\n\",\n \"file_path\": \"src/libmv/multiview/essential_kernel.h\",\n \"rank\": 34,\n \"score\": 225391.3955036822\n },\n {\n \"content\": \"struct SevenPointTest : public testing::Test {\\n\\n void ExpectKernelProperties(const Mat &x1,\\n\\n const Mat &x2,\\n\\n Mat3 *F_expected = NULL) {\\n\\n Kernel kernel(x1, x2);\\n\\n vector<int> samples;\\n\\n for (int i = 0; i < x1.cols(); ++i) {\\n\\n samples.push_back(i);\\n\\n }\\n\\n vector<Mat3> Fs;\\n\\n kernel.Fit(samples, &Fs);\\n\\n bool found = false; // Need to search for expected answer.\\n\\n EXPECT_TRUE(Fs.size() != 0);\\n\\n for (int i = 0; i < Fs.size(); ++i) {\\n\\n ExpectFundamentalProperties(Fs[i], x1, x2, 1e-8);\\n\\n if (F_expected) {\\n\\n found |= Colinear(Fs[i], *F_expected, 1e-6);\\n\\n }\\n\\n }\\n\\n if (F_expected) {\\n\",\n \"file_path\": \"src/libmv/multiview/fundamental_kernel_test.cc\",\n \"rank\": 35,\n \"score\": 224961.5395519921\n },\n {\n \"content\": \"struct MatchingKernelTest : public testing::Test {\\n\\n};\\n\\n\\n\\n// Test :\\n\\n// - Libmv Kdtree,\\n\\n// - Linear matching FLANN,\\n\\n// - FLANN Kdtree.\\n\\ntypedef Types< ArrayMatcher_Kdtree<float>,\\n\\n ArrayMatcher_BruteForce<float>,\\n\\n ArrayMatcher_Kdtree_Flann<float>\\n\\n > MatchingKernelImpl;\\n\\n\\n\\nTYPED_TEST_CASE(MatchingKernelTest, MatchingKernelImpl);\\n\\n\\n\\nTYPED_TEST(MatchingKernelTest, MatcherInterfaceSymmetry)\\n\\n{\\n\\n int descriptorSize = 2;\\n\\n // Build one feature set.\\n\\n FeatureSet featureSet;\\n\\n for (int i=0; i < 4; ++i)\\n\",\n \"file_path\": \"src/libmv/correspondence/Array_Matcher_test.cc\",\n \"rank\": 36,\n \"score\": 224961.5395519921\n },\n {\n \"content\": \"struct EuclideanKernelTest : public testing::Test {\\n\\n};\\n\\n\\n\\ntypedef Types<Kernel>\\n\\n EuclideanKernelImplementations;\\n\\n\\n\\nTYPED_TEST_CASE(EuclideanKernelTest, EuclideanKernelImplementations);\\n\\n\\n\\nTYPED_TEST(EuclideanKernelTest, Fitting) {\\n\\n // Define a few euclidean transformations.\\n\\n vector<Mat3> H_gt(3);\\n\\n\\n\\n H_gt[0] = Mat3::Identity();\\n\\n \\n\\n H_gt[1] << 1, 0, -4,\\n\\n 0, 1, 5,\\n\\n 0, 0, 1;\\n\\n double angle = 0.3;\\n\\n H_gt[2] << cos(angle),-sin(angle), 3,\\n\\n sin(angle), cos(angle), -6,\\n\",\n \"file_path\": \"src/libmv/multiview/euclidean_kernel_test.cc\",\n \"rank\": 37,\n \"score\": 224961.5395519921\n },\n {\n \"content\": \"struct SimilarityKernelTest : public testing::Test {\\n\\n};\\n\\n\\n\\ntypedef Types<Kernel,\\n\\n UnnormalizedKernel>\\n\\n SimilarityKernelImplementations;\\n\\n\\n\\nTYPED_TEST_CASE(SimilarityKernelTest, SimilarityKernelImplementations);\\n\\n\\n\\nTYPED_TEST(SimilarityKernelTest, Fitting) {\\n\\n // Define a few similarities.\\n\\n vector<Mat3> H_gt(3);\\n\\n\\n\\n H_gt[0] = Mat3::Identity();\\n\\n \\n\\n double angle = 0.3;\\n\\n double scale = 1;\\n\\n H_gt[1] << scale*cos(angle),-scale*sin(angle), -4,\\n\\n scale*sin(angle), scale*cos(angle), 5,\\n\\n 0, 0, 1;\\n\",\n \"file_path\": \"src/libmv/multiview/similarity_kernel_test.cc\",\n \"rank\": 38,\n \"score\": 224961.5395519921\n },\n {\n \"content\": \"struct AffineKernelTest : public testing::Test {\\n\\n};\\n\\n\\n\\ntypedef Types<Kernel,\\n\\n UnnormalizedKernel>\\n\\n AffineKernelImplementations;\\n\\n\\n\\nTYPED_TEST_CASE(AffineKernelTest, AffineKernelImplementations);\\n\\n\\n\\nTYPED_TEST(AffineKernelTest, Fitting) {\\n\\n // Define a few affinities.\\n\\n vector<Mat3> H_gt(3);\\n\\n\\n\\n H_gt[0] = Mat3::Identity();\\n\\n H_gt[1] << 1, 0, -4,\\n\\n 0, 1, 5,\\n\\n 0, 0, 1;\\n\\n H_gt[2] << 1, -2, 3,\\n\\n 4, 5, -6,\\n\\n 0, 0, 1;\\n\",\n \"file_path\": \"src/libmv/multiview/affine_kernel_test.cc\",\n \"rank\": 39,\n \"score\": 224961.5395519921\n },\n {\n \"content\": \"struct HomographyKernelTest : public testing::Test {\\n\\n};\\n\\n\\n\\ntypedef Types<Kernel,\\n\\n UnnormalizedKernel>\\n\\n HomographyKernelImplementations;\\n\\n\\n\\nTYPED_TEST_CASE(HomographyKernelTest, HomographyKernelImplementations);\\n\\n\\n\\nTYPED_TEST(HomographyKernelTest, Fitting) {\\n\\n // Define a few homographies.\\n\\n vector<Mat3> H_gt(3);\\n\\n\\n\\n H_gt[0] = Mat3::Identity();\\n\\n H_gt[1] << 1, 0, -4,\\n\\n 0, 1, 5,\\n\\n 0, 0, 1;\\n\\n H_gt[2] << 1, -2, 3,\\n\\n 4, 5, -6,\\n\\n -7, 8, 1;\\n\",\n \"file_path\": \"src/libmv/multiview/homography_kernel_test.cc\",\n \"rank\": 40,\n \"score\": 224961.5395519921\n },\n {\n \"content\": \"struct FundamentalErrorTest : public testing::Test {\\n\\n};\\n\\n\\n\\ntypedef Types<SampsonError,\\n\\n SymmetricEpipolarDistanceError>\\n\\n FundamentalErrorImplementations;\\n\\n\\n\\nTYPED_TEST_CASE(FundamentalErrorTest, FundamentalErrorImplementations);\\n\\nTYPED_TEST(FundamentalErrorTest, FundamentalErrorTest2) {\\n\\n Vec3 t(1, 0, 0);\\n\\n Mat3 F = CrossProductMatrix(t); // Fundamental matrix corresponding to pure\\n\\n // translation.\\n\\n\\n\\n Vec2 x0(0, 0), y0( 0, 0); // Good match (at infinity).\\n\\n Vec2 x1(0, 0), y1(100, 0); // Good match (no vertical disparity).\\n\\n Vec2 x2(0, 0), y2(0.0, 0.1); // Small error (a bit of vertical disparity).\\n\\n Vec2 x3(0, 0), y3( 0, 1); // Bigger error.\\n\\n Vec2 x4(0, 0), y4( 0, 10); // Biggest error.\\n\\n Vec2 x5(0, 0), y5(100, 10); // Biggest error with horizontal disparity.\\n\\n\\n\",\n \"file_path\": \"src/libmv/multiview/fundamental_kernel_test.cc\",\n \"rank\": 41,\n \"score\": 224961.5395519921\n },\n {\n \"content\": \"struct is_pointer<T*> : public true_type {};\\n\\n\\n\\ntemplate <typename Iterator>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 42,\n \"score\": 224766.44843841885\n },\n {\n \"content\": \" long height;\\n\",\n \"file_path\": \"src/third_party/daisy/include/kutility/image_io_png.h\",\n \"rank\": 43,\n \"score\": 220840.26162789448\n },\n {\n \"content\": \" long width;\\n\",\n \"file_path\": \"src/third_party/daisy/include/kutility/image_io_png.h\",\n \"rank\": 44,\n \"score\": 220838.50891298958\n },\n {\n \"content\": \"struct EightPointTest : public SevenPointTest<Kernel> {\\n\\n};\\n\\n\\n\\ntypedef Types<EightPointKernel,\\n\\n NormalizedEightPointKernel>\\n\\n EightPointImplementations;\\n\\n\\n\\nTYPED_TEST_CASE(EightPointTest, EightPointImplementations);\\n\\nTYPED_TEST(EightPointTest, EasyCase) {\\n\\n Mat x1(2, 8);\\n\\n Mat x2(2, 8);\\n\\n x1 << 0, 0, 0, 1, 1, 1, 2, 2,\\n\\n 0, 1, 2, 0, 1, 2, 0, 1;\\n\\n x2 << 0, 0, 0, 1, 1, 1, 2, 2,\\n\\n 1, 2, 3, 1, 2, 3, 1, 2;\\n\\n this->ExpectKernelProperties(x1, x2);\\n\\n}\\n\\n\\n\\n\\n\\nTYPED_TEST(EightPointTest, RealistCaseWith30Points) {\\n\\n TwoViewDataSet d = TwoRealisticCameras();\\n\\n this->ExpectKernelProperties(d.x1, d.x2, &d.F);\\n\\n}\\n\\n\\n\\ntemplate <class Kernel>\\n\",\n \"file_path\": \"src/libmv/multiview/fundamental_kernel_test.cc\",\n \"rank\": 45,\n \"score\": 218276.7724421604\n },\n {\n \"content\": \"struct AddReference { typedef T& type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 46,\n \"score\": 215952.30973640824\n },\n {\n \"content\": \"struct AddRef { typedef T& type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 47,\n \"score\": 215952.30973640824\n },\n {\n \"content\": \"struct RemoveReference { typedef T type; }; // NOLINT\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 48,\n \"score\": 215952.30973640824\n },\n {\n \"content\": \"class ThreadWithParam : public ThreadWithParamBase {\\n\\n public:\\n\\n typedef void (*UserThreadFunc)(T);\\n\\n\\n\\n ThreadWithParam(\\n\\n UserThreadFunc func, T param, Notification* thread_can_start)\\n\\n : func_(func),\\n\\n param_(param),\\n\\n thread_can_start_(thread_can_start),\\n\\n finished_(false) {\\n\\n ThreadWithParamBase* const base = this;\\n\\n // The thread can be created only after all fields except thread_\\n\\n // have been initialized.\\n\\n GTEST_CHECK_POSIX_SUCCESS_(\\n\\n pthread_create(&thread_, 0, &ThreadFuncWithCLinkage, base));\\n\\n }\\n\\n ~ThreadWithParam() { Join(); }\\n\\n\\n\\n void Join() {\\n\\n if (!finished_) {\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 49,\n \"score\": 214899.54350370832\n },\n {\n \"content\": \"struct StaticAssertTypeEqHelper;\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 50,\n \"score\": 214152.1554432972\n },\n {\n \"content\": \"struct TupleElement<true, 2, GTEST_10_TUPLE_(T)> { typedef T2 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 51,\n \"score\": 212614.16172251722\n },\n {\n \"content\": \"struct TupleElement<true, 0, GTEST_10_TUPLE_(T)> { typedef T0 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 52,\n \"score\": 212611.25652004164\n },\n {\n \"content\": \"struct TupleElement<true, 1, GTEST_10_TUPLE_(T)> { typedef T1 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 53,\n \"score\": 212610.93419938145\n },\n {\n \"content\": \"struct has_none {int a[1];};\\n\",\n \"file_path\": \"src/third_party/eigen/Eigen/src/Core/util/Meta.h\",\n \"rank\": 54,\n \"score\": 212517.55153563494\n },\n {\n \"content\": \"struct ByRef<T&> { typedef T& type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper for ByRef.\\n\\n#define GTEST_BY_REF_(T) typename ::std::tr1::gtest_internal::ByRef<T>::type\\n\\n\\n\\n// AddRef<T>::type is T if T is a reference; otherwise it's T&. This\\n\\n// is the same as tr1::add_reference<T>::type.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 55,\n \"score\": 211432.29491379164\n },\n {\n \"content\": \"struct LazyProductReturnType : public ProductReturnType<Lhs,Rhs,LazyCoeffBasedProductMode>\\n\\n{};\\n\\n\\n\\n/***********************************************************************\\n\\n* Implementation of Inner Vector Vector Product\\n\\n***********************************************************************/\\n\\n\\n\\n// FIXME : maybe the \\\"inner product\\\" could return a Scalar\\n\\n// instead of a 1x1 matrix ??\\n\\n// Pro: more natural for the user\\n\\n// Cons: this could be a problem if in a meta unrolled algorithm a matrix-matrix\\n\\n// product ends up to a row-vector times col-vector product... To tackle this use\\n\\n// case, we could have a specialization for Block<MatrixType,1,1> with: operator=(Scalar x);\\n\\n\\n\\nnamespace internal {\\n\\n\\n\\ntemplate<typename Lhs, typename Rhs>\\n\",\n \"file_path\": \"src/third_party/eigen/Eigen/src/Core/Product.h\",\n \"rank\": 56,\n \"score\": 211153.28704641882\n },\n {\n \"content\": \" class Iterator : public ParamIteratorInterface<ParamType> {\\n\\n public:\\n\\n Iterator(const ParamGeneratorInterface<ParamType>* base,\\n\\n const ParamGenerator<T1>& g1,\\n\\n const typename ParamGenerator<T1>::iterator& current1,\\n\\n const ParamGenerator<T2>& g2,\\n\\n const typename ParamGenerator<T2>::iterator& current2,\\n\\n const ParamGenerator<T3>& g3,\\n\\n const typename ParamGenerator<T3>::iterator& current3,\\n\\n const ParamGenerator<T4>& g4,\\n\\n const typename ParamGenerator<T4>::iterator& current4,\\n\\n const ParamGenerator<T5>& g5,\\n\\n const typename ParamGenerator<T5>::iterator& current5,\\n\\n const ParamGenerator<T6>& g6,\\n\\n const typename ParamGenerator<T6>::iterator& current6,\\n\\n const ParamGenerator<T7>& g7,\\n\\n const typename ParamGenerator<T7>::iterator& current7,\\n\\n const ParamGenerator<T8>& g8,\\n\\n const typename ParamGenerator<T8>::iterator& current8,\\n\\n const ParamGenerator<T9>& g9,\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-param-util-generated.h\",\n \"rank\": 57,\n \"score\": 210245.4281016344\n },\n {\n \"content\": \"struct AddReference<T&> { typedef T& type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper around AddReference that works when the argument T\\n\\n// depends on template parameters.\\n\\n#define GTEST_ADD_REFERENCE_(T) \\\\\\n\\n typename ::testing::internal::AddReference<T>::type\\n\\n\\n\\n// Adds a reference to const on top of T as necessary. For example,\\n\\n// it transforms\\n\\n//\\n\\n// char ==> const char&\\n\\n// const char ==> const char&\\n\\n// char& ==> const char&\\n\\n// const char& ==> const char&\\n\\n//\\n\\n// The argument T must depend on some template parameters.\\n\\n#define GTEST_REFERENCE_TO_CONST_(T) \\\\\\n\\n GTEST_ADD_REFERENCE_(const GTEST_REMOVE_REFERENCE_(T))\\n\\n\\n\\n// ImplicitlyConvertible<From, To>::value is a compile-time bool\\n\\n// constant that's true iff type From can be implicitly converted to\\n\\n// type To.\\n\\ntemplate <typename From, typename To>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 58,\n \"score\": 208218.41866646786\n },\n {\n \"content\": \"struct AddRef<T&> { typedef T& type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper for AddRef.\\n\\n#define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef<T>::type\\n\\n\\n\\n// A helper for implementing get<k>().\\n\\ntemplate <int k> class Get;\\n\\n\\n\\n// A helper for implementing tuple_element<k, T>. kIndexValid is true\\n\\n// iff k < the number of fields in tuple type T.\\n\\ntemplate <bool kIndexValid, int kIndex, class Tuple>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 59,\n \"score\": 208218.41866646786\n },\n {\n \"content\": \"struct RemoveReference<T&> { typedef T type; }; // NOLINT\\n\\n\\n\\n// A handy wrapper around RemoveReference that works when the argument\\n\\n// T depends on template parameters.\\n\\n#define GTEST_REMOVE_REFERENCE_(T) \\\\\\n\\n typename ::testing::internal::RemoveReference<T>::type\\n\\n\\n\\n// Removes const from a type if it is a const type, otherwise leaves\\n\\n// it unchanged. This is the same as tr1::remove_const, which is not\\n\\n// widely available yet.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-internal.h\",\n \"rank\": 60,\n \"score\": 208218.41866646786\n },\n {\n \"content\": \" class Iterator : public ParamIteratorInterface<T> {\\n\\n public:\\n\\n Iterator(const ParamGeneratorInterface<T>* base,\\n\\n typename ContainerType::const_iterator iterator)\\n\\n : base_(base), iterator_(iterator) {}\\n\\n virtual ~Iterator() {}\\n\\n\\n\\n virtual const ParamGeneratorInterface<T>* BaseGenerator() const {\\n\\n return base_;\\n\\n }\\n\\n virtual void Advance() {\\n\\n ++iterator_;\\n\\n value_.reset();\\n\\n }\\n\\n virtual ParamIteratorInterface<T>* Clone() const {\\n\\n return new Iterator(*this);\\n\\n }\\n\\n // We need to use cached value referenced by iterator_ because *iterator_\\n\\n // can return a temporary object (and of type other then T), so just\\n\\n // having \\\"return &*iterator_;\\\" doesn't work.\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 61,\n \"score\": 208214.66940753855\n },\n {\n \"content\": \"struct has_std_result_type {int a[2];};\\n\",\n \"file_path\": \"src/third_party/eigen/Eigen/src/Core/util/Meta.h\",\n \"rank\": 62,\n \"score\": 207468.68356254126\n },\n {\n \"content\": \"class RangeGenerator : public ParamGeneratorInterface<T> {\\n\\n public:\\n\\n RangeGenerator(T begin, T end, IncrementT step)\\n\\n : begin_(begin), end_(end),\\n\\n step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}\\n\\n virtual ~RangeGenerator() {}\\n\\n\\n\\n virtual ParamIteratorInterface<T>* Begin() const {\\n\\n return new Iterator(this, begin_, 0, step_);\\n\\n }\\n\\n virtual ParamIteratorInterface<T>* End() const {\\n\\n return new Iterator(this, end_, end_index_, step_);\\n\\n }\\n\\n\\n\\n private:\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 63,\n \"score\": 205241.87380426304\n },\n {\n \"content\": \"class ValuesInIteratorRangeGenerator : public ParamGeneratorInterface<T> {\\n\\n public:\\n\\n template <typename ForwardIterator>\\n\\n ValuesInIteratorRangeGenerator(ForwardIterator begin, ForwardIterator end)\\n\\n : container_(begin, end) {}\\n\\n virtual ~ValuesInIteratorRangeGenerator() {}\\n\\n\\n\\n virtual ParamIteratorInterface<T>* Begin() const {\\n\\n return new Iterator(this, container_.begin());\\n\\n }\\n\\n virtual ParamIteratorInterface<T>* End() const {\\n\\n return new Iterator(this, container_.end());\\n\\n }\\n\\n\\n\\n private:\\n\\n typedef typename ::std::vector<T> ContainerType;\\n\\n\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 64,\n \"score\": 199586.66588546993\n },\n {\n \"content\": \"class BaseTest : public ::testing::Test {\\n\\n // You can inherit all the usual members for a non-parameterized test\\n\\n // fixture here.\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/gtest-param-test.h\",\n \"rank\": 65,\n \"score\": 199186.17146323342\n },\n {\n \"content\": \"struct TuplePrefixPrinter<0> {\\n\\n template <typename Tuple>\\n\\n static void PrintPrefixTo(const Tuple&, ::std::ostream*) {}\\n\\n\\n\\n template <typename Tuple>\\n\\n static void TersePrintPrefixToStrings(const Tuple&, Strings*) {}\\n\\n};\\n\\n// We have to specialize the entire TuplePrefixPrinter<> class\\n\\n// template here, even though the definition of\\n\\n// TersePrintPrefixToStrings() is the same as the generic version, as\\n\\n// Embarcadero (formerly CodeGear, formerly Borland) C++ doesn't\\n\\n// support specializing a method template of a class template.\\n\\ntemplate <>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/gtest-printers.h\",\n \"rank\": 66,\n \"score\": 197611.20092292287\n },\n {\n \"content\": \"struct TuplePrefixPrinter<1> {\\n\\n template <typename Tuple>\\n\\n static void PrintPrefixTo(const Tuple& t, ::std::ostream* os) {\\n\\n UniversalPrinter<typename ::std::tr1::tuple_element<0, Tuple>::type>::\\n\\n Print(::std::tr1::get<0>(t), os);\\n\\n }\\n\\n\\n\\n template <typename Tuple>\\n\\n static void TersePrintPrefixToStrings(const Tuple& t, Strings* strings) {\\n\\n ::std::stringstream ss;\\n\\n UniversalTersePrint(::std::tr1::get<0>(t), &ss);\\n\\n strings->push_back(ss.str());\\n\\n }\\n\\n};\\n\\n\\n\\n// Helper function for printing a tuple. T must be instantiated with\\n\\n// a tuple type.\\n\\ntemplate <typename T>\\n\\nvoid PrintTupleTo(const T& t, ::std::ostream* os) {\\n\\n *os << \\\"(\\\";\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/gtest-printers.h\",\n \"rank\": 67,\n \"score\": 197610.56254259608\n },\n {\n \"content\": \"struct SameSizeTuplePrefixComparator<0, 0> {\\n\\n template <class Tuple1, class Tuple2>\\n\\n static bool Eq(const Tuple1& /* t1 */, const Tuple2& /* t2 */) {\\n\\n return true;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <int k>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 68,\n \"score\": 197433.93964030355\n },\n {\n \"content\": \"struct StaticAssertTypeEqHelper<T, T> {};\\n\\n\\n\\n#if GTEST_HAS_GLOBAL_STRING\\n\\ntypedef ::string string;\\n\\n#else\\n\\ntypedef ::std::string string;\\n\\n#endif // GTEST_HAS_GLOBAL_STRING\\n\\n\\n\\n#if GTEST_HAS_GLOBAL_WSTRING\\n\\ntypedef ::wstring wstring;\\n\\n#elif GTEST_HAS_STD_WSTRING\\n\\ntypedef ::std::wstring wstring;\\n\\n#endif // GTEST_HAS_GLOBAL_WSTRING\\n\\n\\n\\n// A helper for suppressing warnings on constant condition. It just\\n\\n// returns 'condition'.\\n\\nGTEST_API_ bool IsTrue(bool condition);\\n\\n\\n\\n// Defines scoped_ptr.\\n\\n\\n\\n// This implementation of scoped_ptr is PARTIAL - it only contains\\n\\n// enough stuff to satisfy Google Test's need.\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-port.h\",\n \"rank\": 69,\n \"score\": 196192.9215452183\n },\n {\n \"content\": \" Mat46 X;\\n\",\n \"file_path\": \"src/libmv/multiview/sixpointnview.h\",\n \"rank\": 70,\n \"score\": 195738.85546696547\n },\n {\n \"content\": \"struct TupleElement<true, 5, GTEST_10_TUPLE_(T)> { typedef T5 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 71,\n \"score\": 195339.32252121187\n },\n {\n \"content\": \"struct TupleElement<true, 4, GTEST_10_TUPLE_(T)> { typedef T4 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 72,\n \"score\": 195339.32252121187\n },\n {\n \"content\": \"struct TupleElement<true, 8, GTEST_10_TUPLE_(T)> { typedef T8 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 73,\n \"score\": 195339.32252121187\n },\n {\n \"content\": \"struct TupleElement<true, 3, GTEST_10_TUPLE_(T)> { typedef T3 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 74,\n \"score\": 195339.32252121187\n },\n {\n \"content\": \"struct TupleElement<true, 6, GTEST_10_TUPLE_(T)> { typedef T6 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 75,\n \"score\": 195339.32252121187\n },\n {\n \"content\": \"struct TupleElement<true, 9, GTEST_10_TUPLE_(T)> { typedef T9 type; };\\n\\n\\n\\n} // namespace gtest_internal\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 76,\n \"score\": 195339.32252121187\n },\n {\n \"content\": \"struct TupleElement<true, 7, GTEST_10_TUPLE_(T)> { typedef T7 type; };\\n\\n\\n\\ntemplate <GTEST_10_TYPENAMES_(T)>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-tuple.h\",\n \"rank\": 77,\n \"score\": 195339.32252121187\n },\n {\n \"content\": \"class ParameterizedTestFactory : public TestFactoryBase {\\n\\n public:\\n\\n typedef typename TestClass::ParamType ParamType;\\n\\n explicit ParameterizedTestFactory(ParamType parameter) :\\n\\n parameter_(parameter) {}\\n\\n virtual Test* CreateTest() {\\n\\n TestClass::SetParam(¶meter_);\\n\\n return new TestClass();\\n\\n }\\n\\n\\n\\n private:\\n\\n const ParamType parameter_;\\n\\n\\n\\n GTEST_DISALLOW_COPY_AND_ASSIGN_(ParameterizedTestFactory);\\n\\n};\\n\\n\\n\\n// INTERNAL IMPLEMENTATION - DO NOT USE IN USER CODE.\\n\\n//\\n\\n// TestMetaFactoryBase is a base class for meta-factories that create\\n\\n// test factories for passing into MakeAndRegisterTestInfo function.\\n\\ntemplate <class ParamType>\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/internal/gtest-param-util.h\",\n \"rank\": 78,\n \"score\": 193148.9906074502\n },\n {\n \"content\": \"class PolynomialSolver<_Scalar,1> : public PolynomialSolverBase<_Scalar,1>\\n\\n{\\n\\n public:\\n\\n typedef PolynomialSolverBase<_Scalar,1> PS_Base;\\n\\n EIGEN_POLYNOMIAL_SOLVER_BASE_INHERITED_TYPES( PS_Base )\\n\\n\\n\\n public:\\n\\n /** Computes the complex roots of a new polynomial. */\\n\\n template< typename OtherPolynomial >\\n\\n void compute( const OtherPolynomial& poly )\\n\\n {\\n\\n assert( Scalar(0) != poly[poly.size()-1] );\\n\\n m_roots[0] = -poly[0]/poly[poly.size()-1];\\n\\n }\\n\\n\\n\\n protected:\\n\\n using PS_Base::m_roots;\\n\\n};\\n\\n\\n\\n#endif // EIGEN_POLYNOMIAL_SOLVER_H\\n\",\n \"file_path\": \"src/third_party/eigen/unsupported/Eigen/src/Polynomials/PolynomialSolver.h\",\n \"rank\": 79,\n \"score\": 192683.69739125262\n },\n {\n \"content\": \"class Calibration : public QWidget, public libmv::CameraIntrinsics {\\n\\n Q_OBJECT\\n\\n public:\\n\\n Calibration(QString path, QSize size);\\n\\n double Value(int i);\\n\\n\\n\\n public slots:\\n\\n void updateSettings();\\n\\n\\n\\n signals:\\n\\n void settingsChanged();\\n\\n\\n\\n private:\\n\\n QString path_;\\n\\n QDoubleSpinBox* spinbox_[11];\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/ui/tracker/calibration.h\",\n \"rank\": 80,\n \"score\": 192463.38856202114\n },\n {\n \"content\": \"/// an image in the match graph\\n\\nstruct Node : public QGraphicsPixmapItem {\\n\\n//Springs\\n\\n QMap<Node*,Edge*> edges;\\n\\n\\n\\n//RK4 integration\\n\\n QVector2D position[4];\\n\\n QVector2D velocity[4];\\n\\n QVector2D acceleration[4];\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/ui/nvr/nview.h\",\n \"rank\": 81,\n \"score\": 191125.72178236695\n },\n {\n \"content\": \"// TODO(julien) put this (Edge, node, graph, GraphView) in a widget (.h/.cc)\\n\\n/// a line linking two nodes\\n\\nstruct Edge : public QGraphicsLineItem {\\n\\n Edge(Node* a, Node* b) : a(a), b(b) { setZValue(-1); }\\n\\n Node* a;\\n\\n Node* b;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/ui/nvr/nview.h\",\n \"rank\": 82,\n \"score\": 191125.72178236695\n },\n {\n \"content\": \" Mat34 P1, P2; // Projection matrix, P = K(R|t)\\n\",\n \"file_path\": \"src/libmv/multiview/test_data_sets.h\",\n \"rank\": 83,\n \"score\": 190730.9296564619\n },\n {\n \"content\": \" Mat3 K1, K2; // Internal parameters.\\n\",\n \"file_path\": \"src/libmv/multiview/test_data_sets.h\",\n \"rank\": 84,\n \"score\": 190729.38573998408\n },\n {\n \"content\": \" Mat3X X; // 3D points.\\n\",\n \"file_path\": \"src/libmv/multiview/test_data_sets.h\",\n \"rank\": 85,\n \"score\": 190710.15470986185\n },\n {\n \"content\": \" class TestName : public CaseName<gtest_TypeParam_> { \\\\\\n\\n private: \\\\\\n\\n typedef CaseName<gtest_TypeParam_> TestFixture; \\\\\\n\\n typedef gtest_TypeParam_ TypeParam; \\\\\\n\\n virtual void TestBody(); \\\\\\n\\n }; \\\\\\n\\n static bool gtest_##TestName##_defined_ GTEST_ATTRIBUTE_UNUSED_ = \\\\\\n\\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).AddTestName(\\\\\\n\\n __FILE__, __LINE__, #CaseName, #TestName); \\\\\\n\\n } \\\\\\n\\n template <typename gtest_TypeParam_> \\\\\\n\\n void GTEST_CASE_NAMESPACE_(CaseName)::TestName<gtest_TypeParam_>::TestBody()\\n\\n\\n\\n# define REGISTER_TYPED_TEST_CASE_P(CaseName, ...) \\\\\\n\\n namespace GTEST_CASE_NAMESPACE_(CaseName) { \\\\\\n\\n typedef ::testing::internal::Templates<__VA_ARGS__>::type gtest_AllTests_; \\\\\\n\\n } \\\\\\n\\n static const char* const GTEST_REGISTERED_TEST_NAMES_(CaseName) = \\\\\\n\\n GTEST_TYPED_TEST_CASE_P_STATE_(CaseName).VerifyRegisteredTestNames(\\\\\\n\\n __FILE__, __LINE__, #__VA_ARGS__)\\n\",\n \"file_path\": \"src/third_party/gtest/include/gtest/gtest-typed-test.h\",\n \"rank\": 86,\n \"score\": 189540.64648862006\n },\n {\n \"content\": \"struct nested<ReturnByValue<Derived>, n, PlainObject>\\n\\n{\\n\\n typedef typename traits<Derived>::ReturnType type;\\n\\n};\\n\\n\\n\\n} // end namespace internal\\n\\n\\n\\ntemplate<typename Derived> class ReturnByValue\\n\\n : public internal::dense_xpr_base< ReturnByValue<Derived> >::type\\n\\n{\\n\\n public:\\n\\n typedef typename internal::traits<Derived>::ReturnType ReturnType;\\n\\n\\n\\n typedef typename internal::dense_xpr_base<ReturnByValue>::type Base;\\n\\n EIGEN_DENSE_PUBLIC_INTERFACE(ReturnByValue)\\n\\n\\n\\n template<typename Dest>\\n\\n inline void evalTo(Dest& dst) const\\n\\n { static_cast<const Derived*>(this)->evalTo(dst); }\\n\\n inline Index rows() const { return static_cast<const Derived*>(this)->rows(); }\\n\\n inline Index cols() const { return static_cast<const Derived*>(this)->cols(); }\\n\\n\\n\",\n \"file_path\": \"src/third_party/eigen/Eigen/src/Core/ReturnByValue.h\",\n \"rank\": 87,\n \"score\": 186855.92595096395\n },\n {\n \"content\": \"struct blas_traits<const T>\\n\\n : blas_traits<T>\\n\\n{};\\n\\n\\n\\ntemplate<typename T, bool HasUsableDirectAccess=blas_traits<T>::HasUsableDirectAccess>\\n\",\n \"file_path\": \"src/third_party/eigen/Eigen/src/Core/util/BlasUtil.h\",\n \"rank\": 88,\n \"score\": 186430.01658238308\n },\n {\n \"content\": \" */\\n\\n void Undistort(const float* src, float* dst,\\n\\n int width, int height, int channels);\\n\\n /*!\\n\\n Undistort an image using the current camera instrinsics\\n\\n\\n\\n The undistorted image is computed in \\\\a dst using samples from \\\\a src.\\n\\n both buffers should be \\\\a width x \\\\a height x \\\\a channels sized.\\n\\n\\n\\n \\\\note This version is much faster.\\n\\n */\\n\\n void Undistort(const unsigned char* src, unsigned char* dst,\\n\\n int width, int height, int channels);\\n\\n\\n\\n private:\\n\\n template<typename WarpFunction> void ComputeLookupGrid(Offset* grid, int width, int height);\\n\\n void FreeLookupGrid();\\n\\n\\n\\n // The traditional intrinsics matrix from x = K[R|t]X.\\n\\n Mat3 K_;\\n\",\n \"file_path\": \"src/libmv/simple_pipeline/camera_intrinsics.h\",\n \"rank\": 91,\n \"score\": 72.20606147585795\n },\n {\n \"content\": \" /// Set the entire calibration matrix at once.\\n\\n void SetK(const Mat3 new_k);\\n\\n\\n\\n /// Set both x and y focal length in pixels.\\n\\n void SetFocalLength(double focal_x, double focal_y);\\n\\n\\n\\n void SetPrincipalPoint(double cx, double cy);\\n\\n\\n\\n void SetImageSize(int width, int height);\\n\\n\\n\\n void SetRadialDistortion(double k1, double k2, double k3 = 0);\\n\\n\\n\\n void SetTangentialDistortion(double p1, double p2);\\n\\n\\n\\n /*!\\n\\n Apply camera intrinsics to the normalized point to get image coordinates.\\n\\n\\n\\n This applies the lens distortion to a point which is in normalized\\n\\n camera coordinates (i.e. the principal point is at (0, 0)) to get image\\n\\n coordinates in pixels.\\n\",\n \"file_path\": \"src/libmv/simple_pipeline/camera_intrinsics.h\",\n \"rank\": 96,\n \"score\": 59.67982473890387\n },\n {\n \"content\": \"\\n\\n // This is the size of the image. This is necessary to, for example, handle\\n\\n // the case of processing a scaled image.\\n\\n int image_width_;\\n\\n int image_height_;\\n\\n\\n\\n // OpenCV's distortion model with third order polynomial radial distortion\\n\\n // terms and second order tangential distortion. The distortion is applied to\\n\\n // the normalized coordinates before the focal length, which makes them\\n\\n // independent of image size.\\n\\n double k1_, k2_, k3_, p1_, p2_;\\n\\n\\n\\n Offset* distort_;\\n\\n Offset* undistort_;\\n\\n};\\n\\n\\n\\n} // namespace libmv\\n\\n\\n\\n#endif // LIBMV_SIMPLE_PIPELINE_CAMERA_INTRINSICS_H_\\n\",\n \"file_path\": \"src/libmv/simple_pipeline/camera_intrinsics.h\",\n \"rank\": 97,\n \"score\": 59.67786224844623\n },\n {\n \"content\": \"** IN THE SOFTWARE.\\n\\n**\\n\\n****************************************************************************/\\n\\n\\n\\n#include \\\"libmv/tracking/sad.h\\\"\\n\\n#include <stdlib.h>\\n\\n#include <math.h>\\n\\n\\n\\nnamespace libmv {\\n\\n\\n\\nvoid LaplaceFilter(ubyte* src, ubyte* dst, int width, int height, int strength) {\\n\\n for(int y=1; y<height-1; y++) for(int x=1; x<width-1; x++) {\\n\\n const ubyte* s = &src[y*width+x];\\n\\n int l = 128 +\\n\\n s[-width-1] + s[-width] + s[-width+1] +\\n\\n s[1] - 8*s[0] + s[1] +\\n\\n s[ width-1] + s[ width] + s[ width+1] ;\\n\\n int d = ((256-strength)*s[0] + strength*l) / 256;\\n\\n if(d < 0) d=0;\\n\\n if(d > 255) d=255;\\n\\n dst[y*width+x] = d;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/libmv/tracking/sad.cc\",\n \"rank\": 98,\n \"score\": 59.38872621136846\n },\n {\n \"content\": \"#include \\\"libmv/numeric/numeric.h\\\"\\n\\n#include \\\"libmv/multiview/projection.h\\\"\\n\\n#include \\\"libmv/multiview/triangulation.h\\\"\\n\\n\\n\\nnamespace libmv {\\n\\n\\n\\n// HZ 12.2 pag.312\\n\\nvoid TriangulateDLT(const Mat34 &P1, const Vec2 &x1,\\n\\n const Mat34 &P2, const Vec2 &x2,\\n\\n Vec4 *X_homogeneous) {\\n\\n Mat4 design;\\n\\n for (int i = 0; i < 4; ++i) {\\n\\n design(0,i) = x1(0) * P1(2,i) - P1(0,i);\\n\\n design(1,i) = x1(1) * P1(2,i) - P1(1,i);\\n\\n design(2,i) = x2(0) * P2(2,i) - P2(0,i);\\n\\n design(3,i) = x2(1) * P2(2,i) - P2(1,i);\\n\\n }\\n\\n Nullspace(&design, X_homogeneous);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/libmv/multiview/triangulation.cc\",\n \"rank\": 99,\n \"score\": 55.98353866653488\n }\n]","isConversational":false}}},{"rowIdx":480,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"tests/experimental/strong_type/strong_type.t.cpp"},"repo_name":{"kind":"string","value":"tobanteAudio/taetl"},"commit":{"kind":"string","value":"0aa6365aa156b297745f395882ff366a8626e5e0"},"file_code":{"kind":"string","value":"\n\n#include \"etl/experimental/strong_type/strong_type.hpp\"\n\n#include \"etl/cstdint.hpp\"\n#include \"etl/type_traits.hpp\"\n\n#include \"testing/testing.hpp\"\n\nusing namespace etl::experimental;\n\ntemplate <typename T>\nconstexpr auto test() -> bool\n{\n\n {\n\n using Kilogram = strong_type<T, struct Kilogram_tag>;\n auto kilo = Kilogram {};\n kilo = Kilogram { 0 };\n\n assert((kilo.raw_value() == T { 0 }));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag>;\n\n assert((sizeof(Kilo) == sizeof(typename Kilo::value_type)));\n\n assert((etl::is_constructible_v<Kilo>));\n assert((etl::is_trivially_constructible_v<Kilo>));\n assert((etl::is_nothrow_constructible_v<Kilo>));\n\n assert((etl::is_destructible_v<Kilo>));\n assert((etl::is_trivially_destructible_v<Kilo>));\n assert((etl::is_nothrow_destructible_v<Kilo>));\n\n assert((etl::is_assignable_v<Kilo, Kilo>));\n assert((etl::is_trivially_assignable_v<Kilo, Kilo>));\n assert((etl::is_nothrow_assignable_v<Kilo, Kilo>));\n\n assert((etl::is_copy_constructible_v<Kilo>));\n assert((etl::is_trivially_copy_constructible_v<Kilo>));\n assert((etl::is_nothrow_copy_constructible_v<Kilo>));\n\n assert((etl::is_copy_assignable_v<Kilo>));\n assert((etl::is_trivially_copy_assignable_v<Kilo>));\n assert((etl::is_nothrow_copy_assignable_v<Kilo>));\n\n assert((etl::is_move_constructible_v<Kilo>));\n assert((etl::is_trivially_move_constructible_v<Kilo>));\n assert((etl::is_nothrow_move_constructible_v<Kilo>));\n\n assert((etl::is_move_assignable_v<Kilo>));\n assert((etl::is_trivially_move_assignable_v<Kilo>));\n assert((etl::is_nothrow_move_assignable_v<Kilo>));\n\n assert((etl::is_swappable_v<Kilo>));\n assert((etl::is_nothrow_swappable_v<Kilo>));\n\n assert((!etl::has_virtual_destructor_v<Kilo>));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::addable>;\n auto const lhs = Kilo(1);\n auto const rhs = Kilo(2);\n auto const sum = lhs + rhs;\n assert((sum.raw_value() == T(3)));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::subtractable>;\n auto const lhs = Kilo(2);\n auto const rhs = Kilo(1);\n auto const sum = lhs - rhs;\n assert((sum.raw_value() == T(1)));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::multipliable>;\n auto const lhs = Kilo(2);\n auto const rhs = Kilo(2);\n auto const sum = lhs * rhs;\n assert((sum.raw_value() == T(4)));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::divisible>;\n auto const lhs = Kilo(2);\n auto const rhs = Kilo(2);\n auto const sum = lhs / rhs;\n assert((sum.raw_value() == T(1)));\n }\n\n {\n\n using Hertz = strong_type<T, struct Hertz_tag, skill::comparable>;\n auto const lhs = Hertz { typename Hertz::value_type(44) };\n auto const rhs = Hertz { typename Hertz::value_type(48) };\n\n assert((lhs.raw_value() == typename Hertz::value_type(44)));\n assert((rhs.raw_value() == typename Hertz::value_type(48)));\n\n assert((lhs < rhs));\n assert((!(lhs > rhs)));\n\n assert((lhs <= rhs));\n assert((!(lhs >= rhs)));\n\n assert((lhs != rhs));\n assert((!(lhs == rhs)));\n }\n\n return true;\n}\n\nconstexpr auto test_all() -> bool\n{\n assert(test<etl::uint8_t>());\n assert(test<etl::int8_t>());\n assert(test<etl::uint16_t>());\n assert(test<etl::int16_t>());\n assert(test<etl::uint32_t>());\n assert(test<etl::int32_t>());\n assert(test<etl::uint64_t>());\n assert(test<etl::int64_t>());\n assert(test<float>());\n assert(test<double>());\n assert(test<long double>());\n return true;\n}\n\nauto main() -> int\n{\n assert(test_all());\n static_assert(test_all());\n return 0;\n}"},"prefix":{"kind":"string","value":"\n\n#include \"etl/experimental/strong_type/strong_type.hpp\"\n\n#include \"etl/cstdint.hpp\"\n#include \"etl/type_traits.hpp\"\n\n#include \"testing/testing.hpp\"\n\nusing namespace etl::experimental;\n\ntemplate <typename T>\nconstexpr auto test() -> bool\n{\n\n {\n\n using Kilogram = strong_type<T, struct Kilogram_tag>;\n auto kilo = Kilogram {};\n kilo = Kilogram { 0 };\n\n assert((kilo.raw_value() == T { 0 }));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag>;\n\n assert((sizeof(Kilo) == sizeof(typename Kilo::value_type)));\n\n assert((etl:"},"suffix":{"kind":"string","value":"to const sum = lhs / rhs;\n assert((sum.raw_value() == T(1)));\n }\n\n {\n\n using Hertz = strong_type<T, struct Hertz_tag, skill::comparable>;\n auto const lhs = Hertz { typename Hertz::value_type(44) };\n auto const rhs = Hertz { typename Hertz::value_type(48) };\n\n assert((lhs.raw_value() == typename Hertz::value_type(44)));\n assert((rhs.raw_value() == typename Hertz::value_type(48)));\n\n assert((lhs < rhs));\n assert((!(lhs > rhs)));\n\n assert((lhs <= rhs));\n assert((!(lhs >= rhs)));\n\n assert((lhs != rhs));\n assert((!(lhs == rhs)));\n }\n\n return true;\n}\n\nconstexpr auto test_all() -> bool\n{\n assert(test<etl::uint8_t>());\n assert(test<etl::int8_t>());\n assert(test<etl::uint16_t>());\n assert(test<etl::int16_t>());\n assert(test<etl::uint32_t>());\n assert(test<etl::int32_t>());\n assert(test<etl::uint64_t>());\n assert(test<etl::int64_t>());\n assert(test<float>());\n assert(test<double>());\n assert(test<long double>());\n return true;\n}\n\nauto main() -> int\n{\n assert(test_all());\n static_assert(test_all());\n return 0;\n}"},"middle":{"kind":"string","value":":is_constructible_v<Kilo>));\n assert((etl::is_trivially_constructible_v<Kilo>));\n assert((etl::is_nothrow_constructible_v<Kilo>));\n\n assert((etl::is_destructible_v<Kilo>));\n assert((etl::is_trivially_destructible_v<Kilo>));\n assert((etl::is_nothrow_destructible_v<Kilo>));\n\n assert((etl::is_assignable_v<Kilo, Kilo>));\n assert((etl::is_trivially_assignable_v<Kilo, Kilo>));\n assert((etl::is_nothrow_assignable_v<Kilo, Kilo>));\n\n assert((etl::is_copy_constructible_v<Kilo>));\n assert((etl::is_trivially_copy_constructible_v<Kilo>));\n assert((etl::is_nothrow_copy_constructible_v<Kilo>));\n\n assert((etl::is_copy_assignable_v<Kilo>));\n assert((etl::is_trivially_copy_assignable_v<Kilo>));\n assert((etl::is_nothrow_copy_assignable_v<Kilo>));\n\n assert((etl::is_move_constructible_v<Kilo>));\n assert((etl::is_trivially_move_constructible_v<Kilo>));\n assert((etl::is_nothrow_move_constructible_v<Kilo>));\n\n assert((etl::is_move_assignable_v<Kilo>));\n assert((etl::is_trivially_move_assignable_v<Kilo>));\n assert((etl::is_nothrow_move_assignable_v<Kilo>));\n\n assert((etl::is_swappable_v<Kilo>));\n assert((etl::is_nothrow_swappable_v<Kilo>));\n\n assert((!etl::has_virtual_destructor_v<Kilo>));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::addable>;\n auto const lhs = Kilo(1);\n auto const rhs = Kilo(2);\n auto const sum = lhs + rhs;\n assert((sum.raw_value() == T(3)));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::subtractable>;\n auto const lhs = Kilo(2);\n auto const rhs = Kilo(1);\n auto const sum = lhs - rhs;\n assert((sum.raw_value() == T(1)));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::multipliable>;\n auto const lhs = Kilo(2);\n auto const rhs = Kilo(2);\n auto const sum = lhs * rhs;\n assert((sum.raw_value() == T(4)));\n }\n\n {\n\n using Kilo = strong_type<T, struct Kilo_tag, skill::divisible>;\n auto const lhs = Kilo(2);\n auto const rhs = Kilo(2);\n au"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"struct auto_reg {\n\n explicit auto_reg(name_and_tags const& sp, test_func_t func)\n\n {\n\n current_session().add_test(sp, func);\n\n }\n\n};\n\n\n\n} // namespace etl::test\n\n\n\n#endif // ETL_EXPERIMENTAL_TESTING_SESSION_HPP\n","file_path":"etl/experimental/testing/session.hpp","rank":0,"score":165426.4412585607},{"content":"struct hash<bool> {\n\n [[nodiscard]] constexpr auto operator()(bool val) const noexcept\n\n -> etl::size_t\n\n {\n\n return static_cast<etl::size_t>(val);\n\n }\n\n};\n\n/// \\group hash\n\n/// \\module Utility\n\ntemplate <>\n","file_path":"etl/_functional/hash.hpp","rank":1,"score":161952.26258103538},{"content":"struct numeric_limits<bool> {\n\n static constexpr bool is_specialized = true;\n\n\n\n static constexpr auto min() noexcept -> bool { return false; }\n\n static constexpr auto max() noexcept -> bool { return true; }\n\n static constexpr auto lowest() noexcept -> bool { return false; }\n\n\n\n static constexpr int digits = 1;\n\n static constexpr int digits10 = 0;\n\n static constexpr int max_digits10 = 0;\n\n\n\n static constexpr bool is_signed = false;\n\n static constexpr bool is_integer = true;\n\n static constexpr bool is_exact = true;\n\n static constexpr int radix = 2;\n\n static constexpr auto epsilon() noexcept -> bool { return false; }\n\n static constexpr auto round_error() noexcept -> bool { return false; }\n\n\n\n static constexpr int min_exponent = 0;\n\n static constexpr int min_exponent10 = 0;\n","file_path":"etl/_limits/numeric_limits.hpp","rank":2,"score":155808.3166183316},{"content":"struct TestStruct {\n\n};\n\n} // namespace\n\n\n\nTEMPLATE_TEST_CASE(\"template test\", \"\", int, char, float, TestStruct)\n\n{\n\n using T = TestType;\n\n if constexpr (etl::is_arithmetic_v<T>) { CHECK(T(1) > T(0)); }\n\n}\n\n#endif","file_path":"tests/experimental/testing/test_test_case.cpp","rank":3,"score":152388.2156559367},{"content":"struct negation : etl::bool_constant<!bool(B::value)> {\n\n};\n\n\n\n/// \\group negation\n\ntemplate <typename B>\n\ninline constexpr bool negation_v = !bool(B::value);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_NEGATION_HPP","file_path":"etl/_type_traits/negation.hpp","rank":4,"score":143484.7557115692},{"content":"struct uses_allocator_impl<Type, Alloc, void_t<typename Type::allocator_type>>\n\n : is_convertible<Alloc, typename Type::allocator_type>::type {\n\n};\n\n} // namespace detail\n\n\n\n/// \\brief If T has a member typedef allocator_type which is convertible from\n\n/// Alloc, the member constant value is true. Otherwise value is false.\n\ntemplate <typename Type, typename Alloc>\n","file_path":"etl/_memory/uses_allocator.hpp","rank":5,"score":141735.49435757985},{"content":"struct is_empty_helper : etl::bool_constant<sizeof(is_empty_test_struct_1<T>)\n\n == sizeof(is_empty_test_struct_2)> {\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"etl/_type_traits/is_empty.hpp","rank":6,"score":141230.06601029157},{"content":"struct test_mutex {\n\n constexpr test_mutex(bool failOnTryLock = false) noexcept\n\n : failOnTryLock_ { failOnTryLock }\n\n {\n\n }\n\n\n\n ~test_mutex() noexcept = default;\n\n\n\n auto operator=(test_mutex const&) -> test_mutex& = delete;\n\n test_mutex(test_mutex const&) = delete;\n\n\n\n auto operator=(test_mutex&&) -> test_mutex& = default;\n\n test_mutex(test_mutex&&) = default;\n\n\n\n constexpr auto lock() noexcept\n\n {\n\n if (not isLocked_) { isLocked_ = true; }\n\n }\n\n\n\n constexpr auto try_lock() noexcept -> bool\n","file_path":"tests/mutex/test_mutex.hpp","rank":7,"score":137962.20826800514},{"content":"struct MovableOnly {\n\n MovableOnly();\n\n\n\n MovableOnly(MovableOnly const&) = delete;\n\n auto operator=(MovableOnly const&) -> MovableOnly& = delete;\n\n\n\n MovableOnly(MovableOnly&&); // NOLINT\n\n auto operator=(MovableOnly&&) -> MovableOnly&; // NOLINT\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":8,"score":137922.5861796286},{"content":"struct Throws {\n\n Throws() noexcept(false); // NOLINT\n\n Throws(Throws const&) noexcept(false); // NOLINT\n\n auto operator=(Throws const&) noexcept(false) -> Throws&; // NOLINT\n\n ~Throws() noexcept(false); // NOLINT\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":9,"score":137922.5861796286},{"content":"struct Abstract {\n\n virtual auto foo() -> void = 0;\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":10,"score":137922.5861796286},{"content":"struct test_case {\n\n name_and_tags info;\n\n test_func_t func;\n\n etl::string_view type_name {};\n\n};\n\n\n\n} // namespace etl::test\n\n\n\n#endif // ETL_EXPERIMENTAL_TESTING_TEST_CASE_HPP\n","file_path":"etl/experimental/testing/test_case.hpp","rank":11,"score":135513.24556136367},{"content":"struct DummyClass {\n\n int i; // NOLINT\n\n float f; // NOLINT\n\n};\n\n\n\nunion EmptyUnion {\n\n};\n\n\n\nunion DummyUnion {\n\n int i; // NOLINT\n\n float f; // NOLINT\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":12,"score":134924.2939336276},{"content":"struct InIter {\n\n using iterator_category = etl::input_iterator_tag;\n\n using value_type = typename etl::iterator_traits<It>::value_type;\n\n using difference_type = typename etl::iterator_traits<It>::difference_type;\n\n using pointer = It;\n\n using reference = typename etl::iterator_traits<It>::reference;\n\n\n\n [[nodiscard]] constexpr auto base() const -> It { return iter_; }\n\n\n\n constexpr InIter() : iter_() { }\n\n explicit constexpr InIter(It it) : iter_(it) { }\n\n\n\n template <typename U>\n\n constexpr InIter(const InIter<U>& u) : iter_(u.iter_)\n\n {\n\n }\n\n\n\n constexpr auto operator*() const -> reference { return *iter_; }\n\n constexpr auto operator->() const -> pointer { return iter_; }\n\n\n","file_path":"tests/testing/iterator_types.hpp","rank":13,"score":134924.2939336276},{"content":"struct EmptyClass {\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":14,"score":134924.2939336276},{"content":"struct CopyAndMovable {\n\n CopyAndMovable();\n\n\n\n CopyAndMovable(CopyAndMovable const&);\n\n auto operator=(CopyAndMovable const&) -> CopyAndMovable&;\n\n\n\n CopyAndMovable(CopyAndMovable&&); // NOLINT\n\n auto operator=(CopyAndMovable&&) -> CopyAndMovable&; // NOLINT\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":15,"score":134924.2939336276},{"content":"struct VirtualDtor {\n\n virtual ~VirtualDtor() noexcept { } // NOLINT\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":16,"score":134924.2939336276},{"content":"struct TrivialDtor {\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":17,"score":134924.2939336276},{"content":"struct TriviallyConstructable {\n\n TriviallyConstructable() = default; // trivial and non-throwing\n\n int n;\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":18,"score":134924.2939336276},{"content":"struct NonTrivialDtor {\n\n ~NonTrivialDtor() { } // NOLINT\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":19,"score":132097.73278736387},{"content":"struct TrivialDtorDefaulted {\n\n ~TrivialDtorDefaulted() = default;\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":20,"score":132097.73278736387},{"content":"struct FwdIter {\n\n using iterator_category = etl::forward_iterator_tag;\n\n using value_type = typename etl::iterator_traits<Iter>::value_type;\n\n using difference_type =\n\n typename etl::iterator_traits<Iter>::difference_type;\n\n using pointer = Iter;\n\n using reference = typename etl::iterator_traits<Iter>::reference;\n\n\n\n [[nodiscard]] constexpr auto base() const -> Iter { return iter_; }\n\n\n\n constexpr FwdIter() = default;\n\n\n\n explicit constexpr FwdIter(Iter it) : iter_ { it } { }\n\n\n\n template <typename U>\n\n constexpr FwdIter(FwdIter<U> const& u) : iter_(u.iter_)\n\n {\n\n }\n\n\n\n [[nodiscard]] constexpr auto operator*() const -> reference\n","file_path":"tests/testing/iterator_types.hpp","rank":21,"score":132097.73278736387},{"content":"struct NonTriviallyConstructable {\n\n NonTriviallyConstructable(int& n) : ref { n } { }\n\n\n\n int& ref;\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":22,"score":132097.73278736387},{"content":"struct is_empty_test_struct_2 {\n\n char dummy_data;\n\n};\n\n\n\ntemplate <typename T, bool = etl::is_class<T>::value>\n","file_path":"etl/_type_traits/is_empty.hpp","rank":23,"score":129559.40647085034},{"content":"struct NonTrivialDtorMember {\n\n NonTrivialDtor member;\n\n};\n\n\n\nusing PointerToMemberObj = int VirtualDtor::*;\n\nusing PointerToConstMemberObj = int const VirtualDtor::*;\n\nusing PointerToVolatileMemberObj = int volatile VirtualDtor::*;\n\nusing PointerToCVMemberObj = int const volatile VirtualDtor::*;\n\n\n\nusing PointerToMemberFunc = void (VirtualDtor::*)();\n\nusing PointerToConstMemberFunc = void (VirtualDtor::*)() const;\n\nusing PointerToVolatileMemberFunc = void (VirtualDtor::*)() volatile;\n\nusing PointerToCVMemberFunc = void (VirtualDtor::*)() const volatile;\n\n\n\n#define TEST_IS_TRAIT(trait, type) \\\n\n do { \\\n\n assert(etl::is_base_of_v<etl::true_type, etl::trait<type>>); \\\n\n assert((etl::trait<type>::value)); \\\n\n assert((etl::TETL_PP_CONCAT(trait, _v) < type >)); \\\n\n } while (false)\n","file_path":"tests/testing/types.hpp","rank":24,"score":129427.95211605355},{"content":"struct test_is_specialized;\n\n\n\ntemplate <>\n","file_path":"tests/type_traits/type_traits.t.cpp","rank":25,"score":129427.95211605355},{"content":"struct is_signed : etl::bool_constant<T(-1) < T(0)> {\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"etl/_type_traits/is_signed.hpp","rank":26,"score":129082.01944952781},{"content":"struct is_unsigned : etl::bool_constant<T(0) < T(-1)> {\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"etl/_type_traits/is_unsigned.hpp","rank":27,"score":129082.01944952781},{"content":"struct Foo {\n\n constexpr Foo(T first, float second, bool third)\n\n : f { first }, s { second }, t { third }\n\n {\n\n }\n\n\n\n T f;\n\n float s;\n\n bool t;\n\n};\n\n} // namespace\n\n\n\ntemplate <typename T>\n\nconstexpr auto test() -> bool\n\n{\n\n\n\n {\n\n etl::tuple<T, float> t1 { T { 1 }, 2.0F };\n\n etl::ignore_unused(t1);\n\n }\n","file_path":"tests/tuple/tuple.t.cpp","rank":28,"score":126130.17441645998},{"content":"struct Counter {\n\n int& value;\n\n Counter(int& v) : value(v) { }\n\n ~Counter() { value++; }\n\n};\n\nauto some_function() -> void { }\n\n} // namespace\n\n\n\ntemplate <typename T>\n\nauto test() -> bool\n\n{\n\n // \"scalar\"\n\n {\n\n auto deleter = etl::default_delete<T>();\n\n auto* ptr = ::new T {};\n\n deleter(ptr);\n\n }\n\n\n\n // \"array\"\n\n {\n","file_path":"tests/memory/memory.t.cpp","rank":29,"score":126130.17441645998},{"content":"struct S {\n\n S(T d = T(0)) : data { d } { }\n\n\n\n S(S const& s)\n\n {\n\n data = s.data;\n\n copy = true;\n\n }\n\n\n\n S(S&& s) noexcept\n\n {\n\n data = s.data;\n\n move = true;\n\n }\n\n\n\n auto operator=(S const& s) noexcept -> S&\n\n {\n\n data = s.data;\n\n copy = true;\n\n return *this;\n","file_path":"tests/algorithm/move.t.cpp","rank":30,"score":126130.17441645998},{"content":"struct Class {\n\n constexpr Class(T n) : num(n) { }\n\n [[nodiscard]] constexpr auto get_num(T i) const -> T { return num + i; }\n\n T num;\n\n};\n\n\n\ntemplate <typename T>\n\n[[nodiscard]] constexpr auto get_num(T i) -> T\n\n{\n\n return i;\n\n}\n\n\n\n} // namespace\n\n\n\ntemplate <typename T>\n\nconstexpr auto test() -> bool\n\n{\n\n auto lambda = [](T x) -> T { return x; };\n\n assert(etl::invoke(lambda, T(1)) == T(1));\n\n assert(etl::invoke([]() { return T(42); }) == T(42));\n","file_path":"tests/functional/invoke.t.cpp","rank":31,"score":126130.17441645998},{"content":"struct is_empty_test_struct_1 : T {\n\n char dummy_data;\n\n};\n\n\n","file_path":"etl/_type_traits/is_empty.hpp","rank":32,"score":124679.78890463302},{"content":"struct DerivedFromVirtualDtor : VirtualDtor {\n\n};\n\n\n","file_path":"tests/testing/types.hpp","rank":33,"score":124546.23871814477},{"content":"struct is_typename;\n\ntemplate <typename T>\n","file_path":"etl/_type_traits/decl.hpp","rank":34,"score":124512.65465680821},{"content":"struct uses_allocator_impl : false_type {\n\n};\n\n\n\ntemplate <typename Type, typename Alloc>\n","file_path":"etl/_memory/uses_allocator.hpp","rank":35,"score":124165.57125017996},{"content":"struct DummyString {\n\n constexpr DummyString() = default;\n\n constexpr explicit DummyString(DummyStringView /*ignore*/) { }\n\n constexpr operator DummyStringView() const noexcept { return { *this }; }\n\n};\n\nconstexpr DummyStringView::DummyStringView(DummyString const& /*ignore*/) { }\n\n\n\n} // namespace\n\n\n\ntemplate <typename T>\n\nconstexpr auto test() -> bool\n\n{\n\n // explicit ctors\n\n etl::ignore_unused(etl::pair<T, DummyString>(T(0), DummyStringView()));\n\n etl::ignore_unused(etl::pair<T, DummyString>(T(0), DummyString()));\n\n etl::ignore_unused(etl::pair<T, DummyStringView>(T(0), DummyStringView()));\n\n etl::ignore_unused(etl::pair<T, DummyStringView>(T(0), DummyStringView()));\n\n\n\n using etl::is_same_v;\n\n\n","file_path":"tests/utility/pair.t.cpp","rank":36,"score":122783.71640629112},{"content":"struct totals {\n\n constexpr auto operator-(totals const& other) const -> totals;\n\n constexpr auto operator+=(totals const& other) -> totals&;\n\n\n\n [[nodiscard]] constexpr auto delta(totals const& prevtotals) const\n\n -> totals;\n\n\n\n int error { 0 };\n\n counts assertions {};\n\n counts test_cases {};\n\n};\n\n\n\nconstexpr auto counts::operator-(counts const& other) const -> counts\n\n{\n\n auto diff = counts {};\n\n diff.passed = passed - other.passed;\n\n diff.failed = failed - other.failed;\n\n diff.failed_but_ok = failed_but_ok - other.failed_but_ok;\n\n return diff;\n\n}\n","file_path":"etl/experimental/testing/totals.hpp","rank":37,"score":122783.71640629112},{"content":"struct DummyString;\n","file_path":"tests/utility/pair.t.cpp","rank":38,"score":122783.71640629112},{"content":"struct A {\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":39,"score":122783.71640629112},{"content":"struct Vertex {\n\n constexpr Vertex() = default;\n\n constexpr Vertex(T xInit, T yInit, T zInit)\n\n : x { xInit }, y { yInit }, z { zInit }\n\n {\n\n }\n\n\n\n T x {};\n\n T y {};\n\n T z {};\n\n};\n\n\n\ntemplate <typename T>\n\n[[nodiscard]] constexpr auto operator==(\n\n Vertex<T> const& lhs, Vertex<T> const& rhs) -> bool\n\n{\n\n return (lhs.x == rhs.x) && (lhs.y == rhs.y) && (lhs.z == rhs.z);\n\n}\n\n\n\ntemplate <typename T>\n","file_path":"tests/vector/static_vector.t.cpp","rank":40,"score":122783.71640629112},{"content":"struct section {\n\n explicit section(section_info const& info, bool shouldExecute)\n\n : info_ { info }, shouldExecute_ { shouldExecute }\n\n {\n\n }\n\n\n\n [[nodiscard]] constexpr auto info() const noexcept -> section_info const&\n\n {\n\n return info_;\n\n }\n\n\n\n explicit operator bool() const noexcept { return shouldExecute_; }\n\n\n\nprivate:\n\n section_info info_;\n\n counts assertions_ {};\n\n bool shouldExecute_;\n\n};\n\n\n\n} // namespace etl::test\n\n\n\n#endif // ETL_EXPERIMENTAL_TESTING_SECTION_HPP\n","file_path":"etl/experimental/testing/section.hpp","rank":41,"score":122783.71640629112},{"content":"struct session {\n\n template <etl::size_t Capacity>\n\n explicit constexpr session(\n\n session_buffer<Capacity>& buffer, etl::string_view name);\n\n\n\n [[nodiscard]] constexpr auto name() const noexcept -> etl::string_view;\n\n\n\n [[nodiscard]] constexpr auto begin() -> test_case*;\n\n [[nodiscard]] constexpr auto end() -> test_case*;\n\n\n\n [[nodiscard]] auto run_all() -> int;\n\n\n\n constexpr auto add_test(name_and_tags const& spec, test_func_t func,\n\n etl::string_view typeName = {}) -> void;\n\n\n\n auto current_test(test_case* tc) -> void;\n\n\n\n auto pass_assertion(source_line_info const& src, char const* expr) -> void;\n\n auto fail_assertion(\n\n source_line_info const& src, char const* expr, bool terminate) -> void;\n","file_path":"etl/experimental/testing/session.hpp","rank":42,"score":122783.71640629112},{"content":"struct counts {\n\n constexpr auto operator-(counts const& other) const -> counts;\n\n constexpr auto operator+=(counts const& other) -> counts&;\n\n\n\n [[nodiscard]] constexpr auto total() const -> etl::uint16_t;\n\n [[nodiscard]] constexpr auto all_passed() const -> bool;\n\n [[nodiscard]] constexpr auto all_ok() const -> bool;\n\n\n\n etl::uint16_t passed { 0 };\n\n etl::uint16_t failed { 0 };\n\n etl::uint16_t failed_but_ok { 0 };\n\n};\n\n\n","file_path":"etl/experimental/testing/totals.hpp","rank":43,"score":122783.71640629112},{"content":"struct test_is_specialized<Foo<float>> {\n\n};\n\n\n","file_path":"tests/type_traits/type_traits.t.cpp","rank":44,"score":120128.65133969224},{"content":"struct D {\n\n virtual ~D() = default;\n\n};\n\n\n\nunion E {\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":45,"score":119664.7943170293},{"content":"struct C {\n\n [[maybe_unused]] static int m;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":46,"score":119664.7943170293},{"content":"struct IsFinal_A {\n\n int m;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":47,"score":119664.7943170293},{"content":"struct null_clock {\n\n using rep = T;\n\n using period = etl::ratio<1>;\n\n using duration = etl::chrono::duration<rep, period>;\n\n using time_point = etl::chrono::time_point<null_clock>;\n\n bool const is_steady = false;\n\n\n\n [[nodiscard]] constexpr auto now() noexcept -> time_point\n\n {\n\n return time_point {};\n\n }\n\n};\n\n\n\ntemplate <typename T>\n\nconstexpr auto test() -> bool\n\n{\n\n auto null = etl::chrono::time_point<null_clock<T>> {};\n\n assert(null.time_since_epoch().count() == T { 0 });\n\n return true;\n\n}\n","file_path":"tests/chrono/time_point.t.cpp","rank":48,"score":119664.7943170293},{"content":"struct IsPolymorphic_A {\n\n int m;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":49,"score":119664.7943170293},{"content":"struct IsAbstract_A {\n\n int m;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":50,"score":119664.7943170293},{"content":"struct Foo {\n\n T i {};\n\n};\n\n\n","file_path":"tests/type_traits/type_traits.t.cpp","rank":51,"score":119664.7943170293},{"content":"struct section_info {\n\n constexpr section_info(source_line_info const& sli, etl::string_view n)\n\n : name(n), line_info(sli)\n\n {\n\n }\n\n\n\n etl::string_view name;\n\n source_line_info line_info;\n\n};\n\n\n","file_path":"etl/experimental/testing/section.hpp","rank":52,"score":119664.7943170293},{"content":"struct not_specialized {\n\n};\n\n\n\ntemplate <typename T>\n\nconstexpr auto test_identity() -> bool\n\n{\n\n using etl::is_same_v;\n\n using etl::type_identity;\n\n using etl::type_identity_t;\n\n\n\n assert((is_same_v<T, typename type_identity<T>::type>));\n\n assert((is_same_v<T, type_identity_t<T>>));\n\n\n\n // clang-format off\n\n if constexpr (!etl::is_function_v<T>) {\n\n assert((is_same_v<T const, typename type_identity<T const>::type>));\n\n assert((is_same_v<T volatile, typename type_identity<T volatile>::type>));\n\n assert((is_same_v<T const volatile, typename type_identity<T const volatile>::type>));\n\n\n\n assert((is_same_v<T const, type_identity_t<T const>>));\n","file_path":"tests/type_traits/type_traits.t.cpp","rank":53,"score":119664.7943170293},{"content":"struct session_stats {\n\n etl::uint16_t num_test_cases { 0 };\n\n etl::uint16_t num_test_cases_failed { 0 };\n\n\n\n etl::uint16_t num_assertions { 0 };\n\n etl::uint16_t num_assertions_failed { 0 };\n\n};\n\n\n\ntemplate <etl::size_t Capacity>\n\nusing session_buffer = etl::array<test_case, Capacity>;\n\n\n","file_path":"etl/experimental/testing/session.hpp","rank":54,"score":119664.7943170293},{"content":"struct example_task {\n\n auto run() -> void\n\n {\n\n auto loopControl = LoopType {};\n\n while (loopControl()) { rtos::this_task::yield(); }\n\n\n\n rtos::delete_task(nullptr);\n\n }\n\n};\n\n\n\nauto test_all() -> bool\n\n{\n\n\n\n auto task = example_task<rtos::once> {};\n\n\n\n rtos::create_task(task, \"test\", 255);\n\n rtos::start_scheduler();\n\n\n\n // Run would normally be called by rtos::start_scheduler(). Only used\n\n // for stubs.\n\n rtos::rtos_task<example_task<rtos::once>>(static_cast<void*>(&task));\n\n\n\n return true;\n\n}\n\n\n\nauto main() -> int\n\n{\n\n assert(test_all());\n\n return 0;\n\n}","file_path":"tests/experimental/freertos/task.t.cpp","rank":55,"score":119664.7943170293},{"content":"struct B {\n\n int m;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":56,"score":119664.7943170293},{"content":"struct IDS {\n\n};\n\ntemplate <typename T>\n","file_path":"tests/type_traits/type_traits.t.cpp","rank":57,"score":119664.7943170293},{"content":"struct DummyStringView {\n\n constexpr DummyStringView() = default;\n\n constexpr DummyStringView(DummyString const& /*ignore*/);\n\n};\n","file_path":"tests/utility/pair.t.cpp","rank":58,"score":119664.7943170293},{"content":"enum struct ScopedEnum { foo, bar, baz };\n","file_path":"tests/testing/types.hpp","rank":59,"score":116832.53796450992},{"content":"struct result_disposition {\n\n enum flags : unsigned char {\n\n normal = 0x01,\n\n continue_on_failure = 0x02, // Failures test, but execution continues\n\n false_test = 0x04, // Prefix expression with !\n\n suppress_fail = 0x08 // Failures do not fail the test\n\n };\n\n};\n\n\n\n} // namespace etl::test\n\n\n\n#endif // ETL_EXPERIMENTAL_TESTING_RESULT_DUSPOSITION_HPP\n","file_path":"etl/experimental/testing/result_disposition.hpp","rank":60,"score":116750.96484768388},{"content":"struct name_and_tags {\n\n name_and_tags(etl::string_view const& n = etl::string_view(),\n\n etl::string_view const& t = etl::string_view()) noexcept\n\n : name(n), tags(t)\n\n {\n\n }\n\n etl::string_view name;\n\n etl::string_view tags;\n\n};\n\n\n\n} // namespace etl::test\n\n\n\n#endif // ETL_EXPERIMENTAL_TESTING_NAME_AND_TAGS_HPP\n","file_path":"etl/experimental/testing/name_and_tags.hpp","rank":61,"score":116750.96484768388},{"content":"struct IsFinal_D {\n\n virtual ~IsFinal_D() = default;\n\n};\n\n\n\nunion IsFinal_E final {\n\n char data1;\n\n float data2;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":62,"score":116750.96484768388},{"content":"struct IsAbstract_B {\n\n virtual void foo() { }\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":63,"score":116750.96484768388},{"content":"struct assertion_handler {\n\n assertion_handler(source_line_info const& src,\n\n result_disposition::flags flags, char const* expr, bool result)\n\n : src_ { src }\n\n , flags_ { flags }\n\n , expr_ { expr }\n\n , res_ { has_flag(result_disposition::false_test) ? !result : result }\n\n {\n\n if (res_ || has_flag(result_disposition::suppress_fail)) {\n\n current_session().pass_assertion(src_, expr_);\n\n }\n\n if (!res_ && has_flag(result_disposition::normal)) {\n\n current_session().fail_assertion(src_, expr_, true);\n\n }\n\n if (!res_ && has_flag(result_disposition::continue_on_failure)) {\n\n current_session().fail_assertion(src_, expr_, false);\n\n }\n\n }\n\n\n\nprivate:\n","file_path":"etl/experimental/testing/assertion_handler.hpp","rank":64,"score":116750.96484768388},{"content":"struct IsPolymorphic_B {\n\n virtual void foo();\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":65,"score":116750.96484768388},{"content":"struct IsFinal_B {\n\n virtual void foo(); // NOLINT\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":66,"score":116750.96484768388},{"content":"struct IsAbstract_C {\n\n virtual void foo() = 0;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":67,"score":116750.96484768388},{"content":"struct IsPolymorphic_D {\n\n virtual ~IsPolymorphic_D() = default;\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":68,"score":116750.96484768388},{"content":"struct uses_allocator : detail::uses_allocator_impl<Type, Alloc>::type {\n\n};\n\n\n\n/// \\brief If T has a member typedef allocator_type which is convertible from\n\n/// Alloc, the member constant value is true. Otherwise value is false.\n\ntemplate <typename Type, typename Alloc>\n\ninline constexpr auto uses_allocator_v = uses_allocator<Type, Alloc>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_MEMORY_USES_ALLOCATOR_HPP","file_path":"etl/_memory/uses_allocator.hpp","rank":69,"score":116198.55319805813},{"content":"enum struct ScopedEnumWithType : long { v1, v2 };\n\n\n","file_path":"tests/testing/types.hpp","rank":70,"score":114559.60252783047},{"content":"struct source_line_info {\n\n source_line_info() = delete;\n\n\n\n constexpr source_line_info(char const* f, etl::size_t l) noexcept\n\n : file { f }, line { l }\n\n {\n\n }\n\n\n\n char const* file;\n\n etl::size_t line;\n\n};\n\n\n\n} // namespace etl::test\n\n\n\n#define TEST_DETAIL_SOURCE_LINE_INFO \\\n\n etl::test::source_line_info(__FILE__, static_cast<etl::size_t>(__LINE__))\n\n\n\n#endif // ETL_EXPERIMENTAL_TESTING_SOURCE_LINE_INFO_HPP\n","file_path":"etl/experimental/testing/source_line_info.hpp","rank":71,"score":111462.65814309189},{"content":"struct IsAbstract_D : IsAbstract_C {\n\n};\n\n\n\n} // namespace\n\n\n\nconstexpr auto test_all() -> bool\n\n{\n\n using etl::make_signed_t;\n\n TEST_TRAIT_TYPE(make_signed, etl::int8_t, etl::int8_t);\n\n TEST_TRAIT_TYPE(make_signed, etl::int16_t, etl::int16_t);\n\n TEST_TRAIT_TYPE(make_signed, etl::int32_t, etl::int32_t);\n\n TEST_TRAIT_TYPE(make_signed, etl::int64_t, etl::int64_t);\n\n\n\n TEST_TRAIT_TYPE(make_signed, etl::uint8_t, etl::int8_t);\n\n TEST_TRAIT_TYPE(make_signed, etl::uint16_t, etl::int16_t);\n\n TEST_TRAIT_TYPE(make_signed, etl::uint32_t, etl::int32_t);\n\n TEST_TRAIT_TYPE(make_signed, etl::uint64_t, etl::int64_t);\n\n\n\n TEST_TRAIT_TYPE(make_signed, signed char, signed char);\n\n TEST_TRAIT_TYPE(make_signed, short, short);\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":72,"score":109107.15271663794},{"content":"struct IsPolymorphic_C : IsPolymorphic_B {\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":73,"score":109107.15271663794},{"content":"struct is_specialized<Template, T, etl::void_t<decltype(Template<T> {})>>\n\n : etl::true_type {\n\n};\n\n\n\ntemplate <template <typename...> typename Template, typename T,\n\n typename Tag = void>\n\ninline constexpr bool is_specialized_v\n\n = etl::is_specialized<Template, T, Tag>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_SPECIALIZED_HPP","file_path":"etl/_type_traits/is_specialized.hpp","rank":74,"score":108589.50230525926},{"content":"struct IsFinal_C final : IsFinal_B {\n\n};\n\n\n","file_path":"tests/type_traits/type_traits2.t.cpp","rank":75,"score":104677.15892939796},{"content":"struct disjunction : etl::bool_constant<(B::value || ...)> {\n\n};\n\n\n\n/// \\group disjunction\n\ntemplate <typename... B>\n\ninline constexpr bool disjunction_v = (B::value || ...);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_DISJUNCTION_HPP","file_path":"etl/_type_traits/disjunction.hpp","rank":76,"score":102818.99324033948},{"content":"struct conjunction : etl::bool_constant<(B::value && ...)> {\n\n};\n\n\n\n/// \\group conjunction\n\ntemplate <typename... B>\n\ninline constexpr bool conjunction_v = (B::value && ...);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_CONJUNCTION_HPP","file_path":"etl/_type_traits/conjunction.hpp","rank":77,"score":102818.99324033948},{"content":"struct is_placeholder : integral_constant<int, 0> {\n\n};\n\n\n\nnamespace detail {\n\ntemplate <int N>\n","file_path":"etl/_functional/placeholder.hpp","rank":78,"score":102514.73842119373},{"content":"struct is_final : bool_constant<TETL_BUILTIN_IS_FINAL(T)> {\n\n};\n\n\n\n/// \\group is_final\n\ntemplate <typename T>\n\ninline constexpr bool is_final_v = is_final<T>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_FINAL_HPP","file_path":"etl/_type_traits/is_final.hpp","rank":79,"score":102049.79497284269},{"content":"struct is_union : bool_constant<TETL_BUILTIN_IS_UNION(T)> {\n\n};\n\n\n\n/// \\group is_union\n\ntemplate <typename T>\n\ninline constexpr bool is_union_v = TETL_BUILTIN_IS_UNION(T);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_UNION_HPP","file_path":"etl/_type_traits/is_union.hpp","rank":80,"score":102049.79497284269},{"content":"struct is_polymorphic : bool_constant<TETL_BUILTIN_IS_POLYMORPHIC(T)> {\n\n};\n\n\n\n/// \\group is_polymorphic\n\ntemplate <typename T>\n\ninline constexpr bool is_polymorphic_v = is_polymorphic<T>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_POLYMORPHIC_HPP","file_path":"etl/_type_traits/is_polymorphic.hpp","rank":81,"score":102049.79497284269},{"content":"struct is_abstract : bool_constant<TETL_BUILTIN_IS_ABSTRACT(T)> {\n\n};\n\n\n\n/// \\group is_abstract\n\ntemplate <typename T>\n\ninline constexpr bool is_abstract_v = TETL_BUILTIN_IS_ABSTRACT(T);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_ABSTRACT_HPP","file_path":"etl/_type_traits/is_abstract.hpp","rank":82,"score":102049.79497284269},{"content":"struct is_enum : bool_constant<TETL_BUILTIN_IS_ENUM(T)> {\n\n};\n\n\n\n/// \\group is_enum\n\ntemplate <typename T>\n\ninline constexpr bool is_enum_v = is_enum<T>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_ENUM_HPP","file_path":"etl/_type_traits/is_enum.hpp","rank":83,"score":102049.79497284269},{"content":"struct rank : integral_constant<size_t, 0> {\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"etl/_type_traits/rank.hpp","rank":84,"score":101143.54081255346},{"content":"/// \\copyright Tobias Hienzsch 2019-2021\n\n/// Distributed under the Boost Software License, Version 1.0.\n\n/// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt\n\n\n\n#include \"etl/algorithm.hpp\"\n\n\n\n#include \"etl/array.hpp\"\n\n#include \"etl/cctype.hpp\"\n\n#include \"etl/cstdint.hpp\"\n\n\n\n#include \"testing/testing.hpp\"\n\n\n\ntemplate <typename T>\n\nconstexpr auto test() -> bool\n\n{\n\n\n\n {\n\n auto const v1 = etl::array { 'a', 'b', 'c', 'f', 'h', 'x' };\n\n auto const v2 = etl::array { 'a', 'b', 'c' };\n\n auto const v3 = etl::array { 'a', 'c' };\n","file_path":"tests/algorithm/includes.t.cpp","rank":85,"score":100065.1599754299},{"content":" auto const v3 = etl::array { T(1), T(3) };\n\n auto const v4 = etl::array { T(1), T(1), T(2) };\n\n auto const v5 = etl::array { T(7) };\n\n auto const v6 = etl::array { T(1), T(3), T(7) };\n\n\n\n assert(etl::includes(begin(v1), end(v1), v2.begin(), v2.end()));\n\n assert(etl::includes(begin(v1), end(v1), v3.begin(), v3.end()));\n\n\n\n assert(!(etl::includes(begin(v1), end(v1), v4.begin(), v4.end())));\n\n assert(!(etl::includes(begin(v1), end(v1), v5.begin(), v5.end())));\n\n assert(!(etl::includes(begin(v1), end(v1), v6.begin(), v6.end())));\n\n }\n\n\n\n return true;\n\n}\n\n\n\nconstexpr auto test_all() -> bool\n\n{\n\n assert(test<etl::uint8_t>());\n\n assert(test<etl::int8_t>());\n","file_path":"tests/algorithm/includes.t.cpp","rank":86,"score":100060.03858368316},{"content":" auto const v4 = etl::array { 'a', 'a', 'b' };\n\n auto const v5 = etl::array { 'g' };\n\n auto const v6 = etl::array { 'a', 'c', 'g' };\n\n auto const v7 = etl::array { 'A', 'B', 'C' };\n\n\n\n auto noCase\n\n = [](char a, char b) { return etl::tolower(a) < etl::tolower(b); };\n\n\n\n assert(etl::includes(begin(v1), end(v1), v2.begin(), v2.end()));\n\n assert(etl::includes(begin(v1), end(v1), v3.begin(), v3.end()));\n\n assert(etl::includes(begin(v1), end(v1), v7.begin(), v7.end(), noCase));\n\n\n\n assert(!(etl::includes(begin(v1), end(v1), v4.begin(), v4.end())));\n\n assert(!(etl::includes(begin(v1), end(v1), v5.begin(), v5.end())));\n\n assert(!(etl::includes(begin(v1), end(v1), v6.begin(), v6.end())));\n\n }\n\n\n\n {\n\n auto const v1 = etl::array { T(1), T(2), T(3), T(6), T(8), T(24) };\n\n auto const v2 = etl::array { T(1), T(2), T(3) };\n","file_path":"tests/algorithm/includes.t.cpp","rank":87,"score":100051.38070098759},{"content":" assert(test<etl::uint16_t>());\n\n assert(test<etl::int16_t>());\n\n assert(test<etl::uint32_t>());\n\n assert(test<etl::int32_t>());\n\n assert(test<etl::uint64_t>());\n\n assert(test<etl::int64_t>());\n\n assert(test<float>());\n\n assert(test<double>());\n\n\n\n return true;\n\n}\n\n\n\nauto main() -> int\n\n{\n\n assert(test_all());\n\n static_assert(test_all());\n\n return 0;\n\n}","file_path":"tests/algorithm/includes.t.cpp","rank":88,"score":100050.62886903934},{"content":"struct is_compound : etl::bool_constant<!etl::is_fundamental_v<T>> {\n\n};\n\n\n\ntemplate <typename T>\n\ninline constexpr bool is_compound_v = !etl::is_fundamental_v<T>;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_COMPOUND_HPP","file_path":"etl/_type_traits/is_compound.hpp","rank":89,"score":99150.07834813758},{"content":"struct ratio_not_equal : bool_constant<!ratio_equal_v<R1, R2>> {\n\n};\n\n\n\ntemplate <typename R1, typename R2>\n\ninline constexpr bool ratio_not_equal_v = ratio_not_equal<R1, R2>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_RATIO_NOT_EQUAL_HPP","file_path":"etl/_ratio/ratio_not_equal.hpp","rank":90,"score":98332.0233744253},{"content":"struct is_class : etl::bool_constant<TETL_BUILTIN_IS_CLASS(T)> {\n\n};\n\n\n\n/// \\group is_class\n\ntemplate <typename T>\n\ninline constexpr bool is_class_v = TETL_BUILTIN_IS_CLASS(T);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_CLASS_HPP","file_path":"etl/_type_traits/is_class.hpp","rank":91,"score":98332.0233744253},{"content":"struct extent<T[], 0> : etl::integral_constant<etl::size_t, 0> {\n\n};\n\n\n\n/// \\exclude\n\ntemplate <typename T, unsigned N>\n","file_path":"etl/_type_traits/extent.hpp","rank":92,"score":96595.34940397457},{"content":"struct type_pack_element_impl<0, T, Ts...> {\n\n using type = T;\n\n};\n\n} // namespace detail\n\n\n\ntemplate <etl::size_t I, typename... Ts>\n","file_path":"etl/_type_traits/type_pack_element.hpp","rank":93,"score":96433.11527599636},{"content":"struct is_trivially_copyable : etl::bool_constant<__is_trivially_copyable(T)> {\n\n};\n\n\n\ntemplate <typename T>\n\ninline constexpr bool is_trivially_copyable_v = __is_trivially_copyable(T);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_TRIVIALLY_COPYABLE_HPP","file_path":"etl/_type_traits/is_trivially_copyable.hpp","rank":94,"score":96273.36606542752},{"content":"struct is_standard_layout : bool_constant<TETL_BUILTIN_IS_STANDARD_LAYOUT(T)> {\n\n};\n\n\n\ntemplate <typename T>\n\ninline constexpr bool is_standard_layout_v = is_standard_layout<T>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_STANDARD_LAYOUT_HPP","file_path":"etl/_type_traits/is_standard_layout.hpp","rank":95,"score":95864.23020059968},{"content":"struct is_function : bool_constant<!is_const_v<T const> && !is_reference_v<T>> {\n\n};\n\n\n\n#if defined(TETL_MSVC)\n\n // Qualifier applied to function has no meaning\n\n #pragma warning(default : 4180)\n\n#endif\n\n\n\n/// \\brief Checks whether T is a function type. Types like etl::function,\n\n/// lambdas, classes with overloaded operator() and pointers to functions don't\n\n/// count as function types. Provides the member constant value which is equal\n\n/// to true, if T is a function type. Otherwise, value is equal to false.\n\n///\n\n/// \\details The behavior of a program that adds specializations for is_function\n\n/// or is_function_v is undefined.\n\n/// \\group is_function\n\ntemplate <typename T>\n\ninline constexpr bool is_function_v = is_function<T>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_FUNCTION_HPP","file_path":"etl/_type_traits/is_function.hpp","rank":96,"score":95761.19877791686},{"content":"struct is_assignable : etl::bool_constant<TETL_BUILTIN_IS_ASSIGNABLE(T, U)> {\n\n};\n\n\n\ntemplate <typename T, typename U>\n\ninline constexpr bool is_assignable_v = TETL_BUILTIN_IS_ASSIGNABLE(T, U);\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_ASSIGNABLE_HPP","file_path":"etl/_type_traits/is_assignable.hpp","rank":97,"score":94913.12570793407},{"content":"struct is_pointer : detail::is_pointer_helper<typename remove_cv<T>::type> {\n\n};\n\n\n\n/// \\group is_pointer\n\ntemplate <typename T>\n\ninline constexpr bool is_pointer_v = is_pointer<T>::value;\n\n\n\n} // namespace etl\n\n\n\n#endif // TETL_TYPE_TRAITS_IS_POINTER_HPP","file_path":"etl/_type_traits/is_pointer.hpp","rank":98,"score":93732.16380776443},{"content":"struct nothrow_constructible_impl<true, T> : bool_constant<noexcept(T())> {\n\n};\n\n\n\ntemplate <typename T, size_t Size>\n","file_path":"etl/_type_traits/is_nothrow_constructible.hpp","rank":99,"score":92964.51357589457}],"string":"[\n {\n \"content\": \"struct auto_reg {\\n\\n explicit auto_reg(name_and_tags const& sp, test_func_t func)\\n\\n {\\n\\n current_session().add_test(sp, func);\\n\\n }\\n\\n};\\n\\n\\n\\n} // namespace etl::test\\n\\n\\n\\n#endif // ETL_EXPERIMENTAL_TESTING_SESSION_HPP\\n\",\n \"file_path\": \"etl/experimental/testing/session.hpp\",\n \"rank\": 0,\n \"score\": 165426.4412585607\n },\n {\n \"content\": \"struct hash<bool> {\\n\\n [[nodiscard]] constexpr auto operator()(bool val) const noexcept\\n\\n -> etl::size_t\\n\\n {\\n\\n return static_cast<etl::size_t>(val);\\n\\n }\\n\\n};\\n\\n/// \\\\group hash\\n\\n/// \\\\module Utility\\n\\ntemplate <>\\n\",\n \"file_path\": \"etl/_functional/hash.hpp\",\n \"rank\": 1,\n \"score\": 161952.26258103538\n },\n {\n \"content\": \"struct numeric_limits<bool> {\\n\\n static constexpr bool is_specialized = true;\\n\\n\\n\\n static constexpr auto min() noexcept -> bool { return false; }\\n\\n static constexpr auto max() noexcept -> bool { return true; }\\n\\n static constexpr auto lowest() noexcept -> bool { return false; }\\n\\n\\n\\n static constexpr int digits = 1;\\n\\n static constexpr int digits10 = 0;\\n\\n static constexpr int max_digits10 = 0;\\n\\n\\n\\n static constexpr bool is_signed = false;\\n\\n static constexpr bool is_integer = true;\\n\\n static constexpr bool is_exact = true;\\n\\n static constexpr int radix = 2;\\n\\n static constexpr auto epsilon() noexcept -> bool { return false; }\\n\\n static constexpr auto round_error() noexcept -> bool { return false; }\\n\\n\\n\\n static constexpr int min_exponent = 0;\\n\\n static constexpr int min_exponent10 = 0;\\n\",\n \"file_path\": \"etl/_limits/numeric_limits.hpp\",\n \"rank\": 2,\n \"score\": 155808.3166183316\n },\n {\n \"content\": \"struct TestStruct {\\n\\n};\\n\\n} // namespace\\n\\n\\n\\nTEMPLATE_TEST_CASE(\\\"template test\\\", \\\"\\\", int, char, float, TestStruct)\\n\\n{\\n\\n using T = TestType;\\n\\n if constexpr (etl::is_arithmetic_v<T>) { CHECK(T(1) > T(0)); }\\n\\n}\\n\\n#endif\",\n \"file_path\": \"tests/experimental/testing/test_test_case.cpp\",\n \"rank\": 3,\n \"score\": 152388.2156559367\n },\n {\n \"content\": \"struct negation : etl::bool_constant<!bool(B::value)> {\\n\\n};\\n\\n\\n\\n/// \\\\group negation\\n\\ntemplate <typename B>\\n\\ninline constexpr bool negation_v = !bool(B::value);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_NEGATION_HPP\",\n \"file_path\": \"etl/_type_traits/negation.hpp\",\n \"rank\": 4,\n \"score\": 143484.7557115692\n },\n {\n \"content\": \"struct uses_allocator_impl<Type, Alloc, void_t<typename Type::allocator_type>>\\n\\n : is_convertible<Alloc, typename Type::allocator_type>::type {\\n\\n};\\n\\n} // namespace detail\\n\\n\\n\\n/// \\\\brief If T has a member typedef allocator_type which is convertible from\\n\\n/// Alloc, the member constant value is true. Otherwise value is false.\\n\\ntemplate <typename Type, typename Alloc>\\n\",\n \"file_path\": \"etl/_memory/uses_allocator.hpp\",\n \"rank\": 5,\n \"score\": 141735.49435757985\n },\n {\n \"content\": \"struct is_empty_helper : etl::bool_constant<sizeof(is_empty_test_struct_1<T>)\\n\\n == sizeof(is_empty_test_struct_2)> {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"etl/_type_traits/is_empty.hpp\",\n \"rank\": 6,\n \"score\": 141230.06601029157\n },\n {\n \"content\": \"struct test_mutex {\\n\\n constexpr test_mutex(bool failOnTryLock = false) noexcept\\n\\n : failOnTryLock_ { failOnTryLock }\\n\\n {\\n\\n }\\n\\n\\n\\n ~test_mutex() noexcept = default;\\n\\n\\n\\n auto operator=(test_mutex const&) -> test_mutex& = delete;\\n\\n test_mutex(test_mutex const&) = delete;\\n\\n\\n\\n auto operator=(test_mutex&&) -> test_mutex& = default;\\n\\n test_mutex(test_mutex&&) = default;\\n\\n\\n\\n constexpr auto lock() noexcept\\n\\n {\\n\\n if (not isLocked_) { isLocked_ = true; }\\n\\n }\\n\\n\\n\\n constexpr auto try_lock() noexcept -> bool\\n\",\n \"file_path\": \"tests/mutex/test_mutex.hpp\",\n \"rank\": 7,\n \"score\": 137962.20826800514\n },\n {\n \"content\": \"struct MovableOnly {\\n\\n MovableOnly();\\n\\n\\n\\n MovableOnly(MovableOnly const&) = delete;\\n\\n auto operator=(MovableOnly const&) -> MovableOnly& = delete;\\n\\n\\n\\n MovableOnly(MovableOnly&&); // NOLINT\\n\\n auto operator=(MovableOnly&&) -> MovableOnly&; // NOLINT\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 8,\n \"score\": 137922.5861796286\n },\n {\n \"content\": \"struct Throws {\\n\\n Throws() noexcept(false); // NOLINT\\n\\n Throws(Throws const&) noexcept(false); // NOLINT\\n\\n auto operator=(Throws const&) noexcept(false) -> Throws&; // NOLINT\\n\\n ~Throws() noexcept(false); // NOLINT\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 9,\n \"score\": 137922.5861796286\n },\n {\n \"content\": \"struct Abstract {\\n\\n virtual auto foo() -> void = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 10,\n \"score\": 137922.5861796286\n },\n {\n \"content\": \"struct test_case {\\n\\n name_and_tags info;\\n\\n test_func_t func;\\n\\n etl::string_view type_name {};\\n\\n};\\n\\n\\n\\n} // namespace etl::test\\n\\n\\n\\n#endif // ETL_EXPERIMENTAL_TESTING_TEST_CASE_HPP\\n\",\n \"file_path\": \"etl/experimental/testing/test_case.hpp\",\n \"rank\": 11,\n \"score\": 135513.24556136367\n },\n {\n \"content\": \"struct DummyClass {\\n\\n int i; // NOLINT\\n\\n float f; // NOLINT\\n\\n};\\n\\n\\n\\nunion EmptyUnion {\\n\\n};\\n\\n\\n\\nunion DummyUnion {\\n\\n int i; // NOLINT\\n\\n float f; // NOLINT\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 12,\n \"score\": 134924.2939336276\n },\n {\n \"content\": \"struct InIter {\\n\\n using iterator_category = etl::input_iterator_tag;\\n\\n using value_type = typename etl::iterator_traits<It>::value_type;\\n\\n using difference_type = typename etl::iterator_traits<It>::difference_type;\\n\\n using pointer = It;\\n\\n using reference = typename etl::iterator_traits<It>::reference;\\n\\n\\n\\n [[nodiscard]] constexpr auto base() const -> It { return iter_; }\\n\\n\\n\\n constexpr InIter() : iter_() { }\\n\\n explicit constexpr InIter(It it) : iter_(it) { }\\n\\n\\n\\n template <typename U>\\n\\n constexpr InIter(const InIter<U>& u) : iter_(u.iter_)\\n\\n {\\n\\n }\\n\\n\\n\\n constexpr auto operator*() const -> reference { return *iter_; }\\n\\n constexpr auto operator->() const -> pointer { return iter_; }\\n\\n\\n\",\n \"file_path\": \"tests/testing/iterator_types.hpp\",\n \"rank\": 13,\n \"score\": 134924.2939336276\n },\n {\n \"content\": \"struct EmptyClass {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 14,\n \"score\": 134924.2939336276\n },\n {\n \"content\": \"struct CopyAndMovable {\\n\\n CopyAndMovable();\\n\\n\\n\\n CopyAndMovable(CopyAndMovable const&);\\n\\n auto operator=(CopyAndMovable const&) -> CopyAndMovable&;\\n\\n\\n\\n CopyAndMovable(CopyAndMovable&&); // NOLINT\\n\\n auto operator=(CopyAndMovable&&) -> CopyAndMovable&; // NOLINT\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 15,\n \"score\": 134924.2939336276\n },\n {\n \"content\": \"struct VirtualDtor {\\n\\n virtual ~VirtualDtor() noexcept { } // NOLINT\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 16,\n \"score\": 134924.2939336276\n },\n {\n \"content\": \"struct TrivialDtor {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 17,\n \"score\": 134924.2939336276\n },\n {\n \"content\": \"struct TriviallyConstructable {\\n\\n TriviallyConstructable() = default; // trivial and non-throwing\\n\\n int n;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 18,\n \"score\": 134924.2939336276\n },\n {\n \"content\": \"struct NonTrivialDtor {\\n\\n ~NonTrivialDtor() { } // NOLINT\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 19,\n \"score\": 132097.73278736387\n },\n {\n \"content\": \"struct TrivialDtorDefaulted {\\n\\n ~TrivialDtorDefaulted() = default;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 20,\n \"score\": 132097.73278736387\n },\n {\n \"content\": \"struct FwdIter {\\n\\n using iterator_category = etl::forward_iterator_tag;\\n\\n using value_type = typename etl::iterator_traits<Iter>::value_type;\\n\\n using difference_type =\\n\\n typename etl::iterator_traits<Iter>::difference_type;\\n\\n using pointer = Iter;\\n\\n using reference = typename etl::iterator_traits<Iter>::reference;\\n\\n\\n\\n [[nodiscard]] constexpr auto base() const -> Iter { return iter_; }\\n\\n\\n\\n constexpr FwdIter() = default;\\n\\n\\n\\n explicit constexpr FwdIter(Iter it) : iter_ { it } { }\\n\\n\\n\\n template <typename U>\\n\\n constexpr FwdIter(FwdIter<U> const& u) : iter_(u.iter_)\\n\\n {\\n\\n }\\n\\n\\n\\n [[nodiscard]] constexpr auto operator*() const -> reference\\n\",\n \"file_path\": \"tests/testing/iterator_types.hpp\",\n \"rank\": 21,\n \"score\": 132097.73278736387\n },\n {\n \"content\": \"struct NonTriviallyConstructable {\\n\\n NonTriviallyConstructable(int& n) : ref { n } { }\\n\\n\\n\\n int& ref;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 22,\n \"score\": 132097.73278736387\n },\n {\n \"content\": \"struct is_empty_test_struct_2 {\\n\\n char dummy_data;\\n\\n};\\n\\n\\n\\ntemplate <typename T, bool = etl::is_class<T>::value>\\n\",\n \"file_path\": \"etl/_type_traits/is_empty.hpp\",\n \"rank\": 23,\n \"score\": 129559.40647085034\n },\n {\n \"content\": \"struct NonTrivialDtorMember {\\n\\n NonTrivialDtor member;\\n\\n};\\n\\n\\n\\nusing PointerToMemberObj = int VirtualDtor::*;\\n\\nusing PointerToConstMemberObj = int const VirtualDtor::*;\\n\\nusing PointerToVolatileMemberObj = int volatile VirtualDtor::*;\\n\\nusing PointerToCVMemberObj = int const volatile VirtualDtor::*;\\n\\n\\n\\nusing PointerToMemberFunc = void (VirtualDtor::*)();\\n\\nusing PointerToConstMemberFunc = void (VirtualDtor::*)() const;\\n\\nusing PointerToVolatileMemberFunc = void (VirtualDtor::*)() volatile;\\n\\nusing PointerToCVMemberFunc = void (VirtualDtor::*)() const volatile;\\n\\n\\n\\n#define TEST_IS_TRAIT(trait, type) \\\\\\n\\n do { \\\\\\n\\n assert(etl::is_base_of_v<etl::true_type, etl::trait<type>>); \\\\\\n\\n assert((etl::trait<type>::value)); \\\\\\n\\n assert((etl::TETL_PP_CONCAT(trait, _v) < type >)); \\\\\\n\\n } while (false)\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 24,\n \"score\": 129427.95211605355\n },\n {\n \"content\": \"struct test_is_specialized;\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"tests/type_traits/type_traits.t.cpp\",\n \"rank\": 25,\n \"score\": 129427.95211605355\n },\n {\n \"content\": \"struct is_signed : etl::bool_constant<T(-1) < T(0)> {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"etl/_type_traits/is_signed.hpp\",\n \"rank\": 26,\n \"score\": 129082.01944952781\n },\n {\n \"content\": \"struct is_unsigned : etl::bool_constant<T(0) < T(-1)> {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"etl/_type_traits/is_unsigned.hpp\",\n \"rank\": 27,\n \"score\": 129082.01944952781\n },\n {\n \"content\": \"struct Foo {\\n\\n constexpr Foo(T first, float second, bool third)\\n\\n : f { first }, s { second }, t { third }\\n\\n {\\n\\n }\\n\\n\\n\\n T f;\\n\\n float s;\\n\\n bool t;\\n\\n};\\n\\n} // namespace\\n\\n\\n\\ntemplate <typename T>\\n\\nconstexpr auto test() -> bool\\n\\n{\\n\\n\\n\\n {\\n\\n etl::tuple<T, float> t1 { T { 1 }, 2.0F };\\n\\n etl::ignore_unused(t1);\\n\\n }\\n\",\n \"file_path\": \"tests/tuple/tuple.t.cpp\",\n \"rank\": 28,\n \"score\": 126130.17441645998\n },\n {\n \"content\": \"struct Counter {\\n\\n int& value;\\n\\n Counter(int& v) : value(v) { }\\n\\n ~Counter() { value++; }\\n\\n};\\n\\nauto some_function() -> void { }\\n\\n} // namespace\\n\\n\\n\\ntemplate <typename T>\\n\\nauto test() -> bool\\n\\n{\\n\\n // \\\"scalar\\\"\\n\\n {\\n\\n auto deleter = etl::default_delete<T>();\\n\\n auto* ptr = ::new T {};\\n\\n deleter(ptr);\\n\\n }\\n\\n\\n\\n // \\\"array\\\"\\n\\n {\\n\",\n \"file_path\": \"tests/memory/memory.t.cpp\",\n \"rank\": 29,\n \"score\": 126130.17441645998\n },\n {\n \"content\": \"struct S {\\n\\n S(T d = T(0)) : data { d } { }\\n\\n\\n\\n S(S const& s)\\n\\n {\\n\\n data = s.data;\\n\\n copy = true;\\n\\n }\\n\\n\\n\\n S(S&& s) noexcept\\n\\n {\\n\\n data = s.data;\\n\\n move = true;\\n\\n }\\n\\n\\n\\n auto operator=(S const& s) noexcept -> S&\\n\\n {\\n\\n data = s.data;\\n\\n copy = true;\\n\\n return *this;\\n\",\n \"file_path\": \"tests/algorithm/move.t.cpp\",\n \"rank\": 30,\n \"score\": 126130.17441645998\n },\n {\n \"content\": \"struct Class {\\n\\n constexpr Class(T n) : num(n) { }\\n\\n [[nodiscard]] constexpr auto get_num(T i) const -> T { return num + i; }\\n\\n T num;\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\n[[nodiscard]] constexpr auto get_num(T i) -> T\\n\\n{\\n\\n return i;\\n\\n}\\n\\n\\n\\n} // namespace\\n\\n\\n\\ntemplate <typename T>\\n\\nconstexpr auto test() -> bool\\n\\n{\\n\\n auto lambda = [](T x) -> T { return x; };\\n\\n assert(etl::invoke(lambda, T(1)) == T(1));\\n\\n assert(etl::invoke([]() { return T(42); }) == T(42));\\n\",\n \"file_path\": \"tests/functional/invoke.t.cpp\",\n \"rank\": 31,\n \"score\": 126130.17441645998\n },\n {\n \"content\": \"struct is_empty_test_struct_1 : T {\\n\\n char dummy_data;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"etl/_type_traits/is_empty.hpp\",\n \"rank\": 32,\n \"score\": 124679.78890463302\n },\n {\n \"content\": \"struct DerivedFromVirtualDtor : VirtualDtor {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 33,\n \"score\": 124546.23871814477\n },\n {\n \"content\": \"struct is_typename;\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"etl/_type_traits/decl.hpp\",\n \"rank\": 34,\n \"score\": 124512.65465680821\n },\n {\n \"content\": \"struct uses_allocator_impl : false_type {\\n\\n};\\n\\n\\n\\ntemplate <typename Type, typename Alloc>\\n\",\n \"file_path\": \"etl/_memory/uses_allocator.hpp\",\n \"rank\": 35,\n \"score\": 124165.57125017996\n },\n {\n \"content\": \"struct DummyString {\\n\\n constexpr DummyString() = default;\\n\\n constexpr explicit DummyString(DummyStringView /*ignore*/) { }\\n\\n constexpr operator DummyStringView() const noexcept { return { *this }; }\\n\\n};\\n\\nconstexpr DummyStringView::DummyStringView(DummyString const& /*ignore*/) { }\\n\\n\\n\\n} // namespace\\n\\n\\n\\ntemplate <typename T>\\n\\nconstexpr auto test() -> bool\\n\\n{\\n\\n // explicit ctors\\n\\n etl::ignore_unused(etl::pair<T, DummyString>(T(0), DummyStringView()));\\n\\n etl::ignore_unused(etl::pair<T, DummyString>(T(0), DummyString()));\\n\\n etl::ignore_unused(etl::pair<T, DummyStringView>(T(0), DummyStringView()));\\n\\n etl::ignore_unused(etl::pair<T, DummyStringView>(T(0), DummyStringView()));\\n\\n\\n\\n using etl::is_same_v;\\n\\n\\n\",\n \"file_path\": \"tests/utility/pair.t.cpp\",\n \"rank\": 36,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct totals {\\n\\n constexpr auto operator-(totals const& other) const -> totals;\\n\\n constexpr auto operator+=(totals const& other) -> totals&;\\n\\n\\n\\n [[nodiscard]] constexpr auto delta(totals const& prevtotals) const\\n\\n -> totals;\\n\\n\\n\\n int error { 0 };\\n\\n counts assertions {};\\n\\n counts test_cases {};\\n\\n};\\n\\n\\n\\nconstexpr auto counts::operator-(counts const& other) const -> counts\\n\\n{\\n\\n auto diff = counts {};\\n\\n diff.passed = passed - other.passed;\\n\\n diff.failed = failed - other.failed;\\n\\n diff.failed_but_ok = failed_but_ok - other.failed_but_ok;\\n\\n return diff;\\n\\n}\\n\",\n \"file_path\": \"etl/experimental/testing/totals.hpp\",\n \"rank\": 37,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct DummyString;\\n\",\n \"file_path\": \"tests/utility/pair.t.cpp\",\n \"rank\": 38,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct A {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 39,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct Vertex {\\n\\n constexpr Vertex() = default;\\n\\n constexpr Vertex(T xInit, T yInit, T zInit)\\n\\n : x { xInit }, y { yInit }, z { zInit }\\n\\n {\\n\\n }\\n\\n\\n\\n T x {};\\n\\n T y {};\\n\\n T z {};\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\n[[nodiscard]] constexpr auto operator==(\\n\\n Vertex<T> const& lhs, Vertex<T> const& rhs) -> bool\\n\\n{\\n\\n return (lhs.x == rhs.x) && (lhs.y == rhs.y) && (lhs.z == rhs.z);\\n\\n}\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"tests/vector/static_vector.t.cpp\",\n \"rank\": 40,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct section {\\n\\n explicit section(section_info const& info, bool shouldExecute)\\n\\n : info_ { info }, shouldExecute_ { shouldExecute }\\n\\n {\\n\\n }\\n\\n\\n\\n [[nodiscard]] constexpr auto info() const noexcept -> section_info const&\\n\\n {\\n\\n return info_;\\n\\n }\\n\\n\\n\\n explicit operator bool() const noexcept { return shouldExecute_; }\\n\\n\\n\\nprivate:\\n\\n section_info info_;\\n\\n counts assertions_ {};\\n\\n bool shouldExecute_;\\n\\n};\\n\\n\\n\\n} // namespace etl::test\\n\\n\\n\\n#endif // ETL_EXPERIMENTAL_TESTING_SECTION_HPP\\n\",\n \"file_path\": \"etl/experimental/testing/section.hpp\",\n \"rank\": 41,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct session {\\n\\n template <etl::size_t Capacity>\\n\\n explicit constexpr session(\\n\\n session_buffer<Capacity>& buffer, etl::string_view name);\\n\\n\\n\\n [[nodiscard]] constexpr auto name() const noexcept -> etl::string_view;\\n\\n\\n\\n [[nodiscard]] constexpr auto begin() -> test_case*;\\n\\n [[nodiscard]] constexpr auto end() -> test_case*;\\n\\n\\n\\n [[nodiscard]] auto run_all() -> int;\\n\\n\\n\\n constexpr auto add_test(name_and_tags const& spec, test_func_t func,\\n\\n etl::string_view typeName = {}) -> void;\\n\\n\\n\\n auto current_test(test_case* tc) -> void;\\n\\n\\n\\n auto pass_assertion(source_line_info const& src, char const* expr) -> void;\\n\\n auto fail_assertion(\\n\\n source_line_info const& src, char const* expr, bool terminate) -> void;\\n\",\n \"file_path\": \"etl/experimental/testing/session.hpp\",\n \"rank\": 42,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct counts {\\n\\n constexpr auto operator-(counts const& other) const -> counts;\\n\\n constexpr auto operator+=(counts const& other) -> counts&;\\n\\n\\n\\n [[nodiscard]] constexpr auto total() const -> etl::uint16_t;\\n\\n [[nodiscard]] constexpr auto all_passed() const -> bool;\\n\\n [[nodiscard]] constexpr auto all_ok() const -> bool;\\n\\n\\n\\n etl::uint16_t passed { 0 };\\n\\n etl::uint16_t failed { 0 };\\n\\n etl::uint16_t failed_but_ok { 0 };\\n\\n};\\n\\n\\n\",\n \"file_path\": \"etl/experimental/testing/totals.hpp\",\n \"rank\": 43,\n \"score\": 122783.71640629112\n },\n {\n \"content\": \"struct test_is_specialized<Foo<float>> {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits.t.cpp\",\n \"rank\": 44,\n \"score\": 120128.65133969224\n },\n {\n \"content\": \"struct D {\\n\\n virtual ~D() = default;\\n\\n};\\n\\n\\n\\nunion E {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 45,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct C {\\n\\n [[maybe_unused]] static int m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 46,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct IsFinal_A {\\n\\n int m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 47,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct null_clock {\\n\\n using rep = T;\\n\\n using period = etl::ratio<1>;\\n\\n using duration = etl::chrono::duration<rep, period>;\\n\\n using time_point = etl::chrono::time_point<null_clock>;\\n\\n bool const is_steady = false;\\n\\n\\n\\n [[nodiscard]] constexpr auto now() noexcept -> time_point\\n\\n {\\n\\n return time_point {};\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\nconstexpr auto test() -> bool\\n\\n{\\n\\n auto null = etl::chrono::time_point<null_clock<T>> {};\\n\\n assert(null.time_since_epoch().count() == T { 0 });\\n\\n return true;\\n\\n}\\n\",\n \"file_path\": \"tests/chrono/time_point.t.cpp\",\n \"rank\": 48,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct IsPolymorphic_A {\\n\\n int m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 49,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct IsAbstract_A {\\n\\n int m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 50,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct Foo {\\n\\n T i {};\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits.t.cpp\",\n \"rank\": 51,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct section_info {\\n\\n constexpr section_info(source_line_info const& sli, etl::string_view n)\\n\\n : name(n), line_info(sli)\\n\\n {\\n\\n }\\n\\n\\n\\n etl::string_view name;\\n\\n source_line_info line_info;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"etl/experimental/testing/section.hpp\",\n \"rank\": 52,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct not_specialized {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\nconstexpr auto test_identity() -> bool\\n\\n{\\n\\n using etl::is_same_v;\\n\\n using etl::type_identity;\\n\\n using etl::type_identity_t;\\n\\n\\n\\n assert((is_same_v<T, typename type_identity<T>::type>));\\n\\n assert((is_same_v<T, type_identity_t<T>>));\\n\\n\\n\\n // clang-format off\\n\\n if constexpr (!etl::is_function_v<T>) {\\n\\n assert((is_same_v<T const, typename type_identity<T const>::type>));\\n\\n assert((is_same_v<T volatile, typename type_identity<T volatile>::type>));\\n\\n assert((is_same_v<T const volatile, typename type_identity<T const volatile>::type>));\\n\\n\\n\\n assert((is_same_v<T const, type_identity_t<T const>>));\\n\",\n \"file_path\": \"tests/type_traits/type_traits.t.cpp\",\n \"rank\": 53,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct session_stats {\\n\\n etl::uint16_t num_test_cases { 0 };\\n\\n etl::uint16_t num_test_cases_failed { 0 };\\n\\n\\n\\n etl::uint16_t num_assertions { 0 };\\n\\n etl::uint16_t num_assertions_failed { 0 };\\n\\n};\\n\\n\\n\\ntemplate <etl::size_t Capacity>\\n\\nusing session_buffer = etl::array<test_case, Capacity>;\\n\\n\\n\",\n \"file_path\": \"etl/experimental/testing/session.hpp\",\n \"rank\": 54,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct example_task {\\n\\n auto run() -> void\\n\\n {\\n\\n auto loopControl = LoopType {};\\n\\n while (loopControl()) { rtos::this_task::yield(); }\\n\\n\\n\\n rtos::delete_task(nullptr);\\n\\n }\\n\\n};\\n\\n\\n\\nauto test_all() -> bool\\n\\n{\\n\\n\\n\\n auto task = example_task<rtos::once> {};\\n\\n\\n\\n rtos::create_task(task, \\\"test\\\", 255);\\n\\n rtos::start_scheduler();\\n\\n\\n\\n // Run would normally be called by rtos::start_scheduler(). Only used\\n\\n // for stubs.\\n\\n rtos::rtos_task<example_task<rtos::once>>(static_cast<void*>(&task));\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nauto main() -> int\\n\\n{\\n\\n assert(test_all());\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"tests/experimental/freertos/task.t.cpp\",\n \"rank\": 55,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct B {\\n\\n int m;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 56,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct IDS {\\n\\n};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"tests/type_traits/type_traits.t.cpp\",\n \"rank\": 57,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"struct DummyStringView {\\n\\n constexpr DummyStringView() = default;\\n\\n constexpr DummyStringView(DummyString const& /*ignore*/);\\n\\n};\\n\",\n \"file_path\": \"tests/utility/pair.t.cpp\",\n \"rank\": 58,\n \"score\": 119664.7943170293\n },\n {\n \"content\": \"enum struct ScopedEnum { foo, bar, baz };\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 59,\n \"score\": 116832.53796450992\n },\n {\n \"content\": \"struct result_disposition {\\n\\n enum flags : unsigned char {\\n\\n normal = 0x01,\\n\\n continue_on_failure = 0x02, // Failures test, but execution continues\\n\\n false_test = 0x04, // Prefix expression with !\\n\\n suppress_fail = 0x08 // Failures do not fail the test\\n\\n };\\n\\n};\\n\\n\\n\\n} // namespace etl::test\\n\\n\\n\\n#endif // ETL_EXPERIMENTAL_TESTING_RESULT_DUSPOSITION_HPP\\n\",\n \"file_path\": \"etl/experimental/testing/result_disposition.hpp\",\n \"rank\": 60,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct name_and_tags {\\n\\n name_and_tags(etl::string_view const& n = etl::string_view(),\\n\\n etl::string_view const& t = etl::string_view()) noexcept\\n\\n : name(n), tags(t)\\n\\n {\\n\\n }\\n\\n etl::string_view name;\\n\\n etl::string_view tags;\\n\\n};\\n\\n\\n\\n} // namespace etl::test\\n\\n\\n\\n#endif // ETL_EXPERIMENTAL_TESTING_NAME_AND_TAGS_HPP\\n\",\n \"file_path\": \"etl/experimental/testing/name_and_tags.hpp\",\n \"rank\": 61,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct IsFinal_D {\\n\\n virtual ~IsFinal_D() = default;\\n\\n};\\n\\n\\n\\nunion IsFinal_E final {\\n\\n char data1;\\n\\n float data2;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 62,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct IsAbstract_B {\\n\\n virtual void foo() { }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 63,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct assertion_handler {\\n\\n assertion_handler(source_line_info const& src,\\n\\n result_disposition::flags flags, char const* expr, bool result)\\n\\n : src_ { src }\\n\\n , flags_ { flags }\\n\\n , expr_ { expr }\\n\\n , res_ { has_flag(result_disposition::false_test) ? !result : result }\\n\\n {\\n\\n if (res_ || has_flag(result_disposition::suppress_fail)) {\\n\\n current_session().pass_assertion(src_, expr_);\\n\\n }\\n\\n if (!res_ && has_flag(result_disposition::normal)) {\\n\\n current_session().fail_assertion(src_, expr_, true);\\n\\n }\\n\\n if (!res_ && has_flag(result_disposition::continue_on_failure)) {\\n\\n current_session().fail_assertion(src_, expr_, false);\\n\\n }\\n\\n }\\n\\n\\n\\nprivate:\\n\",\n \"file_path\": \"etl/experimental/testing/assertion_handler.hpp\",\n \"rank\": 64,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct IsPolymorphic_B {\\n\\n virtual void foo();\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 65,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct IsFinal_B {\\n\\n virtual void foo(); // NOLINT\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 66,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct IsAbstract_C {\\n\\n virtual void foo() = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 67,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct IsPolymorphic_D {\\n\\n virtual ~IsPolymorphic_D() = default;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 68,\n \"score\": 116750.96484768388\n },\n {\n \"content\": \"struct uses_allocator : detail::uses_allocator_impl<Type, Alloc>::type {\\n\\n};\\n\\n\\n\\n/// \\\\brief If T has a member typedef allocator_type which is convertible from\\n\\n/// Alloc, the member constant value is true. Otherwise value is false.\\n\\ntemplate <typename Type, typename Alloc>\\n\\ninline constexpr auto uses_allocator_v = uses_allocator<Type, Alloc>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_MEMORY_USES_ALLOCATOR_HPP\",\n \"file_path\": \"etl/_memory/uses_allocator.hpp\",\n \"rank\": 69,\n \"score\": 116198.55319805813\n },\n {\n \"content\": \"enum struct ScopedEnumWithType : long { v1, v2 };\\n\\n\\n\",\n \"file_path\": \"tests/testing/types.hpp\",\n \"rank\": 70,\n \"score\": 114559.60252783047\n },\n {\n \"content\": \"struct source_line_info {\\n\\n source_line_info() = delete;\\n\\n\\n\\n constexpr source_line_info(char const* f, etl::size_t l) noexcept\\n\\n : file { f }, line { l }\\n\\n {\\n\\n }\\n\\n\\n\\n char const* file;\\n\\n etl::size_t line;\\n\\n};\\n\\n\\n\\n} // namespace etl::test\\n\\n\\n\\n#define TEST_DETAIL_SOURCE_LINE_INFO \\\\\\n\\n etl::test::source_line_info(__FILE__, static_cast<etl::size_t>(__LINE__))\\n\\n\\n\\n#endif // ETL_EXPERIMENTAL_TESTING_SOURCE_LINE_INFO_HPP\\n\",\n \"file_path\": \"etl/experimental/testing/source_line_info.hpp\",\n \"rank\": 71,\n \"score\": 111462.65814309189\n },\n {\n \"content\": \"struct IsAbstract_D : IsAbstract_C {\\n\\n};\\n\\n\\n\\n} // namespace\\n\\n\\n\\nconstexpr auto test_all() -> bool\\n\\n{\\n\\n using etl::make_signed_t;\\n\\n TEST_TRAIT_TYPE(make_signed, etl::int8_t, etl::int8_t);\\n\\n TEST_TRAIT_TYPE(make_signed, etl::int16_t, etl::int16_t);\\n\\n TEST_TRAIT_TYPE(make_signed, etl::int32_t, etl::int32_t);\\n\\n TEST_TRAIT_TYPE(make_signed, etl::int64_t, etl::int64_t);\\n\\n\\n\\n TEST_TRAIT_TYPE(make_signed, etl::uint8_t, etl::int8_t);\\n\\n TEST_TRAIT_TYPE(make_signed, etl::uint16_t, etl::int16_t);\\n\\n TEST_TRAIT_TYPE(make_signed, etl::uint32_t, etl::int32_t);\\n\\n TEST_TRAIT_TYPE(make_signed, etl::uint64_t, etl::int64_t);\\n\\n\\n\\n TEST_TRAIT_TYPE(make_signed, signed char, signed char);\\n\\n TEST_TRAIT_TYPE(make_signed, short, short);\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 72,\n \"score\": 109107.15271663794\n },\n {\n \"content\": \"struct IsPolymorphic_C : IsPolymorphic_B {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 73,\n \"score\": 109107.15271663794\n },\n {\n \"content\": \"struct is_specialized<Template, T, etl::void_t<decltype(Template<T> {})>>\\n\\n : etl::true_type {\\n\\n};\\n\\n\\n\\ntemplate <template <typename...> typename Template, typename T,\\n\\n typename Tag = void>\\n\\ninline constexpr bool is_specialized_v\\n\\n = etl::is_specialized<Template, T, Tag>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_SPECIALIZED_HPP\",\n \"file_path\": \"etl/_type_traits/is_specialized.hpp\",\n \"rank\": 74,\n \"score\": 108589.50230525926\n },\n {\n \"content\": \"struct IsFinal_C final : IsFinal_B {\\n\\n};\\n\\n\\n\",\n \"file_path\": \"tests/type_traits/type_traits2.t.cpp\",\n \"rank\": 75,\n \"score\": 104677.15892939796\n },\n {\n \"content\": \"struct disjunction : etl::bool_constant<(B::value || ...)> {\\n\\n};\\n\\n\\n\\n/// \\\\group disjunction\\n\\ntemplate <typename... B>\\n\\ninline constexpr bool disjunction_v = (B::value || ...);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_DISJUNCTION_HPP\",\n \"file_path\": \"etl/_type_traits/disjunction.hpp\",\n \"rank\": 76,\n \"score\": 102818.99324033948\n },\n {\n \"content\": \"struct conjunction : etl::bool_constant<(B::value && ...)> {\\n\\n};\\n\\n\\n\\n/// \\\\group conjunction\\n\\ntemplate <typename... B>\\n\\ninline constexpr bool conjunction_v = (B::value && ...);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_CONJUNCTION_HPP\",\n \"file_path\": \"etl/_type_traits/conjunction.hpp\",\n \"rank\": 77,\n \"score\": 102818.99324033948\n },\n {\n \"content\": \"struct is_placeholder : integral_constant<int, 0> {\\n\\n};\\n\\n\\n\\nnamespace detail {\\n\\ntemplate <int N>\\n\",\n \"file_path\": \"etl/_functional/placeholder.hpp\",\n \"rank\": 78,\n \"score\": 102514.73842119373\n },\n {\n \"content\": \"struct is_final : bool_constant<TETL_BUILTIN_IS_FINAL(T)> {\\n\\n};\\n\\n\\n\\n/// \\\\group is_final\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_final_v = is_final<T>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_FINAL_HPP\",\n \"file_path\": \"etl/_type_traits/is_final.hpp\",\n \"rank\": 79,\n \"score\": 102049.79497284269\n },\n {\n \"content\": \"struct is_union : bool_constant<TETL_BUILTIN_IS_UNION(T)> {\\n\\n};\\n\\n\\n\\n/// \\\\group is_union\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_union_v = TETL_BUILTIN_IS_UNION(T);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_UNION_HPP\",\n \"file_path\": \"etl/_type_traits/is_union.hpp\",\n \"rank\": 80,\n \"score\": 102049.79497284269\n },\n {\n \"content\": \"struct is_polymorphic : bool_constant<TETL_BUILTIN_IS_POLYMORPHIC(T)> {\\n\\n};\\n\\n\\n\\n/// \\\\group is_polymorphic\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_polymorphic_v = is_polymorphic<T>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_POLYMORPHIC_HPP\",\n \"file_path\": \"etl/_type_traits/is_polymorphic.hpp\",\n \"rank\": 81,\n \"score\": 102049.79497284269\n },\n {\n \"content\": \"struct is_abstract : bool_constant<TETL_BUILTIN_IS_ABSTRACT(T)> {\\n\\n};\\n\\n\\n\\n/// \\\\group is_abstract\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_abstract_v = TETL_BUILTIN_IS_ABSTRACT(T);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_ABSTRACT_HPP\",\n \"file_path\": \"etl/_type_traits/is_abstract.hpp\",\n \"rank\": 82,\n \"score\": 102049.79497284269\n },\n {\n \"content\": \"struct is_enum : bool_constant<TETL_BUILTIN_IS_ENUM(T)> {\\n\\n};\\n\\n\\n\\n/// \\\\group is_enum\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_enum_v = is_enum<T>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_ENUM_HPP\",\n \"file_path\": \"etl/_type_traits/is_enum.hpp\",\n \"rank\": 83,\n \"score\": 102049.79497284269\n },\n {\n \"content\": \"struct rank : integral_constant<size_t, 0> {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"etl/_type_traits/rank.hpp\",\n \"rank\": 84,\n \"score\": 101143.54081255346\n },\n {\n \"content\": \"/// \\\\copyright Tobias Hienzsch 2019-2021\\n\\n/// Distributed under the Boost Software License, Version 1.0.\\n\\n/// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt\\n\\n\\n\\n#include \\\"etl/algorithm.hpp\\\"\\n\\n\\n\\n#include \\\"etl/array.hpp\\\"\\n\\n#include \\\"etl/cctype.hpp\\\"\\n\\n#include \\\"etl/cstdint.hpp\\\"\\n\\n\\n\\n#include \\\"testing/testing.hpp\\\"\\n\\n\\n\\ntemplate <typename T>\\n\\nconstexpr auto test() -> bool\\n\\n{\\n\\n\\n\\n {\\n\\n auto const v1 = etl::array { 'a', 'b', 'c', 'f', 'h', 'x' };\\n\\n auto const v2 = etl::array { 'a', 'b', 'c' };\\n\\n auto const v3 = etl::array { 'a', 'c' };\\n\",\n \"file_path\": \"tests/algorithm/includes.t.cpp\",\n \"rank\": 85,\n \"score\": 100065.1599754299\n },\n {\n \"content\": \" auto const v3 = etl::array { T(1), T(3) };\\n\\n auto const v4 = etl::array { T(1), T(1), T(2) };\\n\\n auto const v5 = etl::array { T(7) };\\n\\n auto const v6 = etl::array { T(1), T(3), T(7) };\\n\\n\\n\\n assert(etl::includes(begin(v1), end(v1), v2.begin(), v2.end()));\\n\\n assert(etl::includes(begin(v1), end(v1), v3.begin(), v3.end()));\\n\\n\\n\\n assert(!(etl::includes(begin(v1), end(v1), v4.begin(), v4.end())));\\n\\n assert(!(etl::includes(begin(v1), end(v1), v5.begin(), v5.end())));\\n\\n assert(!(etl::includes(begin(v1), end(v1), v6.begin(), v6.end())));\\n\\n }\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nconstexpr auto test_all() -> bool\\n\\n{\\n\\n assert(test<etl::uint8_t>());\\n\\n assert(test<etl::int8_t>());\\n\",\n \"file_path\": \"tests/algorithm/includes.t.cpp\",\n \"rank\": 86,\n \"score\": 100060.03858368316\n },\n {\n \"content\": \" auto const v4 = etl::array { 'a', 'a', 'b' };\\n\\n auto const v5 = etl::array { 'g' };\\n\\n auto const v6 = etl::array { 'a', 'c', 'g' };\\n\\n auto const v7 = etl::array { 'A', 'B', 'C' };\\n\\n\\n\\n auto noCase\\n\\n = [](char a, char b) { return etl::tolower(a) < etl::tolower(b); };\\n\\n\\n\\n assert(etl::includes(begin(v1), end(v1), v2.begin(), v2.end()));\\n\\n assert(etl::includes(begin(v1), end(v1), v3.begin(), v3.end()));\\n\\n assert(etl::includes(begin(v1), end(v1), v7.begin(), v7.end(), noCase));\\n\\n\\n\\n assert(!(etl::includes(begin(v1), end(v1), v4.begin(), v4.end())));\\n\\n assert(!(etl::includes(begin(v1), end(v1), v5.begin(), v5.end())));\\n\\n assert(!(etl::includes(begin(v1), end(v1), v6.begin(), v6.end())));\\n\\n }\\n\\n\\n\\n {\\n\\n auto const v1 = etl::array { T(1), T(2), T(3), T(6), T(8), T(24) };\\n\\n auto const v2 = etl::array { T(1), T(2), T(3) };\\n\",\n \"file_path\": \"tests/algorithm/includes.t.cpp\",\n \"rank\": 87,\n \"score\": 100051.38070098759\n },\n {\n \"content\": \" assert(test<etl::uint16_t>());\\n\\n assert(test<etl::int16_t>());\\n\\n assert(test<etl::uint32_t>());\\n\\n assert(test<etl::int32_t>());\\n\\n assert(test<etl::uint64_t>());\\n\\n assert(test<etl::int64_t>());\\n\\n assert(test<float>());\\n\\n assert(test<double>());\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\nauto main() -> int\\n\\n{\\n\\n assert(test_all());\\n\\n static_assert(test_all());\\n\\n return 0;\\n\\n}\",\n \"file_path\": \"tests/algorithm/includes.t.cpp\",\n \"rank\": 88,\n \"score\": 100050.62886903934\n },\n {\n \"content\": \"struct is_compound : etl::bool_constant<!etl::is_fundamental_v<T>> {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_compound_v = !etl::is_fundamental_v<T>;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_COMPOUND_HPP\",\n \"file_path\": \"etl/_type_traits/is_compound.hpp\",\n \"rank\": 89,\n \"score\": 99150.07834813758\n },\n {\n \"content\": \"struct ratio_not_equal : bool_constant<!ratio_equal_v<R1, R2>> {\\n\\n};\\n\\n\\n\\ntemplate <typename R1, typename R2>\\n\\ninline constexpr bool ratio_not_equal_v = ratio_not_equal<R1, R2>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_RATIO_NOT_EQUAL_HPP\",\n \"file_path\": \"etl/_ratio/ratio_not_equal.hpp\",\n \"rank\": 90,\n \"score\": 98332.0233744253\n },\n {\n \"content\": \"struct is_class : etl::bool_constant<TETL_BUILTIN_IS_CLASS(T)> {\\n\\n};\\n\\n\\n\\n/// \\\\group is_class\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_class_v = TETL_BUILTIN_IS_CLASS(T);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_CLASS_HPP\",\n \"file_path\": \"etl/_type_traits/is_class.hpp\",\n \"rank\": 91,\n \"score\": 98332.0233744253\n },\n {\n \"content\": \"struct extent<T[], 0> : etl::integral_constant<etl::size_t, 0> {\\n\\n};\\n\\n\\n\\n/// \\\\exclude\\n\\ntemplate <typename T, unsigned N>\\n\",\n \"file_path\": \"etl/_type_traits/extent.hpp\",\n \"rank\": 92,\n \"score\": 96595.34940397457\n },\n {\n \"content\": \"struct type_pack_element_impl<0, T, Ts...> {\\n\\n using type = T;\\n\\n};\\n\\n} // namespace detail\\n\\n\\n\\ntemplate <etl::size_t I, typename... Ts>\\n\",\n \"file_path\": \"etl/_type_traits/type_pack_element.hpp\",\n \"rank\": 93,\n \"score\": 96433.11527599636\n },\n {\n \"content\": \"struct is_trivially_copyable : etl::bool_constant<__is_trivially_copyable(T)> {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_trivially_copyable_v = __is_trivially_copyable(T);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_TRIVIALLY_COPYABLE_HPP\",\n \"file_path\": \"etl/_type_traits/is_trivially_copyable.hpp\",\n \"rank\": 94,\n \"score\": 96273.36606542752\n },\n {\n \"content\": \"struct is_standard_layout : bool_constant<TETL_BUILTIN_IS_STANDARD_LAYOUT(T)> {\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_standard_layout_v = is_standard_layout<T>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_STANDARD_LAYOUT_HPP\",\n \"file_path\": \"etl/_type_traits/is_standard_layout.hpp\",\n \"rank\": 95,\n \"score\": 95864.23020059968\n },\n {\n \"content\": \"struct is_function : bool_constant<!is_const_v<T const> && !is_reference_v<T>> {\\n\\n};\\n\\n\\n\\n#if defined(TETL_MSVC)\\n\\n // Qualifier applied to function has no meaning\\n\\n #pragma warning(default : 4180)\\n\\n#endif\\n\\n\\n\\n/// \\\\brief Checks whether T is a function type. Types like etl::function,\\n\\n/// lambdas, classes with overloaded operator() and pointers to functions don't\\n\\n/// count as function types. Provides the member constant value which is equal\\n\\n/// to true, if T is a function type. Otherwise, value is equal to false.\\n\\n///\\n\\n/// \\\\details The behavior of a program that adds specializations for is_function\\n\\n/// or is_function_v is undefined.\\n\\n/// \\\\group is_function\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_function_v = is_function<T>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_FUNCTION_HPP\",\n \"file_path\": \"etl/_type_traits/is_function.hpp\",\n \"rank\": 96,\n \"score\": 95761.19877791686\n },\n {\n \"content\": \"struct is_assignable : etl::bool_constant<TETL_BUILTIN_IS_ASSIGNABLE(T, U)> {\\n\\n};\\n\\n\\n\\ntemplate <typename T, typename U>\\n\\ninline constexpr bool is_assignable_v = TETL_BUILTIN_IS_ASSIGNABLE(T, U);\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_ASSIGNABLE_HPP\",\n \"file_path\": \"etl/_type_traits/is_assignable.hpp\",\n \"rank\": 97,\n \"score\": 94913.12570793407\n },\n {\n \"content\": \"struct is_pointer : detail::is_pointer_helper<typename remove_cv<T>::type> {\\n\\n};\\n\\n\\n\\n/// \\\\group is_pointer\\n\\ntemplate <typename T>\\n\\ninline constexpr bool is_pointer_v = is_pointer<T>::value;\\n\\n\\n\\n} // namespace etl\\n\\n\\n\\n#endif // TETL_TYPE_TRAITS_IS_POINTER_HPP\",\n \"file_path\": \"etl/_type_traits/is_pointer.hpp\",\n \"rank\": 98,\n \"score\": 93732.16380776443\n },\n {\n \"content\": \"struct nothrow_constructible_impl<true, T> : bool_constant<noexcept(T())> {\\n\\n};\\n\\n\\n\\ntemplate <typename T, size_t Size>\\n\",\n \"file_path\": \"etl/_type_traits/is_nothrow_constructible.hpp\",\n \"rank\": 99,\n \"score\": 92964.51357589457\n }\n]","isConversational":false}}},{"rowIdx":481,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"tests/benchmark/src/UAutomizerFileReader-test.cpp"},"repo_name":{"kind":"string","value":"typesAreSpaces/AXDInterpolator"},"commit":{"kind":"string","value":"e0759c806480ff54b7a4f878e007b534a71dad44"},"file_code":{"kind":"string","value":"#include \"UAutomizerFileReader.h\"\n\nvoid UAutomizerFileReader::testAXDInterpolator() const {\n\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n\n axdinterpolator_file << tseitin_solver.to_smt2();\n axdinterpolator_file.close();,\n\n sprintf(exec_command,\n \"./../../bin/axd_interpolator QF_LIA %s %u 1000000;\",\n file_for_implementation.c_str(), curr_solver);,\n#if REPORT_BAD_CASES\n if(ret != 0 && ret != 152){\n char complain_command[1000];\n sprintf(\n complain_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Sample Id: %d Exit Code: %d >> /home/jose/bad_cases.txt\",\n file_for_implementation.c_str(), curr_solver, 500 - num_samples, ret);\n system(complain_command);\n system((\"mv \" \n + file_for_implementation \n + \" ~/\" + file_for_implementation + std::to_string(500 - num_samples)).c_str());\n }\n#endif\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), curr_solver, ret, file_statistics);\n );\n system((\"rm -rf \" + temp_file).c_str());\n}\n\nvoid UAutomizerFileReader::testOtherSolvers() {\n\n switch(curr_solver){\n case Z3:\n {\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n \n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n axdinterpolator_file \n << \"(set-option :produce-interpolants true)\" \n << std::endl;\n axdinterpolator_file \n << \"(set-logic QF_AUFLIA)\" << std::endl;\n axdinterpolator_file << nameAssertionsZ3(tseitin_solver.to_smt2());\n axdinterpolator_file << \"(get-interpolant part_a part_b)\" << std::endl;\n axdinterpolator_file.close();,\n \n std::string temp_file_name = \"z3_inter_temp_\" + current_file;\n sprintf(exec_command, \"./../../bin/z3 %s > %s;\",\n file_for_implementation.c_str(), temp_file_name.c_str());,\n \n std::ifstream result(temp_file_name.c_str());\n std::string line(\"\");\n std::string interpolant_from_file(\"\");\n \n \n \n \n std::getline(result, line);\n\n if(line == \"unsat\"){\n std::getline(result, line);\n\n interpolant_from_file += tseitin_solver.to_smt2_decls_only();\n\n interpolant_from_file += \"(assert (and true\\n\";\n while(std::getline(result, line))\n interpolant_from_file += line + \"\\n\";\n \n \n \n interpolant_from_file += \")\\n\";\n interpolant_from_file += \"(check-sat)\\n\";\n\n \n \n \n \n \n \n\n system((\"rm -rf \" + temp_file_name).c_str());\n\n z3::solver z3_interpolant_parser(ctx, \"QF_AUFLIA\");\n z3_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n auto const & interpolant_result = z3_interpolant_parser.assertions();\n std::cout << interpolant_result << std::endl;\n\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 3, ret, file_statistics);\n }\n else{\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 3, 1, file_statistics);\n }\n );\n\n system((\"rm -rf \" + temp_file).c_str());\n }\n return;\n case MATHSAT:\n {\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n \n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n axdinterpolator_file \n << \"(set-option :produce-interpolants true)\" \n << std::endl;\n \n \n axdinterpolator_file << nameAssertionsMathsat(tseitin_solver.to_smt2());\n axdinterpolator_file << \"(get-interpolant (part_a))\" << std::endl;\n axdinterpolator_file.close();,\n \n std::string temp_file_name = \"mathsat_inter_temp_\" + current_file;\n sprintf(exec_command, \"./../../bin/mathsat %s > %s;\",\n file_for_implementation.c_str(), temp_file_name.c_str());,\n \n std::ifstream result(temp_file_name.c_str());\n std::string line(\"\");\n std::string interpolant_from_file(\"\");\n \n \n \n \n std::getline(result, line);\n\n if(line == \"unsat\"){\n\n interpolant_from_file += tseitin_solver.to_smt2_decls_only();\n interpolant_from_file += \"(assert (and true\\n\";\n std::string _interpolant_result = \"\";\n while(std::getline(result, line))\n _interpolant_result += line + \"\\n\";\n\n if(_interpolant_result.find(\"build ie-local interpolant\") != std::string::npos){\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 4, 1, file_statistics);\n }\n else {\n interpolant_from_file += _interpolant_result;\n \n \n \n interpolant_from_file += \"))\\n\";\n interpolant_from_file += \"(check-sat)\\n\";\n system((\"rm -rf \" + temp_file_name).c_str());\n\n z3::solver mathsat_interpolant_parser(ctx, \"QF_AUFLIA\");\n mathsat_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n auto const & interpolant_result = mathsat_interpolant_parser.assertions();\n std::cout << interpolant_result << std::endl;\n\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 4, ret, file_statistics);\n }\n }\n else{\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 4, 1, file_statistics);\n }\n\n );\n\n system((\"rm -rf \" + temp_file).c_str());\n }\n return;\n case SMTINTERPOL:\n {\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n \n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n axdinterpolator_file \n << \"(set-option :print-success false)\\n\" \n << \"(set-option :produce-interpolants true)\" \n << std::endl;\n axdinterpolator_file \n << \"(set-logic QF_AUFLIA)\" << std::endl;\n axdinterpolator_file << nameAssertionsZ3(tseitin_solver.to_smt2());\n axdinterpolator_file << \"(get-interpolants part_a part_b)\" << std::endl;\n axdinterpolator_file.close();,\n \n std::string temp_file_name = \"smtinterpol_inter_temp_\" + current_file;\n sprintf(exec_command, \n \"java -jar ./../../bin/smtinterpol-2.5-663-gf15aa217.jar -w %s > %s\",\n file_for_implementation.c_str(), temp_file_name.c_str());,\n \n std::ifstream result(temp_file_name.c_str());\n std::string line(\"\");\n std::string interpolant_from_file(\"\");\n \n \n \n std::getline(result, line);\n\n if(line == \"unsat\"){\n interpolant_from_file += tseitin_solver.to_smt2_decls_only();\n interpolant_from_file += \"(assert \\n\";\n std::getline(result, line);\n interpolant_from_file += line.erase(0, 1) + \"\\n\";\n \n \n interpolant_from_file.erase(interpolant_from_file.size() - 2, 2);\n \n \n \n interpolant_from_file += \")\\n\";\n interpolant_from_file += \"(check-sat)\\n\";\n system((\"rm -rf \" + temp_file_name).c_str());\n\n z3::solver smtinterpol_interpolant_parser(ctx, \"QF_AUFLIA\");\n smtinterpol_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n auto const & interpolant_result = smtinterpol_interpolant_parser.assertions();\n std::cerr << interpolant_result << std::endl;\n\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 5, ret, file_statistics);\n }\n else{\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 5, 1, file_statistics);\n }\n\n );\n\n system((\"rm -rf \" + temp_file).c_str());\n }\n return;\n }\n}\n"},"prefix":{"kind":"string","value":"#include \"UAutomizerFileReader.h\"\n\nvoid UAutomizerFileReader::testAXDInterpolator() const {\n\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n\n axdinterpolator_file << tseitin_solver.to_smt2();\n axdinterpolator_file.close();,\n\n sprintf(exec_command,\n \"./../../bin/axd_interpolator QF_LIA %s %u 1000000;\",\n file_for_implementation.c_str(), curr_solver);,\n#if REPORT_BAD_CASES\n if(ret != 0 && ret != 152){\n char complain_command[1000];\n sprintf(\n complain_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Sample Id: %d Exit Code: %d >> /home/jose/bad_cases.txt\",\n file_for_implementation.c_str(), curr_solver, 500 - num_samples, ret);\n system(complain_command);\n system((\"mv \" \n + file_for_implementation \n + \" ~/\" + file_for_implementation + std::to_string(500 - num_samples)).c_str());\n }\n#endif\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), curr_solver, ret, file_statistics);\n );\n system((\"rm -rf \" + temp_file).c_str());\n}\n\nvoid UAutomizerFileReader::testOtherSolvers() {\n\n switch(curr_solver){\n case Z3:\n {\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n \n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n axdinterpolator_file \n << \"(set-option :produce-interpolants true)\" \n << std::endl;\n axdinterpolator_file \n << \"(set-logic QF_AUFLIA)\" << std::endl;\n axdinterpolator_file << nameAssertionsZ3(tseitin_solver.to_smt2());\n axdinterpolator_file << \"(get-interpolant part_a part_b)\" << std::endl;\n axdinterpolator_file.close();,\n \n std::string temp_file_name = \"z3_inter_temp_\" + current_file;\n sprintf(exec_command, \"./../../bin/z3 %s > %s;\",\n file_for_implementation.c_str(), temp_file_name.c_str());,\n \n std::ifstream result(temp_file_name.c_str());\n std::string line(\"\");\n std::string interpolant_from_file(\"\");\n \n \n \n \n std::getline(result, line);\n\n if(line == \"unsat\"){\n std::getline(result, line);\n\n interpolant_from_file += tseitin_solver.to_smt2_decls_only();\n\n interpolant_from_file += \"(assert (and true\\n\";\n while(std::getline(result, line))\n interpolant_from_file += line + \"\\n\";\n \n \n \n interpolant_from_file += \")\\n\";\n interpolant_from_file += \"(check-sat)\\n\";\n\n \n \n \n \n \n \n\n system((\"rm -rf \" + temp_file_name).c_str());\n\n z3::solver z3_interpolant_parser(ctx, \"QF_AUFLIA\");\n z3_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n auto const & interpolant_result = z3_interpolant_parser.assertions();\n std::cout << interpolant_result << std::endl;\n\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 3, ret, file_statistics);\n }\n else{\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 3, 1, file_statistics);\n }\n );\n\n system((\"rm -rf \" + temp_file).c_str());\n }\n return;\n case MATHSAT:\n {\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n \n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n axdinterpolator_file \n << \"(set-option :produce-interpolants true)\" \n << std::endl;\n \n \n axdinterpolator_file << nameAssertionsMathsat(tseitin_solver.to_smt2());\n axdinterpolator_file << \"(get-interpolant (part_a))\" << std::endl;\n axdinterpolator_file.close();,\n \n std::string temp_file_name = \"mathsat_inter_temp_\" + current_file;\n sprintf(exec_command, \"./../../bin/mathsat %s > %s;\",\n file_for_implementation.c_str(), temp_file_name.c_str());,\n \n std::ifstream result(temp_file_name.c_str());\n std::string line(\"\");\n std::string interpolant_from_file(\"\");\n \n \n \n \n std::getline(result, line);\n\n if(line == \"unsat\"){\n\n interpolant_from_file += tseitin_solver.to_smt2_decls_only();\n interpolant_from_file += \"(assert (and true\\n\";\n std::string _interpolant_result = \"\";\n while(std::getline(result, line))\n _interpolant_result += line + \"\\n\";\n\n if(_interpolant_result.find(\"build ie-local interpolant\") != std::string::npos){\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 4, 1, file_statistics);\n }\n else {\n interpolant_from_file += _interpolant_result;\n \n \n \n interpolant_from_file += \"))\\n\";\n interpolant_from_file += \"(check-sat)\\n\";\n system((\"rm -rf \" + temp_file_name).c_str());\n\n z3::solver mathsat_interpolant_parser(ctx, \"QF_AUFLIA\");\n mathsat_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n auto const & interpolant_result = mathsat_interpolant_parser.assertions();\n std::cout << interpolant_result << std::endl;\n\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 4, ret, file_statistics);\n }\n }\n else{\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 4, 1, file_statistics);\n }\n\n );\n\n system((\"rm -rf \" + temp_file).c_str());\n }\n return;\n case SMTINTERPOL:\n {\n TEMP_FILE_SETUP;\n BENCHMARK_COMMAND(\n \n z3::solver tseitin_solver(ctx, \"QF_AUFLIA\");\n tseitin_solver.add(z3::mk_and(part_a));\n tseitin_solver.add(z3::mk_and(part_b));\n axdinterpolator_file \n << \"(set-option :print-success false)\\n\" \n << \"(set-option :produce-interpolants true)\" \n << std::endl;\n axdinterpolator_file \n << \"(set-logic QF_AUFLIA)\" << std::endl;\n axdinterpolator_file << nameAssertionsZ3(tseitin_solver.to_smt2());\n axdinterpolator_file << \"(get-interpolants part_a part_b)\" << std::endl;\n axdinterpolator_file.close();,\n \n std::string temp_file_name = \"smtinterpol_inter_temp_\" + current_file;\n sprintf(exec_command, \n \"java -jar ./../../bin/smtinterpol-2.5-663-gf15aa217.jar -w %s > %s\",\n file_for_implementation.c_str(), temp_file_name.c_str());,\n \n std::ifstream result(temp_file_name.c_str());\n std::string line(\"\");\n std::string interpolant_from_file(\"\");\n \n \n \n std::getline(result, line);\n\n if(line == \"unsat\"){\n interpolant_from_file += tseitin_solver.to_smt2_decls_only();\n interpolant_from_file += \"(assert \\n\";\n std::getline(result, line);\n interpolant_from_file += line.erase(0, 1) + \"\\n\";\n \n \n interpolant_from_file.erase(interpolant_from_file.size() - 2, 2);\n \n \n \n "},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"interpolant_from_file += \")\\n\";\n interpolant_from_file += \"(check-sat)\\n\";\n system((\"rm -rf \" + temp_file_name).c_str());\n\n z3::solver smtinterpol_interpolant_parser(ctx, \"QF_AUFLIA\");\n smtinterpol_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n auto const & interpolant_result = smtinterpol_interpolant_parser.assertions();\n std::cerr << interpolant_result << std::endl;\n\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 5, ret, file_statistics);\n }\n else{\n system((\"rm -rf \" + temp_file_name).c_str());\n sprintf(log_command, \n \"echo File: \\\"%s\\\" Solver Code: \\\"%u\\\" Exit Code: %d >> \\\"%s\\\"\",\n file_for_implementation.c_str(), 5, 1, file_statistics);\n }\n\n );\n\n system((\"rm -rf \" + temp_file).c_str());\n }\n return;\n }\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"enum SMT_SOLVER { Z3, MATHSAT, SMTINTERPOL };\n\n\n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":0,"score":219527.99814903465},{"content":"enum BENCHMARK_EXIT_CODE { SUCCESS, FAILED, TIMEOUT };\n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":1,"score":118119.87622310914},{"content":" class solver;\n","file_path":"tests/benchmark/include/z3++.h","rank":2,"score":115627.8942689355},{"content":" class solver : public object {\n\n Z3_solver m_solver;\n\n void init(Z3_solver s) {\n\n m_solver = s;\n\n Z3_solver_inc_ref(ctx(), s);\n\n }\n\n public:\n\n struct simple {};\n\n struct translate {};\n\n solver(context & c):object(c) { init(Z3_mk_solver(c)); }\n\n solver(context & c, simple):object(c) { init(Z3_mk_simple_solver(c)); }\n\n solver(context & c, Z3_solver s):object(c) { init(s); }\n\n solver(context & c, char const * logic):object(c) { init(Z3_mk_solver_for_logic(c, c.str_symbol(logic))); }\n\n solver(context & c, solver const& src, translate): object(c) { init(Z3_solver_translate(src.ctx(), src, c)); }\n\n solver(solver const & s):object(s) { init(s.m_solver); }\n\n ~solver() { Z3_solver_dec_ref(ctx(), m_solver); }\n\n operator Z3_solver() const { return m_solver; }\n\n solver & operator=(solver const & s) {\n\n Z3_solver_inc_ref(s.ctx(), s.m_solver);\n\n Z3_solver_dec_ref(ctx(), m_solver);\n","file_path":"tests/benchmark/include/z3++.h","rank":3,"score":102673.08763681822},{"content":"class UAutomizerFileReader {\n\n\n\n std::string line, current_frame, current_file;\n\n int nesting_level, max_nesting_level;\n\n unsigned num;\n\n bool is_mem_safety_track;\n\n std::vector<std::string> stack_of_frames;\n\n SMT_SOLVER curr_solver;\n\n std::string const name_solver;\n\n unsigned num_samples;\n\n char * const file_statistics;\n\n bool test_our_implementation;\n\n\n\n bool hasNonSupportedSymbols(z3::expr const &) const;\n\n std::string nameAssertionsZ3(std::string const &) const;\n\n std::string nameAssertionsMathsat(std::string const &) const;\n\n\n\n bool isPushCmd() const;\n\n bool isPopCmd() const;\n\n bool isEchoCmd() const; \n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":4,"score":93856.91520494904},{"content":"\n\n void testAXDInterpolator() const; \n\n void testOtherSolvers(); \n\n void reset(); \n\n\n\n public:\n\n UAutomizerFileReader(SMT_SOLVER, unsigned, char * const, bool, bool);\n\n \n\n void process(char const *);\n\n void processSingleFile(char const *);\n\n};\n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":5,"score":86272.75079068461},{"content":" std::ofstream smt_file (temp_file.c_str());\\\n\n \\\n\n for(auto const & x : stack_of_frames)\\\n\n smt_file << x << std::endl;\\\n\n smt_file << current_frame << std::endl;\\\n\n smt_file.close();\\\n\n\n\n#define BENCHMARK_COMMAND(WRITER, EXEC_COMMAND, LOG_COMMAND)\\\n\n z3::context ctx;\\\n\n z3::solver input_parser(ctx, \"QF_AUFLIA\");\\\n\n input_parser.from_file(temp_file.c_str());\\\n\n \\\n\n for(auto const & x : input_parser.assertions()){\\\n\n if(hasNonSupportedSymbols(x)){\\\n\n system((\"rm -rf \" + temp_file).c_str());\\\n\n return;\\\n\n }\\\n\n }\\\n\n \\\n\n if(input_parser.check() == z3::unsat){\\\n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":6,"score":86268.95768892833},{"content":"#include <iostream>\n\n#include <cassert>\n\n#include <regex>\n\n#include <fstream>\n\n#include <string>\n\n#include <type_traits>\n\n#include <vector>\n\n#include <cstring>\n\n#include <stdio.h>\n\n#include <string>\n\n#include <cstdlib>\n\n#include <regex>\n\n#include \"z3++.h\"\n\n\n\n#define SINGLE_FORMULA 0\n\n#define REPORT_BAD_CASES 0\n\n\n\n#define TEMP_FILE_SETUP\\\n\n std::string temp_file =\\\n\n \"temp_\" + name_solver + \"_\" + current_file;\\\n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":7,"score":86265.84348226433},{"content":" std::string file_for_implementation =\\\n\n \"axdinterpolator_\" + name_solver + \"_\" + current_file;\\\n\n std::ofstream axdinterpolator_file(file_for_implementation.c_str());\\\n\n \\\n\n z3::expr_vector curr_assertions = input_parser.assertions();\\\n\n z3::expr_vector part_a(ctx), part_b(ctx);\\\n\n \\\n\n auto const & to_cnf_tactic = \\\n\n z3::tactic(ctx, \"tseitin-cnf\");\\\n\n \\\n\n z3::goal goal_assertions(ctx);\\\n\n goal_assertions.add(z3::mk_and(curr_assertions));\\\n\n auto const & cnf_assertions = to_cnf_tactic(goal_assertions);\\\n\n \\\n\n assert(cnf_assertions.size() == 1);\\\n\n z3::expr const & curr_conjunction = cnf_assertions[0].as_expr();\\\n\n \\\n\n unsigned total_size_cnf = curr_conjunction.num_args();\\\n\n unsigned half_size_cnf = total_size_cnf/2;\\\n\n if(curr_conjunction.decl().decl_kind() != Z3_OP_AND\\\n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":8,"score":86264.71120661046},{"content":" || half_size_cnf == 0\\\n\n || (total_size_cnf - half_size_cnf) == 0 \\\n\n ){\\\n\n axdinterpolator_file.close();\\\n\n system((\"rm -rf \" + file_for_implementation).c_str());\\\n\n system((\"rm -rf \" + temp_file).c_str());\\\n\n return;\\\n\n }\\\n\n \\\n\n part_a.push_back(ctx.bool_val(true));\\\n\n part_b.push_back(ctx.bool_val(true));\\\n\n for(unsigned i = 0; i < half_size_cnf; i++)\\\n\n part_a.push_back(curr_conjunction.arg(i));\\\n\n for(unsigned i = half_size_cnf; i < total_size_cnf; i++)\\\n\n part_b.push_back(curr_conjunction.arg(i));\\\n\n \\\n\n WRITER;\\\n\n \\\n\n char exec_command[1000];\\\n\n EXEC_COMMAND;\\\n\n int ret = system(exec_command);\\\n\n char log_command[1000];\\\n\n LOG_COMMAND;\\\n\n system(log_command);\\\n\n \\\n\n system((\"rm -rf \" + file_for_implementation).c_str());\\\n\n }\n\n\n","file_path":"tests/benchmark/include/UAutomizerFileReader.h","rank":9,"score":86263.44279618328},{"content":"#include \"UAutomizerFileReader.h\"\n\n\n\nstd::string UAutomizerFileReader::nameAssertionsZ3(std::string const & s) const {\n\n std::stringstream decl_strm(s);\n\n std::string curr_line, collected_assertion = \"\", ret = \"\";\n\n bool matching_assert = false, matching_part_a = true;\n\n unsigned num_balanced_paren = 0;\n\n\n\n while(std::getline(decl_strm, curr_line)){\n\n\n\n if(curr_line.find(\"(assert\") != std::string::npos)\n\n matching_assert = true;\n\n\n\n if(matching_assert){\n\n for(auto const & c : curr_line){\n\n if(c == '(')\n\n num_balanced_paren++;\n\n if(c == ')')\n\n num_balanced_paren--;\n\n }\n","file_path":"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp","rank":10,"score":80341.74349391981},{"content":" return ret;\n\n}\n\n\n\nstd::string UAutomizerFileReader::nameAssertionsMathsat(std::string const & s) const {\n\n std::stringstream decl_strm(s);\n\n std::string curr_line, collected_assertion = \"\", ret = \"\";\n\n bool matching_assert = false, matching_part_a = true;\n\n unsigned num_balanced_paren = 0;\n\n\n\n while(std::getline(decl_strm, curr_line)){\n\n\n\n if(curr_line.find(\"(assert\") != std::string::npos)\n\n matching_assert = true;\n\n\n\n if(matching_assert){\n\n for(auto const & c : curr_line){\n\n if(c == '(')\n\n num_balanced_paren++;\n\n if(c == ')')\n\n num_balanced_paren--;\n","file_path":"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp","rank":11,"score":80339.80502556675},{"content":" }\n\n\n\n collected_assertion += curr_line;\n\n if(num_balanced_paren == 0){\n\n matching_assert = false;\n\n collected_assertion = collected_assertion.substr(8);\n\n collected_assertion.pop_back();\n\n if(matching_part_a){\n\n collected_assertion = \"(assert (! \" + collected_assertion +\" :interpolation-group part_a))\";\n\n matching_part_a = false;\n\n }\n\n else\n\n collected_assertion = \"(assert (! \" + collected_assertion +\" :interpolation-group part_b))\";\n\n\n\n ret += collected_assertion + \"\\n\";\n\n collected_assertion = \"\";\n\n }\n\n }\n\n else\n\n ret += curr_line + \"\\n\";\n\n }\n\n return ret;\n\n}\n","file_path":"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp","rank":12,"score":80332.0679691368},{"content":"\n\n collected_assertion += curr_line;\n\n if(num_balanced_paren == 0){\n\n matching_assert = false;\n\n collected_assertion = collected_assertion.substr(8);\n\n collected_assertion.pop_back();\n\n if(matching_part_a){\n\n collected_assertion = \"(assert (! \" + collected_assertion +\" :named part_a))\";\n\n matching_part_a = false;\n\n }\n\n else\n\n collected_assertion = \"(assert (! \" + collected_assertion +\" :named part_b))\";\n\n\n\n ret += collected_assertion + \"\\n\";\n\n collected_assertion = \"\";\n\n }\n\n }\n\n else\n\n ret += curr_line + \"\\n\";\n\n }\n","file_path":"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp","rank":13,"score":80328.43899097358},{"content":" class z3_expr_vector_unique : public z3::expr_vector {\n\n std::set<unsigned> expr_ids;\n\n\n\n public:\n\n z3_expr_vector_unique(z3::context &);\n\n void push(z3::expr const &);\n\n };\n\n\n","file_path":"include/AXDSignature.h","rank":14,"score":71695.18812625401},{"content":" class z3_sort_vector_unique : public z3::sort_vector {\n\n std::set<unsigned> sort_ids;\n\n\n\n public:\n\n z3_sort_vector_unique(z3::context &);\n\n void push(z3::sort const &);\n\n };\n\n\n\n static bool isSpaceOrParen(char);\n\n void extractNameFromSort(std::string &) const;\n\n void processArrayDecls(std::string &);\n\n void indexElementSorts();\n\n\n\n bool is_QF_TO() const;\n\n bool is_QF_IDL() const;\n\n bool isArraySort(z3::sort const &) const;\n\n\n\n void setTheory(TheoryName);\n\n\n\n TheoryName const & getTheoryName() const;\n","file_path":"include/AXDSignature.h","rank":15,"score":71695.18812625401},{"content":" AXDInterpolant(\n\n AXDSignature &, \n\n z3::expr const &,\n\n z3::expr const &,\n\n char const *, \n\n unsigned);\n\n\n\n void z3OutputFile();\n\n void mathsatOutputFile();\n\n void smtInterpolOutputFile();\n\n\n\n friend std::ostream & operator << (\n\n std::ostream &, AXDInterpolant const &);\n\n};\n\n\n\n#endif\n","file_path":"include/AXDInterpolant.h","rank":16,"score":67185.31580865938},{"content":" enum StateOutput { undefined, fine, notfine };\n\n\n\n StandardInput part_a, part_b;\n\n std::string m_file_name;\n\n unsigned num_attempts, remaining_fuel;\n\n bool is_interpolant_computed,\n\n is_unsat,\n\n is_valid_result;\n\n StateOutput state_output;\n\n z3::expr current_interpolant;\n\n z3::solver solver;\n\n\n\n void loop();\n\n\n\n bool testOutput(\n\n z3::expr_vector const &, \n\n z3::expr_vector &, \n\n z3::expr_vector &);\n\n void testOutputArrayAxiomatization(z3::solver &);\n\n void testOutputDiffLifting(\n","file_path":"include/AXDInterpolant.h","rank":17,"score":67181.80398773948},{"content":" z3::solver & s, \n\n StandardInput const &);\n\n\n\n void SmtSolverSetup(\n\n z3::solver &, \n\n StandardInput const &);\n\n void SmtSolverOutStreamSetup(\n\n std::ostream &, \n\n StandardInput const &);\n\n void AB_VectorsSetup(\n\n z3::expr_vector &, \n\n StandardInput const &);\n\n\n\n z3::expr liftInterpolant(z3::expr_vector const &); \n\n void liftInterpolantDiffSubs(\n\n z3::expr_vector &, \n\n z3::expr_vector &, \n\n StandardInput const &); \n\n\n\n public: \n","file_path":"include/AXDInterpolant.h","rank":18,"score":67178.90766004712},{"content":"#ifndef _AXD_INTERPOLANT_\n\n#define _AXD_INTERPOLANT_\n\n\n\n#include \"z3++.h\"\n\n#include <iostream>\n\n#include <utility>\n\n#include <set>\n\n#include <cstring>\n\n#include <fstream>\n\n#include \"Preprocess.h\"\n\n#include \"StandardInput.h\"\n\n\n\n#define _DEBUG_AXD_LOOP_ 0\n\n#define _DEBUG_AXD_CONSTRUCTOR_ 0\n\n#define _TEST_OUTPUT_ 0\n\n#define _TEST_OUTPUT_ORIGINAL_THY_ 0\n\n#define _INCLUDE_OUTPUT_ 1\n\n\n\n#define CURRENT_DIR std::string(\"replace_once\")\n\n#define OUTPUT_DIR CURRENT_DIR + std::string(\"/output\")\n\n\n\n// Notes:\n\n// The input file is a smt2 file\n\n// with two assertions.\n\n// Each assertion is \n\n// of the form (and <pred_1> \\dots <pred_n>).\n\n\n","file_path":"include/AXDInterpolant.h","rank":19,"score":67176.05096247296},{"content":"class AXDInterpolant : public Preprocessor {\n\n\n","file_path":"include/AXDInterpolant.h","rank":20,"score":65546.3856023725},{"content":" system((\"rm -rf \" \n\n + OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\").c_str());\n\n\n\n if(is_valid_result){\n\n // Lift interpolant to MaxDiff(Index Theory)\n\n z3::solver mathsat_interpolant_parser(sig.ctx);\n\n mathsat_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n\n\n is_interpolant_computed = true;\n\n current_interpolant = liftInterpolant(\n\n mathsat_interpolant_parser.assertions());\n\n\n\n#if _TEST_OUTPUT_\n\n TEST_OUTPUT_CODE(mathsat_interpolant_parser);\n\n#endif\n\n }\n\n}\n\n\n\nvoid AXDInterpolant::smtInterpolOutputFile(){\n\n if(!is_unsat)\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":21,"score":61853.15660815486},{"content":" smtinterpol_file << solver.to_smt2_decls_only();\n\n smtinterpol_file << \"(assert (! (and\" << std::endl;\n\n // This true assertion prevents \n\n // an unary application of and\n\n smtinterpol_file << \"true\" << std::endl;\n\n SmtSolverOutStreamSetup(smtinterpol_file, part_a);\n\n smtinterpol_file << \") :named part_a))\" << std::endl;\n\n smtinterpol_file << \"(assert (! (and\" << std::endl;\n\n // This true assertion prevents \n\n // an unary application of and\n\n smtinterpol_file << \"true\" << std::endl;\n\n SmtSolverOutStreamSetup(smtinterpol_file, part_b);\n\n smtinterpol_file << \") :named part_b))\" << std::endl;\n\n smtinterpol_file << \"(check-sat)\" << std::endl;\n\n smtinterpol_file << \"(get-interpolants part_a part_b)\" << std::endl;\n\n\n\n // Obtain reduced interpolant in <m_file_name>temp.smt2\n\n system((\"java -jar \" + CURRENT_DIR \n\n + \"/bin/smtinterpol-2.5-663-gf15aa217.jar -w \" \n\n + OUTPUT_DIR + \"/\" + m_file_name \n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":22,"score":61850.838348579455},{"content":" interpolant_from_file += \"(check-sat)\\n\";\n\n system((\"rm -rf \" \n\n + OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\").c_str());\n\n\n\n if(is_valid_result){\n\n // Lift interpolant to MaxDiff(Index Theory)\n\n z3::solver z3_interpolant_parser(sig.ctx);\n\n z3_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n\n\n is_interpolant_computed = true;\n\n current_interpolant = liftInterpolant(\n\n z3_interpolant_parser.assertions());\n\n\n\n#if _TEST_OUTPUT_\n\n TEST_OUTPUT_CODE(z3_interpolant_parser);\n\n#endif\n\n }\n\n}\n\n\n\nvoid AXDInterpolant::mathsatOutputFile(){\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":23,"score":61850.643193305215},{"content":" interpolant_from_file += line.erase(0, 1) + \"\\n\";\n\n // The following removes the last parenthesis \n\n // and the extra '\\n'\n\n interpolant_from_file.erase(interpolant_from_file.size() - 2, 2);\n\n is_valid_result = interpolant_from_file.size() > 0;\n\n // Only one parenthesis is needed to close\n\n // the above since the content of (interpolant *)\n\n // includes an additional parenthesis\n\n interpolant_from_file += \")\\n\";\n\n interpolant_from_file += \"(check-sat)\\n\";\n\n //system((\"rm -rf \" \n\n //+ OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\").c_str());\n\n\n\n if(is_valid_result){\n\n // Lift interpolant to MaxDiff(Index Theory)\n\n z3::solver smtinterpol_interpolant_parser(sig.ctx);\n\n smtinterpol_interpolant_parser.from_string(interpolant_from_file.c_str());\n\n\n\n is_interpolant_computed = true;\n\n current_interpolant = liftInterpolant(\n\n smtinterpol_interpolant_parser.assertions());\n\n\n\n#if _TEST_OUTPUT_\n\n TEST_OUTPUT_CODE(smtinterpol_interpolant_parser);\n\n#endif\n\n }\n\n}\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":24,"score":61850.375009613825},{"content":" mathsat_file << solver.to_smt2_decls_only();\n\n mathsat_file << \"(assert (! (and\" << std::endl;\n\n // This true assertion prevents \n\n // an unary application of and\n\n mathsat_file << \"true\" << std::endl;\n\n SmtSolverOutStreamSetup(mathsat_file, part_a);\n\n mathsat_file << \") :interpolation-group part_a))\" << std::endl;\n\n mathsat_file << \"(assert (! (and \" << std::endl;\n\n // This true assertion prevents \n\n // an unary application of and\n\n mathsat_file << \"true\" << std::endl;\n\n SmtSolverOutStreamSetup(mathsat_file, part_b);\n\n mathsat_file << \") :interpolation-group part_b))\" << std::endl;\n\n mathsat_file << \"(check-sat)\" << std::endl;\n\n mathsat_file << \"(get-interpolant (part_a))\" << std::endl;\n\n mathsat_file << \"(exit)\" << std::endl;\n\n\n\n // Obtain reduced interpolant in <m_file_name>temp.smt2\n\n system((CURRENT_DIR \n\n + \"/bin/mathsat \" \n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":25,"score":61849.2297480949},{"content":" // to parse reduced interpolant\n\n std::ifstream result(OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\");\n\n std::string line(\"\"), interpolant_from_file(\"\");\n\n // We consume two lines because\n\n // z3 outputs \"check-sat\" followed\n\n // a line containing \"(interpolants\", followed\n\n // by the interpolant\n\n std::getline(result, line);\n\n std::getline(result, line);\n\n\n\n interpolant_from_file += solver.to_smt2_decls_only();\n\n interpolant_from_file += \"(assert (and\\n\";\n\n while(std::getline(result, line)){\n\n is_valid_result = true;\n\n interpolant_from_file += line + \"\\n\";\n\n }\n\n // Only one parenthesis is needed to close\n\n // the above since the content of (interpolant *)\n\n // includes an additional parenthesis\n\n interpolant_from_file += \")\\n\";\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":26,"score":61846.672774480525},{"content":" + OUTPUT_DIR + \"/\" + m_file_name \n\n + \"_reduced_mathsat.smt2 > \" \n\n + OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\").c_str());\n\n\n\n // Setup *_reduced_interpolant_mathsat.smt2 file\n\n // to parse reduced interpolant\n\n std::ifstream result(OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\");\n\n std::string line(\"\"), interpolant_from_file(\"\");\n\n // We consume one line because\n\n // mathsat outputs \"check-sat\" followed\n\n // by the interpolant\n\n std::getline(result, line);\n\n interpolant_from_file += solver.to_smt2_decls_only();\n\n interpolant_from_file += \"(assert \\n\";\n\n while(std::getline(result, line)){\n\n is_valid_result = true;\n\n interpolant_from_file += line + \"\\n\";\n\n }\n\n interpolant_from_file += \")\\n\";\n\n interpolant_from_file += \"(check-sat)\\n\";\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":27,"score":61846.15717889502},{"content":" + \"_reduced_smtinterpol.smt2 > \"\n\n + OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\").c_str());\n\n\n\n // Setup *_reduced_interpolant_smtinterpol.smt2 file\n\n // to parse reduced interpolant\n\n std::ifstream result(OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\");\n\n std::string line(\"\"), interpolant_from_file(\"\");\n\n // We consume one line because\n\n // mathsat outputs \"check-sat\" followed\n\n // by the interpolant\n\n std::getline(result, line);\n\n interpolant_from_file += solver.to_smt2_decls_only();\n\n interpolant_from_file += \"(assert \\n\";\n\n // SMTINTERPOL returns a single\n\n // line containing a list\n\n // of sequence interpolants\n\n // Thus, we remove the initial and\n\n // last character which are '(' and ')' \n\n // respectively\n\n std::getline(result, line);\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":28,"score":61845.74856239847},{"content":"#include \"AXDInterpolant.h\"\n\n\n\n#define TEST_OUTPUT_CODE(PARSED_FROM_SOLVER_INTERPOLANT) \\\n\n z3::expr_vector _part_a_vector(sig.ctx); \\\n\n z3::expr_vector _part_b_vector(sig.ctx); \\\n\n AB_VectorsSetup(_part_a_vector, part_a); \\\n\n AB_VectorsSetup(_part_b_vector, part_b); \\\n\n if(testOutput(PARSED_FROM_SOLVER_INTERPOLANT.assertions(), \\\n\n _part_a_vector, _part_b_vector)) \\\n\n state_output = fine; \\\n\n else \\\n\n state_output = notfine;\n\n\n\nvoid AXDInterpolant::z3OutputFile(){\n\n if(!is_unsat)\n\n throw \n\n \"Input problem \"\n\n \"is not unsatisfiable.\";\n\n // Setup smt2 file with reduced formulas\n\n // in Index Theory + EUF\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":29,"score":61845.05334253524},{"content":" z3_file << \"true\" << std::endl;\n\n SmtSolverOutStreamSetup(z3_file, part_a);\n\n z3_file << \") :named part_a))\" << std::endl;\n\n z3_file << \"(assert (! (and\" << std::endl;\n\n // This true assertion prevents \n\n // an unary application of and\n\n z3_file << \"true\" << std::endl;\n\n SmtSolverOutStreamSetup(z3_file, part_b);\n\n z3_file << \") :named part_b))\" << std::endl;\n\n z3_file << \"(check-sat)\" << std::endl;\n\n z3_file << \"(get-interpolant part_a part_b)\" << std::endl;\n\n\n\n // Obtain reduced interpolant in <m_file_name>temp.smt2\n\n system((CURRENT_DIR \n\n + \"/bin/z3 \" \n\n + OUTPUT_DIR + \"/\" + m_file_name \n\n + \"_reduced_z3.smt2 > \"\n\n + OUTPUT_DIR + \"/\" + m_file_name + \"temp.smt2\").c_str());\n\n\n\n // Setup *_reduced_interpolant_z3.smt2 file\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":30,"score":61843.75598395975},{"content":" system((\"mkdir -p \" + OUTPUT_DIR).c_str());\n\n std::ofstream z3_file(\n\n OUTPUT_DIR + \"/\" + m_file_name \n\n + \"_reduced_z3.smt2\");\n\n\n\n z3_file \n\n << \"(set-option :produce-interpolants true)\" \n\n << std::endl;\n\n // Setup logic engine\n\n z3_file \n\n << \"(set-logic \" \n\n << ( (sig.is_QF_TO() ||\n\n sig.is_QF_IDL()) ? \n\n \"QF_UFIDL\" : \"QF_UFLIA\") << \")\" << std::endl;\n\n //\"QF_UFLIA\" : \"QF_UFLIA\") << \")\" << std::endl;\n\n\n\n z3_file << solver.to_smt2_decls_only();\n\n z3_file << \"(assert (! (and\" << std::endl;\n\n // This true assertion prevents \n\n // an unary application of and\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":31,"score":61841.808151311736},{"content":" if(!is_unsat)\n\n throw \n\n \"Input problem is not unsatisfiable.\";\n\n // Setup smt2 file with reduced formulas\n\n // in Index Theory + EUF\n\n system((\"mkdir -p \" + OUTPUT_DIR).c_str());\n\n std::ofstream mathsat_file(\n\n OUTPUT_DIR + \"/\" + m_file_name \n\n + \"_reduced_mathsat.smt2\");\n\n\n\n mathsat_file \n\n << \"(set-option :produce-interpolants true)\" \n\n << std::endl;\n\n // Setup logic engine\n\n mathsat_file \n\n << \"(set-logic \" \n\n << ((sig.is_QF_TO() ||\n\n sig.is_QF_IDL()) ? \n\n \"QF_UFIDL\" : \"QF_UFLIA\") << \")\" << std::endl;\n\n\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":32,"score":61838.869314587384},{"content":" throw \n\n \"Input problem is not unsatisfiable.\";\n\n // Setup smt2 file with reduced formulas\n\n // in Index Theory + EUF\n\n system((\"mkdir -p \" + OUTPUT_DIR).c_str());\n\n std::ofstream smtinterpol_file(\n\n OUTPUT_DIR + \"/\" + m_file_name \n\n + \"_reduced_smtinterpol.smt2\");\n\n\n\n smtinterpol_file \n\n << \"(set-option :print-success false)\\n\" \n\n << \"(set-option :produce-interpolants true)\" \n\n << std::endl;\n\n // Setup logic engine\n\n smtinterpol_file \n\n << \"(set-logic \" \n\n << ((sig.is_QF_TO() ||\n\n sig.is_QF_IDL()) ? \n\n \"QF_UFIDL\" : \"QF_UFLIA\") << \")\" << std::endl;\n\n\n","file_path":"src/AXDInterpolant-OutputFile.cpp","rank":33,"score":61836.27939505367},{"content":" m_ctx = s.m_ctx;\n\n m_solver = s.m_solver;\n\n return *this;\n\n }\n\n void set(params const & p) { Z3_solver_set_params(ctx(), m_solver, p); check_error(); }\n\n void set(char const * k, bool v) { params p(ctx()); p.set(k, v); set(p); }\n\n void set(char const * k, unsigned v) { params p(ctx()); p.set(k, v); set(p); }\n\n void set(char const * k, double v) { params p(ctx()); p.set(k, v); set(p); }\n\n void set(char const * k, symbol const & v) { params p(ctx()); p.set(k, v); set(p); }\n\n void set(char const * k, char const* v) { params p(ctx()); p.set(k, v); set(p); }\n\n void push() { Z3_solver_push(ctx(), m_solver); check_error(); }\n\n void pop(unsigned n = 1) { Z3_solver_pop(ctx(), m_solver, n); check_error(); }\n\n void reset() { Z3_solver_reset(ctx(), m_solver); check_error(); }\n\n void add(expr const & e) { assert(e.is_bool()); Z3_solver_assert(ctx(), m_solver, e); check_error(); }\n\n void add(expr const & e, expr const & p) {\n\n assert(e.is_bool()); assert(p.is_bool()); assert(p.is_const());\n\n Z3_solver_assert_and_track(ctx(), m_solver, e, p);\n\n check_error();\n\n }\n\n void add(expr const & e, char const * p) {\n","file_path":"tests/benchmark/include/z3++.h","rank":34,"score":61477.63592197766},{"content":" add(e, ctx().bool_const(p));\n\n }\n\n // fails for some compilers: \n\n // void add(expr_vector const& v) { check_context(*this, v); for (expr e : v) add(e); }\n\n void from_file(char const* file) { Z3_solver_from_file(ctx(), m_solver, file); ctx().check_parser_error(); }\n\n void from_string(char const* s) { Z3_solver_from_string(ctx(), m_solver, s); ctx().check_parser_error(); }\n\n\n\n check_result check() { Z3_lbool r = Z3_solver_check(ctx(), m_solver); check_error(); return to_check_result(r); }\n\n check_result check(unsigned n, expr * const assumptions) {\n\n array<Z3_ast> _assumptions(n);\n\n for (unsigned i = 0; i < n; i++) {\n\n check_context(*this, assumptions[i]);\n\n _assumptions[i] = assumptions[i];\n\n }\n\n Z3_lbool r = Z3_solver_check_assumptions(ctx(), m_solver, n, _assumptions.ptr());\n\n check_error();\n\n return to_check_result(r);\n\n }\n\n check_result check(expr_vector assumptions) {\n\n unsigned n = assumptions.size();\n","file_path":"tests/benchmark/include/z3++.h","rank":35,"score":61474.061756000614},{"content":" \\brief Return true if this expression is a constant (i.e., an application with 0 arguments).\n\n */\n\n bool is_const() const { return is_app() && num_args() == 0; }\n\n /**\n\n \\brief Return true if this expression is a quantifier.\n\n */\n\n bool is_quantifier() const { return kind() == Z3_QUANTIFIER_AST; }\n\n /**\n\n \\brief Return true if this expression is a variable.\n\n */\n\n bool is_var() const { return kind() == Z3_VAR_AST; }\n\n /**\n\n \\brief Return true if expression is an algebraic number.\n\n */\n\n bool is_algebraic() const { return 0 != Z3_is_algebraic_number(ctx(), m_ast); }\n\n\n\n /**\n\n \\brief Return true if this expression is well sorted (aka type correct).\n\n */\n\n bool is_well_sorted() const { bool r = Z3_is_well_sorted(ctx(), m_ast) != 0; check_error(); return r; }\n","file_path":"tests/benchmark/include/z3++.h","rank":36,"score":61469.96957382528},{"content":" }\n\n\n\n std::string to_smt2_decls_only(char const* status = \"unknown\") {\n\n array<Z3_ast> es(assertions());\n\n Z3_ast const* fmls = es.ptr();\n\n Z3_ast fml = 0;\n\n unsigned sz = es.size();\n\n if (sz > 0) {\n\n --sz;\n\n fml = fmls[sz];\n\n }\n\n else {\n\n fml = ctx().bool_val(true);\n\n }\n\n return std::string(Z3_benchmark_to_smtlib_string_decls_only(\n\n ctx(),\n\n \"\", \"\", status, \"\",\n\n sz,\n\n fmls,\n\n fml));\n\n }\n\n\n\n param_descrs get_param_descrs() { return param_descrs(ctx(), Z3_solver_get_param_descrs(ctx(), m_solver)); }\n\n\n\n };\n\n inline std::ostream & operator<<(std::ostream & out, solver const & s) { out << Z3_solver_to_string(s.ctx(), s); return out; }\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":37,"score":61469.41788273367},{"content":"\n\n inline check_result context::compute_interpolant(expr const& pat, params const& p, expr_vector& i, model& m) {\n\n Z3_ast_vector interp = 0;\n\n Z3_model mdl = 0;\n\n Z3_lbool r = Z3_compute_interpolant(*this, pat, p, &interp, &mdl);\n\n switch (r) {\n\n case Z3_L_FALSE:\n\n i = expr_vector(*this, interp);\n\n break;\n\n case Z3_L_TRUE:\n\n m = model(*this, mdl);\n\n break;\n\n case Z3_L_UNDEF:\n\n break;\n\n }\n\n return to_check_result(r);\n\n }\n\n\n\n inline expr_vector context::get_interpolant(expr const& proof, expr const& pat, params const& p) {\n\n return expr_vector(*this, Z3_get_interpolant(*this, proof, pat, p));\n","file_path":"tests/benchmark/include/z3++.h","rank":38,"score":61469.38068112327},{"content":" struct interpolation {};\n\n context() { config c; init(c); }\n\n context(config & c) { init(c); }\n\n context(config & c, interpolation) { init_interp(c); }\n\n ~context() { Z3_del_context(m_ctx); }\n\n operator Z3_context() const { return m_ctx; }\n\n\n\n /**\n\n \\brief Auxiliary method used to check for API usage errors.\n\n */\n\n Z3_error_code check_error() const {\n\n Z3_error_code e = Z3_get_error_code(m_ctx);\n\n if (e != Z3_OK && enable_exceptions())\n\n Z3_THROW(exception(Z3_get_error_msg(m_ctx, e)));\n\n return e;\n\n }\n\n\n\n void check_parser_error() const {\n\n check_error();\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":39,"score":61468.98666672524},{"content":" friend std::ostream & operator<<(std::ostream & out, solver const & s);\n\n\n\n std::string to_smt2(char const* status = \"unknown\") {\n\n array<Z3_ast> es(assertions());\n\n Z3_ast const* fmls = es.ptr();\n\n Z3_ast fml = 0;\n\n unsigned sz = es.size();\n\n if (sz > 0) {\n\n --sz;\n\n fml = fmls[sz];\n\n }\n\n else {\n\n fml = ctx().bool_val(true);\n\n }\n\n return std::string(Z3_benchmark_to_smtlib_string(\n\n ctx(),\n\n \"\", \"\", status, \"\",\n\n sz,\n\n fmls,\n\n fml));\n","file_path":"tests/benchmark/include/z3++.h","rank":40,"score":61468.9532931074},{"content":" void push() {\n\n Z3_optimize_push(ctx(), m_opt);\n\n }\n\n void pop() {\n\n Z3_optimize_pop(ctx(), m_opt);\n\n }\n\n check_result check() { Z3_lbool r = Z3_optimize_check(ctx(), m_opt); check_error(); return to_check_result(r); }\n\n model get_model() const { Z3_model m = Z3_optimize_get_model(ctx(), m_opt); check_error(); return model(ctx(), m); }\n\n void set(params const & p) { Z3_optimize_set_params(ctx(), m_opt, p); check_error(); }\n\n expr lower(handle const& h) {\n\n Z3_ast r = Z3_optimize_get_lower(ctx(), m_opt, h.h());\n\n check_error();\n\n return expr(ctx(), r);\n\n }\n\n expr upper(handle const& h) {\n\n Z3_ast r = Z3_optimize_get_upper(ctx(), m_opt, h.h());\n\n check_error();\n\n return expr(ctx(), r);\n\n }\n\n expr_vector assertions() const { Z3_ast_vector r = Z3_optimize_get_assertions(ctx(), m_opt); check_error(); return expr_vector(ctx(), r); }\n\n expr_vector objectives() const { Z3_ast_vector r = Z3_optimize_get_objectives(ctx(), m_opt); check_error(); return expr_vector(ctx(), r); }\n\n stats statistics() const { Z3_stats r = Z3_optimize_get_statistics(ctx(), m_opt); check_error(); return stats(ctx(), r); }\n\n friend std::ostream & operator<<(std::ostream & out, optimize const & s);\n\n void from_file(char const* filename) { Z3_optimize_from_file(ctx(), m_opt, filename); check_error(); }\n\n void from_string(char const* constraints) { Z3_optimize_from_string(ctx(), m_opt, constraints); check_error(); }\n\n std::string help() const { char const * r = Z3_optimize_get_help(ctx(), m_opt); check_error(); return r; }\n\n };\n\n inline std::ostream & operator<<(std::ostream & out, optimize const & s) { out << Z3_optimize_to_string(s.ctx(), s.m_opt); return out; }\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":41,"score":61468.82592978601},{"content":" array<Z3_ast> _assumptions(n);\n\n for (unsigned i = 0; i < n; i++) {\n\n check_context(*this, assumptions[i]);\n\n _assumptions[i] = assumptions[i];\n\n }\n\n Z3_lbool r = Z3_solver_check_assumptions(ctx(), m_solver, n, _assumptions.ptr());\n\n check_error();\n\n return to_check_result(r);\n\n }\n\n model get_model() const { Z3_model m = Z3_solver_get_model(ctx(), m_solver); check_error(); return model(ctx(), m); }\n\n check_result consequences(expr_vector& assumptions, expr_vector& vars, expr_vector& conseq) {\n\n Z3_lbool r = Z3_solver_get_consequences(ctx(), m_solver, assumptions, vars, conseq);\n\n check_error();\n\n return to_check_result(r);\n\n }\n\n std::string reason_unknown() const { Z3_string r = Z3_solver_get_reason_unknown(ctx(), m_solver); check_error(); return r; }\n\n stats statistics() const { Z3_stats r = Z3_solver_get_statistics(ctx(), m_solver); check_error(); return stats(ctx(), r); }\n\n expr_vector unsat_core() const { Z3_ast_vector r = Z3_solver_get_unsat_core(ctx(), m_solver); check_error(); return expr_vector(ctx(), r); }\n\n expr_vector assertions() const { Z3_ast_vector r = Z3_solver_get_assertions(ctx(), m_solver); check_error(); return expr_vector(ctx(), r); }\n\n expr proof() const { Z3_ast r = Z3_solver_get_proof(ctx(), m_solver); check_error(); return expr(ctx(), r); }\n","file_path":"tests/benchmark/include/z3++.h","rank":42,"score":61468.77398308263},{"content":" /**\n\n \\brief Return true if this sort is a regular expression sort.\n\n */\n\n bool is_re() const { return sort_kind() == Z3_RE_SORT; }\n\n /**\n\n \\brief Return true if this sort is a Finite domain sort.\n\n */\n\n bool is_finite_domain() const { return sort_kind() == Z3_FINITE_DOMAIN_SORT; }\n\n\n\n /**\n\n \\brief Return the size of this Bit-vector sort.\n\n\n\n \\pre is_bv()\n\n */\n\n unsigned bv_size() const { assert(is_bv()); unsigned r = Z3_get_bv_sort_size(ctx(), *this); check_error(); return r; }\n\n\n\n /**\n\n \\brief Return the domain of this Array sort.\n\n\n\n \\pre is_array()\n","file_path":"tests/benchmark/include/z3++.h","rank":43,"score":61468.66113941707},{"content":" void add(expr const& e) {\n\n assert(e.is_bool());\n\n Z3_optimize_assert(ctx(), m_opt, e);\n\n }\n\n handle add(expr const& e, unsigned weight) {\n\n assert(e.is_bool());\n\n std::stringstream strm;\n\n strm << weight;\n\n return handle(Z3_optimize_assert_soft(ctx(), m_opt, e, strm.str().c_str(), 0));\n\n }\n\n handle add(expr const& e, char const* weight) {\n\n assert(e.is_bool());\n\n return handle(Z3_optimize_assert_soft(ctx(), m_opt, e, weight, 0));\n\n }\n\n handle maximize(expr const& e) {\n\n return handle(Z3_optimize_maximize(ctx(), m_opt, e));\n\n }\n\n handle minimize(expr const& e) {\n\n return handle(Z3_optimize_minimize(ctx(), m_opt, e));\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":44,"score":61468.071574780115},{"content":" /**\n\n \\brief Return true if this sort is a Bit-vector sort.\n\n */\n\n bool is_bv() const { return sort_kind() == Z3_BV_SORT; }\n\n /**\n\n \\brief Return true if this sort is a Array sort.\n\n */\n\n bool is_array() const { return sort_kind() == Z3_ARRAY_SORT; }\n\n /**\n\n \\brief Return true if this sort is a Datatype sort.\n\n */\n\n bool is_datatype() const { return sort_kind() == Z3_DATATYPE_SORT; }\n\n /**\n\n \\brief Return true if this sort is a Relation sort.\n\n */\n\n bool is_relation() const { return sort_kind() == Z3_RELATION_SORT; }\n\n /**\n\n \\brief Return true if this sort is a Sequence sort.\n\n */\n\n bool is_seq() const { return sort_kind() == Z3_SEQ_SORT; }\n","file_path":"tests/benchmark/include/z3++.h","rank":45,"score":61468.047121064476},{"content":" /**\n\n \\brief Return name of sort.\n\n */\n\n symbol name() const { Z3_symbol s = Z3_get_sort_name(ctx(), *this); check_error(); return symbol(ctx(), s); }\n\n /**\n\n \\brief Return true if this sort is the Boolean sort.\n\n */\n\n bool is_bool() const { return sort_kind() == Z3_BOOL_SORT; }\n\n /**\n\n \\brief Return true if this sort is the Integer sort.\n\n */\n\n bool is_int() const { return sort_kind() == Z3_INT_SORT; }\n\n /**\n\n \\brief Return true if this sort is the Real sort.\n\n */\n\n bool is_real() const { return sort_kind() == Z3_REAL_SORT; }\n\n /**\n\n \\brief Return true if this sort is the Integer or Real sort.\n\n */\n\n bool is_arith() const { return is_int() || is_real(); }\n","file_path":"tests/benchmark/include/z3++.h","rank":46,"score":61467.766146593596},{"content":"\n\n /**\n\n \\brief Return string representation of numeral or algebraic number\n\n This method assumes the expression is numeral or algebraic\n\n\n\n \\pre is_numeral() || is_algebraic()\n\n */\n\n std::string get_decimal_string(int precision) const {\n\n assert(is_numeral() || is_algebraic());\n\n return std::string(Z3_get_numeral_decimal_string(ctx(), m_ast, precision));\n\n }\n\n\n\n /**\n\n \\brief retrieve unique identifier for expression.\n\n */\n\n unsigned id() const { unsigned r = Z3_get_ast_id(ctx(), m_ast); check_error(); return r; }\n\n\n\n /**\n\n \\brief Return int value of numeral, throw if result cannot fit in\n\n machine int\n","file_path":"tests/benchmark/include/z3++.h","rank":47,"score":61467.446002362354},{"content":" }\n\n\n\n inline expr context::constant(symbol const & name, sort const & s) {\n\n Z3_ast r = Z3_mk_const(m_ctx, name, s);\n\n check_error();\n\n return expr(*this, r);\n\n }\n\n inline expr context::constant(char const * name, sort const & s) { return constant(str_symbol(name), s); }\n\n inline expr context::bool_const(char const * name) { return constant(name, bool_sort()); }\n\n inline expr context::int_const(char const * name) { return constant(name, int_sort()); }\n\n inline expr context::real_const(char const * name) { return constant(name, real_sort()); }\n\n inline expr context::bv_const(char const * name, unsigned sz) { return constant(name, bv_sort(sz)); }\n\n\n\n inline expr context::bool_val(bool b) { return b ? expr(*this, Z3_mk_true(m_ctx)) : expr(*this, Z3_mk_false(m_ctx)); }\n\n\n\n inline expr context::int_val(int n) { Z3_ast r = Z3_mk_int(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\n\n inline expr context::int_val(unsigned n) { Z3_ast r = Z3_mk_unsigned_int(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\n\n inline expr context::int_val(int64_t n) { Z3_ast r = Z3_mk_int64(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\n\n inline expr context::int_val(uint64_t n) { Z3_ast r = Z3_mk_unsigned_int64(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\n\n inline expr context::int_val(char const * n) { Z3_ast r = Z3_mk_numeral(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\n","file_path":"tests/benchmark/include/z3++.h","rank":48,"score":61467.3715541529},{"content":"\n\n /**\n\n \\brief The C++ API uses by defaults exceptions on errors. \n\n For applications that don't work well with exceptions (there should be only few)\n\n you have the ability to turn off exceptions. The tradeoffs are that applications\n\n have to very careful about using check_error() after calls that may result in an\n\n erroneous state.\n\n */\n\n void set_enable_exceptions(bool f) { m_enable_exceptions = f; }\n\n\n\n bool enable_exceptions() const { return m_enable_exceptions; }\n\n\n\n /**\n\n \\brief Update global parameter \\c param with string \\c value.\n\n */\n\n void set(char const * param, char const * value) { Z3_update_param_value(m_ctx, param, value); }\n\n /**\n\n \\brief Update global parameter \\c param with Boolean \\c value.\n\n */\n\n void set(char const * param, bool value) { Z3_update_param_value(m_ctx, param, value ? \"true\" : \"false\"); }\n","file_path":"tests/benchmark/include/z3++.h","rank":49,"score":61467.24230576754},{"content":" // fails for some compilers: \n\n // void add(expr_vector const& v) { check_context(*this, v); for (expr e : v) add(e); }\n\n unsigned size() const { return Z3_goal_size(ctx(), m_goal); }\n\n expr operator[](int i) const { assert(0 <= i); Z3_ast r = Z3_goal_formula(ctx(), m_goal, i); check_error(); return expr(ctx(), r); }\n\n Z3_goal_prec precision() const { return Z3_goal_precision(ctx(), m_goal); }\n\n bool inconsistent() const { return Z3_goal_inconsistent(ctx(), m_goal) != 0; }\n\n unsigned depth() const { return Z3_goal_depth(ctx(), m_goal); }\n\n void reset() { Z3_goal_reset(ctx(), m_goal); }\n\n unsigned num_exprs() const { return Z3_goal_num_exprs(ctx(), m_goal); }\n\n bool is_decided_sat() const { return Z3_goal_is_decided_sat(ctx(), m_goal) != 0; }\n\n bool is_decided_unsat() const { return Z3_goal_is_decided_unsat(ctx(), m_goal) != 0; }\n\n expr as_expr() const {\n\n unsigned n = size();\n\n if (n == 0)\n\n return ctx().bool_val(true);\n\n else if (n == 1)\n\n return operator[](0);\n\n else {\n\n array<Z3_ast> args(n);\n\n for (unsigned i = 0; i < n; i++)\n\n args[i] = operator[](i);\n\n return expr(ctx(), Z3_mk_and(ctx(), n, args.ptr()));\n\n }\n\n }\n\n friend std::ostream & operator<<(std::ostream & out, goal const & g);\n\n };\n\n inline std::ostream & operator<<(std::ostream & out, goal const & g) { out << Z3_goal_to_string(g.ctx(), g); return out; }\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":50,"score":61467.1534486413},{"content":" expr string_val(std::string const& s);\n\n\n\n expr num_val(int n, sort const & s);\n\n\n\n /**\n\n \\brief parsing\n\n */\n\n expr parse_string(char const* s);\n\n expr parse_file(char const* file);\n\n\n\n expr parse_string(char const* s, sort_vector const& sorts, func_decl_vector const& decls);\n\n expr parse_file(char const* s, sort_vector const& sorts, func_decl_vector const& decls);\n\n\n\n /**\n\n \\brief Interpolation support\n\n */\n\n check_result compute_interpolant(expr const& pat, params const& p, expr_vector& interp, model& m);\n\n expr_vector get_interpolant(expr const& proof, expr const& pat, params const& p);\n\n\n\n };\n\n\n\n\n\n\n\n\n\n template<typename T>\n","file_path":"tests/benchmark/include/z3++.h","rank":51,"score":61466.90554983995},{"content":" std::ostringstream oss;\n\n oss << value;\n\n Z3_set_param_value(m_cfg, param, oss.str().c_str());\n\n }\n\n };\n\n\n\n enum check_result {\n\n unsat, sat, unknown\n\n };\n\n\n\n inline check_result to_check_result(Z3_lbool l) {\n\n if (l == Z3_L_TRUE) return sat;\n\n else if (l == Z3_L_FALSE) return unsat;\n\n return unknown;\n\n }\n\n\n\n\n\n /**\n\n \\brief A Context manages all other Z3 objects, global configuration options, etc.\n\n */\n","file_path":"tests/benchmark/include/z3++.h","rank":52,"score":61465.9796194958},{"content":" /**\n\n \\brief Update global parameter \\c param with Integer \\c value.\n\n */\n\n void set(char const * param, int value) {\n\n std::ostringstream oss;\n\n oss << value;\n\n Z3_update_param_value(m_ctx, param, oss.str().c_str());\n\n }\n\n\n\n /**\n\n \\brief Interrupt the current procedure being executed by any object managed by this context.\n\n This is a soft interruption: there is no guarantee the object will actually stop.\n\n */\n\n void interrupt() { Z3_interrupt(m_ctx); }\n\n\n\n /**\n\n \\brief Create a Z3 symbol based on the given string.\n\n */\n\n symbol str_symbol(char const * s);\n\n /**\n","file_path":"tests/benchmark/include/z3++.h","rank":53,"score":61465.72977538604},{"content":" }\n\n\n\n\n\n expr denominator() const { \n\n assert(is_numeral());\n\n Z3_ast r = Z3_get_denominator(ctx(), m_ast);\n\n check_error();\n\n return expr(ctx(),r);\n\n }\n\n\n\n operator Z3_app() const { assert(is_app()); return reinterpret_cast<Z3_app>(m_ast); }\n\n\n\n /**\n\n \\brief Return the declaration associated with this application.\n\n This method assumes the expression is an application.\n\n\n\n \\pre is_app()\n\n */\n\n func_decl decl() const { Z3_func_decl f = Z3_get_app_decl(ctx(), *this); check_error(); return func_decl(ctx(), f); }\n\n /**\n","file_path":"tests/benchmark/include/z3++.h","rank":54,"score":61465.606583020206},{"content":" }\n\n\n\n expr eval(expr const & n, bool model_completion=false) const {\n\n check_context(*this, n);\n\n Z3_ast r = 0;\n\n Z3_bool status = Z3_model_eval(ctx(), m_model, n, model_completion, &r);\n\n check_error();\n\n if (status == Z3_FALSE && ctx().enable_exceptions())\n\n Z3_THROW(exception(\"failed to evaluate expression\"));\n\n return expr(ctx(), r);\n\n }\n\n\n\n unsigned num_consts() const { return Z3_model_get_num_consts(ctx(), m_model); }\n\n unsigned num_funcs() const { return Z3_model_get_num_funcs(ctx(), m_model); }\n\n func_decl get_const_decl(unsigned i) const { Z3_func_decl r = Z3_model_get_const_decl(ctx(), m_model, i); check_error(); return func_decl(ctx(), r); }\n\n func_decl get_func_decl(unsigned i) const { Z3_func_decl r = Z3_model_get_func_decl(ctx(), m_model, i); check_error(); return func_decl(ctx(), r); }\n\n unsigned size() const { return num_consts() + num_funcs(); }\n\n func_decl operator[](int i) const {\n\n assert(0 <= i);\n\n return static_cast<unsigned>(i) < num_consts() ? get_const_decl(i) : get_func_decl(i - num_consts());\n","file_path":"tests/benchmark/include/z3++.h","rank":55,"score":61465.53892063701},{"content":" /**\n\n \\brief Return true if this is a real expression.\n\n */\n\n bool is_real() const { return get_sort().is_real(); }\n\n /**\n\n \\brief Return true if this is an integer or real expression.\n\n */\n\n bool is_arith() const { return get_sort().is_arith(); }\n\n /**\n\n \\brief Return true if this is a Bit-vector expression.\n\n */\n\n bool is_bv() const { return get_sort().is_bv(); }\n\n /**\n\n \\brief Return true if this is a Array expression.\n\n */\n\n bool is_array() const { return get_sort().is_array(); }\n\n /**\n\n \\brief Return true if this is a Datatype expression.\n\n */\n\n bool is_datatype() const { return get_sort().is_datatype(); }\n","file_path":"tests/benchmark/include/z3++.h","rank":56,"score":61465.32635879207},{"content":" expr body() const { assert(is_quantifier()); Z3_ast r = Z3_get_quantifier_body(ctx(), *this); check_error(); return expr(ctx(), r); }\n\n\n\n /**\n\n \\brief Return an expression representing <tt>not(a)</tt>.\n\n\n\n \\pre a.is_bool()\n\n */\n\n friend expr operator!(expr const & a);\n\n\n\n\n\n /**\n\n \\brief Return an expression representing <tt>a and b</tt>.\n\n\n\n \\pre a.is_bool()\n\n \\pre b.is_bool()\n\n */\n\n friend expr operator&&(expr const & a, expr const & b);\n\n\n\n\n\n /**\n","file_path":"tests/benchmark/include/z3++.h","rank":57,"score":61465.22469356369},{"content":" */\n\n sort array_domain() const { assert(is_array()); Z3_sort s = Z3_get_array_sort_domain(ctx(), *this); check_error(); return sort(ctx(), s); }\n\n /**\n\n \\brief Return the range of this Array sort.\n\n\n\n \\pre is_array()\n\n */\n\n sort array_range() const { assert(is_array()); Z3_sort s = Z3_get_array_sort_range(ctx(), *this); check_error(); return sort(ctx(), s); }\n\n };\n\n\n\n /**\n\n \\brief Function declaration (aka function definition). It is the signature of interpreted and uninterpreted functions in Z3.\n\n The basic building block in Z3 is the function application.\n\n */\n","file_path":"tests/benchmark/include/z3++.h","rank":58,"score":61465.21888538067},{"content":" MK_EXPR1(Z3_mk_re_complement, a);\n\n }\n\n inline expr range(expr const& lo, expr const& hi) {\n\n check_context(lo, hi); \n\n Z3_ast r = Z3_mk_re_range(lo.ctx(), lo, hi); \n\n lo.check_error(); \n\n return expr(lo.ctx(), r); \n\n }\n\n\n\n\n\n\n\n\n\n\n\n inline expr interpolant(expr const& a) {\n\n return expr(a.ctx(), Z3_mk_interpolant(a.ctx(), a));\n\n }\n\n\n\n inline expr context::parse_string(char const* s) {\n\n Z3_ast r = Z3_parse_smtlib2_string(*this, s, 0, 0, 0, 0, 0, 0);\n\n check_parser_error();\n","file_path":"tests/benchmark/include/z3++.h","rank":59,"score":61465.20904135312},{"content":" return expr(*this, r); \n\n }\n\n inline expr context::parse_file(char const* s) {\n\n Z3_ast r = Z3_parse_smtlib2_file(*this, s, 0, 0, 0, 0, 0, 0);\n\n check_parser_error();\n\n return expr(*this, r);\n\n }\n\n\n\n inline expr context::parse_string(char const* s, sort_vector const& sorts, func_decl_vector const& decls) {\n\n array<Z3_symbol> sort_names(sorts.size());\n\n array<Z3_symbol> decl_names(decls.size());\n\n array<Z3_sort> sorts1(sorts);\n\n array<Z3_func_decl> decls1(decls);\n\n for (unsigned i = 0; i < sorts.size(); ++i) {\n\n sort_names[i] = sorts[i].name();\n\n }\n\n for (unsigned i = 0; i < decls.size(); ++i) {\n\n decl_names[i] = decls[i].name();\n\n }\n\n Z3_ast r = Z3_parse_smtlib2_string(*this, s, sorts.size(), sort_names.ptr(), sorts1.ptr(), decls.size(), decl_names.ptr(), decls1.ptr());\n","file_path":"tests/benchmark/include/z3++.h","rank":60,"score":61465.19450908718},{"content":" }\n\n\n\n // returns interpretation of constant declaration c.\n\n // If c is not assigned any value in the model it returns \n\n // an expression with a null ast reference.\n\n expr get_const_interp(func_decl c) const {\n\n check_context(*this, c);\n\n Z3_ast r = Z3_model_get_const_interp(ctx(), m_model, c);\n\n check_error();\n\n return expr(ctx(), r);\n\n }\n\n func_interp get_func_interp(func_decl f) const {\n\n check_context(*this, f);\n\n Z3_func_interp r = Z3_model_get_func_interp(ctx(), m_model, f);\n\n check_error();\n\n return func_interp(ctx(), r);\n\n }\n\n\n\n // returns true iff the model contains an interpretation\n\n // for function f.\n","file_path":"tests/benchmark/include/z3++.h","rank":61,"score":61465.12248382336},{"content":"*/\n\n bool is_finite_domain() const { return get_sort().is_finite_domain(); }\n\n\n\n /**\n\n \\brief Return true if this expression is a numeral.\n\n Specialized functions also return representations for the numerals as\n\n small integers, 64 bit integers or rational or decimal strings.\n\n */\n\n bool is_numeral() const { return kind() == Z3_NUMERAL_AST; }\n\n bool is_numeral_i64(int64_t& i) const { bool r = 0 != Z3_get_numeral_int64(ctx(), m_ast, &i); check_error(); return r;}\n\n bool is_numeral_u64(uint64_t& i) const { bool r = 0 != Z3_get_numeral_uint64(ctx(), m_ast, &i); check_error(); return r;}\n\n bool is_numeral_i(int& i) const { bool r = 0 != Z3_get_numeral_int(ctx(), m_ast, &i); check_error(); return r;}\n\n bool is_numeral_u(unsigned& i) const { bool r = 0 != Z3_get_numeral_uint(ctx(), m_ast, &i); check_error(); return r;}\n\n bool is_numeral(std::string& s) const { if (!is_numeral()) return false; s = Z3_get_numeral_string(ctx(), m_ast); check_error(); return true; }\n\n bool is_numeral(std::string& s, unsigned precision) const { if (!is_numeral()) return false; s = Z3_get_numeral_decimal_string(ctx(), m_ast, precision); check_error(); return true; }\n\n /**\n\n \\brief Return true if this expression is an application.\n\n */\n\n bool is_app() const { return kind() == Z3_APP_AST || kind() == Z3_NUMERAL_AST; }\n\n /**\n","file_path":"tests/benchmark/include/z3++.h","rank":62,"score":61465.122764149084},{"content":" /**\n\n \\brief Return true if this is a Relation expression.\n\n */\n\n bool is_relation() const { return get_sort().is_relation(); }\n\n /**\n\n \\brief Return true if this is a sequence expression.\n\n */\n\n bool is_seq() const { return get_sort().is_seq(); }\n\n /**\n\n \\brief Return true if this is a regular expression.\n\n */\n\n bool is_re() const { return get_sort().is_re(); }\n\n\n\n /**\n\n \\brief Return true if this is a Finite-domain expression.\n\n\n\n \\remark Finite-domain is special kind of interpreted sort:\n\n is_bool(), is_bv() and is_finite_domain() are mutually\n\n exclusive.\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":63,"score":61464.975090601045},{"content":" bool has_interp(func_decl f) const {\n\n check_context(*this, f);\n\n return 0 != Z3_model_has_interp(ctx(), m_model, f);\n\n }\n\n\n\n func_interp add_func_interp(func_decl& f, expr& else_val) {\n\n Z3_func_interp r = Z3_add_func_interp(ctx(), m_model, f, else_val);\n\n check_error();\n\n return func_interp(ctx(), r);\n\n }\n\n\n\n void add_const_interp(func_decl& f, expr& value) {\n\n Z3_add_const_interp(ctx(), m_model, f, value);\n\n check_error();\n\n }\n\n\n\n friend std::ostream & operator<<(std::ostream & out, model const & m);\n\n };\n\n inline std::ostream & operator<<(std::ostream & out, model const & m) { out << Z3_model_to_string(m.ctx(), m); return out; }\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":64,"score":61464.858954082054},{"content":"\n\n \\pre is_numeral()\n\n */\n\n int64_t get_numeral_int64() const {\n\n assert(is_numeral());\n\n int64_t result = 0;\n\n if (!is_numeral_i64(result)) {\n\n assert(ctx().enable_exceptions());\n\n if (!ctx().enable_exceptions()) return 0;\n\n Z3_THROW(exception(\"numeral does not fit in machine int64_t\"));\n\n }\n\n return result;\n\n }\n\n\n\n /**\n\n \\brief Return \\c uint64_t value of numeral, throw if result cannot fit in\n\n \\c uint64_t.\n\n\n\n \\pre is_numeral()\n\n */\n","file_path":"tests/benchmark/include/z3++.h","rank":65,"score":61464.818781269845},{"content":"#ifndef Z3PP_H_\n\n#define Z3PP_H_\n\n\n\n#include<cassert>\n\n#include<iostream>\n\n#include<string>\n\n#include<sstream>\n\n#include<z3.h>\n\n#include<limits.h>\n\n\n\n/**\n\n \\defgroup cppapi C++ API\n\n\n\n*/\n\n/*@{*/\n\n\n\n/**\n\n @name C++ API classes and functions\n\n */\n\n/*@{*/\n\n\n\n/**\n\n \\brief Z3 C++ namespace\n\n */\n\nnamespace z3 {\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":66,"score":61464.77225686511},{"content":" unsigned get_num_levels(func_decl& p) { unsigned r = Z3_fixedpoint_get_num_levels(ctx(), m_fp, p); check_error(); return r; }\n\n expr get_cover_delta(int level, func_decl& p) { \n\n Z3_ast r = Z3_fixedpoint_get_cover_delta(ctx(), m_fp, level, p); \n\n check_error(); \n\n return expr(ctx(), r);\n\n }\n\n void add_cover(int level, func_decl& p, expr& property) { Z3_fixedpoint_add_cover(ctx(), m_fp, level, p, property); check_error(); }\n\n stats statistics() const { Z3_stats r = Z3_fixedpoint_get_statistics(ctx(), m_fp); check_error(); return stats(ctx(), r); }\n\n void register_relation(func_decl& p) { Z3_fixedpoint_register_relation(ctx(), m_fp, p); }\n\n expr_vector assertions() const { Z3_ast_vector r = Z3_fixedpoint_get_assertions(ctx(), m_fp); check_error(); return expr_vector(ctx(), r); }\n\n expr_vector rules() const { Z3_ast_vector r = Z3_fixedpoint_get_rules(ctx(), m_fp); check_error(); return expr_vector(ctx(), r); }\n\n void set(params const & p) { Z3_fixedpoint_set_params(ctx(), m_fp, p); check_error(); }\n\n std::string help() const { return Z3_fixedpoint_get_help(ctx(), m_fp); }\n\n param_descrs get_param_descrs() { return param_descrs(ctx(), Z3_fixedpoint_get_param_descrs(ctx(), m_fp)); }\n\n std::string to_string() { return Z3_fixedpoint_to_string(ctx(), m_fp, 0, 0); }\n\n std::string to_string(expr_vector const& queries) {\n\n array<Z3_ast> qs(queries);\n\n return Z3_fixedpoint_to_string(ctx(), m_fp, qs.size(), qs.ptr()); \n\n }\n\n void push() { Z3_fixedpoint_push(ctx(), m_fp); check_error(); }\n","file_path":"tests/benchmark/include/z3++.h","rank":67,"score":61464.40979332115},{"content":" check_parser_error();\n\n return expr(*this, r);\n\n }\n\n\n\n inline expr context::parse_file(char const* s, sort_vector const& sorts, func_decl_vector const& decls) {\n\n array<Z3_symbol> sort_names(sorts.size());\n\n array<Z3_symbol> decl_names(decls.size());\n\n array<Z3_sort> sorts1(sorts);\n\n array<Z3_func_decl> decls1(decls);\n\n for (unsigned i = 0; i < sorts.size(); ++i) {\n\n sort_names[i] = sorts[i].name();\n\n }\n\n for (unsigned i = 0; i < decls.size(); ++i) {\n\n decl_names[i] = decls[i].name();\n\n }\n\n Z3_ast r = Z3_parse_smtlib2_file(*this, s, sorts.size(), sort_names.ptr(), sorts1.ptr(), decls.size(), decl_names.ptr(), decls1.ptr());\n\n check_parser_error();\n\n return expr(*this, r);\n\n }\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":68,"score":61464.378222321175},{"content":" Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr exists(expr const & x1, expr const & x2, expr const & x3, expr const & x4, expr const & b) {\n\n check_context(x1, b); check_context(x2, b); check_context(x3, b); check_context(x4, b);\n\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };\n\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr exists(expr_vector const & xs, expr const & b) {\n\n array<Z3_app> vars(xs);\n\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, vars.size(), vars.ptr(), 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr pble(expr_vector const& es, int const* coeffs, int bound) {\n\n assert(es.size() > 0);\n\n context& ctx = es[0].ctx();\n\n array<Z3_ast> _es(es);\n\n Z3_ast r = Z3_mk_pble(ctx, _es.size(), _es.ptr(), coeffs, bound);\n\n ctx.check_error();\n\n return expr(ctx, r);\n\n }\n\n inline expr pbge(expr_vector const& es, int const* coeffs, int bound) {\n","file_path":"tests/benchmark/include/z3++.h","rank":69,"score":61464.14882802797},{"content":" func_decl function(symbol const & name, unsigned arity, sort const * domain, sort const & range);\n\n func_decl function(char const * name, unsigned arity, sort const * domain, sort const & range);\n\n func_decl function(symbol const& name, sort_vector const& domain, sort const& range);\n\n func_decl function(char const * name, sort_vector const& domain, sort const& range);\n\n func_decl function(char const * name, sort const & domain, sort const & range);\n\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & range);\n\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & range);\n\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & d4, sort const & range);\n\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & d4, sort const & d5, sort const & range);\n\n\n\n expr constant(symbol const & name, sort const & s);\n\n expr constant(char const * name, sort const & s);\n\n expr bool_const(char const * name);\n\n expr int_const(char const * name);\n\n expr real_const(char const * name);\n\n expr bv_const(char const * name, unsigned sz);\n\n\n\n expr bool_val(bool b);\n\n\n\n expr int_val(int n);\n","file_path":"tests/benchmark/include/z3++.h","rank":70,"score":61464.12630330869},{"content":"\n\n It only makes sense to use this function if the caller can ensure that\n\n the result is an integer or if exceptions are enabled. \n\n If exceptions are disabled, then use the is_numeral_u function.\n\n \\pre is_numeral()\n\n */\n\n unsigned get_numeral_uint() const {\n\n assert(is_numeral());\n\n unsigned result = 0;\n\n if (!is_numeral_u(result)) {\n\n assert(ctx().enable_exceptions());\n\n if (!ctx().enable_exceptions()) return 0;\n\n Z3_THROW(exception(\"numeral does not fit in machine uint\"));\n\n }\n\n return result;\n\n }\n\n\n\n /**\n\n \\brief Return \\c int64_t value of numeral, throw if result cannot fit in\n\n \\c int64_t.\n","file_path":"tests/benchmark/include/z3++.h","rank":71,"score":61464.04694379885},{"content":" uint64_t get_numeral_uint64() const {\n\n assert(is_numeral());\n\n uint64_t result = 0;\n\n if (!is_numeral_u64(result)) {\n\n assert(ctx().enable_exceptions());\n\n if (!ctx().enable_exceptions()) return 0;\n\n Z3_THROW(exception(\"numeral does not fit in machine uint64_t\"));\n\n }\n\n return result;\n\n }\n\n\n\n Z3_lbool bool_value() const {\n\n return Z3_get_bool_value(ctx(), m_ast);\n\n }\n\n\n\n expr numerator() const { \n\n assert(is_numeral());\n\n Z3_ast r = Z3_get_numerator(ctx(), m_ast);\n\n check_error();\n\n return expr(ctx(),r);\n","file_path":"tests/benchmark/include/z3++.h","rank":72,"score":61463.55772834858},{"content":" Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };\n\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr forall(expr_vector const & xs, expr const & b) {\n\n array<Z3_app> vars(xs);\n\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, vars.size(), vars.ptr(), 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr exists(expr const & x, expr const & b) {\n\n check_context(x, b);\n\n Z3_app vars[] = {(Z3_app) x};\n\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr exists(expr const & x1, expr const & x2, expr const & b) {\n\n check_context(x1, b); check_context(x2, b);\n\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};\n\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr exists(expr const & x1, expr const & x2, expr const & x3, expr const & b) {\n\n check_context(x1, b); check_context(x2, b); check_context(x3, b);\n\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };\n","file_path":"tests/benchmark/include/z3++.h","rank":73,"score":61463.449800862574},{"content":"\n\n template<> class cast_ast<expr> {\n\n public:\n\n expr operator()(context & c, Z3_ast a) {\n\n assert(Z3_get_ast_kind(c, a) == Z3_NUMERAL_AST ||\n\n Z3_get_ast_kind(c, a) == Z3_APP_AST ||\n\n Z3_get_ast_kind(c, a) == Z3_QUANTIFIER_AST ||\n\n Z3_get_ast_kind(c, a) == Z3_VAR_AST);\n\n return expr(c, a);\n\n }\n\n };\n\n\n\n template<> class cast_ast<sort> {\n\n public:\n\n sort operator()(context & c, Z3_ast a) {\n\n assert(Z3_get_ast_kind(c, a) == Z3_SORT_AST);\n\n return sort(c, reinterpret_cast<Z3_sort>(a));\n\n }\n\n };\n\n\n\n template<> class cast_ast<func_decl> {\n\n public:\n\n func_decl operator()(context & c, Z3_ast a) {\n\n assert(Z3_get_ast_kind(c, a) == Z3_FUNC_DECL_AST);\n\n return func_decl(c, reinterpret_cast<Z3_func_decl>(a));\n\n }\n\n };\n\n\n\n template<typename T>\n","file_path":"tests/benchmark/include/z3++.h","rank":74,"score":61463.427882032345},{"content":"\n\n It only makes sense to use this function if the caller can ensure that\n\n the result is an integer or if exceptions are enabled. \n\n If exceptions are disabled, then use the is_numeral_i function.\n\n\n\n \\pre is_numeral()\n\n */\n\n int get_numeral_int() const { \n\n int result = 0;\n\n if (!is_numeral_i(result)) {\n\n assert(ctx().enable_exceptions());\n\n if (!ctx().enable_exceptions()) return 0;\n\n Z3_THROW(exception(\"numeral does not fit in machine int\"));\n\n }\n\n return result;\n\n }\n\n\n\n /**\n\n \\brief Return uint value of numeral, throw if result cannot fit in\n\n machine uint\n","file_path":"tests/benchmark/include/z3++.h","rank":75,"score":61463.18478594463},{"content":" \\brief Return the number of arguments in this application.\n\n This method assumes the expression is an application.\n\n\n\n \\pre is_app()\n\n */\n\n unsigned num_args() const { unsigned r = Z3_get_app_num_args(ctx(), *this); check_error(); return r; }\n\n /**\n\n \\brief Return the i-th argument of this application.\n\n This method assumes the expression is an application.\n\n\n\n \\pre is_app()\n\n \\pre i < num_args()\n\n */\n\n expr arg(unsigned i) const { Z3_ast r = Z3_get_app_arg(ctx(), *this, i); check_error(); return expr(ctx(), r); }\n\n\n\n /**\n\n \\brief Return the 'body' of this quantifier.\n\n\n\n \\pre is_quantifier()\n\n */\n","file_path":"tests/benchmark/include/z3++.h","rank":76,"score":61463.132011260794},{"content":" \\brief Return an enumeration sort: enum_names[0], ..., enum_names[n-1].\n\n \\c cs and \\c ts are output parameters. The method stores in \\c cs the constants corresponding to the enumerated elements,\n\n and in \\c ts the predicates for testing if terms of the enumeration sort correspond to an enumeration.\n\n */\n\n sort enumeration_sort(char const * name, unsigned n, char const * const * enum_names, func_decl_vector & cs, func_decl_vector & ts);\n\n\n\n /**\n\n \\brief Return a tuple constructor.\n\n \\c name is the name of the returned constructor,\n\n \\c n are the number of arguments, \\c names and \\c sorts are their projected sorts.\n\n \\c projs is an output paramter. It contains the set of projection functions.\n\n */\n\n func_decl tuple_sort(char const * name, unsigned n, char const * const * names, sort const* sorts, func_decl_vector & projs);\n\n\n\n /**\n\n \\brief create an uninterpreted sort with the name given by the string or symbol.\n\n */\n\n sort uninterpreted_sort(char const* name);\n\n sort uninterpreted_sort(symbol const& name);\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":77,"score":61463.13054498789},{"content":" inline expr operator==(expr const & a, int b) { assert(a.is_arith() || a.is_bv()); return a == a.ctx().num_val(b, a.get_sort()); }\n\n inline expr operator==(int a, expr const & b) { assert(b.is_arith() || b.is_bv()); return b.ctx().num_val(a, b.get_sort()) == b; }\n\n\n\n inline expr operator!=(expr const & a, expr const & b) {\n\n check_context(a, b);\n\n Z3_ast args[2] = { a, b };\n\n Z3_ast r = Z3_mk_distinct(a.ctx(), 2, args);\n\n a.check_error();\n\n return expr(a.ctx(), r);\n\n }\n\n inline expr operator!=(expr const & a, int b) { assert(a.is_arith() || a.is_bv()); return a != a.ctx().num_val(b, a.get_sort()); }\n\n inline expr operator!=(int a, expr const & b) { assert(b.is_arith() || b.is_bv()); return b.ctx().num_val(a, b.get_sort()) != b; }\n\n\n\n inline expr operator+(expr const & a, expr const & b) {\n\n check_context(a, b);\n\n Z3_ast r = 0;\n\n if (a.is_arith() && b.is_arith()) {\n\n Z3_ast args[2] = { a, b };\n\n r = Z3_mk_add(a.ctx(), 2, args);\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":78,"score":61463.088772714946},{"content":" check_context(c, t); check_context(c, e);\n\n assert(c.is_bool());\n\n Z3_ast r = Z3_mk_ite(c.ctx(), c, t, e);\n\n c.check_error();\n\n return expr(c.ctx(), r);\n\n }\n\n\n\n\n\n /**\n\n \\brief Wraps a Z3_ast as an expr object. It also checks for errors.\n\n This function allows the user to use the whole C API with the C++ layer defined in this file.\n\n */\n\n inline expr to_expr(context & c, Z3_ast a) {\n\n c.check_error();\n\n assert(Z3_get_ast_kind(c, a) == Z3_APP_AST ||\n\n Z3_get_ast_kind(c, a) == Z3_NUMERAL_AST ||\n\n Z3_get_ast_kind(c, a) == Z3_VAR_AST ||\n\n Z3_get_ast_kind(c, a) == Z3_QUANTIFIER_AST);\n\n return expr(c, a);\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":79,"score":61463.01618615996},{"content":" return expr(a.ctx(), r); \\\n\n\n\n\n\n inline expr operator!(expr const & a) { assert(a.is_bool()); _Z3_MK_UN_(a, Z3_mk_not); }\n\n\n\n inline expr is_int(expr const& e) { _Z3_MK_UN_(e, Z3_mk_is_int); }\n\n\n\n#undef _Z3_MK_UN_\n\n\n\n inline expr operator&&(expr const & a, expr const & b) {\n\n check_context(a, b);\n\n assert(a.is_bool() && b.is_bool());\n\n Z3_ast args[2] = { a, b };\n\n Z3_ast r = Z3_mk_and(a.ctx(), 2, args);\n\n a.check_error();\n\n return expr(a.ctx(), r);\n\n }\n\n\n\n inline expr operator&&(expr const & a, bool b) { return a && a.ctx().bool_val(b); }\n\n inline expr operator&&(bool a, expr const & b) { return b.ctx().bool_val(a) && b; }\n","file_path":"tests/benchmark/include/z3++.h","rank":80,"score":61462.95626711087},{"content":" func_entry entry(unsigned i) const { Z3_func_entry e = Z3_func_interp_get_entry(ctx(), m_interp, i); check_error(); return func_entry(ctx(), e); }\n\n void add_entry(expr_vector const& args, expr& value) {\n\n Z3_func_interp_add_entry(ctx(), m_interp, args, value);\n\n check_error();\n\n }\n\n void set_else(expr& value) {\n\n Z3_func_interp_set_else(ctx(), m_interp, value);\n\n check_error();\n\n }\n\n };\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":81,"score":61462.942778700555},{"content":" \\brief Return an expression representing <tt>a and b</tt>.\n\n The C++ Boolean value \\c b is automatically converted into a Z3 Boolean constant.\n\n\n\n \\pre a.is_bool()\n\n */\n\n friend expr operator&&(expr const & a, bool b);\n\n /**\n\n \\brief Return an expression representing <tt>a and b</tt>.\n\n The C++ Boolean value \\c a is automatically converted into a Z3 Boolean constant.\n\n\n\n \\pre b.is_bool()\n\n */\n\n friend expr operator&&(bool a, expr const & b);\n\n\n\n /**\n\n \\brief Return an expression representing <tt>a or b</tt>.\n\n\n\n \\pre a.is_bool()\n\n \\pre b.is_bool()\n\n */\n","file_path":"tests/benchmark/include/z3++.h","rank":82,"score":61462.900646711496},{"content":" assert(es.size() > 0);\n\n context& ctx = es[0].ctx();\n\n array<Z3_ast> _es(es);\n\n Z3_ast r = Z3_mk_pbge(ctx, _es.size(), _es.ptr(), coeffs, bound);\n\n ctx.check_error();\n\n return expr(ctx, r);\n\n }\n\n inline expr pbeq(expr_vector const& es, int const* coeffs, int bound) {\n\n assert(es.size() > 0);\n\n context& ctx = es[0].ctx();\n\n array<Z3_ast> _es(es);\n\n Z3_ast r = Z3_mk_pbeq(ctx, _es.size(), _es.ptr(), coeffs, bound);\n\n ctx.check_error();\n\n return expr(ctx, r);\n\n }\n\n inline expr atmost(expr_vector const& es, unsigned bound) {\n\n assert(es.size() > 0);\n\n context& ctx = es[0].ctx();\n\n array<Z3_ast> _es(es);\n\n Z3_ast r = Z3_mk_atmost(ctx, _es.size(), _es.ptr(), bound);\n","file_path":"tests/benchmark/include/z3++.h","rank":83,"score":61462.893612806125},{"content":"\n\n // Basic functions for creating quantified formulas.\n\n // The C API should be used for creating quantifiers with patterns, weights, many variables, etc.\n\n inline expr forall(expr const & x, expr const & b) {\n\n check_context(x, b);\n\n Z3_app vars[] = {(Z3_app) x};\n\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr forall(expr const & x1, expr const & x2, expr const & b) {\n\n check_context(x1, b); check_context(x2, b);\n\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};\n\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr forall(expr const & x1, expr const & x2, expr const & x3, expr const & b) {\n\n check_context(x1, b); check_context(x2, b); check_context(x3, b);\n\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };\n\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\n\n }\n\n inline expr forall(expr const & x1, expr const & x2, expr const & x3, expr const & x4, expr const & b) {\n\n check_context(x1, b); check_context(x2, b); check_context(x3, b); check_context(x4, b);\n","file_path":"tests/benchmark/include/z3++.h","rank":84,"score":61462.85730389106},{"content":" check_error(); \n\n return expr(ctx(), r); \n\n }\n\n\n\n\n\n /**\n\n \\brief Return a simplified version of this expression.\n\n */\n\n expr simplify() const { Z3_ast r = Z3_simplify(ctx(), m_ast); check_error(); return expr(ctx(), r); }\n\n\n\n expr qf_to_simplify() const { Z3_ast r = Z3_qf_to_simplify(ctx(), m_ast); check_error(); return expr(ctx(), r); }\n\n /**\n\n \\brief Return a simplified version of this expression. The parameter \\c p is a set of parameters for the Z3 simplifier.\n\n */\n\n expr simplify(params const & p) const { Z3_ast r = Z3_simplify_ex(ctx(), m_ast, p); check_error(); return expr(ctx(), r); }\n\n\n\n /**\n\n \\brief Apply substitution. Replace src expressions by dst.\n\n */\n\n expr substitute(expr_vector const& src, expr_vector const& dst);\n","file_path":"tests/benchmark/include/z3++.h","rank":85,"score":61462.81097930315},{"content":"\n\n\n\n inline func_decl context::function(char const * name, sort const & domain, sort const & range) {\n\n check_context(domain, range);\n\n Z3_sort args[1] = { domain };\n\n Z3_func_decl f = Z3_mk_func_decl(m_ctx, str_symbol(name), 1, args, range);\n\n check_error();\n\n return func_decl(*this, f);\n\n }\n\n\n\n inline func_decl context::function(char const * name, sort const & d1, sort const & d2, sort const & range) {\n\n check_context(d1, range); check_context(d2, range);\n\n Z3_sort args[2] = { d1, d2 };\n\n Z3_func_decl f = Z3_mk_func_decl(m_ctx, str_symbol(name), 2, args, range);\n\n check_error();\n\n return func_decl(*this, f);\n\n }\n\n\n\n inline func_decl context::function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & range) {\n\n check_context(d1, range); check_context(d2, range); check_context(d3, range);\n","file_path":"tests/benchmark/include/z3++.h","rank":86,"score":61462.63626870926},{"content":" \\brief Create a Z3 symbol based on the given integer.\n\n */\n\n symbol int_symbol(int n);\n\n /**\n\n \\brief Return the Boolean sort.\n\n */\n\n sort bool_sort();\n\n /**\n\n \\brief Return the integer sort.\n\n */\n\n sort int_sort();\n\n /**\n\n \\brief Return the Real sort.\n\n */\n\n sort real_sort();\n\n /**\n\n \\brief Return the Bit-vector sort of size \\c sz. That is, the sort for bit-vectors of size \\c sz.\n\n */\n\n sort bv_sort(unsigned sz);\n\n /**\n","file_path":"tests/benchmark/include/z3++.h","rank":87,"score":61462.615500966116},{"content":" ctx.check_error();\n\n return expr(ctx, r);\n\n }\n\n inline expr atleast(expr_vector const& es, unsigned bound) {\n\n assert(es.size() > 0);\n\n context& ctx = es[0].ctx();\n\n array<Z3_ast> _es(es);\n\n Z3_ast r = Z3_mk_atleast(ctx, _es.size(), _es.ptr(), bound);\n\n ctx.check_error();\n\n return expr(ctx, r);\n\n }\n\n inline expr sum(expr_vector const& args) {\n\n assert(args.size() > 0);\n\n context& ctx = args[0].ctx();\n\n array<Z3_ast> _args(args);\n\n Z3_ast r = Z3_mk_add(ctx, _args.size(), _args.ptr());\n\n ctx.check_error();\n\n return expr(ctx, r);\n\n }\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":88,"score":61462.57328472198},{"content":" r = Z3_mk_unary_minus(a.ctx(), a);\n\n }\n\n else if (a.is_bv()) {\n\n r = Z3_mk_bvneg(a.ctx(), a);\n\n }\n\n else {\n\n // operator is not supported by given arguments.\n\n assert(false);\n\n }\n\n a.check_error();\n\n return expr(a.ctx(), r);\n\n }\n\n\n\n inline expr operator-(expr const & a, expr const & b) {\n\n check_context(a, b);\n\n Z3_ast r = 0;\n\n if (a.is_arith() && b.is_arith()) {\n\n Z3_ast args[2] = { a, b };\n\n r = Z3_mk_sub(a.ctx(), 2, args);\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":89,"score":61462.53896163898},{"content":" std::string key(unsigned i) const { Z3_string s = Z3_stats_get_key(ctx(), m_stats, i); check_error(); return s; }\n\n bool is_uint(unsigned i) const { Z3_bool r = Z3_stats_is_uint(ctx(), m_stats, i); check_error(); return r != 0; }\n\n bool is_double(unsigned i) const { Z3_bool r = Z3_stats_is_double(ctx(), m_stats, i); check_error(); return r != 0; }\n\n unsigned uint_value(unsigned i) const { unsigned r = Z3_stats_get_uint_value(ctx(), m_stats, i); check_error(); return r; }\n\n double double_value(unsigned i) const { double r = Z3_stats_get_double_value(ctx(), m_stats, i); check_error(); return r; }\n\n friend std::ostream & operator<<(std::ostream & out, stats const & s);\n\n };\n\n inline std::ostream & operator<<(std::ostream & out, stats const & s) { out << Z3_stats_to_string(s.ctx(), s); return out; }\n\n\n\n\n\n inline std::ostream & operator<<(std::ostream & out, check_result r) {\n\n if (r == unsat) out << \"unsat\";\n\n else if (r == sat) out << \"sat\";\n\n else out << \"unknown\";\n\n return out;\n\n }\n\n\n\n\n","file_path":"tests/benchmark/include/z3++.h","rank":90,"score":61462.50334506},{"content":" Z3_ast args[5] = { a1, a2, a3, a4, a5 };\n\n Z3_ast r = Z3_mk_app(ctx(), *this, 5, args);\n\n ctx().check_error();\n\n return expr(ctx(), r);\n\n }\n\n\n\n inline expr to_real(expr const & a) { Z3_ast r = Z3_mk_int2real(a.ctx(), a); a.check_error(); return expr(a.ctx(), r); }\n\n\n\n inline func_decl function(symbol const & name, unsigned arity, sort const * domain, sort const & range) {\n\n return range.ctx().function(name, arity, domain, range);\n\n }\n\n inline func_decl function(char const * name, unsigned arity, sort const * domain, sort const & range) {\n\n return range.ctx().function(name, arity, domain, range);\n\n }\n\n inline func_decl function(char const * name, sort const & domain, sort const & range) {\n\n return range.ctx().function(name, domain, range);\n\n }\n\n inline func_decl function(char const * name, sort const & d1, sort const & d2, sort const & range) {\n\n return range.ctx().function(name, d1, d2, range);\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":91,"score":61462.43689122179},{"content":" }\n\n\n\n inline symbol context::str_symbol(char const * s) { Z3_symbol r = Z3_mk_string_symbol(m_ctx, s); check_error(); return symbol(*this, r); }\n\n inline symbol context::int_symbol(int n) { Z3_symbol r = Z3_mk_int_symbol(m_ctx, n); check_error(); return symbol(*this, r); }\n\n\n\n inline sort context::bool_sort() { Z3_sort s = Z3_mk_bool_sort(m_ctx); check_error(); return sort(*this, s); }\n\n inline sort context::int_sort() { Z3_sort s = Z3_mk_int_sort(m_ctx); check_error(); return sort(*this, s); }\n\n inline sort context::real_sort() { Z3_sort s = Z3_mk_real_sort(m_ctx); check_error(); return sort(*this, s); }\n\n inline sort context::bv_sort(unsigned sz) { Z3_sort s = Z3_mk_bv_sort(m_ctx, sz); check_error(); return sort(*this, s); }\n\n inline sort context::string_sort() { Z3_sort s = Z3_mk_string_sort(m_ctx); check_error(); return sort(*this, s); }\n\n inline sort context::seq_sort(sort& s) { Z3_sort r = Z3_mk_seq_sort(m_ctx, s); check_error(); return sort(*this, r); }\n\n inline sort context::re_sort(sort& s) { Z3_sort r = Z3_mk_re_sort(m_ctx, s); check_error(); return sort(*this, r); }\n\n\n\n inline sort context::array_sort(sort d, sort r) { Z3_sort s = Z3_mk_array_sort(m_ctx, d, r); check_error(); return sort(*this, s); }\n\n inline sort context::array_sort(sort_vector const& d, sort r) {\n\n array<Z3_sort> dom(d);\n\n Z3_sort s = Z3_mk_array_sort_n(m_ctx, dom.size(), dom.ptr(), r); check_error(); return sort(*this, s); \n\n }\n\n\n\n inline sort context::enumeration_sort(char const * name, unsigned n, char const * const * enum_names, func_decl_vector & cs, func_decl_vector & ts) {\n","file_path":"tests/benchmark/include/z3++.h","rank":92,"score":61462.3167030193},{"content":" array<Z3_symbol> _enum_names(n);\n\n for (unsigned i = 0; i < n; i++) { _enum_names[i] = Z3_mk_string_symbol(*this, enum_names[i]); }\n\n array<Z3_func_decl> _cs(n);\n\n array<Z3_func_decl> _ts(n);\n\n Z3_symbol _name = Z3_mk_string_symbol(*this, name);\n\n sort s = to_sort(*this, Z3_mk_enumeration_sort(*this, _name, n, _enum_names.ptr(), _cs.ptr(), _ts.ptr()));\n\n check_error();\n\n for (unsigned i = 0; i < n; i++) { cs.push_back(func_decl(*this, _cs[i])); ts.push_back(func_decl(*this, _ts[i])); }\n\n return s;\n\n }\n\n inline func_decl context::tuple_sort(char const * name, unsigned n, char const * const * names, sort const* sorts, func_decl_vector & projs) {\n\n array<Z3_symbol> _names(n);\n\n array<Z3_sort> _sorts(n);\n\n for (unsigned i = 0; i < n; i++) { _names[i] = Z3_mk_string_symbol(*this, names[i]); _sorts[i] = sorts[i]; }\n\n array<Z3_func_decl> _projs(n);\n\n Z3_symbol _name = Z3_mk_string_symbol(*this, name);\n\n Z3_func_decl tuple;\n\n sort _ignore_s = to_sort(*this, Z3_mk_tuple_sort(*this, _name, n, _names.ptr(), _sorts.ptr(), &tuple, _projs.ptr()));\n\n check_error();\n\n for (unsigned i = 0; i < n; i++) { projs.push_back(func_decl(*this, _projs[i])); }\n","file_path":"tests/benchmark/include/z3++.h","rank":93,"score":61462.26711133746},{"content":"\n\n inline expr operator>=(expr const & a, expr const & b) {\n\n check_context(a, b);\n\n Z3_ast r = 0;\n\n if (a.is_arith() && b.is_arith()) {\n\n r = Z3_mk_ge(a.ctx(), a, b);\n\n }\n\n else if (a.is_bv() && b.is_bv()) {\n\n r = Z3_mk_bvsge(a.ctx(), a, b);\n\n }\n\n else {\n\n // operator is not supported by given arguments.\n\n assert(false);\n\n }\n\n a.check_error();\n\n return expr(a.ctx(), r);\n\n }\n\n\n\n inline expr operator/(expr const & a, expr const & b) {\n\n check_context(a, b);\n","file_path":"tests/benchmark/include/z3++.h","rank":94,"score":61462.21272291419},{"content":" friend expr operator||(expr const & a, expr const & b);\n\n /**\n\n \\brief Return an expression representing <tt>a or b</tt>.\n\n The C++ Boolean value \\c b is automatically converted into a Z3 Boolean constant.\n\n\n\n \\pre a.is_bool()\n\n */\n\n friend expr operator||(expr const & a, bool b);\n\n\n\n /**\n\n \\brief Return an expression representing <tt>a or b</tt>.\n\n The C++ Boolean value \\c a is automatically converted into a Z3 Boolean constant.\n\n\n\n \\pre b.is_bool()\n\n */\n\n friend expr operator||(bool a, expr const & b);\n\n\n\n friend expr implies(expr const & a, expr const & b);\n\n friend expr implies(expr const & a, bool b);\n\n friend expr implies(bool a, expr const & b);\n","file_path":"tests/benchmark/include/z3++.h","rank":95,"score":61462.04118352568},{"content":" inline expr distinct(expr_vector const& args) {\n\n assert(args.size() > 0);\n\n context& ctx = args[0].ctx();\n\n array<Z3_ast> _args(args);\n\n Z3_ast r = Z3_mk_distinct(ctx, _args.size(), _args.ptr());\n\n ctx.check_error();\n\n return expr(ctx, r);\n\n }\n\n\n\n inline expr concat(expr const& a, expr const& b) {\n\n check_context(a, b);\n\n Z3_ast r;\n\n if (Z3_is_seq_sort(a.ctx(), a.get_sort())) {\n\n Z3_ast _args[2] = { a, b };\n\n r = Z3_mk_seq_concat(a.ctx(), 2, _args);\n\n }\n\n else if (Z3_is_re_sort(a.ctx(), a.get_sort())) {\n\n Z3_ast _args[2] = { a, b };\n\n r = Z3_mk_re_concat(a.ctx(), 2, _args);\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":96,"score":61462.03616911932},{"content":"\n\n /**\n\n \\brief Apply substitution. Replace bound variables by expressions.\n\n */\n\n expr substitute(expr_vector const& dst);\n\n\n\n };\n\n\n\n#define _Z3_MK_BIN_(a, b, binop) \\\n\n check_context(a, b); \\\n\n Z3_ast r = binop(a.ctx(), a, b); \\\n\n a.check_error(); \\\n\n return expr(a.ctx(), r); \\\n\n\n\n\n\n inline expr implies(expr const & a, expr const & b) {\n\n assert(a.is_bool() && b.is_bool()); \n\n _Z3_MK_BIN_(a, b, Z3_mk_implies);\n\n }\n\n inline expr implies(expr const & a, bool b) { return implies(a, a.ctx().bool_val(b)); }\n","file_path":"tests/benchmark/include/z3++.h","rank":97,"score":61462.00300314292},{"content":" else {\n\n r = Z3_mk_concat(a.ctx(), a, b);\n\n }\n\n a.ctx().check_error();\n\n return expr(a.ctx(), r);\n\n }\n\n\n\n inline expr concat(expr_vector const& args) {\n\n Z3_ast r;\n\n assert(args.size() > 0);\n\n if (args.size() == 1) {\n\n return args[0];\n\n }\n\n context& ctx = args[0].ctx();\n\n array<Z3_ast> _args(args);\n\n if (Z3_is_seq_sort(ctx, args[0].get_sort())) {\n\n r = Z3_mk_seq_concat(ctx, _args.size(), _args.ptr());\n\n }\n\n else if (Z3_is_re_sort(ctx, args[0].get_sort())) {\n\n r = Z3_mk_re_concat(ctx, _args.size(), _args.ptr());\n","file_path":"tests/benchmark/include/z3++.h","rank":98,"score":61462.005691367565},{"content":"\n\n inline expr operator||(expr const & a, expr const & b) {\n\n check_context(a, b);\n\n assert(a.is_bool() && b.is_bool());\n\n Z3_ast args[2] = { a, b };\n\n Z3_ast r = Z3_mk_or(a.ctx(), 2, args);\n\n a.check_error();\n\n return expr(a.ctx(), r);\n\n }\n\n\n\n inline expr operator||(expr const & a, bool b) { return a || a.ctx().bool_val(b); }\n\n\n\n inline expr operator||(bool a, expr const & b) { return b.ctx().bool_val(a) || b; }\n\n\n\n inline expr operator==(expr const & a, expr const & b) {\n\n check_context(a, b);\n\n Z3_ast r = Z3_mk_eq(a.ctx(), a, b);\n\n a.check_error();\n\n return expr(a.ctx(), r);\n\n }\n","file_path":"tests/benchmark/include/z3++.h","rank":99,"score":61461.98766228797}],"string":"[\n {\n \"content\": \"enum SMT_SOLVER { Z3, MATHSAT, SMTINTERPOL };\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 0,\n \"score\": 219527.99814903465\n },\n {\n \"content\": \"enum BENCHMARK_EXIT_CODE { SUCCESS, FAILED, TIMEOUT };\\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 1,\n \"score\": 118119.87622310914\n },\n {\n \"content\": \" class solver;\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 2,\n \"score\": 115627.8942689355\n },\n {\n \"content\": \" class solver : public object {\\n\\n Z3_solver m_solver;\\n\\n void init(Z3_solver s) {\\n\\n m_solver = s;\\n\\n Z3_solver_inc_ref(ctx(), s);\\n\\n }\\n\\n public:\\n\\n struct simple {};\\n\\n struct translate {};\\n\\n solver(context & c):object(c) { init(Z3_mk_solver(c)); }\\n\\n solver(context & c, simple):object(c) { init(Z3_mk_simple_solver(c)); }\\n\\n solver(context & c, Z3_solver s):object(c) { init(s); }\\n\\n solver(context & c, char const * logic):object(c) { init(Z3_mk_solver_for_logic(c, c.str_symbol(logic))); }\\n\\n solver(context & c, solver const& src, translate): object(c) { init(Z3_solver_translate(src.ctx(), src, c)); }\\n\\n solver(solver const & s):object(s) { init(s.m_solver); }\\n\\n ~solver() { Z3_solver_dec_ref(ctx(), m_solver); }\\n\\n operator Z3_solver() const { return m_solver; }\\n\\n solver & operator=(solver const & s) {\\n\\n Z3_solver_inc_ref(s.ctx(), s.m_solver);\\n\\n Z3_solver_dec_ref(ctx(), m_solver);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 3,\n \"score\": 102673.08763681822\n },\n {\n \"content\": \"class UAutomizerFileReader {\\n\\n\\n\\n std::string line, current_frame, current_file;\\n\\n int nesting_level, max_nesting_level;\\n\\n unsigned num;\\n\\n bool is_mem_safety_track;\\n\\n std::vector<std::string> stack_of_frames;\\n\\n SMT_SOLVER curr_solver;\\n\\n std::string const name_solver;\\n\\n unsigned num_samples;\\n\\n char * const file_statistics;\\n\\n bool test_our_implementation;\\n\\n\\n\\n bool hasNonSupportedSymbols(z3::expr const &) const;\\n\\n std::string nameAssertionsZ3(std::string const &) const;\\n\\n std::string nameAssertionsMathsat(std::string const &) const;\\n\\n\\n\\n bool isPushCmd() const;\\n\\n bool isPopCmd() const;\\n\\n bool isEchoCmd() const; \\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 4,\n \"score\": 93856.91520494904\n },\n {\n \"content\": \"\\n\\n void testAXDInterpolator() const; \\n\\n void testOtherSolvers(); \\n\\n void reset(); \\n\\n\\n\\n public:\\n\\n UAutomizerFileReader(SMT_SOLVER, unsigned, char * const, bool, bool);\\n\\n \\n\\n void process(char const *);\\n\\n void processSingleFile(char const *);\\n\\n};\\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 5,\n \"score\": 86272.75079068461\n },\n {\n \"content\": \" std::ofstream smt_file (temp_file.c_str());\\\\\\n\\n \\\\\\n\\n for(auto const & x : stack_of_frames)\\\\\\n\\n smt_file << x << std::endl;\\\\\\n\\n smt_file << current_frame << std::endl;\\\\\\n\\n smt_file.close();\\\\\\n\\n\\n\\n#define BENCHMARK_COMMAND(WRITER, EXEC_COMMAND, LOG_COMMAND)\\\\\\n\\n z3::context ctx;\\\\\\n\\n z3::solver input_parser(ctx, \\\"QF_AUFLIA\\\");\\\\\\n\\n input_parser.from_file(temp_file.c_str());\\\\\\n\\n \\\\\\n\\n for(auto const & x : input_parser.assertions()){\\\\\\n\\n if(hasNonSupportedSymbols(x)){\\\\\\n\\n system((\\\"rm -rf \\\" + temp_file).c_str());\\\\\\n\\n return;\\\\\\n\\n }\\\\\\n\\n }\\\\\\n\\n \\\\\\n\\n if(input_parser.check() == z3::unsat){\\\\\\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 6,\n \"score\": 86268.95768892833\n },\n {\n \"content\": \"#include <iostream>\\n\\n#include <cassert>\\n\\n#include <regex>\\n\\n#include <fstream>\\n\\n#include <string>\\n\\n#include <type_traits>\\n\\n#include <vector>\\n\\n#include <cstring>\\n\\n#include <stdio.h>\\n\\n#include <string>\\n\\n#include <cstdlib>\\n\\n#include <regex>\\n\\n#include \\\"z3++.h\\\"\\n\\n\\n\\n#define SINGLE_FORMULA 0\\n\\n#define REPORT_BAD_CASES 0\\n\\n\\n\\n#define TEMP_FILE_SETUP\\\\\\n\\n std::string temp_file =\\\\\\n\\n \\\"temp_\\\" + name_solver + \\\"_\\\" + current_file;\\\\\\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 7,\n \"score\": 86265.84348226433\n },\n {\n \"content\": \" std::string file_for_implementation =\\\\\\n\\n \\\"axdinterpolator_\\\" + name_solver + \\\"_\\\" + current_file;\\\\\\n\\n std::ofstream axdinterpolator_file(file_for_implementation.c_str());\\\\\\n\\n \\\\\\n\\n z3::expr_vector curr_assertions = input_parser.assertions();\\\\\\n\\n z3::expr_vector part_a(ctx), part_b(ctx);\\\\\\n\\n \\\\\\n\\n auto const & to_cnf_tactic = \\\\\\n\\n z3::tactic(ctx, \\\"tseitin-cnf\\\");\\\\\\n\\n \\\\\\n\\n z3::goal goal_assertions(ctx);\\\\\\n\\n goal_assertions.add(z3::mk_and(curr_assertions));\\\\\\n\\n auto const & cnf_assertions = to_cnf_tactic(goal_assertions);\\\\\\n\\n \\\\\\n\\n assert(cnf_assertions.size() == 1);\\\\\\n\\n z3::expr const & curr_conjunction = cnf_assertions[0].as_expr();\\\\\\n\\n \\\\\\n\\n unsigned total_size_cnf = curr_conjunction.num_args();\\\\\\n\\n unsigned half_size_cnf = total_size_cnf/2;\\\\\\n\\n if(curr_conjunction.decl().decl_kind() != Z3_OP_AND\\\\\\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 8,\n \"score\": 86264.71120661046\n },\n {\n \"content\": \" || half_size_cnf == 0\\\\\\n\\n || (total_size_cnf - half_size_cnf) == 0 \\\\\\n\\n ){\\\\\\n\\n axdinterpolator_file.close();\\\\\\n\\n system((\\\"rm -rf \\\" + file_for_implementation).c_str());\\\\\\n\\n system((\\\"rm -rf \\\" + temp_file).c_str());\\\\\\n\\n return;\\\\\\n\\n }\\\\\\n\\n \\\\\\n\\n part_a.push_back(ctx.bool_val(true));\\\\\\n\\n part_b.push_back(ctx.bool_val(true));\\\\\\n\\n for(unsigned i = 0; i < half_size_cnf; i++)\\\\\\n\\n part_a.push_back(curr_conjunction.arg(i));\\\\\\n\\n for(unsigned i = half_size_cnf; i < total_size_cnf; i++)\\\\\\n\\n part_b.push_back(curr_conjunction.arg(i));\\\\\\n\\n \\\\\\n\\n WRITER;\\\\\\n\\n \\\\\\n\\n char exec_command[1000];\\\\\\n\\n EXEC_COMMAND;\\\\\\n\\n int ret = system(exec_command);\\\\\\n\\n char log_command[1000];\\\\\\n\\n LOG_COMMAND;\\\\\\n\\n system(log_command);\\\\\\n\\n \\\\\\n\\n system((\\\"rm -rf \\\" + file_for_implementation).c_str());\\\\\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/UAutomizerFileReader.h\",\n \"rank\": 9,\n \"score\": 86263.44279618328\n },\n {\n \"content\": \"#include \\\"UAutomizerFileReader.h\\\"\\n\\n\\n\\nstd::string UAutomizerFileReader::nameAssertionsZ3(std::string const & s) const {\\n\\n std::stringstream decl_strm(s);\\n\\n std::string curr_line, collected_assertion = \\\"\\\", ret = \\\"\\\";\\n\\n bool matching_assert = false, matching_part_a = true;\\n\\n unsigned num_balanced_paren = 0;\\n\\n\\n\\n while(std::getline(decl_strm, curr_line)){\\n\\n\\n\\n if(curr_line.find(\\\"(assert\\\") != std::string::npos)\\n\\n matching_assert = true;\\n\\n\\n\\n if(matching_assert){\\n\\n for(auto const & c : curr_line){\\n\\n if(c == '(')\\n\\n num_balanced_paren++;\\n\\n if(c == ')')\\n\\n num_balanced_paren--;\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp\",\n \"rank\": 10,\n \"score\": 80341.74349391981\n },\n {\n \"content\": \" return ret;\\n\\n}\\n\\n\\n\\nstd::string UAutomizerFileReader::nameAssertionsMathsat(std::string const & s) const {\\n\\n std::stringstream decl_strm(s);\\n\\n std::string curr_line, collected_assertion = \\\"\\\", ret = \\\"\\\";\\n\\n bool matching_assert = false, matching_part_a = true;\\n\\n unsigned num_balanced_paren = 0;\\n\\n\\n\\n while(std::getline(decl_strm, curr_line)){\\n\\n\\n\\n if(curr_line.find(\\\"(assert\\\") != std::string::npos)\\n\\n matching_assert = true;\\n\\n\\n\\n if(matching_assert){\\n\\n for(auto const & c : curr_line){\\n\\n if(c == '(')\\n\\n num_balanced_paren++;\\n\\n if(c == ')')\\n\\n num_balanced_paren--;\\n\",\n \"file_path\": \"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp\",\n \"rank\": 11,\n \"score\": 80339.80502556675\n },\n {\n \"content\": \" }\\n\\n\\n\\n collected_assertion += curr_line;\\n\\n if(num_balanced_paren == 0){\\n\\n matching_assert = false;\\n\\n collected_assertion = collected_assertion.substr(8);\\n\\n collected_assertion.pop_back();\\n\\n if(matching_part_a){\\n\\n collected_assertion = \\\"(assert (! \\\" + collected_assertion +\\\" :interpolation-group part_a))\\\";\\n\\n matching_part_a = false;\\n\\n }\\n\\n else\\n\\n collected_assertion = \\\"(assert (! \\\" + collected_assertion +\\\" :interpolation-group part_b))\\\";\\n\\n\\n\\n ret += collected_assertion + \\\"\\\\n\\\";\\n\\n collected_assertion = \\\"\\\";\\n\\n }\\n\\n }\\n\\n else\\n\\n ret += curr_line + \\\"\\\\n\\\";\\n\\n }\\n\\n return ret;\\n\\n}\\n\",\n \"file_path\": \"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp\",\n \"rank\": 12,\n \"score\": 80332.0679691368\n },\n {\n \"content\": \"\\n\\n collected_assertion += curr_line;\\n\\n if(num_balanced_paren == 0){\\n\\n matching_assert = false;\\n\\n collected_assertion = collected_assertion.substr(8);\\n\\n collected_assertion.pop_back();\\n\\n if(matching_part_a){\\n\\n collected_assertion = \\\"(assert (! \\\" + collected_assertion +\\\" :named part_a))\\\";\\n\\n matching_part_a = false;\\n\\n }\\n\\n else\\n\\n collected_assertion = \\\"(assert (! \\\" + collected_assertion +\\\" :named part_b))\\\";\\n\\n\\n\\n ret += collected_assertion + \\\"\\\\n\\\";\\n\\n collected_assertion = \\\"\\\";\\n\\n }\\n\\n }\\n\\n else\\n\\n ret += curr_line + \\\"\\\\n\\\";\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/src/UAutomizerFileReader-nameAssertions.cpp\",\n \"rank\": 13,\n \"score\": 80328.43899097358\n },\n {\n \"content\": \" class z3_expr_vector_unique : public z3::expr_vector {\\n\\n std::set<unsigned> expr_ids;\\n\\n\\n\\n public:\\n\\n z3_expr_vector_unique(z3::context &);\\n\\n void push(z3::expr const &);\\n\\n };\\n\\n\\n\",\n \"file_path\": \"include/AXDSignature.h\",\n \"rank\": 14,\n \"score\": 71695.18812625401\n },\n {\n \"content\": \" class z3_sort_vector_unique : public z3::sort_vector {\\n\\n std::set<unsigned> sort_ids;\\n\\n\\n\\n public:\\n\\n z3_sort_vector_unique(z3::context &);\\n\\n void push(z3::sort const &);\\n\\n };\\n\\n\\n\\n static bool isSpaceOrParen(char);\\n\\n void extractNameFromSort(std::string &) const;\\n\\n void processArrayDecls(std::string &);\\n\\n void indexElementSorts();\\n\\n\\n\\n bool is_QF_TO() const;\\n\\n bool is_QF_IDL() const;\\n\\n bool isArraySort(z3::sort const &) const;\\n\\n\\n\\n void setTheory(TheoryName);\\n\\n\\n\\n TheoryName const & getTheoryName() const;\\n\",\n \"file_path\": \"include/AXDSignature.h\",\n \"rank\": 15,\n \"score\": 71695.18812625401\n },\n {\n \"content\": \" AXDInterpolant(\\n\\n AXDSignature &, \\n\\n z3::expr const &,\\n\\n z3::expr const &,\\n\\n char const *, \\n\\n unsigned);\\n\\n\\n\\n void z3OutputFile();\\n\\n void mathsatOutputFile();\\n\\n void smtInterpolOutputFile();\\n\\n\\n\\n friend std::ostream & operator << (\\n\\n std::ostream &, AXDInterpolant const &);\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"include/AXDInterpolant.h\",\n \"rank\": 16,\n \"score\": 67185.31580865938\n },\n {\n \"content\": \" enum StateOutput { undefined, fine, notfine };\\n\\n\\n\\n StandardInput part_a, part_b;\\n\\n std::string m_file_name;\\n\\n unsigned num_attempts, remaining_fuel;\\n\\n bool is_interpolant_computed,\\n\\n is_unsat,\\n\\n is_valid_result;\\n\\n StateOutput state_output;\\n\\n z3::expr current_interpolant;\\n\\n z3::solver solver;\\n\\n\\n\\n void loop();\\n\\n\\n\\n bool testOutput(\\n\\n z3::expr_vector const &, \\n\\n z3::expr_vector &, \\n\\n z3::expr_vector &);\\n\\n void testOutputArrayAxiomatization(z3::solver &);\\n\\n void testOutputDiffLifting(\\n\",\n \"file_path\": \"include/AXDInterpolant.h\",\n \"rank\": 17,\n \"score\": 67181.80398773948\n },\n {\n \"content\": \" z3::solver & s, \\n\\n StandardInput const &);\\n\\n\\n\\n void SmtSolverSetup(\\n\\n z3::solver &, \\n\\n StandardInput const &);\\n\\n void SmtSolverOutStreamSetup(\\n\\n std::ostream &, \\n\\n StandardInput const &);\\n\\n void AB_VectorsSetup(\\n\\n z3::expr_vector &, \\n\\n StandardInput const &);\\n\\n\\n\\n z3::expr liftInterpolant(z3::expr_vector const &); \\n\\n void liftInterpolantDiffSubs(\\n\\n z3::expr_vector &, \\n\\n z3::expr_vector &, \\n\\n StandardInput const &); \\n\\n\\n\\n public: \\n\",\n \"file_path\": \"include/AXDInterpolant.h\",\n \"rank\": 18,\n \"score\": 67178.90766004712\n },\n {\n \"content\": \"#ifndef _AXD_INTERPOLANT_\\n\\n#define _AXD_INTERPOLANT_\\n\\n\\n\\n#include \\\"z3++.h\\\"\\n\\n#include <iostream>\\n\\n#include <utility>\\n\\n#include <set>\\n\\n#include <cstring>\\n\\n#include <fstream>\\n\\n#include \\\"Preprocess.h\\\"\\n\\n#include \\\"StandardInput.h\\\"\\n\\n\\n\\n#define _DEBUG_AXD_LOOP_ 0\\n\\n#define _DEBUG_AXD_CONSTRUCTOR_ 0\\n\\n#define _TEST_OUTPUT_ 0\\n\\n#define _TEST_OUTPUT_ORIGINAL_THY_ 0\\n\\n#define _INCLUDE_OUTPUT_ 1\\n\\n\\n\\n#define CURRENT_DIR std::string(\\\"replace_once\\\")\\n\\n#define OUTPUT_DIR CURRENT_DIR + std::string(\\\"/output\\\")\\n\\n\\n\\n// Notes:\\n\\n// The input file is a smt2 file\\n\\n// with two assertions.\\n\\n// Each assertion is \\n\\n// of the form (and <pred_1> \\\\dots <pred_n>).\\n\\n\\n\",\n \"file_path\": \"include/AXDInterpolant.h\",\n \"rank\": 19,\n \"score\": 67176.05096247296\n },\n {\n \"content\": \"class AXDInterpolant : public Preprocessor {\\n\\n\\n\",\n \"file_path\": \"include/AXDInterpolant.h\",\n \"rank\": 20,\n \"score\": 65546.3856023725\n },\n {\n \"content\": \" system((\\\"rm -rf \\\" \\n\\n + OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\").c_str());\\n\\n\\n\\n if(is_valid_result){\\n\\n // Lift interpolant to MaxDiff(Index Theory)\\n\\n z3::solver mathsat_interpolant_parser(sig.ctx);\\n\\n mathsat_interpolant_parser.from_string(interpolant_from_file.c_str());\\n\\n\\n\\n is_interpolant_computed = true;\\n\\n current_interpolant = liftInterpolant(\\n\\n mathsat_interpolant_parser.assertions());\\n\\n\\n\\n#if _TEST_OUTPUT_\\n\\n TEST_OUTPUT_CODE(mathsat_interpolant_parser);\\n\\n#endif\\n\\n }\\n\\n}\\n\\n\\n\\nvoid AXDInterpolant::smtInterpolOutputFile(){\\n\\n if(!is_unsat)\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 21,\n \"score\": 61853.15660815486\n },\n {\n \"content\": \" smtinterpol_file << solver.to_smt2_decls_only();\\n\\n smtinterpol_file << \\\"(assert (! (and\\\" << std::endl;\\n\\n // This true assertion prevents \\n\\n // an unary application of and\\n\\n smtinterpol_file << \\\"true\\\" << std::endl;\\n\\n SmtSolverOutStreamSetup(smtinterpol_file, part_a);\\n\\n smtinterpol_file << \\\") :named part_a))\\\" << std::endl;\\n\\n smtinterpol_file << \\\"(assert (! (and\\\" << std::endl;\\n\\n // This true assertion prevents \\n\\n // an unary application of and\\n\\n smtinterpol_file << \\\"true\\\" << std::endl;\\n\\n SmtSolverOutStreamSetup(smtinterpol_file, part_b);\\n\\n smtinterpol_file << \\\") :named part_b))\\\" << std::endl;\\n\\n smtinterpol_file << \\\"(check-sat)\\\" << std::endl;\\n\\n smtinterpol_file << \\\"(get-interpolants part_a part_b)\\\" << std::endl;\\n\\n\\n\\n // Obtain reduced interpolant in <m_file_name>temp.smt2\\n\\n system((\\\"java -jar \\\" + CURRENT_DIR \\n\\n + \\\"/bin/smtinterpol-2.5-663-gf15aa217.jar -w \\\" \\n\\n + OUTPUT_DIR + \\\"/\\\" + m_file_name \\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 22,\n \"score\": 61850.838348579455\n },\n {\n \"content\": \" interpolant_from_file += \\\"(check-sat)\\\\n\\\";\\n\\n system((\\\"rm -rf \\\" \\n\\n + OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\").c_str());\\n\\n\\n\\n if(is_valid_result){\\n\\n // Lift interpolant to MaxDiff(Index Theory)\\n\\n z3::solver z3_interpolant_parser(sig.ctx);\\n\\n z3_interpolant_parser.from_string(interpolant_from_file.c_str());\\n\\n\\n\\n is_interpolant_computed = true;\\n\\n current_interpolant = liftInterpolant(\\n\\n z3_interpolant_parser.assertions());\\n\\n\\n\\n#if _TEST_OUTPUT_\\n\\n TEST_OUTPUT_CODE(z3_interpolant_parser);\\n\\n#endif\\n\\n }\\n\\n}\\n\\n\\n\\nvoid AXDInterpolant::mathsatOutputFile(){\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 23,\n \"score\": 61850.643193305215\n },\n {\n \"content\": \" interpolant_from_file += line.erase(0, 1) + \\\"\\\\n\\\";\\n\\n // The following removes the last parenthesis \\n\\n // and the extra '\\\\n'\\n\\n interpolant_from_file.erase(interpolant_from_file.size() - 2, 2);\\n\\n is_valid_result = interpolant_from_file.size() > 0;\\n\\n // Only one parenthesis is needed to close\\n\\n // the above since the content of (interpolant *)\\n\\n // includes an additional parenthesis\\n\\n interpolant_from_file += \\\")\\\\n\\\";\\n\\n interpolant_from_file += \\\"(check-sat)\\\\n\\\";\\n\\n //system((\\\"rm -rf \\\" \\n\\n //+ OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\").c_str());\\n\\n\\n\\n if(is_valid_result){\\n\\n // Lift interpolant to MaxDiff(Index Theory)\\n\\n z3::solver smtinterpol_interpolant_parser(sig.ctx);\\n\\n smtinterpol_interpolant_parser.from_string(interpolant_from_file.c_str());\\n\\n\\n\\n is_interpolant_computed = true;\\n\\n current_interpolant = liftInterpolant(\\n\\n smtinterpol_interpolant_parser.assertions());\\n\\n\\n\\n#if _TEST_OUTPUT_\\n\\n TEST_OUTPUT_CODE(smtinterpol_interpolant_parser);\\n\\n#endif\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 24,\n \"score\": 61850.375009613825\n },\n {\n \"content\": \" mathsat_file << solver.to_smt2_decls_only();\\n\\n mathsat_file << \\\"(assert (! (and\\\" << std::endl;\\n\\n // This true assertion prevents \\n\\n // an unary application of and\\n\\n mathsat_file << \\\"true\\\" << std::endl;\\n\\n SmtSolverOutStreamSetup(mathsat_file, part_a);\\n\\n mathsat_file << \\\") :interpolation-group part_a))\\\" << std::endl;\\n\\n mathsat_file << \\\"(assert (! (and \\\" << std::endl;\\n\\n // This true assertion prevents \\n\\n // an unary application of and\\n\\n mathsat_file << \\\"true\\\" << std::endl;\\n\\n SmtSolverOutStreamSetup(mathsat_file, part_b);\\n\\n mathsat_file << \\\") :interpolation-group part_b))\\\" << std::endl;\\n\\n mathsat_file << \\\"(check-sat)\\\" << std::endl;\\n\\n mathsat_file << \\\"(get-interpolant (part_a))\\\" << std::endl;\\n\\n mathsat_file << \\\"(exit)\\\" << std::endl;\\n\\n\\n\\n // Obtain reduced interpolant in <m_file_name>temp.smt2\\n\\n system((CURRENT_DIR \\n\\n + \\\"/bin/mathsat \\\" \\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 25,\n \"score\": 61849.2297480949\n },\n {\n \"content\": \" // to parse reduced interpolant\\n\\n std::ifstream result(OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\");\\n\\n std::string line(\\\"\\\"), interpolant_from_file(\\\"\\\");\\n\\n // We consume two lines because\\n\\n // z3 outputs \\\"check-sat\\\" followed\\n\\n // a line containing \\\"(interpolants\\\", followed\\n\\n // by the interpolant\\n\\n std::getline(result, line);\\n\\n std::getline(result, line);\\n\\n\\n\\n interpolant_from_file += solver.to_smt2_decls_only();\\n\\n interpolant_from_file += \\\"(assert (and\\\\n\\\";\\n\\n while(std::getline(result, line)){\\n\\n is_valid_result = true;\\n\\n interpolant_from_file += line + \\\"\\\\n\\\";\\n\\n }\\n\\n // Only one parenthesis is needed to close\\n\\n // the above since the content of (interpolant *)\\n\\n // includes an additional parenthesis\\n\\n interpolant_from_file += \\\")\\\\n\\\";\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 26,\n \"score\": 61846.672774480525\n },\n {\n \"content\": \" + OUTPUT_DIR + \\\"/\\\" + m_file_name \\n\\n + \\\"_reduced_mathsat.smt2 > \\\" \\n\\n + OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\").c_str());\\n\\n\\n\\n // Setup *_reduced_interpolant_mathsat.smt2 file\\n\\n // to parse reduced interpolant\\n\\n std::ifstream result(OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\");\\n\\n std::string line(\\\"\\\"), interpolant_from_file(\\\"\\\");\\n\\n // We consume one line because\\n\\n // mathsat outputs \\\"check-sat\\\" followed\\n\\n // by the interpolant\\n\\n std::getline(result, line);\\n\\n interpolant_from_file += solver.to_smt2_decls_only();\\n\\n interpolant_from_file += \\\"(assert \\\\n\\\";\\n\\n while(std::getline(result, line)){\\n\\n is_valid_result = true;\\n\\n interpolant_from_file += line + \\\"\\\\n\\\";\\n\\n }\\n\\n interpolant_from_file += \\\")\\\\n\\\";\\n\\n interpolant_from_file += \\\"(check-sat)\\\\n\\\";\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 27,\n \"score\": 61846.15717889502\n },\n {\n \"content\": \" + \\\"_reduced_smtinterpol.smt2 > \\\"\\n\\n + OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\").c_str());\\n\\n\\n\\n // Setup *_reduced_interpolant_smtinterpol.smt2 file\\n\\n // to parse reduced interpolant\\n\\n std::ifstream result(OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\");\\n\\n std::string line(\\\"\\\"), interpolant_from_file(\\\"\\\");\\n\\n // We consume one line because\\n\\n // mathsat outputs \\\"check-sat\\\" followed\\n\\n // by the interpolant\\n\\n std::getline(result, line);\\n\\n interpolant_from_file += solver.to_smt2_decls_only();\\n\\n interpolant_from_file += \\\"(assert \\\\n\\\";\\n\\n // SMTINTERPOL returns a single\\n\\n // line containing a list\\n\\n // of sequence interpolants\\n\\n // Thus, we remove the initial and\\n\\n // last character which are '(' and ')' \\n\\n // respectively\\n\\n std::getline(result, line);\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 28,\n \"score\": 61845.74856239847\n },\n {\n \"content\": \"#include \\\"AXDInterpolant.h\\\"\\n\\n\\n\\n#define TEST_OUTPUT_CODE(PARSED_FROM_SOLVER_INTERPOLANT) \\\\\\n\\n z3::expr_vector _part_a_vector(sig.ctx); \\\\\\n\\n z3::expr_vector _part_b_vector(sig.ctx); \\\\\\n\\n AB_VectorsSetup(_part_a_vector, part_a); \\\\\\n\\n AB_VectorsSetup(_part_b_vector, part_b); \\\\\\n\\n if(testOutput(PARSED_FROM_SOLVER_INTERPOLANT.assertions(), \\\\\\n\\n _part_a_vector, _part_b_vector)) \\\\\\n\\n state_output = fine; \\\\\\n\\n else \\\\\\n\\n state_output = notfine;\\n\\n\\n\\nvoid AXDInterpolant::z3OutputFile(){\\n\\n if(!is_unsat)\\n\\n throw \\n\\n \\\"Input problem \\\"\\n\\n \\\"is not unsatisfiable.\\\";\\n\\n // Setup smt2 file with reduced formulas\\n\\n // in Index Theory + EUF\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 29,\n \"score\": 61845.05334253524\n },\n {\n \"content\": \" z3_file << \\\"true\\\" << std::endl;\\n\\n SmtSolverOutStreamSetup(z3_file, part_a);\\n\\n z3_file << \\\") :named part_a))\\\" << std::endl;\\n\\n z3_file << \\\"(assert (! (and\\\" << std::endl;\\n\\n // This true assertion prevents \\n\\n // an unary application of and\\n\\n z3_file << \\\"true\\\" << std::endl;\\n\\n SmtSolverOutStreamSetup(z3_file, part_b);\\n\\n z3_file << \\\") :named part_b))\\\" << std::endl;\\n\\n z3_file << \\\"(check-sat)\\\" << std::endl;\\n\\n z3_file << \\\"(get-interpolant part_a part_b)\\\" << std::endl;\\n\\n\\n\\n // Obtain reduced interpolant in <m_file_name>temp.smt2\\n\\n system((CURRENT_DIR \\n\\n + \\\"/bin/z3 \\\" \\n\\n + OUTPUT_DIR + \\\"/\\\" + m_file_name \\n\\n + \\\"_reduced_z3.smt2 > \\\"\\n\\n + OUTPUT_DIR + \\\"/\\\" + m_file_name + \\\"temp.smt2\\\").c_str());\\n\\n\\n\\n // Setup *_reduced_interpolant_z3.smt2 file\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 30,\n \"score\": 61843.75598395975\n },\n {\n \"content\": \" system((\\\"mkdir -p \\\" + OUTPUT_DIR).c_str());\\n\\n std::ofstream z3_file(\\n\\n OUTPUT_DIR + \\\"/\\\" + m_file_name \\n\\n + \\\"_reduced_z3.smt2\\\");\\n\\n\\n\\n z3_file \\n\\n << \\\"(set-option :produce-interpolants true)\\\" \\n\\n << std::endl;\\n\\n // Setup logic engine\\n\\n z3_file \\n\\n << \\\"(set-logic \\\" \\n\\n << ( (sig.is_QF_TO() ||\\n\\n sig.is_QF_IDL()) ? \\n\\n \\\"QF_UFIDL\\\" : \\\"QF_UFLIA\\\") << \\\")\\\" << std::endl;\\n\\n //\\\"QF_UFLIA\\\" : \\\"QF_UFLIA\\\") << \\\")\\\" << std::endl;\\n\\n\\n\\n z3_file << solver.to_smt2_decls_only();\\n\\n z3_file << \\\"(assert (! (and\\\" << std::endl;\\n\\n // This true assertion prevents \\n\\n // an unary application of and\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 31,\n \"score\": 61841.808151311736\n },\n {\n \"content\": \" if(!is_unsat)\\n\\n throw \\n\\n \\\"Input problem is not unsatisfiable.\\\";\\n\\n // Setup smt2 file with reduced formulas\\n\\n // in Index Theory + EUF\\n\\n system((\\\"mkdir -p \\\" + OUTPUT_DIR).c_str());\\n\\n std::ofstream mathsat_file(\\n\\n OUTPUT_DIR + \\\"/\\\" + m_file_name \\n\\n + \\\"_reduced_mathsat.smt2\\\");\\n\\n\\n\\n mathsat_file \\n\\n << \\\"(set-option :produce-interpolants true)\\\" \\n\\n << std::endl;\\n\\n // Setup logic engine\\n\\n mathsat_file \\n\\n << \\\"(set-logic \\\" \\n\\n << ((sig.is_QF_TO() ||\\n\\n sig.is_QF_IDL()) ? \\n\\n \\\"QF_UFIDL\\\" : \\\"QF_UFLIA\\\") << \\\")\\\" << std::endl;\\n\\n\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 32,\n \"score\": 61838.869314587384\n },\n {\n \"content\": \" throw \\n\\n \\\"Input problem is not unsatisfiable.\\\";\\n\\n // Setup smt2 file with reduced formulas\\n\\n // in Index Theory + EUF\\n\\n system((\\\"mkdir -p \\\" + OUTPUT_DIR).c_str());\\n\\n std::ofstream smtinterpol_file(\\n\\n OUTPUT_DIR + \\\"/\\\" + m_file_name \\n\\n + \\\"_reduced_smtinterpol.smt2\\\");\\n\\n\\n\\n smtinterpol_file \\n\\n << \\\"(set-option :print-success false)\\\\n\\\" \\n\\n << \\\"(set-option :produce-interpolants true)\\\" \\n\\n << std::endl;\\n\\n // Setup logic engine\\n\\n smtinterpol_file \\n\\n << \\\"(set-logic \\\" \\n\\n << ((sig.is_QF_TO() ||\\n\\n sig.is_QF_IDL()) ? \\n\\n \\\"QF_UFIDL\\\" : \\\"QF_UFLIA\\\") << \\\")\\\" << std::endl;\\n\\n\\n\",\n \"file_path\": \"src/AXDInterpolant-OutputFile.cpp\",\n \"rank\": 33,\n \"score\": 61836.27939505367\n },\n {\n \"content\": \" m_ctx = s.m_ctx;\\n\\n m_solver = s.m_solver;\\n\\n return *this;\\n\\n }\\n\\n void set(params const & p) { Z3_solver_set_params(ctx(), m_solver, p); check_error(); }\\n\\n void set(char const * k, bool v) { params p(ctx()); p.set(k, v); set(p); }\\n\\n void set(char const * k, unsigned v) { params p(ctx()); p.set(k, v); set(p); }\\n\\n void set(char const * k, double v) { params p(ctx()); p.set(k, v); set(p); }\\n\\n void set(char const * k, symbol const & v) { params p(ctx()); p.set(k, v); set(p); }\\n\\n void set(char const * k, char const* v) { params p(ctx()); p.set(k, v); set(p); }\\n\\n void push() { Z3_solver_push(ctx(), m_solver); check_error(); }\\n\\n void pop(unsigned n = 1) { Z3_solver_pop(ctx(), m_solver, n); check_error(); }\\n\\n void reset() { Z3_solver_reset(ctx(), m_solver); check_error(); }\\n\\n void add(expr const & e) { assert(e.is_bool()); Z3_solver_assert(ctx(), m_solver, e); check_error(); }\\n\\n void add(expr const & e, expr const & p) {\\n\\n assert(e.is_bool()); assert(p.is_bool()); assert(p.is_const());\\n\\n Z3_solver_assert_and_track(ctx(), m_solver, e, p);\\n\\n check_error();\\n\\n }\\n\\n void add(expr const & e, char const * p) {\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 34,\n \"score\": 61477.63592197766\n },\n {\n \"content\": \" add(e, ctx().bool_const(p));\\n\\n }\\n\\n // fails for some compilers: \\n\\n // void add(expr_vector const& v) { check_context(*this, v); for (expr e : v) add(e); }\\n\\n void from_file(char const* file) { Z3_solver_from_file(ctx(), m_solver, file); ctx().check_parser_error(); }\\n\\n void from_string(char const* s) { Z3_solver_from_string(ctx(), m_solver, s); ctx().check_parser_error(); }\\n\\n\\n\\n check_result check() { Z3_lbool r = Z3_solver_check(ctx(), m_solver); check_error(); return to_check_result(r); }\\n\\n check_result check(unsigned n, expr * const assumptions) {\\n\\n array<Z3_ast> _assumptions(n);\\n\\n for (unsigned i = 0; i < n; i++) {\\n\\n check_context(*this, assumptions[i]);\\n\\n _assumptions[i] = assumptions[i];\\n\\n }\\n\\n Z3_lbool r = Z3_solver_check_assumptions(ctx(), m_solver, n, _assumptions.ptr());\\n\\n check_error();\\n\\n return to_check_result(r);\\n\\n }\\n\\n check_result check(expr_vector assumptions) {\\n\\n unsigned n = assumptions.size();\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 35,\n \"score\": 61474.061756000614\n },\n {\n \"content\": \" \\\\brief Return true if this expression is a constant (i.e., an application with 0 arguments).\\n\\n */\\n\\n bool is_const() const { return is_app() && num_args() == 0; }\\n\\n /**\\n\\n \\\\brief Return true if this expression is a quantifier.\\n\\n */\\n\\n bool is_quantifier() const { return kind() == Z3_QUANTIFIER_AST; }\\n\\n /**\\n\\n \\\\brief Return true if this expression is a variable.\\n\\n */\\n\\n bool is_var() const { return kind() == Z3_VAR_AST; }\\n\\n /**\\n\\n \\\\brief Return true if expression is an algebraic number.\\n\\n */\\n\\n bool is_algebraic() const { return 0 != Z3_is_algebraic_number(ctx(), m_ast); }\\n\\n\\n\\n /**\\n\\n \\\\brief Return true if this expression is well sorted (aka type correct).\\n\\n */\\n\\n bool is_well_sorted() const { bool r = Z3_is_well_sorted(ctx(), m_ast) != 0; check_error(); return r; }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 36,\n \"score\": 61469.96957382528\n },\n {\n \"content\": \" }\\n\\n\\n\\n std::string to_smt2_decls_only(char const* status = \\\"unknown\\\") {\\n\\n array<Z3_ast> es(assertions());\\n\\n Z3_ast const* fmls = es.ptr();\\n\\n Z3_ast fml = 0;\\n\\n unsigned sz = es.size();\\n\\n if (sz > 0) {\\n\\n --sz;\\n\\n fml = fmls[sz];\\n\\n }\\n\\n else {\\n\\n fml = ctx().bool_val(true);\\n\\n }\\n\\n return std::string(Z3_benchmark_to_smtlib_string_decls_only(\\n\\n ctx(),\\n\\n \\\"\\\", \\\"\\\", status, \\\"\\\",\\n\\n sz,\\n\\n fmls,\\n\\n fml));\\n\\n }\\n\\n\\n\\n param_descrs get_param_descrs() { return param_descrs(ctx(), Z3_solver_get_param_descrs(ctx(), m_solver)); }\\n\\n\\n\\n };\\n\\n inline std::ostream & operator<<(std::ostream & out, solver const & s) { out << Z3_solver_to_string(s.ctx(), s); return out; }\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 37,\n \"score\": 61469.41788273367\n },\n {\n \"content\": \"\\n\\n inline check_result context::compute_interpolant(expr const& pat, params const& p, expr_vector& i, model& m) {\\n\\n Z3_ast_vector interp = 0;\\n\\n Z3_model mdl = 0;\\n\\n Z3_lbool r = Z3_compute_interpolant(*this, pat, p, &interp, &mdl);\\n\\n switch (r) {\\n\\n case Z3_L_FALSE:\\n\\n i = expr_vector(*this, interp);\\n\\n break;\\n\\n case Z3_L_TRUE:\\n\\n m = model(*this, mdl);\\n\\n break;\\n\\n case Z3_L_UNDEF:\\n\\n break;\\n\\n }\\n\\n return to_check_result(r);\\n\\n }\\n\\n\\n\\n inline expr_vector context::get_interpolant(expr const& proof, expr const& pat, params const& p) {\\n\\n return expr_vector(*this, Z3_get_interpolant(*this, proof, pat, p));\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 38,\n \"score\": 61469.38068112327\n },\n {\n \"content\": \" struct interpolation {};\\n\\n context() { config c; init(c); }\\n\\n context(config & c) { init(c); }\\n\\n context(config & c, interpolation) { init_interp(c); }\\n\\n ~context() { Z3_del_context(m_ctx); }\\n\\n operator Z3_context() const { return m_ctx; }\\n\\n\\n\\n /**\\n\\n \\\\brief Auxiliary method used to check for API usage errors.\\n\\n */\\n\\n Z3_error_code check_error() const {\\n\\n Z3_error_code e = Z3_get_error_code(m_ctx);\\n\\n if (e != Z3_OK && enable_exceptions())\\n\\n Z3_THROW(exception(Z3_get_error_msg(m_ctx, e)));\\n\\n return e;\\n\\n }\\n\\n\\n\\n void check_parser_error() const {\\n\\n check_error();\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 39,\n \"score\": 61468.98666672524\n },\n {\n \"content\": \" friend std::ostream & operator<<(std::ostream & out, solver const & s);\\n\\n\\n\\n std::string to_smt2(char const* status = \\\"unknown\\\") {\\n\\n array<Z3_ast> es(assertions());\\n\\n Z3_ast const* fmls = es.ptr();\\n\\n Z3_ast fml = 0;\\n\\n unsigned sz = es.size();\\n\\n if (sz > 0) {\\n\\n --sz;\\n\\n fml = fmls[sz];\\n\\n }\\n\\n else {\\n\\n fml = ctx().bool_val(true);\\n\\n }\\n\\n return std::string(Z3_benchmark_to_smtlib_string(\\n\\n ctx(),\\n\\n \\\"\\\", \\\"\\\", status, \\\"\\\",\\n\\n sz,\\n\\n fmls,\\n\\n fml));\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 40,\n \"score\": 61468.9532931074\n },\n {\n \"content\": \" void push() {\\n\\n Z3_optimize_push(ctx(), m_opt);\\n\\n }\\n\\n void pop() {\\n\\n Z3_optimize_pop(ctx(), m_opt);\\n\\n }\\n\\n check_result check() { Z3_lbool r = Z3_optimize_check(ctx(), m_opt); check_error(); return to_check_result(r); }\\n\\n model get_model() const { Z3_model m = Z3_optimize_get_model(ctx(), m_opt); check_error(); return model(ctx(), m); }\\n\\n void set(params const & p) { Z3_optimize_set_params(ctx(), m_opt, p); check_error(); }\\n\\n expr lower(handle const& h) {\\n\\n Z3_ast r = Z3_optimize_get_lower(ctx(), m_opt, h.h());\\n\\n check_error();\\n\\n return expr(ctx(), r);\\n\\n }\\n\\n expr upper(handle const& h) {\\n\\n Z3_ast r = Z3_optimize_get_upper(ctx(), m_opt, h.h());\\n\\n check_error();\\n\\n return expr(ctx(), r);\\n\\n }\\n\\n expr_vector assertions() const { Z3_ast_vector r = Z3_optimize_get_assertions(ctx(), m_opt); check_error(); return expr_vector(ctx(), r); }\\n\\n expr_vector objectives() const { Z3_ast_vector r = Z3_optimize_get_objectives(ctx(), m_opt); check_error(); return expr_vector(ctx(), r); }\\n\\n stats statistics() const { Z3_stats r = Z3_optimize_get_statistics(ctx(), m_opt); check_error(); return stats(ctx(), r); }\\n\\n friend std::ostream & operator<<(std::ostream & out, optimize const & s);\\n\\n void from_file(char const* filename) { Z3_optimize_from_file(ctx(), m_opt, filename); check_error(); }\\n\\n void from_string(char const* constraints) { Z3_optimize_from_string(ctx(), m_opt, constraints); check_error(); }\\n\\n std::string help() const { char const * r = Z3_optimize_get_help(ctx(), m_opt); check_error(); return r; }\\n\\n };\\n\\n inline std::ostream & operator<<(std::ostream & out, optimize const & s) { out << Z3_optimize_to_string(s.ctx(), s.m_opt); return out; }\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 41,\n \"score\": 61468.82592978601\n },\n {\n \"content\": \" array<Z3_ast> _assumptions(n);\\n\\n for (unsigned i = 0; i < n; i++) {\\n\\n check_context(*this, assumptions[i]);\\n\\n _assumptions[i] = assumptions[i];\\n\\n }\\n\\n Z3_lbool r = Z3_solver_check_assumptions(ctx(), m_solver, n, _assumptions.ptr());\\n\\n check_error();\\n\\n return to_check_result(r);\\n\\n }\\n\\n model get_model() const { Z3_model m = Z3_solver_get_model(ctx(), m_solver); check_error(); return model(ctx(), m); }\\n\\n check_result consequences(expr_vector& assumptions, expr_vector& vars, expr_vector& conseq) {\\n\\n Z3_lbool r = Z3_solver_get_consequences(ctx(), m_solver, assumptions, vars, conseq);\\n\\n check_error();\\n\\n return to_check_result(r);\\n\\n }\\n\\n std::string reason_unknown() const { Z3_string r = Z3_solver_get_reason_unknown(ctx(), m_solver); check_error(); return r; }\\n\\n stats statistics() const { Z3_stats r = Z3_solver_get_statistics(ctx(), m_solver); check_error(); return stats(ctx(), r); }\\n\\n expr_vector unsat_core() const { Z3_ast_vector r = Z3_solver_get_unsat_core(ctx(), m_solver); check_error(); return expr_vector(ctx(), r); }\\n\\n expr_vector assertions() const { Z3_ast_vector r = Z3_solver_get_assertions(ctx(), m_solver); check_error(); return expr_vector(ctx(), r); }\\n\\n expr proof() const { Z3_ast r = Z3_solver_get_proof(ctx(), m_solver); check_error(); return expr(ctx(), r); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 42,\n \"score\": 61468.77398308263\n },\n {\n \"content\": \" /**\\n\\n \\\\brief Return true if this sort is a regular expression sort.\\n\\n */\\n\\n bool is_re() const { return sort_kind() == Z3_RE_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is a Finite domain sort.\\n\\n */\\n\\n bool is_finite_domain() const { return sort_kind() == Z3_FINITE_DOMAIN_SORT; }\\n\\n\\n\\n /**\\n\\n \\\\brief Return the size of this Bit-vector sort.\\n\\n\\n\\n \\\\pre is_bv()\\n\\n */\\n\\n unsigned bv_size() const { assert(is_bv()); unsigned r = Z3_get_bv_sort_size(ctx(), *this); check_error(); return r; }\\n\\n\\n\\n /**\\n\\n \\\\brief Return the domain of this Array sort.\\n\\n\\n\\n \\\\pre is_array()\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 43,\n \"score\": 61468.66113941707\n },\n {\n \"content\": \" void add(expr const& e) {\\n\\n assert(e.is_bool());\\n\\n Z3_optimize_assert(ctx(), m_opt, e);\\n\\n }\\n\\n handle add(expr const& e, unsigned weight) {\\n\\n assert(e.is_bool());\\n\\n std::stringstream strm;\\n\\n strm << weight;\\n\\n return handle(Z3_optimize_assert_soft(ctx(), m_opt, e, strm.str().c_str(), 0));\\n\\n }\\n\\n handle add(expr const& e, char const* weight) {\\n\\n assert(e.is_bool());\\n\\n return handle(Z3_optimize_assert_soft(ctx(), m_opt, e, weight, 0));\\n\\n }\\n\\n handle maximize(expr const& e) {\\n\\n return handle(Z3_optimize_maximize(ctx(), m_opt, e));\\n\\n }\\n\\n handle minimize(expr const& e) {\\n\\n return handle(Z3_optimize_minimize(ctx(), m_opt, e));\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 44,\n \"score\": 61468.071574780115\n },\n {\n \"content\": \" /**\\n\\n \\\\brief Return true if this sort is a Bit-vector sort.\\n\\n */\\n\\n bool is_bv() const { return sort_kind() == Z3_BV_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is a Array sort.\\n\\n */\\n\\n bool is_array() const { return sort_kind() == Z3_ARRAY_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is a Datatype sort.\\n\\n */\\n\\n bool is_datatype() const { return sort_kind() == Z3_DATATYPE_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is a Relation sort.\\n\\n */\\n\\n bool is_relation() const { return sort_kind() == Z3_RELATION_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is a Sequence sort.\\n\\n */\\n\\n bool is_seq() const { return sort_kind() == Z3_SEQ_SORT; }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 45,\n \"score\": 61468.047121064476\n },\n {\n \"content\": \" /**\\n\\n \\\\brief Return name of sort.\\n\\n */\\n\\n symbol name() const { Z3_symbol s = Z3_get_sort_name(ctx(), *this); check_error(); return symbol(ctx(), s); }\\n\\n /**\\n\\n \\\\brief Return true if this sort is the Boolean sort.\\n\\n */\\n\\n bool is_bool() const { return sort_kind() == Z3_BOOL_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is the Integer sort.\\n\\n */\\n\\n bool is_int() const { return sort_kind() == Z3_INT_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is the Real sort.\\n\\n */\\n\\n bool is_real() const { return sort_kind() == Z3_REAL_SORT; }\\n\\n /**\\n\\n \\\\brief Return true if this sort is the Integer or Real sort.\\n\\n */\\n\\n bool is_arith() const { return is_int() || is_real(); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 46,\n \"score\": 61467.766146593596\n },\n {\n \"content\": \"\\n\\n /**\\n\\n \\\\brief Return string representation of numeral or algebraic number\\n\\n This method assumes the expression is numeral or algebraic\\n\\n\\n\\n \\\\pre is_numeral() || is_algebraic()\\n\\n */\\n\\n std::string get_decimal_string(int precision) const {\\n\\n assert(is_numeral() || is_algebraic());\\n\\n return std::string(Z3_get_numeral_decimal_string(ctx(), m_ast, precision));\\n\\n }\\n\\n\\n\\n /**\\n\\n \\\\brief retrieve unique identifier for expression.\\n\\n */\\n\\n unsigned id() const { unsigned r = Z3_get_ast_id(ctx(), m_ast); check_error(); return r; }\\n\\n\\n\\n /**\\n\\n \\\\brief Return int value of numeral, throw if result cannot fit in\\n\\n machine int\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 47,\n \"score\": 61467.446002362354\n },\n {\n \"content\": \" }\\n\\n\\n\\n inline expr context::constant(symbol const & name, sort const & s) {\\n\\n Z3_ast r = Z3_mk_const(m_ctx, name, s);\\n\\n check_error();\\n\\n return expr(*this, r);\\n\\n }\\n\\n inline expr context::constant(char const * name, sort const & s) { return constant(str_symbol(name), s); }\\n\\n inline expr context::bool_const(char const * name) { return constant(name, bool_sort()); }\\n\\n inline expr context::int_const(char const * name) { return constant(name, int_sort()); }\\n\\n inline expr context::real_const(char const * name) { return constant(name, real_sort()); }\\n\\n inline expr context::bv_const(char const * name, unsigned sz) { return constant(name, bv_sort(sz)); }\\n\\n\\n\\n inline expr context::bool_val(bool b) { return b ? expr(*this, Z3_mk_true(m_ctx)) : expr(*this, Z3_mk_false(m_ctx)); }\\n\\n\\n\\n inline expr context::int_val(int n) { Z3_ast r = Z3_mk_int(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\\n\\n inline expr context::int_val(unsigned n) { Z3_ast r = Z3_mk_unsigned_int(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\\n\\n inline expr context::int_val(int64_t n) { Z3_ast r = Z3_mk_int64(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\\n\\n inline expr context::int_val(uint64_t n) { Z3_ast r = Z3_mk_unsigned_int64(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\\n\\n inline expr context::int_val(char const * n) { Z3_ast r = Z3_mk_numeral(m_ctx, n, int_sort()); check_error(); return expr(*this, r); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 48,\n \"score\": 61467.3715541529\n },\n {\n \"content\": \"\\n\\n /**\\n\\n \\\\brief The C++ API uses by defaults exceptions on errors. \\n\\n For applications that don't work well with exceptions (there should be only few)\\n\\n you have the ability to turn off exceptions. The tradeoffs are that applications\\n\\n have to very careful about using check_error() after calls that may result in an\\n\\n erroneous state.\\n\\n */\\n\\n void set_enable_exceptions(bool f) { m_enable_exceptions = f; }\\n\\n\\n\\n bool enable_exceptions() const { return m_enable_exceptions; }\\n\\n\\n\\n /**\\n\\n \\\\brief Update global parameter \\\\c param with string \\\\c value.\\n\\n */\\n\\n void set(char const * param, char const * value) { Z3_update_param_value(m_ctx, param, value); }\\n\\n /**\\n\\n \\\\brief Update global parameter \\\\c param with Boolean \\\\c value.\\n\\n */\\n\\n void set(char const * param, bool value) { Z3_update_param_value(m_ctx, param, value ? \\\"true\\\" : \\\"false\\\"); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 49,\n \"score\": 61467.24230576754\n },\n {\n \"content\": \" // fails for some compilers: \\n\\n // void add(expr_vector const& v) { check_context(*this, v); for (expr e : v) add(e); }\\n\\n unsigned size() const { return Z3_goal_size(ctx(), m_goal); }\\n\\n expr operator[](int i) const { assert(0 <= i); Z3_ast r = Z3_goal_formula(ctx(), m_goal, i); check_error(); return expr(ctx(), r); }\\n\\n Z3_goal_prec precision() const { return Z3_goal_precision(ctx(), m_goal); }\\n\\n bool inconsistent() const { return Z3_goal_inconsistent(ctx(), m_goal) != 0; }\\n\\n unsigned depth() const { return Z3_goal_depth(ctx(), m_goal); }\\n\\n void reset() { Z3_goal_reset(ctx(), m_goal); }\\n\\n unsigned num_exprs() const { return Z3_goal_num_exprs(ctx(), m_goal); }\\n\\n bool is_decided_sat() const { return Z3_goal_is_decided_sat(ctx(), m_goal) != 0; }\\n\\n bool is_decided_unsat() const { return Z3_goal_is_decided_unsat(ctx(), m_goal) != 0; }\\n\\n expr as_expr() const {\\n\\n unsigned n = size();\\n\\n if (n == 0)\\n\\n return ctx().bool_val(true);\\n\\n else if (n == 1)\\n\\n return operator[](0);\\n\\n else {\\n\\n array<Z3_ast> args(n);\\n\\n for (unsigned i = 0; i < n; i++)\\n\\n args[i] = operator[](i);\\n\\n return expr(ctx(), Z3_mk_and(ctx(), n, args.ptr()));\\n\\n }\\n\\n }\\n\\n friend std::ostream & operator<<(std::ostream & out, goal const & g);\\n\\n };\\n\\n inline std::ostream & operator<<(std::ostream & out, goal const & g) { out << Z3_goal_to_string(g.ctx(), g); return out; }\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 50,\n \"score\": 61467.1534486413\n },\n {\n \"content\": \" expr string_val(std::string const& s);\\n\\n\\n\\n expr num_val(int n, sort const & s);\\n\\n\\n\\n /**\\n\\n \\\\brief parsing\\n\\n */\\n\\n expr parse_string(char const* s);\\n\\n expr parse_file(char const* file);\\n\\n\\n\\n expr parse_string(char const* s, sort_vector const& sorts, func_decl_vector const& decls);\\n\\n expr parse_file(char const* s, sort_vector const& sorts, func_decl_vector const& decls);\\n\\n\\n\\n /**\\n\\n \\\\brief Interpolation support\\n\\n */\\n\\n check_result compute_interpolant(expr const& pat, params const& p, expr_vector& interp, model& m);\\n\\n expr_vector get_interpolant(expr const& proof, expr const& pat, params const& p);\\n\\n\\n\\n };\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n template<typename T>\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 51,\n \"score\": 61466.90554983995\n },\n {\n \"content\": \" std::ostringstream oss;\\n\\n oss << value;\\n\\n Z3_set_param_value(m_cfg, param, oss.str().c_str());\\n\\n }\\n\\n };\\n\\n\\n\\n enum check_result {\\n\\n unsat, sat, unknown\\n\\n };\\n\\n\\n\\n inline check_result to_check_result(Z3_lbool l) {\\n\\n if (l == Z3_L_TRUE) return sat;\\n\\n else if (l == Z3_L_FALSE) return unsat;\\n\\n return unknown;\\n\\n }\\n\\n\\n\\n\\n\\n /**\\n\\n \\\\brief A Context manages all other Z3 objects, global configuration options, etc.\\n\\n */\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 52,\n \"score\": 61465.9796194958\n },\n {\n \"content\": \" /**\\n\\n \\\\brief Update global parameter \\\\c param with Integer \\\\c value.\\n\\n */\\n\\n void set(char const * param, int value) {\\n\\n std::ostringstream oss;\\n\\n oss << value;\\n\\n Z3_update_param_value(m_ctx, param, oss.str().c_str());\\n\\n }\\n\\n\\n\\n /**\\n\\n \\\\brief Interrupt the current procedure being executed by any object managed by this context.\\n\\n This is a soft interruption: there is no guarantee the object will actually stop.\\n\\n */\\n\\n void interrupt() { Z3_interrupt(m_ctx); }\\n\\n\\n\\n /**\\n\\n \\\\brief Create a Z3 symbol based on the given string.\\n\\n */\\n\\n symbol str_symbol(char const * s);\\n\\n /**\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 53,\n \"score\": 61465.72977538604\n },\n {\n \"content\": \" }\\n\\n\\n\\n\\n\\n expr denominator() const { \\n\\n assert(is_numeral());\\n\\n Z3_ast r = Z3_get_denominator(ctx(), m_ast);\\n\\n check_error();\\n\\n return expr(ctx(),r);\\n\\n }\\n\\n\\n\\n operator Z3_app() const { assert(is_app()); return reinterpret_cast<Z3_app>(m_ast); }\\n\\n\\n\\n /**\\n\\n \\\\brief Return the declaration associated with this application.\\n\\n This method assumes the expression is an application.\\n\\n\\n\\n \\\\pre is_app()\\n\\n */\\n\\n func_decl decl() const { Z3_func_decl f = Z3_get_app_decl(ctx(), *this); check_error(); return func_decl(ctx(), f); }\\n\\n /**\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 54,\n \"score\": 61465.606583020206\n },\n {\n \"content\": \" }\\n\\n\\n\\n expr eval(expr const & n, bool model_completion=false) const {\\n\\n check_context(*this, n);\\n\\n Z3_ast r = 0;\\n\\n Z3_bool status = Z3_model_eval(ctx(), m_model, n, model_completion, &r);\\n\\n check_error();\\n\\n if (status == Z3_FALSE && ctx().enable_exceptions())\\n\\n Z3_THROW(exception(\\\"failed to evaluate expression\\\"));\\n\\n return expr(ctx(), r);\\n\\n }\\n\\n\\n\\n unsigned num_consts() const { return Z3_model_get_num_consts(ctx(), m_model); }\\n\\n unsigned num_funcs() const { return Z3_model_get_num_funcs(ctx(), m_model); }\\n\\n func_decl get_const_decl(unsigned i) const { Z3_func_decl r = Z3_model_get_const_decl(ctx(), m_model, i); check_error(); return func_decl(ctx(), r); }\\n\\n func_decl get_func_decl(unsigned i) const { Z3_func_decl r = Z3_model_get_func_decl(ctx(), m_model, i); check_error(); return func_decl(ctx(), r); }\\n\\n unsigned size() const { return num_consts() + num_funcs(); }\\n\\n func_decl operator[](int i) const {\\n\\n assert(0 <= i);\\n\\n return static_cast<unsigned>(i) < num_consts() ? get_const_decl(i) : get_func_decl(i - num_consts());\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 55,\n \"score\": 61465.53892063701\n },\n {\n \"content\": \" /**\\n\\n \\\\brief Return true if this is a real expression.\\n\\n */\\n\\n bool is_real() const { return get_sort().is_real(); }\\n\\n /**\\n\\n \\\\brief Return true if this is an integer or real expression.\\n\\n */\\n\\n bool is_arith() const { return get_sort().is_arith(); }\\n\\n /**\\n\\n \\\\brief Return true if this is a Bit-vector expression.\\n\\n */\\n\\n bool is_bv() const { return get_sort().is_bv(); }\\n\\n /**\\n\\n \\\\brief Return true if this is a Array expression.\\n\\n */\\n\\n bool is_array() const { return get_sort().is_array(); }\\n\\n /**\\n\\n \\\\brief Return true if this is a Datatype expression.\\n\\n */\\n\\n bool is_datatype() const { return get_sort().is_datatype(); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 56,\n \"score\": 61465.32635879207\n },\n {\n \"content\": \" expr body() const { assert(is_quantifier()); Z3_ast r = Z3_get_quantifier_body(ctx(), *this); check_error(); return expr(ctx(), r); }\\n\\n\\n\\n /**\\n\\n \\\\brief Return an expression representing <tt>not(a)</tt>.\\n\\n\\n\\n \\\\pre a.is_bool()\\n\\n */\\n\\n friend expr operator!(expr const & a);\\n\\n\\n\\n\\n\\n /**\\n\\n \\\\brief Return an expression representing <tt>a and b</tt>.\\n\\n\\n\\n \\\\pre a.is_bool()\\n\\n \\\\pre b.is_bool()\\n\\n */\\n\\n friend expr operator&&(expr const & a, expr const & b);\\n\\n\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 57,\n \"score\": 61465.22469356369\n },\n {\n \"content\": \" */\\n\\n sort array_domain() const { assert(is_array()); Z3_sort s = Z3_get_array_sort_domain(ctx(), *this); check_error(); return sort(ctx(), s); }\\n\\n /**\\n\\n \\\\brief Return the range of this Array sort.\\n\\n\\n\\n \\\\pre is_array()\\n\\n */\\n\\n sort array_range() const { assert(is_array()); Z3_sort s = Z3_get_array_sort_range(ctx(), *this); check_error(); return sort(ctx(), s); }\\n\\n };\\n\\n\\n\\n /**\\n\\n \\\\brief Function declaration (aka function definition). It is the signature of interpreted and uninterpreted functions in Z3.\\n\\n The basic building block in Z3 is the function application.\\n\\n */\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 58,\n \"score\": 61465.21888538067\n },\n {\n \"content\": \" MK_EXPR1(Z3_mk_re_complement, a);\\n\\n }\\n\\n inline expr range(expr const& lo, expr const& hi) {\\n\\n check_context(lo, hi); \\n\\n Z3_ast r = Z3_mk_re_range(lo.ctx(), lo, hi); \\n\\n lo.check_error(); \\n\\n return expr(lo.ctx(), r); \\n\\n }\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n inline expr interpolant(expr const& a) {\\n\\n return expr(a.ctx(), Z3_mk_interpolant(a.ctx(), a));\\n\\n }\\n\\n\\n\\n inline expr context::parse_string(char const* s) {\\n\\n Z3_ast r = Z3_parse_smtlib2_string(*this, s, 0, 0, 0, 0, 0, 0);\\n\\n check_parser_error();\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 59,\n \"score\": 61465.20904135312\n },\n {\n \"content\": \" return expr(*this, r); \\n\\n }\\n\\n inline expr context::parse_file(char const* s) {\\n\\n Z3_ast r = Z3_parse_smtlib2_file(*this, s, 0, 0, 0, 0, 0, 0);\\n\\n check_parser_error();\\n\\n return expr(*this, r);\\n\\n }\\n\\n\\n\\n inline expr context::parse_string(char const* s, sort_vector const& sorts, func_decl_vector const& decls) {\\n\\n array<Z3_symbol> sort_names(sorts.size());\\n\\n array<Z3_symbol> decl_names(decls.size());\\n\\n array<Z3_sort> sorts1(sorts);\\n\\n array<Z3_func_decl> decls1(decls);\\n\\n for (unsigned i = 0; i < sorts.size(); ++i) {\\n\\n sort_names[i] = sorts[i].name();\\n\\n }\\n\\n for (unsigned i = 0; i < decls.size(); ++i) {\\n\\n decl_names[i] = decls[i].name();\\n\\n }\\n\\n Z3_ast r = Z3_parse_smtlib2_string(*this, s, sorts.size(), sort_names.ptr(), sorts1.ptr(), decls.size(), decl_names.ptr(), decls1.ptr());\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 60,\n \"score\": 61465.19450908718\n },\n {\n \"content\": \" }\\n\\n\\n\\n // returns interpretation of constant declaration c.\\n\\n // If c is not assigned any value in the model it returns \\n\\n // an expression with a null ast reference.\\n\\n expr get_const_interp(func_decl c) const {\\n\\n check_context(*this, c);\\n\\n Z3_ast r = Z3_model_get_const_interp(ctx(), m_model, c);\\n\\n check_error();\\n\\n return expr(ctx(), r);\\n\\n }\\n\\n func_interp get_func_interp(func_decl f) const {\\n\\n check_context(*this, f);\\n\\n Z3_func_interp r = Z3_model_get_func_interp(ctx(), m_model, f);\\n\\n check_error();\\n\\n return func_interp(ctx(), r);\\n\\n }\\n\\n\\n\\n // returns true iff the model contains an interpretation\\n\\n // for function f.\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 61,\n \"score\": 61465.12248382336\n },\n {\n \"content\": \"*/\\n\\n bool is_finite_domain() const { return get_sort().is_finite_domain(); }\\n\\n\\n\\n /**\\n\\n \\\\brief Return true if this expression is a numeral.\\n\\n Specialized functions also return representations for the numerals as\\n\\n small integers, 64 bit integers or rational or decimal strings.\\n\\n */\\n\\n bool is_numeral() const { return kind() == Z3_NUMERAL_AST; }\\n\\n bool is_numeral_i64(int64_t& i) const { bool r = 0 != Z3_get_numeral_int64(ctx(), m_ast, &i); check_error(); return r;}\\n\\n bool is_numeral_u64(uint64_t& i) const { bool r = 0 != Z3_get_numeral_uint64(ctx(), m_ast, &i); check_error(); return r;}\\n\\n bool is_numeral_i(int& i) const { bool r = 0 != Z3_get_numeral_int(ctx(), m_ast, &i); check_error(); return r;}\\n\\n bool is_numeral_u(unsigned& i) const { bool r = 0 != Z3_get_numeral_uint(ctx(), m_ast, &i); check_error(); return r;}\\n\\n bool is_numeral(std::string& s) const { if (!is_numeral()) return false; s = Z3_get_numeral_string(ctx(), m_ast); check_error(); return true; }\\n\\n bool is_numeral(std::string& s, unsigned precision) const { if (!is_numeral()) return false; s = Z3_get_numeral_decimal_string(ctx(), m_ast, precision); check_error(); return true; }\\n\\n /**\\n\\n \\\\brief Return true if this expression is an application.\\n\\n */\\n\\n bool is_app() const { return kind() == Z3_APP_AST || kind() == Z3_NUMERAL_AST; }\\n\\n /**\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 62,\n \"score\": 61465.122764149084\n },\n {\n \"content\": \" /**\\n\\n \\\\brief Return true if this is a Relation expression.\\n\\n */\\n\\n bool is_relation() const { return get_sort().is_relation(); }\\n\\n /**\\n\\n \\\\brief Return true if this is a sequence expression.\\n\\n */\\n\\n bool is_seq() const { return get_sort().is_seq(); }\\n\\n /**\\n\\n \\\\brief Return true if this is a regular expression.\\n\\n */\\n\\n bool is_re() const { return get_sort().is_re(); }\\n\\n\\n\\n /**\\n\\n \\\\brief Return true if this is a Finite-domain expression.\\n\\n\\n\\n \\\\remark Finite-domain is special kind of interpreted sort:\\n\\n is_bool(), is_bv() and is_finite_domain() are mutually\\n\\n exclusive.\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 63,\n \"score\": 61464.975090601045\n },\n {\n \"content\": \" bool has_interp(func_decl f) const {\\n\\n check_context(*this, f);\\n\\n return 0 != Z3_model_has_interp(ctx(), m_model, f);\\n\\n }\\n\\n\\n\\n func_interp add_func_interp(func_decl& f, expr& else_val) {\\n\\n Z3_func_interp r = Z3_add_func_interp(ctx(), m_model, f, else_val);\\n\\n check_error();\\n\\n return func_interp(ctx(), r);\\n\\n }\\n\\n\\n\\n void add_const_interp(func_decl& f, expr& value) {\\n\\n Z3_add_const_interp(ctx(), m_model, f, value);\\n\\n check_error();\\n\\n }\\n\\n\\n\\n friend std::ostream & operator<<(std::ostream & out, model const & m);\\n\\n };\\n\\n inline std::ostream & operator<<(std::ostream & out, model const & m) { out << Z3_model_to_string(m.ctx(), m); return out; }\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 64,\n \"score\": 61464.858954082054\n },\n {\n \"content\": \"\\n\\n \\\\pre is_numeral()\\n\\n */\\n\\n int64_t get_numeral_int64() const {\\n\\n assert(is_numeral());\\n\\n int64_t result = 0;\\n\\n if (!is_numeral_i64(result)) {\\n\\n assert(ctx().enable_exceptions());\\n\\n if (!ctx().enable_exceptions()) return 0;\\n\\n Z3_THROW(exception(\\\"numeral does not fit in machine int64_t\\\"));\\n\\n }\\n\\n return result;\\n\\n }\\n\\n\\n\\n /**\\n\\n \\\\brief Return \\\\c uint64_t value of numeral, throw if result cannot fit in\\n\\n \\\\c uint64_t.\\n\\n\\n\\n \\\\pre is_numeral()\\n\\n */\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 65,\n \"score\": 61464.818781269845\n },\n {\n \"content\": \"#ifndef Z3PP_H_\\n\\n#define Z3PP_H_\\n\\n\\n\\n#include<cassert>\\n\\n#include<iostream>\\n\\n#include<string>\\n\\n#include<sstream>\\n\\n#include<z3.h>\\n\\n#include<limits.h>\\n\\n\\n\\n/**\\n\\n \\\\defgroup cppapi C++ API\\n\\n\\n\\n*/\\n\\n/*@{*/\\n\\n\\n\\n/**\\n\\n @name C++ API classes and functions\\n\\n */\\n\\n/*@{*/\\n\\n\\n\\n/**\\n\\n \\\\brief Z3 C++ namespace\\n\\n */\\n\\nnamespace z3 {\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 66,\n \"score\": 61464.77225686511\n },\n {\n \"content\": \" unsigned get_num_levels(func_decl& p) { unsigned r = Z3_fixedpoint_get_num_levels(ctx(), m_fp, p); check_error(); return r; }\\n\\n expr get_cover_delta(int level, func_decl& p) { \\n\\n Z3_ast r = Z3_fixedpoint_get_cover_delta(ctx(), m_fp, level, p); \\n\\n check_error(); \\n\\n return expr(ctx(), r);\\n\\n }\\n\\n void add_cover(int level, func_decl& p, expr& property) { Z3_fixedpoint_add_cover(ctx(), m_fp, level, p, property); check_error(); }\\n\\n stats statistics() const { Z3_stats r = Z3_fixedpoint_get_statistics(ctx(), m_fp); check_error(); return stats(ctx(), r); }\\n\\n void register_relation(func_decl& p) { Z3_fixedpoint_register_relation(ctx(), m_fp, p); }\\n\\n expr_vector assertions() const { Z3_ast_vector r = Z3_fixedpoint_get_assertions(ctx(), m_fp); check_error(); return expr_vector(ctx(), r); }\\n\\n expr_vector rules() const { Z3_ast_vector r = Z3_fixedpoint_get_rules(ctx(), m_fp); check_error(); return expr_vector(ctx(), r); }\\n\\n void set(params const & p) { Z3_fixedpoint_set_params(ctx(), m_fp, p); check_error(); }\\n\\n std::string help() const { return Z3_fixedpoint_get_help(ctx(), m_fp); }\\n\\n param_descrs get_param_descrs() { return param_descrs(ctx(), Z3_fixedpoint_get_param_descrs(ctx(), m_fp)); }\\n\\n std::string to_string() { return Z3_fixedpoint_to_string(ctx(), m_fp, 0, 0); }\\n\\n std::string to_string(expr_vector const& queries) {\\n\\n array<Z3_ast> qs(queries);\\n\\n return Z3_fixedpoint_to_string(ctx(), m_fp, qs.size(), qs.ptr()); \\n\\n }\\n\\n void push() { Z3_fixedpoint_push(ctx(), m_fp); check_error(); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 67,\n \"score\": 61464.40979332115\n },\n {\n \"content\": \" check_parser_error();\\n\\n return expr(*this, r);\\n\\n }\\n\\n\\n\\n inline expr context::parse_file(char const* s, sort_vector const& sorts, func_decl_vector const& decls) {\\n\\n array<Z3_symbol> sort_names(sorts.size());\\n\\n array<Z3_symbol> decl_names(decls.size());\\n\\n array<Z3_sort> sorts1(sorts);\\n\\n array<Z3_func_decl> decls1(decls);\\n\\n for (unsigned i = 0; i < sorts.size(); ++i) {\\n\\n sort_names[i] = sorts[i].name();\\n\\n }\\n\\n for (unsigned i = 0; i < decls.size(); ++i) {\\n\\n decl_names[i] = decls[i].name();\\n\\n }\\n\\n Z3_ast r = Z3_parse_smtlib2_file(*this, s, sorts.size(), sort_names.ptr(), sorts1.ptr(), decls.size(), decl_names.ptr(), decls1.ptr());\\n\\n check_parser_error();\\n\\n return expr(*this, r);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 68,\n \"score\": 61464.378222321175\n },\n {\n \"content\": \" Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr exists(expr const & x1, expr const & x2, expr const & x3, expr const & x4, expr const & b) {\\n\\n check_context(x1, b); check_context(x2, b); check_context(x3, b); check_context(x4, b);\\n\\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };\\n\\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr exists(expr_vector const & xs, expr const & b) {\\n\\n array<Z3_app> vars(xs);\\n\\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, vars.size(), vars.ptr(), 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr pble(expr_vector const& es, int const* coeffs, int bound) {\\n\\n assert(es.size() > 0);\\n\\n context& ctx = es[0].ctx();\\n\\n array<Z3_ast> _es(es);\\n\\n Z3_ast r = Z3_mk_pble(ctx, _es.size(), _es.ptr(), coeffs, bound);\\n\\n ctx.check_error();\\n\\n return expr(ctx, r);\\n\\n }\\n\\n inline expr pbge(expr_vector const& es, int const* coeffs, int bound) {\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 69,\n \"score\": 61464.14882802797\n },\n {\n \"content\": \" func_decl function(symbol const & name, unsigned arity, sort const * domain, sort const & range);\\n\\n func_decl function(char const * name, unsigned arity, sort const * domain, sort const & range);\\n\\n func_decl function(symbol const& name, sort_vector const& domain, sort const& range);\\n\\n func_decl function(char const * name, sort_vector const& domain, sort const& range);\\n\\n func_decl function(char const * name, sort const & domain, sort const & range);\\n\\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & range);\\n\\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & range);\\n\\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & d4, sort const & range);\\n\\n func_decl function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & d4, sort const & d5, sort const & range);\\n\\n\\n\\n expr constant(symbol const & name, sort const & s);\\n\\n expr constant(char const * name, sort const & s);\\n\\n expr bool_const(char const * name);\\n\\n expr int_const(char const * name);\\n\\n expr real_const(char const * name);\\n\\n expr bv_const(char const * name, unsigned sz);\\n\\n\\n\\n expr bool_val(bool b);\\n\\n\\n\\n expr int_val(int n);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 70,\n \"score\": 61464.12630330869\n },\n {\n \"content\": \"\\n\\n It only makes sense to use this function if the caller can ensure that\\n\\n the result is an integer or if exceptions are enabled. \\n\\n If exceptions are disabled, then use the is_numeral_u function.\\n\\n \\\\pre is_numeral()\\n\\n */\\n\\n unsigned get_numeral_uint() const {\\n\\n assert(is_numeral());\\n\\n unsigned result = 0;\\n\\n if (!is_numeral_u(result)) {\\n\\n assert(ctx().enable_exceptions());\\n\\n if (!ctx().enable_exceptions()) return 0;\\n\\n Z3_THROW(exception(\\\"numeral does not fit in machine uint\\\"));\\n\\n }\\n\\n return result;\\n\\n }\\n\\n\\n\\n /**\\n\\n \\\\brief Return \\\\c int64_t value of numeral, throw if result cannot fit in\\n\\n \\\\c int64_t.\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 71,\n \"score\": 61464.04694379885\n },\n {\n \"content\": \" uint64_t get_numeral_uint64() const {\\n\\n assert(is_numeral());\\n\\n uint64_t result = 0;\\n\\n if (!is_numeral_u64(result)) {\\n\\n assert(ctx().enable_exceptions());\\n\\n if (!ctx().enable_exceptions()) return 0;\\n\\n Z3_THROW(exception(\\\"numeral does not fit in machine uint64_t\\\"));\\n\\n }\\n\\n return result;\\n\\n }\\n\\n\\n\\n Z3_lbool bool_value() const {\\n\\n return Z3_get_bool_value(ctx(), m_ast);\\n\\n }\\n\\n\\n\\n expr numerator() const { \\n\\n assert(is_numeral());\\n\\n Z3_ast r = Z3_get_numerator(ctx(), m_ast);\\n\\n check_error();\\n\\n return expr(ctx(),r);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 72,\n \"score\": 61463.55772834858\n },\n {\n \"content\": \" Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };\\n\\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr forall(expr_vector const & xs, expr const & b) {\\n\\n array<Z3_app> vars(xs);\\n\\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, vars.size(), vars.ptr(), 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr exists(expr const & x, expr const & b) {\\n\\n check_context(x, b);\\n\\n Z3_app vars[] = {(Z3_app) x};\\n\\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr exists(expr const & x1, expr const & x2, expr const & b) {\\n\\n check_context(x1, b); check_context(x2, b);\\n\\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};\\n\\n Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr exists(expr const & x1, expr const & x2, expr const & x3, expr const & b) {\\n\\n check_context(x1, b); check_context(x2, b); check_context(x3, b);\\n\\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 73,\n \"score\": 61463.449800862574\n },\n {\n \"content\": \"\\n\\n template<> class cast_ast<expr> {\\n\\n public:\\n\\n expr operator()(context & c, Z3_ast a) {\\n\\n assert(Z3_get_ast_kind(c, a) == Z3_NUMERAL_AST ||\\n\\n Z3_get_ast_kind(c, a) == Z3_APP_AST ||\\n\\n Z3_get_ast_kind(c, a) == Z3_QUANTIFIER_AST ||\\n\\n Z3_get_ast_kind(c, a) == Z3_VAR_AST);\\n\\n return expr(c, a);\\n\\n }\\n\\n };\\n\\n\\n\\n template<> class cast_ast<sort> {\\n\\n public:\\n\\n sort operator()(context & c, Z3_ast a) {\\n\\n assert(Z3_get_ast_kind(c, a) == Z3_SORT_AST);\\n\\n return sort(c, reinterpret_cast<Z3_sort>(a));\\n\\n }\\n\\n };\\n\\n\\n\\n template<> class cast_ast<func_decl> {\\n\\n public:\\n\\n func_decl operator()(context & c, Z3_ast a) {\\n\\n assert(Z3_get_ast_kind(c, a) == Z3_FUNC_DECL_AST);\\n\\n return func_decl(c, reinterpret_cast<Z3_func_decl>(a));\\n\\n }\\n\\n };\\n\\n\\n\\n template<typename T>\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 74,\n \"score\": 61463.427882032345\n },\n {\n \"content\": \"\\n\\n It only makes sense to use this function if the caller can ensure that\\n\\n the result is an integer or if exceptions are enabled. \\n\\n If exceptions are disabled, then use the is_numeral_i function.\\n\\n\\n\\n \\\\pre is_numeral()\\n\\n */\\n\\n int get_numeral_int() const { \\n\\n int result = 0;\\n\\n if (!is_numeral_i(result)) {\\n\\n assert(ctx().enable_exceptions());\\n\\n if (!ctx().enable_exceptions()) return 0;\\n\\n Z3_THROW(exception(\\\"numeral does not fit in machine int\\\"));\\n\\n }\\n\\n return result;\\n\\n }\\n\\n\\n\\n /**\\n\\n \\\\brief Return uint value of numeral, throw if result cannot fit in\\n\\n machine uint\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 75,\n \"score\": 61463.18478594463\n },\n {\n \"content\": \" \\\\brief Return the number of arguments in this application.\\n\\n This method assumes the expression is an application.\\n\\n\\n\\n \\\\pre is_app()\\n\\n */\\n\\n unsigned num_args() const { unsigned r = Z3_get_app_num_args(ctx(), *this); check_error(); return r; }\\n\\n /**\\n\\n \\\\brief Return the i-th argument of this application.\\n\\n This method assumes the expression is an application.\\n\\n\\n\\n \\\\pre is_app()\\n\\n \\\\pre i < num_args()\\n\\n */\\n\\n expr arg(unsigned i) const { Z3_ast r = Z3_get_app_arg(ctx(), *this, i); check_error(); return expr(ctx(), r); }\\n\\n\\n\\n /**\\n\\n \\\\brief Return the 'body' of this quantifier.\\n\\n\\n\\n \\\\pre is_quantifier()\\n\\n */\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 76,\n \"score\": 61463.132011260794\n },\n {\n \"content\": \" \\\\brief Return an enumeration sort: enum_names[0], ..., enum_names[n-1].\\n\\n \\\\c cs and \\\\c ts are output parameters. The method stores in \\\\c cs the constants corresponding to the enumerated elements,\\n\\n and in \\\\c ts the predicates for testing if terms of the enumeration sort correspond to an enumeration.\\n\\n */\\n\\n sort enumeration_sort(char const * name, unsigned n, char const * const * enum_names, func_decl_vector & cs, func_decl_vector & ts);\\n\\n\\n\\n /**\\n\\n \\\\brief Return a tuple constructor.\\n\\n \\\\c name is the name of the returned constructor,\\n\\n \\\\c n are the number of arguments, \\\\c names and \\\\c sorts are their projected sorts.\\n\\n \\\\c projs is an output paramter. It contains the set of projection functions.\\n\\n */\\n\\n func_decl tuple_sort(char const * name, unsigned n, char const * const * names, sort const* sorts, func_decl_vector & projs);\\n\\n\\n\\n /**\\n\\n \\\\brief create an uninterpreted sort with the name given by the string or symbol.\\n\\n */\\n\\n sort uninterpreted_sort(char const* name);\\n\\n sort uninterpreted_sort(symbol const& name);\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 77,\n \"score\": 61463.13054498789\n },\n {\n \"content\": \" inline expr operator==(expr const & a, int b) { assert(a.is_arith() || a.is_bv()); return a == a.ctx().num_val(b, a.get_sort()); }\\n\\n inline expr operator==(int a, expr const & b) { assert(b.is_arith() || b.is_bv()); return b.ctx().num_val(a, b.get_sort()) == b; }\\n\\n\\n\\n inline expr operator!=(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\\n Z3_ast args[2] = { a, b };\\n\\n Z3_ast r = Z3_mk_distinct(a.ctx(), 2, args);\\n\\n a.check_error();\\n\\n return expr(a.ctx(), r);\\n\\n }\\n\\n inline expr operator!=(expr const & a, int b) { assert(a.is_arith() || a.is_bv()); return a != a.ctx().num_val(b, a.get_sort()); }\\n\\n inline expr operator!=(int a, expr const & b) { assert(b.is_arith() || b.is_bv()); return b.ctx().num_val(a, b.get_sort()) != b; }\\n\\n\\n\\n inline expr operator+(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\\n Z3_ast r = 0;\\n\\n if (a.is_arith() && b.is_arith()) {\\n\\n Z3_ast args[2] = { a, b };\\n\\n r = Z3_mk_add(a.ctx(), 2, args);\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 78,\n \"score\": 61463.088772714946\n },\n {\n \"content\": \" check_context(c, t); check_context(c, e);\\n\\n assert(c.is_bool());\\n\\n Z3_ast r = Z3_mk_ite(c.ctx(), c, t, e);\\n\\n c.check_error();\\n\\n return expr(c.ctx(), r);\\n\\n }\\n\\n\\n\\n\\n\\n /**\\n\\n \\\\brief Wraps a Z3_ast as an expr object. It also checks for errors.\\n\\n This function allows the user to use the whole C API with the C++ layer defined in this file.\\n\\n */\\n\\n inline expr to_expr(context & c, Z3_ast a) {\\n\\n c.check_error();\\n\\n assert(Z3_get_ast_kind(c, a) == Z3_APP_AST ||\\n\\n Z3_get_ast_kind(c, a) == Z3_NUMERAL_AST ||\\n\\n Z3_get_ast_kind(c, a) == Z3_VAR_AST ||\\n\\n Z3_get_ast_kind(c, a) == Z3_QUANTIFIER_AST);\\n\\n return expr(c, a);\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 79,\n \"score\": 61463.01618615996\n },\n {\n \"content\": \" return expr(a.ctx(), r); \\\\\\n\\n\\n\\n\\n\\n inline expr operator!(expr const & a) { assert(a.is_bool()); _Z3_MK_UN_(a, Z3_mk_not); }\\n\\n\\n\\n inline expr is_int(expr const& e) { _Z3_MK_UN_(e, Z3_mk_is_int); }\\n\\n\\n\\n#undef _Z3_MK_UN_\\n\\n\\n\\n inline expr operator&&(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\\n assert(a.is_bool() && b.is_bool());\\n\\n Z3_ast args[2] = { a, b };\\n\\n Z3_ast r = Z3_mk_and(a.ctx(), 2, args);\\n\\n a.check_error();\\n\\n return expr(a.ctx(), r);\\n\\n }\\n\\n\\n\\n inline expr operator&&(expr const & a, bool b) { return a && a.ctx().bool_val(b); }\\n\\n inline expr operator&&(bool a, expr const & b) { return b.ctx().bool_val(a) && b; }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 80,\n \"score\": 61462.95626711087\n },\n {\n \"content\": \" func_entry entry(unsigned i) const { Z3_func_entry e = Z3_func_interp_get_entry(ctx(), m_interp, i); check_error(); return func_entry(ctx(), e); }\\n\\n void add_entry(expr_vector const& args, expr& value) {\\n\\n Z3_func_interp_add_entry(ctx(), m_interp, args, value);\\n\\n check_error();\\n\\n }\\n\\n void set_else(expr& value) {\\n\\n Z3_func_interp_set_else(ctx(), m_interp, value);\\n\\n check_error();\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 81,\n \"score\": 61462.942778700555\n },\n {\n \"content\": \" \\\\brief Return an expression representing <tt>a and b</tt>.\\n\\n The C++ Boolean value \\\\c b is automatically converted into a Z3 Boolean constant.\\n\\n\\n\\n \\\\pre a.is_bool()\\n\\n */\\n\\n friend expr operator&&(expr const & a, bool b);\\n\\n /**\\n\\n \\\\brief Return an expression representing <tt>a and b</tt>.\\n\\n The C++ Boolean value \\\\c a is automatically converted into a Z3 Boolean constant.\\n\\n\\n\\n \\\\pre b.is_bool()\\n\\n */\\n\\n friend expr operator&&(bool a, expr const & b);\\n\\n\\n\\n /**\\n\\n \\\\brief Return an expression representing <tt>a or b</tt>.\\n\\n\\n\\n \\\\pre a.is_bool()\\n\\n \\\\pre b.is_bool()\\n\\n */\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 82,\n \"score\": 61462.900646711496\n },\n {\n \"content\": \" assert(es.size() > 0);\\n\\n context& ctx = es[0].ctx();\\n\\n array<Z3_ast> _es(es);\\n\\n Z3_ast r = Z3_mk_pbge(ctx, _es.size(), _es.ptr(), coeffs, bound);\\n\\n ctx.check_error();\\n\\n return expr(ctx, r);\\n\\n }\\n\\n inline expr pbeq(expr_vector const& es, int const* coeffs, int bound) {\\n\\n assert(es.size() > 0);\\n\\n context& ctx = es[0].ctx();\\n\\n array<Z3_ast> _es(es);\\n\\n Z3_ast r = Z3_mk_pbeq(ctx, _es.size(), _es.ptr(), coeffs, bound);\\n\\n ctx.check_error();\\n\\n return expr(ctx, r);\\n\\n }\\n\\n inline expr atmost(expr_vector const& es, unsigned bound) {\\n\\n assert(es.size() > 0);\\n\\n context& ctx = es[0].ctx();\\n\\n array<Z3_ast> _es(es);\\n\\n Z3_ast r = Z3_mk_atmost(ctx, _es.size(), _es.ptr(), bound);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 83,\n \"score\": 61462.893612806125\n },\n {\n \"content\": \"\\n\\n // Basic functions for creating quantified formulas.\\n\\n // The C API should be used for creating quantifiers with patterns, weights, many variables, etc.\\n\\n inline expr forall(expr const & x, expr const & b) {\\n\\n check_context(x, b);\\n\\n Z3_app vars[] = {(Z3_app) x};\\n\\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr forall(expr const & x1, expr const & x2, expr const & b) {\\n\\n check_context(x1, b); check_context(x2, b);\\n\\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};\\n\\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr forall(expr const & x1, expr const & x2, expr const & x3, expr const & b) {\\n\\n check_context(x1, b); check_context(x2, b); check_context(x3, b);\\n\\n Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };\\n\\n Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);\\n\\n }\\n\\n inline expr forall(expr const & x1, expr const & x2, expr const & x3, expr const & x4, expr const & b) {\\n\\n check_context(x1, b); check_context(x2, b); check_context(x3, b); check_context(x4, b);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 84,\n \"score\": 61462.85730389106\n },\n {\n \"content\": \" check_error(); \\n\\n return expr(ctx(), r); \\n\\n }\\n\\n\\n\\n\\n\\n /**\\n\\n \\\\brief Return a simplified version of this expression.\\n\\n */\\n\\n expr simplify() const { Z3_ast r = Z3_simplify(ctx(), m_ast); check_error(); return expr(ctx(), r); }\\n\\n\\n\\n expr qf_to_simplify() const { Z3_ast r = Z3_qf_to_simplify(ctx(), m_ast); check_error(); return expr(ctx(), r); }\\n\\n /**\\n\\n \\\\brief Return a simplified version of this expression. The parameter \\\\c p is a set of parameters for the Z3 simplifier.\\n\\n */\\n\\n expr simplify(params const & p) const { Z3_ast r = Z3_simplify_ex(ctx(), m_ast, p); check_error(); return expr(ctx(), r); }\\n\\n\\n\\n /**\\n\\n \\\\brief Apply substitution. Replace src expressions by dst.\\n\\n */\\n\\n expr substitute(expr_vector const& src, expr_vector const& dst);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 85,\n \"score\": 61462.81097930315\n },\n {\n \"content\": \"\\n\\n\\n\\n inline func_decl context::function(char const * name, sort const & domain, sort const & range) {\\n\\n check_context(domain, range);\\n\\n Z3_sort args[1] = { domain };\\n\\n Z3_func_decl f = Z3_mk_func_decl(m_ctx, str_symbol(name), 1, args, range);\\n\\n check_error();\\n\\n return func_decl(*this, f);\\n\\n }\\n\\n\\n\\n inline func_decl context::function(char const * name, sort const & d1, sort const & d2, sort const & range) {\\n\\n check_context(d1, range); check_context(d2, range);\\n\\n Z3_sort args[2] = { d1, d2 };\\n\\n Z3_func_decl f = Z3_mk_func_decl(m_ctx, str_symbol(name), 2, args, range);\\n\\n check_error();\\n\\n return func_decl(*this, f);\\n\\n }\\n\\n\\n\\n inline func_decl context::function(char const * name, sort const & d1, sort const & d2, sort const & d3, sort const & range) {\\n\\n check_context(d1, range); check_context(d2, range); check_context(d3, range);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 86,\n \"score\": 61462.63626870926\n },\n {\n \"content\": \" \\\\brief Create a Z3 symbol based on the given integer.\\n\\n */\\n\\n symbol int_symbol(int n);\\n\\n /**\\n\\n \\\\brief Return the Boolean sort.\\n\\n */\\n\\n sort bool_sort();\\n\\n /**\\n\\n \\\\brief Return the integer sort.\\n\\n */\\n\\n sort int_sort();\\n\\n /**\\n\\n \\\\brief Return the Real sort.\\n\\n */\\n\\n sort real_sort();\\n\\n /**\\n\\n \\\\brief Return the Bit-vector sort of size \\\\c sz. That is, the sort for bit-vectors of size \\\\c sz.\\n\\n */\\n\\n sort bv_sort(unsigned sz);\\n\\n /**\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 87,\n \"score\": 61462.615500966116\n },\n {\n \"content\": \" ctx.check_error();\\n\\n return expr(ctx, r);\\n\\n }\\n\\n inline expr atleast(expr_vector const& es, unsigned bound) {\\n\\n assert(es.size() > 0);\\n\\n context& ctx = es[0].ctx();\\n\\n array<Z3_ast> _es(es);\\n\\n Z3_ast r = Z3_mk_atleast(ctx, _es.size(), _es.ptr(), bound);\\n\\n ctx.check_error();\\n\\n return expr(ctx, r);\\n\\n }\\n\\n inline expr sum(expr_vector const& args) {\\n\\n assert(args.size() > 0);\\n\\n context& ctx = args[0].ctx();\\n\\n array<Z3_ast> _args(args);\\n\\n Z3_ast r = Z3_mk_add(ctx, _args.size(), _args.ptr());\\n\\n ctx.check_error();\\n\\n return expr(ctx, r);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 88,\n \"score\": 61462.57328472198\n },\n {\n \"content\": \" r = Z3_mk_unary_minus(a.ctx(), a);\\n\\n }\\n\\n else if (a.is_bv()) {\\n\\n r = Z3_mk_bvneg(a.ctx(), a);\\n\\n }\\n\\n else {\\n\\n // operator is not supported by given arguments.\\n\\n assert(false);\\n\\n }\\n\\n a.check_error();\\n\\n return expr(a.ctx(), r);\\n\\n }\\n\\n\\n\\n inline expr operator-(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\\n Z3_ast r = 0;\\n\\n if (a.is_arith() && b.is_arith()) {\\n\\n Z3_ast args[2] = { a, b };\\n\\n r = Z3_mk_sub(a.ctx(), 2, args);\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 89,\n \"score\": 61462.53896163898\n },\n {\n \"content\": \" std::string key(unsigned i) const { Z3_string s = Z3_stats_get_key(ctx(), m_stats, i); check_error(); return s; }\\n\\n bool is_uint(unsigned i) const { Z3_bool r = Z3_stats_is_uint(ctx(), m_stats, i); check_error(); return r != 0; }\\n\\n bool is_double(unsigned i) const { Z3_bool r = Z3_stats_is_double(ctx(), m_stats, i); check_error(); return r != 0; }\\n\\n unsigned uint_value(unsigned i) const { unsigned r = Z3_stats_get_uint_value(ctx(), m_stats, i); check_error(); return r; }\\n\\n double double_value(unsigned i) const { double r = Z3_stats_get_double_value(ctx(), m_stats, i); check_error(); return r; }\\n\\n friend std::ostream & operator<<(std::ostream & out, stats const & s);\\n\\n };\\n\\n inline std::ostream & operator<<(std::ostream & out, stats const & s) { out << Z3_stats_to_string(s.ctx(), s); return out; }\\n\\n\\n\\n\\n\\n inline std::ostream & operator<<(std::ostream & out, check_result r) {\\n\\n if (r == unsat) out << \\\"unsat\\\";\\n\\n else if (r == sat) out << \\\"sat\\\";\\n\\n else out << \\\"unknown\\\";\\n\\n return out;\\n\\n }\\n\\n\\n\\n\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 90,\n \"score\": 61462.50334506\n },\n {\n \"content\": \" Z3_ast args[5] = { a1, a2, a3, a4, a5 };\\n\\n Z3_ast r = Z3_mk_app(ctx(), *this, 5, args);\\n\\n ctx().check_error();\\n\\n return expr(ctx(), r);\\n\\n }\\n\\n\\n\\n inline expr to_real(expr const & a) { Z3_ast r = Z3_mk_int2real(a.ctx(), a); a.check_error(); return expr(a.ctx(), r); }\\n\\n\\n\\n inline func_decl function(symbol const & name, unsigned arity, sort const * domain, sort const & range) {\\n\\n return range.ctx().function(name, arity, domain, range);\\n\\n }\\n\\n inline func_decl function(char const * name, unsigned arity, sort const * domain, sort const & range) {\\n\\n return range.ctx().function(name, arity, domain, range);\\n\\n }\\n\\n inline func_decl function(char const * name, sort const & domain, sort const & range) {\\n\\n return range.ctx().function(name, domain, range);\\n\\n }\\n\\n inline func_decl function(char const * name, sort const & d1, sort const & d2, sort const & range) {\\n\\n return range.ctx().function(name, d1, d2, range);\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 91,\n \"score\": 61462.43689122179\n },\n {\n \"content\": \" }\\n\\n\\n\\n inline symbol context::str_symbol(char const * s) { Z3_symbol r = Z3_mk_string_symbol(m_ctx, s); check_error(); return symbol(*this, r); }\\n\\n inline symbol context::int_symbol(int n) { Z3_symbol r = Z3_mk_int_symbol(m_ctx, n); check_error(); return symbol(*this, r); }\\n\\n\\n\\n inline sort context::bool_sort() { Z3_sort s = Z3_mk_bool_sort(m_ctx); check_error(); return sort(*this, s); }\\n\\n inline sort context::int_sort() { Z3_sort s = Z3_mk_int_sort(m_ctx); check_error(); return sort(*this, s); }\\n\\n inline sort context::real_sort() { Z3_sort s = Z3_mk_real_sort(m_ctx); check_error(); return sort(*this, s); }\\n\\n inline sort context::bv_sort(unsigned sz) { Z3_sort s = Z3_mk_bv_sort(m_ctx, sz); check_error(); return sort(*this, s); }\\n\\n inline sort context::string_sort() { Z3_sort s = Z3_mk_string_sort(m_ctx); check_error(); return sort(*this, s); }\\n\\n inline sort context::seq_sort(sort& s) { Z3_sort r = Z3_mk_seq_sort(m_ctx, s); check_error(); return sort(*this, r); }\\n\\n inline sort context::re_sort(sort& s) { Z3_sort r = Z3_mk_re_sort(m_ctx, s); check_error(); return sort(*this, r); }\\n\\n\\n\\n inline sort context::array_sort(sort d, sort r) { Z3_sort s = Z3_mk_array_sort(m_ctx, d, r); check_error(); return sort(*this, s); }\\n\\n inline sort context::array_sort(sort_vector const& d, sort r) {\\n\\n array<Z3_sort> dom(d);\\n\\n Z3_sort s = Z3_mk_array_sort_n(m_ctx, dom.size(), dom.ptr(), r); check_error(); return sort(*this, s); \\n\\n }\\n\\n\\n\\n inline sort context::enumeration_sort(char const * name, unsigned n, char const * const * enum_names, func_decl_vector & cs, func_decl_vector & ts) {\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 92,\n \"score\": 61462.3167030193\n },\n {\n \"content\": \" array<Z3_symbol> _enum_names(n);\\n\\n for (unsigned i = 0; i < n; i++) { _enum_names[i] = Z3_mk_string_symbol(*this, enum_names[i]); }\\n\\n array<Z3_func_decl> _cs(n);\\n\\n array<Z3_func_decl> _ts(n);\\n\\n Z3_symbol _name = Z3_mk_string_symbol(*this, name);\\n\\n sort s = to_sort(*this, Z3_mk_enumeration_sort(*this, _name, n, _enum_names.ptr(), _cs.ptr(), _ts.ptr()));\\n\\n check_error();\\n\\n for (unsigned i = 0; i < n; i++) { cs.push_back(func_decl(*this, _cs[i])); ts.push_back(func_decl(*this, _ts[i])); }\\n\\n return s;\\n\\n }\\n\\n inline func_decl context::tuple_sort(char const * name, unsigned n, char const * const * names, sort const* sorts, func_decl_vector & projs) {\\n\\n array<Z3_symbol> _names(n);\\n\\n array<Z3_sort> _sorts(n);\\n\\n for (unsigned i = 0; i < n; i++) { _names[i] = Z3_mk_string_symbol(*this, names[i]); _sorts[i] = sorts[i]; }\\n\\n array<Z3_func_decl> _projs(n);\\n\\n Z3_symbol _name = Z3_mk_string_symbol(*this, name);\\n\\n Z3_func_decl tuple;\\n\\n sort _ignore_s = to_sort(*this, Z3_mk_tuple_sort(*this, _name, n, _names.ptr(), _sorts.ptr(), &tuple, _projs.ptr()));\\n\\n check_error();\\n\\n for (unsigned i = 0; i < n; i++) { projs.push_back(func_decl(*this, _projs[i])); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 93,\n \"score\": 61462.26711133746\n },\n {\n \"content\": \"\\n\\n inline expr operator>=(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\\n Z3_ast r = 0;\\n\\n if (a.is_arith() && b.is_arith()) {\\n\\n r = Z3_mk_ge(a.ctx(), a, b);\\n\\n }\\n\\n else if (a.is_bv() && b.is_bv()) {\\n\\n r = Z3_mk_bvsge(a.ctx(), a, b);\\n\\n }\\n\\n else {\\n\\n // operator is not supported by given arguments.\\n\\n assert(false);\\n\\n }\\n\\n a.check_error();\\n\\n return expr(a.ctx(), r);\\n\\n }\\n\\n\\n\\n inline expr operator/(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 94,\n \"score\": 61462.21272291419\n },\n {\n \"content\": \" friend expr operator||(expr const & a, expr const & b);\\n\\n /**\\n\\n \\\\brief Return an expression representing <tt>a or b</tt>.\\n\\n The C++ Boolean value \\\\c b is automatically converted into a Z3 Boolean constant.\\n\\n\\n\\n \\\\pre a.is_bool()\\n\\n */\\n\\n friend expr operator||(expr const & a, bool b);\\n\\n\\n\\n /**\\n\\n \\\\brief Return an expression representing <tt>a or b</tt>.\\n\\n The C++ Boolean value \\\\c a is automatically converted into a Z3 Boolean constant.\\n\\n\\n\\n \\\\pre b.is_bool()\\n\\n */\\n\\n friend expr operator||(bool a, expr const & b);\\n\\n\\n\\n friend expr implies(expr const & a, expr const & b);\\n\\n friend expr implies(expr const & a, bool b);\\n\\n friend expr implies(bool a, expr const & b);\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 95,\n \"score\": 61462.04118352568\n },\n {\n \"content\": \" inline expr distinct(expr_vector const& args) {\\n\\n assert(args.size() > 0);\\n\\n context& ctx = args[0].ctx();\\n\\n array<Z3_ast> _args(args);\\n\\n Z3_ast r = Z3_mk_distinct(ctx, _args.size(), _args.ptr());\\n\\n ctx.check_error();\\n\\n return expr(ctx, r);\\n\\n }\\n\\n\\n\\n inline expr concat(expr const& a, expr const& b) {\\n\\n check_context(a, b);\\n\\n Z3_ast r;\\n\\n if (Z3_is_seq_sort(a.ctx(), a.get_sort())) {\\n\\n Z3_ast _args[2] = { a, b };\\n\\n r = Z3_mk_seq_concat(a.ctx(), 2, _args);\\n\\n }\\n\\n else if (Z3_is_re_sort(a.ctx(), a.get_sort())) {\\n\\n Z3_ast _args[2] = { a, b };\\n\\n r = Z3_mk_re_concat(a.ctx(), 2, _args);\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 96,\n \"score\": 61462.03616911932\n },\n {\n \"content\": \"\\n\\n /**\\n\\n \\\\brief Apply substitution. Replace bound variables by expressions.\\n\\n */\\n\\n expr substitute(expr_vector const& dst);\\n\\n\\n\\n };\\n\\n\\n\\n#define _Z3_MK_BIN_(a, b, binop) \\\\\\n\\n check_context(a, b); \\\\\\n\\n Z3_ast r = binop(a.ctx(), a, b); \\\\\\n\\n a.check_error(); \\\\\\n\\n return expr(a.ctx(), r); \\\\\\n\\n\\n\\n\\n\\n inline expr implies(expr const & a, expr const & b) {\\n\\n assert(a.is_bool() && b.is_bool()); \\n\\n _Z3_MK_BIN_(a, b, Z3_mk_implies);\\n\\n }\\n\\n inline expr implies(expr const & a, bool b) { return implies(a, a.ctx().bool_val(b)); }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 97,\n \"score\": 61462.00300314292\n },\n {\n \"content\": \" else {\\n\\n r = Z3_mk_concat(a.ctx(), a, b);\\n\\n }\\n\\n a.ctx().check_error();\\n\\n return expr(a.ctx(), r);\\n\\n }\\n\\n\\n\\n inline expr concat(expr_vector const& args) {\\n\\n Z3_ast r;\\n\\n assert(args.size() > 0);\\n\\n if (args.size() == 1) {\\n\\n return args[0];\\n\\n }\\n\\n context& ctx = args[0].ctx();\\n\\n array<Z3_ast> _args(args);\\n\\n if (Z3_is_seq_sort(ctx, args[0].get_sort())) {\\n\\n r = Z3_mk_seq_concat(ctx, _args.size(), _args.ptr());\\n\\n }\\n\\n else if (Z3_is_re_sort(ctx, args[0].get_sort())) {\\n\\n r = Z3_mk_re_concat(ctx, _args.size(), _args.ptr());\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 98,\n \"score\": 61462.005691367565\n },\n {\n \"content\": \"\\n\\n inline expr operator||(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\\n assert(a.is_bool() && b.is_bool());\\n\\n Z3_ast args[2] = { a, b };\\n\\n Z3_ast r = Z3_mk_or(a.ctx(), 2, args);\\n\\n a.check_error();\\n\\n return expr(a.ctx(), r);\\n\\n }\\n\\n\\n\\n inline expr operator||(expr const & a, bool b) { return a || a.ctx().bool_val(b); }\\n\\n\\n\\n inline expr operator||(bool a, expr const & b) { return b.ctx().bool_val(a) || b; }\\n\\n\\n\\n inline expr operator==(expr const & a, expr const & b) {\\n\\n check_context(a, b);\\n\\n Z3_ast r = Z3_mk_eq(a.ctx(), a, b);\\n\\n a.check_error();\\n\\n return expr(a.ctx(), r);\\n\\n }\\n\",\n \"file_path\": \"tests/benchmark/include/z3++.h\",\n \"rank\": 99,\n \"score\": 61461.98766228797\n }\n]","isConversational":false}}},{"rowIdx":482,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"problemes/probleme1xx/probleme185.cpp"},"repo_name":{"kind":"string","value":"ZongoForSpeed/ProjectEuler"},"commit":{"kind":"string","value":"2e2d45f984d48a1da8275886c976f909a0de94ce"},"file_code":{"kind":"string","value":"#include \"problemes.h\"\n#include \"arithmetique.h\"\n\n#include <fstream>\n\ntypedef unsigned long long nombre;\ntypedef std::vector<nombre> vecteur;\n\ntypedef std::pair<std::string, unsigned short> paire;\ntypedef std::vector<paire> ensemble;\n\nnamespace {\n template<typename Iterator>\n bool cherche_solution(Iterator debut, Iterator fin, std::vector<std::set<char>> &solutions) {\n if (debut == fin) {\n for (const auto &s: solutions)\n if (s.size() != 1)\n return false;\n\n return true;\n }\n\n for (const auto &s: solutions) if (s.empty()) return false;\n\n auto essai = *debut;\n\n std::set<size_t> test;\n for (size_t n = 0; n < solutions.size(); ++n)\n test.insert(n);\n\n for (size_t n = 0; n < solutions.size(); ++n) {\n auto s = solutions[n];\n if (solutions[n].size() == 1) {\n if (*solutions[n].begin() == essai.first[n]) {\n essai.second--;\n test.erase(n);\n }\n }\n if (s.find(essai.first[n]) == s.end()) {\n test.erase(n);\n }\n }\n\n if (test.size() < essai.second)\n return false;\n\n if (essai.second == 0) {\n for (size_t n: test) {\n solutions[n].erase(essai.first[n]);\n }\n\n return cherche_solution(++debut, fin, solutions);\n } else {\n std::vector<bool> combinaison(test.size(), true);\n for (size_t n = 0; n < essai.second; ++n)\n combinaison.at(n) = false;\n\n do {\n auto s = solutions;\n bool suivant = false;\n size_t position = 0;\n for (size_t n: test) {\n if (combinaison[position])\n s[n].erase(essai.first[n]);\n else if (s[n].find(essai.first[n]) == s[n].end()) {\n suivant = true;\n break;\n } else\n s[n] = {essai.first[n]};\n\n ++position;\n }\n if (suivant)\n continue;\n\n if (cherche_solution(std::next(debut), fin, s)) {\n std::swap(s, solutions);\n return true;\n }\n } while (std::next_permutation(combinaison.begin(), combinaison.end()));\n return false;\n }\n }\n\n}\n\nENREGISTRER_PROBLEME(185, \"Number Mind\") {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n std::ifstream ifs(\"data/p185_number_mind.txt\");\n \n ensemble essais;\n\n size_t taille = 0;\n std::string pattern, correct, ignore;\n while (ifs >> pattern >> correct >> ignore) {\n taille = pattern.size();\n essais.emplace_back(pattern, correct[1] - '0');\n }\n\n std::set<char> chiffres{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};\n std::vector<std::set<char>> solutions;\n for (size_t n = 0; n < taille; ++n)\n solutions.push_back(chiffres);\n\n cherche_solution(essais.begin(), essais.end(), solutions);\n\n std::ostringstream oss;\n for (const auto &s: solutions)\n oss << *s.begin();\n\n return oss.str();\n}\n"},"prefix":{"kind":"string","value":"#include \"problemes.h\"\n#include \"arithmetique.h\"\n\n#include <fstream>\n\ntypedef unsigned long long nombre;\ntypedef std::vector<nombre> vecteur;\n\ntypedef std::pair<std::string, unsigned short> paire;\ntypedef std::vector<paire> ensemble;\n\nnamespace {\n template<typename Iterator>\n bool cherche_solution(Iterator debut, Iterator fin, std::vector<std::set<char>> &solutions) {\n if (debut == fin) {\n for (const auto &s: solutions)\n if (s.size() != 1)\n return false;\n\n return true;\n }\n\n for (const auto &s: solutions) if (s.empty()) return false;\n\n auto essai = *debut;\n\n std::set<size_t> test;\n for (size_t n = 0; n < solutions.size(); ++n)\n test.insert(n);\n\n for (size_t n = 0; n < solutions.size(); ++n) {\n auto s = solutions[n];\n if (solutions[n].size() == 1) {\n if (*solutions[n].begin() == essai.first[n]) {\n essai.second--;\n test.erase(n);\n }\n }\n "},"suffix":{"kind":"string","value":"\n\n}\n\nENREGISTRER_PROBLEME(185, \"Number Mind\") {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n std::ifstream ifs(\"data/p185_number_mind.txt\");\n \n ensemble essais;\n\n size_t taille = 0;\n std::string pattern, correct, ignore;\n while (ifs >> pattern >> correct >> ignore) {\n taille = pattern.size();\n essais.emplace_back(pattern, correct[1] - '0');\n }\n\n std::set<char> chiffres{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};\n std::vector<std::set<char>> solutions;\n for (size_t n = 0; n < taille; ++n)\n solutions.push_back(chiffres);\n\n cherche_solution(essais.begin(), essais.end(), solutions);\n\n std::ostringstream oss;\n for (const auto &s: solutions)\n oss << *s.begin();\n\n return oss.str();\n}\n"},"middle":{"kind":"string","value":"if (s.find(essai.first[n]) == s.end()) {\n test.erase(n);\n }\n }\n\n if (test.size() < essai.second)\n return false;\n\n if (essai.second == 0) {\n for (size_t n: test) {\n solutions[n].erase(essai.first[n]);\n }\n\n return cherche_solution(++debut, fin, solutions);\n } else {\n std::vector<bool> combinaison(test.size(), true);\n for (size_t n = 0; n < essai.second; ++n)\n combinaison.at(n) = false;\n\n do {\n auto s = solutions;\n bool suivant = false;\n size_t position = 0;\n for (size_t n: test) {\n if (combinaison[position])\n s[n].erase(essai.first[n]);\n else if (s[n].find(essai.first[n]) == s[n].end()) {\n suivant = true;\n break;\n } else\n s[n] = {essai.first[n]};\n\n ++position;\n }\n if (suivant)\n continue;\n\n if (cherche_solution(std::next(debut), fin, s)) {\n std::swap(s, solutions);\n return true;\n }\n } while (std::next_permutation(combinaison.begin(), combinaison.end()));\n return false;\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":" class numeric_limits<mpz_nombre> : public numeric_limits<long long> {\n\n public:\n\n static constexpr int digits = INT_MAX;\n\n static constexpr int digits10 = INT_MAX;\n\n\n\n static mpz_nombre max() {\n\n return mpz_nombre::puissance(2, digits);\n\n }\n\n\n\n static mpz_nombre min() {\n\n return max().negation();\n\n }\n\n\n\n static mpz_nombre lowest() {\n\n return min();\n\n }\n\n };\n\n\n\n inline string to_string(const mpz_nombre &op) {\n\n return op.to_string();\n\n }\n\n}\n","file_path":"maths/mpz_nombre.h","rank":0,"score":107969.89425671563},{"content":" BOOST_CHECK(m > n);\n\n BOOST_CHECK(n <= m);\n\n BOOST_CHECK(m >= m);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_abs) {\n\n mpz_nombre n(-22632576532575LL);\n\n mpz_nombre m = std::abs(n);\n\n BOOST_CHECK_EQUAL(m.get_unsigned_long_long(), 22632576532575);\n\n\n\n mpz_nombre::abs(n, n);\n\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 22632576532575);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_soustraction) {\n\n mpz_nombre n(22801763489LL);\n\n mpz_nombre m(22632576532575LL);\n\n n -= m;\n\n\n\n BOOST_CHECK_EQUAL(n, -22609774769086);\n","file_path":"tests/mpz_nombre.cpp","rank":1,"score":88809.25777067729},{"content":"\n\n n += m;\n\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 45287954828739);\n\n\n\n mpz_nombre p = n + m;\n\n BOOST_CHECK_EQUAL(p.get_unsigned_long_long(), 67920531361314);\n\n\n\n mpz_nombre q = 42ul + m;\n\n BOOST_CHECK_EQUAL(q.get_unsigned_long_long(), 22632576532617);\n\n\n\n mpz_nombre r = n + 666ul;\n\n BOOST_CHECK_EQUAL(r.get_unsigned_long_long(), 45287954829405);\n\n\n\n r += 400000000000000ull;\n\n BOOST_CHECK_EQUAL(r.get_unsigned_long_long(), 445287954829405);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_negation) {\n\n mpz_nombre n(22632576532575LL);\n\n mpz_nombre m = -n;\n","file_path":"tests/mpz_nombre.cpp","rank":2,"score":88808.79901541845},{"content":"\n\n mpz_nombre q = 42000000000000ul % m;\n\n BOOST_CHECK_EQUAL(q, 75);\n\n\n\n unsigned long r = n % 666ul;\n\n BOOST_CHECK_EQUAL(r, 458);\n\n\n\n r %= 4;\n\n BOOST_CHECK_EQUAL(r, 2);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_divisible) {\n\n mpz_nombre n(228017635LL);\n\n mpz_nombre m(275LL);\n\n\n\n BOOST_CHECK_EQUAL(mpz_nombre::divisible(n, m), false);\n\n BOOST_CHECK_EQUAL(mpz_nombre::divisible(n, 5), true);\n\n BOOST_CHECK_EQUAL(mpz_nombre::divisible(2750000, m), true);\n\n }\n\n\n","file_path":"tests/mpz_nombre.cpp","rank":3,"score":88808.78107497236},{"content":"#include <boost/test/unit_test.hpp>\n\n#include <random>\n\n\n\n#include \"utilitaires.h\"\n\n#include \"mpz_nombre.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_mpz_nombre)\n\n\n\n BOOST_AUTO_TEST_CASE(test_constructeur) {\n\n mpz_nombre n1;\n\n mpz_nombre n2(42);\n\n mpz_nombre n3(-666);\n\n mpz_nombre n4(3.14158);\n\n mpz_nombre n5(22801763489LL);\n\n mpz_nombre n7(\"22801763489\");\n\n\n\n BOOST_CHECK_EQUAL(n1.get_signed_long(), 0);\n\n BOOST_CHECK_EQUAL(n2.to_string(2), \"101010\");\n\n BOOST_CHECK_EQUAL(n3.to_string(6), \"-3030\");\n\n BOOST_CHECK_EQUAL(n4.get_signed_long(), 3);\n","file_path":"tests/mpz_nombre.cpp","rank":4,"score":88808.54605049643},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"utilitaires.h\"\n\n#include \"mpf_nombre.h\"\n\n\n\n#define EPSILON 0.000000001l\n\n\n\nBOOST_AUTO_TEST_SUITE(test_mpf_nombre)\n\n\n\n BOOST_AUTO_TEST_CASE(test_constructeur) {\n\n mpf_nombre n1;\n\n mpf_nombre n2(42l);\n\n mpf_nombre n3(-666l);\n\n mpf_nombre n4(3.14158);\n\n mpf_nombre n5(22801763489l);\n\n mpf_nombre n7(\"22801763489\");\n\n\n\n BOOST_CHECK_EQUAL(n1.get_signed_long(), 0);\n\n BOOST_CHECK_EQUAL(n2.to_string(2), \"42\");\n\n BOOST_CHECK_EQUAL(n3.to_string(6), \"-666\");\n","file_path":"tests/mpf_nombre.cpp","rank":5,"score":88807.57981602913},{"content":"\n\n std::random_device rd;\n\n std::mt19937 g(rd());\n\n\n\n std::shuffle(v.begin(), v.end(), g);\n\n\n\n std::sort(v.begin(), v.end());\n\n\n\n std::cout << v << std::endl;\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_addition) {\n\n mpz_nombre n(22801763489LL);\n\n mpz_nombre m(22632576532575LL);\n\n n += m;\n\n\n\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 22655378296064);\n\n\n\n n += 100;\n\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 22655378296164);\n","file_path":"tests/mpz_nombre.cpp","rank":6,"score":88806.94061838707},{"content":" BOOST_CHECK_EQUAL(mpz_nombre::PPCM(p, 456755ul), 1114938955);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_chiffres) {\n\n mpz_nombre n(\"31115050367326962860164013941500001\");\n\n\n\n std::deque<unsigned long int> chiffres;\n\n n.boucle_chiffre([&chiffres](unsigned long int d) { chiffres.push_front(d); });\n\n\n\n const std::vector<unsigned long int> resultat{\n\n 3, 1, 1, 1, 5, 0, 5, 0, 3, 6, 7, 3, 2, 6, 9, 6, 2, 8, 6, 0, 1, 6, 4, 0, 1, 3, 9, 4, 1, 5, 0, 0, 0, 0, 1\n\n };\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), chiffres.begin(), chiffres.end());\n\n\n\n BOOST_CHECK_EQUAL(n.nombre_chiffres(), 35);\n\n BOOST_CHECK_EQUAL(n.somme_chiffres(14), 198);\n\n\n\n auto ec = n.extraire_chiffres();\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), ec.begin(), ec.end());\n\n\n\n BOOST_CHECK_EQUAL(n.inverser_nombre().to_string(), \"10000514931046106826962376305051113\");\n\n BOOST_CHECK(!n.palindrome());\n\n mpz_nombre m(\"89123457675432198\");\n\n BOOST_CHECK(m.palindrome());\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/mpz_nombre.cpp","rank":7,"score":88806.4489130361},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"nombre_modulaire.h\"\n\n#include \"utilitaires.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_nombre_modulaires)\n\n\n\n BOOST_AUTO_TEST_CASE(coefficient_binomial) {\n\n size_t n = 1'000'000'000'000'000'000ull;\n\n size_t k = 1'000'000'000ull;\n\n nombre_modulaire Cnk = nombre_modulaire::coefficient_binomial(4999, n, k);\n\n\n\n BOOST_CHECK_EQUAL(\"2982[4999]\", std::to_string(Cnk));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(factoriel_1) {\n\n nombre_modulaire factoriel = nombre_modulaire::factoriel(4999, 5000);\n\n BOOST_CHECK_EQUAL(\"0[4999]\", std::to_string(factoriel));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(factoriel_2) {\n\n nombre_modulaire factoriel = nombre_modulaire::factoriel(4999, 1234);\n\n BOOST_CHECK_EQUAL(\"3912[4999]\", std::to_string(factoriel));\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/nombre_modulaire.cpp","rank":8,"score":88805.20525842265},{"content":" BOOST_AUTO_TEST_CASE(test_puissance) {\n\n mpz_nombre n(24);\n\n n = mpz_nombre::puissance(n, 10);\n\n\n\n BOOST_CHECK_EQUAL(n, 63403380965376);\n\n\n\n n = mpz_nombre::puissance_modulaire(n, 5, 1000);\n\n BOOST_CHECK_EQUAL(n, 376);\n\n\n\n mpz_nombre m = mpz_nombre::puissance(9, 10);\n\n BOOST_CHECK_EQUAL(m, 3486784401);\n\n\n\n mpz_nombre p = mpz_nombre::puissance_modulaire(m, 100000, 1024);\n\n BOOST_CHECK_EQUAL(p, 513);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_racine) {\n\n mpz_nombre n(63403380965376);\n\n BOOST_CHECK_EQUAL(mpz_nombre::carre_parfait(n), true);\n\n\n","file_path":"tests/mpz_nombre.cpp","rank":9,"score":88802.91029806215},{"content":" BOOST_CHECK_EQUAL(r.to_string(), \"7778762591831740715041003485375000\");\n\n\n\n r *= 4;\n\n BOOST_CHECK_EQUAL(r.to_string(), \"31115050367326962860164013941500000\");\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_shift) {\n\n mpz_nombre n(228);\n\n\n\n mpz_nombre m = n << 10;\n\n BOOST_CHECK_EQUAL(m, 233472);\n\n\n\n mpz_nombre p = n >> 5;\n\n BOOST_CHECK_EQUAL(p, 7);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_division) {\n\n mpz_nombre n(228017639LL);\n\n mpz_nombre m(275LL);\n\n n /= m;\n","file_path":"tests/mpz_nombre.cpp","rank":10,"score":88800.087932196},{"content":"\n\n BOOST_AUTO_TEST_CASE(test_negation) {\n\n mpf_nombre n(22632576532575LL);\n\n mpf_nombre m = -n;\n\n BOOST_CHECK_CLOSE(m, -22632576532575, EPSILON);\n\n\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_comparaison) {\n\n mpf_nombre n(25413164);\n\n mpf_nombre m(22632576532575);\n\n\n\n BOOST_CHECK(n == 25413164);\n\n BOOST_CHECK(n != 2543164);\n\n BOOST_CHECK(n > 25164);\n\n BOOST_CHECK(n >= 25413164);\n\n BOOST_CHECK(n >= 2543164);\n\n BOOST_CHECK(n <= 25413164);\n\n BOOST_CHECK(!(n <= 2543164));\n\n BOOST_CHECK(n < 213421164);\n","file_path":"tests/mpf_nombre.cpp","rank":11,"score":88799.68314687353},{"content":" BOOST_CHECK(!(n == m));\n\n BOOST_CHECK(n < m);\n\n BOOST_CHECK(m > n);\n\n BOOST_CHECK(n <= m);\n\n BOOST_CHECK(m >= m);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_abs) {\n\n mpf_nombre n(-22632576532575LL);\n\n mpf_nombre m = std::abs(n);\n\n BOOST_CHECK_CLOSE(m, 22632576532575, EPSILON);\n\n\n\n mpf_nombre::abs(n, n);\n\n BOOST_CHECK_CLOSE(n, 22632576532575, EPSILON);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_soustraction) {\n\n mpf_nombre n(22801763489LL);\n\n mpf_nombre m(22632576532575LL);\n\n n -= m;\n","file_path":"tests/mpf_nombre.cpp","rank":12,"score":88799.5909223954},{"content":" BOOST_CHECK_EQUAL(n_or.to_string(2), \"10111110111010101\");\n\n BOOST_CHECK_EQUAL(n_xor.to_string(2), \"1110110010101\");\n\n BOOST_CHECK_EQUAL(n_not.to_string(2), \"-10110000111000110\");\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_pgcd) {\n\n mpz_nombre n(456753);\n\n mpz_nombre m(97643);\n\n mpz_nombre p(158665);\n\n\n\n BOOST_CHECK_EQUAL(mpz_nombre::PGCD(n, m), 1);\n\n BOOST_CHECK_EQUAL(mpz_nombre::PGCD(p, 456755ul), 65);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_ppcm) {\n\n mpz_nombre n(456753u);\n\n mpz_nombre m(97643u);\n\n mpz_nombre p(158665u);\n\n\n\n BOOST_CHECK_EQUAL(mpz_nombre::PPCM(n, m), 44598733179);\n","file_path":"tests/mpz_nombre.cpp","rank":13,"score":88799.5187851266},{"content":" BOOST_CHECK_EQUAL(false, mpz_nombre::premier(n * m - 2, 25));\n\n\n\n mpz_nombre p(\"170141183460469231731687303715884105727\");\n\n BOOST_CHECK(mpz_nombre::premier(p, 25));\n\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(p - 2, 25));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_suivant) {\n\n mpz_nombre r(\"170141183460469231731687303715884105757\");\n\n mpz_nombre q(\"170141183460469231731687303715884105727\");\n\n mpz_nombre p;\n\n mpz_nombre::premier_suivant(p, q);\n\n BOOST_CHECK_EQUAL(r, p);\n\n for (mpz_nombre i = q + 2; i < r; i += 2) {\n\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(i, 25));\n\n }\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_stream) {\n\n std::ostringstream oss;\n","file_path":"tests/mpz_nombre.cpp","rank":14,"score":88799.48975135564},{"content":" BOOST_CHECK_EQUAL(n4.get_signed_long(), 3);\n\n BOOST_CHECK_EQUAL(n5.to_string(), \"22801763489\");\n\n BOOST_CHECK_EQUAL(n7.get_signed_long(), 22801763489);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_assignation) {\n\n mpf_nombre n(0);\n\n BOOST_CHECK_CLOSE(n, 0, EPSILON);\n\n\n\n n.set(42l);\n\n BOOST_CHECK_CLOSE(n, 42, EPSILON);\n\n\n\n n.set(-666l);\n\n BOOST_CHECK_CLOSE(n, -666, EPSILON);\n\n\n\n n.set(3.14158);\n\n BOOST_CHECK_CLOSE(n, 3.14158, EPSILON);\n\n\n\n n.set(-22801763489L);\n\n BOOST_CHECK_CLOSE(n, -22801763489, EPSILON);\n","file_path":"tests/mpf_nombre.cpp","rank":15,"score":88799.13840840971},{"content":"\n\n BOOST_AUTO_TEST_CASE(test_trigo) {\n\n BOOST_CHECK_CLOSE(std::cos(mpf_nombre::pi() / 3), 0.5l, EPSILON);\n\n BOOST_CHECK_CLOSE(std::sin(mpf_nombre::pi() / 3), 0.866025403784, EPSILON);\n\n\n\n mpf_nombre sin_pi_3;\n\n mpf_nombre::sin(sin_pi_3, mpf_nombre::pi() / 3);\n\n mpf_nombre sqrt3_2;\n\n mpf_nombre::racine_carre(sqrt3_2, 0.75);\n\n BOOST_CHECK_CLOSE(sin_pi_3, sqrt3_2, EPSILON);\n\n\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/mpf_nombre.cpp","rank":16,"score":88798.91374462153},{"content":" mpz_nombre n(22801763489);\n\n oss << n;\n\n\n\n std::istringstream iss(oss.str());\n\n mpz_nombre m;\n\n iss >> m;\n\n\n\n BOOST_CHECK_EQUAL(n, m);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_logique) {\n\n mpz_nombre n(\"10110000111000101\", 2);\n\n mpz_nombre m(\"10111110001010000\", 2);\n\n\n\n mpz_nombre n_and = n & m;\n\n mpz_nombre n_or = n | m;\n\n mpz_nombre n_xor = n ^m;\n\n mpz_nombre n_not = ~n;\n\n\n\n BOOST_CHECK_EQUAL(n_and.to_string(2), \"10110000001000000\");\n","file_path":"tests/mpz_nombre.cpp","rank":17,"score":88798.3739495573},{"content":" }\n\n\n\n\n\n BOOST_AUTO_TEST_CASE(test_multiplication) {\n\n mpf_nombre n(228017639LL);\n\n mpf_nombre m(22632572575LL);\n\n n *= m;\n\n\n\n BOOST_CHECK_CLOSE(n, 5.16062576305e+18, EPSILON);\n\n\n\n n *= 100;\n\n BOOST_CHECK_CLOSE(n, 5.16062576305e+20, EPSILON);\n\n\n\n n *= m;\n\n BOOST_CHECK_CLOSE(n, 1.16798237115e+31, EPSILON);\n\n\n\n mpf_nombre p = n * m;\n\n BOOST_CHECK_CLOSE(p, 2.64344457813e+41, EPSILON);\n\n\n\n mpf_nombre q = 42ul * m;\n","file_path":"tests/mpf_nombre.cpp","rank":18,"score":88798.15853494743},{"content":" BOOST_CHECK_EQUAL(r, 855);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_modulo) {\n\n mpz_nombre n(228017639LL);\n\n mpz_nombre m(275LL);\n\n n %= m;\n\n\n\n BOOST_CHECK_EQUAL(n, 14);\n\n\n\n n %= 10;\n\n BOOST_CHECK_EQUAL(n, 4);\n\n\n\n n.set(2280176);\n\n n %= m;\n\n BOOST_CHECK_EQUAL(n, 151);\n\n\n\n n.set(2280176);\n\n mpz_nombre p = n % m;\n\n BOOST_CHECK_EQUAL(p, 151);\n","file_path":"tests/mpz_nombre.cpp","rank":19,"score":88798.04164264892},{"content":" BOOST_AUTO_TEST_CASE(test_multiplication) {\n\n mpz_nombre n(228017639LL);\n\n mpz_nombre m(22632572575LL);\n\n n *= m;\n\n\n\n BOOST_CHECK_EQUAL(n.to_string(), \"5160625763047650425\");\n\n\n\n n *= 100;\n\n BOOST_CHECK_EQUAL(n.to_string(), \"516062576304765042500\");\n\n\n\n n *= m;\n\n BOOST_CHECK_EQUAL(n.to_string(), \"11679823711459070142704209437500\");\n\n\n\n mpz_nombre p = n * m;\n\n BOOST_CHECK_EQUAL(p.to_string(), \"264344457812803264146768626852218676562500\");\n\n\n\n mpz_nombre q = 42ul * m;\n\n BOOST_CHECK_EQUAL(q.to_string(), \"950568048150\");\n\n\n\n mpz_nombre r = n * 666ul;\n","file_path":"tests/mpz_nombre.cpp","rank":20,"score":88797.80594006865},{"content":" BOOST_CHECK_CLOSE(q, 950568048150, EPSILON);\n\n\n\n mpf_nombre r = n * 666ul;\n\n BOOST_CHECK_CLOSE(r, 7.77876259183e+33, EPSILON);\n\n\n\n r *= 4;\n\n BOOST_CHECK_CLOSE(r, 3.11150503673e+34, EPSILON);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_division) {\n\n mpf_nombre n(228017639LL);\n\n mpf_nombre m(275LL);\n\n n /= m;\n\n\n\n BOOST_CHECK_CLOSE(n, 829155.050909, EPSILON);\n\n\n\n n /= 100;\n\n BOOST_CHECK_CLOSE(n, 8291.55050909, EPSILON);\n\n\n\n n /= m;\n","file_path":"tests/mpf_nombre.cpp","rank":21,"score":88797.68959594057},{"content":" n.set(\"228017634890\", 10);\n\n BOOST_CHECK_EQUAL(n, 228017634890);\n\n\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_swap) {\n\n mpz_nombre n(228017634890);\n\n mpz_nombre m(-22632576532575);\n\n std::swap(n, m);\n\n BOOST_CHECK_EQUAL(m, 228017634890);\n\n BOOST_CHECK_EQUAL(n, -22632576532575);\n\n\n\n n.swap(m);\n\n BOOST_CHECK_EQUAL(m, -22632576532575);\n\n BOOST_CHECK_EQUAL(n, 228017634890);\n\n\n\n std::vector<mpz_nombre> v;\n\n for (size_t k = 0; k <= 12; ++k) {\n\n v.push_back(mpz_nombre::catalan(k));\n\n }\n","file_path":"tests/mpz_nombre.cpp","rank":22,"score":88797.67140161151},{"content":"\n\n n.set(\"228017634890\", 10);\n\n BOOST_CHECK_CLOSE(n, 228017634890, EPSILON);\n\n\n\n mpf_nombre m(-22632576532575);\n\n std::swap(n, m);\n\n BOOST_CHECK_CLOSE(m, 228017634890, EPSILON);\n\n BOOST_CHECK_CLOSE(n, -2.26325765326e+13, EPSILON);\n\n\n\n n.swap(m);\n\n BOOST_CHECK_CLOSE(m, -2.26325765326e+13, EPSILON);\n\n BOOST_CHECK_CLOSE(n, 228017634890, EPSILON);\n\n }\n\n\n\n\n\n BOOST_AUTO_TEST_CASE(test_addition) {\n\n mpf_nombre n(228017634.89);\n\n mpf_nombre m(2263257.6532575l);\n\n n += m;\n\n\n","file_path":"tests/mpf_nombre.cpp","rank":23,"score":88797.60456192138},{"content":" mpz_nombre m;\n\n mpz_nombre::racine_carre(m, n);\n\n BOOST_CHECK_EQUAL(m, 7962624);\n\n BOOST_CHECK_EQUAL(mpz_nombre::carre_parfait(m), false);\n\n\n\n mpz_nombre p;\n\n mpz_nombre::racine(p, n, 10);\n\n BOOST_CHECK_EQUAL(p, 24);\n\n\n\n mpz_nombre q = std::sqrt(n);\n\n BOOST_CHECK_EQUAL(q, 7962624);\n\n\n\n mpz_nombre r = std::cbrt(n);\n\n BOOST_CHECK_EQUAL(r, 39875);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_premier_1) {\n\n mpz_nombre n(22801763489);\n\n BOOST_CHECK(mpz_nombre::premier(n));\n\n\n","file_path":"tests/mpz_nombre.cpp","rank":24,"score":88797.4583674693},{"content":" BOOST_CHECK_EQUAL(m, -22632576532575);\n\n\n\n m.negation();\n\n BOOST_CHECK_EQUAL(m, 22632576532575);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_comparaison) {\n\n mpz_nombre n(25413164);\n\n mpz_nombre m(22632576532575);\n\n\n\n BOOST_CHECK(n == 25413164);\n\n BOOST_CHECK(n != 2543164);\n\n BOOST_CHECK(n > 25164);\n\n BOOST_CHECK(n >= 25413164);\n\n BOOST_CHECK(n >= 2543164);\n\n BOOST_CHECK(n <= 25413164);\n\n BOOST_CHECK(!(n <= 2543164));\n\n BOOST_CHECK(n < 213421164);\n\n BOOST_CHECK(!(n == m));\n\n BOOST_CHECK(n < m);\n","file_path":"tests/mpz_nombre.cpp","rank":25,"score":88797.00176491172},{"content":" n *= 10;\n\n BOOST_CHECK(!mpz_nombre::premier(n));\n\n\n\n mpz_nombre m;\n\n mpz_nombre::premier_suivant(m, n);\n\n BOOST_CHECK_EQUAL(m, 228017634893);\n\n BOOST_CHECK(mpz_nombre::premier(m));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_premier_2) {\n\n mpz_nombre n(\"32416189721\");\n\n BOOST_CHECK(mpz_nombre::premier(n, 25));\n\n BOOST_CHECK(n.premier());\n\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(n + 44, 25));\n\n\n\n mpz_nombre m(\"2305843009213693951\");\n\n BOOST_CHECK(mpz_nombre::premier(m, 25));\n\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(m + 44, 25));\n\n\n\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(n * m, 25));\n","file_path":"tests/mpz_nombre.cpp","rank":26,"score":88796.97900235327},{"content":" BOOST_CHECK_CLOSE(n, 30.1510927603, EPSILON);\n\n\n\n n.set(2280176);\n\n mpf_nombre p = n / m;\n\n BOOST_CHECK_CLOSE(p, 8291.54909091, EPSILON);\n\n\n\n mpf_nombre q = 42000000000000ul / m;\n\n BOOST_CHECK_CLOSE(q, 152727272727, EPSILON);\n\n\n\n mpf_nombre r = n / 666ul;\n\n BOOST_CHECK_CLOSE(r, 3423.68768769, EPSILON);\n\n\n\n r /= 4;\n\n BOOST_CHECK_CLOSE(r, 855.921921922, EPSILON);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_constant) {\n\n BOOST_CHECK_CLOSE(mpf_nombre::pi(), M_PIl, EPSILON);\n\n BOOST_CHECK_CLOSE(mpf_nombre::e(), M_El, EPSILON);\n\n }\n","file_path":"tests/mpf_nombre.cpp","rank":27,"score":88796.90895996627},{"content":" BOOST_CHECK_EQUAL(n5.to_string(), \"22801763489\");\n\n BOOST_CHECK_EQUAL(n7, 22801763489);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_assignation) {\n\n mpz_nombre n;\n\n BOOST_CHECK_EQUAL(n, 0);\n\n\n\n n.set(42);\n\n BOOST_CHECK_EQUAL(n.to_string(2), \"101010\");\n\n\n\n n.set(-666);\n\n BOOST_CHECK_EQUAL(n.to_string(6), \"-3030\");\n\n\n\n n.set(3.14158);\n\n BOOST_CHECK_EQUAL(n.to_string(), \"3\");\n\n\n\n n.set(-22801763489LL);\n\n BOOST_CHECK_EQUAL(n, -22801763489);\n\n\n","file_path":"tests/mpz_nombre.cpp","rank":28,"score":88795.68033054602},{"content":" BOOST_CHECK_CLOSE(n.get_long_double(), 230280892.543257474899, EPSILON);\n\n\n\n n += 100;\n\n BOOST_CHECK_CLOSE(n.get_long_double(), 230280992.543257474899, EPSILON);\n\n\n\n n += m;\n\n BOOST_CHECK_CLOSE(n.get_long_double(), 232544250.196514964104, EPSILON);\n\n\n\n mpf_nombre p = n + m;\n\n BOOST_CHECK_CLOSE(p.get_long_double(), 234807507.849772464018, EPSILON);\n\n\n\n mpf_nombre q = 42ul + m;\n\n BOOST_CHECK_CLOSE(q.get_long_double(), 2263299.65325749991462, EPSILON);\n\n\n\n mpf_nombre r = n + 666ul;\n\n BOOST_CHECK_CLOSE(r.get_long_double(), 232544916.196514964104, EPSILON);\n\n\n\n r += 400000000000000ull;\n\n BOOST_CHECK_CLOSE(r.get_long_double(), 400000232544916.196503, EPSILON);\n\n }\n","file_path":"tests/mpf_nombre.cpp","rank":29,"score":88794.4205540843},{"content":"\n\n n -= 100;\n\n BOOST_CHECK_EQUAL(n, -22609774769186);\n\n\n\n n -= m;\n\n BOOST_CHECK_EQUAL(n, -45242351301761);\n\n\n\n mpz_nombre p = n - m;\n\n BOOST_CHECK_EQUAL(p, -67874927834336);\n\n\n\n mpz_nombre q = 42ul - m;\n\n BOOST_CHECK_EQUAL(q, -22632576532533);\n\n\n\n mpz_nombre r = n - 666ul;\n\n BOOST_CHECK_EQUAL(r, -45242351302427);\n\n\n\n r -= 400000000000000ull;\n\n BOOST_CHECK_EQUAL(r, -445242351302427);\n\n }\n\n\n","file_path":"tests/mpz_nombre.cpp","rank":30,"score":88789.10032835625},{"content":"\n\n BOOST_CHECK_EQUAL(n, 829155);\n\n\n\n n /= 100;\n\n BOOST_CHECK_EQUAL(n, 8291);\n\n\n\n n /= m;\n\n BOOST_CHECK_EQUAL(n, 30);\n\n\n\n n.set(2280176);\n\n mpz_nombre p = n / m;\n\n BOOST_CHECK_EQUAL(p, 8291);\n\n\n\n mpz_nombre q = 42000000000000ul / m;\n\n BOOST_CHECK_EQUAL(q, 152727272727);\n\n\n\n mpz_nombre r = n / 666ul;\n\n BOOST_CHECK_EQUAL(r, 3423);\n\n\n\n r /= 4;\n","file_path":"tests/mpz_nombre.cpp","rank":31,"score":88789.10032835625},{"content":"\n\n BOOST_CHECK_CLOSE(n, -22609774769086, EPSILON);\n\n\n\n n -= 100;\n\n BOOST_CHECK_CLOSE(n, -22609774769186, EPSILON);\n\n\n\n n -= m;\n\n BOOST_CHECK_CLOSE(n, -45242351301761, EPSILON);\n\n\n\n mpf_nombre p = n - m;\n\n BOOST_CHECK_CLOSE(p, -67874927834336, EPSILON);\n\n\n\n mpf_nombre q = 42ul - m;\n\n BOOST_CHECK_CLOSE(q, -22632576532533, EPSILON);\n\n\n\n mpf_nombre r = n - 666ul;\n\n BOOST_CHECK_CLOSE(r, -45242351302427, EPSILON);\n\n\n\n r -= 400000000000000ull;\n\n BOOST_CHECK_CLOSE(r, -445242351302427, EPSILON);\n","file_path":"tests/mpf_nombre.cpp","rank":32,"score":88788.87672248048},{"content":" class Allocator = std::allocator<std::pair<const Key, T> >\n\n >\n\n std::ostream &operator<<(std::ostream &os, const std::map<Key, T, Compare, Allocator> &s) {\n\n os << \"{\" << std::endl;\n\n for (const auto &p: s) {\n\n os << \" \" << p.first << \" => \" << p.second << std::endl;\n\n }\n\n os << \"}\" << std::endl;\n\n return os;\n\n }\n\n\n\n template<class Iterator>\n\n constexpr Iterator next(Iterator it, size_t n) {\n\n advance(it, static_cast<typename std::iterator_traits<Iterator>::difference_type>(n));\n\n return it;\n\n }\n\n\n\n template<typename T>\n\n constexpr ostream &operator<<(ostream &os, std::optional<T> s) {\n\n if (s)\n","file_path":"maths/utilitaires.h","rank":33,"score":87934.14129070735},{"content":" class Iterateur : public boost::iterator_facade<Iterateur, const T, boost::forward_traversal_tag> {\n\n T _source;\n\n size_t _index;\n\n public:\n\n Iterateur(T &s, size_t index) : _source(s), _index(index) {}\n\n\n\n // What we implement is determined by the boost::forward_traversal_tag\n\n // template parameter\n\n private:\n\n friend class boost::iterator_core_access;\n\n\n\n friend class MyContainer;\n\n\n\n void increment() {\n\n if (_index == std::string::npos) {\n\n return;\n\n }\n\n\n\n if (std::next_permutation(_source.begin(), _source.end())) {\n\n ++_index;\n","file_path":"maths/permutation.h","rank":34,"score":70153.9508762877},{"content":" class Iterateur : public boost::iterator_facade<Iterateur, const std::vector<T>, boost::forward_traversal_tag> {\n\n const std::vector<T> &_source;\n\n size_t _taille;\n\n size_t _index;\n\n\n\n std::vector<bool> _indices;\n\n std::vector<T> _courant;\n\n public:\n\n Iterateur(const std::vector<T> &s, size_t t, size_t index) : _source(s), _taille(t), _index(index) {\n\n size_t n = utilitaires::distance(_source.begin(), _source.end());\n\n _indices.assign(n, false);\n\n for (size_t i = 0; i < t; ++i) {\n\n _indices[i] = true;\n\n }\n\n\n\n _courant.assign(_source.begin(), std::next(_source.begin(), _taille));\n\n }\n\n\n\n private:\n\n friend class boost::iterator_core_access;\n","file_path":"maths/permutation.h","rank":35,"score":65532.20200113826},{"content":"class mpf_nombre {\n\n mpfr_ptr _data;\n\n\n\n static long DEFAULT_PRECISION;\n\n static mpfr_rnd_t DEFAULT_ROUNDING;\n\n static mpf_nombre PI;\n\n static mpf_nombre E;\n\n static mpf_nombre PHI;\n\n\n\n static mpf_nombre calcul_pi();\n\n\n\n static mpf_nombre calcul_e();\n\n\n\n static mpf_nombre calcul_phi();\n\n\n\n void init();\n\n\n\n void clear();\n\n\n\n template<typename Type>\n","file_path":"maths/mpf_nombre.h","rank":36,"score":53888.069543220445},{"content":"class mpz_nombre {\n\n mpz_ptr _data;\n\n\n\n void init();\n\n\n\n void clear();\n\n\n\npublic:\n\n // region Constructors\n\n mpz_nombre();\n\n\n\n ~mpz_nombre();\n\n\n\n mpz_nombre(mpz_srcptr op);\n\n\n\n mpz_nombre(const mpz_nombre &op);\n\n\n\n mpz_nombre(mpz_nombre &&op);\n\n\n\n mpz_nombre(unsigned int op);\n","file_path":"maths/mpz_nombre.h","rank":37,"score":53888.069543220445},{"content":"class nombre_modulaire {\n\n template<typename Type>\n\n void set(Type op, std::false_type /*is_signed*/) {\n\n _value = op % _modulo;\n\n }\n\n\n\n template<typename Type>\n\n void set(Type op, std::true_type /*is_signed*/) {\n\n bool negatif = (op < 0);\n\n op = std::abs(op);\n\n _value = static_cast<size_t>(op) % _modulo;\n\n if (negatif) {\n\n _value = _modulo - _value;\n\n }\n\n }\n\n\n\n static std::pair<size_t, nombre_modulaire> factoriel2(size_t modulo, size_t n);\n\n\n\n static void meme_mod(const nombre_modulaire &n1, const nombre_modulaire &n2);\n\n\n","file_path":"maths/nombre_modulaire.h","rank":38,"score":53888.069543220445},{"content":"class multidimension : public std::vector<multidimension<T, N - 1>> {\n\npublic:\n\n typedef typename std::vector<multidimension<T, N - 1>> super_type;\n\n typedef typename super_type::size_type size_type;\n\n typedef typename super_type::value_type value_type;\n\n\n\n explicit multidimension() = default;\n\n\n\n explicit multidimension(size_type count, const value_type &value) : super_type(count, value) {}\n\n\n\n explicit multidimension(size_type count) : super_type(count) {}\n\n\n\n template<typename... Args>\n\n multidimension(size_type count, Args... args) : super_type(count, value_type(args...)) {}\n\n\n\n multidimension(std::initializer_list<value_type> init) : super_type(init) {}\n\n};\n\n\n\ntemplate<typename T>\n","file_path":"maths/multidimension.h","rank":39,"score":53719.83847099128},{"content":"#define BOOST_TEST_DYN_LINK\n\n#define BOOST_TEST_MODULE Project Euler\n\n\n\n#include <boost/test/included/unit_test.hpp>\n","file_path":"test.cpp","rank":40,"score":48765.38157680607},{"content":"#include <boost/test/unit_test.hpp>\n\n#include <numeric>\n\n\n\n#include \"fenwick.h\"\n\n#include \"utilitaires.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_fenwick)\n\n\n\n // BOOST_AUTO_TEST_CASE(test_fenwick, random_fenwick) {\n\n // // Number of elements in the array\n\n // const unsigned long N = 4 * 1024 * 1024; // Elements in the array\n\n // const unsigned long COUNTS = 1'024; // Size of values stored\n\n // typedef unsigned long sum_t; // Should be able to hold N * (COUNTS - 1)\n\n\n\n // // Number of queries to perform\n\n // const size_t NQUERIES = 100;\n\n\n\n // std::vector<std::pair<unsigned long, unsigned long>> queries;\n\n // queries.reserve(NQUERIES);\n\n // unsigned int seed = 329629153ul;\n","file_path":"tests/fenwick.cpp","rank":41,"score":46550.71991776213},{"content":"\n\n BOOST_AUTO_TEST_CASE(pell_bf3) {\n\n auto resultat = diophantienne::pell_bf<long long>(13, 27, 1000);\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(12, 3),\n\n std::make_pair(40, 11),\n\n std::make_pair(220, 61),\n\n std::make_pair(768, 213)\n\n };\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(quad_s) {\n\n auto resultat = diophantienne::quad_s<long long>(8, 9, 72, 1000);\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(3, 0),\n\n std::make_pair(9, 8),\n\n std::make_pair(51, 48),\n\n std::make_pair(297, 280)\n\n };\n","file_path":"tests/diophantienne.cpp","rank":42,"score":46544.72728743305},{"content":" };\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell_funds_bf3) {\n\n auto resultat = diophantienne::pell_funds_bf<long long>(13, 27);\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(12, 3),\n\n std::make_pair(-12, 3),\n\n std::make_pair(40, 11),\n\n std::make_pair(-40, 11)\n\n };\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell_bf1) {\n\n auto resultat = diophantienne::pell_bf<long long>(13, 108, 1000);\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(11, 1),\n\n std::make_pair(15, 3),\n","file_path":"tests/diophantienne.cpp","rank":43,"score":46544.376683606046},{"content":"\n\n BOOST_AUTO_TEST_CASE(pell4_1) {\n\n std::vector<std::pair<long long, long long>> resultat;\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(649, 180),\n\n std::make_pair(421200, 116820)\n\n };\n\n auto callback = [&resultat, &solution](long long x, long long y) {\n\n resultat.push_back(std::make_pair(x, y));\n\n return resultat.size() != solution.size();\n\n };\n\n\n\n diophantienne::pell4<long long>(13, 1, callback);\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell4_2) {\n\n std::vector<std::pair<long long, long long>> resultat;\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(18, 5),\n","file_path":"tests/diophantienne.cpp","rank":44,"score":46543.91056469341},{"content":" BOOST_AUTO_TEST_CASE(pell1_min) {\n\n BOOST_CHECK_EQUAL(diophantienne::pell1_min(13, 1), std::make_pair(649, 180));\n\n BOOST_CHECK_EQUAL(diophantienne::pell1_min(13, -1), std::make_pair(18, 5));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell4_min) {\n\n BOOST_CHECK_EQUAL(diophantienne::pell4_min(13, 1), std::make_pair(11, 3));\n\n BOOST_CHECK_EQUAL(diophantienne::pell4_min(13, -1), std::make_pair(3, 1));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell1_1) {\n\n std::vector<std::pair<long long, long long>> resultat;\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(649, 180),\n\n std::make_pair(842401, 233640)\n\n };\n\n auto callback = [&resultat, &solution](long long x, long long y) {\n\n resultat.push_back(std::make_pair(x, y));\n\n return resultat.size() != solution.size();\n\n };\n","file_path":"tests/diophantienne.cpp","rank":45,"score":46543.51526854622},{"content":"#include <boost/test/unit_test.hpp>\n\n#include \"racine.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_racine)\n\n\n\n BOOST_AUTO_TEST_CASE(test_racine) {\n\n BOOST_CHECK_EQUAL(racine::racine_carre<unsigned long long>(123456789ULL), 11111ULL);\n\n BOOST_CHECK_EQUAL(racine::racine_carre<unsigned long long>(1234567890987654321ULL), 1111111106ULL);\n\n BOOST_CHECK_EQUAL(racine::racine_carre<unsigned long long>(15241578750190521ULL), 123456789ULL);\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/racine.cpp","rank":46,"score":46543.49932960564},{"content":" std::make_pair(5841, 1620),\n\n std::make_pair(1895386, 525685)\n\n };\n\n auto callback = [&resultat, &solution](long long x, long long y) {\n\n resultat.push_back(std::make_pair(x, y));\n\n return resultat.size() != solution.size();\n\n };\n\n\n\n diophantienne::pell4<long long>(13, -1, callback);\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell_funds_bf1) {\n\n auto resultat = diophantienne::pell_funds_bf<long long>(13, 108);\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(11, 1),\n\n std::make_pair(-11, 1),\n\n std::make_pair(15, 3),\n\n std::make_pair(-15, 3),\n\n std::make_pair(24, 6),\n","file_path":"tests/diophantienne.cpp","rank":47,"score":46543.114613402315},{"content":" std::make_pair(24, 6),\n\n std::make_pair(41, 11),\n\n std::make_pair(80, 22),\n\n std::make_pair(141, 39),\n\n std::make_pair(249, 69),\n\n std::make_pair(440, 122),\n\n std::make_pair(869, 241)\n\n };\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell_bf2) {\n\n auto resultat = diophantienne::pell_bf<long long>(157, 12, 100000000);\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(13, 1),\n\n std::make_pair(10663, 851),\n\n std::make_pair(579160, 46222)\n\n };\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n","file_path":"tests/diophantienne.cpp","rank":48,"score":46542.612914435675},{"content":" std::make_pair(-24, 6),\n\n std::make_pair(41, 11),\n\n std::make_pair(-41, 11),\n\n std::make_pair(80, 22),\n\n std::make_pair(-80, 22),\n\n std::make_pair(141, 39),\n\n std::make_pair(-141, 39)\n\n };\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell_funds_bf2) {\n\n auto resultat = diophantienne::pell_funds_bf<long long>(157, 12);\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(13, 1),\n\n std::make_pair(-13, 1),\n\n std::make_pair(10663, 851),\n\n std::make_pair(-10663, 851),\n\n std::make_pair(579160, 46222),\n\n std::make_pair(-579160, 46222)\n","file_path":"tests/diophantienne.cpp","rank":49,"score":46542.217133608334},{"content":"\n\n diophantienne::pell1<long long>(13, 1, callback);\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pell1_2) {\n\n std::vector<std::pair<long long, long long>> resultat;\n\n std::vector<std::pair<long long, long long>> solution{\n\n std::make_pair(18, 5),\n\n std::make_pair(23382, 6485),\n\n std::make_pair(30349818, 8417525)\n\n };\n\n auto callback = [&resultat, &solution](long long x, long long y) {\n\n resultat.push_back(std::make_pair(x, y));\n\n return resultat.size() != solution.size();\n\n };\n\n\n\n diophantienne::pell1<long long>(13, -1, callback);\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n","file_path":"tests/diophantienne.cpp","rank":50,"score":46542.17693522152},{"content":"#include <boost/test/unit_test.hpp>\n\n#include \"puissance.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_puissance)\n\n\n\n BOOST_AUTO_TEST_CASE(test_puissance_modulaire) {\n\n BOOST_CHECK_EQUAL(puissance::puissance_modulaire(2u, 10u, 100u), 24u);\n\n BOOST_CHECK_EQUAL(puissance::puissance_modulaire<unsigned long long>(97643u, 276799u, 456753u), 368123u);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(test_puissance) {\n\n BOOST_CHECK_EQUAL(puissance::puissance(2u, 10u), 1024u);\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/puissance.cpp","rank":51,"score":46541.31161763762},{"content":" typedef boost::rational<long long> fraction;\n\n\n\n matrice::matrice<fraction> A(3, 3);\n\n A <<= 1, -1, 2,\n\n 3, 2, 1,\n\n 2, -3, -2;\n\n\n\n matrice::vecteur<fraction> b(3);\n\n b <<= 5, 10, -10;\n\n\n\n matrice::vecteur<fraction> resultat(3);\n\n resultat <<= 1, 2, 3;\n\n\n\n matrice::vecteur<fraction> x(3);\n\n bool solution = matrice::resolutionLU(A, b, x);\n\n\n\n BOOST_CHECK_EQUAL(solution, true);\n\n BOOST_CHECK_EQUAL_COLLECTIONS(x.data().begin(), x.data().end(),\n\n resultat.data().begin(), resultat.data().end());\n\n\n","file_path":"tests/matrice.cpp","rank":52,"score":46539.39716599698},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"polynome.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_polynome)\n\n\n\n BOOST_AUTO_TEST_CASE(initialization_1) {\n\n Polynome<long long> p(10);\n\n BOOST_CHECK_EQUAL(p.taille(), 1);\n\n BOOST_CHECK_EQUAL(p.valeur(42), 10);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(initialization_2) {\n\n Polynome<long long> p{-1, 0, 1};\n\n BOOST_CHECK_EQUAL(p.taille(), 3);\n\n BOOST_CHECK_EQUAL(p.valeur(2), 3);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(comparaison) {\n\n Polynome<long long> p{-1, 0, 1};\n","file_path":"tests/polynome.cpp","rank":53,"score":46539.17313086763},{"content":"#include <boost/test/unit_test.hpp>\n\n#include \"matrice.h\"\n\n\n\n#include <boost/numeric/ublas/assignment.hpp>\n\n#include <boost/rational.hpp>\n\n\n\nBOOST_AUTO_TEST_SUITE(test_matrice)\n\n\n\n BOOST_AUTO_TEST_CASE(puissance) {\n\n matrice::matrice<long long> A(2, 2);\n\n A <<= 1, 1,\n\n 1, 0;\n\n\n\n auto F = matrice::puissance_matrice(A, 40);\n\n\n\n const std::vector<long long> resultat{165580141, 102334155,\n\n 102334155, 63245986};\n\n\n\n BOOST_CHECK_EQUAL(F.size1(), 2);\n\n BOOST_CHECK_EQUAL(F.size2(), 2);\n","file_path":"tests/matrice.cpp","rank":54,"score":46539.07430411768},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"combinatoire.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_combinatoire)\n\n\n\n BOOST_AUTO_TEST_CASE(coefficient_binomial) {\n\n BOOST_CHECK_EQUAL(35, combinatoire::coefficient_binomial(7, 3));\n\n BOOST_CHECK_EQUAL(70, combinatoire::coefficient_binomial(8, 4));\n\n BOOST_CHECK_EQUAL(1, combinatoire::coefficient_binomial(40, 0));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(catalan) {\n\n BOOST_CHECK_EQUAL(1, combinatoire::catalan(0));\n\n BOOST_CHECK_EQUAL(1, combinatoire::catalan(1));\n\n BOOST_CHECK_EQUAL(16796, combinatoire::catalan<unsigned long long>(10));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(factorielle) {\n\n BOOST_CHECK_EQUAL(120, combinatoire::factorielle(5));\n\n BOOST_CHECK_EQUAL(720, combinatoire::factorielle(6));\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/combinatoire.cpp","rank":55,"score":46538.91689791148},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"multidimension.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_multidimension)\n\n\n\n BOOST_AUTO_TEST_CASE(multidimension_2) {\n\n multidimension<short, 2> matrice{\n\n {7, 53, 183, 439, 863, 497, 383, 563, 79, 973, 287, 63, 343, 169, 583},\n\n {627, 343, 773, 959, 943, 767, 473, 103, 699, 303, 957, 703, 583, 639, 913},\n\n {447, 283, 463, 29, 23, 487, 463, 993, 119, 883, 327, 493, 423, 159, 743},\n\n {217, 623, 3, 399, 853, 407, 103, 983, 89, 463, 290, 516, 212, 462, 350},\n\n {960, 376, 682, 962, 300, 780, 486, 502, 912, 800, 250, 346, 172, 812, 350},\n\n {870, 456, 192, 162, 593, 473, 915, 45, 989, 873, 823, 965, 425, 329, 803},\n\n {973, 965, 905, 919, 133, 673, 665, 235, 509, 613, 673, 815, 165, 992, 326},\n\n {322, 148, 972, 962, 286, 255, 941, 541, 265, 323, 925, 281, 601, 95, 973},\n\n {445, 721, 11, 525, 473, 65, 511, 164, 138, 672, 18, 428, 154, 448, 848},\n\n {414, 456, 310, 312, 798, 104, 566, 520, 302, 248, 694, 976, 430, 392, 198},\n\n {184, 829, 373, 181, 631, 101, 969, 613, 840, 740, 778, 458, 284, 760, 390},\n\n {821, 461, 843, 513, 17, 901, 711, 993, 293, 157, 274, 94, 192, 156, 574},\n","file_path":"tests/multidimension.cpp","rank":56,"score":46538.721444204944},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"diophantienne.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_diophantienne)\n\n\n\n BOOST_AUTO_TEST_CASE(pqa1) {\n\n auto resultat = diophantienne::PQa(11, 108, 13);\n\n std::vector<long long> fractions{0, 7, 2, 1, 1, 6, 1, 1};\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.first.begin(), resultat.first.end(), fractions.begin(), fractions.end());\n\n BOOST_CHECK_EQUAL(resultat.second, 5);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pqa2) {\n\n auto resultat = diophantienne::PQa(0, 1, 13);\n\n std::vector<long long> fractions{3, 1, 1, 1, 1, 6};\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.first.begin(), resultat.first.end(), fractions.begin(), fractions.end());\n\n BOOST_CHECK_EQUAL(resultat.second, 5);\n\n }\n\n\n","file_path":"tests/diophantienne.cpp","rank":57,"score":46537.24636975284},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"chiffres.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_chiffres)\n\n\n\n BOOST_AUTO_TEST_CASE(nombre_chiffres) {\n\n BOOST_CHECK_EQUAL(9, chiffres::nombre_chiffres(123456789ULL));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(somme_chiffres) {\n\n BOOST_CHECK_EQUAL(45, chiffres::somme_chiffres(123456789ULL));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(extraire_chiffres) {\n\n auto c = chiffres::extraire_chiffres(123456789ULL);\n\n std::deque<size_t> r{1, 2, 3, 4, 5, 6, 7, 8, 9};\n\n BOOST_CHECK_EQUAL_COLLECTIONS(c.begin(), c.end(), r.begin(), r.end());\n\n }\n\n\n","file_path":"tests/chiffres.cpp","rank":58,"score":46537.10570263723},{"content":" BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(iterateur_diophantienne1) {\n\n // 10x + 84y + 16 = 0\n\n long long int A = 10, B = 84, C = 16;\n\n size_t compteur = 0;\n\n for (auto s : diophantienne::equation_lineaire(A, B, C)) {\n\n ++compteur;\n\n if (compteur > 10) {\n\n break;\n\n }\n\n BOOST_CHECK_EQUAL(A * s.first + B * s.second + C, 0);\n\n }\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(iterateur_diophantienne2) {\n\n // 10x + 84y - 16 = 0\n\n long long int A = 10, B = 84, C = -16;\n\n size_t compteur = 0;\n","file_path":"tests/diophantienne.cpp","rank":59,"score":46536.95725893468},{"content":" BOOST_AUTO_TEST_CASE(palindrome) {\n\n BOOST_CHECK_EQUAL(false, chiffres::palindrome(123456789ULL));\n\n BOOST_CHECK_EQUAL(true, chiffres::palindrome(123454321ULL));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pandigital) {\n\n BOOST_CHECK_EQUAL(true, chiffres::pandigital(123456789ULL));\n\n BOOST_CHECK_EQUAL(false, chiffres::pandigital(1234567890ULL));\n\n BOOST_CHECK_EQUAL(false, chiffres::pandigital(123454321ULL));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(conversion_nombre) {\n\n std::deque<size_t> c{1, 2, 3, 4, 5, 6, 7, 8, 9};\n\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::conversion_nombre<size_t>(c.begin(), c.end()));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(permutation_chiffres) {\n\n BOOST_CHECK_EQUAL(true, chiffres::permutation_chiffres(123456789ULL, 918273645ULL));\n\n BOOST_CHECK_EQUAL(true, chiffres::permutation_chiffres(123ULL, 1234ULL));\n\n }\n","file_path":"tests/chiffres.cpp","rank":60,"score":46535.62930457869},{"content":" std::vector<bool> crible(taille, true);\n\n std::vector<size_t> phi(taille, 0);\n\n\n\n std::iota(phi.begin(), phi.end(), 0ul);\n\n for (size_t i = 2; i < taille; ++i) {\n\n if (crible[i]) {\n\n for (size_t j = i; j < taille; j += i) {\n\n crible[j] = false;\n\n phi[j] /= i;\n\n phi[j] *= i - 1;\n\n }\n\n }\n\n }\n\n\n\n // std::cout << phi << std::endl;\n\n Fenwick<long long> fenwick(taille);\n\n std::vector<long long> f(taille, 0);\n\n for (size_t n = taille - 1; n > 5; --n) {\n\n size_t k = phi[n];\n\n f[n] = 1 + fenwick.range(k, n - 1);\n\n fenwick.add(k, f[n]);\n\n }\n\n\n\n BOOST_CHECK_EQUAL(482073668, f[6]);\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/fenwick.cpp","rank":61,"score":46535.46199377989},{"content":"\n\n // // generate the bounds for all of the queries\n\n // srandom(seed + 1);\n\n // for (unsigned int i = 0; i < NQUERIES; ++i) {\n\n // unsigned long a = static_cast<unsigned long>(random()) % N;\n\n // unsigned long b = static_cast<unsigned long>(random()) % N;\n\n\n\n // if (a > b) {\n\n // std::swap(a, b);\n\n // }\n\n\n\n // queries.emplace_back(a, b);\n\n // }\n\n\n\n // /*****************************************************************/\n\n // /* FLAT ARRAY METHOD */\n\n // /*****************************************************************/\n\n // //std::vector<sum_t> array(N, 0);\n\n // //\n\n // //time1 = clock();\n","file_path":"tests/fenwick.cpp","rank":62,"score":46534.519888923554},{"content":" // /*****************************************************************/\n\n // // Store the same random numbers in a Fenwick tree\n\n // Fenwick<sum_t> fenwick(N);\n\n\n\n // srandom(seed);\n\n // for (unsigned int i = 0; i < N; i++)\n\n // fenwick[i] = static_cast<unsigned long>(random()) % COUNTS;\n\n\n\n // fenwick.initialisation();\n\n\n\n // // perform the queries\n\n // std::vector<sum_t> resultat;\n\n // resultat.reserve(NQUERIES);\n\n // for (auto &t: queries) {\n\n // auto range = fenwick.range(t.first, t.second);\n\n // resultat.push_back(range);\n\n // }\n\n\n\n // std::vector<sum_t> objectif{87981345, 1018050452, 37060257, 133931587, 2082302311, 127607876, 499939565,\n\n // 778250548, 1356376781, 1678639060, 576926234, 810701986, 1196425448, 118049060,\n","file_path":"tests/fenwick.cpp","rank":63,"score":46534.51227885926},{"content":" resultat <<= 35, 39, 17,\n\n 70, -32, 4,\n\n 105, -18, 11;\n\n resultat /= 35;\n\n\n\n matrice::matrice<fraction> X(3, 3);\n\n bool solution = matrice::resolutionLU(A, B, X);\n\n\n\n BOOST_CHECK_EQUAL(solution, true);\n\n BOOST_CHECK_EQUAL_COLLECTIONS(X.data().begin(), X.data().end(),\n\n resultat.data().begin(), resultat.data().end());\n\n\n\n matrice::matrice<fraction> produit = boost::numeric::ublas::prod(A, X);\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(produit.data().begin(), produit.data().end(),\n\n B.data().begin(), B.data().end());\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/matrice.cpp","rank":64,"score":46534.136631537614},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"utilitaires.h\"\n\n#include \"permutation.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_permutation)\n\n\n\n BOOST_AUTO_TEST_CASE(permutation_simple) {\n\n const std::vector<std::vector<int>> resultat{\n\n {1, 2, 3},\n\n {1, 3, 2},\n\n {2, 1, 3},\n\n {2, 3, 1},\n\n {3, 1, 2},\n\n {3, 2, 1}\n\n };\n\n\n\n size_t index = 0;\n\n const std::vector<int> v{1, 2, 3};\n\n for (auto i: permutation::Permutation<std::vector<int>>(v)) {\n","file_path":"tests/permutation.cpp","rank":65,"score":46534.119962839395},{"content":" BOOST_AUTO_TEST_CASE(multiplication) {\n\n Polynome<long long> p{1, -1, 1, -1, 1};\n\n Polynome<long long> q{1, 1,};\n\n Polynome<long long> r{1, 0, 0, 0, 0, 1};\n\n BOOST_CHECK_EQUAL(p * q, r);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(affiche_1) {\n\n Polynome<long long> p{1, -1, 1, -1, 1};\n\n std::ostringstream oss;\n\n oss << p;\n\n BOOST_CHECK_EQUAL(oss.str(), \"X^4 - X^3 + X^2 - X + 1\");\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(affiche_2) {\n\n Polynome<long long> p{1, 1,};\n\n std::ostringstream oss;\n\n oss << p;\n\n BOOST_CHECK_EQUAL(oss.str(), \"X + 1\");\n\n }\n","file_path":"tests/polynome.cpp","rank":66,"score":46533.67152473613},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"numerique.h\"\n\n#include \"combinatoire.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_numerique)\n\n\n\n BOOST_AUTO_TEST_CASE(ostringstream_signed) {\n\n auto f = combinatoire::factorielle<int128_t>(30);\n\n std::ostringstream oss;\n\n oss << f;\n\n BOOST_CHECK_EQUAL(\"265252859812191058636308480000000\", oss.str());\n\n\n\n int128_t n;\n\n std::istringstream iss(oss.str());\n\n iss >> n;\n\n BOOST_CHECK_EQUAL(n, f);\n\n\n\n std::ostringstream oss2;\n\n oss2 << -f;\n","file_path":"tests/numerique.cpp","rank":67,"score":46533.500160173644},{"content":" Polynome<long long> q{-1, 0, 1};\n\n Polynome<long long> r{1, 0, 1};\n\n BOOST_CHECK_EQUAL(p, q);\n\n BOOST_CHECK_NE(p, r);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(addition) {\n\n Polynome<long long> p{-1, 0, 1};\n\n Polynome<long long> q{0, 1};\n\n Polynome<long long> r{-1, 1, 1};\n\n BOOST_CHECK_EQUAL(p + q, r);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(soustraction) {\n\n Polynome<long long> p{-1, 1, 1};\n\n Polynome<long long> q{0, 0, 1};\n\n Polynome<long long> r{-1, 1};\n\n BOOST_CHECK_EQUAL(p - q, r);\n\n }\n\n\n","file_path":"tests/polynome.cpp","rank":68,"score":46533.19568492871},{"content":"#include <boost/test/unit_test.hpp>\n\n#include <deque>\n\n\n\n#include \"numerique.h\"\n\n#include \"premiers.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_premiers)\n\n\n\n BOOST_AUTO_TEST_CASE(crible) {\n\n const std::vector<size_t> premiers100{2, 3, 5, 7, 11, 13, 17, 19, 23,\n\n 29, 31, 37, 41, 43, 47, 53, 59,\n\n 61, 67, 71, 73, 79, 83, 89, 97};\n\n std::deque<size_t> resultat;\n\n premiers::crible2<size_t>(100ULL, std::back_inserter(resultat));\n\n BOOST_CHECK_EQUAL_COLLECTIONS(premiers100.begin(), premiers100.end(), resultat.begin(), resultat.end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(crible23) {\n\n std::deque<size_t> resultat;\n\n premiers::crible23<size_t>(10000ULL, std::back_inserter(resultat));\n","file_path":"tests/premiers.cpp","rank":69,"score":46533.19241091446},{"content":" // //// Store random numbers in a flat array\n\n // //srandom(seed);\n\n // //for (unsigned long i = 0; i < N; i++)\n\n // // array[i] = static_cast<unsigned long>(random()) % COUNTS;\n\n // //time2 = clock(); // time2 - time1 = time for setup\n\n // //// perform the queries\n\n // //for (auto &t: queries) {\n\n // // sum_t asum = 0;\n\n // // for (unsigned long i = t.first; i < t.second; i++)\n\n // // asum += array[i];\n\n // // printf(\" %lu\", asum);\n\n // //}\n\n // //time3 = clock(); // time3 - time2 = time for queries\n\n // //\n\n // //printf(\"\\nFlat Array:\\n Build: %f\\n Query: %f\\n\",\n\n // // (time2 - time1) * (1.0 / CLOCKS_PER_SEC),\n\n // // (time3 - time2) * (1.0 / CLOCKS_PER_SEC));\n\n\n\n // /*****************************************************************/\n\n // /* FENWICK TREE METHOD */\n","file_path":"tests/fenwick.cpp","rank":70,"score":46533.13180653553},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"utilitaires.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_utilitaires)\n\n\n\nBOOST_AUTO_TEST_CASE(affiche_vector) {\n\n const std::vector<int> v{1, 1, 2, 3, 5, 8, 13};\n\n std::ostringstream oss;\n\n oss << v;\n\n\n\n BOOST_CHECK_EQUAL(\"[1 1 2 3 5 8 13]\", oss.str());\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(affiche_deque) {\n\n const std::deque<int> v{1, 1, 2, 3, 5, 8, 13, 21, 34};\n\n std::ostringstream oss;\n\n oss << v;\n\n\n\n BOOST_CHECK_EQUAL(\"[1 1 2 3 5 8 13 21 34]\", oss.str());\n","file_path":"tests/utilitaires.cpp","rank":71,"score":46533.00611129542},{"content":"\n\n bool inversible = matrice::inversionLU(A, inverse);\n\n\n\n BOOST_CHECK_EQUAL(inversible, true);\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.data().begin(), resultat.data().end(),\n\n inverse.data().begin(), inverse.data().end());\n\n\n\n matrice::matrice<fraction> identite(4, 4);\n\n identite <<= 1, 0, 0, 0,\n\n 0, 1, 0, 0,\n\n 0, 0, 1, 0,\n\n 0, 0, 0, 1;\n\n\n\n matrice::matrice<fraction> produit = boost::numeric::ublas::prod(A, inverse);\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(produit.data().begin(), produit.data().end(),\n\n identite.data().begin(), identite.data().end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(resolution_vecteur) {\n","file_path":"tests/matrice.cpp","rank":72,"score":46532.90165867718},{"content":"\n\n BOOST_AUTO_TEST_CASE(affiche_3) {\n\n Polynome<long long> p{1, 0, 0, 0, 0, 1};\n\n std::ostringstream oss;\n\n oss << p;\n\n BOOST_CHECK_EQUAL(oss.str(), \"X^5 + 1\");\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(division_euclidienne_1) {\n\n Polynome<long long> A{0, -2, 3, -1, -1, 1};\n\n Polynome<long long> B{1, -1, 1};\n\n\n\n\n\n Polynome<long long> Q;\n\n Polynome<long long> R;\n\n Polynome<long long>::division_euclidienne(A, B, Q, R);\n\n\n\n Polynome<long long> Q1{1, -2, 0, 1};\n\n Polynome<long long> R1{-1, 1};\n\n\n","file_path":"tests/polynome.cpp","rank":73,"score":46532.68968709226},{"content":" }\n\n\n\n BOOST_AUTO_TEST_CASE(combinaisons_simple) {\n\n const std::vector<std::vector<int>> resultat{\n\n {1, 2, 3},\n\n {1, 2, 4},\n\n {1, 3, 4},\n\n {2, 3, 4}\n\n };\n\n\n\n size_t index = 0;\n\n std::vector<int> iterable{1, 2, 3, 4};\n\n for (auto i : permutation::Combinaisons<int>(iterable, 3)) {\n\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\n\n resultat[index].begin(), resultat[index].end());\n\n ++index;\n\n }\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(combinaisons_doublon) {\n","file_path":"tests/permutation.cpp","rank":74,"score":46532.453123277926},{"content":" matrice::vecteur<fraction> produit = boost::numeric::ublas::prod(A, x);\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(produit.data().begin(), produit.data().end(),\n\n b.data().begin(), b.data().end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(resolution_matrice) {\n\n typedef boost::rational<long long> fraction;\n\n\n\n matrice::matrice<fraction> A(3, 3);\n\n A <<= 1, -1, 2,\n\n 3, 2, 1,\n\n 2, -3, -2;\n\n\n\n matrice::matrice<fraction> B(3, 3);\n\n B <<= 5, 1, 1,\n\n 10, 1, 2,\n\n -10, 6, 0;\n\n\n\n matrice::matrice<fraction> resultat(3, 3);\n","file_path":"tests/matrice.cpp","rank":75,"score":46532.35687528255},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"polygonal.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_polygonal)\n\n\n\n BOOST_AUTO_TEST_CASE(carre) {\n\n BOOST_CHECK_EQUAL(123456ULL, racine::racine_carre(15241383936ULL));\n\n BOOST_CHECK(polygonal::est_carre(15241383936ULL));\n\n BOOST_CHECK(!polygonal::est_carre(15241383935ULL));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(cubique) {\n\n BOOST_CHECK_EQUAL(12345ULL, racine::racine_cubique(1881365963625ULL));\n\n BOOST_CHECK(polygonal::est_cubique(1881365963625ULL));\n\n BOOST_CHECK(!polygonal::est_cubique(1881365963624ULL));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(triangulaire) {\n\n BOOST_CHECK_EQUAL(5050, polygonal::triangulaire(100));\n","file_path":"tests/polygonal.cpp","rank":76,"score":46532.302274014146},{"content":" BOOST_CHECK_EQUAL(Q, Q1);\n\n BOOST_CHECK_EQUAL(R, R1);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(division_euclidienne_2) {\n\n Polynome<long long> A{-1, 0, 0, 0, 0, 0, 0, 1};\n\n Polynome<long long> B{-1, 1};\n\n\n\n Polynome<long long> Q;\n\n Polynome<long long> R;\n\n\n\n Polynome<long long>::division_euclidienne(A, B, Q, R);\n\n Polynome<long long> Q1{1, 1, 1, 1, 1, 1, 1};\n\n Polynome<long long> R1;\n\n\n\n BOOST_CHECK_EQUAL(Q, Q1);\n\n BOOST_CHECK_EQUAL(R, R1);\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/polynome.cpp","rank":77,"score":46532.25274408124},{"content":" BOOST_CHECK_EQUAL(v, -88630LL);\n\n BOOST_CHECK_EQUAL(a * u + b * v, 1); // PGCD(a, b) = 1\n\n }\n\n\n\n BOOST_FIXTURE_TEST_CASE(Bezout2, fixure_arithmetiques) {\n\n long long u, v;\n\n long long a = 456755ULL;\n\n long long b = 158665ULL;\n\n arithmetique::Bezout(a, b, u, v);\n\n\n\n BOOST_CHECK_EQUAL(u, 602LL);\n\n BOOST_CHECK_EQUAL(v, -1733LL);\n\n BOOST_CHECK_EQUAL(a * u + b * v, 65); // PGCD(a, b) = 65\n\n }\n\n\n\n\n\n BOOST_FIXTURE_TEST_CASE(nombre_diviseurs, fixure_arithmetiques) {\n\n BOOST_CHECK_EQUAL(arithmetique::nombre_diviseurs(3246999210ULL, premiers), 640);\n\n }\n\n\n","file_path":"tests/arithmetique.cpp","rank":78,"score":46531.67442655948},{"content":"\n\n BOOST_AUTO_TEST_CASE(inverser_nombre) {\n\n BOOST_CHECK_EQUAL(987654321ULL, chiffres::inverser_nombre(123456789ULL));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(concatener) {\n\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::concatener(12ULL, 3456789ULL));\n\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::concatener(12ULL, 345ULL, 6789ULL));\n\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::concatener(12ULL, 34ULL, 567ULL, 89ULL));\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/chiffres.cpp","rank":79,"score":46531.63074131901},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"pythagoricien.h\"\n\n#include \"utilitaires.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_pythagoricien)\n\n\n\n struct fixture_pythagoricien {\n\n std::set<std::tuple<size_t, size_t, size_t>> triplets;\n\n\n\n fixture_pythagoricien() {\n\n triplets = std::set<std::tuple<size_t, size_t, size_t>>\n\n {\n\n std::make_tuple(3, 4, 5),\n\n std::make_tuple(5, 12, 13),\n\n std::make_tuple(8, 15, 17),\n\n std::make_tuple(7, 24, 25),\n\n\n\n std::make_tuple(20, 21, 29),\n\n std::make_tuple(12, 35, 37),\n","file_path":"tests/pythagoricien.cpp","rank":80,"score":46531.475013918905},{"content":"#include <boost/test/unit_test.hpp>\n\n\n\n#include \"arithmetique.h\"\n\n\n\nBOOST_AUTO_TEST_SUITE(test_arithmetique)\n\n\n\n struct fixure_arithmetiques {\n\n std::vector<size_t> premiers;\n\n\n\n explicit fixure_arithmetiques() {\n\n premiers = std::vector<size_t> {2, 3, 5, 7, 11, 13, 17, 19, 23, 29,\n\n 31, 37, 41, 43, 47, 53, 59, 61, 67,\n\n 71, 73, 79, 83, 89, 97};\n\n }\n\n\n\n ~fixure_arithmetiques() = default;\n\n };\n\n\n\n BOOST_FIXTURE_TEST_CASE(pgcd, fixure_arithmetiques) {\n\n BOOST_CHECK_EQUAL(arithmetique::PGCD(456753ULL, 97643ULL), 1);\n","file_path":"tests/arithmetique.cpp","rank":81,"score":46531.400033761},{"content":" BOOST_CHECK_EQUAL(F(0, 0), 165580141);\n\n BOOST_CHECK_EQUAL(F(1, 0), 102334155);\n\n BOOST_CHECK_EQUAL(F(0, 1), 102334155);\n\n BOOST_CHECK_EQUAL(F(1, 1), 63245986);\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(),\n\n F.data().begin(), F.data().end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(puissance_modulaire) {\n\n matrice::matrice<long long> A(2, 2);\n\n A <<= 1, 1,\n\n 1, 0;\n\n\n\n auto F = matrice::puissance_matrice<long long>(A, 100, 1000000000);\n\n\n\n const std::vector<long long> resultat{817084101, 261915075,\n\n 261915075, 555169026};\n\n\n\n BOOST_CHECK_EQUAL(F.size1(), 2);\n","file_path":"tests/matrice.cpp","rank":82,"score":46530.72861564622},{"content":"\n\n std::vector<int> iterable{1, 2, 3, 4};\n\n for (auto &i: permutation::Arrangements<int>(iterable, 3)) {\n\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\n\n resultat[index].begin(), resultat[index].end());\n\n ++index;\n\n }\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(arrangements_doublon) {\n\n const std::vector<std::string> resultat{\"AB\", \"BA\", \"AD\", \"DA\", \"BB\", \"BD\", \"DB\"};\n\n\n\n size_t index = 0;\n\n\n\n std::vector<char> iterable{'A', 'B', 'B', 'D'};\n\n for (auto &i: permutation::Arrangements<char>(iterable, 2)) {\n\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\n\n resultat[index].begin(), resultat[index].end());\n\n ++index;\n\n }\n","file_path":"tests/permutation.cpp","rank":83,"score":46530.68210138234},{"content":" const std::vector<std::string> resultat{\"AB\", \"AC\", \"AD\", \"BC\", \"BD\", \"CD\"};\n\n\n\n size_t index = 0;\n\n std::vector<char> iterable{'A', 'B', 'C', 'D'};\n\n for (auto i : permutation::Combinaisons<char>(iterable, 2)) {\n\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\n\n resultat[index].begin(), resultat[index].end());\n\n ++index;\n\n }\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/permutation.cpp","rank":84,"score":46530.55569012072},{"content":" identite.data().begin(), identite.data().end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(inversion2) {\n\n typedef boost::rational<long long> fraction;\n\n\n\n matrice::matrice<fraction> A(4, 4);\n\n A <<= 1, 1, 1, -1,\n\n 1, 2, 6, 7,\n\n 1, 2, 9, 0,\n\n 2, 5, 9, 15;\n\n\n\n matrice::matrice<fraction> resultat(4, 4);\n\n resultat <<= 99, 132, -44, -55,\n\n -18, -129, 29, 59,\n\n -7, 14, 7, -7,\n\n -3, 17, -8, -3;\n\n resultat /= 77;\n\n\n\n matrice::matrice<fraction> inverse(4, 4);\n","file_path":"tests/matrice.cpp","rank":85,"score":46530.31424427844},{"content":" BOOST_AUTO_TEST_CASE(crible_simple) {\n\n const std::vector<size_t> premiers100{2, 3, 5, 7, 11, 13, 17, 19, 23,\n\n 29, 31, 37, 41, 43, 47, 53, 59,\n\n 61, 67, 71, 73, 79, 83, 89, 97};\n\n std::vector<bool> crible;\n\n premiers::crible_simple(100, crible);\n\n\n\n BOOST_CHECK_EQUAL(100, crible.size());\n\n\n\n for (auto p: premiers100) {\n\n BOOST_CHECK(crible[p]);\n\n }\n\n\n\n size_t compteur = std::accumulate(crible.begin(), crible.end(), 0ul);\n\n BOOST_CHECK_EQUAL(25, compteur);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(miller_rabin) {\n\n uint128_t n = 32416189721ull;\n\n BOOST_CHECK(premiers::miller_rabin<uint128_t>(n, 25));\n","file_path":"tests/premiers.cpp","rank":86,"score":46530.11171297498},{"content":" {34, 124, 4, 878, 450, 476, 712, 914, 838, 669, 875, 299, 823, 329, 699},\n\n {815, 559, 813, 459, 522, 788, 168, 586, 966, 232, 308, 833, 251, 631, 107},\n\n {813, 883, 451, 509, 615, 77, 281, 613, 459, 205, 380, 274, 302, 35, 805}\n\n };\n\n\n\n std::vector<short> ligne1{7, 53, 183, 439, 863, 497, 383, 563, 79, 973, 287, 63, 343, 169, 583};\n\n std::vector<short> ligne7{973, 965, 905, 919, 133, 673, 665, 235, 509, 613, 673, 815, 165, 992, 326};\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(matrice.front().begin(), matrice.front().end(),\n\n ligne1.begin(), ligne1.end());\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(matrice[6].begin(), matrice[6].end(),\n\n ligne7.begin(), ligne7.end());\n\n\n\n BOOST_CHECK_EQUAL(matrice.back().back(), 805);\n\n BOOST_CHECK_EQUAL(matrice[4][10], 250);\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(multidimension_3) {\n\n multidimension<short, 3> matrice\n","file_path":"tests/multidimension.cpp","rank":87,"score":46529.41538797235},{"content":" std::make_tuple(9, 40, 41),\n\n std::make_tuple(28, 45, 53),\n\n\n\n std::make_tuple(11, 60, 61),\n\n std::make_tuple(16, 63, 65),\n\n std::make_tuple(33, 56, 65),\n\n std::make_tuple(48, 55, 73),\n\n\n\n std::make_tuple(13, 84, 85),\n\n std::make_tuple(36, 77, 85),\n\n std::make_tuple(39, 80, 89),\n\n std::make_tuple(65, 72, 97)\n\n };\n\n }\n\n };\n\n\n\n BOOST_FIXTURE_TEST_CASE(nombres_pythagoricien, fixture_pythagoricien) {\n\n Pythagoricien pythagoricien(100);\n\n std::set<std::tuple<size_t, size_t, size_t>> resultat;\n\n for (auto t: pythagoricien) {\n\n resultat.insert(t);\n\n }\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(triplets.begin(), triplets.end(), resultat.begin(), resultat.end());\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/pythagoricien.cpp","rank":88,"score":46528.84128424528},{"content":" BOOST_CHECK_EQUAL(\"-265252859812191058636308480000000\", oss2.str());\n\n\n\n int128_t n2;\n\n std::istringstream iss2(oss2.str());\n\n iss2 >> n2;\n\n BOOST_CHECK_EQUAL(n2, -f);\n\n\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(ostringstream_unsigned) {\n\n auto f = combinatoire::factorielle<uint128_t>(30);\n\n std::ostringstream oss;\n\n oss << f;\n\n BOOST_CHECK_EQUAL(\"265252859812191058636308480000000\", oss.str());\n\n\n\n uint128_t n;\n\n std::istringstream iss(oss.str());\n\n iss >> n;\n\n BOOST_CHECK_EQUAL(n, f);\n\n }\n","file_path":"tests/numerique.cpp","rank":89,"score":46528.68634592027},{"content":" BOOST_CHECK_EQUAL(F.size2(), 2);\n\n BOOST_CHECK_EQUAL(F(0, 0), 817084101);\n\n BOOST_CHECK_EQUAL(F(1, 0), 261915075);\n\n BOOST_CHECK_EQUAL(F(0, 1), 261915075);\n\n BOOST_CHECK_EQUAL(F(1, 1), 555169026);\n\n\n\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(),\n\n F.data().begin(), F.data().end());\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(inversion1) {\n\n typedef boost::rational<long long> fraction;\n\n\n\n matrice::matrice<fraction> A(3, 3);\n\n A <<= 2, -1, 0,\n\n -1, 2, -1,\n\n 0, -1, 2;\n\n\n\n matrice::matrice<fraction> resultat(3, 3);\n\n resultat <<= 3, 2, 1,\n","file_path":"tests/matrice.cpp","rank":90,"score":46528.23858228447},{"content":" BOOST_CHECK_EQUAL(arithmetique::PGCD(456755ULL, 158665ULL), 65);\n\n }\n\n\n\n BOOST_FIXTURE_TEST_CASE(ppcm, fixure_arithmetiques) {\n\n BOOST_CHECK_EQUAL(arithmetique::PPCM(456753ULL, 97643ULL), 44598733179ULL);\n\n BOOST_CHECK_EQUAL(arithmetique::PPCM(456755ULL, 158665ULL), 1114938955);\n\n }\n\n\n\n BOOST_FIXTURE_TEST_CASE(arrondi, fixure_arithmetiques) {\n\n BOOST_CHECK_EQUAL(arithmetique::arrondi(1000, 101), 10);\n\n BOOST_CHECK_EQUAL(arithmetique::arrondi(12345678, 48), 257202);\n\n }\n\n\n\n BOOST_FIXTURE_TEST_CASE(Bezout1, fixure_arithmetiques) {\n\n long long u, v;\n\n long long a = 456753LL;\n\n long long b = 97643LL;\n\n arithmetique::Bezout(a, b, u, v);\n\n\n\n BOOST_CHECK_EQUAL(u, 18947LL);\n","file_path":"tests/arithmetique.cpp","rank":91,"score":46527.88367205082},{"content":" }\n\n\n\n BOOST_AUTO_TEST_CASE(octagonal) {\n\n BOOST_CHECK_EQUAL(29800, polygonal::octagonal(100));\n\n BOOST_CHECK(polygonal::est_octagonal(5461));\n\n BOOST_CHECK(!polygonal::est_octagonal(5460));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(somme_carres) {\n\n BOOST_CHECK_EQUAL(338350, polygonal::somme_carres(100));\n\n BOOST_CHECK_EQUAL(54301841231, polygonal::somme_carres(5461ll));\n\n BOOST_CHECK_EQUAL(54272018710, polygonal::somme_carres(5460ll));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(somme_cubes) {\n\n BOOST_CHECK_EQUAL(25502500, polygonal::somme_cubes(100));\n\n BOOST_CHECK_EQUAL(222427127548081, polygonal::somme_cubes(5461ll));\n\n BOOST_CHECK_EQUAL(222264266760900, polygonal::somme_cubes(5460ll));\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/polygonal.cpp","rank":92,"score":46527.51042821171},{"content":"\n\n BOOST_AUTO_TEST_CASE(numeric_limits_int128) {\n\n BOOST_CHECK_EQUAL(\"170141183460469231731687303715884105727\",\n\n std::to_string(std::numeric_limits<int128_t>::max()));\n\n\n\n BOOST_CHECK_EQUAL(\"-170141183460469231731687303715884105728\",\n\n std::to_string(std::numeric_limits<int128_t>::min()));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(numeric_limits_uint128) {\n\n BOOST_CHECK_EQUAL(\"340282366920938463463374607431768211455\",\n\n std::to_string(std::numeric_limits<uint128_t>::max()));\n\n\n\n BOOST_CHECK_EQUAL(0,\n\n std::numeric_limits<uint128_t>::min());\n\n }\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/numerique.cpp","rank":93,"score":46527.36219703313},{"content":"\n\n BOOST_FIXTURE_TEST_CASE(moebius, fixure_arithmetiques) {\n\n BOOST_CHECK_EQUAL(arithmetique::moebius(3246999210ULL, premiers), 0);\n\n BOOST_CHECK_EQUAL(arithmetique::moebius(496ULL, premiers), 0);\n\n BOOST_CHECK_EQUAL(arithmetique::moebius(19ULL, premiers), -1);\n\n BOOST_CHECK_EQUAL(arithmetique::moebius(15ULL, premiers), 1);\n\n }\n\n\n\n BOOST_FIXTURE_TEST_CASE(facteur_carre, fixure_arithmetiques) {\n\n BOOST_CHECK_EQUAL(arithmetique::facteur_carre(3246999210ULL, premiers), true);\n\n BOOST_CHECK_EQUAL(arithmetique::facteur_carre(42315ULL, premiers), false);\n\n }\n\n\n\n BOOST_FIXTURE_TEST_CASE(diviseurs, fixure_arithmetiques) {\n\n auto d = arithmetique::diviseurs(496ULL, premiers);\n\n std::vector<size_t> result{1, 2, 4, 8, 16, 31, 62, 124, 248, 496};\n\n BOOST_CHECK_EQUAL_COLLECTIONS(d.begin(), d.end(), result.begin(), result.end());\n\n }\n\n\n\n BOOST_FIXTURE_TEST_CASE(repunit, fixure_arithmetiques) {\n","file_path":"tests/arithmetique.cpp","rank":94,"score":46527.239343948044},{"content":"}\n\n\n\nBOOST_AUTO_TEST_CASE(affiche_set) {\n\n const std::set<int> v{1, 1, 2, 3, 5, 8, 13, 21, 34};\n\n std::ostringstream oss;\n\n oss << v;\n\n\n\n BOOST_CHECK_EQUAL(\"{1 2 3 5 8 13 21 34}\", oss.str());\n\n}\n\n\n\nBOOST_AUTO_TEST_CASE(affiche_map) {\n\n const std::map<int, std::string> v{{1, \"1\"},\n\n {2, \"3\"},\n\n {5, \"8\"},\n\n {13, \"21\"}};\n\n std::ostringstream oss;\n\n oss << v;\n\n\n\n const std::string result = \"{\\n\"\n\n \" 1 => 1\\n\"\n","file_path":"tests/utilitaires.cpp","rank":95,"score":46527.13633273574},{"content":" for (auto s : diophantienne::equation_lineaire(A, B, C)) {\n\n ++compteur;\n\n if (compteur > 10) {\n\n break;\n\n }\n\n BOOST_CHECK_EQUAL(A * s.first + B * s.second + C, 0);\n\n }\n\n }\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/diophantienne.cpp","rank":96,"score":46526.99963752479},{"content":" \" 2 => 3\\n\"\n\n \" 5 => 8\\n\"\n\n \" 13 => 21\\n\"\n\n \"}\\n\";\n\n\n\n BOOST_CHECK_EQUAL(result, oss.str());\n\n}\n\n\n\nBOOST_AUTO_TEST_SUITE_END()\n","file_path":"tests/utilitaires.cpp","rank":97,"score":46526.94515429852},{"content":" BOOST_CHECK(polygonal::est_triangulaire(5050));\n\n BOOST_CHECK(!polygonal::est_triangulaire(5000));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(pentagonal) {\n\n BOOST_CHECK_EQUAL(14950, polygonal::pentagonal(100));\n\n BOOST_CHECK(polygonal::est_pentagonal(3151));\n\n BOOST_CHECK(!polygonal::est_pentagonal(3150));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(hexagonal) {\n\n BOOST_CHECK_EQUAL(19900, polygonal::hexagonal(100));\n\n BOOST_CHECK(polygonal::est_hexagonal(4560));\n\n BOOST_CHECK(!polygonal::est_hexagonal(4550));\n\n }\n\n\n\n BOOST_AUTO_TEST_CASE(heptagonal) {\n\n BOOST_CHECK_EQUAL(24850, polygonal::heptagonal(100));\n\n BOOST_CHECK(polygonal::est_heptagonal(5688));\n\n BOOST_CHECK(!polygonal::est_heptagonal(5689));\n","file_path":"tests/polygonal.cpp","rank":98,"score":46526.85874061337}],"string":"[\n {\n \"content\": \" class numeric_limits<mpz_nombre> : public numeric_limits<long long> {\\n\\n public:\\n\\n static constexpr int digits = INT_MAX;\\n\\n static constexpr int digits10 = INT_MAX;\\n\\n\\n\\n static mpz_nombre max() {\\n\\n return mpz_nombre::puissance(2, digits);\\n\\n }\\n\\n\\n\\n static mpz_nombre min() {\\n\\n return max().negation();\\n\\n }\\n\\n\\n\\n static mpz_nombre lowest() {\\n\\n return min();\\n\\n }\\n\\n };\\n\\n\\n\\n inline string to_string(const mpz_nombre &op) {\\n\\n return op.to_string();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"maths/mpz_nombre.h\",\n \"rank\": 0,\n \"score\": 107969.89425671563\n },\n {\n \"content\": \" BOOST_CHECK(m > n);\\n\\n BOOST_CHECK(n <= m);\\n\\n BOOST_CHECK(m >= m);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_abs) {\\n\\n mpz_nombre n(-22632576532575LL);\\n\\n mpz_nombre m = std::abs(n);\\n\\n BOOST_CHECK_EQUAL(m.get_unsigned_long_long(), 22632576532575);\\n\\n\\n\\n mpz_nombre::abs(n, n);\\n\\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 22632576532575);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_soustraction) {\\n\\n mpz_nombre n(22801763489LL);\\n\\n mpz_nombre m(22632576532575LL);\\n\\n n -= m;\\n\\n\\n\\n BOOST_CHECK_EQUAL(n, -22609774769086);\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 1,\n \"score\": 88809.25777067729\n },\n {\n \"content\": \"\\n\\n n += m;\\n\\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 45287954828739);\\n\\n\\n\\n mpz_nombre p = n + m;\\n\\n BOOST_CHECK_EQUAL(p.get_unsigned_long_long(), 67920531361314);\\n\\n\\n\\n mpz_nombre q = 42ul + m;\\n\\n BOOST_CHECK_EQUAL(q.get_unsigned_long_long(), 22632576532617);\\n\\n\\n\\n mpz_nombre r = n + 666ul;\\n\\n BOOST_CHECK_EQUAL(r.get_unsigned_long_long(), 45287954829405);\\n\\n\\n\\n r += 400000000000000ull;\\n\\n BOOST_CHECK_EQUAL(r.get_unsigned_long_long(), 445287954829405);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_negation) {\\n\\n mpz_nombre n(22632576532575LL);\\n\\n mpz_nombre m = -n;\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 2,\n \"score\": 88808.79901541845\n },\n {\n \"content\": \"\\n\\n mpz_nombre q = 42000000000000ul % m;\\n\\n BOOST_CHECK_EQUAL(q, 75);\\n\\n\\n\\n unsigned long r = n % 666ul;\\n\\n BOOST_CHECK_EQUAL(r, 458);\\n\\n\\n\\n r %= 4;\\n\\n BOOST_CHECK_EQUAL(r, 2);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_divisible) {\\n\\n mpz_nombre n(228017635LL);\\n\\n mpz_nombre m(275LL);\\n\\n\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::divisible(n, m), false);\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::divisible(n, 5), true);\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::divisible(2750000, m), true);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 3,\n \"score\": 88808.78107497236\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n#include <random>\\n\\n\\n\\n#include \\\"utilitaires.h\\\"\\n\\n#include \\\"mpz_nombre.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_mpz_nombre)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_constructeur) {\\n\\n mpz_nombre n1;\\n\\n mpz_nombre n2(42);\\n\\n mpz_nombre n3(-666);\\n\\n mpz_nombre n4(3.14158);\\n\\n mpz_nombre n5(22801763489LL);\\n\\n mpz_nombre n7(\\\"22801763489\\\");\\n\\n\\n\\n BOOST_CHECK_EQUAL(n1.get_signed_long(), 0);\\n\\n BOOST_CHECK_EQUAL(n2.to_string(2), \\\"101010\\\");\\n\\n BOOST_CHECK_EQUAL(n3.to_string(6), \\\"-3030\\\");\\n\\n BOOST_CHECK_EQUAL(n4.get_signed_long(), 3);\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 4,\n \"score\": 88808.54605049643\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"utilitaires.h\\\"\\n\\n#include \\\"mpf_nombre.h\\\"\\n\\n\\n\\n#define EPSILON 0.000000001l\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_mpf_nombre)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_constructeur) {\\n\\n mpf_nombre n1;\\n\\n mpf_nombre n2(42l);\\n\\n mpf_nombre n3(-666l);\\n\\n mpf_nombre n4(3.14158);\\n\\n mpf_nombre n5(22801763489l);\\n\\n mpf_nombre n7(\\\"22801763489\\\");\\n\\n\\n\\n BOOST_CHECK_EQUAL(n1.get_signed_long(), 0);\\n\\n BOOST_CHECK_EQUAL(n2.to_string(2), \\\"42\\\");\\n\\n BOOST_CHECK_EQUAL(n3.to_string(6), \\\"-666\\\");\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 5,\n \"score\": 88807.57981602913\n },\n {\n \"content\": \"\\n\\n std::random_device rd;\\n\\n std::mt19937 g(rd());\\n\\n\\n\\n std::shuffle(v.begin(), v.end(), g);\\n\\n\\n\\n std::sort(v.begin(), v.end());\\n\\n\\n\\n std::cout << v << std::endl;\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_addition) {\\n\\n mpz_nombre n(22801763489LL);\\n\\n mpz_nombre m(22632576532575LL);\\n\\n n += m;\\n\\n\\n\\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 22655378296064);\\n\\n\\n\\n n += 100;\\n\\n BOOST_CHECK_EQUAL(n.get_unsigned_long_long(), 22655378296164);\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 6,\n \"score\": 88806.94061838707\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(mpz_nombre::PPCM(p, 456755ul), 1114938955);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_chiffres) {\\n\\n mpz_nombre n(\\\"31115050367326962860164013941500001\\\");\\n\\n\\n\\n std::deque<unsigned long int> chiffres;\\n\\n n.boucle_chiffre([&chiffres](unsigned long int d) { chiffres.push_front(d); });\\n\\n\\n\\n const std::vector<unsigned long int> resultat{\\n\\n 3, 1, 1, 1, 5, 0, 5, 0, 3, 6, 7, 3, 2, 6, 9, 6, 2, 8, 6, 0, 1, 6, 4, 0, 1, 3, 9, 4, 1, 5, 0, 0, 0, 0, 1\\n\\n };\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), chiffres.begin(), chiffres.end());\\n\\n\\n\\n BOOST_CHECK_EQUAL(n.nombre_chiffres(), 35);\\n\\n BOOST_CHECK_EQUAL(n.somme_chiffres(14), 198);\\n\\n\\n\\n auto ec = n.extraire_chiffres();\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), ec.begin(), ec.end());\\n\\n\\n\\n BOOST_CHECK_EQUAL(n.inverser_nombre().to_string(), \\\"10000514931046106826962376305051113\\\");\\n\\n BOOST_CHECK(!n.palindrome());\\n\\n mpz_nombre m(\\\"89123457675432198\\\");\\n\\n BOOST_CHECK(m.palindrome());\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 7,\n \"score\": 88806.4489130361\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"nombre_modulaire.h\\\"\\n\\n#include \\\"utilitaires.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_nombre_modulaires)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(coefficient_binomial) {\\n\\n size_t n = 1'000'000'000'000'000'000ull;\\n\\n size_t k = 1'000'000'000ull;\\n\\n nombre_modulaire Cnk = nombre_modulaire::coefficient_binomial(4999, n, k);\\n\\n\\n\\n BOOST_CHECK_EQUAL(\\\"2982[4999]\\\", std::to_string(Cnk));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(factoriel_1) {\\n\\n nombre_modulaire factoriel = nombre_modulaire::factoriel(4999, 5000);\\n\\n BOOST_CHECK_EQUAL(\\\"0[4999]\\\", std::to_string(factoriel));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(factoriel_2) {\\n\\n nombre_modulaire factoriel = nombre_modulaire::factoriel(4999, 1234);\\n\\n BOOST_CHECK_EQUAL(\\\"3912[4999]\\\", std::to_string(factoriel));\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/nombre_modulaire.cpp\",\n \"rank\": 8,\n \"score\": 88805.20525842265\n },\n {\n \"content\": \" BOOST_AUTO_TEST_CASE(test_puissance) {\\n\\n mpz_nombre n(24);\\n\\n n = mpz_nombre::puissance(n, 10);\\n\\n\\n\\n BOOST_CHECK_EQUAL(n, 63403380965376);\\n\\n\\n\\n n = mpz_nombre::puissance_modulaire(n, 5, 1000);\\n\\n BOOST_CHECK_EQUAL(n, 376);\\n\\n\\n\\n mpz_nombre m = mpz_nombre::puissance(9, 10);\\n\\n BOOST_CHECK_EQUAL(m, 3486784401);\\n\\n\\n\\n mpz_nombre p = mpz_nombre::puissance_modulaire(m, 100000, 1024);\\n\\n BOOST_CHECK_EQUAL(p, 513);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_racine) {\\n\\n mpz_nombre n(63403380965376);\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::carre_parfait(n), true);\\n\\n\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 9,\n \"score\": 88802.91029806215\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(r.to_string(), \\\"7778762591831740715041003485375000\\\");\\n\\n\\n\\n r *= 4;\\n\\n BOOST_CHECK_EQUAL(r.to_string(), \\\"31115050367326962860164013941500000\\\");\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_shift) {\\n\\n mpz_nombre n(228);\\n\\n\\n\\n mpz_nombre m = n << 10;\\n\\n BOOST_CHECK_EQUAL(m, 233472);\\n\\n\\n\\n mpz_nombre p = n >> 5;\\n\\n BOOST_CHECK_EQUAL(p, 7);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_division) {\\n\\n mpz_nombre n(228017639LL);\\n\\n mpz_nombre m(275LL);\\n\\n n /= m;\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 10,\n \"score\": 88800.087932196\n },\n {\n \"content\": \"\\n\\n BOOST_AUTO_TEST_CASE(test_negation) {\\n\\n mpf_nombre n(22632576532575LL);\\n\\n mpf_nombre m = -n;\\n\\n BOOST_CHECK_CLOSE(m, -22632576532575, EPSILON);\\n\\n\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_comparaison) {\\n\\n mpf_nombre n(25413164);\\n\\n mpf_nombre m(22632576532575);\\n\\n\\n\\n BOOST_CHECK(n == 25413164);\\n\\n BOOST_CHECK(n != 2543164);\\n\\n BOOST_CHECK(n > 25164);\\n\\n BOOST_CHECK(n >= 25413164);\\n\\n BOOST_CHECK(n >= 2543164);\\n\\n BOOST_CHECK(n <= 25413164);\\n\\n BOOST_CHECK(!(n <= 2543164));\\n\\n BOOST_CHECK(n < 213421164);\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 11,\n \"score\": 88799.68314687353\n },\n {\n \"content\": \" BOOST_CHECK(!(n == m));\\n\\n BOOST_CHECK(n < m);\\n\\n BOOST_CHECK(m > n);\\n\\n BOOST_CHECK(n <= m);\\n\\n BOOST_CHECK(m >= m);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_abs) {\\n\\n mpf_nombre n(-22632576532575LL);\\n\\n mpf_nombre m = std::abs(n);\\n\\n BOOST_CHECK_CLOSE(m, 22632576532575, EPSILON);\\n\\n\\n\\n mpf_nombre::abs(n, n);\\n\\n BOOST_CHECK_CLOSE(n, 22632576532575, EPSILON);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_soustraction) {\\n\\n mpf_nombre n(22801763489LL);\\n\\n mpf_nombre m(22632576532575LL);\\n\\n n -= m;\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 12,\n \"score\": 88799.5909223954\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(n_or.to_string(2), \\\"10111110111010101\\\");\\n\\n BOOST_CHECK_EQUAL(n_xor.to_string(2), \\\"1110110010101\\\");\\n\\n BOOST_CHECK_EQUAL(n_not.to_string(2), \\\"-10110000111000110\\\");\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_pgcd) {\\n\\n mpz_nombre n(456753);\\n\\n mpz_nombre m(97643);\\n\\n mpz_nombre p(158665);\\n\\n\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::PGCD(n, m), 1);\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::PGCD(p, 456755ul), 65);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_ppcm) {\\n\\n mpz_nombre n(456753u);\\n\\n mpz_nombre m(97643u);\\n\\n mpz_nombre p(158665u);\\n\\n\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::PPCM(n, m), 44598733179);\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 13,\n \"score\": 88799.5187851266\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(false, mpz_nombre::premier(n * m - 2, 25));\\n\\n\\n\\n mpz_nombre p(\\\"170141183460469231731687303715884105727\\\");\\n\\n BOOST_CHECK(mpz_nombre::premier(p, 25));\\n\\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(p - 2, 25));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_suivant) {\\n\\n mpz_nombre r(\\\"170141183460469231731687303715884105757\\\");\\n\\n mpz_nombre q(\\\"170141183460469231731687303715884105727\\\");\\n\\n mpz_nombre p;\\n\\n mpz_nombre::premier_suivant(p, q);\\n\\n BOOST_CHECK_EQUAL(r, p);\\n\\n for (mpz_nombre i = q + 2; i < r; i += 2) {\\n\\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(i, 25));\\n\\n }\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_stream) {\\n\\n std::ostringstream oss;\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 14,\n \"score\": 88799.48975135564\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(n4.get_signed_long(), 3);\\n\\n BOOST_CHECK_EQUAL(n5.to_string(), \\\"22801763489\\\");\\n\\n BOOST_CHECK_EQUAL(n7.get_signed_long(), 22801763489);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_assignation) {\\n\\n mpf_nombre n(0);\\n\\n BOOST_CHECK_CLOSE(n, 0, EPSILON);\\n\\n\\n\\n n.set(42l);\\n\\n BOOST_CHECK_CLOSE(n, 42, EPSILON);\\n\\n\\n\\n n.set(-666l);\\n\\n BOOST_CHECK_CLOSE(n, -666, EPSILON);\\n\\n\\n\\n n.set(3.14158);\\n\\n BOOST_CHECK_CLOSE(n, 3.14158, EPSILON);\\n\\n\\n\\n n.set(-22801763489L);\\n\\n BOOST_CHECK_CLOSE(n, -22801763489, EPSILON);\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 15,\n \"score\": 88799.13840840971\n },\n {\n \"content\": \"\\n\\n BOOST_AUTO_TEST_CASE(test_trigo) {\\n\\n BOOST_CHECK_CLOSE(std::cos(mpf_nombre::pi() / 3), 0.5l, EPSILON);\\n\\n BOOST_CHECK_CLOSE(std::sin(mpf_nombre::pi() / 3), 0.866025403784, EPSILON);\\n\\n\\n\\n mpf_nombre sin_pi_3;\\n\\n mpf_nombre::sin(sin_pi_3, mpf_nombre::pi() / 3);\\n\\n mpf_nombre sqrt3_2;\\n\\n mpf_nombre::racine_carre(sqrt3_2, 0.75);\\n\\n BOOST_CHECK_CLOSE(sin_pi_3, sqrt3_2, EPSILON);\\n\\n\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 16,\n \"score\": 88798.91374462153\n },\n {\n \"content\": \" mpz_nombre n(22801763489);\\n\\n oss << n;\\n\\n\\n\\n std::istringstream iss(oss.str());\\n\\n mpz_nombre m;\\n\\n iss >> m;\\n\\n\\n\\n BOOST_CHECK_EQUAL(n, m);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_logique) {\\n\\n mpz_nombre n(\\\"10110000111000101\\\", 2);\\n\\n mpz_nombre m(\\\"10111110001010000\\\", 2);\\n\\n\\n\\n mpz_nombre n_and = n & m;\\n\\n mpz_nombre n_or = n | m;\\n\\n mpz_nombre n_xor = n ^m;\\n\\n mpz_nombre n_not = ~n;\\n\\n\\n\\n BOOST_CHECK_EQUAL(n_and.to_string(2), \\\"10110000001000000\\\");\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 17,\n \"score\": 88798.3739495573\n },\n {\n \"content\": \" }\\n\\n\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_multiplication) {\\n\\n mpf_nombre n(228017639LL);\\n\\n mpf_nombre m(22632572575LL);\\n\\n n *= m;\\n\\n\\n\\n BOOST_CHECK_CLOSE(n, 5.16062576305e+18, EPSILON);\\n\\n\\n\\n n *= 100;\\n\\n BOOST_CHECK_CLOSE(n, 5.16062576305e+20, EPSILON);\\n\\n\\n\\n n *= m;\\n\\n BOOST_CHECK_CLOSE(n, 1.16798237115e+31, EPSILON);\\n\\n\\n\\n mpf_nombre p = n * m;\\n\\n BOOST_CHECK_CLOSE(p, 2.64344457813e+41, EPSILON);\\n\\n\\n\\n mpf_nombre q = 42ul * m;\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 18,\n \"score\": 88798.15853494743\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(r, 855);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_modulo) {\\n\\n mpz_nombre n(228017639LL);\\n\\n mpz_nombre m(275LL);\\n\\n n %= m;\\n\\n\\n\\n BOOST_CHECK_EQUAL(n, 14);\\n\\n\\n\\n n %= 10;\\n\\n BOOST_CHECK_EQUAL(n, 4);\\n\\n\\n\\n n.set(2280176);\\n\\n n %= m;\\n\\n BOOST_CHECK_EQUAL(n, 151);\\n\\n\\n\\n n.set(2280176);\\n\\n mpz_nombre p = n % m;\\n\\n BOOST_CHECK_EQUAL(p, 151);\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 19,\n \"score\": 88798.04164264892\n },\n {\n \"content\": \" BOOST_AUTO_TEST_CASE(test_multiplication) {\\n\\n mpz_nombre n(228017639LL);\\n\\n mpz_nombre m(22632572575LL);\\n\\n n *= m;\\n\\n\\n\\n BOOST_CHECK_EQUAL(n.to_string(), \\\"5160625763047650425\\\");\\n\\n\\n\\n n *= 100;\\n\\n BOOST_CHECK_EQUAL(n.to_string(), \\\"516062576304765042500\\\");\\n\\n\\n\\n n *= m;\\n\\n BOOST_CHECK_EQUAL(n.to_string(), \\\"11679823711459070142704209437500\\\");\\n\\n\\n\\n mpz_nombre p = n * m;\\n\\n BOOST_CHECK_EQUAL(p.to_string(), \\\"264344457812803264146768626852218676562500\\\");\\n\\n\\n\\n mpz_nombre q = 42ul * m;\\n\\n BOOST_CHECK_EQUAL(q.to_string(), \\\"950568048150\\\");\\n\\n\\n\\n mpz_nombre r = n * 666ul;\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 20,\n \"score\": 88797.80594006865\n },\n {\n \"content\": \" BOOST_CHECK_CLOSE(q, 950568048150, EPSILON);\\n\\n\\n\\n mpf_nombre r = n * 666ul;\\n\\n BOOST_CHECK_CLOSE(r, 7.77876259183e+33, EPSILON);\\n\\n\\n\\n r *= 4;\\n\\n BOOST_CHECK_CLOSE(r, 3.11150503673e+34, EPSILON);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_division) {\\n\\n mpf_nombre n(228017639LL);\\n\\n mpf_nombre m(275LL);\\n\\n n /= m;\\n\\n\\n\\n BOOST_CHECK_CLOSE(n, 829155.050909, EPSILON);\\n\\n\\n\\n n /= 100;\\n\\n BOOST_CHECK_CLOSE(n, 8291.55050909, EPSILON);\\n\\n\\n\\n n /= m;\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 21,\n \"score\": 88797.68959594057\n },\n {\n \"content\": \" n.set(\\\"228017634890\\\", 10);\\n\\n BOOST_CHECK_EQUAL(n, 228017634890);\\n\\n\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_swap) {\\n\\n mpz_nombre n(228017634890);\\n\\n mpz_nombre m(-22632576532575);\\n\\n std::swap(n, m);\\n\\n BOOST_CHECK_EQUAL(m, 228017634890);\\n\\n BOOST_CHECK_EQUAL(n, -22632576532575);\\n\\n\\n\\n n.swap(m);\\n\\n BOOST_CHECK_EQUAL(m, -22632576532575);\\n\\n BOOST_CHECK_EQUAL(n, 228017634890);\\n\\n\\n\\n std::vector<mpz_nombre> v;\\n\\n for (size_t k = 0; k <= 12; ++k) {\\n\\n v.push_back(mpz_nombre::catalan(k));\\n\\n }\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 22,\n \"score\": 88797.67140161151\n },\n {\n \"content\": \"\\n\\n n.set(\\\"228017634890\\\", 10);\\n\\n BOOST_CHECK_CLOSE(n, 228017634890, EPSILON);\\n\\n\\n\\n mpf_nombre m(-22632576532575);\\n\\n std::swap(n, m);\\n\\n BOOST_CHECK_CLOSE(m, 228017634890, EPSILON);\\n\\n BOOST_CHECK_CLOSE(n, -2.26325765326e+13, EPSILON);\\n\\n\\n\\n n.swap(m);\\n\\n BOOST_CHECK_CLOSE(m, -2.26325765326e+13, EPSILON);\\n\\n BOOST_CHECK_CLOSE(n, 228017634890, EPSILON);\\n\\n }\\n\\n\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_addition) {\\n\\n mpf_nombre n(228017634.89);\\n\\n mpf_nombre m(2263257.6532575l);\\n\\n n += m;\\n\\n\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 23,\n \"score\": 88797.60456192138\n },\n {\n \"content\": \" mpz_nombre m;\\n\\n mpz_nombre::racine_carre(m, n);\\n\\n BOOST_CHECK_EQUAL(m, 7962624);\\n\\n BOOST_CHECK_EQUAL(mpz_nombre::carre_parfait(m), false);\\n\\n\\n\\n mpz_nombre p;\\n\\n mpz_nombre::racine(p, n, 10);\\n\\n BOOST_CHECK_EQUAL(p, 24);\\n\\n\\n\\n mpz_nombre q = std::sqrt(n);\\n\\n BOOST_CHECK_EQUAL(q, 7962624);\\n\\n\\n\\n mpz_nombre r = std::cbrt(n);\\n\\n BOOST_CHECK_EQUAL(r, 39875);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_premier_1) {\\n\\n mpz_nombre n(22801763489);\\n\\n BOOST_CHECK(mpz_nombre::premier(n));\\n\\n\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 24,\n \"score\": 88797.4583674693\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(m, -22632576532575);\\n\\n\\n\\n m.negation();\\n\\n BOOST_CHECK_EQUAL(m, 22632576532575);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_comparaison) {\\n\\n mpz_nombre n(25413164);\\n\\n mpz_nombre m(22632576532575);\\n\\n\\n\\n BOOST_CHECK(n == 25413164);\\n\\n BOOST_CHECK(n != 2543164);\\n\\n BOOST_CHECK(n > 25164);\\n\\n BOOST_CHECK(n >= 25413164);\\n\\n BOOST_CHECK(n >= 2543164);\\n\\n BOOST_CHECK(n <= 25413164);\\n\\n BOOST_CHECK(!(n <= 2543164));\\n\\n BOOST_CHECK(n < 213421164);\\n\\n BOOST_CHECK(!(n == m));\\n\\n BOOST_CHECK(n < m);\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 25,\n \"score\": 88797.00176491172\n },\n {\n \"content\": \" n *= 10;\\n\\n BOOST_CHECK(!mpz_nombre::premier(n));\\n\\n\\n\\n mpz_nombre m;\\n\\n mpz_nombre::premier_suivant(m, n);\\n\\n BOOST_CHECK_EQUAL(m, 228017634893);\\n\\n BOOST_CHECK(mpz_nombre::premier(m));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_premier_2) {\\n\\n mpz_nombre n(\\\"32416189721\\\");\\n\\n BOOST_CHECK(mpz_nombre::premier(n, 25));\\n\\n BOOST_CHECK(n.premier());\\n\\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(n + 44, 25));\\n\\n\\n\\n mpz_nombre m(\\\"2305843009213693951\\\");\\n\\n BOOST_CHECK(mpz_nombre::premier(m, 25));\\n\\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(m + 44, 25));\\n\\n\\n\\n BOOST_CHECK_EQUAL(false, mpz_nombre::premier(n * m, 25));\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 26,\n \"score\": 88796.97900235327\n },\n {\n \"content\": \" BOOST_CHECK_CLOSE(n, 30.1510927603, EPSILON);\\n\\n\\n\\n n.set(2280176);\\n\\n mpf_nombre p = n / m;\\n\\n BOOST_CHECK_CLOSE(p, 8291.54909091, EPSILON);\\n\\n\\n\\n mpf_nombre q = 42000000000000ul / m;\\n\\n BOOST_CHECK_CLOSE(q, 152727272727, EPSILON);\\n\\n\\n\\n mpf_nombre r = n / 666ul;\\n\\n BOOST_CHECK_CLOSE(r, 3423.68768769, EPSILON);\\n\\n\\n\\n r /= 4;\\n\\n BOOST_CHECK_CLOSE(r, 855.921921922, EPSILON);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_constant) {\\n\\n BOOST_CHECK_CLOSE(mpf_nombre::pi(), M_PIl, EPSILON);\\n\\n BOOST_CHECK_CLOSE(mpf_nombre::e(), M_El, EPSILON);\\n\\n }\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 27,\n \"score\": 88796.90895996627\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(n5.to_string(), \\\"22801763489\\\");\\n\\n BOOST_CHECK_EQUAL(n7, 22801763489);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_assignation) {\\n\\n mpz_nombre n;\\n\\n BOOST_CHECK_EQUAL(n, 0);\\n\\n\\n\\n n.set(42);\\n\\n BOOST_CHECK_EQUAL(n.to_string(2), \\\"101010\\\");\\n\\n\\n\\n n.set(-666);\\n\\n BOOST_CHECK_EQUAL(n.to_string(6), \\\"-3030\\\");\\n\\n\\n\\n n.set(3.14158);\\n\\n BOOST_CHECK_EQUAL(n.to_string(), \\\"3\\\");\\n\\n\\n\\n n.set(-22801763489LL);\\n\\n BOOST_CHECK_EQUAL(n, -22801763489);\\n\\n\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 28,\n \"score\": 88795.68033054602\n },\n {\n \"content\": \" BOOST_CHECK_CLOSE(n.get_long_double(), 230280892.543257474899, EPSILON);\\n\\n\\n\\n n += 100;\\n\\n BOOST_CHECK_CLOSE(n.get_long_double(), 230280992.543257474899, EPSILON);\\n\\n\\n\\n n += m;\\n\\n BOOST_CHECK_CLOSE(n.get_long_double(), 232544250.196514964104, EPSILON);\\n\\n\\n\\n mpf_nombre p = n + m;\\n\\n BOOST_CHECK_CLOSE(p.get_long_double(), 234807507.849772464018, EPSILON);\\n\\n\\n\\n mpf_nombre q = 42ul + m;\\n\\n BOOST_CHECK_CLOSE(q.get_long_double(), 2263299.65325749991462, EPSILON);\\n\\n\\n\\n mpf_nombre r = n + 666ul;\\n\\n BOOST_CHECK_CLOSE(r.get_long_double(), 232544916.196514964104, EPSILON);\\n\\n\\n\\n r += 400000000000000ull;\\n\\n BOOST_CHECK_CLOSE(r.get_long_double(), 400000232544916.196503, EPSILON);\\n\\n }\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 29,\n \"score\": 88794.4205540843\n },\n {\n \"content\": \"\\n\\n n -= 100;\\n\\n BOOST_CHECK_EQUAL(n, -22609774769186);\\n\\n\\n\\n n -= m;\\n\\n BOOST_CHECK_EQUAL(n, -45242351301761);\\n\\n\\n\\n mpz_nombre p = n - m;\\n\\n BOOST_CHECK_EQUAL(p, -67874927834336);\\n\\n\\n\\n mpz_nombre q = 42ul - m;\\n\\n BOOST_CHECK_EQUAL(q, -22632576532533);\\n\\n\\n\\n mpz_nombre r = n - 666ul;\\n\\n BOOST_CHECK_EQUAL(r, -45242351302427);\\n\\n\\n\\n r -= 400000000000000ull;\\n\\n BOOST_CHECK_EQUAL(r, -445242351302427);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 30,\n \"score\": 88789.10032835625\n },\n {\n \"content\": \"\\n\\n BOOST_CHECK_EQUAL(n, 829155);\\n\\n\\n\\n n /= 100;\\n\\n BOOST_CHECK_EQUAL(n, 8291);\\n\\n\\n\\n n /= m;\\n\\n BOOST_CHECK_EQUAL(n, 30);\\n\\n\\n\\n n.set(2280176);\\n\\n mpz_nombre p = n / m;\\n\\n BOOST_CHECK_EQUAL(p, 8291);\\n\\n\\n\\n mpz_nombre q = 42000000000000ul / m;\\n\\n BOOST_CHECK_EQUAL(q, 152727272727);\\n\\n\\n\\n mpz_nombre r = n / 666ul;\\n\\n BOOST_CHECK_EQUAL(r, 3423);\\n\\n\\n\\n r /= 4;\\n\",\n \"file_path\": \"tests/mpz_nombre.cpp\",\n \"rank\": 31,\n \"score\": 88789.10032835625\n },\n {\n \"content\": \"\\n\\n BOOST_CHECK_CLOSE(n, -22609774769086, EPSILON);\\n\\n\\n\\n n -= 100;\\n\\n BOOST_CHECK_CLOSE(n, -22609774769186, EPSILON);\\n\\n\\n\\n n -= m;\\n\\n BOOST_CHECK_CLOSE(n, -45242351301761, EPSILON);\\n\\n\\n\\n mpf_nombre p = n - m;\\n\\n BOOST_CHECK_CLOSE(p, -67874927834336, EPSILON);\\n\\n\\n\\n mpf_nombre q = 42ul - m;\\n\\n BOOST_CHECK_CLOSE(q, -22632576532533, EPSILON);\\n\\n\\n\\n mpf_nombre r = n - 666ul;\\n\\n BOOST_CHECK_CLOSE(r, -45242351302427, EPSILON);\\n\\n\\n\\n r -= 400000000000000ull;\\n\\n BOOST_CHECK_CLOSE(r, -445242351302427, EPSILON);\\n\",\n \"file_path\": \"tests/mpf_nombre.cpp\",\n \"rank\": 32,\n \"score\": 88788.87672248048\n },\n {\n \"content\": \" class Allocator = std::allocator<std::pair<const Key, T> >\\n\\n >\\n\\n std::ostream &operator<<(std::ostream &os, const std::map<Key, T, Compare, Allocator> &s) {\\n\\n os << \\\"{\\\" << std::endl;\\n\\n for (const auto &p: s) {\\n\\n os << \\\" \\\" << p.first << \\\" => \\\" << p.second << std::endl;\\n\\n }\\n\\n os << \\\"}\\\" << std::endl;\\n\\n return os;\\n\\n }\\n\\n\\n\\n template<class Iterator>\\n\\n constexpr Iterator next(Iterator it, size_t n) {\\n\\n advance(it, static_cast<typename std::iterator_traits<Iterator>::difference_type>(n));\\n\\n return it;\\n\\n }\\n\\n\\n\\n template<typename T>\\n\\n constexpr ostream &operator<<(ostream &os, std::optional<T> s) {\\n\\n if (s)\\n\",\n \"file_path\": \"maths/utilitaires.h\",\n \"rank\": 33,\n \"score\": 87934.14129070735\n },\n {\n \"content\": \" class Iterateur : public boost::iterator_facade<Iterateur, const T, boost::forward_traversal_tag> {\\n\\n T _source;\\n\\n size_t _index;\\n\\n public:\\n\\n Iterateur(T &s, size_t index) : _source(s), _index(index) {}\\n\\n\\n\\n // What we implement is determined by the boost::forward_traversal_tag\\n\\n // template parameter\\n\\n private:\\n\\n friend class boost::iterator_core_access;\\n\\n\\n\\n friend class MyContainer;\\n\\n\\n\\n void increment() {\\n\\n if (_index == std::string::npos) {\\n\\n return;\\n\\n }\\n\\n\\n\\n if (std::next_permutation(_source.begin(), _source.end())) {\\n\\n ++_index;\\n\",\n \"file_path\": \"maths/permutation.h\",\n \"rank\": 34,\n \"score\": 70153.9508762877\n },\n {\n \"content\": \" class Iterateur : public boost::iterator_facade<Iterateur, const std::vector<T>, boost::forward_traversal_tag> {\\n\\n const std::vector<T> &_source;\\n\\n size_t _taille;\\n\\n size_t _index;\\n\\n\\n\\n std::vector<bool> _indices;\\n\\n std::vector<T> _courant;\\n\\n public:\\n\\n Iterateur(const std::vector<T> &s, size_t t, size_t index) : _source(s), _taille(t), _index(index) {\\n\\n size_t n = utilitaires::distance(_source.begin(), _source.end());\\n\\n _indices.assign(n, false);\\n\\n for (size_t i = 0; i < t; ++i) {\\n\\n _indices[i] = true;\\n\\n }\\n\\n\\n\\n _courant.assign(_source.begin(), std::next(_source.begin(), _taille));\\n\\n }\\n\\n\\n\\n private:\\n\\n friend class boost::iterator_core_access;\\n\",\n \"file_path\": \"maths/permutation.h\",\n \"rank\": 35,\n \"score\": 65532.20200113826\n },\n {\n \"content\": \"class mpf_nombre {\\n\\n mpfr_ptr _data;\\n\\n\\n\\n static long DEFAULT_PRECISION;\\n\\n static mpfr_rnd_t DEFAULT_ROUNDING;\\n\\n static mpf_nombre PI;\\n\\n static mpf_nombre E;\\n\\n static mpf_nombre PHI;\\n\\n\\n\\n static mpf_nombre calcul_pi();\\n\\n\\n\\n static mpf_nombre calcul_e();\\n\\n\\n\\n static mpf_nombre calcul_phi();\\n\\n\\n\\n void init();\\n\\n\\n\\n void clear();\\n\\n\\n\\n template<typename Type>\\n\",\n \"file_path\": \"maths/mpf_nombre.h\",\n \"rank\": 36,\n \"score\": 53888.069543220445\n },\n {\n \"content\": \"class mpz_nombre {\\n\\n mpz_ptr _data;\\n\\n\\n\\n void init();\\n\\n\\n\\n void clear();\\n\\n\\n\\npublic:\\n\\n // region Constructors\\n\\n mpz_nombre();\\n\\n\\n\\n ~mpz_nombre();\\n\\n\\n\\n mpz_nombre(mpz_srcptr op);\\n\\n\\n\\n mpz_nombre(const mpz_nombre &op);\\n\\n\\n\\n mpz_nombre(mpz_nombre &&op);\\n\\n\\n\\n mpz_nombre(unsigned int op);\\n\",\n \"file_path\": \"maths/mpz_nombre.h\",\n \"rank\": 37,\n \"score\": 53888.069543220445\n },\n {\n \"content\": \"class nombre_modulaire {\\n\\n template<typename Type>\\n\\n void set(Type op, std::false_type /*is_signed*/) {\\n\\n _value = op % _modulo;\\n\\n }\\n\\n\\n\\n template<typename Type>\\n\\n void set(Type op, std::true_type /*is_signed*/) {\\n\\n bool negatif = (op < 0);\\n\\n op = std::abs(op);\\n\\n _value = static_cast<size_t>(op) % _modulo;\\n\\n if (negatif) {\\n\\n _value = _modulo - _value;\\n\\n }\\n\\n }\\n\\n\\n\\n static std::pair<size_t, nombre_modulaire> factoriel2(size_t modulo, size_t n);\\n\\n\\n\\n static void meme_mod(const nombre_modulaire &n1, const nombre_modulaire &n2);\\n\\n\\n\",\n \"file_path\": \"maths/nombre_modulaire.h\",\n \"rank\": 38,\n \"score\": 53888.069543220445\n },\n {\n \"content\": \"class multidimension : public std::vector<multidimension<T, N - 1>> {\\n\\npublic:\\n\\n typedef typename std::vector<multidimension<T, N - 1>> super_type;\\n\\n typedef typename super_type::size_type size_type;\\n\\n typedef typename super_type::value_type value_type;\\n\\n\\n\\n explicit multidimension() = default;\\n\\n\\n\\n explicit multidimension(size_type count, const value_type &value) : super_type(count, value) {}\\n\\n\\n\\n explicit multidimension(size_type count) : super_type(count) {}\\n\\n\\n\\n template<typename... Args>\\n\\n multidimension(size_type count, Args... args) : super_type(count, value_type(args...)) {}\\n\\n\\n\\n multidimension(std::initializer_list<value_type> init) : super_type(init) {}\\n\\n};\\n\\n\\n\\ntemplate<typename T>\\n\",\n \"file_path\": \"maths/multidimension.h\",\n \"rank\": 39,\n \"score\": 53719.83847099128\n },\n {\n \"content\": \"#define BOOST_TEST_DYN_LINK\\n\\n#define BOOST_TEST_MODULE Project Euler\\n\\n\\n\\n#include <boost/test/included/unit_test.hpp>\\n\",\n \"file_path\": \"test.cpp\",\n \"rank\": 40,\n \"score\": 48765.38157680607\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n#include <numeric>\\n\\n\\n\\n#include \\\"fenwick.h\\\"\\n\\n#include \\\"utilitaires.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_fenwick)\\n\\n\\n\\n // BOOST_AUTO_TEST_CASE(test_fenwick, random_fenwick) {\\n\\n // // Number of elements in the array\\n\\n // const unsigned long N = 4 * 1024 * 1024; // Elements in the array\\n\\n // const unsigned long COUNTS = 1'024; // Size of values stored\\n\\n // typedef unsigned long sum_t; // Should be able to hold N * (COUNTS - 1)\\n\\n\\n\\n // // Number of queries to perform\\n\\n // const size_t NQUERIES = 100;\\n\\n\\n\\n // std::vector<std::pair<unsigned long, unsigned long>> queries;\\n\\n // queries.reserve(NQUERIES);\\n\\n // unsigned int seed = 329629153ul;\\n\",\n \"file_path\": \"tests/fenwick.cpp\",\n \"rank\": 41,\n \"score\": 46550.71991776213\n },\n {\n \"content\": \"\\n\\n BOOST_AUTO_TEST_CASE(pell_bf3) {\\n\\n auto resultat = diophantienne::pell_bf<long long>(13, 27, 1000);\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(12, 3),\\n\\n std::make_pair(40, 11),\\n\\n std::make_pair(220, 61),\\n\\n std::make_pair(768, 213)\\n\\n };\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(quad_s) {\\n\\n auto resultat = diophantienne::quad_s<long long>(8, 9, 72, 1000);\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(3, 0),\\n\\n std::make_pair(9, 8),\\n\\n std::make_pair(51, 48),\\n\\n std::make_pair(297, 280)\\n\\n };\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 42,\n \"score\": 46544.72728743305\n },\n {\n \"content\": \" };\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell_funds_bf3) {\\n\\n auto resultat = diophantienne::pell_funds_bf<long long>(13, 27);\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(12, 3),\\n\\n std::make_pair(-12, 3),\\n\\n std::make_pair(40, 11),\\n\\n std::make_pair(-40, 11)\\n\\n };\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell_bf1) {\\n\\n auto resultat = diophantienne::pell_bf<long long>(13, 108, 1000);\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(11, 1),\\n\\n std::make_pair(15, 3),\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 43,\n \"score\": 46544.376683606046\n },\n {\n \"content\": \"\\n\\n BOOST_AUTO_TEST_CASE(pell4_1) {\\n\\n std::vector<std::pair<long long, long long>> resultat;\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(649, 180),\\n\\n std::make_pair(421200, 116820)\\n\\n };\\n\\n auto callback = [&resultat, &solution](long long x, long long y) {\\n\\n resultat.push_back(std::make_pair(x, y));\\n\\n return resultat.size() != solution.size();\\n\\n };\\n\\n\\n\\n diophantienne::pell4<long long>(13, 1, callback);\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell4_2) {\\n\\n std::vector<std::pair<long long, long long>> resultat;\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(18, 5),\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 44,\n \"score\": 46543.91056469341\n },\n {\n \"content\": \" BOOST_AUTO_TEST_CASE(pell1_min) {\\n\\n BOOST_CHECK_EQUAL(diophantienne::pell1_min(13, 1), std::make_pair(649, 180));\\n\\n BOOST_CHECK_EQUAL(diophantienne::pell1_min(13, -1), std::make_pair(18, 5));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell4_min) {\\n\\n BOOST_CHECK_EQUAL(diophantienne::pell4_min(13, 1), std::make_pair(11, 3));\\n\\n BOOST_CHECK_EQUAL(diophantienne::pell4_min(13, -1), std::make_pair(3, 1));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell1_1) {\\n\\n std::vector<std::pair<long long, long long>> resultat;\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(649, 180),\\n\\n std::make_pair(842401, 233640)\\n\\n };\\n\\n auto callback = [&resultat, &solution](long long x, long long y) {\\n\\n resultat.push_back(std::make_pair(x, y));\\n\\n return resultat.size() != solution.size();\\n\\n };\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 45,\n \"score\": 46543.51526854622\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n#include \\\"racine.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_racine)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_racine) {\\n\\n BOOST_CHECK_EQUAL(racine::racine_carre<unsigned long long>(123456789ULL), 11111ULL);\\n\\n BOOST_CHECK_EQUAL(racine::racine_carre<unsigned long long>(1234567890987654321ULL), 1111111106ULL);\\n\\n BOOST_CHECK_EQUAL(racine::racine_carre<unsigned long long>(15241578750190521ULL), 123456789ULL);\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/racine.cpp\",\n \"rank\": 46,\n \"score\": 46543.49932960564\n },\n {\n \"content\": \" std::make_pair(5841, 1620),\\n\\n std::make_pair(1895386, 525685)\\n\\n };\\n\\n auto callback = [&resultat, &solution](long long x, long long y) {\\n\\n resultat.push_back(std::make_pair(x, y));\\n\\n return resultat.size() != solution.size();\\n\\n };\\n\\n\\n\\n diophantienne::pell4<long long>(13, -1, callback);\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell_funds_bf1) {\\n\\n auto resultat = diophantienne::pell_funds_bf<long long>(13, 108);\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(11, 1),\\n\\n std::make_pair(-11, 1),\\n\\n std::make_pair(15, 3),\\n\\n std::make_pair(-15, 3),\\n\\n std::make_pair(24, 6),\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 47,\n \"score\": 46543.114613402315\n },\n {\n \"content\": \" std::make_pair(24, 6),\\n\\n std::make_pair(41, 11),\\n\\n std::make_pair(80, 22),\\n\\n std::make_pair(141, 39),\\n\\n std::make_pair(249, 69),\\n\\n std::make_pair(440, 122),\\n\\n std::make_pair(869, 241)\\n\\n };\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell_bf2) {\\n\\n auto resultat = diophantienne::pell_bf<long long>(157, 12, 100000000);\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(13, 1),\\n\\n std::make_pair(10663, 851),\\n\\n std::make_pair(579160, 46222)\\n\\n };\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 48,\n \"score\": 46542.612914435675\n },\n {\n \"content\": \" std::make_pair(-24, 6),\\n\\n std::make_pair(41, 11),\\n\\n std::make_pair(-41, 11),\\n\\n std::make_pair(80, 22),\\n\\n std::make_pair(-80, 22),\\n\\n std::make_pair(141, 39),\\n\\n std::make_pair(-141, 39)\\n\\n };\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell_funds_bf2) {\\n\\n auto resultat = diophantienne::pell_funds_bf<long long>(157, 12);\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(13, 1),\\n\\n std::make_pair(-13, 1),\\n\\n std::make_pair(10663, 851),\\n\\n std::make_pair(-10663, 851),\\n\\n std::make_pair(579160, 46222),\\n\\n std::make_pair(-579160, 46222)\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 49,\n \"score\": 46542.217133608334\n },\n {\n \"content\": \"\\n\\n diophantienne::pell1<long long>(13, 1, callback);\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pell1_2) {\\n\\n std::vector<std::pair<long long, long long>> resultat;\\n\\n std::vector<std::pair<long long, long long>> solution{\\n\\n std::make_pair(18, 5),\\n\\n std::make_pair(23382, 6485),\\n\\n std::make_pair(30349818, 8417525)\\n\\n };\\n\\n auto callback = [&resultat, &solution](long long x, long long y) {\\n\\n resultat.push_back(std::make_pair(x, y));\\n\\n return resultat.size() != solution.size();\\n\\n };\\n\\n\\n\\n diophantienne::pell1<long long>(13, -1, callback);\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 50,\n \"score\": 46542.17693522152\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n#include \\\"puissance.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_puissance)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_puissance_modulaire) {\\n\\n BOOST_CHECK_EQUAL(puissance::puissance_modulaire(2u, 10u, 100u), 24u);\\n\\n BOOST_CHECK_EQUAL(puissance::puissance_modulaire<unsigned long long>(97643u, 276799u, 456753u), 368123u);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(test_puissance) {\\n\\n BOOST_CHECK_EQUAL(puissance::puissance(2u, 10u), 1024u);\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/puissance.cpp\",\n \"rank\": 51,\n \"score\": 46541.31161763762\n },\n {\n \"content\": \" typedef boost::rational<long long> fraction;\\n\\n\\n\\n matrice::matrice<fraction> A(3, 3);\\n\\n A <<= 1, -1, 2,\\n\\n 3, 2, 1,\\n\\n 2, -3, -2;\\n\\n\\n\\n matrice::vecteur<fraction> b(3);\\n\\n b <<= 5, 10, -10;\\n\\n\\n\\n matrice::vecteur<fraction> resultat(3);\\n\\n resultat <<= 1, 2, 3;\\n\\n\\n\\n matrice::vecteur<fraction> x(3);\\n\\n bool solution = matrice::resolutionLU(A, b, x);\\n\\n\\n\\n BOOST_CHECK_EQUAL(solution, true);\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(x.data().begin(), x.data().end(),\\n\\n resultat.data().begin(), resultat.data().end());\\n\\n\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 52,\n \"score\": 46539.39716599698\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"polynome.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_polynome)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(initialization_1) {\\n\\n Polynome<long long> p(10);\\n\\n BOOST_CHECK_EQUAL(p.taille(), 1);\\n\\n BOOST_CHECK_EQUAL(p.valeur(42), 10);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(initialization_2) {\\n\\n Polynome<long long> p{-1, 0, 1};\\n\\n BOOST_CHECK_EQUAL(p.taille(), 3);\\n\\n BOOST_CHECK_EQUAL(p.valeur(2), 3);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(comparaison) {\\n\\n Polynome<long long> p{-1, 0, 1};\\n\",\n \"file_path\": \"tests/polynome.cpp\",\n \"rank\": 53,\n \"score\": 46539.17313086763\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n#include \\\"matrice.h\\\"\\n\\n\\n\\n#include <boost/numeric/ublas/assignment.hpp>\\n\\n#include <boost/rational.hpp>\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_matrice)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(puissance) {\\n\\n matrice::matrice<long long> A(2, 2);\\n\\n A <<= 1, 1,\\n\\n 1, 0;\\n\\n\\n\\n auto F = matrice::puissance_matrice(A, 40);\\n\\n\\n\\n const std::vector<long long> resultat{165580141, 102334155,\\n\\n 102334155, 63245986};\\n\\n\\n\\n BOOST_CHECK_EQUAL(F.size1(), 2);\\n\\n BOOST_CHECK_EQUAL(F.size2(), 2);\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 54,\n \"score\": 46539.07430411768\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"combinatoire.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_combinatoire)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(coefficient_binomial) {\\n\\n BOOST_CHECK_EQUAL(35, combinatoire::coefficient_binomial(7, 3));\\n\\n BOOST_CHECK_EQUAL(70, combinatoire::coefficient_binomial(8, 4));\\n\\n BOOST_CHECK_EQUAL(1, combinatoire::coefficient_binomial(40, 0));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(catalan) {\\n\\n BOOST_CHECK_EQUAL(1, combinatoire::catalan(0));\\n\\n BOOST_CHECK_EQUAL(1, combinatoire::catalan(1));\\n\\n BOOST_CHECK_EQUAL(16796, combinatoire::catalan<unsigned long long>(10));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(factorielle) {\\n\\n BOOST_CHECK_EQUAL(120, combinatoire::factorielle(5));\\n\\n BOOST_CHECK_EQUAL(720, combinatoire::factorielle(6));\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/combinatoire.cpp\",\n \"rank\": 55,\n \"score\": 46538.91689791148\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"multidimension.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_multidimension)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(multidimension_2) {\\n\\n multidimension<short, 2> matrice{\\n\\n {7, 53, 183, 439, 863, 497, 383, 563, 79, 973, 287, 63, 343, 169, 583},\\n\\n {627, 343, 773, 959, 943, 767, 473, 103, 699, 303, 957, 703, 583, 639, 913},\\n\\n {447, 283, 463, 29, 23, 487, 463, 993, 119, 883, 327, 493, 423, 159, 743},\\n\\n {217, 623, 3, 399, 853, 407, 103, 983, 89, 463, 290, 516, 212, 462, 350},\\n\\n {960, 376, 682, 962, 300, 780, 486, 502, 912, 800, 250, 346, 172, 812, 350},\\n\\n {870, 456, 192, 162, 593, 473, 915, 45, 989, 873, 823, 965, 425, 329, 803},\\n\\n {973, 965, 905, 919, 133, 673, 665, 235, 509, 613, 673, 815, 165, 992, 326},\\n\\n {322, 148, 972, 962, 286, 255, 941, 541, 265, 323, 925, 281, 601, 95, 973},\\n\\n {445, 721, 11, 525, 473, 65, 511, 164, 138, 672, 18, 428, 154, 448, 848},\\n\\n {414, 456, 310, 312, 798, 104, 566, 520, 302, 248, 694, 976, 430, 392, 198},\\n\\n {184, 829, 373, 181, 631, 101, 969, 613, 840, 740, 778, 458, 284, 760, 390},\\n\\n {821, 461, 843, 513, 17, 901, 711, 993, 293, 157, 274, 94, 192, 156, 574},\\n\",\n \"file_path\": \"tests/multidimension.cpp\",\n \"rank\": 56,\n \"score\": 46538.721444204944\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"diophantienne.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_diophantienne)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pqa1) {\\n\\n auto resultat = diophantienne::PQa(11, 108, 13);\\n\\n std::vector<long long> fractions{0, 7, 2, 1, 1, 6, 1, 1};\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.first.begin(), resultat.first.end(), fractions.begin(), fractions.end());\\n\\n BOOST_CHECK_EQUAL(resultat.second, 5);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pqa2) {\\n\\n auto resultat = diophantienne::PQa(0, 1, 13);\\n\\n std::vector<long long> fractions{3, 1, 1, 1, 1, 6};\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.first.begin(), resultat.first.end(), fractions.begin(), fractions.end());\\n\\n BOOST_CHECK_EQUAL(resultat.second, 5);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 57,\n \"score\": 46537.24636975284\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"chiffres.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_chiffres)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(nombre_chiffres) {\\n\\n BOOST_CHECK_EQUAL(9, chiffres::nombre_chiffres(123456789ULL));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(somme_chiffres) {\\n\\n BOOST_CHECK_EQUAL(45, chiffres::somme_chiffres(123456789ULL));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(extraire_chiffres) {\\n\\n auto c = chiffres::extraire_chiffres(123456789ULL);\\n\\n std::deque<size_t> r{1, 2, 3, 4, 5, 6, 7, 8, 9};\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(c.begin(), c.end(), r.begin(), r.end());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/chiffres.cpp\",\n \"rank\": 58,\n \"score\": 46537.10570263723\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(), solution.begin(), solution.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(iterateur_diophantienne1) {\\n\\n // 10x + 84y + 16 = 0\\n\\n long long int A = 10, B = 84, C = 16;\\n\\n size_t compteur = 0;\\n\\n for (auto s : diophantienne::equation_lineaire(A, B, C)) {\\n\\n ++compteur;\\n\\n if (compteur > 10) {\\n\\n break;\\n\\n }\\n\\n BOOST_CHECK_EQUAL(A * s.first + B * s.second + C, 0);\\n\\n }\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(iterateur_diophantienne2) {\\n\\n // 10x + 84y - 16 = 0\\n\\n long long int A = 10, B = 84, C = -16;\\n\\n size_t compteur = 0;\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 59,\n \"score\": 46536.95725893468\n },\n {\n \"content\": \" BOOST_AUTO_TEST_CASE(palindrome) {\\n\\n BOOST_CHECK_EQUAL(false, chiffres::palindrome(123456789ULL));\\n\\n BOOST_CHECK_EQUAL(true, chiffres::palindrome(123454321ULL));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pandigital) {\\n\\n BOOST_CHECK_EQUAL(true, chiffres::pandigital(123456789ULL));\\n\\n BOOST_CHECK_EQUAL(false, chiffres::pandigital(1234567890ULL));\\n\\n BOOST_CHECK_EQUAL(false, chiffres::pandigital(123454321ULL));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(conversion_nombre) {\\n\\n std::deque<size_t> c{1, 2, 3, 4, 5, 6, 7, 8, 9};\\n\\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::conversion_nombre<size_t>(c.begin(), c.end()));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(permutation_chiffres) {\\n\\n BOOST_CHECK_EQUAL(true, chiffres::permutation_chiffres(123456789ULL, 918273645ULL));\\n\\n BOOST_CHECK_EQUAL(true, chiffres::permutation_chiffres(123ULL, 1234ULL));\\n\\n }\\n\",\n \"file_path\": \"tests/chiffres.cpp\",\n \"rank\": 60,\n \"score\": 46535.62930457869\n },\n {\n \"content\": \" std::vector<bool> crible(taille, true);\\n\\n std::vector<size_t> phi(taille, 0);\\n\\n\\n\\n std::iota(phi.begin(), phi.end(), 0ul);\\n\\n for (size_t i = 2; i < taille; ++i) {\\n\\n if (crible[i]) {\\n\\n for (size_t j = i; j < taille; j += i) {\\n\\n crible[j] = false;\\n\\n phi[j] /= i;\\n\\n phi[j] *= i - 1;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // std::cout << phi << std::endl;\\n\\n Fenwick<long long> fenwick(taille);\\n\\n std::vector<long long> f(taille, 0);\\n\\n for (size_t n = taille - 1; n > 5; --n) {\\n\\n size_t k = phi[n];\\n\\n f[n] = 1 + fenwick.range(k, n - 1);\\n\\n fenwick.add(k, f[n]);\\n\\n }\\n\\n\\n\\n BOOST_CHECK_EQUAL(482073668, f[6]);\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/fenwick.cpp\",\n \"rank\": 61,\n \"score\": 46535.46199377989\n },\n {\n \"content\": \"\\n\\n // // generate the bounds for all of the queries\\n\\n // srandom(seed + 1);\\n\\n // for (unsigned int i = 0; i < NQUERIES; ++i) {\\n\\n // unsigned long a = static_cast<unsigned long>(random()) % N;\\n\\n // unsigned long b = static_cast<unsigned long>(random()) % N;\\n\\n\\n\\n // if (a > b) {\\n\\n // std::swap(a, b);\\n\\n // }\\n\\n\\n\\n // queries.emplace_back(a, b);\\n\\n // }\\n\\n\\n\\n // /*****************************************************************/\\n\\n // /* FLAT ARRAY METHOD */\\n\\n // /*****************************************************************/\\n\\n // //std::vector<sum_t> array(N, 0);\\n\\n // //\\n\\n // //time1 = clock();\\n\",\n \"file_path\": \"tests/fenwick.cpp\",\n \"rank\": 62,\n \"score\": 46534.519888923554\n },\n {\n \"content\": \" // /*****************************************************************/\\n\\n // // Store the same random numbers in a Fenwick tree\\n\\n // Fenwick<sum_t> fenwick(N);\\n\\n\\n\\n // srandom(seed);\\n\\n // for (unsigned int i = 0; i < N; i++)\\n\\n // fenwick[i] = static_cast<unsigned long>(random()) % COUNTS;\\n\\n\\n\\n // fenwick.initialisation();\\n\\n\\n\\n // // perform the queries\\n\\n // std::vector<sum_t> resultat;\\n\\n // resultat.reserve(NQUERIES);\\n\\n // for (auto &t: queries) {\\n\\n // auto range = fenwick.range(t.first, t.second);\\n\\n // resultat.push_back(range);\\n\\n // }\\n\\n\\n\\n // std::vector<sum_t> objectif{87981345, 1018050452, 37060257, 133931587, 2082302311, 127607876, 499939565,\\n\\n // 778250548, 1356376781, 1678639060, 576926234, 810701986, 1196425448, 118049060,\\n\",\n \"file_path\": \"tests/fenwick.cpp\",\n \"rank\": 63,\n \"score\": 46534.51227885926\n },\n {\n \"content\": \" resultat <<= 35, 39, 17,\\n\\n 70, -32, 4,\\n\\n 105, -18, 11;\\n\\n resultat /= 35;\\n\\n\\n\\n matrice::matrice<fraction> X(3, 3);\\n\\n bool solution = matrice::resolutionLU(A, B, X);\\n\\n\\n\\n BOOST_CHECK_EQUAL(solution, true);\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(X.data().begin(), X.data().end(),\\n\\n resultat.data().begin(), resultat.data().end());\\n\\n\\n\\n matrice::matrice<fraction> produit = boost::numeric::ublas::prod(A, X);\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(produit.data().begin(), produit.data().end(),\\n\\n B.data().begin(), B.data().end());\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 64,\n \"score\": 46534.136631537614\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"utilitaires.h\\\"\\n\\n#include \\\"permutation.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_permutation)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(permutation_simple) {\\n\\n const std::vector<std::vector<int>> resultat{\\n\\n {1, 2, 3},\\n\\n {1, 3, 2},\\n\\n {2, 1, 3},\\n\\n {2, 3, 1},\\n\\n {3, 1, 2},\\n\\n {3, 2, 1}\\n\\n };\\n\\n\\n\\n size_t index = 0;\\n\\n const std::vector<int> v{1, 2, 3};\\n\\n for (auto i: permutation::Permutation<std::vector<int>>(v)) {\\n\",\n \"file_path\": \"tests/permutation.cpp\",\n \"rank\": 65,\n \"score\": 46534.119962839395\n },\n {\n \"content\": \" BOOST_AUTO_TEST_CASE(multiplication) {\\n\\n Polynome<long long> p{1, -1, 1, -1, 1};\\n\\n Polynome<long long> q{1, 1,};\\n\\n Polynome<long long> r{1, 0, 0, 0, 0, 1};\\n\\n BOOST_CHECK_EQUAL(p * q, r);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(affiche_1) {\\n\\n Polynome<long long> p{1, -1, 1, -1, 1};\\n\\n std::ostringstream oss;\\n\\n oss << p;\\n\\n BOOST_CHECK_EQUAL(oss.str(), \\\"X^4 - X^3 + X^2 - X + 1\\\");\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(affiche_2) {\\n\\n Polynome<long long> p{1, 1,};\\n\\n std::ostringstream oss;\\n\\n oss << p;\\n\\n BOOST_CHECK_EQUAL(oss.str(), \\\"X + 1\\\");\\n\\n }\\n\",\n \"file_path\": \"tests/polynome.cpp\",\n \"rank\": 66,\n \"score\": 46533.67152473613\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"numerique.h\\\"\\n\\n#include \\\"combinatoire.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_numerique)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(ostringstream_signed) {\\n\\n auto f = combinatoire::factorielle<int128_t>(30);\\n\\n std::ostringstream oss;\\n\\n oss << f;\\n\\n BOOST_CHECK_EQUAL(\\\"265252859812191058636308480000000\\\", oss.str());\\n\\n\\n\\n int128_t n;\\n\\n std::istringstream iss(oss.str());\\n\\n iss >> n;\\n\\n BOOST_CHECK_EQUAL(n, f);\\n\\n\\n\\n std::ostringstream oss2;\\n\\n oss2 << -f;\\n\",\n \"file_path\": \"tests/numerique.cpp\",\n \"rank\": 67,\n \"score\": 46533.500160173644\n },\n {\n \"content\": \" Polynome<long long> q{-1, 0, 1};\\n\\n Polynome<long long> r{1, 0, 1};\\n\\n BOOST_CHECK_EQUAL(p, q);\\n\\n BOOST_CHECK_NE(p, r);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(addition) {\\n\\n Polynome<long long> p{-1, 0, 1};\\n\\n Polynome<long long> q{0, 1};\\n\\n Polynome<long long> r{-1, 1, 1};\\n\\n BOOST_CHECK_EQUAL(p + q, r);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(soustraction) {\\n\\n Polynome<long long> p{-1, 1, 1};\\n\\n Polynome<long long> q{0, 0, 1};\\n\\n Polynome<long long> r{-1, 1};\\n\\n BOOST_CHECK_EQUAL(p - q, r);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/polynome.cpp\",\n \"rank\": 68,\n \"score\": 46533.19568492871\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n#include <deque>\\n\\n\\n\\n#include \\\"numerique.h\\\"\\n\\n#include \\\"premiers.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_premiers)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(crible) {\\n\\n const std::vector<size_t> premiers100{2, 3, 5, 7, 11, 13, 17, 19, 23,\\n\\n 29, 31, 37, 41, 43, 47, 53, 59,\\n\\n 61, 67, 71, 73, 79, 83, 89, 97};\\n\\n std::deque<size_t> resultat;\\n\\n premiers::crible2<size_t>(100ULL, std::back_inserter(resultat));\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(premiers100.begin(), premiers100.end(), resultat.begin(), resultat.end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(crible23) {\\n\\n std::deque<size_t> resultat;\\n\\n premiers::crible23<size_t>(10000ULL, std::back_inserter(resultat));\\n\",\n \"file_path\": \"tests/premiers.cpp\",\n \"rank\": 69,\n \"score\": 46533.19241091446\n },\n {\n \"content\": \" // //// Store random numbers in a flat array\\n\\n // //srandom(seed);\\n\\n // //for (unsigned long i = 0; i < N; i++)\\n\\n // // array[i] = static_cast<unsigned long>(random()) % COUNTS;\\n\\n // //time2 = clock(); // time2 - time1 = time for setup\\n\\n // //// perform the queries\\n\\n // //for (auto &t: queries) {\\n\\n // // sum_t asum = 0;\\n\\n // // for (unsigned long i = t.first; i < t.second; i++)\\n\\n // // asum += array[i];\\n\\n // // printf(\\\" %lu\\\", asum);\\n\\n // //}\\n\\n // //time3 = clock(); // time3 - time2 = time for queries\\n\\n // //\\n\\n // //printf(\\\"\\\\nFlat Array:\\\\n Build: %f\\\\n Query: %f\\\\n\\\",\\n\\n // // (time2 - time1) * (1.0 / CLOCKS_PER_SEC),\\n\\n // // (time3 - time2) * (1.0 / CLOCKS_PER_SEC));\\n\\n\\n\\n // /*****************************************************************/\\n\\n // /* FENWICK TREE METHOD */\\n\",\n \"file_path\": \"tests/fenwick.cpp\",\n \"rank\": 70,\n \"score\": 46533.13180653553\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"utilitaires.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_utilitaires)\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(affiche_vector) {\\n\\n const std::vector<int> v{1, 1, 2, 3, 5, 8, 13};\\n\\n std::ostringstream oss;\\n\\n oss << v;\\n\\n\\n\\n BOOST_CHECK_EQUAL(\\\"[1 1 2 3 5 8 13]\\\", oss.str());\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(affiche_deque) {\\n\\n const std::deque<int> v{1, 1, 2, 3, 5, 8, 13, 21, 34};\\n\\n std::ostringstream oss;\\n\\n oss << v;\\n\\n\\n\\n BOOST_CHECK_EQUAL(\\\"[1 1 2 3 5 8 13 21 34]\\\", oss.str());\\n\",\n \"file_path\": \"tests/utilitaires.cpp\",\n \"rank\": 71,\n \"score\": 46533.00611129542\n },\n {\n \"content\": \"\\n\\n bool inversible = matrice::inversionLU(A, inverse);\\n\\n\\n\\n BOOST_CHECK_EQUAL(inversible, true);\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.data().begin(), resultat.data().end(),\\n\\n inverse.data().begin(), inverse.data().end());\\n\\n\\n\\n matrice::matrice<fraction> identite(4, 4);\\n\\n identite <<= 1, 0, 0, 0,\\n\\n 0, 1, 0, 0,\\n\\n 0, 0, 1, 0,\\n\\n 0, 0, 0, 1;\\n\\n\\n\\n matrice::matrice<fraction> produit = boost::numeric::ublas::prod(A, inverse);\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(produit.data().begin(), produit.data().end(),\\n\\n identite.data().begin(), identite.data().end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(resolution_vecteur) {\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 72,\n \"score\": 46532.90165867718\n },\n {\n \"content\": \"\\n\\n BOOST_AUTO_TEST_CASE(affiche_3) {\\n\\n Polynome<long long> p{1, 0, 0, 0, 0, 1};\\n\\n std::ostringstream oss;\\n\\n oss << p;\\n\\n BOOST_CHECK_EQUAL(oss.str(), \\\"X^5 + 1\\\");\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(division_euclidienne_1) {\\n\\n Polynome<long long> A{0, -2, 3, -1, -1, 1};\\n\\n Polynome<long long> B{1, -1, 1};\\n\\n\\n\\n\\n\\n Polynome<long long> Q;\\n\\n Polynome<long long> R;\\n\\n Polynome<long long>::division_euclidienne(A, B, Q, R);\\n\\n\\n\\n Polynome<long long> Q1{1, -2, 0, 1};\\n\\n Polynome<long long> R1{-1, 1};\\n\\n\\n\",\n \"file_path\": \"tests/polynome.cpp\",\n \"rank\": 73,\n \"score\": 46532.68968709226\n },\n {\n \"content\": \" }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(combinaisons_simple) {\\n\\n const std::vector<std::vector<int>> resultat{\\n\\n {1, 2, 3},\\n\\n {1, 2, 4},\\n\\n {1, 3, 4},\\n\\n {2, 3, 4}\\n\\n };\\n\\n\\n\\n size_t index = 0;\\n\\n std::vector<int> iterable{1, 2, 3, 4};\\n\\n for (auto i : permutation::Combinaisons<int>(iterable, 3)) {\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\\n\\n resultat[index].begin(), resultat[index].end());\\n\\n ++index;\\n\\n }\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(combinaisons_doublon) {\\n\",\n \"file_path\": \"tests/permutation.cpp\",\n \"rank\": 74,\n \"score\": 46532.453123277926\n },\n {\n \"content\": \" matrice::vecteur<fraction> produit = boost::numeric::ublas::prod(A, x);\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(produit.data().begin(), produit.data().end(),\\n\\n b.data().begin(), b.data().end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(resolution_matrice) {\\n\\n typedef boost::rational<long long> fraction;\\n\\n\\n\\n matrice::matrice<fraction> A(3, 3);\\n\\n A <<= 1, -1, 2,\\n\\n 3, 2, 1,\\n\\n 2, -3, -2;\\n\\n\\n\\n matrice::matrice<fraction> B(3, 3);\\n\\n B <<= 5, 1, 1,\\n\\n 10, 1, 2,\\n\\n -10, 6, 0;\\n\\n\\n\\n matrice::matrice<fraction> resultat(3, 3);\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 75,\n \"score\": 46532.35687528255\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"polygonal.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_polygonal)\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(carre) {\\n\\n BOOST_CHECK_EQUAL(123456ULL, racine::racine_carre(15241383936ULL));\\n\\n BOOST_CHECK(polygonal::est_carre(15241383936ULL));\\n\\n BOOST_CHECK(!polygonal::est_carre(15241383935ULL));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(cubique) {\\n\\n BOOST_CHECK_EQUAL(12345ULL, racine::racine_cubique(1881365963625ULL));\\n\\n BOOST_CHECK(polygonal::est_cubique(1881365963625ULL));\\n\\n BOOST_CHECK(!polygonal::est_cubique(1881365963624ULL));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(triangulaire) {\\n\\n BOOST_CHECK_EQUAL(5050, polygonal::triangulaire(100));\\n\",\n \"file_path\": \"tests/polygonal.cpp\",\n \"rank\": 76,\n \"score\": 46532.302274014146\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(Q, Q1);\\n\\n BOOST_CHECK_EQUAL(R, R1);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(division_euclidienne_2) {\\n\\n Polynome<long long> A{-1, 0, 0, 0, 0, 0, 0, 1};\\n\\n Polynome<long long> B{-1, 1};\\n\\n\\n\\n Polynome<long long> Q;\\n\\n Polynome<long long> R;\\n\\n\\n\\n Polynome<long long>::division_euclidienne(A, B, Q, R);\\n\\n Polynome<long long> Q1{1, 1, 1, 1, 1, 1, 1};\\n\\n Polynome<long long> R1;\\n\\n\\n\\n BOOST_CHECK_EQUAL(Q, Q1);\\n\\n BOOST_CHECK_EQUAL(R, R1);\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/polynome.cpp\",\n \"rank\": 77,\n \"score\": 46532.25274408124\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(v, -88630LL);\\n\\n BOOST_CHECK_EQUAL(a * u + b * v, 1); // PGCD(a, b) = 1\\n\\n }\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(Bezout2, fixure_arithmetiques) {\\n\\n long long u, v;\\n\\n long long a = 456755ULL;\\n\\n long long b = 158665ULL;\\n\\n arithmetique::Bezout(a, b, u, v);\\n\\n\\n\\n BOOST_CHECK_EQUAL(u, 602LL);\\n\\n BOOST_CHECK_EQUAL(v, -1733LL);\\n\\n BOOST_CHECK_EQUAL(a * u + b * v, 65); // PGCD(a, b) = 65\\n\\n }\\n\\n\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(nombre_diviseurs, fixure_arithmetiques) {\\n\\n BOOST_CHECK_EQUAL(arithmetique::nombre_diviseurs(3246999210ULL, premiers), 640);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tests/arithmetique.cpp\",\n \"rank\": 78,\n \"score\": 46531.67442655948\n },\n {\n \"content\": \"\\n\\n BOOST_AUTO_TEST_CASE(inverser_nombre) {\\n\\n BOOST_CHECK_EQUAL(987654321ULL, chiffres::inverser_nombre(123456789ULL));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(concatener) {\\n\\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::concatener(12ULL, 3456789ULL));\\n\\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::concatener(12ULL, 345ULL, 6789ULL));\\n\\n BOOST_CHECK_EQUAL(123456789ULL, chiffres::concatener(12ULL, 34ULL, 567ULL, 89ULL));\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/chiffres.cpp\",\n \"rank\": 79,\n \"score\": 46531.63074131901\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"pythagoricien.h\\\"\\n\\n#include \\\"utilitaires.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_pythagoricien)\\n\\n\\n\\n struct fixture_pythagoricien {\\n\\n std::set<std::tuple<size_t, size_t, size_t>> triplets;\\n\\n\\n\\n fixture_pythagoricien() {\\n\\n triplets = std::set<std::tuple<size_t, size_t, size_t>>\\n\\n {\\n\\n std::make_tuple(3, 4, 5),\\n\\n std::make_tuple(5, 12, 13),\\n\\n std::make_tuple(8, 15, 17),\\n\\n std::make_tuple(7, 24, 25),\\n\\n\\n\\n std::make_tuple(20, 21, 29),\\n\\n std::make_tuple(12, 35, 37),\\n\",\n \"file_path\": \"tests/pythagoricien.cpp\",\n \"rank\": 80,\n \"score\": 46531.475013918905\n },\n {\n \"content\": \"#include <boost/test/unit_test.hpp>\\n\\n\\n\\n#include \\\"arithmetique.h\\\"\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE(test_arithmetique)\\n\\n\\n\\n struct fixure_arithmetiques {\\n\\n std::vector<size_t> premiers;\\n\\n\\n\\n explicit fixure_arithmetiques() {\\n\\n premiers = std::vector<size_t> {2, 3, 5, 7, 11, 13, 17, 19, 23, 29,\\n\\n 31, 37, 41, 43, 47, 53, 59, 61, 67,\\n\\n 71, 73, 79, 83, 89, 97};\\n\\n }\\n\\n\\n\\n ~fixure_arithmetiques() = default;\\n\\n };\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(pgcd, fixure_arithmetiques) {\\n\\n BOOST_CHECK_EQUAL(arithmetique::PGCD(456753ULL, 97643ULL), 1);\\n\",\n \"file_path\": \"tests/arithmetique.cpp\",\n \"rank\": 81,\n \"score\": 46531.400033761\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(F(0, 0), 165580141);\\n\\n BOOST_CHECK_EQUAL(F(1, 0), 102334155);\\n\\n BOOST_CHECK_EQUAL(F(0, 1), 102334155);\\n\\n BOOST_CHECK_EQUAL(F(1, 1), 63245986);\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(),\\n\\n F.data().begin(), F.data().end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(puissance_modulaire) {\\n\\n matrice::matrice<long long> A(2, 2);\\n\\n A <<= 1, 1,\\n\\n 1, 0;\\n\\n\\n\\n auto F = matrice::puissance_matrice<long long>(A, 100, 1000000000);\\n\\n\\n\\n const std::vector<long long> resultat{817084101, 261915075,\\n\\n 261915075, 555169026};\\n\\n\\n\\n BOOST_CHECK_EQUAL(F.size1(), 2);\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 82,\n \"score\": 46530.72861564622\n },\n {\n \"content\": \"\\n\\n std::vector<int> iterable{1, 2, 3, 4};\\n\\n for (auto &i: permutation::Arrangements<int>(iterable, 3)) {\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\\n\\n resultat[index].begin(), resultat[index].end());\\n\\n ++index;\\n\\n }\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(arrangements_doublon) {\\n\\n const std::vector<std::string> resultat{\\\"AB\\\", \\\"BA\\\", \\\"AD\\\", \\\"DA\\\", \\\"BB\\\", \\\"BD\\\", \\\"DB\\\"};\\n\\n\\n\\n size_t index = 0;\\n\\n\\n\\n std::vector<char> iterable{'A', 'B', 'B', 'D'};\\n\\n for (auto &i: permutation::Arrangements<char>(iterable, 2)) {\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\\n\\n resultat[index].begin(), resultat[index].end());\\n\\n ++index;\\n\\n }\\n\",\n \"file_path\": \"tests/permutation.cpp\",\n \"rank\": 83,\n \"score\": 46530.68210138234\n },\n {\n \"content\": \" const std::vector<std::string> resultat{\\\"AB\\\", \\\"AC\\\", \\\"AD\\\", \\\"BC\\\", \\\"BD\\\", \\\"CD\\\"};\\n\\n\\n\\n size_t index = 0;\\n\\n std::vector<char> iterable{'A', 'B', 'C', 'D'};\\n\\n for (auto i : permutation::Combinaisons<char>(iterable, 2)) {\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(i.begin(), i.end(),\\n\\n resultat[index].begin(), resultat[index].end());\\n\\n ++index;\\n\\n }\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/permutation.cpp\",\n \"rank\": 84,\n \"score\": 46530.55569012072\n },\n {\n \"content\": \" identite.data().begin(), identite.data().end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(inversion2) {\\n\\n typedef boost::rational<long long> fraction;\\n\\n\\n\\n matrice::matrice<fraction> A(4, 4);\\n\\n A <<= 1, 1, 1, -1,\\n\\n 1, 2, 6, 7,\\n\\n 1, 2, 9, 0,\\n\\n 2, 5, 9, 15;\\n\\n\\n\\n matrice::matrice<fraction> resultat(4, 4);\\n\\n resultat <<= 99, 132, -44, -55,\\n\\n -18, -129, 29, 59,\\n\\n -7, 14, 7, -7,\\n\\n -3, 17, -8, -3;\\n\\n resultat /= 77;\\n\\n\\n\\n matrice::matrice<fraction> inverse(4, 4);\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 85,\n \"score\": 46530.31424427844\n },\n {\n \"content\": \" BOOST_AUTO_TEST_CASE(crible_simple) {\\n\\n const std::vector<size_t> premiers100{2, 3, 5, 7, 11, 13, 17, 19, 23,\\n\\n 29, 31, 37, 41, 43, 47, 53, 59,\\n\\n 61, 67, 71, 73, 79, 83, 89, 97};\\n\\n std::vector<bool> crible;\\n\\n premiers::crible_simple(100, crible);\\n\\n\\n\\n BOOST_CHECK_EQUAL(100, crible.size());\\n\\n\\n\\n for (auto p: premiers100) {\\n\\n BOOST_CHECK(crible[p]);\\n\\n }\\n\\n\\n\\n size_t compteur = std::accumulate(crible.begin(), crible.end(), 0ul);\\n\\n BOOST_CHECK_EQUAL(25, compteur);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(miller_rabin) {\\n\\n uint128_t n = 32416189721ull;\\n\\n BOOST_CHECK(premiers::miller_rabin<uint128_t>(n, 25));\\n\",\n \"file_path\": \"tests/premiers.cpp\",\n \"rank\": 86,\n \"score\": 46530.11171297498\n },\n {\n \"content\": \" {34, 124, 4, 878, 450, 476, 712, 914, 838, 669, 875, 299, 823, 329, 699},\\n\\n {815, 559, 813, 459, 522, 788, 168, 586, 966, 232, 308, 833, 251, 631, 107},\\n\\n {813, 883, 451, 509, 615, 77, 281, 613, 459, 205, 380, 274, 302, 35, 805}\\n\\n };\\n\\n\\n\\n std::vector<short> ligne1{7, 53, 183, 439, 863, 497, 383, 563, 79, 973, 287, 63, 343, 169, 583};\\n\\n std::vector<short> ligne7{973, 965, 905, 919, 133, 673, 665, 235, 509, 613, 673, 815, 165, 992, 326};\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(matrice.front().begin(), matrice.front().end(),\\n\\n ligne1.begin(), ligne1.end());\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(matrice[6].begin(), matrice[6].end(),\\n\\n ligne7.begin(), ligne7.end());\\n\\n\\n\\n BOOST_CHECK_EQUAL(matrice.back().back(), 805);\\n\\n BOOST_CHECK_EQUAL(matrice[4][10], 250);\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(multidimension_3) {\\n\\n multidimension<short, 3> matrice\\n\",\n \"file_path\": \"tests/multidimension.cpp\",\n \"rank\": 87,\n \"score\": 46529.41538797235\n },\n {\n \"content\": \" std::make_tuple(9, 40, 41),\\n\\n std::make_tuple(28, 45, 53),\\n\\n\\n\\n std::make_tuple(11, 60, 61),\\n\\n std::make_tuple(16, 63, 65),\\n\\n std::make_tuple(33, 56, 65),\\n\\n std::make_tuple(48, 55, 73),\\n\\n\\n\\n std::make_tuple(13, 84, 85),\\n\\n std::make_tuple(36, 77, 85),\\n\\n std::make_tuple(39, 80, 89),\\n\\n std::make_tuple(65, 72, 97)\\n\\n };\\n\\n }\\n\\n };\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(nombres_pythagoricien, fixture_pythagoricien) {\\n\\n Pythagoricien pythagoricien(100);\\n\\n std::set<std::tuple<size_t, size_t, size_t>> resultat;\\n\\n for (auto t: pythagoricien) {\\n\\n resultat.insert(t);\\n\\n }\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(triplets.begin(), triplets.end(), resultat.begin(), resultat.end());\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/pythagoricien.cpp\",\n \"rank\": 88,\n \"score\": 46528.84128424528\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(\\\"-265252859812191058636308480000000\\\", oss2.str());\\n\\n\\n\\n int128_t n2;\\n\\n std::istringstream iss2(oss2.str());\\n\\n iss2 >> n2;\\n\\n BOOST_CHECK_EQUAL(n2, -f);\\n\\n\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(ostringstream_unsigned) {\\n\\n auto f = combinatoire::factorielle<uint128_t>(30);\\n\\n std::ostringstream oss;\\n\\n oss << f;\\n\\n BOOST_CHECK_EQUAL(\\\"265252859812191058636308480000000\\\", oss.str());\\n\\n\\n\\n uint128_t n;\\n\\n std::istringstream iss(oss.str());\\n\\n iss >> n;\\n\\n BOOST_CHECK_EQUAL(n, f);\\n\\n }\\n\",\n \"file_path\": \"tests/numerique.cpp\",\n \"rank\": 89,\n \"score\": 46528.68634592027\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(F.size2(), 2);\\n\\n BOOST_CHECK_EQUAL(F(0, 0), 817084101);\\n\\n BOOST_CHECK_EQUAL(F(1, 0), 261915075);\\n\\n BOOST_CHECK_EQUAL(F(0, 1), 261915075);\\n\\n BOOST_CHECK_EQUAL(F(1, 1), 555169026);\\n\\n\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(resultat.begin(), resultat.end(),\\n\\n F.data().begin(), F.data().end());\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(inversion1) {\\n\\n typedef boost::rational<long long> fraction;\\n\\n\\n\\n matrice::matrice<fraction> A(3, 3);\\n\\n A <<= 2, -1, 0,\\n\\n -1, 2, -1,\\n\\n 0, -1, 2;\\n\\n\\n\\n matrice::matrice<fraction> resultat(3, 3);\\n\\n resultat <<= 3, 2, 1,\\n\",\n \"file_path\": \"tests/matrice.cpp\",\n \"rank\": 90,\n \"score\": 46528.23858228447\n },\n {\n \"content\": \" BOOST_CHECK_EQUAL(arithmetique::PGCD(456755ULL, 158665ULL), 65);\\n\\n }\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(ppcm, fixure_arithmetiques) {\\n\\n BOOST_CHECK_EQUAL(arithmetique::PPCM(456753ULL, 97643ULL), 44598733179ULL);\\n\\n BOOST_CHECK_EQUAL(arithmetique::PPCM(456755ULL, 158665ULL), 1114938955);\\n\\n }\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(arrondi, fixure_arithmetiques) {\\n\\n BOOST_CHECK_EQUAL(arithmetique::arrondi(1000, 101), 10);\\n\\n BOOST_CHECK_EQUAL(arithmetique::arrondi(12345678, 48), 257202);\\n\\n }\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(Bezout1, fixure_arithmetiques) {\\n\\n long long u, v;\\n\\n long long a = 456753LL;\\n\\n long long b = 97643LL;\\n\\n arithmetique::Bezout(a, b, u, v);\\n\\n\\n\\n BOOST_CHECK_EQUAL(u, 18947LL);\\n\",\n \"file_path\": \"tests/arithmetique.cpp\",\n \"rank\": 91,\n \"score\": 46527.88367205082\n },\n {\n \"content\": \" }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(octagonal) {\\n\\n BOOST_CHECK_EQUAL(29800, polygonal::octagonal(100));\\n\\n BOOST_CHECK(polygonal::est_octagonal(5461));\\n\\n BOOST_CHECK(!polygonal::est_octagonal(5460));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(somme_carres) {\\n\\n BOOST_CHECK_EQUAL(338350, polygonal::somme_carres(100));\\n\\n BOOST_CHECK_EQUAL(54301841231, polygonal::somme_carres(5461ll));\\n\\n BOOST_CHECK_EQUAL(54272018710, polygonal::somme_carres(5460ll));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(somme_cubes) {\\n\\n BOOST_CHECK_EQUAL(25502500, polygonal::somme_cubes(100));\\n\\n BOOST_CHECK_EQUAL(222427127548081, polygonal::somme_cubes(5461ll));\\n\\n BOOST_CHECK_EQUAL(222264266760900, polygonal::somme_cubes(5460ll));\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/polygonal.cpp\",\n \"rank\": 92,\n \"score\": 46527.51042821171\n },\n {\n \"content\": \"\\n\\n BOOST_AUTO_TEST_CASE(numeric_limits_int128) {\\n\\n BOOST_CHECK_EQUAL(\\\"170141183460469231731687303715884105727\\\",\\n\\n std::to_string(std::numeric_limits<int128_t>::max()));\\n\\n\\n\\n BOOST_CHECK_EQUAL(\\\"-170141183460469231731687303715884105728\\\",\\n\\n std::to_string(std::numeric_limits<int128_t>::min()));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(numeric_limits_uint128) {\\n\\n BOOST_CHECK_EQUAL(\\\"340282366920938463463374607431768211455\\\",\\n\\n std::to_string(std::numeric_limits<uint128_t>::max()));\\n\\n\\n\\n BOOST_CHECK_EQUAL(0,\\n\\n std::numeric_limits<uint128_t>::min());\\n\\n }\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/numerique.cpp\",\n \"rank\": 93,\n \"score\": 46527.36219703313\n },\n {\n \"content\": \"\\n\\n BOOST_FIXTURE_TEST_CASE(moebius, fixure_arithmetiques) {\\n\\n BOOST_CHECK_EQUAL(arithmetique::moebius(3246999210ULL, premiers), 0);\\n\\n BOOST_CHECK_EQUAL(arithmetique::moebius(496ULL, premiers), 0);\\n\\n BOOST_CHECK_EQUAL(arithmetique::moebius(19ULL, premiers), -1);\\n\\n BOOST_CHECK_EQUAL(arithmetique::moebius(15ULL, premiers), 1);\\n\\n }\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(facteur_carre, fixure_arithmetiques) {\\n\\n BOOST_CHECK_EQUAL(arithmetique::facteur_carre(3246999210ULL, premiers), true);\\n\\n BOOST_CHECK_EQUAL(arithmetique::facteur_carre(42315ULL, premiers), false);\\n\\n }\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(diviseurs, fixure_arithmetiques) {\\n\\n auto d = arithmetique::diviseurs(496ULL, premiers);\\n\\n std::vector<size_t> result{1, 2, 4, 8, 16, 31, 62, 124, 248, 496};\\n\\n BOOST_CHECK_EQUAL_COLLECTIONS(d.begin(), d.end(), result.begin(), result.end());\\n\\n }\\n\\n\\n\\n BOOST_FIXTURE_TEST_CASE(repunit, fixure_arithmetiques) {\\n\",\n \"file_path\": \"tests/arithmetique.cpp\",\n \"rank\": 94,\n \"score\": 46527.239343948044\n },\n {\n \"content\": \"}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(affiche_set) {\\n\\n const std::set<int> v{1, 1, 2, 3, 5, 8, 13, 21, 34};\\n\\n std::ostringstream oss;\\n\\n oss << v;\\n\\n\\n\\n BOOST_CHECK_EQUAL(\\\"{1 2 3 5 8 13 21 34}\\\", oss.str());\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_CASE(affiche_map) {\\n\\n const std::map<int, std::string> v{{1, \\\"1\\\"},\\n\\n {2, \\\"3\\\"},\\n\\n {5, \\\"8\\\"},\\n\\n {13, \\\"21\\\"}};\\n\\n std::ostringstream oss;\\n\\n oss << v;\\n\\n\\n\\n const std::string result = \\\"{\\\\n\\\"\\n\\n \\\" 1 => 1\\\\n\\\"\\n\",\n \"file_path\": \"tests/utilitaires.cpp\",\n \"rank\": 95,\n \"score\": 46527.13633273574\n },\n {\n \"content\": \" for (auto s : diophantienne::equation_lineaire(A, B, C)) {\\n\\n ++compteur;\\n\\n if (compteur > 10) {\\n\\n break;\\n\\n }\\n\\n BOOST_CHECK_EQUAL(A * s.first + B * s.second + C, 0);\\n\\n }\\n\\n }\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/diophantienne.cpp\",\n \"rank\": 96,\n \"score\": 46526.99963752479\n },\n {\n \"content\": \" \\\" 2 => 3\\\\n\\\"\\n\\n \\\" 5 => 8\\\\n\\\"\\n\\n \\\" 13 => 21\\\\n\\\"\\n\\n \\\"}\\\\n\\\";\\n\\n\\n\\n BOOST_CHECK_EQUAL(result, oss.str());\\n\\n}\\n\\n\\n\\nBOOST_AUTO_TEST_SUITE_END()\\n\",\n \"file_path\": \"tests/utilitaires.cpp\",\n \"rank\": 97,\n \"score\": 46526.94515429852\n },\n {\n \"content\": \" BOOST_CHECK(polygonal::est_triangulaire(5050));\\n\\n BOOST_CHECK(!polygonal::est_triangulaire(5000));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(pentagonal) {\\n\\n BOOST_CHECK_EQUAL(14950, polygonal::pentagonal(100));\\n\\n BOOST_CHECK(polygonal::est_pentagonal(3151));\\n\\n BOOST_CHECK(!polygonal::est_pentagonal(3150));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(hexagonal) {\\n\\n BOOST_CHECK_EQUAL(19900, polygonal::hexagonal(100));\\n\\n BOOST_CHECK(polygonal::est_hexagonal(4560));\\n\\n BOOST_CHECK(!polygonal::est_hexagonal(4550));\\n\\n }\\n\\n\\n\\n BOOST_AUTO_TEST_CASE(heptagonal) {\\n\\n BOOST_CHECK_EQUAL(24850, polygonal::heptagonal(100));\\n\\n BOOST_CHECK(polygonal::est_heptagonal(5688));\\n\\n BOOST_CHECK(!polygonal::est_heptagonal(5689));\\n\",\n \"file_path\": \"tests/polygonal.cpp\",\n \"rank\": 98,\n \"score\": 46526.85874061337\n }\n]","isConversational":false}}},{"rowIdx":483,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"include/zisa/memory/array_view_impl.hpp"},"repo_name":{"kind":"string","value":"1uc/ZisaMemory"},"commit":{"kind":"string","value":"9d9689e46e63629f842b04765bc322f32d91758e"},"file_code":{"kind":"string","value":"#ifndef ARRAY_VIEW_IMPL_HPP\n#define ARRAY_VIEW_IMPL_HPP\n\nnamespace zisa {\n\ntemplate <class T>\nauto raw_ptr(T *a) -> decltype(a) {\n return a;\n}\n\ntemplate <class T, class Indexing>\narray_view_base<T, Indexing>::array_view_base(array_view_base::shape_type shape,\n T *ptr,\n device_type mem_location)\n : _shape(shape), _ptr(ptr), _mem_location(mem_location) {}\n\ntemplate <class T, class Indexing>\ntypename array_view_base<T, Indexing>::size_type\narray_view_base<T, Indexing>::size() const {\n return product(_shape);\n}\n\ntemplate <class T, class Indexing>\nconst typename array_view_base<T, Indexing>::shape_type &\narray_view_base<T, Indexing>::shape() const {\n return _shape;\n}\n\ntemplate <class T, class Indexing>\ntypename array_view_base<T, Indexing>::size_type\narray_view_base<T, Indexing>::shape(array_view_base::size_type i) const {\n return _shape(i);\n}\n\ntemplate <class T, class Indexing>\ndevice_type memory_location(const array_view_base<T, Indexing> &view) {\n return view.memory_location();\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\narray_view<T, n_dims, Indexing>::array_view(const shape_t<n_dims> &shape,\n T *ptr,\n device_type mem_location)\n : super(shape, ptr, mem_location) {}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\ntemplate <class Array, class Shape>\narray_view<T, n_dims, Indexing>::array_view(\n array_base<T, Indexing<n_dims>, Array, Shape> &other)\n : array_view(zisa::shape(other),\n zisa::raw_ptr(other),\n zisa::memory_location(other)) {}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\narray_view<T, n_dims, Indexing>::array_view(std::vector<T> &v)\n : array_view(shape_t<1>{v.size()}, v.data(), device_type::cpu) {}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT *array_view<T, n_dims, Indexing>::raw() const {\n return this->_ptr;\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT &array_view<T, n_dims, Indexing>::operator[](array_view::size_type i) const {\n return this->_ptr[i];\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\ntemplate <class... Ints>\nT &array_view<T, n_dims, Indexing>::operator()(Ints... ints) const {\n auto l = Indexing<n_dims>::linear_index(this->shape(),\n integer_cast<size_type>(ints)...);\n return (*this)[l];\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT *array_view<T, n_dims, Indexing>::begin() const {\n return this->_ptr;\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT *array_view<T, n_dims, Indexing>::end() const {\n return this->_ptr + this->size();\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT const *array_view<T, n_dims, Indexing>::cbegin() const {\n return this->_ptr;\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT const *array_view<T, n_dims, Indexing>::cend() const {\n return this->_ptr + this->size();\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nvoid array_view<T, n_dims, Indexing>::copy_data(\n const array_view<T, n_dims, Indexing> &other) const {\n copy_data(array_const_view<T, n_dims, Indexing>(other));\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nvoid array_view<T, n_dims, Indexing>::copy_data(\n const array_const_view<T, n_dims, Indexing> &other) const {\n assert((*this).shape() == other.shape());\n LOG_ERR_IF(this->memory_location() == device_type::cuda, \"Implement this.\");\n\n if (other.raw() != (*this).raw()) {\n std::copy(other.begin(), other.end(), (*this).begin());\n }\n}\n\n}\n\n#endif \n"},"prefix":{"kind":"string","value":"#ifndef ARRAY_VIEW_IMPL_HPP\n#define ARRAY_VIEW_IMPL_HPP\n\nnamespace zisa {\n\ntemplate <class T>\nauto raw_ptr(T *a) -> decltype(a) {\n return a;\n}\n\ntemplate <class T, class Indexing>\narray_view_base<T, Indexing>::array_view_base(array_view_base::shape_type shape,\n T *ptr,\n device_type mem_location)\n : _shape(shape), _ptr(ptr), _mem_location(mem_location) {}\n\ntemplate <class T, class Indexing>\ntypename array_view_base<T, Indexing>::size_type\narray_view_base<T, Indexing>::size() const {\n return product(_shape);\n}\n\ntemplate <class T, class Indexing>\nconst typename array_view_base<T, Indexing>::shape_type &\narray_view_base<T, Indexing>::shape() const {\n return _shape;\n}\n\ntemplate <class T, class Indexing>\ntypename array_view_base<T, Indexing>::size_type\narray_view_base<T, Indexing>::shape(array_view_base::size_type i) const {\n return _shape(i);\n}\n\ntemplate <class T, class Indexing>\ndevice_type memory_location(const array_view_base<T, Indexing> &view) {\n return view.memory_location();\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\narray_view<T, n_dims, Indexing>::array_view(const shape_t<n_dims> &shape,\n T *ptr,\n device_type mem_location)\n : super(shape, ptr, mem_location) {}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\ntemplate <class Array, class Shape>\narray_view<T, n_dims, Indexing>::array_view(\n array_base<T, Indexing<n_dims>, Array, Shape> &other)\n : array_view(zisa::shape(other),\n zisa::raw_ptr(other),\n zisa::memory_location(other)) {}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\narray_view<T, n_dims, Indexing>::array_view(std::vector<T> &v)\n : array_view(shape_t<1>{v.size()}, v.data(), device_type::cpu) {}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT *array_view<T, n_dims, Indexing>::raw() const {\n return this->_ptr;\n}\n\ntemplate <class T, int n_dim"},"suffix":{"kind":"string","value":"int n_dims, template <int> class Indexing>\nT const *array_view<T, n_dims, Indexing>::cbegin() const {\n return this->_ptr;\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT const *array_view<T, n_dims, Indexing>::cend() const {\n return this->_ptr + this->size();\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nvoid array_view<T, n_dims, Indexing>::copy_data(\n const array_view<T, n_dims, Indexing> &other) const {\n copy_data(array_const_view<T, n_dims, Indexing>(other));\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nvoid array_view<T, n_dims, Indexing>::copy_data(\n const array_const_view<T, n_dims, Indexing> &other) const {\n assert((*this).shape() == other.shape());\n LOG_ERR_IF(this->memory_location() == device_type::cuda, \"Implement this.\");\n\n if (other.raw() != (*this).raw()) {\n std::copy(other.begin(), other.end(), (*this).begin());\n }\n}\n\n}\n\n#endif \n"},"middle":{"kind":"string","value":"s, template <int> class Indexing>\nT &array_view<T, n_dims, Indexing>::operator[](array_view::size_type i) const {\n return this->_ptr[i];\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\ntemplate <class... Ints>\nT &array_view<T, n_dims, Indexing>::operator()(Ints... ints) const {\n auto l = Indexing<n_dims>::linear_index(this->shape(),\n integer_cast<size_type>(ints)...);\n return (*this)[l];\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT *array_view<T, n_dims, Indexing>::begin() const {\n return this->_ptr;\n}\n\ntemplate <class T, int n_dims, template <int> class Indexing>\nT *array_view<T, n_dims, Indexing>::end() const {\n return this->_ptr + this->size();\n}\n\ntemplate <class T, "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class array_const_view : public array_view_base<const T, Indexing<n_dims>> {\n\n\n\nprivate:\n\n using super = array_view_base<const T, Indexing<n_dims>>;\n\n using size_type = typename super::size_type;\n\n\n\npublic:\n\n ANY_DEVICE_INLINE\n\n array_const_view(const shape_t<n_dims> &shape,\n\n T const *ptr,\n\n device_type mem_location = device_type::unknown)\n\n : super(shape, ptr, mem_location) {}\n\n\n\n template <class Array, class Shape>\n\n array_const_view(const array_base<T, Indexing<n_dims>, Array, Shape> &other)\n\n : array_const_view(zisa::shape(other),\n\n zisa::raw_ptr(other),\n\n zisa::memory_location(other)) {}\n\n\n\n ANY_DEVICE_INLINE\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":0,"score":235025.09631773861},{"content":"class array_view : public array_view_base<T, Indexing<n_dims>> {\n\nprivate:\n\n using super = array_view_base<T, Indexing<n_dims>>;\n\n using size_type = typename super::size_type;\n\n\n\npublic:\n\n ANY_DEVICE_INLINE\n\n array_view(const shape_t<n_dims> &shape,\n\n T *ptr,\n\n device_type mem_location = device_type::unknown);\n\n\n\n template <class Array, class Shape>\n\n array_view(array_base<T, Indexing<n_dims>, Array, Shape> &other);\n\n\n\n array_view(std::vector<T> &v);\n\n\n\n ANY_DEVICE_INLINE T *raw() const;\n\n ANY_DEVICE_INLINE T &operator[](size_type i) const;\n\n\n\n template <class... Ints>\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":1,"score":187199.53677227077},{"content":"class array_const_view;\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing = row_major>\n","file_path":"include/zisa/memory/array_view_fwd.hpp","rank":2,"score":172997.86280064506},{"content":"class array : public detail::array_super_<T, n_dims, Indexing> {\n\nprivate:\n\n using super = detail::array_super_<T, n_dims, Indexing>;\n\n\n\nprotected:\n\n using shape_type = typename super::shape_type;\n\n\n\npublic:\n\n using super::super;\n\n\n\n array(const array &) = default;\n\n array(array &&) noexcept = default;\n\n\n\n array(const array_const_view<T, n_dims, Indexing> &other,\n\n device_type mem_loc);\n\n\n\n explicit array(const array_const_view<T, n_dims, Indexing> &other);\n\n explicit array(const array_view<T, n_dims, Indexing> &other);\n\n\n\n array(T *raw_ptr, const shape_type &shape);\n","file_path":"include/zisa/memory/array_decl.hpp","rank":3,"score":166367.92751748947},{"content":"class array;\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":4,"score":163842.72401537676},{"content":"class array_view;\n\n\n\n}\n\n#endif // ZISA_ARRAY_VIEW_FWD_HPP\n","file_path":"include/zisa/memory/array_view_fwd.hpp","rank":5,"score":142818.68251159138},{"content":"class array_view_base {\n\nprotected:\n\n using size_type = typename array_traits<T *>::size_type;\n\n using shape_type = shape_t<indexing_traits<Indexing>::n_dims, size_type>;\n\n\n\npublic:\n\n ANY_DEVICE\n\n array_view_base(shape_type shape, T *ptr, device_type mem_location);\n\n\n\n ANY_DEVICE_INLINE size_type size() const;\n\n\n\n ANY_DEVICE_INLINE const shape_type &shape() const;\n\n ANY_DEVICE_INLINE size_type shape(size_type i) const;\n\n\n\n ANY_DEVICE_INLINE device_type memory_location() const {\n\n return _mem_location;\n\n }\n\n\n\nprotected:\n\n shape_type _shape;\n\n T *_ptr;\n\n device_type _mem_location;\n\n};\n\n\n\ntemplate <class T, class Indexing>\n\ndevice_type memory_location(const array_view_base<T, Indexing> &view);\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":6,"score":140764.37667346295},{"content":"struct indexing_traits;\n\n\n\ntemplate <class Array>\n","file_path":"include/zisa/memory/array_base_decl.hpp","rank":7,"score":103166.1268741088},{"content":"class array_base {\n\npublic:\n\n using shape_type = Shape;\n\n using size_type = typename array_traits<Array>::size_type;\n\n using pointer = typename array_traits<Array>::pointer;\n\n using const_pointer = typename array_traits<Array>::const_pointer;\n\n\n\npublic:\n\n static constexpr int n_dims = indexing_traits<Indexing>::n_dims;\n\n\n\npublic:\n\n array_base() = default;\n\n\n\n array_base(Shape shape, Array array)\n\n : _shape(std::move(shape)), _array(std::move(array)) {}\n\n\n\n array_base(const array_base &other) = default;\n\n array_base(array_base &&other) noexcept = default;\n\n\n\n ~array_base() = default;\n","file_path":"include/zisa/memory/array_base_decl.hpp","rank":8,"score":101953.25360160958},{"content":"class array_base;\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array_base_fwd.hpp","rank":9,"score":101953.25360160958},{"content":" class SFINAE\n\n = typename std::enable_if<all_integral<Ints...>::value, void>::type>\n\n ANY_DEVICE_INLINE shape_t(Ints... ints) noexcept\n\n : _raw_data{integer_cast<Int>(ints)...} {}\n\n\n\n shape_t &operator=(const shape_t &) noexcept = default;\n\n shape_t &operator=(shape_t &&) noexcept = default;\n\n\n\n ANY_DEVICE_INLINE\n\n Int operator[](int_t dim) const {\n\n assert(dim < n_dims);\n\n return _raw_data[dim];\n\n }\n\n\n\n ANY_DEVICE_INLINE\n\n Int &operator[](int_t dim) {\n\n assert(dim < n_dims);\n\n return _raw_data[dim];\n\n }\n\n\n","file_path":"include/zisa/memory/shape.hpp","rank":10,"score":100857.07797147511},{"content":"class locked_ptr {\n\npublic:\n\n locked_ptr() : data(nullptr), index(0), allocator(nullptr) {}\n\n\n\n locked_ptr(T *const data,\n\n int_t index,\n\n std::shared_ptr<block_allocator<T>> allocator)\n\n : data(data), index(index), allocator(std::move(allocator)) {}\n\n\n\n locked_ptr(const locked_ptr &other) = delete;\n\n\n\n locked_ptr(locked_ptr &&other) { *this = std::move(other); }\n\n\n\n ~locked_ptr() {\n\n if (data != nullptr && allocator != nullptr) {\n\n allocator->release(*this);\n\n }\n\n }\n\n\n\n void operator=(const locked_ptr &other) = delete;\n","file_path":"include/zisa/memory/block_allocator.hpp","rank":11,"score":97345.867527074},{"content":"enum class ErasedDataType { DOUBLE, FLOAT, INT, UNSIGNED_LONG, CHAR };\n\n\n\nnamespace detail {\n\n\n\ntemplate <class T>\n","file_path":"include/zisa/io/hierarchical_file.hpp","rank":12,"score":93957.00745159361},{"content":"struct array_traits<T *> {\n\n using pointer = typename std::remove_const<T>::type *;\n\n using const_pointer = typename std::add_const<T>::type *;\n\n using size_type = std::size_t;\n\n};\n\n\n\ntemplate <class T>\n\nANY_DEVICE_INLINE auto raw_ptr(T *a) -> decltype(a);\n\n\n\ntemplate <class T, class Indexing>\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":13,"score":76815.43079652669},{"content":"#ifndef ARRAY_VIEW_HPP_VEWZW\n\n#define ARRAY_VIEW_HPP_VEWZW\n\n\n\n#include \"array_view_decl.hpp\"\n\n#include \"array_view_impl.hpp\"\n\n\n\n#endif // ARRAY_VIEW_HPP\n","file_path":"include/zisa/memory/array_view.hpp","rank":14,"score":75512.97024025457},{"content":" array_const_view(const array_view<T, n_dims, Indexing> &other)\n\n : super(other.shape(), other.raw(), zisa::memory_location(other)) {}\n\n\n\n array_const_view(const std::vector<T> &v)\n\n : array_const_view(shape_t<1>{v.size()}, v.data(), device_type::cpu) {}\n\n\n\n ANY_DEVICE_INLINE const T *raw() const { return this->_ptr; }\n\n ANY_DEVICE_INLINE const T &operator[](size_type i) const {\n\n return this->_ptr[i];\n\n }\n\n\n\n template <class... Ints>\n\n ANY_DEVICE_INLINE const T &operator()(Ints... ints) const {\n\n auto l = Indexing<n_dims>::linear_index(this->shape(),\n\n integer_cast<size_type>(ints)...);\n\n return (*this)[l];\n\n }\n\n\n\n ANY_DEVICE_INLINE T const *begin() const { return this->_ptr; }\n\n ANY_DEVICE_INLINE T const *end() const { return this->_ptr + this->size(); }\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":15,"score":73681.59031617234},{"content":" return a.raw();\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nANY_DEVICE_INLINE auto raw_ptr(const array_const_view<T, n_dims, Indexing> &a)\n\n -> decltype(a.raw()) {\n\n return a.raw();\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid fill(const array_view<T, n_dims, Indexing> &dst, const T &value) {\n\n zisa::fill(raw_ptr(dst), memory_location(dst), dst.size(), value);\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid copy(const array_view<T, n_dims, Indexing> &dst,\n\n const array_const_view<T, n_dims, Indexing> &src) {\n\n\n\n zisa::internal::copy(dst.raw(),\n\n memory_location(dst),\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":17,"score":73680.21569150838},{"content":"}\n\n}\n\n\n\ntemplate <class T, int n_dims>\n\narray_view<T, n_dims, row_major>\n\nslice(const array_view<T, n_dims, row_major> &arr, int_t i0, int_t i1) {\n\n auto const_view\n\n = detail::slice(array_const_view<T, n_dims, row_major>(arr), i0, i1);\n\n return {const_view.shape(), const_cast<T *>(const_view.raw())};\n\n}\n\n\n\ntemplate <class T, int n_dims>\n\narray_const_view<T, n_dims, row_major> const_slice(\n\n const array_const_view<T, n_dims, row_major> &arr, int_t i0, int_t i1) {\n\n return detail::slice(arr, i0, i1);\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nANY_DEVICE_INLINE auto raw_ptr(const array_view<T, n_dims, Indexing> &a)\n\n -> decltype(a.raw()) {\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":20,"score":73677.42207505243},{"content":" const std::string &tag,\n\n bool_dispatch_tag) {\n\n\n\n using scalar_type = typename array_save_traits<bool>::scalar_type;\n\n auto int_arr = std::vector<scalar_type>(arr.size());\n\n std::copy(arr.cbegin(), arr.cend(), int_arr.begin());\n\n\n\n auto int_arr_view = array_const_view<scalar_type, n_dims, row_major>(\n\n arr.shape(), int_arr.data());\n\n\n\n save(writer, int_arr_view, tag);\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid save(HierarchicalWriter &writer,\n\n const array_const_view<T, n_dims, Indexing> &arr,\n\n const std::string &tag) {\n\n\n\n save(writer, arr, tag, typename array_save_traits<T>::dispatch_tag{});\n\n}\n\n\n\n} // namespace zisa\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":22,"score":73676.20646617339},{"content":"\n\n ANY_DEVICE_INLINE T const *cbegin() const { return this->_ptr; }\n\n ANY_DEVICE_INLINE T const *cend() const { return this->_ptr + this->size(); }\n\n};\n\n\n\n#ifndef __CUDACC__\n\ntemplate <class T>\n\narray_const_view(const std::vector<T> &) -> array_const_view<T, 1, row_major>;\n\n#endif\n\n\n\nnamespace detail {\n\ntemplate <class T, int n_dims>\n\narray_const_view<T, n_dims, row_major>\n\nslice(const array_const_view<T, n_dims, row_major> &arr, int_t i0, int_t i1) {\n\n auto sub_shape = arr.shape();\n\n sub_shape[0] = i1 - i0;\n\n\n\n int_t offset = i0 * (product(sub_shape) / (i1 - i0));\n\n auto ptr = arr.raw() + offset;\n\n return {sub_shape, ptr};\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":23,"score":73676.15883586284},{"content":" src.raw(),\n\n memory_location(src),\n\n src.size());\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid copy(const array_view<T, n_dims, Indexing> &dst,\n\n const array_view<T, n_dims, Indexing> &src) {\n\n return zisa::copy(dst, array_const_view<T, n_dims, Indexing>(src));\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid save(HierarchicalWriter &writer,\n\n const array_view<T, n_dims, Indexing> &arr,\n\n const std::string &tag) {\n\n\n\n save(writer, array_const_view<T, n_dims, Indexing>(arr), tag);\n\n}\n\n\n\ntemplate <class T, int n_dims>\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":24,"score":73675.06191196124},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n#ifndef ZISA_ARRAY_VIEW_FWD_HPP_UEIWQ\n\n#define ZISA_ARRAY_VIEW_FWD_HPP_UEIWQ\n\n\n\n#include <zisa/memory/row_major.hpp>\n\n\n\nnamespace zisa {\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing = row_major>\n","file_path":"include/zisa/memory/array_view_fwd.hpp","rank":27,"score":73671.2240557667},{"content":" ANY_DEVICE_INLINE T &operator()(Ints... ints) const;\n\n\n\n ANY_DEVICE_INLINE T *begin() const;\n\n ANY_DEVICE_INLINE T *end() const;\n\n\n\n ANY_DEVICE_INLINE T const *cbegin() const;\n\n ANY_DEVICE_INLINE T const *cend() const;\n\n\n\n void copy_data(const array_view<T, n_dims, Indexing> &other) const;\n\n void copy_data(const array_const_view<T, n_dims, Indexing> &other) const;\n\n};\n\n\n\n#ifndef __CUDACC__\n\ntemplate <class T>\n\narray_view(std::vector<T> &v) -> array_view<T, 1, row_major>;\n\n#endif\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":28,"score":73670.77993825519},{"content":"void save(HierarchicalWriter &writer,\n\n const array_const_view<T, n_dims, row_major> &arr,\n\n const std::string &tag,\n\n default_dispatch_tag) {\n\n\n\n T const *const data = arr.raw();\n\n const auto &shape = arr.shape();\n\n\n\n auto data_type = erase_data_type<T>();\n\n\n\n std::size_t dims[n_dims];\n\n for (int_t i = 0; i < n_dims; ++i) {\n\n dims[i] = shape(i); // size of (i, j, k) axes\n\n }\n\n\n\n writer.write_array(data, data_type, tag, n_dims, dims);\n\n}\n\n\n\ntemplate <class T, int n_dims>\n\nvoid save(HierarchicalWriter &writer,\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":29,"score":73665.58092190858},{"content":" const array_const_view<T, n_dims, row_major> &arr,\n\n const std::string &tag,\n\n split_array_dispatch_tag) {\n\n\n\n using scalar_type = typename array_save_traits<T>::scalar_type;\n\n auto data_type = erase_data_type<scalar_type>();\n\n\n\n constexpr int_t rank = n_dims + 1;\n\n std::size_t dims[rank];\n\n for (int_t i = 0; i < rank - 1; ++i) {\n\n dims[i] = arr.shape(i);\n\n }\n\n dims[rank - 1] = T::size();\n\n\n\n writer.write_array(arr.raw(), data_type, tag, rank, dims);\n\n}\n\n\n\ntemplate <int n_dims>\n\nvoid save(HierarchicalWriter &writer,\n\n const array_const_view<bool, n_dims, row_major> &arr,\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":30,"score":73665.28267335717},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n#ifndef ARRAY_VIEW_H_NPPW3\n\n#define ARRAY_VIEW_H_NPPW3\n\n\n\n#include <zisa/config.hpp>\n\n\n\n#include <zisa/io/hierarchical_writer.hpp>\n\n#include <zisa/memory/array_base.hpp>\n\n#include <zisa/memory/array_traits.hpp>\n\n#include <zisa/memory/array_view_fwd.hpp>\n\n#include <zisa/memory/column_major.hpp>\n\n#include <zisa/memory/contiguous_memory.hpp>\n\n#include <zisa/memory/copy.hpp>\n\n#include <zisa/memory/shape.hpp>\n\n#include <zisa/meta/add_const_if.hpp>\n\n#include <zisa/meta/if_t.hpp>\n\n\n\nnamespace zisa {\n\n\n\ntemplate <class T>\n","file_path":"include/zisa/memory/array_view_decl.hpp","rank":31,"score":73665.00729968806},{"content":"struct indexing_traits;\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/row_major.hpp","rank":32,"score":73638.16692259753},{"content":"struct indexing_traits;\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/column_major.hpp","rank":33,"score":73638.16692259755},{"content":"struct indexing_traits<row_major<3>> {\n\n static constexpr int_t n_dims = 3;\n\n};\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/row_major.hpp","rank":34,"score":70262.80563461724},{"content":"struct indexing_traits<column_major<2>> {\n\n static constexpr int_t n_dims = 2;\n\n};\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/column_major.hpp","rank":35,"score":70262.80563461724},{"content":"struct indexing_traits<row_major<1>> {\n\n static constexpr int_t n_dims = 1;\n\n};\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/row_major.hpp","rank":36,"score":70262.80563461724},{"content":"struct indexing_traits<column_major<4>> {\n\n static constexpr int_t n_dims = 4;\n\n};\n\n\n\n} // namespace zisa\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/column_major.hpp","rank":37,"score":70262.80563461724},{"content":"struct indexing_traits<column_major<1>> {\n\n static constexpr int_t n_dims = 1;\n\n};\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/column_major.hpp","rank":38,"score":70262.80563461724},{"content":"struct indexing_traits<row_major<4>> {\n\n static constexpr int_t n_dims = 4;\n\n};\n\n\n\n} // namespace zisa\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/row_major.hpp","rank":39,"score":70262.80563461724},{"content":"struct indexing_traits<row_major<2>> {\n\n static constexpr int_t n_dims = 2;\n\n};\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/row_major.hpp","rank":40,"score":70262.80563461724},{"content":"struct indexing_traits<column_major<3>> {\n\n static constexpr int_t n_dims = 3;\n\n};\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/column_major.hpp","rank":41,"score":70262.80563461724},{"content":"class allocator {\n\npublic:\n\n using value_type = T;\n\n using size_type = size_t;\n\n using pointer = T *;\n\n\n\npublic:\n\n allocator() : resource(make_memory_resource<T>(device_type::cpu)) {}\n\n allocator(device_type device) : resource(make_memory_resource<T>(device)) {}\n\n allocator(std::shared_ptr<memory_resource<T>> resource)\n\n : resource(std::move(resource)) {}\n\n allocator(const allocator &alloc) = default;\n\n allocator(allocator &&alloc) = default;\n\n\n\n inline pointer allocate(size_type n) { return resource->allocate(n); }\n\n inline void deallocate(pointer ptr, size_type n) {\n\n resource->deallocate(ptr, n);\n\n }\n\n\n\n template <class... Args>\n","file_path":"include/zisa/memory/allocator.hpp","rank":42,"score":65539.5362057976},{"content":"class memory_resource {\n\npublic:\n\n using value_type = T;\n\n using size_type = std::size_t;\n\n using pointer = T *;\n\n\n\npublic:\n\n virtual ~memory_resource() = default;\n\n\n\n inline pointer allocate(size_type n) { return do_allocate(n); }\n\n inline void deallocate(pointer ptr, size_type n) { do_deallocate(ptr, n); }\n\n\n\n inline device_type device() const { return do_device(); }\n\n\n\nprotected:\n\n virtual pointer do_allocate(size_type n) = 0;\n\n virtual void do_deallocate(pointer ptr, size_type n) = 0;\n\n\n\n virtual device_type do_device() const = 0;\n\n};\n\n\n\n} // namespace zisa\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/memory_resource.hpp","rank":43,"score":63538.76986520287},{"content":"class block_allocator;\n\n\n\ntemplate <class T>\n","file_path":"include/zisa/memory/block_allocator.hpp","rank":44,"score":63538.76986520287},{"content":"class block_allocator\n\n : public std::enable_shared_from_this<block_allocator<T>> {\n\npublic:\n\n block_allocator(int_t max_elements) {\n\n free_list.reserve(max_elements);\n\n large_block.reserve(max_elements);\n\n }\n\n\n\n ~block_allocator() {\n\n for (auto &ptr : large_block) {\n\n delete ptr;\n\n }\n\n }\n\n\n\n template <class... Args>\n\n locked_ptr<T> allocate(Args &&...args) {\n\n auto [index, allocated] = acquire();\n\n\n\n if (!allocated) {\n\n large_block[index] = new T(std::forward<Args &&>(args)...);\n","file_path":"include/zisa/memory/block_allocator.hpp","rank":45,"score":63538.76986520287},{"content":"class HierarchicalFile {\n\npublic:\n\n using DataType = ErasedDataType;\n\n\n\npublic:\n\n virtual ~HierarchicalFile() = default;\n\n\n\n /// Open a group.\n\n void open_group(const std::string &group_name);\n\n\n\n /// Close a group.\n\n void close_group();\n\n\n\n /// Close the current group and open another group\n\n void switch_group(const std::string &group_name);\n\n\n\n /// Does this group exist in the file?\n\n bool group_exists(const std::string &group_name) const;\n\n\n\n /// Human readable description of the current hierarchy.\n","file_path":"include/zisa/io/hierarchical_file.hpp","rank":46,"score":63538.76986520287},{"content":"class HDF5Writer;\n","file_path":"include/zisa/io/hdf5_writer_fwd.hpp","rank":47,"score":62608.78207652447},{"content":"class HDF5DataType {\n\npublic:\n\n /// Initialize object.\n\n /** @param h5_type The H5 identifier of the data-type.\n\n * @param size Size in bytes of the data type.\n\n */\n\n HDF5DataType(const hid_t &h5_type, size_t size);\n\n\n\n virtual ~HDF5DataType();\n\n\n\n /// Return the HDF5 identifier of the data-type.\n\n hid_t operator()() const;\n\n\n\npublic:\n\n size_t size; ///< essentially, `sizeof(T)`\n\n\n\nprotected:\n\n hid_t h5_type;\n\n};\n\n\n","file_path":"include/zisa/io/hdf5_file.hpp","rank":48,"score":62608.78207652447},{"content":"class NetCDFFileStructure {\n\nprivate:\n\n using dim_t = std::tuple<std::string, std::size_t>;\n\n using vector_dims_t = std::vector<dim_t>;\n\n\n\n using var_t\n\n = std::tuple<std::string, std::vector<std::string>, ErasedDataType>;\n\n using vector_vars_t = std::vector<var_t>;\n\n\n\npublic:\n\n NetCDFFileStructure(const vector_dims_t &dims, const vector_vars_t &vars);\n\n\n\n /// Does the structure appear to be plausible?\n\n bool is_valid() const;\n\n\n\n const auto &dims() const;\n\n const auto &vars() const;\n\n\n\nprivate:\n\n void add_dim(const dim_t &dim);\n\n void add_dims(const vector_dims_t &dims);\n\n\n\n void add_vars(const vector_vars_t &vars);\n\n void add_var(const var_t &var);\n\n\n\nprivate:\n\n vector_dims_t dims_;\n\n vector_vars_t vars_;\n\n};\n\n\n","file_path":"include/zisa/io/netcdf_file.hpp","rank":49,"score":61721.42224711478},{"content":"class contiguous_memory_base {\n\npublic:\n\n using const_pointer =\n\n typename std::allocator_traits<Allocator>::const_pointer;\n\n using pointer = typename std::allocator_traits<Allocator>::pointer;\n\n using size_type = typename std::allocator_traits<Allocator>::size_type;\n\n\n\npublic:\n\n contiguous_memory_base()\n\n : _raw_data(nullptr), _n_elements(0), _allocator(nullptr) {}\n\n\n\n explicit contiguous_memory_base(size_type n_elements,\n\n const Allocator &allocator = Allocator());\n\n\n\n contiguous_memory_base(const contiguous_memory_base &other);\n\n contiguous_memory_base(contiguous_memory_base &&other) noexcept;\n\n\n\n ~contiguous_memory_base();\n\n\n\n contiguous_memory_base &operator=(const contiguous_memory_base &other);\n","file_path":"include/zisa/memory/contiguous_memory_base_decl.hpp","rank":50,"score":60873.82513015318},{"content":"enum class device_type {\n\n cpu, // CPU\n\n cuda, // NVIDIA GPU through CUDA\n\n unknown // If it's unclear where the memory resides.\n\n};\n\n\n\n} // namespace zisa\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/device_type.hpp","rank":51,"score":60502.31721272063},{"content":"/// Read data from HDF5 file sequentially.\n\nclass HDF5SerialReader : public HDF5Reader {\n\nprivate:\n\n using super = HDF5Reader;\n\n\n\npublic:\n\n explicit HDF5SerialReader(const std::string &filename);\n\n\n\nprotected:\n\n virtual std::vector<hsize_t>\n\n do_hdf5_dims(const std::string &tag) const override;\n\n\n\n virtual void do_read_array(void *data,\n\n const HDF5DataType &data_type,\n\n const std::string &tag) const override;\n\n\n\n virtual void do_read_scalar(void *data,\n\n const HDF5DataType &data_type,\n\n const std::string &tag) const override;\n\n\n\n virtual std::string do_read_string(const std::string &tag) const override;\n","file_path":"include/zisa/io/hdf5_serial_writer.hpp","rank":52,"score":55416.115423788},{"content":"class HierarchicalWriter : public virtual HierarchicalFile {\n\npublic:\n\n /// Write a multi-dimensional array to an hierarchical file.\n\n /** @param data Raw pointer to the data.\n\n * @param data_type Data type identifier.\n\n * @param tag Name of the data field in the file.\n\n * @param rank Number of dimension of the array.\n\n * @param dims Size (number of elements) of each dimension.\n\n */\n\n void write_array(void const *data,\n\n const DataType &data_type,\n\n const std::string &tag,\n\n int rank,\n\n std::size_t const *dims);\n\n\n\n /// Write a scalar to an HDF5 file.\n\n /** @param data The scalar to be written to file.\n\n * @param tag Name of the scalar in the HDF5 file.\n\n */\n\n template <typename T>\n","file_path":"include/zisa/io/hierarchical_writer.hpp","rank":53,"score":54691.29915991804},{"content":"/// Read data from a hierarchical file.\n\nclass HierarchicalReader : public virtual HierarchicalFile {\n\npublic:\n\n /// Dimensions of the array named `tag`.\n\n std::vector<std::size_t> dims(const std::string &tag) const {\n\n return do_dims(tag);\n\n }\n\n\n\n /// Low-level function to read an array from disc into memory.\n\n /** Allocating (and managing) the memory, is job of the caller. One can\n\n * use `dims` to query the size of the array.\n\n *\n\n * @param[out] data allocated memory of sufficient size.\n\n * @param[in] data_type Erased data type of the data.\n\n * @param[in] tag Name of the array in the file.\n\n */\n\n void read_array(void *data,\n\n const DataType &data_type,\n\n const std::string &tag) const;\n\n\n\n /// Read a scalar from the hierarchical file.\n","file_path":"include/zisa/io/hierarchical_reader.hpp","rank":54,"score":54691.29915991804},{"content":"/// Representation of the current branch of the opened HDF5 file.\n\nclass HDF5File : public virtual HierarchicalFile {\n\npublic:\n\n virtual ~HDF5File() override;\n\n\n\nprotected:\n\n void do_open_group(const std::string &group_name) override;\n\n void do_close_group() override;\n\n void do_switch_group(const std::string &group_name) override;\n\n bool do_group_exists(const std::string &group_name) const override;\n\n std::string do_hierarchy() const override;\n\n void do_unlink(const std::string &tag) override {\n\n zisa::H5L::unlink(file.top(), tag.c_str(), H5P_DEFAULT);\n\n }\n\n\n\nprotected:\n\n hid_t open_dataset(const std::string &tag) const;\n\n hid_t get_dataspace(const hid_t &dataset) const;\n\n\n\nprotected:\n\n std::stack<hid_t> file; ///< HDF5 file/group identifiers (branch)\n\n std::vector<std::string> path; ///< HDF5 path\n\n};\n\n\n\n} // namespace zisa\n\n#endif /* end of include guard */\n","file_path":"include/zisa/io/hdf5_file.hpp","rank":55,"score":54691.29915991804},{"content":"class NetCDFFile : public virtual HierarchicalFile {\n\npublic:\n\n NetCDFFile(const std::string &filename, const NetCDFFileStructure &structure);\n\n\n\n virtual ~NetCDFFile() override;\n\n\n\nprotected:\n\n virtual void do_open_group(const std::string & /* group_name */) override;\n\n virtual void do_close_group() override;\n\n virtual void do_switch_group(const std::string &group_name) override;\n\n\n\n virtual bool\n\n do_group_exists(const std::string & /* group_name */) const override;\n\n\n\n virtual std::string do_hierarchy() const override;\n\n virtual void do_unlink(const std::string &tag) override;\n\n\n\nprivate:\n\n std::vector<int>\n\n extract_dim_ids(const std::vector<std::string> &dim_names) const;\n","file_path":"include/zisa/io/netcdf_file.hpp","rank":56,"score":53915.609426131414},{"content":"class host_memory_resource : public memory_resource<T> {\n\nprivate:\n\n using super = memory_resource<T>;\n\n\n\npublic:\n\n using value_type = typename super::value_type;\n\n using size_type = typename super::size_type;\n\n using pointer = typename super::pointer;\n\n\n\nprotected:\n\n virtual inline pointer do_allocate(size_type n) override { return new T[n]; }\n\n\n\n virtual inline void do_deallocate(pointer ptr, size_type) override {\n\n delete[] ptr;\n\n }\n\n\n\n virtual inline device_type do_device() const override {\n\n return device_type::cpu;\n\n }\n\n};\n\n\n\ntemplate <class T>\n\ndevice_type memory_location(const host_memory_resource<T> &resource) {\n\n return resource.device();\n\n}\n\n\n\n} // namespace zisa\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/host_memory_resource.hpp","rank":57,"score":53172.48928144148},{"content":"class NetCDFWriter : public virtual NetCDFFile,\n\n public virtual HierarchicalWriter {\n\n\n\npublic:\n\n using NetCDFFile::NetCDFFile;\n\n\n\nprotected:\n\n // Redirects `HierarchicalWriter::do_write_array` to the NetCDF\n\n // implementation.\n\n virtual void do_write_array(void const *data,\n\n const DataType & /* data_type */,\n\n const std::string &tag,\n\n int /* rank */,\n\n std::size_t const * /* dims */) override;\n\n\n\n // Redirects `HierarchicalWriter::do_write_array` to the NetCDF\n\n // implementation.\n\n virtual void do_write_scalar(void const *addr,\n\n const DataType & /* data_type */,\n\n const std::string &tag) override;\n","file_path":"include/zisa/io/netcdf_writer.hpp","rank":58,"score":53172.48928144148},{"content":"/// Write data to an HDF5 file, serial version.\n\nclass HDF5SerialWriter : public virtual HDF5Writer {\n\npublic:\n\n explicit HDF5SerialWriter(const std::string &filename);\n\n\n\nprotected:\n\n virtual void do_write_array(const void *data,\n\n const HDF5DataType &data_type,\n\n const std::string &tag,\n\n int rank,\n\n const hsize_t *dims) override;\n\n\n\n using HDF5Writer::do_write_scalar;\n\n\n\n virtual void do_write_scalar(const void *data,\n\n const HDF5DataType &data_type,\n\n const std::string &tag) override;\n\n\n\n virtual void do_write_string(const std::string &data,\n\n const std::string &tag) override;\n\n};\n\n\n","file_path":"include/zisa/io/hdf5_serial_writer.hpp","rank":59,"score":53172.48928144148},{"content":"class cuda_memory_resource : public memory_resource<T> {\n\nprivate:\n\n using super = memory_resource<T>;\n\n\n\npublic:\n\n using value_type = typename super::value_type;\n\n using size_type = typename super::size_type;\n\n using pointer = typename super::pointer;\n\n\n\nprotected:\n\n virtual inline pointer do_allocate(size_type n) override {\n\n pointer ptr = nullptr;\n\n\n\n auto cudaError = cudaMalloc(&ptr, n * sizeof(T));\n\n LOG_ERR_IF(cudaError != cudaSuccess, cuda_error_message(cudaError));\n\n\n\n return ptr;\n\n }\n\n\n\n virtual inline void do_deallocate(pointer ptr, size_type) override {\n","file_path":"include/zisa/cuda/memory/cuda_memory_resource.hpp","rank":60,"score":52459.92961173665},{"content":"class NetCDFSerialWriter : public virtual NetCDFWriter {\n\npublic:\n\n using NetCDFWriter::NetCDFWriter;\n\n\n\nprotected:\n\n virtual void do_write_array(void const *data,\n\n const std::string &tag) override;\n\n\n\n virtual void do_write_scalar(void const *addr,\n\n const std::string &tag) override;\n\n};\n\n\n\n}\n\n#endif /* end of include guard: NETCDF_SERIAL_WRITER_HPP_XWYKVGMU */\n","file_path":"include/zisa/io/netcdf_serial_writer.hpp","rank":61,"score":51776.08322128776},{"content":"struct shape_t {\n\npublic:\n\n ANY_DEVICE shape_t() noexcept {\n\n for (int k = 0; k < n_dims; ++k) {\n\n _raw_data[k] = 0;\n\n }\n\n }\n\n\n\n ANY_DEVICE shape_t(const shape_t &rhs) noexcept {\n\n for (int_t k = 0; k < n_dims; ++k) {\n\n _raw_data[k] = rhs[k];\n\n }\n\n }\n\n\n\n template <class... Ints,\n","file_path":"include/zisa/memory/shape.hpp","rank":62,"score":50207.21106365196},{"content":"/// Interface for writing data to an HDF5 file.\n\nclass HDF5Writer : public virtual HDF5File, public virtual HierarchicalWriter {\n\nprotected:\n\n // Redirects `HierarchicalWriter::do_write_array` to the HDF5 implementation.\n\n virtual void do_write_array(void const *data,\n\n const DataType &data_type,\n\n const std::string &tag,\n\n int rank,\n\n std::size_t const *dims) override;\n\n\n\n // Redirects `HierarchicalWriter::do_write_array` to the HDF5 implementation.\n\n virtual void do_write_scalar(void const *addr,\n\n const DataType &data_type,\n\n const std::string &tag) override;\n\n\n\n // Provides the interface on in the HDF5 world which needs to be implemented.\n\n virtual void do_write_array(void const *data,\n\n const HDF5DataType &data_type,\n\n const std::string &tag,\n\n int rank,\n\n hsize_t const *dims)\n\n = 0;\n\n\n\n // Provides the interface on in the HDF5 world which needs to be implemented.\n\n virtual void do_write_scalar(void const *addr,\n\n const HDF5DataType &data_type,\n\n const std::string &tag)\n\n = 0;\n\n};\n\n\n","file_path":"include/zisa/io/hdf5_writer.hpp","rank":63,"score":48376.415629452895},{"content":"/// Read data from HDF5 file.\n\nclass HDF5Reader : public virtual HDF5File, public virtual HierarchicalReader {\n\nprivate:\n\n using super = HDF5File;\n\n\n\npublic:\n\nprotected:\n\n virtual std::vector<std::size_t>\n\n do_dims(const std::string &tag) const override;\n\n\n\n virtual std::vector<hsize_t> do_hdf5_dims(const std::string &tag) const = 0;\n\n\n\n // Translation from `HierarchicalReader::do_read_array` to HDF5Reader.\n\n virtual void do_read_array(void *data,\n\n const DataType &data_type,\n\n const std::string &tag) const override;\n\n\n\n // This is where the actual functionality is implemented.\n\n virtual void do_read_array(void *data,\n\n const HDF5DataType &data_type,\n\n const std::string &tag) const = 0;\n","file_path":"include/zisa/io/hdf5_writer.hpp","rank":64,"score":48376.415629452895},{"content":"struct array_traits {\n\n using pointer = typename Array::pointer;\n\n using const_pointer = typename Array::const_pointer;\n\n using size_type = typename Array::size_type;\n\n\n\n static inline device_type device(const Array &array) {\n\n return detail::memory_location_<Array>(array);\n\n }\n\n};\n\n\n","file_path":"include/zisa/memory/array_traits.hpp","rank":65,"score":46561.73975857017},{"content":"struct array_traits;\n\n\n\ntemplate <class T, class Indexing, class Array, class Shape>\n","file_path":"include/zisa/memory/array_base_decl.hpp","rank":66,"score":45816.71561680433},{"content":"struct array_save_traits {\n\n using dispatch_tag = default_dispatch_tag;\n\n using scalar_type = T;\n\n};\n\n\n\ntemplate <>\n","file_path":"include/zisa/memory/array_traits.hpp","rank":67,"score":45816.71561680433},{"content":"struct array_save_traits<bool> {\n\n using dispatch_tag = bool_dispatch_tag;\n\n using scalar_type = char;\n\n};\n\n\n\n} // namespace zisa\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array_traits.hpp","rank":68,"score":45095.97204755124},{"content":"struct split_array_dispatch_tag {};\n","file_path":"include/zisa/memory/array_traits.hpp","rank":69,"score":45095.97204755124},{"content":" return s0 + (-i);\n\n}\n\n\n\ntemplate <int n_dims, class Int>\n\nANY_DEVICE_INLINE shape_t<n_dims, Int>\n\noperator-(int i, const shape_t<n_dims, Int> &s0) {\n\n return i + (-s0);\n\n}\n\n\n\ntemplate <int n_dims, class Int>\n\nANY_DEVICE_INLINE shape_t<n_dims, Int>\n\noperator-(const shape_t<n_dims, Int> &s0, const shape_t<n_dims, Int> &s1) {\n\n return s0 + (-s1);\n\n}\n\n\n\n} // namespace zisa\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/shape.hpp","rank":70,"score":43391.145008664396},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n#ifndef SHAPE_H_2YNV5\n\n#define SHAPE_H_2YNV5\n\n\n\n#include <assert.h>\n\n#include <initializer_list>\n\n#include <iostream>\n\n\n\n#include <zisa/config.hpp>\n\n#include <zisa/meta/all_integral.hpp>\n\n#include <zisa/utils/integer_cast.hpp>\n\n\n\nnamespace zisa {\n\n\n\ntemplate <int n_dims, class Int = int_t>\n","file_path":"include/zisa/memory/shape.hpp","rank":71,"score":43389.718123114435},{"content":" }\n\n\n\n return nml;\n\n}\n\n\n\ntemplate <int n, class Int>\n\nstd::ostream &operator<<(std::ostream &os, const shape_t<n, Int> &shape) {\n\n os << \"[\";\n\n for (int i = 0; i < n; ++i) {\n\n os << shape(Int(i)) << (i != n - 1 ? \", \" : \"]\");\n\n }\n\n\n\n return os;\n\n}\n\n\n\ntemplate <int n_dims, class Int>\n\nANY_DEVICE_INLINE shape_t<n_dims, Int> operator+(const shape_t<n_dims, Int> &s0,\n\n int i) {\n\n auto s = shape_t<n_dims, Int>();\n\n\n","file_path":"include/zisa/memory/shape.hpp","rank":72,"score":43389.027397723585},{"content":" for (int k = 0; k < s0.size(); ++k) {\n\n s[k] = s0[k] + i;\n\n }\n\n\n\n return s;\n\n}\n\n\n\ntemplate <int n_dims, class Int>\n\nANY_DEVICE_INLINE shape_t<n_dims, Int>\n\noperator+(const shape_t<n_dims, Int> &s0, const shape_t<n_dims, Int> &s1) {\n\n auto s = shape_t<n_dims, Int>();\n\n\n\n for (int k = 0; k < s0.size(); ++k) {\n\n s[k] = s0[k] + s1[k];\n\n }\n\n\n\n return s;\n\n}\n\n\n\ntemplate <int n_dims, class Int>\n","file_path":"include/zisa/memory/shape.hpp","rank":73,"score":43388.90506503444},{"content":"ANY_DEVICE_INLINE shape_t<n_dims, Int>\n\noperator+(int i, const shape_t<n_dims, Int> &s0) {\n\n return s0 + i;\n\n}\n\n\n\ntemplate <int n_dims, class Int>\n\nANY_DEVICE_INLINE shape_t<n_dims, Int>\n\noperator-(const shape_t<n_dims, Int> &s0) {\n\n auto s = shape_t<n_dims, Int>();\n\n\n\n for (int k = 0; k < s0.size(); ++k) {\n\n s[k] = -s0[k];\n\n }\n\n\n\n return s;\n\n}\n\n\n\ntemplate <int n_dims, class Int>\n\nANY_DEVICE_INLINE shape_t<n_dims, Int> operator-(const shape_t<n_dims, Int> &s0,\n\n int i) {\n","file_path":"include/zisa/memory/shape.hpp","rank":74,"score":43388.659805834825},{"content":" static constexpr int_t size(void) { return n_dims; }\n\n\n\n ANY_DEVICE_INLINE\n\n shape_t<1> shape(void) const { return shape_t<1>{n_dims}; }\n\n\n\n ANY_DEVICE_INLINE\n\n Int const *raw() const { return _raw_data; }\n\n\n\n ANY_DEVICE_INLINE\n\n Int *raw() { return _raw_data; }\n\n\n\nprotected:\n\n Int _raw_data[n_dims];\n\n};\n\n\n\ntemplate <int n_dims, class Int>\n\nANY_DEVICE_INLINE Int product(const shape_t<n_dims, Int> &shape) {\n\n Int nml = 1;\n\n for (Int k = 0; k < n_dims; ++k) {\n\n nml *= shape[k];\n","file_path":"include/zisa/memory/shape.hpp","rank":75,"score":43385.30049264159},{"content":" ANY_DEVICE_INLINE\n\n Int operator()(int_t dim) const { return (*this)[dim]; }\n\n\n\n ANY_DEVICE_INLINE\n\n Int &operator()(int_t dim) { return (*this)[dim]; }\n\n\n\n ANY_DEVICE_INLINE\n\n bool operator==(const shape_t &other) const {\n\n for (int_t i = 0; i < n_dims; ++i) {\n\n if ((*this)(i) != other(i))\n\n return false;\n\n }\n\n\n\n return true;\n\n }\n\n\n\n ANY_DEVICE_INLINE\n\n bool operator!=(const shape_t &other) const { return !((*this) == other); }\n\n\n\n ANY_DEVICE_INLINE\n","file_path":"include/zisa/memory/shape.hpp","rank":76,"score":43382.056785835215},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n#ifndef ARRAY_H_4L4PF\n\n#define ARRAY_H_4L4PF\n\n\n\n#include \"array_decl.hpp\"\n\n#include \"array_impl.hpp\"\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array.hpp","rank":77,"score":41637.83799211554},{"content":"}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing>::array(\n\n const array_const_view<T, n_dims, Indexing> &other, device_type device)\n\n : array(other.shape(), device) {\n\n zisa::copy(*this, other);\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing> &array<T, n_dims, Indexing>::operator=(\n\n const array_const_view<T, n_dims, Indexing> &other) {\n\n\n\n if (this->shape() != other.shape()) {\n\n (*this) = array<T, n_dims, Indexing>(other.shape());\n\n }\n\n\n\n // It's pointing to *all* of this array.\n\n if (raw_ptr(*this) == raw_ptr(other)) {\n\n return *this;\n","file_path":"include/zisa/memory/array_impl.hpp","rank":78,"score":40619.65831311679},{"content":"void copy(array<T, n_dims, Indexing> &dst,\n\n const array<T, n_dims, Indexing> &src) {\n\n\n\n return zisa::copy(array_view<T, n_dims, Indexing>(dst),\n\n array_const_view<T, n_dims, Indexing>(src));\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid copy(array<T, n_dims, Indexing> &dst,\n\n const array_view<T, n_dims, Indexing> &src) {\n\n return zisa::copy(array_view<T, n_dims, Indexing>(dst),\n\n array_const_view<T, n_dims, Indexing>(src));\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid copy(array<T, n_dims, Indexing> &dst,\n\n const array_const_view<T, n_dims, Indexing> &src) {\n\n return zisa::copy(array_view<T, n_dims, Indexing>(dst), src);\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid copy(const array_view<T, n_dims, Indexing> &dst,\n\n const array<T, n_dims, Indexing> &src) {\n\n return zisa::copy(dst, array_const_view<T, n_dims, Indexing>(src));\n\n}\n\n\n\n} // namespace zisa\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array_decl.hpp","rank":79,"score":40616.18398313016},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n#ifndef ARRAY_IMPL_H_1WC9M\n\n#define ARRAY_IMPL_H_1WC9M\n\n\n\n#include \"zisa/memory/array_base.hpp\"\n\n#include \"zisa/memory/array_decl.hpp\"\n\n\n\nnamespace zisa {\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing>::array(T *raw_ptr, const shape_type &shape)\n\n : super(shape, contiguous_memory<T>(product(shape))) {\n\n\n\n auto n = product(shape);\n\n for (int_t i = 0; i < n; ++i) {\n\n (*this)[i] = raw_ptr[i];\n\n }\n\n}\n\n\n","file_path":"include/zisa/memory/array_impl.hpp","rank":80,"score":40614.83301542653},{"content":"template <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing>::array(const shape_type &shape, device_type device)\n\n : super(shape, contiguous_memory<T>(product(shape), device)) {}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing>::array(const shape_type &shape,\n\n const allocator<T> &alloc)\n\n : super(shape, contiguous_memory<T>(product(shape), alloc)) {}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing>::array(\n\n const array_const_view<T, n_dims, Indexing> &other)\n\n : super(shape, contiguous_memory<T>(product(other.shape()))) {\n\n std::copy(other.begin(), other.end(), this->begin());\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing>::array(const array_view<T, n_dims, Indexing> &other)\n\n : super(shape, contiguous_memory<T>(product(other.shape()))) {\n\n std::copy(other.begin(), other.end(), this->begin());\n","file_path":"include/zisa/memory/array_impl.hpp","rank":81,"score":40612.582794476},{"content":" }\n\n\n\n std::copy(other.begin(), other.end(), this->begin());\n\n\n\n return *this;\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing> &array<T, n_dims, Indexing>::operator=(\n\n const array_view<T, n_dims, Indexing> &other) {\n\n\n\n (*this) = array_const_view<T, n_dims, Indexing>(other);\n\n return *this;\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n\nvoid save(HierarchicalWriter &writer,\n\n const array<T, n_dims, Indexing> &arr,\n\n const std::string &tag) {\n\n\n","file_path":"include/zisa/memory/array_impl.hpp","rank":82,"score":40609.83095719542},{"content":"\n\n};\n\n\n\nnamespace random {\n\ntemplate<class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing>\n\nuniform(const T &low, const T &high, const shape_t<n_dims> &shape, device_type device = device_type::cpu);\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing> empty_like(const array<T, n_dims, Indexing> &other) {\n\n return array<T, n_dims, Indexing>(other.shape());\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\nvoid save(HierarchicalWriter &writer,\n\n const array<T, n_dims, Indexing> &arr,\n\n const std::string &tag);\n\n\n\ntemplate <class T, int n_dims, template <int> class Indexing>\n","file_path":"include/zisa/memory/array_decl.hpp","rank":83,"score":40609.51422678842},{"content":" return arr;\n\n}\n\n\n\nnamespace random {\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n\narray<T, n_dims, Indexing> uniform(const T &low,\n\n const T &high,\n\n const shape_t<n_dims> &shape,\n\n device_type device) {\n\n LOG_ERR_IF(device != device_type::cpu, \"Implement first.\");\n\n static_assert(std::is_same<T, double>::value, \"Implement first.\");\n\n\n\n auto n = product(shape);\n\n auto x = array<T, n_dims, Indexing>(shape, device);\n\n\n\n std::random_device r;\n\n auto mt = std::mt19937(r());\n\n auto dist = std::uniform_real_distribution<T>(low, high);\n\n\n\n for (int_t i = 0; i < n; ++i) {\n","file_path":"include/zisa/memory/array_impl.hpp","rank":84,"score":40609.366055819926},{"content":" explicit array(const shape_type &shape,\n\n device_type device = device_type::cpu);\n\n array(const shape_type &shape, const allocator<T> &alloc);\n\n\n\n array &operator=(const array &) = default;\n\n array &operator=(array &&) noexcept = default;\n\n\n\n array &operator=(const array_const_view<T, n_dims, Indexing> &);\n\n array &operator=(const array_view<T, n_dims, Indexing> &);\n\n\n\n array_view<T, n_dims, Indexing> view() {\n\n return array_view<T, n_dims, Indexing>(*this);\n\n }\n\n\n\n array_const_view<T, n_dims, Indexing> const_view() const {\n\n return array_const_view<T, n_dims, Indexing>(*this);\n\n }\n\n\n\n [[nodiscard]] static array<T, n_dims, row_major>\n\n load(HierarchicalReader &reader, const std::string &tag);\n","file_path":"include/zisa/memory/array_decl.hpp","rank":85,"score":40607.70885291023},{"content":"\n\ntemplate <class T, int n_dims, template <int N> class Indexing = row_major>\n\nusing array_super_\n\n = array_base<T,\n\n Indexing<n_dims>,\n\n contiguous_memory<T>,\n\n shape_t<n_dims, typename contiguous_memory<T>::size_type>>;\n\n\n\n} // namespace detail\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing = row_major>\n","file_path":"include/zisa/memory/array_decl.hpp","rank":86,"score":40607.70222303586},{"content":" auto datatype = erase_data_type<T>();\n\n reader.read_array(arr.raw(), datatype, tag);\n\n}\n\n\n\ntemplate <class T, int n_dims>\n\nvoid load_impl(HierarchicalReader &reader,\n\n array<T, n_dims, row_major> &arr,\n\n const std::string &tag,\n\n bool_dispatch_tag) {\n\n\n\n using scalar_type = typename array_save_traits<T>::scalar_type;\n\n auto datatype = erase_data_type<scalar_type>();\n\n\n\n auto int_arr = array<scalar_type, n_dims, row_major>(arr.shape());\n\n reader.read_array(int_arr.raw(), datatype, tag);\n\n\n\n std::copy(int_arr.cbegin(), int_arr.cend(), arr.begin());\n\n}\n\n\n\ntemplate <class T, int n_dims, template <int N> class Indexing>\n","file_path":"include/zisa/memory/array_impl.hpp","rank":87,"score":40603.193517501764},{"content":"array<T, n_dims, row_major>\n\narray<T, n_dims, Indexing>::load(HierarchicalReader &reader,\n\n const std::string &tag) {\n\n\n\n static_assert(std::is_same<row_major<n_dims>, Indexing<n_dims>>::value,\n\n \"This has only been implemented for row-major index order.\");\n\n\n\n auto dims = reader.dims(tag);\n\n auto shape = shape_t<n_dims>{};\n\n\n\n // Some types T are stored as an array of fixed size. Such types may require\n\n // an additional dimension (at the end of `dims`).\n\n LOG_ERR_IF(dims.size() < n_dims, \"Dimension mismatch.\");\n\n for (int_t i = 0; i < n_dims; ++i) {\n\n shape[i] = dims[i];\n\n }\n\n\n\n auto arr = array<T, n_dims>(shape, device_type::cpu);\n\n load_impl(reader, arr, tag, typename array_save_traits<T>::dispatch_tag{});\n\n\n","file_path":"include/zisa/memory/array_impl.hpp","rank":88,"score":40602.94481425956},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n#ifndef ARRAY_H_TH7WE\n\n#define ARRAY_H_TH7WE\n\n\n\n#include <zisa/config.hpp>\n\n\n\n#include <zisa/memory/array_base_decl.hpp>\n\n#include <zisa/memory/column_major.hpp>\n\n#include <zisa/memory/contiguous_memory.hpp>\n\n#include <zisa/memory/row_major.hpp>\n\n#include <zisa/memory/shape.hpp>\n\n\n\n#include <random>\n\n#include <zisa/memory/array_view.hpp>\n\n\n\nnamespace zisa {\n\n\n\nnamespace detail {\n","file_path":"include/zisa/memory/array_decl.hpp","rank":89,"score":40598.602752353436},{"content":" save(writer, arr.const_view(), tag);\n\n}\n\n\n\ntemplate <class T, int n_dims>\n\nvoid load_impl(HierarchicalReader &reader,\n\n array<T, n_dims, row_major> &arr,\n\n const std::string &tag,\n\n split_array_dispatch_tag) {\n\n\n\n using scalar_type = typename array_save_traits<T>::scalar_type;\n\n auto datatype = erase_data_type<scalar_type>();\n\n reader.read_array(arr.raw(), datatype, tag);\n\n}\n\n\n\ntemplate <class T, int n_dims>\n\nvoid load_impl(HierarchicalReader &reader,\n\n array<T, n_dims, row_major> &arr,\n\n const std::string &tag,\n\n default_dispatch_tag) {\n\n\n","file_path":"include/zisa/memory/array_impl.hpp","rank":90,"score":40597.036459508585},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n/* Array traits.\n\n *\n\n */\n\n\n\n#ifndef ARRAY_TRAITS_H_8G39N\n\n#define ARRAY_TRAITS_H_8G39N\n\n\n\n#include <type_traits>\n\n#include <zisa/config.hpp>\n\n#include <zisa/memory/device_type.hpp>\n\n\n\nnamespace zisa {\n\n\n\nnamespace detail {\n\ntemplate <class A>\n\ndevice_type memory_location_(const A &) {\n\n return device_type::unknown;\n","file_path":"include/zisa/memory/array_traits.hpp","rank":91,"score":40595.96324458236},{"content":" x[i] = dist(mt);\n\n }\n\n\n\n return x;\n\n}\n\n}\n\n\n\n} // namespace zisa\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array_impl.hpp","rank":92,"score":40590.02891593458},{"content":"}\n\n\n\ntemplate <class A>\n\ndevice_type memory_location_(\n\n const typename std::enable_if<\n\n std::is_same<decltype(std::declval<A>().device()), device_type>::value,\n\n A>::type &a) {\n\n return a.device();\n\n}\n\n}\n\n\n\ntemplate <class Array>\n","file_path":"include/zisa/memory/array_traits.hpp","rank":93,"score":40590.02145616482},{"content":"// SPDX-License-Identifier: MIT\n\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\n\n\n\n#ifndef ARRAY_BASE_H_BQ44X\n\n#define ARRAY_BASE_H_BQ44X\n\n\n\n#include \"array_base_decl.hpp\"\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array_base.hpp","rank":94,"score":40587.19539456684},{"content":"template <class T, class Indexing, class Array, class Shape>\n\nANY_DEVICE_INLINE auto shape(const array_base<T, Indexing, Array, Shape> &a)\n\n -> decltype(a.shape()) {\n\n return a.shape();\n\n}\n\n\n\n} // namespace zisa\n\n\n\n#endif /* end of include guard */\n","file_path":"include/zisa/memory/array_base_decl.hpp","rank":95,"score":39612.71101415685},{"content":"}\n\n\n\ntemplate <class T, class Indexing, class Array, class Shape>\n\nANY_DEVICE_INLINE auto raw_ptr(array_base<T, Indexing, Array, Shape> &a)\n\n -> decltype(a.raw()) {\n\n return a.raw();\n\n}\n\n\n\ntemplate <class T, class Indexing, class Array, class Shape>\n\nANY_DEVICE_INLINE auto raw_ptr(const array_base<T, Indexing, Array, Shape> &a)\n\n -> decltype(a.raw()) {\n\n return a.raw();\n\n}\n\n\n\ntemplate <class T, class Indexing, class Array, class Shape>\n\nANY_DEVICE_INLINE auto shape(array_base<T, Indexing, Array, Shape> &a)\n\n -> decltype(a.shape()) {\n\n return a.shape();\n\n}\n\n\n","file_path":"include/zisa/memory/array_base_decl.hpp","rank":96,"score":39612.445218263165},{"content":"}\n\n\n\n#endif\n\n\n\nTEST_CASE(\"array; builds for general Indexing.\", \"[array]\") {\n\n\n\n // The point is to check that `array<double, 3, Indexing>`\n\n // compiles fine. Despite the fact that `save` and `load` only\n\n // work if `Indexing == row_major`.\n\n\n\n auto shape = zisa::shape_t<3>{3ul, 4ul, 2ul};\n\n\n\n auto a = array<double, 3, column_major>(shape);\n\n for (zisa::int_t i = 0; i < a.size(); ++i) {\n\n a[i] = double(i);\n\n }\n\n}\n\n\n\n#if ZISA_HAS_CUDA\n\n\n","file_path":"test/zisa/unit_test/memory/array.cpp","rank":97,"score":39609.80355548552},{"content":" template <class... Ints>\n\n ANY_DEVICE_INLINE const T &operator()(Ints... ints) const {\n\n auto l = Indexing::linear_index(shape(), integer_cast<size_type>(ints)...);\n\n return (*this)[l];\n\n }\n\n\n\n ANY_DEVICE_INLINE const shape_type &shape() const { return _shape; }\n\n ANY_DEVICE_INLINE size_type shape(size_type k) const { return _shape[k]; }\n\n ANY_DEVICE_INLINE size_type size() const { return product(_shape); }\n\n\n\n ANY_DEVICE_INLINE pointer raw() { return raw_ptr(_array); }\n\n ANY_DEVICE_INLINE const_pointer raw() const { return raw_ptr(_array); }\n\n\n\n ANY_DEVICE_INLINE pointer begin() { return _array.begin(); }\n\n ANY_DEVICE_INLINE const_pointer begin() const { return _array.begin(); }\n\n ANY_DEVICE_INLINE const_pointer cbegin() const { return _array.cbegin(); }\n\n\n\n ANY_DEVICE_INLINE pointer end() { return _array.end(); }\n\n ANY_DEVICE_INLINE const_pointer end() const { return _array.end(); }\n\n ANY_DEVICE_INLINE const_pointer cend() const { return _array.cend(); }\n","file_path":"include/zisa/memory/array_base_decl.hpp","rank":98,"score":39608.91579147159},{"content":"\n\n inline device_type device() const {\n\n return array_traits<Array>::device(_array);\n\n }\n\n\n\nprivate:\n\n Shape _shape;\n\n Array _array;\n\n};\n\n\n\ntemplate <class T, class Indexing, class Array, class Shape>\n\ndevice_type memory_location(const array_base<T, Indexing, Array, Shape> &arr) {\n\n return arr.device();\n\n}\n\n\n\ntemplate <class T, class Indexing, class Array, class Shape>\n\nvoid fill(array_base<T, Indexing, Array, Shape> &arr, const T &value) {\n\n // TODO move to a library call of some sort.\n\n int_t n = arr.size();\n\n for (int_t i = 0; i < n; ++i) {\n","file_path":"include/zisa/memory/array_base_decl.hpp","rank":99,"score":39607.47349803096}],"string":"[\n {\n \"content\": \"class array_const_view : public array_view_base<const T, Indexing<n_dims>> {\\n\\n\\n\\nprivate:\\n\\n using super = array_view_base<const T, Indexing<n_dims>>;\\n\\n using size_type = typename super::size_type;\\n\\n\\n\\npublic:\\n\\n ANY_DEVICE_INLINE\\n\\n array_const_view(const shape_t<n_dims> &shape,\\n\\n T const *ptr,\\n\\n device_type mem_location = device_type::unknown)\\n\\n : super(shape, ptr, mem_location) {}\\n\\n\\n\\n template <class Array, class Shape>\\n\\n array_const_view(const array_base<T, Indexing<n_dims>, Array, Shape> &other)\\n\\n : array_const_view(zisa::shape(other),\\n\\n zisa::raw_ptr(other),\\n\\n zisa::memory_location(other)) {}\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 0,\n \"score\": 235025.09631773861\n },\n {\n \"content\": \"class array_view : public array_view_base<T, Indexing<n_dims>> {\\n\\nprivate:\\n\\n using super = array_view_base<T, Indexing<n_dims>>;\\n\\n using size_type = typename super::size_type;\\n\\n\\n\\npublic:\\n\\n ANY_DEVICE_INLINE\\n\\n array_view(const shape_t<n_dims> &shape,\\n\\n T *ptr,\\n\\n device_type mem_location = device_type::unknown);\\n\\n\\n\\n template <class Array, class Shape>\\n\\n array_view(array_base<T, Indexing<n_dims>, Array, Shape> &other);\\n\\n\\n\\n array_view(std::vector<T> &v);\\n\\n\\n\\n ANY_DEVICE_INLINE T *raw() const;\\n\\n ANY_DEVICE_INLINE T &operator[](size_type i) const;\\n\\n\\n\\n template <class... Ints>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 1,\n \"score\": 187199.53677227077\n },\n {\n \"content\": \"class array_const_view;\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing = row_major>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_fwd.hpp\",\n \"rank\": 2,\n \"score\": 172997.86280064506\n },\n {\n \"content\": \"class array : public detail::array_super_<T, n_dims, Indexing> {\\n\\nprivate:\\n\\n using super = detail::array_super_<T, n_dims, Indexing>;\\n\\n\\n\\nprotected:\\n\\n using shape_type = typename super::shape_type;\\n\\n\\n\\npublic:\\n\\n using super::super;\\n\\n\\n\\n array(const array &) = default;\\n\\n array(array &&) noexcept = default;\\n\\n\\n\\n array(const array_const_view<T, n_dims, Indexing> &other,\\n\\n device_type mem_loc);\\n\\n\\n\\n explicit array(const array_const_view<T, n_dims, Indexing> &other);\\n\\n explicit array(const array_view<T, n_dims, Indexing> &other);\\n\\n\\n\\n array(T *raw_ptr, const shape_type &shape);\\n\",\n \"file_path\": \"include/zisa/memory/array_decl.hpp\",\n \"rank\": 3,\n \"score\": 166367.92751748947\n },\n {\n \"content\": \"class array;\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 4,\n \"score\": 163842.72401537676\n },\n {\n \"content\": \"class array_view;\\n\\n\\n\\n}\\n\\n#endif // ZISA_ARRAY_VIEW_FWD_HPP\\n\",\n \"file_path\": \"include/zisa/memory/array_view_fwd.hpp\",\n \"rank\": 5,\n \"score\": 142818.68251159138\n },\n {\n \"content\": \"class array_view_base {\\n\\nprotected:\\n\\n using size_type = typename array_traits<T *>::size_type;\\n\\n using shape_type = shape_t<indexing_traits<Indexing>::n_dims, size_type>;\\n\\n\\n\\npublic:\\n\\n ANY_DEVICE\\n\\n array_view_base(shape_type shape, T *ptr, device_type mem_location);\\n\\n\\n\\n ANY_DEVICE_INLINE size_type size() const;\\n\\n\\n\\n ANY_DEVICE_INLINE const shape_type &shape() const;\\n\\n ANY_DEVICE_INLINE size_type shape(size_type i) const;\\n\\n\\n\\n ANY_DEVICE_INLINE device_type memory_location() const {\\n\\n return _mem_location;\\n\\n }\\n\\n\\n\\nprotected:\\n\\n shape_type _shape;\\n\\n T *_ptr;\\n\\n device_type _mem_location;\\n\\n};\\n\\n\\n\\ntemplate <class T, class Indexing>\\n\\ndevice_type memory_location(const array_view_base<T, Indexing> &view);\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 6,\n \"score\": 140764.37667346295\n },\n {\n \"content\": \"struct indexing_traits;\\n\\n\\n\\ntemplate <class Array>\\n\",\n \"file_path\": \"include/zisa/memory/array_base_decl.hpp\",\n \"rank\": 7,\n \"score\": 103166.1268741088\n },\n {\n \"content\": \"class array_base {\\n\\npublic:\\n\\n using shape_type = Shape;\\n\\n using size_type = typename array_traits<Array>::size_type;\\n\\n using pointer = typename array_traits<Array>::pointer;\\n\\n using const_pointer = typename array_traits<Array>::const_pointer;\\n\\n\\n\\npublic:\\n\\n static constexpr int n_dims = indexing_traits<Indexing>::n_dims;\\n\\n\\n\\npublic:\\n\\n array_base() = default;\\n\\n\\n\\n array_base(Shape shape, Array array)\\n\\n : _shape(std::move(shape)), _array(std::move(array)) {}\\n\\n\\n\\n array_base(const array_base &other) = default;\\n\\n array_base(array_base &&other) noexcept = default;\\n\\n\\n\\n ~array_base() = default;\\n\",\n \"file_path\": \"include/zisa/memory/array_base_decl.hpp\",\n \"rank\": 8,\n \"score\": 101953.25360160958\n },\n {\n \"content\": \"class array_base;\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array_base_fwd.hpp\",\n \"rank\": 9,\n \"score\": 101953.25360160958\n },\n {\n \"content\": \" class SFINAE\\n\\n = typename std::enable_if<all_integral<Ints...>::value, void>::type>\\n\\n ANY_DEVICE_INLINE shape_t(Ints... ints) noexcept\\n\\n : _raw_data{integer_cast<Int>(ints)...} {}\\n\\n\\n\\n shape_t &operator=(const shape_t &) noexcept = default;\\n\\n shape_t &operator=(shape_t &&) noexcept = default;\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n Int operator[](int_t dim) const {\\n\\n assert(dim < n_dims);\\n\\n return _raw_data[dim];\\n\\n }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n Int &operator[](int_t dim) {\\n\\n assert(dim < n_dims);\\n\\n return _raw_data[dim];\\n\\n }\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 10,\n \"score\": 100857.07797147511\n },\n {\n \"content\": \"class locked_ptr {\\n\\npublic:\\n\\n locked_ptr() : data(nullptr), index(0), allocator(nullptr) {}\\n\\n\\n\\n locked_ptr(T *const data,\\n\\n int_t index,\\n\\n std::shared_ptr<block_allocator<T>> allocator)\\n\\n : data(data), index(index), allocator(std::move(allocator)) {}\\n\\n\\n\\n locked_ptr(const locked_ptr &other) = delete;\\n\\n\\n\\n locked_ptr(locked_ptr &&other) { *this = std::move(other); }\\n\\n\\n\\n ~locked_ptr() {\\n\\n if (data != nullptr && allocator != nullptr) {\\n\\n allocator->release(*this);\\n\\n }\\n\\n }\\n\\n\\n\\n void operator=(const locked_ptr &other) = delete;\\n\",\n \"file_path\": \"include/zisa/memory/block_allocator.hpp\",\n \"rank\": 11,\n \"score\": 97345.867527074\n },\n {\n \"content\": \"enum class ErasedDataType { DOUBLE, FLOAT, INT, UNSIGNED_LONG, CHAR };\\n\\n\\n\\nnamespace detail {\\n\\n\\n\\ntemplate <class T>\\n\",\n \"file_path\": \"include/zisa/io/hierarchical_file.hpp\",\n \"rank\": 12,\n \"score\": 93957.00745159361\n },\n {\n \"content\": \"struct array_traits<T *> {\\n\\n using pointer = typename std::remove_const<T>::type *;\\n\\n using const_pointer = typename std::add_const<T>::type *;\\n\\n using size_type = std::size_t;\\n\\n};\\n\\n\\n\\ntemplate <class T>\\n\\nANY_DEVICE_INLINE auto raw_ptr(T *a) -> decltype(a);\\n\\n\\n\\ntemplate <class T, class Indexing>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 13,\n \"score\": 76815.43079652669\n },\n {\n \"content\": \"#ifndef ARRAY_VIEW_HPP_VEWZW\\n\\n#define ARRAY_VIEW_HPP_VEWZW\\n\\n\\n\\n#include \\\"array_view_decl.hpp\\\"\\n\\n#include \\\"array_view_impl.hpp\\\"\\n\\n\\n\\n#endif // ARRAY_VIEW_HPP\\n\",\n \"file_path\": \"include/zisa/memory/array_view.hpp\",\n \"rank\": 14,\n \"score\": 75512.97024025457\n },\n {\n \"content\": \" array_const_view(const array_view<T, n_dims, Indexing> &other)\\n\\n : super(other.shape(), other.raw(), zisa::memory_location(other)) {}\\n\\n\\n\\n array_const_view(const std::vector<T> &v)\\n\\n : array_const_view(shape_t<1>{v.size()}, v.data(), device_type::cpu) {}\\n\\n\\n\\n ANY_DEVICE_INLINE const T *raw() const { return this->_ptr; }\\n\\n ANY_DEVICE_INLINE const T &operator[](size_type i) const {\\n\\n return this->_ptr[i];\\n\\n }\\n\\n\\n\\n template <class... Ints>\\n\\n ANY_DEVICE_INLINE const T &operator()(Ints... ints) const {\\n\\n auto l = Indexing<n_dims>::linear_index(this->shape(),\\n\\n integer_cast<size_type>(ints)...);\\n\\n return (*this)[l];\\n\\n }\\n\\n\\n\\n ANY_DEVICE_INLINE T const *begin() const { return this->_ptr; }\\n\\n ANY_DEVICE_INLINE T const *end() const { return this->_ptr + this->size(); }\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 15,\n \"score\": 73681.59031617234\n },\n {\n \"content\": \" return a.raw();\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nANY_DEVICE_INLINE auto raw_ptr(const array_const_view<T, n_dims, Indexing> &a)\\n\\n -> decltype(a.raw()) {\\n\\n return a.raw();\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid fill(const array_view<T, n_dims, Indexing> &dst, const T &value) {\\n\\n zisa::fill(raw_ptr(dst), memory_location(dst), dst.size(), value);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid copy(const array_view<T, n_dims, Indexing> &dst,\\n\\n const array_const_view<T, n_dims, Indexing> &src) {\\n\\n\\n\\n zisa::internal::copy(dst.raw(),\\n\\n memory_location(dst),\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 17,\n \"score\": 73680.21569150838\n },\n {\n \"content\": \"}\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims>\\n\\narray_view<T, n_dims, row_major>\\n\\nslice(const array_view<T, n_dims, row_major> &arr, int_t i0, int_t i1) {\\n\\n auto const_view\\n\\n = detail::slice(array_const_view<T, n_dims, row_major>(arr), i0, i1);\\n\\n return {const_view.shape(), const_cast<T *>(const_view.raw())};\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims>\\n\\narray_const_view<T, n_dims, row_major> const_slice(\\n\\n const array_const_view<T, n_dims, row_major> &arr, int_t i0, int_t i1) {\\n\\n return detail::slice(arr, i0, i1);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nANY_DEVICE_INLINE auto raw_ptr(const array_view<T, n_dims, Indexing> &a)\\n\\n -> decltype(a.raw()) {\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 20,\n \"score\": 73677.42207505243\n },\n {\n \"content\": \" const std::string &tag,\\n\\n bool_dispatch_tag) {\\n\\n\\n\\n using scalar_type = typename array_save_traits<bool>::scalar_type;\\n\\n auto int_arr = std::vector<scalar_type>(arr.size());\\n\\n std::copy(arr.cbegin(), arr.cend(), int_arr.begin());\\n\\n\\n\\n auto int_arr_view = array_const_view<scalar_type, n_dims, row_major>(\\n\\n arr.shape(), int_arr.data());\\n\\n\\n\\n save(writer, int_arr_view, tag);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid save(HierarchicalWriter &writer,\\n\\n const array_const_view<T, n_dims, Indexing> &arr,\\n\\n const std::string &tag) {\\n\\n\\n\\n save(writer, arr, tag, typename array_save_traits<T>::dispatch_tag{});\\n\\n}\\n\\n\\n\\n} // namespace zisa\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 22,\n \"score\": 73676.20646617339\n },\n {\n \"content\": \"\\n\\n ANY_DEVICE_INLINE T const *cbegin() const { return this->_ptr; }\\n\\n ANY_DEVICE_INLINE T const *cend() const { return this->_ptr + this->size(); }\\n\\n};\\n\\n\\n\\n#ifndef __CUDACC__\\n\\ntemplate <class T>\\n\\narray_const_view(const std::vector<T> &) -> array_const_view<T, 1, row_major>;\\n\\n#endif\\n\\n\\n\\nnamespace detail {\\n\\ntemplate <class T, int n_dims>\\n\\narray_const_view<T, n_dims, row_major>\\n\\nslice(const array_const_view<T, n_dims, row_major> &arr, int_t i0, int_t i1) {\\n\\n auto sub_shape = arr.shape();\\n\\n sub_shape[0] = i1 - i0;\\n\\n\\n\\n int_t offset = i0 * (product(sub_shape) / (i1 - i0));\\n\\n auto ptr = arr.raw() + offset;\\n\\n return {sub_shape, ptr};\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 23,\n \"score\": 73676.15883586284\n },\n {\n \"content\": \" src.raw(),\\n\\n memory_location(src),\\n\\n src.size());\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid copy(const array_view<T, n_dims, Indexing> &dst,\\n\\n const array_view<T, n_dims, Indexing> &src) {\\n\\n return zisa::copy(dst, array_const_view<T, n_dims, Indexing>(src));\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid save(HierarchicalWriter &writer,\\n\\n const array_view<T, n_dims, Indexing> &arr,\\n\\n const std::string &tag) {\\n\\n\\n\\n save(writer, array_const_view<T, n_dims, Indexing>(arr), tag);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 24,\n \"score\": 73675.06191196124\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n#ifndef ZISA_ARRAY_VIEW_FWD_HPP_UEIWQ\\n\\n#define ZISA_ARRAY_VIEW_FWD_HPP_UEIWQ\\n\\n\\n\\n#include <zisa/memory/row_major.hpp>\\n\\n\\n\\nnamespace zisa {\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing = row_major>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_fwd.hpp\",\n \"rank\": 27,\n \"score\": 73671.2240557667\n },\n {\n \"content\": \" ANY_DEVICE_INLINE T &operator()(Ints... ints) const;\\n\\n\\n\\n ANY_DEVICE_INLINE T *begin() const;\\n\\n ANY_DEVICE_INLINE T *end() const;\\n\\n\\n\\n ANY_DEVICE_INLINE T const *cbegin() const;\\n\\n ANY_DEVICE_INLINE T const *cend() const;\\n\\n\\n\\n void copy_data(const array_view<T, n_dims, Indexing> &other) const;\\n\\n void copy_data(const array_const_view<T, n_dims, Indexing> &other) const;\\n\\n};\\n\\n\\n\\n#ifndef __CUDACC__\\n\\ntemplate <class T>\\n\\narray_view(std::vector<T> &v) -> array_view<T, 1, row_major>;\\n\\n#endif\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 28,\n \"score\": 73670.77993825519\n },\n {\n \"content\": \"void save(HierarchicalWriter &writer,\\n\\n const array_const_view<T, n_dims, row_major> &arr,\\n\\n const std::string &tag,\\n\\n default_dispatch_tag) {\\n\\n\\n\\n T const *const data = arr.raw();\\n\\n const auto &shape = arr.shape();\\n\\n\\n\\n auto data_type = erase_data_type<T>();\\n\\n\\n\\n std::size_t dims[n_dims];\\n\\n for (int_t i = 0; i < n_dims; ++i) {\\n\\n dims[i] = shape(i); // size of (i, j, k) axes\\n\\n }\\n\\n\\n\\n writer.write_array(data, data_type, tag, n_dims, dims);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims>\\n\\nvoid save(HierarchicalWriter &writer,\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 29,\n \"score\": 73665.58092190858\n },\n {\n \"content\": \" const array_const_view<T, n_dims, row_major> &arr,\\n\\n const std::string &tag,\\n\\n split_array_dispatch_tag) {\\n\\n\\n\\n using scalar_type = typename array_save_traits<T>::scalar_type;\\n\\n auto data_type = erase_data_type<scalar_type>();\\n\\n\\n\\n constexpr int_t rank = n_dims + 1;\\n\\n std::size_t dims[rank];\\n\\n for (int_t i = 0; i < rank - 1; ++i) {\\n\\n dims[i] = arr.shape(i);\\n\\n }\\n\\n dims[rank - 1] = T::size();\\n\\n\\n\\n writer.write_array(arr.raw(), data_type, tag, rank, dims);\\n\\n}\\n\\n\\n\\ntemplate <int n_dims>\\n\\nvoid save(HierarchicalWriter &writer,\\n\\n const array_const_view<bool, n_dims, row_major> &arr,\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 30,\n \"score\": 73665.28267335717\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n#ifndef ARRAY_VIEW_H_NPPW3\\n\\n#define ARRAY_VIEW_H_NPPW3\\n\\n\\n\\n#include <zisa/config.hpp>\\n\\n\\n\\n#include <zisa/io/hierarchical_writer.hpp>\\n\\n#include <zisa/memory/array_base.hpp>\\n\\n#include <zisa/memory/array_traits.hpp>\\n\\n#include <zisa/memory/array_view_fwd.hpp>\\n\\n#include <zisa/memory/column_major.hpp>\\n\\n#include <zisa/memory/contiguous_memory.hpp>\\n\\n#include <zisa/memory/copy.hpp>\\n\\n#include <zisa/memory/shape.hpp>\\n\\n#include <zisa/meta/add_const_if.hpp>\\n\\n#include <zisa/meta/if_t.hpp>\\n\\n\\n\\nnamespace zisa {\\n\\n\\n\\ntemplate <class T>\\n\",\n \"file_path\": \"include/zisa/memory/array_view_decl.hpp\",\n \"rank\": 31,\n \"score\": 73665.00729968806\n },\n {\n \"content\": \"struct indexing_traits;\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/row_major.hpp\",\n \"rank\": 32,\n \"score\": 73638.16692259753\n },\n {\n \"content\": \"struct indexing_traits;\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/column_major.hpp\",\n \"rank\": 33,\n \"score\": 73638.16692259755\n },\n {\n \"content\": \"struct indexing_traits<row_major<3>> {\\n\\n static constexpr int_t n_dims = 3;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/row_major.hpp\",\n \"rank\": 34,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"struct indexing_traits<column_major<2>> {\\n\\n static constexpr int_t n_dims = 2;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/column_major.hpp\",\n \"rank\": 35,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"struct indexing_traits<row_major<1>> {\\n\\n static constexpr int_t n_dims = 1;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/row_major.hpp\",\n \"rank\": 36,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"struct indexing_traits<column_major<4>> {\\n\\n static constexpr int_t n_dims = 4;\\n\\n};\\n\\n\\n\\n} // namespace zisa\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/column_major.hpp\",\n \"rank\": 37,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"struct indexing_traits<column_major<1>> {\\n\\n static constexpr int_t n_dims = 1;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/column_major.hpp\",\n \"rank\": 38,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"struct indexing_traits<row_major<4>> {\\n\\n static constexpr int_t n_dims = 4;\\n\\n};\\n\\n\\n\\n} // namespace zisa\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/row_major.hpp\",\n \"rank\": 39,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"struct indexing_traits<row_major<2>> {\\n\\n static constexpr int_t n_dims = 2;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/row_major.hpp\",\n \"rank\": 40,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"struct indexing_traits<column_major<3>> {\\n\\n static constexpr int_t n_dims = 3;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/column_major.hpp\",\n \"rank\": 41,\n \"score\": 70262.80563461724\n },\n {\n \"content\": \"class allocator {\\n\\npublic:\\n\\n using value_type = T;\\n\\n using size_type = size_t;\\n\\n using pointer = T *;\\n\\n\\n\\npublic:\\n\\n allocator() : resource(make_memory_resource<T>(device_type::cpu)) {}\\n\\n allocator(device_type device) : resource(make_memory_resource<T>(device)) {}\\n\\n allocator(std::shared_ptr<memory_resource<T>> resource)\\n\\n : resource(std::move(resource)) {}\\n\\n allocator(const allocator &alloc) = default;\\n\\n allocator(allocator &&alloc) = default;\\n\\n\\n\\n inline pointer allocate(size_type n) { return resource->allocate(n); }\\n\\n inline void deallocate(pointer ptr, size_type n) {\\n\\n resource->deallocate(ptr, n);\\n\\n }\\n\\n\\n\\n template <class... Args>\\n\",\n \"file_path\": \"include/zisa/memory/allocator.hpp\",\n \"rank\": 42,\n \"score\": 65539.5362057976\n },\n {\n \"content\": \"class memory_resource {\\n\\npublic:\\n\\n using value_type = T;\\n\\n using size_type = std::size_t;\\n\\n using pointer = T *;\\n\\n\\n\\npublic:\\n\\n virtual ~memory_resource() = default;\\n\\n\\n\\n inline pointer allocate(size_type n) { return do_allocate(n); }\\n\\n inline void deallocate(pointer ptr, size_type n) { do_deallocate(ptr, n); }\\n\\n\\n\\n inline device_type device() const { return do_device(); }\\n\\n\\n\\nprotected:\\n\\n virtual pointer do_allocate(size_type n) = 0;\\n\\n virtual void do_deallocate(pointer ptr, size_type n) = 0;\\n\\n\\n\\n virtual device_type do_device() const = 0;\\n\\n};\\n\\n\\n\\n} // namespace zisa\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/memory_resource.hpp\",\n \"rank\": 43,\n \"score\": 63538.76986520287\n },\n {\n \"content\": \"class block_allocator;\\n\\n\\n\\ntemplate <class T>\\n\",\n \"file_path\": \"include/zisa/memory/block_allocator.hpp\",\n \"rank\": 44,\n \"score\": 63538.76986520287\n },\n {\n \"content\": \"class block_allocator\\n\\n : public std::enable_shared_from_this<block_allocator<T>> {\\n\\npublic:\\n\\n block_allocator(int_t max_elements) {\\n\\n free_list.reserve(max_elements);\\n\\n large_block.reserve(max_elements);\\n\\n }\\n\\n\\n\\n ~block_allocator() {\\n\\n for (auto &ptr : large_block) {\\n\\n delete ptr;\\n\\n }\\n\\n }\\n\\n\\n\\n template <class... Args>\\n\\n locked_ptr<T> allocate(Args &&...args) {\\n\\n auto [index, allocated] = acquire();\\n\\n\\n\\n if (!allocated) {\\n\\n large_block[index] = new T(std::forward<Args &&>(args)...);\\n\",\n \"file_path\": \"include/zisa/memory/block_allocator.hpp\",\n \"rank\": 45,\n \"score\": 63538.76986520287\n },\n {\n \"content\": \"class HierarchicalFile {\\n\\npublic:\\n\\n using DataType = ErasedDataType;\\n\\n\\n\\npublic:\\n\\n virtual ~HierarchicalFile() = default;\\n\\n\\n\\n /// Open a group.\\n\\n void open_group(const std::string &group_name);\\n\\n\\n\\n /// Close a group.\\n\\n void close_group();\\n\\n\\n\\n /// Close the current group and open another group\\n\\n void switch_group(const std::string &group_name);\\n\\n\\n\\n /// Does this group exist in the file?\\n\\n bool group_exists(const std::string &group_name) const;\\n\\n\\n\\n /// Human readable description of the current hierarchy.\\n\",\n \"file_path\": \"include/zisa/io/hierarchical_file.hpp\",\n \"rank\": 46,\n \"score\": 63538.76986520287\n },\n {\n \"content\": \"class HDF5Writer;\\n\",\n \"file_path\": \"include/zisa/io/hdf5_writer_fwd.hpp\",\n \"rank\": 47,\n \"score\": 62608.78207652447\n },\n {\n \"content\": \"class HDF5DataType {\\n\\npublic:\\n\\n /// Initialize object.\\n\\n /** @param h5_type The H5 identifier of the data-type.\\n\\n * @param size Size in bytes of the data type.\\n\\n */\\n\\n HDF5DataType(const hid_t &h5_type, size_t size);\\n\\n\\n\\n virtual ~HDF5DataType();\\n\\n\\n\\n /// Return the HDF5 identifier of the data-type.\\n\\n hid_t operator()() const;\\n\\n\\n\\npublic:\\n\\n size_t size; ///< essentially, `sizeof(T)`\\n\\n\\n\\nprotected:\\n\\n hid_t h5_type;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/zisa/io/hdf5_file.hpp\",\n \"rank\": 48,\n \"score\": 62608.78207652447\n },\n {\n \"content\": \"class NetCDFFileStructure {\\n\\nprivate:\\n\\n using dim_t = std::tuple<std::string, std::size_t>;\\n\\n using vector_dims_t = std::vector<dim_t>;\\n\\n\\n\\n using var_t\\n\\n = std::tuple<std::string, std::vector<std::string>, ErasedDataType>;\\n\\n using vector_vars_t = std::vector<var_t>;\\n\\n\\n\\npublic:\\n\\n NetCDFFileStructure(const vector_dims_t &dims, const vector_vars_t &vars);\\n\\n\\n\\n /// Does the structure appear to be plausible?\\n\\n bool is_valid() const;\\n\\n\\n\\n const auto &dims() const;\\n\\n const auto &vars() const;\\n\\n\\n\\nprivate:\\n\\n void add_dim(const dim_t &dim);\\n\\n void add_dims(const vector_dims_t &dims);\\n\\n\\n\\n void add_vars(const vector_vars_t &vars);\\n\\n void add_var(const var_t &var);\\n\\n\\n\\nprivate:\\n\\n vector_dims_t dims_;\\n\\n vector_vars_t vars_;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/zisa/io/netcdf_file.hpp\",\n \"rank\": 49,\n \"score\": 61721.42224711478\n },\n {\n \"content\": \"class contiguous_memory_base {\\n\\npublic:\\n\\n using const_pointer =\\n\\n typename std::allocator_traits<Allocator>::const_pointer;\\n\\n using pointer = typename std::allocator_traits<Allocator>::pointer;\\n\\n using size_type = typename std::allocator_traits<Allocator>::size_type;\\n\\n\\n\\npublic:\\n\\n contiguous_memory_base()\\n\\n : _raw_data(nullptr), _n_elements(0), _allocator(nullptr) {}\\n\\n\\n\\n explicit contiguous_memory_base(size_type n_elements,\\n\\n const Allocator &allocator = Allocator());\\n\\n\\n\\n contiguous_memory_base(const contiguous_memory_base &other);\\n\\n contiguous_memory_base(contiguous_memory_base &&other) noexcept;\\n\\n\\n\\n ~contiguous_memory_base();\\n\\n\\n\\n contiguous_memory_base &operator=(const contiguous_memory_base &other);\\n\",\n \"file_path\": \"include/zisa/memory/contiguous_memory_base_decl.hpp\",\n \"rank\": 50,\n \"score\": 60873.82513015318\n },\n {\n \"content\": \"enum class device_type {\\n\\n cpu, // CPU\\n\\n cuda, // NVIDIA GPU through CUDA\\n\\n unknown // If it's unclear where the memory resides.\\n\\n};\\n\\n\\n\\n} // namespace zisa\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/device_type.hpp\",\n \"rank\": 51,\n \"score\": 60502.31721272063\n },\n {\n \"content\": \"/// Read data from HDF5 file sequentially.\\n\\nclass HDF5SerialReader : public HDF5Reader {\\n\\nprivate:\\n\\n using super = HDF5Reader;\\n\\n\\n\\npublic:\\n\\n explicit HDF5SerialReader(const std::string &filename);\\n\\n\\n\\nprotected:\\n\\n virtual std::vector<hsize_t>\\n\\n do_hdf5_dims(const std::string &tag) const override;\\n\\n\\n\\n virtual void do_read_array(void *data,\\n\\n const HDF5DataType &data_type,\\n\\n const std::string &tag) const override;\\n\\n\\n\\n virtual void do_read_scalar(void *data,\\n\\n const HDF5DataType &data_type,\\n\\n const std::string &tag) const override;\\n\\n\\n\\n virtual std::string do_read_string(const std::string &tag) const override;\\n\",\n \"file_path\": \"include/zisa/io/hdf5_serial_writer.hpp\",\n \"rank\": 52,\n \"score\": 55416.115423788\n },\n {\n \"content\": \"class HierarchicalWriter : public virtual HierarchicalFile {\\n\\npublic:\\n\\n /// Write a multi-dimensional array to an hierarchical file.\\n\\n /** @param data Raw pointer to the data.\\n\\n * @param data_type Data type identifier.\\n\\n * @param tag Name of the data field in the file.\\n\\n * @param rank Number of dimension of the array.\\n\\n * @param dims Size (number of elements) of each dimension.\\n\\n */\\n\\n void write_array(void const *data,\\n\\n const DataType &data_type,\\n\\n const std::string &tag,\\n\\n int rank,\\n\\n std::size_t const *dims);\\n\\n\\n\\n /// Write a scalar to an HDF5 file.\\n\\n /** @param data The scalar to be written to file.\\n\\n * @param tag Name of the scalar in the HDF5 file.\\n\\n */\\n\\n template <typename T>\\n\",\n \"file_path\": \"include/zisa/io/hierarchical_writer.hpp\",\n \"rank\": 53,\n \"score\": 54691.29915991804\n },\n {\n \"content\": \"/// Read data from a hierarchical file.\\n\\nclass HierarchicalReader : public virtual HierarchicalFile {\\n\\npublic:\\n\\n /// Dimensions of the array named `tag`.\\n\\n std::vector<std::size_t> dims(const std::string &tag) const {\\n\\n return do_dims(tag);\\n\\n }\\n\\n\\n\\n /// Low-level function to read an array from disc into memory.\\n\\n /** Allocating (and managing) the memory, is job of the caller. One can\\n\\n * use `dims` to query the size of the array.\\n\\n *\\n\\n * @param[out] data allocated memory of sufficient size.\\n\\n * @param[in] data_type Erased data type of the data.\\n\\n * @param[in] tag Name of the array in the file.\\n\\n */\\n\\n void read_array(void *data,\\n\\n const DataType &data_type,\\n\\n const std::string &tag) const;\\n\\n\\n\\n /// Read a scalar from the hierarchical file.\\n\",\n \"file_path\": \"include/zisa/io/hierarchical_reader.hpp\",\n \"rank\": 54,\n \"score\": 54691.29915991804\n },\n {\n \"content\": \"/// Representation of the current branch of the opened HDF5 file.\\n\\nclass HDF5File : public virtual HierarchicalFile {\\n\\npublic:\\n\\n virtual ~HDF5File() override;\\n\\n\\n\\nprotected:\\n\\n void do_open_group(const std::string &group_name) override;\\n\\n void do_close_group() override;\\n\\n void do_switch_group(const std::string &group_name) override;\\n\\n bool do_group_exists(const std::string &group_name) const override;\\n\\n std::string do_hierarchy() const override;\\n\\n void do_unlink(const std::string &tag) override {\\n\\n zisa::H5L::unlink(file.top(), tag.c_str(), H5P_DEFAULT);\\n\\n }\\n\\n\\n\\nprotected:\\n\\n hid_t open_dataset(const std::string &tag) const;\\n\\n hid_t get_dataspace(const hid_t &dataset) const;\\n\\n\\n\\nprotected:\\n\\n std::stack<hid_t> file; ///< HDF5 file/group identifiers (branch)\\n\\n std::vector<std::string> path; ///< HDF5 path\\n\\n};\\n\\n\\n\\n} // namespace zisa\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/io/hdf5_file.hpp\",\n \"rank\": 55,\n \"score\": 54691.29915991804\n },\n {\n \"content\": \"class NetCDFFile : public virtual HierarchicalFile {\\n\\npublic:\\n\\n NetCDFFile(const std::string &filename, const NetCDFFileStructure &structure);\\n\\n\\n\\n virtual ~NetCDFFile() override;\\n\\n\\n\\nprotected:\\n\\n virtual void do_open_group(const std::string & /* group_name */) override;\\n\\n virtual void do_close_group() override;\\n\\n virtual void do_switch_group(const std::string &group_name) override;\\n\\n\\n\\n virtual bool\\n\\n do_group_exists(const std::string & /* group_name */) const override;\\n\\n\\n\\n virtual std::string do_hierarchy() const override;\\n\\n virtual void do_unlink(const std::string &tag) override;\\n\\n\\n\\nprivate:\\n\\n std::vector<int>\\n\\n extract_dim_ids(const std::vector<std::string> &dim_names) const;\\n\",\n \"file_path\": \"include/zisa/io/netcdf_file.hpp\",\n \"rank\": 56,\n \"score\": 53915.609426131414\n },\n {\n \"content\": \"class host_memory_resource : public memory_resource<T> {\\n\\nprivate:\\n\\n using super = memory_resource<T>;\\n\\n\\n\\npublic:\\n\\n using value_type = typename super::value_type;\\n\\n using size_type = typename super::size_type;\\n\\n using pointer = typename super::pointer;\\n\\n\\n\\nprotected:\\n\\n virtual inline pointer do_allocate(size_type n) override { return new T[n]; }\\n\\n\\n\\n virtual inline void do_deallocate(pointer ptr, size_type) override {\\n\\n delete[] ptr;\\n\\n }\\n\\n\\n\\n virtual inline device_type do_device() const override {\\n\\n return device_type::cpu;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <class T>\\n\\ndevice_type memory_location(const host_memory_resource<T> &resource) {\\n\\n return resource.device();\\n\\n}\\n\\n\\n\\n} // namespace zisa\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/host_memory_resource.hpp\",\n \"rank\": 57,\n \"score\": 53172.48928144148\n },\n {\n \"content\": \"class NetCDFWriter : public virtual NetCDFFile,\\n\\n public virtual HierarchicalWriter {\\n\\n\\n\\npublic:\\n\\n using NetCDFFile::NetCDFFile;\\n\\n\\n\\nprotected:\\n\\n // Redirects `HierarchicalWriter::do_write_array` to the NetCDF\\n\\n // implementation.\\n\\n virtual void do_write_array(void const *data,\\n\\n const DataType & /* data_type */,\\n\\n const std::string &tag,\\n\\n int /* rank */,\\n\\n std::size_t const * /* dims */) override;\\n\\n\\n\\n // Redirects `HierarchicalWriter::do_write_array` to the NetCDF\\n\\n // implementation.\\n\\n virtual void do_write_scalar(void const *addr,\\n\\n const DataType & /* data_type */,\\n\\n const std::string &tag) override;\\n\",\n \"file_path\": \"include/zisa/io/netcdf_writer.hpp\",\n \"rank\": 58,\n \"score\": 53172.48928144148\n },\n {\n \"content\": \"/// Write data to an HDF5 file, serial version.\\n\\nclass HDF5SerialWriter : public virtual HDF5Writer {\\n\\npublic:\\n\\n explicit HDF5SerialWriter(const std::string &filename);\\n\\n\\n\\nprotected:\\n\\n virtual void do_write_array(const void *data,\\n\\n const HDF5DataType &data_type,\\n\\n const std::string &tag,\\n\\n int rank,\\n\\n const hsize_t *dims) override;\\n\\n\\n\\n using HDF5Writer::do_write_scalar;\\n\\n\\n\\n virtual void do_write_scalar(const void *data,\\n\\n const HDF5DataType &data_type,\\n\\n const std::string &tag) override;\\n\\n\\n\\n virtual void do_write_string(const std::string &data,\\n\\n const std::string &tag) override;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/zisa/io/hdf5_serial_writer.hpp\",\n \"rank\": 59,\n \"score\": 53172.48928144148\n },\n {\n \"content\": \"class cuda_memory_resource : public memory_resource<T> {\\n\\nprivate:\\n\\n using super = memory_resource<T>;\\n\\n\\n\\npublic:\\n\\n using value_type = typename super::value_type;\\n\\n using size_type = typename super::size_type;\\n\\n using pointer = typename super::pointer;\\n\\n\\n\\nprotected:\\n\\n virtual inline pointer do_allocate(size_type n) override {\\n\\n pointer ptr = nullptr;\\n\\n\\n\\n auto cudaError = cudaMalloc(&ptr, n * sizeof(T));\\n\\n LOG_ERR_IF(cudaError != cudaSuccess, cuda_error_message(cudaError));\\n\\n\\n\\n return ptr;\\n\\n }\\n\\n\\n\\n virtual inline void do_deallocate(pointer ptr, size_type) override {\\n\",\n \"file_path\": \"include/zisa/cuda/memory/cuda_memory_resource.hpp\",\n \"rank\": 60,\n \"score\": 52459.92961173665\n },\n {\n \"content\": \"class NetCDFSerialWriter : public virtual NetCDFWriter {\\n\\npublic:\\n\\n using NetCDFWriter::NetCDFWriter;\\n\\n\\n\\nprotected:\\n\\n virtual void do_write_array(void const *data,\\n\\n const std::string &tag) override;\\n\\n\\n\\n virtual void do_write_scalar(void const *addr,\\n\\n const std::string &tag) override;\\n\\n};\\n\\n\\n\\n}\\n\\n#endif /* end of include guard: NETCDF_SERIAL_WRITER_HPP_XWYKVGMU */\\n\",\n \"file_path\": \"include/zisa/io/netcdf_serial_writer.hpp\",\n \"rank\": 61,\n \"score\": 51776.08322128776\n },\n {\n \"content\": \"struct shape_t {\\n\\npublic:\\n\\n ANY_DEVICE shape_t() noexcept {\\n\\n for (int k = 0; k < n_dims; ++k) {\\n\\n _raw_data[k] = 0;\\n\\n }\\n\\n }\\n\\n\\n\\n ANY_DEVICE shape_t(const shape_t &rhs) noexcept {\\n\\n for (int_t k = 0; k < n_dims; ++k) {\\n\\n _raw_data[k] = rhs[k];\\n\\n }\\n\\n }\\n\\n\\n\\n template <class... Ints,\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 62,\n \"score\": 50207.21106365196\n },\n {\n \"content\": \"/// Interface for writing data to an HDF5 file.\\n\\nclass HDF5Writer : public virtual HDF5File, public virtual HierarchicalWriter {\\n\\nprotected:\\n\\n // Redirects `HierarchicalWriter::do_write_array` to the HDF5 implementation.\\n\\n virtual void do_write_array(void const *data,\\n\\n const DataType &data_type,\\n\\n const std::string &tag,\\n\\n int rank,\\n\\n std::size_t const *dims) override;\\n\\n\\n\\n // Redirects `HierarchicalWriter::do_write_array` to the HDF5 implementation.\\n\\n virtual void do_write_scalar(void const *addr,\\n\\n const DataType &data_type,\\n\\n const std::string &tag) override;\\n\\n\\n\\n // Provides the interface on in the HDF5 world which needs to be implemented.\\n\\n virtual void do_write_array(void const *data,\\n\\n const HDF5DataType &data_type,\\n\\n const std::string &tag,\\n\\n int rank,\\n\\n hsize_t const *dims)\\n\\n = 0;\\n\\n\\n\\n // Provides the interface on in the HDF5 world which needs to be implemented.\\n\\n virtual void do_write_scalar(void const *addr,\\n\\n const HDF5DataType &data_type,\\n\\n const std::string &tag)\\n\\n = 0;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/zisa/io/hdf5_writer.hpp\",\n \"rank\": 63,\n \"score\": 48376.415629452895\n },\n {\n \"content\": \"/// Read data from HDF5 file.\\n\\nclass HDF5Reader : public virtual HDF5File, public virtual HierarchicalReader {\\n\\nprivate:\\n\\n using super = HDF5File;\\n\\n\\n\\npublic:\\n\\nprotected:\\n\\n virtual std::vector<std::size_t>\\n\\n do_dims(const std::string &tag) const override;\\n\\n\\n\\n virtual std::vector<hsize_t> do_hdf5_dims(const std::string &tag) const = 0;\\n\\n\\n\\n // Translation from `HierarchicalReader::do_read_array` to HDF5Reader.\\n\\n virtual void do_read_array(void *data,\\n\\n const DataType &data_type,\\n\\n const std::string &tag) const override;\\n\\n\\n\\n // This is where the actual functionality is implemented.\\n\\n virtual void do_read_array(void *data,\\n\\n const HDF5DataType &data_type,\\n\\n const std::string &tag) const = 0;\\n\",\n \"file_path\": \"include/zisa/io/hdf5_writer.hpp\",\n \"rank\": 64,\n \"score\": 48376.415629452895\n },\n {\n \"content\": \"struct array_traits {\\n\\n using pointer = typename Array::pointer;\\n\\n using const_pointer = typename Array::const_pointer;\\n\\n using size_type = typename Array::size_type;\\n\\n\\n\\n static inline device_type device(const Array &array) {\\n\\n return detail::memory_location_<Array>(array);\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/array_traits.hpp\",\n \"rank\": 65,\n \"score\": 46561.73975857017\n },\n {\n \"content\": \"struct array_traits;\\n\\n\\n\\ntemplate <class T, class Indexing, class Array, class Shape>\\n\",\n \"file_path\": \"include/zisa/memory/array_base_decl.hpp\",\n \"rank\": 66,\n \"score\": 45816.71561680433\n },\n {\n \"content\": \"struct array_save_traits {\\n\\n using dispatch_tag = default_dispatch_tag;\\n\\n using scalar_type = T;\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"include/zisa/memory/array_traits.hpp\",\n \"rank\": 67,\n \"score\": 45816.71561680433\n },\n {\n \"content\": \"struct array_save_traits<bool> {\\n\\n using dispatch_tag = bool_dispatch_tag;\\n\\n using scalar_type = char;\\n\\n};\\n\\n\\n\\n} // namespace zisa\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array_traits.hpp\",\n \"rank\": 68,\n \"score\": 45095.97204755124\n },\n {\n \"content\": \"struct split_array_dispatch_tag {};\\n\",\n \"file_path\": \"include/zisa/memory/array_traits.hpp\",\n \"rank\": 69,\n \"score\": 45095.97204755124\n },\n {\n \"content\": \" return s0 + (-i);\\n\\n}\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\\nANY_DEVICE_INLINE shape_t<n_dims, Int>\\n\\noperator-(int i, const shape_t<n_dims, Int> &s0) {\\n\\n return i + (-s0);\\n\\n}\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\\nANY_DEVICE_INLINE shape_t<n_dims, Int>\\n\\noperator-(const shape_t<n_dims, Int> &s0, const shape_t<n_dims, Int> &s1) {\\n\\n return s0 + (-s1);\\n\\n}\\n\\n\\n\\n} // namespace zisa\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 70,\n \"score\": 43391.145008664396\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n#ifndef SHAPE_H_2YNV5\\n\\n#define SHAPE_H_2YNV5\\n\\n\\n\\n#include <assert.h>\\n\\n#include <initializer_list>\\n\\n#include <iostream>\\n\\n\\n\\n#include <zisa/config.hpp>\\n\\n#include <zisa/meta/all_integral.hpp>\\n\\n#include <zisa/utils/integer_cast.hpp>\\n\\n\\n\\nnamespace zisa {\\n\\n\\n\\ntemplate <int n_dims, class Int = int_t>\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 71,\n \"score\": 43389.718123114435\n },\n {\n \"content\": \" }\\n\\n\\n\\n return nml;\\n\\n}\\n\\n\\n\\ntemplate <int n, class Int>\\n\\nstd::ostream &operator<<(std::ostream &os, const shape_t<n, Int> &shape) {\\n\\n os << \\\"[\\\";\\n\\n for (int i = 0; i < n; ++i) {\\n\\n os << shape(Int(i)) << (i != n - 1 ? \\\", \\\" : \\\"]\\\");\\n\\n }\\n\\n\\n\\n return os;\\n\\n}\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\\nANY_DEVICE_INLINE shape_t<n_dims, Int> operator+(const shape_t<n_dims, Int> &s0,\\n\\n int i) {\\n\\n auto s = shape_t<n_dims, Int>();\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 72,\n \"score\": 43389.027397723585\n },\n {\n \"content\": \" for (int k = 0; k < s0.size(); ++k) {\\n\\n s[k] = s0[k] + i;\\n\\n }\\n\\n\\n\\n return s;\\n\\n}\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\\nANY_DEVICE_INLINE shape_t<n_dims, Int>\\n\\noperator+(const shape_t<n_dims, Int> &s0, const shape_t<n_dims, Int> &s1) {\\n\\n auto s = shape_t<n_dims, Int>();\\n\\n\\n\\n for (int k = 0; k < s0.size(); ++k) {\\n\\n s[k] = s0[k] + s1[k];\\n\\n }\\n\\n\\n\\n return s;\\n\\n}\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 73,\n \"score\": 43388.90506503444\n },\n {\n \"content\": \"ANY_DEVICE_INLINE shape_t<n_dims, Int>\\n\\noperator+(int i, const shape_t<n_dims, Int> &s0) {\\n\\n return s0 + i;\\n\\n}\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\\nANY_DEVICE_INLINE shape_t<n_dims, Int>\\n\\noperator-(const shape_t<n_dims, Int> &s0) {\\n\\n auto s = shape_t<n_dims, Int>();\\n\\n\\n\\n for (int k = 0; k < s0.size(); ++k) {\\n\\n s[k] = -s0[k];\\n\\n }\\n\\n\\n\\n return s;\\n\\n}\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\\nANY_DEVICE_INLINE shape_t<n_dims, Int> operator-(const shape_t<n_dims, Int> &s0,\\n\\n int i) {\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 74,\n \"score\": 43388.659805834825\n },\n {\n \"content\": \" static constexpr int_t size(void) { return n_dims; }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n shape_t<1> shape(void) const { return shape_t<1>{n_dims}; }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n Int const *raw() const { return _raw_data; }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n Int *raw() { return _raw_data; }\\n\\n\\n\\nprotected:\\n\\n Int _raw_data[n_dims];\\n\\n};\\n\\n\\n\\ntemplate <int n_dims, class Int>\\n\\nANY_DEVICE_INLINE Int product(const shape_t<n_dims, Int> &shape) {\\n\\n Int nml = 1;\\n\\n for (Int k = 0; k < n_dims; ++k) {\\n\\n nml *= shape[k];\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 75,\n \"score\": 43385.30049264159\n },\n {\n \"content\": \" ANY_DEVICE_INLINE\\n\\n Int operator()(int_t dim) const { return (*this)[dim]; }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n Int &operator()(int_t dim) { return (*this)[dim]; }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n bool operator==(const shape_t &other) const {\\n\\n for (int_t i = 0; i < n_dims; ++i) {\\n\\n if ((*this)(i) != other(i))\\n\\n return false;\\n\\n }\\n\\n\\n\\n return true;\\n\\n }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\\n bool operator!=(const shape_t &other) const { return !((*this) == other); }\\n\\n\\n\\n ANY_DEVICE_INLINE\\n\",\n \"file_path\": \"include/zisa/memory/shape.hpp\",\n \"rank\": 76,\n \"score\": 43382.056785835215\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n#ifndef ARRAY_H_4L4PF\\n\\n#define ARRAY_H_4L4PF\\n\\n\\n\\n#include \\\"array_decl.hpp\\\"\\n\\n#include \\\"array_impl.hpp\\\"\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array.hpp\",\n \"rank\": 77,\n \"score\": 41637.83799211554\n },\n {\n \"content\": \"}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing>::array(\\n\\n const array_const_view<T, n_dims, Indexing> &other, device_type device)\\n\\n : array(other.shape(), device) {\\n\\n zisa::copy(*this, other);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing> &array<T, n_dims, Indexing>::operator=(\\n\\n const array_const_view<T, n_dims, Indexing> &other) {\\n\\n\\n\\n if (this->shape() != other.shape()) {\\n\\n (*this) = array<T, n_dims, Indexing>(other.shape());\\n\\n }\\n\\n\\n\\n // It's pointing to *all* of this array.\\n\\n if (raw_ptr(*this) == raw_ptr(other)) {\\n\\n return *this;\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 78,\n \"score\": 40619.65831311679\n },\n {\n \"content\": \"void copy(array<T, n_dims, Indexing> &dst,\\n\\n const array<T, n_dims, Indexing> &src) {\\n\\n\\n\\n return zisa::copy(array_view<T, n_dims, Indexing>(dst),\\n\\n array_const_view<T, n_dims, Indexing>(src));\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid copy(array<T, n_dims, Indexing> &dst,\\n\\n const array_view<T, n_dims, Indexing> &src) {\\n\\n return zisa::copy(array_view<T, n_dims, Indexing>(dst),\\n\\n array_const_view<T, n_dims, Indexing>(src));\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid copy(array<T, n_dims, Indexing> &dst,\\n\\n const array_const_view<T, n_dims, Indexing> &src) {\\n\\n return zisa::copy(array_view<T, n_dims, Indexing>(dst), src);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid copy(const array_view<T, n_dims, Indexing> &dst,\\n\\n const array<T, n_dims, Indexing> &src) {\\n\\n return zisa::copy(dst, array_const_view<T, n_dims, Indexing>(src));\\n\\n}\\n\\n\\n\\n} // namespace zisa\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array_decl.hpp\",\n \"rank\": 79,\n \"score\": 40616.18398313016\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n#ifndef ARRAY_IMPL_H_1WC9M\\n\\n#define ARRAY_IMPL_H_1WC9M\\n\\n\\n\\n#include \\\"zisa/memory/array_base.hpp\\\"\\n\\n#include \\\"zisa/memory/array_decl.hpp\\\"\\n\\n\\n\\nnamespace zisa {\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing>::array(T *raw_ptr, const shape_type &shape)\\n\\n : super(shape, contiguous_memory<T>(product(shape))) {\\n\\n\\n\\n auto n = product(shape);\\n\\n for (int_t i = 0; i < n; ++i) {\\n\\n (*this)[i] = raw_ptr[i];\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 80,\n \"score\": 40614.83301542653\n },\n {\n \"content\": \"template <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing>::array(const shape_type &shape, device_type device)\\n\\n : super(shape, contiguous_memory<T>(product(shape), device)) {}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing>::array(const shape_type &shape,\\n\\n const allocator<T> &alloc)\\n\\n : super(shape, contiguous_memory<T>(product(shape), alloc)) {}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing>::array(\\n\\n const array_const_view<T, n_dims, Indexing> &other)\\n\\n : super(shape, contiguous_memory<T>(product(other.shape()))) {\\n\\n std::copy(other.begin(), other.end(), this->begin());\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing>::array(const array_view<T, n_dims, Indexing> &other)\\n\\n : super(shape, contiguous_memory<T>(product(other.shape()))) {\\n\\n std::copy(other.begin(), other.end(), this->begin());\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 81,\n \"score\": 40612.582794476\n },\n {\n \"content\": \" }\\n\\n\\n\\n std::copy(other.begin(), other.end(), this->begin());\\n\\n\\n\\n return *this;\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing> &array<T, n_dims, Indexing>::operator=(\\n\\n const array_view<T, n_dims, Indexing> &other) {\\n\\n\\n\\n (*this) = array_const_view<T, n_dims, Indexing>(other);\\n\\n return *this;\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\\nvoid save(HierarchicalWriter &writer,\\n\\n const array<T, n_dims, Indexing> &arr,\\n\\n const std::string &tag) {\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 82,\n \"score\": 40609.83095719542\n },\n {\n \"content\": \"\\n\\n};\\n\\n\\n\\nnamespace random {\\n\\ntemplate<class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing>\\n\\nuniform(const T &low, const T &high, const shape_t<n_dims> &shape, device_type device = device_type::cpu);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing> empty_like(const array<T, n_dims, Indexing> &other) {\\n\\n return array<T, n_dims, Indexing>(other.shape());\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\nvoid save(HierarchicalWriter &writer,\\n\\n const array<T, n_dims, Indexing> &arr,\\n\\n const std::string &tag);\\n\\n\\n\\ntemplate <class T, int n_dims, template <int> class Indexing>\\n\",\n \"file_path\": \"include/zisa/memory/array_decl.hpp\",\n \"rank\": 83,\n \"score\": 40609.51422678842\n },\n {\n \"content\": \" return arr;\\n\\n}\\n\\n\\n\\nnamespace random {\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\\narray<T, n_dims, Indexing> uniform(const T &low,\\n\\n const T &high,\\n\\n const shape_t<n_dims> &shape,\\n\\n device_type device) {\\n\\n LOG_ERR_IF(device != device_type::cpu, \\\"Implement first.\\\");\\n\\n static_assert(std::is_same<T, double>::value, \\\"Implement first.\\\");\\n\\n\\n\\n auto n = product(shape);\\n\\n auto x = array<T, n_dims, Indexing>(shape, device);\\n\\n\\n\\n std::random_device r;\\n\\n auto mt = std::mt19937(r());\\n\\n auto dist = std::uniform_real_distribution<T>(low, high);\\n\\n\\n\\n for (int_t i = 0; i < n; ++i) {\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 84,\n \"score\": 40609.366055819926\n },\n {\n \"content\": \" explicit array(const shape_type &shape,\\n\\n device_type device = device_type::cpu);\\n\\n array(const shape_type &shape, const allocator<T> &alloc);\\n\\n\\n\\n array &operator=(const array &) = default;\\n\\n array &operator=(array &&) noexcept = default;\\n\\n\\n\\n array &operator=(const array_const_view<T, n_dims, Indexing> &);\\n\\n array &operator=(const array_view<T, n_dims, Indexing> &);\\n\\n\\n\\n array_view<T, n_dims, Indexing> view() {\\n\\n return array_view<T, n_dims, Indexing>(*this);\\n\\n }\\n\\n\\n\\n array_const_view<T, n_dims, Indexing> const_view() const {\\n\\n return array_const_view<T, n_dims, Indexing>(*this);\\n\\n }\\n\\n\\n\\n [[nodiscard]] static array<T, n_dims, row_major>\\n\\n load(HierarchicalReader &reader, const std::string &tag);\\n\",\n \"file_path\": \"include/zisa/memory/array_decl.hpp\",\n \"rank\": 85,\n \"score\": 40607.70885291023\n },\n {\n \"content\": \"\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing = row_major>\\n\\nusing array_super_\\n\\n = array_base<T,\\n\\n Indexing<n_dims>,\\n\\n contiguous_memory<T>,\\n\\n shape_t<n_dims, typename contiguous_memory<T>::size_type>>;\\n\\n\\n\\n} // namespace detail\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing = row_major>\\n\",\n \"file_path\": \"include/zisa/memory/array_decl.hpp\",\n \"rank\": 86,\n \"score\": 40607.70222303586\n },\n {\n \"content\": \" auto datatype = erase_data_type<T>();\\n\\n reader.read_array(arr.raw(), datatype, tag);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims>\\n\\nvoid load_impl(HierarchicalReader &reader,\\n\\n array<T, n_dims, row_major> &arr,\\n\\n const std::string &tag,\\n\\n bool_dispatch_tag) {\\n\\n\\n\\n using scalar_type = typename array_save_traits<T>::scalar_type;\\n\\n auto datatype = erase_data_type<scalar_type>();\\n\\n\\n\\n auto int_arr = array<scalar_type, n_dims, row_major>(arr.shape());\\n\\n reader.read_array(int_arr.raw(), datatype, tag);\\n\\n\\n\\n std::copy(int_arr.cbegin(), int_arr.cend(), arr.begin());\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims, template <int N> class Indexing>\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 87,\n \"score\": 40603.193517501764\n },\n {\n \"content\": \"array<T, n_dims, row_major>\\n\\narray<T, n_dims, Indexing>::load(HierarchicalReader &reader,\\n\\n const std::string &tag) {\\n\\n\\n\\n static_assert(std::is_same<row_major<n_dims>, Indexing<n_dims>>::value,\\n\\n \\\"This has only been implemented for row-major index order.\\\");\\n\\n\\n\\n auto dims = reader.dims(tag);\\n\\n auto shape = shape_t<n_dims>{};\\n\\n\\n\\n // Some types T are stored as an array of fixed size. Such types may require\\n\\n // an additional dimension (at the end of `dims`).\\n\\n LOG_ERR_IF(dims.size() < n_dims, \\\"Dimension mismatch.\\\");\\n\\n for (int_t i = 0; i < n_dims; ++i) {\\n\\n shape[i] = dims[i];\\n\\n }\\n\\n\\n\\n auto arr = array<T, n_dims>(shape, device_type::cpu);\\n\\n load_impl(reader, arr, tag, typename array_save_traits<T>::dispatch_tag{});\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 88,\n \"score\": 40602.94481425956\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n#ifndef ARRAY_H_TH7WE\\n\\n#define ARRAY_H_TH7WE\\n\\n\\n\\n#include <zisa/config.hpp>\\n\\n\\n\\n#include <zisa/memory/array_base_decl.hpp>\\n\\n#include <zisa/memory/column_major.hpp>\\n\\n#include <zisa/memory/contiguous_memory.hpp>\\n\\n#include <zisa/memory/row_major.hpp>\\n\\n#include <zisa/memory/shape.hpp>\\n\\n\\n\\n#include <random>\\n\\n#include <zisa/memory/array_view.hpp>\\n\\n\\n\\nnamespace zisa {\\n\\n\\n\\nnamespace detail {\\n\",\n \"file_path\": \"include/zisa/memory/array_decl.hpp\",\n \"rank\": 89,\n \"score\": 40598.602752353436\n },\n {\n \"content\": \" save(writer, arr.const_view(), tag);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims>\\n\\nvoid load_impl(HierarchicalReader &reader,\\n\\n array<T, n_dims, row_major> &arr,\\n\\n const std::string &tag,\\n\\n split_array_dispatch_tag) {\\n\\n\\n\\n using scalar_type = typename array_save_traits<T>::scalar_type;\\n\\n auto datatype = erase_data_type<scalar_type>();\\n\\n reader.read_array(arr.raw(), datatype, tag);\\n\\n}\\n\\n\\n\\ntemplate <class T, int n_dims>\\n\\nvoid load_impl(HierarchicalReader &reader,\\n\\n array<T, n_dims, row_major> &arr,\\n\\n const std::string &tag,\\n\\n default_dispatch_tag) {\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 90,\n \"score\": 40597.036459508585\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n/* Array traits.\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef ARRAY_TRAITS_H_8G39N\\n\\n#define ARRAY_TRAITS_H_8G39N\\n\\n\\n\\n#include <type_traits>\\n\\n#include <zisa/config.hpp>\\n\\n#include <zisa/memory/device_type.hpp>\\n\\n\\n\\nnamespace zisa {\\n\\n\\n\\nnamespace detail {\\n\\ntemplate <class A>\\n\\ndevice_type memory_location_(const A &) {\\n\\n return device_type::unknown;\\n\",\n \"file_path\": \"include/zisa/memory/array_traits.hpp\",\n \"rank\": 91,\n \"score\": 40595.96324458236\n },\n {\n \"content\": \" x[i] = dist(mt);\\n\\n }\\n\\n\\n\\n return x;\\n\\n}\\n\\n}\\n\\n\\n\\n} // namespace zisa\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array_impl.hpp\",\n \"rank\": 92,\n \"score\": 40590.02891593458\n },\n {\n \"content\": \"}\\n\\n\\n\\ntemplate <class A>\\n\\ndevice_type memory_location_(\\n\\n const typename std::enable_if<\\n\\n std::is_same<decltype(std::declval<A>().device()), device_type>::value,\\n\\n A>::type &a) {\\n\\n return a.device();\\n\\n}\\n\\n}\\n\\n\\n\\ntemplate <class Array>\\n\",\n \"file_path\": \"include/zisa/memory/array_traits.hpp\",\n \"rank\": 93,\n \"score\": 40590.02145616482\n },\n {\n \"content\": \"// SPDX-License-Identifier: MIT\\n\\n// Copyright (c) 2021 ETH Zurich, Luc Grosheintz-Laval\\n\\n\\n\\n#ifndef ARRAY_BASE_H_BQ44X\\n\\n#define ARRAY_BASE_H_BQ44X\\n\\n\\n\\n#include \\\"array_base_decl.hpp\\\"\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array_base.hpp\",\n \"rank\": 94,\n \"score\": 40587.19539456684\n },\n {\n \"content\": \"template <class T, class Indexing, class Array, class Shape>\\n\\nANY_DEVICE_INLINE auto shape(const array_base<T, Indexing, Array, Shape> &a)\\n\\n -> decltype(a.shape()) {\\n\\n return a.shape();\\n\\n}\\n\\n\\n\\n} // namespace zisa\\n\\n\\n\\n#endif /* end of include guard */\\n\",\n \"file_path\": \"include/zisa/memory/array_base_decl.hpp\",\n \"rank\": 95,\n \"score\": 39612.71101415685\n },\n {\n \"content\": \"}\\n\\n\\n\\ntemplate <class T, class Indexing, class Array, class Shape>\\n\\nANY_DEVICE_INLINE auto raw_ptr(array_base<T, Indexing, Array, Shape> &a)\\n\\n -> decltype(a.raw()) {\\n\\n return a.raw();\\n\\n}\\n\\n\\n\\ntemplate <class T, class Indexing, class Array, class Shape>\\n\\nANY_DEVICE_INLINE auto raw_ptr(const array_base<T, Indexing, Array, Shape> &a)\\n\\n -> decltype(a.raw()) {\\n\\n return a.raw();\\n\\n}\\n\\n\\n\\ntemplate <class T, class Indexing, class Array, class Shape>\\n\\nANY_DEVICE_INLINE auto shape(array_base<T, Indexing, Array, Shape> &a)\\n\\n -> decltype(a.shape()) {\\n\\n return a.shape();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"include/zisa/memory/array_base_decl.hpp\",\n \"rank\": 96,\n \"score\": 39612.445218263165\n },\n {\n \"content\": \"}\\n\\n\\n\\n#endif\\n\\n\\n\\nTEST_CASE(\\\"array; builds for general Indexing.\\\", \\\"[array]\\\") {\\n\\n\\n\\n // The point is to check that `array<double, 3, Indexing>`\\n\\n // compiles fine. Despite the fact that `save` and `load` only\\n\\n // work if `Indexing == row_major`.\\n\\n\\n\\n auto shape = zisa::shape_t<3>{3ul, 4ul, 2ul};\\n\\n\\n\\n auto a = array<double, 3, column_major>(shape);\\n\\n for (zisa::int_t i = 0; i < a.size(); ++i) {\\n\\n a[i] = double(i);\\n\\n }\\n\\n}\\n\\n\\n\\n#if ZISA_HAS_CUDA\\n\\n\\n\",\n \"file_path\": \"test/zisa/unit_test/memory/array.cpp\",\n \"rank\": 97,\n \"score\": 39609.80355548552\n },\n {\n \"content\": \" template <class... Ints>\\n\\n ANY_DEVICE_INLINE const T &operator()(Ints... ints) const {\\n\\n auto l = Indexing::linear_index(shape(), integer_cast<size_type>(ints)...);\\n\\n return (*this)[l];\\n\\n }\\n\\n\\n\\n ANY_DEVICE_INLINE const shape_type &shape() const { return _shape; }\\n\\n ANY_DEVICE_INLINE size_type shape(size_type k) const { return _shape[k]; }\\n\\n ANY_DEVICE_INLINE size_type size() const { return product(_shape); }\\n\\n\\n\\n ANY_DEVICE_INLINE pointer raw() { return raw_ptr(_array); }\\n\\n ANY_DEVICE_INLINE const_pointer raw() const { return raw_ptr(_array); }\\n\\n\\n\\n ANY_DEVICE_INLINE pointer begin() { return _array.begin(); }\\n\\n ANY_DEVICE_INLINE const_pointer begin() const { return _array.begin(); }\\n\\n ANY_DEVICE_INLINE const_pointer cbegin() const { return _array.cbegin(); }\\n\\n\\n\\n ANY_DEVICE_INLINE pointer end() { return _array.end(); }\\n\\n ANY_DEVICE_INLINE const_pointer end() const { return _array.end(); }\\n\\n ANY_DEVICE_INLINE const_pointer cend() const { return _array.cend(); }\\n\",\n \"file_path\": \"include/zisa/memory/array_base_decl.hpp\",\n \"rank\": 98,\n \"score\": 39608.91579147159\n },\n {\n \"content\": \"\\n\\n inline device_type device() const {\\n\\n return array_traits<Array>::device(_array);\\n\\n }\\n\\n\\n\\nprivate:\\n\\n Shape _shape;\\n\\n Array _array;\\n\\n};\\n\\n\\n\\ntemplate <class T, class Indexing, class Array, class Shape>\\n\\ndevice_type memory_location(const array_base<T, Indexing, Array, Shape> &arr) {\\n\\n return arr.device();\\n\\n}\\n\\n\\n\\ntemplate <class T, class Indexing, class Array, class Shape>\\n\\nvoid fill(array_base<T, Indexing, Array, Shape> &arr, const T &value) {\\n\\n // TODO move to a library call of some sort.\\n\\n int_t n = arr.size();\\n\\n for (int_t i = 0; i < n; ++i) {\\n\",\n \"file_path\": \"include/zisa/memory/array_base_decl.hpp\",\n \"rank\": 99,\n \"score\": 39607.47349803096\n }\n]","isConversational":false}}},{"rowIdx":484,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/developer/debug/unwinder/dwarf_cfi.cc"},"repo_name":{"kind":"string","value":"lalrochhara/fuchsia"},"commit":{"kind":"string","value":"f56c62fa108cfd72b8034eeddb4e403f1f69fdbd"},"file_code":{"kind":"string","value":"\n\n#include \"src/developer/debug/unwinder/dwarf_cfi.h\"\n\n#include <algorithm>\n#include <cinttypes>\n#include <cstdint>\n#include <map>\n#include <string>\n\n#include \"src/developer/debug/unwinder/dwarf_cfi_parser.h\"\n#include \"third_party/crashpad/third_party/glibc/elf/elf.h\"\n\nnamespace unwinder {\n\nnamespace {\n\nstruct DwarfCie {\n uint64_t code_alignment_factor = 0; \n int64_t data_alignment_factor = 0; \n RegisterID return_address_register; \n bool fde_have_augmentation_data = false; \n uint8_t fde_address_encoding = 0xFF; \n uint64_t instructions_begin = 0;\n uint64_t instructions_end = 0; \n};\n\nstruct DwarfFde {\n uint64_t pc_begin = 0;\n uint64_t pc_end = 0;\n uint64_t instructions_begin = 0;\n uint64_t instructions_end = 0; \n};\n\n[[nodiscard]] Error DecodeTableEntrySize(uint8_t table_enc, uint64_t& res) {\n if (table_enc == 0xFF) { \n return Error(\"no binary search table\");\n }\n if ((table_enc & 0xF0) != 0x30) {\n return Error(\"invalid table_enc\");\n }\n switch (table_enc & 0x0F) {\n case 0x02: \n case 0x0A: \n res = 4;\n return Success();\n case 0x03: \n case 0x0B: \n res = 8;\n return Success();\n case 0x04: \n case 0x0C: \n res = 16;\n return Success();\n default:\n return Error(\"unsupported table_enc: %#x\", table_enc);\n }\n}\n\n[[nodiscard]] Error DecodeLength(Memory* memory, uint64_t& ptr, uint64_t& length) {\n uint32_t short_length;\n if (auto err = memory->Read(ptr, short_length); err.has_err()) {\n return err;\n }\n if (short_length == 0) {\n return Error(\"not a valid CIE/FDE\");\n }\n if (short_length == 0xFFFFFFFF) {\n if (auto err = memory->Read(ptr, length); err.has_err()) {\n return err;\n }\n } else {\n length = short_length;\n }\n return Success();\n}\n\n[[nodiscard]] Error DecodeCIE(Memory* memory, uint64_t cie_ptr, DwarfCie& cie) {\n uint64_t length;\n if (auto err = DecodeLength(memory, cie_ptr, length); err.has_err()) {\n return err;\n }\n cie.instructions_end = cie_ptr + length;\n\n uint32_t cie_id;\n if (auto err = memory->Read(cie_ptr, cie_id); err.has_err()) {\n return err;\n }\n if (cie_id) {\n return Error(\"not a valid CIE\");\n }\n\n \n uint8_t version;\n if (auto err = memory->Read(cie_ptr, version); err.has_err()) {\n return err;\n }\n if (version != 1) {\n return Error(\"unsupported CIE version: %d\", version);\n }\n\n std::string augmentation_string;\n while (true) {\n char ch;\n if (auto err = memory->Read(cie_ptr, ch); err.has_err()) {\n return err;\n }\n if (ch) {\n augmentation_string.push_back(ch);\n } else {\n break;\n }\n }\n\n if (auto err = memory->ReadULEB128(cie_ptr, cie.code_alignment_factor); err.has_err()) {\n return err;\n }\n if (auto err = memory->ReadSLEB128(cie_ptr, cie.data_alignment_factor); err.has_err()) {\n return err;\n }\n if (auto err = memory->Read(cie_ptr, cie.return_address_register); err.has_err()) {\n return err;\n }\n\n if (augmentation_string.empty()) {\n cie.instructions_begin = cie_ptr;\n cie.fde_have_augmentation_data = false;\n } else {\n if (augmentation_string[0] != 'z') {\n return Error(\"invalid augmentation string: %s\", augmentation_string.c_str());\n }\n uint64_t augmentation_length;\n if (auto err = memory->ReadULEB128(cie_ptr, augmentation_length); err.has_err()) {\n return err;\n }\n cie.instructions_begin = cie_ptr + augmentation_length;\n cie.fde_have_augmentation_data = true;\n\n for (char ch : augmentation_string) {\n switch (ch) {\n case 'L': \n uint8_t lsda_encoding;\n if (auto err = memory->Read(cie_ptr, lsda_encoding); err.has_err()) {\n return err;\n }\n break;\n case 'P': \n uint8_t enc;\n if (auto err = memory->Read(cie_ptr, enc); err.has_err()) {\n return err;\n }\n uint64_t personality;\n if (auto err = memory->ReadEncoded(cie_ptr, personality, enc, 0); err.has_err()) {\n return err;\n }\n break;\n case 'R':\n if (auto err = memory->Read(cie_ptr, cie.fde_address_encoding); err.has_err()) {\n return err;\n }\n break;\n }\n }\n }\n\n return Success();\n}\n\n[[nodiscard]] Error DecodeFDE(Memory* memory, uint64_t fde_ptr, DwarfFde& fde, DwarfCie& cie) {\n uint64_t length;\n if (auto err = DecodeLength(memory, fde_ptr, length); err.has_err()) {\n return err;\n }\n fde.instructions_end = fde_ptr + length;\n\n uint32_t cie_offset;\n if (auto err = memory->Read(fde_ptr, cie_offset); err.has_err()) {\n return err;\n }\n if (auto err = DecodeCIE(memory, fde_ptr - 4 - cie_offset, cie); err.has_err()) {\n return err;\n }\n\n if (auto err = memory->ReadEncoded(fde_ptr, fde.pc_begin, cie.fde_address_encoding);\n err.has_err()) {\n return err;\n }\n if (auto err = memory->ReadEncoded(fde_ptr, fde.pc_end, cie.fde_address_encoding & 0x0F);\n err.has_err()) {\n return err;\n }\n fde.pc_end += fde.pc_begin;\n\n if (cie.fde_have_augmentation_data) {\n uint64_t augmentation_length;\n if (auto err = memory->ReadULEB128(fde_ptr, augmentation_length); err.has_err()) {\n return err;\n }\n \n fde_ptr += augmentation_length;\n }\n fde.instructions_begin = fde_ptr;\n\n return Success();\n}\n\n} \n\nError DwarfCfi::Load(Memory* elf, uint64_t elf_ptr) {\n Elf64_Ehdr ehdr;\n if (auto err = elf->Read(+elf_ptr, ehdr); err.has_err()) {\n return err;\n }\n\n \n if (strncmp(reinterpret_cast<const char*>(ehdr.e_ident), ELFMAG, SELFMAG) != 0) {\n return Error(\"not an ELF image\");\n }\n\n \n eh_frame_hdr_ptr_ = 0;\n pc_begin_ = -1;\n pc_end_ = 0;\n for (uint64_t i = 0; i < ehdr.e_phnum; i++) {\n Elf64_Phdr phdr;\n if (auto err = elf->Read(elf_ptr + ehdr.e_phoff + ehdr.e_phentsize * i, phdr); err.has_err()) {\n return err;\n }\n if (phdr.p_type == PT_GNU_EH_FRAME) {\n eh_frame_hdr_ptr_ = elf_ptr + phdr.p_vaddr;\n } else if (phdr.p_type == PT_LOAD && phdr.p_flags & PF_X) {\n pc_begin_ = std::min(pc_begin_, elf_ptr + phdr.p_vaddr);\n pc_end_ = std::max(pc_end_, elf_ptr + phdr.p_vaddr + phdr.p_memsz);\n }\n }\n if (!eh_frame_hdr_ptr_) {\n return Error(\"no PT_GNU_EH_FRAME segment\");\n }\n\n auto p = eh_frame_hdr_ptr_;\n uint8_t version;\n if (auto err = elf->Read(p, version); err.has_err()) {\n return err;\n }\n if (version != 1) {\n return Error(\"unknown eh_frame_hdr version %d\", version);\n }\n\n uint8_t eh_frame_ptr_enc;\n uint8_t fde_count_enc;\n uint64_t eh_frame_ptr; \n if (auto err = elf->Read<uint8_t>(p, eh_frame_ptr_enc); err.has_err()) {\n return err;\n }\n if (auto err = elf->Read<uint8_t>(p, fde_count_enc); err.has_err()) {\n return err;\n }\n if (auto err = elf->Read<uint8_t>(p, table_enc_); err.has_err()) {\n return err;\n }\n if (auto err = DecodeTableEntrySize(table_enc_, table_entry_size_); err.has_err()) {\n return err;\n }\n if (auto err = elf->ReadEncoded(p, eh_frame_ptr, eh_frame_ptr_enc, eh_frame_hdr_ptr_);\n err.has_err()) {\n return err;\n }\n if (auto err = elf->ReadEncoded(p, fde_count_, fde_count_enc, eh_frame_hdr_ptr_); err.has_err()) {\n return err;\n }\n table_ptr_ = p;\n\n if (fde_count_ == 0) {\n return Error(\"empty binary search table\");\n }\n\n elf_ = elf;\n return Success();\n}\n\nError DwarfCfi::Step(Memory* stack, const Registers& current, Registers& next) {\n uint64_t pc;\n if (auto err = current.GetPC(pc); err.has_err()) {\n return err;\n }\n if (pc < pc_begin_ || pc >= pc_end_) {\n return Error(\"pc %#\" PRIx64 \" is outside of the executable area\", pc);\n }\n\n \n uint64_t low = 0;\n uint64_t high = fde_count_;\n while (low + 1 < high) {\n uint64_t mid = (low + high) / 2;\n uint64_t addr = table_ptr_ + mid * table_entry_size_;\n uint64_t mid_pc;\n if (auto err = elf_->ReadEncoded(addr, mid_pc, table_enc_, eh_frame_hdr_ptr_); err.has_err()) {\n return err;\n }\n if (pc < mid_pc) {\n high = mid;\n } else {\n low = mid;\n }\n }\n uint64_t addr = table_ptr_ + low * table_entry_size_ + table_entry_size_ / 2;\n uint64_t fde_ptr;\n if (auto err = elf_->ReadEncoded(addr, fde_ptr, table_enc_, eh_frame_hdr_ptr_); err.has_err()) {\n return err;\n }\n\n DwarfCie cie;\n DwarfFde fde;\n if (auto err = DecodeFDE(elf_, fde_ptr, fde, cie); err.has_err()) {\n return err;\n }\n if (pc < fde.pc_begin || pc >= fde.pc_end) {\n return Error(\"cannot find FDE for pc %#\" PRIx64, pc);\n }\n\n DwarfCfiParser cfi_parser(current.arch());\n\n \n if (auto err =\n cfi_parser.ParseInstructions(elf_, cie.code_alignment_factor, cie.data_alignment_factor,\n cie.instructions_begin, cie.instructions_end, -1);\n err.has_err()) {\n return err;\n }\n\n cfi_parser.Snapshot();\n\n \n if (auto err = cfi_parser.ParseInstructions(elf_, cie.code_alignment_factor,\n cie.data_alignment_factor, fde.instructions_begin,\n fde.instructions_end, pc - fde.pc_begin);\n err.has_err()) {\n return err;\n }\n\n if (auto err = cfi_parser.Step(stack, cie.return_address_register, current, next);\n err.has_err()) {\n return err;\n }\n\n return Success();\n}\n\n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"src/developer/debug/unwinder/dwarf_cfi.h\"\n\n#include <algorithm>\n#include <cinttypes>\n#include <cstdint>\n#include <map>\n#include <string>\n\n#include \"src/developer/debug/unwinder/dwarf_cfi_parser.h\"\n#include \"third_party/crashpad/third_party/glibc/elf/elf.h\"\n\nnamespace unwinder {\n\nnamespace {\n\nstruct DwarfCie {\n uint64_t code_alignment_factor = 0; \n int64_t data_alignment_factor = 0; \n RegisterID return_address_register; \n bool fde_have_augmentation_data = false; \n uint8_t fde_address_encoding = 0xFF; \n uint64_t instructions_begin = 0;\n uint64_t instructions_end = 0; \n};\n\nstruct DwarfFde {\n uint64_t pc_begin = 0;\n uint64_t pc_end = 0;\n uint64_t instructions_begin = 0;\n uint64_t instructions_end = 0; \n};\n\n[[nodiscard]] Error DecodeTableEntrySize(uint8_t table_enc, uint64_t& res) {\n if (table_enc == 0xFF) { \n return Error(\"no binary search table\");\n }\n if ((table_enc & 0xF0) != 0x30) {\n return Error(\"invalid table_enc\");\n }\n switch (table_enc & 0x0F) {\n case 0x02: \n case 0x0A: \n res = 4;\n return Success();\n case 0x03: \n case 0x0B: \n res = 8;\n return Success();\n case 0x04: \n case 0x0C: \n res = 16;\n return Success();\n default:\n return Error(\"unsupported table_enc: %#x\", table_enc);\n }\n}\n\n[[nodiscard]] Error DecodeLength(Memory* memory, uint64_t& ptr, uint64_t& length) {\n uint32_t short_length;\n if (auto err = memory->Read(ptr, short_length); err.has_err()) {\n return err;\n }\n if (short_length == 0) {\n return Error(\"not a valid CIE/FDE\");\n }\n if (short_length == 0xFFFFFFFF) {\n if (auto err = memory->Read(ptr, length); err.has_err()) {\n return err;\n }\n } else {\n length = short_length;\n }\n return Success();\n}\n\n[[nodiscard]] Error DecodeCIE(Memory* memory, uint64_t cie_ptr, DwarfCie& cie) {\n uint64_t length;\n if (auto err = DecodeLength(memory, cie_ptr, length); err.has_err()) {\n return err;\n }\n cie.instructions_end = cie_ptr + length;\n\n uint32_t cie_id;\n if (auto err = memory->Read(cie_ptr, cie_id); err.has_err()) {\n return err;\n }\n if (cie_id) {\n return Error(\"not a valid CIE\");\n }\n\n \n uint8_t version;\n if (auto err = memory->Read(cie_ptr, version); err.has_err()) {\n return err;\n }\n if (version != 1) {\n return Error(\"unsupported CIE version: %d\", version);\n }\n\n std::string augmentation_string;\n while (true) {\n char ch;\n if (auto err = memory->Read(cie_ptr, ch); err.has_err()) {\n return err;\n }\n if (ch) {\n augmentation_string.push_back(ch);\n } else {\n break;\n }\n }\n\n if (auto err = memory->ReadULEB128(cie_ptr, cie.code_alignment_factor); err.has_err()) {\n return err;\n }\n if (auto err = memory->ReadSLEB128(cie_ptr, cie.data_alignment_factor); err.has_err()) {\n return err;\n }\n if (auto err = memory->Read(cie_ptr, cie.return_address_register); err.has_err()) {\n return err;\n }\n\n if (augmentation_string.empty()) {\n cie.instructions_begin = cie_ptr;\n cie.fde_have_augmentation_data = false;\n } else {\n if (augmentation_string[0] != 'z') {\n return Error(\"invalid augmentation string: %s\", augmentation_string.c_str());\n }\n uint64_t augmentation_length;\n if (auto err = memory->ReadULEB128(cie_ptr, augmentation_length); err.has_err()) {\n return err;\n }\n cie.instructions_begin = cie_ptr + augmentation_length;\n cie.fde_have_augmentation_data = true;\n\n for (char ch : augmentation_string) {\n switch (ch) {\n case 'L': \n uint8_t lsda_encoding;\n if (auto err = memory->Read(cie_ptr, lsda_encoding); err.has_err()) {\n return err;\n }\n break;\n case 'P': \n uint8_t enc;\n if (auto err = memory->Read(cie_ptr, enc); err.has_err()) {\n return err;\n }\n uint64_t personality;\n if (auto err = memory->ReadEncoded(cie_ptr, personality, enc, 0); err.has_err()) {\n return err;\n }\n break;\n case 'R':\n if (auto err = memory->Read(cie_ptr, cie.fde_address_encoding); err.has_err()) {\n return err;\n }\n break;\n }\n }\n }\n\n return Success();\n}\n\n[[nodiscard]] Error DecodeFDE(Memory* memory, uint64_t fde_ptr, DwarfFde& fde, DwarfCie& cie) {\n uint64_t length;\n if (auto err = DecodeLength(memory, fde_ptr, length); err.has_err()) {\n return err;\n }\n fde.instructions_end = fde_ptr + length;\n\n uint32_t cie_offset;\n if (auto err = memory->Read(fde_ptr, cie_offset); err.has_err()) {\n return err;\n }\n if (auto err = DecodeCIE(memory, fde_ptr - 4 - cie_offset, cie); err.has_err()) {\n return err;\n }\n\n if (auto err = memory->ReadEncoded(fde_ptr, fde.pc_begin, cie.fde_address_encoding);\n err.has_err()) {\n return err;\n }\n if (auto err = memory->ReadEncoded(fde_ptr, fde.pc_end, cie.fde_address_encoding & 0x0F);\n err.has_err()) {\n return err;\n }\n fde.pc_end += fde.pc_begin;\n\n if (cie.fde_have_augmentation_data) {\n uint64_t augmentation_length;\n if (auto err = memory->ReadULEB128(fde_ptr, augmentation_length); err.has_err()) {\n return err;\n }\n \n fde_ptr += augmentation_length;\n }\n fde.instructions_begin = fde_ptr;\n\n return Success();\n}\n\n} \n\nError DwarfCfi::Load(Memory* elf, uint64_t elf_ptr) {\n Elf64_Ehdr ehdr;\n if (auto err = elf->Read(+elf_ptr, ehdr); err.has_err()) {\n return err;\n }\n\n \n if (strncmp(reinterpret_cast<const char*>(ehdr.e_ident), ELFMAG, SELFMAG) != 0) {\n return Error(\"not an ELF image\");\n }\n\n \n eh_frame_hdr_ptr_ = 0;\n pc_begin_ = -1;\n pc_end_ = 0;\n for (uint64_t i = 0; i < ehdr.e_phnum; i++) {\n Elf64_Phdr phdr;\n if (auto err = elf->Read(elf_ptr + ehdr.e_phoff + ehdr.e_phentsize * i, phdr); err.has_err()) {\n return err;\n }\n if (phdr.p_type == PT_GNU_EH_FRAME) {\n eh_frame_hdr_ptr_ = elf_ptr + phdr.p_vaddr;\n } else if (phdr.p_type == PT_LOAD && phdr.p_flags & PF_X) {\n pc_begin_ = std::min(pc_begin_, elf_ptr + phdr.p_vaddr);\n pc_end_ = std::max(pc_end_, elf_ptr + phdr.p_vaddr + phdr.p_memsz);\n }\n }\n if (!eh_frame_hdr_ptr_) {\n return Error(\"no PT_GNU_EH_FRAME segment\");\n }\n\n auto p = eh_frame_hdr_ptr_;\n uint8_t version;\n if (auto err = elf->Read(p, version); err.has_err()) {\n return err;\n }\n if (version != 1) {\n return Error(\"unknown eh_frame_hdr version %d\", version);\n }\n\n uint8_t eh_frame_ptr_enc;\n uint8_t fde_count_enc;\n uint64_t eh_frame_ptr; \n if (auto err = elf->Read<uint8_t>(p, eh_frame_ptr_enc); err.has_err()) {\n return err;\n }\n if (auto err = elf->Read<uint8_t>(p, fde_count_enc); err.has_err()) {\n return err;\n }\n if (auto err = elf->Read<uint8_t>(p, table_enc_); err.has_err()) {\n return err;\n }\n if (auto err = DecodeTableEntrySize(table_enc_, table_entry_size_); err.has_err()) {\n return err;\n }\n if (auto err = elf->ReadEncoded(p, eh_frame_ptr, eh_frame_ptr_enc, eh_frame_hdr_ptr_);\n err.has_err()) {\n return err;\n }\n if (auto err = elf->ReadEncoded(p, fde_count_, fde_count_enc, eh_frame_hdr_ptr_); err.has_err()) {\n return err;\n }\n table_ptr_ = p;\n\n if (fde_count_ == 0) {\n return Error(\"empty binary search table\");\n }\n\n elf_ = elf;\n return Success();\n}\n\nError DwarfCfi::Step(Memory* stack, const Registers& current, Registers& next) {\n uint64_t pc;\n if (auto err = current.GetPC(pc); err.has_err()) {\n return err;\n }\n if (pc < pc_begin_ || pc >= pc_end_) {\n return Error(\"pc %#\" PRIx64 \" is outside of the executable area\", pc);\n }\n\n \n uint64_t low = 0;\n uint64_t high = fde_count_;\n while (low + 1 < high) {\n uint64_t mid = (low + high) / 2;\n uint64_t addr = table_ptr_ + mid * table_entry_size_;\n uint64_t mid_pc;\n if (auto err = elf_->ReadEncoded(addr, mid_pc, table_enc_, eh_frame_hdr_ptr_); err.has_err()) {\n return err;\n }\n if (pc < mid_pc) {\n high = mid;\n } else {\n low = mid;\n }\n }\n uint64_t addr = table_ptr_ + low * table_entry_size_ + table_entry_size_ / 2;\n uint64_t fde_ptr;\n if (auto err = elf_->ReadEncoded(addr, fde_ptr, table_enc_, eh_frame_hdr_ptr_); err.has_err()) {\n return err;\n }\n\n DwarfCie cie;\n DwarfFde fde;\n if (auto err = DecodeFDE(elf_, fde_ptr, fde, cie); err.has_err()) {\n return err;\n }\n if (pc < fde.pc_begin || pc >= fde.pc_end) {\n return Error(\"cannot find FDE for pc %#\" PRIx64, pc);\n }\n\n DwarfCfiParser cfi_parser(current.arch());\n\n \n "},"suffix":{"kind":"string","value":"\n\n cfi_parser.Snapshot();\n\n \n if (auto err = cfi_parser.ParseInstructions(elf_, cie.code_alignment_factor,\n cie.data_alignment_factor, fde.instructions_begin,\n fde.instructions_end, pc - fde.pc_begin);\n err.has_err()) {\n return err;\n }\n\n if (auto err = cfi_parser.Step(stack, cie.return_address_register, current, next);\n err.has_err()) {\n return err;\n }\n\n return Success();\n}\n\n} \n"},"middle":{"kind":"string","value":"if (auto err =\n cfi_parser.ParseInstructions(elf_, cie.code_alignment_factor, cie.data_alignment_factor,\n cie.instructions_begin, cie.instructions_end, -1);\n err.has_err()) {\n return err;\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":485,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Code/trunk/cpp/Geometry/CartesianMesh/CartesianMesh_base.hh"},"repo_name":{"kind":"string","value":"jlconlin/PhDThesis"},"commit":{"kind":"string","value":"8e704613721a800ce1c59576e94f40fa6f7cd986"},"file_code":{"kind":"string","value":"\n\n#ifndef CARTESIANMESH_BASE_HH\n#define CARTESIANMESH_BASE_HH\n\n#include <boost/ptr_container/ptr_vector.hpp>\n\n#include \"Types.hh\"\n#include \"Dimension.hh\"\n#include \"GeomId.hh\"\n#include \"MeshTraits.hh\"\n#include \"Assert.hh\"\n#include \"GeometricElementConcept.hh\"\n\nusing boost::ptr_vector;\n\ntemplate<typename dimension_type, typename geom_elem>\ninline typename CartesianMesh<dimension_type>::SizeType \nnumCentering(const CartesianMesh<dimension_type>& mesh);\n\ntemplate<typename dimension_type>\nclass CartesianMesh_base : public MeshTraits<dimension_type>, \n boost::noncopyable\n{\nprivate:\n \n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\npublic:\n \n typedef dimension_type DimensionType;\n \n typedef MeshTraits<DimensionType> Base;\n \npublic:\n \n\t\n\ttypename Base::LengthType length() const \n\t{ \n\t return mLength; \n\t}\n \n typename Base::SizeType numZones() const\n {\n return mZones.size() + numGhostZones();\n }\n \n typename Base::SizeType numNodes() const\n {\n return mNodes.size() + numGhostNodes();\n }\n \n typename Base::SizeType numCorners() const\n {\n return mCorners.size() + numGhostCorners();\n }\n \n typename Base::SizeType numGhostZones() const\n\t{\n\t if(mGhostZones == 0) \n\t return 0;\n\t else\n\t return mGhostZones->size();\n }\n \n typename Base::SizeType numGhostNodes() const\n {\n if(mGhostNodes == 0)\n return 0;\n else\n return mGhostNodes->size();\n }\n \n typename Base::SizeType numGhostCorners() const\n {\n if(mGhostCorners == 0)\n return 0;\n else\n return mGhostCorners->size();\n } \n\t\n\t\n\t\n\ttypename Base::ZoneIterator zoneBegin() \n\t{ \n\t return typename Base::ZoneIterator( mZones, mZones.begin() ); \n\t}\n\t\n\ttypename Base::ZoneIterator zoneEnd() \n\t{ \n\t return typename Base::ZoneIterator( mZones, mZones.end() ); \n\t}\n\t\n\ttypename Base::const_ZoneIterator zoneBegin() const \n\t{ \n\t return typename Base::const_ZoneIterator( mZones, mZones.begin() ); \n\t}\n\t\n\ttypename Base::const_ZoneIterator zoneEnd() const \n\t{ \n\t return typename Base::const_ZoneIterator(mZones, mZones.end()); \n\t}\n\t\n\t\n\t\n\ttypename Base::NodeIterator nodeBegin() \n\t{ \n\t return typename Base::NodeIterator( mNodes, mNodes.begin() ); \n\t}\n\t\n\ttypename Base::NodeIterator nodeEnd() \n\t{ \n\t return typename Base::NodeIterator( mNodes, mNodes.end() ); \n\t}\n\t\n\ttypename Base::const_NodeIterator nodeBegin() const \n\t{ \n\t return typename Base::const_NodeIterator( mNodes, mNodes.begin() ); \n\t}\n\t\n\ttypename Base::const_NodeIterator nodeEnd() const \n\t{ \n\t return typename Base::const_NodeIterator( mNodes, mNodes.end() ); \n\t}\t\n\t\n\t\n\t\n\ttypename Base::CornerIterator cornerBegin() \n\t{ \n\t return typename Base::CornerIterator( mCorners, mCorners.begin() ); \n\t}\n\t\n\ttypename Base::CornerIterator cornerEnd() \n\t{ \n\t return typename Base::CornerIterator( mCorners, mCorners.end() ); \n\t}\n\t\n\ttypename Base::const_CornerIterator cornerBegin() const \n\t{ \n\t return typename Base::const_CornerIterator( mCorners, mCorners.begin() ); \n\t}\n\t\n\ttypename Base::const_CornerIterator cornerEnd() const \n\t{ \n\t return typename Base::const_CornerIterator( mCorners, mCorners.end() ); \n\t}\t\n\t\n\t\n\t\n\ttypename Base::reverse_ZoneIterator zoneRBegin() \n\t{ \n\t return typename Base::reverse_ZoneIterator( zoneEnd() ); \n\t}\n\t\n\ttypename Base::reverse_ZoneIterator zoneREnd() \n\t{ \n\t return typename Base::reverse_ZoneIterator( zoneBegin() ); \n\t}\n\t\n\ttypename Base::const_reverse_ZoneIterator zoneRBegin() const \n\t{ \n\t return typename Base::const_reverse_ZoneIterator( zoneEnd() ); \n\t}\n\t\n\ttypename Base::const_reverse_ZoneIterator zoneREnd() const \n\t{ \n\t return typename Base::const_reverse_ZoneIterator( zoneBegin() ); \n\t}\n\t\n\t\n\t\n\ttypename Base::reverse_NodeIterator nodeRBegin() \n\t{ \n\t return typename Base::reverse_NodeIterator( nodeEnd() ); \n\t}\n\t\n\ttypename Base::reverse_NodeIterator nodeREnd() \n\t{ \n\t return typename Base::reverse_NodeIterator( nodeBegin() ); \n\t}\n\t\n\ttypename Base::const_reverse_NodeIterator nodeRBegin() const \n\t{ \n\t return typename Base::const_reverse_NodeIterator( nodeEnd() ); \n\t}\n\t\n\ttypename Base::const_reverse_NodeIterator nodeREnd() const \n\t{ \n\t return typename Base::const_reverse_NodeIterator( nodeBegin() ); \n\t}\n\t\n\t\n\t\n\ttypename Base::reverse_CornerIterator cornerRBegin() \n\t{ \n\t return typename Base::reverse_CornerIterator( cornerEnd() ); \n\t}\n\t\n\ttypename Base::reverse_CornerIterator cornerREnd() \n\t{ \n\t return typename Base::reverse_CornerIterator( cornerBegin() ); \n\t}\n\t\n\ttypename Base::const_reverse_CornerIterator cornerRBegin() const \n\t{ \n\t return typename Base::const_reverse_CornerIterator( cornerEnd() ); \n\t}\n\t\n\ttypename Base::const_reverse_CornerIterator cornerREnd() const \n\t{ \n\t return typename Base::const_reverse_CornerIterator( cornerBegin() ); \n\t}\n\nprotected:\n \n CartesianMesh_base(typename Base::LengthType length_in, \n typename Base::SizeType num_zones,\n typename Base::SizeType num_nodes, \n typename Base::SizeType num_corners,\n typename Base::SizeType num_ghost_zones, \n typename Base::SizeType num_ghost_nodes,\n typename Base::SizeType num_ghost_corners)\n : mLength(length_in), mZones(num_zones), \n mNodes(num_nodes), mCorners(num_corners),\n mGhostZones(0), mGhostNodes(0), mGhostCorners(0)\n {\n if(num_ghost_zones != 0)\n {\n mGhostZones = new ptr_vector<typename Base::GhostZone>(num_ghost_zones);\n }\n if(num_ghost_nodes != 0)\n {\n mGhostNodes = new ptr_vector<typename Base::GhostNode>(num_ghost_nodes);\n }\n if(num_ghost_corners != 0)\n {\n mGhostCorners = new ptr_vector<typename Base::GhostCorner>(num_ghost_corners);\n }\n } \n\n \n ~CartesianMesh_base()\n {\n if(mGhostZones != 0)\n {\n delete mGhostZones;\n }\n if(mGhostNodes != 0)\n {\n delete mGhostNodes;\n }\n if(mGhostCorners != 0)\n {\n delete mGhostCorners;\n }\n }\n\n \n\ttypename Base::LengthType mLength;\n\n \n\tptr_vector<typename Base::Zone> mZones;\n\t\n\tptr_vector<typename Base::Node> mNodes;\n\t\n\tptr_vector<typename Base::Corner> mCorners;\n\t\n\t\n\tptr_vector<typename Base::GhostZone>* mGhostZones;\n\t\n\tptr_vector<typename Base::GhostNode>* mGhostNodes;\n\t\n\tptr_vector<typename Base::GhostCorner>* mGhostCorners;\n\nprivate:\n \n CartesianMesh_base();\n};\n\ntemplate<typename dimension_type>\nclass CartesianMesh : CartesianMesh_base<dimension_type>, \n boost::noncopyable\n{ \nprivate:\n \n CartesianMesh();\n};\n\n#endif\n\n"},"prefix":{"kind":"string","value":"\n\n#ifndef CARTESIANMESH_BASE_HH\n#define CARTESIANMESH_BASE_HH\n\n#include <boost/ptr_container/ptr_vector.hpp>\n\n#include \"Types.hh\"\n#include \"Dimension.hh\"\n#include \"GeomId.hh\"\n#include \"MeshTraits.hh\"\n#include \"Assert.hh\"\n#include \"GeometricElementConcept.hh\"\n\nusing boost::ptr_vector;\n\ntemplate<typename dimension_type, typename geom_elem>\ninline typename CartesianMesh<dimension_type>::SizeType \nnumCentering(const CartesianMesh<dimension_type>& mesh);\n\ntemplate<typename dimension_type>\nclass CartesianMesh_base : public MeshTraits<dimension_type>, \n boost::noncopyable\n{\nprivate:\n \n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\npublic:\n \n typedef dimension_type DimensionType;\n \n typedef MeshTraits<DimensionType> Base;\n \npublic:\n \n\t\n\ttypename Base::LengthType length() const \n\t{ \n\t return mLength; \n\t}\n \n typename Base::SizeType numZones() const\n {\n return mZones.size() + numGhostZones();\n }\n \n typename Base::SizeType numNodes() const\n {\n return mNodes.size() + numGhostNodes();\n }\n \n typename Base::SizeType numCorners() const\n {\n return mCorners.size() + numGhostCorners();\n }\n \n typename Base::SizeType numGhostZones() const\n\t{\n\t if(mGhostZones == 0) \n\t return 0;\n\t else\n\t return mGhostZones->size();\n }\n \n typename Base::SizeType numGhostNodes() const\n {\n if(mGhostNodes == 0)\n return 0;\n else\n return mGhostNodes->size();\n }\n \n typename Base::SizeType numGhostCorners() const\n {\n if(mGhostCorners == 0)\n "},"suffix":{"kind":"string","value":"\t\n\ttypename Base::const_NodeIterator nodeEnd() const \n\t{ \n\t return typename Base::const_NodeIterator( mNodes, mNodes.end() ); \n\t}\t\n\t\n\t\n\t\n\ttypename Base::CornerIterator cornerBegin() \n\t{ \n\t return typename Base::CornerIterator( mCorners, mCorners.begin() ); \n\t}\n\t\n\ttypename Base::CornerIterator cornerEnd() \n\t{ \n\t return typename Base::CornerIterator( mCorners, mCorners.end() ); \n\t}\n\t\n\ttypename Base::const_CornerIterator cornerBegin() const \n\t{ \n\t return typename Base::const_CornerIterator( mCorners, mCorners.begin() ); \n\t}\n\t\n\ttypename Base::const_CornerIterator cornerEnd() const \n\t{ \n\t return typename Base::const_CornerIterator( mCorners, mCorners.end() ); \n\t}\t\n\t\n\t\n\t\n\ttypename Base::reverse_ZoneIterator zoneRBegin() \n\t{ \n\t return typename Base::reverse_ZoneIterator( zoneEnd() ); \n\t}\n\t\n\ttypename Base::reverse_ZoneIterator zoneREnd() \n\t{ \n\t return typename Base::reverse_ZoneIterator( zoneBegin() ); \n\t}\n\t\n\ttypename Base::const_reverse_ZoneIterator zoneRBegin() const \n\t{ \n\t return typename Base::const_reverse_ZoneIterator( zoneEnd() ); \n\t}\n\t\n\ttypename Base::const_reverse_ZoneIterator zoneREnd() const \n\t{ \n\t return typename Base::const_reverse_ZoneIterator( zoneBegin() ); \n\t}\n\t\n\t\n\t\n\ttypename Base::reverse_NodeIterator nodeRBegin() \n\t{ \n\t return typename Base::reverse_NodeIterator( nodeEnd() ); \n\t}\n\t\n\ttypename Base::reverse_NodeIterator nodeREnd() \n\t{ \n\t return typename Base::reverse_NodeIterator( nodeBegin() ); \n\t}\n\t\n\ttypename Base::const_reverse_NodeIterator nodeRBegin() const \n\t{ \n\t return typename Base::const_reverse_NodeIterator( nodeEnd() ); \n\t}\n\t\n\ttypename Base::const_reverse_NodeIterator nodeREnd() const \n\t{ \n\t return typename Base::const_reverse_NodeIterator( nodeBegin() ); \n\t}\n\t\n\t\n\t\n\ttypename Base::reverse_CornerIterator cornerRBegin() \n\t{ \n\t return typename Base::reverse_CornerIterator( cornerEnd() ); \n\t}\n\t\n\ttypename Base::reverse_CornerIterator cornerREnd() \n\t{ \n\t return typename Base::reverse_CornerIterator( cornerBegin() ); \n\t}\n\t\n\ttypename Base::const_reverse_CornerIterator cornerRBegin() const \n\t{ \n\t return typename Base::const_reverse_CornerIterator( cornerEnd() ); \n\t}\n\t\n\ttypename Base::const_reverse_CornerIterator cornerREnd() const \n\t{ \n\t return typename Base::const_reverse_CornerIterator( cornerBegin() ); \n\t}\n\nprotected:\n \n CartesianMesh_base(typename Base::LengthType length_in, \n typename Base::SizeType num_zones,\n typename Base::SizeType num_nodes, \n typename Base::SizeType num_corners,\n typename Base::SizeType num_ghost_zones, \n typename Base::SizeType num_ghost_nodes,\n typename Base::SizeType num_ghost_corners)\n : mLength(length_in), mZones(num_zones), \n mNodes(num_nodes), mCorners(num_corners),\n mGhostZones(0), mGhostNodes(0), mGhostCorners(0)\n {\n if(num_ghost_zones != 0)\n {\n mGhostZones = new ptr_vector<typename Base::GhostZone>(num_ghost_zones);\n }\n if(num_ghost_nodes != 0)\n {\n mGhostNodes = new ptr_vector<typename Base::GhostNode>(num_ghost_nodes);\n }\n if(num_ghost_corners != 0)\n {\n mGhostCorners = new ptr_vector<typename Base::GhostCorner>(num_ghost_corners);\n }\n } \n\n \n ~CartesianMesh_base()\n {\n if(mGhostZones != 0)\n {\n delete mGhostZones;\n }\n if(mGhostNodes != 0)\n {\n delete mGhostNodes;\n }\n if(mGhostCorners != 0)\n {\n delete mGhostCorners;\n }\n }\n\n \n\ttypename Base::LengthType mLength;\n\n \n\tptr_vector<typename Base::Zone> mZones;\n\t\n\tptr_vector<typename Base::Node> mNodes;\n\t\n\tptr_vector<typename Base::Corner> mCorners;\n\t\n\t\n\tptr_vector<typename Base::GhostZone>* mGhostZones;\n\t\n\tptr_vector<typename Base::GhostNode>* mGhostNodes;\n\t\n\tptr_vector<typename Base::GhostCorner>* mGhostCorners;\n\nprivate:\n \n CartesianMesh_base();\n};\n\ntemplate<typename dimension_type>\nclass CartesianMesh : CartesianMesh_base<dimension_type>, \n boost::noncopyable\n{ \nprivate:\n \n CartesianMesh();\n};\n\n#endif\n\n"},"middle":{"kind":"string","value":" return 0;\n else\n return mGhostCorners->size();\n } \n\t\n\t\n\t\n\ttypename Base::ZoneIterator zoneBegin() \n\t{ \n\t return typename Base::ZoneIterator( mZones, mZones.begin() ); \n\t}\n\t\n\ttypename Base::ZoneIterator zoneEnd() \n\t{ \n\t return typename Base::ZoneIterator( mZones, mZones.end() ); \n\t}\n\t\n\ttypename Base::const_ZoneIterator zoneBegin() const \n\t{ \n\t return typename Base::const_ZoneIterator( mZones, mZones.begin() ); \n\t}\n\t\n\ttypename Base::const_ZoneIterator zoneEnd() const \n\t{ \n\t return typename Base::const_ZoneIterator(mZones, mZones.end()); \n\t}\n\t\n\t\n\t\n\ttypename Base::NodeIterator nodeBegin() \n\t{ \n\t return typename Base::NodeIterator( mNodes, mNodes.begin() ); \n\t}\n\t\n\ttypename Base::NodeIterator nodeEnd() \n\t{ \n\t return typename Base::NodeIterator( mNodes, mNodes.end() ); \n\t}\n\t\n\ttypename Base::const_NodeIterator nodeBegin() const \n\t{ \n\t return typename Base::const_NodeIterator( mNodes, mNodes.begin() ); \n\t}\n"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class MeshBaseException : public ExceptionBase\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c ExceptionBase base class.\n\n\ttypedef ExceptionBase::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n MeshBaseException(LineNumType line_number, const char* file_in)\n\n : ExceptionBase(line_number, file_in)\n\n { }\n\n};\n\n\n\n/*! \\brief Thrown when a non-existent connected element access is attempted.\n\n *\n\n * This class is thrown when some geometric element attempts to access through\n\n * its connectivity another geometric element that does not actually exist, i.e.\n\n * if a \\c Node on the left boundary attempts to access its left \\c Zone object,\n\n * which obviously would not exist.\n\n * \\par Template Parameters:\n\n * <dl> <dt> \\e source_element </dt>\n\n * <dd> The type of the geometric element that made the bad call. </dd>\n\n * <dt> \\e target_element </dt>\n\n * <dd> The type of geometric element whose access was attempted. </dd> </dl> */\n\ntemplate<typename source_element, typename target_element>\n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":0,"score":298683.1462251717},{"content":"class BadMeshLength : public BadMeshUserData\n\n{\n\nprivate:\n\n /// Requires the \\c dimension_type template parameter satisfies the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n /// Defines the \\c DimensionType type from the \\c dimension_type template parameter.\n\n typedef dimension_type DimensionType;\n\n \n\npublic:\n\n /// Defines the \\c LengthType from the \\c MeshTraits<DimensionType>::LengthType type.\n\n typedef typename MeshTraits<DimensionType>::LengthType LengthType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown and the mesh length.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown,\n\n * and the length given to the mesh constructor.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. \n\n * \\param[in] mesh_length The length given to the mesh constructor. */ \n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":2,"score":286359.1488029023},{"content":"class BadMeshUserData : public MeshBaseException\n\n{\n\npublic:\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n BadMeshUserData(MeshBaseException::LineNumType line_number,\n\n const char* filename)\n\n : MeshBaseException(line_number, filename)\n\n { }\n\n};\n\n\n\n/*! \\brief Thrown when a \\c CartesianMesh object is given a bad length.\n\n *\n\n * This exception is thrown when a \\c CartesianMesh is given an invalid length.\n\n * \\par Template Parameters:\n\n * <dl> <dt> \\e dimension_type </dt>\n\n * <dd> The spatial dimension that the \\c CartesianMesh spans. This type must\n\n * satisfy the \\c DimensionConcept concept. </dd> </dl> */\n\ntemplate<typename dimension_type>\n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":3,"score":286185.1260563774},{"content":"class ElementDoesNotExist : public MeshBaseException\n\n{\n\nprivate:\n\n /// Requires the \\c geom_element type satisfies the \\c GeometricElementConcept concept.\n\n BOOST_CLASS_REQUIRE(geom_element, , GeometricElementConcept);\n\n /// Defines the \\c GeomElementType from the template parameter \\c geom_element.\n\n typedef geom_element GeomElementType;\n\n \n\npublic:\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown and the element id.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown,\n\n * and the id number of the attempted element access.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. \n\n * \\param[in] id_in The id number given to the \\c CartesianMesh to attempt the\n\n * geometric element access. */\n\n ElementDoesNotExist(MeshBaseException::LineNumType line_number,\n\n const char* filename,\n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":4,"score":285809.7257025615},{"content":"class NoElementConnected : public MeshBaseException\n\n{\n\nprivate:\n\n /// Requires that the \\c source_element type satisfy the \\c GeometricElementConcept concept.\n\n BOOST_CLASS_REQUIRE(source_element, , GeometricElementConcept);\n\n\n\n /// Defines the \\c SourceIdType from the \\c source_element::Id type.\n\n typedef typename source_element::Id SourceIdType;\n\n /// Defines the \\c SourceIndexType from the \\c source_element::IndexType type.\n\n typedef typename source_element::IndexType SourceIndexType;\n\npublic:\n\n /// Defines the \\c SourceElementType from the \\c source_element template parameter.\n\n typedef source_element SourceElementType;\n\n /// Defines the \\c TargetElementType from the \\c target_element template parameter.\n\n typedef target_element TargetElementType;\n\n\n\n /*! \\brief Constructor. Takes in the line number and file where the exception is thrown,\n\n * and the source id number and local target id number.\n\n *\n\n * Construtor. Takes in the line number and filename where the exception is thrown. Also\n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":5,"score":285809.7257025615},{"content":"class NegativeZoneLength : public BadMeshUserData\n\n{\n\nprivate:\n\n /// Requires the \\c dimension_type template parameter satisfies the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n /// Defines the \\c DimensionType type from the \\c dimension_type template parameter.\n\n typedef dimension_type DimensionType;\n\npublic:\n\n /// Defines the \\c LengthType from the \\c MeshTraits<DimensionType>::LengthType type.\n\n typedef typename MeshTraits<DimensionType>::LengthType LengthType;\n\n /// Defines the \\c IdType from the \\c MeshTraits<DimensionType>::Zone::Id::IdType type. \n\n typedef typename MeshTraits<DimensionType>::Zone::Id::IdType IdType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown, the id of the negative zone, and the negative length.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown,\n\n * as well as the id number of the \\c Zone with the negative length, and the length itself. \n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. \n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":6,"score":280347.1524682773},{"content":"class Point_base : public boost::noncopyable\n\n{\n\nprivate:\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n \n\npublic:\n\n /// Aliases the \\c dimension_type as a \\c DimensionType.\n\n typedef dimension_type DimensionType;\n\n /// Defines the \\c PointType as a real number.\n\n typedef Real8 PointType;\n\n\n\n\t/*! \\brief Returns a reference to the x-position of the \n\n\t * \\c Point object.\n\n\t *\n\n\t * Returns a reference to the x-position of the \\c Point object.\n\n\t * \\return A reference to the x-position of the \\c Point object. */\n\n\tPointType& x()\n\n\t{\n\n\t return mX;\n\n\t}\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/Point_base.hh","rank":7,"score":280043.0749485686},{"content":"class Zone_base : public boost::noncopyable\n\n{\n\nprivate:\n\n /// Requires that the \\c dimension_type satisfies the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n \n\npublic:\n\n /// Aliases the \\c dimension_type as the \\c DimensionType type.\n\n typedef dimension_type DimensionType;\n\n /// Uses the \\c MeshTraits<DimensionType>::LengthType as a \\c LengthType.\n\n\ttypedef typename MeshTraits<DimensionType>::LengthType LengthType;\n\n /// Uses the \\c MeshTraits<DimensionType>::SizeType as a \\c SizeType.\n\n\ttypedef typename MeshTraits<DimensionType>::SizeType SizeType;\n\n /// Uses the \\c MeshTraits<DimensionType>::IndexType as a \\c IndexType.\n\n\ttypedef typename MeshTraits<DimensionType>::IndexType IndexType;\n\n\t\n\n\t/// Defines an identification number type.\n\n\ttypedef GeomId< Zone<DimensionType> > Id;\n\n\t/// Defines the \\c Node type for connectivity.\n\n\ttypedef Node<DimensionType> Node;\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/Zone_base.hh","rank":8,"score":280043.0749485686},{"content":"class Node_base : public boost::noncopyable\n\n{\n\nprivate:\n\n /// Requires \\c dimension_type to satisfy the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n\n\npublic:\n\n /// Aliases the \\c dimension_type as \\c DimensionType type.\n\n typedef dimension_type DimensionType;\n\n /// Defines an \\c IndexType for indexing connected elements.\n\n\ttypedef UnsignedInt4 IndexType;\n\n\t/// Defines a \\c PointType for storing spatial points.\n\n typedef Point<DimensionType> PointType;\n\n /// Defines an \\c Id type for storing the id number for a \\c Node object.\n\n\ttypedef GeomId< Node<DimensionType> > Id;\n\n\t/// Defines a \\c Zone type for storing connected \\c Zone objects.\n\n\ttypedef Zone<DimensionType> Zone;\n\n\t/// Defines a \\c Corner type for storing connected \\c Corner objects.\n\n\ttypedef Corner<DimensionType> Corner;\n\n\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/Node_base.hh","rank":9,"score":280043.0749485686},{"content":"/// \\brief Thrown when numCentering is given a non-existing geometric sub element.\n\n/// \n\n/// The NoSuchElement exception is thrown by numCentering if a non-existing geometric sub-element \n\n/// is given to it as a template parameter.\n\nclass NoSuchElement : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoSuchElement(unsigned int line_number, const string& file_in)\n\n\t\t: ExceptionBase(line_number, file_in) { }\n\n\t\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{ \n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant element at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n","file_path":"Code/branches/PHYSOR/cpp/Exception/MeshExcept.hh","rank":10,"score":279479.55850490765},{"content":"/// \\brief Thrown when a non-existing Zone is referenced through connectivity.\n\n/// \n\n/// The NoZoneConnected class is thrown when attempting to reference a Zone that does not exist,\n\n/// such as asking for the left Zone from a Node on the left boundary.\n\nclass NoZoneConnected : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoZoneConnected(unsigned int line_number, const string& file_in)\n\n\t\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{ \n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant zone at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/MeshExcept.hh","rank":11,"score":276282.11766666593},{"content":"/// \\brief Thrown when a non-existing Corner is referenced through connectivity.\n\n///\n\n/// The NoCornerConnected class is thrown when attempting to reference a Corner that does not exist,\n\n/// such as asking for the left Corner from a Node on the left boundary.\n\nclass NoCornerConnected : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoCornerConnected(unsigned int line_number, const string& file_in)\n\n\t\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant corner at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/MeshExcept.hh","rank":12,"score":276282.11766666593},{"content":"/// \\brief Thrown when numCentering is given a non-existing geometric sub element.\n\n/// \n\n/// The NoSuchElement exception is thrown by numCentering if a non-existing geometric sub-element \n\n/// is given to it as a template parameter.\n\nclass NoSuchElement : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoSuchElement(unsigned int line_number, const string& file_in)\n\n\t\t: ExceptionBase(line_number, file_in) { }\n\n\t\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{ \n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant element at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n","file_path":"Code/branches/OldGeometry/cpp/Exception/MeshExcept.hh","rank":13,"score":276276.8628034643},{"content":"/// \\brief Thrown when numCentering is given a non-existing geometric sub element.\n\n/// \n\n/// The NoSuchElement exception is thrown by numCentering if a non-existing geometric sub-element \n\n/// is given to it as a template parameter.\n\nclass NoSuchElement : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoSuchElement(unsigned int line_number, const string& file_in)\n\n\t\t: ExceptionBase(line_number, file_in) { }\n\n\t\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{ \n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant element at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/MeshExcept.hh","rank":14,"score":276276.8628034643},{"content":"class GeomVector_base : public boost::noncopyable\n\n{\n\nprivate:\n\n /// This forces \\c dimension_type to satisfy the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n\n\npublic:\n\n\t/// Aliases the \\c dimension_type as \\c DimensionType.\n\n\ttypedef dimension_type DimensionType;\n\n\t/// Defines the \\c OrdinateType as a real number.\n\n\ttypedef Real8 OrdinateType;\n\n\n\n\t/*! \\brief Returns a reference to the x-axis ordinate data.\n\n\t *\n\n\t * Returns a reference to the x-axis ordinate data.\n\n\t * \\return A reference to the x-axis ordinate data. */\n\n\tOrdinateType& i() \n\n\t{ \n\n\t return mI; \n\n\t}\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/GeomVector_base.hh","rank":15,"score":274412.03264756757},{"content":"class SweepIterator_base : public boost::noncopyable\n\n{\n\nprivate:\n\n /// Requires the \\c dimension_type to satisfy the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n /// Requires the \\c container_type to satisfy the \\c MinimalContainerConcept concept.\n\n BOOST_CLASS_REQUIRE(container_type, , MinimalContainerConcept);\n\n /// Define the \\c Zone<dimension_type> as a \\c ZoneType.\n\n typedef Zone<dimension_type> ZoneType;\n\n \n\npublic:\n\n /// Aliases the \\c dimension_type as a \\c DimensionType type.\n\n typedef dimension_type DimensionType;\n\n /// Defines the \\c Angle<DimensionType> as an \\c AngleType type.\n\n typedef Angle<DimensionType> AngleType;\n\n /// Defines the \\c container_type as a \\c ContainerType.\n\n typedef container_type ContainerType;\n\n /// Defines the \\c const_reference type.\n\n typedef typename ContainerType::const_reference const_reference;\n\n \n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/SweepIterator_base.hh","rank":16,"score":274412.03264756757},{"content":"/// \\brief Thrown when a non-existing Zone is referenced through connectivity.\n\n/// \n\n/// The NoZoneConnected class is thrown when attempting to reference a Zone that does not exist,\n\n/// such as asking for the left Zone from a Node on the left boundary.\n\nclass NoZoneConnected : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoZoneConnected(unsigned int line_number, const string& file_in)\n\n\t\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{ \n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant zone at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/MeshExcept.hh","rank":17,"score":273177.0310466499},{"content":"/// \\brief Thrown when a non-existing Zone is referenced through connectivity.\n\n/// \n\n/// The NoZoneConnected class is thrown when attempting to reference a Zone that does not exist,\n\n/// such as asking for the left Zone from a Node on the left boundary.\n\nclass NoZoneConnected : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoZoneConnected(unsigned int line_number, const string& file_in)\n\n\t\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{ \n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant zone at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/MeshExcept.hh","rank":18,"score":273177.0310466499},{"content":"/// \\brief Thrown when a non-existing Corner is referenced through connectivity.\n\n///\n\n/// The NoCornerConnected class is thrown when attempting to reference a Corner that does not exist,\n\n/// such as asking for the left Corner from a Node on the left boundary.\n\nclass NoCornerConnected : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoCornerConnected(unsigned int line_number, const string& file_in)\n\n\t\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant corner at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/MeshExcept.hh","rank":19,"score":273177.0310466499},{"content":"/// \\brief Thrown when a non-existing Corner is referenced through connectivity.\n\n///\n\n/// The NoCornerConnected class is thrown when attempting to reference a Corner that does not exist,\n\n/// such as asking for the left Corner from a Node on the left boundary.\n\nclass NoCornerConnected : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tNoCornerConnected(unsigned int line_number, const string& file_in)\n\n\t\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to reference a non-existant corner at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/MeshExcept.hh","rank":20,"score":273177.0310466499},{"content":"class NegativeAngleVectorLength : public AngularBaseException\n\n{\n\nprivate:\n\n BOOST_CLASS_REQUIRE(angle_vector_type, , AngleVectorConcept);\n\n \n\npublic:\n\n typedef angle_vector_type AngleVectorType;\n\n typedef typename angle_vector_type::IndexType IndexType;\n\n \n\n NegativeAngleVectorLength(const AngleVectorType& av_in,\n\n const typename IndexType::difference_type length_in,\n\n LineNumType line_number, const char* file_in) \n\n : AngularBaseException(line_number, file_in),\n\n mAngleVector(av_in),\n\n mLength(length_in)\n\n { }\n\n \n\n const AngleVectorType& getAngleVector() const\n\n {\n\n return mAngleVector;\n","file_path":"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh","rank":21,"score":268306.61571033945},{"content":"class SweepIterator : public boost::noncopyable\n\n{\n\nprivate:\n\n /// This default constructor is private to prevent instantiation.\n\n SweepIterator();\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/SweepIterator_base.hh","rank":22,"score":264157.7815934742},{"content":"class Node : public Node_base<dimension_type>, boost::noncopyable\n\n{ \n\nprivate:\n\n /// The default constructor is private to prevent instantiation. \n\n Node();\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/Node_base.hh","rank":23,"score":262263.4778019414},{"content":"class Point : public Point_base<dimension_type>, boost::noncopyable\n\n{\n\nprivate:\n\n /// The default constructor is private to prevent instantiation.\n\n Point(); \n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/Point_base.hh","rank":24,"score":262263.47780194134},{"content":"class Zone : public Zone_base<dimension_type>, boost::noncopyable\n\n{ \n\nprivate:\n\n /// The default constructor is private to prevent instantiation.\n\n Zone();\n\n};\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/Zone_base.hh","rank":25,"score":262263.4778019414},{"content":"class CartesianMesh<OneD> : public CartesianMesh_base<OneD>\n\n{\n\nprivate:\n\n /// Defines the base class as the Base type.\n\n typedef CartesianMesh_base<OneD> Base;\n\n \n\npublic:\n\n /// Imports the Zone class from the Base type.\n\n typedef Base::Zone Zone;\n\n /// Imports the Node class from the Base type.\n\n typedef Base::Node Node;\n\n /// Imports the Corner class from the Base type.\n\n typedef Base::Corner Corner;\n\n\n\nprivate:\n\n /// Requires the \\c Zone type to satisfy the \\c ZoneConcept concept.\n\n BOOST_CLASS_REQUIRE(Zone, , ZoneConcept);\n\n /// Requires the \\c Node type to satisfy the \\c NodeConcept concept.\n\n BOOST_CLASS_REQUIRE(Node, , NodeConcept);\n\n /// Requires the \\c Corner type to satisfy the \\c CornerConcept concept.\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/OneD/CartesianMesh1D.hh","rank":26,"score":260492.24657733698},{"content":"class DaughterTemplate : public Base<S>{\n\n using Base<S>::_SVar;\n\npublic:\n\n DaughterTemplate(S& init) : Base<S>(init) { }\n\n\n\n void Express(S x) { \n\n cout << \"Expressing Daughter with x = \" << x \n\n << \"\\n\\tBase variables: _SVar = \" << _SVar\n\n << \"\\n\\tDaughter variables: _dVar = \" << _dVar << endl;\n\n }\n\n\n\nprivate:\n\n S _dVar;\n\n\n\n};\n\n\n","file_path":"Code/trunk/cpp/test/general.hpp","rank":27,"score":258778.08754220174},{"content":"/// \\brief The Mesh class is responsible for storing and controlling a problem's spatial \n\n/// domain information.\n\n///\n\n/// The Mesh class is responsible for storing and controlling a problem's spatial \n\n/// domain information. First, the mesh stores the global length and area of the domain.\n\n/// Second, the Mesh also stores the geometric elements, which are (for a one-dimensional\n\n/// mesh), Zones, Nodes, and Corners. Together with these geometric elements, the Mesh\n\n/// stores all of the information necessary to fully describe a problem's spatial domain.\n\nclass Mesh : public MeshTraits, boost::noncopyable\n\n{\n\npublic:\n\n\t// ****** Mesh Constructors ******\n\n /// \\brief Constructor to create a uniform one-dimensional Cartesian Mesh with \\a num_zones\n\n\t/// zones.\n\n\t///\n\n\t/// This constructor creates a uniform (all Zones are of equal length), one-dimensional\n\n\t/// Cartesian Mesh.\n\n\t/// \\param length Length of the spatial domain.\n\n\t/// \\param area Cross-sectional area of the spatial domain.\n\n\t/// \\param num_zones The number of zones to break the spatial domain into.\n\n Mesh(const double length_in, const double area_in, const unsigned int num_zones)\n\n\t\t\t: mLength(length_in),\n\n\t\t\t mArea(area_in),\n\n\t\t\t mNumZones(num_zones),\n\n\t\t\t mZones(), mNodes(), mCorners()\n\n\t{\n\n\t\tvector<double> zone_lengths(num_zones, length_in/num_zones);\n\n\t\tmBuildMesh(zone_lengths);\n","file_path":"Code/branches/PHYSOR/cpp/Geometry/OneDMesh/OneDCartMesh.hh","rank":28,"score":255642.97040024173},{"content":"class GeomVector : public GeomVector_base<dimension_type>, boost::noncopyable\n\n{\n\nprivate:\n\n /// This constructor is private to prevent instantiation.\n\n GeomVector();\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/GeomVector_base.hh","rank":29,"score":254576.55126839975},{"content":"/// \\brief The Mesh class is responsible for storing and controlling a problem's spatial \n\n/// domain information.\n\n///\n\n/// The Mesh class is responsible for storing and controlling a problem's spatial \n\n/// domain information. First, the mesh stores the global length and area of the domain.\n\n/// Second, the Mesh also stores the geometric elements, which are (for a one-dimensional\n\n/// mesh), Zones, Nodes, and Corners. Together with these geometric elements, the Mesh\n\n/// stores all of the information necessary to fully describe a problem's spatial domain.\n\nclass Mesh : public MeshTraits, boost::noncopyable\n\n{\n\npublic:\n\n\t// ****** Mesh Constructors ******\n\n /// \\brief Constructor to create a uniform one-dimensional Cartesian Mesh with \\a num_zones\n\n\t/// zones.\n\n\t///\n\n\t/// This constructor creates a uniform (all Zones are of equal length), one-dimensional\n\n\t/// Cartesian Mesh.\n\n\t/// \\param length Length of the spatial domain.\n\n\t/// \\param area Cross-sectional area of the spatial domain.\n\n\t/// \\param num_zones The number of zones to break the spatial domain into.\n\n Mesh(const double length_in, const double area_in, const unsigned int num_zones)\n\n\t\t\t: mLength(length_in),\n\n\t\t\t mArea(area_in),\n\n\t\t\t mNumZones(num_zones),\n\n\t\t\t mZones(), mNodes(), mCorners()\n\n\t{\n\n\t\tvector<double> zone_lengths(num_zones, length_in/num_zones);\n\n\t\tmBuildMesh(zone_lengths);\n","file_path":"Code/branches/OldGeometry/cpp/Geometry/OneDMesh/OneDCartMesh.hh","rank":30,"score":253968.70046256302},{"content":"/// \\brief The Mesh class is responsible for storing and controlling a problem's spatial \n\n/// domain information.\n\n///\n\n/// The Mesh class is responsible for storing and controlling a problem's spatial \n\n/// domain information. First, the mesh stores the global length and area of the domain.\n\n/// Second, the Mesh also stores the geometric elements, which are (for a one-dimensional\n\n/// mesh), Zones, Nodes, and Corners. Together with these geometric elements, the Mesh\n\n/// stores all of the information necessary to fully describe a problem's spatial domain.\n\nclass Mesh : public MeshTraits, boost::noncopyable\n\n{\n\npublic:\n\n\t// ****** Mesh Constructors ******\n\n /// \\brief Constructor to create a uniform one-dimensional Cartesian Mesh with \\a num_zones\n\n\t/// zones.\n\n\t///\n\n\t/// This constructor creates a uniform (all Zones are of equal length), one-dimensional\n\n\t/// Cartesian Mesh.\n\n\t/// \\param length Length of the spatial domain.\n\n\t/// \\param area Cross-sectional area of the spatial domain.\n\n\t/// \\param num_zones The number of zones to break the spatial domain into.\n\n Mesh(const double length_in, const double area_in, const unsigned int num_zones)\n\n\t\t\t: mLength(length_in),\n\n\t\t\t mArea(area_in),\n\n\t\t\t mNumZones(num_zones),\n\n\t\t\t mZones(), mNodes(), mCorners()\n\n\t{\n\n\t\tvector<double> zone_lengths(num_zones, length_in/num_zones);\n\n\t\tmBuildMesh(zone_lengths);\n","file_path":"Code/branches/Pre-Prospectus/cpp/Geometry/OneDMesh/OneDCartMesh.hh","rank":31,"score":253968.70046256302},{"content":"class DaughterString : public Base<std::string>{\n\npublic:\n\n DaughterString(std::string& init) : Base<std::string>(init) { }\n\n\n\n void Express(std::string x) { \n\n cout << \"Expressing Daughter with x = \" << x \n\n << \"\\n\\tBase variables: _SVar = \" << _SVar\n\n << \"\\n\\tDaughter variables: _dVar = \" << _dVar << endl;\n\n }\n\n\n\nprivate:\n\n std::string _dVar;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Code/trunk/cpp/test/general.hpp","rank":32,"score":248613.28028952493},{"content":"class Point<OneD> : public Point_base<OneD>\n\n{\n\nprivate:\n\n /// Aliases the \\c Point_base<OneD> as the \\c Base type.\n\n typedef Point_base<OneD> Base;\n\npublic:\n\n /// Imports the \\c Point_base<OneD>::PointType into the \\c Point<OneD> scope.\n\n\ttypedef Base::PointType PointType;\n\n\n\n /*! \\brief Constructor. Takes in the x-position for the \\c Point<OneD> object.\n\n *\n\n * Constructor. Takes in the x-position for the \\c Point<OneD> object.\n\n * \\param[in] x_in The x-position for the \\c Point<OneD> object. */ \n\n\texplicit Point(PointType x_in = 0.0)\n\n\t : Point_base<OneD>(x_in)\n\n\t{ }\n\n\n\n /*! \\brief Copy constructor.\n\n *\n\n * Copy constructor.\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/OneD/Point1D.hh","rank":33,"score":247878.79401605178},{"content":"class Node<OneD> : public Node_base<OneD>\n\n{\n\npublic:\n\n /// Imports the \\c Id class from \\c Node_base<OneD> into the \\c Node<OneD> scope.\n\n typedef Node_base<OneD>::Id Id;\n\n /// Imports the \\c PointType class from \\c Node_base<OneD> into the \\c Node<OneD> scope.\n\n typedef Node_base<OneD>::PointType PointType;\n\n /// Imports the \\c Zone class from \\c Node_base<OneD> into the \\c Node<OneD> scope.\n\n typedef Node_base<OneD>::Zone Zone;\n\n /// Imports the \\c IndexType class from \\c Node_base<OneD> into the \\c Node<OneD> scope.\n\n typedef Node_base<OneD>::IndexType IndexType;\n\n\n\n typedef Node_base<OneD>::Corner Corner;\n\n\n\n /*! \\brief Imports the \\c NoElementConnected<Node<OneD>, Zone> exception class \n\n * into the \\c Node<OneD> scope. Thrown when an attempt is made to access a \n\n * non-existent connected \\c Zone. */\n\n typedef NoElementConnected< Node<OneD>, Zone > NoZoneConnected;\n\n /*! \\brief Imports the \\c NoElementConnected<Node<OneD>, Corner> exception class \n\n * into the \\c Node<OneD> scope. Thrown when an attempt is made to access a \n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/OneD/Node1D.hh","rank":34,"score":247878.79401605178},{"content":"class Zone<OneD> : public Zone_base<OneD>\n\n{\n\nprivate:\n\n /// Define the \\c Zone_base<OneD> class as \\c Base.\n\n typedef Zone_base<OneD> Base;\n\n \n\npublic:\n\n /// Import the \\c Base::Id type into the \\c Zone scope.\n\n typedef Base::Id Id;\n\n /// Import the \\c Base::LengthType type into the \\c Zone scope.\n\n typedef Base::LengthType LengthType;\n\n /// Import the \\c Base::Node type into the \\c Zone scope.\n\n typedef Base::Node Node;\n\n /// Import the \\c Base::Corner type into the \\c Zone scope.\n\n typedef Base::Corner Corner;\n\n\n\n /*! \\brief Imports the \\c NoElementConnected<Zone<OneD>, Node> exception class \n\n * into the \\c Zone<OneD> scope. Thrown when an attempt is made to access a \n\n * non-existent connected \\c Node. */\n\n typedef NoElementConnected< Zone<OneD>, Node > NoNodeConnected;\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/OneD/Zone1D.hh","rank":35,"score":247878.79401605178},{"content":"class GeomVector<OneD> : public GeomVector_base<OneD>\n\n{\n\nprivate:\n\n /// Defines the \\c GeomVector_base<OneD> as the \\c Base type.\n\n typedef GeomVector_base<OneD> Base;\n\n\n\npublic: \n\n /// Imports the \\c GeomVector_base<OneD>::OrdinateType into this scope.\n\n typedef Base::OrdinateType OrdinateType;\n\n\n\n /*! \\brief Copy constructor.\n\n *\n\n * Copy constructor.\n\n * \\param[in] geom_vec_in The \\c GeomVector<OneD> object to copy. */\n\n GeomVector(const GeomVector<OneD>& geom_vec_in)\n\n : GeomVector_base<OneD>(geom_vec_in.mI)\n\n { }\n\n \n\n /*! \\brief Constructor. Takes in the i-ordinate.\n\n *\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/OneD/GeomVector1D.hh","rank":36,"score":240281.15990563008},{"content":"class BadMeshArea : public BadMeshUserData\n\n{\n\nprivate:\n\n /// Requires the \\c dimension_type template parameter satisfies the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n /// Defines the \\c DimensionType type from the \\c dimension_type template parameter.\n\n typedef dimension_type DimensionType;\n\n \n\npublic:\n\n /// Defines the \\c LengthType from the \\c MeshTraits<DimensionType>::LengthType type.\n\n typedef typename MeshTraits<DimensionType>::LengthType LengthType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown and the mesh area.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown,\n\n * and the area given to the mesh constructor.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. \n\n * \\param[in] mesh_area The area given to the mesh constructor. */ \n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":37,"score":237228.17824256653},{"content":"class AngularBaseException : public ExceptionBase\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c ExceptionBase base class.\n\n\ttypedef ExceptionBase::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n AngularBaseException(LineNumType line_number, const char* file_in)\n\n : ExceptionBase(line_number, file_in)\n\n { }\n\n};\n\n\n\n\n\n/*! \\brief Thrown when the \\c AngleQuad class is constructed with a bad quadrature order.\n\n *\n\n * This exception class is thrown when an \\c AngleQuad class is constructed with a bad\n\n * quadrature order.\n\n * \\par Template Parameters:\n\n * <dl> <dt> \\e angle_quad_type </dt>\n\n * <dd> The type of the bad \\c AngleQuad object. This type must satisfy the\n\n * \\c AngleQuadConcept concept template. </dd> </dl> */\n\ntemplate<typename angle_quad_type>\n","file_path":"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh","rank":38,"score":236518.95575023937},{"content":"class IteratorBaseException : public ExceptionBase\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c ExceptionBase base class.\n\n typedef ExceptionBase::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n\tIteratorBaseException(LineNumType line_number, const char* filename)\n\n\t\t: ExceptionBase(line_number, filename)\n\n\t{ }\n\n};\n\n\n\n/*! \\brief Exception thrown when an out-of-range \\c Iterator or \n\n * \\c ReverseIterator is dereferenced.\n\n *\n\n * This exception is thrown when an out-of-range \\c Iterator or \n\n * \\c ReverseIterator is dereferenced. */\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":39,"score":236518.95575023937},{"content":"class FieldBaseException : public ExceptionBase\n\n{\n\nprivate:\n\n /// Requires that the \\c field_type satisfy the \\c FieldConcept concept.\n\n BOOST_CLASS_REQUIRE(field_type, , FieldConcept); \n\n \n\npublic:\n\n /// Imports the \\c LineNumType from \\c ExceptionBase.\n\n typedef ExceptionBase::LineNumType LineNumType;\n\n /// Defines the \\c field_type template paramater as \\c FieldType.\n\n typedef field_type FieldType;\n\n \n\n /*! \\brief Constructor. Takes in the \\c Field from which the exception was thrown, and the\n\n * line number and filename.\n\n *\n\n * Constructor. Takes in a reference to the \\c Field from which the exception was thrown.\n\n * Also takes in the line number and the name of the file where the exception was thrown.\n\n * \\param[in] field_in A reference to the \\c Field from which the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] file_in The name of the file where the exception was thrown. */\n","file_path":"Code/trunk/cpp/Geometry/Exception/FieldExcept.hh","rank":40,"score":236518.95575023937},{"content":"class ZeroZones : public BadMeshUserData\n\n{\n\npublic:\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown. \n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n ZeroZones(MeshBaseException::LineNumType line_number,\n\n const char* filename)\n\n : BadMeshUserData(line_number, filename)\n\n { }\n\n\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n\n * \\return A \\c string holding a helpful error message. */ \n\n virtual string msg() const\n\n {\n","file_path":"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh","rank":41,"score":233260.57103054703},{"content":"class PowerMCBase : public Markov<BankSource> {\n\n public:\n\n PowerMCBase(const std::vector<unsigned long>& seed,\n\n const Field<Zone, Material>& field)\n\n : Markov<BankSource>(seed, field) { k = 1; }\n\n\n\n ~PowerMCBase() { }\n\n // Scoring function\n\n void score(BankSource& source, Particle& P);\n\n\n\n // Members used in Python\n\n double k; //Eigenvalue estimate\n\n};\n\n\n\n/*score will score in the source from P.*/\n\nvoid PowerMCBase::score(BankSource& source, Particle& P){\n\n double xi = _r.Fixed();\n\n const Material& mat = _field[*(P.zone())];\n\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\n\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\n\n}\n\n#endif\n","file_path":"Code/trunk/cpp/Markov/PowerMCBase.h","rank":42,"score":230516.83399274957},{"content":"class Angle_base : public boost::noncopyable\n\n{\n\nprivate:\n\n /// Requires that the \\c dimension_type satisfy the \\c DimensionConcept concept.\n\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\n\n\n\npublic:\n\n // ****** Public type declarations ******\n\n /// Alias the \\c dimension_type template parameter as \\c DimensionType.\n\n typedef dimension_type DimensionType;\n\n /// Sets \\c GeomVector<DimensionType> as the \\c AngleType.\n\n\ttypedef GeomVector<DimensionType> AngleType;\n\n\t/// Defines the \\c WeightType.\n\n\ttypedef Real8 WeightType;\n\n /// Defines the \\c OrdinateType from the \\c AngleType.\n\n typedef typename AngleType::OrdinateType OrdinateType;\n\n\t\n\n\t// ****** Data accessors ******\n\n\t/*! \\brief Returns a constant reference to the angle ordinate.\n\n\t *\n","file_path":"Code/trunk/cpp/Geometry/AngleQuad/Angle_base.hh","rank":43,"score":230516.83399274957},{"content":"class PowerBase : public Markov<BankSource> {\n\n public:\n\n PowerBase(const std::vector<unsigned long>& seed,\n\n const Field<Zone, Material>& field)\n\n : Markov<BankSource>(seed, field) { k = 1; }\n\n\n\n ~PowerBase() { }\n\n // Scoring function\n\n void score(BankSource& source, Particle& P);\n\n\n\n // Members used in Python\n\n double k; //Eigenvalue estimate\n\n};\n\n\n\n/*score will score in the source from P.*/\n\nvoid PowerBase::score(BankSource& source, Particle& P){\n\n double xi = _r.Fixed();\n\n const Material& mat = _field[*(P.zone())];\n\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\n\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\n\n}\n\n#endif\n","file_path":"Code/branches/Pre-Prospectus/cpp/Markov/PowerBase.h","rank":44,"score":230516.83399274957},{"content":"class PowerMCBase : public Markov<BankSource> {\n\n public:\n\n PowerMCBase(const std::vector<unsigned long>& seed,\n\n const Field<Zone, Material>& field)\n\n : Markov<BankSource>(seed, field) { k = 1; }\n\n\n\n ~PowerMCBase() { }\n\n // Scoring function\n\n void score(BankSource& source, Particle& P);\n\n\n\n // Members used in Python\n\n double k; //Eigenvalue estimate\n\n};\n\n\n\n/*score will score in the source from P.*/\n\nvoid PowerMCBase::score(BankSource& source, Particle& P){\n\n double xi = _r.Fixed();\n\n const Material& mat = _field[*(P.zone())];\n\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\n\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\n\n}\n\n#endif\n","file_path":"Code/branches/PHYSOR/cpp/Markov/PowerMCBase.h","rank":45,"score":228405.72402313811},{"content":"class PowerMCBase : public Markov<BankSource> {\n\n public:\n\n PowerMCBase(const std::vector<unsigned long>& seed,\n\n const Field<Zone, Material>& field)\n\n : Markov<BankSource>(seed, field) { k = 1; }\n\n\n\n ~PowerMCBase() { }\n\n // Scoring function\n\n void score(BankSource& source, Particle& P);\n\n\n\n // Members used in Python\n\n double k; //Eigenvalue estimate\n\n};\n\n\n\n/*score will score in the source from P.*/\n\nvoid PowerMCBase::score(BankSource& source, Particle& P){\n\n double xi = _r.Fixed();\n\n const Material& mat = _field[*(P.zone())];\n\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\n\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\n\n}\n\n#endif\n","file_path":"Code/branches/OldGeometry/cpp/Markov/PowerMCBase.h","rank":46,"score":226350.56879698276},{"content":"/// \\brief InvalidData is thrown if invalid data is passed to Method or one of its derived classes.\n\n///\n\n/// InvalidData is thrown if invalid data is passed to Method or one of its derived classes. For instance,\n\n/// Diffusion must have nonzero opacities to generate diffusion coefficients. \n\nclass InvalidData : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInvalidData(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Invalid data passed to a transport Method. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/MethodExcept.hh","rank":47,"score":225990.4060967319},{"content":"/// \\brief InsaneInput is thrown if the users inputs unphysical data.\n\n///\n\n/// InsaneInput is thrown if the users inputs unphysical data, such as negative temperatures,\n\n/// non-increasing time steps, etc. \n\nclass InsaneInput : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInsaneInput(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Dimension mismatch in input, check for consistency. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/ProblemExcept.hh","rank":48,"score":225984.23349752772},{"content":"/// \\brief ModelingError is thrown if a Method commits a modeling error.\n\n///\n\n/// ModelingError is thrown if a Method is commits a modeling error. An example might be\n\n/// if energy is not conserved or if a probability distribution isn't normalized. \n\nclass ModelingError : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tModelingError(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Method has committed a modeling error. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/MethodExcept.hh","rank":49,"score":225984.23349752772},{"content":"/// \\brief Thrown when an iterator is made invalid or an invalid location is dereferenced.\n\n///\n\n/// IteratorOutOfRange is thrown whenever an attempt is made to dereference an iterator that \n\n/// does not point to a valid object, or when an iterator is moved outside the an objects\n\n/// range.\n\nclass IteratorOutOfRange : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tIteratorOutOfRange(unsigned int line_number, const string& file_in)\n\n\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to dereference an invalid iterator at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/IteratorExcept.hh","rank":50,"score":225984.23349752772},{"content":"/// \\brief AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\n\n///\n\n/// AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\n\nclass AdvancedTooFar : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tAdvancedTooFar(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Method has reached the last time step for this problem. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/MethodExcept.hh","rank":51,"score":225984.23349752772},{"content":"/// \\brief DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension.\n\n///\n\n/// DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension. An example\n\n/// of this might be if the number of problem regions does not match the number of materials, or if the\n\n/// the number of time delta-ts does not match the number of times requested for output. \n\nclass DimensionMismatch : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tDimensionMismatch(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Dimension mismatch in input, check for consistency. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/ProblemExcept.hh","rank":52,"score":225984.23349752772},{"content":"class LowWeightParticle : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception \n\n //was thrown.\n\n\tLowWeightParticle(const Particle& P, unsigned int line_number,\n\n const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n string msg() const {\n\n ostringstream out;\n\n out << \"Particle was killed due to low weight.\\n\";\n\n return out.str();\n\n }\n\n\n\n};\n\n\n","file_path":"Code/trunk/cpp/Exception/MonteCarloExcept.h","rank":53,"score":225984.23349752772},{"content":"/// \\brief InvalidData is thrown if invalid data is passed to Method or one of its derived classes.\n\n///\n\n/// InvalidData is thrown if invalid data is passed to Method or one of its derived classes. For instance,\n\n/// Diffusion must have nonzero opacities to generate diffusion coefficients. \n\nclass InvalidData : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInvalidData(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Invalid data passed to a transport Method. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/MethodExcept.hh","rank":54,"score":223651.70782683336},{"content":"/// \\brief InvalidData is thrown if invalid data is passed to Method or one of its derived classes.\n\n///\n\n/// InvalidData is thrown if invalid data is passed to Method or one of its derived classes. For instance,\n\n/// Diffusion must have nonzero opacities to generate diffusion coefficients. \n\nclass InvalidData : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInvalidData(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Invalid data passed to a transport Method. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/MethodExcept.hh","rank":55,"score":223651.70782683336},{"content":"/// \\brief DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension.\n\n///\n\n/// DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension. An example\n\n/// of this might be if the number of problem regions does not match the number of materials, or if the\n\n/// the number of time delta-ts does not match the number of times requested for output. \n\nclass DimensionMismatch : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tDimensionMismatch(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Dimension mismatch in input, check for consistency. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/ProblemExcept.hh","rank":56,"score":223645.53522762924},{"content":"/// \\brief AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\n\n///\n\n/// AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\n\nclass AdvancedTooFar : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tAdvancedTooFar(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Method has reached the last time step for this problem. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/MethodExcept.hh","rank":57,"score":223645.53522762924},{"content":"/// \\brief ModelingError is thrown if a Method commits a modeling error.\n\n///\n\n/// ModelingError is thrown if a Method is commits a modeling error. An example might be\n\n/// if energy is not conserved or if a probability distribution isn't normalized. \n\nclass ModelingError : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tModelingError(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Method has committed a modeling error. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/MethodExcept.hh","rank":58,"score":223645.53522762924},{"content":"class LowWeightParticle : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception \n\n //was thrown.\n\n\tLowWeightParticle(const Particle& P, unsigned int line_number,\n\n const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n string msg() const {\n\n ostringstream out;\n\n out << \"Particle was killed due to low weight.\\n\";\n\n return out.str();\n\n }\n\n\n\n};\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/MonteCarloExcept.h","rank":59,"score":223645.53522762924},{"content":"/// \\brief DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension.\n\n///\n\n/// DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension. An example\n\n/// of this might be if the number of problem regions does not match the number of materials, or if the\n\n/// the number of time delta-ts does not match the number of times requested for output. \n\nclass DimensionMismatch : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tDimensionMismatch(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Dimension mismatch in input, check for consistency. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/ProblemExcept.hh","rank":60,"score":223645.53522762924},{"content":"/// \\brief Thrown when an iterator is made invalid or an invalid location is dereferenced.\n\n///\n\n/// IteratorOutOfRange is thrown whenever an attempt is made to dereference an iterator that \n\n/// does not point to a valid object, or when an iterator is moved outside the an objects\n\n/// range.\n\nclass IteratorOutOfRange : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tIteratorOutOfRange(unsigned int line_number, const string& file_in)\n\n\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to dereference an invalid iterator at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/IteratorExcept.hh","rank":61,"score":223645.53522762924},{"content":"/// \\brief AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\n\n///\n\n/// AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\n\nclass AdvancedTooFar : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tAdvancedTooFar(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Method has reached the last time step for this problem. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/MethodExcept.hh","rank":62,"score":223645.53522762924},{"content":"/// \\brief InsaneInput is thrown if the users inputs unphysical data.\n\n///\n\n/// InsaneInput is thrown if the users inputs unphysical data, such as negative temperatures,\n\n/// non-increasing time steps, etc. \n\nclass InsaneInput : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInsaneInput(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Dimension mismatch in input, check for consistency. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/ProblemExcept.hh","rank":63,"score":223645.53522762924},{"content":"/// \\brief Thrown when an iterator is made invalid or an invalid location is dereferenced.\n\n///\n\n/// IteratorOutOfRange is thrown whenever an attempt is made to dereference an iterator that \n\n/// does not point to a valid object, or when an iterator is moved outside the an objects\n\n/// range.\n\nclass IteratorOutOfRange : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tIteratorOutOfRange(unsigned int line_number, const string& file_in)\n\n\t\t: ExceptionBase(line_number, file_in) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Attempted to dereference an invalid iterator at line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/IteratorExcept.hh","rank":64,"score":223645.53522762924},{"content":"/// \\brief Thrown if an invalid initial condition is attempted to be prescribed.\n\n///\n\n/// InvalidInitialCondition is thrown if the user attempts to specify a negative initial condition.\n\n/// This could later be expanded upon to become more intelligent, if desired.\n\nclass InvalidInitialCondition : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInvalidInitialCondition(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Unphysical initial condition encountered, please check. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/PHYSOR/cpp/Exception/ProblemExcept.hh","rank":65,"score":223645.53522762924},{"content":"/// \\brief ModelingError is thrown if a Method commits a modeling error.\n\n///\n\n/// ModelingError is thrown if a Method is commits a modeling error. An example might be\n\n/// if energy is not conserved or if a probability distribution isn't normalized. \n\nclass ModelingError : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tModelingError(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Method has committed a modeling error. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/MethodExcept.hh","rank":66,"score":223645.53522762924},{"content":"/// \\brief InsaneInput is thrown if the users inputs unphysical data.\n\n///\n\n/// InsaneInput is thrown if the users inputs unphysical data, such as negative temperatures,\n\n/// non-increasing time steps, etc. \n\nclass InsaneInput : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInsaneInput(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Dimension mismatch in input, check for consistency. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/ProblemExcept.hh","rank":67,"score":223645.53522762924},{"content":"class GhostElement : public geom_element\n\n{\n\nprivate:\n\n /*! \\brief Requires that the \\c geom_element type satisfy the \n\n * \\c GeometricElementConcept concept. */\n\n BOOST_CLASS_REQUIRE(geom_element, , GeometricElementConcept);\n\n\n\npublic:\n\n /// Alias the \\c geom_element type as \\c ElementType.\n\n typedef geom_element ElementType;\n\n /// Define the id type for the ghost element.\n\n\ttypedef GeomId< GhostElement<ElementType> > Id;\t\n\n\t\n\n\t/*! \\brief Constructor. Takes in the ghosted element and an id.\n\n\t *\n\n\t * Constructor. Takes in a constant reference to the element that we are ghosting,\n\n\t * plus an id number for this ghost element.\n\n\t * \\param[in] element_in The geometric element we are using as a \"mirror\" for the\n\n\t * ghost element.\n\n\t * \\param[in] id_in The id number of the ghost element.*/\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/GhostElement.hh","rank":68,"score":222722.7594529945},{"content":"class LowWeightParticle : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception \n\n //was thrown.\n\n\tLowWeightParticle(const Particle& P, unsigned int line_number,\n\n const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n string msg() const {\n\n ostringstream out;\n\n out << \"Particle was killed due to low weight.\\n\";\n\n return out.str();\n\n }\n\n\n\n};\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/MonteCarloExcept.h","rank":69,"score":221377.04399228684},{"content":"class Iterator_AssignmentOutOfRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */ \n\n Iterator_AssignmentOutOfRange(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":70,"score":221377.04399228684},{"content":"class AVAccessOutOfRange : public AngularBaseException\n\n{\n\nprivate:\n\n BOOST_CLASS_REQUIRE(angle_vector_type, , AngleVectorConcept);\n\n\n\npublic:\n\n typedef angle_vector_type AngleVectorType;\n\n typedef typename angle_vector_type::IndexType IndexType;\n\n\n\n AVAccessOutOfRange(const angle_vector_type& av_in,\n\n const IndexType& bad_iter_in,\n\n LineNumType line_number, const char* file_in)\n\n : AngularBaseException(line_number, file_in),\n\n mAngleVector(av_in),\n\n mBadIter(bad_iter_in)\n\n { }\n\n \n\n \n\n const AngleVectorType& getAngleVector() const\n\n {\n","file_path":"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh","rank":71,"score":221377.04399228684},{"content":"class Iterator_DereferenceOutOfRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n Iterator_DereferenceOutOfRange(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":72,"score":221377.04399228684},{"content":"/// \\brief Thrown if an invalid initial condition is attempted to be prescribed.\n\n///\n\n/// InvalidInitialCondition is thrown if the user attempts to specify a negative initial condition.\n\n/// This could later be expanded upon to become more intelligent, if desired.\n\nclass InvalidInitialCondition : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInvalidInitialCondition(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Unphysical initial condition encountered, please check. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/ProblemExcept.hh","rank":73,"score":221377.04399228684},{"content":"/// \\brief Thrown if an invalid initial condition is attempted to be prescribed.\n\n///\n\n/// InvalidInitialCondition is thrown if the user attempts to specify a negative initial condition.\n\n/// This could later be expanded upon to become more intelligent, if desired.\n\nclass InvalidInitialCondition : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception was thrown.\n\n\tInvalidInitialCondition(unsigned int line_number, const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n\t/// Prints out a helpful message.\n\n\tstring msg() const\n\n\t{\n\n\t\tostringstream out;\n\n\t\tout << \"Unphysical initial condition encountered, please check. Exception thrown from line \"\n\n\t\t\t<< line() << \" in file \" << file();\n\n\t\treturn out.str();\n\n\t}\n\n};\n\n\n\n\n","file_path":"Code/branches/Pre-Prospectus/cpp/Exception/ProblemExcept.hh","rank":74,"score":221377.04399228684},{"content":"class Iterator_ConstructionOutOfRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */ \n\n Iterator_ConstructionOutOfRange(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":75,"score":221377.04399228684},{"content":"class LowWeightParticle : public ExceptionBase\n\n{\n\npublic:\n\n\t/// The constructor takes the line number and filename where the exception \n\n //was thrown.\n\n\tLowWeightParticle(const Particle& P, unsigned int line_number,\n\n const string& file)\n\n\t\t: ExceptionBase(line_number, file) { }\n\n\n\n string msg() const {\n\n ostringstream out;\n\n out << \"Particle was killed due to low weight.\\n\";\n\n return out.str();\n\n }\n\n\n\n};\n\n\n","file_path":"Code/branches/OldGeometry/cpp/Exception/MonteCarloExcept.h","rank":76,"score":221377.04399228684},{"content":"class BadAngleQuadOrder : public AngularBaseException\n\n{\n\nprivate:\n\n /// Requires the \\c angle_quad_type to satisfy the \\c AngleQuadConcept.\n\n BOOST_CLASS_REQUIRE(angle_quad_type, , AngleQuadConcept);\n\n\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c AngularBaseException base class.\n\n typedef AngularBaseException::LineNumType LineNumType;\n\n /// Defines the \\c AngleQuadType from the \\c angle_quad_type template parameter.\n\n typedef angle_quad_type AngleQuadType;\n\n \n\n /*! \\brief Constructor. Takes in the bad angular quadrature object and the line number\n\n * and filename where the exception was thrown.\n\n *\n\n * Constructor. Takes in the bad \\c AngleQuad angular quadrature object and the\n\n * line number and filename where the exception was thrown.\n\n * \\param[in] angle_quad_in The \\c AngleQuad object where the error occurred.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] file_in The file where the exception was thrown. */\n","file_path":"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh","rank":77,"score":219175.64515000366},{"content":"class Iterator_AdvanceBeyondRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown and the distance advanced.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown\n\n * and the distance of the attempted advance.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. \n\n * \\param[in] n The distance of the attempted advance. */\n\n Iterator_AdvanceBeyondRange(LineNumType line_number,\n\n const char* filename,\n\n UnsignedInt4 n)\n\n : IteratorBaseException(line_number, filename),\n\n mAdvanceDistance(n)\n\n { }\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":78,"score":219175.64515000366},{"content":"class Iterator_IncrementBeyondRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n Iterator_IncrementBeyondRange(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":79,"score":219175.64515000366},{"content":"class AngleQuadRangeError : public AngularBaseException\n\n{\n\nprivate:\n\n /// Requires that the \\c angle_quad_type template parameter satisfies the \\c AngleQuadConcept.\n\n BOOST_CLASS_REQUIRE(angle_quad_type, , AngleQuadConcept);\n\n\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c AngularBaseException base class.\n\n typedef AngularBaseException::LineNumType LineNumType;\n\n /// Defines the \\c AngleQuadType from the \\c angle_quad_type template parameter.\n\n typedef angle_quad_type AngleQuadType;\n\n /// Imports the \\c AngleQuadType::IndexType as \\c IndexType.\n\n typedef typename AngleQuadType::IndexType IndexType;\n\n\n\n /*! \\brief Constructor. Takes the angular quadrature object, the offending index, and the\n\n * line and file where the exception was thrown.\n\n *\n\n * Constructor. Takes the angular quadrature object that threw this exception, the index\n\n * number that caused the error, and the line number and filename where the exception was\n\n * thrown.\n","file_path":"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh","rank":80,"score":219175.64515000366},{"content":"class Iterator_DecrementBeyondRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n Iterator_DecrementBeyondRange(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":81,"score":219175.64515000366},{"content":"class Iterator_CheckedIteratorLacksContainer : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */ \n\n Iterator_CheckedIteratorLacksContainer(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":82,"score":217038.40561041544},{"content":"class RevIter_ReverseIncrementBeyondRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n RevIter_ReverseIncrementBeyondRange(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n\n * \\return A \\c string holding a helpful error message. */ \n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":84,"score":214962.5607961148},{"content":"class RevIter_ReverseDecrementBeyondRange : public IteratorBaseException\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c IteratorBaseException base class.\n\n typedef IteratorBaseException::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * was thrown.\n\n *\n\n * Constructor. Takes in the line number and filename where the exception was thrown.\n\n * \\param[in] line_number The line number where the exception was thrown.\n\n * \\param[in] filename The filename where the exception was thrown. */\n\n RevIter_ReverseDecrementBeyondRange(LineNumType line_number,\n\n const char* filename)\n\n : IteratorBaseException(line_number, filename)\n\n { }\n\n \n\n /*! \\brief Returns a helpful error message.\n\n *\n\n * Returns a \\c string holding a helpful error message.\n","file_path":"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh","rank":85,"score":214962.5607961148},{"content":"class Angle : public Angle_base<dimension_type>, boost::noncopyable\n\n{ \n\nprivate:\n\n /// The default constructor is private to prevent instantiation.\n\n Angle();\n\n};\n\n\n\n\n\n\n\n/// @}\n\n\n\n#endif\n\n\n","file_path":"Code/trunk/cpp/Geometry/AngleQuad/Angle_base.hh","rank":86,"score":214902.3845402577},{"content":"class WrongSizedField : public FieldBaseException<field_type>\n\n{\n\nprivate:\n\n /// Requires that the \\c field_type satisfy the \\c FieldConcept concept.\n\n BOOST_CLASS_REQUIRE(field_type, , FieldConcept); \n\n\n\npublic:\n\n /// Imports the \\c LineNumType from \\c ExceptionBase.\n\n typedef typename FieldBaseException<field_type>::LineNumType LineNumType;\n\n /// Defines the \\c field_type template paramater as \\c FieldType.\n\n typedef field_type FieldType;\n\n /// Defines the type of the \\c CartesianMesh that corresponds to this \\c Field.\n\n typedef typename FieldType::MeshType MeshType;\n\n\n\n /*! \\brief Constructor. Takes in the \\c Field from which the exception was thrown, the\n\n * \\c CartesianMesh and the line number and filename.\n\n *\n\n * Constructor. Takes in the \\c CartesianMesh that corresponds to the \\c Field from which\n\n * this exception was thrown and a reference to the \\c Field from which the exception was thrown.\n\n * Also takes in the line number and the name of the file where the exception was thrown.\n","file_path":"Code/trunk/cpp/Geometry/Exception/FieldExcept.hh","rank":87,"score":211036.28385292567},{"content":"class FieldRangeError : public FieldBaseException<field_type>\n\n{\n\nprivate:\n\n /// Requires that the \\c field_type satisfy the \\c FieldConcept concept.\n\n BOOST_CLASS_REQUIRE(field_type, , FieldConcept); \n\n\n\npublic:\n\n /// Imports the \\c LineNumType from \\c ExceptionBase.\n\n typedef typename FieldBaseException<field_type>::LineNumType LineNumType;\n\n /// Defines the \\c field_type template paramater as \\c FieldType.\n\n typedef field_type FieldType;\n\n\n\n /*! \\brief Constructor. Takes in the \\c CenteringType object of the attempted access, the\n\n * \\c Field and the line number and filename.\n\n *\n\n * Constructor. Takes in the \\c geom_elem used in the failed data access, and the \\c Field \n\n * from which this exception was thrown.\n\n * Also takes in the line number and the name of the file where the exception was thrown.\n\n * \\param[in] geom_elem A reference to the geometric element used in the attempted data\n\n * access.\n","file_path":"Code/trunk/cpp/Geometry/Exception/FieldExcept.hh","rank":88,"score":211036.28385292567},{"content":"class Iterator : public iterator_facade< Iterator<container_type, base_type>, \n\n typename iterator_traits<base_type>::value_type, \n\n typename iterator_traits<base_type>::iterator_category,\n\n typename iterator_traits<base_type>::reference >\n\n{\n\nprivate:\n\n /*! \\brief Requires that the \\c container_type template parameter satisfy the \n\n * \\c MinimalContainerConcept concept. */\n\n BOOST_CLASS_REQUIRE(container_type, , MinimalContainerConcept);\n\n /*! \\brief Requires that the \\c base_type template parameter satisfy the\n\n * \\c boost::InputIteratorConcept concept. */\n\n BOOST_CLASS_REQUIRE(base_type, boost, InputIteratorConcept);\n\n \n\npublic:\n\n // ****** Type Definitions ******\n\n /// Defines the type of container that is iterated over.\n\n typedef container_type ContainerType;\n\n /// Defines the type of basic iterator that underlies Iterator.\n\n typedef base_type BaseType; \n\n /// Defines the value type that the Iterator points to.\n","file_path":"Code/trunk/cpp/Geometry/Misc/Iterator.hh","rank":89,"score":203726.807623786},{"content":"class Angle<OneD> : public Angle_base<OneD>\n\n{\n\nprivate:\n\n /// Defines \\c Angle_base<OneD> as the \\c Base type.\n\n typedef Angle_base<OneD> Base;\n\n \n\npublic:\n\n /// Imports the \\c AngleType from the \\c Base type.\n\n\ttypedef Base::AngleType AngleType;\n\n\t/// Imports the \\c WeightType from the \\c Base type.\n\n\ttypedef Base::WeightType WeightType;\n\n\n\n\t/*! \\brief Constructor. Takes in an angle and a weight for this quadrature point.\n\n\t *\n\n\t * Constructor. Takes in an angle and a weight for this quadrature point.\n\n\t * \\param[in] angle_in The angle for this quadrature point.\n\n\t * \\param[in] weight_in The weight for this quadrature point. */\n\n\texplicit Angle(const AngleType& angle_in = AngleType(), WeightType weight_in = WeightType() )\n\n\t\t\t: Angle_base<OneD>(angle_in, weight_in)\n\n\t{ }\n","file_path":"Code/trunk/cpp/Geometry/AngleQuad/OneD/Angle1D.hh","rank":90,"score":201858.939656259},{"content":"class Base {\n\npublic:\n\n\n\n virtual void Express(S x) = 0;\n\n\n\nprotected:\n\n Base(S& init) : _bVar(3.7), _SVar(init) { }\n\n S _SVar;\n\n\n\nprivate:\n\n double _bVar;\n\n};\n\n\n\ntemplate<class S>\n","file_path":"Code/trunk/cpp/test/general.hpp","rank":91,"score":201722.97626992513},{"content":"class Iterator : public iterator< typename iterator_traits<Iter>::iterator_category,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::value_type,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::difference_type,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::pointer,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::reference >\n\n{\n\npublic:\n\n\t/// Type of unchecked-iterators we are using\n\n\ttypedef Iter iterator_type;\n\n\n\n\t/// Default constructor.\n\n\tIterator() : mContainer(), mIter() { }\n\n\t/// Constructor taking a container and an iterator into that container\n\n Iterator(const Cont& cont_in, const Iter& x) throw(IteratorOutOfRange)\n\n\t\t\t: mContainer(addressof(cont_in)), mIter(x)\n\n\t{ \n\n#ifndef NITERCHK\n\n\t\tif(mIter > mContainer->end() || mIter < mContainer->begin()-1)\n\n\t\t\tthrow(IteratorOutOfRange(__LINE__, __FILE__));\n\n#endif\n","file_path":"Code/branches/PHYSOR/cpp/Misc/Iterator.hh","rank":92,"score":200121.63681158694},{"content":"class GhostElement< Zone<OneD> > : public Zone<OneD>\n\n{\n\npublic:\n\n /// The ElementType, which for this specialization is always a ghost zone.\n\n typedef Zone<OneD> ElementType;\n\n /// The Id type for one-dimensional ghost zones.\n\n typedef GeomId< GhostElement< Zone<OneD> > > Id;\n\n \n\n /*! \\brief Constructor. Takes a \\c Zone and an \\c Id object.\n\n * \n\n * Constructor. This constructor takes a \\c Zone and an \\c Id object.\n\n * This constructor ensures that the ghost zone has the same length\n\n * as the ghosted zone.\n\n * \\param[in] zone_in The \\c Zone we are ghosting.\n\n * \\param[in] id_in The \\c Id number for this ghost zone. */\n\n GhostElement(const Zone<OneD>& zone_in, const Id& id_in)\n\n : Zone<OneD>( Zone<OneD>::Id( id_in.idNumber() ), \n\n zone_in.length(), zone_in.area() ),\n\n mGhostedElement( addressof( zone_in ) )\n\n { }\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/GhostElement.hh","rank":93,"score":198643.9631391678},{"content":"class Iterator : public iterator< typename iterator_traits<Iter>::iterator_category,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::value_type,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::difference_type,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::pointer,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::reference >\n\n{\n\npublic:\n\n\t/// Type of unchecked-iterators we are using\n\n\ttypedef Iter iterator_type;\n\n\n\n\t/// Default constructor.\n\n\tIterator() : mContainer(), mIter() { }\n\n\t/// Constructor taking a container and an iterator into that container\n\n Iterator(const Cont& cont_in, const Iter& x) throw(IteratorOutOfRange)\n\n\t\t\t: mContainer(addressof(cont_in)), mIter(x)\n\n\t{ \n\n#ifndef NITERCHK\n\n\t\tif(mIter > mContainer->end() || mIter < mContainer->begin()-1)\n\n\t\t\tthrow(IteratorOutOfRange(__LINE__, __FILE__));\n\n#endif\n","file_path":"Code/branches/OldGeometry/cpp/Misc/Iterator.hh","rank":94,"score":197981.79473327936},{"content":"class Iterator : public iterator< typename iterator_traits<Iter>::iterator_category,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::value_type,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::difference_type,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::pointer,\n\n\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::reference >\n\n{\n\npublic:\n\n\t/// Type of unchecked-iterators we are using\n\n\ttypedef Iter iterator_type;\n\n\n\n\t/// Default constructor.\n\n\tIterator() : mContainer(), mIter() { }\n\n\t/// Constructor taking a container and an iterator into that container\n\n Iterator(const Cont& cont_in, const Iter& x) throw(IteratorOutOfRange)\n\n\t\t\t: mContainer(addressof(cont_in)), mIter(x)\n\n\t{ \n\n#ifndef NITERCHK\n\n\t\tif(mIter > mContainer->end() || mIter < mContainer->begin()-1)\n\n\t\t\tthrow(IteratorOutOfRange(__LINE__, __FILE__));\n\n#endif\n","file_path":"Code/branches/Pre-Prospectus/cpp/Misc/Iterator.hh","rank":95,"score":197981.79473327933},{"content":"class ReverseIterator : public iterator< typename iterator_traits<Iter>::iterator_category,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::value_type,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::difference_type,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::pointer,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::reference >\n\n{\n\npublic:\n\n\t/// Type of iterator we are reversing over\n\n typedef Iter iterator_type;\n\n\n\n\t/// Default constructor\n\n ReverseIterator() : mIter() { }\n\n /// Constructor taking a forward iterator\n\n explicit ReverseIterator(const Iter& x) throw(IteratorOutOfRange)\n\n\t\t\t: mIter(x)\n\n\t{ }\n\n /// Constructor taking a reverse iterator\n\n template<typename Iter_2>\n\n ReverseIterator(const ReverseIterator<Iter_2>& iter_in)\n\n\t\t\t: mIter(iter_in.base())\n","file_path":"Code/branches/PHYSOR/cpp/Misc/ReverseIterator.hh","rank":96,"score":195903.42214125206},{"content":"class DimensionConcept\n\n{\n\npublic:\n\n /// Alias the \\c dimension_type as a \\c DimensionType.\n\n typedef dimension_type DimensionType;\n\n /// Require the \\c DimensionType to provide a \\c type.\n\n typedef typename DimensionType::type type;\n\n /// Require the \\c DimensionType to provide a \\c value_type.\n\n typedef typename DimensionType::value_type value_type;\n\n\n\n /*! \\brief The constraints method tests that the \\c dimension_type \n\n * provides certain functionality. */\n\n void constraints()\n\n {\n\n function_requires< UnsignedIntegerConcept<value_type> >();\n\n \n\n BOOST_STATIC_ASSERT(DimensionType::value <= 3 \n\n && DimensionType::value != 0);\n\n }\n\n};\n\n\n\n/// @}\n\n\n\n#endif\n\n\n","file_path":"Code/trunk/cpp/Geometry/CartesianMesh/Dimension.hh","rank":97,"score":195260.57098513894},{"content":"/// \\brief The SweepIter class iterates over the zones in a sweep pattern.\n\n///\n\n/// The SweepIter class iterates over the zones in the correct order for a sweeping pattern\n\n/// given the streaming angle \\f$ \\mu \\f$.\n\nclass SweepIter : public iterator< std::bidirectional_iterator_tag, Zone >\n\n{\n\npublic:\n\n\t/// Default constructor.\n\n\tSweepIter()\n\n\t: mMu(0), mCont(0), mIter() { }\n\n\n\n\t/// Constructor taking an angle, a reference to the zone container, and a const_iterator.\n\n SweepIter(double mu, const vector<Zone>& cont_in, const vector<Zone>::const_iterator iter_in)\n\n : mMu(mu), mCont( addressof(cont_in) ), mIter(iter_in) { }\n\n \n\n /// Copy constructor\n\n SweepIter(const SweepIter& iter_in)\n\n : mMu(iter_in.mMu), mCont( iter_in.mCont ), mIter(iter_in.mIter) { }\n\n \n\n /// Retrieve the iterator into the zone vector\n\n const vector<Zone>::const_iterator& iterator() const { return mIter; }\n\n /// Retrieve the container\n\n const vector<Zone>& container() const { return *mCont; }\n\n /// Retrieve the angle\n","file_path":"Code/branches/PHYSOR/cpp/Geometry/OneDMesh/SweepIter.hh","rank":98,"score":194696.877464734},{"content":"class ReverseIterator : public iterator< typename iterator_traits<Iter>::iterator_category,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::value_type,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::difference_type,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::pointer,\n\n\t\t\t\t\t\t\t\t\t\t typename iterator_traits<Iter>::reference >\n\n{\n\npublic:\n\n\t/// Type of iterator we are reversing over\n\n typedef Iter iterator_type;\n\n\n\n\t/// Default constructor\n\n ReverseIterator() : mIter() { }\n\n /// Constructor taking a forward iterator\n\n explicit ReverseIterator(const Iter& x) throw(IteratorOutOfRange)\n\n\t\t\t: mIter(x)\n\n\t{ }\n\n /// Constructor taking a reverse iterator\n\n template<typename Iter_2>\n\n ReverseIterator(const ReverseIterator<Iter_2>& iter_in)\n\n\t\t\t: mIter(iter_in.base())\n","file_path":"Code/branches/Pre-Prospectus/cpp/Misc/ReverseIterator.hh","rank":99,"score":193883.90786479716}],"string":"[\n {\n \"content\": \"class MeshBaseException : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c ExceptionBase base class.\\n\\n\\ttypedef ExceptionBase::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n MeshBaseException(LineNumType line_number, const char* file_in)\\n\\n : ExceptionBase(line_number, file_in)\\n\\n { }\\n\\n};\\n\\n\\n\\n/*! \\\\brief Thrown when a non-existent connected element access is attempted.\\n\\n *\\n\\n * This class is thrown when some geometric element attempts to access through\\n\\n * its connectivity another geometric element that does not actually exist, i.e.\\n\\n * if a \\\\c Node on the left boundary attempts to access its left \\\\c Zone object,\\n\\n * which obviously would not exist.\\n\\n * \\\\par Template Parameters:\\n\\n * <dl> <dt> \\\\e source_element </dt>\\n\\n * <dd> The type of the geometric element that made the bad call. </dd>\\n\\n * <dt> \\\\e target_element </dt>\\n\\n * <dd> The type of geometric element whose access was attempted. </dd> </dl> */\\n\\ntemplate<typename source_element, typename target_element>\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 0,\n \"score\": 298683.1462251717\n },\n {\n \"content\": \"class BadMeshLength : public BadMeshUserData\\n\\n{\\n\\nprivate:\\n\\n /// Requires the \\\\c dimension_type template parameter satisfies the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n /// Defines the \\\\c DimensionType type from the \\\\c dimension_type template parameter.\\n\\n typedef dimension_type DimensionType;\\n\\n \\n\\npublic:\\n\\n /// Defines the \\\\c LengthType from the \\\\c MeshTraits<DimensionType>::LengthType type.\\n\\n typedef typename MeshTraits<DimensionType>::LengthType LengthType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown and the mesh length.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown,\\n\\n * and the length given to the mesh constructor.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. \\n\\n * \\\\param[in] mesh_length The length given to the mesh constructor. */ \\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 2,\n \"score\": 286359.1488029023\n },\n {\n \"content\": \"class BadMeshUserData : public MeshBaseException\\n\\n{\\n\\npublic:\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n BadMeshUserData(MeshBaseException::LineNumType line_number,\\n\\n const char* filename)\\n\\n : MeshBaseException(line_number, filename)\\n\\n { }\\n\\n};\\n\\n\\n\\n/*! \\\\brief Thrown when a \\\\c CartesianMesh object is given a bad length.\\n\\n *\\n\\n * This exception is thrown when a \\\\c CartesianMesh is given an invalid length.\\n\\n * \\\\par Template Parameters:\\n\\n * <dl> <dt> \\\\e dimension_type </dt>\\n\\n * <dd> The spatial dimension that the \\\\c CartesianMesh spans. This type must\\n\\n * satisfy the \\\\c DimensionConcept concept. </dd> </dl> */\\n\\ntemplate<typename dimension_type>\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 3,\n \"score\": 286185.1260563774\n },\n {\n \"content\": \"class ElementDoesNotExist : public MeshBaseException\\n\\n{\\n\\nprivate:\\n\\n /// Requires the \\\\c geom_element type satisfies the \\\\c GeometricElementConcept concept.\\n\\n BOOST_CLASS_REQUIRE(geom_element, , GeometricElementConcept);\\n\\n /// Defines the \\\\c GeomElementType from the template parameter \\\\c geom_element.\\n\\n typedef geom_element GeomElementType;\\n\\n \\n\\npublic:\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown and the element id.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown,\\n\\n * and the id number of the attempted element access.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. \\n\\n * \\\\param[in] id_in The id number given to the \\\\c CartesianMesh to attempt the\\n\\n * geometric element access. */\\n\\n ElementDoesNotExist(MeshBaseException::LineNumType line_number,\\n\\n const char* filename,\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 4,\n \"score\": 285809.7257025615\n },\n {\n \"content\": \"class NoElementConnected : public MeshBaseException\\n\\n{\\n\\nprivate:\\n\\n /// Requires that the \\\\c source_element type satisfy the \\\\c GeometricElementConcept concept.\\n\\n BOOST_CLASS_REQUIRE(source_element, , GeometricElementConcept);\\n\\n\\n\\n /// Defines the \\\\c SourceIdType from the \\\\c source_element::Id type.\\n\\n typedef typename source_element::Id SourceIdType;\\n\\n /// Defines the \\\\c SourceIndexType from the \\\\c source_element::IndexType type.\\n\\n typedef typename source_element::IndexType SourceIndexType;\\n\\npublic:\\n\\n /// Defines the \\\\c SourceElementType from the \\\\c source_element template parameter.\\n\\n typedef source_element SourceElementType;\\n\\n /// Defines the \\\\c TargetElementType from the \\\\c target_element template parameter.\\n\\n typedef target_element TargetElementType;\\n\\n\\n\\n /*! \\\\brief Constructor. Takes in the line number and file where the exception is thrown,\\n\\n * and the source id number and local target id number.\\n\\n *\\n\\n * Construtor. Takes in the line number and filename where the exception is thrown. Also\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 5,\n \"score\": 285809.7257025615\n },\n {\n \"content\": \"class NegativeZoneLength : public BadMeshUserData\\n\\n{\\n\\nprivate:\\n\\n /// Requires the \\\\c dimension_type template parameter satisfies the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n /// Defines the \\\\c DimensionType type from the \\\\c dimension_type template parameter.\\n\\n typedef dimension_type DimensionType;\\n\\npublic:\\n\\n /// Defines the \\\\c LengthType from the \\\\c MeshTraits<DimensionType>::LengthType type.\\n\\n typedef typename MeshTraits<DimensionType>::LengthType LengthType;\\n\\n /// Defines the \\\\c IdType from the \\\\c MeshTraits<DimensionType>::Zone::Id::IdType type. \\n\\n typedef typename MeshTraits<DimensionType>::Zone::Id::IdType IdType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown, the id of the negative zone, and the negative length.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown,\\n\\n * as well as the id number of the \\\\c Zone with the negative length, and the length itself. \\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. \\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 6,\n \"score\": 280347.1524682773\n },\n {\n \"content\": \"class Point_base : public boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n \\n\\npublic:\\n\\n /// Aliases the \\\\c dimension_type as a \\\\c DimensionType.\\n\\n typedef dimension_type DimensionType;\\n\\n /// Defines the \\\\c PointType as a real number.\\n\\n typedef Real8 PointType;\\n\\n\\n\\n\\t/*! \\\\brief Returns a reference to the x-position of the \\n\\n\\t * \\\\c Point object.\\n\\n\\t *\\n\\n\\t * Returns a reference to the x-position of the \\\\c Point object.\\n\\n\\t * \\\\return A reference to the x-position of the \\\\c Point object. */\\n\\n\\tPointType& x()\\n\\n\\t{\\n\\n\\t return mX;\\n\\n\\t}\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/Point_base.hh\",\n \"rank\": 7,\n \"score\": 280043.0749485686\n },\n {\n \"content\": \"class Zone_base : public boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// Requires that the \\\\c dimension_type satisfies the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n \\n\\npublic:\\n\\n /// Aliases the \\\\c dimension_type as the \\\\c DimensionType type.\\n\\n typedef dimension_type DimensionType;\\n\\n /// Uses the \\\\c MeshTraits<DimensionType>::LengthType as a \\\\c LengthType.\\n\\n\\ttypedef typename MeshTraits<DimensionType>::LengthType LengthType;\\n\\n /// Uses the \\\\c MeshTraits<DimensionType>::SizeType as a \\\\c SizeType.\\n\\n\\ttypedef typename MeshTraits<DimensionType>::SizeType SizeType;\\n\\n /// Uses the \\\\c MeshTraits<DimensionType>::IndexType as a \\\\c IndexType.\\n\\n\\ttypedef typename MeshTraits<DimensionType>::IndexType IndexType;\\n\\n\\t\\n\\n\\t/// Defines an identification number type.\\n\\n\\ttypedef GeomId< Zone<DimensionType> > Id;\\n\\n\\t/// Defines the \\\\c Node type for connectivity.\\n\\n\\ttypedef Node<DimensionType> Node;\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/Zone_base.hh\",\n \"rank\": 8,\n \"score\": 280043.0749485686\n },\n {\n \"content\": \"class Node_base : public boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// Requires \\\\c dimension_type to satisfy the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n\\n\\npublic:\\n\\n /// Aliases the \\\\c dimension_type as \\\\c DimensionType type.\\n\\n typedef dimension_type DimensionType;\\n\\n /// Defines an \\\\c IndexType for indexing connected elements.\\n\\n\\ttypedef UnsignedInt4 IndexType;\\n\\n\\t/// Defines a \\\\c PointType for storing spatial points.\\n\\n typedef Point<DimensionType> PointType;\\n\\n /// Defines an \\\\c Id type for storing the id number for a \\\\c Node object.\\n\\n\\ttypedef GeomId< Node<DimensionType> > Id;\\n\\n\\t/// Defines a \\\\c Zone type for storing connected \\\\c Zone objects.\\n\\n\\ttypedef Zone<DimensionType> Zone;\\n\\n\\t/// Defines a \\\\c Corner type for storing connected \\\\c Corner objects.\\n\\n\\ttypedef Corner<DimensionType> Corner;\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/Node_base.hh\",\n \"rank\": 9,\n \"score\": 280043.0749485686\n },\n {\n \"content\": \"/// \\\\brief Thrown when numCentering is given a non-existing geometric sub element.\\n\\n/// \\n\\n/// The NoSuchElement exception is thrown by numCentering if a non-existing geometric sub-element \\n\\n/// is given to it as a template parameter.\\n\\nclass NoSuchElement : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoSuchElement(unsigned int line_number, const string& file_in)\\n\\n\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\t\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{ \\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant element at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/MeshExcept.hh\",\n \"rank\": 10,\n \"score\": 279479.55850490765\n },\n {\n \"content\": \"/// \\\\brief Thrown when a non-existing Zone is referenced through connectivity.\\n\\n/// \\n\\n/// The NoZoneConnected class is thrown when attempting to reference a Zone that does not exist,\\n\\n/// such as asking for the left Zone from a Node on the left boundary.\\n\\nclass NoZoneConnected : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoZoneConnected(unsigned int line_number, const string& file_in)\\n\\n\\t\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{ \\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant zone at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/MeshExcept.hh\",\n \"rank\": 11,\n \"score\": 276282.11766666593\n },\n {\n \"content\": \"/// \\\\brief Thrown when a non-existing Corner is referenced through connectivity.\\n\\n///\\n\\n/// The NoCornerConnected class is thrown when attempting to reference a Corner that does not exist,\\n\\n/// such as asking for the left Corner from a Node on the left boundary.\\n\\nclass NoCornerConnected : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoCornerConnected(unsigned int line_number, const string& file_in)\\n\\n\\t\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant corner at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/MeshExcept.hh\",\n \"rank\": 12,\n \"score\": 276282.11766666593\n },\n {\n \"content\": \"/// \\\\brief Thrown when numCentering is given a non-existing geometric sub element.\\n\\n/// \\n\\n/// The NoSuchElement exception is thrown by numCentering if a non-existing geometric sub-element \\n\\n/// is given to it as a template parameter.\\n\\nclass NoSuchElement : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoSuchElement(unsigned int line_number, const string& file_in)\\n\\n\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\t\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{ \\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant element at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/MeshExcept.hh\",\n \"rank\": 13,\n \"score\": 276276.8628034643\n },\n {\n \"content\": \"/// \\\\brief Thrown when numCentering is given a non-existing geometric sub element.\\n\\n/// \\n\\n/// The NoSuchElement exception is thrown by numCentering if a non-existing geometric sub-element \\n\\n/// is given to it as a template parameter.\\n\\nclass NoSuchElement : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoSuchElement(unsigned int line_number, const string& file_in)\\n\\n\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\t\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{ \\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant element at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/MeshExcept.hh\",\n \"rank\": 14,\n \"score\": 276276.8628034643\n },\n {\n \"content\": \"class GeomVector_base : public boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// This forces \\\\c dimension_type to satisfy the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n\\n\\npublic:\\n\\n\\t/// Aliases the \\\\c dimension_type as \\\\c DimensionType.\\n\\n\\ttypedef dimension_type DimensionType;\\n\\n\\t/// Defines the \\\\c OrdinateType as a real number.\\n\\n\\ttypedef Real8 OrdinateType;\\n\\n\\n\\n\\t/*! \\\\brief Returns a reference to the x-axis ordinate data.\\n\\n\\t *\\n\\n\\t * Returns a reference to the x-axis ordinate data.\\n\\n\\t * \\\\return A reference to the x-axis ordinate data. */\\n\\n\\tOrdinateType& i() \\n\\n\\t{ \\n\\n\\t return mI; \\n\\n\\t}\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/GeomVector_base.hh\",\n \"rank\": 15,\n \"score\": 274412.03264756757\n },\n {\n \"content\": \"class SweepIterator_base : public boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// Requires the \\\\c dimension_type to satisfy the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n /// Requires the \\\\c container_type to satisfy the \\\\c MinimalContainerConcept concept.\\n\\n BOOST_CLASS_REQUIRE(container_type, , MinimalContainerConcept);\\n\\n /// Define the \\\\c Zone<dimension_type> as a \\\\c ZoneType.\\n\\n typedef Zone<dimension_type> ZoneType;\\n\\n \\n\\npublic:\\n\\n /// Aliases the \\\\c dimension_type as a \\\\c DimensionType type.\\n\\n typedef dimension_type DimensionType;\\n\\n /// Defines the \\\\c Angle<DimensionType> as an \\\\c AngleType type.\\n\\n typedef Angle<DimensionType> AngleType;\\n\\n /// Defines the \\\\c container_type as a \\\\c ContainerType.\\n\\n typedef container_type ContainerType;\\n\\n /// Defines the \\\\c const_reference type.\\n\\n typedef typename ContainerType::const_reference const_reference;\\n\\n \\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/SweepIterator_base.hh\",\n \"rank\": 16,\n \"score\": 274412.03264756757\n },\n {\n \"content\": \"/// \\\\brief Thrown when a non-existing Zone is referenced through connectivity.\\n\\n/// \\n\\n/// The NoZoneConnected class is thrown when attempting to reference a Zone that does not exist,\\n\\n/// such as asking for the left Zone from a Node on the left boundary.\\n\\nclass NoZoneConnected : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoZoneConnected(unsigned int line_number, const string& file_in)\\n\\n\\t\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{ \\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant zone at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/MeshExcept.hh\",\n \"rank\": 17,\n \"score\": 273177.0310466499\n },\n {\n \"content\": \"/// \\\\brief Thrown when a non-existing Zone is referenced through connectivity.\\n\\n/// \\n\\n/// The NoZoneConnected class is thrown when attempting to reference a Zone that does not exist,\\n\\n/// such as asking for the left Zone from a Node on the left boundary.\\n\\nclass NoZoneConnected : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoZoneConnected(unsigned int line_number, const string& file_in)\\n\\n\\t\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{ \\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant zone at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/MeshExcept.hh\",\n \"rank\": 18,\n \"score\": 273177.0310466499\n },\n {\n \"content\": \"/// \\\\brief Thrown when a non-existing Corner is referenced through connectivity.\\n\\n///\\n\\n/// The NoCornerConnected class is thrown when attempting to reference a Corner that does not exist,\\n\\n/// such as asking for the left Corner from a Node on the left boundary.\\n\\nclass NoCornerConnected : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoCornerConnected(unsigned int line_number, const string& file_in)\\n\\n\\t\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant corner at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/MeshExcept.hh\",\n \"rank\": 19,\n \"score\": 273177.0310466499\n },\n {\n \"content\": \"/// \\\\brief Thrown when a non-existing Corner is referenced through connectivity.\\n\\n///\\n\\n/// The NoCornerConnected class is thrown when attempting to reference a Corner that does not exist,\\n\\n/// such as asking for the left Corner from a Node on the left boundary.\\n\\nclass NoCornerConnected : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tNoCornerConnected(unsigned int line_number, const string& file_in)\\n\\n\\t\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to reference a non-existant corner at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/MeshExcept.hh\",\n \"rank\": 20,\n \"score\": 273177.0310466499\n },\n {\n \"content\": \"class NegativeAngleVectorLength : public AngularBaseException\\n\\n{\\n\\nprivate:\\n\\n BOOST_CLASS_REQUIRE(angle_vector_type, , AngleVectorConcept);\\n\\n \\n\\npublic:\\n\\n typedef angle_vector_type AngleVectorType;\\n\\n typedef typename angle_vector_type::IndexType IndexType;\\n\\n \\n\\n NegativeAngleVectorLength(const AngleVectorType& av_in,\\n\\n const typename IndexType::difference_type length_in,\\n\\n LineNumType line_number, const char* file_in) \\n\\n : AngularBaseException(line_number, file_in),\\n\\n mAngleVector(av_in),\\n\\n mLength(length_in)\\n\\n { }\\n\\n \\n\\n const AngleVectorType& getAngleVector() const\\n\\n {\\n\\n return mAngleVector;\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh\",\n \"rank\": 21,\n \"score\": 268306.61571033945\n },\n {\n \"content\": \"class SweepIterator : public boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// This default constructor is private to prevent instantiation.\\n\\n SweepIterator();\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/SweepIterator_base.hh\",\n \"rank\": 22,\n \"score\": 264157.7815934742\n },\n {\n \"content\": \"class Node : public Node_base<dimension_type>, boost::noncopyable\\n\\n{ \\n\\nprivate:\\n\\n /// The default constructor is private to prevent instantiation. \\n\\n Node();\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/Node_base.hh\",\n \"rank\": 23,\n \"score\": 262263.4778019414\n },\n {\n \"content\": \"class Point : public Point_base<dimension_type>, boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// The default constructor is private to prevent instantiation.\\n\\n Point(); \\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/Point_base.hh\",\n \"rank\": 24,\n \"score\": 262263.47780194134\n },\n {\n \"content\": \"class Zone : public Zone_base<dimension_type>, boost::noncopyable\\n\\n{ \\n\\nprivate:\\n\\n /// The default constructor is private to prevent instantiation.\\n\\n Zone();\\n\\n};\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/Zone_base.hh\",\n \"rank\": 25,\n \"score\": 262263.4778019414\n },\n {\n \"content\": \"class CartesianMesh<OneD> : public CartesianMesh_base<OneD>\\n\\n{\\n\\nprivate:\\n\\n /// Defines the base class as the Base type.\\n\\n typedef CartesianMesh_base<OneD> Base;\\n\\n \\n\\npublic:\\n\\n /// Imports the Zone class from the Base type.\\n\\n typedef Base::Zone Zone;\\n\\n /// Imports the Node class from the Base type.\\n\\n typedef Base::Node Node;\\n\\n /// Imports the Corner class from the Base type.\\n\\n typedef Base::Corner Corner;\\n\\n\\n\\nprivate:\\n\\n /// Requires the \\\\c Zone type to satisfy the \\\\c ZoneConcept concept.\\n\\n BOOST_CLASS_REQUIRE(Zone, , ZoneConcept);\\n\\n /// Requires the \\\\c Node type to satisfy the \\\\c NodeConcept concept.\\n\\n BOOST_CLASS_REQUIRE(Node, , NodeConcept);\\n\\n /// Requires the \\\\c Corner type to satisfy the \\\\c CornerConcept concept.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/OneD/CartesianMesh1D.hh\",\n \"rank\": 26,\n \"score\": 260492.24657733698\n },\n {\n \"content\": \"class DaughterTemplate : public Base<S>{\\n\\n using Base<S>::_SVar;\\n\\npublic:\\n\\n DaughterTemplate(S& init) : Base<S>(init) { }\\n\\n\\n\\n void Express(S x) { \\n\\n cout << \\\"Expressing Daughter with x = \\\" << x \\n\\n << \\\"\\\\n\\\\tBase variables: _SVar = \\\" << _SVar\\n\\n << \\\"\\\\n\\\\tDaughter variables: _dVar = \\\" << _dVar << endl;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n S _dVar;\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/test/general.hpp\",\n \"rank\": 27,\n \"score\": 258778.08754220174\n },\n {\n \"content\": \"/// \\\\brief The Mesh class is responsible for storing and controlling a problem's spatial \\n\\n/// domain information.\\n\\n///\\n\\n/// The Mesh class is responsible for storing and controlling a problem's spatial \\n\\n/// domain information. First, the mesh stores the global length and area of the domain.\\n\\n/// Second, the Mesh also stores the geometric elements, which are (for a one-dimensional\\n\\n/// mesh), Zones, Nodes, and Corners. Together with these geometric elements, the Mesh\\n\\n/// stores all of the information necessary to fully describe a problem's spatial domain.\\n\\nclass Mesh : public MeshTraits, boost::noncopyable\\n\\n{\\n\\npublic:\\n\\n\\t// ****** Mesh Constructors ******\\n\\n /// \\\\brief Constructor to create a uniform one-dimensional Cartesian Mesh with \\\\a num_zones\\n\\n\\t/// zones.\\n\\n\\t///\\n\\n\\t/// This constructor creates a uniform (all Zones are of equal length), one-dimensional\\n\\n\\t/// Cartesian Mesh.\\n\\n\\t/// \\\\param length Length of the spatial domain.\\n\\n\\t/// \\\\param area Cross-sectional area of the spatial domain.\\n\\n\\t/// \\\\param num_zones The number of zones to break the spatial domain into.\\n\\n Mesh(const double length_in, const double area_in, const unsigned int num_zones)\\n\\n\\t\\t\\t: mLength(length_in),\\n\\n\\t\\t\\t mArea(area_in),\\n\\n\\t\\t\\t mNumZones(num_zones),\\n\\n\\t\\t\\t mZones(), mNodes(), mCorners()\\n\\n\\t{\\n\\n\\t\\tvector<double> zone_lengths(num_zones, length_in/num_zones);\\n\\n\\t\\tmBuildMesh(zone_lengths);\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Geometry/OneDMesh/OneDCartMesh.hh\",\n \"rank\": 28,\n \"score\": 255642.97040024173\n },\n {\n \"content\": \"class GeomVector : public GeomVector_base<dimension_type>, boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// This constructor is private to prevent instantiation.\\n\\n GeomVector();\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/GeomVector_base.hh\",\n \"rank\": 29,\n \"score\": 254576.55126839975\n },\n {\n \"content\": \"/// \\\\brief The Mesh class is responsible for storing and controlling a problem's spatial \\n\\n/// domain information.\\n\\n///\\n\\n/// The Mesh class is responsible for storing and controlling a problem's spatial \\n\\n/// domain information. First, the mesh stores the global length and area of the domain.\\n\\n/// Second, the Mesh also stores the geometric elements, which are (for a one-dimensional\\n\\n/// mesh), Zones, Nodes, and Corners. Together with these geometric elements, the Mesh\\n\\n/// stores all of the information necessary to fully describe a problem's spatial domain.\\n\\nclass Mesh : public MeshTraits, boost::noncopyable\\n\\n{\\n\\npublic:\\n\\n\\t// ****** Mesh Constructors ******\\n\\n /// \\\\brief Constructor to create a uniform one-dimensional Cartesian Mesh with \\\\a num_zones\\n\\n\\t/// zones.\\n\\n\\t///\\n\\n\\t/// This constructor creates a uniform (all Zones are of equal length), one-dimensional\\n\\n\\t/// Cartesian Mesh.\\n\\n\\t/// \\\\param length Length of the spatial domain.\\n\\n\\t/// \\\\param area Cross-sectional area of the spatial domain.\\n\\n\\t/// \\\\param num_zones The number of zones to break the spatial domain into.\\n\\n Mesh(const double length_in, const double area_in, const unsigned int num_zones)\\n\\n\\t\\t\\t: mLength(length_in),\\n\\n\\t\\t\\t mArea(area_in),\\n\\n\\t\\t\\t mNumZones(num_zones),\\n\\n\\t\\t\\t mZones(), mNodes(), mCorners()\\n\\n\\t{\\n\\n\\t\\tvector<double> zone_lengths(num_zones, length_in/num_zones);\\n\\n\\t\\tmBuildMesh(zone_lengths);\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Geometry/OneDMesh/OneDCartMesh.hh\",\n \"rank\": 30,\n \"score\": 253968.70046256302\n },\n {\n \"content\": \"/// \\\\brief The Mesh class is responsible for storing and controlling a problem's spatial \\n\\n/// domain information.\\n\\n///\\n\\n/// The Mesh class is responsible for storing and controlling a problem's spatial \\n\\n/// domain information. First, the mesh stores the global length and area of the domain.\\n\\n/// Second, the Mesh also stores the geometric elements, which are (for a one-dimensional\\n\\n/// mesh), Zones, Nodes, and Corners. Together with these geometric elements, the Mesh\\n\\n/// stores all of the information necessary to fully describe a problem's spatial domain.\\n\\nclass Mesh : public MeshTraits, boost::noncopyable\\n\\n{\\n\\npublic:\\n\\n\\t// ****** Mesh Constructors ******\\n\\n /// \\\\brief Constructor to create a uniform one-dimensional Cartesian Mesh with \\\\a num_zones\\n\\n\\t/// zones.\\n\\n\\t///\\n\\n\\t/// This constructor creates a uniform (all Zones are of equal length), one-dimensional\\n\\n\\t/// Cartesian Mesh.\\n\\n\\t/// \\\\param length Length of the spatial domain.\\n\\n\\t/// \\\\param area Cross-sectional area of the spatial domain.\\n\\n\\t/// \\\\param num_zones The number of zones to break the spatial domain into.\\n\\n Mesh(const double length_in, const double area_in, const unsigned int num_zones)\\n\\n\\t\\t\\t: mLength(length_in),\\n\\n\\t\\t\\t mArea(area_in),\\n\\n\\t\\t\\t mNumZones(num_zones),\\n\\n\\t\\t\\t mZones(), mNodes(), mCorners()\\n\\n\\t{\\n\\n\\t\\tvector<double> zone_lengths(num_zones, length_in/num_zones);\\n\\n\\t\\tmBuildMesh(zone_lengths);\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Geometry/OneDMesh/OneDCartMesh.hh\",\n \"rank\": 31,\n \"score\": 253968.70046256302\n },\n {\n \"content\": \"class DaughterString : public Base<std::string>{\\n\\npublic:\\n\\n DaughterString(std::string& init) : Base<std::string>(init) { }\\n\\n\\n\\n void Express(std::string x) { \\n\\n cout << \\\"Expressing Daughter with x = \\\" << x \\n\\n << \\\"\\\\n\\\\tBase variables: _SVar = \\\" << _SVar\\n\\n << \\\"\\\\n\\\\tDaughter variables: _dVar = \\\" << _dVar << endl;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n std::string _dVar;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Code/trunk/cpp/test/general.hpp\",\n \"rank\": 32,\n \"score\": 248613.28028952493\n },\n {\n \"content\": \"class Point<OneD> : public Point_base<OneD>\\n\\n{\\n\\nprivate:\\n\\n /// Aliases the \\\\c Point_base<OneD> as the \\\\c Base type.\\n\\n typedef Point_base<OneD> Base;\\n\\npublic:\\n\\n /// Imports the \\\\c Point_base<OneD>::PointType into the \\\\c Point<OneD> scope.\\n\\n\\ttypedef Base::PointType PointType;\\n\\n\\n\\n /*! \\\\brief Constructor. Takes in the x-position for the \\\\c Point<OneD> object.\\n\\n *\\n\\n * Constructor. Takes in the x-position for the \\\\c Point<OneD> object.\\n\\n * \\\\param[in] x_in The x-position for the \\\\c Point<OneD> object. */ \\n\\n\\texplicit Point(PointType x_in = 0.0)\\n\\n\\t : Point_base<OneD>(x_in)\\n\\n\\t{ }\\n\\n\\n\\n /*! \\\\brief Copy constructor.\\n\\n *\\n\\n * Copy constructor.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/OneD/Point1D.hh\",\n \"rank\": 33,\n \"score\": 247878.79401605178\n },\n {\n \"content\": \"class Node<OneD> : public Node_base<OneD>\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c Id class from \\\\c Node_base<OneD> into the \\\\c Node<OneD> scope.\\n\\n typedef Node_base<OneD>::Id Id;\\n\\n /// Imports the \\\\c PointType class from \\\\c Node_base<OneD> into the \\\\c Node<OneD> scope.\\n\\n typedef Node_base<OneD>::PointType PointType;\\n\\n /// Imports the \\\\c Zone class from \\\\c Node_base<OneD> into the \\\\c Node<OneD> scope.\\n\\n typedef Node_base<OneD>::Zone Zone;\\n\\n /// Imports the \\\\c IndexType class from \\\\c Node_base<OneD> into the \\\\c Node<OneD> scope.\\n\\n typedef Node_base<OneD>::IndexType IndexType;\\n\\n\\n\\n typedef Node_base<OneD>::Corner Corner;\\n\\n\\n\\n /*! \\\\brief Imports the \\\\c NoElementConnected<Node<OneD>, Zone> exception class \\n\\n * into the \\\\c Node<OneD> scope. Thrown when an attempt is made to access a \\n\\n * non-existent connected \\\\c Zone. */\\n\\n typedef NoElementConnected< Node<OneD>, Zone > NoZoneConnected;\\n\\n /*! \\\\brief Imports the \\\\c NoElementConnected<Node<OneD>, Corner> exception class \\n\\n * into the \\\\c Node<OneD> scope. Thrown when an attempt is made to access a \\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/OneD/Node1D.hh\",\n \"rank\": 34,\n \"score\": 247878.79401605178\n },\n {\n \"content\": \"class Zone<OneD> : public Zone_base<OneD>\\n\\n{\\n\\nprivate:\\n\\n /// Define the \\\\c Zone_base<OneD> class as \\\\c Base.\\n\\n typedef Zone_base<OneD> Base;\\n\\n \\n\\npublic:\\n\\n /// Import the \\\\c Base::Id type into the \\\\c Zone scope.\\n\\n typedef Base::Id Id;\\n\\n /// Import the \\\\c Base::LengthType type into the \\\\c Zone scope.\\n\\n typedef Base::LengthType LengthType;\\n\\n /// Import the \\\\c Base::Node type into the \\\\c Zone scope.\\n\\n typedef Base::Node Node;\\n\\n /// Import the \\\\c Base::Corner type into the \\\\c Zone scope.\\n\\n typedef Base::Corner Corner;\\n\\n\\n\\n /*! \\\\brief Imports the \\\\c NoElementConnected<Zone<OneD>, Node> exception class \\n\\n * into the \\\\c Zone<OneD> scope. Thrown when an attempt is made to access a \\n\\n * non-existent connected \\\\c Node. */\\n\\n typedef NoElementConnected< Zone<OneD>, Node > NoNodeConnected;\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/OneD/Zone1D.hh\",\n \"rank\": 35,\n \"score\": 247878.79401605178\n },\n {\n \"content\": \"class GeomVector<OneD> : public GeomVector_base<OneD>\\n\\n{\\n\\nprivate:\\n\\n /// Defines the \\\\c GeomVector_base<OneD> as the \\\\c Base type.\\n\\n typedef GeomVector_base<OneD> Base;\\n\\n\\n\\npublic: \\n\\n /// Imports the \\\\c GeomVector_base<OneD>::OrdinateType into this scope.\\n\\n typedef Base::OrdinateType OrdinateType;\\n\\n\\n\\n /*! \\\\brief Copy constructor.\\n\\n *\\n\\n * Copy constructor.\\n\\n * \\\\param[in] geom_vec_in The \\\\c GeomVector<OneD> object to copy. */\\n\\n GeomVector(const GeomVector<OneD>& geom_vec_in)\\n\\n : GeomVector_base<OneD>(geom_vec_in.mI)\\n\\n { }\\n\\n \\n\\n /*! \\\\brief Constructor. Takes in the i-ordinate.\\n\\n *\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/OneD/GeomVector1D.hh\",\n \"rank\": 36,\n \"score\": 240281.15990563008\n },\n {\n \"content\": \"class BadMeshArea : public BadMeshUserData\\n\\n{\\n\\nprivate:\\n\\n /// Requires the \\\\c dimension_type template parameter satisfies the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n /// Defines the \\\\c DimensionType type from the \\\\c dimension_type template parameter.\\n\\n typedef dimension_type DimensionType;\\n\\n \\n\\npublic:\\n\\n /// Defines the \\\\c LengthType from the \\\\c MeshTraits<DimensionType>::LengthType type.\\n\\n typedef typename MeshTraits<DimensionType>::LengthType LengthType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown and the mesh area.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown,\\n\\n * and the area given to the mesh constructor.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. \\n\\n * \\\\param[in] mesh_area The area given to the mesh constructor. */ \\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 37,\n \"score\": 237228.17824256653\n },\n {\n \"content\": \"class AngularBaseException : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c ExceptionBase base class.\\n\\n\\ttypedef ExceptionBase::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n AngularBaseException(LineNumType line_number, const char* file_in)\\n\\n : ExceptionBase(line_number, file_in)\\n\\n { }\\n\\n};\\n\\n\\n\\n\\n\\n/*! \\\\brief Thrown when the \\\\c AngleQuad class is constructed with a bad quadrature order.\\n\\n *\\n\\n * This exception class is thrown when an \\\\c AngleQuad class is constructed with a bad\\n\\n * quadrature order.\\n\\n * \\\\par Template Parameters:\\n\\n * <dl> <dt> \\\\e angle_quad_type </dt>\\n\\n * <dd> The type of the bad \\\\c AngleQuad object. This type must satisfy the\\n\\n * \\\\c AngleQuadConcept concept template. </dd> </dl> */\\n\\ntemplate<typename angle_quad_type>\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh\",\n \"rank\": 38,\n \"score\": 236518.95575023937\n },\n {\n \"content\": \"class IteratorBaseException : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c ExceptionBase base class.\\n\\n typedef ExceptionBase::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n\\tIteratorBaseException(LineNumType line_number, const char* filename)\\n\\n\\t\\t: ExceptionBase(line_number, filename)\\n\\n\\t{ }\\n\\n};\\n\\n\\n\\n/*! \\\\brief Exception thrown when an out-of-range \\\\c Iterator or \\n\\n * \\\\c ReverseIterator is dereferenced.\\n\\n *\\n\\n * This exception is thrown when an out-of-range \\\\c Iterator or \\n\\n * \\\\c ReverseIterator is dereferenced. */\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 39,\n \"score\": 236518.95575023937\n },\n {\n \"content\": \"class FieldBaseException : public ExceptionBase\\n\\n{\\n\\nprivate:\\n\\n /// Requires that the \\\\c field_type satisfy the \\\\c FieldConcept concept.\\n\\n BOOST_CLASS_REQUIRE(field_type, , FieldConcept); \\n\\n \\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from \\\\c ExceptionBase.\\n\\n typedef ExceptionBase::LineNumType LineNumType;\\n\\n /// Defines the \\\\c field_type template paramater as \\\\c FieldType.\\n\\n typedef field_type FieldType;\\n\\n \\n\\n /*! \\\\brief Constructor. Takes in the \\\\c Field from which the exception was thrown, and the\\n\\n * line number and filename.\\n\\n *\\n\\n * Constructor. Takes in a reference to the \\\\c Field from which the exception was thrown.\\n\\n * Also takes in the line number and the name of the file where the exception was thrown.\\n\\n * \\\\param[in] field_in A reference to the \\\\c Field from which the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] file_in The name of the file where the exception was thrown. */\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/FieldExcept.hh\",\n \"rank\": 40,\n \"score\": 236518.95575023937\n },\n {\n \"content\": \"class ZeroZones : public BadMeshUserData\\n\\n{\\n\\npublic:\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown. \\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n ZeroZones(MeshBaseException::LineNumType line_number,\\n\\n const char* filename)\\n\\n : BadMeshUserData(line_number, filename)\\n\\n { }\\n\\n\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\\n * \\\\return A \\\\c string holding a helpful error message. */ \\n\\n virtual string msg() const\\n\\n {\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/MeshExcept.hh\",\n \"rank\": 41,\n \"score\": 233260.57103054703\n },\n {\n \"content\": \"class PowerMCBase : public Markov<BankSource> {\\n\\n public:\\n\\n PowerMCBase(const std::vector<unsigned long>& seed,\\n\\n const Field<Zone, Material>& field)\\n\\n : Markov<BankSource>(seed, field) { k = 1; }\\n\\n\\n\\n ~PowerMCBase() { }\\n\\n // Scoring function\\n\\n void score(BankSource& source, Particle& P);\\n\\n\\n\\n // Members used in Python\\n\\n double k; //Eigenvalue estimate\\n\\n};\\n\\n\\n\\n/*score will score in the source from P.*/\\n\\nvoid PowerMCBase::score(BankSource& source, Particle& P){\\n\\n double xi = _r.Fixed();\\n\\n const Material& mat = _field[*(P.zone())];\\n\\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\\n\\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\\n\\n}\\n\\n#endif\\n\",\n \"file_path\": \"Code/trunk/cpp/Markov/PowerMCBase.h\",\n \"rank\": 42,\n \"score\": 230516.83399274957\n },\n {\n \"content\": \"class Angle_base : public boost::noncopyable\\n\\n{\\n\\nprivate:\\n\\n /// Requires that the \\\\c dimension_type satisfy the \\\\c DimensionConcept concept.\\n\\n BOOST_CLASS_REQUIRE(dimension_type, , DimensionConcept);\\n\\n\\n\\npublic:\\n\\n // ****** Public type declarations ******\\n\\n /// Alias the \\\\c dimension_type template parameter as \\\\c DimensionType.\\n\\n typedef dimension_type DimensionType;\\n\\n /// Sets \\\\c GeomVector<DimensionType> as the \\\\c AngleType.\\n\\n\\ttypedef GeomVector<DimensionType> AngleType;\\n\\n\\t/// Defines the \\\\c WeightType.\\n\\n\\ttypedef Real8 WeightType;\\n\\n /// Defines the \\\\c OrdinateType from the \\\\c AngleType.\\n\\n typedef typename AngleType::OrdinateType OrdinateType;\\n\\n\\t\\n\\n\\t// ****** Data accessors ******\\n\\n\\t/*! \\\\brief Returns a constant reference to the angle ordinate.\\n\\n\\t *\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/AngleQuad/Angle_base.hh\",\n \"rank\": 43,\n \"score\": 230516.83399274957\n },\n {\n \"content\": \"class PowerBase : public Markov<BankSource> {\\n\\n public:\\n\\n PowerBase(const std::vector<unsigned long>& seed,\\n\\n const Field<Zone, Material>& field)\\n\\n : Markov<BankSource>(seed, field) { k = 1; }\\n\\n\\n\\n ~PowerBase() { }\\n\\n // Scoring function\\n\\n void score(BankSource& source, Particle& P);\\n\\n\\n\\n // Members used in Python\\n\\n double k; //Eigenvalue estimate\\n\\n};\\n\\n\\n\\n/*score will score in the source from P.*/\\n\\nvoid PowerBase::score(BankSource& source, Particle& P){\\n\\n double xi = _r.Fixed();\\n\\n const Material& mat = _field[*(P.zone())];\\n\\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\\n\\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\\n\\n}\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Markov/PowerBase.h\",\n \"rank\": 44,\n \"score\": 230516.83399274957\n },\n {\n \"content\": \"class PowerMCBase : public Markov<BankSource> {\\n\\n public:\\n\\n PowerMCBase(const std::vector<unsigned long>& seed,\\n\\n const Field<Zone, Material>& field)\\n\\n : Markov<BankSource>(seed, field) { k = 1; }\\n\\n\\n\\n ~PowerMCBase() { }\\n\\n // Scoring function\\n\\n void score(BankSource& source, Particle& P);\\n\\n\\n\\n // Members used in Python\\n\\n double k; //Eigenvalue estimate\\n\\n};\\n\\n\\n\\n/*score will score in the source from P.*/\\n\\nvoid PowerMCBase::score(BankSource& source, Particle& P){\\n\\n double xi = _r.Fixed();\\n\\n const Material& mat = _field[*(P.zone())];\\n\\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\\n\\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\\n\\n}\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Markov/PowerMCBase.h\",\n \"rank\": 45,\n \"score\": 228405.72402313811\n },\n {\n \"content\": \"class PowerMCBase : public Markov<BankSource> {\\n\\n public:\\n\\n PowerMCBase(const std::vector<unsigned long>& seed,\\n\\n const Field<Zone, Material>& field)\\n\\n : Markov<BankSource>(seed, field) { k = 1; }\\n\\n\\n\\n ~PowerMCBase() { }\\n\\n // Scoring function\\n\\n void score(BankSource& source, Particle& P);\\n\\n\\n\\n // Members used in Python\\n\\n double k; //Eigenvalue estimate\\n\\n};\\n\\n\\n\\n/*score will score in the source from P.*/\\n\\nvoid PowerMCBase::score(BankSource& source, Particle& P){\\n\\n double xi = _r.Fixed();\\n\\n const Material& mat = _field[*(P.zone())];\\n\\n int N = P.weight()*(1.0/k)*(mat.nu()*mat.xF()/mat.xT()) + xi;\\n\\n for( int i = 0; i< N; i++ ){ source.push_back(new Particle(P)); }\\n\\n}\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Markov/PowerMCBase.h\",\n \"rank\": 46,\n \"score\": 226350.56879698276\n },\n {\n \"content\": \"/// \\\\brief InvalidData is thrown if invalid data is passed to Method or one of its derived classes.\\n\\n///\\n\\n/// InvalidData is thrown if invalid data is passed to Method or one of its derived classes. For instance,\\n\\n/// Diffusion must have nonzero opacities to generate diffusion coefficients. \\n\\nclass InvalidData : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInvalidData(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Invalid data passed to a transport Method. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/MethodExcept.hh\",\n \"rank\": 47,\n \"score\": 225990.4060967319\n },\n {\n \"content\": \"/// \\\\brief InsaneInput is thrown if the users inputs unphysical data.\\n\\n///\\n\\n/// InsaneInput is thrown if the users inputs unphysical data, such as negative temperatures,\\n\\n/// non-increasing time steps, etc. \\n\\nclass InsaneInput : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInsaneInput(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Dimension mismatch in input, check for consistency. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 48,\n \"score\": 225984.23349752772\n },\n {\n \"content\": \"/// \\\\brief ModelingError is thrown if a Method commits a modeling error.\\n\\n///\\n\\n/// ModelingError is thrown if a Method is commits a modeling error. An example might be\\n\\n/// if energy is not conserved or if a probability distribution isn't normalized. \\n\\nclass ModelingError : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tModelingError(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Method has committed a modeling error. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/MethodExcept.hh\",\n \"rank\": 49,\n \"score\": 225984.23349752772\n },\n {\n \"content\": \"/// \\\\brief Thrown when an iterator is made invalid or an invalid location is dereferenced.\\n\\n///\\n\\n/// IteratorOutOfRange is thrown whenever an attempt is made to dereference an iterator that \\n\\n/// does not point to a valid object, or when an iterator is moved outside the an objects\\n\\n/// range.\\n\\nclass IteratorOutOfRange : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tIteratorOutOfRange(unsigned int line_number, const string& file_in)\\n\\n\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to dereference an invalid iterator at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/IteratorExcept.hh\",\n \"rank\": 50,\n \"score\": 225984.23349752772\n },\n {\n \"content\": \"/// \\\\brief AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\\n\\n///\\n\\n/// AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\\n\\nclass AdvancedTooFar : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tAdvancedTooFar(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Method has reached the last time step for this problem. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/MethodExcept.hh\",\n \"rank\": 51,\n \"score\": 225984.23349752772\n },\n {\n \"content\": \"/// \\\\brief DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension.\\n\\n///\\n\\n/// DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension. An example\\n\\n/// of this might be if the number of problem regions does not match the number of materials, or if the\\n\\n/// the number of time delta-ts does not match the number of times requested for output. \\n\\nclass DimensionMismatch : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tDimensionMismatch(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Dimension mismatch in input, check for consistency. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 52,\n \"score\": 225984.23349752772\n },\n {\n \"content\": \"class LowWeightParticle : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception \\n\\n //was thrown.\\n\\n\\tLowWeightParticle(const Particle& P, unsigned int line_number,\\n\\n const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n string msg() const {\\n\\n ostringstream out;\\n\\n out << \\\"Particle was killed due to low weight.\\\\n\\\";\\n\\n return out.str();\\n\\n }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Exception/MonteCarloExcept.h\",\n \"rank\": 53,\n \"score\": 225984.23349752772\n },\n {\n \"content\": \"/// \\\\brief InvalidData is thrown if invalid data is passed to Method or one of its derived classes.\\n\\n///\\n\\n/// InvalidData is thrown if invalid data is passed to Method or one of its derived classes. For instance,\\n\\n/// Diffusion must have nonzero opacities to generate diffusion coefficients. \\n\\nclass InvalidData : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInvalidData(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Invalid data passed to a transport Method. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/MethodExcept.hh\",\n \"rank\": 54,\n \"score\": 223651.70782683336\n },\n {\n \"content\": \"/// \\\\brief InvalidData is thrown if invalid data is passed to Method or one of its derived classes.\\n\\n///\\n\\n/// InvalidData is thrown if invalid data is passed to Method or one of its derived classes. For instance,\\n\\n/// Diffusion must have nonzero opacities to generate diffusion coefficients. \\n\\nclass InvalidData : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInvalidData(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Invalid data passed to a transport Method. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/MethodExcept.hh\",\n \"rank\": 55,\n \"score\": 223651.70782683336\n },\n {\n \"content\": \"/// \\\\brief DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension.\\n\\n///\\n\\n/// DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension. An example\\n\\n/// of this might be if the number of problem regions does not match the number of materials, or if the\\n\\n/// the number of time delta-ts does not match the number of times requested for output. \\n\\nclass DimensionMismatch : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tDimensionMismatch(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Dimension mismatch in input, check for consistency. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 56,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\\n\\n///\\n\\n/// AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\\n\\nclass AdvancedTooFar : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tAdvancedTooFar(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Method has reached the last time step for this problem. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/MethodExcept.hh\",\n \"rank\": 57,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief ModelingError is thrown if a Method commits a modeling error.\\n\\n///\\n\\n/// ModelingError is thrown if a Method is commits a modeling error. An example might be\\n\\n/// if energy is not conserved or if a probability distribution isn't normalized. \\n\\nclass ModelingError : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tModelingError(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Method has committed a modeling error. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/MethodExcept.hh\",\n \"rank\": 58,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"class LowWeightParticle : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception \\n\\n //was thrown.\\n\\n\\tLowWeightParticle(const Particle& P, unsigned int line_number,\\n\\n const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n string msg() const {\\n\\n ostringstream out;\\n\\n out << \\\"Particle was killed due to low weight.\\\\n\\\";\\n\\n return out.str();\\n\\n }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/MonteCarloExcept.h\",\n \"rank\": 59,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension.\\n\\n///\\n\\n/// DimensionMismatch is thrown if the users inputs data that is inconsistent in dimension. An example\\n\\n/// of this might be if the number of problem regions does not match the number of materials, or if the\\n\\n/// the number of time delta-ts does not match the number of times requested for output. \\n\\nclass DimensionMismatch : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tDimensionMismatch(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Dimension mismatch in input, check for consistency. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 60,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief Thrown when an iterator is made invalid or an invalid location is dereferenced.\\n\\n///\\n\\n/// IteratorOutOfRange is thrown whenever an attempt is made to dereference an iterator that \\n\\n/// does not point to a valid object, or when an iterator is moved outside the an objects\\n\\n/// range.\\n\\nclass IteratorOutOfRange : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tIteratorOutOfRange(unsigned int line_number, const string& file_in)\\n\\n\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to dereference an invalid iterator at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/IteratorExcept.hh\",\n \"rank\": 61,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\\n\\n///\\n\\n/// AdvancedTooFar is thrown if a Method is asked to calculate past the last time step.\\n\\nclass AdvancedTooFar : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tAdvancedTooFar(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Method has reached the last time step for this problem. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/MethodExcept.hh\",\n \"rank\": 62,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief InsaneInput is thrown if the users inputs unphysical data.\\n\\n///\\n\\n/// InsaneInput is thrown if the users inputs unphysical data, such as negative temperatures,\\n\\n/// non-increasing time steps, etc. \\n\\nclass InsaneInput : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInsaneInput(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Dimension mismatch in input, check for consistency. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 63,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief Thrown when an iterator is made invalid or an invalid location is dereferenced.\\n\\n///\\n\\n/// IteratorOutOfRange is thrown whenever an attempt is made to dereference an iterator that \\n\\n/// does not point to a valid object, or when an iterator is moved outside the an objects\\n\\n/// range.\\n\\nclass IteratorOutOfRange : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tIteratorOutOfRange(unsigned int line_number, const string& file_in)\\n\\n\\t\\t: ExceptionBase(line_number, file_in) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Attempted to dereference an invalid iterator at line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/IteratorExcept.hh\",\n \"rank\": 64,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief Thrown if an invalid initial condition is attempted to be prescribed.\\n\\n///\\n\\n/// InvalidInitialCondition is thrown if the user attempts to specify a negative initial condition.\\n\\n/// This could later be expanded upon to become more intelligent, if desired.\\n\\nclass InvalidInitialCondition : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInvalidInitialCondition(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Unphysical initial condition encountered, please check. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 65,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief ModelingError is thrown if a Method commits a modeling error.\\n\\n///\\n\\n/// ModelingError is thrown if a Method is commits a modeling error. An example might be\\n\\n/// if energy is not conserved or if a probability distribution isn't normalized. \\n\\nclass ModelingError : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tModelingError(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Method has committed a modeling error. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/MethodExcept.hh\",\n \"rank\": 66,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"/// \\\\brief InsaneInput is thrown if the users inputs unphysical data.\\n\\n///\\n\\n/// InsaneInput is thrown if the users inputs unphysical data, such as negative temperatures,\\n\\n/// non-increasing time steps, etc. \\n\\nclass InsaneInput : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInsaneInput(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Dimension mismatch in input, check for consistency. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 67,\n \"score\": 223645.53522762924\n },\n {\n \"content\": \"class GhostElement : public geom_element\\n\\n{\\n\\nprivate:\\n\\n /*! \\\\brief Requires that the \\\\c geom_element type satisfy the \\n\\n * \\\\c GeometricElementConcept concept. */\\n\\n BOOST_CLASS_REQUIRE(geom_element, , GeometricElementConcept);\\n\\n\\n\\npublic:\\n\\n /// Alias the \\\\c geom_element type as \\\\c ElementType.\\n\\n typedef geom_element ElementType;\\n\\n /// Define the id type for the ghost element.\\n\\n\\ttypedef GeomId< GhostElement<ElementType> > Id;\\t\\n\\n\\t\\n\\n\\t/*! \\\\brief Constructor. Takes in the ghosted element and an id.\\n\\n\\t *\\n\\n\\t * Constructor. Takes in a constant reference to the element that we are ghosting,\\n\\n\\t * plus an id number for this ghost element.\\n\\n\\t * \\\\param[in] element_in The geometric element we are using as a \\\"mirror\\\" for the\\n\\n\\t * ghost element.\\n\\n\\t * \\\\param[in] id_in The id number of the ghost element.*/\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/GhostElement.hh\",\n \"rank\": 68,\n \"score\": 222722.7594529945\n },\n {\n \"content\": \"class LowWeightParticle : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception \\n\\n //was thrown.\\n\\n\\tLowWeightParticle(const Particle& P, unsigned int line_number,\\n\\n const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n string msg() const {\\n\\n ostringstream out;\\n\\n out << \\\"Particle was killed due to low weight.\\\\n\\\";\\n\\n return out.str();\\n\\n }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/MonteCarloExcept.h\",\n \"rank\": 69,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"class Iterator_AssignmentOutOfRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */ \\n\\n Iterator_AssignmentOutOfRange(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 70,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"class AVAccessOutOfRange : public AngularBaseException\\n\\n{\\n\\nprivate:\\n\\n BOOST_CLASS_REQUIRE(angle_vector_type, , AngleVectorConcept);\\n\\n\\n\\npublic:\\n\\n typedef angle_vector_type AngleVectorType;\\n\\n typedef typename angle_vector_type::IndexType IndexType;\\n\\n\\n\\n AVAccessOutOfRange(const angle_vector_type& av_in,\\n\\n const IndexType& bad_iter_in,\\n\\n LineNumType line_number, const char* file_in)\\n\\n : AngularBaseException(line_number, file_in),\\n\\n mAngleVector(av_in),\\n\\n mBadIter(bad_iter_in)\\n\\n { }\\n\\n \\n\\n \\n\\n const AngleVectorType& getAngleVector() const\\n\\n {\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh\",\n \"rank\": 71,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"class Iterator_DereferenceOutOfRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n Iterator_DereferenceOutOfRange(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 72,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"/// \\\\brief Thrown if an invalid initial condition is attempted to be prescribed.\\n\\n///\\n\\n/// InvalidInitialCondition is thrown if the user attempts to specify a negative initial condition.\\n\\n/// This could later be expanded upon to become more intelligent, if desired.\\n\\nclass InvalidInitialCondition : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInvalidInitialCondition(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Unphysical initial condition encountered, please check. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 73,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"/// \\\\brief Thrown if an invalid initial condition is attempted to be prescribed.\\n\\n///\\n\\n/// InvalidInitialCondition is thrown if the user attempts to specify a negative initial condition.\\n\\n/// This could later be expanded upon to become more intelligent, if desired.\\n\\nclass InvalidInitialCondition : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception was thrown.\\n\\n\\tInvalidInitialCondition(unsigned int line_number, const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n\\t/// Prints out a helpful message.\\n\\n\\tstring msg() const\\n\\n\\t{\\n\\n\\t\\tostringstream out;\\n\\n\\t\\tout << \\\"Unphysical initial condition encountered, please check. Exception thrown from line \\\"\\n\\n\\t\\t\\t<< line() << \\\" in file \\\" << file();\\n\\n\\t\\treturn out.str();\\n\\n\\t}\\n\\n};\\n\\n\\n\\n\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Exception/ProblemExcept.hh\",\n \"rank\": 74,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"class Iterator_ConstructionOutOfRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */ \\n\\n Iterator_ConstructionOutOfRange(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 75,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"class LowWeightParticle : public ExceptionBase\\n\\n{\\n\\npublic:\\n\\n\\t/// The constructor takes the line number and filename where the exception \\n\\n //was thrown.\\n\\n\\tLowWeightParticle(const Particle& P, unsigned int line_number,\\n\\n const string& file)\\n\\n\\t\\t: ExceptionBase(line_number, file) { }\\n\\n\\n\\n string msg() const {\\n\\n ostringstream out;\\n\\n out << \\\"Particle was killed due to low weight.\\\\n\\\";\\n\\n return out.str();\\n\\n }\\n\\n\\n\\n};\\n\\n\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Exception/MonteCarloExcept.h\",\n \"rank\": 76,\n \"score\": 221377.04399228684\n },\n {\n \"content\": \"class BadAngleQuadOrder : public AngularBaseException\\n\\n{\\n\\nprivate:\\n\\n /// Requires the \\\\c angle_quad_type to satisfy the \\\\c AngleQuadConcept.\\n\\n BOOST_CLASS_REQUIRE(angle_quad_type, , AngleQuadConcept);\\n\\n\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c AngularBaseException base class.\\n\\n typedef AngularBaseException::LineNumType LineNumType;\\n\\n /// Defines the \\\\c AngleQuadType from the \\\\c angle_quad_type template parameter.\\n\\n typedef angle_quad_type AngleQuadType;\\n\\n \\n\\n /*! \\\\brief Constructor. Takes in the bad angular quadrature object and the line number\\n\\n * and filename where the exception was thrown.\\n\\n *\\n\\n * Constructor. Takes in the bad \\\\c AngleQuad angular quadrature object and the\\n\\n * line number and filename where the exception was thrown.\\n\\n * \\\\param[in] angle_quad_in The \\\\c AngleQuad object where the error occurred.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] file_in The file where the exception was thrown. */\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh\",\n \"rank\": 77,\n \"score\": 219175.64515000366\n },\n {\n \"content\": \"class Iterator_AdvanceBeyondRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown and the distance advanced.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown\\n\\n * and the distance of the attempted advance.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. \\n\\n * \\\\param[in] n The distance of the attempted advance. */\\n\\n Iterator_AdvanceBeyondRange(LineNumType line_number,\\n\\n const char* filename,\\n\\n UnsignedInt4 n)\\n\\n : IteratorBaseException(line_number, filename),\\n\\n mAdvanceDistance(n)\\n\\n { }\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 78,\n \"score\": 219175.64515000366\n },\n {\n \"content\": \"class Iterator_IncrementBeyondRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n Iterator_IncrementBeyondRange(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 79,\n \"score\": 219175.64515000366\n },\n {\n \"content\": \"class AngleQuadRangeError : public AngularBaseException\\n\\n{\\n\\nprivate:\\n\\n /// Requires that the \\\\c angle_quad_type template parameter satisfies the \\\\c AngleQuadConcept.\\n\\n BOOST_CLASS_REQUIRE(angle_quad_type, , AngleQuadConcept);\\n\\n\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c AngularBaseException base class.\\n\\n typedef AngularBaseException::LineNumType LineNumType;\\n\\n /// Defines the \\\\c AngleQuadType from the \\\\c angle_quad_type template parameter.\\n\\n typedef angle_quad_type AngleQuadType;\\n\\n /// Imports the \\\\c AngleQuadType::IndexType as \\\\c IndexType.\\n\\n typedef typename AngleQuadType::IndexType IndexType;\\n\\n\\n\\n /*! \\\\brief Constructor. Takes the angular quadrature object, the offending index, and the\\n\\n * line and file where the exception was thrown.\\n\\n *\\n\\n * Constructor. Takes the angular quadrature object that threw this exception, the index\\n\\n * number that caused the error, and the line number and filename where the exception was\\n\\n * thrown.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/AngleExcept.hh\",\n \"rank\": 80,\n \"score\": 219175.64515000366\n },\n {\n \"content\": \"class Iterator_DecrementBeyondRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n Iterator_DecrementBeyondRange(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 81,\n \"score\": 219175.64515000366\n },\n {\n \"content\": \"class Iterator_CheckedIteratorLacksContainer : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */ \\n\\n Iterator_CheckedIteratorLacksContainer(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 82,\n \"score\": 217038.40561041544\n },\n {\n \"content\": \"class RevIter_ReverseIncrementBeyondRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n RevIter_ReverseIncrementBeyondRange(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\\n * \\\\return A \\\\c string holding a helpful error message. */ \\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 84,\n \"score\": 214962.5607961148\n },\n {\n \"content\": \"class RevIter_ReverseDecrementBeyondRange : public IteratorBaseException\\n\\n{\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from the \\\\c IteratorBaseException base class.\\n\\n typedef IteratorBaseException::LineNumType LineNumType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in the line number and filename where the exception \\n\\n\\t * was thrown.\\n\\n *\\n\\n * Constructor. Takes in the line number and filename where the exception was thrown.\\n\\n * \\\\param[in] line_number The line number where the exception was thrown.\\n\\n * \\\\param[in] filename The filename where the exception was thrown. */\\n\\n RevIter_ReverseDecrementBeyondRange(LineNumType line_number,\\n\\n const char* filename)\\n\\n : IteratorBaseException(line_number, filename)\\n\\n { }\\n\\n \\n\\n /*! \\\\brief Returns a helpful error message.\\n\\n *\\n\\n * Returns a \\\\c string holding a helpful error message.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/IteratorExcept.hh\",\n \"rank\": 85,\n \"score\": 214962.5607961148\n },\n {\n \"content\": \"class Angle : public Angle_base<dimension_type>, boost::noncopyable\\n\\n{ \\n\\nprivate:\\n\\n /// The default constructor is private to prevent instantiation.\\n\\n Angle();\\n\\n};\\n\\n\\n\\n\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/AngleQuad/Angle_base.hh\",\n \"rank\": 86,\n \"score\": 214902.3845402577\n },\n {\n \"content\": \"class WrongSizedField : public FieldBaseException<field_type>\\n\\n{\\n\\nprivate:\\n\\n /// Requires that the \\\\c field_type satisfy the \\\\c FieldConcept concept.\\n\\n BOOST_CLASS_REQUIRE(field_type, , FieldConcept); \\n\\n\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from \\\\c ExceptionBase.\\n\\n typedef typename FieldBaseException<field_type>::LineNumType LineNumType;\\n\\n /// Defines the \\\\c field_type template paramater as \\\\c FieldType.\\n\\n typedef field_type FieldType;\\n\\n /// Defines the type of the \\\\c CartesianMesh that corresponds to this \\\\c Field.\\n\\n typedef typename FieldType::MeshType MeshType;\\n\\n\\n\\n /*! \\\\brief Constructor. Takes in the \\\\c Field from which the exception was thrown, the\\n\\n * \\\\c CartesianMesh and the line number and filename.\\n\\n *\\n\\n * Constructor. Takes in the \\\\c CartesianMesh that corresponds to the \\\\c Field from which\\n\\n * this exception was thrown and a reference to the \\\\c Field from which the exception was thrown.\\n\\n * Also takes in the line number and the name of the file where the exception was thrown.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/FieldExcept.hh\",\n \"rank\": 87,\n \"score\": 211036.28385292567\n },\n {\n \"content\": \"class FieldRangeError : public FieldBaseException<field_type>\\n\\n{\\n\\nprivate:\\n\\n /// Requires that the \\\\c field_type satisfy the \\\\c FieldConcept concept.\\n\\n BOOST_CLASS_REQUIRE(field_type, , FieldConcept); \\n\\n\\n\\npublic:\\n\\n /// Imports the \\\\c LineNumType from \\\\c ExceptionBase.\\n\\n typedef typename FieldBaseException<field_type>::LineNumType LineNumType;\\n\\n /// Defines the \\\\c field_type template paramater as \\\\c FieldType.\\n\\n typedef field_type FieldType;\\n\\n\\n\\n /*! \\\\brief Constructor. Takes in the \\\\c CenteringType object of the attempted access, the\\n\\n * \\\\c Field and the line number and filename.\\n\\n *\\n\\n * Constructor. Takes in the \\\\c geom_elem used in the failed data access, and the \\\\c Field \\n\\n * from which this exception was thrown.\\n\\n * Also takes in the line number and the name of the file where the exception was thrown.\\n\\n * \\\\param[in] geom_elem A reference to the geometric element used in the attempted data\\n\\n * access.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Exception/FieldExcept.hh\",\n \"rank\": 88,\n \"score\": 211036.28385292567\n },\n {\n \"content\": \"class Iterator : public iterator_facade< Iterator<container_type, base_type>, \\n\\n typename iterator_traits<base_type>::value_type, \\n\\n typename iterator_traits<base_type>::iterator_category,\\n\\n typename iterator_traits<base_type>::reference >\\n\\n{\\n\\nprivate:\\n\\n /*! \\\\brief Requires that the \\\\c container_type template parameter satisfy the \\n\\n * \\\\c MinimalContainerConcept concept. */\\n\\n BOOST_CLASS_REQUIRE(container_type, , MinimalContainerConcept);\\n\\n /*! \\\\brief Requires that the \\\\c base_type template parameter satisfy the\\n\\n * \\\\c boost::InputIteratorConcept concept. */\\n\\n BOOST_CLASS_REQUIRE(base_type, boost, InputIteratorConcept);\\n\\n \\n\\npublic:\\n\\n // ****** Type Definitions ******\\n\\n /// Defines the type of container that is iterated over.\\n\\n typedef container_type ContainerType;\\n\\n /// Defines the type of basic iterator that underlies Iterator.\\n\\n typedef base_type BaseType; \\n\\n /// Defines the value type that the Iterator points to.\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/Misc/Iterator.hh\",\n \"rank\": 89,\n \"score\": 203726.807623786\n },\n {\n \"content\": \"class Angle<OneD> : public Angle_base<OneD>\\n\\n{\\n\\nprivate:\\n\\n /// Defines \\\\c Angle_base<OneD> as the \\\\c Base type.\\n\\n typedef Angle_base<OneD> Base;\\n\\n \\n\\npublic:\\n\\n /// Imports the \\\\c AngleType from the \\\\c Base type.\\n\\n\\ttypedef Base::AngleType AngleType;\\n\\n\\t/// Imports the \\\\c WeightType from the \\\\c Base type.\\n\\n\\ttypedef Base::WeightType WeightType;\\n\\n\\n\\n\\t/*! \\\\brief Constructor. Takes in an angle and a weight for this quadrature point.\\n\\n\\t *\\n\\n\\t * Constructor. Takes in an angle and a weight for this quadrature point.\\n\\n\\t * \\\\param[in] angle_in The angle for this quadrature point.\\n\\n\\t * \\\\param[in] weight_in The weight for this quadrature point. */\\n\\n\\texplicit Angle(const AngleType& angle_in = AngleType(), WeightType weight_in = WeightType() )\\n\\n\\t\\t\\t: Angle_base<OneD>(angle_in, weight_in)\\n\\n\\t{ }\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/AngleQuad/OneD/Angle1D.hh\",\n \"rank\": 90,\n \"score\": 201858.939656259\n },\n {\n \"content\": \"class Base {\\n\\npublic:\\n\\n\\n\\n virtual void Express(S x) = 0;\\n\\n\\n\\nprotected:\\n\\n Base(S& init) : _bVar(3.7), _SVar(init) { }\\n\\n S _SVar;\\n\\n\\n\\nprivate:\\n\\n double _bVar;\\n\\n};\\n\\n\\n\\ntemplate<class S>\\n\",\n \"file_path\": \"Code/trunk/cpp/test/general.hpp\",\n \"rank\": 91,\n \"score\": 201722.97626992513\n },\n {\n \"content\": \"class Iterator : public iterator< typename iterator_traits<Iter>::iterator_category,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::value_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::difference_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::pointer,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::reference >\\n\\n{\\n\\npublic:\\n\\n\\t/// Type of unchecked-iterators we are using\\n\\n\\ttypedef Iter iterator_type;\\n\\n\\n\\n\\t/// Default constructor.\\n\\n\\tIterator() : mContainer(), mIter() { }\\n\\n\\t/// Constructor taking a container and an iterator into that container\\n\\n Iterator(const Cont& cont_in, const Iter& x) throw(IteratorOutOfRange)\\n\\n\\t\\t\\t: mContainer(addressof(cont_in)), mIter(x)\\n\\n\\t{ \\n\\n#ifndef NITERCHK\\n\\n\\t\\tif(mIter > mContainer->end() || mIter < mContainer->begin()-1)\\n\\n\\t\\t\\tthrow(IteratorOutOfRange(__LINE__, __FILE__));\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Misc/Iterator.hh\",\n \"rank\": 92,\n \"score\": 200121.63681158694\n },\n {\n \"content\": \"class GhostElement< Zone<OneD> > : public Zone<OneD>\\n\\n{\\n\\npublic:\\n\\n /// The ElementType, which for this specialization is always a ghost zone.\\n\\n typedef Zone<OneD> ElementType;\\n\\n /// The Id type for one-dimensional ghost zones.\\n\\n typedef GeomId< GhostElement< Zone<OneD> > > Id;\\n\\n \\n\\n /*! \\\\brief Constructor. Takes a \\\\c Zone and an \\\\c Id object.\\n\\n * \\n\\n * Constructor. This constructor takes a \\\\c Zone and an \\\\c Id object.\\n\\n * This constructor ensures that the ghost zone has the same length\\n\\n * as the ghosted zone.\\n\\n * \\\\param[in] zone_in The \\\\c Zone we are ghosting.\\n\\n * \\\\param[in] id_in The \\\\c Id number for this ghost zone. */\\n\\n GhostElement(const Zone<OneD>& zone_in, const Id& id_in)\\n\\n : Zone<OneD>( Zone<OneD>::Id( id_in.idNumber() ), \\n\\n zone_in.length(), zone_in.area() ),\\n\\n mGhostedElement( addressof( zone_in ) )\\n\\n { }\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/GhostElement.hh\",\n \"rank\": 93,\n \"score\": 198643.9631391678\n },\n {\n \"content\": \"class Iterator : public iterator< typename iterator_traits<Iter>::iterator_category,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::value_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::difference_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::pointer,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::reference >\\n\\n{\\n\\npublic:\\n\\n\\t/// Type of unchecked-iterators we are using\\n\\n\\ttypedef Iter iterator_type;\\n\\n\\n\\n\\t/// Default constructor.\\n\\n\\tIterator() : mContainer(), mIter() { }\\n\\n\\t/// Constructor taking a container and an iterator into that container\\n\\n Iterator(const Cont& cont_in, const Iter& x) throw(IteratorOutOfRange)\\n\\n\\t\\t\\t: mContainer(addressof(cont_in)), mIter(x)\\n\\n\\t{ \\n\\n#ifndef NITERCHK\\n\\n\\t\\tif(mIter > mContainer->end() || mIter < mContainer->begin()-1)\\n\\n\\t\\t\\tthrow(IteratorOutOfRange(__LINE__, __FILE__));\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/OldGeometry/cpp/Misc/Iterator.hh\",\n \"rank\": 94,\n \"score\": 197981.79473327936\n },\n {\n \"content\": \"class Iterator : public iterator< typename iterator_traits<Iter>::iterator_category,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::value_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::difference_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::pointer,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::reference >\\n\\n{\\n\\npublic:\\n\\n\\t/// Type of unchecked-iterators we are using\\n\\n\\ttypedef Iter iterator_type;\\n\\n\\n\\n\\t/// Default constructor.\\n\\n\\tIterator() : mContainer(), mIter() { }\\n\\n\\t/// Constructor taking a container and an iterator into that container\\n\\n Iterator(const Cont& cont_in, const Iter& x) throw(IteratorOutOfRange)\\n\\n\\t\\t\\t: mContainer(addressof(cont_in)), mIter(x)\\n\\n\\t{ \\n\\n#ifndef NITERCHK\\n\\n\\t\\tif(mIter > mContainer->end() || mIter < mContainer->begin()-1)\\n\\n\\t\\t\\tthrow(IteratorOutOfRange(__LINE__, __FILE__));\\n\\n#endif\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Misc/Iterator.hh\",\n \"rank\": 95,\n \"score\": 197981.79473327933\n },\n {\n \"content\": \"class ReverseIterator : public iterator< typename iterator_traits<Iter>::iterator_category,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::value_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::difference_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::pointer,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::reference >\\n\\n{\\n\\npublic:\\n\\n\\t/// Type of iterator we are reversing over\\n\\n typedef Iter iterator_type;\\n\\n\\n\\n\\t/// Default constructor\\n\\n ReverseIterator() : mIter() { }\\n\\n /// Constructor taking a forward iterator\\n\\n explicit ReverseIterator(const Iter& x) throw(IteratorOutOfRange)\\n\\n\\t\\t\\t: mIter(x)\\n\\n\\t{ }\\n\\n /// Constructor taking a reverse iterator\\n\\n template<typename Iter_2>\\n\\n ReverseIterator(const ReverseIterator<Iter_2>& iter_in)\\n\\n\\t\\t\\t: mIter(iter_in.base())\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Misc/ReverseIterator.hh\",\n \"rank\": 96,\n \"score\": 195903.42214125206\n },\n {\n \"content\": \"class DimensionConcept\\n\\n{\\n\\npublic:\\n\\n /// Alias the \\\\c dimension_type as a \\\\c DimensionType.\\n\\n typedef dimension_type DimensionType;\\n\\n /// Require the \\\\c DimensionType to provide a \\\\c type.\\n\\n typedef typename DimensionType::type type;\\n\\n /// Require the \\\\c DimensionType to provide a \\\\c value_type.\\n\\n typedef typename DimensionType::value_type value_type;\\n\\n\\n\\n /*! \\\\brief The constraints method tests that the \\\\c dimension_type \\n\\n * provides certain functionality. */\\n\\n void constraints()\\n\\n {\\n\\n function_requires< UnsignedIntegerConcept<value_type> >();\\n\\n \\n\\n BOOST_STATIC_ASSERT(DimensionType::value <= 3 \\n\\n && DimensionType::value != 0);\\n\\n }\\n\\n};\\n\\n\\n\\n/// @}\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Code/trunk/cpp/Geometry/CartesianMesh/Dimension.hh\",\n \"rank\": 97,\n \"score\": 195260.57098513894\n },\n {\n \"content\": \"/// \\\\brief The SweepIter class iterates over the zones in a sweep pattern.\\n\\n///\\n\\n/// The SweepIter class iterates over the zones in the correct order for a sweeping pattern\\n\\n/// given the streaming angle \\\\f$ \\\\mu \\\\f$.\\n\\nclass SweepIter : public iterator< std::bidirectional_iterator_tag, Zone >\\n\\n{\\n\\npublic:\\n\\n\\t/// Default constructor.\\n\\n\\tSweepIter()\\n\\n\\t: mMu(0), mCont(0), mIter() { }\\n\\n\\n\\n\\t/// Constructor taking an angle, a reference to the zone container, and a const_iterator.\\n\\n SweepIter(double mu, const vector<Zone>& cont_in, const vector<Zone>::const_iterator iter_in)\\n\\n : mMu(mu), mCont( addressof(cont_in) ), mIter(iter_in) { }\\n\\n \\n\\n /// Copy constructor\\n\\n SweepIter(const SweepIter& iter_in)\\n\\n : mMu(iter_in.mMu), mCont( iter_in.mCont ), mIter(iter_in.mIter) { }\\n\\n \\n\\n /// Retrieve the iterator into the zone vector\\n\\n const vector<Zone>::const_iterator& iterator() const { return mIter; }\\n\\n /// Retrieve the container\\n\\n const vector<Zone>& container() const { return *mCont; }\\n\\n /// Retrieve the angle\\n\",\n \"file_path\": \"Code/branches/PHYSOR/cpp/Geometry/OneDMesh/SweepIter.hh\",\n \"rank\": 98,\n \"score\": 194696.877464734\n },\n {\n \"content\": \"class ReverseIterator : public iterator< typename iterator_traits<Iter>::iterator_category,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::value_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::difference_type,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::pointer,\\n\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t typename iterator_traits<Iter>::reference >\\n\\n{\\n\\npublic:\\n\\n\\t/// Type of iterator we are reversing over\\n\\n typedef Iter iterator_type;\\n\\n\\n\\n\\t/// Default constructor\\n\\n ReverseIterator() : mIter() { }\\n\\n /// Constructor taking a forward iterator\\n\\n explicit ReverseIterator(const Iter& x) throw(IteratorOutOfRange)\\n\\n\\t\\t\\t: mIter(x)\\n\\n\\t{ }\\n\\n /// Constructor taking a reverse iterator\\n\\n template<typename Iter_2>\\n\\n ReverseIterator(const ReverseIterator<Iter_2>& iter_in)\\n\\n\\t\\t\\t: mIter(iter_in.base())\\n\",\n \"file_path\": \"Code/branches/Pre-Prospectus/cpp/Misc/ReverseIterator.hh\",\n \"rank\": 99,\n \"score\": 193883.90786479716\n }\n]","isConversational":false}}},{"rowIdx":486,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"OpenSees/SRC/element/PFEMElement/TclModelBuilder_addPFEMElement.cpp"},"repo_name":{"kind":"string","value":"kuanshi/ductile-fracture"},"commit":{"kind":"string","value":"ccb350564df54f5c5ec3a079100effe261b46650"},"file_code":{"kind":"string","value":"#include \"TclModelBuilder_addPFEMElement.h\"\n#include \"PFEMElement2D.h\"\n#include \"PFEMElement2DFIC.h\"\n#include \"PFEMElement2DCompressible.h\"\n#include \"PFEMElement2DBubble.h\"\n#include \"PFEMElement2Dmini.h\"\n#include \"PFEMElement3D.h\"\n#include <cstring>\n#include <string>\n\nint\nTclModelBuilder_addPFEMElement2D(ClientData clientData, Tcl_Interp *interp,\n int argc, TCL_Char **argv,\n Domain *theDomain,\n TclModelBuilder *theBuilder)\n{\n \n if(argc < 11) {\n opserr << \"Invalid #args: want element PFEMElement2D tag\";\n opserr << \"nd1 nd2 nd3 type rho mu b1 b2 <thickness kappa>\\n\";\n return TCL_ERROR;\n }\n int loc = 2;\n int tag;\n if(Tcl_GetInt(interp, argv[loc], &tag) != TCL_OK) {\n opserr<< \"WARNING invalid tag \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd1;\n if(Tcl_GetInt(interp, argv[loc], &nd1) != TCL_OK) {\n opserr<< \"WARNING invalid nd1 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd2;\n if(Tcl_GetInt(interp, argv[loc], &nd2) != TCL_OK) {\n opserr<< \"WARNING invalid nd2 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd3;\n if(Tcl_GetInt(interp, argv[loc], &nd3) != TCL_OK) {\n opserr<< \"WARNING invalid nd3 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int type = -1;\n if(strcmp(argv[loc], \"FIC\")==0 || strcmp(argv[loc], \"fic\")==0\n || strcmp(argv[loc], \"Fic\")==0) {\n type = 0;\n } else if(strcmp(argv[loc], \"quasi-incompressible\")==0\n || strcmp(argv[loc], \"Quasi-Incompressible\")==0) {\n type = 1;\n } else if(strcmp(argv[loc], \"bubble\")==0\n || strcmp(argv[loc], \"Bubble\")==0) {\n type = 2;\n } else if(strcmp(argv[loc], \"mini\")==0\n || strcmp(argv[loc], \"Mini\")==0) {\n type = 3;\n } else {\n opserr<<\"WARNNG: unknown type for PFEMElement2D \\n\";\n return TCL_ERROR;\n }\n loc++;\n double rho;\n if(Tcl_GetDouble(interp, argv[loc], &rho) != TCL_OK) {\n opserr<< \"WARNING invalid rho \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double mu;\n if(Tcl_GetDouble(interp, argv[loc], &mu) != TCL_OK) {\n opserr<< \"WARNING invalid mu \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b1;\n if(Tcl_GetDouble(interp, argv[loc], &b1) != TCL_OK) {\n opserr<< \"WARNING invalid b1 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b2;\n if(Tcl_GetDouble(interp, argv[loc], &b2) != TCL_OK) {\n opserr<< \"WARNING invalid b2 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double thickness = 1.0;\n if(argc > loc) {\n if(Tcl_GetDouble(interp, argv[loc], &thickness) != TCL_OK) {\n opserr<< \"WARNING invalid thickness \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n double kappa = 2.2e9;\n if(argc > loc) {\n if(Tcl_GetDouble(interp, argv[loc], &kappa) != TCL_OK) {\n opserr<< \"WARNING invalid kappa \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n int lumped = 0;\n if(argc > loc) {\n if(Tcl_GetInt(interp, argv[loc], &lumped) != TCL_OK) {\n opserr<< \"WARNING invalid lumped \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n int checkJ = 0;\n if(argc > loc) {\n if(Tcl_GetInt(interp, argv[loc], &checkJ) != TCL_OK) {\n opserr<< \"WARNING invalid checkJ \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n\n \n Element* ele = 0;\n if(type == 0) {\n ele = new PFEMElement2DFIC(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness);\n } else if(type == 1) {\n ele = new PFEMElement2DCompressible(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness,kappa);\n } else if(type == 2) {\n ele = new PFEMElement2DBubble(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness,kappa);\n } else if(type == 3) {\n ele = new PFEMElement2Dmini(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness,kappa,lumped,checkJ);\n }\n if (ele == 0) {\n opserr << \"WARNING ran out of memory creating element\\n\";\n opserr << \"element: \" << tag << endln;\n return TCL_ERROR;\n }\n\n if (theDomain->addElement(ele) == false) {\n opserr << \"WARNING failed to add element to the domain\\n\";\n opserr << \"element: \" << tag << endln;\n delete ele; \n return TCL_ERROR;\n }\n\n return TCL_OK;\n}\n\nint\nTclModelBuilder_addPFEMElement3D(ClientData clientData, Tcl_Interp *interp,\n int argc, TCL_Char **argv,\n Domain *theDomain,\n TclModelBuilder *theBuilder)\n{\n \n if(argc < 13) {\n opserr << \"Invalid #args: want element PFEMElement3D \";\n opserr << \"tag nd1 nd2 nd3 nd4 type rho mu b1 b2 b3 <kappa lumped checkJ>\\n\";\n return TCL_ERROR;\n }\n\n int loc = 2;\n \n int tag;\n if(Tcl_GetInt(interp, argv[loc], &tag) != TCL_OK) {\n opserr<< \"WARNING invalid tag \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd1;\n if(Tcl_GetInt(interp, argv[loc], &nd1) != TCL_OK) {\n opserr<< \"WARNING invalid nd1 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd2;\n if(Tcl_GetInt(interp, argv[loc], &nd2) != TCL_OK) {\n opserr<< \"WARNING invalid nd2 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd3;\n if(Tcl_GetInt(interp, argv[loc], &nd3) != TCL_OK) {\n opserr<< \"WARNING invalid nd3 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd4;\n if(Tcl_GetInt(interp, argv[loc], &nd4) != TCL_OK) {\n opserr<< \"WARNING invalid nd4 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n std::string type = argv[loc];\n loc++;\n double rho;\n if(Tcl_GetDouble(interp, argv[loc], &rho) != TCL_OK) {\n opserr<< \"WARNING invalid rho \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double mu;\n if(Tcl_GetDouble(interp, argv[loc], &mu) != TCL_OK) {\n opserr<< \"WARNING invalid mu \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b1;\n if(Tcl_GetDouble(interp, argv[loc], &b1) != TCL_OK) {\n opserr<< \"WARNING invalid b1 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b2;\n if(Tcl_GetDouble(interp, argv[loc], &b2) != TCL_OK) {\n opserr<< \"WARNING invalid b2 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b3;\n if(Tcl_GetDouble(interp, argv[loc], &b3) != TCL_OK) {\n opserr<< \"WARNING invalid b3 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double kappa = 2.2e9;\n if(argc > loc) {\n\tif(Tcl_GetDouble(interp, argv[loc], &kappa) != TCL_OK) {\n\t opserr<<\"WARNING invalid kappa \"<<argv[loc]<<\": element PFEMElement3D\\n\";\n\t return TCL_ERROR;\n\t}\n\tloc++;\n }\n int lumped = 0;\n if(argc > loc) {\n\tif(Tcl_GetInt(interp, argv[loc], &lumped) != TCL_OK) {\n\t opserr<<\"WARNING invalid lumped \"<<argv[loc]<<\": element PFEMElement3D\\n\";\n\t return TCL_ERROR;\n\t}\n\tloc++;\n }\n int check = 0;\n if(argc > loc) {\n\tif(Tcl_GetInt(interp, argv[loc], &check) != TCL_OK) {\n\t opserr<<\"WARNING invalid check \"<<argv[loc]<<\": element PFEMElement3D\\n\";\n\t return TCL_ERROR;\n\t}\n\tloc++;\n }\n\n \n Element* ele = 0;\n if(type == \"pressuregradient\" || type == \"PressureGradient\") {\n ele = new PFEMElement3D(tag,nd1,nd2,nd3,nd4,rho,mu,b1,b2,b3);\n } else {\n\topserr<<\"element PFEMElement3D type \"<<type.c_str()<<\" is not known\\n\";\n\treturn TCL_ERROR;\n }\n\n if (ele == 0) {\n opserr << \"WARNING ran out of memory creating element\\n\";\n opserr << \"element: \" << tag << endln;\n return TCL_ERROR;\n }\n\n if (theDomain->addElement(ele) == false) {\n opserr << \"WARNING failed to add element to the domain\\n\";\n opserr << \"element: \" << tag << endln;\n delete ele; \n return TCL_ERROR;\n }\n\n return TCL_OK;\n}\n"},"prefix":{"kind":"string","value":"#include \"TclModelBuilder_addPFEMElement.h\"\n#include \"PFEMElement2D.h\"\n#include \"PFEMElement2DFIC.h\"\n#include \"PFEMElement2DCompressible.h\"\n#include \"PFEMElement2DBubble.h\"\n#include \"PFEMElement2Dmini.h\"\n#include \"PFEMElement3D.h\"\n#include <cstring>\n#include <string>\n\n"},"suffix":{"kind":"string","value":"\n\nint\nTclModelBuilder_addPFEMElement3D(ClientData clientData, Tcl_Interp *interp,\n int argc, TCL_Char **argv,\n Domain *theDomain,\n TclModelBuilder *theBuilder)\n{\n \n if(argc < 13) {\n opserr << \"Invalid #args: want element PFEMElement3D \";\n opserr << \"tag nd1 nd2 nd3 nd4 type rho mu b1 b2 b3 <kappa lumped checkJ>\\n\";\n return TCL_ERROR;\n }\n\n int loc = 2;\n \n int tag;\n if(Tcl_GetInt(interp, argv[loc], &tag) != TCL_OK) {\n opserr<< \"WARNING invalid tag \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd1;\n if(Tcl_GetInt(interp, argv[loc], &nd1) != TCL_OK) {\n opserr<< \"WARNING invalid nd1 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd2;\n if(Tcl_GetInt(interp, argv[loc], &nd2) != TCL_OK) {\n opserr<< \"WARNING invalid nd2 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd3;\n if(Tcl_GetInt(interp, argv[loc], &nd3) != TCL_OK) {\n opserr<< \"WARNING invalid nd3 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd4;\n if(Tcl_GetInt(interp, argv[loc], &nd4) != TCL_OK) {\n opserr<< \"WARNING invalid nd4 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n std::string type = argv[loc];\n loc++;\n double rho;\n if(Tcl_GetDouble(interp, argv[loc], &rho) != TCL_OK) {\n opserr<< \"WARNING invalid rho \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double mu;\n if(Tcl_GetDouble(interp, argv[loc], &mu) != TCL_OK) {\n opserr<< \"WARNING invalid mu \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b1;\n if(Tcl_GetDouble(interp, argv[loc], &b1) != TCL_OK) {\n opserr<< \"WARNING invalid b1 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b2;\n if(Tcl_GetDouble(interp, argv[loc], &b2) != TCL_OK) {\n opserr<< \"WARNING invalid b2 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b3;\n if(Tcl_GetDouble(interp, argv[loc], &b3) != TCL_OK) {\n opserr<< \"WARNING invalid b3 \"<< argv[loc] << \": element PFEMElement3D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double kappa = 2.2e9;\n if(argc > loc) {\n\tif(Tcl_GetDouble(interp, argv[loc], &kappa) != TCL_OK) {\n\t opserr<<\"WARNING invalid kappa \"<<argv[loc]<<\": element PFEMElement3D\\n\";\n\t return TCL_ERROR;\n\t}\n\tloc++;\n }\n int lumped = 0;\n if(argc > loc) {\n\tif(Tcl_GetInt(interp, argv[loc], &lumped) != TCL_OK) {\n\t opserr<<\"WARNING invalid lumped \"<<argv[loc]<<\": element PFEMElement3D\\n\";\n\t return TCL_ERROR;\n\t}\n\tloc++;\n }\n int check = 0;\n if(argc > loc) {\n\tif(Tcl_GetInt(interp, argv[loc], &check) != TCL_OK) {\n\t opserr<<\"WARNING invalid check \"<<argv[loc]<<\": element PFEMElement3D\\n\";\n\t return TCL_ERROR;\n\t}\n\tloc++;\n }\n\n \n Element* ele = 0;\n if(type == \"pressuregradient\" || type == \"PressureGradient\") {\n ele = new PFEMElement3D(tag,nd1,nd2,nd3,nd4,rho,mu,b1,b2,b3);\n } else {\n\topserr<<\"element PFEMElement3D type \"<<type.c_str()<<\" is not known\\n\";\n\treturn TCL_ERROR;\n }\n\n if (ele == 0) {\n opserr << \"WARNING ran out of memory creating element\\n\";\n opserr << \"element: \" << tag << endln;\n return TCL_ERROR;\n }\n\n if (theDomain->addElement(ele) == false) {\n opserr << \"WARNING failed to add element to the domain\\n\";\n opserr << \"element: \" << tag << endln;\n delete ele; \n return TCL_ERROR;\n }\n\n return TCL_OK;\n}\n"},"middle":{"kind":"string","value":"int\nTclModelBuilder_addPFEMElement2D(ClientData clientData, Tcl_Interp *interp,\n int argc, TCL_Char **argv,\n Domain *theDomain,\n TclModelBuilder *theBuilder)\n{\n \n if(argc < 11) {\n opserr << \"Invalid #args: want element PFEMElement2D tag\";\n opserr << \"nd1 nd2 nd3 type rho mu b1 b2 <thickness kappa>\\n\";\n return TCL_ERROR;\n }\n int loc = 2;\n int tag;\n if(Tcl_GetInt(interp, argv[loc], &tag) != TCL_OK) {\n opserr<< \"WARNING invalid tag \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd1;\n if(Tcl_GetInt(interp, argv[loc], &nd1) != TCL_OK) {\n opserr<< \"WARNING invalid nd1 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd2;\n if(Tcl_GetInt(interp, argv[loc], &nd2) != TCL_OK) {\n opserr<< \"WARNING invalid nd2 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int nd3;\n if(Tcl_GetInt(interp, argv[loc], &nd3) != TCL_OK) {\n opserr<< \"WARNING invalid nd3 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n int type = -1;\n if(strcmp(argv[loc], \"FIC\")==0 || strcmp(argv[loc], \"fic\")==0\n || strcmp(argv[loc], \"Fic\")==0) {\n type = 0;\n } else if(strcmp(argv[loc], \"quasi-incompressible\")==0\n || strcmp(argv[loc], \"Quasi-Incompressible\")==0) {\n type = 1;\n } else if(strcmp(argv[loc], \"bubble\")==0\n || strcmp(argv[loc], \"Bubble\")==0) {\n type = 2;\n } else if(strcmp(argv[loc], \"mini\")==0\n || strcmp(argv[loc], \"Mini\")==0) {\n type = 3;\n } else {\n opserr<<\"WARNNG: unknown type for PFEMElement2D \\n\";\n return TCL_ERROR;\n }\n loc++;\n double rho;\n if(Tcl_GetDouble(interp, argv[loc], &rho) != TCL_OK) {\n opserr<< \"WARNING invalid rho \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double mu;\n if(Tcl_GetDouble(interp, argv[loc], &mu) != TCL_OK) {\n opserr<< \"WARNING invalid mu \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b1;\n if(Tcl_GetDouble(interp, argv[loc], &b1) != TCL_OK) {\n opserr<< \"WARNING invalid b1 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double b2;\n if(Tcl_GetDouble(interp, argv[loc], &b2) != TCL_OK) {\n opserr<< \"WARNING invalid b2 \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n loc++;\n double thickness = 1.0;\n if(argc > loc) {\n if(Tcl_GetDouble(interp, argv[loc], &thickness) != TCL_OK) {\n opserr<< \"WARNING invalid thickness \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n double kappa = 2.2e9;\n if(argc > loc) {\n if(Tcl_GetDouble(interp, argv[loc], &kappa) != TCL_OK) {\n opserr<< \"WARNING invalid kappa \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n int lumped = 0;\n if(argc > loc) {\n if(Tcl_GetInt(interp, argv[loc], &lumped) != TCL_OK) {\n opserr<< \"WARNING invalid lumped \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n int checkJ = 0;\n if(argc > loc) {\n if(Tcl_GetInt(interp, argv[loc], &checkJ) != TCL_OK) {\n opserr<< \"WARNING invalid checkJ \"<< argv[loc] << \": element PFEMElement2D\\n\";\n return TCL_ERROR;\n }\n }\n loc++;\n\n \n Element* ele = 0;\n if(type == 0) {\n ele = new PFEMElement2DFIC(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness);\n } else if(type == 1) {\n ele = new PFEMElement2DCompressible(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness,kappa);\n } else if(type == 2) {\n ele = new PFEMElement2DBubble(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness,kappa);\n } else if(type == 3) {\n ele = new PFEMElement2Dmini(tag,nd1,nd2,nd3,rho,mu,b1,b2,thickness,kappa,lumped,checkJ);\n }\n if (ele == 0) {\n opserr << \"WARNING ran out of memory creating element\\n\";\n opserr << \"element: \" << tag << endln;\n return TCL_ERROR;\n }\n\n if (theDomain->addElement(ele) == false) {\n opserr << \"WARNING failed to add element to the domain\\n\";\n opserr << \"element: \" << tag << endln;\n delete ele; \n return TCL_ERROR;\n }\n\n return TCL_OK;\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":" CONST char *string;\t\t/* Last string passed to Tcl_RegExpExec. */\n","file_path":"OpenSees/SRC/tcl/include/tclRegexp.h","rank":0,"score":183596.33256221714},{"content":" public TypedIOPort string;\n","file_path":"OpenSees/SRC/java/kepler/opensees/StringToDouble.java","rank":1,"score":142280.66572606767},{"content":"// A first class string type\n\nclass String {\n\npublic:\n\n // Constructors and destructor\n\n String(const char s[] = \"\"); // Constructs a deep copy of a C-string.\n\n // ASSUME: s is a valid C-string.\n\n String(const String& s); // Constructs a deep copy of s.\n\n ~String(); // Deallocates String memory. \n\n\n\n // Assignment operators\n\n String& operator= (const String& rhs); // Assigns a deep copy of rhs. \n\n String& operator+= (const String& rhs); // Adds a deep copy of rhs on the\n\n // end of this string.\n\n\n\n char& operator[](int i); // The element at subscript i. \n\n // ASSUME: i < length of the string\n\n char operator[](int i) const; // The element at subscript i.\n\n // ASSUME: i < length of the string\n\n\n\n int length() const; // Number of string characters.\n\n const char* charString( ) const; // C-String equivalent value.\n","file_path":"OpenSees/SRC/string/G3string.h","rank":2,"score":133760.52760907522},{"content":" char cursorString[20]; /* Used to store a cursor id string. */\n","file_path":"OpenSees/SRC/tcl/include/tkInt.h","rank":3,"score":124516.9943262054},{"content":"char *string;\n","file_path":"OpenSees/OTHER/Triangle/showme.c","rank":4,"score":124115.46963219905},{"content":"class StringContainer\n\n{\n\n public:\n\n StringContainer();\n\n ~StringContainer();\n\n int addString(const char *);\n\n const char *getString(int) const;\n\n const char *operator()(void);\n\n int getNumStrings() const;\n\n void clear(void);\n\n\n\n private:\n\n char **strings;\n\n int numStrings;\n\n};\n\n\n\n#endif\n","file_path":"OpenSees/DEVELOPER/core/StringContainer.h","rank":5,"score":84974.61283075646},{"content":"class StringContainer\n\n{\n\n public:\n\n StringContainer();\n\n ~StringContainer();\n\n int addString(const char *);\n\n const char *getString(int) const;\n\n const char *operator()(void);\n\n int getNumStrings() const;\n\n void clear(void);\n\n\n\n private:\n\n char **strings;\n\n int numStrings;\n\n};\n\n\n\n#endif\n","file_path":"OpenSees/SRC/utility/StringContainer.h","rank":6,"score":84974.61283075646},{"content":"public class StringToDouble extends TypedAtomicActor {\n\n\n\n /** Construct an actor with the given container and name.\n\n * @param container The container.\n\n * @param name The name of this actor.\n\n * @exception IllegalActionException If the actor cannot be contained\n\n * by the proposed container.\n\n * @exception NameDuplicationException If the container already has an\n\n * actor with this name.\n\n */\n\n public StringToDouble(CompositeEntity container, String name)\n\n throws NameDuplicationException, IllegalActionException {\n\n super(container, name);\n\n\n\n string = new TypedIOPort(this, \"string\", true, false);\n\n string.setTypeEquals(BaseType.STRING);\n\n\n\n doublePort = new TypedIOPort(this, \"double\", false, true);\n\n doublePort.setTypeEquals(BaseType.DOUBLE);\n\n }\n\n\n\n ///////////////////////////////////////////////////////////////////\n\n //// public variables ////\n\n\n\n /** The input port, which has type <i>string</i>. */\n\n public TypedIOPort string;\n\n /** The output port, which has type <i>int</i>. */\n\n public TypedIOPort doublePort;\n\n\n\n ///////////////////////////////////////////////////////////////////\n\n //// public methods ////\n\n\n\n /** Consume one string token on the input port and produce a new\n\n * integer token on the output port.\n\n * @exception IllegalActionException If there is no direc/restor.\n\n */\n\n public void fire() throws IllegalActionException {\n\n super.fire();\n\n String _input = ((StringToken)string.get(0)).stringValue();\n\n Double _output = new Double(_input);\n\n doublePort.send(0, new DoubleToken(_output.doubleValue()));\n\n }\n\n\n\n ///////////////////////////////////////////////////////////////////\n\n //// protected members ////\n\n\n\n ///////////////////////////////////////////////////////////////////\n\n //// private methods ////\n\n\n\n ///////////////////////////////////////////////////////////////////\n\n //// private members ////\n","file_path":"OpenSees/SRC/java/kepler/opensees/StringToDouble.java","rank":7,"score":77843.71757651746},{"content":" public void fire() throws IllegalActionException {\n\n super.fire();\n\n String _input = ((StringToken)string.get(0)).stringValue();\n\n Double _output = new Double(_input);\n\n doublePort.send(0, new DoubleToken(_output.doubleValue()));\n","file_path":"OpenSees/SRC/java/kepler/opensees/StringToDouble.java","rank":8,"score":76919.01572625934},{"content":" public TypedIOPort doublePort;\n","file_path":"OpenSees/SRC/java/kepler/opensees/StringToDouble.java","rank":9,"score":76010.39361000105},{"content":"#ifndef _PLSTRING_H\n\n#define _PLSTRING_H\n\n\n\n#include <OPS_Stream.h>\n\n#include <iostream>\n\nusing std::istream;\n\n\n\n// A first class string type\n","file_path":"OpenSees/SRC/string/G3string.h","rank":10,"score":73627.54508229624},{"content":"\n\n // Comparison operators\n\n friend bool operator== (const String& s, const String& t);\n\n friend bool operator!= (const String& s, const String& t);\n\n friend bool operator< (const String& s, const String& t);\n\n friend bool operator<= (const String& s, const String& t);\n\n friend bool operator> (const String& s, const String& t);\n\n friend bool operator>= (const String& s, const String& t);\n\n\n\n friend OPS_Stream& operator<<(OPS_Stream& out, const String& s);\n\n // Writes the C-string equivalent to out.\n\n friend istream& operator>> (istream& in, String & s); \n\n // Reads at most 999 characters up to the next newline from \n\n // from in. The newline is extracted but not assigned. \n\n friend String operator+(const String& s, const String& t); \n\n // A deep copy of s with a deep copy of t appended to the end.\n\n\n\nprivate:\n\n char* info_;\n\n};\n\n\n\n#endif\n\n\n","file_path":"OpenSees/SRC/string/G3string.h","rank":11,"score":73621.89695457976},{"content":"#include <string.h>\n\n#include \"G3string.h\"\n\n\n\nString::String(const char s[])\n\n{\n\n info_ = new char[strlen(s) + 1]; // Leave room for the '\\0'. \n\n strcpy(info_, s); // Copy from s to info.\n\n}\n\n\n\nString::String(const String& s)\n\n{\n\n info_ = new char[strlen(s.info_) + 1]; // Allocate memory for the copy.\n\n strcpy(info_, s.info_); // Copy the argument's characters.\n\n}\n\n\n\nString::~String( )\n\n{\n\n delete [] info_; // Deallocate the array.\n\n}\n\n\n","file_path":"OpenSees/SRC/string/G3string.cpp","rank":12,"score":71995.1347847162},{"content":"{ \n\n return info_;\n\n}\n\n\n\nOPS_Stream& operator<< (OPS_Stream& out, const String& s)\n\n{\n\n out << s.charString();\n\n return out;\n\n}\n\n\n\nistream& operator>> (istream& in, String& s) \n\n{\n\n char buffer[1000]; // Buffer to store the stream characters\n\n in.getline(buffer,1000,'\\n'); // Remove up to 999 characters from in, \n\n // up to and including first occurrence \n\n // of '\\n'. Store all but '\\n' in the \n\n // buffer; terminate the buffer with '\\0'. \n\n s = String(buffer); // Create a new String from the buffer and\n\n // assign it to s.\n\n return in;\n","file_path":"OpenSees/SRC/string/G3string.cpp","rank":13,"score":71993.07109604166},{"content":"// $Revision: 1.1 $\n\n// $Date: 2006-11-08 20:06:10 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.h,v $\n\n \n\n// Written: fmk \n\n// Created: 11/06\n\n//\n\n// Description: This file contains the class definition for StringContainer.\n\n// StringContainer is used to store information about a simulation; this\n\n// includes start and end times; program version, files opened for reading, files\n\n// opened for writing, and all parameters used (specified with pset or -par option\n\n// to program)\n\n//\n\n// What: \"@(#) StringContainer.h, revA\"\n\n\n\n#ifndef StringContainer_h\n\n#define StringContainer_h\n\n\n","file_path":"OpenSees/DEVELOPER/core/StringContainer.h","rank":14,"score":71992.31031253589},{"content":"// $Revision: 1.1 $\n\n// $Date: 2006-11-08 20:06:10 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.h,v $\n\n \n\n// Written: fmk \n\n// Created: 11/06\n\n//\n\n// Description: This file contains the class definition for StringContainer.\n\n// StringContainer is used to store information about a simulation; this\n\n// includes start and end times; program version, files opened for reading, files\n\n// opened for writing, and all parameters used (specified with pset or -par option\n\n// to program)\n\n//\n\n// What: \"@(#) StringContainer.h, revA\"\n\n\n\n#ifndef StringContainer_h\n\n#define StringContainer_h\n\n\n","file_path":"OpenSees/SRC/utility/StringContainer.h","rank":15,"score":71992.31031253589},{"content":"}\n\n\n\nString operator+ (const String& s, const String& t)\n\n{\n\n String temp(s); // temp is a copy of s.\n\n temp += t; // Add t to the end of temp.\n\n return temp; \n\n}\n\n\n\nchar& String::operator[](int i)\n\n{\n\n return info_[i];\n\n} \n\n\n\nchar String::operator[](int i) const\n\n{\n\n return info_[i];\n\n} \n\n\n\nconst char* String::charString() const \n","file_path":"OpenSees/SRC/string/G3string.cpp","rank":16,"score":71987.6470613427},{"content":"}\n\n\n\nint String::length() const\n\n{\n\n return strlen(info_); \n\n}\n\n\n\nbool operator== (const String& s, const String& t)\n\n{\n\n return strcmp(s.info_,t.info_) == 0;\n\n}\n\n\n\nbool operator!= (const String& s, const String& t)\n\n{\n\n return strcmp(s.info_,t.info_) != 0;\n\n}\n\n\n\nbool operator< (const String& s, const String& t)\n\n{\n\n return strcmp(s.info_,t.info_) < 0;\n","file_path":"OpenSees/SRC/string/G3string.cpp","rank":17,"score":71987.54157057192},{"content":"}\n\n\n\nbool operator<= (const String& s, const String& t)\n\n{\n\n return strcmp(s.info_,t.info_) <= 0;\n\n}\n\n\n\nbool operator> (const String& s, const String& t)\n\n{\n\n return strcmp(s.info_,t.info_) > 0;\n\n}\n\n\n\nbool operator>= (const String& s, const String& t)\n\n{\n\n return strcmp(s.info_,t.info_) >= 0;\n\n}\n\n\n\n\n","file_path":"OpenSees/SRC/string/G3string.cpp","rank":18,"score":71987.50188620813},{"content":"String& String::operator= (const String& rhs) \n\n{\n\n if (this != &rhs) { // Cover the case of s = s.\n\n delete [] info_; // Deallocate the old buffer.\n\n info_ = new char[strlen(rhs.info_) +1];// Allocate memory for a new one.\n\n strcpy(info_, rhs.info_); // Copy the characters from the\n\n } // right side to the left\n\n return *this; // Return this object.\n\n} \n\n\n\nString& String::operator+= (const String& s)\n\n{\n\n char* temp = new char[strlen(info_) + strlen(s.info_) + 1]; // Create a new \n\n // array to hold the two string arrays.\n\n strcpy(temp,info_); // Copy the characters from this array into temp. \n\n strcat(temp,s.info_); // Then copy the characters of s.info_ into temp. \n\n\n\n delete [] info_; // Replace the old value for info_ by temp.\n\n info_ = temp;\n\n return *this;\n","file_path":"OpenSees/SRC/string/G3string.cpp","rank":19,"score":71986.77143283008},{"content":"/* ****************************************************************** **\n\n** OpenSees - Open System for Earthquake Engineering Simulation **\n\n** Pacific Earthquake Engineering Research Center **\n\n** **\n\n** **\n\n** (C) Copyright 1999, The Regents of the University of California **\n\n** All Rights Reserved. **\n\n** **\n\n** Commercial use of this program without express permission of the **\n\n** University of California, Berkeley, is strictly prohibited. See **\n\n** file 'COPYRIGHT' in main directory for information on usage and **\n\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\n\n** **\n\n** Developed by: **\n\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\n\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\n\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\n\n** **\n\n** ****************************************************************** */\n\n \n","file_path":"OpenSees/SRC/utility/StringContainer.h","rank":20,"score":71977.55218514844},{"content":"/* ****************************************************************** **\n\n** OpenSees - Open System for Earthquake Engineering Simulation **\n\n** Pacific Earthquake Engineering Research Center **\n\n** **\n\n** **\n\n** (C) Copyright 1999, The Regents of the University of California **\n\n** All Rights Reserved. **\n\n** **\n\n** Commercial use of this program without express permission of the **\n\n** University of California, Berkeley, is strictly prohibited. See **\n\n** file 'COPYRIGHT' in main directory for information on usage and **\n\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\n\n** **\n\n** Developed by: **\n\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\n\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\n\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\n\n** **\n\n** ****************************************************************** */\n\n \n","file_path":"OpenSees/DEVELOPER/core/StringContainer.h","rank":21,"score":71977.55218514844},{"content":"// $Revision: 1.1 $\n\n// $Date: 2006-11-08 20:06:10 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.cpp,v $\n\n//\n\n// Description: This file contains the class definition for StringContainer.\n\n// SimulationInformation is a stopwatch.\n\n//\n\n// What: \"@(#) SimulationContainer.h, revA\"\n\n\n\n\n\n\n\n#include<StringContainer.h>\n\n#include <OPS_Globals.h>\n\n#include <string.h>\n\n#include <time.h>\n\n#include <math.h>\n\n\n\nStringContainer::StringContainer()\n\n :strings(0), numStrings(0)\n\n{\n","file_path":"OpenSees/DEVELOPER/core/StringContainer.cpp","rank":22,"score":70433.48728426412},{"content":"// $Revision: 1.1 $\n\n// $Date: 2006-11-08 20:06:10 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.cpp,v $\n\n//\n\n// Description: This file contains the class definition for StringContainer.\n\n// SimulationInformation is a stopwatch.\n\n//\n\n// What: \"@(#) SimulationContainer.h, revA\"\n\n\n\n\n\n\n\n#include<StringContainer.h>\n\n#include <OPS_Globals.h>\n\n#include <string.h>\n\n#include <time.h>\n\n#include <math.h>\n\n\n\nStringContainer::StringContainer()\n\n :strings(0), numStrings(0)\n\n{\n","file_path":"OpenSees/SRC/utility/StringContainer.cpp","rank":23,"score":70433.48728426412},{"content":"{\n\n return numStrings;\n\n}\n\n\n\nvoid\n\nStringContainer::clear(void)\n\n{\n\n if (strings != 0) {\n\n for (int i=0; i<numStrings; i++)\n\n delete [] strings[i];\n\n delete [] strings;\n\n }\n\n\n\n numStrings = 0;\n\n strings = 0;\n\n}\n\n\n\nint \n\nStringContainer::addString(const char *theString)\n\n{\n","file_path":"OpenSees/SRC/utility/StringContainer.cpp","rank":24,"score":70424.731470809},{"content":"{\n\n return numStrings;\n\n}\n\n\n\nvoid\n\nStringContainer::clear(void)\n\n{\n\n if (strings != 0) {\n\n for (int i=0; i<numStrings; i++)\n\n delete [] strings[i];\n\n delete [] strings;\n\n }\n\n\n\n numStrings = 0;\n\n strings = 0;\n\n}\n\n\n\nint \n\nStringContainer::addString(const char *theString)\n\n{\n","file_path":"OpenSees/DEVELOPER/core/StringContainer.cpp","rank":25,"score":70424.731470809},{"content":" // if valid theString\n\n if (theString == 0) \n\n return 0;\n\n\n\n // create new array to hold pointers and copy pointers there\n\n char **nextStrings = new char *[numStrings+1];\n\n if (nextStrings == 0) \n\n return -2;\n\n\n\n for (int i=0; i<numStrings; i++)\n\n nextStrings[i] = strings[i];\n\n \n\n // create new pointer for new file name and add to end of array\n\n char *copyString = new char[strlen(theString)+1];\n\n if (copyString == 0)\n\n return -3;\n\n\n\n strcpy(copyString, theString);\n\n\n\n nextStrings[numStrings] = copyString;\n","file_path":"OpenSees/DEVELOPER/core/StringContainer.cpp","rank":26,"score":70424.69060921413},{"content":" // if valid theString\n\n if (theString == 0) \n\n return 0;\n\n\n\n // create new array to hold pointers and copy pointers there\n\n char **nextStrings = new char *[numStrings+1];\n\n if (nextStrings == 0) \n\n return -2;\n\n\n\n for (int i=0; i<numStrings; i++)\n\n nextStrings[i] = strings[i];\n\n \n\n // create new pointer for new file name and add to end of array\n\n char *copyString = new char[strlen(theString)+1];\n\n if (copyString == 0)\n\n return -3;\n\n\n\n strcpy(copyString, theString);\n\n\n\n nextStrings[numStrings] = copyString;\n","file_path":"OpenSees/SRC/utility/StringContainer.cpp","rank":27,"score":70424.69060921413},{"content":"}\n\n\n\nStringContainer::~StringContainer()\n\n{\n\n this->clear();\n\n}\n\n\n\n\n\nconst char *\n\nStringContainer::getString(int num) const\n\n{\n\n if (num >= 0 && num < numStrings)\n\n return strings[num];\n\n\n\n return 0;\n\n}\n\n\n\n\n\nint\n\nStringContainer::getNumStrings(void) const\n","file_path":"OpenSees/SRC/utility/StringContainer.cpp","rank":28,"score":70424.52746534465},{"content":"}\n\n\n\nStringContainer::~StringContainer()\n\n{\n\n this->clear();\n\n}\n\n\n\n\n\nconst char *\n\nStringContainer::getString(int num) const\n\n{\n\n if (num >= 0 && num < numStrings)\n\n return strings[num];\n\n\n\n return 0;\n\n}\n\n\n\n\n\nint\n\nStringContainer::getNumStrings(void) const\n","file_path":"OpenSees/DEVELOPER/core/StringContainer.cpp","rank":29,"score":70424.52746534465},{"content":"\n\n\n\n // delete old array and reset the array pointer\n\n if (strings != 0)\n\n delete [] strings;\n\n strings = nextStrings;\n\n \n\n // increment number of files\n\n numStrings++;\n\n\n\n // return ok\n\n return 0;\n\n}\n","file_path":"OpenSees/SRC/utility/StringContainer.cpp","rank":30,"score":70424.26545425721},{"content":"\n\n\n\n // delete old array and reset the array pointer\n\n if (strings != 0)\n\n delete [] strings;\n\n strings = nextStrings;\n\n \n\n // increment number of files\n\n numStrings++;\n\n\n\n // return ok\n\n return 0;\n\n}\n","file_path":"OpenSees/DEVELOPER/core/StringContainer.cpp","rank":31,"score":70424.26545425721},{"content":"/* ****************************************************************** **\n\n** OpenSees - Open System for Earthquake Engineering Simulation **\n\n** Pacific Earthquake Engineering Research Center **\n\n** **\n\n** **\n\n** (C) Copyright 1999, The Regents of the University of California **\n\n** All Rights Reserved. **\n\n** **\n\n** Commercial use of this program without express permission of the **\n\n** University of California, Berkeley, is strictly prohibited. See **\n\n** file 'COPYRIGHT' in main directory for information on usage and **\n\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\n\n** **\n\n** Developed by: **\n\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\n\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\n\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\n\n** **\n\n** ****************************************************************** */\n\n \n","file_path":"OpenSees/DEVELOPER/core/StringContainer.cpp","rank":32,"score":70414.4173485071},{"content":"/* ****************************************************************** **\n\n** OpenSees - Open System for Earthquake Engineering Simulation **\n\n** Pacific Earthquake Engineering Research Center **\n\n** **\n\n** **\n\n** (C) Copyright 1999, The Regents of the University of California **\n\n** All Rights Reserved. **\n\n** **\n\n** Commercial use of this program without express permission of the **\n\n** University of California, Berkeley, is strictly prohibited. See **\n\n** file 'COPYRIGHT' in main directory for information on usage and **\n\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\n\n** **\n\n** Developed by: **\n\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\n\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\n\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\n\n** **\n\n** ****************************************************************** */\n\n \n","file_path":"OpenSees/SRC/utility/StringContainer.cpp","rank":33,"score":70414.4173485071},{"content":"EXTERN char *\t\tTkTilePrintProc _ANSI_ARGS_((\n\n\t\t\t ClientData clientData, Tk_Window tkwin,\n\n\t\t\t char *widgRec, int offset,\n","file_path":"OpenSees/SRC/tcl/include/tkInt.h","rank":34,"score":64706.458450482445},{"content":"extern int\t\tread _ANSI_ARGS_((int fd, char *buf, int numBytes));\n","file_path":"OpenSees/SRC/tcl/include/tkConfig.h","rank":35,"score":64706.458450482445},{"content":"\tregoff_t rm_so;\t\t/* start of substring */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":36,"score":64706.458450482445},{"content":" rm_detail_t details;\t/* Detailed information on match (currently\n","file_path":"OpenSees/SRC/tcl/include/tclRegexp.h","rank":37,"score":63446.28966791192},{"content":"EXTERN LRESULT CALLBACK\tTkWinChildProc _ANSI_ARGS_((HWND hwnd, UINT message,\n","file_path":"OpenSees/SRC/tcl/include/tkWinInt.h","rank":38,"score":63438.87066185596},{"content":"\tchar *re_guts;\t\t/* `char *' is more portable than `void *' */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":39,"score":63438.87066185596},{"content":"\tregoff_t rm_eo;\t\t/* end of substring */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":40,"score":63438.87066185596},{"content":"\tregmatch_t rm_extend;\t/* see REG_EXPECT */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":41,"score":63438.87066185596},{"content":"extern uid_t\t\tgetuid _ANSI_ARGS_((void));\n","file_path":"OpenSees/SRC/tcl/include/tkConfig.h","rank":42,"score":63438.87066185596},{"content":"extern int\t\tread _ANSI_ARGS_((int fd, char *buf, int numBytes));\n","file_path":"OpenSees/SRC/tcl/include/tkConfig.h","rank":43,"score":63438.87066185596},{"content":"\tchar *re_fns;\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":44,"score":63438.87066185596},{"content":" regex_t re;\t\t\t/* Compiled re, includes number of\n","file_path":"OpenSees/SRC/tcl/include/tclRegexp.h","rank":45,"score":63438.87066185596},{"content":"\tlong re_info;\t\t/* information about RE */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":46,"score":63438.87066185596},{"content":" int (*tclFileAttrsCmd) _ANSI_ARGS_((Tcl_Interp * interp, int objc, Tcl_Obj *CONST objv[])); /* 17 */\n","file_path":"OpenSees/SRC/tcl/include/tclIntDecls.h","rank":47,"score":63438.87066185596},{"content":"\tint re_magic;\t\t/* magic number */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":48,"score":63438.87066185596},{"content":"\tsize_t re_nsub;\t\t/* number of subexpressions */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":49,"score":63438.87066185596},{"content":"extern int errno;\n","file_path":"OpenSees/SRC/tcl/include/tkConfig.h","rank":50,"score":63438.87066185596},{"content":" regmatch_t *matches;\t/* Array of indices into the Tcl_UniChar\n","file_path":"OpenSees/SRC/tcl/include/tclRegexp.h","rank":51,"score":63438.87066185596},{"content":"\tchar *re_endp;\t\t/* backward compatibility kludge */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":52,"score":63438.87066185596},{"content":"\tint re_csize;\t\t/* sizeof(character) */\n","file_path":"OpenSees/SRC/tcl/include/regex.h","rank":53,"score":63438.87066185596},{"content":" int flags;\t\t\t/* Regexp compile flags. */\n","file_path":"OpenSees/SRC/tcl/include/tclRegexp.h","rank":54,"score":63438.87066185596},{"content":"extern int\t\tclose _ANSI_ARGS_((int fd));\n","file_path":"OpenSees/SRC/tcl/include/tkConfig.h","rank":55,"score":63438.87066185596},{"content":"#include <Renderer.h>\n\n#include <Domain.h>\n\n#include <string.h> \n\n\n\n#include <OPS_Globals.h>\n\n\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n\n\n#include <NDMaterial.h>\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n#include <ID.h>\n\n#include <Renderer.h>\n\n#include <Domain.h>\n\n#include <string.h>\n\n#include <Information.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <ElementResponse.h>\n\n\n\n#include <ElementalLoad.h>\n\n\n\n#define ELE_TAG_VS3D4QuadWithSensitivity 100003\n\n\n","file_path":"OpenSees/SRC/element/XMUelements/VS3D4QuadWithSensitivity.h","rank":57,"score":17.77796978704837},{"content":"#include <ID.h>\n\n#include <Renderer.h>\n\n#include <Domain.h>\n\n#include <string.h>\n\n\n\n#include <OPS_Globals.h>\n\n\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n\n\n#include <NDMaterial.h>\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n#include <ID.h>\n\n#include <Renderer.h>\n\n#include <Domain.h>\n\n#include <string.h>\n\n#include <Information.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <ElementResponse.h>\n\n\n\n#include <ElementalLoad.h>\n\n\n\n#define ELE_TAG_AV3D4QuadWithSensitivity 100009\n\n\n","file_path":"OpenSees/SRC/element/XMUelements/AV3D4QuadWithSensitivity.h","rank":58,"score":17.725309642831554},{"content":"// Written: Minjie\n\n\n\n// Description: misc commands\n\n\n\n#include <elementAPI.h>\n\n#include <Domain.h>\n\n#include <LoadPattern.h>\n\n#include <LoadPatternIter.h>\n\n#include <ElementalLoadIter.h>\n\n#include <Element.h>\n\n#include <Parameter.h>\n\n#include <Node.h>\n\n#include <Pressure_Constraint.h>\n\n#include <TimeSeries.h>\n\n#include <SP_Constraint.h>\n\n#include <Matrix.h>\n\n#include <MeshRegion.h>\n\n#include <StringContainer.h>\n\n#include <fstream>\n\n#include <string>\n","file_path":"OpenSees/SRC/interpreter/OpenSeesMiscCommands.cpp","rank":59,"score":17.715267914550736},{"content":"#include <Python.h>\n\n#include <elementAPI.h>\n\n#include <ElasticMaterial.cpp>\n\n\n\n#include <UniaxialMaterial.h>\n\n#include <string.h>\n\n#include <string>\n\n#include <ID.h>\n\n\n\n#include <StandardStream.h>\n\nStandardStream sserr;\n\nOPS_Stream *opserrPtr = &sserr;\n\n\n\n#include <SimulationInformation.h>\n\nSimulationInformation simulationInfo;\n\nSimulationInformation *theSimulationInfoPtr = 0;\n\n\n\n#include <FE_Datastore.h>\n\nFE_Datastore *theDatabase =0;\n\n\n","file_path":"OpenSees/SRC/interpreter/OpenSeesCommandsPython.cpp","rank":60,"score":17.43460785467558},{"content":"#include <FrictionModel.h>\n\n#include <UniaxialMaterial.h>\n\n\n\n#include <float.h>\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n\n\n#include <elementAPI.h>\n\n#include <string>\n\n\n\nvoid* OPS_RJWatsonEQS3d()\n\n{\n\n int ndf = OPS_GetNDF();\n\n if (ndf != 6) {\n\n opserr << \"WARNING invalid ndf: \" << ndf;\n\n opserr << \", for space problem need 6 - RJWatsonEqsBearing \\n\";\n\n return 0;\n\n }\n\n \n","file_path":"OpenSees/SRC/element/frictionBearing/RJWatsonEQS3d.cpp","rank":61,"score":17.424638961533294},{"content":"// $Revision: 1.3 $\n\n// $Date: 2002-12-05 22:49:09 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/material/nD/J2BeamFiber3d.cpp,v $\n\n\n\n// Written: MHS\n\n// Created: Aug 2001\n\n//\n\n// Description: Elastic isotropic model where stress \n\n// components 22, 33, 13, and 23 are condensed out.\n\n\n\n#include <J2BeamFiber3d.h> \n\n#include <Channel.h>\n\n#include <string.h>\n\n#include <math.h>\n\n#include <float.h>\n\n\n\n#include <OPS_Globals.h>\n\n#include <elementAPI.h>\n\n#include <string.h>\n\n#include <stdlib.h>\n","file_path":"OpenSees/SRC/material/nD/J2BeamFiber3d.cpp","rank":62,"score":17.296809401719447},{"content":"// $Revision: 1.3 $\n\n// $Date: 2002-12-05 22:49:09 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/material/nD/J2PlateFibre.cpp,v $\n\n\n\n// Written: MHS\n\n// Created: Aug 2001\n\n//\n\n// Description: Elastic isotropic model where stress \n\n// components 22, 33, 13, and 23 are condensed out.\n\n\n\n#include <J2PlateFibre.h> \n\n#include <Channel.h>\n\n#include <string.h>\n\n#include <math.h>\n\n#include <float.h>\n\n\n\n#include <OPS_Globals.h>\n\n#include <elementAPI.h>\n\n#include <string.h>\n\n#include <stdlib.h>\n","file_path":"OpenSees/SRC/material/nD/J2PlateFibre.cpp","rank":63,"score":17.296809401719447},{"content":"// $Revision: 1.3 $\n\n// $Date: 2002-12-05 22:49:09 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/material/nD/J2BeamFiber2d.cpp,v $\n\n\n\n// Written: MHS\n\n// Created: Aug 2001\n\n//\n\n// Description: Elastic isotropic model where stress \n\n// components 22, 33, 13, and 23 are condensed out.\n\n\n\n#include <J2BeamFiber2d.h> \n\n#include <Channel.h>\n\n#include <string.h>\n\n#include <math.h>\n\n#include <float.h>\n\n\n\n#include <OPS_Globals.h>\n\n#include <elementAPI.h>\n\n#include <string.h>\n\n#include <stdlib.h>\n","file_path":"OpenSees/SRC/material/nD/J2BeamFiber2d.cpp","rank":64,"score":17.296809401719447},{"content":"// $Revision: 1.10 $\n\n// $Date: 2009-10-13 21:17:42 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/DataFileStream.cpp,v $\n\n\n\n\n\n#include <DataFileStream.h>\n\n#include <Vector.h>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <Message.h>\n\n#include <Matrix.h>\n\n\n\nusing std::cerr;\n\nusing std::ios;\n\nusing std::setiosflags;\n\nusing std::ifstream;\n\nusing std::string;\n","file_path":"OpenSees/SRC/handler/DataFileStream.cpp","rank":65,"score":17.25087624475745},{"content":"// $Revision: 1.10 $\n\n// $Date: 2009-10-13 21:17:42 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/DataFileStream.cpp,v $\n\n\n\n\n\n#include <DataFileStream.h>\n\n#include <Vector.h>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <Message.h>\n\n#include <Matrix.h>\n\n\n\nusing std::cerr;\n\nusing std::ios;\n\nusing std::setiosflags;\n\nusing std::ifstream;\n\nusing std::string;\n","file_path":"OpenSees/DEVELOPER/core/DataFileStream.cpp","rank":66,"score":17.25087624475745},{"content":"//#include <MaterialResponse.h>\n\n#include <Parameter.h>\n\n\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <string.h>\n\n\n\n\n\n#include <elementAPI.h>\n\n\n","file_path":"OpenSees/SRC/material/nD/UWmaterials/PM4Silt.h","rank":67,"score":17.234277915605155},{"content":"//#include <MaterialResponse.h>\n\n#include <Parameter.h>\n\n\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <string.h>\n\n\n\n\n\n#include <elementAPI.h>\n\n\n","file_path":"OpenSees/SRC/material/nD/UWmaterials/PM4Sand.h","rank":68,"score":17.234277915605155},{"content":"// $Revision: 1.9 $\n\n// $Date: 2009-03-27 19:18:14 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/File.cpp,v $\n\n \n\n \n\n// Written: fmk \n\n// Created: 09/07\n\n//\n\n// Description: This file contains the class definition for File used in SimulationINformation.\n\n\n\n\n\n#include <map>\n\n#include <string.h>\n\n//#include <string>\n\n//using namespace std;\n\n\n\n\n\n\n\n#include <File.h>\n\n#include <FileIter.h>\n","file_path":"OpenSees/SRC/utility/File.cpp","rank":69,"score":17.22450903194889},{"content":"// $Revision: 1.9 $\n\n// $Date: 2009-03-27 19:18:14 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/File.cpp,v $\n\n \n\n \n\n// Written: fmk \n\n// Created: 09/07\n\n//\n\n// Description: This file contains the class definition for File used in SimulationINformation.\n\n\n\n\n\n#include <map>\n\n#include <string.h>\n\n//#include <string>\n\n//using namespace std;\n\n\n\n\n\n\n\n#include <File.h>\n\n#include <FileIter.h>\n","file_path":"OpenSees/DEVELOPER/core/File.cpp","rank":70,"score":17.22450903194889},{"content":"// $Revision: 1.19 $\n\n// $Date: 2010-06-09 17:43:09 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/domain/pattern/LoadPattern.cpp,v $\n\n \n\n// Written: fmk 07/99\n\n// Revised:\n\n//\n\n// Purpose: This file contains the method definitions for class LoadPattern.\n\n// LoadPattern is a container class.\n\n//\n\n// The LoadPattern interface:\n\n\n\n#include <string.h>\n\n#include <string>\n\n#include <stdlib.h>\n\n\n\n#include <LoadPattern.h>\n\n#include <stdlib.h>\n\n#include <ID.h>\n\n#include <TimeSeries.h>\n","file_path":"OpenSees/SRC/domain/pattern/LoadPattern.cpp","rank":71,"score":17.18986618884449},{"content":"#define VOID void\n\n\n\nextern \"C\" {\n\n#include <triangle.h>\n\n}\n\n#include <string>\n\n#include <Vector.h>\n\n#include <map>\n\n#include <vector>\n\n\n","file_path":"OpenSees/SRC/element/PFEMElement/PFEMMesher2D.h","rank":72,"score":17.166635698886402},{"content":"// $Revision: 1.10 $\n\n// $Date: 2009-10-13 21:17:42 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/DataFileStreamAdd.cpp,v $\n\n\n\n\n\n#include <DataFileStreamAdd.h>\n\n#include <Vector.h>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <Message.h>\n\n#include <Matrix.h>\n\n\n\nusing std::cerr;\n\nusing std::ios;\n\nusing std::setiosflags;\n\nusing std::ifstream;\n\nusing std::string;\n","file_path":"OpenSees/SRC/handler/DataFileStreamAdd.cpp","rank":73,"score":17.159981862492756},{"content":"// $Revision: 1.13 $\n\n// $Date: 2009-10-13 21:17:42 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/XmlFileStream.cpp,v $\n\n\n\n#include <XmlFileStream.h>\n\n#include <Vector.h>\n\n#include <Matrix.h>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <Message.h>\n\n\n\nusing std::cerr;\n\nusing std::ios;\n\nusing std::setiosflags;\n\nusing std::string;\n\nusing std::ifstream;\n\nusing std::getline;\n","file_path":"OpenSees/SRC/handler/XmlFileStream.cpp","rank":74,"score":17.115012755363686},{"content":"// $Revision: 1.3 $\n\n// $Date: 2009-04-30 23:23:04 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/BinaryFileStream.cpp,v $\n\n\n\n#include <BinaryFileStream.h>\n\n#include <Vector.h>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <Message.h>\n\n#include <Matrix.h>\n\n\n\nusing std::cerr;\n\nusing std::ios;\n\nusing std::setiosflags;\n\nusing std::ifstream;\n\nusing std::string;\n\nusing std::getline;\n","file_path":"OpenSees/DEVELOPER/core/BinaryFileStream.cpp","rank":75,"score":17.115012755363686},{"content":"// $Revision: 1.3 $\n\n// $Date: 2009-04-30 23:23:04 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/BinaryFileStream.cpp,v $\n\n\n\n#include <BinaryFileStream.h>\n\n#include <Vector.h>\n\n#include <iostream>\n\n#include <iomanip>\n\n#include <string>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <Message.h>\n\n#include <Matrix.h>\n\n\n\nusing std::cerr;\n\nusing std::ios;\n\nusing std::setiosflags;\n\nusing std::ifstream;\n\nusing std::string;\n\nusing std::getline;\n","file_path":"OpenSees/SRC/handler/BinaryFileStream.cpp","rank":76,"score":17.115012755363686},{"content":"#include <Node.h>\n\n\n\n#include \"FiberSection2dInt.h\"\n\n\n\n#include \"LinearCrdTransf2dInt.h\"\n\n\n\n#include <Matrix.h>\n\n\n\n#include <Vector.h>\n\n\n\n#include <ID.h>\n\n\n\n#include <Renderer.h>\n\n\n\n#include <Domain.h>\n\n\n\n#include <string.h>\n\n\n\n#include <Information.h>\n\n\n","file_path":"OpenSees/SRC/element/dispBeamColumnInt/DispBeamColumn2dInt.cpp","rank":77,"score":16.922035577828062},{"content":"// $Revision: 1.4 $\n\n// $Date: 2008-10-09 21:33:06 $\n\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/PeerNGA.cpp,v $\n\n \n\n \n\n// Written: fmk \n\n// Created: 09/07\n\n//\n\n// Description: This file contains the class definition for File used in SimulationINformation.\n\n//\n\n// What: \"@(#) SimulationInformation.h, revA\"\n\n\n\n\n\n#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <StringContainer.h>\n\n\n\n\n\n#ifdef _WIN32\n","file_path":"OpenSees/SRC/utility/PeerNGA.cpp","rank":78,"score":16.85636232218225},{"content":"#include \"DRMInputHandler.h\"\n\n#include <Vector.h>\n\n#include <ID.h>\n\n#include <Message.h>\n\n#include <Matrix.h>\n\n#include <Element.h>\n\n#include <map>\n\n#include <set>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <string>\n\n#include <classTags.h>\n\n\n","file_path":"OpenSees/SRC/domain/pattern/drm/DRMLoadPatternWrapper.h","rank":79,"score":16.83406736540883},{"content":"//\n\n\n\n// Description: This file contains the implementation of the\n\n\n\n// \n\n\n\n//\n\n\n\n// Jinchi Lu and Zhaohui Yang (May 2004)\n\n\n\n\n\n\n\n#include <stdlib.h>\n\n\n\n#include <string.h>\n\n\n\n#include <Domain.h>\n\n\n\n\n\n\n","file_path":"OpenSees/SRC/element/brick/TclTwenty_Node_BrickCommand.cpp","rank":80,"score":16.606763562714068},{"content":"// $Revision: 1.0 $\n\n// $Date: 2019-08-22 $\n\n\n\n// Written: Kuanshi Zhong \n\n// Created: 07/2019\n\n//\n\n\n\n#include <math.h>\n\n\n\n#include <stdlib.h>\n\n#include <MaterialResponse.h>\n\n#include <Information.h>\n\n#include <string.h>\n\n\n\n#include <DuctileFracture.h>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n\n\n#include <OPS_Globals.h>\n","file_path":"OpenSees/SRC/material/uniaxial/DuctileFracture.cpp","rank":81,"score":16.53992078411818},{"content":"\n\n// $Revision$\n\n// $Date$\n\n// $Source$\n\n\n\n// Written: MHS\n\n// Created: 2012\n\n//\n\n// Description: This file contains the class implementation of FiberSection2d.\n\n\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <math.h>\n\n\n\n#include <Channel.h>\n\n#include <Vector.h>\n\n#include <Matrix.h>\n\n#include <MatrixUtil.h>\n\n#include <Fiber.h>\n\n#include <classTags.h>\n","file_path":"OpenSees/SRC/material/section/NDFiberSectionWarping2d.cpp","rank":82,"score":16.466375446512842},{"content":"#include <vector>\n\n#include <ConfinedConcrete01.h>\n\n\n\n#include <Matrix.h>\n\n#include <Parameter.h>\n\n\n\n#include <math.h>\n\n#include <float.h>\n\n#include <stdio.h>\n\n#include <string.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <elementAPI.h>\n\n\n\n#define OPS_Export \n\n#define PI 3.14159265358979323846\n\n\n\n/*\n\nUSER INPUT PARAMETERS\n\n\n","file_path":"OpenSees/SRC/material/uniaxial/ConfinedConcrete01.cpp","rank":83,"score":16.423526578161216},{"content":"// $Revision$\n\n// $Date$\n\n// $Source$\n\n\n\n// Written: MHS\n\n// Created: Dec 2012\n\n\n\n#include <stdlib.h>\n\n#include <math.h>\n\n\n\n#include <InitStressNDMaterial.h>\n\n#include <Matrix.h>\n\n#include <ID.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <string.h>\n\n\n\n#include <OPS_Globals.h>\n\n\n\n#include <elementAPI.h>\n","file_path":"OpenSees/SRC/material/nD/InitStressNDMaterial.cpp","rank":84,"score":16.359611240155033},{"content":"#include <elementAPI.h>\n\n\n\n#include <float.h>\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n\n\n#include <G3Globals.h>\n\n#include <Message.h>\n\nusing namespace std;\n\n#include <iostream>\n\n\n\n#define PI 3.14159l\n\n\n\n\n\n// initialize the class wide variables\n\nMatrix HDR::theMatrix(12,12);\n\nVector HDR::theVector(12);\n\n\n\n\n","file_path":"OpenSees/SRC/element/elastomericBearing/HDR.cpp","rank":85,"score":16.31248934073788},{"content":"#include <N4BiaxialTruss.h>\n\n#include <Information.h>\n\n#include <Parameter.h>\n\n\n\n#include <Domain.h>\n\n#include <Node.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <UniaxialMaterial.h>\n\n#include <Renderer.h>\n\n\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n\n\n#include <ElementResponse.h>\n\n#include <CompositeResponse.h>\n\n#include <ConcretewBeta.h>\n\n\n\n//#include <fstream>\n","file_path":"OpenSees/SRC/element/truss/N4BiaxialTruss.cpp","rank":86,"score":16.311998381935606},{"content":"// $Revision$\n\n// $Date$\n\n// $Source$\n\n\n\n// Written: MHS\n\n// Created: 2012\n\n//\n\n// Description: This file contains the class implementation of FiberSection2d.\n\n\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <math.h>\n\n\n\n#include <Channel.h>\n\n#include <Vector.h>\n\n#include <Matrix.h>\n\n#include <MatrixUtil.h>\n\n#include <Fiber.h>\n\n#include <classTags.h>\n\n#include <NDFiberSection2d.h>\n","file_path":"OpenSees/SRC/material/section/NDFiberSection2d.cpp","rank":87,"score":16.300985977144236},{"content":"// $Revision$\n\n// $Date$\n\n// $Source$\n\n\n\n// Written: MHS\n\n// Created: 2012\n\n//\n\n// Description: This file contains the class implementation of FiberSection3d.\n\n\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <math.h>\n\n\n\n#include <Channel.h>\n\n#include <Vector.h>\n\n#include <Matrix.h>\n\n#include <MatrixUtil.h>\n\n#include <Fiber.h>\n\n#include <classTags.h>\n\n#include <NDFiberSection3d.h>\n","file_path":"OpenSees/SRC/material/section/NDFiberSection3d.cpp","rank":88,"score":16.300985977144236},{"content":"#include <iomanip>\n\nusing std::ios;\n\n#include <iostream>\n\nusing std::ofstream;\n\n \n\n#else\n\n\n\n#include <StandardStream.h>\n\n#include <FileStream.h>\n\n#include <DummyStream.h>\n\n\n\nStandardStream sserr;\n\nOPS_Stream *opserrPtr = &sserr;\n\n\n\n#endif\n\n\n\n\n\n#include <stdio.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n","file_path":"OpenSees/SRC/tcl/commands.cpp","rank":89,"score":16.24982363479195},{"content":"\n\n#include <string.h>\n\n\n\n#ifdef _WGL\n\n#include <windows.h>\n\n//#include <GL/glaux.h>\n\n#include <GL/glu.h>\n\n#include <GL/gl.h>\n\n\n\n#elif _GLX\n\n\n\n#include <GL/gl.h>\n\n#include <GL/glx.h>\n\n#include <GL/glu.h>\n\n\n\n#elif _AGL\n\n\n\n#include <OpenGL/glu.h>\n\n#include <OpenGL/gl.h>\n\n\n","file_path":"OpenSees/SRC/renderer/OpenGlRenderer.cpp","rank":90,"score":16.243073387165957},{"content":"","file_path":"OpenSees/SRC/material/nD/FSAM.cpp","rank":91,"score":16.243073387165957},{"content":"#include <string.h>\n\n\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n#include <ID.h>\n\n#include <ArrayOfTaggedObjects.h>\n\n\n\n#include <Domain.h>\n\n#include <Node.h>\n\n#include <NodeIter.h>\n\n#include <SP_Constraint.h>\n\n#include <SP_ConstraintIter.h>\n\n#include <MP_Constraint.h>\n\n\n\n#include <RigidRod.h>\n\n#include <RigidBeam.h>\n\n#include <RigidDiaphragm.h>\n\n\n\n#include <CrdTransf.h>\n\n\n","file_path":"OpenSees/SRC/modelbuilder/tcl/TclModelBuilder.cpp","rank":92,"score":16.227540092122023},{"content":"","file_path":"OpenSees/SRC/element/HUelements/MultipleNormalSpring.cpp","rank":93,"score":16.227540092122023},{"content":"#include <Node.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <Renderer.h>\n\n#include <Information.h>\n\n#include <ElementResponse.h>\n\n\n\n#include <ID.h>\n\n#include <Vector.h>\n\n\n\n#include <float.h>\n\n#define _USE_MATH_DEFINES\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n#include <elementAPI.h>\n\n\n\nvoid* OPS_YamamotoBiaxialHDR()\n\n{\n\n // 3-dim, 6-dof\n","file_path":"OpenSees/SRC/element/HUelements/YamamotoBiaxialHDR.cpp","rank":94,"score":16.197006858886624},{"content":"\n\n#include <string.h>\n\n\n\n#include <math.h>\n\n#include <float.h>\n\n\n\n\n\n#include <elementAPI.h>\n\n#include <OPS_Globals.h>\n\n\n\n\n\n//#include <iostream>\n\n//#include <fstream>\n\n//using namespace std;\n\n\n\nvoid *\n\nOPS_DoddRestr(void)\n\n{\n\n // Pointer to a uniaxial material that will be returned\n\n UniaxialMaterial *theMaterial = 0;\n","file_path":"OpenSees/SRC/material/uniaxial/DoddRestr.cpp","rank":95,"score":16.196823805765007},{"content":"#include <string.h>\n\n\n\n#include <Renderer.h>\n\n\n\n#ifndef _NOGRAPHICS\n\n\n\n#ifdef _WGL\n\n#include <OpenGLRenderer.h>\n\n#elif _GLX\n\n#include <OpenGLRenderer.h>\n\n#elif _AGL\n\n#include <OpenGLRenderer.h>\n\n#else\n\n#include <X11Renderer.h>\n\n#endif\n\n\n\n#endif\n\n\n\n#include <PlainMap.h>\n\n#include \"TclVideoPlayer.h\"\n","file_path":"OpenSees/SRC/tcl/TclVideoPlayer.cpp","rank":96,"score":16.187916609939755},{"content":"#include <elementAPI.h>\n\n\n\n#include <float.h>\n\n#include <math.h>\n\n#include <stdlib.h>\n\n#include <string.h>\n\n\n\n#include <G3Globals.h>\n\n#include <Message.h>\n\nusing namespace std;\n\n#include <iostream>\n\n\n\n#define PI 3.14159l\n\n\n\n\n\n// initialize the class wide variables\n\nMatrix ElastomericX::theMatrix(12,12);\n\nVector ElastomericX::theVector(12);\n\n\n\n\n","file_path":"OpenSees/SRC/element/elastomericBearing/ElastomericX.cpp","rank":97,"score":16.187916609939755},{"content":"\n\n#include <OPS_Globals.h>\n\n\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n\n\n#include <NDMaterial.h>\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n#include <ID.h>\n\n#include <Renderer.h>\n\n#include <Domain.h>\n\n#include <string.h>\n\n#include <Information.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <ElementResponse.h>\n\n\n\n#include <ElementalLoad.h>\n\n\n\n#define ELE_TAG_ASI3D8QuadWithSensitivity 100002\n\n\n","file_path":"OpenSees/SRC/element/XMUelements/ASI3D8QuadWithSensitivity.h","rank":98,"score":16.177180106444982},{"content":"\n\n#include <OPS_Globals.h>\n\n\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n\n\n#include <NDMaterial.h>\n\n#include <Matrix.h>\n\n#include <Vector.h>\n\n#include <ID.h>\n\n#include <Renderer.h>\n\n#include <Domain.h>\n\n#include <string.h>\n\n#include <Information.h>\n\n#include <Channel.h>\n\n#include <FEM_ObjectBroker.h>\n\n#include <ElementResponse.h>\n\n\n\n#include <ElementalLoad.h>\n\n\n\n\n\n#define ELE_TAG_AC3D8HexWithSensitivity 100001\n\n\n","file_path":"OpenSees/SRC/element/XMUelements/AC3D8HexWithSensitivity.h","rank":99,"score":16.177180106444982}],"string":"[\n {\n \"content\": \" CONST char *string;\\t\\t/* Last string passed to Tcl_RegExpExec. */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tclRegexp.h\",\n \"rank\": 0,\n \"score\": 183596.33256221714\n },\n {\n \"content\": \" public TypedIOPort string;\\n\",\n \"file_path\": \"OpenSees/SRC/java/kepler/opensees/StringToDouble.java\",\n \"rank\": 1,\n \"score\": 142280.66572606767\n },\n {\n \"content\": \"// A first class string type\\n\\nclass String {\\n\\npublic:\\n\\n // Constructors and destructor\\n\\n String(const char s[] = \\\"\\\"); // Constructs a deep copy of a C-string.\\n\\n // ASSUME: s is a valid C-string.\\n\\n String(const String& s); // Constructs a deep copy of s.\\n\\n ~String(); // Deallocates String memory. \\n\\n\\n\\n // Assignment operators\\n\\n String& operator= (const String& rhs); // Assigns a deep copy of rhs. \\n\\n String& operator+= (const String& rhs); // Adds a deep copy of rhs on the\\n\\n // end of this string.\\n\\n\\n\\n char& operator[](int i); // The element at subscript i. \\n\\n // ASSUME: i < length of the string\\n\\n char operator[](int i) const; // The element at subscript i.\\n\\n // ASSUME: i < length of the string\\n\\n\\n\\n int length() const; // Number of string characters.\\n\\n const char* charString( ) const; // C-String equivalent value.\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.h\",\n \"rank\": 2,\n \"score\": 133760.52760907522\n },\n {\n \"content\": \" char cursorString[20]; /* Used to store a cursor id string. */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkInt.h\",\n \"rank\": 3,\n \"score\": 124516.9943262054\n },\n {\n \"content\": \"char *string;\\n\",\n \"file_path\": \"OpenSees/OTHER/Triangle/showme.c\",\n \"rank\": 4,\n \"score\": 124115.46963219905\n },\n {\n \"content\": \"class StringContainer\\n\\n{\\n\\n public:\\n\\n StringContainer();\\n\\n ~StringContainer();\\n\\n int addString(const char *);\\n\\n const char *getString(int) const;\\n\\n const char *operator()(void);\\n\\n int getNumStrings() const;\\n\\n void clear(void);\\n\\n\\n\\n private:\\n\\n char **strings;\\n\\n int numStrings;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.h\",\n \"rank\": 5,\n \"score\": 84974.61283075646\n },\n {\n \"content\": \"class StringContainer\\n\\n{\\n\\n public:\\n\\n StringContainer();\\n\\n ~StringContainer();\\n\\n int addString(const char *);\\n\\n const char *getString(int) const;\\n\\n const char *operator()(void);\\n\\n int getNumStrings() const;\\n\\n void clear(void);\\n\\n\\n\\n private:\\n\\n char **strings;\\n\\n int numStrings;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.h\",\n \"rank\": 6,\n \"score\": 84974.61283075646\n },\n {\n \"content\": \"public class StringToDouble extends TypedAtomicActor {\\n\\n\\n\\n /** Construct an actor with the given container and name.\\n\\n * @param container The container.\\n\\n * @param name The name of this actor.\\n\\n * @exception IllegalActionException If the actor cannot be contained\\n\\n * by the proposed container.\\n\\n * @exception NameDuplicationException If the container already has an\\n\\n * actor with this name.\\n\\n */\\n\\n public StringToDouble(CompositeEntity container, String name)\\n\\n throws NameDuplicationException, IllegalActionException {\\n\\n super(container, name);\\n\\n\\n\\n string = new TypedIOPort(this, \\\"string\\\", true, false);\\n\\n string.setTypeEquals(BaseType.STRING);\\n\\n\\n\\n doublePort = new TypedIOPort(this, \\\"double\\\", false, true);\\n\\n doublePort.setTypeEquals(BaseType.DOUBLE);\\n\\n }\\n\\n\\n\\n ///////////////////////////////////////////////////////////////////\\n\\n //// public variables ////\\n\\n\\n\\n /** The input port, which has type <i>string</i>. */\\n\\n public TypedIOPort string;\\n\\n /** The output port, which has type <i>int</i>. */\\n\\n public TypedIOPort doublePort;\\n\\n\\n\\n ///////////////////////////////////////////////////////////////////\\n\\n //// public methods ////\\n\\n\\n\\n /** Consume one string token on the input port and produce a new\\n\\n * integer token on the output port.\\n\\n * @exception IllegalActionException If there is no direc/restor.\\n\\n */\\n\\n public void fire() throws IllegalActionException {\\n\\n super.fire();\\n\\n String _input = ((StringToken)string.get(0)).stringValue();\\n\\n Double _output = new Double(_input);\\n\\n doublePort.send(0, new DoubleToken(_output.doubleValue()));\\n\\n }\\n\\n\\n\\n ///////////////////////////////////////////////////////////////////\\n\\n //// protected members ////\\n\\n\\n\\n ///////////////////////////////////////////////////////////////////\\n\\n //// private methods ////\\n\\n\\n\\n ///////////////////////////////////////////////////////////////////\\n\\n //// private members ////\\n\",\n \"file_path\": \"OpenSees/SRC/java/kepler/opensees/StringToDouble.java\",\n \"rank\": 7,\n \"score\": 77843.71757651746\n },\n {\n \"content\": \" public void fire() throws IllegalActionException {\\n\\n super.fire();\\n\\n String _input = ((StringToken)string.get(0)).stringValue();\\n\\n Double _output = new Double(_input);\\n\\n doublePort.send(0, new DoubleToken(_output.doubleValue()));\\n\",\n \"file_path\": \"OpenSees/SRC/java/kepler/opensees/StringToDouble.java\",\n \"rank\": 8,\n \"score\": 76919.01572625934\n },\n {\n \"content\": \" public TypedIOPort doublePort;\\n\",\n \"file_path\": \"OpenSees/SRC/java/kepler/opensees/StringToDouble.java\",\n \"rank\": 9,\n \"score\": 76010.39361000105\n },\n {\n \"content\": \"#ifndef _PLSTRING_H\\n\\n#define _PLSTRING_H\\n\\n\\n\\n#include <OPS_Stream.h>\\n\\n#include <iostream>\\n\\nusing std::istream;\\n\\n\\n\\n// A first class string type\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.h\",\n \"rank\": 10,\n \"score\": 73627.54508229624\n },\n {\n \"content\": \"\\n\\n // Comparison operators\\n\\n friend bool operator== (const String& s, const String& t);\\n\\n friend bool operator!= (const String& s, const String& t);\\n\\n friend bool operator< (const String& s, const String& t);\\n\\n friend bool operator<= (const String& s, const String& t);\\n\\n friend bool operator> (const String& s, const String& t);\\n\\n friend bool operator>= (const String& s, const String& t);\\n\\n\\n\\n friend OPS_Stream& operator<<(OPS_Stream& out, const String& s);\\n\\n // Writes the C-string equivalent to out.\\n\\n friend istream& operator>> (istream& in, String & s); \\n\\n // Reads at most 999 characters up to the next newline from \\n\\n // from in. The newline is extracted but not assigned. \\n\\n friend String operator+(const String& s, const String& t); \\n\\n // A deep copy of s with a deep copy of t appended to the end.\\n\\n\\n\\nprivate:\\n\\n char* info_;\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.h\",\n \"rank\": 11,\n \"score\": 73621.89695457976\n },\n {\n \"content\": \"#include <string.h>\\n\\n#include \\\"G3string.h\\\"\\n\\n\\n\\nString::String(const char s[])\\n\\n{\\n\\n info_ = new char[strlen(s) + 1]; // Leave room for the '\\\\0'. \\n\\n strcpy(info_, s); // Copy from s to info.\\n\\n}\\n\\n\\n\\nString::String(const String& s)\\n\\n{\\n\\n info_ = new char[strlen(s.info_) + 1]; // Allocate memory for the copy.\\n\\n strcpy(info_, s.info_); // Copy the argument's characters.\\n\\n}\\n\\n\\n\\nString::~String( )\\n\\n{\\n\\n delete [] info_; // Deallocate the array.\\n\\n}\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.cpp\",\n \"rank\": 12,\n \"score\": 71995.1347847162\n },\n {\n \"content\": \"{ \\n\\n return info_;\\n\\n}\\n\\n\\n\\nOPS_Stream& operator<< (OPS_Stream& out, const String& s)\\n\\n{\\n\\n out << s.charString();\\n\\n return out;\\n\\n}\\n\\n\\n\\nistream& operator>> (istream& in, String& s) \\n\\n{\\n\\n char buffer[1000]; // Buffer to store the stream characters\\n\\n in.getline(buffer,1000,'\\\\n'); // Remove up to 999 characters from in, \\n\\n // up to and including first occurrence \\n\\n // of '\\\\n'. Store all but '\\\\n' in the \\n\\n // buffer; terminate the buffer with '\\\\0'. \\n\\n s = String(buffer); // Create a new String from the buffer and\\n\\n // assign it to s.\\n\\n return in;\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.cpp\",\n \"rank\": 13,\n \"score\": 71993.07109604166\n },\n {\n \"content\": \"// $Revision: 1.1 $\\n\\n// $Date: 2006-11-08 20:06:10 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.h,v $\\n\\n \\n\\n// Written: fmk \\n\\n// Created: 11/06\\n\\n//\\n\\n// Description: This file contains the class definition for StringContainer.\\n\\n// StringContainer is used to store information about a simulation; this\\n\\n// includes start and end times; program version, files opened for reading, files\\n\\n// opened for writing, and all parameters used (specified with pset or -par option\\n\\n// to program)\\n\\n//\\n\\n// What: \\\"@(#) StringContainer.h, revA\\\"\\n\\n\\n\\n#ifndef StringContainer_h\\n\\n#define StringContainer_h\\n\\n\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.h\",\n \"rank\": 14,\n \"score\": 71992.31031253589\n },\n {\n \"content\": \"// $Revision: 1.1 $\\n\\n// $Date: 2006-11-08 20:06:10 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.h,v $\\n\\n \\n\\n// Written: fmk \\n\\n// Created: 11/06\\n\\n//\\n\\n// Description: This file contains the class definition for StringContainer.\\n\\n// StringContainer is used to store information about a simulation; this\\n\\n// includes start and end times; program version, files opened for reading, files\\n\\n// opened for writing, and all parameters used (specified with pset or -par option\\n\\n// to program)\\n\\n//\\n\\n// What: \\\"@(#) StringContainer.h, revA\\\"\\n\\n\\n\\n#ifndef StringContainer_h\\n\\n#define StringContainer_h\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.h\",\n \"rank\": 15,\n \"score\": 71992.31031253589\n },\n {\n \"content\": \"}\\n\\n\\n\\nString operator+ (const String& s, const String& t)\\n\\n{\\n\\n String temp(s); // temp is a copy of s.\\n\\n temp += t; // Add t to the end of temp.\\n\\n return temp; \\n\\n}\\n\\n\\n\\nchar& String::operator[](int i)\\n\\n{\\n\\n return info_[i];\\n\\n} \\n\\n\\n\\nchar String::operator[](int i) const\\n\\n{\\n\\n return info_[i];\\n\\n} \\n\\n\\n\\nconst char* String::charString() const \\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.cpp\",\n \"rank\": 16,\n \"score\": 71987.6470613427\n },\n {\n \"content\": \"}\\n\\n\\n\\nint String::length() const\\n\\n{\\n\\n return strlen(info_); \\n\\n}\\n\\n\\n\\nbool operator== (const String& s, const String& t)\\n\\n{\\n\\n return strcmp(s.info_,t.info_) == 0;\\n\\n}\\n\\n\\n\\nbool operator!= (const String& s, const String& t)\\n\\n{\\n\\n return strcmp(s.info_,t.info_) != 0;\\n\\n}\\n\\n\\n\\nbool operator< (const String& s, const String& t)\\n\\n{\\n\\n return strcmp(s.info_,t.info_) < 0;\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.cpp\",\n \"rank\": 17,\n \"score\": 71987.54157057192\n },\n {\n \"content\": \"}\\n\\n\\n\\nbool operator<= (const String& s, const String& t)\\n\\n{\\n\\n return strcmp(s.info_,t.info_) <= 0;\\n\\n}\\n\\n\\n\\nbool operator> (const String& s, const String& t)\\n\\n{\\n\\n return strcmp(s.info_,t.info_) > 0;\\n\\n}\\n\\n\\n\\nbool operator>= (const String& s, const String& t)\\n\\n{\\n\\n return strcmp(s.info_,t.info_) >= 0;\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.cpp\",\n \"rank\": 18,\n \"score\": 71987.50188620813\n },\n {\n \"content\": \"String& String::operator= (const String& rhs) \\n\\n{\\n\\n if (this != &rhs) { // Cover the case of s = s.\\n\\n delete [] info_; // Deallocate the old buffer.\\n\\n info_ = new char[strlen(rhs.info_) +1];// Allocate memory for a new one.\\n\\n strcpy(info_, rhs.info_); // Copy the characters from the\\n\\n } // right side to the left\\n\\n return *this; // Return this object.\\n\\n} \\n\\n\\n\\nString& String::operator+= (const String& s)\\n\\n{\\n\\n char* temp = new char[strlen(info_) + strlen(s.info_) + 1]; // Create a new \\n\\n // array to hold the two string arrays.\\n\\n strcpy(temp,info_); // Copy the characters from this array into temp. \\n\\n strcat(temp,s.info_); // Then copy the characters of s.info_ into temp. \\n\\n\\n\\n delete [] info_; // Replace the old value for info_ by temp.\\n\\n info_ = temp;\\n\\n return *this;\\n\",\n \"file_path\": \"OpenSees/SRC/string/G3string.cpp\",\n \"rank\": 19,\n \"score\": 71986.77143283008\n },\n {\n \"content\": \"/* ****************************************************************** **\\n\\n** OpenSees - Open System for Earthquake Engineering Simulation **\\n\\n** Pacific Earthquake Engineering Research Center **\\n\\n** **\\n\\n** **\\n\\n** (C) Copyright 1999, The Regents of the University of California **\\n\\n** All Rights Reserved. **\\n\\n** **\\n\\n** Commercial use of this program without express permission of the **\\n\\n** University of California, Berkeley, is strictly prohibited. See **\\n\\n** file 'COPYRIGHT' in main directory for information on usage and **\\n\\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\\n\\n** **\\n\\n** Developed by: **\\n\\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\\n\\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\\n\\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\\n\\n** **\\n\\n** ****************************************************************** */\\n\\n \\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.h\",\n \"rank\": 20,\n \"score\": 71977.55218514844\n },\n {\n \"content\": \"/* ****************************************************************** **\\n\\n** OpenSees - Open System for Earthquake Engineering Simulation **\\n\\n** Pacific Earthquake Engineering Research Center **\\n\\n** **\\n\\n** **\\n\\n** (C) Copyright 1999, The Regents of the University of California **\\n\\n** All Rights Reserved. **\\n\\n** **\\n\\n** Commercial use of this program without express permission of the **\\n\\n** University of California, Berkeley, is strictly prohibited. See **\\n\\n** file 'COPYRIGHT' in main directory for information on usage and **\\n\\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\\n\\n** **\\n\\n** Developed by: **\\n\\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\\n\\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\\n\\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\\n\\n** **\\n\\n** ****************************************************************** */\\n\\n \\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.h\",\n \"rank\": 21,\n \"score\": 71977.55218514844\n },\n {\n \"content\": \"// $Revision: 1.1 $\\n\\n// $Date: 2006-11-08 20:06:10 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.cpp,v $\\n\\n//\\n\\n// Description: This file contains the class definition for StringContainer.\\n\\n// SimulationInformation is a stopwatch.\\n\\n//\\n\\n// What: \\\"@(#) SimulationContainer.h, revA\\\"\\n\\n\\n\\n\\n\\n\\n\\n#include<StringContainer.h>\\n\\n#include <OPS_Globals.h>\\n\\n#include <string.h>\\n\\n#include <time.h>\\n\\n#include <math.h>\\n\\n\\n\\nStringContainer::StringContainer()\\n\\n :strings(0), numStrings(0)\\n\\n{\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.cpp\",\n \"rank\": 22,\n \"score\": 70433.48728426412\n },\n {\n \"content\": \"// $Revision: 1.1 $\\n\\n// $Date: 2006-11-08 20:06:10 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/StringContainer.cpp,v $\\n\\n//\\n\\n// Description: This file contains the class definition for StringContainer.\\n\\n// SimulationInformation is a stopwatch.\\n\\n//\\n\\n// What: \\\"@(#) SimulationContainer.h, revA\\\"\\n\\n\\n\\n\\n\\n\\n\\n#include<StringContainer.h>\\n\\n#include <OPS_Globals.h>\\n\\n#include <string.h>\\n\\n#include <time.h>\\n\\n#include <math.h>\\n\\n\\n\\nStringContainer::StringContainer()\\n\\n :strings(0), numStrings(0)\\n\\n{\\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.cpp\",\n \"rank\": 23,\n \"score\": 70433.48728426412\n },\n {\n \"content\": \"{\\n\\n return numStrings;\\n\\n}\\n\\n\\n\\nvoid\\n\\nStringContainer::clear(void)\\n\\n{\\n\\n if (strings != 0) {\\n\\n for (int i=0; i<numStrings; i++)\\n\\n delete [] strings[i];\\n\\n delete [] strings;\\n\\n }\\n\\n\\n\\n numStrings = 0;\\n\\n strings = 0;\\n\\n}\\n\\n\\n\\nint \\n\\nStringContainer::addString(const char *theString)\\n\\n{\\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.cpp\",\n \"rank\": 24,\n \"score\": 70424.731470809\n },\n {\n \"content\": \"{\\n\\n return numStrings;\\n\\n}\\n\\n\\n\\nvoid\\n\\nStringContainer::clear(void)\\n\\n{\\n\\n if (strings != 0) {\\n\\n for (int i=0; i<numStrings; i++)\\n\\n delete [] strings[i];\\n\\n delete [] strings;\\n\\n }\\n\\n\\n\\n numStrings = 0;\\n\\n strings = 0;\\n\\n}\\n\\n\\n\\nint \\n\\nStringContainer::addString(const char *theString)\\n\\n{\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.cpp\",\n \"rank\": 25,\n \"score\": 70424.731470809\n },\n {\n \"content\": \" // if valid theString\\n\\n if (theString == 0) \\n\\n return 0;\\n\\n\\n\\n // create new array to hold pointers and copy pointers there\\n\\n char **nextStrings = new char *[numStrings+1];\\n\\n if (nextStrings == 0) \\n\\n return -2;\\n\\n\\n\\n for (int i=0; i<numStrings; i++)\\n\\n nextStrings[i] = strings[i];\\n\\n \\n\\n // create new pointer for new file name and add to end of array\\n\\n char *copyString = new char[strlen(theString)+1];\\n\\n if (copyString == 0)\\n\\n return -3;\\n\\n\\n\\n strcpy(copyString, theString);\\n\\n\\n\\n nextStrings[numStrings] = copyString;\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.cpp\",\n \"rank\": 26,\n \"score\": 70424.69060921413\n },\n {\n \"content\": \" // if valid theString\\n\\n if (theString == 0) \\n\\n return 0;\\n\\n\\n\\n // create new array to hold pointers and copy pointers there\\n\\n char **nextStrings = new char *[numStrings+1];\\n\\n if (nextStrings == 0) \\n\\n return -2;\\n\\n\\n\\n for (int i=0; i<numStrings; i++)\\n\\n nextStrings[i] = strings[i];\\n\\n \\n\\n // create new pointer for new file name and add to end of array\\n\\n char *copyString = new char[strlen(theString)+1];\\n\\n if (copyString == 0)\\n\\n return -3;\\n\\n\\n\\n strcpy(copyString, theString);\\n\\n\\n\\n nextStrings[numStrings] = copyString;\\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.cpp\",\n \"rank\": 27,\n \"score\": 70424.69060921413\n },\n {\n \"content\": \"}\\n\\n\\n\\nStringContainer::~StringContainer()\\n\\n{\\n\\n this->clear();\\n\\n}\\n\\n\\n\\n\\n\\nconst char *\\n\\nStringContainer::getString(int num) const\\n\\n{\\n\\n if (num >= 0 && num < numStrings)\\n\\n return strings[num];\\n\\n\\n\\n return 0;\\n\\n}\\n\\n\\n\\n\\n\\nint\\n\\nStringContainer::getNumStrings(void) const\\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.cpp\",\n \"rank\": 28,\n \"score\": 70424.52746534465\n },\n {\n \"content\": \"}\\n\\n\\n\\nStringContainer::~StringContainer()\\n\\n{\\n\\n this->clear();\\n\\n}\\n\\n\\n\\n\\n\\nconst char *\\n\\nStringContainer::getString(int num) const\\n\\n{\\n\\n if (num >= 0 && num < numStrings)\\n\\n return strings[num];\\n\\n\\n\\n return 0;\\n\\n}\\n\\n\\n\\n\\n\\nint\\n\\nStringContainer::getNumStrings(void) const\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.cpp\",\n \"rank\": 29,\n \"score\": 70424.52746534465\n },\n {\n \"content\": \"\\n\\n\\n\\n // delete old array and reset the array pointer\\n\\n if (strings != 0)\\n\\n delete [] strings;\\n\\n strings = nextStrings;\\n\\n \\n\\n // increment number of files\\n\\n numStrings++;\\n\\n\\n\\n // return ok\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.cpp\",\n \"rank\": 30,\n \"score\": 70424.26545425721\n },\n {\n \"content\": \"\\n\\n\\n\\n // delete old array and reset the array pointer\\n\\n if (strings != 0)\\n\\n delete [] strings;\\n\\n strings = nextStrings;\\n\\n \\n\\n // increment number of files\\n\\n numStrings++;\\n\\n\\n\\n // return ok\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.cpp\",\n \"rank\": 31,\n \"score\": 70424.26545425721\n },\n {\n \"content\": \"/* ****************************************************************** **\\n\\n** OpenSees - Open System for Earthquake Engineering Simulation **\\n\\n** Pacific Earthquake Engineering Research Center **\\n\\n** **\\n\\n** **\\n\\n** (C) Copyright 1999, The Regents of the University of California **\\n\\n** All Rights Reserved. **\\n\\n** **\\n\\n** Commercial use of this program without express permission of the **\\n\\n** University of California, Berkeley, is strictly prohibited. See **\\n\\n** file 'COPYRIGHT' in main directory for information on usage and **\\n\\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\\n\\n** **\\n\\n** Developed by: **\\n\\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\\n\\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\\n\\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\\n\\n** **\\n\\n** ****************************************************************** */\\n\\n \\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/StringContainer.cpp\",\n \"rank\": 32,\n \"score\": 70414.4173485071\n },\n {\n \"content\": \"/* ****************************************************************** **\\n\\n** OpenSees - Open System for Earthquake Engineering Simulation **\\n\\n** Pacific Earthquake Engineering Research Center **\\n\\n** **\\n\\n** **\\n\\n** (C) Copyright 1999, The Regents of the University of California **\\n\\n** All Rights Reserved. **\\n\\n** **\\n\\n** Commercial use of this program without express permission of the **\\n\\n** University of California, Berkeley, is strictly prohibited. See **\\n\\n** file 'COPYRIGHT' in main directory for information on usage and **\\n\\n** redistribution, and for a DISCLAIMER OF ALL WARRANTIES. **\\n\\n** **\\n\\n** Developed by: **\\n\\n** Frank McKenna (fmckenna@ce.berkeley.edu) **\\n\\n** Gregory L. Fenves (fenves@ce.berkeley.edu) **\\n\\n** Filip C. Filippou (filippou@ce.berkeley.edu) **\\n\\n** **\\n\\n** ****************************************************************** */\\n\\n \\n\",\n \"file_path\": \"OpenSees/SRC/utility/StringContainer.cpp\",\n \"rank\": 33,\n \"score\": 70414.4173485071\n },\n {\n \"content\": \"EXTERN char *\\t\\tTkTilePrintProc _ANSI_ARGS_((\\n\\n\\t\\t\\t ClientData clientData, Tk_Window tkwin,\\n\\n\\t\\t\\t char *widgRec, int offset,\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkInt.h\",\n \"rank\": 34,\n \"score\": 64706.458450482445\n },\n {\n \"content\": \"extern int\\t\\tread _ANSI_ARGS_((int fd, char *buf, int numBytes));\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkConfig.h\",\n \"rank\": 35,\n \"score\": 64706.458450482445\n },\n {\n \"content\": \"\\tregoff_t rm_so;\\t\\t/* start of substring */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 36,\n \"score\": 64706.458450482445\n },\n {\n \"content\": \" rm_detail_t details;\\t/* Detailed information on match (currently\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tclRegexp.h\",\n \"rank\": 37,\n \"score\": 63446.28966791192\n },\n {\n \"content\": \"EXTERN LRESULT CALLBACK\\tTkWinChildProc _ANSI_ARGS_((HWND hwnd, UINT message,\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkWinInt.h\",\n \"rank\": 38,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tchar *re_guts;\\t\\t/* `char *' is more portable than `void *' */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 39,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tregoff_t rm_eo;\\t\\t/* end of substring */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 40,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tregmatch_t rm_extend;\\t/* see REG_EXPECT */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 41,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"extern uid_t\\t\\tgetuid _ANSI_ARGS_((void));\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkConfig.h\",\n \"rank\": 42,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"extern int\\t\\tread _ANSI_ARGS_((int fd, char *buf, int numBytes));\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkConfig.h\",\n \"rank\": 43,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tchar *re_fns;\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 44,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \" regex_t re;\\t\\t\\t/* Compiled re, includes number of\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tclRegexp.h\",\n \"rank\": 45,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tlong re_info;\\t\\t/* information about RE */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 46,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \" int (*tclFileAttrsCmd) _ANSI_ARGS_((Tcl_Interp * interp, int objc, Tcl_Obj *CONST objv[])); /* 17 */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tclIntDecls.h\",\n \"rank\": 47,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tint re_magic;\\t\\t/* magic number */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 48,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tsize_t re_nsub;\\t\\t/* number of subexpressions */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 49,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"extern int errno;\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkConfig.h\",\n \"rank\": 50,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \" regmatch_t *matches;\\t/* Array of indices into the Tcl_UniChar\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tclRegexp.h\",\n \"rank\": 51,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tchar *re_endp;\\t\\t/* backward compatibility kludge */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 52,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"\\tint re_csize;\\t\\t/* sizeof(character) */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/regex.h\",\n \"rank\": 53,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \" int flags;\\t\\t\\t/* Regexp compile flags. */\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tclRegexp.h\",\n \"rank\": 54,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"extern int\\t\\tclose _ANSI_ARGS_((int fd));\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/include/tkConfig.h\",\n \"rank\": 55,\n \"score\": 63438.87066185596\n },\n {\n \"content\": \"#include <Renderer.h>\\n\\n#include <Domain.h>\\n\\n#include <string.h> \\n\\n\\n\\n#include <OPS_Globals.h>\\n\\n\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n\\n\\n#include <NDMaterial.h>\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n#include <ID.h>\\n\\n#include <Renderer.h>\\n\\n#include <Domain.h>\\n\\n#include <string.h>\\n\\n#include <Information.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <ElementResponse.h>\\n\\n\\n\\n#include <ElementalLoad.h>\\n\\n\\n\\n#define ELE_TAG_VS3D4QuadWithSensitivity 100003\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/XMUelements/VS3D4QuadWithSensitivity.h\",\n \"rank\": 57,\n \"score\": 17.77796978704837\n },\n {\n \"content\": \"#include <ID.h>\\n\\n#include <Renderer.h>\\n\\n#include <Domain.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <OPS_Globals.h>\\n\\n\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n\\n\\n#include <NDMaterial.h>\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n#include <ID.h>\\n\\n#include <Renderer.h>\\n\\n#include <Domain.h>\\n\\n#include <string.h>\\n\\n#include <Information.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <ElementResponse.h>\\n\\n\\n\\n#include <ElementalLoad.h>\\n\\n\\n\\n#define ELE_TAG_AV3D4QuadWithSensitivity 100009\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/XMUelements/AV3D4QuadWithSensitivity.h\",\n \"rank\": 58,\n \"score\": 17.725309642831554\n },\n {\n \"content\": \"// Written: Minjie\\n\\n\\n\\n// Description: misc commands\\n\\n\\n\\n#include <elementAPI.h>\\n\\n#include <Domain.h>\\n\\n#include <LoadPattern.h>\\n\\n#include <LoadPatternIter.h>\\n\\n#include <ElementalLoadIter.h>\\n\\n#include <Element.h>\\n\\n#include <Parameter.h>\\n\\n#include <Node.h>\\n\\n#include <Pressure_Constraint.h>\\n\\n#include <TimeSeries.h>\\n\\n#include <SP_Constraint.h>\\n\\n#include <Matrix.h>\\n\\n#include <MeshRegion.h>\\n\\n#include <StringContainer.h>\\n\\n#include <fstream>\\n\\n#include <string>\\n\",\n \"file_path\": \"OpenSees/SRC/interpreter/OpenSeesMiscCommands.cpp\",\n \"rank\": 59,\n \"score\": 17.715267914550736\n },\n {\n \"content\": \"#include <Python.h>\\n\\n#include <elementAPI.h>\\n\\n#include <ElasticMaterial.cpp>\\n\\n\\n\\n#include <UniaxialMaterial.h>\\n\\n#include <string.h>\\n\\n#include <string>\\n\\n#include <ID.h>\\n\\n\\n\\n#include <StandardStream.h>\\n\\nStandardStream sserr;\\n\\nOPS_Stream *opserrPtr = &sserr;\\n\\n\\n\\n#include <SimulationInformation.h>\\n\\nSimulationInformation simulationInfo;\\n\\nSimulationInformation *theSimulationInfoPtr = 0;\\n\\n\\n\\n#include <FE_Datastore.h>\\n\\nFE_Datastore *theDatabase =0;\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/interpreter/OpenSeesCommandsPython.cpp\",\n \"rank\": 60,\n \"score\": 17.43460785467558\n },\n {\n \"content\": \"#include <FrictionModel.h>\\n\\n#include <UniaxialMaterial.h>\\n\\n\\n\\n#include <float.h>\\n\\n#include <math.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <elementAPI.h>\\n\\n#include <string>\\n\\n\\n\\nvoid* OPS_RJWatsonEQS3d()\\n\\n{\\n\\n int ndf = OPS_GetNDF();\\n\\n if (ndf != 6) {\\n\\n opserr << \\\"WARNING invalid ndf: \\\" << ndf;\\n\\n opserr << \\\", for space problem need 6 - RJWatsonEqsBearing \\\\n\\\";\\n\\n return 0;\\n\\n }\\n\\n \\n\",\n \"file_path\": \"OpenSees/SRC/element/frictionBearing/RJWatsonEQS3d.cpp\",\n \"rank\": 61,\n \"score\": 17.424638961533294\n },\n {\n \"content\": \"// $Revision: 1.3 $\\n\\n// $Date: 2002-12-05 22:49:09 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/material/nD/J2BeamFiber3d.cpp,v $\\n\\n\\n\\n// Written: MHS\\n\\n// Created: Aug 2001\\n\\n//\\n\\n// Description: Elastic isotropic model where stress \\n\\n// components 22, 33, 13, and 23 are condensed out.\\n\\n\\n\\n#include <J2BeamFiber3d.h> \\n\\n#include <Channel.h>\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n#include <float.h>\\n\\n\\n\\n#include <OPS_Globals.h>\\n\\n#include <elementAPI.h>\\n\\n#include <string.h>\\n\\n#include <stdlib.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/nD/J2BeamFiber3d.cpp\",\n \"rank\": 62,\n \"score\": 17.296809401719447\n },\n {\n \"content\": \"// $Revision: 1.3 $\\n\\n// $Date: 2002-12-05 22:49:09 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/material/nD/J2PlateFibre.cpp,v $\\n\\n\\n\\n// Written: MHS\\n\\n// Created: Aug 2001\\n\\n//\\n\\n// Description: Elastic isotropic model where stress \\n\\n// components 22, 33, 13, and 23 are condensed out.\\n\\n\\n\\n#include <J2PlateFibre.h> \\n\\n#include <Channel.h>\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n#include <float.h>\\n\\n\\n\\n#include <OPS_Globals.h>\\n\\n#include <elementAPI.h>\\n\\n#include <string.h>\\n\\n#include <stdlib.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/nD/J2PlateFibre.cpp\",\n \"rank\": 63,\n \"score\": 17.296809401719447\n },\n {\n \"content\": \"// $Revision: 1.3 $\\n\\n// $Date: 2002-12-05 22:49:09 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/material/nD/J2BeamFiber2d.cpp,v $\\n\\n\\n\\n// Written: MHS\\n\\n// Created: Aug 2001\\n\\n//\\n\\n// Description: Elastic isotropic model where stress \\n\\n// components 22, 33, 13, and 23 are condensed out.\\n\\n\\n\\n#include <J2BeamFiber2d.h> \\n\\n#include <Channel.h>\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n#include <float.h>\\n\\n\\n\\n#include <OPS_Globals.h>\\n\\n#include <elementAPI.h>\\n\\n#include <string.h>\\n\\n#include <stdlib.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/nD/J2BeamFiber2d.cpp\",\n \"rank\": 64,\n \"score\": 17.296809401719447\n },\n {\n \"content\": \"// $Revision: 1.10 $\\n\\n// $Date: 2009-10-13 21:17:42 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/DataFileStream.cpp,v $\\n\\n\\n\\n\\n\\n#include <DataFileStream.h>\\n\\n#include <Vector.h>\\n\\n#include <iostream>\\n\\n#include <iomanip>\\n\\n#include <string>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <Message.h>\\n\\n#include <Matrix.h>\\n\\n\\n\\nusing std::cerr;\\n\\nusing std::ios;\\n\\nusing std::setiosflags;\\n\\nusing std::ifstream;\\n\\nusing std::string;\\n\",\n \"file_path\": \"OpenSees/SRC/handler/DataFileStream.cpp\",\n \"rank\": 65,\n \"score\": 17.25087624475745\n },\n {\n \"content\": \"// $Revision: 1.10 $\\n\\n// $Date: 2009-10-13 21:17:42 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/DataFileStream.cpp,v $\\n\\n\\n\\n\\n\\n#include <DataFileStream.h>\\n\\n#include <Vector.h>\\n\\n#include <iostream>\\n\\n#include <iomanip>\\n\\n#include <string>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <Message.h>\\n\\n#include <Matrix.h>\\n\\n\\n\\nusing std::cerr;\\n\\nusing std::ios;\\n\\nusing std::setiosflags;\\n\\nusing std::ifstream;\\n\\nusing std::string;\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/DataFileStream.cpp\",\n \"rank\": 66,\n \"score\": 17.25087624475745\n },\n {\n \"content\": \"//#include <MaterialResponse.h>\\n\\n#include <Parameter.h>\\n\\n\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <string.h>\\n\\n\\n\\n\\n\\n#include <elementAPI.h>\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/material/nD/UWmaterials/PM4Silt.h\",\n \"rank\": 67,\n \"score\": 17.234277915605155\n },\n {\n \"content\": \"//#include <MaterialResponse.h>\\n\\n#include <Parameter.h>\\n\\n\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <string.h>\\n\\n\\n\\n\\n\\n#include <elementAPI.h>\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/material/nD/UWmaterials/PM4Sand.h\",\n \"rank\": 68,\n \"score\": 17.234277915605155\n },\n {\n \"content\": \"// $Revision: 1.9 $\\n\\n// $Date: 2009-03-27 19:18:14 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/File.cpp,v $\\n\\n \\n\\n \\n\\n// Written: fmk \\n\\n// Created: 09/07\\n\\n//\\n\\n// Description: This file contains the class definition for File used in SimulationINformation.\\n\\n\\n\\n\\n\\n#include <map>\\n\\n#include <string.h>\\n\\n//#include <string>\\n\\n//using namespace std;\\n\\n\\n\\n\\n\\n\\n\\n#include <File.h>\\n\\n#include <FileIter.h>\\n\",\n \"file_path\": \"OpenSees/SRC/utility/File.cpp\",\n \"rank\": 69,\n \"score\": 17.22450903194889\n },\n {\n \"content\": \"// $Revision: 1.9 $\\n\\n// $Date: 2009-03-27 19:18:14 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/File.cpp,v $\\n\\n \\n\\n \\n\\n// Written: fmk \\n\\n// Created: 09/07\\n\\n//\\n\\n// Description: This file contains the class definition for File used in SimulationINformation.\\n\\n\\n\\n\\n\\n#include <map>\\n\\n#include <string.h>\\n\\n//#include <string>\\n\\n//using namespace std;\\n\\n\\n\\n\\n\\n\\n\\n#include <File.h>\\n\\n#include <FileIter.h>\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/File.cpp\",\n \"rank\": 70,\n \"score\": 17.22450903194889\n },\n {\n \"content\": \"// $Revision: 1.19 $\\n\\n// $Date: 2010-06-09 17:43:09 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/domain/pattern/LoadPattern.cpp,v $\\n\\n \\n\\n// Written: fmk 07/99\\n\\n// Revised:\\n\\n//\\n\\n// Purpose: This file contains the method definitions for class LoadPattern.\\n\\n// LoadPattern is a container class.\\n\\n//\\n\\n// The LoadPattern interface:\\n\\n\\n\\n#include <string.h>\\n\\n#include <string>\\n\\n#include <stdlib.h>\\n\\n\\n\\n#include <LoadPattern.h>\\n\\n#include <stdlib.h>\\n\\n#include <ID.h>\\n\\n#include <TimeSeries.h>\\n\",\n \"file_path\": \"OpenSees/SRC/domain/pattern/LoadPattern.cpp\",\n \"rank\": 71,\n \"score\": 17.18986618884449\n },\n {\n \"content\": \"#define VOID void\\n\\n\\n\\nextern \\\"C\\\" {\\n\\n#include <triangle.h>\\n\\n}\\n\\n#include <string>\\n\\n#include <Vector.h>\\n\\n#include <map>\\n\\n#include <vector>\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/PFEMElement/PFEMMesher2D.h\",\n \"rank\": 72,\n \"score\": 17.166635698886402\n },\n {\n \"content\": \"// $Revision: 1.10 $\\n\\n// $Date: 2009-10-13 21:17:42 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/DataFileStreamAdd.cpp,v $\\n\\n\\n\\n\\n\\n#include <DataFileStreamAdd.h>\\n\\n#include <Vector.h>\\n\\n#include <iostream>\\n\\n#include <iomanip>\\n\\n#include <string>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <Message.h>\\n\\n#include <Matrix.h>\\n\\n\\n\\nusing std::cerr;\\n\\nusing std::ios;\\n\\nusing std::setiosflags;\\n\\nusing std::ifstream;\\n\\nusing std::string;\\n\",\n \"file_path\": \"OpenSees/SRC/handler/DataFileStreamAdd.cpp\",\n \"rank\": 73,\n \"score\": 17.159981862492756\n },\n {\n \"content\": \"// $Revision: 1.13 $\\n\\n// $Date: 2009-10-13 21:17:42 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/XmlFileStream.cpp,v $\\n\\n\\n\\n#include <XmlFileStream.h>\\n\\n#include <Vector.h>\\n\\n#include <Matrix.h>\\n\\n#include <iostream>\\n\\n#include <iomanip>\\n\\n#include <string>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <Message.h>\\n\\n\\n\\nusing std::cerr;\\n\\nusing std::ios;\\n\\nusing std::setiosflags;\\n\\nusing std::string;\\n\\nusing std::ifstream;\\n\\nusing std::getline;\\n\",\n \"file_path\": \"OpenSees/SRC/handler/XmlFileStream.cpp\",\n \"rank\": 74,\n \"score\": 17.115012755363686\n },\n {\n \"content\": \"// $Revision: 1.3 $\\n\\n// $Date: 2009-04-30 23:23:04 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/BinaryFileStream.cpp,v $\\n\\n\\n\\n#include <BinaryFileStream.h>\\n\\n#include <Vector.h>\\n\\n#include <iostream>\\n\\n#include <iomanip>\\n\\n#include <string>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <Message.h>\\n\\n#include <Matrix.h>\\n\\n\\n\\nusing std::cerr;\\n\\nusing std::ios;\\n\\nusing std::setiosflags;\\n\\nusing std::ifstream;\\n\\nusing std::string;\\n\\nusing std::getline;\\n\",\n \"file_path\": \"OpenSees/DEVELOPER/core/BinaryFileStream.cpp\",\n \"rank\": 75,\n \"score\": 17.115012755363686\n },\n {\n \"content\": \"// $Revision: 1.3 $\\n\\n// $Date: 2009-04-30 23:23:04 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/handler/BinaryFileStream.cpp,v $\\n\\n\\n\\n#include <BinaryFileStream.h>\\n\\n#include <Vector.h>\\n\\n#include <iostream>\\n\\n#include <iomanip>\\n\\n#include <string>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <Message.h>\\n\\n#include <Matrix.h>\\n\\n\\n\\nusing std::cerr;\\n\\nusing std::ios;\\n\\nusing std::setiosflags;\\n\\nusing std::ifstream;\\n\\nusing std::string;\\n\\nusing std::getline;\\n\",\n \"file_path\": \"OpenSees/SRC/handler/BinaryFileStream.cpp\",\n \"rank\": 76,\n \"score\": 17.115012755363686\n },\n {\n \"content\": \"#include <Node.h>\\n\\n\\n\\n#include \\\"FiberSection2dInt.h\\\"\\n\\n\\n\\n#include \\\"LinearCrdTransf2dInt.h\\\"\\n\\n\\n\\n#include <Matrix.h>\\n\\n\\n\\n#include <Vector.h>\\n\\n\\n\\n#include <ID.h>\\n\\n\\n\\n#include <Renderer.h>\\n\\n\\n\\n#include <Domain.h>\\n\\n\\n\\n#include <string.h>\\n\\n\\n\\n#include <Information.h>\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/dispBeamColumnInt/DispBeamColumn2dInt.cpp\",\n \"rank\": 77,\n \"score\": 16.922035577828062\n },\n {\n \"content\": \"// $Revision: 1.4 $\\n\\n// $Date: 2008-10-09 21:33:06 $\\n\\n// $Source: /usr/local/cvs/OpenSees/SRC/utility/PeerNGA.cpp,v $\\n\\n \\n\\n \\n\\n// Written: fmk \\n\\n// Created: 09/07\\n\\n//\\n\\n// Description: This file contains the class definition for File used in SimulationINformation.\\n\\n//\\n\\n// What: \\\"@(#) SimulationInformation.h, revA\\\"\\n\\n\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n#include <StringContainer.h>\\n\\n\\n\\n\\n\\n#ifdef _WIN32\\n\",\n \"file_path\": \"OpenSees/SRC/utility/PeerNGA.cpp\",\n \"rank\": 78,\n \"score\": 16.85636232218225\n },\n {\n \"content\": \"#include \\\"DRMInputHandler.h\\\"\\n\\n#include <Vector.h>\\n\\n#include <ID.h>\\n\\n#include <Message.h>\\n\\n#include <Matrix.h>\\n\\n#include <Element.h>\\n\\n#include <map>\\n\\n#include <set>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <string>\\n\\n#include <classTags.h>\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/domain/pattern/drm/DRMLoadPatternWrapper.h\",\n \"rank\": 79,\n \"score\": 16.83406736540883\n },\n {\n \"content\": \"//\\n\\n\\n\\n// Description: This file contains the implementation of the\\n\\n\\n\\n// \\n\\n\\n\\n//\\n\\n\\n\\n// Jinchi Lu and Zhaohui Yang (May 2004)\\n\\n\\n\\n\\n\\n\\n\\n#include <stdlib.h>\\n\\n\\n\\n#include <string.h>\\n\\n\\n\\n#include <Domain.h>\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/brick/TclTwenty_Node_BrickCommand.cpp\",\n \"rank\": 80,\n \"score\": 16.606763562714068\n },\n {\n \"content\": \"// $Revision: 1.0 $\\n\\n// $Date: 2019-08-22 $\\n\\n\\n\\n// Written: Kuanshi Zhong \\n\\n// Created: 07/2019\\n\\n//\\n\\n\\n\\n#include <math.h>\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <MaterialResponse.h>\\n\\n#include <Information.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <DuctileFracture.h>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n\\n\\n#include <OPS_Globals.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/uniaxial/DuctileFracture.cpp\",\n \"rank\": 81,\n \"score\": 16.53992078411818\n },\n {\n \"content\": \"\\n\\n// $Revision$\\n\\n// $Date$\\n\\n// $Source$\\n\\n\\n\\n// Written: MHS\\n\\n// Created: 2012\\n\\n//\\n\\n// Description: This file contains the class implementation of FiberSection2d.\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n\\n\\n#include <Channel.h>\\n\\n#include <Vector.h>\\n\\n#include <Matrix.h>\\n\\n#include <MatrixUtil.h>\\n\\n#include <Fiber.h>\\n\\n#include <classTags.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/section/NDFiberSectionWarping2d.cpp\",\n \"rank\": 82,\n \"score\": 16.466375446512842\n },\n {\n \"content\": \"#include <vector>\\n\\n#include <ConfinedConcrete01.h>\\n\\n\\n\\n#include <Matrix.h>\\n\\n#include <Parameter.h>\\n\\n\\n\\n#include <math.h>\\n\\n#include <float.h>\\n\\n#include <stdio.h>\\n\\n#include <string.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <elementAPI.h>\\n\\n\\n\\n#define OPS_Export \\n\\n#define PI 3.14159265358979323846\\n\\n\\n\\n/*\\n\\nUSER INPUT PARAMETERS\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/material/uniaxial/ConfinedConcrete01.cpp\",\n \"rank\": 83,\n \"score\": 16.423526578161216\n },\n {\n \"content\": \"// $Revision$\\n\\n// $Date$\\n\\n// $Source$\\n\\n\\n\\n// Written: MHS\\n\\n// Created: Dec 2012\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <math.h>\\n\\n\\n\\n#include <InitStressNDMaterial.h>\\n\\n#include <Matrix.h>\\n\\n#include <ID.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <OPS_Globals.h>\\n\\n\\n\\n#include <elementAPI.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/nD/InitStressNDMaterial.cpp\",\n \"rank\": 84,\n \"score\": 16.359611240155033\n },\n {\n \"content\": \"#include <elementAPI.h>\\n\\n\\n\\n#include <float.h>\\n\\n#include <math.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <G3Globals.h>\\n\\n#include <Message.h>\\n\\nusing namespace std;\\n\\n#include <iostream>\\n\\n\\n\\n#define PI 3.14159l\\n\\n\\n\\n\\n\\n// initialize the class wide variables\\n\\nMatrix HDR::theMatrix(12,12);\\n\\nVector HDR::theVector(12);\\n\\n\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/elastomericBearing/HDR.cpp\",\n \"rank\": 85,\n \"score\": 16.31248934073788\n },\n {\n \"content\": \"#include <N4BiaxialTruss.h>\\n\\n#include <Information.h>\\n\\n#include <Parameter.h>\\n\\n\\n\\n#include <Domain.h>\\n\\n#include <Node.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <UniaxialMaterial.h>\\n\\n#include <Renderer.h>\\n\\n\\n\\n#include <math.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <ElementResponse.h>\\n\\n#include <CompositeResponse.h>\\n\\n#include <ConcretewBeta.h>\\n\\n\\n\\n//#include <fstream>\\n\",\n \"file_path\": \"OpenSees/SRC/element/truss/N4BiaxialTruss.cpp\",\n \"rank\": 86,\n \"score\": 16.311998381935606\n },\n {\n \"content\": \"// $Revision$\\n\\n// $Date$\\n\\n// $Source$\\n\\n\\n\\n// Written: MHS\\n\\n// Created: 2012\\n\\n//\\n\\n// Description: This file contains the class implementation of FiberSection2d.\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n\\n\\n#include <Channel.h>\\n\\n#include <Vector.h>\\n\\n#include <Matrix.h>\\n\\n#include <MatrixUtil.h>\\n\\n#include <Fiber.h>\\n\\n#include <classTags.h>\\n\\n#include <NDFiberSection2d.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/section/NDFiberSection2d.cpp\",\n \"rank\": 87,\n \"score\": 16.300985977144236\n },\n {\n \"content\": \"// $Revision$\\n\\n// $Date$\\n\\n// $Source$\\n\\n\\n\\n// Written: MHS\\n\\n// Created: 2012\\n\\n//\\n\\n// Description: This file contains the class implementation of FiberSection3d.\\n\\n\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n#include <math.h>\\n\\n\\n\\n#include <Channel.h>\\n\\n#include <Vector.h>\\n\\n#include <Matrix.h>\\n\\n#include <MatrixUtil.h>\\n\\n#include <Fiber.h>\\n\\n#include <classTags.h>\\n\\n#include <NDFiberSection3d.h>\\n\",\n \"file_path\": \"OpenSees/SRC/material/section/NDFiberSection3d.cpp\",\n \"rank\": 88,\n \"score\": 16.300985977144236\n },\n {\n \"content\": \"#include <iomanip>\\n\\nusing std::ios;\\n\\n#include <iostream>\\n\\nusing std::ofstream;\\n\\n \\n\\n#else\\n\\n\\n\\n#include <StandardStream.h>\\n\\n#include <FileStream.h>\\n\\n#include <DummyStream.h>\\n\\n\\n\\nStandardStream sserr;\\n\\nOPS_Stream *opserrPtr = &sserr;\\n\\n\\n\\n#endif\\n\\n\\n\\n\\n\\n#include <stdio.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/commands.cpp\",\n \"rank\": 89,\n \"score\": 16.24982363479195\n },\n {\n \"content\": \"\\n\\n#include <string.h>\\n\\n\\n\\n#ifdef _WGL\\n\\n#include <windows.h>\\n\\n//#include <GL/glaux.h>\\n\\n#include <GL/glu.h>\\n\\n#include <GL/gl.h>\\n\\n\\n\\n#elif _GLX\\n\\n\\n\\n#include <GL/gl.h>\\n\\n#include <GL/glx.h>\\n\\n#include <GL/glu.h>\\n\\n\\n\\n#elif _AGL\\n\\n\\n\\n#include <OpenGL/glu.h>\\n\\n#include <OpenGL/gl.h>\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/renderer/OpenGlRenderer.cpp\",\n \"rank\": 90,\n \"score\": 16.243073387165957\n },\n {\n \"content\": \"\",\n \"file_path\": \"OpenSees/SRC/material/nD/FSAM.cpp\",\n \"rank\": 91,\n \"score\": 16.243073387165957\n },\n {\n \"content\": \"#include <string.h>\\n\\n\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n#include <ID.h>\\n\\n#include <ArrayOfTaggedObjects.h>\\n\\n\\n\\n#include <Domain.h>\\n\\n#include <Node.h>\\n\\n#include <NodeIter.h>\\n\\n#include <SP_Constraint.h>\\n\\n#include <SP_ConstraintIter.h>\\n\\n#include <MP_Constraint.h>\\n\\n\\n\\n#include <RigidRod.h>\\n\\n#include <RigidBeam.h>\\n\\n#include <RigidDiaphragm.h>\\n\\n\\n\\n#include <CrdTransf.h>\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/modelbuilder/tcl/TclModelBuilder.cpp\",\n \"rank\": 92,\n \"score\": 16.227540092122023\n },\n {\n \"content\": \"\",\n \"file_path\": \"OpenSees/SRC/element/HUelements/MultipleNormalSpring.cpp\",\n \"rank\": 93,\n \"score\": 16.227540092122023\n },\n {\n \"content\": \"#include <Node.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <Renderer.h>\\n\\n#include <Information.h>\\n\\n#include <ElementResponse.h>\\n\\n\\n\\n#include <ID.h>\\n\\n#include <Vector.h>\\n\\n\\n\\n#include <float.h>\\n\\n#define _USE_MATH_DEFINES\\n\\n#include <math.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n#include <elementAPI.h>\\n\\n\\n\\nvoid* OPS_YamamotoBiaxialHDR()\\n\\n{\\n\\n // 3-dim, 6-dof\\n\",\n \"file_path\": \"OpenSees/SRC/element/HUelements/YamamotoBiaxialHDR.cpp\",\n \"rank\": 94,\n \"score\": 16.197006858886624\n },\n {\n \"content\": \"\\n\\n#include <string.h>\\n\\n\\n\\n#include <math.h>\\n\\n#include <float.h>\\n\\n\\n\\n\\n\\n#include <elementAPI.h>\\n\\n#include <OPS_Globals.h>\\n\\n\\n\\n\\n\\n//#include <iostream>\\n\\n//#include <fstream>\\n\\n//using namespace std;\\n\\n\\n\\nvoid *\\n\\nOPS_DoddRestr(void)\\n\\n{\\n\\n // Pointer to a uniaxial material that will be returned\\n\\n UniaxialMaterial *theMaterial = 0;\\n\",\n \"file_path\": \"OpenSees/SRC/material/uniaxial/DoddRestr.cpp\",\n \"rank\": 95,\n \"score\": 16.196823805765007\n },\n {\n \"content\": \"#include <string.h>\\n\\n\\n\\n#include <Renderer.h>\\n\\n\\n\\n#ifndef _NOGRAPHICS\\n\\n\\n\\n#ifdef _WGL\\n\\n#include <OpenGLRenderer.h>\\n\\n#elif _GLX\\n\\n#include <OpenGLRenderer.h>\\n\\n#elif _AGL\\n\\n#include <OpenGLRenderer.h>\\n\\n#else\\n\\n#include <X11Renderer.h>\\n\\n#endif\\n\\n\\n\\n#endif\\n\\n\\n\\n#include <PlainMap.h>\\n\\n#include \\\"TclVideoPlayer.h\\\"\\n\",\n \"file_path\": \"OpenSees/SRC/tcl/TclVideoPlayer.cpp\",\n \"rank\": 96,\n \"score\": 16.187916609939755\n },\n {\n \"content\": \"#include <elementAPI.h>\\n\\n\\n\\n#include <float.h>\\n\\n#include <math.h>\\n\\n#include <stdlib.h>\\n\\n#include <string.h>\\n\\n\\n\\n#include <G3Globals.h>\\n\\n#include <Message.h>\\n\\nusing namespace std;\\n\\n#include <iostream>\\n\\n\\n\\n#define PI 3.14159l\\n\\n\\n\\n\\n\\n// initialize the class wide variables\\n\\nMatrix ElastomericX::theMatrix(12,12);\\n\\nVector ElastomericX::theVector(12);\\n\\n\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/elastomericBearing/ElastomericX.cpp\",\n \"rank\": 97,\n \"score\": 16.187916609939755\n },\n {\n \"content\": \"\\n\\n#include <OPS_Globals.h>\\n\\n\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n\\n\\n#include <NDMaterial.h>\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n#include <ID.h>\\n\\n#include <Renderer.h>\\n\\n#include <Domain.h>\\n\\n#include <string.h>\\n\\n#include <Information.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <ElementResponse.h>\\n\\n\\n\\n#include <ElementalLoad.h>\\n\\n\\n\\n#define ELE_TAG_ASI3D8QuadWithSensitivity 100002\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/XMUelements/ASI3D8QuadWithSensitivity.h\",\n \"rank\": 98,\n \"score\": 16.177180106444982\n },\n {\n \"content\": \"\\n\\n#include <OPS_Globals.h>\\n\\n\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n\\n\\n#include <NDMaterial.h>\\n\\n#include <Matrix.h>\\n\\n#include <Vector.h>\\n\\n#include <ID.h>\\n\\n#include <Renderer.h>\\n\\n#include <Domain.h>\\n\\n#include <string.h>\\n\\n#include <Information.h>\\n\\n#include <Channel.h>\\n\\n#include <FEM_ObjectBroker.h>\\n\\n#include <ElementResponse.h>\\n\\n\\n\\n#include <ElementalLoad.h>\\n\\n\\n\\n\\n\\n#define ELE_TAG_AC3D8HexWithSensitivity 100001\\n\\n\\n\",\n \"file_path\": \"OpenSees/SRC/element/XMUelements/AC3D8HexWithSensitivity.h\",\n \"rank\": 99,\n \"score\": 16.177180106444982\n }\n]","isConversational":false}}},{"rowIdx":487,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"OpenTES4/bsa.cpp"},"repo_name":{"kind":"string","value":"Cyril-Meyer/OpenTES4Oblivion"},"commit":{"kind":"string","value":"dc2791a5a7ea911d0960d79ce0b9445fcbe329ee"},"file_code":{"kind":"string","value":"#include \"bsa.h\"\n\nBSA::BSA() {}\n\nvoid BSA::summary()\n{\n std::cout << \"header\" << std::endl;\n std::cout << this->header.fileId << std::endl;\n std::cout << this->header.version << std::endl;\n std::cout << this->header.offset << std::endl;\n std::cout << this->header.archiveFlags << std::endl;\n std::cout << this->header.folderCount << std::endl;\n std::cout << this->header.fileCount << std::endl;\n std::cout << this->header.totalFolderNameLength << std::endl;\n std::cout << this->header.totalFileNameLength << std::endl;\n std::cout << this->header.fileFlags << std::endl;\n\n std::cout << \"folderRecords\" << std::endl;\n for (std::size_t i = 0; i < this->header.folderCount; ++i) {\n std::cout << this->folderRecords[i].nameHash << std::endl;\n std::cout << this->folderRecords[i].count << std::endl;\n std::cout << this->folderRecords[i].offset << std::endl;\n }\n\n std::cout << \"fileRecordBlocks\" << std::endl;\n std::bitset<32> archiveFlags(this->header.archiveFlags);\n for (std::size_t i = 0; i < this->fileRecordBlocks.size(); ++i) {\n\n if (archiveFlags.test(0)) {\n std::cout << this->fileRecordBlocks[i].name.data << std::endl;\n }\n\n for (std::size_t j = 0;\n j < this->fileRecordBlocks[i].fileRecords.size(); ++j) {\n std::cout << \" \"\n << this->fileRecordBlocks[i].fileRecords[j].nameHash\n << std::endl;\n std::cout << \" \" << this->fileRecordBlocks[i].fileRecords[j].size\n << std::endl;\n std::cout << \" \"\n << this->fileRecordBlocks[i].fileRecords[j].offset\n << std::endl;\n }\n }\n\n std::cout << \"fileNameBlock\" << std::endl;\n if (archiveFlags.test(1)) {\n for (std::size_t i = 0; i < this->header.fileCount; i++) {\n std::cout << this->fileNameBlock.fileNames[i].data << std::endl;\n }\n }\n}\n\nstd::istream& operator>>(std::istream& is, BSA& bsa)\n{\n \n auto read = [](std::istream& is, void* dataptr, uint64_t datasize) {\n is.read(reinterpret_cast<char*>(dataptr), datasize);\n };\n\n \n read(is, &bsa.header.fileId, sizeof(bsa.header.fileId));\n read(is, &bsa.header.version, sizeof(bsa.header.version));\n\n read(is, &bsa.header.offset, sizeof(bsa.header.offset));\n read(is, &bsa.header.archiveFlags, sizeof(bsa.header.archiveFlags));\n read(is, &bsa.header.folderCount, sizeof(bsa.header.folderCount));\n read(is, &bsa.header.fileCount, sizeof(bsa.header.fileCount));\n read(is, &bsa.header.totalFolderNameLength,\n sizeof(bsa.header.totalFolderNameLength));\n read(is, &bsa.header.totalFileNameLength,\n sizeof(bsa.header.totalFileNameLength));\n read(is, &bsa.header.fileFlags, sizeof(bsa.header.fileFlags));\n\n std::bitset<32> archiveFlags(bsa.header.archiveFlags);\n\n \n for (std::size_t i = 0; i < bsa.header.folderCount; ++i) {\n BSA::FolderRecord fr;\n read(is, &fr.nameHash, sizeof(fr.nameHash));\n read(is, &fr.count, sizeof(fr.count));\n read(is, &fr.offset, sizeof(fr.offset));\n bsa.folderRecords.push_back(fr);\n }\n\n \n uint32_t frfc = 0;\n for (std::size_t i = 0; i < bsa.header.folderCount; ++i) {\n frfc += bsa.folderRecords[i].count;\n }\n\n if (frfc != bsa.header.fileCount) {\n std::cout << \"ERROR : fileCount and folderRecord number of files \"\n \"doesn't match\"\n << std::endl;\n return is;\n }\n\n \n for (uint32_t i = 0; i < bsa.header.folderCount; ++i) {\n BSA::FileRecordBlocks frb;\n\n BSA::BZString bzs;\n if (archiveFlags.test(0)) {\n read(is, &bzs.length, sizeof(bzs.length));\n bzs.data = new char[bzs.length];\n\n read(is, bzs.data, bzs.length);\n\n \n if (bzs.data[bzs.length - 1] != '\\0') {\n std::cout << \"ERROR : invalid bzstring\" << std::endl;\n return is;\n }\n\n } else {\n bzs.length = 0;\n bzs.data = nullptr;\n }\n frb.name = bzs;\n\n for (uint32_t j = 0; j < bsa.folderRecords[i].count; ++j) {\n BSA::FileRecord fr;\n\n read(is, &fr.nameHash, sizeof(fr.nameHash));\n read(is, &fr.size, sizeof(fr.size));\n read(is, &fr.offset, sizeof(fr.offset));\n\n frb.fileRecords.push_back(fr);\n }\n\n bsa.fileRecordBlocks.push_back(frb);\n }\n\n \n if (archiveFlags.test(1)) {\n \n \n std::string tmpstr;\n for (uint32_t i = 0; i < bsa.header.fileCount; i++) {\n getline(is, tmpstr, '\\0');\n\n BSA::ZString zs;\n zs.data = new char[tmpstr.length()];\n\n for (std::size_t j = 0; j <= tmpstr.length(); j++) {\n zs.data[j] = tmpstr[j];\n }\n\n bsa.fileNameBlock.fileNames.push_back(zs);\n }\n }\n\n \n if (archiveFlags.test(1)) {\n std::size_t frbfrs = 0;\n for (std::size_t i = 0; i < bsa.fileRecordBlocks.size(); ++i)\n frbfrs += bsa.fileRecordBlocks.at(i).fileRecords.size();\n\n if (frbfrs != bsa.fileNameBlock.fileNames.size()) {\n std::cout << \"ERROR : fileRecords and fileNameBlock number of \"\n \"files doesn't match\"\n << std::endl;\n return is;\n }\n }\n\n \n if (archiveFlags.test(1)) {\n std::size_t c = 0;\n for (std::size_t i = 0; i < bsa.fileRecordBlocks.size(); ++i) {\n for (std::size_t j = 0;\n j < bsa.fileRecordBlocks.at(i).fileRecords.size(); ++j) {\n bsa.fileRecordBlocks.at(i).fileRecords.at(j).filename\n = &bsa.fileNameBlock.fileNames.at(c);\n c++;\n }\n }\n }\n\n \n\n return is;\n}\n"},"prefix":{"kind":"string","value":"#include \"bsa.h\"\n\nBSA::BSA() {}\n\nvoid BSA::summary()\n{\n std::cout << \"header\" << std::endl;\n std::cout << this->header.fileId << std::endl;\n std::cout << this->header.version << std::endl;\n std::cout << this->header.offset << std::endl;\n std::cout << this->header.archiveFlags << std::endl;\n std::cout << this->header.folderCount << std::endl;\n std::cout << this->header.fileCount << std::endl;\n std::cout << this->header.totalFolderNameLength << std::endl;\n std::cout << this->header.totalFileNameLength << std::endl;\n std::cout << this->header.fileFlags << std::endl;\n\n std::cout << \"folderRecords\" << std::endl;\n for (std::size_t i = 0; i < this->header.folderCount; ++i) {\n std::cout << this->folderRecords[i].nameHash << std::endl;\n std::cout << this->folderRecords[i].count << std::endl;\n std::cout << this->folderRecords[i].offset << std::endl;\n }\n\n std::cout << \"fileRecordBlocks\" << std::endl;\n std::bitset<32> archiveFlags(this->header.archiveFlags);\n for (std::size_t i = 0; i < this->fileRecordBlocks.size(); ++i) {\n\n if (archiveFlags.test(0)) {\n std::cout << this->fileRecordBlocks[i].name.data << std::endl;\n }\n\n for (std::size_t j = 0;\n j < this->fileRecordBlocks[i].fileRecords.size(); ++j) {\n std::cout << \" \"\n << this->fileRecordBlocks[i].fileRecords[j].nameHash\n << std::endl;\n std::cout << \" \" << this->fileRecordBlocks[i].fileRecords[j].size\n << std::endl;\n std::cout << \" \"\n << this->fileRecordBlocks[i].fileRecords[j].offset\n << std::endl;\n }\n }\n\n std::cout << \"fileNameBlock\" << std::endl;\n if (archiveFlags.test(1)) {\n for (std::size_t i = 0; i < this->header.fileCount; i++) {\n std::cout << this->fileNameBlock.fileNames[i].data << std::endl;\n }\n }\n}\n\nstd::istream& operator>>(std::istream& is, BSA& bsa)\n{\n \n auto read = [](std::istream& is, void* dataptr, uint64_t datasize) {\n is.read(reinterpret_cast<char*>(dataptr), datasize);\n };\n\n \n read(is, &bsa.header.fileId, sizeof(bsa.header.fileId));\n read(is, &bsa.header.version, sizeof(bsa.header.version));\n\n read(is, &bsa.header.offset, sizeof(bsa.header.offset));\n read(is, &bsa.header.archiveFlags, sizeof(bsa.header.archiveFlags));\n read(is, &bsa.header.folderCount, sizeof(bsa.header.folderCount));\n read(is, &bsa.header.fileCount, sizeof(bsa.header.fileCount));\n read(is, &bsa.header.totalFolderNameLength,\n sizeof(bsa.header.totalFolderNameLength));\n read(is, &bsa.header.totalFileNameLength,\n sizeof(bsa.header.totalFileNameLength));\n read(is, &bsa.header.fileFlags, sizeof(bsa.header.fileFlags));\n\n std::bitset<32> archiveFlags(bsa.header.archiveFlags);\n\n \n for (std::size_t i = 0; i < bsa.header.folderCount; ++i) {\n BSA::FolderRecord fr;\n read(is, &fr.nameHash, sizeof(fr.nameHash));\n read(is, &fr.count, sizeof(fr.count));\n read(is, &fr.offset, sizeof(fr.offset));\n bsa.folderRecords.push_back(fr);\n }\n\n \n uint32_t frfc = 0;\n for (std::size_t i = 0; i < bsa.header.folderCount; ++i) {\n frfc += bsa.folderRecords[i].count;\n }\n\n if (frfc != bsa.header.fileCount) {\n std::cout << \"ERROR : fileCount and folderRecord number of files \"\n \"doesn't match\"\n << std::endl;\n return is;\n }\n\n \n for (uint32_t i = 0; i < bsa.header.folderCount; ++i) {\n BSA::FileRecordBlocks frb;\n\n BSA::BZString bzs;\n "},"suffix":{"kind":"string","value":"\n frb.name = bzs;\n\n for (uint32_t j = 0; j < bsa.folderRecords[i].count; ++j) {\n BSA::FileRecord fr;\n\n read(is, &fr.nameHash, sizeof(fr.nameHash));\n read(is, &fr.size, sizeof(fr.size));\n read(is, &fr.offset, sizeof(fr.offset));\n\n frb.fileRecords.push_back(fr);\n }\n\n bsa.fileRecordBlocks.push_back(frb);\n }\n\n \n if (archiveFlags.test(1)) {\n \n \n std::string tmpstr;\n for (uint32_t i = 0; i < bsa.header.fileCount; i++) {\n getline(is, tmpstr, '\\0');\n\n BSA::ZString zs;\n zs.data = new char[tmpstr.length()];\n\n for (std::size_t j = 0; j <= tmpstr.length(); j++) {\n zs.data[j] = tmpstr[j];\n }\n\n bsa.fileNameBlock.fileNames.push_back(zs);\n }\n }\n\n \n if (archiveFlags.test(1)) {\n std::size_t frbfrs = 0;\n for (std::size_t i = 0; i < bsa.fileRecordBlocks.size(); ++i)\n frbfrs += bsa.fileRecordBlocks.at(i).fileRecords.size();\n\n if (frbfrs != bsa.fileNameBlock.fileNames.size()) {\n std::cout << \"ERROR : fileRecords and fileNameBlock number of \"\n \"files doesn't match\"\n << std::endl;\n return is;\n }\n }\n\n \n if (archiveFlags.test(1)) {\n std::size_t c = 0;\n for (std::size_t i = 0; i < bsa.fileRecordBlocks.size(); ++i) {\n for (std::size_t j = 0;\n j < bsa.fileRecordBlocks.at(i).fileRecords.size(); ++j) {\n bsa.fileRecordBlocks.at(i).fileRecords.at(j).filename\n = &bsa.fileNameBlock.fileNames.at(c);\n c++;\n }\n }\n }\n\n \n\n return is;\n}\n"},"middle":{"kind":"string","value":"if (archiveFlags.test(0)) {\n read(is, &bzs.length, sizeof(bzs.length));\n bzs.data = new char[bzs.length];\n\n read(is, bzs.data, bzs.length);\n\n \n if (bzs.data[bzs.length - 1] != '\\0') {\n std::cout << \"ERROR : invalid bzstring\" << std::endl;\n return is;\n }\n\n } else {\n bzs.length = 0;\n bzs.data = nullptr;\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":" def read(self):\n\n # open file\n\n file = open(self.filename, 'rb')\n\n # read file header\n\n self.header = {\n\n \"fileId\": str(file.read(4)),\n\n \"version\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n \"archiveFlags\": bytes_to_int(file.read(4)),\n\n \"folderCount\": bytes_to_int(file.read(4)),\n\n \"fileCount\": bytes_to_int(file.read(4)),\n\n \"totalFolderNameLength\": bytes_to_int(file.read(4)),\n\n \"totalFileNameLength\": bytes_to_int(file.read(4)),\n\n \"fileFlags\": bytes_to_int(file.read(4)),\n\n }\n\n # retrieve archive flags important flags\n\n archive_flags = self.header['archiveFlags']\n\n archive_flags_folder_name = (archive_flags & 0x1)\n\n archive_flags_file_name = (archive_flags & 0x2)\n\n archive_flags_file_compressed = (archive_flags & 0x4)\n\n # read folder records\n\n self.folderRecords = []\n\n for _ in range(self.header['folderCount']):\n\n folder_record = {\n\n \"nameHash\": bytes_to_int(file.read(8)),\n\n \"count\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n }\n\n self.folderRecords.append(folder_record)\n\n # read file record blocs\n\n self.fileRecordBlocks = []\n\n for i in range(self.header['folderCount']):\n\n name = None\n\n if archive_flags_folder_name:\n\n name = utils.read_bzstring(file)\n\n # read file record\n\n file_records = []\n\n for _ in range(self.folderRecords[i]['count']):\n\n file_record = {\n\n \"nameHash\": bytes_to_int(file.read(8)),\n\n \"fileSize\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n }\n\n file_records.append(file_record)\n\n\n\n file_record_block = {\n\n \"name\": name,\n\n \"fileRecord\": file_records,\n\n }\n\n self.fileRecordBlocks.append(file_record_block)\n\n # read file name block\n\n self.fileNameBlock = []\n\n if archive_flags_file_name:\n\n for _ in range(self.header['fileCount']):\n\n self.fileNameBlock.append(utils.read_zstring(file))\n\n # read data\n\n self.files = []\n\n if archive_flags_file_compressed:\n\n # read compressed data\n\n for i in self.fileRecordBlocks:\n\n for j in i['fileRecord']:\n\n # check offset\n\n assert file.tell() == j['offset'], \\\n\n f'current position {file.tell()} in file and offset {j[\"offset\"]} are not equal'\n\n # read compressed file\n\n uncompressed_size = bytes_to_int(file.read(4))\n\n compressed_file = file.read(j['fileSize']-4)\n\n # decompress file\n\n z_obj = zlib.decompressobj()\n\n uncompressed_file = z_obj.decompress(compressed_file)\n\n # check decompressed size\n\n assert uncompressed_size == len(uncompressed_file), \\\n\n f'decompression error, {uncompressed_size} not equal to {len(uncompressed_file)}'\n\n self.files.append(uncompressed_file)\n\n else:\n\n # read uncompressed data\n\n for i in self.fileRecordBlocks:\n\n for j in i['fileRecord']:\n\n self.files.append(file.read(j['fileSize']))\n\n\n\n byte = file.read(1)\n\n if byte:\n\n warnings.warn(f'Enf of read before end of file - {self.filename}')\n\n\n","file_path":"PyOpenTES4/bsa.py","rank":0,"score":36516.36541381817},{"content":"class BSA {\n\npublic:\n\n BSA();\n\n\n\n /**\n\n * @brief summary\n\n * print class information using std::cout\n\n */\n\n void summary();\n\n\n\n /**\n\n * @brief The BString struct\n\n * A string prefixed with a byte length. NOT zero terminated.\n\n */\n\n struct BString {\n\n int8_t length = 0;\n\n char* data = nullptr;\n\n };\n\n\n\n /**\n","file_path":"OpenTES4/bsa.h","rank":1,"score":28883.4070138076},{"content":"class BSA:\n\n def __init__(self, filename):\n\n self.filename = filename\n\n self.header = None\n\n self.folderRecords = None\n\n self.fileRecordBlocks = None\n\n self.fileNameBlock = None\n\n self.files = None\n\n\n\n def __repr__(self):\n\n return str(self.header) + \"\\n\" +\\\n\n str(self.folderRecords) + \"\\n\" +\\\n\n str(self.fileRecordBlocks) + \"\\n\" +\\\n\n str(self.fileNameBlock)\n\n\n\n def read(self):\n\n # open file\n\n file = open(self.filename, 'rb')\n\n # read file header\n\n self.header = {\n\n \"fileId\": str(file.read(4)),\n\n \"version\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n \"archiveFlags\": bytes_to_int(file.read(4)),\n\n \"folderCount\": bytes_to_int(file.read(4)),\n\n \"fileCount\": bytes_to_int(file.read(4)),\n\n \"totalFolderNameLength\": bytes_to_int(file.read(4)),\n\n \"totalFileNameLength\": bytes_to_int(file.read(4)),\n\n \"fileFlags\": bytes_to_int(file.read(4)),\n\n }\n\n # retrieve archive flags important flags\n\n archive_flags = self.header['archiveFlags']\n\n archive_flags_folder_name = (archive_flags & 0x1)\n\n archive_flags_file_name = (archive_flags & 0x2)\n\n archive_flags_file_compressed = (archive_flags & 0x4)\n\n # read folder records\n\n self.folderRecords = []\n\n for _ in range(self.header['folderCount']):\n\n folder_record = {\n\n \"nameHash\": bytes_to_int(file.read(8)),\n\n \"count\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n }\n\n self.folderRecords.append(folder_record)\n\n # read file record blocs\n\n self.fileRecordBlocks = []\n\n for i in range(self.header['folderCount']):\n\n name = None\n\n if archive_flags_folder_name:\n\n name = utils.read_bzstring(file)\n\n # read file record\n\n file_records = []\n\n for _ in range(self.folderRecords[i]['count']):\n\n file_record = {\n\n \"nameHash\": bytes_to_int(file.read(8)),\n\n \"fileSize\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n }\n\n file_records.append(file_record)\n\n\n\n file_record_block = {\n\n \"name\": name,\n\n \"fileRecord\": file_records,\n\n }\n\n self.fileRecordBlocks.append(file_record_block)\n\n # read file name block\n\n self.fileNameBlock = []\n\n if archive_flags_file_name:\n\n for _ in range(self.header['fileCount']):\n\n self.fileNameBlock.append(utils.read_zstring(file))\n\n # read data\n\n self.files = []\n\n if archive_flags_file_compressed:\n\n # read compressed data\n\n for i in self.fileRecordBlocks:\n\n for j in i['fileRecord']:\n\n # check offset\n\n assert file.tell() == j['offset'], \\\n\n f'current position {file.tell()} in file and offset {j[\"offset\"]} are not equal'\n\n # read compressed file\n\n uncompressed_size = bytes_to_int(file.read(4))\n\n compressed_file = file.read(j['fileSize']-4)\n\n # decompress file\n\n z_obj = zlib.decompressobj()\n\n uncompressed_file = z_obj.decompress(compressed_file)\n\n # check decompressed size\n\n assert uncompressed_size == len(uncompressed_file), \\\n\n f'decompression error, {uncompressed_size} not equal to {len(uncompressed_file)}'\n\n self.files.append(uncompressed_file)\n\n else:\n\n # read uncompressed data\n\n for i in self.fileRecordBlocks:\n\n for j in i['fileRecord']:\n\n self.files.append(file.read(j['fileSize']))\n\n\n\n byte = file.read(1)\n\n if byte:\n\n warnings.warn(f'Enf of read before end of file - {self.filename}')\n\n\n","file_path":"PyOpenTES4/bsa.py","rank":2,"score":27810.56055024093},{"content":"\n\n struct FileRecordBlocks {\n\n BZString name; // Only if bit 1 of archive flags is set\n\n std::vector<FileRecord> fileRecords;\n\n };\n\n\n\n struct FileNameBlock {\n\n std::vector<ZString> fileNames;\n\n };\n\n\n\n struct FileBlock {\n\n BString name; // Only if bit 9 of archive flags is set\n\n uint32_t originalSize; // only if compressed file block (else 0)\n\n uint8_t* data;\n\n };\n\n\n\n Header header;\n\n std::vector<FolderRecord> folderRecords;\n\n std::vector<FileRecordBlocks> fileRecordBlocks;\n\n FileNameBlock fileNameBlock; // Only if bit 2 of archive flags is set\n\n std::vector<FileBlock> files;\n\n};\n\n\n\nstd::istream& operator>>(std::istream& is, BSA& bsa);\n\n\n\n#endif // BSA_H\n","file_path":"OpenTES4/bsa.h","rank":3,"score":13978.332436886294},{"content":"#ifndef BSA_H\n\n#define BSA_H\n\n\n\n#include <bitset>\n\n#include <fstream>\n\n#include <iomanip>\n\n#include <iostream>\n\n#include <string>\n\n#include <vector>\n\n\n","file_path":"OpenTES4/bsa.h","rank":4,"score":13977.765520651246},{"content":" * @brief The BZString struct\n\n * A string prefixed with a byte length and terminated with a zero (\\x00).\n\n */\n\n struct BZString {\n\n int8_t length = 0;\n\n char* data = nullptr;\n\n };\n\n\n\n /**\n\n * @brief The ZString struct\n\n * A string terminated with a zero (\\x00).\n\n */\n\n struct ZString {\n\n char* data = nullptr;\n\n };\n\n\n\n struct Header {\n\n int8_t fileId[4];\n\n uint32_t version;\n\n uint32_t offset;\n","file_path":"OpenTES4/bsa.h","rank":5,"score":13977.690825681771},{"content":" uint32_t archiveFlags;\n\n uint32_t folderCount;\n\n uint32_t fileCount;\n\n uint32_t totalFolderNameLength;\n\n uint32_t totalFileNameLength;\n\n uint32_t fileFlags;\n\n };\n\n\n\n struct FolderRecord {\n\n uint64_t nameHash;\n\n uint32_t count;\n\n uint32_t offset;\n\n };\n\n\n\n struct FileRecord {\n\n uint64_t nameHash;\n\n uint32_t size;\n\n uint32_t offset;\n\n ZString* filename = nullptr;\n\n };\n","file_path":"OpenTES4/bsa.h","rank":6,"score":13975.341140593397},{"content":"def read_bzstring(file):\n\n b = bytes_to_int(file.read(1))\n\n zstring = file.read(b)\n\n if zstring[-1] != 0:\n\n raise ValueError\n","file_path":"PyOpenTES4/utils.py","rank":16,"score":11813.300031894334},{"content":"def read_zstring(file):\n\n zstring = \"\"\n\n b = file.read(1)\n\n while b and not b == b'\\x00':\n\n zstring += b.decode(\"utf-8\")\n\n b = file.read(1)\n","file_path":"PyOpenTES4/utils.py","rank":17,"score":11813.300031894334},{"content":"def read_bstring(file):\n\n b = bytes_to_int(file.read(1))\n\n bstring = file.read(b)\n","file_path":"PyOpenTES4/utils.py","rank":18,"score":11813.300031894334},{"content":"import warnings\n\nimport zlib\n\nimport utils\n\nfrom utils import bytes_to_int\n\n\n\n\n\nclass BSA:\n\n def __init__(self, filename):\n\n self.filename = filename\n\n self.header = None\n\n self.folderRecords = None\n\n self.fileRecordBlocks = None\n\n self.fileNameBlock = None\n\n self.files = None\n\n\n\n def __repr__(self):\n\n return str(self.header) + \"\\n\" +\\\n\n str(self.folderRecords) + \"\\n\" +\\\n\n str(self.fileRecordBlocks) + \"\\n\" +\\\n\n str(self.fileNameBlock)\n\n\n\n def read(self):\n\n # open file\n\n file = open(self.filename, 'rb')\n\n # read file header\n\n self.header = {\n\n \"fileId\": str(file.read(4)),\n\n \"version\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n \"archiveFlags\": bytes_to_int(file.read(4)),\n\n \"folderCount\": bytes_to_int(file.read(4)),\n\n \"fileCount\": bytes_to_int(file.read(4)),\n\n \"totalFolderNameLength\": bytes_to_int(file.read(4)),\n\n \"totalFileNameLength\": bytes_to_int(file.read(4)),\n\n \"fileFlags\": bytes_to_int(file.read(4)),\n\n }\n\n # retrieve archive flags important flags\n\n archive_flags = self.header['archiveFlags']\n\n archive_flags_folder_name = (archive_flags & 0x1)\n\n archive_flags_file_name = (archive_flags & 0x2)\n\n archive_flags_file_compressed = (archive_flags & 0x4)\n\n # read folder records\n\n self.folderRecords = []\n\n for _ in range(self.header['folderCount']):\n\n folder_record = {\n\n \"nameHash\": bytes_to_int(file.read(8)),\n\n \"count\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n }\n\n self.folderRecords.append(folder_record)\n\n # read file record blocs\n\n self.fileRecordBlocks = []\n\n for i in range(self.header['folderCount']):\n\n name = None\n\n if archive_flags_folder_name:\n\n name = utils.read_bzstring(file)\n\n # read file record\n\n file_records = []\n\n for _ in range(self.folderRecords[i]['count']):\n\n file_record = {\n\n \"nameHash\": bytes_to_int(file.read(8)),\n\n \"fileSize\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)),\n\n }\n\n file_records.append(file_record)\n\n\n\n file_record_block = {\n\n \"name\": name,\n\n \"fileRecord\": file_records,\n\n }\n\n self.fileRecordBlocks.append(file_record_block)\n\n # read file name block\n\n self.fileNameBlock = []\n\n if archive_flags_file_name:\n\n for _ in range(self.header['fileCount']):\n\n self.fileNameBlock.append(utils.read_zstring(file))\n\n # read data\n\n self.files = []\n\n if archive_flags_file_compressed:\n\n # read compressed data\n\n for i in self.fileRecordBlocks:\n\n for j in i['fileRecord']:\n\n # check offset\n\n assert file.tell() == j['offset'], \\\n\n f'current position {file.tell()} in file and offset {j[\"offset\"]} are not equal'\n\n # read compressed file\n\n uncompressed_size = bytes_to_int(file.read(4))\n\n compressed_file = file.read(j['fileSize']-4)\n\n # decompress file\n\n z_obj = zlib.decompressobj()\n\n uncompressed_file = z_obj.decompress(compressed_file)\n\n # check decompressed size\n\n assert uncompressed_size == len(uncompressed_file), \\\n\n f'decompression error, {uncompressed_size} not equal to {len(uncompressed_file)}'\n\n self.files.append(uncompressed_file)\n\n else:\n\n # read uncompressed data\n\n for i in self.fileRecordBlocks:\n\n for j in i['fileRecord']:\n\n self.files.append(file.read(j['fileSize']))\n\n\n\n byte = file.read(1)\n\n if byte:\n\n warnings.warn(f'Enf of read before end of file - {self.filename}')\n\n\n\n return 0\n","file_path":"PyOpenTES4/bsa.py","rank":19,"score":9402.317308672682},{"content":" def __repr__(self):\n\n return str(self.header) + \"\\n\" +\\\n\n str(self.folderRecords) + \"\\n\" +\\\n\n str(self.fileRecordBlocks) + \"\\n\" +\\\n","file_path":"PyOpenTES4/bsa.py","rank":20,"score":9032.90517295635},{"content":" def __init__(self, filename):\n\n self.filename = filename\n\n self.header = None\n\n self.folderRecords = None\n\n self.fileRecordBlocks = None\n\n self.fileNameBlock = None\n","file_path":"PyOpenTES4/bsa.py","rank":21,"score":9032.90517295635},{"content":"#include <fstream>\n\n#include <iostream>\n\n\n\n#include \"bsa.h\"\n\n\n\nint main()\n\n{\n\n std::cout << \"OpenTES4Oblivion\" << std::endl;\n\n\n\n BSA bsaMisc;\n\n BSA bsaMeshes;\n\n\n\n std::ifstream bsaFileMisc(\"Oblivion - Misc.bsa\", std::ios::binary);\n\n\n\n if (bsaFileMisc.is_open()) {\n\n std::cout << \"Oblivion - Misc.bsa\" << std::endl;\n\n\n\n bsaFileMisc >> bsaMisc;\n\n\n\n // bsaMisc.summary();\n","file_path":"OpenTES4/main.cpp","rank":22,"score":4.2359115264486595},{"content":"\n\n bsaFileMisc.close();\n\n }\n\n\n\n std::ifstream bsaFileMeshes(\"Oblivion - Meshes.bsa\", std::ios::binary);\n\n\n\n if (bsaFileMeshes.is_open()) {\n\n std::cout << \"Oblivion - Meshes.bsa\" << std::endl;\n\n\n\n bsaFileMeshes >> bsaMeshes;\n\n\n\n // bsaMeshes.summary();\n\n\n\n bsaFileMeshes.close();\n\n }\n\n\n\n return 0;\n\n}\n","file_path":"OpenTES4/main.cpp","rank":23,"score":3.0882335233939724}],"string":"[\n {\n \"content\": \" def read(self):\\n\\n # open file\\n\\n file = open(self.filename, 'rb')\\n\\n # read file header\\n\\n self.header = {\\n\\n \\\"fileId\\\": str(file.read(4)),\\n\\n \\\"version\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n \\\"archiveFlags\\\": bytes_to_int(file.read(4)),\\n\\n \\\"folderCount\\\": bytes_to_int(file.read(4)),\\n\\n \\\"fileCount\\\": bytes_to_int(file.read(4)),\\n\\n \\\"totalFolderNameLength\\\": bytes_to_int(file.read(4)),\\n\\n \\\"totalFileNameLength\\\": bytes_to_int(file.read(4)),\\n\\n \\\"fileFlags\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n # retrieve archive flags important flags\\n\\n archive_flags = self.header['archiveFlags']\\n\\n archive_flags_folder_name = (archive_flags & 0x1)\\n\\n archive_flags_file_name = (archive_flags & 0x2)\\n\\n archive_flags_file_compressed = (archive_flags & 0x4)\\n\\n # read folder records\\n\\n self.folderRecords = []\\n\\n for _ in range(self.header['folderCount']):\\n\\n folder_record = {\\n\\n \\\"nameHash\\\": bytes_to_int(file.read(8)),\\n\\n \\\"count\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n self.folderRecords.append(folder_record)\\n\\n # read file record blocs\\n\\n self.fileRecordBlocks = []\\n\\n for i in range(self.header['folderCount']):\\n\\n name = None\\n\\n if archive_flags_folder_name:\\n\\n name = utils.read_bzstring(file)\\n\\n # read file record\\n\\n file_records = []\\n\\n for _ in range(self.folderRecords[i]['count']):\\n\\n file_record = {\\n\\n \\\"nameHash\\\": bytes_to_int(file.read(8)),\\n\\n \\\"fileSize\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n file_records.append(file_record)\\n\\n\\n\\n file_record_block = {\\n\\n \\\"name\\\": name,\\n\\n \\\"fileRecord\\\": file_records,\\n\\n }\\n\\n self.fileRecordBlocks.append(file_record_block)\\n\\n # read file name block\\n\\n self.fileNameBlock = []\\n\\n if archive_flags_file_name:\\n\\n for _ in range(self.header['fileCount']):\\n\\n self.fileNameBlock.append(utils.read_zstring(file))\\n\\n # read data\\n\\n self.files = []\\n\\n if archive_flags_file_compressed:\\n\\n # read compressed data\\n\\n for i in self.fileRecordBlocks:\\n\\n for j in i['fileRecord']:\\n\\n # check offset\\n\\n assert file.tell() == j['offset'], \\\\\\n\\n f'current position {file.tell()} in file and offset {j[\\\"offset\\\"]} are not equal'\\n\\n # read compressed file\\n\\n uncompressed_size = bytes_to_int(file.read(4))\\n\\n compressed_file = file.read(j['fileSize']-4)\\n\\n # decompress file\\n\\n z_obj = zlib.decompressobj()\\n\\n uncompressed_file = z_obj.decompress(compressed_file)\\n\\n # check decompressed size\\n\\n assert uncompressed_size == len(uncompressed_file), \\\\\\n\\n f'decompression error, {uncompressed_size} not equal to {len(uncompressed_file)}'\\n\\n self.files.append(uncompressed_file)\\n\\n else:\\n\\n # read uncompressed data\\n\\n for i in self.fileRecordBlocks:\\n\\n for j in i['fileRecord']:\\n\\n self.files.append(file.read(j['fileSize']))\\n\\n\\n\\n byte = file.read(1)\\n\\n if byte:\\n\\n warnings.warn(f'Enf of read before end of file - {self.filename}')\\n\\n\\n\",\n \"file_path\": \"PyOpenTES4/bsa.py\",\n \"rank\": 0,\n \"score\": 36516.36541381817\n },\n {\n \"content\": \"class BSA {\\n\\npublic:\\n\\n BSA();\\n\\n\\n\\n /**\\n\\n * @brief summary\\n\\n * print class information using std::cout\\n\\n */\\n\\n void summary();\\n\\n\\n\\n /**\\n\\n * @brief The BString struct\\n\\n * A string prefixed with a byte length. NOT zero terminated.\\n\\n */\\n\\n struct BString {\\n\\n int8_t length = 0;\\n\\n char* data = nullptr;\\n\\n };\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"OpenTES4/bsa.h\",\n \"rank\": 1,\n \"score\": 28883.4070138076\n },\n {\n \"content\": \"class BSA:\\n\\n def __init__(self, filename):\\n\\n self.filename = filename\\n\\n self.header = None\\n\\n self.folderRecords = None\\n\\n self.fileRecordBlocks = None\\n\\n self.fileNameBlock = None\\n\\n self.files = None\\n\\n\\n\\n def __repr__(self):\\n\\n return str(self.header) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.folderRecords) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.fileRecordBlocks) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.fileNameBlock)\\n\\n\\n\\n def read(self):\\n\\n # open file\\n\\n file = open(self.filename, 'rb')\\n\\n # read file header\\n\\n self.header = {\\n\\n \\\"fileId\\\": str(file.read(4)),\\n\\n \\\"version\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n \\\"archiveFlags\\\": bytes_to_int(file.read(4)),\\n\\n \\\"folderCount\\\": bytes_to_int(file.read(4)),\\n\\n \\\"fileCount\\\": bytes_to_int(file.read(4)),\\n\\n \\\"totalFolderNameLength\\\": bytes_to_int(file.read(4)),\\n\\n \\\"totalFileNameLength\\\": bytes_to_int(file.read(4)),\\n\\n \\\"fileFlags\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n # retrieve archive flags important flags\\n\\n archive_flags = self.header['archiveFlags']\\n\\n archive_flags_folder_name = (archive_flags & 0x1)\\n\\n archive_flags_file_name = (archive_flags & 0x2)\\n\\n archive_flags_file_compressed = (archive_flags & 0x4)\\n\\n # read folder records\\n\\n self.folderRecords = []\\n\\n for _ in range(self.header['folderCount']):\\n\\n folder_record = {\\n\\n \\\"nameHash\\\": bytes_to_int(file.read(8)),\\n\\n \\\"count\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n self.folderRecords.append(folder_record)\\n\\n # read file record blocs\\n\\n self.fileRecordBlocks = []\\n\\n for i in range(self.header['folderCount']):\\n\\n name = None\\n\\n if archive_flags_folder_name:\\n\\n name = utils.read_bzstring(file)\\n\\n # read file record\\n\\n file_records = []\\n\\n for _ in range(self.folderRecords[i]['count']):\\n\\n file_record = {\\n\\n \\\"nameHash\\\": bytes_to_int(file.read(8)),\\n\\n \\\"fileSize\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n file_records.append(file_record)\\n\\n\\n\\n file_record_block = {\\n\\n \\\"name\\\": name,\\n\\n \\\"fileRecord\\\": file_records,\\n\\n }\\n\\n self.fileRecordBlocks.append(file_record_block)\\n\\n # read file name block\\n\\n self.fileNameBlock = []\\n\\n if archive_flags_file_name:\\n\\n for _ in range(self.header['fileCount']):\\n\\n self.fileNameBlock.append(utils.read_zstring(file))\\n\\n # read data\\n\\n self.files = []\\n\\n if archive_flags_file_compressed:\\n\\n # read compressed data\\n\\n for i in self.fileRecordBlocks:\\n\\n for j in i['fileRecord']:\\n\\n # check offset\\n\\n assert file.tell() == j['offset'], \\\\\\n\\n f'current position {file.tell()} in file and offset {j[\\\"offset\\\"]} are not equal'\\n\\n # read compressed file\\n\\n uncompressed_size = bytes_to_int(file.read(4))\\n\\n compressed_file = file.read(j['fileSize']-4)\\n\\n # decompress file\\n\\n z_obj = zlib.decompressobj()\\n\\n uncompressed_file = z_obj.decompress(compressed_file)\\n\\n # check decompressed size\\n\\n assert uncompressed_size == len(uncompressed_file), \\\\\\n\\n f'decompression error, {uncompressed_size} not equal to {len(uncompressed_file)}'\\n\\n self.files.append(uncompressed_file)\\n\\n else:\\n\\n # read uncompressed data\\n\\n for i in self.fileRecordBlocks:\\n\\n for j in i['fileRecord']:\\n\\n self.files.append(file.read(j['fileSize']))\\n\\n\\n\\n byte = file.read(1)\\n\\n if byte:\\n\\n warnings.warn(f'Enf of read before end of file - {self.filename}')\\n\\n\\n\",\n \"file_path\": \"PyOpenTES4/bsa.py\",\n \"rank\": 2,\n \"score\": 27810.56055024093\n },\n {\n \"content\": \"\\n\\n struct FileRecordBlocks {\\n\\n BZString name; // Only if bit 1 of archive flags is set\\n\\n std::vector<FileRecord> fileRecords;\\n\\n };\\n\\n\\n\\n struct FileNameBlock {\\n\\n std::vector<ZString> fileNames;\\n\\n };\\n\\n\\n\\n struct FileBlock {\\n\\n BString name; // Only if bit 9 of archive flags is set\\n\\n uint32_t originalSize; // only if compressed file block (else 0)\\n\\n uint8_t* data;\\n\\n };\\n\\n\\n\\n Header header;\\n\\n std::vector<FolderRecord> folderRecords;\\n\\n std::vector<FileRecordBlocks> fileRecordBlocks;\\n\\n FileNameBlock fileNameBlock; // Only if bit 2 of archive flags is set\\n\\n std::vector<FileBlock> files;\\n\\n};\\n\\n\\n\\nstd::istream& operator>>(std::istream& is, BSA& bsa);\\n\\n\\n\\n#endif // BSA_H\\n\",\n \"file_path\": \"OpenTES4/bsa.h\",\n \"rank\": 3,\n \"score\": 13978.332436886294\n },\n {\n \"content\": \"#ifndef BSA_H\\n\\n#define BSA_H\\n\\n\\n\\n#include <bitset>\\n\\n#include <fstream>\\n\\n#include <iomanip>\\n\\n#include <iostream>\\n\\n#include <string>\\n\\n#include <vector>\\n\\n\\n\",\n \"file_path\": \"OpenTES4/bsa.h\",\n \"rank\": 4,\n \"score\": 13977.765520651246\n },\n {\n \"content\": \" * @brief The BZString struct\\n\\n * A string prefixed with a byte length and terminated with a zero (\\\\x00).\\n\\n */\\n\\n struct BZString {\\n\\n int8_t length = 0;\\n\\n char* data = nullptr;\\n\\n };\\n\\n\\n\\n /**\\n\\n * @brief The ZString struct\\n\\n * A string terminated with a zero (\\\\x00).\\n\\n */\\n\\n struct ZString {\\n\\n char* data = nullptr;\\n\\n };\\n\\n\\n\\n struct Header {\\n\\n int8_t fileId[4];\\n\\n uint32_t version;\\n\\n uint32_t offset;\\n\",\n \"file_path\": \"OpenTES4/bsa.h\",\n \"rank\": 5,\n \"score\": 13977.690825681771\n },\n {\n \"content\": \" uint32_t archiveFlags;\\n\\n uint32_t folderCount;\\n\\n uint32_t fileCount;\\n\\n uint32_t totalFolderNameLength;\\n\\n uint32_t totalFileNameLength;\\n\\n uint32_t fileFlags;\\n\\n };\\n\\n\\n\\n struct FolderRecord {\\n\\n uint64_t nameHash;\\n\\n uint32_t count;\\n\\n uint32_t offset;\\n\\n };\\n\\n\\n\\n struct FileRecord {\\n\\n uint64_t nameHash;\\n\\n uint32_t size;\\n\\n uint32_t offset;\\n\\n ZString* filename = nullptr;\\n\\n };\\n\",\n \"file_path\": \"OpenTES4/bsa.h\",\n \"rank\": 6,\n \"score\": 13975.341140593397\n },\n {\n \"content\": \"def read_bzstring(file):\\n\\n b = bytes_to_int(file.read(1))\\n\\n zstring = file.read(b)\\n\\n if zstring[-1] != 0:\\n\\n raise ValueError\\n\",\n \"file_path\": \"PyOpenTES4/utils.py\",\n \"rank\": 16,\n \"score\": 11813.300031894334\n },\n {\n \"content\": \"def read_zstring(file):\\n\\n zstring = \\\"\\\"\\n\\n b = file.read(1)\\n\\n while b and not b == b'\\\\x00':\\n\\n zstring += b.decode(\\\"utf-8\\\")\\n\\n b = file.read(1)\\n\",\n \"file_path\": \"PyOpenTES4/utils.py\",\n \"rank\": 17,\n \"score\": 11813.300031894334\n },\n {\n \"content\": \"def read_bstring(file):\\n\\n b = bytes_to_int(file.read(1))\\n\\n bstring = file.read(b)\\n\",\n \"file_path\": \"PyOpenTES4/utils.py\",\n \"rank\": 18,\n \"score\": 11813.300031894334\n },\n {\n \"content\": \"import warnings\\n\\nimport zlib\\n\\nimport utils\\n\\nfrom utils import bytes_to_int\\n\\n\\n\\n\\n\\nclass BSA:\\n\\n def __init__(self, filename):\\n\\n self.filename = filename\\n\\n self.header = None\\n\\n self.folderRecords = None\\n\\n self.fileRecordBlocks = None\\n\\n self.fileNameBlock = None\\n\\n self.files = None\\n\\n\\n\\n def __repr__(self):\\n\\n return str(self.header) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.folderRecords) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.fileRecordBlocks) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.fileNameBlock)\\n\\n\\n\\n def read(self):\\n\\n # open file\\n\\n file = open(self.filename, 'rb')\\n\\n # read file header\\n\\n self.header = {\\n\\n \\\"fileId\\\": str(file.read(4)),\\n\\n \\\"version\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n \\\"archiveFlags\\\": bytes_to_int(file.read(4)),\\n\\n \\\"folderCount\\\": bytes_to_int(file.read(4)),\\n\\n \\\"fileCount\\\": bytes_to_int(file.read(4)),\\n\\n \\\"totalFolderNameLength\\\": bytes_to_int(file.read(4)),\\n\\n \\\"totalFileNameLength\\\": bytes_to_int(file.read(4)),\\n\\n \\\"fileFlags\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n # retrieve archive flags important flags\\n\\n archive_flags = self.header['archiveFlags']\\n\\n archive_flags_folder_name = (archive_flags & 0x1)\\n\\n archive_flags_file_name = (archive_flags & 0x2)\\n\\n archive_flags_file_compressed = (archive_flags & 0x4)\\n\\n # read folder records\\n\\n self.folderRecords = []\\n\\n for _ in range(self.header['folderCount']):\\n\\n folder_record = {\\n\\n \\\"nameHash\\\": bytes_to_int(file.read(8)),\\n\\n \\\"count\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n self.folderRecords.append(folder_record)\\n\\n # read file record blocs\\n\\n self.fileRecordBlocks = []\\n\\n for i in range(self.header['folderCount']):\\n\\n name = None\\n\\n if archive_flags_folder_name:\\n\\n name = utils.read_bzstring(file)\\n\\n # read file record\\n\\n file_records = []\\n\\n for _ in range(self.folderRecords[i]['count']):\\n\\n file_record = {\\n\\n \\\"nameHash\\\": bytes_to_int(file.read(8)),\\n\\n \\\"fileSize\\\": bytes_to_int(file.read(4)),\\n\\n \\\"offset\\\": bytes_to_int(file.read(4)),\\n\\n }\\n\\n file_records.append(file_record)\\n\\n\\n\\n file_record_block = {\\n\\n \\\"name\\\": name,\\n\\n \\\"fileRecord\\\": file_records,\\n\\n }\\n\\n self.fileRecordBlocks.append(file_record_block)\\n\\n # read file name block\\n\\n self.fileNameBlock = []\\n\\n if archive_flags_file_name:\\n\\n for _ in range(self.header['fileCount']):\\n\\n self.fileNameBlock.append(utils.read_zstring(file))\\n\\n # read data\\n\\n self.files = []\\n\\n if archive_flags_file_compressed:\\n\\n # read compressed data\\n\\n for i in self.fileRecordBlocks:\\n\\n for j in i['fileRecord']:\\n\\n # check offset\\n\\n assert file.tell() == j['offset'], \\\\\\n\\n f'current position {file.tell()} in file and offset {j[\\\"offset\\\"]} are not equal'\\n\\n # read compressed file\\n\\n uncompressed_size = bytes_to_int(file.read(4))\\n\\n compressed_file = file.read(j['fileSize']-4)\\n\\n # decompress file\\n\\n z_obj = zlib.decompressobj()\\n\\n uncompressed_file = z_obj.decompress(compressed_file)\\n\\n # check decompressed size\\n\\n assert uncompressed_size == len(uncompressed_file), \\\\\\n\\n f'decompression error, {uncompressed_size} not equal to {len(uncompressed_file)}'\\n\\n self.files.append(uncompressed_file)\\n\\n else:\\n\\n # read uncompressed data\\n\\n for i in self.fileRecordBlocks:\\n\\n for j in i['fileRecord']:\\n\\n self.files.append(file.read(j['fileSize']))\\n\\n\\n\\n byte = file.read(1)\\n\\n if byte:\\n\\n warnings.warn(f'Enf of read before end of file - {self.filename}')\\n\\n\\n\\n return 0\\n\",\n \"file_path\": \"PyOpenTES4/bsa.py\",\n \"rank\": 19,\n \"score\": 9402.317308672682\n },\n {\n \"content\": \" def __repr__(self):\\n\\n return str(self.header) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.folderRecords) + \\\"\\\\n\\\" +\\\\\\n\\n str(self.fileRecordBlocks) + \\\"\\\\n\\\" +\\\\\\n\",\n \"file_path\": \"PyOpenTES4/bsa.py\",\n \"rank\": 20,\n \"score\": 9032.90517295635\n },\n {\n \"content\": \" def __init__(self, filename):\\n\\n self.filename = filename\\n\\n self.header = None\\n\\n self.folderRecords = None\\n\\n self.fileRecordBlocks = None\\n\\n self.fileNameBlock = None\\n\",\n \"file_path\": \"PyOpenTES4/bsa.py\",\n \"rank\": 21,\n \"score\": 9032.90517295635\n },\n {\n \"content\": \"#include <fstream>\\n\\n#include <iostream>\\n\\n\\n\\n#include \\\"bsa.h\\\"\\n\\n\\n\\nint main()\\n\\n{\\n\\n std::cout << \\\"OpenTES4Oblivion\\\" << std::endl;\\n\\n\\n\\n BSA bsaMisc;\\n\\n BSA bsaMeshes;\\n\\n\\n\\n std::ifstream bsaFileMisc(\\\"Oblivion - Misc.bsa\\\", std::ios::binary);\\n\\n\\n\\n if (bsaFileMisc.is_open()) {\\n\\n std::cout << \\\"Oblivion - Misc.bsa\\\" << std::endl;\\n\\n\\n\\n bsaFileMisc >> bsaMisc;\\n\\n\\n\\n // bsaMisc.summary();\\n\",\n \"file_path\": \"OpenTES4/main.cpp\",\n \"rank\": 22,\n \"score\": 4.2359115264486595\n },\n {\n \"content\": \"\\n\\n bsaFileMisc.close();\\n\\n }\\n\\n\\n\\n std::ifstream bsaFileMeshes(\\\"Oblivion - Meshes.bsa\\\", std::ios::binary);\\n\\n\\n\\n if (bsaFileMeshes.is_open()) {\\n\\n std::cout << \\\"Oblivion - Meshes.bsa\\\" << std::endl;\\n\\n\\n\\n bsaFileMeshes >> bsaMeshes;\\n\\n\\n\\n // bsaMeshes.summary();\\n\\n\\n\\n bsaFileMeshes.close();\\n\\n }\\n\\n\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"OpenTES4/main.cpp\",\n \"rank\": 23,\n \"score\": 3.0882335233939724\n }\n]","isConversational":false}}},{"rowIdx":488,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"libuuidpp/libuuidpp.hpp"},"repo_name":{"kind":"string","value":"dagronf/UUID_Wrapper"},"commit":{"kind":"string","value":"6ad8e7390d200bb96ef3e6e815650c2d5a2f886c"},"file_code":{"kind":"string","value":"\n\n#pragma once\n\n#include <uuid/uuid.h>\n#include <string>\n#include <array>\n\n#ifndef __APPLE__\n#include <string.h>\n\ntypedef char __uuid_string_t[37];\ntypedef __uuid_string_t uuid_string_t;\n#endif\n\nstatic_assert(16 == sizeof(uuid_t), \"uuid_t is of unexpected size\");\nstatic_assert(37 == sizeof(uuid_string_t), \"Unexpected uuid_string_t size\");\n\n#include <type_traits>\n\ntemplate<typename E>\nstruct enable_bitmask_operators{\n\tstatic const bool enable=false;\n};\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable,E>::type\noperator|(E lhs,E rhs){\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(\n\t\tstatic_cast<underlying>(lhs) | static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable,E>::type\noperator&(E lhs,E rhs){\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(\n\t\tstatic_cast<underlying>(lhs) & static_cast<underlying>(rhs));\n}\n\nnamespace libuuidpp {\n\nnamespace exception {\n\t\n\tstruct invalid_uuid: public std::runtime_error {\n\t\tinvalid_uuid(const char* guid)\n\t\t: std::runtime_error(std::string(\"libuuidpp exception: invalid guid '\") + guid + \"'\")\n\t\t{}\n\t};\n};\n\nclass uuid {\n\npublic:\n\n\t\n\tstatic const uuid nil;\n\n\t\n\ttypedef std::array<unsigned char, sizeof(uuid_t)> binary;\n\n\t\n\n\t\n\tinline static uuid random() {\n\t\treturn uuid(libuuidpp::uuid::Random);\n\t}\n\n\t\n\n\t\n\tinline static bool is_valid(const char* uuidString) {\n\t\tuuid_t tmp;\n\t\treturn internal_create(uuidString, tmp);\n\t}\n\n\t\n\tinline static bool is_valid(const std::string& uuidString) {\n\t\treturn is_valid(uuidString.c_str());\n\t}\n\n\t\n\n\t\n\tinline uuid() {\n\t\tinternal_set(libuuidpp::uuid::Nil);\n\t}\n\n\t\n\tinline uuid(const uuid_t& rawValue) {\n\t\t::uuid_copy(_rawuuid, rawValue);\n\t}\n\n\t\n\tinline uuid(const binary& data) {\n\t\tset(data);\n\t}\n\n\t\n\tinline uuid(const char* guidString) {\n\t\tif (!set(guidString)) {\n\t\t\tthrow exception::invalid_uuid((guidString != NULL) ? guidString : \"NULL\");\n\t\t}\n\t}\n\n\t\n\tinline uuid(const std::string& guidString)\n\t\t: uuid(guidString.c_str()) {\n\t}\n\n\t\n\tinline uuid(const uuid& right) {\n\t\t::uuid_copy(_rawuuid, right._rawuuid);\n\t}\n\n\t\n\n\t\n\tinline bool set(const char* uuidString) {\n\t\treturn internal_create(uuidString, _rawuuid);\n\t}\n\n\tinline bool set(const std::string& guidString) {\n\t\treturn set(guidString.c_str());\n\t}\n\n\tinline void set(const binary& data) {\n\t\tmemcpy(_rawuuid, data.data(), data.size());\n\t}\n\n\t\n\tinline void set_random() {\n\t\t::uuid_generate_random(_rawuuid);\n\t}\n\t\n\tinline void set_nil() {\n\t\t::uuid_clear(_rawuuid);\n\t}\n\n\t\n\n\t\n\tstd::size_t hash() const;\n\n\t\n\n\tinline bool is_nil() const {\n\t\treturn ::uuid_is_null(_rawuuid);\n\t}\n\tinline bool operator!=(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) != 0;\n\t}\n\tinline bool operator==(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) == 0;\n\t}\n\tinline bool operator<(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) < 0;\n\t}\n\tinline bool operator>(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) > 0;\n\t}\n\n\t\n\tenum class formatting {\n\t\t\n\t\tstandard = 0,\n\t\t\n\t\tlowercase = 1 << 0,\n\t\t\n\t\tbrackets = 1 << 1\n\t};\n\n\t\n\tstd::string string(formatting format = formatting::standard) const;\n\n\t\n\tinline uuid::binary data() const {\n\t\tuuid::binary tmp;\n\t\t::memcpy(tmp.data(), _rawuuid, sizeof(uuid_t));\n\t\treturn tmp;\n\t}\n\nprivate:\n\n\t\n\ttypedef enum CreationState {\n\t\t\n\t\tNil = 0,\n\t\t\n\t\tRandom = 1\n\t} CreationState;\n\n\t\n\t\n\tstatic const size_t STR_GUID_LEN = sizeof(uuid_string_t);\n\n\t\n\t\n\t\n\t\n\tstatic const size_t MS_GUID_LEN = STR_GUID_LEN + 1;\n\n\tinline static uuid internal_create(uuid::CreationState creation = uuid::Nil) {\n\t\treturn uuid(creation);\n\t}\n\n\tinline static bool is_microsoft_formatted(const char* guid) {\n\t\treturn ((::strnlen(guid, MS_GUID_LEN + 2) == MS_GUID_LEN)\n\t\t\t\t&& guid[0] == '{'\n\t\t\t\t&& guid[STR_GUID_LEN] == '}');\n\t}\n\n\tstatic bool internal_microsoft_create(const char* uuidString, uuid_t& result);\n\n\tinline static bool internal_uuid_create(const char* uuidString, uuid_t& result) {\n\t\treturn (::uuid_parse(uuidString, result) == 0);\n\t}\n\n\tstatic bool internal_create(const char* uuidString, uuid_t& result);\n\n\tinline void internal_set(CreationState creation = uuid::Nil) {\n\t\t(creation == uuid::Random) ? set_random() : set_nil();\n\t}\n\n\tinline uuid(CreationState creation) {\n\t\tinternal_set(creation);\n\t}\n\n\t\n\t::uuid_t _rawuuid;\n};\n};\n\nnamespace std {\n\ttemplate<> struct hash<libuuidpp::uuid> {\n\t\tstd::size_t operator()(libuuidpp::uuid const& s) const noexcept {\n\t\t\treturn s.hash();\n\t\t}\n\t};\n}\n\ntemplate<>\nstruct enable_bitmask_operators<libuuidpp::uuid::formatting> {\n\tstatic const bool enable=true;\n};\n\nnamespace libuuidpp {\n\nconst uuid uuid::nil = uuid::internal_create(libuuidpp::uuid::Nil);\n\nstd::string uuid::string(libuuidpp::uuid::formatting format) const {\n\n\tstd::string result;\n\tresult.reserve(MS_GUID_LEN);\n\n\tuuid_string_t strVal;\n\n\tbool isBracketed = (format & formatting::brackets) == formatting::brackets;\n\tbool isLowercased = (format & formatting::lowercase) == formatting::lowercase;\n\n\tif (isBracketed) {\n\t\tresult += \"{\";\n\t}\n\n\tif (isLowercased) {\n\t\t::uuid_unparse_lower(_rawuuid, strVal);\n\t}\n\telse {\n\t\t::uuid_unparse_upper(_rawuuid, strVal);\n\t}\n\tresult += std::string(strVal);\n\n\tif (isBracketed) {\n\t\tresult += \"}\";\n\t}\n\n\treturn result;\n}\n\nstd::size_t uuid::hash() const {\n\n#if INTPTR_MAX == INT64_MAX\t\t\n\tstatic const std::uint64_t FNV_offset_basis = 14695981039346656037UL;\n\tstatic const std::uint64_t FNV_prime = 1099511628211;\n#elif INTPTR_MAX == INT32_MAX\t\n\tstatic const std::uint32_t FNV_offset_basis = 2166136261;\n\tstatic const std::uint32_t FNV_prime = 16777619;\n#else\n#error Not a supported architecture (32bit or 64bit)\n#endif\n\n\tstd::size_t result = FNV_offset_basis;\n\tfor (std::size_t offset = 0; offset < sizeof(uuid_t); offset++) {\n\t\tresult ^= _rawuuid[offset];\n\t\tresult *= FNV_prime;\n\t}\n\treturn result;\n}\n\nbool uuid::internal_create(const char* uuidString, uuid_t& result) {\n\tif (uuidString != nullptr) {\n\t\tif (internal_microsoft_create(uuidString, result)) {\n\t\t\treturn true;\n\t\t}\n\t\telse if (internal_uuid_create(uuidString, result)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t::uuid_clear(result);\n\treturn false;\n}\n\nbool uuid::internal_microsoft_create(const char* uuidString, uuid_t& result) {\n\tif (is_microsoft_formatted(uuidString)) {\n\t\tchar temp[STR_GUID_LEN];\n\t\t::memset(temp, 0, STR_GUID_LEN);\n\t\t::memcpy(temp, uuidString+1, STR_GUID_LEN - 1);\n\t\tif (::uuid_parse(temp, result) != 0) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n};\n"},"prefix":{"kind":"string","value":"\n\n#pragma once\n\n#include <uuid/uuid.h>\n#include <string>\n#include <array>\n\n#ifndef __APPLE__\n#include <string.h>\n\ntypedef char __uuid_string_t[37];\ntypedef __uuid_string_t uuid_string_t;\n#endif\n\nstatic_assert(16 == sizeof(uuid_t), \"uuid_t is of unexpected size\");\nstatic_assert(37 == sizeof(uuid_string_t), \"Unexpected uuid_string_t size\");\n\n#include <type_traits>\n\ntemplate<typename E>\nstruct enable_bitmask_operators{\n\tstatic const bool enable=false;\n};\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable,E>::type\noperator|(E lhs,E rhs){\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(\n\t\tstatic_cast<underlying>(lhs) | static_cast<underlying>(rhs));\n}\n\ntemplate<typename E>\ntypename std::enable_if<enable_bitmask_operators<E>::enable,E>::type\noperator&(E lhs,E rhs){\n\ttypedef typename std::underlying_type<E>::type underlying;\n\treturn static_cast<E>(\n\t\tstatic_cast<underlying>(lhs) & static_cast<underlying>(rhs));\n}\n\nnamespace libuuidpp {\n\nnamespace exception {\n\t\n\tstruct invalid_uuid: public std::runtime_error {\n\t\tinvalid_uuid(const char* guid)\n\t\t: std::runtime_error(std::string(\"libuuidpp exception: invalid guid '\") + guid + \"'\")\n\t\t{}\n\t};\n};\n\nclass uuid {\n\npublic:\n\n\t\n\tstatic const uuid nil;\n\n\t\n\ttypedef std::array<unsigned char, sizeof(uuid_t)> binary;\n\n\t\n\n\t\n\tinline static uuid random() {\n\t\treturn uuid(libuuidpp::uuid::Random);\n\t}\n\n\t\n\n\t\n\tinline static bool is_valid(const char* uuidString) {\n\t\tuuid_t tmp;\n\t\treturn internal_create(uuidString, tmp);\n\t}\n\n\t\n\tinline static bool is_valid(const std::string& uuidString) {\n\t\treturn is_valid(uuidString.c_str());\n\t}\n\n\t\n\n\t\n\tinline uuid() {\n\t\tinternal_set(libuuidpp::uuid::Nil);\n\t}\n\n\t\n\tinline uuid(const uuid_t& rawValue) {\n\t\t::uuid_copy(_rawuuid, rawValue);\n\t}\n\n\t\n\tinline uuid(const binary& data) {\n\t\tset(data);\n\t}\n\n\t\n\tinline uuid(const char* guidString) {\n\t\tif (!set(guidString)) {\n\t\t\tthrow exception::invalid_uuid((guidString != NULL) ? guidString : \"NULL\");\n\t\t}\n\t}\n\n\t\n\tinline uuid(const std::string& guidString)\n\t\t: uuid(guidString.c_str()) {\n\t}\n\n\t\n\tinline uuid(const uuid& right) {\n\t\t::uuid_copy(_rawuuid, right._rawuuid);\n\t}\n\n\t\n\n\t\n\tinline bool set(const char* uuidString) {\n\t\treturn internal_create(uuidString, _rawuuid);\n\t}\n\n\tinline bool set(const std::string& guidString) {\n\t\treturn set(guidString.c_str());\n\t}\n\n\tinline void set(const binary& data) {\n\t\tmemcpy(_rawuuid, data.data(), data.size());\n\t}\n\n\t\n\tinline void set_random() {\n\t\t::uuid_generate_random(_rawuuid);\n\t}\n\t\n\tinline void set_nil() {\n\t\t::uuid_clear(_rawuuid);\n\t}\n\n\t\n\n\t\n\tstd::size_t hash() const;\n\n\t\n\n\tinline bool is_nil() const {\n\t\treturn ::uuid_is_null(_rawuuid);\n\t}\n\tinline bool operator!=(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) != 0;\n\t}\n\tinline bool operator==(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) == 0;\n\t}\n\tinline bool operator<(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) < 0;\n\t}\n\tinline bool operator>(const uuid& right) const {\n\t\treturn ::uuid_compare(_rawuuid, right._rawuuid) > 0;\n\t}\n\n\t\n\tenum class formatting {\n\t\t\n\t\tstandard = 0,\n\t\t\n\t\tlowercase = 1 << 0,\n\t\t\n\t\tbrackets = 1 << 1\n\t};\n\n\t\n\tstd::string string(formatting format = formatting::standard) const;\n\n\t\n\tinline uuid::binary data() const {\n\t\tuuid::binary tmp;\n\t\t::memcpy(tmp.data(), _rawuuid, sizeof(uuid_t));\n\t\treturn tmp;\n\t}\n\nprivate:\n\n\t\n\ttypedef enum CreationState {\n\t\t\n\t\tNil = 0,\n\t\t\n\t\tRandom = 1\n\t} CreationState;\n\n\t\n\t\n\tstatic const size_t STR_GUID_LEN = sizeof(uuid_string_t);\n\n\t\n\t\n\t\n\t\n\tstatic const size_t MS_GUID_LEN = STR_GUID_LEN + 1;\n\n\tinline static uuid internal_create(uuid::CreationState creation = uuid::Nil) {\n\t\treturn uuid(creation);\n\t}\n\n\tinline static bool is_microsoft_formatted(const char* guid) {\n\t\treturn ((::strnlen(guid, MS_GUID_LEN + 2) == MS_GUID_LEN)\n\t\t\t\t&& guid[0] == '{'\n\t\t\t\t&& guid[STR_GUID_LEN] == '}');\n\t}\n\n\tstatic bool internal_microsoft_create(const char* uuidString, uuid_t& result);\n\n\tinline static bool internal_uuid_create(const char* uuidString, uuid_t& result) {\n\t\treturn (::uuid_parse(uuidString, result) == 0);\n\t}\n\n\tstatic bool internal_create(const char* uuidString, uuid_t& result);\n\n\tinline void internal_set(CreationState creation = uuid::Nil) {\n\t\t(creation == uuid::Random) ? set_random() : set_nil();\n\t}\n\n\tinline uuid(CreationState creation) {\n\t\tinternal_set(creation);\n\t}\n\n\t\n\t::uuid_t _rawuuid;\n};\n};\n\nnamespace std {\n\ttemplate<> struct hash<libuuidpp::uuid> {\n\t\tstd::size_t operator()(libuuidpp::uuid const& s) const noexcept {\n\t\t\treturn s.hash();\n\t\t}\n\t};\n}\n\ntemplate<>\nstruct enable_bitmask_operators<libuuidpp::uuid::formatting> {\n\tstatic const bool enable=true;\n};\n\nnamespace libuuidpp {\n\nconst uuid uuid::nil = uuid::internal_create(libuuidpp::uuid::Nil);\n\nstd::string uuid::string(libuuidpp::uuid::formatting format) const {\n\n\tstd::string result;\n\tresult.reserve(MS_GUID_LEN);\n\n\tuuid_string_t strVal;\n\n\tbool isBracketed = (format & formatting::brackets) == formatting::brackets;\n\tbool isLowercased = (format & formatting::lowercase) == formatting::lowercase;\n\n\tif (isBracketed) {\n\t\tresult += \"{\";\n\t}\n\n\tif (isLowercased) {\n\t\t::uuid_unparse_lower(_rawuuid, strVal);\n\t}\n\telse {\n\t\t::uuid_unparse_upper(_rawuuid, strVal);\n\t}\n\tresult += std::string(strVal);\n\n\tif (isBracketed) {\n\t\tresult += \"}\";\n\t}\n\n\treturn result;\n}\n\nstd::size_t uuid::hash() const {\n\n#if INTPTR_MAX == INT64_MAX\t\t\n\tstatic const std::uint64_t FNV_offset_basis = 14695981039346656037UL;\n\tstatic const std::uint64_t FNV_prime = 1099511628211;\n#elif INTPTR_MAX == INT32_MAX\t\n\tstatic const std::uint32_t FNV_offset_basis = 2166136261;\n\tstatic const std::uint32_t FNV_prime = 16777619;\n#else\n#error Not a supported architecture (32bit or 64bit)\n#endif\n\n\tstd::size_t result = FNV_offset_basis;\n\tfor (std::size_t offset = 0; offset < sizeof(uuid_t); offset++) {\n\t\tresult ^= _rawuuid[offset];\n\t\tresult *= FNV_prime;\n\t}\n\treturn result;\n}\n\nbool uuid::internal_create(const char* uuidString, uuid_t& result) {\n\tif (uuidStrin"},"suffix":{"kind":"string","value":"\n\nbool uuid::internal_microsoft_create(const char* uuidString, uuid_t& result) {\n\tif (is_microsoft_formatted(uuidString)) {\n\t\tchar temp[STR_GUID_LEN];\n\t\t::memset(temp, 0, STR_GUID_LEN);\n\t\t::memcpy(temp, uuidString+1, STR_GUID_LEN - 1);\n\t\tif (::uuid_parse(temp, result) != 0) {\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n};\n"},"middle":{"kind":"string","value":"g != nullptr) {\n\t\tif (internal_microsoft_create(uuidString, result)) {\n\t\t\treturn true;\n\t\t}\n\t\telse if (internal_uuid_create(uuidString, result)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t::uuid_clear(result);\n\treturn false;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"# libuuidpp - A lightweight C++ UUID class.\n\n\n\nA lightweight C++ class wrapper around the `libuuid` library.\n\n\n\n## Features\n\n\n\n* Compatible with std containers such as `std::vector`, `std::set`, `std::map` etc.\n\n* Handles upper and lower case uuids.\n\n* Automatically handles Microsoft-formatted uuids `{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}`\n\n* Multiple formats for output strings (uppercase, lowercase, bracketed).\n\n* Equality and greater/lesser comparators.\n\n\n\n## Why?\n\n\n\nI wanted a very simple lightweight UUID class wrapper without having to import boost or some other large framework that would be compatible with the standard library (eg. `std::vector`, `std::map`). I also didn't want to write the UUID generation myself, as here be dragons (especially relating to privacy). libuuid is a well defined and tested generator.\n\n\n\n`libuuid` is installed by default on macOS and is an easy install for other platforms.\n\n\n\n## Usage\n\n\n\nJust add `libuuidpp/libuuidpp.hpp` to your project. Requires `libuuid` and standard C++ libraries (compatible back to C++11, tested up to C++17).\n\n\n\nYou can find a bunch of tests in `main.cpp`.\n\n\n\n## API classes\n\n\n\n### `libuuidpp::uuid`\n\n\n\nThe uuid class\n\n\n\n### `libuuidpp::uuid::formatting`\n\n\n\nA typesafe enum bitfield for describing string output.\n\n\n\n### `libuuidpp::uuid::binary`\n\n\n\nA class used to transport raw binary data in and out of the uuid object.\n\n\n\n## Examples\n\n\n\n### Simple creation\n\n```cpp\n\n// The standard string constructor throws an exception if the guid is invalid\n\nlibuuidpp::uuid uid1(\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\");\n\nlibuuidpp::uuid uid2(\"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\");\n\nlibuuidpp::uuid uid3(\"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\");\n\n```\n\n\n\n### Creating random UUIDs and nil UUID.\n\n```cpp\n\n// Create a random uuid\n\nauto random_uid = libuuidpp::uuid::random();\n\nassert(!random_uid.is_nil());\n\n\n\n// nil uuid (statically defined)\n\nconst auto& nil_uid = libuuidpp::uuid::nil;\n\nassert(nil_uid.is_nil());\n\n```\n\n\n","file_path":"README.md","rank":19,"score":8117.7211615866645},{"content":"### Binary handling\n\n```cpp\n\n/// Create a uuid object from raw binary data\n\nlibuuidpp::uuid::binary binaryData {\n\n 0xc0, 0x6c, 0x89, 0x2b, 0x50, 0xab, 0x45, 0x85, 0x98, 0x19, 0x5f, 0x4b, 0xa3, 0xb8, 0xf6, 0x9b\n\n};\n\nlibuuidpp::uuid uuid(binaryData);\n\n\n\n/// Get the data back out\n\nconst libuuidpp::uuid::binary roundTrip = raw.data();\n\n```\n\n\n\n### Setting\n\n\n\n#### Constructor throws exceptions for invalid uuids\n\n```cpp\n\ntry {\n\n libuuidpp::uuid my_dodgy_uuid(\"F211F534-8DFB-4269-9A bad\");\n\n\t\n\n // Do something with my_dodgy_uuid\n\n\t\n\n} catch (libuuidpp::exception::invalid_uuid e) {\n\n printf(\"Successfully caught exception during creation\\n\");\n\n}\n\n```\n\n#### Basic setters\n\n```cpp\n\nlibuuidpp::uuid myUUID;\n\nbool didSet = myUUID.set(\"F211F534-8DFB-4269-9AF1-245FA0AB8D87\");\n\nassert(didSet == true);\n\n\n\n/// Attempting assignment to an invalid uuid string\n\ndidSet = myUUID.set(\"D1ABE846-63D3-4C0A-89EF-\");\n\nassert(didSet == false);\n\nassert(myUUID.is_nil());\n\n\n\n/// Set myUUID to a random guid\n\nmyUUID.set_random();\n\nassert(!myUUID.is_nil());\n\n\n\n/// Assigning a new uuid\n\nauto newUUID = libuuidpp::uuid(\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\");\n\nmyUUID = newUUID;\n\nassert(myUUID == newUUID);\n\n```\n\n### Generate a string from the uuid\n\n```cpp\n\nlibuuidpp::uuid uid1(\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\");\n\n\n\n// Default output (uppercase, no brackets)\n\nstd::string uidString1 = uid1.str();\n\nassert(uidString1 == \"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\");\n\n\n\n// Lowercase output\n\nstd::string uidString2 = uid1.str(libuuidpp::uuid::formatting::lowercase);\n\nassert(uidString2 == \"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\");\n\n\n\n// Bracketed output\n\nstd::string uidString3 = uid1.str(libuuidpp::uuid::formatting::brackets);\n\nassert(uidString3 == \"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\");\n\n\n\n// Lowercase, Bracketed output\n\nstd::string uidString4 = uid1.str(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\n\nassert(uidString4 == \"{d1abe846-63d3-4c0a-89ef-68f1a306f6d3}\");\n\n```\n","file_path":"README.md","rank":20,"score":8117.026913819676},{"content":"### Comparison operators\n\n```cpp\n\nlibuuidpp::uuid uid1(\"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\");\n\nlibuuidpp::uuid uid2(\"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\");\n\nlibuuidpp::uuid uid3(\"84AEEDE7-E056-4F89-BAD1-BF97B96FAAAA\");\n\n\n\n/// uid1 and uid2 resolve to the same uuid value, therefore they are equal\n\nassert(uid1 == uid2);\n\n\n\n/// uid2 and uid3 are different uuids, so they aren't equal\n\nassert(uid2 != uid3);\n\n```\n\n### Lexigraphic sorting support\n\n```cpp\n\nstd::vector<libuuidpp::uuid> result;\n\nfor (size_t c = 0; c < 10; c++) {\n\n result.push_back(libuuidpp::uuid::random());\n\n}\n\nstd::sort(result1.begin(), result1.end(), std::less<libuuidpp::uuid>());\n\nstd::sort(result1.begin(), result1.end(), std::greater<libuuidpp::uuid>());\n\n```\n\n## Thanks\n\n\n\nTypesafe enum bitfield support from Just Software Solutions.\n\n\n\n - See [https://www.justsoftwaresolutions.co.uk/cplusplus/using-enum-classes-as-bitfields.html](https://www.justsoftwaresolutions.co.uk/cplusplus/using-enum-classes-as-bitfields.html)\n\n\n\n## License\n\n\n\n```\n\nBoost Software License - Version 1.0 - August 17th, 2003\n\n\n\nPermission is hereby granted, free of charge, to any person or organization\n\nobtaining a copy of the software and accompanying documentation covered by\n\nthis license (the \"Software\") to use, reproduce, display, distribute,\n\nexecute, and transmit the Software, and to prepare derivative works of the\n\nSoftware, and to permit third-parties to whom the Software is furnished to\n\ndo so, all subject to the following:\n\n\n\nThe copyright notices in the Software and this entire statement, including\n\nthe above license grant, this restriction and the following disclaimer,\n\nmust be included in all copies of the Software, in whole or in part, and\n\nall derivative works of the Software, unless such copies or derivative\n\nworks are solely in the form of machine-executable object code generated by\n\na source language processor.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n\nSHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n\nFOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\nDEALINGS IN THE SOFTWARE.\n\n```\n","file_path":"README.md","rank":21,"score":8106.408531226635},{"content":"\t\t\t\t\t \"a0478799-a6dd-4637-a8aa-87f6eb014317\",\n\n\t\t\t\t\t \"Binary data didn't match the string data?\");\n\n\n\n\tconst auto roundTrip = raw.data();\n\n\tDSF_ASSERT_EQUAL(rawData, roundTrip, \"Return trip raw data convert failed\")\n\n\n\n\tlibuuidpp::uuid valString(\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B}\");\n\n\tlibuuidpp::uuid::binary valueExpected {\n\n\t\t0xc0, 0x6c, 0x89, 0x2b, 0x50, 0xab, 0x45, 0x85, 0x98, 0x19, 0x5f, 0x4b, 0xa3, 0xb8, 0xf6, 0x9b\n\n\t};\n\n\tconst auto valBinary = valString.data();\n\n\tDSF_ASSERT_EQUAL(valBinary,\n\n\t\t\t\t\t valueExpected,\n\n\t\t\t\t\t \"Return trip raw data convert failed\")\n\n}\n\n\n\nvoid testHashing() {\n\n\tstd::cout << \"Running test: testHashing\" << std::endl;\n\n\n\n\tconst auto s1 = libuuidpp::uuid::random();\n","file_path":"main.cpp","rank":22,"score":20.187058242087666},{"content":"\tgroup.insert(\"{c06c892b-50ab-4585-9819-5f4ba3b8f69b}\");\n\n\tDSF_ASSERT_EQUAL(1, group.size(), \"Supposedly unique items are not unique\");\n\n\n\n\t// Add 100000 guids, any duplicates will have been removed so check for exact count\n\n\tgroup.clear();\n\n\tconst size_t count = 100000;\n\n\tfor (size_t i = 0; i < count; i++) {\n\n\t\tgroup.insert(libuuidpp::uuid::random());\n\n\t}\n\n\tDSF_ASSERT_EQUAL(count, group.size(), \"Generated some non-unique uuids\");\n\n}\n\n\n\nvoid testBinary() {\n\n\tstd::cout << \"Running test: testBinary\" << std::endl;\n\n\n\n\tlibuuidpp::uuid::binary rawData {\n\n\t\t0xa0, 0x47, 0x87, 0x99, 0xa6, 0xdd, 0x46, 0x37, 0xa8, 0xaa, 0x87, 0xf6, 0xeb, 0x01, 0x43, 0x17\n\n\t};\n\n\tlibuuidpp::uuid raw(rawData);\n\n\tDSF_ASSERT_EQUAL(raw.string(libuuidpp::uuid::formatting::lowercase),\n","file_path":"main.cpp","rank":23,"score":17.595797857177846},{"content":"\n\n\tunorderedSet.clear();\n\n\n\n\t// Create 'count' random guids\n\n\tfor (size_t i = 0; i < count; i++) {\n\n\t\tunorderedSet.insert(libuuidpp::uuid::random());\n\n\t}\n\n\n\n\tstd::set<std::size_t> hashes;\n\n\tstd::for_each(unorderedSet.begin(), unorderedSet.end(), [&hashes](const libuuidpp::uuid& element) {\n\n\t\thashes.insert(element.hash());\n\n\t});\n\n\n\n\t// All of the hashes should be unique. Hashes uses a set, so duplicates will be removed\n\n\tDSF_ASSERT_EQUAL(count, hashes.size(), \"Found duplicates\");\n\n}\n\n\n\nvoid testInvalid() {\n\n\tstd::cout << \"Running test: testInvalid\" << std::endl;\n\n\n","file_path":"main.cpp","rank":24,"score":17.258024126353767},{"content":"\t} catch (libuuidpp::exception::invalid_uuid e) {\n\n\t\tstd::cout << \"Caught exception during creation of valid uuid\" << std::endl;\n\n\t\tDSF_ASSERT(false);\n\n\t}\n\n\n\n\tauto tempStr = temp2->string();\n\n\tDSF_ASSERT(tempStr == \"C06C892B-50AB-4585-9819-5F4BA3B8F69B\");\n\n#endif\n\n\n\n\tauto c1 = libuuidpp::uuid::random();\n\n\tlibuuidpp::uuid c2 = c1;\n\n\tDSF_ASSERT(c1 == c2); // \"Random guids are the same!\"\n\n\n\n\tauto s1 = c1.string();\n\n\tlibuuidpp::uuid c3(s1.c_str());\n\n\tDSF_ASSERT(c1 == c3);\n\n\n\n\tDSF_ASSERT(c1.is_nil() == false);\n\n\n\n\tconst auto& nil = libuuidpp::uuid::nil;\n","file_path":"main.cpp","rank":25,"score":17.200150874743635},{"content":"\tconst auto s2 = libuuidpp::uuid::random();\n\n\tconst auto& nil = libuuidpp::uuid::nil;\n\n\tconst libuuidpp::uuid nilc;\n\n\n\n\tDSF_ASSERT_EQUAL(nil.hash(), nil.hash(), \"Null hash values should be equal\");\n\n\tDSF_ASSERT_EQUAL(nilc.hash(), nilc.hash(), \"Null hash values should be equal\");\n\n\tDSF_ASSERT_EQUAL(nil.hash(), nilc.hash(), \"Null hash values should be equal\");\n\n\tDSF_ASSERT_EQUAL(s1.hash(), s1.hash(), \"Same uuid generated different hashes\");\n\n\tDSF_ASSERT_NOTEQUAL(s1.hash(), s2.hash(), \"Hash values should be different\");\n\n\tDSF_ASSERT_NOTEQUAL(s1.hash(), nil.hash(), \"Hash values should be different\");\n\n\n\n\tstd::unordered_set<libuuidpp::uuid> unorderedSet { s1, s2, s2, nil, nil };\n\n\tDSF_ASSERT_EQUAL(3, unorderedSet.size(), \"Expecting 3 elements\");\n\n\n\n\tunorderedSet.clear();\n\n\tconst size_t count = 100000;\n\n\tfor (size_t i = 0; i < count; i++) {\n\n\t\tunorderedSet.insert(libuuidpp::uuid::random());\n\n\t}\n\n\tDSF_ASSERT_EQUAL(count, unorderedSet.size(), \"Mismatch in unordered_set size - unexpected hashing clash\");\n","file_path":"main.cpp","rank":26,"score":16.651881493802126},{"content":"\tDSF_ASSERT(libuuidpp::uuid::nil.is_nil());\n\n\n\n\tconst auto& nilUUID = libuuidpp::uuid::nil;\n\n\tDSF_ASSERT(nilUUID.is_nil());\n\n\n\n\t// Check that the static nil object is created only once (addresses should be the same)\n\n\tDSF_ASSERT_EQUAL(&libuuidpp::uuid::nil, &libuuidpp::uuid::nil, \"static nils have different addresses?\");\n\n\n\n\tconst libuuidpp::uuid nilc;\n\n\tDSF_ASSERT_NOTEQUAL(&libuuidpp::uuid::nil, &nilc, \"static nil and dynamically created nil have the same address?\");\n\n\n\n\t// Random guid creation\n\n\n\n\tlibuuidpp::uuid c1 = libuuidpp::uuid::random();\n\n\tlibuuidpp::uuid c2 = libuuidpp::uuid::random();\n\n\n\n\tDSF_ASSERT_NOTEQUAL(c1, c2, \"Random guids are the same!\");\n\n\n\n\t// nil guid creation\n\n\n","file_path":"main.cpp","rank":27,"score":15.835971052739414},{"content":"\n\n}\n\n\n\nvoid testAssign() {\n\n\n\n\tstd::cout << \"Running test: testAssign\" << std::endl;\n\n\n\n#if defined(UUID_OPTIONAL_SUPPORT)\n\n\tstd::optional<libuuidpp::uuid> temp1;\n\n\ttry {\n\n\t\ttemp1 = std::make_optional(libuuidpp::uuid(\"This should fail\"));\n\n\t\tstd::cerr << \"Didn't catch exception during creation\" << std::endl;\n\n\t\tDSF_ASSERT(false);\n\n\t} catch (libuuidpp::exception::invalid_uuid e) {\n\n\t\tstd::cout << \"Successfully caught exception during creation\" << std::endl;\n\n\t}\n\n\n\n\tstd::optional<libuuidpp::uuid> temp2;\n\n\ttry {\n\n\t\ttemp2 = std::make_optional(libuuidpp::uuid(\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\"));\n","file_path":"main.cpp","rank":28,"score":15.349019633508618},{"content":"\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(NULL), \"Invalid uuid string should create nil uuid\");\n\n}\n\n\n\nvoid testMap() {\n\n\tstd::cout << \"Running test: testMap\" << std::endl;\n\n\n\n\t/// Adding to a map as the key\n\n\tstd::map<libuuidpp::uuid, std::string> values;\n\n\tlibuuidpp::uuid g1(\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\");\n\n\tlibuuidpp::uuid g11(\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B}\");\n\n\tlibuuidpp::uuid g2(\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\");\n\n\tlibuuidpp::uuid g3(\"F211F534-8DFB-4269-9AF1-245FA0AB8D87\");\n\n\tvalues[g1] = \"this is a uuid\";\n\n\tvalues[g2] = \"this is another uuid\";\n\n\n\n\tDSF_ASSERT(values[g1] == \"this is a uuid\");\n\n\tDSF_ASSERT(values[g11] == \"this is a uuid\");\n\n\tDSF_ASSERT(values[g2] == \"this is another uuid\");\n\n\n\n\t/// As g3 doesn't exist in the map, the [] operator adds g3 with a default std::string value\n","file_path":"main.cpp","rank":29,"score":12.906230520969597},{"content":"\tDSF_ASSERT(nil.is_nil());\n\n\tDSF_ASSERT(nil != c1);\n\n\n\n\tc1.set_nil();\n\n\tDSF_ASSERT(c1.is_nil());\n\n\n\n\tc1.set_random();\n\n\tDSF_ASSERT(c1 != c3);\n\n\n\n\tstd::string stdguid = \"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\";\n\n\tauto stdguid1 = libuuidpp::uuid(stdguid.c_str());\n\n\tauto sg2 = stdguid1.string();\n\n\tDSF_ASSERT(stdguid == sg2);\n\n}\n\n\n\nvoid testMSGuid() {\n\n\n\n\tstd::cout << \"Running test: testMSGuid\" << std::endl;\n\n\n\n\tstd::string msGuid = \"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\";\n","file_path":"main.cpp","rank":30,"score":12.780071419048403},{"content":"\n\n\tstd::set<libuuidpp::uuid> uuids = { g3, g11, g2, g1 };\n\n\n\n\t// g1 and g11 are the same uuid (even though they have different strings during creation)\n\n\tDSF_ASSERT(uuids.size() == 3);\n\n\n\n\tstd::vector<std::string> uuidStrings;\n\n\tstd::transform(uuids.begin(), uuids.end(),\n\n\t\t\t\t std::back_inserter(uuidStrings),\n\n\t\t\t\t [](const libuuidpp::uuid& uuid) -> std::string\n\n\t\t\t\t {\n\n\t\t\t\t\t return uuid.string(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\n\n\t\t\t\t });\n\n\n\n\tstd::vector<std::string> expected = {\n\n\t\t\"{c06c892b-50ab-4585-9819-5f4ba3b8f69b}\",\n\n\t\t\"{d1abe846-63d3-4c0a-89ef-68f1a306f6d3}\",\n\n\t\t\"{f211f534-8dfb-4269-9af1-245fa0ab8d87}\" };\n\n\n\n\tDSF_ASSERT(uuidStrings == expected);\n","file_path":"main.cpp","rank":31,"score":12.390816970146737},{"content":"\tlibuuidpp::uuid test1;\n\n\n\n\t// Make sure that we can successfully parse a goodun\n\n\tDSF_ASSERT(test1.set(\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\") == true);\n\n\tDSF_ASSERT_FALSE(test1.is_nil(), \"Correct uuid string should not be nil\");\n\n\n\n\t// Length and bracket checks\n\n\n\n\t// Check that invalid set automatically sets the value to nil\n\n\tDSF_ASSERT_FALSE(test1.set(\"C56A4180-65AA-42EC-A945-5FD21DEC\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT(test1.is_nil());\n\n\n\n\t// Static validation methods\n\n\tDSF_ASSERT(libuuidpp::uuid::is_valid(\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\"));\n\n\tDSF_ASSERT(libuuidpp::uuid::is_valid(\"{e8e3db08-dc39-48ea-a3db-08dc3958eafb}\"));\n\n\tDSF_ASSERT(libuuidpp::uuid::is_valid(\"{29C49537-2BD1-4DA1-887A-5D0B93514BAD}\"));\n\n\n\n\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(\"{29C49537-2xD1-4DA1-887A-5D0B93514BAD}\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(\" 33aff347-1028-4fb2-86c7-2cdf06ef3610}\"), \"Invalid uuid string should create nil uuid\");\n\n\n","file_path":"main.cpp","rank":32,"score":11.913154997467636},{"content":"\tDSF_ASSERT(s6 == sGuidlb);\n\n}\n\n\n\nvoid testOrdering() {\n\n\n\n\tstd::cout << \"Running test: testOrdering\" << std::endl;\n\n\n\n\tstd::vector<libuuidpp::uuid> result1;\n\n\tstd::vector<libuuidpp::uuid> result2;\n\n\tfor (size_t c = 0; c < 10; c++) {\n\n\t\tresult1.push_back(libuuidpp::uuid::random());\n\n\t}\n\n\tfor (size_t c = 0; c < 10; c++) {\n\n\t\tresult2.push_back(libuuidpp::uuid::random());\n\n\t}\n\n\n\n\tDSF_ASSERT(result1 != result2);\n\n\n\n\tauto result3 = result1;\n\n\tDSF_ASSERT(result1 == result3);\n","file_path":"main.cpp","rank":33,"score":11.713485155724209},{"content":"\tlibuuidpp::uuid n1, n2;\n\n\tDSF_ASSERT_EQUAL(n1, n2, \"generated uuids are equal\");\n\n\tDSF_ASSERT_NOTEQUAL(n1, c1, \"random and nil guids are equal?\");\n\n\n\n\tuuid_t rawValue;\n\n\t::uuid_generate(rawValue);\n\n\tlibuuidpp::uuid c3(rawValue);\n\n\n\n\t::uuid_string_t stringVal;\n\n\t::uuid_unparse_upper(rawValue, stringVal);\n\n\n\n\tauto rawString = std::string(stringVal);\n\n\tDSF_ASSERT_EQUAL(rawString, c3.string(), \"generated string are not equal\");\n\n\n\n\t// Generate some random guids - check for uniqueness (dumb test really)\n\n\tstd::set<libuuidpp::uuid> group;\n\n\n\n\t// Check that duplicated items are not stored in a set\n\n\tgroup.insert(\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\");\n\n\tgroup.insert(\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B}\");\n","file_path":"main.cpp","rank":34,"score":11.2806261017063},{"content":"\t// Correctly formatted uuid should contain - separators\n\n\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(\"6D059566588D4BF081933253FAFD1426\"), \"Invalid uuid string should create nil uuid\");\n\n\n\n\t// Series of badly formatted\n\n\tDSF_ASSERT_FALSE(test1.set(\" C06C892B-50AB-4585-9819-5F4BA3B8F69B\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"{8078cbe9-2b91-4d82-9e8a-8d27ca5fcfa8\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"C06C892B-50AB-4585-9819-5F4BA3B8F69B}\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B} \"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"{C06C892B-50AB-4585-9819-5F4BA3B8F69BA}\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"C06C892B-50AB-4585-9819-5F4BA3B8F69BAA\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"{C06C892B-50AB-4585-9819-5F4BA3B8F69BA\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"{ C06C892B-50AB-4585-9819-5F4BA3B8F69B}\"), \"Invalid uuid string should create nil uuid\");\n\n\n\n\t// Invalid chars in the guid\n\n\tDSF_ASSERT_FALSE(test1.set(\"{C06C892B-50AB-4585-9819-5F4&A3B8F69B}\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(test1.set(\"C06C892B-50XB-4585-9819-5F4A3B8F69B\"), \"Invalid uuid string should create nil uuid\");\n\n\n\n\t// Invalid empty string\n\n\tDSF_ASSERT_FALSE(test1.set(\"\"), \"Invalid uuid string should create nil uuid\");\n\n\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(nullptr), \"Invalid uuid string should create nil uuid\");\n","file_path":"main.cpp","rank":35,"score":11.199405554320144},{"content":"\tauto s5 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\n\n\tDSF_ASSERT(sGuidl == s4);\n\n}\n\n\n\nvoid testUpperLower() {\n\n\n\n\tstd::cout << \"Running test: testUpperLower\" << std::endl;\n\n\n\n\tstd::string sGuid = \"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\";\n\n\tstd::string sGuidl = \"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\";\n\n\tstd::string sGuidlb = \"{d1abe846-63d3-4c0a-89ef-68f1a306f6d3}\";\n\n\tstd::string sGuidub = \"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\";\n\n\n\n\tstd::vector<libuuidpp::uuid> vals = { sGuid, sGuidl, sGuidlb, sGuidub };\n\n\tstd::vector<std::string> expected(4, \"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\");\n\n\n\n\t// Maps the vals vector to their string equivalents\n\n\tstd::vector<std::string> uuidStrings;\n\n\tstd::transform(vals.begin(), vals.end(),\n\n\t\t\t\t std::back_inserter(uuidStrings),\n","file_path":"main.cpp","rank":36,"score":11.12132883943553},{"content":"\t\t\t\t [](const libuuidpp::uuid& uuid) -> std::string\n\n\t{\n\n\t\treturn uuid.string();\n\n\t});\n\n\tDSF_ASSERT(uuidStrings == expected);\n\n\n\n\tauto sGuid2 = libuuidpp::uuid(sGuid);\n\n\tauto sGuidl2 = libuuidpp::uuid(sGuidl);\n\n\tDSF_ASSERT(sGuid2 == sGuidl2);\n\n\n\n\tauto s3 = sGuid2.string();\n\n\tDSF_ASSERT(sGuid == s3);\n\n\n\n\tauto s4 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase);\n\n\tDSF_ASSERT(sGuidl == s4);\n\n\n\n\tauto s5 = sGuidl2.string();\n\n\tDSF_ASSERT(s4 != s5);\n\n\n\n\tauto s6 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\n","file_path":"main.cpp","rank":37,"score":10.61528568570835},{"content":"\tstd::string sGuid = \"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\";\n\n\tstd::string sGuidl = \"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\";\n\n\n\n\tauto msGuid2 = libuuidpp::uuid(msGuid);\n\n\tauto sGuid2 = libuuidpp::uuid(sGuid);\n\n\tauto sGuidl2 = libuuidpp::uuid(sGuidl);\n\n\tDSF_ASSERT(msGuid2 == sGuid2);\n\n\n\n\t/// Check that a lowercase version matches\n\n\tDSF_ASSERT(msGuid2 == sGuidl2);\n\n\n\n\tauto s2 = msGuid2.string(libuuidpp::uuid::formatting::brackets);\n\n\tDSF_ASSERT(msGuid == s2);\n\n\n\n\tauto s3 = sGuid2.string();\n\n\tDSF_ASSERT(sGuid == s3);\n\n\n\n\tauto s4 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase);\n\n\tDSF_ASSERT(sGuidl == s4);\n\n\n","file_path":"main.cpp","rank":38,"score":10.554300347093399},{"content":"\tDSF_ASSERT(values[g3] == \"\");\n\n\n\n\t/// Adding to a map as the valuetype\n\n\tstd::map<std::string, libuuidpp::uuid> mapper;\n\n\tmapper[\"cat\"] = g1;\n\n\tmapper[\"dog\"] = g2;\n\n\n\n\tconst auto& m1 = mapper[\"cat\"];\n\n\tconst auto& m2 = mapper[\"dog\"];\n\n\tDSF_ASSERT(!m1.is_nil());\n\n\tDSF_ASSERT(!m2.is_nil());\n\n\n\n\t/// Asking for a key that doesn't exist returns a null guid.\n\n\tauto ret = mapper.find(\"caterpillar\");\n\n\tDSF_ASSERT(ret == mapper.end());\n\n\n\n\tconst auto& m3 = mapper[\"caterpillar\"];\n\n\tDSF_ASSERT(m3.is_nil());\n\n\n\n\t// Set stuff\n","file_path":"main.cpp","rank":39,"score":10.013529605626239},{"content":"\tresult4.push_back(result4[2]);\n\n\tstd::sort(result4.begin(), result4.end());\n\n\tduplicate = std::adjacent_find(result4.begin(), result4.end());\n\n\tDSF_ASSERT(duplicate != result4.end());\n\n}\n\n\n\nint main(int argc, const char * argv[]) {\n\n\t// insert code here...\n\n\tstd::cout << \"Starting tests...\\n\";\n\n\n\n\ttestSimple();\n\n\ttestBinary();\n\n\ttestInvalid();\n\n\ttestMap();\n\n\ttestHashing();\n\n\ttestAssign();\n\n\ttestOrdering();\n\n\ttestMSGuid();\n\n\ttestUpperLower();\n\n\n\n\tstd::cout << \"... tests complete\\n\";\n\n\n\n\treturn 0;\n\n}\n\n\n\n\n","file_path":"main.cpp","rank":40,"score":9.617017218230426},{"content":"\n\n\tstd::sort(result1.begin(), result1.end(), std::less<libuuidpp::uuid>());\n\n\tDSF_ASSERT(result1 != result3);\n\n\tstd::sort(result3.begin(), result3.end(), std::less<libuuidpp::uuid>());\n\n\tDSF_ASSERT(result1 == result3);\n\n\n\n\tauto find = std::find(result1.begin(), result1.end(), libuuidpp::uuid::nil);\n\n\tDSF_ASSERT(find == result1.end());\n\n\n\n\tauto duplicate = std::adjacent_find(result1.begin(), result1.end());\n\n\tDSF_ASSERT(duplicate == result1.end());\n\n\n\n\tstd::vector<libuuidpp::uuid> result4;\n\n\tfor (size_t c = 0; c < 100; c++) {\n\n\t\tresult4.push_back(libuuidpp::uuid::random());\n\n\t}\n\n\tduplicate = std::adjacent_find(result4.begin(), result4.end());\n\n\tstd::sort(result4.begin(), result4.end());\n\n\tDSF_ASSERT(duplicate == result4.end());\n\n\n","file_path":"main.cpp","rank":41,"score":9.549022478434756},{"content":"// 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, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n\n// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n\n// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n\n// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\n// DEALINGS IN THE SOFTWARE.\n\n//\n\n\n\n#include <iostream>\n\n#include <vector>\n\n#include <map>\n\n#include <set>\n\n#include <algorithm>\n\n#include <unordered_set>\n\n\n\n#if __cplusplus == 201703\t\t// C++17 std::optional support\n\n#define UUID_OPTIONAL_SUPPORT 1\n\n#include <optional>\n\n#endif\n","file_path":"main.cpp","rank":42,"score":7.184216214452288},{"content":"\n\n#include \"libuuidpp/libuuidpp.hpp\"\n\n\n\n/// Simple test harness\n\n\n\n#define DSF_ASSERT(ASSERTION) if (!(ASSERTION)) \\\n\n{ std::cerr << \"ASSERTION: Line \" << __LINE__ << \", file: \" << __FILE__ << \"\\n\"; abort(); }\n\n#define DSF_ASSERT_FALSE(ASSERTION, msg) if ((ASSERTION)) \\\n\n{ std::cerr << \"ASSERTION: Line \" << __LINE__ << \", file: \" << __FILE__ << \", message: '\" << msg << \"'\\n\"; abort(); }\n\n#define DSF_ASSERT_MSG(ASSERTION, msg) if (!(ASSERTION)) \\\n\n{ std::cerr << \"ASSERTION: Line \" << __LINE__ << \", file: \" << __FILE__ << \", message: '\" << msg << \"'\\n\"; abort(); }\n\n#define DSF_ASSERT_EQUAL(AVAL, BVAL, msg) if ((AVAL) != (BVAL)) \\\n\n{ std::cerr << \"ASSERTION: Line \" << __LINE__ << \", file: \" << __FILE__ << \", message: '\" << msg << \"'\\n\"; abort(); }\n\n#define DSF_ASSERT_NOTEQUAL(AVAL, BVAL, msg) if ((AVAL) == (BVAL)) \\\n\n{ std::cerr << \"ASSERTION: Line \" << __LINE__ << \", file: \" << __FILE__ << \", message: '\" << msg << \"'\\n\"; abort(); }\n\n\n\nvoid testSimple() {\n\n\n\n\tstd::cout << \"Running test: testSimple\" << std::endl;\n\n\n","file_path":"main.cpp","rank":43,"score":5.7462008134464675},{"content":"//\n\n// main.cpp\n\n// libuuidpp tests\n\n//\n\n// Boost Software License - Version 1.0 - August 17th, 2003\n\n//\n\n// Permission is hereby granted, free of charge, to any person or organization\n\n// obtaining a copy of the software and accompanying documentation covered by\n\n// this license (the \"Software\") to use, reproduce, display, distribute,\n\n// execute, and transmit the Software, and to prepare derivative works of the\n\n// Software, and to permit third-parties to whom the Software is furnished to\n\n// do so, all subject to the following:\n\n//\n\n// The copyright notices in the Software and this entire statement, including\n\n// the above license grant, this restriction and the following disclaimer,\n\n// must be included in all copies of the Software, in whole or in part, and\n\n// all derivative works of the Software, unless such copies or derivative\n\n// works are solely in the form of machine-executable object code generated by\n\n// a source language processor.\n\n//\n","file_path":"main.cpp","rank":44,"score":3.08650261099255}],"string":"[\n {\n \"content\": \"# libuuidpp - A lightweight C++ UUID class.\\n\\n\\n\\nA lightweight C++ class wrapper around the `libuuid` library.\\n\\n\\n\\n## Features\\n\\n\\n\\n* Compatible with std containers such as `std::vector`, `std::set`, `std::map` etc.\\n\\n* Handles upper and lower case uuids.\\n\\n* Automatically handles Microsoft-formatted uuids `{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}`\\n\\n* Multiple formats for output strings (uppercase, lowercase, bracketed).\\n\\n* Equality and greater/lesser comparators.\\n\\n\\n\\n## Why?\\n\\n\\n\\nI wanted a very simple lightweight UUID class wrapper without having to import boost or some other large framework that would be compatible with the standard library (eg. `std::vector`, `std::map`). I also didn't want to write the UUID generation myself, as here be dragons (especially relating to privacy). libuuid is a well defined and tested generator.\\n\\n\\n\\n`libuuid` is installed by default on macOS and is an easy install for other platforms.\\n\\n\\n\\n## Usage\\n\\n\\n\\nJust add `libuuidpp/libuuidpp.hpp` to your project. Requires `libuuid` and standard C++ libraries (compatible back to C++11, tested up to C++17).\\n\\n\\n\\nYou can find a bunch of tests in `main.cpp`.\\n\\n\\n\\n## API classes\\n\\n\\n\\n### `libuuidpp::uuid`\\n\\n\\n\\nThe uuid class\\n\\n\\n\\n### `libuuidpp::uuid::formatting`\\n\\n\\n\\nA typesafe enum bitfield for describing string output.\\n\\n\\n\\n### `libuuidpp::uuid::binary`\\n\\n\\n\\nA class used to transport raw binary data in and out of the uuid object.\\n\\n\\n\\n## Examples\\n\\n\\n\\n### Simple creation\\n\\n```cpp\\n\\n// The standard string constructor throws an exception if the guid is invalid\\n\\nlibuuidpp::uuid uid1(\\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\");\\n\\nlibuuidpp::uuid uid2(\\\"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\\\");\\n\\nlibuuidpp::uuid uid3(\\\"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\\\");\\n\\n```\\n\\n\\n\\n### Creating random UUIDs and nil UUID.\\n\\n```cpp\\n\\n// Create a random uuid\\n\\nauto random_uid = libuuidpp::uuid::random();\\n\\nassert(!random_uid.is_nil());\\n\\n\\n\\n// nil uuid (statically defined)\\n\\nconst auto& nil_uid = libuuidpp::uuid::nil;\\n\\nassert(nil_uid.is_nil());\\n\\n```\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 19,\n \"score\": 8117.7211615866645\n },\n {\n \"content\": \"### Binary handling\\n\\n```cpp\\n\\n/// Create a uuid object from raw binary data\\n\\nlibuuidpp::uuid::binary binaryData {\\n\\n 0xc0, 0x6c, 0x89, 0x2b, 0x50, 0xab, 0x45, 0x85, 0x98, 0x19, 0x5f, 0x4b, 0xa3, 0xb8, 0xf6, 0x9b\\n\\n};\\n\\nlibuuidpp::uuid uuid(binaryData);\\n\\n\\n\\n/// Get the data back out\\n\\nconst libuuidpp::uuid::binary roundTrip = raw.data();\\n\\n```\\n\\n\\n\\n### Setting\\n\\n\\n\\n#### Constructor throws exceptions for invalid uuids\\n\\n```cpp\\n\\ntry {\\n\\n libuuidpp::uuid my_dodgy_uuid(\\\"F211F534-8DFB-4269-9A bad\\\");\\n\\n\\t\\n\\n // Do something with my_dodgy_uuid\\n\\n\\t\\n\\n} catch (libuuidpp::exception::invalid_uuid e) {\\n\\n printf(\\\"Successfully caught exception during creation\\\\n\\\");\\n\\n}\\n\\n```\\n\\n#### Basic setters\\n\\n```cpp\\n\\nlibuuidpp::uuid myUUID;\\n\\nbool didSet = myUUID.set(\\\"F211F534-8DFB-4269-9AF1-245FA0AB8D87\\\");\\n\\nassert(didSet == true);\\n\\n\\n\\n/// Attempting assignment to an invalid uuid string\\n\\ndidSet = myUUID.set(\\\"D1ABE846-63D3-4C0A-89EF-\\\");\\n\\nassert(didSet == false);\\n\\nassert(myUUID.is_nil());\\n\\n\\n\\n/// Set myUUID to a random guid\\n\\nmyUUID.set_random();\\n\\nassert(!myUUID.is_nil());\\n\\n\\n\\n/// Assigning a new uuid\\n\\nauto newUUID = libuuidpp::uuid(\\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\");\\n\\nmyUUID = newUUID;\\n\\nassert(myUUID == newUUID);\\n\\n```\\n\\n### Generate a string from the uuid\\n\\n```cpp\\n\\nlibuuidpp::uuid uid1(\\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\");\\n\\n\\n\\n// Default output (uppercase, no brackets)\\n\\nstd::string uidString1 = uid1.str();\\n\\nassert(uidString1 == \\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\");\\n\\n\\n\\n// Lowercase output\\n\\nstd::string uidString2 = uid1.str(libuuidpp::uuid::formatting::lowercase);\\n\\nassert(uidString2 == \\\"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\\\");\\n\\n\\n\\n// Bracketed output\\n\\nstd::string uidString3 = uid1.str(libuuidpp::uuid::formatting::brackets);\\n\\nassert(uidString3 == \\\"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\\\");\\n\\n\\n\\n// Lowercase, Bracketed output\\n\\nstd::string uidString4 = uid1.str(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\\n\\nassert(uidString4 == \\\"{d1abe846-63d3-4c0a-89ef-68f1a306f6d3}\\\");\\n\\n```\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 20,\n \"score\": 8117.026913819676\n },\n {\n \"content\": \"### Comparison operators\\n\\n```cpp\\n\\nlibuuidpp::uuid uid1(\\\"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\\\");\\n\\nlibuuidpp::uuid uid2(\\\"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\\\");\\n\\nlibuuidpp::uuid uid3(\\\"84AEEDE7-E056-4F89-BAD1-BF97B96FAAAA\\\");\\n\\n\\n\\n/// uid1 and uid2 resolve to the same uuid value, therefore they are equal\\n\\nassert(uid1 == uid2);\\n\\n\\n\\n/// uid2 and uid3 are different uuids, so they aren't equal\\n\\nassert(uid2 != uid3);\\n\\n```\\n\\n### Lexigraphic sorting support\\n\\n```cpp\\n\\nstd::vector<libuuidpp::uuid> result;\\n\\nfor (size_t c = 0; c < 10; c++) {\\n\\n result.push_back(libuuidpp::uuid::random());\\n\\n}\\n\\nstd::sort(result1.begin(), result1.end(), std::less<libuuidpp::uuid>());\\n\\nstd::sort(result1.begin(), result1.end(), std::greater<libuuidpp::uuid>());\\n\\n```\\n\\n## Thanks\\n\\n\\n\\nTypesafe enum bitfield support from Just Software Solutions.\\n\\n\\n\\n - See [https://www.justsoftwaresolutions.co.uk/cplusplus/using-enum-classes-as-bitfields.html](https://www.justsoftwaresolutions.co.uk/cplusplus/using-enum-classes-as-bitfields.html)\\n\\n\\n\\n## License\\n\\n\\n\\n```\\n\\nBoost Software License - Version 1.0 - August 17th, 2003\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person or organization\\n\\nobtaining a copy of the software and accompanying documentation covered by\\n\\nthis license (the \\\"Software\\\") to use, reproduce, display, distribute,\\n\\nexecute, and transmit the Software, and to prepare derivative works of the\\n\\nSoftware, and to permit third-parties to whom the Software is furnished to\\n\\ndo so, all subject to the following:\\n\\n\\n\\nThe copyright notices in the Software and this entire statement, including\\n\\nthe above license grant, this restriction and the following disclaimer,\\n\\nmust be included in all copies of the Software, in whole or in part, and\\n\\nall derivative works of the Software, unless such copies or derivative\\n\\nworks are solely in the form of machine-executable object code generated by\\n\\na source language processor.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\\n\\nSHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\\n\\nFOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\\n\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\\n\\nDEALINGS IN THE SOFTWARE.\\n\\n```\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 21,\n \"score\": 8106.408531226635\n },\n {\n \"content\": \"\\t\\t\\t\\t\\t \\\"a0478799-a6dd-4637-a8aa-87f6eb014317\\\",\\n\\n\\t\\t\\t\\t\\t \\\"Binary data didn't match the string data?\\\");\\n\\n\\n\\n\\tconst auto roundTrip = raw.data();\\n\\n\\tDSF_ASSERT_EQUAL(rawData, roundTrip, \\\"Return trip raw data convert failed\\\")\\n\\n\\n\\n\\tlibuuidpp::uuid valString(\\\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B}\\\");\\n\\n\\tlibuuidpp::uuid::binary valueExpected {\\n\\n\\t\\t0xc0, 0x6c, 0x89, 0x2b, 0x50, 0xab, 0x45, 0x85, 0x98, 0x19, 0x5f, 0x4b, 0xa3, 0xb8, 0xf6, 0x9b\\n\\n\\t};\\n\\n\\tconst auto valBinary = valString.data();\\n\\n\\tDSF_ASSERT_EQUAL(valBinary,\\n\\n\\t\\t\\t\\t\\t valueExpected,\\n\\n\\t\\t\\t\\t\\t \\\"Return trip raw data convert failed\\\")\\n\\n}\\n\\n\\n\\nvoid testHashing() {\\n\\n\\tstd::cout << \\\"Running test: testHashing\\\" << std::endl;\\n\\n\\n\\n\\tconst auto s1 = libuuidpp::uuid::random();\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 22,\n \"score\": 20.187058242087666\n },\n {\n \"content\": \"\\tgroup.insert(\\\"{c06c892b-50ab-4585-9819-5f4ba3b8f69b}\\\");\\n\\n\\tDSF_ASSERT_EQUAL(1, group.size(), \\\"Supposedly unique items are not unique\\\");\\n\\n\\n\\n\\t// Add 100000 guids, any duplicates will have been removed so check for exact count\\n\\n\\tgroup.clear();\\n\\n\\tconst size_t count = 100000;\\n\\n\\tfor (size_t i = 0; i < count; i++) {\\n\\n\\t\\tgroup.insert(libuuidpp::uuid::random());\\n\\n\\t}\\n\\n\\tDSF_ASSERT_EQUAL(count, group.size(), \\\"Generated some non-unique uuids\\\");\\n\\n}\\n\\n\\n\\nvoid testBinary() {\\n\\n\\tstd::cout << \\\"Running test: testBinary\\\" << std::endl;\\n\\n\\n\\n\\tlibuuidpp::uuid::binary rawData {\\n\\n\\t\\t0xa0, 0x47, 0x87, 0x99, 0xa6, 0xdd, 0x46, 0x37, 0xa8, 0xaa, 0x87, 0xf6, 0xeb, 0x01, 0x43, 0x17\\n\\n\\t};\\n\\n\\tlibuuidpp::uuid raw(rawData);\\n\\n\\tDSF_ASSERT_EQUAL(raw.string(libuuidpp::uuid::formatting::lowercase),\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 23,\n \"score\": 17.595797857177846\n },\n {\n \"content\": \"\\n\\n\\tunorderedSet.clear();\\n\\n\\n\\n\\t// Create 'count' random guids\\n\\n\\tfor (size_t i = 0; i < count; i++) {\\n\\n\\t\\tunorderedSet.insert(libuuidpp::uuid::random());\\n\\n\\t}\\n\\n\\n\\n\\tstd::set<std::size_t> hashes;\\n\\n\\tstd::for_each(unorderedSet.begin(), unorderedSet.end(), [&hashes](const libuuidpp::uuid& element) {\\n\\n\\t\\thashes.insert(element.hash());\\n\\n\\t});\\n\\n\\n\\n\\t// All of the hashes should be unique. Hashes uses a set, so duplicates will be removed\\n\\n\\tDSF_ASSERT_EQUAL(count, hashes.size(), \\\"Found duplicates\\\");\\n\\n}\\n\\n\\n\\nvoid testInvalid() {\\n\\n\\tstd::cout << \\\"Running test: testInvalid\\\" << std::endl;\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 24,\n \"score\": 17.258024126353767\n },\n {\n \"content\": \"\\t} catch (libuuidpp::exception::invalid_uuid e) {\\n\\n\\t\\tstd::cout << \\\"Caught exception during creation of valid uuid\\\" << std::endl;\\n\\n\\t\\tDSF_ASSERT(false);\\n\\n\\t}\\n\\n\\n\\n\\tauto tempStr = temp2->string();\\n\\n\\tDSF_ASSERT(tempStr == \\\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\\\");\\n\\n#endif\\n\\n\\n\\n\\tauto c1 = libuuidpp::uuid::random();\\n\\n\\tlibuuidpp::uuid c2 = c1;\\n\\n\\tDSF_ASSERT(c1 == c2); // \\\"Random guids are the same!\\\"\\n\\n\\n\\n\\tauto s1 = c1.string();\\n\\n\\tlibuuidpp::uuid c3(s1.c_str());\\n\\n\\tDSF_ASSERT(c1 == c3);\\n\\n\\n\\n\\tDSF_ASSERT(c1.is_nil() == false);\\n\\n\\n\\n\\tconst auto& nil = libuuidpp::uuid::nil;\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 25,\n \"score\": 17.200150874743635\n },\n {\n \"content\": \"\\tconst auto s2 = libuuidpp::uuid::random();\\n\\n\\tconst auto& nil = libuuidpp::uuid::nil;\\n\\n\\tconst libuuidpp::uuid nilc;\\n\\n\\n\\n\\tDSF_ASSERT_EQUAL(nil.hash(), nil.hash(), \\\"Null hash values should be equal\\\");\\n\\n\\tDSF_ASSERT_EQUAL(nilc.hash(), nilc.hash(), \\\"Null hash values should be equal\\\");\\n\\n\\tDSF_ASSERT_EQUAL(nil.hash(), nilc.hash(), \\\"Null hash values should be equal\\\");\\n\\n\\tDSF_ASSERT_EQUAL(s1.hash(), s1.hash(), \\\"Same uuid generated different hashes\\\");\\n\\n\\tDSF_ASSERT_NOTEQUAL(s1.hash(), s2.hash(), \\\"Hash values should be different\\\");\\n\\n\\tDSF_ASSERT_NOTEQUAL(s1.hash(), nil.hash(), \\\"Hash values should be different\\\");\\n\\n\\n\\n\\tstd::unordered_set<libuuidpp::uuid> unorderedSet { s1, s2, s2, nil, nil };\\n\\n\\tDSF_ASSERT_EQUAL(3, unorderedSet.size(), \\\"Expecting 3 elements\\\");\\n\\n\\n\\n\\tunorderedSet.clear();\\n\\n\\tconst size_t count = 100000;\\n\\n\\tfor (size_t i = 0; i < count; i++) {\\n\\n\\t\\tunorderedSet.insert(libuuidpp::uuid::random());\\n\\n\\t}\\n\\n\\tDSF_ASSERT_EQUAL(count, unorderedSet.size(), \\\"Mismatch in unordered_set size - unexpected hashing clash\\\");\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 26,\n \"score\": 16.651881493802126\n },\n {\n \"content\": \"\\tDSF_ASSERT(libuuidpp::uuid::nil.is_nil());\\n\\n\\n\\n\\tconst auto& nilUUID = libuuidpp::uuid::nil;\\n\\n\\tDSF_ASSERT(nilUUID.is_nil());\\n\\n\\n\\n\\t// Check that the static nil object is created only once (addresses should be the same)\\n\\n\\tDSF_ASSERT_EQUAL(&libuuidpp::uuid::nil, &libuuidpp::uuid::nil, \\\"static nils have different addresses?\\\");\\n\\n\\n\\n\\tconst libuuidpp::uuid nilc;\\n\\n\\tDSF_ASSERT_NOTEQUAL(&libuuidpp::uuid::nil, &nilc, \\\"static nil and dynamically created nil have the same address?\\\");\\n\\n\\n\\n\\t// Random guid creation\\n\\n\\n\\n\\tlibuuidpp::uuid c1 = libuuidpp::uuid::random();\\n\\n\\tlibuuidpp::uuid c2 = libuuidpp::uuid::random();\\n\\n\\n\\n\\tDSF_ASSERT_NOTEQUAL(c1, c2, \\\"Random guids are the same!\\\");\\n\\n\\n\\n\\t// nil guid creation\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 27,\n \"score\": 15.835971052739414\n },\n {\n \"content\": \"\\n\\n}\\n\\n\\n\\nvoid testAssign() {\\n\\n\\n\\n\\tstd::cout << \\\"Running test: testAssign\\\" << std::endl;\\n\\n\\n\\n#if defined(UUID_OPTIONAL_SUPPORT)\\n\\n\\tstd::optional<libuuidpp::uuid> temp1;\\n\\n\\ttry {\\n\\n\\t\\ttemp1 = std::make_optional(libuuidpp::uuid(\\\"This should fail\\\"));\\n\\n\\t\\tstd::cerr << \\\"Didn't catch exception during creation\\\" << std::endl;\\n\\n\\t\\tDSF_ASSERT(false);\\n\\n\\t} catch (libuuidpp::exception::invalid_uuid e) {\\n\\n\\t\\tstd::cout << \\\"Successfully caught exception during creation\\\" << std::endl;\\n\\n\\t}\\n\\n\\n\\n\\tstd::optional<libuuidpp::uuid> temp2;\\n\\n\\ttry {\\n\\n\\t\\ttemp2 = std::make_optional(libuuidpp::uuid(\\\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\\\"));\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 28,\n \"score\": 15.349019633508618\n },\n {\n \"content\": \"\\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(NULL), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n}\\n\\n\\n\\nvoid testMap() {\\n\\n\\tstd::cout << \\\"Running test: testMap\\\" << std::endl;\\n\\n\\n\\n\\t/// Adding to a map as the key\\n\\n\\tstd::map<libuuidpp::uuid, std::string> values;\\n\\n\\tlibuuidpp::uuid g1(\\\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\\\");\\n\\n\\tlibuuidpp::uuid g11(\\\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B}\\\");\\n\\n\\tlibuuidpp::uuid g2(\\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\");\\n\\n\\tlibuuidpp::uuid g3(\\\"F211F534-8DFB-4269-9AF1-245FA0AB8D87\\\");\\n\\n\\tvalues[g1] = \\\"this is a uuid\\\";\\n\\n\\tvalues[g2] = \\\"this is another uuid\\\";\\n\\n\\n\\n\\tDSF_ASSERT(values[g1] == \\\"this is a uuid\\\");\\n\\n\\tDSF_ASSERT(values[g11] == \\\"this is a uuid\\\");\\n\\n\\tDSF_ASSERT(values[g2] == \\\"this is another uuid\\\");\\n\\n\\n\\n\\t/// As g3 doesn't exist in the map, the [] operator adds g3 with a default std::string value\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 29,\n \"score\": 12.906230520969597\n },\n {\n \"content\": \"\\tDSF_ASSERT(nil.is_nil());\\n\\n\\tDSF_ASSERT(nil != c1);\\n\\n\\n\\n\\tc1.set_nil();\\n\\n\\tDSF_ASSERT(c1.is_nil());\\n\\n\\n\\n\\tc1.set_random();\\n\\n\\tDSF_ASSERT(c1 != c3);\\n\\n\\n\\n\\tstd::string stdguid = \\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\";\\n\\n\\tauto stdguid1 = libuuidpp::uuid(stdguid.c_str());\\n\\n\\tauto sg2 = stdguid1.string();\\n\\n\\tDSF_ASSERT(stdguid == sg2);\\n\\n}\\n\\n\\n\\nvoid testMSGuid() {\\n\\n\\n\\n\\tstd::cout << \\\"Running test: testMSGuid\\\" << std::endl;\\n\\n\\n\\n\\tstd::string msGuid = \\\"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\\\";\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 30,\n \"score\": 12.780071419048403\n },\n {\n \"content\": \"\\n\\n\\tstd::set<libuuidpp::uuid> uuids = { g3, g11, g2, g1 };\\n\\n\\n\\n\\t// g1 and g11 are the same uuid (even though they have different strings during creation)\\n\\n\\tDSF_ASSERT(uuids.size() == 3);\\n\\n\\n\\n\\tstd::vector<std::string> uuidStrings;\\n\\n\\tstd::transform(uuids.begin(), uuids.end(),\\n\\n\\t\\t\\t\\t std::back_inserter(uuidStrings),\\n\\n\\t\\t\\t\\t [](const libuuidpp::uuid& uuid) -> std::string\\n\\n\\t\\t\\t\\t {\\n\\n\\t\\t\\t\\t\\t return uuid.string(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\\n\\n\\t\\t\\t\\t });\\n\\n\\n\\n\\tstd::vector<std::string> expected = {\\n\\n\\t\\t\\\"{c06c892b-50ab-4585-9819-5f4ba3b8f69b}\\\",\\n\\n\\t\\t\\\"{d1abe846-63d3-4c0a-89ef-68f1a306f6d3}\\\",\\n\\n\\t\\t\\\"{f211f534-8dfb-4269-9af1-245fa0ab8d87}\\\" };\\n\\n\\n\\n\\tDSF_ASSERT(uuidStrings == expected);\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 31,\n \"score\": 12.390816970146737\n },\n {\n \"content\": \"\\tlibuuidpp::uuid test1;\\n\\n\\n\\n\\t// Make sure that we can successfully parse a goodun\\n\\n\\tDSF_ASSERT(test1.set(\\\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\\\") == true);\\n\\n\\tDSF_ASSERT_FALSE(test1.is_nil(), \\\"Correct uuid string should not be nil\\\");\\n\\n\\n\\n\\t// Length and bracket checks\\n\\n\\n\\n\\t// Check that invalid set automatically sets the value to nil\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"C56A4180-65AA-42EC-A945-5FD21DEC\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT(test1.is_nil());\\n\\n\\n\\n\\t// Static validation methods\\n\\n\\tDSF_ASSERT(libuuidpp::uuid::is_valid(\\\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\\\"));\\n\\n\\tDSF_ASSERT(libuuidpp::uuid::is_valid(\\\"{e8e3db08-dc39-48ea-a3db-08dc3958eafb}\\\"));\\n\\n\\tDSF_ASSERT(libuuidpp::uuid::is_valid(\\\"{29C49537-2BD1-4DA1-887A-5D0B93514BAD}\\\"));\\n\\n\\n\\n\\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(\\\"{29C49537-2xD1-4DA1-887A-5D0B93514BAD}\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(\\\" 33aff347-1028-4fb2-86c7-2cdf06ef3610}\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 32,\n \"score\": 11.913154997467636\n },\n {\n \"content\": \"\\tDSF_ASSERT(s6 == sGuidlb);\\n\\n}\\n\\n\\n\\nvoid testOrdering() {\\n\\n\\n\\n\\tstd::cout << \\\"Running test: testOrdering\\\" << std::endl;\\n\\n\\n\\n\\tstd::vector<libuuidpp::uuid> result1;\\n\\n\\tstd::vector<libuuidpp::uuid> result2;\\n\\n\\tfor (size_t c = 0; c < 10; c++) {\\n\\n\\t\\tresult1.push_back(libuuidpp::uuid::random());\\n\\n\\t}\\n\\n\\tfor (size_t c = 0; c < 10; c++) {\\n\\n\\t\\tresult2.push_back(libuuidpp::uuid::random());\\n\\n\\t}\\n\\n\\n\\n\\tDSF_ASSERT(result1 != result2);\\n\\n\\n\\n\\tauto result3 = result1;\\n\\n\\tDSF_ASSERT(result1 == result3);\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 33,\n \"score\": 11.713485155724209\n },\n {\n \"content\": \"\\tlibuuidpp::uuid n1, n2;\\n\\n\\tDSF_ASSERT_EQUAL(n1, n2, \\\"generated uuids are equal\\\");\\n\\n\\tDSF_ASSERT_NOTEQUAL(n1, c1, \\\"random and nil guids are equal?\\\");\\n\\n\\n\\n\\tuuid_t rawValue;\\n\\n\\t::uuid_generate(rawValue);\\n\\n\\tlibuuidpp::uuid c3(rawValue);\\n\\n\\n\\n\\t::uuid_string_t stringVal;\\n\\n\\t::uuid_unparse_upper(rawValue, stringVal);\\n\\n\\n\\n\\tauto rawString = std::string(stringVal);\\n\\n\\tDSF_ASSERT_EQUAL(rawString, c3.string(), \\\"generated string are not equal\\\");\\n\\n\\n\\n\\t// Generate some random guids - check for uniqueness (dumb test really)\\n\\n\\tstd::set<libuuidpp::uuid> group;\\n\\n\\n\\n\\t// Check that duplicated items are not stored in a set\\n\\n\\tgroup.insert(\\\"C06C892B-50AB-4585-9819-5F4BA3B8F69B\\\");\\n\\n\\tgroup.insert(\\\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B}\\\");\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 34,\n \"score\": 11.2806261017063\n },\n {\n \"content\": \"\\t// Correctly formatted uuid should contain - separators\\n\\n\\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(\\\"6D059566588D4BF081933253FAFD1426\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\n\\n\\t// Series of badly formatted\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\" C06C892B-50AB-4585-9819-5F4BA3B8F69B\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"{8078cbe9-2b91-4d82-9e8a-8d27ca5fcfa8\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"C06C892B-50AB-4585-9819-5F4BA3B8F69B}\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"{C06C892B-50AB-4585-9819-5F4BA3B8F69B} \\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"{C06C892B-50AB-4585-9819-5F4BA3B8F69BA}\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"C06C892B-50AB-4585-9819-5F4BA3B8F69BAA\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"{C06C892B-50AB-4585-9819-5F4BA3B8F69BA\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"{ C06C892B-50AB-4585-9819-5F4BA3B8F69B}\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\n\\n\\t// Invalid chars in the guid\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"{C06C892B-50AB-4585-9819-5F4&A3B8F69B}\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"C06C892B-50XB-4585-9819-5F4A3B8F69B\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\n\\n\\t// Invalid empty string\\n\\n\\tDSF_ASSERT_FALSE(test1.set(\\\"\\\"), \\\"Invalid uuid string should create nil uuid\\\");\\n\\n\\tDSF_ASSERT_FALSE(libuuidpp::uuid::is_valid(nullptr), \\\"Invalid uuid string should create nil uuid\\\");\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 35,\n \"score\": 11.199405554320144\n },\n {\n \"content\": \"\\tauto s5 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\\n\\n\\tDSF_ASSERT(sGuidl == s4);\\n\\n}\\n\\n\\n\\nvoid testUpperLower() {\\n\\n\\n\\n\\tstd::cout << \\\"Running test: testUpperLower\\\" << std::endl;\\n\\n\\n\\n\\tstd::string sGuid = \\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\";\\n\\n\\tstd::string sGuidl = \\\"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\\\";\\n\\n\\tstd::string sGuidlb = \\\"{d1abe846-63d3-4c0a-89ef-68f1a306f6d3}\\\";\\n\\n\\tstd::string sGuidub = \\\"{D1ABE846-63D3-4C0A-89EF-68F1A306F6D3}\\\";\\n\\n\\n\\n\\tstd::vector<libuuidpp::uuid> vals = { sGuid, sGuidl, sGuidlb, sGuidub };\\n\\n\\tstd::vector<std::string> expected(4, \\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\");\\n\\n\\n\\n\\t// Maps the vals vector to their string equivalents\\n\\n\\tstd::vector<std::string> uuidStrings;\\n\\n\\tstd::transform(vals.begin(), vals.end(),\\n\\n\\t\\t\\t\\t std::back_inserter(uuidStrings),\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 36,\n \"score\": 11.12132883943553\n },\n {\n \"content\": \"\\t\\t\\t\\t [](const libuuidpp::uuid& uuid) -> std::string\\n\\n\\t{\\n\\n\\t\\treturn uuid.string();\\n\\n\\t});\\n\\n\\tDSF_ASSERT(uuidStrings == expected);\\n\\n\\n\\n\\tauto sGuid2 = libuuidpp::uuid(sGuid);\\n\\n\\tauto sGuidl2 = libuuidpp::uuid(sGuidl);\\n\\n\\tDSF_ASSERT(sGuid2 == sGuidl2);\\n\\n\\n\\n\\tauto s3 = sGuid2.string();\\n\\n\\tDSF_ASSERT(sGuid == s3);\\n\\n\\n\\n\\tauto s4 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase);\\n\\n\\tDSF_ASSERT(sGuidl == s4);\\n\\n\\n\\n\\tauto s5 = sGuidl2.string();\\n\\n\\tDSF_ASSERT(s4 != s5);\\n\\n\\n\\n\\tauto s6 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase | libuuidpp::uuid::formatting::brackets);\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 37,\n \"score\": 10.61528568570835\n },\n {\n \"content\": \"\\tstd::string sGuid = \\\"D1ABE846-63D3-4C0A-89EF-68F1A306F6D3\\\";\\n\\n\\tstd::string sGuidl = \\\"d1abe846-63d3-4c0a-89ef-68f1a306f6d3\\\";\\n\\n\\n\\n\\tauto msGuid2 = libuuidpp::uuid(msGuid);\\n\\n\\tauto sGuid2 = libuuidpp::uuid(sGuid);\\n\\n\\tauto sGuidl2 = libuuidpp::uuid(sGuidl);\\n\\n\\tDSF_ASSERT(msGuid2 == sGuid2);\\n\\n\\n\\n\\t/// Check that a lowercase version matches\\n\\n\\tDSF_ASSERT(msGuid2 == sGuidl2);\\n\\n\\n\\n\\tauto s2 = msGuid2.string(libuuidpp::uuid::formatting::brackets);\\n\\n\\tDSF_ASSERT(msGuid == s2);\\n\\n\\n\\n\\tauto s3 = sGuid2.string();\\n\\n\\tDSF_ASSERT(sGuid == s3);\\n\\n\\n\\n\\tauto s4 = sGuidl2.string(libuuidpp::uuid::formatting::lowercase);\\n\\n\\tDSF_ASSERT(sGuidl == s4);\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 38,\n \"score\": 10.554300347093399\n },\n {\n \"content\": \"\\tDSF_ASSERT(values[g3] == \\\"\\\");\\n\\n\\n\\n\\t/// Adding to a map as the valuetype\\n\\n\\tstd::map<std::string, libuuidpp::uuid> mapper;\\n\\n\\tmapper[\\\"cat\\\"] = g1;\\n\\n\\tmapper[\\\"dog\\\"] = g2;\\n\\n\\n\\n\\tconst auto& m1 = mapper[\\\"cat\\\"];\\n\\n\\tconst auto& m2 = mapper[\\\"dog\\\"];\\n\\n\\tDSF_ASSERT(!m1.is_nil());\\n\\n\\tDSF_ASSERT(!m2.is_nil());\\n\\n\\n\\n\\t/// Asking for a key that doesn't exist returns a null guid.\\n\\n\\tauto ret = mapper.find(\\\"caterpillar\\\");\\n\\n\\tDSF_ASSERT(ret == mapper.end());\\n\\n\\n\\n\\tconst auto& m3 = mapper[\\\"caterpillar\\\"];\\n\\n\\tDSF_ASSERT(m3.is_nil());\\n\\n\\n\\n\\t// Set stuff\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 39,\n \"score\": 10.013529605626239\n },\n {\n \"content\": \"\\tresult4.push_back(result4[2]);\\n\\n\\tstd::sort(result4.begin(), result4.end());\\n\\n\\tduplicate = std::adjacent_find(result4.begin(), result4.end());\\n\\n\\tDSF_ASSERT(duplicate != result4.end());\\n\\n}\\n\\n\\n\\nint main(int argc, const char * argv[]) {\\n\\n\\t// insert code here...\\n\\n\\tstd::cout << \\\"Starting tests...\\\\n\\\";\\n\\n\\n\\n\\ttestSimple();\\n\\n\\ttestBinary();\\n\\n\\ttestInvalid();\\n\\n\\ttestMap();\\n\\n\\ttestHashing();\\n\\n\\ttestAssign();\\n\\n\\ttestOrdering();\\n\\n\\ttestMSGuid();\\n\\n\\ttestUpperLower();\\n\\n\\n\\n\\tstd::cout << \\\"... tests complete\\\\n\\\";\\n\\n\\n\\n\\treturn 0;\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 40,\n \"score\": 9.617017218230426\n },\n {\n \"content\": \"\\n\\n\\tstd::sort(result1.begin(), result1.end(), std::less<libuuidpp::uuid>());\\n\\n\\tDSF_ASSERT(result1 != result3);\\n\\n\\tstd::sort(result3.begin(), result3.end(), std::less<libuuidpp::uuid>());\\n\\n\\tDSF_ASSERT(result1 == result3);\\n\\n\\n\\n\\tauto find = std::find(result1.begin(), result1.end(), libuuidpp::uuid::nil);\\n\\n\\tDSF_ASSERT(find == result1.end());\\n\\n\\n\\n\\tauto duplicate = std::adjacent_find(result1.begin(), result1.end());\\n\\n\\tDSF_ASSERT(duplicate == result1.end());\\n\\n\\n\\n\\tstd::vector<libuuidpp::uuid> result4;\\n\\n\\tfor (size_t c = 0; c < 100; c++) {\\n\\n\\t\\tresult4.push_back(libuuidpp::uuid::random());\\n\\n\\t}\\n\\n\\tduplicate = std::adjacent_find(result4.begin(), result4.end());\\n\\n\\tstd::sort(result4.begin(), result4.end());\\n\\n\\tDSF_ASSERT(duplicate == result4.end());\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 41,\n \"score\": 9.549022478434756\n },\n {\n \"content\": \"// 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, TITLE AND NON-INFRINGEMENT. IN NO EVENT\\n\\n// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\\n\\n// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\\n\\n// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\\n\\n// DEALINGS IN THE SOFTWARE.\\n\\n//\\n\\n\\n\\n#include <iostream>\\n\\n#include <vector>\\n\\n#include <map>\\n\\n#include <set>\\n\\n#include <algorithm>\\n\\n#include <unordered_set>\\n\\n\\n\\n#if __cplusplus == 201703\\t\\t// C++17 std::optional support\\n\\n#define UUID_OPTIONAL_SUPPORT 1\\n\\n#include <optional>\\n\\n#endif\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 42,\n \"score\": 7.184216214452288\n },\n {\n \"content\": \"\\n\\n#include \\\"libuuidpp/libuuidpp.hpp\\\"\\n\\n\\n\\n/// Simple test harness\\n\\n\\n\\n#define DSF_ASSERT(ASSERTION) if (!(ASSERTION)) \\\\\\n\\n{ std::cerr << \\\"ASSERTION: Line \\\" << __LINE__ << \\\", file: \\\" << __FILE__ << \\\"\\\\n\\\"; abort(); }\\n\\n#define DSF_ASSERT_FALSE(ASSERTION, msg) if ((ASSERTION)) \\\\\\n\\n{ std::cerr << \\\"ASSERTION: Line \\\" << __LINE__ << \\\", file: \\\" << __FILE__ << \\\", message: '\\\" << msg << \\\"'\\\\n\\\"; abort(); }\\n\\n#define DSF_ASSERT_MSG(ASSERTION, msg) if (!(ASSERTION)) \\\\\\n\\n{ std::cerr << \\\"ASSERTION: Line \\\" << __LINE__ << \\\", file: \\\" << __FILE__ << \\\", message: '\\\" << msg << \\\"'\\\\n\\\"; abort(); }\\n\\n#define DSF_ASSERT_EQUAL(AVAL, BVAL, msg) if ((AVAL) != (BVAL)) \\\\\\n\\n{ std::cerr << \\\"ASSERTION: Line \\\" << __LINE__ << \\\", file: \\\" << __FILE__ << \\\", message: '\\\" << msg << \\\"'\\\\n\\\"; abort(); }\\n\\n#define DSF_ASSERT_NOTEQUAL(AVAL, BVAL, msg) if ((AVAL) == (BVAL)) \\\\\\n\\n{ std::cerr << \\\"ASSERTION: Line \\\" << __LINE__ << \\\", file: \\\" << __FILE__ << \\\", message: '\\\" << msg << \\\"'\\\\n\\\"; abort(); }\\n\\n\\n\\nvoid testSimple() {\\n\\n\\n\\n\\tstd::cout << \\\"Running test: testSimple\\\" << std::endl;\\n\\n\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 43,\n \"score\": 5.7462008134464675\n },\n {\n \"content\": \"//\\n\\n// main.cpp\\n\\n// libuuidpp tests\\n\\n//\\n\\n// Boost Software License - Version 1.0 - August 17th, 2003\\n\\n//\\n\\n// Permission is hereby granted, free of charge, to any person or organization\\n\\n// obtaining a copy of the software and accompanying documentation covered by\\n\\n// this license (the \\\"Software\\\") to use, reproduce, display, distribute,\\n\\n// execute, and transmit the Software, and to prepare derivative works of the\\n\\n// Software, and to permit third-parties to whom the Software is furnished to\\n\\n// do so, all subject to the following:\\n\\n//\\n\\n// The copyright notices in the Software and this entire statement, including\\n\\n// the above license grant, this restriction and the following disclaimer,\\n\\n// must be included in all copies of the Software, in whole or in part, and\\n\\n// all derivative works of the Software, unless such copies or derivative\\n\\n// works are solely in the form of machine-executable object code generated by\\n\\n// a source language processor.\\n\\n//\\n\",\n \"file_path\": \"main.cpp\",\n \"rank\": 44,\n \"score\": 3.08650261099255\n }\n]","isConversational":false}}},{"rowIdx":489,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Base/QTGUI/qSlicerExtensionsManagerDialog.cxx"},"repo_name":{"kind":"string","value":"TheInterventionCentre/NorMIT-Plan-App"},"commit":{"kind":"string","value":"765ed9a5dccc1cc134b65ccabe93fc132baeb2ea"},"file_code":{"kind":"string","value":"\n\n#include <QPushButton>\n\n#include \"qSlicerApplication.h\"\n#include \"qSlicerExtensionsManagerDialog.h\"\n#include \"qSlicerExtensionsManagerModel.h\"\n#include \"qSlicerSettingsExtensionsPanel.h\"\n#include \"ui_qSlicerExtensionsManagerDialog.h\"\n\nclass qSlicerExtensionsManagerDialogPrivate: public Ui_qSlicerExtensionsManagerDialog\n{\n Q_DECLARE_PUBLIC(qSlicerExtensionsManagerDialog);\nprotected:\n qSlicerExtensionsManagerDialog* const q_ptr;\n\npublic:\n qSlicerExtensionsManagerDialogPrivate(qSlicerExtensionsManagerDialog& object);\n void init();\n\n bool RestartRequested;\n\n QStringList PreviousModulesAdditionalPaths;\n QStringList PreviousExtensionsScheduledForUninstall;\n QVariantMap PreviousExtensionsScheduledForUpdate;\n};\n\nqSlicerExtensionsManagerDialogPrivate::qSlicerExtensionsManagerDialogPrivate(qSlicerExtensionsManagerDialog& object)\n :q_ptr(&object)\n{\n}\n\nvoid qSlicerExtensionsManagerDialogPrivate::init()\n{\n Q_Q(qSlicerExtensionsManagerDialog);\n\n this->setupUi(q);\n\n QPushButton * restartButton = this->ButtonBox->button(QDialogButtonBox::Ok);\n restartButton->setText(\"Restart\");\n\n q->setRestartRequested(false);\n\n \n \n \n \n QSettings * settings = qSlicerCoreApplication::application()->revisionUserSettings();\n this->PreviousModulesAdditionalPaths = settings->value(\"Modules/AdditionalPaths\").toStringList();\n this->PreviousExtensionsScheduledForUninstall = settings->value(\"Extensions/ScheduledForUninstall\").toStringList();\n this->PreviousExtensionsScheduledForUpdate = settings->value(\"Extensions/ScheduledForUpdate\").toMap();\n\n qSlicerSettingsExtensionsPanel * extensionsPanel =\n qobject_cast<qSlicerSettingsExtensionsPanel*>(\n qSlicerApplication::application()->settingsDialog()->panel(\"Extensions\"));\n Q_ASSERT(extensionsPanel);\n if (extensionsPanel)\n {\n QObject::connect(extensionsPanel, SIGNAL(extensionsServerUrlChanged(QString)),\n this->ExtensionsManagerWidget, SLOT(refreshInstallWidget()));\n }\n}\n\nqSlicerExtensionsManagerDialog::qSlicerExtensionsManagerDialog(QWidget *_parent)\n : Superclass(_parent)\n , d_ptr(new qSlicerExtensionsManagerDialogPrivate(*this))\n{\n Q_D(qSlicerExtensionsManagerDialog);\n d->init();\n}\n\nqSlicerExtensionsManagerDialog::~qSlicerExtensionsManagerDialog()\n{\n}\n\nqSlicerExtensionsManagerModel* qSlicerExtensionsManagerDialog::extensionsManagerModel()const\n{\n Q_D(const qSlicerExtensionsManagerDialog);\n return d->ExtensionsManagerWidget->extensionsManagerModel();\n}\n\nvoid qSlicerExtensionsManagerDialog::setExtensionsManagerModel(qSlicerExtensionsManagerModel* model)\n{\n Q_D(qSlicerExtensionsManagerDialog);\n\n if (this->extensionsManagerModel() == model)\n {\n return;\n }\n\n disconnect(this, SLOT(onModelUpdated()));\n\n d->ExtensionsManagerWidget->setExtensionsManagerModel(model);\n\n if (model)\n {\n this->onModelUpdated();\n connect(model, SIGNAL(modelUpdated()),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionInstalled(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionScheduledForUninstall(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionCancelledScheduleForUninstall(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionScheduledForUpdate(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionCancelledScheduleForUpdate(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionEnabledChanged(QString,bool)),\n this, SLOT(onModelUpdated()));\n }\n}\n\nbool qSlicerExtensionsManagerDialog::restartRequested()const\n{\n Q_D(const qSlicerExtensionsManagerDialog);\n return d->RestartRequested;\n}\n\nvoid qSlicerExtensionsManagerDialog::setRestartRequested(bool value)\n{\n Q_D(qSlicerExtensionsManagerDialog);\n d->RestartRequested = value;\n d->RestartRequestedLabel->setVisible(value);\n d->ButtonBox->button(QDialogButtonBox::Ok)->setEnabled(value);\n}\n\nvoid qSlicerExtensionsManagerDialog::onModelUpdated()\n{\n Q_D(qSlicerExtensionsManagerDialog);\n Q_ASSERT(this->extensionsManagerModel());\n bool shouldRestart = false;\n qSlicerCoreApplication * coreApp = qSlicerCoreApplication::application();\n if (d->PreviousModulesAdditionalPaths\n != coreApp->revisionUserSettings()->value(\"Modules/AdditionalPaths\").toStringList() ||\n d->PreviousExtensionsScheduledForUninstall\n != coreApp->revisionUserSettings()->value(\"Extensions/ScheduledForUninstall\").toStringList() ||\n d->PreviousExtensionsScheduledForUpdate\n != coreApp->revisionUserSettings()->value(\"Extensions/ScheduledForUpdate\").toMap())\n {\n shouldRestart = true;\n }\n this->setRestartRequested(shouldRestart);\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <QPushButton>\n\n#include \"qSlicerApplication.h\"\n#include \"qSlicerExtensionsManagerDialog.h\"\n#include \"qSlicerExtensionsManagerModel.h\"\n#include \"qSlicerSettingsExtensionsPanel.h\"\n#include \"ui_qSlicerExtensionsManagerDialog.h\"\n\nclass qSlicerExtensionsManagerDialogPrivate: public Ui_qSlicerExtensionsManagerDialog\n{\n Q_DECLARE_PUBLIC(qSlicerExtensionsManagerDialog);\nprotected:\n qSlicerExtensionsManagerDialog* const q_ptr;\n\npublic:\n qSlicerExtensionsManagerDialogPrivate(qSlicerExtensionsManagerDialog& object);\n void init();\n\n bool RestartRequested;\n\n QStringList PreviousModulesAdditionalPaths;\n QStringList PreviousExtensionsScheduledForUninstall;\n QVariantMap PreviousExtensionsScheduledForUpdate;\n};\n\nqSlicerExtensionsManagerDialogPrivate::qSlicerExtensionsManagerDialogPrivate(qSlicerExtensionsManagerDialog& object)\n :q_ptr(&object)\n{\n}\n\nvoid qSlicerExtensionsManagerDialogPrivate::init()\n{\n Q_Q(qSlicerExtensionsManagerDialog);\n\n this->setupUi(q);\n\n QPushButton * restartButton = this->ButtonBox->button(QDialogButtonBox::Ok);\n restartButton->setText(\"Restart\");\n\n q->setRestartRequested(false);\n\n \n \n \n \n QSettings * settings = qSlicerCoreApplication::application("},"suffix":{"kind":"string","value":"lication * coreApp = qSlicerCoreApplication::application();\n if (d->PreviousModulesAdditionalPaths\n != coreApp->revisionUserSettings()->value(\"Modules/AdditionalPaths\").toStringList() ||\n d->PreviousExtensionsScheduledForUninstall\n != coreApp->revisionUserSettings()->value(\"Extensions/ScheduledForUninstall\").toStringList() ||\n d->PreviousExtensionsScheduledForUpdate\n != coreApp->revisionUserSettings()->value(\"Extensions/ScheduledForUpdate\").toMap())\n {\n shouldRestart = true;\n }\n this->setRestartRequested(shouldRestart);\n}\n"},"middle":{"kind":"string","value":")->revisionUserSettings();\n this->PreviousModulesAdditionalPaths = settings->value(\"Modules/AdditionalPaths\").toStringList();\n this->PreviousExtensionsScheduledForUninstall = settings->value(\"Extensions/ScheduledForUninstall\").toStringList();\n this->PreviousExtensionsScheduledForUpdate = settings->value(\"Extensions/ScheduledForUpdate\").toMap();\n\n qSlicerSettingsExtensionsPanel * extensionsPanel =\n qobject_cast<qSlicerSettingsExtensionsPanel*>(\n qSlicerApplication::application()->settingsDialog()->panel(\"Extensions\"));\n Q_ASSERT(extensionsPanel);\n if (extensionsPanel)\n {\n QObject::connect(extensionsPanel, SIGNAL(extensionsServerUrlChanged(QString)),\n this->ExtensionsManagerWidget, SLOT(refreshInstallWidget()));\n }\n}\n\nqSlicerExtensionsManagerDialog::qSlicerExtensionsManagerDialog(QWidget *_parent)\n : Superclass(_parent)\n , d_ptr(new qSlicerExtensionsManagerDialogPrivate(*this))\n{\n Q_D(qSlicerExtensionsManagerDialog);\n d->init();\n}\n\nqSlicerExtensionsManagerDialog::~qSlicerExtensionsManagerDialog()\n{\n}\n\nqSlicerExtensionsManagerModel* qSlicerExtensionsManagerDialog::extensionsManagerModel()const\n{\n Q_D(const qSlicerExtensionsManagerDialog);\n return d->ExtensionsManagerWidget->extensionsManagerModel();\n}\n\nvoid qSlicerExtensionsManagerDialog::setExtensionsManagerModel(qSlicerExtensionsManagerModel* model)\n{\n Q_D(qSlicerExtensionsManagerDialog);\n\n if (this->extensionsManagerModel() == model)\n {\n return;\n }\n\n disconnect(this, SLOT(onModelUpdated()));\n\n d->ExtensionsManagerWidget->setExtensionsManagerModel(model);\n\n if (model)\n {\n this->onModelUpdated();\n connect(model, SIGNAL(modelUpdated()),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionInstalled(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionScheduledForUninstall(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionCancelledScheduleForUninstall(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionScheduledForUpdate(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionCancelledScheduleForUpdate(QString)),\n this, SLOT(onModelUpdated()));\n connect(model, SIGNAL(extensionEnabledChanged(QString,bool)),\n this, SLOT(onModelUpdated()));\n }\n}\n\nbool qSlicerExtensionsManagerDialog::restartRequested()const\n{\n Q_D(const qSlicerExtensionsManagerDialog);\n return d->RestartRequested;\n}\n\nvoid qSlicerExtensionsManagerDialog::setRestartRequested(bool value)\n{\n Q_D(qSlicerExtensionsManagerDialog);\n d->RestartRequested = value;\n d->RestartRequestedLabel->setVisible(value);\n d->ButtonBox->button(QDialogButtonBox::Ok)->setEnabled(value);\n}\n\nvoid qSlicerExtensionsManagerDialog::onModelUpdated()\n{\n Q_D(qSlicerExtensionsManagerDialog);\n Q_ASSERT(this->extensionsManagerModel());\n bool shouldRestart = false;\n qSlicerCoreApp"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"class DiffusionTensor3DTransform : public Object\n\n{\n\npublic:\n\n typedef TData DataType;\n\n typedef double TransformType;\n\n typedef DiffusionTensor3DTransform Self;\n\n typedef Point<TransformType, 3> PointType;\n\n typedef DiffusionTensor3D<DataType> TensorDataType;\n\n typedef DiffusionTensor3DExtended<DataType> InternalTensorDataType;\n\n typedef Matrix<TransformType, 3, 3> MatrixTransformType;\n\n typedef Matrix<DataType, 3, 3> MatrixDataType;\n\n typedef MatrixExtended<TransformType, 3, 3> InternalMatrixTransformType;\n\n typedef MatrixExtended<DataType, 3, 3> InternalMatrixDataType;\n\n typedef SmartPointer<Self> Pointer;\n\n typedef SmartPointer<const Self> ConstPointer;\n\n\n\n /** Run-time type information (and related methods). */\n\n itkTypeMacro(DiffusionTensor3DTransform, Object);\n\n\n\n // /Evaluate the position of the transformed tensor\n","file_path":"Modules/CLI/ResampleDTIVolume/itkDiffusionTensor3DTransform.h","rank":0,"score":261695.11366328096},{"content":"class NewOtsuThresholdImageCalculator : public Object\n\n{\n\npublic:\n\n /** Standard class typedefs. */\n\n typedef NewOtsuThresholdImageCalculator Self;\n\n typedef Object Superclass;\n\n typedef SmartPointer<Self> Pointer;\n\n typedef SmartPointer<const Self> ConstPointer;\n\n\n\n /** Method for creation through the object factory. */\n\n itkNewMacro(Self);\n\n\n\n /** Run-time type information (and related methods). */\n\n itkTypeMacro(NewOtsuThresholdImageCalculator, Object);\n\n\n\n /** Type definition for the input image. */\n\n typedef TInputImage ImageType;\n\n\n\n /** Pointer type for the image. */\n\n typedef typename TInputImage::Pointer ImagePointer;\n","file_path":"Libs/vtkITK/itkNewOtsuThresholdImageCalculator.h","rank":1,"score":261695.11366328096},{"content":"class DiffusionTensor3DWrite : public Object\n\n{\n\npublic:\n\n typedef TData DataType;\n\n typedef DiffusionTensor3DWrite Self;\n\n typedef DiffusionTensor3D<DataType> TensorDataType;\n\n typedef Image<TensorDataType, 3> DiffusionImageType;\n\n typedef MetaDataDictionary DictionaryType;\n\n typedef ImageFileWriter<DiffusionImageType> WriterType;\n\n typedef SmartPointer<Self> Pointer;\n\n typedef SmartPointer<const Self> ConstPointer;\n\n typedef std::vector<std::vector<double> > DoubleVectorType;\n\n typedef MetaDataObject<DoubleVectorType> MetaDataDoubleVectorType;\n\n typedef MetaDataObject<std::string> MetaDataIntType;\n\n\n\n /** Run-time type information (and related methods). */\n\n itkTypeMacro(DiffusionTensor3DWrite, Object);\n\n\n\n itkNewMacro( Self );\n\n // /Set input tensor image\n","file_path":"Modules/CLI/ResampleDTIVolume/itkDiffusionTensor3DWrite.h","rank":2,"score":261695.11366328096},{"content":"class ImageToImageRegistrationHelper : public Object\n\n{\n\n\n\npublic:\n\n\n\n typedef ImageToImageRegistrationHelper Self;\n\n typedef Object Superclass;\n\n typedef SmartPointer<Self> Pointer;\n\n typedef SmartPointer<const Self> ConstPointer;\n\n\n\n itkTypeMacro( ImageToImageRegistrationHelper, Object );\n\n\n\n itkNewMacro( Self );\n\n\n\n //\n\n // Custom Typedefs\n\n //\n\n typedef TImage ImageType;\n\n\n\n typedef typename TImage::PixelType PixelType;\n","file_path":"Modules/CLI/ExpertAutomatedRegistration/ITKRegistrationHelper/itkImageToImageRegistrationHelper.h","rank":3,"score":254102.0637583048},{"content":"class ImageRegionMomentsCalculator : public Object\n\n{\n\npublic:\n\n /** Standard class typedefs. */\n\n typedef ImageRegionMomentsCalculator<TImage> Self;\n\n typedef Object Superclass;\n\n typedef SmartPointer<Self> Pointer;\n\n typedef SmartPointer<const Self> ConstPointer;\n\n\n\n /** Method for creation through the object factory. */\n\n itkNewMacro(Self);\n\n\n\n /** Run-time type information (and related methods). */\n\n itkTypeMacro(ImageRegionMomentsCalculator, Object);\n\n\n\n /** Extract the dimension of the image. */\n\n itkStaticConstMacro(ImageDimension, unsigned int,\n\n TImage::ImageDimension);\n\n\n\n /** Standard scalar type within this class. */\n","file_path":"Modules/CLI/ExpertAutomatedRegistration/ITKRegistrationHelper/itkImageRegionMomentsCalculator.h","rank":4,"score":254102.0637583048},{"content":"class qMRMLNodeObject : public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n qMRMLNodeObject(vtkMRMLNode* node, QObject* parent = 0);\n\n\n\n void setProcessEvents(bool process);\n\n bool processEvents()const;\n\n\n\n void setMessage(const QString& message);\n\n QString message()const;\n\n\n\npublic slots:\n\n void modify();\n\n\n\nprotected:\n\n vtkMRMLNode* Node;\n\n bool ProcessEvents;\n\n QString Message;\n\n};\n","file_path":"Libs/MRML/Widgets/Testing/qMRMLNodeObject.h","rank":5,"score":250459.06919927883},{"content":"class ITK_ABI_EXPORT DiffusionTensor3DRead : public Object\n\n{\n\npublic:\n\n typedef TData DataType;\n\n typedef DiffusionTensor3DRead Self;\n\n typedef Matrix<double, 3, 3> MatrixType;\n\n typedef DiffusionTensor3D<DataType> TensorDataType;\n\n typedef Image<TensorDataType, 3> DiffusionImageType;\n\n typedef typename DiffusionImageType::Pointer DiffusionImagePointer;\n\n typedef ImageFileReader<DiffusionImageType> FileReaderType;\n\n typedef MetaDataDictionary DictionaryType;\n\n typedef MetaDataObject<std::string> MetaDataStringType;\n\n typedef std::vector<std::vector<double> > DoubleVectorType;\n\n typedef MetaDataObject<DoubleVectorType> MetaDataDoubleVectorType;\n\n typedef SmartPointer<Self> Pointer;\n\n typedef SmartPointer<const Self> ConstPointer;\n\n\n\n /** Run-time type information (and related methods). */\n\n itkTypeMacro(DiffusionTensor3DRead, Object);\n\n\n","file_path":"Modules/CLI/ResampleDTIVolume/itkDiffusionTensor3DRead.h","rank":6,"score":243622.60366305686},{"content":"class qMRMLNodeObject : public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n qMRMLNodeObject(vtkMRMLNode* node, QObject* parent = 0);\n\n\n\npublic slots:\n\n void modifyNode();\n\n};\n","file_path":"Libs/MRML/Widgets/Testing/qMRMLSliceWidgetTest1Helper.h","rank":7,"score":238079.21085132007},{"content":"//-----------------------------------------------------------------------------\n\nclass qMRMLTableViewPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLTableView);\n\nprotected:\n\n qMRMLTableView* const q_ptr;\n\npublic:\n\n qMRMLTableViewPrivate(qMRMLTableView& object);\n\n ~qMRMLTableViewPrivate();\n\n\n\n virtual void init();\n\n\n\n void setMRMLScene(vtkMRMLScene* scene);\n\n vtkMRMLScene *mrmlScene();\n\n\n\n bool verifyTableModelAndNode(const char* methodName) const;\n\n\n\npublic slots:\n\n /// Handle MRML scene event\n","file_path":"Libs/MRML/Widgets/qMRMLTableView_p.h","rank":8,"score":228989.2311868862},{"content":"//-----------------------------------------------------------------------------\n\nclass qMRMLSliceViewPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLSliceView);\n\nprotected:\n\n qMRMLSliceView* const q_ptr;\n\npublic:\n\n qMRMLSliceViewPrivate(qMRMLSliceView& object);\n\n ~qMRMLSliceViewPrivate();\n\n\n\n virtual void init();\n\n\n\n void setMRMLScene(vtkMRMLScene* scene);\n\n\n\npublic slots:\n\n /// Handle MRML scene event\n\n void onSceneStartProcessing();\n\n void onSceneEndProcessing();\n\n\n\n void updateWidgetFromMRML();\n\n\n\nprotected:\n\n void initDisplayableManagers();\n\n\n\n vtkMRMLDisplayableManagerGroup* DisplayableManagerGroup;\n\n vtkMRMLScene* MRMLScene;\n\n vtkMRMLSliceNode* MRMLSliceNode;\n\n QColor InactiveBoxColor;\n\n\n","file_path":"Libs/MRML/Widgets/qMRMLSliceView_p.h","rank":9,"score":228989.2311868862},{"content":"//-----------------------------------------------------------------------------\n\nclass qMRMLChartViewPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLChartView);\n\nprotected:\n\n qMRMLChartView* const q_ptr;\n\npublic:\n\n qMRMLChartViewPrivate(qMRMLChartView& object);\n\n ~qMRMLChartViewPrivate();\n\n\n\n virtual void init();\n\n\n\n void setMRMLScene(vtkMRMLScene* scene);\n\n vtkMRMLScene *mrmlScene();\n\n\n\npublic slots:\n\n /// Handle MRML scene event\n\n void startProcessing();\n\n void endProcessing();\n","file_path":"Libs/MRML/Widgets/qMRMLChartView_p.h","rank":10,"score":228989.2311868862},{"content":"// -----------------------------------------------------------------------------\n\nclass qMRMLVolumeWidgetPrivate : public QObject\n\n{\n\n Q_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLVolumeWidget);\n\nprotected:\n\n qMRMLVolumeWidget* const q_ptr;\n\n\n\npublic:\n\n qMRMLVolumeWidgetPrivate(qMRMLVolumeWidget& object);\n\n virtual ~qMRMLVolumeWidgetPrivate();\n\n\n\n virtual void init();\n\n\n\n /// Update the range and single step of the input GUI elements such as\n\n /// sliders and spinboxes.\n\n void updateRangeForVolumeDisplayNode(vtkMRMLScalarVolumeDisplayNode*);\n\n /// Block all the signals emitted by the widgets that are impacted by the\n\n /// range.\n\n /// To be reimplemented in subclasses\n\n virtual bool blockSignals(bool block);\n","file_path":"Libs/MRML/Widgets/qMRMLVolumeWidget_p.h","rank":11,"score":228989.2311868862},{"content":"//------------------------------------------------------------------------------\n\nclass qMRMLEventLoggerPrivate: public QObject\n\n{\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLEventLogger);\n\nprotected:\n\n qMRMLEventLogger* const q_ptr;\n\npublic:\n\n qMRMLEventLoggerPrivate(qMRMLEventLogger& object);\n\n typedef QObject Superclass;\n\n\n\n void init();\n\n\n\n void setMRMLScene(vtkMRMLScene* scene);\n\n\n\nprivate:\n\n vtkWeakPointer<vtkMRMLScene> MRMLScene;\n\n\n\n QList<QString> EventToListen;\n\n QHash<QString, QString> EventNameToConnectionIdMap;\n\n\n\n bool ConsoleOutputEnabled;\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/qMRMLEventLogger_p.h","rank":12,"score":228989.2311868862},{"content":"class qSlicerViewersToolBarPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qSlicerViewersToolBar);\n\n\n\nprotected:\n\n qSlicerViewersToolBar* const q_ptr;\n\n\n\npublic:\n\n qSlicerViewersToolBarPrivate(qSlicerViewersToolBar& object);\n\n\n\n void init();\n\n void setMRMLScene(vtkMRMLScene* newScene);\n\n void updateWidgetFromMRML();\n\n\n\npublic slots:\n\n\n\n void OnMRMLSceneStartClose();\n\n void OnMRMLSceneEndImport();\n","file_path":"Base/QTGUI/qSlicerViewersToolBar_p.h","rank":13,"score":226042.28118664637},{"content":"//-----------------------------------------------------------------------------\n\nclass qSlicerCLIModuleWidgetPrivate: public QObject,\n\n public Ui_qSlicerCLIModuleWidget\n\n{\n\n Q_OBJECT\n\n Q_DECLARE_PUBLIC(qSlicerCLIModuleWidget);\n\nprotected:\n\n qSlicerCLIModuleWidget* const q_ptr;\n\npublic:\n\n typedef qSlicerCLIModuleWidgetPrivate Self;\n\n qSlicerCLIModuleWidgetPrivate(qSlicerCLIModuleWidget& object);\n\n\n\n ///\n\n /// Convenient function to cast vtkSlicerLogic into vtkSlicerCLIModuleLogic\n\n vtkSlicerCLIModuleLogic* logic()const;\n\n\n\n ///\n\n /// Convenient function to cast vtkMRMLNode into vtkMRMLCommandLineModuleNode\n\n vtkMRMLCommandLineModuleNode* commandLineModuleNode()const;\n\n\n\n /// Convenient method to cast qSlicerAbstractModule into qSlicerCLIModule\n","file_path":"Base/QTCLI/qSlicerCLIModuleWidget_p.h","rank":14,"score":226042.28118664637},{"content":"//-----------------------------------------------------------------------------\n\nclass qMRMLSceneViewMenuPrivate : public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLSceneViewMenu);\n\nprotected:\n\n qMRMLSceneViewMenu* const q_ptr;\n\npublic:\n\n typedef QObject Superclass;\n\n qMRMLSceneViewMenuPrivate(qMRMLSceneViewMenu& object);\n\n\n\n /// \\brief Clear and update menu given the list of existing vtkMRMLSceneViewNode\n\n /// associated with the current scene\n\n void resetMenu();\n\n\n\npublic slots:\n\n\n\n void onMRMLNodeAdded(vtkObject* mrmlScene, vtkObject * mrmlNode);\n\n\n\n /// Add menu entry corresponding to \\a sceneViewNode\n","file_path":"Libs/MRML/Widgets/qMRMLSceneViewMenu_p.h","rank":15,"score":223208.94362983707},{"content":"//-----------------------------------------------------------------------------\n\nclass qMRMLExpandingWebViewPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLExpandingWebView);\n\nprotected:\n\n qMRMLExpandingWebView* const q_ptr;\n\npublic:\n\n qMRMLExpandingWebViewPrivate(qMRMLExpandingWebView& object);\n\n ~qMRMLExpandingWebViewPrivate();\n\n\n\n virtual void init();\n\n\n\n void setMRMLScene(vtkMRMLScene* scene);\n\n vtkMRMLScene *mrmlScene();\n\n\n\npublic slots:\n\n /// Handle MRML scene events\n\n void startProcessing();\n\n void endProcessing();\n\n\n\nprotected:\n\n\n\n vtkMRMLScene* MRMLScene;\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/qMRMLExpandingWebView_p.h","rank":16,"score":223208.94362983707},{"content":"//-----------------------------------------------------------------------------\n\nclass qMRMLThreeDViewPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLThreeDView);\n\nprotected:\n\n qMRMLThreeDView* const q_ptr;\n\npublic:\n\n qMRMLThreeDViewPrivate(qMRMLThreeDView& object);\n\n ~qMRMLThreeDViewPrivate();\n\n\n\n virtual void init();\n\n\n\n void setMRMLScene(vtkMRMLScene* scene);\n\n\n\n /// Loop over all CameraNode from the scene and return the one having\n\n /// its activeTag matching \\a viewNode ID\n\n// vtkMRMLCameraNode* lookUpMRMLCameraNode(vtkMRMLViewNode* viewNode);\n\n\n\npublic slots:\n","file_path":"Libs/MRML/Widgets/qMRMLThreeDView_p.h","rank":17,"score":223208.94362983707},{"content":"//-----------------------------------------------------------------------------\n\nclass qMRMLSliceInformationWidgetPrivate: public QObject,\n\n public Ui_qMRMLSliceInformationWidget\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLSliceInformationWidget);\n\nprotected:\n\n qMRMLSliceInformationWidget* const q_ptr;\n\npublic:\n\n qMRMLSliceInformationWidgetPrivate(qMRMLSliceInformationWidget& object);\n\n ~qMRMLSliceInformationWidgetPrivate();\n\n\n\n void setupUi(qMRMLWidget* widget);\n\n\n\npublic slots:\n\n /// Update widget state using the associated MRML slice node\n\n void updateWidgetFromMRMLSliceNode();\n\n\n\n\n\n\n\npublic:\n\n vtkMRMLSliceNode* MRMLSliceNode;\n\n QButtonGroup* SliceSpacingModeGroup;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/qMRMLSliceInformationWidget_p.h","rank":18,"score":223208.94362983707},{"content":"class Q_SLICER_BASE_QTGUI_EXPORT qSlicerWidget : public QWidget, public virtual qSlicerObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\npublic:\n\n qSlicerWidget(QWidget *parent=0, Qt::WindowFlags f=0);\n\n virtual ~qSlicerWidget();\n\n\n\npublic slots:\n\n virtual void setMRMLScene(vtkMRMLScene* scene);\n\n\n\nsignals:\n\n void mrmlSceneChanged(vtkMRMLScene*);\n\n\n\nprotected:\n\n QScopedPointer<qSlicerWidgetPrivate> d_ptr;\n\n\n\nprivate:\n\n Q_DECLARE_PRIVATE(qSlicerWidget);\n\n Q_DISABLE_COPY(qSlicerWidget);\n\n};\n\n\n\n#endif\n","file_path":"Base/QTGUI/qSlicerWidget.h","rank":19,"score":223074.94899856334},{"content":"/// \\brief Stores information about the relationship between a Subject and an Observer.\n\n///\n\n/// The Observation is a record of\n\n/// - a subject (vtkObject)\n\n/// - an event type (unsigned long)\n\n/// - an objserver (vtkObject)\n\n/// - a callback (vtkCallbackCommand)\n\n/// - optional comment strings\n\n/// This class can be used by the vtkEventBroker to keep track of the registered observers\n\n/// that it manages, and it can be used by the event queue to keep track of which\n\n/// events have been triggered so it can invoke them later\n\n//\n\n/// \\note This class does not add or remove observers itself; it just keeps track of them\n\n/// for the event broker.\n\nclass VTK_MRML_EXPORT vtkObservation : public vtkObject\n\n{\n\n public:\n\n\n\n /// The Usual vtk class functions\n\n static vtkObservation *New();\n\n vtkTypeMacro(vtkObservation,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n ///\n\n /// Accessors\n\n /// - note that AssignObject methods do not register the pointers\n\n /// - it is assumed that the EventBroker will attach DeleteEvent\n\n /// observers to these objects and will thereby know when they\n\n /// are no longer valid\n\n virtual void SetEventBroker(vtkEventBroker* eventBroker);\n\n vtkGetObjectMacro (EventBroker, vtkEventBroker);\n\n vtkGetMacro (InEventQueue, int);\n\n vtkSetMacro (InEventQueue, int);\n\n vtkGetObjectMacro (ObservationCallbackCommand, vtkCallbackCommand);\n","file_path":"Libs/MRML/Core/vtkObservation.h","rank":20,"score":222112.2346212237},{"content":"class QMRML_WIDGETS_EXPORT qMRMLUtils : public QObject\n\n{\n\n Q_OBJECT;\n\npublic:\n\n typedef qMRMLUtils Self;\n\n qMRMLUtils(QObject* parent = 0);\n\n virtual ~qMRMLUtils();\n\n\n\n ///\n\n /// Convert a vtkMatrix to a QVector\n\n Q_INVOKABLE static void vtkMatrixToQVector(vtkMatrix4x4* matrix, QVector<double> & vector);\n\n\n\n ///\n\n Q_INVOKABLE static void getTransformInCoordinateSystem(vtkMRMLNode* transformNode, bool global,\n\n vtkTransform* transform);\n\n Q_INVOKABLE static void getTransformInCoordinateSystem(vtkMRMLTransformNode* transformNode,\n\n bool global, vtkTransform* transform);\n\n\n\n /// Retrieve the number of visible view node associated with \\a scene\n\n Q_INVOKABLE static int countVisibleViewNode(vtkMRMLScene* scene);\n","file_path":"Libs/MRML/Widgets/qMRMLUtils.h","rank":21,"score":222100.75030607326},{"content":"class qSlicerMouseModeToolBarPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n QVTK_OBJECT\n\n Q_DECLARE_PUBLIC(qSlicerMouseModeToolBar);\n\n\n\nprotected:\n\n qSlicerMouseModeToolBar* const q_ptr;\n\n\n\npublic:\n\n qSlicerMouseModeToolBarPrivate(qSlicerMouseModeToolBar& object);\n\n\n\n void init();\n\n void setMRMLScene(vtkMRMLScene* newScene);\n\n void updateWidgetFromMRML();\n\n /// given an place node class name, find the action associated with it and set it\n\n /// checked, update the cursor, update the icon on the button\n\n void updateWidgetToPlace(const char *placeNodeClassName);\n\n\n\npublic slots:\n","file_path":"Base/QTGUI/qSlicerMouseModeToolBar_p.h","rank":22,"score":220482.77269345452},{"content":"class qSlicerBaseQTGUIPythonQtDecorators : public QObject\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n\n\n qSlicerBaseQTGUIPythonQtDecorators()\n\n {\n\n PythonQt::self()->registerClass(&qSlicerAbstractModuleWidget::staticMetaObject);\n\n PythonQt::self()->registerClass(&qSlicerPythonManager::staticMetaObject);\n\n PythonQt::self()->registerClass(&qSlicerCommandOptions::staticMetaObject);\n\n#ifdef Slicer_USE_QtTesting\n\n PythonQt::self()->registerClass(&ctkQtTestingUtility::staticMetaObject);\n\n#endif\n\n PythonQt::self()->registerClass(&ctkErrorLogModel::staticMetaObject);\n\n PythonQt::self()->registerClass(&ctkErrorLogTerminalOutput::staticMetaObject);\n\n // Note: Use registerCPPClassForPythonQt to register pure Cpp classes\n\n }\n\n\n\npublic slots:\n","file_path":"Base/QTGUI/qSlicerBaseQTGUIPythonQtDecorators.h","rank":23,"score":217857.80111078295},{"content":"/// \\brief Class that manages adding and deleting of observers with events.\n\n///\n\n/// Class that manages adding and deleting of obserevers with events\n\n/// This class keeps track of obserevers and events added to each vtk object.\n\n/// It caches tags returned by AddObserver method so that observers can be removed properly.\n\nclass VTK_MRML_EXPORT vtkMRMLLogic : public vtkObject\n\n{\n\npublic:\n\n /// The Usual vtk class functions\n\n static vtkMRMLLogic *New();\n\n vtkTypeMacro(vtkMRMLLogic,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent){ this->Superclass::PrintSelf(os, indent); }\n\n\n\n vtkMRMLScene* GetScene() {return this->Scene;};\n\n void SetScene(vtkMRMLScene* scene) {this->Scene = scene;};\n\n\n\n void RemoveUnreferencedStorageNodes();\n\n\n\n void RemoveUnreferencedDisplayNodes();\n\n\n\n /// Get application home directory.\n\n /// The path is retrieved from the environment variable defined by MRML_APPLICATION_HOME_DIR_ENV.\n\n static std::string GetApplicationHomeDirectory();\n\n\n\n /// Get application share subdirectory.\n","file_path":"Libs/MRML/Core/vtkMRMLLogic.h","rank":24,"score":216332.56924320714},{"content":"/// \\brief Manages adding and deleting of obserevers with events.\n\n///\n\n/// Class that manages adding and deleting of obserevers with events\n\n/// This class keeps track of obserevers and events added to each vtk object\n\n/// it caches tags returned by AddObserver method so that obserevers can be removed properly.\n\nclass VTK_MRML_EXPORT vtkObserverManager : public vtkObject\n\n{\n\n public:\n\n\n\n /// The Usual vtk class functions\n\n static vtkObserverManager *New();\n\n vtkTypeMacro(vtkObserverManager,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// set vtkObject to a specified pointer and remove all observers for all events\n\n void SetObject(vtkObject **nodePtr, vtkObject *node);\n\n\n\n /// set vtkObject to a specified pointer, remove all observers for all events, add observer for Modify event\n\n void SetAndObserveObject(vtkObject **nodePtr, vtkObject *node, float priority=0.0, bool logWarningIfSameObservationExists=true);\n\n\n\n /// set vtkObject to a specified pointer, remove all observers for all events, add observers for specified events\n\n void SetAndObserveObjectEvents(vtkObject **nodePtr, vtkObject *node, vtkIntArray *events, vtkFloatArray *priorities=0, bool logWarningIfSameObservationExists=true);\n\n\n\n /// remove all observers for all events\n\n void RemoveObjectEvents(vtkObject *nodePtr);\n","file_path":"Libs/MRML/Core/vtkObserverManager.h","rank":25,"score":216332.0530152082},{"content":"/// \\ingroup SegmentationCore\n\n/// \\brief This class encapsulates a segment that is part of a segmentation\n\n/// \\details\n\n/// A \\sa vtkSegmentation can contain multiple segments (this class) each of which represent\n\n/// one anatomical or other structure (in labelmap terms, a \"label\"). Each segmentation can\n\n/// contain the structure in multiple representations.\n\n/// Default representation types include Binary labelmap and Closed surface, but additional\n\n/// custom representations can be added (see description of \\sa vtkSegmentation).\n\n/// \n\nclass vtkSegmentationCore_EXPORT vtkSegment : public vtkObject\n\n{\n\n typedef std::map<std::string, vtkSmartPointer<vtkDataObject> > RepresentationMap;\n\n\n\npublic:\n\n static const double SEGMENT_COLOR_VALUE_INVALID[4];\n\n\n\n static vtkSegment* New();\n\n vtkTypeMacro(vtkSegment, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// Set attributes from name/value pairs\n\n virtual void ReadXMLAttributes(const char** atts);\n\n\n\n /// Write this object's information to a MRML file in XML format.\n\n void WriteXML(ostream& of, int nIndent);\n\n\n\n /// Deep copy one segment into another\n\n virtual void DeepCopy(vtkSegment* source);\n\n\n","file_path":"Libs/vtkSegmentationCore/vtkSegment.h","rank":26,"score":216330.8729272122},{"content":"/// \\brief A set of MRML Nodes that supports serialization and undo/redo.\n\n///\n\n/// vtkMRMLScene represents and provides methods to manipulate a list of\n\n/// MRML objects. The list is core and duplicate entries are not prevented.\n\n//\n\n/// \\sa vtkMRMLNode\n\n/// \\sa vtkCollection\n\nclass VTK_MRML_EXPORT vtkMRMLScene : public vtkObject\n\n{\n\n ///\n\n /// make the vtkMRMLSceneViewNode a friend since it has internal vtkMRMLScene\n\n /// so that it can call protected methods, for example UpdateNodeIDs()\n\n /// but that's the only class that is allowed to do so\n\n friend class vtkMRMLSceneViewNode;\n\n\n\npublic:\n\n static vtkMRMLScene *New();\n\n vtkTypeMacro(vtkMRMLScene, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// Set URL (file name) of the scene\n\n void SetURL(const char *url);\n\n\n\n /// Get URL (file name) of the scene\n\n const char *GetURL();\n\n\n\n /// Set Root directory, where URL is pointing\n","file_path":"Libs/MRML/Core/vtkMRMLScene.h","rank":27,"score":216330.63196961692},{"content":"/// \\brief Class that manages adding and deleting of observers with events.\n\n///\n\n/// This class keeps track of observers and events added to each vtk object.\n\n/// It caches tags returned by AddObserver method so that observers can be\n\n/// removed properly.\n\n/// See also:\n\n/// http://wiki.na-mic.org/Wiki/index.php/Slicer3:EventBroker\n\n/// http://en.wikipedia.org/wiki/Observer_pattern\n\n//\n\n/// Other interesting observer implementations:\n\n/// http://xlobject.sourceforge\n\n/// http://sigslot.sourceforge.net/\n\n/// http://doc.trolltech.com/4.3/signalsandslots.html\n\nclass VTK_MRML_EXPORT vtkEventBroker : public vtkObject\n\n{\n\npublic:\n\n vtkTypeMacro(vtkEventBroker, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n typedef std::set< vtkObservation * > ObservationVector;\n\n\n\n ///\n\n /// Return the singleton instance with no reference counting.\n\n static vtkEventBroker* GetInstance();\n\n\n\n ///\n\n /// This is a singleton pattern New. There will only be ONE\n\n /// reference to a vtkEventBroker object per process. Clients that\n\n /// call this must call Delete on the object so that the reference\n\n /// counting will work. The single instance will be unreferenced when\n\n /// the program exits.\n\n static vtkEventBroker* New();\n\n\n","file_path":"Libs/MRML/Core/vtkEventBroker.h","rank":28,"score":216330.34804460904},{"content":"/// \\ingroup SegmentationCore\n\n/// \\brief This class encapsulates a segmentation that can contain multiple segments and multiple representations for each segment\n\n/// \\details\n\n/// The primary purpose of this class is to serve as a container to store the segments (in labelmap analogy the \"labels\").\n\n/// Also provides generic functions on the segmentation level. Performs conversion to a specified representation, extracts\n\n/// geometry information etc.\n\n/// \n\n/// Main points to remember:\n\n/// * Each segment has the same set of representations. This means that if segments are copied/moved between segmentations,\n\n/// then conversion will take place if possible (if not then copy will fail)\n\n/// * Default representations types are\n\n/// * Binary labelmap (vtkOrientedImageData)\n\n/// * Closed surface (vtkPolyData)\n\n/// * Additional representations can be defined (SlicerRT adds three: Planar contour, Fractional labelmap, Ribbon model)\n\n/// * Conversion between representations are driven by a conversion graph in which the nodes are the representations and the edges\n\n/// are conversion rules\n\n/// * When converting with the default method (\\sa CreateRepresentation without specifying a path), then the path with the lowest\n\n/// cost is used (rules have a cost field that gives a ballpark value for the conversion cost)\n\n/// * Representation types can be defined by registering conversion algorithms (rules) that specify their source and target\n\n/// representations, and an estimated cost metric\n\n/// * Master representation\n\n/// * Privileged representation type. Can be any of the available representations, but usually it's the original representation\n\n/// of the data (binary labelmap for editing, binary or fractional labelmap for DICOM SEG, planar contour for DICOM RT, etc.)\n\n/// * Using the proper master representation ensures that no information is lost, which is crucial to avoid discrepancies that can\n\n/// never be solved when data is permanently lost in conversion\n\n/// * Properties\n\n/// * All conversions use it as source (up-to-date representations along conversion path are used if available)\n\n/// * When changed all other representations are invalidated (and is re-converted later from master)\n\n/// * It is the representation that is saved to disk\n\n/// \n\n/// Schematic illustration of the segmentation container:\n\n/// \n\n/// +=============================================+\n\n/// | Patient (vtkSegmentation) |\n\n/// +======================+======================+\n\n/// | Brain (vtkSegment) | Tumor (vtkSegment) |\n\n/// +======================+======================+\n\n/// Binary labelmap | vtkOrientedImageData | vtkOrientedImageData |\n\n/// +----------------------+----------------------+\n\n/// Closed surface | vtkPolyData | vtkPolyData |\n\n/// +----------------------+----------------------+\n\n/// Custom representation | vtkDataObject | vtkDataObject |\n\n/// +----------------------+----------------------+\n\n/// \n\nclass vtkSegmentationCore_EXPORT vtkSegmentation : public vtkObject\n\n{\n\npublic:\n\n enum\n\n {\n\n /// Invoked when content of the master representation in a segment is changed.\n\n MasterRepresentationModified = 62100,\n\n /// Invoked when content of any representation (including the master representation) in a segment is changed.\n\n RepresentationModified,\n\n /// Invoked if new segment is added\n\n SegmentAdded,\n\n /// Invoked if a segment is removed\n\n SegmentRemoved,\n\n /// Invoked if a segment is modified (name changed, tags changed, etc).\n\n /// Note: the event is not invoked when content of a representation in a segment is changed.\n\n SegmentModified,\n\n /// Invoked if a representation is created or removed in the segments (e.g., created by conversion from master).\n\n ContainedRepresentationNamesModified\n\n };\n\n\n","file_path":"Libs/vtkSegmentationCore/vtkSegmentation.h","rank":29,"score":216329.27325755273},{"content":"/// \\brief Abstract Superclass for all specific types of MRML nodes.\n\n///\n\n/// This node encapsulates the functionality common to all types of MRML nodes.\n\n/// This includes member variables for ID, Description, and Options,\n\n/// as well as member functions to Copy() and Write().\n\nclass VTK_MRML_EXPORT vtkMRMLNode : public vtkObject\n\n{\n\n /// make the vtkMRMLScene a friend so that AddNodeNoNotify can call\n\n /// SetID, but that's the only class that is allowed to do so\n\n friend class vtkMRMLScene;\n\n friend class vtkMRMLSceneViewNode;\n\n\n\npublic:\n\n vtkTypeMacro(vtkMRMLNode,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// \\brief Create instance of the default node. Like New only virtual.\n\n ///\n\n /// \\note Subclasses should implement this method\n\n virtual vtkMRMLNode* CreateNodeInstance() = 0;\n\n\n\n /// Set node attributes\n\n ///\n\n /// \\note\n\n /// Subclasses should implement this method.\n","file_path":"Libs/MRML/Core/vtkMRMLNode.h","rank":30,"score":216325.71785453238},{"content":"/// \\brief MRML object to represent a 3D point.\n\n///\n\n/// \\deprecated Used for backward compatibility for Slicer3 fiducial lists, please use the Annotation Module MRML nodes\n\n/// \\sa vtkMRMLAnnotationNode, vtkMRMLAnnotationFiducialNode\n\nclass VTK_MRML_EXPORT vtkMRMLFiducial : public vtkObject\n\n{\n\npublic:\n\n /// \\deprecated Used for backward compatibility for Slicer3 fiducial lists, please use the Annotation Module MRML nodes\n\n /// \\sa vtkMRMLAnnotationNode, vtkMRMLAnnotationFiducialNode\n\n ///\n\n static vtkMRMLFiducial *New();\n\n vtkTypeMacro(vtkMRMLFiducial,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n //--------------------------------------------------------------------------\n\n /// MRML methods\n\n //--------------------------------------------------------------------------\n\n\n\n ///\n\n /// Set node attributes\n\n virtual void ReadXMLAttributes( const char** atts);\n\n\n\n ///\n\n /// Set node attributes from an unparsed string of keys and values\n","file_path":"Libs/MRML/Core/vtkMRMLFiducial.h","rank":31,"score":216325.64656575897},{"content":"/// Node factory that can be used by qMRML widgets to easily create nodes\n\n/// If you want more control over the node creation, you can add attributes,\n\n/// specify a base node name or connect to signals to customize the node\n\nclass QMRML_WIDGETS_EXPORT qMRMLNodeFactory : public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n\n\n /// Convenient typedef\n\n typedef QHash<QString,QString> AttributeType;\n\n\n\n /// Constructors\n\n typedef QObject Superclass;\n\n explicit qMRMLNodeFactory(QObject* parent = 0);\n\n virtual ~qMRMLNodeFactory();\n\n\n\n /// Get MRML scene.\n\n /// By default, there is no scene.\n\n vtkMRMLScene* mrmlScene()const;\n\n\n\n ///\n\n /// Create and add a node given its \\a className to the scene associated\n\n /// with the factory. The function will fire the signals:\n","file_path":"Libs/MRML/Widgets/qMRMLNodeFactory.h","rank":32,"score":216320.46274902415},{"content":"class VTK_MRML_EXPORT vtkCacheManager : public vtkObject\n\n{\n\n public:\n\n\n\n /// The Usual vtk class functions\n\n static vtkCacheManager *New();\n\n vtkTypeMacro(vtkCacheManager, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n vtkGetMacro (InsufficientFreeBufferNotificationFlag, int );\n\n vtkSetMacro (InsufficientFreeBufferNotificationFlag, int );\n\n\n\n ///\n\n /// Sets the name of the directory to use for local file caching\n\n /// Does some checking to make sure this is a valid directory\n\n /// on the local system. Makes sure there's NO \"/\" at the end\n\n /// of the string, or kwsys/SystemTools will not see as a valid dir.\n\n virtual void SetRemoteCacheDirectory (const char *dir );\n\n\n\n ///\n","file_path":"Libs/MRML/Core/vtkCacheManager.h","rank":33,"score":216320.46274902415},{"content":"class QMRML_WIDGETS_EXPORT qMRMLEventLogger: public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n typedef QObject Superclass;\n\n explicit qMRMLEventLogger(QObject* parent = 0);\n\n virtual ~qMRMLEventLogger();\n\n\n\n ///\n\n /// Set the MRML \\a scene that should be listened for events\n\n void setMRMLScene(vtkMRMLScene* scene);\n\n\n\n ///\n\n /// Return true if the corresponding event if listened by the eventLogger\n\n bool listeningNodeAddedEvent();\n\n bool listeningNodeRemovedEvent();\n\n bool listeningNewSceneEvent();\n\n bool listeningSceneClosedEvent();\n\n bool listeningSceneAboutToBeClosedEvent();\n\n bool listeningMetadataAddedEvent();\n","file_path":"Libs/MRML/Widgets/qMRMLEventLogger.h","rank":34,"score":216320.46274902415},{"content":"class VTK_MRML_EXPORT vtkURIHandler : public vtkObject\n\n{\n\npublic:\n\n /// The Usual vtk class functions\n\n //static vtkURIHandler *New() { return NULL; };\n\n static vtkURIHandler *New();\n\n vtkTypeMacro(vtkURIHandler, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n vtkGetStringMacro (HostName);\n\n vtkSetStringMacro (HostName);\n\n\n\n ///\n\n /// virtual methods to be defined in subclasses.\n\n /// (Maybe these should be defined to handle default file operations)\n\n virtual void StageFileRead ( const char *source, const char * destination );\n\n virtual void StageFileWrite ( const char *source, const char * destination );\n\n\n\n ///\n\n /// various Read/Write method footprints useful to redefine in specific handlers.\n","file_path":"Libs/MRML/Core/vtkURIHandler.h","rank":35,"score":216320.46274902415},{"content":"class VTK_MRML_EXPORT vtkDataTransfer : public vtkObject\n\n{\n\n public:\n\n\n\n /// The Usual vtk class functions\n\n static vtkDataTransfer *New();\n\n vtkTypeMacro(vtkDataTransfer, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n vtkGetStringMacro ( SourceURI );\n\n vtkSetStringMacro ( SourceURI );\n\n vtkGetStringMacro ( DestinationURI );\n\n vtkSetStringMacro ( DestinationURI );\n\n vtkGetObjectMacro ( Handler, vtkURIHandler );\n\n virtual void SetHandler(vtkURIHandler* uriHandler);\n\n vtkGetMacro ( TransferType, int );\n\n vtkSetMacro ( TransferType, int );\n\n vtkGetMacro ( TransferID, int );\n\n vtkSetMacro ( TransferID, int );\n\n vtkGetMacro ( SizeOnDisk, int );\n\n vtkSetMacro ( SizeOnDisk, int );\n","file_path":"Libs/MRML/Core/vtkDataTransfer.h","rank":36,"score":216320.46274902415},{"content":"class VTK_MRML_EXPORT vtkTagTable : public vtkObject\n\n{\n\n public:\n\n /// The Usual vtk class functions\n\n static vtkTagTable *New();\n\n vtkTypeMacro(vtkTagTable, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n ///\n\n /// Get the vtkTable that contains user-defined attribute/value pairs.\n\n vtkGetStringMacro ( Name );\n\n vtkSetStringMacro ( Name );\n\n\n\n vtkGetMacro ( RestoreSelectionState, int);\n\n vtkSetMacro ( RestoreSelectionState, int);\n\n\n\n ///\n\n /// Method that sets up default and required tags for a service.\n\n /// Each derived class should fill out this method.\n\n virtual void Initialize() { };\n","file_path":"Libs/MRML/Core/vtkTagTable.h","rank":37,"score":216320.46274902415},{"content":"class VTK_MRML_EXPORT vtkPermissionPrompter : public vtkObject\n\n{\n\n public:\n\n\n\n /// The Usual vtk class functions\n\n static vtkPermissionPrompter *New();\n\n vtkTypeMacro(vtkPermissionPrompter, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n ///\n\n /// Member for storing a user name, if required\n\n vtkGetStringMacro ( Username );\n\n vtkSetStringMacro ( Username );\n\n\n\n ///\n\n /// Member for storing a password, if required\n\n vtkGetStringMacro ( Password );\n\n vtkSetStringMacro ( Password );\n\n\n\n vtkGetStringMacro (HostName );\n","file_path":"Libs/MRML/Core/vtkPermissionPrompter.h","rank":38,"score":216320.46274902415},{"content":" /// \\brief Class to hold information about a node reference\n\n class VTK_MRML_EXPORT vtkMRMLNodeReference : public vtkObject\n\n {\n\n public:\n\n vtkTypeMacro(vtkMRMLNodeReference,vtkObject);\n\n static vtkMRMLNodeReference *New();\n\n void PrintSelf(ostream& vtkNotUsed(os), vtkIndent vtkNotUsed(indent)){};\n\n\n\n public:\n\n vtkSetStringMacro(ReferenceRole);\n\n vtkGetStringMacro(ReferenceRole);\n\n\n\n vtkSetStringMacro(ReferencedNodeID);\n\n vtkGetStringMacro(ReferencedNodeID);\n\n\n\n /// \\brief Set the events that will be observed when the referenced node\n\n /// will be available.\n\n ///\n\n /// If set to NULL then the default event list (specified for the role) will be observed.\n\n /// If set to an empty event list then no events will be observed.\n\n void SetEvents(vtkIntArray* events);\n","file_path":"Libs/MRML/Core/vtkMRMLNode.h","rank":39,"score":213600.5259066248},{"content":"class VTK_SLICER_BASE_LOGIC_EXPORT vtkSystemInformation : public vtkObject\n\n{\n\npublic:\n\n static vtkSystemInformation *New();\n\n vtkTypeMacro(vtkSystemInformation,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n const char * GetVendorString();\n\n const char * GetVendorID();\n\n const char * GetTypeID();\n\n const char * GetFamilyID();\n\n const char * GetModelName();\n\n const char * GetModelID();\n\n const char * GetSteppingCode();\n\n const char * GetExtendedProcessorName();\n\n const char * GetProcessorSerialNumber();\n\n int GetProcessorCacheSize();\n\n int GetLogicalProcessorsPerPhysical();\n\n float GetProcessorClockFrequency();\n\n int GetProcessorAPICID();\n","file_path":"Base/Logic/vtkSystemInformation.h","rank":40,"score":213594.29181264158},{"content":"class VTK_SLICER_BASE_LOGIC_EXPORT vtkSlicerTask : public vtkObject\n\n{\n\npublic:\n\n static vtkSlicerTask *New();\n\n vtkTypeMacro(vtkSlicerTask,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n typedef vtkMRMLAbstractLogic::TaskFunctionPointer TaskFunctionPointer;\n\n\n\n ///\n\n /// Set the function and object to call for the task.\n\n void SetTaskFunction(vtkMRMLAbstractLogic*, TaskFunctionPointer, void *clientdata);\n\n\n\n ///\n\n /// Execute the task.\n\n virtual void Execute();\n\n\n\n ///\n\n /// The type of task - this can be used, for example, to decide\n\n /// how many concurrent threads should be allowed\n","file_path":"Base/Logic/vtkSlicerTask.h","rank":41,"score":213594.29181264158},{"content":"//------------------------------------------------------------------------------\n\nclass Q_SLICER_BASE_QTGUI_EXPORT qSlicerFileDialog : public QObject\n\n{\n\n Q_OBJECT\n\n Q_ENUMS(IOAction)\n\n Q_PROPERTY(QString description READ description)\n\n\n\npublic:\n\n typedef QObject Superclass;\n\n qSlicerFileDialog(QObject* parent =0);\n\n virtual ~qSlicerFileDialog();\n\n\n\n virtual qSlicerIO::IOFileType fileType()const = 0;\n\n\n\n /// Unique name of the reader/writer\n\n /// \\sa filetype()\n\n virtual QString description()const = 0;\n\n\n\n enum IOAction\n\n {\n\n Read,\n","file_path":"Base/QTGUI/qSlicerFileDialog.h","rank":42,"score":213594.29181264158},{"content":"//-----------------------------------------------------------------------------\n\nclass qSlicerSegmentEditorAbstractEffectPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n Q_DECLARE_PUBLIC(qSlicerSegmentEditorAbstractEffect);\n\nprotected:\n\n qSlicerSegmentEditorAbstractEffect* const q_ptr;\n\npublic:\n\n qSlicerSegmentEditorAbstractEffectPrivate(qSlicerSegmentEditorAbstractEffect& object);\n\n ~qSlicerSegmentEditorAbstractEffectPrivate();\n\nsignals:\n\n // Signals that are used for effects to request operations from the editor\n\n // without having any dependency on the editor.\n\n void selectEffectSignal(QString);\n\n void updateVolumeSignal(void*,bool&);\n\n void saveStateForUndoSignal();\n\npublic:\n\n /// Segment editor parameter set node\n\n vtkWeakPointer<vtkMRMLSegmentEditorNode> ParameterSetNode;\n\n\n\n /// MRML scene\n","file_path":"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorAbstractEffect_p.h","rank":43,"score":212889.7227884783},{"content":"/// \\ingroup SlicerRt_QtModules_Segmentations\n\n/// \\brief Private implementation of the segment editor paint effect\n\nclass qSlicerSegmentEditorPaintEffectPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n Q_DECLARE_PUBLIC(qSlicerSegmentEditorPaintEffect);\n\nprotected:\n\n qSlicerSegmentEditorPaintEffect* const q_ptr;\n\npublic:\n\n typedef QObject Superclass;\n\n qSlicerSegmentEditorPaintEffectPrivate(qSlicerSegmentEditorPaintEffect& object);\n\n ~qSlicerSegmentEditorPaintEffectPrivate();\n\n\n\n /// Depending on the \\sa DelayedPaint mode, either paint the given point or queue\n\n /// it up with a marker for later painting\n\n void paintAddPoint(qMRMLWidget* viewWidget, double pixelPositionWorld[3]);\n\n\n\n /// Update paint circle glyph\n\n void updateBrush(qMRMLWidget* viewWidget, BrushPipeline* brush);\n\n\n\n /// Update brushes\n\n void updateBrushes();\n","file_path":"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorPaintEffect_p.h","rank":44,"score":212889.7227884783},{"content":"/// \\ingroup SegmentationCore\n\n/// \\brief Class that can convert between different representations of a segment.\n\nclass vtkSegmentationCore_EXPORT vtkSegmentationConverter : public vtkObject\n\n{\n\npublic:\n\n typedef std::vector< vtkSmartPointer<vtkSegmentationConverterRule> > ConverterRulesListType;\n\n\n\n typedef std::vector<vtkSegmentationConverterRule*> ConversionPathType; // Contains a list of converter rule names\n\n typedef std::pair<ConversionPathType, unsigned int> ConversionPathAndCostType;\n\n typedef std::vector<ConversionPathAndCostType> ConversionPathAndCostListType;\n\n\n\n /// Default representation types\n\n /// In binary and fractional labelmaps values <=0 are considered background voxels (outside), values>0 are foreground (inside).\n\n static const char* GetSegmentationBinaryLabelmapRepresentationName() { return \"Binary labelmap\"; };\n\n static const char* GetSegmentationFractionalLabelmapRepresentationName() { return \"Fractional labelmap\"; };\n\n static const char* GetSegmentationPlanarContourRepresentationName() { return \"Planar contour\"; };\n\n static const char* GetSegmentationClosedSurfaceRepresentationName() { return \"Closed surface\"; };\n\n\n\n // Common conversion parameters\n\n // ----------------------------\n\n /// Reference image geometry conversion parameter\n\n /// Contains serialized matrix and extent\n","file_path":"Libs/vtkSegmentationCore/vtkSegmentationConverter.h","rank":45,"score":210975.34803645647},{"content":"/// \\ingroup vtkSegmentationCore\n\n/// \\brief Algorithm class for computing topological hierarchy of multiple poly data models.\n\n/// The levels of the models are determined according to the models they contain, an outer\n\n/// model always having larger level value than the inner ones. To determine whether a model\n\n/// contains another, their bounding boxes are considered. It is possible to constrain a gap\n\n/// or allow the inner model to protrude the surface of the outer one. The size of this gap\n\n/// or allowance is defined as a factor /sa ContainConstraintFactor of the outer model size.\n\n/// This algorithm can be used to automatically determine optimal opacities in complex scenes.\n\nclass vtkSegmentationCore_EXPORT vtkTopologicalHierarchy : public vtkObject\n\n{\n\npublic:\n\n\n\n static vtkTopologicalHierarchy *New();\n\n vtkTypeMacro(vtkTopologicalHierarchy, vtkObject );\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// Get output topological hierarchy levels\n\n virtual vtkIntArray* GetOutputLevels();\n\n\n\n /// Compute topological hierarchy levels for input poly data models using\n\n /// their bounding boxes.\n\n /// This function has to be explicitly called!\n\n /// Output can be get using GetOutputLevels()\n\n virtual void Update();\n\n\n\n /// Set input poly data collection\n\n vtkSetObjectMacro(InputPolyDataCollection, vtkPolyDataCollection);\n\n\n","file_path":"Libs/vtkSegmentationCore/vtkTopologicalHierarchy.h","rank":46,"score":210973.41649971745},{"content":"class VTK_ADDON_EXPORT vtkAddonMathUtilities : public vtkObject\n\n{\n\npublic:\n\n static vtkAddonMathUtilities *New();\n\n vtkTypeMacro(vtkAddonMathUtilities,vtkObject);\n\n virtual void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n static bool MatrixAreEqual(const vtkMatrix4x4* m1,\n\n const vtkMatrix4x4* m2,\n\n double tolerance = 1e-3);\n\n\n\n static bool MatrixAreEqual(const vtkMatrix4x4 *m1,\n\n const vtkMatrix3x3 *m2,\n\n double tolerance = 1e-3);\n\n\n\n static bool MatrixAreEqual(const vtkMatrix3x3 *m1,\n\n const vtkMatrix4x4 *m2,\n\n double tolerance = 1e-3);\n\n\n\n static bool MatrixAreEqual(const vtkMatrix3x3 *m1,\n","file_path":"Libs/vtkAddon/vtkAddonMathUtilities.h","rank":47,"score":210969.32022997006},{"content":"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerModuleManager : public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n typedef QObject Superclass;\n\n qSlicerModuleManager(QObject* newParent = 0);\n\n virtual ~qSlicerModuleManager();\n\n\n\n /// Print internal state using qDebug()\n\n virtual void printAdditionalInfo();\n\n\n\n /// Return a pointer to the current module factory manager\n\n Q_INVOKABLE qSlicerModuleFactoryManager * factoryManager()const;\n\n\n\n /// Return the list of all the loaded modules\n\n Q_INVOKABLE QStringList modulesNames()const;\n\n\n\n /// Return the loaded module identified by \\a name\n\n Q_INVOKABLE qSlicerAbstractCoreModule* module(const QString& name)const;\n\n\n","file_path":"Base/QTCore/qSlicerModuleManager.h","rank":48,"score":210969.32022997006},{"content":"/// \\ingroup SegmentationCore\n\nclass vtkSegmentationCore_EXPORT vtkSegmentationHistory : public vtkObject\n\n{\n\npublic:\n\n static vtkSegmentationHistory* New();\n\n vtkTypeMacro(vtkSegmentationHistory, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// Selects a segmentation that the states will be stored of. Current state of the segmentation is not stored.\n\n /// \\param segmentation Segmentation to store. Deletes all stored states of the previously set segmentation.\n\n void SetSegmentation(vtkSegmentation* segmentation);\n\n\n\n /// Get segmentation that the states will be stored of.\n\n vtkGetMacro(Segmentation, vtkSegmentation*);\n\n\n\n /// Saves all master representations of the segmentation in its current state.\n\n /// States more recent than the last restored state are removed.\n\n /// \\return Success flag\n\n bool SaveState();\n\n\n\n /// Restores previous state of the segmentation.\n","file_path":"Libs/vtkSegmentationCore/vtkSegmentationHistory.h","rank":49,"score":210969.32022997006},{"content":"class Q_SLICER_BASE_QTAPP_EXPORT qSlicerApplicationHelper : public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n typedef QObject Superclass;\n\n typedef qSlicerApplicationHelper Self;\n\n\n\n qSlicerApplicationHelper(QObject * parent = 0);\n\n virtual ~qSlicerApplicationHelper();\n\n\n\n static void setupModuleFactoryManager(qSlicerModuleFactoryManager * moduleFactoryManager);\n\n\n\n static void showMRMLEventLoggerWidget();\n\n\n\nprivate:\n\n Q_DISABLE_COPY(qSlicerApplicationHelper);\n\n};\n\n\n\n#endif\n","file_path":"Base/QTApp/qSlicerApplicationHelper.h","rank":50,"score":210969.32022997006},{"content":"class VTK_MRML_EXPORT vtkDataIOManager : public vtkObject\n\n{\n\n public:\n\n\n\n /// The Usual vtk class functions\n\n static vtkDataIOManager *New();\n\n vtkTypeMacro(vtkDataIOManager,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n vtkGetObjectMacro ( DataTransferCollection, vtkCollection );\n\n void SetDataTransferCollection(vtkCollection* dataTransfer );\n\n vtkGetObjectMacro ( CacheManager, vtkCacheManager );\n\n virtual void SetCacheManager(vtkCacheManager* cacheManager);\n\n vtkGetMacro ( EnableAsynchronousIO, int );\n\n vtkGetMacro ( InUpdateCallbackFlag, int );\n\n vtkSetMacro ( InUpdateCallbackFlag, int );\n\n\n\n ///\n\n /// Get/Set the DataFileFormatHelper object\n\n vtkDataFileFormatHelper* GetFileFormatHelper();\n\n virtual void SetFileFormatHelper(vtkDataFileFormatHelper* helper);\n","file_path":"Libs/MRML/Core/vtkDataIOManager.h","rank":51,"score":210969.32022997006},{"content":"class qSlicerBaseQTBasePythonQtDecorators : public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n\n\n qSlicerBaseQTBasePythonQtDecorators()\n\n {\n\n PythonQt::self()->registerClass(&qSlicerCoreApplication::staticMetaObject);\n\n PythonQt::self()->registerClass(&qSlicerAbstractCoreModule::staticMetaObject);\n\n PythonQt::self()->registerCPPClass(\"qSlicerUtils\", 0, \"qSlicerBaseQTCore\");\n\n // Note: Use registerCPPClassForPythonQt to register pure Cpp classes\n\n }\n\n\n\npublic slots:\n\n\n\n //----------------------------------------------------------------------------\n\n // qSlicerCoreApplication\n\n\n\n //----------------------------------------------------------------------------\n\n // static methods\n","file_path":"Base/QTCore/qSlicerBaseQTCorePythonQtDecorators.h","rank":52,"score":210536.70470846392},{"content":"class qSlicerBaseQTAppPythonQtDecorators : public QObject\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n\n\n qSlicerBaseQTAppPythonQtDecorators()\n\n {\n\n }\n\n\n\npublic slots:\n\n\n\n //----------------------------------------------------------------------------\n\n // qSlicerApplicationHelper\n\n\n\n //----------------------------------------------------------------------------\n\n void static_qSlicerApplicationHelper_setupModuleFactoryManager(qSlicerModuleFactoryManager * moduleFactoryManager)\n\n {\n\n qSlicerApplicationHelper::setupModuleFactoryManager(moduleFactoryManager);\n\n }\n\n};\n\n\n\n//-----------------------------------------------------------------------------\n\nvoid initqSlicerBaseQTAppPythonQtDecorators()\n\n{\n\n PythonQt::self()->addDecorators(new qSlicerBaseQTAppPythonQtDecorators);\n\n}\n\n\n\n#endif\n","file_path":"Base/QTApp/qSlicerBaseQTAppPythonQtDecorators.h","rank":53,"score":210536.70470846392},{"content":"/// \\brief Superclass for MRML logic classes.\n\n///\n\n/// Superclass for all MRML logic classes.\n\n/// When a scene is set, SetMRMLScene(vtkMRMLScene*),\n\n/// - UnobserveMRMLScene() is called if a scene was previously set,\n\n/// - SetMRMLSceneInternal() is called to observe the scene events\n\n/// (e.g. StartImportEvent, EndBatchProcessEvent...)\n\n/// - ObserveMRMLScene() is called to initialize the scene from the logic\n\n/// - UpdateMRMLScene() is called to initialize the logic from the scene\n\n/// Later, when events are fired by the scene, corresponding methods\n\n/// (e.g. OnMRMLSceneNodeAdded, OnMRMLEndBatchProcess...) are called in the\n\n/// logic if the events have been previously observed in SetMRMLSceneInternal()\n\nclass VTK_MRML_LOGIC_EXPORT vtkMRMLAbstractLogic : public vtkObject\n\n{\n\npublic:\n\n /// Typedef for member functions of MRMLLogic that can be used as\n\n /// scheduled tasks.\n\n typedef void (vtkMRMLAbstractLogic::*TaskFunctionPointer)(void *clientdata);\n\n\n\n static vtkMRMLAbstractLogic *New();\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n vtkTypeMacro(vtkMRMLAbstractLogic, vtkObject);\n\n\n\n /// Get access to overall application state\n\n virtual vtkMRMLApplicationLogic* GetMRMLApplicationLogic()const;\n\n virtual void SetMRMLApplicationLogic(vtkMRMLApplicationLogic* logic);\n\n\n\n /// Return a reference to the current MRML scene\n\n vtkMRMLScene * GetMRMLScene()const;\n\n\n\n /// Set and observe the MRMLScene\n\n void SetMRMLScene(vtkMRMLScene * newScene);\n","file_path":"Libs/MRML/Logic/vtkMRMLAbstractLogic.h","rank":54,"score":208452.0694072922},{"content":"/// \\brief Provides tools.\n\n///\n\n/// Utility functions associated to FreeSurfer data.\n\nclass VTK_FreeSurfer_EXPORT vtkFSSurfaceHelper: public vtkObject\n\n{\n\npublic:\n\n static vtkFSSurfaceHelper* New();\n\n\n\n /// Convenience method to compute a volume's Vox2RAS-tkreg Matrix\n\n static void ComputeTkRegVox2RASMatrix(double* spacing, int* dimensions, vtkMatrix4x4 *M );\n\n\n\n /// Computes matrix we need to register V1Node to V2Node given the\n\n /// \"register.dat\" matrix from tkregister2 (FreeSurfer)\n\n static void TranslateFreeSurferRegistrationMatrixIntoSlicerRASToRASMatrix(\n\n double* V1Spacing, int* V1Dim, vtkMatrix4x4* V1IJKToRASMatrix,\n\n double* V2Spacing, int* V2Dim, vtkMatrix4x4* V2RASToIJKMatrix,\n\n vtkMatrix4x4 *FSRegistrationMatrix, vtkMatrix4x4 *RAS2RASMatrix);\n\n\n\nprotected:\n\n vtkFSSurfaceHelper();\n\n};\n\n\n\n#endif\n","file_path":"Libs/FreeSurfer/vtkFSSurfaceHelper.h","rank":55,"score":208440.01568814437},{"content":"//-----------------------------------------------------------------------------\n\nclass QMRML_WIDGETS_EXPORT qMRMLViewControllerBarPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLViewControllerBar);\n\n\n\nprotected:\n\n qMRMLViewControllerBar* const q_ptr;\n\n\n\npublic:\n\n typedef QObject Superclass;\n\n qMRMLViewControllerBarPrivate(qMRMLViewControllerBar& object);\n\n virtual ~qMRMLViewControllerBarPrivate();\n\n\n\n virtual void init();\n\n virtual void setColor(QColor color);\n\n virtual QColor color()const;\n\n\n\n QToolButton* PinButton;\n\n QLabel* ViewLabel;\n\n ctkPopupWidget* PopupWidget;\n","file_path":"Libs/MRML/Widgets/qMRMLViewControllerBar_p.h","rank":56,"score":208440.01568814437},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLROIWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLROIWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLROIWidgetPlugin.h","rank":57,"score":208440.01568814437},{"content":"/// \\ingroup SlicerRt_QtModules_Segmentations\n\n/// \\brief Private implementation of the segment editor abstract label effect\n\nclass qSlicerSegmentEditorAbstractLabelEffectPrivate: public QObject\n\n{\n\n Q_OBJECT\n\n Q_DECLARE_PUBLIC(qSlicerSegmentEditorAbstractLabelEffect);\n\nprotected:\n\n qSlicerSegmentEditorAbstractLabelEffect* const q_ptr;\n\npublic:\n\n typedef QObject Superclass;\n\n qSlicerSegmentEditorAbstractLabelEffectPrivate(qSlicerSegmentEditorAbstractLabelEffect& object);\n\n ~qSlicerSegmentEditorAbstractLabelEffectPrivate();\n\n\n\nprotected slots:\n\n\n\npublic:\n\n};\n\n\n\n#endif\n","file_path":"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorAbstractLabelEffect_p.h","rank":58,"score":208264.99728106515},{"content":"class qMRMLAnnotationDisplayNodePointPropertyWidgetPrivate: public QObject,\n\n public Ui_qMRMLAnnotationDisplayNodePointPropertyWidget\n\n{\n\n Q_OBJECT\n\n Q_DECLARE_PUBLIC(qMRMLAnnotationDisplayNodePointPropertyWidget);\n\nprotected:\n\n qMRMLAnnotationDisplayNodePointPropertyWidget* const q_ptr;\n\n\n\npublic:\n\n\n\n qMRMLAnnotationDisplayNodePointPropertyWidgetPrivate(qMRMLAnnotationDisplayNodePointPropertyWidget& object);\n\n typedef qMRMLAnnotationDisplayNodePointPropertyWidgetPrivate Self;\n\n void setupUi(qMRMLAnnotationDisplayNodePropertyWidget * widget);\n\n\n\n};\n\n\n\n#endif\n","file_path":"Modules/Loadable/Annotations/Widgets/qMRMLAnnotationDisplayNodePointPropertyWidget_p.h","rank":59,"score":206070.4574459475},{"content":"/// \\brief qSlicerAbstractCoreModule is the base class of any module in Slicer.\n\n//\n\n/// Core modules, Loadable modules, CLI modules derive from it.\n\n/// It is responsible to create the UI and the Logic:\n\n/// createWidgetRepresentation() and createLogic() must be reimplemented in\n\n/// derived classes.\n\n/// A Slicer module has a name and a title: The name is its UID, the title\n\n/// displayed to the user.\n\n/// When a MRML scene is set to the module, the module set the scene to the\n\n/// UI widget and the logic.\n\nclass Q_SLICER_BASE_QTCORE_EXPORT qSlicerAbstractCoreModule : public QObject\n\n{\n\n /// Any object deriving from QObject must have the Q_OBJECT macro in\n\n /// order to have the signal/slots working and the meta-class name valid.\n\n Q_OBJECT\n\n\n\n /// The following properties are added to the meta-class\n\n /// and though are available through PythonQt.\n\n\n\n /// This property contains the name of the module.\n\n /// e.g. \"Volumes\", \"VolumeRendering\", \"SampleData\"...\n\n /// The name identifies a module and must be unique.\n\n /// In comparison to \\a title, \\a name contains only letter characters,\n\n /// no space/hyphen/apostrophe.\n\n /// The module name is set by the module factory (the registered item key\n\n /// string).\n\n /// Because \\a name is unique, slots and functions that take a module as\n\n /// argument should use \\name and not \\a title.\n\n Q_PROPERTY(QString name READ name)\n\n\n","file_path":"Base/QTCore/qSlicerAbstractCoreModule.h","rank":60,"score":206013.0054838387},{"content":"/// \\ingroup SegmentationCore\n\n/// \\brief Abstract converter rule class. Subclasses perform conversions between specific\n\n/// representation types. They define source and target type and provide ways to create those\n\n/// types of objects.\n\nclass vtkSegmentationCore_EXPORT vtkSegmentationConverterRule : public vtkObject\n\n{\n\npublic:\n\n /// Conversion parameter list type. Maps the conversion parameter name to a pair consisting of the\n\n /// value of the parameter (the default value if it is defined in the converter rule) and the\n\n /// description of the parameter that appears as tooltip in the conversion parameters widget\n\n /// ( name => (value, description) )\n\n typedef std::map<std::string, std::pair<std::string, std::string> > ConversionParameterListType;\n\n\n\n /// Constant to use for converter rules with \"infinite\" computational cost (i.e. disabled)\n\n /// It's about UINT_MAX / 400 (allows us to have a few hundred disabled rules)\n\n static unsigned int GetConversionInfiniteCost() { return 10000000; };\n\n\n\npublic:\n\n //static vtkSegmentationConverterRule* New();\n\n vtkTypeMacro(vtkSegmentationConverterRule, vtkObject);\n\n\n\n /// Create instance of the default node. Similar to New but virtual method.\n\n /// Subclasses should implement this method by\n\n virtual vtkSegmentationConverterRule* CreateRuleInstance() = 0;\n","file_path":"Libs/vtkSegmentationCore/vtkSegmentationConverterRule.h","rank":61,"score":206012.1005431629},{"content":"/// \\ingroup SegmentationCore\n\n/// \\brief Class that can create vtkSegmentationConverter instances.\n\n///\n\n/// This singleton class is a repository of all segmentation converter rules.\n\n/// Singleton pattern adopted from vtkEventBroker class.\n\nclass vtkSegmentationCore_EXPORT vtkSegmentationConverterFactory : public vtkObject\n\n{\n\npublic:\n\n typedef std::vector< vtkSmartPointer<vtkSegmentationConverterRule> > RuleListType;\n\n\n\n vtkTypeMacro(vtkSegmentationConverterFactory, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// Create a copy of all registered converter rules.\n\n /// The rule argument is overwritten (any previous content is cleared) with rules\n\n /// copied from the list of all registered rules.\n\n void CopyConverterRules(RuleListType &rules);\n\n\n\n /// Add a converter rule.\n\n /// The factory (and all converter classes it creates) will keep a reference to this rule object,\n\n /// and it will not be deleted until all these referring classes are deleted.\n\n void RegisterConverterRule(vtkSegmentationConverterRule* rule);\n\n\n\n /// Remove a converter rule from the factory.\n\n /// This does not affect converters that have already been created.\n","file_path":"Libs/vtkSegmentationCore/vtkSegmentationConverterFactory.h","rank":62,"score":206008.39796927685},{"content":"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerExtensionsManagerModel : public QObject\n\n{\n\n Q_OBJECT\n\n Q_PROPERTY(int numberOfInstalledExtensions READ numberOfInstalledExtensions)\n\n Q_PROPERTY(QStringList installedExtensions READ installedExtensions)\n\n Q_PROPERTY(QStringList enabledExtensions READ enabledExtensions)\n\n Q_PROPERTY(QUrl serverUrl READ serverUrl)\n\n Q_PROPERTY(QUrl serverUrlWithPackagePath READ serverUrlWithPackagePath)\n\n Q_PROPERTY(QUrl serverUrlWithExtensionsStorePath READ serverUrlWithExtensionsStorePath)\n\n Q_PROPERTY(QString extensionsInstallPath READ extensionsInstallPath)\n\n Q_PROPERTY(bool newExtensionEnabledByDefault READ newExtensionEnabledByDefault WRITE setNewExtensionEnabledByDefault)\n\n Q_PROPERTY(QString extensionsSettingsFilePath READ extensionsSettingsFilePath WRITE setExtensionsSettingsFilePath)\n\n Q_PROPERTY(QString slicerRevision READ slicerRevision WRITE setSlicerRevision)\n\n Q_PROPERTY(QString slicerOs READ slicerOs WRITE setSlicerOs)\n\n Q_PROPERTY(QString slicerArch READ slicerArch WRITE setSlicerArch)\n\n Q_PROPERTY(QString slicerVersion READ slicerVersion WRITE setSlicerVersion)\n\npublic:\n\n /// Superclass typedef\n\n typedef QObject Superclass;\n\n\n","file_path":"Base/QTCore/qSlicerExtensionsManagerModel.h","rank":63,"score":206001.2419076654},{"content":"class VTK_MRML_EXPORT vtkDataFileFormatHelper : public vtkObject\n\n{\n\n public:\n\n\n\n /// The Usual vtk class functions\n\n static vtkDataFileFormatHelper *New();\n\n vtkTypeMacro(vtkDataFileFormatHelper, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n static std::string GetFileExtensionFromFormatString(\n\n const char* fileformat);\n\n const char* GetClassNameFromFormatString(\n\n const char* fileformat);\n\n\n\n ///\n\n /// Get the itkimageio supported file formats.\n\n //vtkGetObjectMacro ( ITKSupportedWriteFileFormats, vtkStringArray);\n\n virtual vtkStringArray* GetITKSupportedWriteFileFormats();\n\n virtual vtkStringArray* GetITKSupportedReadFileFormats()\n\n {\n","file_path":"Libs/MRML/Core/vtkDataFileFormatHelper.h","rank":64,"score":206001.2419076654},{"content":"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerExtensionDownloadTask : public QObject\n\n{\n\n Q_OBJECT\n\n Q_PROPERTY(QVariantMap metadata READ metadata WRITE setMetadata)\n\n Q_PROPERTY(QString extensionName READ extensionName WRITE setExtensionName)\n\n Q_PROPERTY(QString archiveName READ archiveName WRITE setArchiveName)\n\n Q_PROPERTY(QNetworkReply* reply READ reply)\n\n\n\npublic:\n\n /// Constructor.\n\n ///\n\n /// The task takes ownership of the reply and will delete it when the task\n\n /// is destroyed.\n\n explicit qSlicerExtensionDownloadTask(QNetworkReply* reply,\n\n QObject* parent = 0);\n\n\n\n /// Destructor.\n\n virtual ~qSlicerExtensionDownloadTask();\n\n\n\n /// Get extension metadata.\n","file_path":"Base/QTCore/qSlicerExtensionDownloadTask.h","rank":65,"score":206001.2419076654},{"content":"/// \\ingroup SegmentationCore\n\n/// \\brief Calculate oversampling factor based on model properties using fuzzy logics\n\nclass vtkSegmentationCore_EXPORT vtkCalculateOversamplingFactor : public vtkObject\n\n{\n\npublic:\n\n static vtkCalculateOversamplingFactor *New();\n\n vtkTypeMacro(vtkCalculateOversamplingFactor, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\npublic:\n\n /// Calculate oversampling factor for the input model and its rasterization reference volume\n\n /// based on model properties using fuzzy logics.\n\n bool CalculateOversamplingFactor();\n\n\n\n /// Apply oversampling factor on image data geometry.\n\n /// Changes spacing and extent of oversampling factor is not 1 (and sensible)\n\n static void ApplyOversamplingOnImageGeometry(vtkOrientedImageData* imageData, double oversamplingFactor);\n\n\n\nprotected:\n\n /// Calculate relative structure size from input model and rasterization reference volume\n\n double CalculateRelativeStructureSize();\n\n\n","file_path":"Libs/vtkSegmentationCore/vtkCalculateOversamplingFactor.h","rank":66,"score":206001.2419076654},{"content":"//-----------------------------------------------------------------------------\n\nclass Q_SLICER_BASE_QTCLI_EXPORT qSlicerWidgetValueWrapper: public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n qSlicerWidgetValueWrapper(const QString& _name, const QString& _label, QObject* parent);\n\n virtual ~qSlicerWidgetValueWrapper();\n\n virtual QVariant value() = 0;\n\n QString label(){ return this->Label; }\n\n QString name(){ return this->Name; }\n\n\n\n virtual void setValue(const QString& _value) = 0;\n\n\n\n static QString toString(const QString& _value)\n\n {\n\n return _value;\n\n }\n\n\n\n static bool toBool(const QString& _value)\n\n {\n\n return (_value.compare(\"true\", Qt::CaseInsensitive) == 0);\n","file_path":"Base/QTCLI/qSlicerCLIModuleUIHelper.h","rank":67,"score":206001.2419076654},{"content":"/// Container class for objects that can be loaded from DICOM files into Slicer.\n\n/// Each plugin returns a list of instances from its evaluate method and accepts\n\n/// a list of these in its load method corresponding to the things the user has\n\n/// selected for loading\n\nclass Q_SLICER_MODULE_DICOMLIB_WIDGETS_EXPORT qSlicerDICOMLoadable : public QObject\n\n{\n\n Q_OBJECT\n\n\n\n /// Name exposed to the user for the node\n\n Q_PROPERTY(QString name READ name WRITE setName)\n\n /// Extra information the user sees on mouse over of the thing\n\n Q_PROPERTY(QString tooltip READ tooltip WRITE setTooltip)\n\n /// Things the user should know before loading this data\n\n Q_PROPERTY(QString warning READ warning WRITE setWarning)\n\n /// The file list of the data to be loaded\n\n Q_PROPERTY(QStringList files READ files WRITE setFiles)\n\n /// Is the object checked for loading by default\n\n Q_PROPERTY(bool selected READ selected WRITE setSelected)\n\n /// Confidence - from 0 to 1 where 0 means low chance\n\n /// that the user actually wants to load their data this\n\n /// way up to 1, which means that the plugin is very confident\n\n /// that this is the best way to load the data.\n\n /// When more than one plugin marks the same series as\n\n /// selected, the one with the highest confidence is\n","file_path":"Modules/Scripted/DICOMLib/Widgets/qSlicerDICOMLoadable.h","rank":68,"score":203659.08246314852},{"content":"/// Container class for things that can be loaded from DICOM files into Slicer.\n\n/// Each plugin returns a list of instances from its evaluate method and accepts\n\n/// a list of these in its load method corresponding to the things the user has\n\n/// selected for loading\n\nclass Q_SLICER_MODULE_DICOMLIB_WIDGETS_EXPORT qSlicerDICOMExportable : public QObject\n\n{\n\n Q_OBJECT\n\n\n\n /// Name exposed to the user for the export method\n\n Q_PROPERTY(QString name READ name WRITE setName)\n\n /// Extra information the user sees on mouse over of the export option\n\n Q_PROPERTY(QString tooltip READ tooltip WRITE setTooltip)\n\n /// ID of MRML node to be exported\n\n Q_PROPERTY(QString nodeID READ nodeID WRITE setNodeID)\n\n /// Class of the plugin that created this exportable\n\n Q_PROPERTY(QString pluginClass READ pluginClass WRITE setPluginClass)\n\n /// Target directory to export this exportable\n\n Q_PROPERTY(QString directory READ directory WRITE setDirectory)\n\n /// Confidence - from 0 to 1 where 0 means that the plugin\n\n /// cannot export the given node, up to 1 that means that the\n\n /// plugin considers itself the best plugin to export the node\n\n /// (in case of specialized objects, e.g. RT dose volume)\n\n Q_PROPERTY(double confidence READ confidence WRITE setConfidence)\n\n /// Pseudo-tags offered by the plugin that are to be filled out for export.\n","file_path":"Modules/Scripted/DICOMLib/Widgets/qSlicerDICOMExportable.h","rank":69,"score":203653.66633005746},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLRangeWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLRangeWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLRangeWidgetPlugin.h","rank":70,"score":203648.223827651},{"content":"//-----------------------------------------------------------------------------\n\nclass Q_SLICER_BASE_QTCLI_EXPORT qSlicerCLIModuleUIHelper: public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n\n\n qSlicerCLIModuleUIHelper(qSlicerCLIModuleWidget* cliModuleWidget);\n\n virtual ~qSlicerCLIModuleUIHelper();\n\n\n\n /// Create the widget associated with the given \\a moduleParameter\n\n /// The caller is responsible to delete the widget.\n\n /// Note also that if the widget is added to a layout, Qt will\n\n /// be responsible to delete the widget.\n\n QWidget* createTagWidget(const ModuleParameter& moduleParameter);\n\n\n\n ///\n\n /// Update \\a commandLineModuleNode properties using value entered from the UI\n\n void updateMRMLCommandLineModuleNode(vtkMRMLCommandLineModuleNode* commandLineModuleNode);\n\n\n\n /// Update user interface using the given \\a commandLineModuleNode parameters\n\n void updateUi(vtkMRMLCommandLineModuleNode* commandLineModuleNode);\n","file_path":"Base/QTCLI/qSlicerCLIModuleUIHelper.h","rank":71,"score":203648.223827651},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLTransformSlidersPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLTransformSlidersPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLTransformSlidersPlugin.h","rank":72,"score":203648.223827651},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLListWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLListWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLListWidgetPlugin.h","rank":73,"score":203648.223827651},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLLayoutWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLLayoutWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLLayoutWidgetPlugin.h","rank":74,"score":203648.223827651},{"content":"class VTK_SLICER_EDITORLIB_MODULE_LOGIC_EXPORT vtkImageStash : public vtkObject\n\n{\n\npublic:\n\n static vtkImageStash *New();\n\n vtkTypeMacro(vtkImageStash,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n ///\n\n /// The stash image:\n\n /// This image data will have the Scalars removed\n\n /// and they will be stored in a local compressed data\n\n /// array inside this class when the Stash method is called.\n\n /// You must call Unstash to have the scalars put back into\n\n /// this image data.\n\n vtkSetObjectMacro(StashImage, vtkImageData);\n\n vtkGetObjectMacro(StashImage, vtkImageData);\n\n\n\n ///\n\n /// The stashed scalars:\n\n /// this is the zlib compressed image scalar data\n","file_path":"Modules/Scripted/EditorLib/Logic/vtkImageStash.h","rank":75,"score":203648.223827651},{"content":"class qSlicerSubjectHierarchyModuleWidgetsPythonQtDecorators : public QObject\n\n{\n\n Q_OBJECT\n\npublic:\n\n\n\n qSlicerSubjectHierarchyModuleWidgetsPythonQtDecorators()\n\n {\n\n //PythonQt::self()->registerClass(&qSlicerSubjectHierarchyPluginHandler::staticMetaObject);\n\n // Note: Use registerCPPClassForPythonQt to register pure Cpp classes\n\n }\n\n\n\npublic slots:\n\n\n\n //----------------------------------------------------------------------------\n\n // qSlicerSubjectHierarchyPluginHandler\n\n\n\n //----------------------------------------------------------------------------\n\n // static methods\n\n\n\n //----------------------------------------------------------------------------\n","file_path":"Modules/Loadable/SubjectHierarchy/Widgets/qSlicerSubjectHierarchyModuleWidgetsPythonQtDecorators.h","rank":76,"score":201897.6694308523},{"content":"/// \\brief Factory where displayable manager classes are registered.\n\n///\n\n/// A displayable manager class is responsible to represent a\n\n/// MRMLDisplayable node in a renderer.\n\nclass VTK_MRML_DISPLAYABLEMANAGER_EXPORT vtkMRMLDisplayableManagerFactory : public vtkObject\n\n{\n\npublic:\n\n static vtkMRMLDisplayableManagerFactory* New();\n\n vtkTypeMacro(vtkMRMLDisplayableManagerFactory,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n enum\n\n {\n\n DisplayableManagerFactoryRegisteredEvent = 30100,\n\n DisplayableManagerFactoryUnRegisteredEvent = 30101\n\n };\n\n\n\n /// Return True if Displayable Manager identified by \\a vtkClassName\n\n /// is already registered.\n\n bool IsDisplayableManagerRegistered(const char* vtkClassName);\n\n\n\n /// Register Displayable Manager identified by \\a vtkClassOrScriptName\n\n /// Returns True if displayable manager was successfully registered\n\n /// \\a vtkClassOrScriptName should be either:\n","file_path":"Libs/MRML/DisplayableManager/vtkMRMLDisplayableManagerFactory.h","rank":77,"score":201383.41731570027},{"content":"/// \\brief DisplayableManagerGroup is a collection of DisplayableManager.\n\n///\n\n/// It also provides method allowing to either call RenderRequest\n\n/// or SetAndObserveMRMLDisplayableNode on all member of the group.\n\n/// When the displayable managers in the group request the view to be\n\n/// refreshed, the group fires a vtkCommand::UpdateEvent event.\n\n/// This event can be observed and trigger a Render on the render window.\n\nclass VTK_MRML_DISPLAYABLEMANAGER_EXPORT vtkMRMLDisplayableManagerGroup : public vtkObject\n\n{\n\npublic:\n\n\n\n static vtkMRMLDisplayableManagerGroup *New();\n\n vtkTypeMacro(vtkMRMLDisplayableManagerGroup,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n /// Convenient method equivalent to call SetAndObserveDisplayableManagerFactory, SetRenderer,\n\n /// then instantiate and add all displayable managers registered within the \\a factory.\n\n /// \\sa SetAndObserveDisplayableManagerFactory SetRenderer\n\n /// \\sa AddDisplayableManager InstantiateDisplayableManager\n\n void Initialize(vtkMRMLDisplayableManagerFactory * factory, vtkRenderer * renderer);\n\n\n\n /// Set and observe DisplayableManager factory\n\n void SetAndObserveDisplayableManagerFactory(vtkMRMLDisplayableManagerFactory * factory);\n\n\n\n /// Add a DisplayableManager and initialize it if required\n\n void AddDisplayableManager(vtkMRMLAbstractDisplayableManager * displayableManager);\n\n\n","file_path":"Libs/MRML/DisplayableManager/vtkMRMLDisplayableManagerGroup.h","rank":78,"score":201381.1443967662},{"content":"/// Loading modules into slicer happens in multiple steps:\n\n/// 1) module factories must be registered into the factory manager:\n\n/// qSlicerModuleFactoryManager* factoryManager = app->moduleManager()->factoryManager();\n\n/// factoryManager->registerFactory(new qSlicerLoadableModuleFactory);\n\n/// ...\n\n/// 2) directories where the modules to load are located must be passed to the factory manager\n\n/// factoryManager->addSearchPath(app->slicerHome() + \"/\" + Slicer_QTSCRIPTEDMODULES_LIB_DIR + \"/\" );\n\n/// factoryManager->addSearchPath(app->slicerHome() + \"/\" + Slicer_CLIMODULES_LIB_DIR + \"/\" );\n\n/// ...\n\n/// 3) Optionally:\n\n/// - specify module names to ignore: For startup speed-up and memory consummation,\n\n/// it can be useful to not load some modules:\n\n/// factoryManager->setModulesToIgnore(QStringList(QString(\"Data\")));\n\n/// - specify an explicit list of modules to register/instantiate/load. All other discovered\n\n/// modules won't be loaded.\n\n/// 4) scan the directories and test which file is a module and register it (not instantiated yet)\n\n/// For each file in the search paths, the factory manager asks each registered\n\n/// factory if they can load the file. If there is a factory that supports the\n\n/// file, the manager associates the factory to the file path, otherwise the\n\n/// file is discarded.\n\n/// factoryManager->registerModules();\n\n/// 5) Instantiate all the registered modules\n\n/// factoryManager->instantiateModules();\n\n/// 6) Connect each module with the scene and the application\n\n/// The application logic and the scene are passed to each module.\n\n/// The order of initialization is defined with the dependencies of the modules.\n\n/// If module B depends of module A, it is assured that module B is initialized/setup after A.\n\n/// factoryManager->loadModules();\n\nclass Q_SLICER_BASE_QTCORE_EXPORT qSlicerAbstractModuleFactoryManager : public QObject\n\n{\n\n Q_OBJECT\n\n /// This property holds the paths where the modules are located.\n\n /// At registration time (registerModules), the paths are scanned and module\n\n /// discovered.\n\n /// A module can be a library (dll, so),\n\n /// an executable (exe), a python file (py) or any other file type supported\n\n /// by the registered factories.\n\n /// The search is not recursive, you need to provide each subdirectory\n\n /// manually.\n\n ///\n\n /// \\todo In qSlicerAbstractModuleFactoryManager, should the module search recursively descend \\a searchPaths\n\n Q_PROPERTY(QStringList searchPaths READ searchPaths WRITE setSearchPaths)\n\n\n\n /// This property holds the names of the modules to ignore at registration time.\n\n ///\n\n /// Due to the large amount of modules to load, it can be faster (and less\n\n /// overwhelming) to load only a subset of the modules.\n\n Q_PROPERTY(QStringList modulesToIgnore READ modulesToIgnore WRITE setModulesToIgnore NOTIFY modulesToIgnoreChanged)\n","file_path":"Base/QTCore/qSlicerAbstractModuleFactoryManager.h","rank":79,"score":201379.06257691752},{"content":"/// \\ingroup SegmentationCore\n\n/// \\brief Utility functions for resampling oriented image data\n\nclass vtkSegmentationCore_EXPORT vtkOrientedImageDataResample : public vtkObject\n\n{\n\npublic:\n\n static vtkOrientedImageDataResample *New();\n\n vtkTypeMacro(vtkOrientedImageDataResample,vtkObject);\n\n\n\n enum\n\n {\n\n OPERATION_MINIMUM,\n\n OPERATION_MAXIMUM,\n\n OPERATION_MASKING\n\n };\n\n\n\n /// Resample an oriented image data to match the geometry of a reference geometry matrix.\n\n /// Origin and dimensions are determined from the contents of the input image.\n\n /// \\param inputImage Oriented image to resample\n\n /// \\param referenceGeometryMatrix Matrix containing the desired geometry\n\n /// \\param outputImage Output image\n\n /// \\param linearInterpolation True if linear interpolation is requested (fractional labelmap), or false for nearest neighbor (binary labelmap). Default is false.\n\n /// \\return Success flag\n","file_path":"Libs/vtkSegmentationCore/vtkOrientedImageDataResample.h","rank":80,"score":201376.5164002522},{"content":"/// \\ingroup Slicer_QtModules_SubjectHierarchy_Widgets\n\nclass Q_SLICER_MODULE_DICOMLIB_WIDGETS_EXPORT qSlicerDICOMExportDialog : public QObject\n\n{\n\npublic:\n\n Q_OBJECT\n\n\n\npublic:\n\n typedef QObject Superclass;\n\n qSlicerDICOMExportDialog(QObject* parent = NULL);\n\n virtual ~qSlicerDICOMExportDialog();\n\n\n\npublic:\n\n /// Show dialog\n\n /// \\param nodeToSelect Node is selected in the tree if given\n\n virtual bool exec(vtkMRMLSubjectHierarchyNode* nodeToSelect=NULL);\n\n\n\n /// Set MRML scene\n\n Q_INVOKABLE void setMRMLScene(vtkMRMLScene* scene);\n\n\n\n /// Python compatibility function for showing dialog (calls \\a exec)\n\n Q_INVOKABLE bool execDialog(vtkMRMLSubjectHierarchyNode* nodeToSelect=NULL) { return this->exec(nodeToSelect); };\n","file_path":"Modules/Scripted/DICOMLib/Widgets/qSlicerDICOMExportDialog.h","rank":81,"score":199181.9765651346},{"content":"class VTK_SLICER_EDITORLIB_MODULE_LOGIC_EXPORT vtkImageSlicePaint : public vtkObject\n\n{\n\npublic:\n\n static vtkImageSlicePaint *New();\n\n vtkTypeMacro(vtkImageSlicePaint,vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\n\n\n ///\n\n /// Sets/Gets the PaintRegion in IJK (pixel) coordinates of the Working image\n\n vtkSetVector3Macro(TopLeft, int);\n\n vtkGetVector3Macro(TopLeft, int);\n\n vtkSetVector3Macro(TopRight, int);\n\n vtkGetVector3Macro(TopRight, int);\n\n vtkSetVector3Macro(BottomLeft, int);\n\n vtkGetVector3Macro(BottomLeft, int);\n\n vtkSetVector3Macro(BottomRight, int);\n\n vtkGetVector3Macro(BottomRight, int);\n\n\n\n ///\n","file_path":"Modules/Scripted/EditorLib/Logic/vtkImageSlicePaint.h","rank":82,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLColorTableViewPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLColorTableViewPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLColorTableViewPlugin.h","rank":83,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLDisplayNodeWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLDisplayNodeWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n\n\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLDisplayNodeWidgetPlugin.h","rank":84,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLCaptureToolBarPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLCaptureToolBarPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLCaptureToolBarPlugin.h","rank":85,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLClipNodeWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLClipNodeWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n\n\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLClipNodeWidgetPlugin.h","rank":86,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLVolumeThresholdWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLVolumeThresholdWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n\n\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLVolumeThresholdWidgetPlugin.h","rank":87,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLSliceControllerWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLSliceControllerWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLSliceControllerWidgetPlugin.h","rank":88,"score":199181.9765651346},{"content":"/// VTK implementation of \\sa qSlicerDICOMLoadable\n\nclass VTK_SLICER_DICOMLIB_MODULE_LOGIC_EXPORT vtkSlicerDICOMLoadable : public vtkObject\n\n{\n\npublic:\n\n static vtkSlicerDICOMLoadable *New();\n\n vtkTypeMacro(vtkSlicerDICOMLoadable, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\npublic:\n\n vtkGetStringMacro(Name);\n\n vtkSetStringMacro(Name);\n\n\n\n vtkGetStringMacro(Tooltip);\n\n vtkSetStringMacro(Tooltip);\n\n\n\n vtkGetStringMacro(Warning);\n\n vtkSetStringMacro(Warning);\n\n\n\n vtkGetObjectMacro(Files, vtkStringArray);\n\n\n\n vtkGetMacro(Selected, bool);\n","file_path":"Modules/Scripted/DICOMLib/Logic/vtkSlicerDICOMLoadable.h","rank":89,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLColorListViewPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLColorListViewPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLColorListViewPlugin.h","rank":90,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLSliceInformationWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLSliceInformationWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLSliceInformationWidgetPlugin.h","rank":91,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLNodeComboBoxPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLNodeComboBoxPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLNodeComboBoxPlugin.h","rank":92,"score":199181.9765651346},{"content":"/// VTK implementation of \\sa qSlicerDICOMExportable\n\nclass VTK_SLICER_DICOMLIB_MODULE_LOGIC_EXPORT vtkSlicerDICOMExportable : public vtkObject\n\n{\n\npublic:\n\n static vtkSlicerDICOMExportable *New();\n\n vtkTypeMacro(vtkSlicerDICOMExportable, vtkObject);\n\n void PrintSelf(ostream& os, vtkIndent indent);\n\n\n\npublic:\n\n vtkGetStringMacro(Name);\n\n vtkSetStringMacro(Name);\n\n\n\n vtkGetStringMacro(Tooltip);\n\n vtkSetStringMacro(Tooltip);\n\n\n\n vtkGetStringMacro(NodeID);\n\n vtkSetStringMacro(NodeID);\n\n\n\n vtkGetStringMacro(PluginClass);\n\n vtkSetStringMacro(PluginClass);\n\n\n","file_path":"Modules/Scripted/DICOMLib/Logic/vtkSlicerDICOMExportable.h","rank":93,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLLinearTransformSliderPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLLinearTransformSliderPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLLinearTransformSliderPlugin.h","rank":94,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLSceneFactoryWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLSceneFactoryWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n};\n\n\n\n#endif\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLSceneFactoryWidgetPlugin.h","rank":95,"score":199181.9765651346},{"content":"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLWindowLevelWidgetPlugin : public QObject,\n\n public qMRMLWidgetsAbstractPlugin\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n qMRMLWindowLevelWidgetPlugin(QObject *_parent = 0);\n\n\n\n QWidget *createWidget(QWidget *_parent);\n\n QString domXml() const;\n\n QIcon icon() const;\n\n QString includeFile() const;\n\n bool isContainer() const;\n\n QString name() const;\n\n\n\n};\n\n\n\n#endif\n\n\n","file_path":"Libs/MRML/Widgets/DesignerPlugins/qMRMLWindowLevelWidgetPlugin.h","rank":96,"score":199181.9765651346},{"content":"class MRMLIDImageIO_EXPORT MRMLIDImageIOFactory : public ObjectFactoryBase\n\n{\n\npublic:\n\n /** Standard class typedefs. */\n\n typedef MRMLIDImageIOFactory Self;\n\n typedef ObjectFactoryBase Superclass;\n\n typedef SmartPointer<Self> Pointer;\n\n typedef SmartPointer<const Self> ConstPointer;\n\n\n\n /** Class methods used to interface with the registered factories. */\n\n virtual const char* GetITKSourceVersion(void) const ITK_OVERRIDE;\n\n virtual const char* GetDescription(void) const ITK_OVERRIDE;\n\n\n\n /** Method for class instantiation. */\n\n itkFactorylessNewMacro(Self);\n\n static MRMLIDImageIOFactory* FactoryNew() { return new MRMLIDImageIOFactory;}\n\n\n\n /** Run-time type information (and related methods). */\n\n itkTypeMacro(MRMLIDImageIOFactory, ObjectFactoryBase);\n\n\n","file_path":"Libs/MRML/IDImageIO/itkMRMLIDImageIOFactory.h","rank":97,"score":199181.9765651346},{"content":"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerAbstractModuleRepresentation : virtual public qSlicerObject\n\n{\n\npublic:\n\n\n\n typedef qSlicerObject Superclass;\n\n qSlicerAbstractModuleRepresentation();\n\n virtual ~qSlicerAbstractModuleRepresentation();\n\n\n\n /// Set/Get module name\n\n QString moduleName()const;\n\n\n\n /// Returns the module the representation belongs to.\n\n /// The module is set right before setup() is called.\n\n qSlicerAbstractCoreModule* module()const;\n\n\n\n /// Allows other modules to select input and output nodes in the module's GUI.\n\n /// There may be multiple node selectors in a module widget, you can select between them\n\n /// using the role argument.\n\n /// Context can be specified to make a selection within that node (for example, a markup list\n\n /// node may contain multiple markups; context can be used to select a specific item).\n","file_path":"Base/QTCore/qSlicerAbstractModuleRepresentation.h","rank":98,"score":197863.96431080392},{"content":"/// \\ingroup SlicerRt_QtModules_Segmentations\n\n/// \\class qSlicerSegmentEditorEffectFactory\n\n/// \\brief Singleton class managing segment editor effect plugins\n\nclass Q_SLICER_SEGMENTATIONS_EFFECTS_EXPORT qSlicerSegmentEditorEffectFactory : public QObject\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n /// Instance getter for the singleton class\n\n /// \\return Instance object\n\n Q_INVOKABLE static qSlicerSegmentEditorEffectFactory* instance();\n\n\n\n /// Allows cleanup of the singleton at application exit\n\n static void setInstance(qSlicerSegmentEditorEffectFactory* instance);\n\n\n\npublic:\n\n /// Register a effect\n\n /// \\return True if effect registered successfully, false otherwise\n\n Q_INVOKABLE bool registerEffect(qSlicerSegmentEditorAbstractEffect* effect);\n\n\n\n /// Get list of registered effects\n\n Q_INVOKABLE QList<qSlicerSegmentEditorAbstractEffect*> registeredEffects() { return m_RegisteredEffects; };\n\n\n","file_path":"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorEffectFactory.h","rank":99,"score":197067.47933379596}],"string":"[\n {\n \"content\": \"class DiffusionTensor3DTransform : public Object\\n\\n{\\n\\npublic:\\n\\n typedef TData DataType;\\n\\n typedef double TransformType;\\n\\n typedef DiffusionTensor3DTransform Self;\\n\\n typedef Point<TransformType, 3> PointType;\\n\\n typedef DiffusionTensor3D<DataType> TensorDataType;\\n\\n typedef DiffusionTensor3DExtended<DataType> InternalTensorDataType;\\n\\n typedef Matrix<TransformType, 3, 3> MatrixTransformType;\\n\\n typedef Matrix<DataType, 3, 3> MatrixDataType;\\n\\n typedef MatrixExtended<TransformType, 3, 3> InternalMatrixTransformType;\\n\\n typedef MatrixExtended<DataType, 3, 3> InternalMatrixDataType;\\n\\n typedef SmartPointer<Self> Pointer;\\n\\n typedef SmartPointer<const Self> ConstPointer;\\n\\n\\n\\n /** Run-time type information (and related methods). */\\n\\n itkTypeMacro(DiffusionTensor3DTransform, Object);\\n\\n\\n\\n // /Evaluate the position of the transformed tensor\\n\",\n \"file_path\": \"Modules/CLI/ResampleDTIVolume/itkDiffusionTensor3DTransform.h\",\n \"rank\": 0,\n \"score\": 261695.11366328096\n },\n {\n \"content\": \"class NewOtsuThresholdImageCalculator : public Object\\n\\n{\\n\\npublic:\\n\\n /** Standard class typedefs. */\\n\\n typedef NewOtsuThresholdImageCalculator Self;\\n\\n typedef Object Superclass;\\n\\n typedef SmartPointer<Self> Pointer;\\n\\n typedef SmartPointer<const Self> ConstPointer;\\n\\n\\n\\n /** Method for creation through the object factory. */\\n\\n itkNewMacro(Self);\\n\\n\\n\\n /** Run-time type information (and related methods). */\\n\\n itkTypeMacro(NewOtsuThresholdImageCalculator, Object);\\n\\n\\n\\n /** Type definition for the input image. */\\n\\n typedef TInputImage ImageType;\\n\\n\\n\\n /** Pointer type for the image. */\\n\\n typedef typename TInputImage::Pointer ImagePointer;\\n\",\n \"file_path\": \"Libs/vtkITK/itkNewOtsuThresholdImageCalculator.h\",\n \"rank\": 1,\n \"score\": 261695.11366328096\n },\n {\n \"content\": \"class DiffusionTensor3DWrite : public Object\\n\\n{\\n\\npublic:\\n\\n typedef TData DataType;\\n\\n typedef DiffusionTensor3DWrite Self;\\n\\n typedef DiffusionTensor3D<DataType> TensorDataType;\\n\\n typedef Image<TensorDataType, 3> DiffusionImageType;\\n\\n typedef MetaDataDictionary DictionaryType;\\n\\n typedef ImageFileWriter<DiffusionImageType> WriterType;\\n\\n typedef SmartPointer<Self> Pointer;\\n\\n typedef SmartPointer<const Self> ConstPointer;\\n\\n typedef std::vector<std::vector<double> > DoubleVectorType;\\n\\n typedef MetaDataObject<DoubleVectorType> MetaDataDoubleVectorType;\\n\\n typedef MetaDataObject<std::string> MetaDataIntType;\\n\\n\\n\\n /** Run-time type information (and related methods). */\\n\\n itkTypeMacro(DiffusionTensor3DWrite, Object);\\n\\n\\n\\n itkNewMacro( Self );\\n\\n // /Set input tensor image\\n\",\n \"file_path\": \"Modules/CLI/ResampleDTIVolume/itkDiffusionTensor3DWrite.h\",\n \"rank\": 2,\n \"score\": 261695.11366328096\n },\n {\n \"content\": \"class ImageToImageRegistrationHelper : public Object\\n\\n{\\n\\n\\n\\npublic:\\n\\n\\n\\n typedef ImageToImageRegistrationHelper Self;\\n\\n typedef Object Superclass;\\n\\n typedef SmartPointer<Self> Pointer;\\n\\n typedef SmartPointer<const Self> ConstPointer;\\n\\n\\n\\n itkTypeMacro( ImageToImageRegistrationHelper, Object );\\n\\n\\n\\n itkNewMacro( Self );\\n\\n\\n\\n //\\n\\n // Custom Typedefs\\n\\n //\\n\\n typedef TImage ImageType;\\n\\n\\n\\n typedef typename TImage::PixelType PixelType;\\n\",\n \"file_path\": \"Modules/CLI/ExpertAutomatedRegistration/ITKRegistrationHelper/itkImageToImageRegistrationHelper.h\",\n \"rank\": 3,\n \"score\": 254102.0637583048\n },\n {\n \"content\": \"class ImageRegionMomentsCalculator : public Object\\n\\n{\\n\\npublic:\\n\\n /** Standard class typedefs. */\\n\\n typedef ImageRegionMomentsCalculator<TImage> Self;\\n\\n typedef Object Superclass;\\n\\n typedef SmartPointer<Self> Pointer;\\n\\n typedef SmartPointer<const Self> ConstPointer;\\n\\n\\n\\n /** Method for creation through the object factory. */\\n\\n itkNewMacro(Self);\\n\\n\\n\\n /** Run-time type information (and related methods). */\\n\\n itkTypeMacro(ImageRegionMomentsCalculator, Object);\\n\\n\\n\\n /** Extract the dimension of the image. */\\n\\n itkStaticConstMacro(ImageDimension, unsigned int,\\n\\n TImage::ImageDimension);\\n\\n\\n\\n /** Standard scalar type within this class. */\\n\",\n \"file_path\": \"Modules/CLI/ExpertAutomatedRegistration/ITKRegistrationHelper/itkImageRegionMomentsCalculator.h\",\n \"rank\": 4,\n \"score\": 254102.0637583048\n },\n {\n \"content\": \"class qMRMLNodeObject : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n qMRMLNodeObject(vtkMRMLNode* node, QObject* parent = 0);\\n\\n\\n\\n void setProcessEvents(bool process);\\n\\n bool processEvents()const;\\n\\n\\n\\n void setMessage(const QString& message);\\n\\n QString message()const;\\n\\n\\n\\npublic slots:\\n\\n void modify();\\n\\n\\n\\nprotected:\\n\\n vtkMRMLNode* Node;\\n\\n bool ProcessEvents;\\n\\n QString Message;\\n\\n};\\n\",\n \"file_path\": \"Libs/MRML/Widgets/Testing/qMRMLNodeObject.h\",\n \"rank\": 5,\n \"score\": 250459.06919927883\n },\n {\n \"content\": \"class ITK_ABI_EXPORT DiffusionTensor3DRead : public Object\\n\\n{\\n\\npublic:\\n\\n typedef TData DataType;\\n\\n typedef DiffusionTensor3DRead Self;\\n\\n typedef Matrix<double, 3, 3> MatrixType;\\n\\n typedef DiffusionTensor3D<DataType> TensorDataType;\\n\\n typedef Image<TensorDataType, 3> DiffusionImageType;\\n\\n typedef typename DiffusionImageType::Pointer DiffusionImagePointer;\\n\\n typedef ImageFileReader<DiffusionImageType> FileReaderType;\\n\\n typedef MetaDataDictionary DictionaryType;\\n\\n typedef MetaDataObject<std::string> MetaDataStringType;\\n\\n typedef std::vector<std::vector<double> > DoubleVectorType;\\n\\n typedef MetaDataObject<DoubleVectorType> MetaDataDoubleVectorType;\\n\\n typedef SmartPointer<Self> Pointer;\\n\\n typedef SmartPointer<const Self> ConstPointer;\\n\\n\\n\\n /** Run-time type information (and related methods). */\\n\\n itkTypeMacro(DiffusionTensor3DRead, Object);\\n\\n\\n\",\n \"file_path\": \"Modules/CLI/ResampleDTIVolume/itkDiffusionTensor3DRead.h\",\n \"rank\": 6,\n \"score\": 243622.60366305686\n },\n {\n \"content\": \"class qMRMLNodeObject : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n qMRMLNodeObject(vtkMRMLNode* node, QObject* parent = 0);\\n\\n\\n\\npublic slots:\\n\\n void modifyNode();\\n\\n};\\n\",\n \"file_path\": \"Libs/MRML/Widgets/Testing/qMRMLSliceWidgetTest1Helper.h\",\n \"rank\": 7,\n \"score\": 238079.21085132007\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qMRMLTableViewPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLTableView);\\n\\nprotected:\\n\\n qMRMLTableView* const q_ptr;\\n\\npublic:\\n\\n qMRMLTableViewPrivate(qMRMLTableView& object);\\n\\n ~qMRMLTableViewPrivate();\\n\\n\\n\\n virtual void init();\\n\\n\\n\\n void setMRMLScene(vtkMRMLScene* scene);\\n\\n vtkMRMLScene *mrmlScene();\\n\\n\\n\\n bool verifyTableModelAndNode(const char* methodName) const;\\n\\n\\n\\npublic slots:\\n\\n /// Handle MRML scene event\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLTableView_p.h\",\n \"rank\": 8,\n \"score\": 228989.2311868862\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qMRMLSliceViewPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLSliceView);\\n\\nprotected:\\n\\n qMRMLSliceView* const q_ptr;\\n\\npublic:\\n\\n qMRMLSliceViewPrivate(qMRMLSliceView& object);\\n\\n ~qMRMLSliceViewPrivate();\\n\\n\\n\\n virtual void init();\\n\\n\\n\\n void setMRMLScene(vtkMRMLScene* scene);\\n\\n\\n\\npublic slots:\\n\\n /// Handle MRML scene event\\n\\n void onSceneStartProcessing();\\n\\n void onSceneEndProcessing();\\n\\n\\n\\n void updateWidgetFromMRML();\\n\\n\\n\\nprotected:\\n\\n void initDisplayableManagers();\\n\\n\\n\\n vtkMRMLDisplayableManagerGroup* DisplayableManagerGroup;\\n\\n vtkMRMLScene* MRMLScene;\\n\\n vtkMRMLSliceNode* MRMLSliceNode;\\n\\n QColor InactiveBoxColor;\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLSliceView_p.h\",\n \"rank\": 9,\n \"score\": 228989.2311868862\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qMRMLChartViewPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLChartView);\\n\\nprotected:\\n\\n qMRMLChartView* const q_ptr;\\n\\npublic:\\n\\n qMRMLChartViewPrivate(qMRMLChartView& object);\\n\\n ~qMRMLChartViewPrivate();\\n\\n\\n\\n virtual void init();\\n\\n\\n\\n void setMRMLScene(vtkMRMLScene* scene);\\n\\n vtkMRMLScene *mrmlScene();\\n\\n\\n\\npublic slots:\\n\\n /// Handle MRML scene event\\n\\n void startProcessing();\\n\\n void endProcessing();\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLChartView_p.h\",\n \"rank\": 10,\n \"score\": 228989.2311868862\n },\n {\n \"content\": \"// -----------------------------------------------------------------------------\\n\\nclass qMRMLVolumeWidgetPrivate : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLVolumeWidget);\\n\\nprotected:\\n\\n qMRMLVolumeWidget* const q_ptr;\\n\\n\\n\\npublic:\\n\\n qMRMLVolumeWidgetPrivate(qMRMLVolumeWidget& object);\\n\\n virtual ~qMRMLVolumeWidgetPrivate();\\n\\n\\n\\n virtual void init();\\n\\n\\n\\n /// Update the range and single step of the input GUI elements such as\\n\\n /// sliders and spinboxes.\\n\\n void updateRangeForVolumeDisplayNode(vtkMRMLScalarVolumeDisplayNode*);\\n\\n /// Block all the signals emitted by the widgets that are impacted by the\\n\\n /// range.\\n\\n /// To be reimplemented in subclasses\\n\\n virtual bool blockSignals(bool block);\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLVolumeWidget_p.h\",\n \"rank\": 11,\n \"score\": 228989.2311868862\n },\n {\n \"content\": \"//------------------------------------------------------------------------------\\n\\nclass qMRMLEventLoggerPrivate: public QObject\\n\\n{\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLEventLogger);\\n\\nprotected:\\n\\n qMRMLEventLogger* const q_ptr;\\n\\npublic:\\n\\n qMRMLEventLoggerPrivate(qMRMLEventLogger& object);\\n\\n typedef QObject Superclass;\\n\\n\\n\\n void init();\\n\\n\\n\\n void setMRMLScene(vtkMRMLScene* scene);\\n\\n\\n\\nprivate:\\n\\n vtkWeakPointer<vtkMRMLScene> MRMLScene;\\n\\n\\n\\n QList<QString> EventToListen;\\n\\n QHash<QString, QString> EventNameToConnectionIdMap;\\n\\n\\n\\n bool ConsoleOutputEnabled;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLEventLogger_p.h\",\n \"rank\": 12,\n \"score\": 228989.2311868862\n },\n {\n \"content\": \"class qSlicerViewersToolBarPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qSlicerViewersToolBar);\\n\\n\\n\\nprotected:\\n\\n qSlicerViewersToolBar* const q_ptr;\\n\\n\\n\\npublic:\\n\\n qSlicerViewersToolBarPrivate(qSlicerViewersToolBar& object);\\n\\n\\n\\n void init();\\n\\n void setMRMLScene(vtkMRMLScene* newScene);\\n\\n void updateWidgetFromMRML();\\n\\n\\n\\npublic slots:\\n\\n\\n\\n void OnMRMLSceneStartClose();\\n\\n void OnMRMLSceneEndImport();\\n\",\n \"file_path\": \"Base/QTGUI/qSlicerViewersToolBar_p.h\",\n \"rank\": 13,\n \"score\": 226042.28118664637\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qSlicerCLIModuleWidgetPrivate: public QObject,\\n\\n public Ui_qSlicerCLIModuleWidget\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_DECLARE_PUBLIC(qSlicerCLIModuleWidget);\\n\\nprotected:\\n\\n qSlicerCLIModuleWidget* const q_ptr;\\n\\npublic:\\n\\n typedef qSlicerCLIModuleWidgetPrivate Self;\\n\\n qSlicerCLIModuleWidgetPrivate(qSlicerCLIModuleWidget& object);\\n\\n\\n\\n ///\\n\\n /// Convenient function to cast vtkSlicerLogic into vtkSlicerCLIModuleLogic\\n\\n vtkSlicerCLIModuleLogic* logic()const;\\n\\n\\n\\n ///\\n\\n /// Convenient function to cast vtkMRMLNode into vtkMRMLCommandLineModuleNode\\n\\n vtkMRMLCommandLineModuleNode* commandLineModuleNode()const;\\n\\n\\n\\n /// Convenient method to cast qSlicerAbstractModule into qSlicerCLIModule\\n\",\n \"file_path\": \"Base/QTCLI/qSlicerCLIModuleWidget_p.h\",\n \"rank\": 14,\n \"score\": 226042.28118664637\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qMRMLSceneViewMenuPrivate : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLSceneViewMenu);\\n\\nprotected:\\n\\n qMRMLSceneViewMenu* const q_ptr;\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n qMRMLSceneViewMenuPrivate(qMRMLSceneViewMenu& object);\\n\\n\\n\\n /// \\\\brief Clear and update menu given the list of existing vtkMRMLSceneViewNode\\n\\n /// associated with the current scene\\n\\n void resetMenu();\\n\\n\\n\\npublic slots:\\n\\n\\n\\n void onMRMLNodeAdded(vtkObject* mrmlScene, vtkObject * mrmlNode);\\n\\n\\n\\n /// Add menu entry corresponding to \\\\a sceneViewNode\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLSceneViewMenu_p.h\",\n \"rank\": 15,\n \"score\": 223208.94362983707\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qMRMLExpandingWebViewPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLExpandingWebView);\\n\\nprotected:\\n\\n qMRMLExpandingWebView* const q_ptr;\\n\\npublic:\\n\\n qMRMLExpandingWebViewPrivate(qMRMLExpandingWebView& object);\\n\\n ~qMRMLExpandingWebViewPrivate();\\n\\n\\n\\n virtual void init();\\n\\n\\n\\n void setMRMLScene(vtkMRMLScene* scene);\\n\\n vtkMRMLScene *mrmlScene();\\n\\n\\n\\npublic slots:\\n\\n /// Handle MRML scene events\\n\\n void startProcessing();\\n\\n void endProcessing();\\n\\n\\n\\nprotected:\\n\\n\\n\\n vtkMRMLScene* MRMLScene;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLExpandingWebView_p.h\",\n \"rank\": 16,\n \"score\": 223208.94362983707\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qMRMLThreeDViewPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLThreeDView);\\n\\nprotected:\\n\\n qMRMLThreeDView* const q_ptr;\\n\\npublic:\\n\\n qMRMLThreeDViewPrivate(qMRMLThreeDView& object);\\n\\n ~qMRMLThreeDViewPrivate();\\n\\n\\n\\n virtual void init();\\n\\n\\n\\n void setMRMLScene(vtkMRMLScene* scene);\\n\\n\\n\\n /// Loop over all CameraNode from the scene and return the one having\\n\\n /// its activeTag matching \\\\a viewNode ID\\n\\n// vtkMRMLCameraNode* lookUpMRMLCameraNode(vtkMRMLViewNode* viewNode);\\n\\n\\n\\npublic slots:\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLThreeDView_p.h\",\n \"rank\": 17,\n \"score\": 223208.94362983707\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qMRMLSliceInformationWidgetPrivate: public QObject,\\n\\n public Ui_qMRMLSliceInformationWidget\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLSliceInformationWidget);\\n\\nprotected:\\n\\n qMRMLSliceInformationWidget* const q_ptr;\\n\\npublic:\\n\\n qMRMLSliceInformationWidgetPrivate(qMRMLSliceInformationWidget& object);\\n\\n ~qMRMLSliceInformationWidgetPrivate();\\n\\n\\n\\n void setupUi(qMRMLWidget* widget);\\n\\n\\n\\npublic slots:\\n\\n /// Update widget state using the associated MRML slice node\\n\\n void updateWidgetFromMRMLSliceNode();\\n\\n\\n\\n\\n\\n\\n\\npublic:\\n\\n vtkMRMLSliceNode* MRMLSliceNode;\\n\\n QButtonGroup* SliceSpacingModeGroup;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLSliceInformationWidget_p.h\",\n \"rank\": 18,\n \"score\": 223208.94362983707\n },\n {\n \"content\": \"class Q_SLICER_BASE_QTGUI_EXPORT qSlicerWidget : public QWidget, public virtual qSlicerObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\npublic:\\n\\n qSlicerWidget(QWidget *parent=0, Qt::WindowFlags f=0);\\n\\n virtual ~qSlicerWidget();\\n\\n\\n\\npublic slots:\\n\\n virtual void setMRMLScene(vtkMRMLScene* scene);\\n\\n\\n\\nsignals:\\n\\n void mrmlSceneChanged(vtkMRMLScene*);\\n\\n\\n\\nprotected:\\n\\n QScopedPointer<qSlicerWidgetPrivate> d_ptr;\\n\\n\\n\\nprivate:\\n\\n Q_DECLARE_PRIVATE(qSlicerWidget);\\n\\n Q_DISABLE_COPY(qSlicerWidget);\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Base/QTGUI/qSlicerWidget.h\",\n \"rank\": 19,\n \"score\": 223074.94899856334\n },\n {\n \"content\": \"/// \\\\brief Stores information about the relationship between a Subject and an Observer.\\n\\n///\\n\\n/// The Observation is a record of\\n\\n/// - a subject (vtkObject)\\n\\n/// - an event type (unsigned long)\\n\\n/// - an objserver (vtkObject)\\n\\n/// - a callback (vtkCallbackCommand)\\n\\n/// - optional comment strings\\n\\n/// This class can be used by the vtkEventBroker to keep track of the registered observers\\n\\n/// that it manages, and it can be used by the event queue to keep track of which\\n\\n/// events have been triggered so it can invoke them later\\n\\n//\\n\\n/// \\\\note This class does not add or remove observers itself; it just keeps track of them\\n\\n/// for the event broker.\\n\\nclass VTK_MRML_EXPORT vtkObservation : public vtkObject\\n\\n{\\n\\n public:\\n\\n\\n\\n /// The Usual vtk class functions\\n\\n static vtkObservation *New();\\n\\n vtkTypeMacro(vtkObservation,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n ///\\n\\n /// Accessors\\n\\n /// - note that AssignObject methods do not register the pointers\\n\\n /// - it is assumed that the EventBroker will attach DeleteEvent\\n\\n /// observers to these objects and will thereby know when they\\n\\n /// are no longer valid\\n\\n virtual void SetEventBroker(vtkEventBroker* eventBroker);\\n\\n vtkGetObjectMacro (EventBroker, vtkEventBroker);\\n\\n vtkGetMacro (InEventQueue, int);\\n\\n vtkSetMacro (InEventQueue, int);\\n\\n vtkGetObjectMacro (ObservationCallbackCommand, vtkCallbackCommand);\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkObservation.h\",\n \"rank\": 20,\n \"score\": 222112.2346212237\n },\n {\n \"content\": \"class QMRML_WIDGETS_EXPORT qMRMLUtils : public QObject\\n\\n{\\n\\n Q_OBJECT;\\n\\npublic:\\n\\n typedef qMRMLUtils Self;\\n\\n qMRMLUtils(QObject* parent = 0);\\n\\n virtual ~qMRMLUtils();\\n\\n\\n\\n ///\\n\\n /// Convert a vtkMatrix to a QVector\\n\\n Q_INVOKABLE static void vtkMatrixToQVector(vtkMatrix4x4* matrix, QVector<double> & vector);\\n\\n\\n\\n ///\\n\\n Q_INVOKABLE static void getTransformInCoordinateSystem(vtkMRMLNode* transformNode, bool global,\\n\\n vtkTransform* transform);\\n\\n Q_INVOKABLE static void getTransformInCoordinateSystem(vtkMRMLTransformNode* transformNode,\\n\\n bool global, vtkTransform* transform);\\n\\n\\n\\n /// Retrieve the number of visible view node associated with \\\\a scene\\n\\n Q_INVOKABLE static int countVisibleViewNode(vtkMRMLScene* scene);\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLUtils.h\",\n \"rank\": 21,\n \"score\": 222100.75030607326\n },\n {\n \"content\": \"class qSlicerMouseModeToolBarPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n QVTK_OBJECT\\n\\n Q_DECLARE_PUBLIC(qSlicerMouseModeToolBar);\\n\\n\\n\\nprotected:\\n\\n qSlicerMouseModeToolBar* const q_ptr;\\n\\n\\n\\npublic:\\n\\n qSlicerMouseModeToolBarPrivate(qSlicerMouseModeToolBar& object);\\n\\n\\n\\n void init();\\n\\n void setMRMLScene(vtkMRMLScene* newScene);\\n\\n void updateWidgetFromMRML();\\n\\n /// given an place node class name, find the action associated with it and set it\\n\\n /// checked, update the cursor, update the icon on the button\\n\\n void updateWidgetToPlace(const char *placeNodeClassName);\\n\\n\\n\\npublic slots:\\n\",\n \"file_path\": \"Base/QTGUI/qSlicerMouseModeToolBar_p.h\",\n \"rank\": 22,\n \"score\": 220482.77269345452\n },\n {\n \"content\": \"class qSlicerBaseQTGUIPythonQtDecorators : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n\\n\\n qSlicerBaseQTGUIPythonQtDecorators()\\n\\n {\\n\\n PythonQt::self()->registerClass(&qSlicerAbstractModuleWidget::staticMetaObject);\\n\\n PythonQt::self()->registerClass(&qSlicerPythonManager::staticMetaObject);\\n\\n PythonQt::self()->registerClass(&qSlicerCommandOptions::staticMetaObject);\\n\\n#ifdef Slicer_USE_QtTesting\\n\\n PythonQt::self()->registerClass(&ctkQtTestingUtility::staticMetaObject);\\n\\n#endif\\n\\n PythonQt::self()->registerClass(&ctkErrorLogModel::staticMetaObject);\\n\\n PythonQt::self()->registerClass(&ctkErrorLogTerminalOutput::staticMetaObject);\\n\\n // Note: Use registerCPPClassForPythonQt to register pure Cpp classes\\n\\n }\\n\\n\\n\\npublic slots:\\n\",\n \"file_path\": \"Base/QTGUI/qSlicerBaseQTGUIPythonQtDecorators.h\",\n \"rank\": 23,\n \"score\": 217857.80111078295\n },\n {\n \"content\": \"/// \\\\brief Class that manages adding and deleting of observers with events.\\n\\n///\\n\\n/// Class that manages adding and deleting of obserevers with events\\n\\n/// This class keeps track of obserevers and events added to each vtk object.\\n\\n/// It caches tags returned by AddObserver method so that observers can be removed properly.\\n\\nclass VTK_MRML_EXPORT vtkMRMLLogic : public vtkObject\\n\\n{\\n\\npublic:\\n\\n /// The Usual vtk class functions\\n\\n static vtkMRMLLogic *New();\\n\\n vtkTypeMacro(vtkMRMLLogic,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent){ this->Superclass::PrintSelf(os, indent); }\\n\\n\\n\\n vtkMRMLScene* GetScene() {return this->Scene;};\\n\\n void SetScene(vtkMRMLScene* scene) {this->Scene = scene;};\\n\\n\\n\\n void RemoveUnreferencedStorageNodes();\\n\\n\\n\\n void RemoveUnreferencedDisplayNodes();\\n\\n\\n\\n /// Get application home directory.\\n\\n /// The path is retrieved from the environment variable defined by MRML_APPLICATION_HOME_DIR_ENV.\\n\\n static std::string GetApplicationHomeDirectory();\\n\\n\\n\\n /// Get application share subdirectory.\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkMRMLLogic.h\",\n \"rank\": 24,\n \"score\": 216332.56924320714\n },\n {\n \"content\": \"/// \\\\brief Manages adding and deleting of obserevers with events.\\n\\n///\\n\\n/// Class that manages adding and deleting of obserevers with events\\n\\n/// This class keeps track of obserevers and events added to each vtk object\\n\\n/// it caches tags returned by AddObserver method so that obserevers can be removed properly.\\n\\nclass VTK_MRML_EXPORT vtkObserverManager : public vtkObject\\n\\n{\\n\\n public:\\n\\n\\n\\n /// The Usual vtk class functions\\n\\n static vtkObserverManager *New();\\n\\n vtkTypeMacro(vtkObserverManager,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// set vtkObject to a specified pointer and remove all observers for all events\\n\\n void SetObject(vtkObject **nodePtr, vtkObject *node);\\n\\n\\n\\n /// set vtkObject to a specified pointer, remove all observers for all events, add observer for Modify event\\n\\n void SetAndObserveObject(vtkObject **nodePtr, vtkObject *node, float priority=0.0, bool logWarningIfSameObservationExists=true);\\n\\n\\n\\n /// set vtkObject to a specified pointer, remove all observers for all events, add observers for specified events\\n\\n void SetAndObserveObjectEvents(vtkObject **nodePtr, vtkObject *node, vtkIntArray *events, vtkFloatArray *priorities=0, bool logWarningIfSameObservationExists=true);\\n\\n\\n\\n /// remove all observers for all events\\n\\n void RemoveObjectEvents(vtkObject *nodePtr);\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkObserverManager.h\",\n \"rank\": 25,\n \"score\": 216332.0530152082\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\n/// \\\\brief This class encapsulates a segment that is part of a segmentation\\n\\n/// \\\\details\\n\\n/// A \\\\sa vtkSegmentation can contain multiple segments (this class) each of which represent\\n\\n/// one anatomical or other structure (in labelmap terms, a \\\"label\\\"). Each segmentation can\\n\\n/// contain the structure in multiple representations.\\n\\n/// Default representation types include Binary labelmap and Closed surface, but additional\\n\\n/// custom representations can be added (see description of \\\\sa vtkSegmentation).\\n\\n/// \\n\\nclass vtkSegmentationCore_EXPORT vtkSegment : public vtkObject\\n\\n{\\n\\n typedef std::map<std::string, vtkSmartPointer<vtkDataObject> > RepresentationMap;\\n\\n\\n\\npublic:\\n\\n static const double SEGMENT_COLOR_VALUE_INVALID[4];\\n\\n\\n\\n static vtkSegment* New();\\n\\n vtkTypeMacro(vtkSegment, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// Set attributes from name/value pairs\\n\\n virtual void ReadXMLAttributes(const char** atts);\\n\\n\\n\\n /// Write this object's information to a MRML file in XML format.\\n\\n void WriteXML(ostream& of, int nIndent);\\n\\n\\n\\n /// Deep copy one segment into another\\n\\n virtual void DeepCopy(vtkSegment* source);\\n\\n\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkSegment.h\",\n \"rank\": 26,\n \"score\": 216330.8729272122\n },\n {\n \"content\": \"/// \\\\brief A set of MRML Nodes that supports serialization and undo/redo.\\n\\n///\\n\\n/// vtkMRMLScene represents and provides methods to manipulate a list of\\n\\n/// MRML objects. The list is core and duplicate entries are not prevented.\\n\\n//\\n\\n/// \\\\sa vtkMRMLNode\\n\\n/// \\\\sa vtkCollection\\n\\nclass VTK_MRML_EXPORT vtkMRMLScene : public vtkObject\\n\\n{\\n\\n ///\\n\\n /// make the vtkMRMLSceneViewNode a friend since it has internal vtkMRMLScene\\n\\n /// so that it can call protected methods, for example UpdateNodeIDs()\\n\\n /// but that's the only class that is allowed to do so\\n\\n friend class vtkMRMLSceneViewNode;\\n\\n\\n\\npublic:\\n\\n static vtkMRMLScene *New();\\n\\n vtkTypeMacro(vtkMRMLScene, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// Set URL (file name) of the scene\\n\\n void SetURL(const char *url);\\n\\n\\n\\n /// Get URL (file name) of the scene\\n\\n const char *GetURL();\\n\\n\\n\\n /// Set Root directory, where URL is pointing\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkMRMLScene.h\",\n \"rank\": 27,\n \"score\": 216330.63196961692\n },\n {\n \"content\": \"/// \\\\brief Class that manages adding and deleting of observers with events.\\n\\n///\\n\\n/// This class keeps track of observers and events added to each vtk object.\\n\\n/// It caches tags returned by AddObserver method so that observers can be\\n\\n/// removed properly.\\n\\n/// See also:\\n\\n/// http://wiki.na-mic.org/Wiki/index.php/Slicer3:EventBroker\\n\\n/// http://en.wikipedia.org/wiki/Observer_pattern\\n\\n//\\n\\n/// Other interesting observer implementations:\\n\\n/// http://xlobject.sourceforge\\n\\n/// http://sigslot.sourceforge.net/\\n\\n/// http://doc.trolltech.com/4.3/signalsandslots.html\\n\\nclass VTK_MRML_EXPORT vtkEventBroker : public vtkObject\\n\\n{\\n\\npublic:\\n\\n vtkTypeMacro(vtkEventBroker, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n typedef std::set< vtkObservation * > ObservationVector;\\n\\n\\n\\n ///\\n\\n /// Return the singleton instance with no reference counting.\\n\\n static vtkEventBroker* GetInstance();\\n\\n\\n\\n ///\\n\\n /// This is a singleton pattern New. There will only be ONE\\n\\n /// reference to a vtkEventBroker object per process. Clients that\\n\\n /// call this must call Delete on the object so that the reference\\n\\n /// counting will work. The single instance will be unreferenced when\\n\\n /// the program exits.\\n\\n static vtkEventBroker* New();\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkEventBroker.h\",\n \"rank\": 28,\n \"score\": 216330.34804460904\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\n/// \\\\brief This class encapsulates a segmentation that can contain multiple segments and multiple representations for each segment\\n\\n/// \\\\details\\n\\n/// The primary purpose of this class is to serve as a container to store the segments (in labelmap analogy the \\\"labels\\\").\\n\\n/// Also provides generic functions on the segmentation level. Performs conversion to a specified representation, extracts\\n\\n/// geometry information etc.\\n\\n/// \\n\\n/// Main points to remember:\\n\\n/// * Each segment has the same set of representations. This means that if segments are copied/moved between segmentations,\\n\\n/// then conversion will take place if possible (if not then copy will fail)\\n\\n/// * Default representations types are\\n\\n/// * Binary labelmap (vtkOrientedImageData)\\n\\n/// * Closed surface (vtkPolyData)\\n\\n/// * Additional representations can be defined (SlicerRT adds three: Planar contour, Fractional labelmap, Ribbon model)\\n\\n/// * Conversion between representations are driven by a conversion graph in which the nodes are the representations and the edges\\n\\n/// are conversion rules\\n\\n/// * When converting with the default method (\\\\sa CreateRepresentation without specifying a path), then the path with the lowest\\n\\n/// cost is used (rules have a cost field that gives a ballpark value for the conversion cost)\\n\\n/// * Representation types can be defined by registering conversion algorithms (rules) that specify their source and target\\n\\n/// representations, and an estimated cost metric\\n\\n/// * Master representation\\n\\n/// * Privileged representation type. Can be any of the available representations, but usually it's the original representation\\n\\n/// of the data (binary labelmap for editing, binary or fractional labelmap for DICOM SEG, planar contour for DICOM RT, etc.)\\n\\n/// * Using the proper master representation ensures that no information is lost, which is crucial to avoid discrepancies that can\\n\\n/// never be solved when data is permanently lost in conversion\\n\\n/// * Properties\\n\\n/// * All conversions use it as source (up-to-date representations along conversion path are used if available)\\n\\n/// * When changed all other representations are invalidated (and is re-converted later from master)\\n\\n/// * It is the representation that is saved to disk\\n\\n/// \\n\\n/// Schematic illustration of the segmentation container:\\n\\n/// \\n\\n/// +=============================================+\\n\\n/// | Patient (vtkSegmentation) |\\n\\n/// +======================+======================+\\n\\n/// | Brain (vtkSegment) | Tumor (vtkSegment) |\\n\\n/// +======================+======================+\\n\\n/// Binary labelmap | vtkOrientedImageData | vtkOrientedImageData |\\n\\n/// +----------------------+----------------------+\\n\\n/// Closed surface | vtkPolyData | vtkPolyData |\\n\\n/// +----------------------+----------------------+\\n\\n/// Custom representation | vtkDataObject | vtkDataObject |\\n\\n/// +----------------------+----------------------+\\n\\n/// \\n\\nclass vtkSegmentationCore_EXPORT vtkSegmentation : public vtkObject\\n\\n{\\n\\npublic:\\n\\n enum\\n\\n {\\n\\n /// Invoked when content of the master representation in a segment is changed.\\n\\n MasterRepresentationModified = 62100,\\n\\n /// Invoked when content of any representation (including the master representation) in a segment is changed.\\n\\n RepresentationModified,\\n\\n /// Invoked if new segment is added\\n\\n SegmentAdded,\\n\\n /// Invoked if a segment is removed\\n\\n SegmentRemoved,\\n\\n /// Invoked if a segment is modified (name changed, tags changed, etc).\\n\\n /// Note: the event is not invoked when content of a representation in a segment is changed.\\n\\n SegmentModified,\\n\\n /// Invoked if a representation is created or removed in the segments (e.g., created by conversion from master).\\n\\n ContainedRepresentationNamesModified\\n\\n };\\n\\n\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkSegmentation.h\",\n \"rank\": 29,\n \"score\": 216329.27325755273\n },\n {\n \"content\": \"/// \\\\brief Abstract Superclass for all specific types of MRML nodes.\\n\\n///\\n\\n/// This node encapsulates the functionality common to all types of MRML nodes.\\n\\n/// This includes member variables for ID, Description, and Options,\\n\\n/// as well as member functions to Copy() and Write().\\n\\nclass VTK_MRML_EXPORT vtkMRMLNode : public vtkObject\\n\\n{\\n\\n /// make the vtkMRMLScene a friend so that AddNodeNoNotify can call\\n\\n /// SetID, but that's the only class that is allowed to do so\\n\\n friend class vtkMRMLScene;\\n\\n friend class vtkMRMLSceneViewNode;\\n\\n\\n\\npublic:\\n\\n vtkTypeMacro(vtkMRMLNode,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// \\\\brief Create instance of the default node. Like New only virtual.\\n\\n ///\\n\\n /// \\\\note Subclasses should implement this method\\n\\n virtual vtkMRMLNode* CreateNodeInstance() = 0;\\n\\n\\n\\n /// Set node attributes\\n\\n ///\\n\\n /// \\\\note\\n\\n /// Subclasses should implement this method.\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkMRMLNode.h\",\n \"rank\": 30,\n \"score\": 216325.71785453238\n },\n {\n \"content\": \"/// \\\\brief MRML object to represent a 3D point.\\n\\n///\\n\\n/// \\\\deprecated Used for backward compatibility for Slicer3 fiducial lists, please use the Annotation Module MRML nodes\\n\\n/// \\\\sa vtkMRMLAnnotationNode, vtkMRMLAnnotationFiducialNode\\n\\nclass VTK_MRML_EXPORT vtkMRMLFiducial : public vtkObject\\n\\n{\\n\\npublic:\\n\\n /// \\\\deprecated Used for backward compatibility for Slicer3 fiducial lists, please use the Annotation Module MRML nodes\\n\\n /// \\\\sa vtkMRMLAnnotationNode, vtkMRMLAnnotationFiducialNode\\n\\n ///\\n\\n static vtkMRMLFiducial *New();\\n\\n vtkTypeMacro(vtkMRMLFiducial,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n //--------------------------------------------------------------------------\\n\\n /// MRML methods\\n\\n //--------------------------------------------------------------------------\\n\\n\\n\\n ///\\n\\n /// Set node attributes\\n\\n virtual void ReadXMLAttributes( const char** atts);\\n\\n\\n\\n ///\\n\\n /// Set node attributes from an unparsed string of keys and values\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkMRMLFiducial.h\",\n \"rank\": 31,\n \"score\": 216325.64656575897\n },\n {\n \"content\": \"/// Node factory that can be used by qMRML widgets to easily create nodes\\n\\n/// If you want more control over the node creation, you can add attributes,\\n\\n/// specify a base node name or connect to signals to customize the node\\n\\nclass QMRML_WIDGETS_EXPORT qMRMLNodeFactory : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n\\n\\n /// Convenient typedef\\n\\n typedef QHash<QString,QString> AttributeType;\\n\\n\\n\\n /// Constructors\\n\\n typedef QObject Superclass;\\n\\n explicit qMRMLNodeFactory(QObject* parent = 0);\\n\\n virtual ~qMRMLNodeFactory();\\n\\n\\n\\n /// Get MRML scene.\\n\\n /// By default, there is no scene.\\n\\n vtkMRMLScene* mrmlScene()const;\\n\\n\\n\\n ///\\n\\n /// Create and add a node given its \\\\a className to the scene associated\\n\\n /// with the factory. The function will fire the signals:\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLNodeFactory.h\",\n \"rank\": 32,\n \"score\": 216320.46274902415\n },\n {\n \"content\": \"class VTK_MRML_EXPORT vtkCacheManager : public vtkObject\\n\\n{\\n\\n public:\\n\\n\\n\\n /// The Usual vtk class functions\\n\\n static vtkCacheManager *New();\\n\\n vtkTypeMacro(vtkCacheManager, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n vtkGetMacro (InsufficientFreeBufferNotificationFlag, int );\\n\\n vtkSetMacro (InsufficientFreeBufferNotificationFlag, int );\\n\\n\\n\\n ///\\n\\n /// Sets the name of the directory to use for local file caching\\n\\n /// Does some checking to make sure this is a valid directory\\n\\n /// on the local system. Makes sure there's NO \\\"/\\\" at the end\\n\\n /// of the string, or kwsys/SystemTools will not see as a valid dir.\\n\\n virtual void SetRemoteCacheDirectory (const char *dir );\\n\\n\\n\\n ///\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkCacheManager.h\",\n \"rank\": 33,\n \"score\": 216320.46274902415\n },\n {\n \"content\": \"class QMRML_WIDGETS_EXPORT qMRMLEventLogger: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n explicit qMRMLEventLogger(QObject* parent = 0);\\n\\n virtual ~qMRMLEventLogger();\\n\\n\\n\\n ///\\n\\n /// Set the MRML \\\\a scene that should be listened for events\\n\\n void setMRMLScene(vtkMRMLScene* scene);\\n\\n\\n\\n ///\\n\\n /// Return true if the corresponding event if listened by the eventLogger\\n\\n bool listeningNodeAddedEvent();\\n\\n bool listeningNodeRemovedEvent();\\n\\n bool listeningNewSceneEvent();\\n\\n bool listeningSceneClosedEvent();\\n\\n bool listeningSceneAboutToBeClosedEvent();\\n\\n bool listeningMetadataAddedEvent();\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLEventLogger.h\",\n \"rank\": 34,\n \"score\": 216320.46274902415\n },\n {\n \"content\": \"class VTK_MRML_EXPORT vtkURIHandler : public vtkObject\\n\\n{\\n\\npublic:\\n\\n /// The Usual vtk class functions\\n\\n //static vtkURIHandler *New() { return NULL; };\\n\\n static vtkURIHandler *New();\\n\\n vtkTypeMacro(vtkURIHandler, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n vtkGetStringMacro (HostName);\\n\\n vtkSetStringMacro (HostName);\\n\\n\\n\\n ///\\n\\n /// virtual methods to be defined in subclasses.\\n\\n /// (Maybe these should be defined to handle default file operations)\\n\\n virtual void StageFileRead ( const char *source, const char * destination );\\n\\n virtual void StageFileWrite ( const char *source, const char * destination );\\n\\n\\n\\n ///\\n\\n /// various Read/Write method footprints useful to redefine in specific handlers.\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkURIHandler.h\",\n \"rank\": 35,\n \"score\": 216320.46274902415\n },\n {\n \"content\": \"class VTK_MRML_EXPORT vtkDataTransfer : public vtkObject\\n\\n{\\n\\n public:\\n\\n\\n\\n /// The Usual vtk class functions\\n\\n static vtkDataTransfer *New();\\n\\n vtkTypeMacro(vtkDataTransfer, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n vtkGetStringMacro ( SourceURI );\\n\\n vtkSetStringMacro ( SourceURI );\\n\\n vtkGetStringMacro ( DestinationURI );\\n\\n vtkSetStringMacro ( DestinationURI );\\n\\n vtkGetObjectMacro ( Handler, vtkURIHandler );\\n\\n virtual void SetHandler(vtkURIHandler* uriHandler);\\n\\n vtkGetMacro ( TransferType, int );\\n\\n vtkSetMacro ( TransferType, int );\\n\\n vtkGetMacro ( TransferID, int );\\n\\n vtkSetMacro ( TransferID, int );\\n\\n vtkGetMacro ( SizeOnDisk, int );\\n\\n vtkSetMacro ( SizeOnDisk, int );\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkDataTransfer.h\",\n \"rank\": 36,\n \"score\": 216320.46274902415\n },\n {\n \"content\": \"class VTK_MRML_EXPORT vtkTagTable : public vtkObject\\n\\n{\\n\\n public:\\n\\n /// The Usual vtk class functions\\n\\n static vtkTagTable *New();\\n\\n vtkTypeMacro(vtkTagTable, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n ///\\n\\n /// Get the vtkTable that contains user-defined attribute/value pairs.\\n\\n vtkGetStringMacro ( Name );\\n\\n vtkSetStringMacro ( Name );\\n\\n\\n\\n vtkGetMacro ( RestoreSelectionState, int);\\n\\n vtkSetMacro ( RestoreSelectionState, int);\\n\\n\\n\\n ///\\n\\n /// Method that sets up default and required tags for a service.\\n\\n /// Each derived class should fill out this method.\\n\\n virtual void Initialize() { };\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkTagTable.h\",\n \"rank\": 37,\n \"score\": 216320.46274902415\n },\n {\n \"content\": \"class VTK_MRML_EXPORT vtkPermissionPrompter : public vtkObject\\n\\n{\\n\\n public:\\n\\n\\n\\n /// The Usual vtk class functions\\n\\n static vtkPermissionPrompter *New();\\n\\n vtkTypeMacro(vtkPermissionPrompter, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n ///\\n\\n /// Member for storing a user name, if required\\n\\n vtkGetStringMacro ( Username );\\n\\n vtkSetStringMacro ( Username );\\n\\n\\n\\n ///\\n\\n /// Member for storing a password, if required\\n\\n vtkGetStringMacro ( Password );\\n\\n vtkSetStringMacro ( Password );\\n\\n\\n\\n vtkGetStringMacro (HostName );\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkPermissionPrompter.h\",\n \"rank\": 38,\n \"score\": 216320.46274902415\n },\n {\n \"content\": \" /// \\\\brief Class to hold information about a node reference\\n\\n class VTK_MRML_EXPORT vtkMRMLNodeReference : public vtkObject\\n\\n {\\n\\n public:\\n\\n vtkTypeMacro(vtkMRMLNodeReference,vtkObject);\\n\\n static vtkMRMLNodeReference *New();\\n\\n void PrintSelf(ostream& vtkNotUsed(os), vtkIndent vtkNotUsed(indent)){};\\n\\n\\n\\n public:\\n\\n vtkSetStringMacro(ReferenceRole);\\n\\n vtkGetStringMacro(ReferenceRole);\\n\\n\\n\\n vtkSetStringMacro(ReferencedNodeID);\\n\\n vtkGetStringMacro(ReferencedNodeID);\\n\\n\\n\\n /// \\\\brief Set the events that will be observed when the referenced node\\n\\n /// will be available.\\n\\n ///\\n\\n /// If set to NULL then the default event list (specified for the role) will be observed.\\n\\n /// If set to an empty event list then no events will be observed.\\n\\n void SetEvents(vtkIntArray* events);\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkMRMLNode.h\",\n \"rank\": 39,\n \"score\": 213600.5259066248\n },\n {\n \"content\": \"class VTK_SLICER_BASE_LOGIC_EXPORT vtkSystemInformation : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkSystemInformation *New();\\n\\n vtkTypeMacro(vtkSystemInformation,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n const char * GetVendorString();\\n\\n const char * GetVendorID();\\n\\n const char * GetTypeID();\\n\\n const char * GetFamilyID();\\n\\n const char * GetModelName();\\n\\n const char * GetModelID();\\n\\n const char * GetSteppingCode();\\n\\n const char * GetExtendedProcessorName();\\n\\n const char * GetProcessorSerialNumber();\\n\\n int GetProcessorCacheSize();\\n\\n int GetLogicalProcessorsPerPhysical();\\n\\n float GetProcessorClockFrequency();\\n\\n int GetProcessorAPICID();\\n\",\n \"file_path\": \"Base/Logic/vtkSystemInformation.h\",\n \"rank\": 40,\n \"score\": 213594.29181264158\n },\n {\n \"content\": \"class VTK_SLICER_BASE_LOGIC_EXPORT vtkSlicerTask : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkSlicerTask *New();\\n\\n vtkTypeMacro(vtkSlicerTask,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n typedef vtkMRMLAbstractLogic::TaskFunctionPointer TaskFunctionPointer;\\n\\n\\n\\n ///\\n\\n /// Set the function and object to call for the task.\\n\\n void SetTaskFunction(vtkMRMLAbstractLogic*, TaskFunctionPointer, void *clientdata);\\n\\n\\n\\n ///\\n\\n /// Execute the task.\\n\\n virtual void Execute();\\n\\n\\n\\n ///\\n\\n /// The type of task - this can be used, for example, to decide\\n\\n /// how many concurrent threads should be allowed\\n\",\n \"file_path\": \"Base/Logic/vtkSlicerTask.h\",\n \"rank\": 41,\n \"score\": 213594.29181264158\n },\n {\n \"content\": \"//------------------------------------------------------------------------------\\n\\nclass Q_SLICER_BASE_QTGUI_EXPORT qSlicerFileDialog : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_ENUMS(IOAction)\\n\\n Q_PROPERTY(QString description READ description)\\n\\n\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n qSlicerFileDialog(QObject* parent =0);\\n\\n virtual ~qSlicerFileDialog();\\n\\n\\n\\n virtual qSlicerIO::IOFileType fileType()const = 0;\\n\\n\\n\\n /// Unique name of the reader/writer\\n\\n /// \\\\sa filetype()\\n\\n virtual QString description()const = 0;\\n\\n\\n\\n enum IOAction\\n\\n {\\n\\n Read,\\n\",\n \"file_path\": \"Base/QTGUI/qSlicerFileDialog.h\",\n \"rank\": 42,\n \"score\": 213594.29181264158\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass qSlicerSegmentEditorAbstractEffectPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_DECLARE_PUBLIC(qSlicerSegmentEditorAbstractEffect);\\n\\nprotected:\\n\\n qSlicerSegmentEditorAbstractEffect* const q_ptr;\\n\\npublic:\\n\\n qSlicerSegmentEditorAbstractEffectPrivate(qSlicerSegmentEditorAbstractEffect& object);\\n\\n ~qSlicerSegmentEditorAbstractEffectPrivate();\\n\\nsignals:\\n\\n // Signals that are used for effects to request operations from the editor\\n\\n // without having any dependency on the editor.\\n\\n void selectEffectSignal(QString);\\n\\n void updateVolumeSignal(void*,bool&);\\n\\n void saveStateForUndoSignal();\\n\\npublic:\\n\\n /// Segment editor parameter set node\\n\\n vtkWeakPointer<vtkMRMLSegmentEditorNode> ParameterSetNode;\\n\\n\\n\\n /// MRML scene\\n\",\n \"file_path\": \"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorAbstractEffect_p.h\",\n \"rank\": 43,\n \"score\": 212889.7227884783\n },\n {\n \"content\": \"/// \\\\ingroup SlicerRt_QtModules_Segmentations\\n\\n/// \\\\brief Private implementation of the segment editor paint effect\\n\\nclass qSlicerSegmentEditorPaintEffectPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_DECLARE_PUBLIC(qSlicerSegmentEditorPaintEffect);\\n\\nprotected:\\n\\n qSlicerSegmentEditorPaintEffect* const q_ptr;\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n qSlicerSegmentEditorPaintEffectPrivate(qSlicerSegmentEditorPaintEffect& object);\\n\\n ~qSlicerSegmentEditorPaintEffectPrivate();\\n\\n\\n\\n /// Depending on the \\\\sa DelayedPaint mode, either paint the given point or queue\\n\\n /// it up with a marker for later painting\\n\\n void paintAddPoint(qMRMLWidget* viewWidget, double pixelPositionWorld[3]);\\n\\n\\n\\n /// Update paint circle glyph\\n\\n void updateBrush(qMRMLWidget* viewWidget, BrushPipeline* brush);\\n\\n\\n\\n /// Update brushes\\n\\n void updateBrushes();\\n\",\n \"file_path\": \"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorPaintEffect_p.h\",\n \"rank\": 44,\n \"score\": 212889.7227884783\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\n/// \\\\brief Class that can convert between different representations of a segment.\\n\\nclass vtkSegmentationCore_EXPORT vtkSegmentationConverter : public vtkObject\\n\\n{\\n\\npublic:\\n\\n typedef std::vector< vtkSmartPointer<vtkSegmentationConverterRule> > ConverterRulesListType;\\n\\n\\n\\n typedef std::vector<vtkSegmentationConverterRule*> ConversionPathType; // Contains a list of converter rule names\\n\\n typedef std::pair<ConversionPathType, unsigned int> ConversionPathAndCostType;\\n\\n typedef std::vector<ConversionPathAndCostType> ConversionPathAndCostListType;\\n\\n\\n\\n /// Default representation types\\n\\n /// In binary and fractional labelmaps values <=0 are considered background voxels (outside), values>0 are foreground (inside).\\n\\n static const char* GetSegmentationBinaryLabelmapRepresentationName() { return \\\"Binary labelmap\\\"; };\\n\\n static const char* GetSegmentationFractionalLabelmapRepresentationName() { return \\\"Fractional labelmap\\\"; };\\n\\n static const char* GetSegmentationPlanarContourRepresentationName() { return \\\"Planar contour\\\"; };\\n\\n static const char* GetSegmentationClosedSurfaceRepresentationName() { return \\\"Closed surface\\\"; };\\n\\n\\n\\n // Common conversion parameters\\n\\n // ----------------------------\\n\\n /// Reference image geometry conversion parameter\\n\\n /// Contains serialized matrix and extent\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkSegmentationConverter.h\",\n \"rank\": 45,\n \"score\": 210975.34803645647\n },\n {\n \"content\": \"/// \\\\ingroup vtkSegmentationCore\\n\\n/// \\\\brief Algorithm class for computing topological hierarchy of multiple poly data models.\\n\\n/// The levels of the models are determined according to the models they contain, an outer\\n\\n/// model always having larger level value than the inner ones. To determine whether a model\\n\\n/// contains another, their bounding boxes are considered. It is possible to constrain a gap\\n\\n/// or allow the inner model to protrude the surface of the outer one. The size of this gap\\n\\n/// or allowance is defined as a factor /sa ContainConstraintFactor of the outer model size.\\n\\n/// This algorithm can be used to automatically determine optimal opacities in complex scenes.\\n\\nclass vtkSegmentationCore_EXPORT vtkTopologicalHierarchy : public vtkObject\\n\\n{\\n\\npublic:\\n\\n\\n\\n static vtkTopologicalHierarchy *New();\\n\\n vtkTypeMacro(vtkTopologicalHierarchy, vtkObject );\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// Get output topological hierarchy levels\\n\\n virtual vtkIntArray* GetOutputLevels();\\n\\n\\n\\n /// Compute topological hierarchy levels for input poly data models using\\n\\n /// their bounding boxes.\\n\\n /// This function has to be explicitly called!\\n\\n /// Output can be get using GetOutputLevels()\\n\\n virtual void Update();\\n\\n\\n\\n /// Set input poly data collection\\n\\n vtkSetObjectMacro(InputPolyDataCollection, vtkPolyDataCollection);\\n\\n\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkTopologicalHierarchy.h\",\n \"rank\": 46,\n \"score\": 210973.41649971745\n },\n {\n \"content\": \"class VTK_ADDON_EXPORT vtkAddonMathUtilities : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkAddonMathUtilities *New();\\n\\n vtkTypeMacro(vtkAddonMathUtilities,vtkObject);\\n\\n virtual void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n static bool MatrixAreEqual(const vtkMatrix4x4* m1,\\n\\n const vtkMatrix4x4* m2,\\n\\n double tolerance = 1e-3);\\n\\n\\n\\n static bool MatrixAreEqual(const vtkMatrix4x4 *m1,\\n\\n const vtkMatrix3x3 *m2,\\n\\n double tolerance = 1e-3);\\n\\n\\n\\n static bool MatrixAreEqual(const vtkMatrix3x3 *m1,\\n\\n const vtkMatrix4x4 *m2,\\n\\n double tolerance = 1e-3);\\n\\n\\n\\n static bool MatrixAreEqual(const vtkMatrix3x3 *m1,\\n\",\n \"file_path\": \"Libs/vtkAddon/vtkAddonMathUtilities.h\",\n \"rank\": 47,\n \"score\": 210969.32022997006\n },\n {\n \"content\": \"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerModuleManager : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n qSlicerModuleManager(QObject* newParent = 0);\\n\\n virtual ~qSlicerModuleManager();\\n\\n\\n\\n /// Print internal state using qDebug()\\n\\n virtual void printAdditionalInfo();\\n\\n\\n\\n /// Return a pointer to the current module factory manager\\n\\n Q_INVOKABLE qSlicerModuleFactoryManager * factoryManager()const;\\n\\n\\n\\n /// Return the list of all the loaded modules\\n\\n Q_INVOKABLE QStringList modulesNames()const;\\n\\n\\n\\n /// Return the loaded module identified by \\\\a name\\n\\n Q_INVOKABLE qSlicerAbstractCoreModule* module(const QString& name)const;\\n\\n\\n\",\n \"file_path\": \"Base/QTCore/qSlicerModuleManager.h\",\n \"rank\": 48,\n \"score\": 210969.32022997006\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\nclass vtkSegmentationCore_EXPORT vtkSegmentationHistory : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkSegmentationHistory* New();\\n\\n vtkTypeMacro(vtkSegmentationHistory, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// Selects a segmentation that the states will be stored of. Current state of the segmentation is not stored.\\n\\n /// \\\\param segmentation Segmentation to store. Deletes all stored states of the previously set segmentation.\\n\\n void SetSegmentation(vtkSegmentation* segmentation);\\n\\n\\n\\n /// Get segmentation that the states will be stored of.\\n\\n vtkGetMacro(Segmentation, vtkSegmentation*);\\n\\n\\n\\n /// Saves all master representations of the segmentation in its current state.\\n\\n /// States more recent than the last restored state are removed.\\n\\n /// \\\\return Success flag\\n\\n bool SaveState();\\n\\n\\n\\n /// Restores previous state of the segmentation.\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkSegmentationHistory.h\",\n \"rank\": 49,\n \"score\": 210969.32022997006\n },\n {\n \"content\": \"class Q_SLICER_BASE_QTAPP_EXPORT qSlicerApplicationHelper : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n typedef qSlicerApplicationHelper Self;\\n\\n\\n\\n qSlicerApplicationHelper(QObject * parent = 0);\\n\\n virtual ~qSlicerApplicationHelper();\\n\\n\\n\\n static void setupModuleFactoryManager(qSlicerModuleFactoryManager * moduleFactoryManager);\\n\\n\\n\\n static void showMRMLEventLoggerWidget();\\n\\n\\n\\nprivate:\\n\\n Q_DISABLE_COPY(qSlicerApplicationHelper);\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Base/QTApp/qSlicerApplicationHelper.h\",\n \"rank\": 50,\n \"score\": 210969.32022997006\n },\n {\n \"content\": \"class VTK_MRML_EXPORT vtkDataIOManager : public vtkObject\\n\\n{\\n\\n public:\\n\\n\\n\\n /// The Usual vtk class functions\\n\\n static vtkDataIOManager *New();\\n\\n vtkTypeMacro(vtkDataIOManager,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n vtkGetObjectMacro ( DataTransferCollection, vtkCollection );\\n\\n void SetDataTransferCollection(vtkCollection* dataTransfer );\\n\\n vtkGetObjectMacro ( CacheManager, vtkCacheManager );\\n\\n virtual void SetCacheManager(vtkCacheManager* cacheManager);\\n\\n vtkGetMacro ( EnableAsynchronousIO, int );\\n\\n vtkGetMacro ( InUpdateCallbackFlag, int );\\n\\n vtkSetMacro ( InUpdateCallbackFlag, int );\\n\\n\\n\\n ///\\n\\n /// Get/Set the DataFileFormatHelper object\\n\\n vtkDataFileFormatHelper* GetFileFormatHelper();\\n\\n virtual void SetFileFormatHelper(vtkDataFileFormatHelper* helper);\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkDataIOManager.h\",\n \"rank\": 51,\n \"score\": 210969.32022997006\n },\n {\n \"content\": \"class qSlicerBaseQTBasePythonQtDecorators : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n\\n\\n qSlicerBaseQTBasePythonQtDecorators()\\n\\n {\\n\\n PythonQt::self()->registerClass(&qSlicerCoreApplication::staticMetaObject);\\n\\n PythonQt::self()->registerClass(&qSlicerAbstractCoreModule::staticMetaObject);\\n\\n PythonQt::self()->registerCPPClass(\\\"qSlicerUtils\\\", 0, \\\"qSlicerBaseQTCore\\\");\\n\\n // Note: Use registerCPPClassForPythonQt to register pure Cpp classes\\n\\n }\\n\\n\\n\\npublic slots:\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n // qSlicerCoreApplication\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n // static methods\\n\",\n \"file_path\": \"Base/QTCore/qSlicerBaseQTCorePythonQtDecorators.h\",\n \"rank\": 52,\n \"score\": 210536.70470846392\n },\n {\n \"content\": \"class qSlicerBaseQTAppPythonQtDecorators : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n\\n\\n qSlicerBaseQTAppPythonQtDecorators()\\n\\n {\\n\\n }\\n\\n\\n\\npublic slots:\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n // qSlicerApplicationHelper\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n void static_qSlicerApplicationHelper_setupModuleFactoryManager(qSlicerModuleFactoryManager * moduleFactoryManager)\\n\\n {\\n\\n qSlicerApplicationHelper::setupModuleFactoryManager(moduleFactoryManager);\\n\\n }\\n\\n};\\n\\n\\n\\n//-----------------------------------------------------------------------------\\n\\nvoid initqSlicerBaseQTAppPythonQtDecorators()\\n\\n{\\n\\n PythonQt::self()->addDecorators(new qSlicerBaseQTAppPythonQtDecorators);\\n\\n}\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Base/QTApp/qSlicerBaseQTAppPythonQtDecorators.h\",\n \"rank\": 53,\n \"score\": 210536.70470846392\n },\n {\n \"content\": \"/// \\\\brief Superclass for MRML logic classes.\\n\\n///\\n\\n/// Superclass for all MRML logic classes.\\n\\n/// When a scene is set, SetMRMLScene(vtkMRMLScene*),\\n\\n/// - UnobserveMRMLScene() is called if a scene was previously set,\\n\\n/// - SetMRMLSceneInternal() is called to observe the scene events\\n\\n/// (e.g. StartImportEvent, EndBatchProcessEvent...)\\n\\n/// - ObserveMRMLScene() is called to initialize the scene from the logic\\n\\n/// - UpdateMRMLScene() is called to initialize the logic from the scene\\n\\n/// Later, when events are fired by the scene, corresponding methods\\n\\n/// (e.g. OnMRMLSceneNodeAdded, OnMRMLEndBatchProcess...) are called in the\\n\\n/// logic if the events have been previously observed in SetMRMLSceneInternal()\\n\\nclass VTK_MRML_LOGIC_EXPORT vtkMRMLAbstractLogic : public vtkObject\\n\\n{\\n\\npublic:\\n\\n /// Typedef for member functions of MRMLLogic that can be used as\\n\\n /// scheduled tasks.\\n\\n typedef void (vtkMRMLAbstractLogic::*TaskFunctionPointer)(void *clientdata);\\n\\n\\n\\n static vtkMRMLAbstractLogic *New();\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n vtkTypeMacro(vtkMRMLAbstractLogic, vtkObject);\\n\\n\\n\\n /// Get access to overall application state\\n\\n virtual vtkMRMLApplicationLogic* GetMRMLApplicationLogic()const;\\n\\n virtual void SetMRMLApplicationLogic(vtkMRMLApplicationLogic* logic);\\n\\n\\n\\n /// Return a reference to the current MRML scene\\n\\n vtkMRMLScene * GetMRMLScene()const;\\n\\n\\n\\n /// Set and observe the MRMLScene\\n\\n void SetMRMLScene(vtkMRMLScene * newScene);\\n\",\n \"file_path\": \"Libs/MRML/Logic/vtkMRMLAbstractLogic.h\",\n \"rank\": 54,\n \"score\": 208452.0694072922\n },\n {\n \"content\": \"/// \\\\brief Provides tools.\\n\\n///\\n\\n/// Utility functions associated to FreeSurfer data.\\n\\nclass VTK_FreeSurfer_EXPORT vtkFSSurfaceHelper: public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkFSSurfaceHelper* New();\\n\\n\\n\\n /// Convenience method to compute a volume's Vox2RAS-tkreg Matrix\\n\\n static void ComputeTkRegVox2RASMatrix(double* spacing, int* dimensions, vtkMatrix4x4 *M );\\n\\n\\n\\n /// Computes matrix we need to register V1Node to V2Node given the\\n\\n /// \\\"register.dat\\\" matrix from tkregister2 (FreeSurfer)\\n\\n static void TranslateFreeSurferRegistrationMatrixIntoSlicerRASToRASMatrix(\\n\\n double* V1Spacing, int* V1Dim, vtkMatrix4x4* V1IJKToRASMatrix,\\n\\n double* V2Spacing, int* V2Dim, vtkMatrix4x4* V2RASToIJKMatrix,\\n\\n vtkMatrix4x4 *FSRegistrationMatrix, vtkMatrix4x4 *RAS2RASMatrix);\\n\\n\\n\\nprotected:\\n\\n vtkFSSurfaceHelper();\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/FreeSurfer/vtkFSSurfaceHelper.h\",\n \"rank\": 55,\n \"score\": 208440.01568814437\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass QMRML_WIDGETS_EXPORT qMRMLViewControllerBarPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLViewControllerBar);\\n\\n\\n\\nprotected:\\n\\n qMRMLViewControllerBar* const q_ptr;\\n\\n\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n qMRMLViewControllerBarPrivate(qMRMLViewControllerBar& object);\\n\\n virtual ~qMRMLViewControllerBarPrivate();\\n\\n\\n\\n virtual void init();\\n\\n virtual void setColor(QColor color);\\n\\n virtual QColor color()const;\\n\\n\\n\\n QToolButton* PinButton;\\n\\n QLabel* ViewLabel;\\n\\n ctkPopupWidget* PopupWidget;\\n\",\n \"file_path\": \"Libs/MRML/Widgets/qMRMLViewControllerBar_p.h\",\n \"rank\": 56,\n \"score\": 208440.01568814437\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLROIWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLROIWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLROIWidgetPlugin.h\",\n \"rank\": 57,\n \"score\": 208440.01568814437\n },\n {\n \"content\": \"/// \\\\ingroup SlicerRt_QtModules_Segmentations\\n\\n/// \\\\brief Private implementation of the segment editor abstract label effect\\n\\nclass qSlicerSegmentEditorAbstractLabelEffectPrivate: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_DECLARE_PUBLIC(qSlicerSegmentEditorAbstractLabelEffect);\\n\\nprotected:\\n\\n qSlicerSegmentEditorAbstractLabelEffect* const q_ptr;\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n qSlicerSegmentEditorAbstractLabelEffectPrivate(qSlicerSegmentEditorAbstractLabelEffect& object);\\n\\n ~qSlicerSegmentEditorAbstractLabelEffectPrivate();\\n\\n\\n\\nprotected slots:\\n\\n\\n\\npublic:\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorAbstractLabelEffect_p.h\",\n \"rank\": 58,\n \"score\": 208264.99728106515\n },\n {\n \"content\": \"class qMRMLAnnotationDisplayNodePointPropertyWidgetPrivate: public QObject,\\n\\n public Ui_qMRMLAnnotationDisplayNodePointPropertyWidget\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_DECLARE_PUBLIC(qMRMLAnnotationDisplayNodePointPropertyWidget);\\n\\nprotected:\\n\\n qMRMLAnnotationDisplayNodePointPropertyWidget* const q_ptr;\\n\\n\\n\\npublic:\\n\\n\\n\\n qMRMLAnnotationDisplayNodePointPropertyWidgetPrivate(qMRMLAnnotationDisplayNodePointPropertyWidget& object);\\n\\n typedef qMRMLAnnotationDisplayNodePointPropertyWidgetPrivate Self;\\n\\n void setupUi(qMRMLAnnotationDisplayNodePropertyWidget * widget);\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Modules/Loadable/Annotations/Widgets/qMRMLAnnotationDisplayNodePointPropertyWidget_p.h\",\n \"rank\": 59,\n \"score\": 206070.4574459475\n },\n {\n \"content\": \"/// \\\\brief qSlicerAbstractCoreModule is the base class of any module in Slicer.\\n\\n//\\n\\n/// Core modules, Loadable modules, CLI modules derive from it.\\n\\n/// It is responsible to create the UI and the Logic:\\n\\n/// createWidgetRepresentation() and createLogic() must be reimplemented in\\n\\n/// derived classes.\\n\\n/// A Slicer module has a name and a title: The name is its UID, the title\\n\\n/// displayed to the user.\\n\\n/// When a MRML scene is set to the module, the module set the scene to the\\n\\n/// UI widget and the logic.\\n\\nclass Q_SLICER_BASE_QTCORE_EXPORT qSlicerAbstractCoreModule : public QObject\\n\\n{\\n\\n /// Any object deriving from QObject must have the Q_OBJECT macro in\\n\\n /// order to have the signal/slots working and the meta-class name valid.\\n\\n Q_OBJECT\\n\\n\\n\\n /// The following properties are added to the meta-class\\n\\n /// and though are available through PythonQt.\\n\\n\\n\\n /// This property contains the name of the module.\\n\\n /// e.g. \\\"Volumes\\\", \\\"VolumeRendering\\\", \\\"SampleData\\\"...\\n\\n /// The name identifies a module and must be unique.\\n\\n /// In comparison to \\\\a title, \\\\a name contains only letter characters,\\n\\n /// no space/hyphen/apostrophe.\\n\\n /// The module name is set by the module factory (the registered item key\\n\\n /// string).\\n\\n /// Because \\\\a name is unique, slots and functions that take a module as\\n\\n /// argument should use \\\\name and not \\\\a title.\\n\\n Q_PROPERTY(QString name READ name)\\n\\n\\n\",\n \"file_path\": \"Base/QTCore/qSlicerAbstractCoreModule.h\",\n \"rank\": 60,\n \"score\": 206013.0054838387\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\n/// \\\\brief Abstract converter rule class. Subclasses perform conversions between specific\\n\\n/// representation types. They define source and target type and provide ways to create those\\n\\n/// types of objects.\\n\\nclass vtkSegmentationCore_EXPORT vtkSegmentationConverterRule : public vtkObject\\n\\n{\\n\\npublic:\\n\\n /// Conversion parameter list type. Maps the conversion parameter name to a pair consisting of the\\n\\n /// value of the parameter (the default value if it is defined in the converter rule) and the\\n\\n /// description of the parameter that appears as tooltip in the conversion parameters widget\\n\\n /// ( name => (value, description) )\\n\\n typedef std::map<std::string, std::pair<std::string, std::string> > ConversionParameterListType;\\n\\n\\n\\n /// Constant to use for converter rules with \\\"infinite\\\" computational cost (i.e. disabled)\\n\\n /// It's about UINT_MAX / 400 (allows us to have a few hundred disabled rules)\\n\\n static unsigned int GetConversionInfiniteCost() { return 10000000; };\\n\\n\\n\\npublic:\\n\\n //static vtkSegmentationConverterRule* New();\\n\\n vtkTypeMacro(vtkSegmentationConverterRule, vtkObject);\\n\\n\\n\\n /// Create instance of the default node. Similar to New but virtual method.\\n\\n /// Subclasses should implement this method by\\n\\n virtual vtkSegmentationConverterRule* CreateRuleInstance() = 0;\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkSegmentationConverterRule.h\",\n \"rank\": 61,\n \"score\": 206012.1005431629\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\n/// \\\\brief Class that can create vtkSegmentationConverter instances.\\n\\n///\\n\\n/// This singleton class is a repository of all segmentation converter rules.\\n\\n/// Singleton pattern adopted from vtkEventBroker class.\\n\\nclass vtkSegmentationCore_EXPORT vtkSegmentationConverterFactory : public vtkObject\\n\\n{\\n\\npublic:\\n\\n typedef std::vector< vtkSmartPointer<vtkSegmentationConverterRule> > RuleListType;\\n\\n\\n\\n vtkTypeMacro(vtkSegmentationConverterFactory, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// Create a copy of all registered converter rules.\\n\\n /// The rule argument is overwritten (any previous content is cleared) with rules\\n\\n /// copied from the list of all registered rules.\\n\\n void CopyConverterRules(RuleListType &rules);\\n\\n\\n\\n /// Add a converter rule.\\n\\n /// The factory (and all converter classes it creates) will keep a reference to this rule object,\\n\\n /// and it will not be deleted until all these referring classes are deleted.\\n\\n void RegisterConverterRule(vtkSegmentationConverterRule* rule);\\n\\n\\n\\n /// Remove a converter rule from the factory.\\n\\n /// This does not affect converters that have already been created.\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkSegmentationConverterFactory.h\",\n \"rank\": 62,\n \"score\": 206008.39796927685\n },\n {\n \"content\": \"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerExtensionsManagerModel : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_PROPERTY(int numberOfInstalledExtensions READ numberOfInstalledExtensions)\\n\\n Q_PROPERTY(QStringList installedExtensions READ installedExtensions)\\n\\n Q_PROPERTY(QStringList enabledExtensions READ enabledExtensions)\\n\\n Q_PROPERTY(QUrl serverUrl READ serverUrl)\\n\\n Q_PROPERTY(QUrl serverUrlWithPackagePath READ serverUrlWithPackagePath)\\n\\n Q_PROPERTY(QUrl serverUrlWithExtensionsStorePath READ serverUrlWithExtensionsStorePath)\\n\\n Q_PROPERTY(QString extensionsInstallPath READ extensionsInstallPath)\\n\\n Q_PROPERTY(bool newExtensionEnabledByDefault READ newExtensionEnabledByDefault WRITE setNewExtensionEnabledByDefault)\\n\\n Q_PROPERTY(QString extensionsSettingsFilePath READ extensionsSettingsFilePath WRITE setExtensionsSettingsFilePath)\\n\\n Q_PROPERTY(QString slicerRevision READ slicerRevision WRITE setSlicerRevision)\\n\\n Q_PROPERTY(QString slicerOs READ slicerOs WRITE setSlicerOs)\\n\\n Q_PROPERTY(QString slicerArch READ slicerArch WRITE setSlicerArch)\\n\\n Q_PROPERTY(QString slicerVersion READ slicerVersion WRITE setSlicerVersion)\\n\\npublic:\\n\\n /// Superclass typedef\\n\\n typedef QObject Superclass;\\n\\n\\n\",\n \"file_path\": \"Base/QTCore/qSlicerExtensionsManagerModel.h\",\n \"rank\": 63,\n \"score\": 206001.2419076654\n },\n {\n \"content\": \"class VTK_MRML_EXPORT vtkDataFileFormatHelper : public vtkObject\\n\\n{\\n\\n public:\\n\\n\\n\\n /// The Usual vtk class functions\\n\\n static vtkDataFileFormatHelper *New();\\n\\n vtkTypeMacro(vtkDataFileFormatHelper, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n static std::string GetFileExtensionFromFormatString(\\n\\n const char* fileformat);\\n\\n const char* GetClassNameFromFormatString(\\n\\n const char* fileformat);\\n\\n\\n\\n ///\\n\\n /// Get the itkimageio supported file formats.\\n\\n //vtkGetObjectMacro ( ITKSupportedWriteFileFormats, vtkStringArray);\\n\\n virtual vtkStringArray* GetITKSupportedWriteFileFormats();\\n\\n virtual vtkStringArray* GetITKSupportedReadFileFormats()\\n\\n {\\n\",\n \"file_path\": \"Libs/MRML/Core/vtkDataFileFormatHelper.h\",\n \"rank\": 64,\n \"score\": 206001.2419076654\n },\n {\n \"content\": \"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerExtensionDownloadTask : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n Q_PROPERTY(QVariantMap metadata READ metadata WRITE setMetadata)\\n\\n Q_PROPERTY(QString extensionName READ extensionName WRITE setExtensionName)\\n\\n Q_PROPERTY(QString archiveName READ archiveName WRITE setArchiveName)\\n\\n Q_PROPERTY(QNetworkReply* reply READ reply)\\n\\n\\n\\npublic:\\n\\n /// Constructor.\\n\\n ///\\n\\n /// The task takes ownership of the reply and will delete it when the task\\n\\n /// is destroyed.\\n\\n explicit qSlicerExtensionDownloadTask(QNetworkReply* reply,\\n\\n QObject* parent = 0);\\n\\n\\n\\n /// Destructor.\\n\\n virtual ~qSlicerExtensionDownloadTask();\\n\\n\\n\\n /// Get extension metadata.\\n\",\n \"file_path\": \"Base/QTCore/qSlicerExtensionDownloadTask.h\",\n \"rank\": 65,\n \"score\": 206001.2419076654\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\n/// \\\\brief Calculate oversampling factor based on model properties using fuzzy logics\\n\\nclass vtkSegmentationCore_EXPORT vtkCalculateOversamplingFactor : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkCalculateOversamplingFactor *New();\\n\\n vtkTypeMacro(vtkCalculateOversamplingFactor, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\npublic:\\n\\n /// Calculate oversampling factor for the input model and its rasterization reference volume\\n\\n /// based on model properties using fuzzy logics.\\n\\n bool CalculateOversamplingFactor();\\n\\n\\n\\n /// Apply oversampling factor on image data geometry.\\n\\n /// Changes spacing and extent of oversampling factor is not 1 (and sensible)\\n\\n static void ApplyOversamplingOnImageGeometry(vtkOrientedImageData* imageData, double oversamplingFactor);\\n\\n\\n\\nprotected:\\n\\n /// Calculate relative structure size from input model and rasterization reference volume\\n\\n double CalculateRelativeStructureSize();\\n\\n\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkCalculateOversamplingFactor.h\",\n \"rank\": 66,\n \"score\": 206001.2419076654\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass Q_SLICER_BASE_QTCLI_EXPORT qSlicerWidgetValueWrapper: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n qSlicerWidgetValueWrapper(const QString& _name, const QString& _label, QObject* parent);\\n\\n virtual ~qSlicerWidgetValueWrapper();\\n\\n virtual QVariant value() = 0;\\n\\n QString label(){ return this->Label; }\\n\\n QString name(){ return this->Name; }\\n\\n\\n\\n virtual void setValue(const QString& _value) = 0;\\n\\n\\n\\n static QString toString(const QString& _value)\\n\\n {\\n\\n return _value;\\n\\n }\\n\\n\\n\\n static bool toBool(const QString& _value)\\n\\n {\\n\\n return (_value.compare(\\\"true\\\", Qt::CaseInsensitive) == 0);\\n\",\n \"file_path\": \"Base/QTCLI/qSlicerCLIModuleUIHelper.h\",\n \"rank\": 67,\n \"score\": 206001.2419076654\n },\n {\n \"content\": \"/// Container class for objects that can be loaded from DICOM files into Slicer.\\n\\n/// Each plugin returns a list of instances from its evaluate method and accepts\\n\\n/// a list of these in its load method corresponding to the things the user has\\n\\n/// selected for loading\\n\\nclass Q_SLICER_MODULE_DICOMLIB_WIDGETS_EXPORT qSlicerDICOMLoadable : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\n /// Name exposed to the user for the node\\n\\n Q_PROPERTY(QString name READ name WRITE setName)\\n\\n /// Extra information the user sees on mouse over of the thing\\n\\n Q_PROPERTY(QString tooltip READ tooltip WRITE setTooltip)\\n\\n /// Things the user should know before loading this data\\n\\n Q_PROPERTY(QString warning READ warning WRITE setWarning)\\n\\n /// The file list of the data to be loaded\\n\\n Q_PROPERTY(QStringList files READ files WRITE setFiles)\\n\\n /// Is the object checked for loading by default\\n\\n Q_PROPERTY(bool selected READ selected WRITE setSelected)\\n\\n /// Confidence - from 0 to 1 where 0 means low chance\\n\\n /// that the user actually wants to load their data this\\n\\n /// way up to 1, which means that the plugin is very confident\\n\\n /// that this is the best way to load the data.\\n\\n /// When more than one plugin marks the same series as\\n\\n /// selected, the one with the highest confidence is\\n\",\n \"file_path\": \"Modules/Scripted/DICOMLib/Widgets/qSlicerDICOMLoadable.h\",\n \"rank\": 68,\n \"score\": 203659.08246314852\n },\n {\n \"content\": \"/// Container class for things that can be loaded from DICOM files into Slicer.\\n\\n/// Each plugin returns a list of instances from its evaluate method and accepts\\n\\n/// a list of these in its load method corresponding to the things the user has\\n\\n/// selected for loading\\n\\nclass Q_SLICER_MODULE_DICOMLIB_WIDGETS_EXPORT qSlicerDICOMExportable : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\n /// Name exposed to the user for the export method\\n\\n Q_PROPERTY(QString name READ name WRITE setName)\\n\\n /// Extra information the user sees on mouse over of the export option\\n\\n Q_PROPERTY(QString tooltip READ tooltip WRITE setTooltip)\\n\\n /// ID of MRML node to be exported\\n\\n Q_PROPERTY(QString nodeID READ nodeID WRITE setNodeID)\\n\\n /// Class of the plugin that created this exportable\\n\\n Q_PROPERTY(QString pluginClass READ pluginClass WRITE setPluginClass)\\n\\n /// Target directory to export this exportable\\n\\n Q_PROPERTY(QString directory READ directory WRITE setDirectory)\\n\\n /// Confidence - from 0 to 1 where 0 means that the plugin\\n\\n /// cannot export the given node, up to 1 that means that the\\n\\n /// plugin considers itself the best plugin to export the node\\n\\n /// (in case of specialized objects, e.g. RT dose volume)\\n\\n Q_PROPERTY(double confidence READ confidence WRITE setConfidence)\\n\\n /// Pseudo-tags offered by the plugin that are to be filled out for export.\\n\",\n \"file_path\": \"Modules/Scripted/DICOMLib/Widgets/qSlicerDICOMExportable.h\",\n \"rank\": 69,\n \"score\": 203653.66633005746\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLRangeWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLRangeWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLRangeWidgetPlugin.h\",\n \"rank\": 70,\n \"score\": 203648.223827651\n },\n {\n \"content\": \"//-----------------------------------------------------------------------------\\n\\nclass Q_SLICER_BASE_QTCLI_EXPORT qSlicerCLIModuleUIHelper: public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n\\n\\n qSlicerCLIModuleUIHelper(qSlicerCLIModuleWidget* cliModuleWidget);\\n\\n virtual ~qSlicerCLIModuleUIHelper();\\n\\n\\n\\n /// Create the widget associated with the given \\\\a moduleParameter\\n\\n /// The caller is responsible to delete the widget.\\n\\n /// Note also that if the widget is added to a layout, Qt will\\n\\n /// be responsible to delete the widget.\\n\\n QWidget* createTagWidget(const ModuleParameter& moduleParameter);\\n\\n\\n\\n ///\\n\\n /// Update \\\\a commandLineModuleNode properties using value entered from the UI\\n\\n void updateMRMLCommandLineModuleNode(vtkMRMLCommandLineModuleNode* commandLineModuleNode);\\n\\n\\n\\n /// Update user interface using the given \\\\a commandLineModuleNode parameters\\n\\n void updateUi(vtkMRMLCommandLineModuleNode* commandLineModuleNode);\\n\",\n \"file_path\": \"Base/QTCLI/qSlicerCLIModuleUIHelper.h\",\n \"rank\": 71,\n \"score\": 203648.223827651\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLTransformSlidersPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLTransformSlidersPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLTransformSlidersPlugin.h\",\n \"rank\": 72,\n \"score\": 203648.223827651\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLListWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLListWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLListWidgetPlugin.h\",\n \"rank\": 73,\n \"score\": 203648.223827651\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLLayoutWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLLayoutWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLLayoutWidgetPlugin.h\",\n \"rank\": 74,\n \"score\": 203648.223827651\n },\n {\n \"content\": \"class VTK_SLICER_EDITORLIB_MODULE_LOGIC_EXPORT vtkImageStash : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkImageStash *New();\\n\\n vtkTypeMacro(vtkImageStash,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n ///\\n\\n /// The stash image:\\n\\n /// This image data will have the Scalars removed\\n\\n /// and they will be stored in a local compressed data\\n\\n /// array inside this class when the Stash method is called.\\n\\n /// You must call Unstash to have the scalars put back into\\n\\n /// this image data.\\n\\n vtkSetObjectMacro(StashImage, vtkImageData);\\n\\n vtkGetObjectMacro(StashImage, vtkImageData);\\n\\n\\n\\n ///\\n\\n /// The stashed scalars:\\n\\n /// this is the zlib compressed image scalar data\\n\",\n \"file_path\": \"Modules/Scripted/EditorLib/Logic/vtkImageStash.h\",\n \"rank\": 75,\n \"score\": 203648.223827651\n },\n {\n \"content\": \"class qSlicerSubjectHierarchyModuleWidgetsPythonQtDecorators : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\npublic:\\n\\n\\n\\n qSlicerSubjectHierarchyModuleWidgetsPythonQtDecorators()\\n\\n {\\n\\n //PythonQt::self()->registerClass(&qSlicerSubjectHierarchyPluginHandler::staticMetaObject);\\n\\n // Note: Use registerCPPClassForPythonQt to register pure Cpp classes\\n\\n }\\n\\n\\n\\npublic slots:\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n // qSlicerSubjectHierarchyPluginHandler\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\\n // static methods\\n\\n\\n\\n //----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Modules/Loadable/SubjectHierarchy/Widgets/qSlicerSubjectHierarchyModuleWidgetsPythonQtDecorators.h\",\n \"rank\": 76,\n \"score\": 201897.6694308523\n },\n {\n \"content\": \"/// \\\\brief Factory where displayable manager classes are registered.\\n\\n///\\n\\n/// A displayable manager class is responsible to represent a\\n\\n/// MRMLDisplayable node in a renderer.\\n\\nclass VTK_MRML_DISPLAYABLEMANAGER_EXPORT vtkMRMLDisplayableManagerFactory : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkMRMLDisplayableManagerFactory* New();\\n\\n vtkTypeMacro(vtkMRMLDisplayableManagerFactory,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n enum\\n\\n {\\n\\n DisplayableManagerFactoryRegisteredEvent = 30100,\\n\\n DisplayableManagerFactoryUnRegisteredEvent = 30101\\n\\n };\\n\\n\\n\\n /// Return True if Displayable Manager identified by \\\\a vtkClassName\\n\\n /// is already registered.\\n\\n bool IsDisplayableManagerRegistered(const char* vtkClassName);\\n\\n\\n\\n /// Register Displayable Manager identified by \\\\a vtkClassOrScriptName\\n\\n /// Returns True if displayable manager was successfully registered\\n\\n /// \\\\a vtkClassOrScriptName should be either:\\n\",\n \"file_path\": \"Libs/MRML/DisplayableManager/vtkMRMLDisplayableManagerFactory.h\",\n \"rank\": 77,\n \"score\": 201383.41731570027\n },\n {\n \"content\": \"/// \\\\brief DisplayableManagerGroup is a collection of DisplayableManager.\\n\\n///\\n\\n/// It also provides method allowing to either call RenderRequest\\n\\n/// or SetAndObserveMRMLDisplayableNode on all member of the group.\\n\\n/// When the displayable managers in the group request the view to be\\n\\n/// refreshed, the group fires a vtkCommand::UpdateEvent event.\\n\\n/// This event can be observed and trigger a Render on the render window.\\n\\nclass VTK_MRML_DISPLAYABLEMANAGER_EXPORT vtkMRMLDisplayableManagerGroup : public vtkObject\\n\\n{\\n\\npublic:\\n\\n\\n\\n static vtkMRMLDisplayableManagerGroup *New();\\n\\n vtkTypeMacro(vtkMRMLDisplayableManagerGroup,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n /// Convenient method equivalent to call SetAndObserveDisplayableManagerFactory, SetRenderer,\\n\\n /// then instantiate and add all displayable managers registered within the \\\\a factory.\\n\\n /// \\\\sa SetAndObserveDisplayableManagerFactory SetRenderer\\n\\n /// \\\\sa AddDisplayableManager InstantiateDisplayableManager\\n\\n void Initialize(vtkMRMLDisplayableManagerFactory * factory, vtkRenderer * renderer);\\n\\n\\n\\n /// Set and observe DisplayableManager factory\\n\\n void SetAndObserveDisplayableManagerFactory(vtkMRMLDisplayableManagerFactory * factory);\\n\\n\\n\\n /// Add a DisplayableManager and initialize it if required\\n\\n void AddDisplayableManager(vtkMRMLAbstractDisplayableManager * displayableManager);\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/DisplayableManager/vtkMRMLDisplayableManagerGroup.h\",\n \"rank\": 78,\n \"score\": 201381.1443967662\n },\n {\n \"content\": \"/// Loading modules into slicer happens in multiple steps:\\n\\n/// 1) module factories must be registered into the factory manager:\\n\\n/// qSlicerModuleFactoryManager* factoryManager = app->moduleManager()->factoryManager();\\n\\n/// factoryManager->registerFactory(new qSlicerLoadableModuleFactory);\\n\\n/// ...\\n\\n/// 2) directories where the modules to load are located must be passed to the factory manager\\n\\n/// factoryManager->addSearchPath(app->slicerHome() + \\\"/\\\" + Slicer_QTSCRIPTEDMODULES_LIB_DIR + \\\"/\\\" );\\n\\n/// factoryManager->addSearchPath(app->slicerHome() + \\\"/\\\" + Slicer_CLIMODULES_LIB_DIR + \\\"/\\\" );\\n\\n/// ...\\n\\n/// 3) Optionally:\\n\\n/// - specify module names to ignore: For startup speed-up and memory consummation,\\n\\n/// it can be useful to not load some modules:\\n\\n/// factoryManager->setModulesToIgnore(QStringList(QString(\\\"Data\\\")));\\n\\n/// - specify an explicit list of modules to register/instantiate/load. All other discovered\\n\\n/// modules won't be loaded.\\n\\n/// 4) scan the directories and test which file is a module and register it (not instantiated yet)\\n\\n/// For each file in the search paths, the factory manager asks each registered\\n\\n/// factory if they can load the file. If there is a factory that supports the\\n\\n/// file, the manager associates the factory to the file path, otherwise the\\n\\n/// file is discarded.\\n\\n/// factoryManager->registerModules();\\n\\n/// 5) Instantiate all the registered modules\\n\\n/// factoryManager->instantiateModules();\\n\\n/// 6) Connect each module with the scene and the application\\n\\n/// The application logic and the scene are passed to each module.\\n\\n/// The order of initialization is defined with the dependencies of the modules.\\n\\n/// If module B depends of module A, it is assured that module B is initialized/setup after A.\\n\\n/// factoryManager->loadModules();\\n\\nclass Q_SLICER_BASE_QTCORE_EXPORT qSlicerAbstractModuleFactoryManager : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n /// This property holds the paths where the modules are located.\\n\\n /// At registration time (registerModules), the paths are scanned and module\\n\\n /// discovered.\\n\\n /// A module can be a library (dll, so),\\n\\n /// an executable (exe), a python file (py) or any other file type supported\\n\\n /// by the registered factories.\\n\\n /// The search is not recursive, you need to provide each subdirectory\\n\\n /// manually.\\n\\n ///\\n\\n /// \\\\todo In qSlicerAbstractModuleFactoryManager, should the module search recursively descend \\\\a searchPaths\\n\\n Q_PROPERTY(QStringList searchPaths READ searchPaths WRITE setSearchPaths)\\n\\n\\n\\n /// This property holds the names of the modules to ignore at registration time.\\n\\n ///\\n\\n /// Due to the large amount of modules to load, it can be faster (and less\\n\\n /// overwhelming) to load only a subset of the modules.\\n\\n Q_PROPERTY(QStringList modulesToIgnore READ modulesToIgnore WRITE setModulesToIgnore NOTIFY modulesToIgnoreChanged)\\n\",\n \"file_path\": \"Base/QTCore/qSlicerAbstractModuleFactoryManager.h\",\n \"rank\": 79,\n \"score\": 201379.06257691752\n },\n {\n \"content\": \"/// \\\\ingroup SegmentationCore\\n\\n/// \\\\brief Utility functions for resampling oriented image data\\n\\nclass vtkSegmentationCore_EXPORT vtkOrientedImageDataResample : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkOrientedImageDataResample *New();\\n\\n vtkTypeMacro(vtkOrientedImageDataResample,vtkObject);\\n\\n\\n\\n enum\\n\\n {\\n\\n OPERATION_MINIMUM,\\n\\n OPERATION_MAXIMUM,\\n\\n OPERATION_MASKING\\n\\n };\\n\\n\\n\\n /// Resample an oriented image data to match the geometry of a reference geometry matrix.\\n\\n /// Origin and dimensions are determined from the contents of the input image.\\n\\n /// \\\\param inputImage Oriented image to resample\\n\\n /// \\\\param referenceGeometryMatrix Matrix containing the desired geometry\\n\\n /// \\\\param outputImage Output image\\n\\n /// \\\\param linearInterpolation True if linear interpolation is requested (fractional labelmap), or false for nearest neighbor (binary labelmap). Default is false.\\n\\n /// \\\\return Success flag\\n\",\n \"file_path\": \"Libs/vtkSegmentationCore/vtkOrientedImageDataResample.h\",\n \"rank\": 80,\n \"score\": 201376.5164002522\n },\n {\n \"content\": \"/// \\\\ingroup Slicer_QtModules_SubjectHierarchy_Widgets\\n\\nclass Q_SLICER_MODULE_DICOMLIB_WIDGETS_EXPORT qSlicerDICOMExportDialog : public QObject\\n\\n{\\n\\npublic:\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n typedef QObject Superclass;\\n\\n qSlicerDICOMExportDialog(QObject* parent = NULL);\\n\\n virtual ~qSlicerDICOMExportDialog();\\n\\n\\n\\npublic:\\n\\n /// Show dialog\\n\\n /// \\\\param nodeToSelect Node is selected in the tree if given\\n\\n virtual bool exec(vtkMRMLSubjectHierarchyNode* nodeToSelect=NULL);\\n\\n\\n\\n /// Set MRML scene\\n\\n Q_INVOKABLE void setMRMLScene(vtkMRMLScene* scene);\\n\\n\\n\\n /// Python compatibility function for showing dialog (calls \\\\a exec)\\n\\n Q_INVOKABLE bool execDialog(vtkMRMLSubjectHierarchyNode* nodeToSelect=NULL) { return this->exec(nodeToSelect); };\\n\",\n \"file_path\": \"Modules/Scripted/DICOMLib/Widgets/qSlicerDICOMExportDialog.h\",\n \"rank\": 81,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class VTK_SLICER_EDITORLIB_MODULE_LOGIC_EXPORT vtkImageSlicePaint : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkImageSlicePaint *New();\\n\\n vtkTypeMacro(vtkImageSlicePaint,vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\n\\n\\n ///\\n\\n /// Sets/Gets the PaintRegion in IJK (pixel) coordinates of the Working image\\n\\n vtkSetVector3Macro(TopLeft, int);\\n\\n vtkGetVector3Macro(TopLeft, int);\\n\\n vtkSetVector3Macro(TopRight, int);\\n\\n vtkGetVector3Macro(TopRight, int);\\n\\n vtkSetVector3Macro(BottomLeft, int);\\n\\n vtkGetVector3Macro(BottomLeft, int);\\n\\n vtkSetVector3Macro(BottomRight, int);\\n\\n vtkGetVector3Macro(BottomRight, int);\\n\\n\\n\\n ///\\n\",\n \"file_path\": \"Modules/Scripted/EditorLib/Logic/vtkImageSlicePaint.h\",\n \"rank\": 82,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLColorTableViewPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLColorTableViewPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLColorTableViewPlugin.h\",\n \"rank\": 83,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLDisplayNodeWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLDisplayNodeWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLDisplayNodeWidgetPlugin.h\",\n \"rank\": 84,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLCaptureToolBarPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLCaptureToolBarPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLCaptureToolBarPlugin.h\",\n \"rank\": 85,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLClipNodeWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLClipNodeWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLClipNodeWidgetPlugin.h\",\n \"rank\": 86,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLVolumeThresholdWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLVolumeThresholdWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLVolumeThresholdWidgetPlugin.h\",\n \"rank\": 87,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLSliceControllerWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLSliceControllerWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLSliceControllerWidgetPlugin.h\",\n \"rank\": 88,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"/// VTK implementation of \\\\sa qSlicerDICOMLoadable\\n\\nclass VTK_SLICER_DICOMLIB_MODULE_LOGIC_EXPORT vtkSlicerDICOMLoadable : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkSlicerDICOMLoadable *New();\\n\\n vtkTypeMacro(vtkSlicerDICOMLoadable, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\npublic:\\n\\n vtkGetStringMacro(Name);\\n\\n vtkSetStringMacro(Name);\\n\\n\\n\\n vtkGetStringMacro(Tooltip);\\n\\n vtkSetStringMacro(Tooltip);\\n\\n\\n\\n vtkGetStringMacro(Warning);\\n\\n vtkSetStringMacro(Warning);\\n\\n\\n\\n vtkGetObjectMacro(Files, vtkStringArray);\\n\\n\\n\\n vtkGetMacro(Selected, bool);\\n\",\n \"file_path\": \"Modules/Scripted/DICOMLib/Logic/vtkSlicerDICOMLoadable.h\",\n \"rank\": 89,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLColorListViewPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLColorListViewPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLColorListViewPlugin.h\",\n \"rank\": 90,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLSliceInformationWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLSliceInformationWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLSliceInformationWidgetPlugin.h\",\n \"rank\": 91,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLNodeComboBoxPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLNodeComboBoxPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLNodeComboBoxPlugin.h\",\n \"rank\": 92,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"/// VTK implementation of \\\\sa qSlicerDICOMExportable\\n\\nclass VTK_SLICER_DICOMLIB_MODULE_LOGIC_EXPORT vtkSlicerDICOMExportable : public vtkObject\\n\\n{\\n\\npublic:\\n\\n static vtkSlicerDICOMExportable *New();\\n\\n vtkTypeMacro(vtkSlicerDICOMExportable, vtkObject);\\n\\n void PrintSelf(ostream& os, vtkIndent indent);\\n\\n\\n\\npublic:\\n\\n vtkGetStringMacro(Name);\\n\\n vtkSetStringMacro(Name);\\n\\n\\n\\n vtkGetStringMacro(Tooltip);\\n\\n vtkSetStringMacro(Tooltip);\\n\\n\\n\\n vtkGetStringMacro(NodeID);\\n\\n vtkSetStringMacro(NodeID);\\n\\n\\n\\n vtkGetStringMacro(PluginClass);\\n\\n vtkSetStringMacro(PluginClass);\\n\\n\\n\",\n \"file_path\": \"Modules/Scripted/DICOMLib/Logic/vtkSlicerDICOMExportable.h\",\n \"rank\": 93,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLLinearTransformSliderPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLLinearTransformSliderPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLLinearTransformSliderPlugin.h\",\n \"rank\": 94,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLSceneFactoryWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLSceneFactoryWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLSceneFactoryWidgetPlugin.h\",\n \"rank\": 95,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class QMRML_WIDGETS_PLUGINS_EXPORT qMRMLWindowLevelWidgetPlugin : public QObject,\\n\\n public qMRMLWidgetsAbstractPlugin\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n qMRMLWindowLevelWidgetPlugin(QObject *_parent = 0);\\n\\n\\n\\n QWidget *createWidget(QWidget *_parent);\\n\\n QString domXml() const;\\n\\n QIcon icon() const;\\n\\n QString includeFile() const;\\n\\n bool isContainer() const;\\n\\n QString name() const;\\n\\n\\n\\n};\\n\\n\\n\\n#endif\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/Widgets/DesignerPlugins/qMRMLWindowLevelWidgetPlugin.h\",\n \"rank\": 96,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class MRMLIDImageIO_EXPORT MRMLIDImageIOFactory : public ObjectFactoryBase\\n\\n{\\n\\npublic:\\n\\n /** Standard class typedefs. */\\n\\n typedef MRMLIDImageIOFactory Self;\\n\\n typedef ObjectFactoryBase Superclass;\\n\\n typedef SmartPointer<Self> Pointer;\\n\\n typedef SmartPointer<const Self> ConstPointer;\\n\\n\\n\\n /** Class methods used to interface with the registered factories. */\\n\\n virtual const char* GetITKSourceVersion(void) const ITK_OVERRIDE;\\n\\n virtual const char* GetDescription(void) const ITK_OVERRIDE;\\n\\n\\n\\n /** Method for class instantiation. */\\n\\n itkFactorylessNewMacro(Self);\\n\\n static MRMLIDImageIOFactory* FactoryNew() { return new MRMLIDImageIOFactory;}\\n\\n\\n\\n /** Run-time type information (and related methods). */\\n\\n itkTypeMacro(MRMLIDImageIOFactory, ObjectFactoryBase);\\n\\n\\n\",\n \"file_path\": \"Libs/MRML/IDImageIO/itkMRMLIDImageIOFactory.h\",\n \"rank\": 97,\n \"score\": 199181.9765651346\n },\n {\n \"content\": \"class Q_SLICER_BASE_QTCORE_EXPORT qSlicerAbstractModuleRepresentation : virtual public qSlicerObject\\n\\n{\\n\\npublic:\\n\\n\\n\\n typedef qSlicerObject Superclass;\\n\\n qSlicerAbstractModuleRepresentation();\\n\\n virtual ~qSlicerAbstractModuleRepresentation();\\n\\n\\n\\n /// Set/Get module name\\n\\n QString moduleName()const;\\n\\n\\n\\n /// Returns the module the representation belongs to.\\n\\n /// The module is set right before setup() is called.\\n\\n qSlicerAbstractCoreModule* module()const;\\n\\n\\n\\n /// Allows other modules to select input and output nodes in the module's GUI.\\n\\n /// There may be multiple node selectors in a module widget, you can select between them\\n\\n /// using the role argument.\\n\\n /// Context can be specified to make a selection within that node (for example, a markup list\\n\\n /// node may contain multiple markups; context can be used to select a specific item).\\n\",\n \"file_path\": \"Base/QTCore/qSlicerAbstractModuleRepresentation.h\",\n \"rank\": 98,\n \"score\": 197863.96431080392\n },\n {\n \"content\": \"/// \\\\ingroup SlicerRt_QtModules_Segmentations\\n\\n/// \\\\class qSlicerSegmentEditorEffectFactory\\n\\n/// \\\\brief Singleton class managing segment editor effect plugins\\n\\nclass Q_SLICER_SEGMENTATIONS_EFFECTS_EXPORT qSlicerSegmentEditorEffectFactory : public QObject\\n\\n{\\n\\n Q_OBJECT\\n\\n\\n\\npublic:\\n\\n /// Instance getter for the singleton class\\n\\n /// \\\\return Instance object\\n\\n Q_INVOKABLE static qSlicerSegmentEditorEffectFactory* instance();\\n\\n\\n\\n /// Allows cleanup of the singleton at application exit\\n\\n static void setInstance(qSlicerSegmentEditorEffectFactory* instance);\\n\\n\\n\\npublic:\\n\\n /// Register a effect\\n\\n /// \\\\return True if effect registered successfully, false otherwise\\n\\n Q_INVOKABLE bool registerEffect(qSlicerSegmentEditorAbstractEffect* effect);\\n\\n\\n\\n /// Get list of registered effects\\n\\n Q_INVOKABLE QList<qSlicerSegmentEditorAbstractEffect*> registeredEffects() { return m_RegisteredEffects; };\\n\\n\\n\",\n \"file_path\": \"Modules/Loadable/Segmentations/EditorEffects/qSlicerSegmentEditorEffectFactory.h\",\n \"rank\": 99,\n \"score\": 197067.47933379596\n }\n]","isConversational":false}}},{"rowIdx":490,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"main/sw/source/ui/docvw/SidebarTxtControlAcc.cxx"},"repo_name":{"kind":"string","value":"Grosskopf/openoffice"},"commit":{"kind":"string","value":"93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7"},"file_code":{"kind":"string","value":"\n\n#include \"precompiled_sw.hxx\"\n\n#include <SidebarTxtControlAcc.hxx>\n\n#include <SidebarTxtControl.hxx>\n\n#include <svl/brdcst.hxx>\n#include <toolkit/awt/vclxaccessiblecomponent.hxx>\n#include <editeng/unoedsrc.hxx>\n#include <editeng/unoforou.hxx>\n#include <editeng/unoviwou.hxx>\n#include <editeng/unoedhlp.hxx>\n#include <svx/AccessibleTextHelper.hxx>\n#include <editeng/outliner.hxx>\n\nnamespace css = ::com::sun::star;\n\nnamespace sw { namespace sidebarwindows {\n\nclass SidebarTextEditSource : public SvxEditSource,\n public SfxBroadcaster\n{\n public:\n SidebarTextEditSource( SidebarTxtControl& rSidebarTxtControl );\n virtual ~SidebarTextEditSource();\n\n virtual SvxEditSource* Clone() const;\n\n virtual SvxTextForwarder* GetTextForwarder();\n virtual SvxViewForwarder* GetViewForwarder();\n virtual SvxEditViewForwarder* GetEditViewForwarder( sal_Bool bCreate = sal_False );\n\n virtual void UpdateData();\n\n virtual SfxBroadcaster& GetBroadcaster() const;\n DECL_LINK( NotifyHdl, EENotify* );\n\n private:\n SidebarTxtControl& mrSidebarTxtControl;\n SvxOutlinerForwarder mTextForwarder;\n SvxDrawOutlinerViewForwarder mViewForwarder;\n};\n\nSidebarTextEditSource::SidebarTextEditSource( SidebarTxtControl& rSidebarTxtControl )\n : SvxEditSource()\n , mrSidebarTxtControl( rSidebarTxtControl )\n , mTextForwarder( *(rSidebarTxtControl.GetTextView()->GetOutliner()), sal_False )\n , mViewForwarder( *(rSidebarTxtControl.GetTextView()) )\n{\n if ( mrSidebarTxtControl.GetTextView() )\n {\n mrSidebarTxtControl.GetTextView()->GetOutliner()->SetNotifyHdl( LINK(this, SidebarTextEditSource, NotifyHdl) );\n }\n}\n\nSidebarTextEditSource::~SidebarTextEditSource()\n{\n if ( mrSidebarTxtControl.GetTextView() )\n {\n mrSidebarTxtControl.GetTextView()->GetOutliner()->SetNotifyHdl( Link() );\n }\n}\n\nSvxEditSource* SidebarTextEditSource::Clone() const\n{\n return new SidebarTextEditSource( mrSidebarTxtControl );\n}\n\nSvxTextForwarder* SidebarTextEditSource::GetTextForwarder()\n{\n return &mTextForwarder;\n}\n\nSvxViewForwarder* SidebarTextEditSource::GetViewForwarder()\n{\n return &mViewForwarder;\n}\n\nSvxEditViewForwarder* SidebarTextEditSource::GetEditViewForwarder( sal_Bool )\n{\n return &mViewForwarder;\n}\n\nvoid SidebarTextEditSource::UpdateData()\n{\n \n}\n\nSfxBroadcaster& SidebarTextEditSource::GetBroadcaster() const\n{\n return *( const_cast< SidebarTextEditSource* > (this) );\n}\n\nIMPL_LINK(SidebarTextEditSource, NotifyHdl, EENotify*, pNotify)\n{\n if ( pNotify )\n {\n ::std::auto_ptr< SfxHint > aHint( SvxEditSourceHelper::EENotification2Hint( pNotify ) );\n\n if( aHint.get() )\n {\n Broadcast( *aHint.get() );\n }\n }\n\n return 0;\n}\n\nclass SidebarTxtControlAccessibleContext : public VCLXAccessibleComponent\n{\n public:\n explicit SidebarTxtControlAccessibleContext( SidebarTxtControl& rSidebarTxtControl );\n virtual ~SidebarTxtControlAccessibleContext();\n\n virtual sal_Int32 SAL_CALL\n getAccessibleChildCount()\n throw (::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible > SAL_CALL\n getAccessibleChild( sal_Int32 i )\n throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n\n using WeakAggComponentImplHelperBase::addEventListener;\n using WeakAggComponentImplHelperBase::removeEventListener;\n\n virtual void SAL_CALL\n addEventListener (\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessibleEventListener >& xListener)\n throw (::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL\n removeEventListener (\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessibleEventListener >& xListener)\n throw (::com::sun::star::uno::RuntimeException);\n\n protected:\n virtual void ProcessWindowEvent( const VclWindowEvent& rVclWindowEvent );\n\n private:\n SidebarTxtControl& mrSidebarTxtControl;\n ::accessibility::AccessibleTextHelper* mpAccessibleTextHelper;\n\n ::vos::OMutex maMutex;\n\n void defunc();\n};\n\nSidebarTxtControlAccessibleContext::SidebarTxtControlAccessibleContext( SidebarTxtControl& rSidebarTxtControl )\n : VCLXAccessibleComponent( rSidebarTxtControl.GetWindowPeer() )\n , mrSidebarTxtControl( rSidebarTxtControl )\n , mpAccessibleTextHelper( 0 )\n , maMutex()\n{\n ::std::auto_ptr<SvxEditSource> pEditSource(\n new SidebarTextEditSource( mrSidebarTxtControl ) );\n mpAccessibleTextHelper = new ::accessibility::AccessibleTextHelper( pEditSource );\n mpAccessibleTextHelper->SetEventSource( mrSidebarTxtControl.GetWindowPeer() );\n}\n\nSidebarTxtControlAccessibleContext::~SidebarTxtControlAccessibleContext()\n{\n defunc();\n}\n\nvoid SidebarTxtControlAccessibleContext::defunc()\n{\n delete mpAccessibleTextHelper;\n mpAccessibleTextHelper = 0;\n}\n\nsal_Int32 SAL_CALL SidebarTxtControlAccessibleContext::getAccessibleChildCount()\n throw (::com::sun::star::uno::RuntimeException)\n{\n vos::OGuard aGuard( maMutex );\n\n sal_Int32 nChildCount( 0 );\n\n if ( mpAccessibleTextHelper )\n {\n nChildCount = mpAccessibleTextHelper->GetChildCount();\n }\n\n return nChildCount;\n}\n\ncss::uno::Reference< css::accessibility::XAccessible > SAL_CALL SidebarTxtControlAccessibleContext::getAccessibleChild( sal_Int32 i )\n throw ( css::lang::IndexOutOfBoundsException, css::uno::RuntimeException )\n{\n vos::OGuard aGuard( maMutex );\n\n css::uno::Reference< css::accessibility::XAccessible > xChild;\n\n if ( mpAccessibleTextHelper )\n {\n xChild = mpAccessibleTextHelper->GetChild( i );\n }\n\n return xChild;\n}\n\nvoid SAL_CALL SidebarTxtControlAccessibleContext::addEventListener (\n const css::uno::Reference< css::accessibility::XAccessibleEventListener >& xListener)\n throw (css::uno::RuntimeException)\n{\n vos::OGuard aGuard( maMutex );\n\n if ( mpAccessibleTextHelper )\n {\n mpAccessibleTextHelper->AddEventListener(xListener);\n }\n}\n\nvoid SAL_CALL SidebarTxtControlAccessibleContext::removeEventListener (\n const css::uno::Reference< css::accessibility::XAccessibleEventListener >& xListener)\n throw (css::uno::RuntimeException)\n{\n vos::OGuard aGuard( maMutex );\n\n if ( mpAccessibleTextHelper )\n {\n mpAccessibleTextHelper->RemoveEventListener(xListener);\n }\n}\n\nvoid SidebarTxtControlAccessibleContext::ProcessWindowEvent( const VclWindowEvent& rVclWindowEvent )\n{\n if ( mpAccessibleTextHelper )\n {\n switch ( rVclWindowEvent.GetId() )\n {\n case VCLEVENT_OBJECT_DYING:\n {\n defunc();\n }\n break;\n case VCLEVENT_WINDOW_GETFOCUS:\n case VCLEVENT_CONTROL_GETFOCUS:\n {\n mpAccessibleTextHelper->SetFocus( sal_True );\n }\n break;\n case VCLEVENT_WINDOW_LOSEFOCUS:\n case VCLEVENT_CONTROL_LOSEFOCUS:\n {\n mpAccessibleTextHelper->SetFocus( sal_False );\n }\n break;\n }\n }\n\n VCLXAccessibleComponent::ProcessWindowEvent( rVclWindowEvent );\n}\n\nSidebarTxtControlAccessible::SidebarTxtControlAccessible( SidebarTxtControl& rSidebarTxtControl )\n : VCLXWindow()\n , mrSidebarTxtControl( rSidebarTxtControl )\n{\n SetWindow( &mrSidebarTxtControl );\n}\n\nSidebarTxtControlAccessible::~SidebarTxtControlAccessible()\n{\n}\n\ncss::uno::Reference< css::accessibility::XAccessibleContext > SidebarTxtControlAccessible::CreateAccessibleContext()\n{\n SidebarTxtControlAccessibleContext* pAccContext(\n new SidebarTxtControlAccessibleContext( mrSidebarTxtControl ) );\n css::uno::Reference< css::accessibility::XAccessibleContext > xAcc( pAccContext );\n return xAcc;\n}\n\n} } \n\n"},"prefix":{"kind":"string","value":"\n\n#include \"precompiled_sw.hxx\"\n\n#include <SidebarTxtControlAcc.hxx>\n\n#include <SidebarTxtControl.hxx>\n\n#include <svl/brdcst.hxx>\n#include <toolkit/awt/vclxaccessiblecomponent.hxx>\n#include <editeng/unoedsrc.hxx>\n#include <editeng/unoforou.hxx>\n#include <editeng/unoviwou.hxx>\n#include <editeng/unoedhlp.hxx>\n#include <svx/AccessibleTextHelper.hxx>\n#include <editeng/outliner.hxx>\n\nnamespace css = ::com::sun::star;\n\nnamespace sw { namespace sidebarwindows {\n\nclass SidebarTextEditSource : public SvxEditSource,\n public SfxBroadcaster\n{\n public:\n SidebarTextEditSource( SidebarTxtControl& rSidebarTxtControl );\n virtual ~SidebarTextEditSource();\n\n virtual SvxEditSource* Clone() const;\n\n virtual SvxTextForwarder* GetTextForwarder();\n virtual SvxViewForwarder* GetViewForwarder();\n virtual SvxEditViewForwarder* GetEditViewForwarder( sal_Bool bCreate = sal_False );\n\n virtual void UpdateData();\n\n virtual SfxBroadcaster& GetBroadcaster() const;\n DECL_LINK( NotifyHdl, EENotify* );\n\n private:\n SidebarTxtControl& mrSidebarTxtControl;\n SvxOutlinerForwarder mTextForwarder;\n SvxDrawOutlinerViewForwarder mViewForwarder;\n};\n\nSidebarTextEditSource::SidebarTextEditSource( SidebarTxtControl& rSidebarTxtControl )\n : SvxEditSource()\n , mrSidebarTxtControl( rSidebarTxtControl )\n , mTextForwarder( *(rSidebarTxtControl.GetTextView()->GetOutliner()), sal_False )\n , mViewForwarder( *(rSidebarTxtControl.GetTextView()) )\n{\n "},"suffix":{"kind":"string","value":"\n}\n\nSidebarTextEditSource::~SidebarTextEditSource()\n{\n if ( mrSidebarTxtControl.GetTextView() )\n {\n mrSidebarTxtControl.GetTextView()->GetOutliner()->SetNotifyHdl( Link() );\n }\n}\n\nSvxEditSource* SidebarTextEditSource::Clone() const\n{\n return new SidebarTextEditSource( mrSidebarTxtControl );\n}\n\nSvxTextForwarder* SidebarTextEditSource::GetTextForwarder()\n{\n return &mTextForwarder;\n}\n\nSvxViewForwarder* SidebarTextEditSource::GetViewForwarder()\n{\n return &mViewForwarder;\n}\n\nSvxEditViewForwarder* SidebarTextEditSource::GetEditViewForwarder( sal_Bool )\n{\n return &mViewForwarder;\n}\n\nvoid SidebarTextEditSource::UpdateData()\n{\n \n}\n\nSfxBroadcaster& SidebarTextEditSource::GetBroadcaster() const\n{\n return *( const_cast< SidebarTextEditSource* > (this) );\n}\n\nIMPL_LINK(SidebarTextEditSource, NotifyHdl, EENotify*, pNotify)\n{\n if ( pNotify )\n {\n ::std::auto_ptr< SfxHint > aHint( SvxEditSourceHelper::EENotification2Hint( pNotify ) );\n\n if( aHint.get() )\n {\n Broadcast( *aHint.get() );\n }\n }\n\n return 0;\n}\n\nclass SidebarTxtControlAccessibleContext : public VCLXAccessibleComponent\n{\n public:\n explicit SidebarTxtControlAccessibleContext( SidebarTxtControl& rSidebarTxtControl );\n virtual ~SidebarTxtControlAccessibleContext();\n\n virtual sal_Int32 SAL_CALL\n getAccessibleChildCount()\n throw (::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible > SAL_CALL\n getAccessibleChild( sal_Int32 i )\n throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n\n using WeakAggComponentImplHelperBase::addEventListener;\n using WeakAggComponentImplHelperBase::removeEventListener;\n\n virtual void SAL_CALL\n addEventListener (\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessibleEventListener >& xListener)\n throw (::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL\n removeEventListener (\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::accessibility::XAccessibleEventListener >& xListener)\n throw (::com::sun::star::uno::RuntimeException);\n\n protected:\n virtual void ProcessWindowEvent( const VclWindowEvent& rVclWindowEvent );\n\n private:\n SidebarTxtControl& mrSidebarTxtControl;\n ::accessibility::AccessibleTextHelper* mpAccessibleTextHelper;\n\n ::vos::OMutex maMutex;\n\n void defunc();\n};\n\nSidebarTxtControlAccessibleContext::SidebarTxtControlAccessibleContext( SidebarTxtControl& rSidebarTxtControl )\n : VCLXAccessibleComponent( rSidebarTxtControl.GetWindowPeer() )\n , mrSidebarTxtControl( rSidebarTxtControl )\n , mpAccessibleTextHelper( 0 )\n , maMutex()\n{\n ::std::auto_ptr<SvxEditSource> pEditSource(\n new SidebarTextEditSource( mrSidebarTxtControl ) );\n mpAccessibleTextHelper = new ::accessibility::AccessibleTextHelper( pEditSource );\n mpAccessibleTextHelper->SetEventSource( mrSidebarTxtControl.GetWindowPeer() );\n}\n\nSidebarTxtControlAccessibleContext::~SidebarTxtControlAccessibleContext()\n{\n defunc();\n}\n\nvoid SidebarTxtControlAccessibleContext::defunc()\n{\n delete mpAccessibleTextHelper;\n mpAccessibleTextHelper = 0;\n}\n\nsal_Int32 SAL_CALL SidebarTxtControlAccessibleContext::getAccessibleChildCount()\n throw (::com::sun::star::uno::RuntimeException)\n{\n vos::OGuard aGuard( maMutex );\n\n sal_Int32 nChildCount( 0 );\n\n if ( mpAccessibleTextHelper )\n {\n nChildCount = mpAccessibleTextHelper->GetChildCount();\n }\n\n return nChildCount;\n}\n\ncss::uno::Reference< css::accessibility::XAccessible > SAL_CALL SidebarTxtControlAccessibleContext::getAccessibleChild( sal_Int32 i )\n throw ( css::lang::IndexOutOfBoundsException, css::uno::RuntimeException )\n{\n vos::OGuard aGuard( maMutex );\n\n css::uno::Reference< css::accessibility::XAccessible > xChild;\n\n if ( mpAccessibleTextHelper )\n {\n xChild = mpAccessibleTextHelper->GetChild( i );\n }\n\n return xChild;\n}\n\nvoid SAL_CALL SidebarTxtControlAccessibleContext::addEventListener (\n const css::uno::Reference< css::accessibility::XAccessibleEventListener >& xListener)\n throw (css::uno::RuntimeException)\n{\n vos::OGuard aGuard( maMutex );\n\n if ( mpAccessibleTextHelper )\n {\n mpAccessibleTextHelper->AddEventListener(xListener);\n }\n}\n\nvoid SAL_CALL SidebarTxtControlAccessibleContext::removeEventListener (\n const css::uno::Reference< css::accessibility::XAccessibleEventListener >& xListener)\n throw (css::uno::RuntimeException)\n{\n vos::OGuard aGuard( maMutex );\n\n if ( mpAccessibleTextHelper )\n {\n mpAccessibleTextHelper->RemoveEventListener(xListener);\n }\n}\n\nvoid SidebarTxtControlAccessibleContext::ProcessWindowEvent( const VclWindowEvent& rVclWindowEvent )\n{\n if ( mpAccessibleTextHelper )\n {\n switch ( rVclWindowEvent.GetId() )\n {\n case VCLEVENT_OBJECT_DYING:\n {\n defunc();\n }\n break;\n case VCLEVENT_WINDOW_GETFOCUS:\n case VCLEVENT_CONTROL_GETFOCUS:\n {\n mpAccessibleTextHelper->SetFocus( sal_True );\n }\n break;\n case VCLEVENT_WINDOW_LOSEFOCUS:\n case VCLEVENT_CONTROL_LOSEFOCUS:\n {\n mpAccessibleTextHelper->SetFocus( sal_False );\n }\n break;\n }\n }\n\n VCLXAccessibleComponent::ProcessWindowEvent( rVclWindowEvent );\n}\n\nSidebarTxtControlAccessible::SidebarTxtControlAccessible( SidebarTxtControl& rSidebarTxtControl )\n : VCLXWindow()\n , mrSidebarTxtControl( rSidebarTxtControl )\n{\n SetWindow( &mrSidebarTxtControl );\n}\n\nSidebarTxtControlAccessible::~SidebarTxtControlAccessible()\n{\n}\n\ncss::uno::Reference< css::accessibility::XAccessibleContext > SidebarTxtControlAccessible::CreateAccessibleContext()\n{\n SidebarTxtControlAccessibleContext* pAccContext(\n new SidebarTxtControlAccessibleContext( mrSidebarTxtControl ) );\n css::uno::Reference< css::accessibility::XAccessibleContext > xAcc( pAccContext );\n return xAcc;\n}\n\n} } \n\n"},"middle":{"kind":"string","value":"if ( mrSidebarTxtControl.GetTextView() )\n {\n mrSidebarTxtControl.GetTextView()->GetOutliner()->SetNotifyHdl( LINK(this, SidebarTextEditSource, NotifyHdl) );\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":491,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Operations/albaOpExporterAnsysCommon.cpp"},"repo_name":{"kind":"string","value":"IOR-BIC/ALBA"},"commit":{"kind":"string","value":"b574968b05d9a3a2756dd2ac61d015a0d20232a4"},"file_code":{"kind":"string","value":"\n\n#include \"albaDefines.h\" \n\n#include \"albaOpExporterAnsysCommon.h\"\n#include \"albaOpImporterAnsysCommon.h\"\n\n#include \"albaDecl.h\"\n#include \"albaGUI.h\"\n\n#include \"albaSmartPointer.h\"\n#include \"albaTagItem.h\"\n#include \"albaTagArray.h\"\n#include \"albaVME.h\"\n#include \"albaVMEMesh.h\"\n#include \"albaVMEMeshAnsysTextExporter.h\"\n#include \"albaAbsMatrixPipe.h\"\n\n#include <iostream>\n#include <fstream>\n\n#include \"vtkALBASmartPointer.h\"\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkPointData.h\"\n#include \"vtkCellData.h\"\n#include \"vtkFieldData.h\"\n#include \"vtkTransform.h\"\n#include \"vtkTransformFilter.h\"\n\n#include <vcl_string.h>\n#include <vcl_fstream.h>\n#include <vcl_sstream.h>\n#include <vcl_map.h>\n#include <vcl_vector.h>\n#include \"wx/stdpaths.h\"\n\nalbaCxxAbstractTypeMacro(albaOpExporterAnsysCommon); \n\nalbaOpExporterAnsysCommon::albaOpExporterAnsysCommon(const wxString &label) :\nalbaOpExporterFEMCommon(label)\n{\n m_AnsysOutputFileNameFullPath\t\t= \"\";\n}\n\nalbaOpExporterAnsysCommon::~albaOpExporterAnsysCommon()\n{\n\n}\n\nvoid albaOpExporterAnsysCommon::OpRun() \n{\n\tInit();\n CreateGui();\n}\n\nvoid albaOpExporterAnsysCommon::OnOK()\n{\n albaString wildcard = GetWildcard();\n\n m_AnsysOutputFileNameFullPath = \"\";\n\n wxString f;\n f = albaGetSaveFile(\"\",wildcard).c_str(); \n if(!f.IsEmpty())\n {\n m_AnsysOutputFileNameFullPath = f;\n Write();\n }\n}\n\nvoid albaOpExporterAnsysCommon::OpStop(int result)\n{\n HideGui();\n albaEventMacro(albaEvent(this,result)); \n}\n\nvoid albaOpExporterAnsysCommon::Init()\n{\n albaVMEMesh *input = albaVMEMesh::SafeDownCast(m_Input);\n assert(input);\n\n vtkUnstructuredGrid *inputUGrid = input->GetUnstructuredGridOutput()->GetUnstructuredGridData();\n\n if(inputUGrid != NULL)\n {\n \n m_TotalElements = inputUGrid->GetNumberOfPoints(); \n\n m_TotalElements += inputUGrid->GetNumberOfCells(); \n\n vtkDataArray *materialsIDArray = NULL;\n materialsIDArray = inputUGrid->GetCellData()->GetArray(\"EX\");\n\n\t\tif (materialsIDArray != NULL)\n\t\t{\n\t\t\tm_TotalElements += materialsIDArray->GetNumberOfTuples(); \n\t\t}\n }\n}\n\nint albaOpExporterAnsysCommon::compareElem(const void *p1, const void *p2) \n{\n ExportElement *a, *b;\n a = (ExportElement *)p1;\n b = (ExportElement *)p2;\n\n double result;\n\n\t\n\t\n\t\n\t\n\n result = a->elementType - b->elementType; \n if (result < 0)\n return -1;\n else if (result > 0)\n return 1;\n else\n {\n result = a->matID - b->matID; \n if (result < 0)\n return -1;\n else if (result > 0)\n return 1;\n else\n\t\t{\n\t\t\tresult = a->elementID - b->elementID;\n\t\t\tif (result < 0)\n\t\t\t\treturn -1;\n\t\t\telse if (result > 0)\n\t\t\t\treturn 1;\n\t\t\telse\n\t\t\t\tassert(0); \n\t\t}\n }\n}\n\nExportElement *albaOpExporterAnsysCommon::CreateExportElements(albaVMEMesh * input, int rowsNumber, vtkUnstructuredGrid * inputUGrid, FILE * file)\n{\n \n vtkIntArray *elementIdArray = input->GetElementsIDArray();\n\n \n vtkIntArray *nodesIDArray = input->GetNodesIDArray();\n\n \n vtkIntArray *typeArray = input->GetElementsTypeArray();\n\n \n vtkIntArray *realArray = input->GetElementsRealArray();\n\n ExportElement *exportVector = new ExportElement[rowsNumber];\n\n int currType=-1;\n\n for (int rowID = 0 ; rowID < rowsNumber ; rowID++)\n {\n exportVector[rowID].elementID = elementIdArray ? elementIdArray->GetValue(rowID) : rowID+1;\n exportVector[rowID].matID = GetMatIdArray() ? GetMatIdArray()[rowID] : 1;\n exportVector[rowID].elementType = typeArray ? typeArray->GetValue(rowID) : 1;\n exportVector[rowID].elementReal = realArray ? realArray->GetValue(rowID) : 1;\n exportVector[rowID].cellID=rowID;\n }\n\n qsort(exportVector, rowsNumber, sizeof(ExportElement), compareElem);\n\n for (int rowID = 0 ; rowID < rowsNumber ; rowID++)\n {\n if(currType != exportVector[rowID].elementType)\n {\n int mode;\n\n vtkCell *currentCell = inputUGrid->GetCell(exportVector[rowID].cellID);\n vtkIdList *idList = currentCell->GetPointIds();\n int cellNpoints=currentCell->GetNumberOfPoints();\n\n switch (cellNpoints)\n {\n case 4:\n mode = 285;\n break;\n\n case 8: \n mode = 45;\n break;\n\n case 10: \n mode = 187;\n break;\n\n case 20: \n mode = 186;\n break;\n\n default:\n mode = -1;\n break;\n }\n\n currType = exportVector[rowID].elementType;\n fprintf(file,\"ET,%d,%d\\n\", currType, mode);\n }\n }\n\n return exportVector;\n}\n\n"},"prefix":{"kind":"string","value":"\n\n#include \"albaDefines.h\" \n\n#include \"albaOpExporterAnsysCommon.h\"\n#include \"albaOpImporterAnsysCommon.h\"\n\n#include \"albaDecl.h\"\n#include \"albaGUI.h\"\n\n#include \"albaSmartPointer.h\"\n#include \"albaTagItem.h\"\n#include \"albaTagArray.h\"\n#include \"albaVME.h\"\n#include \"albaVMEMesh.h\"\n#include \"albaVMEMeshAnsysTextExporter.h\"\n#include \"albaAbsMatrixPipe.h\"\n\n#include <iostream>\n#include <fstream>\n\n#include \"vtkALBASmartPointer.h\"\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkDoubleArray.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkPointData.h\"\n#include \"vtkCellData.h\"\n#include \"vtkFieldData.h\"\n#include \"vtkTransform.h\"\n#include \"vtkTransformFilter.h\"\n\n#include <vcl_string.h>\n#include <vcl_fstream.h>\n#include <vcl_sstream.h>\n#include <vcl_map.h>\n#include <vcl_vector.h>\n#include \"wx/stdpaths.h\"\n\nalbaCxxAbstractTypeMacro(albaOpExporterAnsysCommon); \n\nalbaOpExporterAnsysCommon::albaOpExporterAnsysCommon(const wxString &label) :\nalbaOpExporterFEMCommon(label)\n{\n m_AnsysOutputFileNameFullPath\t\t= \"\";\n}\n\nalbaOpExporterAnsysCommon::~albaOpExporterAnsysCommon()\n{\n\n}\n\nvoid albaOpExporterAnsysCommon::OpRun() \n{\n\tInit();\n CreateGui();\n}\n\nvoid albaOpExporterAnsysCommon::OnOK()\n{\n albaString wildcard = GetWildcard();\n\n m_AnsysOutputFileNameFullPath = \"\";\n\n wxString f;\n f = albaGetSaveFile(\"\",wildcard).c_str(); \n if(!f.IsEmpty())\n {\n m_AnsysOutputFileNameFullPath = f;\n Write();\n }\n}\n\nvoid albaOpExporterAnsysCommon::OpStop(int result)\n{\n HideGui();\n albaEventMacro(albaEvent(this,result)); \n}\n\nvoid albaOpExporterAnsysCommon::Init()\n{\n albaVMEMesh *input = albaVMEMesh::SafeDownCast(m_Input);\n assert(input);\n\n vtkUnstructuredGrid *inputUGrid = input->GetUnstructuredGridOutput()->GetUnstructuredGridData();\n\n if(inputUGrid != NULL)\n {\n \n m_TotalElements = inputUGrid->GetNumberOfPoints(); \n\n m_TotalElements += inputUGrid->GetNumberOfCells(); \n\n vtkDataArray *materialsIDArray = NULL;\n materialsIDArray = inputUGrid->GetCellData()->GetArray(\"EX\");\n\n\t\tif (materialsIDArray != NULL)\n\t\t{\n\t\t\tm_TotalElements += materialsIDArray->GetNumberOfTuples(); \n\t\t}\n }\n}\n\nint albaOpExporterAnsysCommon::compareElem(const void *p1, const void *p2) \n{\n ExportElement *a, *b;\n a = (ExportElement *)p1;\n b = (ExportElement *)p2;\n\n double result;\n\n\t\n\t\n\t\n\t\n\n result = a->elementType - b->elementType; \n if (result < 0)\n return -1;\n else if (result > 0)\n return 1;\n else\n {\n result = a->matID - b->matID; \n "},"suffix":{"kind":"string","value":"\n }\n}\n\nExportElement *albaOpExporterAnsysCommon::CreateExportElements(albaVMEMesh * input, int rowsNumber, vtkUnstructuredGrid * inputUGrid, FILE * file)\n{\n \n vtkIntArray *elementIdArray = input->GetElementsIDArray();\n\n \n vtkIntArray *nodesIDArray = input->GetNodesIDArray();\n\n \n vtkIntArray *typeArray = input->GetElementsTypeArray();\n\n \n vtkIntArray *realArray = input->GetElementsRealArray();\n\n ExportElement *exportVector = new ExportElement[rowsNumber];\n\n int currType=-1;\n\n for (int rowID = 0 ; rowID < rowsNumber ; rowID++)\n {\n exportVector[rowID].elementID = elementIdArray ? elementIdArray->GetValue(rowID) : rowID+1;\n exportVector[rowID].matID = GetMatIdArray() ? GetMatIdArray()[rowID] : 1;\n exportVector[rowID].elementType = typeArray ? typeArray->GetValue(rowID) : 1;\n exportVector[rowID].elementReal = realArray ? realArray->GetValue(rowID) : 1;\n exportVector[rowID].cellID=rowID;\n }\n\n qsort(exportVector, rowsNumber, sizeof(ExportElement), compareElem);\n\n for (int rowID = 0 ; rowID < rowsNumber ; rowID++)\n {\n if(currType != exportVector[rowID].elementType)\n {\n int mode;\n\n vtkCell *currentCell = inputUGrid->GetCell(exportVector[rowID].cellID);\n vtkIdList *idList = currentCell->GetPointIds();\n int cellNpoints=currentCell->GetNumberOfPoints();\n\n switch (cellNpoints)\n {\n case 4:\n mode = 285;\n break;\n\n case 8: \n mode = 45;\n break;\n\n case 10: \n mode = 187;\n break;\n\n case 20: \n mode = 186;\n break;\n\n default:\n mode = -1;\n break;\n }\n\n currType = exportVector[rowID].elementType;\n fprintf(file,\"ET,%d,%d\\n\", currType, mode);\n }\n }\n\n return exportVector;\n}\n\n"},"middle":{"kind":"string","value":"if (result < 0)\n return -1;\n else if (result > 0)\n return 1;\n else\n\t\t{\n\t\t\tresult = a->elementID - b->elementID;\n\t\t\tif (result < 0)\n\t\t\t\treturn -1;\n\t\t\telse if (result > 0)\n\t\t\t\treturn 1;\n\t\t\telse\n\t\t\t\tassert(0); \n\t\t}"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":" function is of type void *, and returns NULL.\n\n Otherwise the type is void which is correct for WIN32\n\n and SPROC\n\n*/ \n\n#ifdef CMAKE_USE_SPROC_INIT\n\ntypedef int mmuThreadProcessIDType;\n\n#endif\n\n\n\n\n\n#ifdef CMAKE_USE_PTHREADS_INIT\n\ntypedef void *(*mmuInternalThreadFunctionType)(void *);\n\ntypedef pthread_t mmuThreadProcessIDType;\n\n#endif\n\n\n\n#ifdef CMAKE_USE_WIN32_THREADS_INIT\n\ntypedef LPTHREAD_START_ROUTINE mmuInternalThreadFunctionType;\n\ntypedef HANDLE mmuThreadProcessIDType;\n\n#endif\n\n\n\n#if !defined(CMAKE_USE_PTHREADS_INIT) && !defined(CMAKE_USE_WIN32_THREADS_INIT)\n\ntypedef void (*mmuInternalThreadFunctionType)(void *);\n\ntypedef int mmuThreadProcessIDType;\n\n#endif\n\n\n\n\n","file_path":"Base/albaMultiThreader.h","rank":0,"score":233669.75963329288},{"content":" def __init__(self):\n\n AbstractRule.__init__(self)\n","file_path":"qa/Rules/ClassStructureRules/UselessIncludesRule.py","rank":1,"score":98174.05697326675},{"content":"static GLboolean _glewInit_GL_ARB_shading_language_include (GLEW_CONTEXT_ARG_DEF_INIT)\n\n{\n\n GLboolean r = GL_FALSE;\n\n\n\n r = ((glCompileShaderIncludeARB = (PFNGLCOMPILESHADERINCLUDEARBPROC)glewGetProcAddress((const GLubyte*)\"glCompileShaderIncludeARB\")) == NULL) || r;\n\n r = ((glDeleteNamedStringARB = (PFNGLDELETENAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\"glDeleteNamedStringARB\")) == NULL) || r;\n\n r = ((glGetNamedStringARB = (PFNGLGETNAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\"glGetNamedStringARB\")) == NULL) || r;\n\n r = ((glGetNamedStringivARB = (PFNGLGETNAMEDSTRINGIVARBPROC)glewGetProcAddress((const GLubyte*)\"glGetNamedStringivARB\")) == NULL) || r;\n\n r = ((glIsNamedStringARB = (PFNGLISNAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\"glIsNamedStringARB\")) == NULL) || r;\n\n r = ((glNamedStringARB = (PFNGLNAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\"glNamedStringARB\")) == NULL) || r;\n\n\n\n return r;\n","file_path":"GPUAPI/GLEW/glew.c","rank":2,"score":98174.05697326675},{"content":"//----------------------------------------------------------------------------\n\n// Constants :\n\n//----------------------------------------------------------------------------\n\nenum LABEL_EXTRACTOR_WIDGET_ID\n\n{\n\n\tID_LABEL = MINID,\t\n\n ID_SMOOTH,\n\n ID_RADIUS_FACTOR,\n\n ID_STD_DEVIATION,\n\n ID_SAMPLING_RATE,\n\n ID_RADIUS_FACTOR_AFTER,\n\n ID_STD_DEVIATION_AFTER,\n\n ID_LABELS,\n\n\tID_NAME,\n\n};\n\n\n\n//-----------------------------------------------------------------------\n\nbool albaOpLabelExtractor::RetrieveTag()\n\n//----------------------------------------------------------------------\n\n{ \n\n bool tagPresent = m_Input->GetTagArray()->IsTagPresent(\"LABELS\");\n\n if (tagPresent)\n\n {\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":3,"score":71588.89098228574},{"content":"//----------------------------------------------------------------------------\n\n// forward references :\n\n//----------------------------------------------------------------------------\n\nclass albaVMELabeledVolume;\n","file_path":"Operations/albaOpCreateLabeledVolume.h","rank":4,"score":71588.89098228574},{"content":"class albaResultQueryAbstractHandlerSample : public albaResultQueryAbstractHandler\n\n{\n\npublic:\n\n /** constructor */\n\n albaResultQueryAbstractHandlerSample();\n\n /** destructor */\n\n virtual ~albaResultQueryAbstractHandlerSample(){}; \n\n\n\n /** RTTI macro */\n\n albaTypeMacro(albaResultQueryAbstractHandlerSample, albaResultQueryAbstractHandler);\n\n\n\n /** load result of Query */\n\n /*virtual void*/ void LoadQueryResult();\n\n\n\n /** load result of Query */\n\n /*virtual*/ bool IsFailed();\n\n\n\n};\n\n\n\n//----------------------------------------------------------------------------\n","file_path":"Testing/Common/albaResultQueryAbstractHandlerTest.cpp","rank":5,"score":69280.813882646},{"content":" class name: albaResultQueryAbstractHandler\n\n Interface for handle results from a query to a database\n\n*/\n","file_path":"Common/albaResultQueryAbstractHandler.h","rank":6,"score":69056.61987154378},{"content":"class name albaOpCreateLabeledVolume\n\nCreate a albaVMELabeledVolume.\n\n*/\n","file_path":"Operations/albaOpCreateLabeledVolume.h","rank":7,"score":69007.30752109902},{"content":"class ALBA_EXPORT albaVMELabeledVolume : public albaVME\n\n{\n\npublic:\t\n\n\n\n\talbaTypeMacro(albaVMELabeledVolume,albaVME);\n\n\n\n /** Return the value of the label. */\n\n int GetLabelValue( wxString &item ); \n\n\n\n /** Set a tag with the label values. */\n\n void SetLabelTag(albaString label, int component);\n\n\n\n /** Remove a tag. */\n\n void RemoveLabelTag(int component);\n\n\n\n /** Return true if the data associated with the VME is present and updated at the current time.*/\n\n /*virtual*/ bool IsDataAvailable();\n\n\n\n /** Fill the vector of label. */\n\n void FillLabelVector(wxString name, bool checked = TRUE);\n","file_path":"VME/albaVMELabeledVolume.h","rank":8,"score":66605.43366045295},{"content":"class ALBA_EXPORT albaOpLabelizeSurface: public albaOp\n\n{\n\npublic:\n\n\talbaOpLabelizeSurface(const wxString &label = \"Labelize Surface\");\n\n\t~albaOpLabelizeSurface(); \n\n\tvirtual void OnEvent(albaEventBase *alba_event);\n\n\n\n\talbaTypeMacro(albaOpLabelizeSurface, albaOp);\n\n\n\n\talbaOp* Copy();\n\n\n\n\tbool Accept(albaVME*node); \n\n\tvoid OpRun();\n\n\tvoid OpDo();\n\n\tvoid OpUndo();\n\n\n\n\tenum GIZMO_TYPE\n\n\t{\n\n\t\tGIZMO_TRANSLATE = 0,\n\n\t\tGIZMO_ROTATE,\n","file_path":"Operations/albaOpLabelizeSurface.h","rank":9,"score":66605.43366045295},{"content":"class ALBA_EXPORT albaOpLabelExtractor: public albaOp\n\n{\n\npublic:\n\n albaOpLabelExtractor(const wxString& label = \"LabelExtractor\");\n\n ~albaOpLabelExtractor(); \n\n\n\n albaTypeMacro(albaOpLabelExtractor, albaOp);\n\n\n\n\n\n\tvirtual void OnEvent(albaEventBase *alba_event);\n\n albaOp* Copy();\n\n\n\n bool Accept(albaVME *vme);\n\n void OpRun();\n\n\n\n /** If labels tags are present retrieve them. */\n\n bool RetrieveTag();\n\n\n\n /** Fill the vector of label. */\n\n void FillLabelVector(wxString name, bool checked = TRUE);\n","file_path":"Operations/albaOpLabelExtractor.h","rank":10,"score":66605.43366045295},{"content":"class ALBA_EXPORT albaVMEOutputNULL : public albaVMEOutput\n\n{\n\npublic:\n\n albaTypeMacro(albaVMEOutputNULL,albaVMEOutput)\n\n\n\n#ifdef ALBA_USE_VTK\n\n /**\n\n Return a VTK dataset corresponding to the current time. This is\n\n the output of the DataPipe currently attached to the VME.\n\n Usually the output is a \"smart copy\" of one of the dataset in \n\n the DataArray. In some cases it can be NULL, e.g. in case the number\n\n of stored Items is 0. Also special VME could not support VTK dataset output.\n\n An event is rised when the output data changes to allow attached classes to \n\n update their input.*/\n\n virtual vtkDataSet *GetVTKData() {return NULL;}\n\n#endif\n\n\n\n /**\n\n Update all the output data structures (data, bounds, matrix and abs matrix).*/\n\n virtual void Update() {}\n","file_path":"Core/albaVMEOutputNULL.h","rank":11,"score":65516.8583361979},{"content":"class albaVMEOutputNULLTest : public albaTest\n\n{\n\npublic: \n\n\n\n // CPPUNIT test suite\n\n CPPUNIT_TEST_SUITE( albaVMEOutputNULLTest );\n\n CPPUNIT_TEST(TestFixture); // just to test that the fixture has no leaks\n\n CPPUNIT_TEST(TestDynamicAllocation);\n\n CPPUNIT_TEST(TestGetVTKData);\n\n\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\nprivate:\n\n void TestFixture();\n\n void TestDynamicAllocation();\n\n void TestGetVTKData();\n\n\n\n bool result;\n\n};\n\n\n\n#endif\n","file_path":"Testing/Core/albaVMEOutputNULLTest.h","rank":12,"score":65516.8583361979},{"content":"class name: albaResultQueryAbstractHandlerTest\n\n Test class for albaResultQueryAbstractHandler\n\n*/\n","file_path":"Testing/Common/albaResultQueryAbstractHandlerTest.h","rank":13,"score":65512.905921635844},{"content":"class albaOpLabelizeSurfaceTest : public albaTest\n\n{\n\n\tCPPUNIT_TEST_SUITE( albaOpLabelizeSurfaceTest );\n\n\tCPPUNIT_TEST( Test );\n\n\tCPPUNIT_TEST_SUITE_END();\n\n\n\nprotected:\n\n\tvoid Test();\n\n};\n\n\n\n#endif\n","file_path":"Testing/Operations/albaOpLabelizeSurfaceTest.h","rank":14,"score":65466.12408694033},{"content":"class albaVMELabeledVolumeTest : public albaTest\n\n{\n\npublic:\n\n\n\n\tCPPUNIT_TEST_SUITE( albaVMELabeledVolumeTest );\n\n CPPUNIT_TEST( TestDynamicAllocation );\n\n CPPUNIT_TEST( TestVolumeCopy );\n\n\tCPPUNIT_TEST( TestGenerateLabeledVolume );\n\n CPPUNIT_TEST( TestRemoveLabelTag );\n\n CPPUNIT_TEST( TestSetLabelTag );\n\n\tCPPUNIT_TEST( TestDeepCopy );\n\n\tCPPUNIT_TEST_SUITE_END();\n\n\n\nprotected:\n\n void TestFixture();\n\n void TestDynamicAllocation();\n\n\tvoid TestVolumeCopy();\n\n\tvoid TestGenerateLabeledVolume();\n\n void TestRemoveLabelTag();\n\n void TestSetLabelTag();\n\n void TestDeepCopy();\n\n};\n\n\n\n#endif\n","file_path":"Testing/VME/albaVMELabeledVolumeTest.h","rank":15,"score":65466.12408694033},{"content":"class albaOpLabelExtractorTest : public albaTest\n\n{\n\npublic:\n\n\n\n\tCPPUNIT_TEST_SUITE( albaOpLabelExtractorTest );\n\n CPPUNIT_TEST( TestDynamicAllocation );\n\n CPPUNIT_TEST( TestLabelRG );\n\n CPPUNIT_TEST( TestLabelSP );\n\n CPPUNIT_TEST( TestLabelSmoothRG );\n\n CPPUNIT_TEST( TestLabelSmoothSP );\n\n\tCPPUNIT_TEST_SUITE_END();\n\n\n\nprotected:\n\n void TestFixture();\n\n void TestDynamicAllocation();\n\n\tvoid TestLabelRG();\n\n void TestLabelSP();\n\n void TestLabelSmoothRG();\n\n void TestLabelSmoothSP();\n\n};\n\n\n\n#endif\n","file_path":"Testing/Operations/albaOpLabelExtractorTest.h","rank":16,"score":65466.12408694033},{"content":"class UselessIncludesRule(AbstractRule):\n\n def __init__(self):\n\n AbstractRule.__init__(self)\n\n self.DictionaryList = []\n\n\n\n def execute(self):\n\n self.dom = xd.parse(self.FullPathInputFile)\n\n className = self.dom.getElementsByTagName('compounddef')[0].getElementsByTagName('compoundname')[0].firstChild.nodeValue\n\n baseClassName = \"\"\n\n try:\n\n baseClassName = self.dom.getElementsByTagName('compounddef')[0].getElementsByTagName('basecompoundref')[0].firstChild.nodeValue\n\n try:\n\n baseClassName = baseClassName[baseClassName.index(\"::\")+2:]\n\n except:\n\n pass\n\n except:\n\n pass\n\n refInclude = \"\" \n\n try: \n\n refInclude = self.dom.getElementsByTagName('compounddef')[0].getElementsByTagName('includes')[0].attributes[\"refid\"].value\n\n except:\n\n pass\n\n \n\n f = open(\"./Rules/ClassStructureRules/\" + self.ParameterList[0], 'r')\n\n lines = f.readlines()\n\n for line in lines:\n\n self.DictionaryList.append(line.replace(\"\\n\",\"\").replace(\"\\r\",\"\"))\n\n \n\n directory = os.path.dirname(self.FullPathInputFile)\n\n \n\n classToIcludeList = []\n\n if(refInclude != \"\"):\n\n xmlFile = os.path.join(directory, refInclude + \".xml\")\n\n extDom = xd.parse(xmlFile)\n\n includeList = extDom.getElementsByTagName('compounddef')[0].getElementsByTagName('includes')\n\n classToIcludeList = [i.firstChild.nodeValue.split('.')[0] for i in includeList]\n\n \n\n #print len(classToIcludeList)\n\n dict = {}\n\n for item in classToIcludeList:\n\n dict[item] = False\n\n #print className, item\n\n if(item == baseClassName or (item + \".h\") in self.DictionaryList):\n\n dict[item] = True\n\n #print item , self.DictionaryList\n\n continue\n\n \n\n members = self.dom.getElementsByTagName('memberdef')\n\n for member in members:\n\n attrs = member.attributes\n\n if(attrs[\"kind\"].value == \"variable\"):\n\n #check type\n\n typeVariable = None\n\n try:\n\n typeVariable = member.getElementsByTagName('definition')[0].firstChild.nodeValue\n\n except:\n\n pass\n\n #check\n\n if(typeVariable != None and item in typeVariable and not((item + \"*\") in typeVariable) and not((item + \" *\") in typeVariable)):\n\n #include correct! exit from for loop\n\n dict[item] = True\n\n continue\n\n else:\n\n pass\n\n elif(attrs.has_key(\"inline\") and attrs[\"inline\"].value == \"yes\"):\n\n returnValue = \"\"\n\n params = \"\"\n\n try:\n\n definition = member.getElementsByTagName('definition')[0].firstChild.nodeValue\n\n except:\n\n pass\n\n try:\n\n params = member.getElementsByTagName('argsstring')[0].firstChild.nodeValue\n\n except:\n\n pass \n\n\n\n if(definition != None and params != None and item in definition or item in params):\n\n dict[item] = True\n\n continue\n\n else:\n\n pass\n\n # search all the member which are not pointers\n\n # search inline functions in which there is the class\n\n \n\n for i in dict.keys():\n\n if(dict[i] == False):\n\n self.MarkedList.append(\"<item>\\n\"\\\n\n + \" <class>\" + str(className) + \"</class>\\n\"\\\n\n + \" <include>\" + i + \".h</include>\\n\"\\\n\n + \"</item>\")\n","file_path":"qa/Rules/ClassStructureRules/UselessIncludesRule.py","rank":17,"score":64416.57700221175},{"content":"class ALBA_EXPORT albaResultQueryAbstractHandler : public albaObject\n\n{\n\npublic:\n\n /** constructor */\n\n albaResultQueryAbstractHandler();\n\n /** destructor */\n\n\tvirtual ~albaResultQueryAbstractHandler(); \n\n \n\n /** RTTI macro */\n\n albaAbstractTypeMacro(albaResultQueryAbstractHandler, albaObject);\n\n\n\n /**Get result as string matrix */\n\n WebRowSetStringDataTable GetResultAsStringMatrix() {return m_MatrixStringResult;};\n\n \n\n /** Get column type as list of string */\n\n WebRowSetColumnTypeVector GetColumnsTypeInformationAsStringVector() {return m_ColumnsTypeInformation;};\n\n\n\n /** Get column name as list of string */\n\n WebRowSetColumnNameVector GetColumnsNameInformationAsStringVector() {return m_ColumnsNameInformation;};\n\n\n","file_path":"Common/albaResultQueryAbstractHandler.h","rank":18,"score":64411.13067912922},{"content":"class albaOpExporterAnsysInputFileTest;\n\n\n","file_path":"Testing/Operations/albaOpExporterAnsysInputFileTest.h","rank":19,"score":64403.16331999959},{"content":"class albaOpImporterAnsysInputFileTest;\n\n\n","file_path":"Testing/Operations/albaOpImporterAnsysInputFileTest.h","rank":20,"score":64403.16331999959},{"content":"class ALBA_EXPORT albaOpCreateLabeledVolume: public albaOp\n\n{\n\npublic:\n\n /** constructor */\n\n albaOpCreateLabeledVolume(const wxString &label = \"Create Labeled Volume\");\n\n /** destructor */\n\n ~albaOpCreateLabeledVolume(); \n\n\n\n /** RTTI macro */\n\n albaTypeMacro(albaOpCreateLabeledVolume, albaOp);\n\n\n\n /** Return a copy of itself, this needs to put the operation into the undo stack. */\n\n /*virtual*/ albaOp* Copy();\n\n\n\n /** Return true for the acceptable vme type. */\n\n /*virtual*/ bool Accept(albaVME*node);\n\n\n\n /** Builds operation's interface. */\n\n /*virtual*/ void OpRun();\n\n \n\n /** Execute the operation. */\n\n /*virtual*/ void OpDo();\n\n\n\nprotected: \n\n albaVMELabeledVolume *m_LabeledVolume;\n\n};\n\n#endif\n","file_path":"Operations/albaOpCreateLabeledVolume.h","rank":21,"score":64365.135606469994},{"content":" \n\nprotected:\n\n albaVMEOutputNULL(); // to be allocated with New()\n\n virtual ~albaVMEOutputNULL(); // to be deleted with Delete()\n\n\n\nprivate:\n\n albaVMEOutputNULL(const albaVMEOutputNULL&); // Not implemented\n\n void operator=(const albaVMEOutputNULL&); // Not implemented\n\n};\n\n\n\n#endif\n","file_path":"Core/albaVMEOutputNULL.h","rank":22,"score":63851.60346039491},{"content":"/*=========================================================================\n\n\n\n Program: ALBA (Agile Library for Biomedical Applications)\n\n Module: albaVMEOutputNULL\n\n Authors: Marco Petrone\n\n \n\n Copyright (c) BIC\n\n All rights reserved. See Copyright.txt or\n\n\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n#ifndef __albaVMEOutputNULL_h\n\n#define __albaVMEOutputNULL_h\n\n//----------------------------------------------------------------------------\n\n// includes :\n\n//----------------------------------------------------------------------------\n\n#include \"albaVMEOutput.h\"\n\n//----------------------------------------------------------------------------\n\n// forward declarations :\n\n//----------------------------------------------------------------------------\n","file_path":"Core/albaVMEOutputNULL.h","rank":23,"score":63851.17127420086},{"content":" void CreateOpDialog();\n\n\n\n /** Remove operation's interface. */\n\n void DeleteOpDialog();\n\n\n\n /** Enable/disable VME widgets.*/\n\n void EnableWidgets(bool enable = true);\n\n\n\n /** Create the pipeline to generate the slice of the volume. */\n\n void CreateSlicePipeline();\n\n\n\n /** Re-slice the volume according to the new coordinate value. */\n\n void UpdateSlice(); \n\n\n\n /** This method returns the min value from the label used as input. */\n\n int GetMin( wxString &item );\n\n\n\n /** This method returns the max value from the label used as input. */\n\n int GetMax( wxString &item );\n\n};\n\n#endif\n","file_path":"VME/albaVMELabeledVolume.h","rank":24,"score":63814.80947917252},{"content":"\t\tGIZMO_SCALE,\n\n\t};\n\n\n\n\tvoid SetLutEditor(vtkLookupTable *lut);\n\n\tvoid SetLabelValue(double val){m_LabelValue=val;};\n\n\tvoid SetPlaneDimension(double w,double h);\n\n\tvoid Labelize();\n\n\n\n\tvirtual void OpStop(int result);\n\nprotected: \n\n\n\n\t/** Create the GUI */\n\n\tvoid CreateGui();\n\n\n\n\tvoid ShowClipPlane(bool show);\n\n\tvoid CreateGizmos();\n\n\tvoid AttachInteraction();\n\n\tvoid UpdateISARefSys();\n\n\tvoid Undo();\n\n\n","file_path":"Operations/albaOpLabelizeSurface.h","rank":25,"score":63813.765991253546},{"content":"\n\n /** Modify the vector of label. */\n\n void ModifyLabelVector(int n, wxString name, bool checked);\n\n\n\n /** Remove an item of the vector of label. */\n\n void RemoveItemLabelVector(int n);\n\n\n\n /** Precess events coming from other objects */ \n\n virtual void OnEvent(albaEventBase *alba_event);\n\n\n\n /** Copy the contents of another VMELabeled into this one. */\n\n int DeepCopy(albaVME *a);\n\n\n\n /** Compare with another VMELabeled. */\n\n bool Equals(albaVME *vme);\n\n\n\n /**\n\n Set the Pose matrix of the VME. This function modifies the MatrixVector. You can\n\n set or get the Pose for a specified time. When setting, if the time does not exist\n\n the MatrixVector creates a new KeyMatrix on the fly. When getting, the matrix vector\n","file_path":"VME/albaVMELabeledVolume.h","rank":26,"score":63809.29350602715},{"content":" interpolates on the fly according to the matrix interpolator.*/\n\n virtual void SetMatrix(const albaMatrix &mat);\n\n\n\n /**\n\n Return the list of timestamps for this VME. Timestamps list is \n\n obtained merging timestamps for matrixes and VME items*/\n\n virtual void GetLocalTimeStamps(std::vector<albaTimeStamp> &kframes);\n\n\n\n /** Update the VME with the scalar values of the labels. */\n\n virtual void GenerateLabeledVolume();\n\n\n\n /** Set the Link */\n\n void SetVolumeLink(albaVME *n);\n\n\n\n /** Return the Link */\n\n albaVME *GetVolumeLink();\n\n\n\n /** return material attribute of this surface if present */\n\n mmaVolumeMaterial *GetMaterial();\n\n\n","file_path":"VME/albaVMELabeledVolume.h","rank":27,"score":63807.70732745834},{"content":"\talbaInteractorGenericMouse\t\t *m_IsaLabelizeWithoutGizmo;\n\n\n\n\tint\t\tm_LabelInside;\n\n\n\n\tbool\tm_PlaneCreated;\n\n\n\n\tdouble m_PlaneWidth;\n\n\tdouble m_PlaneHeight;\n\n\tdouble m_LabelValue;\n\n\n\n\tint\t\tm_GizmoType;\n\n\tint m_UseGizmo;\n\n\n\n\talbaVMESurface\t\t\t\t*m_InputSurface;\n\n\talbaVMESurfaceEditor *m_VmeEditor;\n\n\n\n\talbaVMEGizmo\t\t\t\t*m_ImplicitPlaneGizmo;\n\n\tvtkPlane\t\t\t\t\t*m_ClipperPlane;\n\n\tvtkPlaneSource\t\t*m_PlaneSource;\n\n\tvtkArrowSource\t\t*m_ArrowShape;\n","file_path":"Operations/albaOpLabelizeSurface.h","rank":28,"score":63807.11191271987},{"content":"\n\n // Set the label value\n\n void SetLabel(double labelValue);\n\n\n\n //Set if smooth mode is true\n\n void SmoothMode(bool smoothMode);\n\n\n\n // Create a VMESurface draw from a Volume\n\n\tvoid ExtractLabel();\n\n\n\nprotected: \n\n\n\n /** Get the dataset from linked node. */\n\n void UpdateDataLabel();\n\n\n\n /** Generate the volume depending on the labels selected. */\n\n void GenerateLabeledVolume();\n\n\n\n std::vector<wxString> m_LabelNameVector;\n\n std::vector<bool> m_CheckedVector;\n","file_path":"Operations/albaOpLabelExtractor.h","rank":29,"score":63804.5830173279},{"content":" \n\n wxSlider *m_MinSlider;\n\n wxSlider *m_MaxSlider;\n\n\n\n wxTextCtrl *m_LabelNameCtrl;\n\n wxTextCtrl *m_LabelValueCtrl; \n\n\n\n int m_MinAbsolute, m_MaxAbsolute;\t\n\n int m_Min , m_Max;\n\n int m_MinMin, m_MaxMin;\n\n int m_MinMax, m_MaxMax;\t\n\n int m_MinValue ,m_MaxValue;\n\n\n\n int m_CheckListId;\n\n int m_ItemSelected;\n\n int m_LabelIntValue;\n\n\n\n bool m_CheckMax, m_CheckMin;\n\n bool m_EditMode;\n\n bool m_DataCopied;\n","file_path":"VME/albaVMELabeledVolume.h","rank":30,"score":63803.622465402594},{"content":"\n\n /** This method updates the look-up table. */\n\n void UpdateLookUpTable();\n\n\n\n /** If labels tags are present retrieve them. */\n\n void RetrieveTag();\n\n\n\n void CopyDataset();\n\n\n\n /** Updates the tags and the items of the checkBox and call the InternalPreUpadate. */\n\n void UpdateLabel();\n\n\n\n /** update the output data structure */\n\n void InternalPreUpdate();\n\n\n\n\n\n /** Copy the scalars of the VME linked. */\n\n void UpdateScalars();\n\n \n\n /** Builds operation's interface and visualization pipeline. */\n","file_path":"VME/albaVMELabeledVolume.h","rank":31,"score":63802.866832275344},{"content":"/*=========================================================================\n\n\n\n Program: ALBA (Agile Library for Biomedical Applications)\n\n Module: albaVMELabeledVolume\n\n Authors: Roberto Mucci\n\n \n\n Copyright (c) BIC\n\n All rights reserved. See Copyright.txt or\n\n\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n \n\n#ifndef __albaVMELabeledVolume_h\n\n#define __albaVMELabeledVolume_h\n\n\n\n//----------------------------------------------------------------------------\n\n// Include:\n\n//----------------------------------------------------------------------------\n\n#include \"albaDefines.h\"\n\n#include \"albaVME.h\"\n\n\n\n//----------------------------------------------------------------------------\n\n// forward references :\n\n//----------------------------------------------------------------------------\n","file_path":"VME/albaVMELabeledVolume.h","rank":32,"score":63802.55335218411},{"content":"/*=========================================================================\n\n\n\n Program: ALBA (Agile Library for Biomedical Applications)\n\n Module: albaOpLabelizeSurface\n\n Authors: Matteo Giacomoni\n\n \n\n Copyright (c) BIC\n\n All rights reserved. See Copyright.txt or\n\n\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef __albaOpLabelizeSurface_H__\n\n#define __albaOpLabelizeSurface_H__\n\n\n\n//----------------------------------------------------------------------------\n\n// Include :\n\n//----------------------------------------------------------------------------\n\n#include \"albaDefines.h\"\n\n#include \"albaOp.h\"\n\n\n\n//----------------------------------------------------------------------------\n\n// forward references :\n\n//----------------------------------------------------------------------------\n","file_path":"Operations/albaOpLabelizeSurface.h","rank":33,"score":63802.45875807205},{"content":"\n\n\tdouble m_ValLabel;\n\n int m_SmoothVolume;\n\n float m_RadiusFactor;\n\n float m_StdDev[3];\n\n float m_RadiusFactorAfter;\n\n float m_StdDevAfter[3];\n\n int m_SamplingRate[3];\n\n\twxString m_SurfaceName;\n\n\n\n vtkImageData *m_OutputData;\n\n vtkDataSet *m_Ds;\n\n\talbaVMESurface *m_Vme;\n\n albaGUICheckListBox *m_LabelCheckBox;\n\n albaTagItem *m_TagLabel;\n\n\n\n};\n\n#endif\n","file_path":"Operations/albaOpLabelExtractor.h","rank":34,"score":63801.88439673765},{"content":" ID_DECREASE_SLICE,\n\n ID_OK,\n\n ID_CANCEL,\n\n ID_D_LABEL_NAME,\n\n ID_D_LABEL_VALUE,\n\n ID_D_MIN,\n\n ID_D_MAX,\n\n ID_SLIDER_MIN,\n\n ID_SLIDER_MAX,\n\n ID_LAST,\n\n };\n\n\n\n albaVMELabeledVolume();\n\n virtual ~albaVMELabeledVolume(); \n\n\n\n virtual int InternalStore(albaStorageElement *parent);\n\n virtual int InternalRestore(albaStorageElement *node);\n\n\n\n /** Internally used to create a new instance of the GUI.*/\n\n virtual albaGUI *CreateGui();\n","file_path":"VME/albaVMELabeledVolume.h","rank":35,"score":63801.71145661508},{"content":" /** return icon */\n\n static char** GetIcon();\n\n\n\n /** Return the suggested pipe-typename for the visualization of this vme */\n\n virtual albaString GetVisualPipe() {return albaString(\"albaPipeBox\");};\n\n\n\nprotected:\n\n //----------------------------------------------------------------------------\n\n // widget ID's\n\n //----------------------------------------------------------------------------\n\n enum VME_LABELED_VOLUME_DIALOG_ID\n\n {\n\n ID_INSERT_LABEL = Superclass::ID_LAST,\n\n ID_REMOVE_LABEL,\n\n ID_EDIT_LABEL,\n\n ID_LABELS,\n\n ID_FIT,\t\n\n ID_SLICE,\n\n ID_SLICE_SLIDER,\n\n ID_INCREASE_SLICE,\n","file_path":"VME/albaVMELabeledVolume.h","rank":36,"score":63801.128037028735},{"content":"/*=========================================================================\n\n\n\n Program: ALBA (Agile Library for Biomedical Applications)\n\n Module: albaOpLabelExtractor\n\n Authors: Paolo Quadrani - porting Roberto Mucci\n\n \n\n Copyright (c) BIC\n\n All rights reserved. See Copyright.txt or\n\n\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef __albaOpLabelExtractor_H__\n\n#define __albaOpLabelExtractor_H__\n\n\n\n\n\n#include \"albaOp.h\"\n\n\n\n\n\n//----------------------------------------------------------------------------\n\n// forward references :\n\n//----------------------------------------------------------------------------\n","file_path":"Operations/albaOpLabelExtractor.h","rank":37,"score":63799.99674562427},{"content":"\t/** Change type of gizmo in the view */\n\n\tvoid ChangeGizmo();\n\n\n\n\tvoid OnEventGizmoPlane(albaEventBase *alba_event);\n\n\tvoid OnEventThis(albaEventBase *alba_event);\n\n\tvoid OnEventGizmoTranslate(albaEventBase *alba_event);\n\n\tvoid OnEventGizmoRotate(albaEventBase *alba_event);\n\n\tvoid OnEventGizmoScale(albaEventBase *alba_event);\n\n\n\n\tvoid PostMultiplyEventMatrix(albaEventBase *alba_event);\n\n\n\n\tvoid SetPlaneDimension();\n\n\n\n\talbaInteractorCompositorMouse *m_IsaCompositorWithoutGizmo;\n\n\talbaInteractorCompositorMouse *m_IsaCompositorWithGizmo;\n\n\talbaInteractorGenericMouse *m_IsaTranslate;\n\n\talbaInteractorGenericMouse *m_IsaRotate;\n\n\talbaInteractorGenericMouse\t\t *m_IsaChangeArrowWithGizmo;\n\n\talbaInteractorGenericMouse\t\t *m_IsaChangeArrowWithoutGizmo;\t\n\n\talbaInteractorGenericMouse\t\t *m_IsaLabelizeWithGizmo;\n","file_path":"Operations/albaOpLabelizeSurface.h","rank":38,"score":63799.18036657321},{"content":" double m_SliceStep;\n\n double m_Bounds[6];\n\n\n\n double m_BBox[6];\n\n double m_Origin[3];\n\n double m_XVect[3];\n\n double m_YVect[3];\n\n \n\n wxString m_ItemLabel;\n\n\n\n vtkWindowLevelLookupTable * m_LookUpTable;\n\n vtkWindowLevelLookupTable * m_LookUpTableColor;\n\n vtkImageData * m_SP;\n\n vtkRectilinearGrid * m_RG;\n\n vtkProbeFilter * m_ProbeFilter;\n\n vtkTexture * m_Texture; \n\n vtkPolyDataMapper * m_SMapper;\n\n vtkActor * m_ActorSlice; \n\n vtkDataSet *m_Dataset;\n\n vtkPolyData *m_Polydata;\n","file_path":"VME/albaVMELabeledVolume.h","rank":39,"score":63796.83230712884},{"content":" \n\n\n\n std::vector<wxString> m_LabelNameVector;\n\n std::vector<bool> m_CheckedVector;\n\n\n\n\n\n albaGUICheckListBox *m_LabelCheckBox; \n\n albaGUIDialogPreview *m_Dlg; \n\n albaGUIFloatSlider *m_SliceSlider;\n\n albaRWI *m_Rwi;\n\n albaTagItem *m_TagLabel;\n\n albaVME *m_VolumeLink;\n\n albaTransform *m_Transform;\n\n\n\n wxString m_LabelNameValue; \t\n\n wxString m_LabelValueValue;\n\n\n\n double m_Slice;\n\n double m_SliceMin;\n\n double m_SliceMax;\n","file_path":"VME/albaVMELabeledVolume.h","rank":40,"score":63795.80247835586},{"content":"\tvtkAppendPolyData\t*m_Gizmo;\n\n\tvtkGlyph3D\t\t\t\t*m_Arrow;\n\n\n\n\tvtkALBAClipSurfaceBoundingBox\t*m_ClipperBoundingBox;\n\n\n\n\tstd::vector<vtkPolyData*> m_ResultPolyData;\n\n\tvtkPolyData\t*m_OriginalPolydata;\n\n\n\n\talbaGizmoTranslate\t\t*m_GizmoTranslate;\n\n\talbaGizmoRotate\t\t\t*m_GizmoRotate;\n\n\talbaGizmoScale\t\t\t\t*m_GizmoScale;\n\n};\n\n#endif\n","file_path":"Operations/albaOpLabelizeSurface.h","rank":41,"score":63792.86722859748},{"content":"class albaResultQueryAbstractHandlerTest : public albaTest\n\n{\n\npublic:\n\n\n\n /** Start test suite macro */\n\n\tCPPUNIT_TEST_SUITE( albaResultQueryAbstractHandlerTest );\n\n /** macro for test TestDynamicAllocation */\n\n\tCPPUNIT_TEST( TestDynamicAllocation );\n\n /** macro for test TestStaticAllocation */\n\n\tCPPUNIT_TEST( TestStaticAllocation );\n\n\n\n /** macro for test TestStaticAllocation */\n\n CPPUNIT_TEST( TestGetResultAsStringMatrix );\n\n\n\n /** macro for test TestStaticAllocation */\n\n CPPUNIT_TEST( TestGetColumnsTypeInformationAsStringVector );\n\n\n\n /** macro for test TestStaticAllocation */\n\n CPPUNIT_TEST( TestGetColumnsNameInformationAsStringVector );\n\n\n","file_path":"Testing/Common/albaResultQueryAbstractHandlerTest.h","rank":42,"score":63345.80111687767},{"content":"class albaOpCreateLabeledVolumeTest : public albaTest\n\n{\n\n CPPUNIT_TEST_SUITE( albaOpCreateLabeledVolumeTest );\n\n CPPUNIT_TEST( TestDynamicAllocation );\n\n CPPUNIT_TEST( TestCopy );\n\n CPPUNIT_TEST( TestAccept );\n\n CPPUNIT_TEST( TestOpRun );\n\n CPPUNIT_TEST( TestOpDo );\n\n CPPUNIT_TEST_SUITE_END();\n\n\n\nprotected:\n\n void TestDynamicAllocation();\n\n void TestCopy();\n\n void TestAccept();\n\n void TestOpRun();\n\n void TestOpDo();\n\n};\n\n\n\n#endif\n","file_path":"Testing/Operations/albaOpCreateLabeledVolumeTest.h","rank":43,"score":63300.56678091263},{"content":"// This force to include Window,wxWidgets and VTK exactly in this order.\n\n// Failing in doing this will result in a run-time error saying:\n\n// \"Failure#0: The value of ESP was not properly saved across a function call\"\n\n//----------------------------------------------------------------------------\n\n\n\n\n\n\n\n#include \"albaVMEOutputNULL.h\"\n\n#include \"albaAbsMatrixPipe.h\"\n\n#include \"albaDataPipe.h\"\n\n#include \"albaSmartPointer.h\"\n\n#include \"albaTransform.h\"\n\n#include \"albaIndent.h\"\n\n\n\n#include <assert.h>\n\n\n\n//-------------------------------------------------------------------------\n\nalbaCxxTypeMacro(albaVMEOutputNULL)\n\n//-------------------------------------------------------------------------\n\n\n","file_path":"Core/albaVMEOutputNULL.cpp","rank":44,"score":61798.04093196581},{"content":" /** Get result as string matrix */\n\n WebRowSetQueryObjectsTable GetResultAsObjectsMatrix() {return m_MatrixObjectResult;};\n\n\n\n\n\n /** Get number of records (rows) */\n\n int GetNumberOfRecords() const;\n\n\n\n /** Get number of fields (columns) */\n\n int GetNumberOfFields() const;\n\n\n\n /** load result of Query */\n\n virtual void LoadQueryResult() = 0;\n\n\n\n /** load result of Query */\n\n virtual bool IsFailed() = 0;\n\n\n\nprotected:\n\n /** clear all the results */\n\n virtual void InternalResultReset();\n\n\n","file_path":"Common/albaResultQueryAbstractHandler.h","rank":45,"score":61796.0015787554},{"content":"/*=========================================================================\n\n\n\n Program: ALBA (Agile Library for Biomedical Applications)\n\n Module: albaVMEOutputNULL\n\n Authors: Marco Petrone\n\n \n\n Copyright (c) BIC\n\n All rights reserved. See Copyright.txt or\n\n\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n\n\n\n\n#include \"albaDefines.h\" \n\n//----------------------------------------------------------------------------\n\n// NOTE: Every CPP file in the ALBA must include \"albaDefines.h\" as first.\n","file_path":"Core/albaVMEOutputNULL.cpp","rank":46,"score":61789.66078310828},{"content":"//-------------------------------------------------------------------------\n\nalbaVMEOutputNULL::albaVMEOutputNULL()\n\n//-------------------------------------------------------------------------\n\n{\n\n}\n\n\n\n//-------------------------------------------------------------------------\n\nalbaVMEOutputNULL::~albaVMEOutputNULL()\n\n//-------------------------------------------------------------------------\n\n{\n\n}\n\n\n","file_path":"Core/albaVMEOutputNULL.cpp","rank":47,"score":61786.57853842674},{"content":"REM ----------------------------------------------------------------------------\n\nREM TestComplete Result Copy\n\nREM ----------------------------------------------------------------------------\n\n\n\necho.\n\n\n\ncd ..\n\n\n\nset CheckNameResultsDirectory=GuiTestResult\n\n\n\n\n\nREM delete the directory storing previous results\n\nrmdir /s /q %CheckNameResultsDirectory%\n\n\n\nREM create the directory again the directories for storing XML and HTML file name checking results\n\nmkdir %CheckNameResultsDirectory%\n\n\n\necho creating file name check results... \n\ncd %CheckNameResultsDirectory%\n\nxcopy ..\\..\\..\\..\\..\\..\\..\\..\\..\\..\\Results\\Resultlog \n\n\n\n\n\n\n\n\n\necho.\n","file_path":"ParabuildScripts/guiTestResults.bat","rank":48,"score":61783.065356000974},{"content":"REM BEWARE! These directory names are referenced in MemoryProfile.vbs script so the not change them\n\nset ProfilingResultsDirectory=.\\build\\bin\\Debug\\Coverage\\\n\nset XMLResultsDirectory=%ProfilingResultsDirectory%\\XML\\\n\nset HTMLResultsDirectory=%ProfilingResultsDirectory%\\HTML\\\n\n\n\nREM delete the directory storing previous results\n\nrmdir /s /q %ProfilingResultsDirectory%\n\n\n\nREM create the directory again the directories for storing XML and HTML memory profiling results\n\nmkdir %XMLResultsDirectory%\n\nmkdir %HTMLResultsDirectory%","file_path":"JenkinsScripts/RemoveCoverageResults.bat","rank":49,"score":61783.034081101105},{"content":"REM BEWARE! These directory names are referenced in MemoryProfile.vbs script so the not change them\n\nset ProfilingResultsDirectory=.\\build\\bin\\Debug\\MemoryAllocation\\\n\nset XMLResultsDirectory=%ProfilingResultsDirectory%\\XML\\\n\nset HTMLResultsDirectory=%ProfilingResultsDirectory%\\HTML\\\n\n\n\nREM delete the directory storing previous results\n\nrmdir /s /q %ProfilingResultsDirectory%\n\n\n\nREM create the directory again the directories for storing XML and HTML memory profiling results\n\nmkdir %XMLResultsDirectory%\n\nmkdir %HTMLResultsDirectory%","file_path":"JenkinsScripts/RemoveProfilingResults.bat","rank":50,"score":61783.02370391632},{"content":"// Include:\n\n//----------------------------------------------------------------------------\n\n#include \"albaDefines.h\"\n\n#include \"albaObject.h\"\n\n#include \"albaQueryObject.h\"\n\n#include <vector>\n\n//----------------------------------------------------------------------------\n\n// forward references :\n\n//----------------------------------------------------------------------------\n\n\n\n//----------------------------------------------------------------------------\n\n// typedefs :\n\n//----------------------------------------------------------------------------\n\n\n\ntypedef std::vector<std::vector<std::string> > WebRowSetStringDataTable;\n\ntypedef std::vector<std::string> WebRowSetColumnTypeVector;\n\ntypedef std::vector<std::string> WebRowSetColumnNameVector;\n\n\n\ntypedef std::vector<std::vector<albaQueryObject *> > WebRowSetQueryObjectsTable;\n\n/**\n","file_path":"Common/albaResultQueryAbstractHandler.h","rank":51,"score":61782.11903618858},{"content":" WebRowSetStringDataTable m_MatrixStringResult;\n\n WebRowSetColumnTypeVector m_ColumnsTypeInformation;\n\n WebRowSetColumnNameVector m_ColumnsNameInformation;\n\n\n\n WebRowSetQueryObjectsTable m_MatrixObjectResult;\n\n\n\nprivate:\n\n \n\n\n\n\n\n};\n\n#endif //__albaResultQueryAbstractHandler_H__\n","file_path":"Common/albaResultQueryAbstractHandler.h","rank":52,"score":61781.835015140896},{"content":"/*=========================================================================\n\n\n\n Program: ALBA (Agile Library for Biomedical Applications)\n\n Module: albaResultQueryAbstractHandler\n\n Authors: Daniele Giunchi\n\n \n\n Copyright (c) BIC\n\n All rights reserved. See Copyright.txt or\n\n\n\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n\n PURPOSE. See the above copyright notice for more information.\n\n\n\n=========================================================================*/\n\n\n\n#ifndef __albaResultQueryAbstractHandler_H__\n\n#define __albaResultQueryAbstractHandler_H__\n\n\n\n//----------------------------------------------------------------------------\n","file_path":"Common/albaResultQueryAbstractHandler.h","rank":53,"score":61781.582713619326},{"content":"{\n\n\treturn new albaOpLabelizeSurface(m_Label);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nbool albaOpLabelizeSurface::Accept(albaVME*node)\n\n//----------------------------------------------------------------------------\n\n{\n\n\treturn (node != NULL && node->IsALBAType(albaVMESurface));\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::OpRun() \n\n//----------------------------------------------------------------------------\n\n{\n\n\tGetLogicManager()->VmeShow(m_Input, false);\n\n\n\n\talbaNEW(m_VmeEditor);\n\n\tvtkALBASmartPointer<vtkPolyData> inputOriginalPolydata;\n\n\tinputOriginalPolydata->DeepCopy(vtkPolyData::SafeDownCast(albaVMESurface::SafeDownCast(m_Input)->GetOutput()->GetVTKData()));\n\n\tint prova=inputOriginalPolydata->GetNumberOfPoints();\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":54,"score":61758.13269281897},{"content":" for(int i=0; i<6; i++) \n\n m_BBox[i] = 0;\n\n}\n\n//------------------------------------------------------------------------------\n\nalbaVMELabeledVolume::~albaVMELabeledVolume()\n\n//------------------------------------------------------------------------------\n\n{\n\n albaDEL(m_Transform);\n\n if (m_DataCopied)\n\n albaDEL(m_Dataset);\n\n m_VolumeLink = NULL;\n\n m_CheckedVector.clear();\n\n m_LabelNameVector.clear();\n\n\n\n if ( m_Dlg )\n\n DeleteOpDialog();\n\n}\n\n\n\n//-------------------------------------------------------------------------\n\nint albaVMELabeledVolume::DeepCopy(albaVME *a)\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":55,"score":61756.13411484059},{"content":" m_OutputData->GetPointData()->SetScalars(labelScalars);\n\n m_OutputData->Modified();\n\n }\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelExtractor::ExtractLabel()\n\n//----------------------------------------------------------------------------\n\n{\n\n albaVME *vme = NULL;\n\n \n\n if (m_Input->IsA(\"albaVMELabeledVolume\"))\n\n {\n\n UpdateDataLabel();\n\n }\n\n else\n\n {\n\n albaSmartPointer<albaVME> vmeLabeled = m_Input;\n\n m_Ds = vmeLabeled->GetOutput()->GetVTKData();\n\n m_Ds->Update();\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":56,"score":61755.88531622964},{"content":"void albaOpLabelizeSurface::OpStop(int result)\n\n//----------------------------------------------------------------------------\n\n{\n\n\tGetLogicManager()->VmeShow(m_VmeEditor, false);\n\n\tm_VmeEditor->ReparentTo(NULL);\n\n\n\n\tif(m_ImplicitPlaneGizmo)\n\n\t{\n\n\t\tm_ImplicitPlaneGizmo->SetBehavior(NULL);\n\n\t\tGetLogicManager()->VmeRemove(m_ImplicitPlaneGizmo);\n\n\t}\n\n\talbaDEL(m_ImplicitPlaneGizmo);\n\n\n\n\tvtkDEL(m_Gizmo);\n\n\tvtkDEL(m_ArrowShape);\n\n\tvtkDEL(m_PlaneSource);\n\n\tvtkDEL(m_ClipperBoundingBox);\n\n\tvtkDEL(m_Arrow);\n\n\tvtkDEL(m_ClipperPlane);\n\n\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":57,"score":61754.77937152762},{"content":"\tm_Gui->Double(ID_LABEL_VALUE,_(\"Label\"),&m_LabelValue);\n\n\tm_Gui->Lut(ID_LUT,\"lut\",m_VmeEditor->GetMaterial()->m_ColorLut);\n\n\tdouble b[6];\n\n\tm_Input->GetOutput()->GetVMEBounds(b);\n\n\t// bounding box dim\n\n\tm_PlaneWidth = b[1] - b[0];\n\n\tm_PlaneHeight = b[3] - b[2];\n\n\t//m_Gui->Double(ID_PLANE_WIDTH,_(\"plane w.\"),&m_PlaneWidth,0.0);\n\n\t//m_Gui->Double(ID_PLANE_HEIGHT,_(\"plane h.\"),&m_PlaneHeight,0.0);\n\n\tm_Gui->Divider();\n\n\tm_Gui->Button(ID_UNDO,_(\"Undo\"));\n\n\n\n\tm_Gui->Divider(1);\n\n\tm_Gui->OkCancel();\n\n\n\n\tm_Gui->Divider();\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::CreateGizmos()\n\n//----------------------------------------------------------------------------\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":58,"score":61753.91032109263},{"content":"\t\tm_VmeEditor->GetMaterial()->m_ColorLut->Build();\n\n\n\n\t\tvtkALBASmartPointer<vtkDoubleArray> cellScalar;\n\n\t\tcellScalar->SetName(\"CELL_LABEL\");\n\n\t\tcellScalar->SetNumberOfComponents(1);\n\n\t\tcellScalar->SetNumberOfTuples(inputPolydata->GetNumberOfCells());\n\n\t\tfor(int i=0;i<inputPolydata->GetNumberOfCells();i++)\n\n\t\t{\n\n\t\t\tcellScalar->InsertTuple1(i,0.0);\n\n\t\t}\n\n\n\n\t\tinputPolydata->GetCellData()->SetScalars(cellScalar);\n\n\t\tinputPolydata->GetCellData()->Update();\n\n\n\n\t\tinputPolydata->Modified();\n\n\t\tinputPolydata->Update();\n\n\t}\n\n\telse\n\n\t{\n\n\t\tinputPolydata->GetCellData()->SetActiveScalars(\"CELL_LABEL\");\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":59,"score":61753.16627423765},{"content":" m_LabelNameVector.push_back(name);\n\n m_CheckedVector.push_back(checked);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::ModifyLabelVector(int n, wxString name, bool checked)\n\n//----------------------------------------------------------------------------\n\n{\n\n if (n < m_LabelNameVector.size() )\n\n {\n\n m_LabelNameVector[n] = name;\n\n m_CheckedVector[n] = checked;\n\n }\n\n else\n\n return;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::RemoveItemLabelVector(int n)\n\n//----------------------------------------------------------------------------\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":60,"score":61752.38089854908},{"content":"\n\n//----------------------------------------------------------------------------\n\nalbaCxxTypeMacro(albaOpLabelizeSurface);\n\n//----------------------------------------------------------------------------\n\n\n\n//----------------------------------------------------------------------------\n\nalbaOpLabelizeSurface::albaOpLabelizeSurface(const wxString &label) :\n\nalbaOp(label)\n\n//----------------------------------------------------------------------------\n\n{\n\n\tm_OpType\t= OPTYPE_OP;\n\n\tm_Canundo = true;\n\n\tm_InputPreserving = false;\n\n\n\n\tm_ImplicitPlaneGizmo = NULL;\n\n\tm_ClipperPlane = NULL;\n\n\tm_PlaneSource = NULL;\n\n\tm_ArrowShape = NULL;\n\n\tm_Arrow = NULL;\n\n\tm_Gizmo = NULL;\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":61,"score":61752.32806573719},{"content":"#include \"vtkPointData.h\"\n\n#include \"vtkDataSet.h\"\n\n#include \"vtkRenderer.h\"\n\n#include \"vtkRenderWindow.h\"\n\n\n\n#include <list>\n\n#include <vector>\n\n\n\n#define OUTRANGE_SCALAR -1000\n\n\n\n//-------------------------------------------------------------------------\n\nalbaCxxTypeMacro(albaVMELabeledVolume);\n\n//-------------------------------------------------------------------------\n\n\n\n//------------------------------------------------------------------------------\n\nalbaVMELabeledVolume::albaVMELabeledVolume()\n\n//------------------------------------------------------------------------------\n\n{\n\n m_LabelCheckBox = NULL;\n\n m_EditMode = false;\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":62,"score":61752.20562200514},{"content":" break; //exit from loop for only\n\n }\n\n // Check if another value for the label already exists\n\n int currentLabelValue = GetLabelValue( currentLabelName );\n\n if ( currentLabelValue == m_LabelIntValue )\n\n {\n\n int answer = wxMessageBox( \"The value for this label already exists - Continue?\", \"Warning\", wxYES_NO | wxICON_ERROR, NULL);\n\n if (answer == wxNO)\n\n { \n\n m_LabelIntValue = 1;\n\n m_Dlg->TransferDataToWindow();\n\n return;\n\n }\n\n else\n\n break; //exit from loop for only\n\n }\n\n }\n\n }\n\n wxString labelLine; \n\n labelLine.Printf( \"%s %d %d %d\", labelName, m_LabelIntValue, m_Min, m_Max ); \n","file_path":"VME/albaVMELabeledVolume.cpp","rank":63,"score":61751.66367524358},{"content":"\n\n\tm_ResultPolyData.clear();\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nalbaOpLabelizeSurface::~albaOpLabelizeSurface()\n\n//----------------------------------------------------------------------------\n\n{\n\n\tfor(int i=0;i<m_ResultPolyData.size();i++)\n\n\t{\n\n\t\tvtkDEL(m_ResultPolyData[i]);\n\n\t}\n\n\tm_ResultPolyData.clear();\n\n\n\n\talbaDEL(m_VmeEditor);\n\n\tvtkDEL(m_OriginalPolydata);\n\n}\n\n//----------------------------------------------------------------------------\n\nalbaOp* albaOpLabelizeSurface::Copy() \n\n//----------------------------------------------------------------------------\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":64,"score":61751.52578611239},{"content":" m_LabelCheckBox->Update();\n\n\n\n int noc = m_TagLabel->GetNumberOfComponents();\n\n for ( unsigned int w = 0; w < noc; w++ )\n\n {\n\n wxString componentName = m_TagLabel->GetValue( w );\n\n if ( m_ItemLabel == componentName )\n\n {\n\n SetLabelTag(labelLine.c_str(), w );\n\n }\n\n }\n\n }\n\n GenerateLabeledVolume();\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::SetLabelTag(albaString label, int component )\n\n//----------------------------------------------------------------------------\n\n{\n\n m_TagLabel->SetValue(label, component);\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":65,"score":61751.48595807047},{"content":"\tm_IsaCompositorWithGizmo = NULL;\n\n\tm_IsaCompositorWithoutGizmo = NULL;\n\n\tm_InputSurface = NULL;\n\n\tm_OriginalPolydata = NULL;\n\n\tm_ClipperBoundingBox = NULL;\n\n\n\n\tm_LabelValue = 0.0;\n\n\n\n\tm_LabelInside = 1;\n\n\tm_UseGizmo\t\t= 1;\n\n\tm_GizmoType\t\t= GIZMO_TRANSLATE;\n\n\n\n\tm_PlaneWidth = 0.0;\n\n\tm_PlaneHeight = 0.0;\n\n\n\n\tm_VmeEditor = NULL;\n\n\n\n\tm_GizmoTranslate=NULL;\n\n\tm_GizmoRotate=NULL;\n\n\tm_GizmoScale=NULL;\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":66,"score":61751.35635691417},{"content":"\t\tm_ImplicitPlaneGizmo->SetBehavior(m_IsaCompositorWithoutGizmo);\n\n\telse\n\n\t\tm_ImplicitPlaneGizmo->SetBehavior(m_IsaCompositorWithGizmo);\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::ShowClipPlane(bool show)\n\n//----------------------------------------------------------------------------\n\n{\n\n\tif(show)\n\n\t{\n\n\t\tif(m_ClipperPlane == NULL)\n\n\t\t{\n\n\t\t\tdouble b[6];\n\n\t\t\tm_Input->GetOutput()->GetBounds(b);\n\n\n\n\t\t\t// bounding box dim\n\n\t\t\tdouble xdim = b[1] - b[0];\n\n\t\t\tdouble ydim = b[3] - b[2];\n\n\t\t\tdouble zdim = b[5] - b[4];\n\n\t\t\t\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":67,"score":61750.98716616801},{"content":"\n\n // Check if another name for the label already exists\n\n if( m_TagLabel && m_EditMode == false)\n\n {\n\n int noc = m_TagLabel->GetNumberOfComponents();\n\n for ( unsigned int i = 0; i < noc; i++ )\n\n {\n\n wxString component = m_TagLabel->GetValue( i );\n\n\n\n // Check if another name for the label already exists\n\n wxString currentLabelName = component.BeforeFirst( ' ' ); \n\n if ( currentLabelName == labelName )\n\n { \n\n int answer = wxMessageBox( \"The name of this label already exists - Continue?\", \"Warning\", wxYES_NO | wxICON_ERROR, NULL);\n\n if (answer == wxNO)\n\n { \n\n m_LabelNameCtrl->SetValue( wxEmptyString ); \n\n return;\n\n }\n\n else\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":68,"score":61750.32190186718},{"content":"//----------------------------------------------------------------------------\n\nvoid albaOpLabelExtractor::GenerateLabeledVolume()\n\n//----------------------------------------------------------------------------\n\n{\n\n vtkALBASmartPointer<vtkDataArray> originalScalars = m_OutputData->GetPointData()->GetScalars(); \n\n vtkALBASmartPointer<vtkDataArray> labelScalars = m_OutputData->GetPointData()->GetScalars();\n\n\n\n std::vector<int> minVector;\n\n std::vector<int> maxVector;\n\n std::vector<int> labelIntVector;\n\n\n\n int counter= 0;\n\n //Fill the vectors of range and label value\n\n for (int c = 0; c < m_CheckedVector.size(); c++)\n\n {\n\n if (m_CheckedVector.at(c))\n\n {\n\n wxString label = m_LabelNameVector.at(c);\n\n wxStringTokenizer tkz(label,wxT(' '),wxTOKEN_RET_EMPTY_ALL);\n\n albaString labelName = tkz.GetNextToken().c_str();\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":69,"score":61750.245965323506},{"content":"}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::RemoveLabelTag(int component)\n\n//----------------------------------------------------------------------------\n\n{\n\n m_TagLabel->RemoveValue(component);\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\n void albaVMELabeledVolume::UpdateSlice()\n\n//----------------------------------------------------------------------------\n\n{\n\n m_Origin[2] = m_Slice;\n\n m_SP->SetOrigin( m_Bounds[0], m_Bounds[2], m_Origin[2] );\n\n m_ProbeFilter->Update();\n\n\n\n this->m_Rwi->m_RenFront->ResetCameraClippingRange();\n\n m_Rwi->m_RwiBase->Render();\n\n m_Rwi->m_RenderWindow->SetDesiredUpdateRate(15.f); \n","file_path":"VME/albaVMELabeledVolume.cpp","rank":70,"score":61749.66266507643},{"content":"}\n\n\n\n//----------------------------------------------------------------------------\n\nint albaVMELabeledVolume::GetMax( wxString &item )\n\n//----------------------------------------------------------------------------\n\n{\n\n wxString tmp = item.AfterFirst( ' ' ); \n\n tmp = tmp.AfterFirst( ' ' ); \n\n tmp = tmp.AfterFirst( ' ' ); \n\n wxString max = tmp.BeforeFirst( ' ' );\n\n long M = 0; \n\n max.ToLong( &M ); \n\n\n\n return (int)M;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::UpdateLookUpTable()\n\n//----------------------------------------------------------------------------\n\n{ \n","file_path":"VME/albaVMELabeledVolume.cpp","rank":71,"score":61749.32664037907},{"content":" vtkDEL( m_ActorSlice ); \n\n cppDEL( m_Dlg ); \n\n}\n\n\n\n//-------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::SetVolumeLink(albaVME *n)\n\n//-------------------------------------------------------------------------\n\n{\n\n SetLink(\"VolumeLink\", n);\n\n CopyDataset();\n\n Modified();\n\n}\n\n\n\n//-------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::InternalPreUpdate()\n\n//-------------------------------------------------------------------------\n\n{\n\n m_VolumeLink = GetVolumeLink();\n\n EnableWidgets(m_VolumeLink != NULL);\n\n\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":72,"score":61749.29346899379},{"content":"//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::OpDo()\n\n//----------------------------------------------------------------------------\n\n{\n\n\tif(m_VmeEditor)\n\n\t{\n\n\t\talbaVMESurface::SafeDownCast(m_Input)->SetData(vtkPolyData::SafeDownCast(m_VmeEditor->GetOutput()->GetVTKData()),((albaVMESurface*)m_Input)->GetTimeStamp());\n\n\t\talbaSmartPointer<mmaMaterial> mat;\n\n\t\tmat->DeepCopy(m_VmeEditor->GetMaterial());\n\n\t\talbaVMESurface::SafeDownCast(m_Input)->GetSurfaceOutput()->SetMaterial(mat);\n\n\t\talbaVMESurface::SafeDownCast(m_Input)->GetSurfaceOutput()->Update();\n\n\t\talbaVMESurface::SafeDownCast(m_Input)->GetOutput()->Update();\n\n\t\tGetLogicManager()->VmeVisualModeChanged(m_Input);\n\n\t\tGetLogicManager()->CameraUpdate();\n\n\t}\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::OpUndo()\n\n//----------------------------------------------------------------------------\n\n{\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":73,"score":61748.94626191418},{"content":" m_Gui->Enable(ID_EDIT_LABEL,enable);\n\n }\n\n else\n\n {\n\n int noc = m_TagLabel->GetNumberOfComponents();\n\n bool labelPresent = noc != 0;\n\n m_Gui->Enable(ID_INSERT_LABEL,enable);\n\n m_Gui->Enable(ID_REMOVE_LABEL,labelPresent);\n\n m_Gui->Enable(ID_EDIT_LABEL,labelPresent);\n\n }\n\n m_Gui->Update();\n\n }\n\n}\n\n//-------------------------------------------------------------------------\n\nchar** albaVMELabeledVolume::GetIcon() \n\n//-------------------------------------------------------------------------\n\n{\n\n#include \"albaVMEVolume.xpm\"\n\n return albaVMEVolume_xpm;\n\n}\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":74,"score":61748.86486350934},{"content":"// Failing in doing this will result in a run-time error saying:\n\n// \"Failure#0: The value of ESP was not properly saved across a function call\"\n\n//----------------------------------------------------------------------------\n\n\n\n\n\n#include \"albaOpLabelExtractor.h\"\n\n\n\n#include <wx/tokenzr.h>\n\n\n\n#include \"albaDecl.h\"\n\n#include \"albaGUICheckListBox.h\"\n\n#include \"albaOp.h\"\n\n#include \"albaEvent.h\"\n\n#include \"albaGUI.h\"\n\n#include \"albaVME.h\"\n\n#include \"albaVMEVolumeGray.h\"\n\n#include \"albaVMESurface.h\"\n\n#include \"albaTagItem.h\"\n\n#include \"albaTagArray.h\"\n\n\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":75,"score":61748.657265027454},{"content":" if (m_VolumeLink == NULL)\n\n {\n\n return;\n\n }\n\n\n\n if (!m_DataCopied)\n\n {\n\n CopyDataset();\n\n }\n\n GenerateLabeledVolume(); \n\n}\n\n//-------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::CopyDataset()\n\n//-------------------------------------------------------------------------\n\n{\n\n m_VolumeLink = GetVolumeLink();\n\n if (m_VolumeLink)\n\n {\n\n vtkDataSet *data = m_VolumeLink->GetOutput()->GetVTKData();\n\n data->Update();\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":76,"score":61748.28485244602},{"content":"// Failing in doing this will result in a run-time error saying:\n\n// \"Failure#0: The value of ESP was not properly saved across a function call\"\n\n//----------------------------------------------------------------------------\n\n\n\n#include \"albaVMELabeledVolume.h\"\n\n\n\n#include <wx/tokenzr.h>\n\n\n\n#include \"albaGUI.h\"\n\n#include \"albaGUIDialogPreview.h\"\n\n#include \"mmaMaterial.h\"\n\n#include \"mmaVolumeMaterial.h\"\n\n#include \"albaVME.h\"\n\n#include \"albaTransform.h\"\n\n#include \"albaGUIButton.h\"\n\n#include \"albaGUIValidator.h\"\n\n#include \"albaGUICheckListBox.h\"\n\n#include \"albaInteractorExtractIsosurface.h\"\n\n#include \"albaRWIBase.h\"\n\n#include \"albaRWI.h\"\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":77,"score":61748.19634841352},{"content":"}\n\n\n\n//-----------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::RetrieveTag()\n\n//----------------------------------------------------------------------\n\n{ \n\n bool tagPresent = this->GetTagArray()->IsTagPresent(\"LABELS\");\n\n if (!tagPresent)\n\n {\n\n albaTagItem tag_Item;\n\n tag_Item.SetName(\"LABELS\");\n\n this->GetTagArray()->SetTag(tag_Item);\n\n }\n\n m_TagLabel = new albaTagItem;\n\n m_TagLabel = this->GetTagArray()->GetTag( \"LABELS\" );\n\n}\n\n\n\n//-----------------------------------------------------------------------\n\nint albaVMELabeledVolume::InternalStore(albaStorageElement *parent)\n\n//-----------------------------------------------------------------------\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":78,"score":61748.107942260496},{"content":"// Failing in doing this will result in a run-time error saying:\n\n// \"Failure#0: The value of ESP was not properly saved across a function call\"\n\n//----------------------------------------------------------------------------\n\n\n\n#include \"albaOpLabelizeSurface.h\"\n\n#include \"albaGUI.h\"\n\n#include \"mmaMaterial.h\"\n\n#include \"albaAbsMatrixPipe.h\"\n\n#include \"albaInteractorCompositorMouse.h\"\n\n#include \"albaInteractorGenericMouse.h\"\n\n#include \"albaGizmoTranslate.h\"\n\n#include \"albaGizmoRotate.h\"\n\n#include \"albaGizmoScale.h\"\n\n#include \"albaRefSys.h\"\n\n#include \"albaTransform.h\"\n\n\n\n#include \"albaMatrix.h\"\n\n#include \"albaVME.h\"\n\n#include \"albaVMESurface.h\"\n\n#include \"albaVMEGizmo.h\"\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":79,"score":61748.009749219185},{"content":"\talbaVMESurface::SafeDownCast(m_Input)->SetData(m_OriginalPolydata,((albaVMESurface*)m_Input)->GetTimeStamp());\n\n\tGetLogicManager()->CameraUpdate();\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::Labelize()\n\n//----------------------------------------------------------------------------\n\n{\n\n\tvtkALBASmartPointer<vtkTransform> rotate;\n\n\trotate->RotateX(180);\n\n\n\n\tvtkALBASmartPointer<vtkTransformPolyDataFilter> before_transform_plane;\n\n\tvtkALBASmartPointer<vtkTransformPolyDataFilter> transform_plane;\n\n\tif(m_LabelInside==1)//if clip reverse is necessary rotate plane\n\n\t{\n\n\t\tbefore_transform_plane->SetTransform(rotate);\n\n\t\tbefore_transform_plane->SetInput(m_PlaneSource->GetOutput());\n\n\t\tbefore_transform_plane->Update();\n\n\n\n\t\ttransform_plane->SetInput(before_transform_plane->GetOutput());\n\n\t}\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":80,"score":61747.95519808186},{"content":" m_Texture = NULL;\n\n m_SMapper = NULL;\n\n m_ActorSlice = NULL; \n\n\n\n m_LabelNameValue = wxEmptyString;\n\n m_LabelValueValue = wxEmptyString;\n\n\n\n albaNEW(m_Transform);\n\n albaVMEOutputVolume *output = albaVMEOutputVolume::New(); // an output with no data\n\n output->SetTransform(m_Transform); // force my transform in the output\n\n SetOutput(output);\n\n \n\n DependsOnLinkedNodeOn();\n\n\n\n // attach a data pipe which creates a bridge between VTK and ALBA\n\n albaDataPipeCustom *dpipe = albaDataPipeCustom::New();\n\n dpipe->SetDependOnAbsPose(true);\n\n SetDataPipe(dpipe);\n\n dpipe->SetInput(NULL);\n\n \n","file_path":"VME/albaVMELabeledVolume.cpp","rank":81,"score":61747.85759340514},{"content":"}\n\n\n\n//-------------------------------------------------------------------------\n\nmmaVolumeMaterial * albaVMELabeledVolume::GetMaterial()\n\n//-------------------------------------------------------------------------\n\n{\n\n mmaVolumeMaterial *material = (mmaVolumeMaterial *)GetAttribute(\"VolumeMaterialAttributes\");\n\n if (material == NULL)\n\n {\n\n material = mmaVolumeMaterial::New();\n\n SetAttribute(\"VolumeMaterialAttributes\", material);\n\n if (m_Output)\n\n {\n\n ((albaVMEOutputVolume *)m_Output)->SetMaterial(material);\n\n }\n\n }\n\n return material;\n\n}\n\n//----------------------------------------------------------------------------\n\nint albaVMELabeledVolume::GetLabelValue( wxString &item )\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":82,"score":61747.35720819402},{"content":"\tif(m_ResultPolyData.size()>1)\n\n\t{\n\n\t\tvtkDEL(m_ResultPolyData[m_ResultPolyData.size()-1]);\n\n\t\tm_ResultPolyData.pop_back();\n\n\t\t((albaVMESurface*)m_VmeEditor)->SetData((vtkPolyData*)m_ResultPolyData[m_ResultPolyData.size()-1],m_Input->GetTimeStamp());\n\n\t\t\n\n\t\t((albaVMESurface*)m_VmeEditor)->InvokeEvent(this,VME_OUTPUT_DATA_UPDATE);\n\n\t}\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::UpdateISARefSys()\n\n//----------------------------------------------------------------------------\n\n{\n\n\tm_IsaRotate->GetRotationConstraint()->GetRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\n\n\tm_IsaRotate->GetPivotRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\n\n\n\n\tm_IsaTranslate->GetTranslationConstraint()->GetRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\n\n\tm_IsaTranslate->GetPivotRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\n\n}\n\n//----------------------------------------------------------------------------\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":83,"score":61747.26630981929},{"content":" albaString labelIntStr = tkz.GetNextToken().c_str();\n\n int labelIntValue = atoi(labelIntStr);\n\n labelIntVector.push_back(labelIntValue);\n\n //Set the label value for vtkImageThreshold\n\n m_ValLabel = labelIntValue;\n\n albaString minStr = tkz.GetNextToken().c_str();\n\n int minValue = atof(minStr);\n\n minVector.push_back(minValue);\n\n albaString maxStr = tkz.GetNextToken().c_str();\n\n int mxValue = atof(maxStr);\n\n maxVector.push_back(mxValue);\n\n counter++;\n\n }\n\n }\n\n\n\n //Modify the scalars value, with the value of the label checked\n\n int labelVlaue;\n\n if (counter != 0)\n\n {\n\n int num_tuple = originalScalars->GetNumberOfTuples();\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":84,"score":61747.23560537335},{"content":"\n\n//----------------------------------------------------------------------------\n\nalbaOpLabelExtractor::albaOpLabelExtractor(const wxString& label) :\n\nalbaOp(label)\n\n//----------------------------------------------------------------------------\n\n{\n\n m_OpType\t= OPTYPE_OP;\n\n m_Canundo = true;\n\n\n\n\tm_Vme = NULL;\n\n m_Ds = NULL;\n\n m_OutputData = NULL;\n\n m_TagLabel = NULL;\n\n\tm_ValLabel = 0;\n\n\tm_SurfaceName = \"label 0\";\n\n m_SmoothVolume = 0;\n\n m_RadiusFactor = 0.5;\n\n m_RadiusFactorAfter = 0.5;\n\n m_StdDev[0] = m_StdDev[1] = 1.5;\n\n m_StdDev[2] = 2.0;\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":85,"score":61746.98004759229},{"content":" volumeScalars = rg->GetPointData()->GetScalars(); \n\n }\n\n int numberC = m_TagLabel->GetNumberOfComponents();\n\n bool lastComponent = false;\n\n int numberChecked = 0;\n\n\n\n std::vector<int> minVector;\n\n std::vector<int> maxVector;\n\n std::vector<int> labelIntVector;\n\n\n\n int counter= 0;\n\n //Fill the vectors of range and label value\n\n for (int c = 0; c < m_CheckedVector.size(); c++)\n\n {\n\n if (m_CheckedVector.at(c))\n\n {\n\n wxString label = m_LabelNameVector.at(c);\n\n wxStringTokenizer tkz(label,wxT(' '),wxTOKEN_RET_EMPTY_ALL);\n\n albaString labelName = tkz.GetNextToken().c_str();\n\n albaString labelIntStr = tkz.GetNextToken().c_str();\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":86,"score":61746.939032067254},{"content":" for ( int i = 0; i < num_tuple; i++ )\n\n {\n\n bool modified = false;\n\n double scalarValue = labelScalars->GetComponent( i, 0 );\n\n for (int c = 0; c < labelIntVector.size(); c++)\n\n {\n\n if ( scalarValue >= minVector.at(c) && scalarValue <= maxVector.at(c))\n\n { \n\n labelVlaue = labelIntVector.at(c);\n\n labelScalars->SetTuple1( i, labelVlaue ); \n\n modified = true;\n\n }\n\n }\n\n if (!modified)\n\n {\n\n labelScalars->SetTuple1( i, OUTRANGE_SCALAR ); \n\n }\n\n }\n\n\n\n labelScalars->Modified();\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":87,"score":61746.911625393186},{"content":" m_LookUpTableColor->DeepCopy( m_LookUpTable );\n\n for ( int i = m_Min; i <= m_Max; i++ )\n\n {\n\n vtkIdType index = m_LookUpTableColor->GetIndex( i ); \n\n m_LookUpTableColor->SetTableValue( index, 1.0f, 0.0f, 0.0f );\n\n }\n\n m_Texture->SetLookupTable( m_LookUpTableColor ); \n\n m_Rwi->m_RwiBase->Render(); \n\n} \n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaVMELabeledVolume::EnableWidgets(bool enable)\n\n//----------------------------------------------------------------------------\n\n{\n\n if (m_Gui)\n\n {\n\n if (!enable || !m_VolumeLink)\n\n {\n\n m_Gui->Enable(ID_INSERT_LABEL,enable);\n\n m_Gui->Enable(ID_REMOVE_LABEL,enable);\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":88,"score":61746.63465470395},{"content":" for (int c = 0; c < labelIntVector.size(); c++)\n\n {\n\n if ( scalarValue >= minVector.at(c) && scalarValue <= maxVector.at(c))\n\n { \n\n labelVlaue = labelIntVector.at(c);\n\n labelScalars->SetTuple1( i, labelVlaue ); \n\n modified = true;\n\n }\n\n }\n\n if (!modified)\n\n {\n\n labelScalars->SetTuple1( i, OUTRANGE_SCALAR); \n\n }\n\n }\n\n \n\n labelScalars->Modified();\n\n m_Dataset->GetPointData()->SetScalars(labelScalars);\n\n m_Dataset->Modified();\n\n }\n\n else\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":89,"score":61746.55440975321},{"content":" \n\n vtkALBASmartPointer<vtkALBAContourVolumeMapper> contourMapper;\n\n contourMapper->SetInput((vtkDataSet *)imageToSp->GetOutput());\n\n contourMapper->SetContourValue(m_ValLabel);\n\n\n\n\tvtkALBASmartPointer<vtkPolyData> surface;\n\n contourMapper->GetOutput(0, surface);\t\n\n\tcontourMapper->Update();\n\n\n\n albaNEW(m_Vme);\n\n\tm_Vme->SetData(surface, 0.0);\n\n m_Vme->SetName(m_SurfaceName.c_str());\n\n m_Vme->Update();\n\n m_Output = m_Vme;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelExtractor::SetLabel(double labelValue)\n\n//----------------------------------------------------------------------------\n\n{\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":90,"score":61746.51447334561},{"content":" m_MaxMin = m_MinAbsolute; \n\n m_MaxMax = m_MaxAbsolute;\n\n \n\n m_LabelNameValue = labelName;\n\n m_LabelValueValue = labelIntStr;\n\n m_LabelIntValue = labelValue;\n\n m_Min = min;\n\n m_Max = max;\n\n CreateOpDialog();\n\n m_Dlg->ShowModal(); \n\n } \n\n }\n\n } \n\n else\n\n break;\n\n }\n\n break;\n\n case ID_LABELS:\n\n {\n\n int itemId = e->GetArg();\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":91,"score":61746.50583757028},{"content":" if (albaEvent *e = albaEvent::SafeDownCast(alba_event))\n\n {\n\n switch(e->GetId())\n\n {\n\n\t\t case wxOK:\n\n\t\t\t ExtractLabel();\n\n\t\t\t if(m_Input->GetOutput()->GetVTKData() != NULL)\n\n\t\t\t\t OpStop(OP_RUN_OK);\n\n\t\t\t else\n\n\t\t\t {\n\n\t\t\t\t wxString msg = wxString::Format(\"Label %d not found!\", m_ValLabel);\n\n\t\t\t\t wxMessageBox(msg,\"Warning\");\n\n\t\t\t\t OpStop(OP_RUN_CANCEL);\n\n\t\t\t }\n\n\t\t break;\n\n\t\t case wxCANCEL:\n\n\t\t\t OpStop(OP_RUN_CANCEL);\n\n\t\t break;\n\n case ID_SMOOTH:\n\n m_Gui->Enable(ID_RADIUS_FACTOR,m_SmoothVolume != 0);\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":92,"score":61746.38297994673},{"content":" {\n\n for ( unsigned int i = 0; i < noc; i++ )\n\n {\n\n wxString label = m_TagLabel->GetValue( i );\n\n if ( label != \"\" )\n\n {\n\n myList.push_back( label );\n\n }\n\n } \n\n\n\n int checkListId = 0;\n\n for( myListIter = myList.begin(); myListIter != myList.end(); myListIter++ )\n\n {\n\n for ( unsigned int j = 0; j < noc; j++ )\n\n {\n\n wxString component = m_TagLabel->GetValue( j );\n\n if ( component != \"\" )\n\n {\n\n wxString labelName = *myListIter;\n\n if ( component == labelName )\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":93,"score":61746.34852942224},{"content":" }\n\n }\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelExtractor::UpdateDataLabel()\n\n//----------------------------------------------------------------------------\n\n{\n\n albaVME *linkedNode = m_Input->GetLink(\"VolumeLink\");\n\n albaSmartPointer<albaVME> linkedVolume = linkedNode;\n\n\n\n //Get dataset from volume linked to\n\n vtkDataSet *data = linkedVolume->GetOutput()->GetVTKData();\n\n data->Update();\n\n\n\n //Create a copy of the dataset not to modify the original one\n\n m_Ds = data->NewInstance();\n\n m_Ds->DeepCopy(data);\n\n\n\n}\n\n\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":94,"score":61746.284704283855},{"content":" m_Gui->Vector(ID_SAMPLING_RATE,_(\"sample rate\"),m_SamplingRate, 1, MAXINT,_(\"sampling rate for volume sub-sampling.\"));\n\n m_Gui->Divider();\n\n m_Gui->Float(ID_RADIUS_FACTOR_AFTER,_(\"rad. factor\"),&m_RadiusFactorAfter,0.1,MAXFLOAT,0,2,_(\"max distance to consider for the smooth.\"));\n\n m_Gui->Vector(ID_STD_DEVIATION_AFTER,_(\"std dev.\"),m_StdDevAfter, 0.1, MAXFLOAT,2,_(\"standard deviation for the smooth.\"));\n\n m_Gui->Divider(2);\n\n m_Gui->Divider();\n\n\n\n if (m_Input->IsA(\"albaVMELabeledVolume\"))\n\n {\n\n m_LabelCheckBox = m_Gui->CheckList(ID_LABELS,_(\"Labels\"),360,_(\"Chose label to extract\"));\n\n\n\n typedef std::list< wxString > LIST;\n\n LIST myList; \n\n LIST::iterator myListIter; \n\n\n\n // If there is a tag named \"LABELS\" then I have to load the labels in the correct position in the listbox\n\n if (RetrieveTag())\n\n {\n\n int noc = m_TagLabel->GetNumberOfComponents();\n\n if(noc != 0)\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":95,"score":61746.27754736759},{"content":" m_TagLabel = new albaTagItem;\n\n m_TagLabel = m_Input->GetTagArray()->GetTag( \"LABELS\" );\n\n return tagPresent;\n\n }\n\n else\n\n return !tagPresent;\n\n}\n\n\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelExtractor::OpRun() \n\n//----------------------------------------------------------------------------\n\n{\n\n\tm_Gui = new albaGUI(this);\n\n\tm_Gui->SetListener(this);\n\n\n\n m_Gui->Bool(ID_SMOOTH,_(\"smooth\"),&m_SmoothVolume,0,_(\"gaussian smooth for extracting big surface\"));\n\n m_Gui->Divider(2);\n\n m_Gui->Float(ID_RADIUS_FACTOR,_(\"rad. factor\"),&m_RadiusFactor,0.1,MAXFLOAT,0,2,_(\"max distance to consider for the smooth.\"));\n\n m_Gui->Vector(ID_STD_DEVIATION,_(\"std dev.\"),m_StdDev, 0.1, MAXFLOAT,2,_(\"standard deviation for the smooth.\"));\n\n m_Gui->Divider();\n","file_path":"Operations/albaOpLabelExtractor.cpp","rank":96,"score":61746.23982850289},{"content":"\tnewPolyData2->Update();\n\n\n\n\tvtkALBASmartPointer<vtkAppendPolyData> append;\n\n\tappend->SetInput(newPolyData1);\n\n\tappend->AddInput(newPolyData2);\n\n\tappend->Update();\n\n\n\n\n\n\tvtkALBASmartPointer<vtkCleanPolyData> clean;\n\n\tclean->SetInput(append.GetPointer()->GetOutput());\n\n\tclean->Update();\n\n\n\n\tvtkALBASmartPointer<vtkTransformPolyDataFilter> transform_data_output;\n\n\ttransform_data_output->SetTransform(m_VmeEditor->GetAbsMatrixPipe()->GetVTKTransform()->GetInverse());\n\n\ttransform_data_output->SetInput(clean->GetOutput());\n\n\ttransform_data_output->Update();\n\n\n\n\tint result=(m_VmeEditor)->SetData(transform_data_output->GetOutput(),m_VmeEditor->GetTimeStamp());\n\n\n\n\tif(result==ALBA_OK)\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":97,"score":61746.22744165996},{"content":" m_LabelIntValue = atoi(labelIntStr);\n\n labelIntVector.push_back(m_LabelIntValue);\n\n albaString minStr = tkz.GetNextToken().c_str();\n\n m_MinValue = atof(minStr);\n\n minVector.push_back(m_MinValue);\n\n albaString maxStr = tkz.GetNextToken().c_str();\n\n m_MaxValue = atof(maxStr);\n\n maxVector.push_back(m_MaxValue);\n\n counter++;\n\n }\n\n }\n\n \n\n int labelVlaue;\n\n if (counter != 0)\n\n {\n\n int not = volumeScalars->GetNumberOfTuples();\n\n for ( int i = 0; i < not; i++ )\n\n {\n\n bool modified = false;\n\n double scalarValue = volumeScalars->GetComponent( i, 0 );\n","file_path":"VME/albaVMELabeledVolume.cpp","rank":98,"score":61746.22287704076},{"content":"\t{\n\n\t\tvtkPolyData *poly;\n\n\t\tvtkNEW(poly);\n\n\t\tpoly->DeepCopy(transform_data_output->GetOutput());\n\n\t\tpoly->Update();\n\n\t\tm_ResultPolyData.push_back(poly);\n\n\t}\n\n\n\n\t((albaVMESurface*)m_VmeEditor)->Modified();\n\n\t((albaVMESurface*)m_VmeEditor)->Update();\n\n\n\n\t((albaVMESurface*)m_VmeEditor)->InvokeEvent(this, VME_OUTPUT_DATA_UPDATE);\n\n\n\n\t/*m_Gui->Enable(ID_UNDO,m_ResultPolyData.size()>1);\n\n\tm_Gui->Enable(wxOK,m_ResultPolyData.size()>1);*/\n\n}\n\n//----------------------------------------------------------------------------\n\nvoid albaOpLabelizeSurface::ChangeGizmo()\n\n//----------------------------------------------------------------------------\n\n{\n","file_path":"Operations/albaOpLabelizeSurface.cpp","rank":99,"score":61746.17499723435}],"string":"[\n {\n \"content\": \" function is of type void *, and returns NULL.\\n\\n Otherwise the type is void which is correct for WIN32\\n\\n and SPROC\\n\\n*/ \\n\\n#ifdef CMAKE_USE_SPROC_INIT\\n\\ntypedef int mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n\\n\\n#ifdef CMAKE_USE_PTHREADS_INIT\\n\\ntypedef void *(*mmuInternalThreadFunctionType)(void *);\\n\\ntypedef pthread_t mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n#ifdef CMAKE_USE_WIN32_THREADS_INIT\\n\\ntypedef LPTHREAD_START_ROUTINE mmuInternalThreadFunctionType;\\n\\ntypedef HANDLE mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n#if !defined(CMAKE_USE_PTHREADS_INIT) && !defined(CMAKE_USE_WIN32_THREADS_INIT)\\n\\ntypedef void (*mmuInternalThreadFunctionType)(void *);\\n\\ntypedef int mmuThreadProcessIDType;\\n\\n#endif\\n\\n\\n\\n\\n\",\n \"file_path\": \"Base/albaMultiThreader.h\",\n \"rank\": 0,\n \"score\": 233669.75963329288\n },\n {\n \"content\": \" def __init__(self):\\n\\n AbstractRule.__init__(self)\\n\",\n \"file_path\": \"qa/Rules/ClassStructureRules/UselessIncludesRule.py\",\n \"rank\": 1,\n \"score\": 98174.05697326675\n },\n {\n \"content\": \"static GLboolean _glewInit_GL_ARB_shading_language_include (GLEW_CONTEXT_ARG_DEF_INIT)\\n\\n{\\n\\n GLboolean r = GL_FALSE;\\n\\n\\n\\n r = ((glCompileShaderIncludeARB = (PFNGLCOMPILESHADERINCLUDEARBPROC)glewGetProcAddress((const GLubyte*)\\\"glCompileShaderIncludeARB\\\")) == NULL) || r;\\n\\n r = ((glDeleteNamedStringARB = (PFNGLDELETENAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\\\"glDeleteNamedStringARB\\\")) == NULL) || r;\\n\\n r = ((glGetNamedStringARB = (PFNGLGETNAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\\\"glGetNamedStringARB\\\")) == NULL) || r;\\n\\n r = ((glGetNamedStringivARB = (PFNGLGETNAMEDSTRINGIVARBPROC)glewGetProcAddress((const GLubyte*)\\\"glGetNamedStringivARB\\\")) == NULL) || r;\\n\\n r = ((glIsNamedStringARB = (PFNGLISNAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\\\"glIsNamedStringARB\\\")) == NULL) || r;\\n\\n r = ((glNamedStringARB = (PFNGLNAMEDSTRINGARBPROC)glewGetProcAddress((const GLubyte*)\\\"glNamedStringARB\\\")) == NULL) || r;\\n\\n\\n\\n return r;\\n\",\n \"file_path\": \"GPUAPI/GLEW/glew.c\",\n \"rank\": 2,\n \"score\": 98174.05697326675\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\n// Constants :\\n\\n//----------------------------------------------------------------------------\\n\\nenum LABEL_EXTRACTOR_WIDGET_ID\\n\\n{\\n\\n\\tID_LABEL = MINID,\\t\\n\\n ID_SMOOTH,\\n\\n ID_RADIUS_FACTOR,\\n\\n ID_STD_DEVIATION,\\n\\n ID_SAMPLING_RATE,\\n\\n ID_RADIUS_FACTOR_AFTER,\\n\\n ID_STD_DEVIATION_AFTER,\\n\\n ID_LABELS,\\n\\n\\tID_NAME,\\n\\n};\\n\\n\\n\\n//-----------------------------------------------------------------------\\n\\nbool albaOpLabelExtractor::RetrieveTag()\\n\\n//----------------------------------------------------------------------\\n\\n{ \\n\\n bool tagPresent = m_Input->GetTagArray()->IsTagPresent(\\\"LABELS\\\");\\n\\n if (tagPresent)\\n\\n {\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 3,\n \"score\": 71588.89098228574\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\n// forward references :\\n\\n//----------------------------------------------------------------------------\\n\\nclass albaVMELabeledVolume;\\n\",\n \"file_path\": \"Operations/albaOpCreateLabeledVolume.h\",\n \"rank\": 4,\n \"score\": 71588.89098228574\n },\n {\n \"content\": \"class albaResultQueryAbstractHandlerSample : public albaResultQueryAbstractHandler\\n\\n{\\n\\npublic:\\n\\n /** constructor */\\n\\n albaResultQueryAbstractHandlerSample();\\n\\n /** destructor */\\n\\n virtual ~albaResultQueryAbstractHandlerSample(){}; \\n\\n\\n\\n /** RTTI macro */\\n\\n albaTypeMacro(albaResultQueryAbstractHandlerSample, albaResultQueryAbstractHandler);\\n\\n\\n\\n /** load result of Query */\\n\\n /*virtual void*/ void LoadQueryResult();\\n\\n\\n\\n /** load result of Query */\\n\\n /*virtual*/ bool IsFailed();\\n\\n\\n\\n};\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Testing/Common/albaResultQueryAbstractHandlerTest.cpp\",\n \"rank\": 5,\n \"score\": 69280.813882646\n },\n {\n \"content\": \" class name: albaResultQueryAbstractHandler\\n\\n Interface for handle results from a query to a database\\n\\n*/\\n\",\n \"file_path\": \"Common/albaResultQueryAbstractHandler.h\",\n \"rank\": 6,\n \"score\": 69056.61987154378\n },\n {\n \"content\": \"class name albaOpCreateLabeledVolume\\n\\nCreate a albaVMELabeledVolume.\\n\\n*/\\n\",\n \"file_path\": \"Operations/albaOpCreateLabeledVolume.h\",\n \"rank\": 7,\n \"score\": 69007.30752109902\n },\n {\n \"content\": \"class ALBA_EXPORT albaVMELabeledVolume : public albaVME\\n\\n{\\n\\npublic:\\t\\n\\n\\n\\n\\talbaTypeMacro(albaVMELabeledVolume,albaVME);\\n\\n\\n\\n /** Return the value of the label. */\\n\\n int GetLabelValue( wxString &item ); \\n\\n\\n\\n /** Set a tag with the label values. */\\n\\n void SetLabelTag(albaString label, int component);\\n\\n\\n\\n /** Remove a tag. */\\n\\n void RemoveLabelTag(int component);\\n\\n\\n\\n /** Return true if the data associated with the VME is present and updated at the current time.*/\\n\\n /*virtual*/ bool IsDataAvailable();\\n\\n\\n\\n /** Fill the vector of label. */\\n\\n void FillLabelVector(wxString name, bool checked = TRUE);\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 8,\n \"score\": 66605.43366045295\n },\n {\n \"content\": \"class ALBA_EXPORT albaOpLabelizeSurface: public albaOp\\n\\n{\\n\\npublic:\\n\\n\\talbaOpLabelizeSurface(const wxString &label = \\\"Labelize Surface\\\");\\n\\n\\t~albaOpLabelizeSurface(); \\n\\n\\tvirtual void OnEvent(albaEventBase *alba_event);\\n\\n\\n\\n\\talbaTypeMacro(albaOpLabelizeSurface, albaOp);\\n\\n\\n\\n\\talbaOp* Copy();\\n\\n\\n\\n\\tbool Accept(albaVME*node); \\n\\n\\tvoid OpRun();\\n\\n\\tvoid OpDo();\\n\\n\\tvoid OpUndo();\\n\\n\\n\\n\\tenum GIZMO_TYPE\\n\\n\\t{\\n\\n\\t\\tGIZMO_TRANSLATE = 0,\\n\\n\\t\\tGIZMO_ROTATE,\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.h\",\n \"rank\": 9,\n \"score\": 66605.43366045295\n },\n {\n \"content\": \"class ALBA_EXPORT albaOpLabelExtractor: public albaOp\\n\\n{\\n\\npublic:\\n\\n albaOpLabelExtractor(const wxString& label = \\\"LabelExtractor\\\");\\n\\n ~albaOpLabelExtractor(); \\n\\n\\n\\n albaTypeMacro(albaOpLabelExtractor, albaOp);\\n\\n\\n\\n\\n\\n\\tvirtual void OnEvent(albaEventBase *alba_event);\\n\\n albaOp* Copy();\\n\\n\\n\\n bool Accept(albaVME *vme);\\n\\n void OpRun();\\n\\n\\n\\n /** If labels tags are present retrieve them. */\\n\\n bool RetrieveTag();\\n\\n\\n\\n /** Fill the vector of label. */\\n\\n void FillLabelVector(wxString name, bool checked = TRUE);\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.h\",\n \"rank\": 10,\n \"score\": 66605.43366045295\n },\n {\n \"content\": \"class ALBA_EXPORT albaVMEOutputNULL : public albaVMEOutput\\n\\n{\\n\\npublic:\\n\\n albaTypeMacro(albaVMEOutputNULL,albaVMEOutput)\\n\\n\\n\\n#ifdef ALBA_USE_VTK\\n\\n /**\\n\\n Return a VTK dataset corresponding to the current time. This is\\n\\n the output of the DataPipe currently attached to the VME.\\n\\n Usually the output is a \\\"smart copy\\\" of one of the dataset in \\n\\n the DataArray. In some cases it can be NULL, e.g. in case the number\\n\\n of stored Items is 0. Also special VME could not support VTK dataset output.\\n\\n An event is rised when the output data changes to allow attached classes to \\n\\n update their input.*/\\n\\n virtual vtkDataSet *GetVTKData() {return NULL;}\\n\\n#endif\\n\\n\\n\\n /**\\n\\n Update all the output data structures (data, bounds, matrix and abs matrix).*/\\n\\n virtual void Update() {}\\n\",\n \"file_path\": \"Core/albaVMEOutputNULL.h\",\n \"rank\": 11,\n \"score\": 65516.8583361979\n },\n {\n \"content\": \"class albaVMEOutputNULLTest : public albaTest\\n\\n{\\n\\npublic: \\n\\n\\n\\n // CPPUNIT test suite\\n\\n CPPUNIT_TEST_SUITE( albaVMEOutputNULLTest );\\n\\n CPPUNIT_TEST(TestFixture); // just to test that the fixture has no leaks\\n\\n CPPUNIT_TEST(TestDynamicAllocation);\\n\\n CPPUNIT_TEST(TestGetVTKData);\\n\\n\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\nprivate:\\n\\n void TestFixture();\\n\\n void TestDynamicAllocation();\\n\\n void TestGetVTKData();\\n\\n\\n\\n bool result;\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Testing/Core/albaVMEOutputNULLTest.h\",\n \"rank\": 12,\n \"score\": 65516.8583361979\n },\n {\n \"content\": \"class name: albaResultQueryAbstractHandlerTest\\n\\n Test class for albaResultQueryAbstractHandler\\n\\n*/\\n\",\n \"file_path\": \"Testing/Common/albaResultQueryAbstractHandlerTest.h\",\n \"rank\": 13,\n \"score\": 65512.905921635844\n },\n {\n \"content\": \"class albaOpLabelizeSurfaceTest : public albaTest\\n\\n{\\n\\n\\tCPPUNIT_TEST_SUITE( albaOpLabelizeSurfaceTest );\\n\\n\\tCPPUNIT_TEST( Test );\\n\\n\\tCPPUNIT_TEST_SUITE_END();\\n\\n\\n\\nprotected:\\n\\n\\tvoid Test();\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Testing/Operations/albaOpLabelizeSurfaceTest.h\",\n \"rank\": 14,\n \"score\": 65466.12408694033\n },\n {\n \"content\": \"class albaVMELabeledVolumeTest : public albaTest\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tCPPUNIT_TEST_SUITE( albaVMELabeledVolumeTest );\\n\\n CPPUNIT_TEST( TestDynamicAllocation );\\n\\n CPPUNIT_TEST( TestVolumeCopy );\\n\\n\\tCPPUNIT_TEST( TestGenerateLabeledVolume );\\n\\n CPPUNIT_TEST( TestRemoveLabelTag );\\n\\n CPPUNIT_TEST( TestSetLabelTag );\\n\\n\\tCPPUNIT_TEST( TestDeepCopy );\\n\\n\\tCPPUNIT_TEST_SUITE_END();\\n\\n\\n\\nprotected:\\n\\n void TestFixture();\\n\\n void TestDynamicAllocation();\\n\\n\\tvoid TestVolumeCopy();\\n\\n\\tvoid TestGenerateLabeledVolume();\\n\\n void TestRemoveLabelTag();\\n\\n void TestSetLabelTag();\\n\\n void TestDeepCopy();\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Testing/VME/albaVMELabeledVolumeTest.h\",\n \"rank\": 15,\n \"score\": 65466.12408694033\n },\n {\n \"content\": \"class albaOpLabelExtractorTest : public albaTest\\n\\n{\\n\\npublic:\\n\\n\\n\\n\\tCPPUNIT_TEST_SUITE( albaOpLabelExtractorTest );\\n\\n CPPUNIT_TEST( TestDynamicAllocation );\\n\\n CPPUNIT_TEST( TestLabelRG );\\n\\n CPPUNIT_TEST( TestLabelSP );\\n\\n CPPUNIT_TEST( TestLabelSmoothRG );\\n\\n CPPUNIT_TEST( TestLabelSmoothSP );\\n\\n\\tCPPUNIT_TEST_SUITE_END();\\n\\n\\n\\nprotected:\\n\\n void TestFixture();\\n\\n void TestDynamicAllocation();\\n\\n\\tvoid TestLabelRG();\\n\\n void TestLabelSP();\\n\\n void TestLabelSmoothRG();\\n\\n void TestLabelSmoothSP();\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Testing/Operations/albaOpLabelExtractorTest.h\",\n \"rank\": 16,\n \"score\": 65466.12408694033\n },\n {\n \"content\": \"class UselessIncludesRule(AbstractRule):\\n\\n def __init__(self):\\n\\n AbstractRule.__init__(self)\\n\\n self.DictionaryList = []\\n\\n\\n\\n def execute(self):\\n\\n self.dom = xd.parse(self.FullPathInputFile)\\n\\n className = self.dom.getElementsByTagName('compounddef')[0].getElementsByTagName('compoundname')[0].firstChild.nodeValue\\n\\n baseClassName = \\\"\\\"\\n\\n try:\\n\\n baseClassName = self.dom.getElementsByTagName('compounddef')[0].getElementsByTagName('basecompoundref')[0].firstChild.nodeValue\\n\\n try:\\n\\n baseClassName = baseClassName[baseClassName.index(\\\"::\\\")+2:]\\n\\n except:\\n\\n pass\\n\\n except:\\n\\n pass\\n\\n refInclude = \\\"\\\" \\n\\n try: \\n\\n refInclude = self.dom.getElementsByTagName('compounddef')[0].getElementsByTagName('includes')[0].attributes[\\\"refid\\\"].value\\n\\n except:\\n\\n pass\\n\\n \\n\\n f = open(\\\"./Rules/ClassStructureRules/\\\" + self.ParameterList[0], 'r')\\n\\n lines = f.readlines()\\n\\n for line in lines:\\n\\n self.DictionaryList.append(line.replace(\\\"\\\\n\\\",\\\"\\\").replace(\\\"\\\\r\\\",\\\"\\\"))\\n\\n \\n\\n directory = os.path.dirname(self.FullPathInputFile)\\n\\n \\n\\n classToIcludeList = []\\n\\n if(refInclude != \\\"\\\"):\\n\\n xmlFile = os.path.join(directory, refInclude + \\\".xml\\\")\\n\\n extDom = xd.parse(xmlFile)\\n\\n includeList = extDom.getElementsByTagName('compounddef')[0].getElementsByTagName('includes')\\n\\n classToIcludeList = [i.firstChild.nodeValue.split('.')[0] for i in includeList]\\n\\n \\n\\n #print len(classToIcludeList)\\n\\n dict = {}\\n\\n for item in classToIcludeList:\\n\\n dict[item] = False\\n\\n #print className, item\\n\\n if(item == baseClassName or (item + \\\".h\\\") in self.DictionaryList):\\n\\n dict[item] = True\\n\\n #print item , self.DictionaryList\\n\\n continue\\n\\n \\n\\n members = self.dom.getElementsByTagName('memberdef')\\n\\n for member in members:\\n\\n attrs = member.attributes\\n\\n if(attrs[\\\"kind\\\"].value == \\\"variable\\\"):\\n\\n #check type\\n\\n typeVariable = None\\n\\n try:\\n\\n typeVariable = member.getElementsByTagName('definition')[0].firstChild.nodeValue\\n\\n except:\\n\\n pass\\n\\n #check\\n\\n if(typeVariable != None and item in typeVariable and not((item + \\\"*\\\") in typeVariable) and not((item + \\\" *\\\") in typeVariable)):\\n\\n #include correct! exit from for loop\\n\\n dict[item] = True\\n\\n continue\\n\\n else:\\n\\n pass\\n\\n elif(attrs.has_key(\\\"inline\\\") and attrs[\\\"inline\\\"].value == \\\"yes\\\"):\\n\\n returnValue = \\\"\\\"\\n\\n params = \\\"\\\"\\n\\n try:\\n\\n definition = member.getElementsByTagName('definition')[0].firstChild.nodeValue\\n\\n except:\\n\\n pass\\n\\n try:\\n\\n params = member.getElementsByTagName('argsstring')[0].firstChild.nodeValue\\n\\n except:\\n\\n pass \\n\\n\\n\\n if(definition != None and params != None and item in definition or item in params):\\n\\n dict[item] = True\\n\\n continue\\n\\n else:\\n\\n pass\\n\\n # search all the member which are not pointers\\n\\n # search inline functions in which there is the class\\n\\n \\n\\n for i in dict.keys():\\n\\n if(dict[i] == False):\\n\\n self.MarkedList.append(\\\"<item>\\\\n\\\"\\\\\\n\\n + \\\" <class>\\\" + str(className) + \\\"</class>\\\\n\\\"\\\\\\n\\n + \\\" <include>\\\" + i + \\\".h</include>\\\\n\\\"\\\\\\n\\n + \\\"</item>\\\")\\n\",\n \"file_path\": \"qa/Rules/ClassStructureRules/UselessIncludesRule.py\",\n \"rank\": 17,\n \"score\": 64416.57700221175\n },\n {\n \"content\": \"class ALBA_EXPORT albaResultQueryAbstractHandler : public albaObject\\n\\n{\\n\\npublic:\\n\\n /** constructor */\\n\\n albaResultQueryAbstractHandler();\\n\\n /** destructor */\\n\\n\\tvirtual ~albaResultQueryAbstractHandler(); \\n\\n \\n\\n /** RTTI macro */\\n\\n albaAbstractTypeMacro(albaResultQueryAbstractHandler, albaObject);\\n\\n\\n\\n /**Get result as string matrix */\\n\\n WebRowSetStringDataTable GetResultAsStringMatrix() {return m_MatrixStringResult;};\\n\\n \\n\\n /** Get column type as list of string */\\n\\n WebRowSetColumnTypeVector GetColumnsTypeInformationAsStringVector() {return m_ColumnsTypeInformation;};\\n\\n\\n\\n /** Get column name as list of string */\\n\\n WebRowSetColumnNameVector GetColumnsNameInformationAsStringVector() {return m_ColumnsNameInformation;};\\n\\n\\n\",\n \"file_path\": \"Common/albaResultQueryAbstractHandler.h\",\n \"rank\": 18,\n \"score\": 64411.13067912922\n },\n {\n \"content\": \"class albaOpExporterAnsysInputFileTest;\\n\\n\\n\",\n \"file_path\": \"Testing/Operations/albaOpExporterAnsysInputFileTest.h\",\n \"rank\": 19,\n \"score\": 64403.16331999959\n },\n {\n \"content\": \"class albaOpImporterAnsysInputFileTest;\\n\\n\\n\",\n \"file_path\": \"Testing/Operations/albaOpImporterAnsysInputFileTest.h\",\n \"rank\": 20,\n \"score\": 64403.16331999959\n },\n {\n \"content\": \"class ALBA_EXPORT albaOpCreateLabeledVolume: public albaOp\\n\\n{\\n\\npublic:\\n\\n /** constructor */\\n\\n albaOpCreateLabeledVolume(const wxString &label = \\\"Create Labeled Volume\\\");\\n\\n /** destructor */\\n\\n ~albaOpCreateLabeledVolume(); \\n\\n\\n\\n /** RTTI macro */\\n\\n albaTypeMacro(albaOpCreateLabeledVolume, albaOp);\\n\\n\\n\\n /** Return a copy of itself, this needs to put the operation into the undo stack. */\\n\\n /*virtual*/ albaOp* Copy();\\n\\n\\n\\n /** Return true for the acceptable vme type. */\\n\\n /*virtual*/ bool Accept(albaVME*node);\\n\\n\\n\\n /** Builds operation's interface. */\\n\\n /*virtual*/ void OpRun();\\n\\n \\n\\n /** Execute the operation. */\\n\\n /*virtual*/ void OpDo();\\n\\n\\n\\nprotected: \\n\\n albaVMELabeledVolume *m_LabeledVolume;\\n\\n};\\n\\n#endif\\n\",\n \"file_path\": \"Operations/albaOpCreateLabeledVolume.h\",\n \"rank\": 21,\n \"score\": 64365.135606469994\n },\n {\n \"content\": \" \\n\\nprotected:\\n\\n albaVMEOutputNULL(); // to be allocated with New()\\n\\n virtual ~albaVMEOutputNULL(); // to be deleted with Delete()\\n\\n\\n\\nprivate:\\n\\n albaVMEOutputNULL(const albaVMEOutputNULL&); // Not implemented\\n\\n void operator=(const albaVMEOutputNULL&); // Not implemented\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Core/albaVMEOutputNULL.h\",\n \"rank\": 22,\n \"score\": 63851.60346039491\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ALBA (Agile Library for Biomedical Applications)\\n\\n Module: albaVMEOutputNULL\\n\\n Authors: Marco Petrone\\n\\n \\n\\n Copyright (c) BIC\\n\\n All rights reserved. See Copyright.txt or\\n\\n\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n#ifndef __albaVMEOutputNULL_h\\n\\n#define __albaVMEOutputNULL_h\\n\\n//----------------------------------------------------------------------------\\n\\n// includes :\\n\\n//----------------------------------------------------------------------------\\n\\n#include \\\"albaVMEOutput.h\\\"\\n\\n//----------------------------------------------------------------------------\\n\\n// forward declarations :\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Core/albaVMEOutputNULL.h\",\n \"rank\": 23,\n \"score\": 63851.17127420086\n },\n {\n \"content\": \" void CreateOpDialog();\\n\\n\\n\\n /** Remove operation's interface. */\\n\\n void DeleteOpDialog();\\n\\n\\n\\n /** Enable/disable VME widgets.*/\\n\\n void EnableWidgets(bool enable = true);\\n\\n\\n\\n /** Create the pipeline to generate the slice of the volume. */\\n\\n void CreateSlicePipeline();\\n\\n\\n\\n /** Re-slice the volume according to the new coordinate value. */\\n\\n void UpdateSlice(); \\n\\n\\n\\n /** This method returns the min value from the label used as input. */\\n\\n int GetMin( wxString &item );\\n\\n\\n\\n /** This method returns the max value from the label used as input. */\\n\\n int GetMax( wxString &item );\\n\\n};\\n\\n#endif\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 24,\n \"score\": 63814.80947917252\n },\n {\n \"content\": \"\\t\\tGIZMO_SCALE,\\n\\n\\t};\\n\\n\\n\\n\\tvoid SetLutEditor(vtkLookupTable *lut);\\n\\n\\tvoid SetLabelValue(double val){m_LabelValue=val;};\\n\\n\\tvoid SetPlaneDimension(double w,double h);\\n\\n\\tvoid Labelize();\\n\\n\\n\\n\\tvirtual void OpStop(int result);\\n\\nprotected: \\n\\n\\n\\n\\t/** Create the GUI */\\n\\n\\tvoid CreateGui();\\n\\n\\n\\n\\tvoid ShowClipPlane(bool show);\\n\\n\\tvoid CreateGizmos();\\n\\n\\tvoid AttachInteraction();\\n\\n\\tvoid UpdateISARefSys();\\n\\n\\tvoid Undo();\\n\\n\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.h\",\n \"rank\": 25,\n \"score\": 63813.765991253546\n },\n {\n \"content\": \"\\n\\n /** Modify the vector of label. */\\n\\n void ModifyLabelVector(int n, wxString name, bool checked);\\n\\n\\n\\n /** Remove an item of the vector of label. */\\n\\n void RemoveItemLabelVector(int n);\\n\\n\\n\\n /** Precess events coming from other objects */ \\n\\n virtual void OnEvent(albaEventBase *alba_event);\\n\\n\\n\\n /** Copy the contents of another VMELabeled into this one. */\\n\\n int DeepCopy(albaVME *a);\\n\\n\\n\\n /** Compare with another VMELabeled. */\\n\\n bool Equals(albaVME *vme);\\n\\n\\n\\n /**\\n\\n Set the Pose matrix of the VME. This function modifies the MatrixVector. You can\\n\\n set or get the Pose for a specified time. When setting, if the time does not exist\\n\\n the MatrixVector creates a new KeyMatrix on the fly. When getting, the matrix vector\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 26,\n \"score\": 63809.29350602715\n },\n {\n \"content\": \" interpolates on the fly according to the matrix interpolator.*/\\n\\n virtual void SetMatrix(const albaMatrix &mat);\\n\\n\\n\\n /**\\n\\n Return the list of timestamps for this VME. Timestamps list is \\n\\n obtained merging timestamps for matrixes and VME items*/\\n\\n virtual void GetLocalTimeStamps(std::vector<albaTimeStamp> &kframes);\\n\\n\\n\\n /** Update the VME with the scalar values of the labels. */\\n\\n virtual void GenerateLabeledVolume();\\n\\n\\n\\n /** Set the Link */\\n\\n void SetVolumeLink(albaVME *n);\\n\\n\\n\\n /** Return the Link */\\n\\n albaVME *GetVolumeLink();\\n\\n\\n\\n /** return material attribute of this surface if present */\\n\\n mmaVolumeMaterial *GetMaterial();\\n\\n\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 27,\n \"score\": 63807.70732745834\n },\n {\n \"content\": \"\\talbaInteractorGenericMouse\\t\\t *m_IsaLabelizeWithoutGizmo;\\n\\n\\n\\n\\tint\\t\\tm_LabelInside;\\n\\n\\n\\n\\tbool\\tm_PlaneCreated;\\n\\n\\n\\n\\tdouble m_PlaneWidth;\\n\\n\\tdouble m_PlaneHeight;\\n\\n\\tdouble m_LabelValue;\\n\\n\\n\\n\\tint\\t\\tm_GizmoType;\\n\\n\\tint m_UseGizmo;\\n\\n\\n\\n\\talbaVMESurface\\t\\t\\t\\t*m_InputSurface;\\n\\n\\talbaVMESurfaceEditor *m_VmeEditor;\\n\\n\\n\\n\\talbaVMEGizmo\\t\\t\\t\\t*m_ImplicitPlaneGizmo;\\n\\n\\tvtkPlane\\t\\t\\t\\t\\t*m_ClipperPlane;\\n\\n\\tvtkPlaneSource\\t\\t*m_PlaneSource;\\n\\n\\tvtkArrowSource\\t\\t*m_ArrowShape;\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.h\",\n \"rank\": 28,\n \"score\": 63807.11191271987\n },\n {\n \"content\": \"\\n\\n // Set the label value\\n\\n void SetLabel(double labelValue);\\n\\n\\n\\n //Set if smooth mode is true\\n\\n void SmoothMode(bool smoothMode);\\n\\n\\n\\n // Create a VMESurface draw from a Volume\\n\\n\\tvoid ExtractLabel();\\n\\n\\n\\nprotected: \\n\\n\\n\\n /** Get the dataset from linked node. */\\n\\n void UpdateDataLabel();\\n\\n\\n\\n /** Generate the volume depending on the labels selected. */\\n\\n void GenerateLabeledVolume();\\n\\n\\n\\n std::vector<wxString> m_LabelNameVector;\\n\\n std::vector<bool> m_CheckedVector;\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.h\",\n \"rank\": 29,\n \"score\": 63804.5830173279\n },\n {\n \"content\": \" \\n\\n wxSlider *m_MinSlider;\\n\\n wxSlider *m_MaxSlider;\\n\\n\\n\\n wxTextCtrl *m_LabelNameCtrl;\\n\\n wxTextCtrl *m_LabelValueCtrl; \\n\\n\\n\\n int m_MinAbsolute, m_MaxAbsolute;\\t\\n\\n int m_Min , m_Max;\\n\\n int m_MinMin, m_MaxMin;\\n\\n int m_MinMax, m_MaxMax;\\t\\n\\n int m_MinValue ,m_MaxValue;\\n\\n\\n\\n int m_CheckListId;\\n\\n int m_ItemSelected;\\n\\n int m_LabelIntValue;\\n\\n\\n\\n bool m_CheckMax, m_CheckMin;\\n\\n bool m_EditMode;\\n\\n bool m_DataCopied;\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 30,\n \"score\": 63803.622465402594\n },\n {\n \"content\": \"\\n\\n /** This method updates the look-up table. */\\n\\n void UpdateLookUpTable();\\n\\n\\n\\n /** If labels tags are present retrieve them. */\\n\\n void RetrieveTag();\\n\\n\\n\\n void CopyDataset();\\n\\n\\n\\n /** Updates the tags and the items of the checkBox and call the InternalPreUpadate. */\\n\\n void UpdateLabel();\\n\\n\\n\\n /** update the output data structure */\\n\\n void InternalPreUpdate();\\n\\n\\n\\n\\n\\n /** Copy the scalars of the VME linked. */\\n\\n void UpdateScalars();\\n\\n \\n\\n /** Builds operation's interface and visualization pipeline. */\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 31,\n \"score\": 63802.866832275344\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ALBA (Agile Library for Biomedical Applications)\\n\\n Module: albaVMELabeledVolume\\n\\n Authors: Roberto Mucci\\n\\n \\n\\n Copyright (c) BIC\\n\\n All rights reserved. See Copyright.txt or\\n\\n\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n \\n\\n#ifndef __albaVMELabeledVolume_h\\n\\n#define __albaVMELabeledVolume_h\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// Include:\\n\\n//----------------------------------------------------------------------------\\n\\n#include \\\"albaDefines.h\\\"\\n\\n#include \\\"albaVME.h\\\"\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// forward references :\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 32,\n \"score\": 63802.55335218411\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ALBA (Agile Library for Biomedical Applications)\\n\\n Module: albaOpLabelizeSurface\\n\\n Authors: Matteo Giacomoni\\n\\n \\n\\n Copyright (c) BIC\\n\\n All rights reserved. See Copyright.txt or\\n\\n\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef __albaOpLabelizeSurface_H__\\n\\n#define __albaOpLabelizeSurface_H__\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// Include :\\n\\n//----------------------------------------------------------------------------\\n\\n#include \\\"albaDefines.h\\\"\\n\\n#include \\\"albaOp.h\\\"\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// forward references :\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.h\",\n \"rank\": 33,\n \"score\": 63802.45875807205\n },\n {\n \"content\": \"\\n\\n\\tdouble m_ValLabel;\\n\\n int m_SmoothVolume;\\n\\n float m_RadiusFactor;\\n\\n float m_StdDev[3];\\n\\n float m_RadiusFactorAfter;\\n\\n float m_StdDevAfter[3];\\n\\n int m_SamplingRate[3];\\n\\n\\twxString m_SurfaceName;\\n\\n\\n\\n vtkImageData *m_OutputData;\\n\\n vtkDataSet *m_Ds;\\n\\n\\talbaVMESurface *m_Vme;\\n\\n albaGUICheckListBox *m_LabelCheckBox;\\n\\n albaTagItem *m_TagLabel;\\n\\n\\n\\n};\\n\\n#endif\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.h\",\n \"rank\": 34,\n \"score\": 63801.88439673765\n },\n {\n \"content\": \" ID_DECREASE_SLICE,\\n\\n ID_OK,\\n\\n ID_CANCEL,\\n\\n ID_D_LABEL_NAME,\\n\\n ID_D_LABEL_VALUE,\\n\\n ID_D_MIN,\\n\\n ID_D_MAX,\\n\\n ID_SLIDER_MIN,\\n\\n ID_SLIDER_MAX,\\n\\n ID_LAST,\\n\\n };\\n\\n\\n\\n albaVMELabeledVolume();\\n\\n virtual ~albaVMELabeledVolume(); \\n\\n\\n\\n virtual int InternalStore(albaStorageElement *parent);\\n\\n virtual int InternalRestore(albaStorageElement *node);\\n\\n\\n\\n /** Internally used to create a new instance of the GUI.*/\\n\\n virtual albaGUI *CreateGui();\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 35,\n \"score\": 63801.71145661508\n },\n {\n \"content\": \" /** return icon */\\n\\n static char** GetIcon();\\n\\n\\n\\n /** Return the suggested pipe-typename for the visualization of this vme */\\n\\n virtual albaString GetVisualPipe() {return albaString(\\\"albaPipeBox\\\");};\\n\\n\\n\\nprotected:\\n\\n //----------------------------------------------------------------------------\\n\\n // widget ID's\\n\\n //----------------------------------------------------------------------------\\n\\n enum VME_LABELED_VOLUME_DIALOG_ID\\n\\n {\\n\\n ID_INSERT_LABEL = Superclass::ID_LAST,\\n\\n ID_REMOVE_LABEL,\\n\\n ID_EDIT_LABEL,\\n\\n ID_LABELS,\\n\\n ID_FIT,\\t\\n\\n ID_SLICE,\\n\\n ID_SLICE_SLIDER,\\n\\n ID_INCREASE_SLICE,\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 36,\n \"score\": 63801.128037028735\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ALBA (Agile Library for Biomedical Applications)\\n\\n Module: albaOpLabelExtractor\\n\\n Authors: Paolo Quadrani - porting Roberto Mucci\\n\\n \\n\\n Copyright (c) BIC\\n\\n All rights reserved. See Copyright.txt or\\n\\n\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef __albaOpLabelExtractor_H__\\n\\n#define __albaOpLabelExtractor_H__\\n\\n\\n\\n\\n\\n#include \\\"albaOp.h\\\"\\n\\n\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// forward references :\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.h\",\n \"rank\": 37,\n \"score\": 63799.99674562427\n },\n {\n \"content\": \"\\t/** Change type of gizmo in the view */\\n\\n\\tvoid ChangeGizmo();\\n\\n\\n\\n\\tvoid OnEventGizmoPlane(albaEventBase *alba_event);\\n\\n\\tvoid OnEventThis(albaEventBase *alba_event);\\n\\n\\tvoid OnEventGizmoTranslate(albaEventBase *alba_event);\\n\\n\\tvoid OnEventGizmoRotate(albaEventBase *alba_event);\\n\\n\\tvoid OnEventGizmoScale(albaEventBase *alba_event);\\n\\n\\n\\n\\tvoid PostMultiplyEventMatrix(albaEventBase *alba_event);\\n\\n\\n\\n\\tvoid SetPlaneDimension();\\n\\n\\n\\n\\talbaInteractorCompositorMouse *m_IsaCompositorWithoutGizmo;\\n\\n\\talbaInteractorCompositorMouse *m_IsaCompositorWithGizmo;\\n\\n\\talbaInteractorGenericMouse *m_IsaTranslate;\\n\\n\\talbaInteractorGenericMouse *m_IsaRotate;\\n\\n\\talbaInteractorGenericMouse\\t\\t *m_IsaChangeArrowWithGizmo;\\n\\n\\talbaInteractorGenericMouse\\t\\t *m_IsaChangeArrowWithoutGizmo;\\t\\n\\n\\talbaInteractorGenericMouse\\t\\t *m_IsaLabelizeWithGizmo;\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.h\",\n \"rank\": 38,\n \"score\": 63799.18036657321\n },\n {\n \"content\": \" double m_SliceStep;\\n\\n double m_Bounds[6];\\n\\n\\n\\n double m_BBox[6];\\n\\n double m_Origin[3];\\n\\n double m_XVect[3];\\n\\n double m_YVect[3];\\n\\n \\n\\n wxString m_ItemLabel;\\n\\n\\n\\n vtkWindowLevelLookupTable * m_LookUpTable;\\n\\n vtkWindowLevelLookupTable * m_LookUpTableColor;\\n\\n vtkImageData * m_SP;\\n\\n vtkRectilinearGrid * m_RG;\\n\\n vtkProbeFilter * m_ProbeFilter;\\n\\n vtkTexture * m_Texture; \\n\\n vtkPolyDataMapper * m_SMapper;\\n\\n vtkActor * m_ActorSlice; \\n\\n vtkDataSet *m_Dataset;\\n\\n vtkPolyData *m_Polydata;\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 39,\n \"score\": 63796.83230712884\n },\n {\n \"content\": \" \\n\\n\\n\\n std::vector<wxString> m_LabelNameVector;\\n\\n std::vector<bool> m_CheckedVector;\\n\\n\\n\\n\\n\\n albaGUICheckListBox *m_LabelCheckBox; \\n\\n albaGUIDialogPreview *m_Dlg; \\n\\n albaGUIFloatSlider *m_SliceSlider;\\n\\n albaRWI *m_Rwi;\\n\\n albaTagItem *m_TagLabel;\\n\\n albaVME *m_VolumeLink;\\n\\n albaTransform *m_Transform;\\n\\n\\n\\n wxString m_LabelNameValue; \\t\\n\\n wxString m_LabelValueValue;\\n\\n\\n\\n double m_Slice;\\n\\n double m_SliceMin;\\n\\n double m_SliceMax;\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.h\",\n \"rank\": 40,\n \"score\": 63795.80247835586\n },\n {\n \"content\": \"\\tvtkAppendPolyData\\t*m_Gizmo;\\n\\n\\tvtkGlyph3D\\t\\t\\t\\t*m_Arrow;\\n\\n\\n\\n\\tvtkALBAClipSurfaceBoundingBox\\t*m_ClipperBoundingBox;\\n\\n\\n\\n\\tstd::vector<vtkPolyData*> m_ResultPolyData;\\n\\n\\tvtkPolyData\\t*m_OriginalPolydata;\\n\\n\\n\\n\\talbaGizmoTranslate\\t\\t*m_GizmoTranslate;\\n\\n\\talbaGizmoRotate\\t\\t\\t*m_GizmoRotate;\\n\\n\\talbaGizmoScale\\t\\t\\t\\t*m_GizmoScale;\\n\\n};\\n\\n#endif\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.h\",\n \"rank\": 41,\n \"score\": 63792.86722859748\n },\n {\n \"content\": \"class albaResultQueryAbstractHandlerTest : public albaTest\\n\\n{\\n\\npublic:\\n\\n\\n\\n /** Start test suite macro */\\n\\n\\tCPPUNIT_TEST_SUITE( albaResultQueryAbstractHandlerTest );\\n\\n /** macro for test TestDynamicAllocation */\\n\\n\\tCPPUNIT_TEST( TestDynamicAllocation );\\n\\n /** macro for test TestStaticAllocation */\\n\\n\\tCPPUNIT_TEST( TestStaticAllocation );\\n\\n\\n\\n /** macro for test TestStaticAllocation */\\n\\n CPPUNIT_TEST( TestGetResultAsStringMatrix );\\n\\n\\n\\n /** macro for test TestStaticAllocation */\\n\\n CPPUNIT_TEST( TestGetColumnsTypeInformationAsStringVector );\\n\\n\\n\\n /** macro for test TestStaticAllocation */\\n\\n CPPUNIT_TEST( TestGetColumnsNameInformationAsStringVector );\\n\\n\\n\",\n \"file_path\": \"Testing/Common/albaResultQueryAbstractHandlerTest.h\",\n \"rank\": 42,\n \"score\": 63345.80111687767\n },\n {\n \"content\": \"class albaOpCreateLabeledVolumeTest : public albaTest\\n\\n{\\n\\n CPPUNIT_TEST_SUITE( albaOpCreateLabeledVolumeTest );\\n\\n CPPUNIT_TEST( TestDynamicAllocation );\\n\\n CPPUNIT_TEST( TestCopy );\\n\\n CPPUNIT_TEST( TestAccept );\\n\\n CPPUNIT_TEST( TestOpRun );\\n\\n CPPUNIT_TEST( TestOpDo );\\n\\n CPPUNIT_TEST_SUITE_END();\\n\\n\\n\\nprotected:\\n\\n void TestDynamicAllocation();\\n\\n void TestCopy();\\n\\n void TestAccept();\\n\\n void TestOpRun();\\n\\n void TestOpDo();\\n\\n};\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"Testing/Operations/albaOpCreateLabeledVolumeTest.h\",\n \"rank\": 43,\n \"score\": 63300.56678091263\n },\n {\n \"content\": \"// This force to include Window,wxWidgets and VTK exactly in this order.\\n\\n// Failing in doing this will result in a run-time error saying:\\n\\n// \\\"Failure#0: The value of ESP was not properly saved across a function call\\\"\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n\\n\\n\\n\\n#include \\\"albaVMEOutputNULL.h\\\"\\n\\n#include \\\"albaAbsMatrixPipe.h\\\"\\n\\n#include \\\"albaDataPipe.h\\\"\\n\\n#include \\\"albaSmartPointer.h\\\"\\n\\n#include \\\"albaTransform.h\\\"\\n\\n#include \\\"albaIndent.h\\\"\\n\\n\\n\\n#include <assert.h>\\n\\n\\n\\n//-------------------------------------------------------------------------\\n\\nalbaCxxTypeMacro(albaVMEOutputNULL)\\n\\n//-------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"Core/albaVMEOutputNULL.cpp\",\n \"rank\": 44,\n \"score\": 61798.04093196581\n },\n {\n \"content\": \" /** Get result as string matrix */\\n\\n WebRowSetQueryObjectsTable GetResultAsObjectsMatrix() {return m_MatrixObjectResult;};\\n\\n\\n\\n\\n\\n /** Get number of records (rows) */\\n\\n int GetNumberOfRecords() const;\\n\\n\\n\\n /** Get number of fields (columns) */\\n\\n int GetNumberOfFields() const;\\n\\n\\n\\n /** load result of Query */\\n\\n virtual void LoadQueryResult() = 0;\\n\\n\\n\\n /** load result of Query */\\n\\n virtual bool IsFailed() = 0;\\n\\n\\n\\nprotected:\\n\\n /** clear all the results */\\n\\n virtual void InternalResultReset();\\n\\n\\n\",\n \"file_path\": \"Common/albaResultQueryAbstractHandler.h\",\n \"rank\": 45,\n \"score\": 61796.0015787554\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ALBA (Agile Library for Biomedical Applications)\\n\\n Module: albaVMEOutputNULL\\n\\n Authors: Marco Petrone\\n\\n \\n\\n Copyright (c) BIC\\n\\n All rights reserved. See Copyright.txt or\\n\\n\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n\\n\\n#include \\\"albaDefines.h\\\" \\n\\n//----------------------------------------------------------------------------\\n\\n// NOTE: Every CPP file in the ALBA must include \\\"albaDefines.h\\\" as first.\\n\",\n \"file_path\": \"Core/albaVMEOutputNULL.cpp\",\n \"rank\": 46,\n \"score\": 61789.66078310828\n },\n {\n \"content\": \"//-------------------------------------------------------------------------\\n\\nalbaVMEOutputNULL::albaVMEOutputNULL()\\n\\n//-------------------------------------------------------------------------\\n\\n{\\n\\n}\\n\\n\\n\\n//-------------------------------------------------------------------------\\n\\nalbaVMEOutputNULL::~albaVMEOutputNULL()\\n\\n//-------------------------------------------------------------------------\\n\\n{\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Core/albaVMEOutputNULL.cpp\",\n \"rank\": 47,\n \"score\": 61786.57853842674\n },\n {\n \"content\": \"REM ----------------------------------------------------------------------------\\n\\nREM TestComplete Result Copy\\n\\nREM ----------------------------------------------------------------------------\\n\\n\\n\\necho.\\n\\n\\n\\ncd ..\\n\\n\\n\\nset CheckNameResultsDirectory=GuiTestResult\\n\\n\\n\\n\\n\\nREM delete the directory storing previous results\\n\\nrmdir /s /q %CheckNameResultsDirectory%\\n\\n\\n\\nREM create the directory again the directories for storing XML and HTML file name checking results\\n\\nmkdir %CheckNameResultsDirectory%\\n\\n\\n\\necho creating file name check results... \\n\\ncd %CheckNameResultsDirectory%\\n\\nxcopy ..\\\\..\\\\..\\\\..\\\\..\\\\..\\\\..\\\\..\\\\..\\\\..\\\\Results\\\\Resultlog \\n\\n\\n\\n\\n\\n\\n\\n\\n\\necho.\\n\",\n \"file_path\": \"ParabuildScripts/guiTestResults.bat\",\n \"rank\": 48,\n \"score\": 61783.065356000974\n },\n {\n \"content\": \"REM BEWARE! These directory names are referenced in MemoryProfile.vbs script so the not change them\\n\\nset ProfilingResultsDirectory=.\\\\build\\\\bin\\\\Debug\\\\Coverage\\\\\\n\\nset XMLResultsDirectory=%ProfilingResultsDirectory%\\\\XML\\\\\\n\\nset HTMLResultsDirectory=%ProfilingResultsDirectory%\\\\HTML\\\\\\n\\n\\n\\nREM delete the directory storing previous results\\n\\nrmdir /s /q %ProfilingResultsDirectory%\\n\\n\\n\\nREM create the directory again the directories for storing XML and HTML memory profiling results\\n\\nmkdir %XMLResultsDirectory%\\n\\nmkdir %HTMLResultsDirectory%\",\n \"file_path\": \"JenkinsScripts/RemoveCoverageResults.bat\",\n \"rank\": 49,\n \"score\": 61783.034081101105\n },\n {\n \"content\": \"REM BEWARE! These directory names are referenced in MemoryProfile.vbs script so the not change them\\n\\nset ProfilingResultsDirectory=.\\\\build\\\\bin\\\\Debug\\\\MemoryAllocation\\\\\\n\\nset XMLResultsDirectory=%ProfilingResultsDirectory%\\\\XML\\\\\\n\\nset HTMLResultsDirectory=%ProfilingResultsDirectory%\\\\HTML\\\\\\n\\n\\n\\nREM delete the directory storing previous results\\n\\nrmdir /s /q %ProfilingResultsDirectory%\\n\\n\\n\\nREM create the directory again the directories for storing XML and HTML memory profiling results\\n\\nmkdir %XMLResultsDirectory%\\n\\nmkdir %HTMLResultsDirectory%\",\n \"file_path\": \"JenkinsScripts/RemoveProfilingResults.bat\",\n \"rank\": 50,\n \"score\": 61783.02370391632\n },\n {\n \"content\": \"// Include:\\n\\n//----------------------------------------------------------------------------\\n\\n#include \\\"albaDefines.h\\\"\\n\\n#include \\\"albaObject.h\\\"\\n\\n#include \\\"albaQueryObject.h\\\"\\n\\n#include <vector>\\n\\n//----------------------------------------------------------------------------\\n\\n// forward references :\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n// typedefs :\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\ntypedef std::vector<std::vector<std::string> > WebRowSetStringDataTable;\\n\\ntypedef std::vector<std::string> WebRowSetColumnTypeVector;\\n\\ntypedef std::vector<std::string> WebRowSetColumnNameVector;\\n\\n\\n\\ntypedef std::vector<std::vector<albaQueryObject *> > WebRowSetQueryObjectsTable;\\n\\n/**\\n\",\n \"file_path\": \"Common/albaResultQueryAbstractHandler.h\",\n \"rank\": 51,\n \"score\": 61782.11903618858\n },\n {\n \"content\": \" WebRowSetStringDataTable m_MatrixStringResult;\\n\\n WebRowSetColumnTypeVector m_ColumnsTypeInformation;\\n\\n WebRowSetColumnNameVector m_ColumnsNameInformation;\\n\\n\\n\\n WebRowSetQueryObjectsTable m_MatrixObjectResult;\\n\\n\\n\\nprivate:\\n\\n \\n\\n\\n\\n\\n\\n};\\n\\n#endif //__albaResultQueryAbstractHandler_H__\\n\",\n \"file_path\": \"Common/albaResultQueryAbstractHandler.h\",\n \"rank\": 52,\n \"score\": 61781.835015140896\n },\n {\n \"content\": \"/*=========================================================================\\n\\n\\n\\n Program: ALBA (Agile Library for Biomedical Applications)\\n\\n Module: albaResultQueryAbstractHandler\\n\\n Authors: Daniele Giunchi\\n\\n \\n\\n Copyright (c) BIC\\n\\n All rights reserved. See Copyright.txt or\\n\\n\\n\\n\\n\\n This software is distributed WITHOUT ANY WARRANTY; without even\\n\\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\\n\\n PURPOSE. See the above copyright notice for more information.\\n\\n\\n\\n=========================================================================*/\\n\\n\\n\\n#ifndef __albaResultQueryAbstractHandler_H__\\n\\n#define __albaResultQueryAbstractHandler_H__\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Common/albaResultQueryAbstractHandler.h\",\n \"rank\": 53,\n \"score\": 61781.582713619326\n },\n {\n \"content\": \"{\\n\\n\\treturn new albaOpLabelizeSurface(m_Label);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nbool albaOpLabelizeSurface::Accept(albaVME*node)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\treturn (node != NULL && node->IsALBAType(albaVMESurface));\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::OpRun() \\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tGetLogicManager()->VmeShow(m_Input, false);\\n\\n\\n\\n\\talbaNEW(m_VmeEditor);\\n\\n\\tvtkALBASmartPointer<vtkPolyData> inputOriginalPolydata;\\n\\n\\tinputOriginalPolydata->DeepCopy(vtkPolyData::SafeDownCast(albaVMESurface::SafeDownCast(m_Input)->GetOutput()->GetVTKData()));\\n\\n\\tint prova=inputOriginalPolydata->GetNumberOfPoints();\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 54,\n \"score\": 61758.13269281897\n },\n {\n \"content\": \" for(int i=0; i<6; i++) \\n\\n m_BBox[i] = 0;\\n\\n}\\n\\n//------------------------------------------------------------------------------\\n\\nalbaVMELabeledVolume::~albaVMELabeledVolume()\\n\\n//------------------------------------------------------------------------------\\n\\n{\\n\\n albaDEL(m_Transform);\\n\\n if (m_DataCopied)\\n\\n albaDEL(m_Dataset);\\n\\n m_VolumeLink = NULL;\\n\\n m_CheckedVector.clear();\\n\\n m_LabelNameVector.clear();\\n\\n\\n\\n if ( m_Dlg )\\n\\n DeleteOpDialog();\\n\\n}\\n\\n\\n\\n//-------------------------------------------------------------------------\\n\\nint albaVMELabeledVolume::DeepCopy(albaVME *a)\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 55,\n \"score\": 61756.13411484059\n },\n {\n \"content\": \" m_OutputData->GetPointData()->SetScalars(labelScalars);\\n\\n m_OutputData->Modified();\\n\\n }\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelExtractor::ExtractLabel()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n albaVME *vme = NULL;\\n\\n \\n\\n if (m_Input->IsA(\\\"albaVMELabeledVolume\\\"))\\n\\n {\\n\\n UpdateDataLabel();\\n\\n }\\n\\n else\\n\\n {\\n\\n albaSmartPointer<albaVME> vmeLabeled = m_Input;\\n\\n m_Ds = vmeLabeled->GetOutput()->GetVTKData();\\n\\n m_Ds->Update();\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 56,\n \"score\": 61755.88531622964\n },\n {\n \"content\": \"void albaOpLabelizeSurface::OpStop(int result)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tGetLogicManager()->VmeShow(m_VmeEditor, false);\\n\\n\\tm_VmeEditor->ReparentTo(NULL);\\n\\n\\n\\n\\tif(m_ImplicitPlaneGizmo)\\n\\n\\t{\\n\\n\\t\\tm_ImplicitPlaneGizmo->SetBehavior(NULL);\\n\\n\\t\\tGetLogicManager()->VmeRemove(m_ImplicitPlaneGizmo);\\n\\n\\t}\\n\\n\\talbaDEL(m_ImplicitPlaneGizmo);\\n\\n\\n\\n\\tvtkDEL(m_Gizmo);\\n\\n\\tvtkDEL(m_ArrowShape);\\n\\n\\tvtkDEL(m_PlaneSource);\\n\\n\\tvtkDEL(m_ClipperBoundingBox);\\n\\n\\tvtkDEL(m_Arrow);\\n\\n\\tvtkDEL(m_ClipperPlane);\\n\\n\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 57,\n \"score\": 61754.77937152762\n },\n {\n \"content\": \"\\tm_Gui->Double(ID_LABEL_VALUE,_(\\\"Label\\\"),&m_LabelValue);\\n\\n\\tm_Gui->Lut(ID_LUT,\\\"lut\\\",m_VmeEditor->GetMaterial()->m_ColorLut);\\n\\n\\tdouble b[6];\\n\\n\\tm_Input->GetOutput()->GetVMEBounds(b);\\n\\n\\t// bounding box dim\\n\\n\\tm_PlaneWidth = b[1] - b[0];\\n\\n\\tm_PlaneHeight = b[3] - b[2];\\n\\n\\t//m_Gui->Double(ID_PLANE_WIDTH,_(\\\"plane w.\\\"),&m_PlaneWidth,0.0);\\n\\n\\t//m_Gui->Double(ID_PLANE_HEIGHT,_(\\\"plane h.\\\"),&m_PlaneHeight,0.0);\\n\\n\\tm_Gui->Divider();\\n\\n\\tm_Gui->Button(ID_UNDO,_(\\\"Undo\\\"));\\n\\n\\n\\n\\tm_Gui->Divider(1);\\n\\n\\tm_Gui->OkCancel();\\n\\n\\n\\n\\tm_Gui->Divider();\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::CreateGizmos()\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 58,\n \"score\": 61753.91032109263\n },\n {\n \"content\": \"\\t\\tm_VmeEditor->GetMaterial()->m_ColorLut->Build();\\n\\n\\n\\n\\t\\tvtkALBASmartPointer<vtkDoubleArray> cellScalar;\\n\\n\\t\\tcellScalar->SetName(\\\"CELL_LABEL\\\");\\n\\n\\t\\tcellScalar->SetNumberOfComponents(1);\\n\\n\\t\\tcellScalar->SetNumberOfTuples(inputPolydata->GetNumberOfCells());\\n\\n\\t\\tfor(int i=0;i<inputPolydata->GetNumberOfCells();i++)\\n\\n\\t\\t{\\n\\n\\t\\t\\tcellScalar->InsertTuple1(i,0.0);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tinputPolydata->GetCellData()->SetScalars(cellScalar);\\n\\n\\t\\tinputPolydata->GetCellData()->Update();\\n\\n\\n\\n\\t\\tinputPolydata->Modified();\\n\\n\\t\\tinputPolydata->Update();\\n\\n\\t}\\n\\n\\telse\\n\\n\\t{\\n\\n\\t\\tinputPolydata->GetCellData()->SetActiveScalars(\\\"CELL_LABEL\\\");\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 59,\n \"score\": 61753.16627423765\n },\n {\n \"content\": \" m_LabelNameVector.push_back(name);\\n\\n m_CheckedVector.push_back(checked);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::ModifyLabelVector(int n, wxString name, bool checked)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (n < m_LabelNameVector.size() )\\n\\n {\\n\\n m_LabelNameVector[n] = name;\\n\\n m_CheckedVector[n] = checked;\\n\\n }\\n\\n else\\n\\n return;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::RemoveItemLabelVector(int n)\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 60,\n \"score\": 61752.38089854908\n },\n {\n \"content\": \"\\n\\n//----------------------------------------------------------------------------\\n\\nalbaCxxTypeMacro(albaOpLabelizeSurface);\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nalbaOpLabelizeSurface::albaOpLabelizeSurface(const wxString &label) :\\n\\nalbaOp(label)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tm_OpType\\t= OPTYPE_OP;\\n\\n\\tm_Canundo = true;\\n\\n\\tm_InputPreserving = false;\\n\\n\\n\\n\\tm_ImplicitPlaneGizmo = NULL;\\n\\n\\tm_ClipperPlane = NULL;\\n\\n\\tm_PlaneSource = NULL;\\n\\n\\tm_ArrowShape = NULL;\\n\\n\\tm_Arrow = NULL;\\n\\n\\tm_Gizmo = NULL;\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 61,\n \"score\": 61752.32806573719\n },\n {\n \"content\": \"#include \\\"vtkPointData.h\\\"\\n\\n#include \\\"vtkDataSet.h\\\"\\n\\n#include \\\"vtkRenderer.h\\\"\\n\\n#include \\\"vtkRenderWindow.h\\\"\\n\\n\\n\\n#include <list>\\n\\n#include <vector>\\n\\n\\n\\n#define OUTRANGE_SCALAR -1000\\n\\n\\n\\n//-------------------------------------------------------------------------\\n\\nalbaCxxTypeMacro(albaVMELabeledVolume);\\n\\n//-------------------------------------------------------------------------\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\nalbaVMELabeledVolume::albaVMELabeledVolume()\\n\\n//------------------------------------------------------------------------------\\n\\n{\\n\\n m_LabelCheckBox = NULL;\\n\\n m_EditMode = false;\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 62,\n \"score\": 61752.20562200514\n },\n {\n \"content\": \" break; //exit from loop for only\\n\\n }\\n\\n // Check if another value for the label already exists\\n\\n int currentLabelValue = GetLabelValue( currentLabelName );\\n\\n if ( currentLabelValue == m_LabelIntValue )\\n\\n {\\n\\n int answer = wxMessageBox( \\\"The value for this label already exists - Continue?\\\", \\\"Warning\\\", wxYES_NO | wxICON_ERROR, NULL);\\n\\n if (answer == wxNO)\\n\\n { \\n\\n m_LabelIntValue = 1;\\n\\n m_Dlg->TransferDataToWindow();\\n\\n return;\\n\\n }\\n\\n else\\n\\n break; //exit from loop for only\\n\\n }\\n\\n }\\n\\n }\\n\\n wxString labelLine; \\n\\n labelLine.Printf( \\\"%s %d %d %d\\\", labelName, m_LabelIntValue, m_Min, m_Max ); \\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 63,\n \"score\": 61751.66367524358\n },\n {\n \"content\": \"\\n\\n\\tm_ResultPolyData.clear();\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nalbaOpLabelizeSurface::~albaOpLabelizeSurface()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tfor(int i=0;i<m_ResultPolyData.size();i++)\\n\\n\\t{\\n\\n\\t\\tvtkDEL(m_ResultPolyData[i]);\\n\\n\\t}\\n\\n\\tm_ResultPolyData.clear();\\n\\n\\n\\n\\talbaDEL(m_VmeEditor);\\n\\n\\tvtkDEL(m_OriginalPolydata);\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nalbaOp* albaOpLabelizeSurface::Copy() \\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 64,\n \"score\": 61751.52578611239\n },\n {\n \"content\": \" m_LabelCheckBox->Update();\\n\\n\\n\\n int noc = m_TagLabel->GetNumberOfComponents();\\n\\n for ( unsigned int w = 0; w < noc; w++ )\\n\\n {\\n\\n wxString componentName = m_TagLabel->GetValue( w );\\n\\n if ( m_ItemLabel == componentName )\\n\\n {\\n\\n SetLabelTag(labelLine.c_str(), w );\\n\\n }\\n\\n }\\n\\n }\\n\\n GenerateLabeledVolume();\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::SetLabelTag(albaString label, int component )\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n m_TagLabel->SetValue(label, component);\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 65,\n \"score\": 61751.48595807047\n },\n {\n \"content\": \"\\tm_IsaCompositorWithGizmo = NULL;\\n\\n\\tm_IsaCompositorWithoutGizmo = NULL;\\n\\n\\tm_InputSurface = NULL;\\n\\n\\tm_OriginalPolydata = NULL;\\n\\n\\tm_ClipperBoundingBox = NULL;\\n\\n\\n\\n\\tm_LabelValue = 0.0;\\n\\n\\n\\n\\tm_LabelInside = 1;\\n\\n\\tm_UseGizmo\\t\\t= 1;\\n\\n\\tm_GizmoType\\t\\t= GIZMO_TRANSLATE;\\n\\n\\n\\n\\tm_PlaneWidth = 0.0;\\n\\n\\tm_PlaneHeight = 0.0;\\n\\n\\n\\n\\tm_VmeEditor = NULL;\\n\\n\\n\\n\\tm_GizmoTranslate=NULL;\\n\\n\\tm_GizmoRotate=NULL;\\n\\n\\tm_GizmoScale=NULL;\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 66,\n \"score\": 61751.35635691417\n },\n {\n \"content\": \"\\t\\tm_ImplicitPlaneGizmo->SetBehavior(m_IsaCompositorWithoutGizmo);\\n\\n\\telse\\n\\n\\t\\tm_ImplicitPlaneGizmo->SetBehavior(m_IsaCompositorWithGizmo);\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::ShowClipPlane(bool show)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tif(show)\\n\\n\\t{\\n\\n\\t\\tif(m_ClipperPlane == NULL)\\n\\n\\t\\t{\\n\\n\\t\\t\\tdouble b[6];\\n\\n\\t\\t\\tm_Input->GetOutput()->GetBounds(b);\\n\\n\\n\\n\\t\\t\\t// bounding box dim\\n\\n\\t\\t\\tdouble xdim = b[1] - b[0];\\n\\n\\t\\t\\tdouble ydim = b[3] - b[2];\\n\\n\\t\\t\\tdouble zdim = b[5] - b[4];\\n\\n\\t\\t\\t\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 67,\n \"score\": 61750.98716616801\n },\n {\n \"content\": \"\\n\\n // Check if another name for the label already exists\\n\\n if( m_TagLabel && m_EditMode == false)\\n\\n {\\n\\n int noc = m_TagLabel->GetNumberOfComponents();\\n\\n for ( unsigned int i = 0; i < noc; i++ )\\n\\n {\\n\\n wxString component = m_TagLabel->GetValue( i );\\n\\n\\n\\n // Check if another name for the label already exists\\n\\n wxString currentLabelName = component.BeforeFirst( ' ' ); \\n\\n if ( currentLabelName == labelName )\\n\\n { \\n\\n int answer = wxMessageBox( \\\"The name of this label already exists - Continue?\\\", \\\"Warning\\\", wxYES_NO | wxICON_ERROR, NULL);\\n\\n if (answer == wxNO)\\n\\n { \\n\\n m_LabelNameCtrl->SetValue( wxEmptyString ); \\n\\n return;\\n\\n }\\n\\n else\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 68,\n \"score\": 61750.32190186718\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelExtractor::GenerateLabeledVolume()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n vtkALBASmartPointer<vtkDataArray> originalScalars = m_OutputData->GetPointData()->GetScalars(); \\n\\n vtkALBASmartPointer<vtkDataArray> labelScalars = m_OutputData->GetPointData()->GetScalars();\\n\\n\\n\\n std::vector<int> minVector;\\n\\n std::vector<int> maxVector;\\n\\n std::vector<int> labelIntVector;\\n\\n\\n\\n int counter= 0;\\n\\n //Fill the vectors of range and label value\\n\\n for (int c = 0; c < m_CheckedVector.size(); c++)\\n\\n {\\n\\n if (m_CheckedVector.at(c))\\n\\n {\\n\\n wxString label = m_LabelNameVector.at(c);\\n\\n wxStringTokenizer tkz(label,wxT(' '),wxTOKEN_RET_EMPTY_ALL);\\n\\n albaString labelName = tkz.GetNextToken().c_str();\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 69,\n \"score\": 61750.245965323506\n },\n {\n \"content\": \"}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::RemoveLabelTag(int component)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n m_TagLabel->RemoveValue(component);\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\n void albaVMELabeledVolume::UpdateSlice()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n m_Origin[2] = m_Slice;\\n\\n m_SP->SetOrigin( m_Bounds[0], m_Bounds[2], m_Origin[2] );\\n\\n m_ProbeFilter->Update();\\n\\n\\n\\n this->m_Rwi->m_RenFront->ResetCameraClippingRange();\\n\\n m_Rwi->m_RwiBase->Render();\\n\\n m_Rwi->m_RenderWindow->SetDesiredUpdateRate(15.f); \\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 70,\n \"score\": 61749.66266507643\n },\n {\n \"content\": \"}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nint albaVMELabeledVolume::GetMax( wxString &item )\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n wxString tmp = item.AfterFirst( ' ' ); \\n\\n tmp = tmp.AfterFirst( ' ' ); \\n\\n tmp = tmp.AfterFirst( ' ' ); \\n\\n wxString max = tmp.BeforeFirst( ' ' );\\n\\n long M = 0; \\n\\n max.ToLong( &M ); \\n\\n\\n\\n return (int)M;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::UpdateLookUpTable()\\n\\n//----------------------------------------------------------------------------\\n\\n{ \\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 71,\n \"score\": 61749.32664037907\n },\n {\n \"content\": \" vtkDEL( m_ActorSlice ); \\n\\n cppDEL( m_Dlg ); \\n\\n}\\n\\n\\n\\n//-------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::SetVolumeLink(albaVME *n)\\n\\n//-------------------------------------------------------------------------\\n\\n{\\n\\n SetLink(\\\"VolumeLink\\\", n);\\n\\n CopyDataset();\\n\\n Modified();\\n\\n}\\n\\n\\n\\n//-------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::InternalPreUpdate()\\n\\n//-------------------------------------------------------------------------\\n\\n{\\n\\n m_VolumeLink = GetVolumeLink();\\n\\n EnableWidgets(m_VolumeLink != NULL);\\n\\n\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 72,\n \"score\": 61749.29346899379\n },\n {\n \"content\": \"//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::OpDo()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tif(m_VmeEditor)\\n\\n\\t{\\n\\n\\t\\talbaVMESurface::SafeDownCast(m_Input)->SetData(vtkPolyData::SafeDownCast(m_VmeEditor->GetOutput()->GetVTKData()),((albaVMESurface*)m_Input)->GetTimeStamp());\\n\\n\\t\\talbaSmartPointer<mmaMaterial> mat;\\n\\n\\t\\tmat->DeepCopy(m_VmeEditor->GetMaterial());\\n\\n\\t\\talbaVMESurface::SafeDownCast(m_Input)->GetSurfaceOutput()->SetMaterial(mat);\\n\\n\\t\\talbaVMESurface::SafeDownCast(m_Input)->GetSurfaceOutput()->Update();\\n\\n\\t\\talbaVMESurface::SafeDownCast(m_Input)->GetOutput()->Update();\\n\\n\\t\\tGetLogicManager()->VmeVisualModeChanged(m_Input);\\n\\n\\t\\tGetLogicManager()->CameraUpdate();\\n\\n\\t}\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::OpUndo()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 73,\n \"score\": 61748.94626191418\n },\n {\n \"content\": \" m_Gui->Enable(ID_EDIT_LABEL,enable);\\n\\n }\\n\\n else\\n\\n {\\n\\n int noc = m_TagLabel->GetNumberOfComponents();\\n\\n bool labelPresent = noc != 0;\\n\\n m_Gui->Enable(ID_INSERT_LABEL,enable);\\n\\n m_Gui->Enable(ID_REMOVE_LABEL,labelPresent);\\n\\n m_Gui->Enable(ID_EDIT_LABEL,labelPresent);\\n\\n }\\n\\n m_Gui->Update();\\n\\n }\\n\\n}\\n\\n//-------------------------------------------------------------------------\\n\\nchar** albaVMELabeledVolume::GetIcon() \\n\\n//-------------------------------------------------------------------------\\n\\n{\\n\\n#include \\\"albaVMEVolume.xpm\\\"\\n\\n return albaVMEVolume_xpm;\\n\\n}\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 74,\n \"score\": 61748.86486350934\n },\n {\n \"content\": \"// Failing in doing this will result in a run-time error saying:\\n\\n// \\\"Failure#0: The value of ESP was not properly saved across a function call\\\"\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n\\n\\n#include \\\"albaOpLabelExtractor.h\\\"\\n\\n\\n\\n#include <wx/tokenzr.h>\\n\\n\\n\\n#include \\\"albaDecl.h\\\"\\n\\n#include \\\"albaGUICheckListBox.h\\\"\\n\\n#include \\\"albaOp.h\\\"\\n\\n#include \\\"albaEvent.h\\\"\\n\\n#include \\\"albaGUI.h\\\"\\n\\n#include \\\"albaVME.h\\\"\\n\\n#include \\\"albaVMEVolumeGray.h\\\"\\n\\n#include \\\"albaVMESurface.h\\\"\\n\\n#include \\\"albaTagItem.h\\\"\\n\\n#include \\\"albaTagArray.h\\\"\\n\\n\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 75,\n \"score\": 61748.657265027454\n },\n {\n \"content\": \" if (m_VolumeLink == NULL)\\n\\n {\\n\\n return;\\n\\n }\\n\\n\\n\\n if (!m_DataCopied)\\n\\n {\\n\\n CopyDataset();\\n\\n }\\n\\n GenerateLabeledVolume(); \\n\\n}\\n\\n//-------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::CopyDataset()\\n\\n//-------------------------------------------------------------------------\\n\\n{\\n\\n m_VolumeLink = GetVolumeLink();\\n\\n if (m_VolumeLink)\\n\\n {\\n\\n vtkDataSet *data = m_VolumeLink->GetOutput()->GetVTKData();\\n\\n data->Update();\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 76,\n \"score\": 61748.28485244602\n },\n {\n \"content\": \"// Failing in doing this will result in a run-time error saying:\\n\\n// \\\"Failure#0: The value of ESP was not properly saved across a function call\\\"\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"albaVMELabeledVolume.h\\\"\\n\\n\\n\\n#include <wx/tokenzr.h>\\n\\n\\n\\n#include \\\"albaGUI.h\\\"\\n\\n#include \\\"albaGUIDialogPreview.h\\\"\\n\\n#include \\\"mmaMaterial.h\\\"\\n\\n#include \\\"mmaVolumeMaterial.h\\\"\\n\\n#include \\\"albaVME.h\\\"\\n\\n#include \\\"albaTransform.h\\\"\\n\\n#include \\\"albaGUIButton.h\\\"\\n\\n#include \\\"albaGUIValidator.h\\\"\\n\\n#include \\\"albaGUICheckListBox.h\\\"\\n\\n#include \\\"albaInteractorExtractIsosurface.h\\\"\\n\\n#include \\\"albaRWIBase.h\\\"\\n\\n#include \\\"albaRWI.h\\\"\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 77,\n \"score\": 61748.19634841352\n },\n {\n \"content\": \"}\\n\\n\\n\\n//-----------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::RetrieveTag()\\n\\n//----------------------------------------------------------------------\\n\\n{ \\n\\n bool tagPresent = this->GetTagArray()->IsTagPresent(\\\"LABELS\\\");\\n\\n if (!tagPresent)\\n\\n {\\n\\n albaTagItem tag_Item;\\n\\n tag_Item.SetName(\\\"LABELS\\\");\\n\\n this->GetTagArray()->SetTag(tag_Item);\\n\\n }\\n\\n m_TagLabel = new albaTagItem;\\n\\n m_TagLabel = this->GetTagArray()->GetTag( \\\"LABELS\\\" );\\n\\n}\\n\\n\\n\\n//-----------------------------------------------------------------------\\n\\nint albaVMELabeledVolume::InternalStore(albaStorageElement *parent)\\n\\n//-----------------------------------------------------------------------\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 78,\n \"score\": 61748.107942260496\n },\n {\n \"content\": \"// Failing in doing this will result in a run-time error saying:\\n\\n// \\\"Failure#0: The value of ESP was not properly saved across a function call\\\"\\n\\n//----------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"albaOpLabelizeSurface.h\\\"\\n\\n#include \\\"albaGUI.h\\\"\\n\\n#include \\\"mmaMaterial.h\\\"\\n\\n#include \\\"albaAbsMatrixPipe.h\\\"\\n\\n#include \\\"albaInteractorCompositorMouse.h\\\"\\n\\n#include \\\"albaInteractorGenericMouse.h\\\"\\n\\n#include \\\"albaGizmoTranslate.h\\\"\\n\\n#include \\\"albaGizmoRotate.h\\\"\\n\\n#include \\\"albaGizmoScale.h\\\"\\n\\n#include \\\"albaRefSys.h\\\"\\n\\n#include \\\"albaTransform.h\\\"\\n\\n\\n\\n#include \\\"albaMatrix.h\\\"\\n\\n#include \\\"albaVME.h\\\"\\n\\n#include \\\"albaVMESurface.h\\\"\\n\\n#include \\\"albaVMEGizmo.h\\\"\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 79,\n \"score\": 61748.009749219185\n },\n {\n \"content\": \"\\talbaVMESurface::SafeDownCast(m_Input)->SetData(m_OriginalPolydata,((albaVMESurface*)m_Input)->GetTimeStamp());\\n\\n\\tGetLogicManager()->CameraUpdate();\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::Labelize()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tvtkALBASmartPointer<vtkTransform> rotate;\\n\\n\\trotate->RotateX(180);\\n\\n\\n\\n\\tvtkALBASmartPointer<vtkTransformPolyDataFilter> before_transform_plane;\\n\\n\\tvtkALBASmartPointer<vtkTransformPolyDataFilter> transform_plane;\\n\\n\\tif(m_LabelInside==1)//if clip reverse is necessary rotate plane\\n\\n\\t{\\n\\n\\t\\tbefore_transform_plane->SetTransform(rotate);\\n\\n\\t\\tbefore_transform_plane->SetInput(m_PlaneSource->GetOutput());\\n\\n\\t\\tbefore_transform_plane->Update();\\n\\n\\n\\n\\t\\ttransform_plane->SetInput(before_transform_plane->GetOutput());\\n\\n\\t}\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 80,\n \"score\": 61747.95519808186\n },\n {\n \"content\": \" m_Texture = NULL;\\n\\n m_SMapper = NULL;\\n\\n m_ActorSlice = NULL; \\n\\n\\n\\n m_LabelNameValue = wxEmptyString;\\n\\n m_LabelValueValue = wxEmptyString;\\n\\n\\n\\n albaNEW(m_Transform);\\n\\n albaVMEOutputVolume *output = albaVMEOutputVolume::New(); // an output with no data\\n\\n output->SetTransform(m_Transform); // force my transform in the output\\n\\n SetOutput(output);\\n\\n \\n\\n DependsOnLinkedNodeOn();\\n\\n\\n\\n // attach a data pipe which creates a bridge between VTK and ALBA\\n\\n albaDataPipeCustom *dpipe = albaDataPipeCustom::New();\\n\\n dpipe->SetDependOnAbsPose(true);\\n\\n SetDataPipe(dpipe);\\n\\n dpipe->SetInput(NULL);\\n\\n \\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 81,\n \"score\": 61747.85759340514\n },\n {\n \"content\": \"}\\n\\n\\n\\n//-------------------------------------------------------------------------\\n\\nmmaVolumeMaterial * albaVMELabeledVolume::GetMaterial()\\n\\n//-------------------------------------------------------------------------\\n\\n{\\n\\n mmaVolumeMaterial *material = (mmaVolumeMaterial *)GetAttribute(\\\"VolumeMaterialAttributes\\\");\\n\\n if (material == NULL)\\n\\n {\\n\\n material = mmaVolumeMaterial::New();\\n\\n SetAttribute(\\\"VolumeMaterialAttributes\\\", material);\\n\\n if (m_Output)\\n\\n {\\n\\n ((albaVMEOutputVolume *)m_Output)->SetMaterial(material);\\n\\n }\\n\\n }\\n\\n return material;\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nint albaVMELabeledVolume::GetLabelValue( wxString &item )\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 82,\n \"score\": 61747.35720819402\n },\n {\n \"content\": \"\\tif(m_ResultPolyData.size()>1)\\n\\n\\t{\\n\\n\\t\\tvtkDEL(m_ResultPolyData[m_ResultPolyData.size()-1]);\\n\\n\\t\\tm_ResultPolyData.pop_back();\\n\\n\\t\\t((albaVMESurface*)m_VmeEditor)->SetData((vtkPolyData*)m_ResultPolyData[m_ResultPolyData.size()-1],m_Input->GetTimeStamp());\\n\\n\\t\\t\\n\\n\\t\\t((albaVMESurface*)m_VmeEditor)->InvokeEvent(this,VME_OUTPUT_DATA_UPDATE);\\n\\n\\t}\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::UpdateISARefSys()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tm_IsaRotate->GetRotationConstraint()->GetRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\\n\\n\\tm_IsaRotate->GetPivotRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\\n\\n\\n\\n\\tm_IsaTranslate->GetTranslationConstraint()->GetRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\\n\\n\\tm_IsaTranslate->GetPivotRefSys()->SetMatrix(m_ImplicitPlaneGizmo->GetAbsMatrixPipe()->GetMatrixPointer());\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 83,\n \"score\": 61747.26630981929\n },\n {\n \"content\": \" albaString labelIntStr = tkz.GetNextToken().c_str();\\n\\n int labelIntValue = atoi(labelIntStr);\\n\\n labelIntVector.push_back(labelIntValue);\\n\\n //Set the label value for vtkImageThreshold\\n\\n m_ValLabel = labelIntValue;\\n\\n albaString minStr = tkz.GetNextToken().c_str();\\n\\n int minValue = atof(minStr);\\n\\n minVector.push_back(minValue);\\n\\n albaString maxStr = tkz.GetNextToken().c_str();\\n\\n int mxValue = atof(maxStr);\\n\\n maxVector.push_back(mxValue);\\n\\n counter++;\\n\\n }\\n\\n }\\n\\n\\n\\n //Modify the scalars value, with the value of the label checked\\n\\n int labelVlaue;\\n\\n if (counter != 0)\\n\\n {\\n\\n int num_tuple = originalScalars->GetNumberOfTuples();\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 84,\n \"score\": 61747.23560537335\n },\n {\n \"content\": \"\\n\\n//----------------------------------------------------------------------------\\n\\nalbaOpLabelExtractor::albaOpLabelExtractor(const wxString& label) :\\n\\nalbaOp(label)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n m_OpType\\t= OPTYPE_OP;\\n\\n m_Canundo = true;\\n\\n\\n\\n\\tm_Vme = NULL;\\n\\n m_Ds = NULL;\\n\\n m_OutputData = NULL;\\n\\n m_TagLabel = NULL;\\n\\n\\tm_ValLabel = 0;\\n\\n\\tm_SurfaceName = \\\"label 0\\\";\\n\\n m_SmoothVolume = 0;\\n\\n m_RadiusFactor = 0.5;\\n\\n m_RadiusFactorAfter = 0.5;\\n\\n m_StdDev[0] = m_StdDev[1] = 1.5;\\n\\n m_StdDev[2] = 2.0;\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 85,\n \"score\": 61746.98004759229\n },\n {\n \"content\": \" volumeScalars = rg->GetPointData()->GetScalars(); \\n\\n }\\n\\n int numberC = m_TagLabel->GetNumberOfComponents();\\n\\n bool lastComponent = false;\\n\\n int numberChecked = 0;\\n\\n\\n\\n std::vector<int> minVector;\\n\\n std::vector<int> maxVector;\\n\\n std::vector<int> labelIntVector;\\n\\n\\n\\n int counter= 0;\\n\\n //Fill the vectors of range and label value\\n\\n for (int c = 0; c < m_CheckedVector.size(); c++)\\n\\n {\\n\\n if (m_CheckedVector.at(c))\\n\\n {\\n\\n wxString label = m_LabelNameVector.at(c);\\n\\n wxStringTokenizer tkz(label,wxT(' '),wxTOKEN_RET_EMPTY_ALL);\\n\\n albaString labelName = tkz.GetNextToken().c_str();\\n\\n albaString labelIntStr = tkz.GetNextToken().c_str();\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 86,\n \"score\": 61746.939032067254\n },\n {\n \"content\": \" for ( int i = 0; i < num_tuple; i++ )\\n\\n {\\n\\n bool modified = false;\\n\\n double scalarValue = labelScalars->GetComponent( i, 0 );\\n\\n for (int c = 0; c < labelIntVector.size(); c++)\\n\\n {\\n\\n if ( scalarValue >= minVector.at(c) && scalarValue <= maxVector.at(c))\\n\\n { \\n\\n labelVlaue = labelIntVector.at(c);\\n\\n labelScalars->SetTuple1( i, labelVlaue ); \\n\\n modified = true;\\n\\n }\\n\\n }\\n\\n if (!modified)\\n\\n {\\n\\n labelScalars->SetTuple1( i, OUTRANGE_SCALAR ); \\n\\n }\\n\\n }\\n\\n\\n\\n labelScalars->Modified();\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 87,\n \"score\": 61746.911625393186\n },\n {\n \"content\": \" m_LookUpTableColor->DeepCopy( m_LookUpTable );\\n\\n for ( int i = m_Min; i <= m_Max; i++ )\\n\\n {\\n\\n vtkIdType index = m_LookUpTableColor->GetIndex( i ); \\n\\n m_LookUpTableColor->SetTableValue( index, 1.0f, 0.0f, 0.0f );\\n\\n }\\n\\n m_Texture->SetLookupTable( m_LookUpTableColor ); \\n\\n m_Rwi->m_RwiBase->Render(); \\n\\n} \\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaVMELabeledVolume::EnableWidgets(bool enable)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n if (m_Gui)\\n\\n {\\n\\n if (!enable || !m_VolumeLink)\\n\\n {\\n\\n m_Gui->Enable(ID_INSERT_LABEL,enable);\\n\\n m_Gui->Enable(ID_REMOVE_LABEL,enable);\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 88,\n \"score\": 61746.63465470395\n },\n {\n \"content\": \" for (int c = 0; c < labelIntVector.size(); c++)\\n\\n {\\n\\n if ( scalarValue >= minVector.at(c) && scalarValue <= maxVector.at(c))\\n\\n { \\n\\n labelVlaue = labelIntVector.at(c);\\n\\n labelScalars->SetTuple1( i, labelVlaue ); \\n\\n modified = true;\\n\\n }\\n\\n }\\n\\n if (!modified)\\n\\n {\\n\\n labelScalars->SetTuple1( i, OUTRANGE_SCALAR); \\n\\n }\\n\\n }\\n\\n \\n\\n labelScalars->Modified();\\n\\n m_Dataset->GetPointData()->SetScalars(labelScalars);\\n\\n m_Dataset->Modified();\\n\\n }\\n\\n else\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 89,\n \"score\": 61746.55440975321\n },\n {\n \"content\": \" \\n\\n vtkALBASmartPointer<vtkALBAContourVolumeMapper> contourMapper;\\n\\n contourMapper->SetInput((vtkDataSet *)imageToSp->GetOutput());\\n\\n contourMapper->SetContourValue(m_ValLabel);\\n\\n\\n\\n\\tvtkALBASmartPointer<vtkPolyData> surface;\\n\\n contourMapper->GetOutput(0, surface);\\t\\n\\n\\tcontourMapper->Update();\\n\\n\\n\\n albaNEW(m_Vme);\\n\\n\\tm_Vme->SetData(surface, 0.0);\\n\\n m_Vme->SetName(m_SurfaceName.c_str());\\n\\n m_Vme->Update();\\n\\n m_Output = m_Vme;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelExtractor::SetLabel(double labelValue)\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 90,\n \"score\": 61746.51447334561\n },\n {\n \"content\": \" m_MaxMin = m_MinAbsolute; \\n\\n m_MaxMax = m_MaxAbsolute;\\n\\n \\n\\n m_LabelNameValue = labelName;\\n\\n m_LabelValueValue = labelIntStr;\\n\\n m_LabelIntValue = labelValue;\\n\\n m_Min = min;\\n\\n m_Max = max;\\n\\n CreateOpDialog();\\n\\n m_Dlg->ShowModal(); \\n\\n } \\n\\n }\\n\\n } \\n\\n else\\n\\n break;\\n\\n }\\n\\n break;\\n\\n case ID_LABELS:\\n\\n {\\n\\n int itemId = e->GetArg();\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 91,\n \"score\": 61746.50583757028\n },\n {\n \"content\": \" if (albaEvent *e = albaEvent::SafeDownCast(alba_event))\\n\\n {\\n\\n switch(e->GetId())\\n\\n {\\n\\n\\t\\t case wxOK:\\n\\n\\t\\t\\t ExtractLabel();\\n\\n\\t\\t\\t if(m_Input->GetOutput()->GetVTKData() != NULL)\\n\\n\\t\\t\\t\\t OpStop(OP_RUN_OK);\\n\\n\\t\\t\\t else\\n\\n\\t\\t\\t {\\n\\n\\t\\t\\t\\t wxString msg = wxString::Format(\\\"Label %d not found!\\\", m_ValLabel);\\n\\n\\t\\t\\t\\t wxMessageBox(msg,\\\"Warning\\\");\\n\\n\\t\\t\\t\\t OpStop(OP_RUN_CANCEL);\\n\\n\\t\\t\\t }\\n\\n\\t\\t break;\\n\\n\\t\\t case wxCANCEL:\\n\\n\\t\\t\\t OpStop(OP_RUN_CANCEL);\\n\\n\\t\\t break;\\n\\n case ID_SMOOTH:\\n\\n m_Gui->Enable(ID_RADIUS_FACTOR,m_SmoothVolume != 0);\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 92,\n \"score\": 61746.38297994673\n },\n {\n \"content\": \" {\\n\\n for ( unsigned int i = 0; i < noc; i++ )\\n\\n {\\n\\n wxString label = m_TagLabel->GetValue( i );\\n\\n if ( label != \\\"\\\" )\\n\\n {\\n\\n myList.push_back( label );\\n\\n }\\n\\n } \\n\\n\\n\\n int checkListId = 0;\\n\\n for( myListIter = myList.begin(); myListIter != myList.end(); myListIter++ )\\n\\n {\\n\\n for ( unsigned int j = 0; j < noc; j++ )\\n\\n {\\n\\n wxString component = m_TagLabel->GetValue( j );\\n\\n if ( component != \\\"\\\" )\\n\\n {\\n\\n wxString labelName = *myListIter;\\n\\n if ( component == labelName )\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 93,\n \"score\": 61746.34852942224\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelExtractor::UpdateDataLabel()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n albaVME *linkedNode = m_Input->GetLink(\\\"VolumeLink\\\");\\n\\n albaSmartPointer<albaVME> linkedVolume = linkedNode;\\n\\n\\n\\n //Get dataset from volume linked to\\n\\n vtkDataSet *data = linkedVolume->GetOutput()->GetVTKData();\\n\\n data->Update();\\n\\n\\n\\n //Create a copy of the dataset not to modify the original one\\n\\n m_Ds = data->NewInstance();\\n\\n m_Ds->DeepCopy(data);\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 94,\n \"score\": 61746.284704283855\n },\n {\n \"content\": \" m_Gui->Vector(ID_SAMPLING_RATE,_(\\\"sample rate\\\"),m_SamplingRate, 1, MAXINT,_(\\\"sampling rate for volume sub-sampling.\\\"));\\n\\n m_Gui->Divider();\\n\\n m_Gui->Float(ID_RADIUS_FACTOR_AFTER,_(\\\"rad. factor\\\"),&m_RadiusFactorAfter,0.1,MAXFLOAT,0,2,_(\\\"max distance to consider for the smooth.\\\"));\\n\\n m_Gui->Vector(ID_STD_DEVIATION_AFTER,_(\\\"std dev.\\\"),m_StdDevAfter, 0.1, MAXFLOAT,2,_(\\\"standard deviation for the smooth.\\\"));\\n\\n m_Gui->Divider(2);\\n\\n m_Gui->Divider();\\n\\n\\n\\n if (m_Input->IsA(\\\"albaVMELabeledVolume\\\"))\\n\\n {\\n\\n m_LabelCheckBox = m_Gui->CheckList(ID_LABELS,_(\\\"Labels\\\"),360,_(\\\"Chose label to extract\\\"));\\n\\n\\n\\n typedef std::list< wxString > LIST;\\n\\n LIST myList; \\n\\n LIST::iterator myListIter; \\n\\n\\n\\n // If there is a tag named \\\"LABELS\\\" then I have to load the labels in the correct position in the listbox\\n\\n if (RetrieveTag())\\n\\n {\\n\\n int noc = m_TagLabel->GetNumberOfComponents();\\n\\n if(noc != 0)\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 95,\n \"score\": 61746.27754736759\n },\n {\n \"content\": \" m_TagLabel = new albaTagItem;\\n\\n m_TagLabel = m_Input->GetTagArray()->GetTag( \\\"LABELS\\\" );\\n\\n return tagPresent;\\n\\n }\\n\\n else\\n\\n return !tagPresent;\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelExtractor::OpRun() \\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\\n\\tm_Gui = new albaGUI(this);\\n\\n\\tm_Gui->SetListener(this);\\n\\n\\n\\n m_Gui->Bool(ID_SMOOTH,_(\\\"smooth\\\"),&m_SmoothVolume,0,_(\\\"gaussian smooth for extracting big surface\\\"));\\n\\n m_Gui->Divider(2);\\n\\n m_Gui->Float(ID_RADIUS_FACTOR,_(\\\"rad. factor\\\"),&m_RadiusFactor,0.1,MAXFLOAT,0,2,_(\\\"max distance to consider for the smooth.\\\"));\\n\\n m_Gui->Vector(ID_STD_DEVIATION,_(\\\"std dev.\\\"),m_StdDev, 0.1, MAXFLOAT,2,_(\\\"standard deviation for the smooth.\\\"));\\n\\n m_Gui->Divider();\\n\",\n \"file_path\": \"Operations/albaOpLabelExtractor.cpp\",\n \"rank\": 96,\n \"score\": 61746.23982850289\n },\n {\n \"content\": \"\\tnewPolyData2->Update();\\n\\n\\n\\n\\tvtkALBASmartPointer<vtkAppendPolyData> append;\\n\\n\\tappend->SetInput(newPolyData1);\\n\\n\\tappend->AddInput(newPolyData2);\\n\\n\\tappend->Update();\\n\\n\\n\\n\\n\\n\\tvtkALBASmartPointer<vtkCleanPolyData> clean;\\n\\n\\tclean->SetInput(append.GetPointer()->GetOutput());\\n\\n\\tclean->Update();\\n\\n\\n\\n\\tvtkALBASmartPointer<vtkTransformPolyDataFilter> transform_data_output;\\n\\n\\ttransform_data_output->SetTransform(m_VmeEditor->GetAbsMatrixPipe()->GetVTKTransform()->GetInverse());\\n\\n\\ttransform_data_output->SetInput(clean->GetOutput());\\n\\n\\ttransform_data_output->Update();\\n\\n\\n\\n\\tint result=(m_VmeEditor)->SetData(transform_data_output->GetOutput(),m_VmeEditor->GetTimeStamp());\\n\\n\\n\\n\\tif(result==ALBA_OK)\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 97,\n \"score\": 61746.22744165996\n },\n {\n \"content\": \" m_LabelIntValue = atoi(labelIntStr);\\n\\n labelIntVector.push_back(m_LabelIntValue);\\n\\n albaString minStr = tkz.GetNextToken().c_str();\\n\\n m_MinValue = atof(minStr);\\n\\n minVector.push_back(m_MinValue);\\n\\n albaString maxStr = tkz.GetNextToken().c_str();\\n\\n m_MaxValue = atof(maxStr);\\n\\n maxVector.push_back(m_MaxValue);\\n\\n counter++;\\n\\n }\\n\\n }\\n\\n \\n\\n int labelVlaue;\\n\\n if (counter != 0)\\n\\n {\\n\\n int not = volumeScalars->GetNumberOfTuples();\\n\\n for ( int i = 0; i < not; i++ )\\n\\n {\\n\\n bool modified = false;\\n\\n double scalarValue = volumeScalars->GetComponent( i, 0 );\\n\",\n \"file_path\": \"VME/albaVMELabeledVolume.cpp\",\n \"rank\": 98,\n \"score\": 61746.22287704076\n },\n {\n \"content\": \"\\t{\\n\\n\\t\\tvtkPolyData *poly;\\n\\n\\t\\tvtkNEW(poly);\\n\\n\\t\\tpoly->DeepCopy(transform_data_output->GetOutput());\\n\\n\\t\\tpoly->Update();\\n\\n\\t\\tm_ResultPolyData.push_back(poly);\\n\\n\\t}\\n\\n\\n\\n\\t((albaVMESurface*)m_VmeEditor)->Modified();\\n\\n\\t((albaVMESurface*)m_VmeEditor)->Update();\\n\\n\\n\\n\\t((albaVMESurface*)m_VmeEditor)->InvokeEvent(this, VME_OUTPUT_DATA_UPDATE);\\n\\n\\n\\n\\t/*m_Gui->Enable(ID_UNDO,m_ResultPolyData.size()>1);\\n\\n\\tm_Gui->Enable(wxOK,m_ResultPolyData.size()>1);*/\\n\\n}\\n\\n//----------------------------------------------------------------------------\\n\\nvoid albaOpLabelizeSurface::ChangeGizmo()\\n\\n//----------------------------------------------------------------------------\\n\\n{\\n\",\n \"file_path\": \"Operations/albaOpLabelizeSurface.cpp\",\n \"rank\": 99,\n \"score\": 61746.17499723435\n }\n]","isConversational":false}}},{"rowIdx":492,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"src/test_suites/oclc/oclc_miscellaneous_vector_functions/src/vec_step.cpp"},"repo_name":{"kind":"string","value":"intel/cassian"},"commit":{"kind":"string","value":"8e9594f053f9b9464066c8002297346580e4aa2a"},"file_code":{"kind":"string","value":"\n\n#include <algorithm>\n#include <cassian/catch2_utils/catch2_utils.hpp>\n#include <cassian/cli/cli.hpp>\n#include <cassian/runtime/openclc_type_tuples.hpp>\n#include <cassian/runtime/runtime.hpp>\n#include <cassian/test_harness/test_harness.hpp>\n#include <cassian/utility/metaprogramming.hpp>\n#include <cassian/utility/utility.hpp>\n#include <catch2/catch.hpp>\n#include <cstddef>\n#include <numeric>\n#include <string>\n#include <test_config.hpp>\n#include <vector>\n\nnamespace ca = cassian;\n\nnamespace {\n\ntemplate <typename T> int get_reference() {\n using data_host_type = typename T::host_type;\n if constexpr (ca::is_vector_v<data_host_type>) {\n return data_host_type::size_in_memory;\n }\n return 1;\n}\n\ntemplate <typename T> std::string get_build_options() {\n const std::string clc_data_type = T::device_type;\n std::string build_options = \" -D DATA_TYPE=\" + clc_data_type;\n return build_options;\n}\n\nca::Kernel create_kernel(const std::string &path, const std::string &name,\n const std::string &build_options,\n cassian::Runtime *runtime,\n const std::string &program_type) {\n const std::string source = ca::load_text_file(ca::get_asset(path));\n return runtime->create_kernel(name, source, build_options, program_type);\n}\n\nstd::vector<int> generate_input(const size_t elements) {\n std::vector<int> input(elements);\n std::iota(input.begin(), input.end(), 0);\n return input;\n}\n\ntemplate <typename T>\nstd::vector<int> run_data_type_kernel(const cassian::Kernel &kernel,\n const size_t global_work_size,\n const std::vector<T> &input,\n cassian::Runtime *runtime) {\n std::vector<ca::Buffer> buffers;\n\n ca::Buffer input_buffer = runtime->create_buffer(sizeof(T) * input.size());\n runtime->write_buffer_from_vector(input_buffer, input);\n buffers.push_back(input_buffer);\n\n ca::Buffer output_buffer =\n runtime->create_buffer(sizeof(int) * global_work_size);\n buffers.push_back(output_buffer);\n\n runtime->set_kernel_argument(kernel, 0, input_buffer);\n runtime->set_kernel_argument(kernel, 1, output_buffer);\n\n runtime->run_kernel(kernel, global_work_size);\n\n std::vector<int> output = runtime->read_buffer_to_vector<int>(output_buffer);\n\n for (auto &buffer : buffers) {\n runtime->release_buffer(buffer);\n }\n\n return output;\n}\n\ntemplate <typename T>\nstd::vector<int> run_pure_type_kernel(const cassian::Kernel &kernel,\n const size_t global_work_size,\n cassian::Runtime *runtime) {\n std::vector<ca::Buffer> buffers;\n\n ca::Buffer output_buffer =\n runtime->create_buffer(sizeof(int) * global_work_size);\n buffers.push_back(output_buffer);\n\n runtime->set_kernel_argument(kernel, 0, output_buffer);\n\n runtime->run_kernel(kernel, global_work_size);\n\n std::vector<int> output = runtime->read_buffer_to_vector<int>(output_buffer);\n\n for (auto &buffer : buffers) {\n runtime->release_buffer(buffer);\n }\n\n return output;\n}\n\nusing GentypeTypes = ca::TupleConcat<ca::ScalarTypes, ca::VectorTypes>::type;\n\ntemplate <typename T> std::string test_name() {\n return std::string(T::type_name);\n}\n\nTEMPLATE_LIST_TEST_CASE_CUSTOM_NAME(\"vec_step_data_type\", \"\", GentypeTypes,\n test_name<TestType>) {\n const TestConfig &config = get_test_config();\n\n ca::Requirements requirements;\n requirements.arithmetic_type<typename TestType::scalar_type>();\n if (ca::should_skip_test(requirements, *config.runtime())) {\n return;\n }\n\n ca::Runtime *runtime = config.runtime();\n const std::string program_type = config.program_type();\n const size_t global_work_size = config.work_size();\n\n using data_host_type = typename TestType::host_type;\n const std::vector<data_host_type> input(global_work_size,\n data_host_type(123));\n\n const std::string build_options = get_build_options<TestType>();\n ca::Kernel kernel =\n create_kernel(\"kernels/oclc_miscellaneous_vector_functions/vec_step.cl\",\n \"test_data_type\", build_options, runtime, program_type);\n const std::vector<int> output =\n run_data_type_kernel(kernel, global_work_size, input, runtime);\n runtime->release_kernel(kernel);\n\n const std::vector<int> reference =\n std::vector<int>(global_work_size, get_reference<TestType>());\n REQUIRE_THAT(output, Catch::Equals(reference));\n}\n\nTEMPLATE_LIST_TEST_CASE_CUSTOM_NAME(\"vec_step_pure_type\", \"\", GentypeTypes,\n test_name<TestType>) {\n const TestConfig &config = get_test_config();\n\n ca::Requirements requirements;\n requirements.arithmetic_type<typename TestType::scalar_type>();\n if (ca::should_skip_test(requirements, *config.runtime())) {\n return;\n }\n\n ca::Runtime *runtime = config.runtime();\n const std::string program_type = config.program_type();\n const size_t global_work_size = config.work_size();\n\n const std::string build_options = get_build_options<TestType>();\n ca::Kernel kernel =\n create_kernel(\"kernels/oclc_miscellaneous_vector_functions/vec_step.cl\",\n \"test_pure_type\", build_options, runtime, program_type);\n using data_host_type = typename TestType::host_type;\n const std::vector<int> output =\n run_pure_type_kernel<data_host_type>(kernel, global_work_size, runtime);\n runtime->release_kernel(kernel);\n\n const std::vector<int> reference =\n std::vector<int>(global_work_size, get_reference<TestType>());\n REQUIRE_THAT(output, Catch::Equals(reference));\n}\n\n} \n"},"prefix":{"kind":"string","value":"\n\n#include <algorithm>\n#include <cassian/catch2_utils/catch2_utils.hpp>\n#include <cassian/cli/cli.hpp>\n#include <cassian/runtime/openclc_type_tuples.hpp>\n#include <cassian/runtime/runtime.hpp>\n#include <cassian/test_harness/test_harness.hpp>\n#include <cassian/utility/metaprogramming.hpp>\n#include <cassian/utility/utility.hpp>\n#include <catch2/catch.hpp>\n#include <cstddef>\n#include <numeric>\n#include <string>\n#include <test_config.hpp>\n#include <vector>\n\nnamespace ca = cassian;\n\nnamespace {\n\ntemplate <typename T> "},"suffix":{"kind":"string","value":"\n\ntemplate <typename T> std::string get_build_options() {\n const std::string clc_data_type = T::device_type;\n std::string build_options = \" -D DATA_TYPE=\" + clc_data_type;\n return build_options;\n}\n\nca::Kernel create_kernel(const std::string &path, const std::string &name,\n const std::string &build_options,\n cassian::Runtime *runtime,\n const std::string &program_type) {\n const std::string source = ca::load_text_file(ca::get_asset(path));\n return runtime->create_kernel(name, source, build_options, program_type);\n}\n\nstd::vector<int> generate_input(const size_t elements) {\n std::vector<int> input(elements);\n std::iota(input.begin(), input.end(), 0);\n return input;\n}\n\ntemplate <typename T>\nstd::vector<int> run_data_type_kernel(const cassian::Kernel &kernel,\n const size_t global_work_size,\n const std::vector<T> &input,\n cassian::Runtime *runtime) {\n std::vector<ca::Buffer> buffers;\n\n ca::Buffer input_buffer = runtime->create_buffer(sizeof(T) * input.size());\n runtime->write_buffer_from_vector(input_buffer, input);\n buffers.push_back(input_buffer);\n\n ca::Buffer output_buffer =\n runtime->create_buffer(sizeof(int) * global_work_size);\n buffers.push_back(output_buffer);\n\n runtime->set_kernel_argument(kernel, 0, input_buffer);\n runtime->set_kernel_argument(kernel, 1, output_buffer);\n\n runtime->run_kernel(kernel, global_work_size);\n\n std::vector<int> output = runtime->read_buffer_to_vector<int>(output_buffer);\n\n for (auto &buffer : buffers) {\n runtime->release_buffer(buffer);\n }\n\n return output;\n}\n\ntemplate <typename T>\nstd::vector<int> run_pure_type_kernel(const cassian::Kernel &kernel,\n const size_t global_work_size,\n cassian::Runtime *runtime) {\n std::vector<ca::Buffer> buffers;\n\n ca::Buffer output_buffer =\n runtime->create_buffer(sizeof(int) * global_work_size);\n buffers.push_back(output_buffer);\n\n runtime->set_kernel_argument(kernel, 0, output_buffer);\n\n runtime->run_kernel(kernel, global_work_size);\n\n std::vector<int> output = runtime->read_buffer_to_vector<int>(output_buffer);\n\n for (auto &buffer : buffers) {\n runtime->release_buffer(buffer);\n }\n\n return output;\n}\n\nusing GentypeTypes = ca::TupleConcat<ca::ScalarTypes, ca::VectorTypes>::type;\n\ntemplate <typename T> std::string test_name() {\n return std::string(T::type_name);\n}\n\nTEMPLATE_LIST_TEST_CASE_CUSTOM_NAME(\"vec_step_data_type\", \"\", GentypeTypes,\n test_name<TestType>) {\n const TestConfig &config = get_test_config();\n\n ca::Requirements requirements;\n requirements.arithmetic_type<typename TestType::scalar_type>();\n if (ca::should_skip_test(requirements, *config.runtime())) {\n return;\n }\n\n ca::Runtime *runtime = config.runtime();\n const std::string program_type = config.program_type();\n const size_t global_work_size = config.work_size();\n\n using data_host_type = typename TestType::host_type;\n const std::vector<data_host_type> input(global_work_size,\n data_host_type(123));\n\n const std::string build_options = get_build_options<TestType>();\n ca::Kernel kernel =\n create_kernel(\"kernels/oclc_miscellaneous_vector_functions/vec_step.cl\",\n \"test_data_type\", build_options, runtime, program_type);\n const std::vector<int> output =\n run_data_type_kernel(kernel, global_work_size, input, runtime);\n runtime->release_kernel(kernel);\n\n const std::vector<int> reference =\n std::vector<int>(global_work_size, get_reference<TestType>());\n REQUIRE_THAT(output, Catch::Equals(reference));\n}\n\nTEMPLATE_LIST_TEST_CASE_CUSTOM_NAME(\"vec_step_pure_type\", \"\", GentypeTypes,\n test_name<TestType>) {\n const TestConfig &config = get_test_config();\n\n ca::Requirements requirements;\n requirements.arithmetic_type<typename TestType::scalar_type>();\n if (ca::should_skip_test(requirements, *config.runtime())) {\n return;\n }\n\n ca::Runtime *runtime = config.runtime();\n const std::string program_type = config.program_type();\n const size_t global_work_size = config.work_size();\n\n const std::string build_options = get_build_options<TestType>();\n ca::Kernel kernel =\n create_kernel(\"kernels/oclc_miscellaneous_vector_functions/vec_step.cl\",\n \"test_pure_type\", build_options, runtime, program_type);\n using data_host_type = typename TestType::host_type;\n const std::vector<int> output =\n run_pure_type_kernel<data_host_type>(kernel, global_work_size, runtime);\n runtime->release_kernel(kernel);\n\n const std::vector<int> reference =\n std::vector<int>(global_work_size, get_reference<TestType>());\n REQUIRE_THAT(output, Catch::Equals(reference));\n}\n\n} \n"},"middle":{"kind":"string","value":"int get_reference() {\n using data_host_type = typename T::host_type;\n if constexpr (ca::is_vector_v<data_host_type>) {\n return data_host_type::size_in_memory;\n }\n return 1;\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_VECTOR_VECTOR_HPP\n\n#define CASSIAN_VECTOR_VECTOR_HPP\n\n\n\n#include <algorithm>\n\n#include <array>\n\n#include <cstddef>\n\n#include <functional>\n\n#include <initializer_list>\n\n#include <sstream>\n\n#include <stdexcept>\n\n#include <string>\n\n#include <type_traits>\n\n#include <vector>\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":0,"score":166960.65098467225},{"content":" * @tparam TYPE type to extract vector size\n\n * @returns 1\n\n *\n\n */\n\ntemplate <typename TYPE,\n\n typename std::enable_if_t<std::is_integral_v<TYPE>, int> = 0>\n\nint get_vector_size() {\n\n return 1;\n\n}\n\n\n\n} // namespace cassian\n\n#endif\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":1,"score":166948.40119518444},{"content":" * cassian::Vector\n\n */\n\ntemplate <typename T> using make_signed_t = typename MakeSigned<T>::type;\n\n\n\n/**\n\n * MakeUnsigned works as std::make_unsigned but works with cassian::Vector\n\n */\n\ntemplate <typename T, typename ENABLE = void> struct MakeUnsigned {\n\n /**\n\n * Make unsigned\n\n */\n\n using type = std::make_unsigned_t<T>;\n\n};\n\n/**\n\n * MakeUnsigned works same as std::make_unsigned but works with cassian::Vector\n\n */\n\ntemplate <typename T> struct MakeUnsigned<T, typename T::is_vector> {\n\n /**\n\n * Make unsigned\n\n */\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":2,"score":166945.38432577747},{"content":"\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Exception class used when a Vector can't be constructed with a given number\n\n * of elements.\n\n */\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":3,"score":166945.00528544476},{"content":" */\n\n using is_vector = void; // used for template metaprograming\n\n\n\nprivate:\n\n std::array<T, SIZE_IN_MEMORY> data_;\n\n};\n\n\n\n/**\n\n * Convert Vector to string representation.\n\n *\n\n * @param[in] value object to convert.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n\ntemplate <typename T, int N, int SIZE_IN_MEMORY = N>\n\nstd::string to_string(const Vector<T, N, SIZE_IN_MEMORY> &value) {\n\n std::stringstream ss;\n\n ss << \"{\";\n\n for (size_t i = 0; i < value.size(); ++i) {\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":4,"score":166944.95296363067},{"content":" * MakeSigned works same as std::make_signed but works with cassian::Vector\n\n */\n\ntemplate <typename T, typename ENABLE = void> struct MakeSigned {\n\n /**\n\n * Make signed\n\n */\n\n using type = std::make_signed_t<T>;\n\n};\n\n/**\n\n * MakeSigned works as std::make_signed but works with cassian::Vector\n\n */\n\ntemplate <typename T> struct MakeSigned<T, typename T::is_vector> {\n\n /**\n\n * Make signed\n\n */\n\n using type = Vector<std::make_signed_t<typename T::value_type>,\n\n T::vector_size, T::size_in_memory>;\n\n};\n\n/**\n\n * cassian::make_signed_t works same as std::make_signed_t but it works with\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":5,"score":166944.72695455517},{"content":" ss << std::to_string(+value[i]);\n\n if (i < value.size() - 1) {\n\n ss << \", \";\n\n }\n\n }\n\n ss << \"}\";\n\n return ss.str();\n\n}\n\n\n\n/**\n\n * Append string representation of Vector object to a stream.\n\n *\n\n * @param[in] os stream to use.\n\n * @param[in] value object to convert.\n\n * @returns used stream.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n\ntemplate <typename T, int N, int SIZE_IN_MEMORY = N>\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":6,"score":166943.41363977443},{"content":" using type = Vector<std::make_unsigned_t<typename T::value_type>,\n\n T::vector_size, T::size_in_memory>;\n\n};\n\n/**\n\n * cassian::make_unsigned_t works same as std::make_unsigned_t but it works with\n\n * cassian::Vector\n\n */\n\ntemplate <typename T> using make_unsigned_t = typename MakeUnsigned<T>::type;\n\n\n\n/**\n\n * Apply equal operator on Vectors component-wise.\n\n *\n\n * @param[in] lhs input a.\n\n * @param[in] rhs input b.\n\n * @returns output.\n\n * @tparam OUTPUT_TYPE the type of output.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":7,"score":166943.15368212757},{"content":"std::ostream &operator<<(std::ostream &os,\n\n const Vector<T, N, SIZE_IN_MEMORY> &value) {\n\n os << to_string(value);\n\n return os;\n\n}\n\n\n\n/**\n\n * Meta class for vector types.\n\n *\n\n * @tparam T scalar type.\n\n */\n\ntemplate <typename T, typename ENABLE = void> struct IsVector {\n\n /**\n\n * Scalar type.\n\n */\n\n static const bool value = false;\n\n};\n\n\n\n/**\n\n * Meta class for vector types.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":8,"score":166943.0519303801},{"content":" * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n\ntemplate <typename T, int N, int SIZE_IN_MEMORY = N> class Vector {\n\npublic:\n\n /**\n\n * Default constructor.\n\n */\n\n Vector() = default;\n\n\n\n /**\n\n * Construct Vector from std::initializer_list.\n\n *\n\n * @param[in] list std::initializer_list from which Vector should be\n\n * constructed.\n\n * @throws cassian::VectorBadNumberOfElementsException Thrown if list has\n\n * different number of elements than constructed Vector.\n\n */\n\n Vector(std::initializer_list<T> list) {\n\n const int list_size = static_cast<int>(list.size());\n\n if (list_size == N) {\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":9,"score":166942.11584807088},{"content":" const T &rhs) {\n\n const Vector<T, N, SIZE_IN_MEMORY> vector_rhs(rhs);\n\n return not_equal_component_wise<OUTPUT_TYPE>(lhs, vector_rhs);\n\n}\n\n\n\n/**\n\n * Apply not operator on a Vector component-wise.\n\n *\n\n * @param[in] v input.\n\n * @returns output.\n\n * @tparam OUTPUT_TYPE the type of output.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\n\nOUTPUT_TYPE not_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &v) {\n\n using scalar_type = cassian::scalar_type_v<OUTPUT_TYPE>;\n\n OUTPUT_TYPE output;\n\n for (size_t i = 0; i < output.size(); ++i) {\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":10,"score":166941.41842917225},{"content":"template <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\n\nOUTPUT_TYPE equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\n\n const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\n\n using scalar_type = cassian::scalar_type_v<OUTPUT_TYPE>;\n\n OUTPUT_TYPE output;\n\n for (size_t i = 0; i < output.size(); ++i) {\n\n output[i] = lhs[i] == rhs[i] ? scalar_type(-1) : scalar_type(0);\n\n }\n\n return output;\n\n}\n\n\n\n/**\n\n * Apply equal operator on a Vector and scalar component-wise.\n\n *\n\n * @param[in] lhs input a.\n\n * @param[in] rhs input b.\n\n * @returns output.\n\n * @tparam OUTPUT_TYPE the type of output.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":11,"score":166941.16411715923},{"content":" *\n\n * @tparam T vector type.\n\n */\n\ntemplate <typename T> struct IsVector<T, typename T::is_vector> {\n\n /**\n\n * Vector type.\n\n */\n\n static const bool value = true;\n\n};\n\n\n\n/**\n\n * Returns true if T is a Vector class.\n\n *\n\n * @tparam T type.\n\n */\n\ntemplate <typename T> constexpr bool is_vector_v = IsVector<T>::value;\n\n\n\n/**\n\n * Metafunction to enable a function declaration if T is a Vector.\n\n *\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":12,"score":166939.78073544125},{"content":" * @tparam T type.\n\n */\n\ntemplate <typename T>\n\nusing EnableIfIsVector = std::enable_if_t<is_vector_v<T>, int>;\n\n\n\n/**\n\n * Metafunction to enable a function declaration if T is a scalar.\n\n *\n\n * @tparam T type.\n\n */\n\ntemplate <typename T>\n\nusing EnableIfIsScalar = std::enable_if_t<!is_vector_v<T>, int>;\n\n\n\n/**\n\n * Metafunction to enable a function declaration if T is integral.\n\n *\n\n * @tparam T type.\n\n */\n\ntemplate <typename T>\n\nusing EnableIfIsIntegral = std::enable_if_t<std::is_integral<T>::value, int>;\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":13,"score":166939.17002711943},{"content":"};\n\n\n\n/**\n\n * Meta class for scalar types.\n\n *\n\n * @tparam T vector type.\n\n */\n\ntemplate <typename T> struct ScalarType<T, typename T::is_vector> {\n\n /**\n\n * Scalar type.\n\n */\n\n using value = typename T::value_type;\n\n};\n\n\n\n/**\n\n * Scalar type.\n\n */\n\ntemplate <typename T> using scalar_type_v = typename ScalarType<T>::value;\n\n\n\n/**\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":14,"score":166938.80150212932},{"content":"template <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\n\nOUTPUT_TYPE equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\n\n const T &rhs) {\n\n const Vector<T, N, SIZE_IN_MEMORY> vector_rhs(rhs);\n\n return equal_component_wise<OUTPUT_TYPE>(lhs, vector_rhs);\n\n}\n\n\n\n/**\n\n * Apply not equal operator on Vectors component-wise.\n\n *\n\n * @param[in] lhs input a.\n\n * @param[in] rhs input b.\n\n * @returns output.\n\n * @tparam OUTPUT_TYPE the type of output.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\n\nOUTPUT_TYPE not_equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":15,"score":166938.64879483494},{"content":"template <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\n\nOUTPUT_TYPE not_equal_component_wise(const T &lhs,\n\n const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\n\n const Vector<T, N, SIZE_IN_MEMORY> vector_lhs(lhs);\n\n return not_equal_component_wise<OUTPUT_TYPE>(vector_lhs, rhs);\n\n}\n\n\n\n/**\n\n * Apply not equal operator on a Vector and scalar component-wise.\n\n *\n\n * @param[in] lhs input a.\n\n * @param[in] rhs input b.\n\n * @returns output.\n\n * @tparam OUTPUT_TYPE the type of output.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\n\nOUTPUT_TYPE not_equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":16,"score":166938.63161674404},{"content":" output[i] = !v[i] ? scalar_type(-1) : scalar_type(0);\n\n }\n\n return output;\n\n}\n\n\n\n/**\n\n * Get vector size. For scalar types return 1.\n\n *\n\n * @tparam TYPE type to extract vector size\n\n * @tparam N disables function when TYPE::vector_size doesn't exist\n\n * @returns vector size\n\n *\n\n */\n\ntemplate <typename TYPE, int N = TYPE::vector_size> int get_vector_size() {\n\n return N;\n\n}\n\n\n\n/**\n\n * @overload for scalar types\n\n *\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":17,"score":166938.4627463174},{"content":" std::copy(list.begin(), list.end(), data_.begin());\n\n } else {\n\n throw VectorBadNumberOfElementsException(\"initializer list\", N,\n\n list_size);\n\n }\n\n }\n\n\n\n /**\n\n * Construct Vector from std::vector.\n\n *\n\n * @param[in] vector std::vector from which Vector should be constructed.\n\n * @throws cassian::VectorBadNumberOfElementsException Thrown if vector has\n\n * different number of elements than constructed Vector.\n\n */\n\n explicit Vector(std::vector<T> vector) {\n\n const int vector_size = static_cast<int>(vector.size());\n\n if (vector.size() == N) {\n\n std::move(vector.begin(), vector.end(), data_.begin());\n\n } else {\n\n throw VectorBadNumberOfElementsException(\"std::vector\", N, vector_size);\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":18,"score":166938.1847812732},{"content":" const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\n\n using scalar_type = cassian::scalar_type_v<OUTPUT_TYPE>;\n\n OUTPUT_TYPE output;\n\n for (size_t i = 0; i < output.size(); ++i) {\n\n output[i] = lhs[i] != rhs[i] ? scalar_type(-1) : scalar_type(0);\n\n }\n\n return output;\n\n}\n\n\n\n/**\n\n * Apply not equal operator on a Vector and scalar component-wise.\n\n *\n\n * @param[in] lhs input a.\n\n * @param[in] rhs input b.\n\n * @returns output.\n\n * @tparam OUTPUT_TYPE the type of output.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":19,"score":166937.7324854386},{"content":" * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\n\nOUTPUT_TYPE equal_component_wise(const T &lhs,\n\n const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\n\n const Vector<T, N, SIZE_IN_MEMORY> vector_lhs(lhs);\n\n return equal_component_wise<OUTPUT_TYPE>(vector_lhs, rhs);\n\n}\n\n\n\n/**\n\n * Apply equal operator on a Vector and scalar component-wise.\n\n *\n\n * @param[in] lhs input a.\n\n * @param[in] rhs input b.\n\n * @returns output.\n\n * @tparam OUTPUT_TYPE the type of output.\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\n\n */\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":20,"score":166937.70499233916},{"content":" */\n\n friend Vector operator%(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n lhs_vector %= rhs;\n\n return lhs_vector;\n\n }\n\n\n\n /**\n\n * Modulo operator.\n\n *\n\n * @param[in] lhs Vector to modulo.\n\n * @param[in] rhs scalar to modulo.\n\n * @returns result of modulo.\n\n * @overload\n\n */\n\n friend Vector operator%(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n lhs %= rhs_vector;\n\n return lhs;\n\n }\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":21,"score":166934.2454750566},{"content":" * @returns result of subtraction.\n\n * @overload\n\n */\n\n friend Vector operator-(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n lhs_vector -= rhs;\n\n return lhs_vector;\n\n }\n\n\n\n /**\n\n * Subtraction operator.\n\n *\n\n * @param[in] lhs Vector to subtract.\n\n * @param[in] rhs scalar to subtract.\n\n * @returns result of subtraction.\n\n * @overload\n\n */\n\n friend Vector operator-(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n lhs -= rhs_vector;\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":22,"score":166934.23720788755},{"content":" * @returns result of multiplication.\n\n */\n\n friend Vector operator*(Vector lhs, const Vector &rhs) {\n\n lhs *= rhs;\n\n return lhs;\n\n }\n\n\n\n /**\n\n * Multiplication operator.\n\n *\n\n * @param[in] lhs scalar to multiply.\n\n * @param[in] rhs Vector to multiply.\n\n * @returns result of multiplication.\n\n * @overload\n\n */\n\n friend Vector operator*(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n lhs_vector *= rhs;\n\n return lhs_vector;\n\n }\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":23,"score":166934.19288197465},{"content":" *\n\n * @param[in] lhs Vector to add.\n\n * @param[in] rhs Vector to add.\n\n * @returns result of addition.\n\n */\n\n friend Vector operator+(Vector lhs, const Vector &rhs) {\n\n lhs += rhs;\n\n return lhs;\n\n }\n\n\n\n /**\n\n * Addition operator.\n\n *\n\n * @param[in] lhs scalar to add.\n\n * @param[in] rhs Vector to add.\n\n * @returns result of addition.\n\n * @overload\n\n */\n\n friend Vector operator+(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":24,"score":166934.1782502622},{"content":" *\n\n * @param[in] lhs scalar to compare.\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if any value is not equal.\n\n */\n\n friend bool operator!=(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n return lhs_vector != rhs;\n\n }\n\n\n\n /**\n\n * Not equal operator.\n\n *\n\n * @param[in] lhs Vector to compare.\n\n * @param[in] rhs scalar to compare.\n\n * @returns true if any value is not equal.\n\n */\n\n friend bool operator!=(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n return lhs != rhs_vector;\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":25,"score":166934.13954836378},{"content":" */\n\n friend bool operator<(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n return lhs_vector < rhs;\n\n }\n\n\n\n /**\n\n * Less than operator.\n\n *\n\n * @param[in] lhs Vector to compare.\n\n * @param[in] rhs scalar to compare.\n\n * @returns true if all lhs values are less than rhs values.\n\n */\n\n friend bool operator<(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n return lhs < rhs_vector;\n\n }\n\n\n\n /**\n\n * Greater than operator.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":26,"score":166934.1235328709},{"content":" lhs_vector += rhs;\n\n return lhs_vector;\n\n }\n\n\n\n /**\n\n * Addition operator.\n\n *\n\n * @param[in] lhs Vector to add.\n\n * @param[in] rhs scalar to add.\n\n * @returns result of addition.\n\n * @overload\n\n */\n\n friend Vector operator+(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n lhs += rhs_vector;\n\n return lhs;\n\n }\n\n\n\n /**\n\n * Subtraction assignment operator.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":27,"score":166934.1274934368},{"content":" *\n\n * @param[in] rhs Vector to subtract.\n\n * @returns this after subtraction.\n\n */\n\n Vector &operator-=(const Vector &rhs) {\n\n std::transform(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), data_.begin(), std::minus<T>());\n\n return *this;\n\n }\n\n\n\n /**\n\n * Subtraction operator.\n\n *\n\n * @param[in] lhs Vector to subtract.\n\n * @param[in] rhs Vector to subtract.\n\n * @returns result of subtraction.\n\n */\n\n friend Vector operator-(Vector lhs, const Vector &rhs) {\n\n lhs -= rhs;\n\n return lhs;\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":28,"score":166934.11821977526},{"content":" }\n\n }\n\n\n\n /**\n\n * Construct Vector from a scalar.\n\n *\n\n * @param[in] scalar value which will be used to fill a Vector.\n\n */\n\n explicit Vector(T scalar) { std::fill(data_.begin(), data_.end(), scalar); }\n\n\n\n /**\n\n * Copy constructor.\n\n */\n\n Vector(const Vector &) = default;\n\n\n\n /**\n\n * Move constructor.\n\n */\n\n Vector(Vector &&) noexcept = default;\n\n\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":29,"score":166934.0984932004},{"content":" * Division operator.\n\n *\n\n * @param[in] lhs scalar to divide.\n\n * @param[in] rhs Vector to divide.\n\n * @returns result of division.\n\n * @overload\n\n */\n\n friend Vector operator/(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n lhs_vector /= rhs;\n\n return lhs_vector;\n\n }\n\n\n\n /**\n\n * Division operator.\n\n *\n\n * @param[in] lhs Vector to divide.\n\n * @param[in] rhs scalar to divide.\n\n * @returns result of division.\n\n * @overload\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":30,"score":166934.09175411562},{"content":" */\n\n Vector &operator/=(const Vector &rhs) {\n\n std::transform(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), data_.begin(), std::divides<T>());\n\n return *this;\n\n }\n\n\n\n /**\n\n * Division operator.\n\n *\n\n * @param[in] lhs Vector to divide.\n\n * @param[in] rhs Vector to divide.\n\n * @returns result of division.\n\n */\n\n friend Vector operator/(Vector lhs, const Vector &rhs) {\n\n lhs /= rhs;\n\n return lhs;\n\n }\n\n\n\n /**\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":31,"score":166934.09175411556},{"content":" */\n\n friend Vector operator/(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n lhs /= rhs_vector;\n\n return lhs;\n\n }\n\n\n\n /**\n\n * Modulo assignment operator.\n\n *\n\n * @param[in] rhs Vector to modulo.\n\n * @returns this after modulo.\n\n */\n\n Vector &operator%=(const Vector &rhs) {\n\n static_assert(std::is_integral<T>::value,\n\n \"Modulo operator is defined only for integral types\");\n\n std::transform(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), data_.begin(), std::modulus<T>());\n\n return *this;\n\n }\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":32,"score":166934.0865222719},{"content":" */\n\n friend bool operator>=(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n return lhs >= rhs_vector;\n\n }\n\n\n\n /**\n\n * Addition assignment operator.\n\n *\n\n * @param[in] rhs Vector to add.\n\n * @returns this after addition.\n\n */\n\n Vector &operator+=(const Vector &rhs) {\n\n std::transform(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), data_.begin(), std::plus<T>());\n\n return *this;\n\n }\n\n\n\n /**\n\n * Addition operator.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":33,"score":166934.07992791967},{"content":"\n\n /**\n\n * Multiplication operator.\n\n *\n\n * @param[in] lhs Vector to multiply.\n\n * @param[in] rhs scalar to multiply.\n\n * @returns result of multiplication.\n\n * @overload\n\n */\n\n friend Vector operator*(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n lhs *= rhs_vector;\n\n return lhs;\n\n }\n\n\n\n /**\n\n * Division assignment operator.\n\n *\n\n * @param[in] rhs Vector to divide.\n\n * @returns this after division.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":34,"score":166934.06474827987},{"content":" /**\n\n * Destructor.\n\n */\n\n ~Vector() = default;\n\n\n\n /**\n\n * Copy assignment operator.\n\n */\n\n Vector &operator=(const Vector &) = default;\n\n\n\n /**\n\n * Move assignment operator.\n\n */\n\n Vector &operator=(Vector &&) noexcept = default;\n\n\n\n /**\n\n * Equal operator.\n\n *\n\n * @param[in] rhs Vector to compare against.\n\n * @returns true if all values are equal.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":35,"score":166934.05241271894},{"content":" */\n\n bool operator==(const Vector &rhs) const {\n\n return std::equal(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), rhs.data_.begin() + vector_size);\n\n };\n\n\n\n /**\n\n * Equal operator.\n\n *\n\n * @param[in] lhs scalar to compare.\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all values are equal.\n\n */\n\n friend bool operator==(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n return lhs_vector == rhs;\n\n }\n\n\n\n /**\n\n * Equal operator.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":36,"score":166934.05055030427},{"content":" *\n\n * @param[in] lhs Vector to compare.\n\n * @param[in] rhs scalar to compare.\n\n * @returns true if all values are equal.\n\n */\n\n friend bool operator==(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n return lhs == rhs_vector;\n\n }\n\n\n\n /**\n\n * Not equal operator.\n\n *\n\n * @param[in] rhs Vector to compare against.\n\n * @returns true if any value is not equal.\n\n */\n\n bool operator!=(const Vector &rhs) const { return !(*this == rhs); };\n\n\n\n /**\n\n * Not equal operator.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":37,"score":166934.03135241033},{"content":" *\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are greater than rhs values.\n\n */\n\n bool operator>(const Vector &rhs) const {\n\n return std::equal(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\n\n [](T a, T b) -> bool { return a > b; });\n\n };\n\n\n\n /**\n\n * Greater than operator.\n\n *\n\n * @param[in] lhs scalar to compare.\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are greater than rhs values.\n\n */\n\n friend bool operator>(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n return lhs_vector > rhs;\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":38,"score":166934.0343734522},{"content":" *\n\n * @param[in] lhs Vector to compare.\n\n * @param[in] rhs scalar to compare.\n\n * @returns true if all lhs values are less than or equal to rhs values.\n\n */\n\n friend bool operator<=(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n return lhs <= rhs_vector;\n\n }\n\n\n\n /**\n\n * Greater than or equal operator.\n\n *\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are greater than or equal to rhs values.\n\n */\n\n bool operator>=(const Vector &rhs) const {\n\n return std::equal(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\n\n [](T a, T b) -> bool { return a >= b; });\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":39,"score":166934.01889211228},{"content":"\n\n /**\n\n * Modulo operator.\n\n *\n\n * @param[in] lhs Vector to module.\n\n * @param[in] rhs Vector to module.\n\n * @returns result of module.\n\n */\n\n friend Vector operator%(Vector lhs, const Vector &rhs) {\n\n lhs %= rhs;\n\n return lhs;\n\n }\n\n\n\n /**\n\n * Modulo operator.\n\n *\n\n * @param[in] lhs scalar to modulo.\n\n * @param[in] rhs Vector to modulo.\n\n * @returns result of modulo.\n\n * @overload\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":40,"score":166934.01363257275},{"content":" bool operator<=(const Vector &rhs) const {\n\n return std::equal(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\n\n [](T a, T b) -> bool { return a <= b; });\n\n };\n\n\n\n /**\n\n * Less than or equal operator.\n\n *\n\n * @param[in] lhs scalar to compare.\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are less than or equal to rhs values.\n\n */\n\n friend bool operator<=(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n return lhs_vector <= rhs;\n\n }\n\n\n\n /**\n\n * Less than or equal operator.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":41,"score":166933.99833720032},{"content":" Vector output(*this);\n\n --(*this);\n\n return output;\n\n }\n\n\n\n /**\n\n * Size of vector.\n\n *\n\n * @returns number of elements in vector.\n\n */\n\n int size() const { return N; }\n\n\n\n /**\n\n * Get element from vector.\n\n *\n\n * @param[in] index index of an element to return.\n\n * @returns vector element.\n\n */\n\n T &operator[](int index) {\n\n if (index < N) {\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":42,"score":166933.961566185},{"content":"\n\n /**\n\n * Pre-increment operator.\n\n *\n\n * @returns this after increment operation.\n\n */\n\n Vector &operator++() {\n\n std::for_each(data_.begin(), data_.begin() + vector_size,\n\n [](T &a) { ++a; });\n\n return *this;\n\n }\n\n\n\n /**\n\n * Post-increment operator.\n\n *\n\n * @returns Vector after increment operation.\n\n */\n\n Vector operator++(int) {\n\n Vector output(*this);\n\n ++(*this);\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":43,"score":166933.961566185},{"content":" }\n\n\n\n /**\n\n * Unary minus operator.\n\n *\n\n * @param[in] lhs Vector to negate.\n\n * @returns result of negation.\n\n */\n\n friend Vector operator-(const Vector &lhs) {\n\n Vector v(lhs);\n\n std::transform(v.data_.begin(), v.data_.begin() + v.vector_size,\n\n v.data_.begin(), std::negate<T>());\n\n return v;\n\n }\n\n\n\n /**\n\n * Subtraction operator.\n\n *\n\n * @param[in] lhs scalar to subtract.\n\n * @param[in] rhs Vector to subtract.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":44,"score":166933.96011787295},{"content":" return lhs;\n\n }\n\n\n\n /**\n\n * Multiplication assignment operator.\n\n *\n\n * @param[in] rhs Vector to multiply.\n\n * @returns this after multiplication.\n\n */\n\n Vector &operator*=(const Vector &rhs) {\n\n std::transform(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), data_.begin(), std::multiplies<T>());\n\n return *this;\n\n }\n\n\n\n /**\n\n * Multiplication operator.\n\n *\n\n * @param[in] lhs Vector to multiply.\n\n * @param[in] rhs Vector to multiply.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":45,"score":166933.96011787295},{"content":" }\n\n\n\n /**\n\n * Greater than operator.\n\n *\n\n * @param[in] lhs Vector to compare.\n\n * @param[in] rhs scalar to compare.\n\n * @returns true if all lhs values are greater than rhs values.\n\n */\n\n friend bool operator>(Vector lhs, const T &rhs) {\n\n Vector rhs_vector(rhs);\n\n return lhs > rhs_vector;\n\n }\n\n\n\n /**\n\n * Less than or equal operator.\n\n *\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are less than or equal to rhs values.\n\n */\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":46,"score":166933.92243724788},{"content":" };\n\n\n\n /**\n\n * Greater than or equal operator.\n\n *\n\n * @param[in] lhs scalar to compare.\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are greater than or equal to rhs values.\n\n */\n\n friend bool operator>=(const T &lhs, const Vector &rhs) {\n\n Vector lhs_vector(lhs);\n\n return lhs_vector >= rhs;\n\n }\n\n\n\n /**\n\n * Greater than or equal operator.\n\n *\n\n * @param[in] lhs Vector to compare.\n\n * @param[in] rhs scalar to compare.\n\n * @returns true if all lhs values are greater than or equal to rhs values.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":47,"score":166933.8778063828},{"content":" throw VectorAccessViolationException(index, N);\n\n }\n\n\n\n /**\n\n * Vector type.\n\n */\n\n using value_type = T;\n\n\n\n /**\n\n * Compile-time vector size.\n\n */\n\n constexpr static int vector_size = N;\n\n\n\n /**\n\n * Compile-time size in memory.\n\n */\n\n constexpr static int size_in_memory = SIZE_IN_MEMORY;\n\n\n\n /**\n\n * Metadata needed to distinguish vector-like data types.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":48,"score":166933.85419425942},{"content":" return output;\n\n }\n\n\n\n /**\n\n * Pre-decrement operator.\n\n *\n\n * @returns this after decrement operation.\n\n */\n\n Vector &operator--() {\n\n std::for_each(data_.begin(), data_.begin() + vector_size,\n\n [](T &a) { --a; });\n\n return *this;\n\n }\n\n\n\n /**\n\n * Post-decrement operator.\n\n *\n\n * @returns Vector after decrement operation.\n\n */\n\n Vector operator--(int) {\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":49,"score":166933.82999910502},{"content":" }\n\n\n\n /**\n\n * Less than operator.\n\n *\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are less than rhs values.\n\n */\n\n bool operator<(const Vector &rhs) const {\n\n return std::equal(data_.begin(), data_.begin() + vector_size,\n\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\n\n [](T a, T b) -> bool { return a < b; });\n\n };\n\n\n\n /**\n\n * Less than operator.\n\n *\n\n * @param[in] lhs scalar to compare.\n\n * @param[in] rhs Vector to compare.\n\n * @returns true if all lhs values are less than rhs values.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":50,"score":166933.74189607476},{"content":" return data_[index];\n\n }\n\n throw VectorAccessViolationException(index, N);\n\n }\n\n\n\n /**\n\n * Get iterator of a vector beginning.\n\n *\n\n */\n\n constexpr auto begin() const { return data_.begin(); }\n\n\n\n /**\n\n * Get const element from vector.\n\n *\n\n * @overload\n\n */\n\n const T &operator[](int index) const {\n\n if (index < N) {\n\n return data_[index];\n\n }\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":51,"score":166933.5552188118},{"content":"\n\n/**\n\n * Metafunction to enable a function declaration if T is floating point.\n\n *\n\n * @tparam T type.\n\n */\n\ntemplate <typename T>\n\nusing EnableIfIsFloatingPoint =\n\n std::enable_if_t<std::is_floating_point<T>::value, int>;\n\n\n\n/**\n\n * Meta class for scalar types.\n\n *\n\n * @tparam T scalar type.\n\n */\n\ntemplate <typename T, typename ENABLE = void> struct ScalarType {\n\n /**\n\n * Scalar type.\n\n */\n\n using value = T;\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":52,"score":166933.19875974176},{"content":"class VectorAccessViolationException : public std::logic_error {\n\npublic:\n\n /**\n\n * Construct exception with preformatted error message.\n\n *\n\n * @param[in] index accessed index.\n\n * @param[in] size size of vector.\n\n */\n\n VectorAccessViolationException(int index, int size)\n\n : std::logic_error(error_message(index, size)) {}\n\n\n\nprivate:\n\n std::string static error_message(int index, int size);\n\n};\n\n\n\n/**\n\n * Static vector implementation.\n\n *\n\n * @tparam T the type of vector elements.\n\n * @tparam N the number of vector elements.\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":53,"score":155994.40382709014},{"content":"class VectorBadNumberOfElementsException : public std::logic_error {\n\npublic:\n\n /**\n\n * Construct exception with preformatted error message.\n\n *\n\n * @param[in] source source of the invalid number of elements.\n\n * @param[in] expected expected number of elements.\n\n * @param[in] actual actual number of elements.\n\n */\n\n VectorBadNumberOfElementsException(const std::string &source, int expected,\n\n int actual)\n\n : std::logic_error(error_message(source, expected, actual)) {}\n\n\n\nprivate:\n\n std::string static error_message(const std::string &source, int expected,\n\n int actual);\n\n};\n\n\n\n/**\n\n * Exception class used when a trying to access element at index greater or\n\n * equal vector size\n\n */\n","file_path":"src/core/vector/include/cassian/vector/vector.hpp","rank":54,"score":154493.97667164032},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_RUNTIME_RUNTIME_HPP\n\n#define CASSIAN_RUNTIME_RUNTIME_HPP\n\n\n\n#include <algorithm>\n\n#include <array>\n\n#include <cstddef>\n\n#include <cstdint>\n\n#include <optional>\n\n#include <sstream>\n\n#include <stdexcept>\n\n#include <string>\n\n#include <type_traits>\n\n#include <vector>\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":55,"score":100806.0195040686},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_REFERENCE_DP4A_HPP\n\n#define CASSIAN_REFERENCE_DP4A_HPP\n\n\n\n#include <cstddef>\n\n#include <cstdint>\n\n#include <vector>\n\n\n\n#include <cassian/vector/vector.hpp>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n","file_path":"src/core/reference/include/cassian/reference/dp4a.hpp","rank":56,"score":100804.57742784992},{"content":"namespace fs = std::filesystem;\n\n#endif\n\n#include <stdexcept>\n\n#include <string>\n\n#include <type_traits>\n\n#include <vector>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Load text file.\n\n *\n\n * @param[in] file_path path to a file to read.\n\n * @returns text read from a file.\n\n */\n\nstd::string load_text_file(const std::string &file_path);\n\n\n","file_path":"src/core/utility/include/cassian/utility/utility.hpp","rank":57,"score":100803.75127398015},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_UTILITY_MATH_HPP\n\n#define CASSIAN_UTILITY_MATH_HPP\n\n\n\n#include <cassian/vector/vector.hpp>\n\n#include <cmath>\n\n#include <limits>\n\n#include <numeric>\n\n\n\nnamespace cassian {\n\n\n\n/**\n\n * Computes dot product of two vectors\n\n * @param[in] a input vector.\n","file_path":"src/core/utility/include/cassian/utility/math.hpp","rank":58,"score":100803.15971931555},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_UTILITY_UTILITY_HPP\n\n#define CASSIAN_UTILITY_UTILITY_HPP\n\n\n\n#include <cassert>\n\n#include <cassian/vector/vector.hpp>\n\n#include <cstddef>\n\n#include <cstdint>\n\n#include <cstring>\n\n#ifdef CASSIAN_OLD_GNU\n\n#include <experimental/filesystem>\n\nnamespace fs = std::experimental::filesystem;\n\n#else\n\n#include <filesystem>\n","file_path":"src/core/utility/include/cassian/utility/utility.hpp","rank":59,"score":100802.32962385922},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_RUNTIME_FACTORY_HPP\n\n#define CASSIAN_RUNTIME_FACTORY_HPP\n\n\n\n#include <cassian/cli/cli.hpp>\n\n#include <cassian/runtime/runtime.hpp>\n\n#include <memory>\n\n#include <stdexcept>\n\n#include <string>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n","file_path":"src/core/runtime/include/cassian/runtime/factory.hpp","rank":60,"score":100798.47965417188},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_RANDOM_RANDOM_HPP\n\n#define CASSIAN_RANDOM_RANDOM_HPP\n\n\n\n#include <algorithm>\n\n#include <cstdint>\n\n#include <limits>\n\n#include <random>\n\n#include <vector>\n\n\n\n#include <cassian/fp_types/bfloat.hpp>\n\n#include <cassian/fp_types/half.hpp>\n\n#include <cassian/fp_types/tfloat.hpp>\n\n#include <cassian/vector/vector.hpp>\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":61,"score":100798.43023412861},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_SYSTEM_FACTORY_HPP\n\n#define CASSIAN_SYSTEM_FACTORY_HPP\n\n\n\n#include <cassian/system/library.hpp>\n\n#include <memory>\n\n#include <string>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n","file_path":"src/core/system/include/cassian/system/factory.hpp","rank":62,"score":100798.36726740938},{"content":"/**\n\n * Compute dp4a reference from regular elements.\n\n *\n\n * This function implements algorithm for computing `dot(a, b) + c`.\n\n *\n\n * @tparam A_TYPE the type of input_a.\n\n * @tparam B_TYPE the type of input_b.\n\n * @param[in] input_a a operand.\n\n * @param[in] input_b b operand.\n\n * @param[in] input_c c operand.\n\n * @returns `dot(a, b) + c`.\n\n */\n\ntemplate <typename A_TYPE, typename B_TYPE>\n\nstd::vector<int32_t> dp4a(const std::vector<A_TYPE> &input_a,\n\n const std::vector<B_TYPE> &input_b,\n\n const std::vector<int32_t> &input_c);\n\n\n\n} // namespace cassian\n\n#endif\n","file_path":"src/core/reference/include/cassian/reference/dp4a.hpp","rank":63,"score":100798.32493640191},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_MAIN_CONFIG_HPP\n\n#define CASSIAN_MAIN_CONFIG_HPP\n\n\n\n#include <memory>\n\n#include <string>\n\n\n\n#include <cassian/cli/cli.hpp>\n\n#include <cassian/runtime/runtime.hpp>\n\n\n\nnamespace cassian {\n\nnamespace test {\n\n\n","file_path":"src/core/main/include/cassian/main/config.hpp","rank":64,"score":100798.30855255334},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_IMAGE_IMAGE_HPP\n\n#define CASSIAN_IMAGE_IMAGE_HPP\n\n\n\n#include <stdexcept>\n\n#include <vector>\n\n\n\n#include <cassian/random/random.hpp>\n\n#include <cassian/runtime/image_properties.hpp>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n","file_path":"src/core/image/include/cassian/image/image.hpp","rank":65,"score":100798.13011673458},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_UTILITY_VERSION_HPP\n\n#define CASSIAN_UTILITY_VERSION_HPP\n\n\n\n#include <string>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Get version string.\n\n *\n","file_path":"src/core/utility/include/cassian/utility/version.hpp","rank":66,"score":100798.03131427511},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_CLI_CLI_HPP\n\n#define CASSIAN_CLI_CLI_HPP\n\n\n\n#include <string>\n\n#include <unordered_map>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Class for parsing command line arguments.\n\n */\n","file_path":"src/core/cli/include/cassian/cli/cli.hpp","rank":67,"score":100797.684740332},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_SYSTEM_LIBRARY_HPP\n\n#define CASSIAN_SYSTEM_LIBRARY_HPP\n\n\n\n#include <stdexcept>\n\n#include <string>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Interface for a system specific, shared library management.\n\n */\n","file_path":"src/core/system/include/cassian/system/library.hpp","rank":68,"score":100797.684740332},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_RUNTIME_FEATURE_HPP\n\n#define CASSIAN_RUNTIME_FEATURE_HPP\n\n\n\n#include <string>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Runtime features.\n\n */\n","file_path":"src/core/runtime/include/cassian/runtime/feature.hpp","rank":69,"score":100797.11882682968},{"content":" * Returned value of an argument.\n\n *\n\n * @tparam T the type of returned argument value.\n\n * @param[in] name argument name.\n\n * @returns argument value.\n\n * @note T must define a constructor accepting std::string.\n\n */\n\n template <typename T> T get(const std::string &name) const;\n\n\n\nprivate:\n\n std::unordered_map<std::string, std::string> arguments_;\n\n};\n\n\n\ntemplate <typename T> T CommandLineParser::get(const std::string &name) const {\n\n return T(arguments_.at(name));\n\n}\n\n\n\n} // namespace cassian\n\n#endif\n","file_path":"src/core/cli/include/cassian/cli/cli.hpp","rank":70,"score":100795.15433907293},{"content":"\n\n#include <cassian/fp_types/bfloat.hpp>\n\n#include <cassian/fp_types/half.hpp>\n\n#include <cassian/fp_types/tfloat.hpp>\n\n#include <cassian/runtime/access_qualifier.hpp>\n\n#include <cassian/runtime/device_properties.hpp>\n\n#include <cassian/runtime/feature.hpp>\n\n#include <cassian/runtime/image_properties.hpp>\n\n#include <cassian/runtime/program_descriptor.hpp>\n\n#include <cassian/runtime/sampler_properties.hpp>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * API agnostic representation of a compute buffer.\n\n */\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":71,"score":100793.85397939649},{"content":"/**\n\n * Generate random Vector value.\n\n *\n\n * @overload\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\n\nT generate_value(const int seed) {\n\n using scalar_type = scalar_type_v<T>;\n\n const scalar_type min = std::numeric_limits<scalar_type>::min();\n\n const scalar_type max = std::numeric_limits<scalar_type>::max();\n\n return generate_value<T>(min, max, seed);\n\n}\n\n\n\n/**\n\n * Generate vector of random scalar values in range [min, max].\n\n *\n\n * @param[in] size Number of values to generate.\n\n * @param[in] min Minimum value.\n\n * @param[in] max Maximum value.\n\n * @param[in] seed Random seed.\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":72,"score":100793.25293631869},{"content":" return output;\n\n}\n\n\n\n/**\n\n * Unpack a vector into smaller data type. Overload when unpacking from\n\n * cassian::Vector\n\n *\n\n * @overload\n\n */\n\ntemplate <typename OUTPUT_TYPE, typename VALUE_TYPE, int N, int SIZE_IN_MEMORY>\n\nstd::vector<OUTPUT_TYPE>\n\nunpack_vector(const std::vector<Vector<VALUE_TYPE, N, SIZE_IN_MEMORY>> &input,\n\n const int step = 1) {\n\n static_assert(std::is_same<OUTPUT_TYPE, VALUE_TYPE>::value,\n\n \"When unpacking ca::Vector OUTPUT_TYPE needs to be same as \"\n\n \"VECTOR::value_type\");\n\n assert(step > 0);\n\n\n\n std::vector<VALUE_TYPE> output(input.size() * N);\n\n\n","file_path":"src/core/utility/include/cassian/utility/utility.hpp","rank":73,"score":100793.21905366905},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_LOGGING_LOGGING_HPP\n\n#define CASSIAN_LOGGING_LOGGING_HPP\n\n\n\n#include <iostream>\n\n\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Namespace for logging related functions.\n\n */\n\nnamespace logging {\n\n\n\n/**\n\n * Class implementing logging capabilities.\n\n */\n","file_path":"src/core/logging/include/cassian/logging/logging.hpp","rank":74,"score":100792.51345007909},{"content":" * @returns version string.\n\n */\n\nstd::string get_version();\n\n\n\n/**\n\n * Print version string.\n\n */\n\nvoid print_version();\n\n\n\n} // namespace cassian\n\n#endif\n","file_path":"src/core/utility/include/cassian/utility/version.hpp","rank":75,"score":100791.74177711915},{"content":"/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_UTILITY_METAPROGRAMMING_HPP\n\n#define CASSIAN_UTILITY_METAPROGRAMMING_HPP\n\n\n\n#include <tuple>\n\n#include <type_traits>\n\n\n\nnamespace cassian {\n\n\n\n/**\n\n * Iterates over @c std::integer_sequence.\n\n * Example usage:\n\n * @code{.cpp}\n\n * static_for(std::index_sequence<2, 3, 4, 8, 16>{}, [&](auto i) {\n","file_path":"src/core/utility/include/cassian/utility/metaprogramming.hpp","rank":76,"score":100791.36262301511},{"content":"std::vector<T> generate_vector(const int size, const int seed) {\n\n std::vector<T> data(size);\n\n std::generate(data.begin(), data.end(),\n\n [&] { return generate_value<T>(seed); });\n\n return data;\n\n}\n\n\n\n} // namespace cassian\n\n\n\n#endif\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":77,"score":100790.58649847076},{"content":"\n\n return data_[index];\n\n }\n\n\n\nprivate:\n\n const ImageDimensions dimensions_;\n\n std::vector<pixel_type> data_;\n\n};\n\n\n\n} // namespace cassian\n\n#endif\n","file_path":"src/core/image/include/cassian/image/image.hpp","rank":78,"score":100790.39465897255},{"content":" * @param[in] str string to convert.\n\n * @returns converted string.\n\n */\n\nstd::string convert_to_forward_slashes(const std::string &str);\n\n\n\n/**\n\n * Convert typed-value to string. Switches between arithmetic std and\n\n * cassian to_string function\n\n *\n\n * @tparam T the type to log.\n\n * @param[in] value typed value to convert.\n\n * @returns string returned from another to_string function.\n\n */\n\ntemplate <typename T> std::string to_string(const T &value) {\n\n if constexpr (std::is_arithmetic_v<T>) {\n\n return std::to_string(value);\n\n } else {\n\n return to_string(value);\n\n }\n\n}\n","file_path":"src/core/utility/include/cassian/utility/utility.hpp","rank":79,"score":100790.26535298128},{"content":" std::memcpy(&output[output_offset], tmp.data(), sizeof(OUTPUT_TYPE));\n\n }\n\n }\n\n\n\n return output;\n\n}\n\n\n\n/**\n\n * Pack a vector into larger data type. Overload when packing into\n\n * cassian::Vector\n\n *\n\n * @overload\n\n */\n\ntemplate <typename VECTOR>\n\nstd::vector<Vector<typename VECTOR::value_type, VECTOR::vector_size,\n\n VECTOR::size_in_memory>>\n\npack_vector(const std::vector<typename VECTOR::value_type> &input,\n\n int step = 1) {\n\n assert(step > 0);\n\n\n","file_path":"src/core/utility/include/cassian/utility/utility.hpp","rank":80,"score":100790.04538231212},{"content":" * @tparam T type of generated values.\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\n\nstd::vector<T> generate_vector(const int size, const scalar_type_v<T> min,\n\n const scalar_type_v<T> max, const int seed) {\n\n std::vector<T> data(size);\n\n std::generate(data.begin(), data.end(),\n\n [&] { return generate_value<T>(min, max, seed); });\n\n return data;\n\n}\n\n\n\n/**\n\n * Generate vector of random values.\n\n *\n\n * @param[in] size Number of values to generate.\n\n * @param[in] seed Random seed.\n\n * @returns vector of generated values.\n\n * @tparam T type of generated value.\n\n */\n\ntemplate <typename T>\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":81,"score":100789.99909380506},{"content":"\n\n/**\n\n * Cassian namespace.\n\n */\n\nnamespace cassian {\n\n\n\n/**\n\n * Generate random scalar value in range [min, max].\n\n *\n\n * @param[in] min Minimum value.\n\n * @param[in] max Maximum value.\n\n * @param[in] seed Random seed.\n\n * @returns generated value.\n\n * @tparam T type of generated value.\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\n\nT generate_value(const T min, const T max, const int seed) {\n\n static std::default_random_engine engine(seed);\n\n std::uniform_int_distribution<T> distribution(min, max);\n\n return distribution(engine);\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":82,"score":100789.97936268209},{"content":" *\n\n * @param[in] sampler sampler to release.\n\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\n\n * error.\n\n * @note After releasing, sampler must not be used anymore.\n\n * @note Sampler must not be in use when calling this function.\n\n */\n\n virtual void release_sampler(const Sampler &sampler) = 0;\n\n\n\n /**\n\n * Read buffer to std::vector.\n\n *\n\n * @tparam T std::vector type.\n\n * @param[in] buffer buffer to read.\n\n * @returns std::vector with read buffer data.\n\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\n\n * error.\n\n */\n\n template <typename T>\n\n std::vector<T> read_buffer_to_vector(const Buffer &buffer);\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":83,"score":100789.96562789287},{"content":" *\n\n * @overload\n\n */\n\ntemplate <>\n\nhalf generate_value<half>(const half min, const half max, const int seed);\n\n\n\n/**\n\n * Generate random value.\n\n *\n\n * @param[in] seed Random seed.\n\n * @returns generated value.\n\n * @tparam T type of generated value.\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\n\nT generate_value(const int seed) {\n\n const T min = std::numeric_limits<T>::min();\n\n const T max = std::numeric_limits<T>::max();\n\n return generate_value(min, max, seed);\n\n}\n\n\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":84,"score":100789.78572421057},{"content":" ~FinalAction() { act(); }\n\n\n\nprivate:\n\n A act;\n\n};\n\n\n\n/**\n\n * Creates FinalAction object instance\n\n *\n\n * @tparam A type for callable object\n\n * @param[in] act callable object\n\n */\n\ntemplate <typename A> FinalAction<A> finally(A act) {\n\n return FinalAction<A>{act};\n\n}\n\n\n\n} // namespace cassian\n\n#endif\n","file_path":"src/core/utility/include/cassian/utility/utility.hpp","rank":85,"score":100789.62743632834},{"content":" * Load shared library.\n\n *\n\n * Library name must contain all system specific parts like:\n\n * - `lib` prefix;\n\n * - `.dll`/`.so` suffix;\n\n *\n\n * @param[in] name library name.\n\n * @returns pointer to an object implementing cassian::Library interface.\n\n * @throws cassian::LibraryNotFoundException Thrown if `name` library is not\n\n * found in the system.\n\n * @note library is unloaded when pointer is freed.\n\n */\n\nstd::unique_ptr<Library> load_library(const std::string &name);\n\n\n\n} // namespace cassian\n\n#endif\n","file_path":"src/core/system/include/cassian/system/factory.hpp","rank":86,"score":100789.5759840341},{"content":" * as `a` but with a length of 1.\n\n * @param[in] a input vector.\n\n * @returns vector.\n\n */\n\ntemplate <typename T, EnableIfIsVector<T> = 0> T normalize(const T &a) {\n\n using scalar_type = scalar_type_v<T>;\n\n for (auto i = 0; i < T::vector_size; i++) {\n\n if (std::isnan(a[i])) {\n\n return T(std::numeric_limits<scalar_type>::quiet_NaN());\n\n }\n\n }\n\n T result = a;\n\n if (std::find_if(a.begin(), a.begin() + T::vector_size,\n\n [](const scalar_type &val) { return std::isinf(val); }) !=\n\n a.begin() + T::vector_size) {\n\n for (size_t i = 0; i < T::vector_size; i++) {\n\n result[i] = std::isinf(a[i]) ? std::copysign(1.0, a[i]) : 0.0 * a[i];\n\n }\n\n }\n\n long double norm = 0.0;\n","file_path":"src/core/utility/include/cassian/utility/math.hpp","rank":87,"score":100789.21355825446},{"content":"\n\n /**\n\n * Write buffer from std::vector.\n\n *\n\n * @tparam T std::vector type.\n\n * @param[in] buffer buffer to write.\n\n * @param[in] data vector with data to write.\n\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\n\n * error.\n\n */\n\n template <typename T>\n\n void write_buffer_from_vector(const Buffer &buffer,\n\n const std::vector<T> &data);\n\n\n\n /**\n\n * Create kernel.\n\n *\n\n * @param[in] kernel_name kernel name.\n\n * @param[in] source kernel source code.\n\n * @param[in] build_options build options to use during kernel construction.\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":88,"score":100789.15311274845},{"content":" * @returns vector of generated values.\n\n * @tparam T type of generated values.\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\n\nstd::vector<T> generate_vector(const int size, const T min, const T max,\n\n const int seed) {\n\n std::vector<T> data(size);\n\n std::generate(data.begin(), data.end(),\n\n [&] { return generate_value<T>(min, max, seed); });\n\n return data;\n\n}\n\n\n\n/**\n\n * Generate vector of random Vector values in range [min, max].\n\n *\n\n * @param[in] size Number of values to generate.\n\n * @param[in] min Minimum scalar value.\n\n * @param[in] max Maximum scalar value.\n\n * @param[in] seed Random seed.\n\n * @returns vector of generated values.\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":89,"score":100788.69283376618},{"content":" for (size_t i = 0; i < T::vector_size; i++) {\n\n norm += static_cast<long double>(result[i]) *\n\n static_cast<long double>(result[i]);\n\n }\n\n if (norm == 0.0) {\n\n return result;\n\n }\n\n norm = std::sqrt(norm);\n\n for (size_t i = 0; i < T::vector_size; i++) {\n\n result[i] /= norm;\n\n }\n\n return result;\n\n}\n\n\n\ntemplate <typename T, EnableIfIsScalar<T> = 0> T normalize(const T &a) {\n\n if (std::isnan(a)) {\n\n return std::numeric_limits<T>::quiet_NaN();\n\n }\n\n if (std::isinf(a)) {\n\n T result = std::isinf(a) ? std::copysign(1.0, a) : 0.0 * a;\n","file_path":"src/core/utility/include/cassian/utility/math.hpp","rank":90,"score":100788.53445619083},{"content":" * @param[in] file_path path to output file.\n\n */\n\nvoid save_binary_file(const std::vector<uint8_t> &data,\n\n const std::string &file_path);\n\n\n\n/**\n\n * Combine bytes from multiple elements into single, larger element.\n\n *\n\n * @tparam IN input data type.\n\n * @tparam OUT output data type.\n\n * @param[in] input elements to combine.\n\n * @returns combined elements.\n\n */\n\ntemplate <typename OUT, typename IN>\n\nOUT combine_bytes(const std::vector<IN> &input) {\n\n const size_t bits = 8;\n\n OUT output = 0;\n\n for (size_t i = 0; i < input.size(); ++i) {\n\n output |= uint8_t(input[i]) << (i * bits);\n\n }\n","file_path":"src/core/utility/include/cassian/utility/utility.hpp","rank":91,"score":100788.34738103059},{"content":" */\n\n virtual Kernel create_kernel_from_multiple_programs(\n\n const std::string &kernel_name,\n\n const std::vector<ProgramDescriptor> &program_descriptors,\n\n const std::string &linker_options = \"\") = 0;\n\n\n\n /**\n\n * Set buffer as kernel argument.\n\n *\n\n * @param[in] kernel kernel to use.\n\n * @param[in] argument_index argument index.\n\n * @param[in] buffer buffer to set as kernel argument.\n\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\n\n * error.\n\n */\n\n virtual void set_kernel_argument(const Kernel &kernel, int argument_index,\n\n const Buffer &buffer) = 0;\n\n\n\n /**\n\n * Set image as kernel argument.\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":92,"score":100787.97639045578},{"content":" return value;\n\n}\n\n\n\n/**\n\n * Generate random Vector value in range [min, max]. If specialization\n\n * is floating point the range is [min, max). Use std::nextafter as max\n\n * parameter to close interval.\n\n *\n\n * @param[in] min Minimum scalar value.\n\n * @param[in] max Maximum scalar value.\n\n * @param[in] seed Random seed.\n\n * @returns generated value.\n\n * @tparam T type of generated value.\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\n\nT generate_value(const scalar_type_v<T> min, const scalar_type_v<T> max,\n\n const int seed) {\n\n using scalar_type = scalar_type_v<T>;\n\n std::vector<scalar_type> data(T::vector_size);\n\n std::generate(data.begin(), data.end(),\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":93,"score":100787.96450849103},{"content":" [&] { return generate_value<scalar_type>(min, max, seed); });\n\n return T(data);\n\n}\n\n\n\n/**\n\n * Generate random Vector value in range [min, max] \\ except. If specialization\n\n * is floating point the range is [min, max) \\ except. Use std::nextafter as max\n\n * parameter to close interval.\n\n *\n\n * @param[in] min Minimum scalar value.\n\n * @param[in] max Maximum scalar value.\n\n * @param[in] seed Random seed.\n\n * @param[in] except except values vector.\n\n * @returns generated value.\n\n * @tparam T type of generated value.\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\n\nT generate_value(const scalar_type_v<T> min, const scalar_type_v<T> max,\n\n const int seed, const std::vector<scalar_type_v<T>> &except) {\n\n T generated_value;\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":94,"score":100787.76915667873},{"content":"}\n\n\n\n/**\n\n * Generate random scalar value in range [min, max] \\ except.\n\n *\n\n * @param[in] min Minimum value.\n\n * @param[in] max Maximum value.\n\n * @param[in] seed Random seed.\n\n * @param[in] except except values vector.\n\n * @returns generated value.\n\n * @tparam T type of generated value.\n\n */\n\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\n\nT generate_value(const T min, const T max, const int seed,\n\n const std::vector<T> &except) {\n\n auto value = generate_value(min, max, seed);\n\n while (!except.empty() &&\n\n std::find(except.begin(), except.end(), value) != except.end()) {\n\n value = generate_value(min, max, seed);\n\n }\n","file_path":"src/core/random/include/cassian/random/random.hpp","rank":95,"score":100787.37194119932},{"content":"/**\n\n * Specialization for Tfloat.\n\n */\n\ntemplate <>\n\nstd::vector<Tfloat>\n\nRuntime::read_buffer_to_vector<Tfloat>(const Buffer &buffer);\n\n\n\ntemplate <typename T>\n\nvoid Runtime::write_buffer_from_vector(const Buffer &buffer,\n\n const std::vector<T> &data) {\n\n write_buffer(buffer, data.data());\n\n}\n\n\n\n/**\n\n * Specialization for Bfloat.\n\n */\n\ntemplate <>\n\nvoid Runtime::write_buffer_from_vector<Bfloat>(const Buffer &buffer,\n\n const std::vector<Bfloat> &data);\n\n\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":96,"score":100787.03498348579},{"content":" * Vector<int, i.value> v();\n\n * })\n\n * @endcode\n\n *\n\n * @param[in] seq std::integer_sequence of numbers to iterate through\n\n * @param[in] func Lambda function containing loop body. It should take\n\n * one parameter. Compile-time constant integer is\n\n * accessible using std::integral_constant::value member.\n\n */\n\ntemplate <typename F, typename T, T... ints>\n\nvoid static_for(std::integer_sequence<T, ints...> seq, F func) {\n\n (void)seq;\n\n (func(std::integral_constant<T, ints>{}), ...);\n\n}\n\n\n\nnamespace detail {\n\n\n\n/**\n\n * Helper struct for CartesianProduct.\n\n * Creates @c std::tuple containing tuples with first type = T, and second type\n","file_path":"src/core/utility/include/cassian/utility/metaprogramming.hpp","rank":97,"score":100786.6999581161},{"content":"/**\n\n * Specialization for Half.\n\n */\n\ntemplate <>\n\nvoid Runtime::write_buffer_from_vector<Half>(const Buffer &buffer,\n\n const std::vector<Half> &data);\n\n\n\n/**\n\n * Specialization for Tfloat.\n\n */\n\ntemplate <>\n\nvoid Runtime::write_buffer_from_vector<Tfloat>(const Buffer &buffer,\n\n const std::vector<Tfloat> &data);\n\n\n\n/**\n\n * Exception class used when a runtime encounters a fatal error.\n\n */\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":98,"score":100786.52986241228},{"content":"std::vector<T> Runtime::read_buffer_to_vector(const Buffer &buffer) {\n\n const size_t elements = buffer.size / sizeof(T);\n\n std::vector<T> output(elements);\n\n read_buffer(buffer, output.data());\n\n return output;\n\n}\n\n\n\n/**\n\n * Specialization for Bfloat.\n\n */\n\ntemplate <>\n\nstd::vector<Bfloat>\n\nRuntime::read_buffer_to_vector<Bfloat>(const Buffer &buffer);\n\n\n\n/**\n\n * Specialization for Half.\n\n */\n\ntemplate <>\n\nstd::vector<Half> Runtime::read_buffer_to_vector<Half>(const Buffer &buffer);\n\n\n","file_path":"src/core/runtime/include/cassian/runtime/runtime.hpp","rank":99,"score":100786.51242202985}],"string":"[\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_VECTOR_VECTOR_HPP\\n\\n#define CASSIAN_VECTOR_VECTOR_HPP\\n\\n\\n\\n#include <algorithm>\\n\\n#include <array>\\n\\n#include <cstddef>\\n\\n#include <functional>\\n\\n#include <initializer_list>\\n\\n#include <sstream>\\n\\n#include <stdexcept>\\n\\n#include <string>\\n\\n#include <type_traits>\\n\\n#include <vector>\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 0,\n \"score\": 166960.65098467225\n },\n {\n \"content\": \" * @tparam TYPE type to extract vector size\\n\\n * @returns 1\\n\\n *\\n\\n */\\n\\ntemplate <typename TYPE,\\n\\n typename std::enable_if_t<std::is_integral_v<TYPE>, int> = 0>\\n\\nint get_vector_size() {\\n\\n return 1;\\n\\n}\\n\\n\\n\\n} // namespace cassian\\n\\n#endif\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 1,\n \"score\": 166948.40119518444\n },\n {\n \"content\": \" * cassian::Vector\\n\\n */\\n\\ntemplate <typename T> using make_signed_t = typename MakeSigned<T>::type;\\n\\n\\n\\n/**\\n\\n * MakeUnsigned works as std::make_unsigned but works with cassian::Vector\\n\\n */\\n\\ntemplate <typename T, typename ENABLE = void> struct MakeUnsigned {\\n\\n /**\\n\\n * Make unsigned\\n\\n */\\n\\n using type = std::make_unsigned_t<T>;\\n\\n};\\n\\n/**\\n\\n * MakeUnsigned works same as std::make_unsigned but works with cassian::Vector\\n\\n */\\n\\ntemplate <typename T> struct MakeUnsigned<T, typename T::is_vector> {\\n\\n /**\\n\\n * Make unsigned\\n\\n */\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 2,\n \"score\": 166945.38432577747\n },\n {\n \"content\": \"\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Exception class used when a Vector can't be constructed with a given number\\n\\n * of elements.\\n\\n */\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 3,\n \"score\": 166945.00528544476\n },\n {\n \"content\": \" */\\n\\n using is_vector = void; // used for template metaprograming\\n\\n\\n\\nprivate:\\n\\n std::array<T, SIZE_IN_MEMORY> data_;\\n\\n};\\n\\n\\n\\n/**\\n\\n * Convert Vector to string representation.\\n\\n *\\n\\n * @param[in] value object to convert.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\\ntemplate <typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nstd::string to_string(const Vector<T, N, SIZE_IN_MEMORY> &value) {\\n\\n std::stringstream ss;\\n\\n ss << \\\"{\\\";\\n\\n for (size_t i = 0; i < value.size(); ++i) {\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 4,\n \"score\": 166944.95296363067\n },\n {\n \"content\": \" * MakeSigned works same as std::make_signed but works with cassian::Vector\\n\\n */\\n\\ntemplate <typename T, typename ENABLE = void> struct MakeSigned {\\n\\n /**\\n\\n * Make signed\\n\\n */\\n\\n using type = std::make_signed_t<T>;\\n\\n};\\n\\n/**\\n\\n * MakeSigned works as std::make_signed but works with cassian::Vector\\n\\n */\\n\\ntemplate <typename T> struct MakeSigned<T, typename T::is_vector> {\\n\\n /**\\n\\n * Make signed\\n\\n */\\n\\n using type = Vector<std::make_signed_t<typename T::value_type>,\\n\\n T::vector_size, T::size_in_memory>;\\n\\n};\\n\\n/**\\n\\n * cassian::make_signed_t works same as std::make_signed_t but it works with\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 5,\n \"score\": 166944.72695455517\n },\n {\n \"content\": \" ss << std::to_string(+value[i]);\\n\\n if (i < value.size() - 1) {\\n\\n ss << \\\", \\\";\\n\\n }\\n\\n }\\n\\n ss << \\\"}\\\";\\n\\n return ss.str();\\n\\n}\\n\\n\\n\\n/**\\n\\n * Append string representation of Vector object to a stream.\\n\\n *\\n\\n * @param[in] os stream to use.\\n\\n * @param[in] value object to convert.\\n\\n * @returns used stream.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\\ntemplate <typename T, int N, int SIZE_IN_MEMORY = N>\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 6,\n \"score\": 166943.41363977443\n },\n {\n \"content\": \" using type = Vector<std::make_unsigned_t<typename T::value_type>,\\n\\n T::vector_size, T::size_in_memory>;\\n\\n};\\n\\n/**\\n\\n * cassian::make_unsigned_t works same as std::make_unsigned_t but it works with\\n\\n * cassian::Vector\\n\\n */\\n\\ntemplate <typename T> using make_unsigned_t = typename MakeUnsigned<T>::type;\\n\\n\\n\\n/**\\n\\n * Apply equal operator on Vectors component-wise.\\n\\n *\\n\\n * @param[in] lhs input a.\\n\\n * @param[in] rhs input b.\\n\\n * @returns output.\\n\\n * @tparam OUTPUT_TYPE the type of output.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 7,\n \"score\": 166943.15368212757\n },\n {\n \"content\": \"std::ostream &operator<<(std::ostream &os,\\n\\n const Vector<T, N, SIZE_IN_MEMORY> &value) {\\n\\n os << to_string(value);\\n\\n return os;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Meta class for vector types.\\n\\n *\\n\\n * @tparam T scalar type.\\n\\n */\\n\\ntemplate <typename T, typename ENABLE = void> struct IsVector {\\n\\n /**\\n\\n * Scalar type.\\n\\n */\\n\\n static const bool value = false;\\n\\n};\\n\\n\\n\\n/**\\n\\n * Meta class for vector types.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 8,\n \"score\": 166943.0519303801\n },\n {\n \"content\": \" * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\\ntemplate <typename T, int N, int SIZE_IN_MEMORY = N> class Vector {\\n\\npublic:\\n\\n /**\\n\\n * Default constructor.\\n\\n */\\n\\n Vector() = default;\\n\\n\\n\\n /**\\n\\n * Construct Vector from std::initializer_list.\\n\\n *\\n\\n * @param[in] list std::initializer_list from which Vector should be\\n\\n * constructed.\\n\\n * @throws cassian::VectorBadNumberOfElementsException Thrown if list has\\n\\n * different number of elements than constructed Vector.\\n\\n */\\n\\n Vector(std::initializer_list<T> list) {\\n\\n const int list_size = static_cast<int>(list.size());\\n\\n if (list_size == N) {\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 9,\n \"score\": 166942.11584807088\n },\n {\n \"content\": \" const T &rhs) {\\n\\n const Vector<T, N, SIZE_IN_MEMORY> vector_rhs(rhs);\\n\\n return not_equal_component_wise<OUTPUT_TYPE>(lhs, vector_rhs);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Apply not operator on a Vector component-wise.\\n\\n *\\n\\n * @param[in] v input.\\n\\n * @returns output.\\n\\n * @tparam OUTPUT_TYPE the type of output.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nOUTPUT_TYPE not_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &v) {\\n\\n using scalar_type = cassian::scalar_type_v<OUTPUT_TYPE>;\\n\\n OUTPUT_TYPE output;\\n\\n for (size_t i = 0; i < output.size(); ++i) {\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 10,\n \"score\": 166941.41842917225\n },\n {\n \"content\": \"template <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nOUTPUT_TYPE equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\\n\\n const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\\n\\n using scalar_type = cassian::scalar_type_v<OUTPUT_TYPE>;\\n\\n OUTPUT_TYPE output;\\n\\n for (size_t i = 0; i < output.size(); ++i) {\\n\\n output[i] = lhs[i] == rhs[i] ? scalar_type(-1) : scalar_type(0);\\n\\n }\\n\\n return output;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Apply equal operator on a Vector and scalar component-wise.\\n\\n *\\n\\n * @param[in] lhs input a.\\n\\n * @param[in] rhs input b.\\n\\n * @returns output.\\n\\n * @tparam OUTPUT_TYPE the type of output.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 11,\n \"score\": 166941.16411715923\n },\n {\n \"content\": \" *\\n\\n * @tparam T vector type.\\n\\n */\\n\\ntemplate <typename T> struct IsVector<T, typename T::is_vector> {\\n\\n /**\\n\\n * Vector type.\\n\\n */\\n\\n static const bool value = true;\\n\\n};\\n\\n\\n\\n/**\\n\\n * Returns true if T is a Vector class.\\n\\n *\\n\\n * @tparam T type.\\n\\n */\\n\\ntemplate <typename T> constexpr bool is_vector_v = IsVector<T>::value;\\n\\n\\n\\n/**\\n\\n * Metafunction to enable a function declaration if T is a Vector.\\n\\n *\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 12,\n \"score\": 166939.78073544125\n },\n {\n \"content\": \" * @tparam T type.\\n\\n */\\n\\ntemplate <typename T>\\n\\nusing EnableIfIsVector = std::enable_if_t<is_vector_v<T>, int>;\\n\\n\\n\\n/**\\n\\n * Metafunction to enable a function declaration if T is a scalar.\\n\\n *\\n\\n * @tparam T type.\\n\\n */\\n\\ntemplate <typename T>\\n\\nusing EnableIfIsScalar = std::enable_if_t<!is_vector_v<T>, int>;\\n\\n\\n\\n/**\\n\\n * Metafunction to enable a function declaration if T is integral.\\n\\n *\\n\\n * @tparam T type.\\n\\n */\\n\\ntemplate <typename T>\\n\\nusing EnableIfIsIntegral = std::enable_if_t<std::is_integral<T>::value, int>;\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 13,\n \"score\": 166939.17002711943\n },\n {\n \"content\": \"};\\n\\n\\n\\n/**\\n\\n * Meta class for scalar types.\\n\\n *\\n\\n * @tparam T vector type.\\n\\n */\\n\\ntemplate <typename T> struct ScalarType<T, typename T::is_vector> {\\n\\n /**\\n\\n * Scalar type.\\n\\n */\\n\\n using value = typename T::value_type;\\n\\n};\\n\\n\\n\\n/**\\n\\n * Scalar type.\\n\\n */\\n\\ntemplate <typename T> using scalar_type_v = typename ScalarType<T>::value;\\n\\n\\n\\n/**\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 14,\n \"score\": 166938.80150212932\n },\n {\n \"content\": \"template <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nOUTPUT_TYPE equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\\n\\n const T &rhs) {\\n\\n const Vector<T, N, SIZE_IN_MEMORY> vector_rhs(rhs);\\n\\n return equal_component_wise<OUTPUT_TYPE>(lhs, vector_rhs);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Apply not equal operator on Vectors component-wise.\\n\\n *\\n\\n * @param[in] lhs input a.\\n\\n * @param[in] rhs input b.\\n\\n * @returns output.\\n\\n * @tparam OUTPUT_TYPE the type of output.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nOUTPUT_TYPE not_equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 15,\n \"score\": 166938.64879483494\n },\n {\n \"content\": \"template <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nOUTPUT_TYPE not_equal_component_wise(const T &lhs,\\n\\n const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\\n\\n const Vector<T, N, SIZE_IN_MEMORY> vector_lhs(lhs);\\n\\n return not_equal_component_wise<OUTPUT_TYPE>(vector_lhs, rhs);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Apply not equal operator on a Vector and scalar component-wise.\\n\\n *\\n\\n * @param[in] lhs input a.\\n\\n * @param[in] rhs input b.\\n\\n * @returns output.\\n\\n * @tparam OUTPUT_TYPE the type of output.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nOUTPUT_TYPE not_equal_component_wise(const Vector<T, N, SIZE_IN_MEMORY> &lhs,\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 16,\n \"score\": 166938.63161674404\n },\n {\n \"content\": \" output[i] = !v[i] ? scalar_type(-1) : scalar_type(0);\\n\\n }\\n\\n return output;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Get vector size. For scalar types return 1.\\n\\n *\\n\\n * @tparam TYPE type to extract vector size\\n\\n * @tparam N disables function when TYPE::vector_size doesn't exist\\n\\n * @returns vector size\\n\\n *\\n\\n */\\n\\ntemplate <typename TYPE, int N = TYPE::vector_size> int get_vector_size() {\\n\\n return N;\\n\\n}\\n\\n\\n\\n/**\\n\\n * @overload for scalar types\\n\\n *\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 17,\n \"score\": 166938.4627463174\n },\n {\n \"content\": \" std::copy(list.begin(), list.end(), data_.begin());\\n\\n } else {\\n\\n throw VectorBadNumberOfElementsException(\\\"initializer list\\\", N,\\n\\n list_size);\\n\\n }\\n\\n }\\n\\n\\n\\n /**\\n\\n * Construct Vector from std::vector.\\n\\n *\\n\\n * @param[in] vector std::vector from which Vector should be constructed.\\n\\n * @throws cassian::VectorBadNumberOfElementsException Thrown if vector has\\n\\n * different number of elements than constructed Vector.\\n\\n */\\n\\n explicit Vector(std::vector<T> vector) {\\n\\n const int vector_size = static_cast<int>(vector.size());\\n\\n if (vector.size() == N) {\\n\\n std::move(vector.begin(), vector.end(), data_.begin());\\n\\n } else {\\n\\n throw VectorBadNumberOfElementsException(\\\"std::vector\\\", N, vector_size);\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 18,\n \"score\": 166938.1847812732\n },\n {\n \"content\": \" const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\\n\\n using scalar_type = cassian::scalar_type_v<OUTPUT_TYPE>;\\n\\n OUTPUT_TYPE output;\\n\\n for (size_t i = 0; i < output.size(); ++i) {\\n\\n output[i] = lhs[i] != rhs[i] ? scalar_type(-1) : scalar_type(0);\\n\\n }\\n\\n return output;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Apply not equal operator on a Vector and scalar component-wise.\\n\\n *\\n\\n * @param[in] lhs input a.\\n\\n * @param[in] rhs input b.\\n\\n * @returns output.\\n\\n * @tparam OUTPUT_TYPE the type of output.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 19,\n \"score\": 166937.7324854386\n },\n {\n \"content\": \" * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\\ntemplate <typename OUTPUT_TYPE, typename T, int N, int SIZE_IN_MEMORY = N>\\n\\nOUTPUT_TYPE equal_component_wise(const T &lhs,\\n\\n const Vector<T, N, SIZE_IN_MEMORY> &rhs) {\\n\\n const Vector<T, N, SIZE_IN_MEMORY> vector_lhs(lhs);\\n\\n return equal_component_wise<OUTPUT_TYPE>(vector_lhs, rhs);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Apply equal operator on a Vector and scalar component-wise.\\n\\n *\\n\\n * @param[in] lhs input a.\\n\\n * @param[in] rhs input b.\\n\\n * @returns output.\\n\\n * @tparam OUTPUT_TYPE the type of output.\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\\n * @tparam SIZE_IN_MEMORY size of vector in memory in elements.\\n\\n */\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 20,\n \"score\": 166937.70499233916\n },\n {\n \"content\": \" */\\n\\n friend Vector operator%(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n lhs_vector %= rhs;\\n\\n return lhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Modulo operator.\\n\\n *\\n\\n * @param[in] lhs Vector to modulo.\\n\\n * @param[in] rhs scalar to modulo.\\n\\n * @returns result of modulo.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator%(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n lhs %= rhs_vector;\\n\\n return lhs;\\n\\n }\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 21,\n \"score\": 166934.2454750566\n },\n {\n \"content\": \" * @returns result of subtraction.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator-(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n lhs_vector -= rhs;\\n\\n return lhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Subtraction operator.\\n\\n *\\n\\n * @param[in] lhs Vector to subtract.\\n\\n * @param[in] rhs scalar to subtract.\\n\\n * @returns result of subtraction.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator-(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n lhs -= rhs_vector;\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 22,\n \"score\": 166934.23720788755\n },\n {\n \"content\": \" * @returns result of multiplication.\\n\\n */\\n\\n friend Vector operator*(Vector lhs, const Vector &rhs) {\\n\\n lhs *= rhs;\\n\\n return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Multiplication operator.\\n\\n *\\n\\n * @param[in] lhs scalar to multiply.\\n\\n * @param[in] rhs Vector to multiply.\\n\\n * @returns result of multiplication.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator*(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n lhs_vector *= rhs;\\n\\n return lhs_vector;\\n\\n }\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 23,\n \"score\": 166934.19288197465\n },\n {\n \"content\": \" *\\n\\n * @param[in] lhs Vector to add.\\n\\n * @param[in] rhs Vector to add.\\n\\n * @returns result of addition.\\n\\n */\\n\\n friend Vector operator+(Vector lhs, const Vector &rhs) {\\n\\n lhs += rhs;\\n\\n return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Addition operator.\\n\\n *\\n\\n * @param[in] lhs scalar to add.\\n\\n * @param[in] rhs Vector to add.\\n\\n * @returns result of addition.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator+(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 24,\n \"score\": 166934.1782502622\n },\n {\n \"content\": \" *\\n\\n * @param[in] lhs scalar to compare.\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if any value is not equal.\\n\\n */\\n\\n friend bool operator!=(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n return lhs_vector != rhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Not equal operator.\\n\\n *\\n\\n * @param[in] lhs Vector to compare.\\n\\n * @param[in] rhs scalar to compare.\\n\\n * @returns true if any value is not equal.\\n\\n */\\n\\n friend bool operator!=(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n return lhs != rhs_vector;\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 25,\n \"score\": 166934.13954836378\n },\n {\n \"content\": \" */\\n\\n friend bool operator<(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n return lhs_vector < rhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Less than operator.\\n\\n *\\n\\n * @param[in] lhs Vector to compare.\\n\\n * @param[in] rhs scalar to compare.\\n\\n * @returns true if all lhs values are less than rhs values.\\n\\n */\\n\\n friend bool operator<(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n return lhs < rhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Greater than operator.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 26,\n \"score\": 166934.1235328709\n },\n {\n \"content\": \" lhs_vector += rhs;\\n\\n return lhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Addition operator.\\n\\n *\\n\\n * @param[in] lhs Vector to add.\\n\\n * @param[in] rhs scalar to add.\\n\\n * @returns result of addition.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator+(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n lhs += rhs_vector;\\n\\n return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Subtraction assignment operator.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 27,\n \"score\": 166934.1274934368\n },\n {\n \"content\": \" *\\n\\n * @param[in] rhs Vector to subtract.\\n\\n * @returns this after subtraction.\\n\\n */\\n\\n Vector &operator-=(const Vector &rhs) {\\n\\n std::transform(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), data_.begin(), std::minus<T>());\\n\\n return *this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Subtraction operator.\\n\\n *\\n\\n * @param[in] lhs Vector to subtract.\\n\\n * @param[in] rhs Vector to subtract.\\n\\n * @returns result of subtraction.\\n\\n */\\n\\n friend Vector operator-(Vector lhs, const Vector &rhs) {\\n\\n lhs -= rhs;\\n\\n return lhs;\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 28,\n \"score\": 166934.11821977526\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n /**\\n\\n * Construct Vector from a scalar.\\n\\n *\\n\\n * @param[in] scalar value which will be used to fill a Vector.\\n\\n */\\n\\n explicit Vector(T scalar) { std::fill(data_.begin(), data_.end(), scalar); }\\n\\n\\n\\n /**\\n\\n * Copy constructor.\\n\\n */\\n\\n Vector(const Vector &) = default;\\n\\n\\n\\n /**\\n\\n * Move constructor.\\n\\n */\\n\\n Vector(Vector &&) noexcept = default;\\n\\n\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 29,\n \"score\": 166934.0984932004\n },\n {\n \"content\": \" * Division operator.\\n\\n *\\n\\n * @param[in] lhs scalar to divide.\\n\\n * @param[in] rhs Vector to divide.\\n\\n * @returns result of division.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator/(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n lhs_vector /= rhs;\\n\\n return lhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Division operator.\\n\\n *\\n\\n * @param[in] lhs Vector to divide.\\n\\n * @param[in] rhs scalar to divide.\\n\\n * @returns result of division.\\n\\n * @overload\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 30,\n \"score\": 166934.09175411562\n },\n {\n \"content\": \" */\\n\\n Vector &operator/=(const Vector &rhs) {\\n\\n std::transform(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), data_.begin(), std::divides<T>());\\n\\n return *this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Division operator.\\n\\n *\\n\\n * @param[in] lhs Vector to divide.\\n\\n * @param[in] rhs Vector to divide.\\n\\n * @returns result of division.\\n\\n */\\n\\n friend Vector operator/(Vector lhs, const Vector &rhs) {\\n\\n lhs /= rhs;\\n\\n return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 31,\n \"score\": 166934.09175411556\n },\n {\n \"content\": \" */\\n\\n friend Vector operator/(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n lhs /= rhs_vector;\\n\\n return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Modulo assignment operator.\\n\\n *\\n\\n * @param[in] rhs Vector to modulo.\\n\\n * @returns this after modulo.\\n\\n */\\n\\n Vector &operator%=(const Vector &rhs) {\\n\\n static_assert(std::is_integral<T>::value,\\n\\n \\\"Modulo operator is defined only for integral types\\\");\\n\\n std::transform(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), data_.begin(), std::modulus<T>());\\n\\n return *this;\\n\\n }\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 32,\n \"score\": 166934.0865222719\n },\n {\n \"content\": \" */\\n\\n friend bool operator>=(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n return lhs >= rhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Addition assignment operator.\\n\\n *\\n\\n * @param[in] rhs Vector to add.\\n\\n * @returns this after addition.\\n\\n */\\n\\n Vector &operator+=(const Vector &rhs) {\\n\\n std::transform(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), data_.begin(), std::plus<T>());\\n\\n return *this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Addition operator.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 33,\n \"score\": 166934.07992791967\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * Multiplication operator.\\n\\n *\\n\\n * @param[in] lhs Vector to multiply.\\n\\n * @param[in] rhs scalar to multiply.\\n\\n * @returns result of multiplication.\\n\\n * @overload\\n\\n */\\n\\n friend Vector operator*(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n lhs *= rhs_vector;\\n\\n return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Division assignment operator.\\n\\n *\\n\\n * @param[in] rhs Vector to divide.\\n\\n * @returns this after division.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 34,\n \"score\": 166934.06474827987\n },\n {\n \"content\": \" /**\\n\\n * Destructor.\\n\\n */\\n\\n ~Vector() = default;\\n\\n\\n\\n /**\\n\\n * Copy assignment operator.\\n\\n */\\n\\n Vector &operator=(const Vector &) = default;\\n\\n\\n\\n /**\\n\\n * Move assignment operator.\\n\\n */\\n\\n Vector &operator=(Vector &&) noexcept = default;\\n\\n\\n\\n /**\\n\\n * Equal operator.\\n\\n *\\n\\n * @param[in] rhs Vector to compare against.\\n\\n * @returns true if all values are equal.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 35,\n \"score\": 166934.05241271894\n },\n {\n \"content\": \" */\\n\\n bool operator==(const Vector &rhs) const {\\n\\n return std::equal(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), rhs.data_.begin() + vector_size);\\n\\n };\\n\\n\\n\\n /**\\n\\n * Equal operator.\\n\\n *\\n\\n * @param[in] lhs scalar to compare.\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all values are equal.\\n\\n */\\n\\n friend bool operator==(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n return lhs_vector == rhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Equal operator.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 36,\n \"score\": 166934.05055030427\n },\n {\n \"content\": \" *\\n\\n * @param[in] lhs Vector to compare.\\n\\n * @param[in] rhs scalar to compare.\\n\\n * @returns true if all values are equal.\\n\\n */\\n\\n friend bool operator==(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n return lhs == rhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Not equal operator.\\n\\n *\\n\\n * @param[in] rhs Vector to compare against.\\n\\n * @returns true if any value is not equal.\\n\\n */\\n\\n bool operator!=(const Vector &rhs) const { return !(*this == rhs); };\\n\\n\\n\\n /**\\n\\n * Not equal operator.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 37,\n \"score\": 166934.03135241033\n },\n {\n \"content\": \" *\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are greater than rhs values.\\n\\n */\\n\\n bool operator>(const Vector &rhs) const {\\n\\n return std::equal(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\\n\\n [](T a, T b) -> bool { return a > b; });\\n\\n };\\n\\n\\n\\n /**\\n\\n * Greater than operator.\\n\\n *\\n\\n * @param[in] lhs scalar to compare.\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are greater than rhs values.\\n\\n */\\n\\n friend bool operator>(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n return lhs_vector > rhs;\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 38,\n \"score\": 166934.0343734522\n },\n {\n \"content\": \" *\\n\\n * @param[in] lhs Vector to compare.\\n\\n * @param[in] rhs scalar to compare.\\n\\n * @returns true if all lhs values are less than or equal to rhs values.\\n\\n */\\n\\n friend bool operator<=(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n return lhs <= rhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Greater than or equal operator.\\n\\n *\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are greater than or equal to rhs values.\\n\\n */\\n\\n bool operator>=(const Vector &rhs) const {\\n\\n return std::equal(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\\n\\n [](T a, T b) -> bool { return a >= b; });\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 39,\n \"score\": 166934.01889211228\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * Modulo operator.\\n\\n *\\n\\n * @param[in] lhs Vector to module.\\n\\n * @param[in] rhs Vector to module.\\n\\n * @returns result of module.\\n\\n */\\n\\n friend Vector operator%(Vector lhs, const Vector &rhs) {\\n\\n lhs %= rhs;\\n\\n return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Modulo operator.\\n\\n *\\n\\n * @param[in] lhs scalar to modulo.\\n\\n * @param[in] rhs Vector to modulo.\\n\\n * @returns result of modulo.\\n\\n * @overload\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 40,\n \"score\": 166934.01363257275\n },\n {\n \"content\": \" bool operator<=(const Vector &rhs) const {\\n\\n return std::equal(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\\n\\n [](T a, T b) -> bool { return a <= b; });\\n\\n };\\n\\n\\n\\n /**\\n\\n * Less than or equal operator.\\n\\n *\\n\\n * @param[in] lhs scalar to compare.\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are less than or equal to rhs values.\\n\\n */\\n\\n friend bool operator<=(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n return lhs_vector <= rhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Less than or equal operator.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 41,\n \"score\": 166933.99833720032\n },\n {\n \"content\": \" Vector output(*this);\\n\\n --(*this);\\n\\n return output;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Size of vector.\\n\\n *\\n\\n * @returns number of elements in vector.\\n\\n */\\n\\n int size() const { return N; }\\n\\n\\n\\n /**\\n\\n * Get element from vector.\\n\\n *\\n\\n * @param[in] index index of an element to return.\\n\\n * @returns vector element.\\n\\n */\\n\\n T &operator[](int index) {\\n\\n if (index < N) {\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 42,\n \"score\": 166933.961566185\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * Pre-increment operator.\\n\\n *\\n\\n * @returns this after increment operation.\\n\\n */\\n\\n Vector &operator++() {\\n\\n std::for_each(data_.begin(), data_.begin() + vector_size,\\n\\n [](T &a) { ++a; });\\n\\n return *this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Post-increment operator.\\n\\n *\\n\\n * @returns Vector after increment operation.\\n\\n */\\n\\n Vector operator++(int) {\\n\\n Vector output(*this);\\n\\n ++(*this);\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 43,\n \"score\": 166933.961566185\n },\n {\n \"content\": \" }\\n\\n\\n\\n /**\\n\\n * Unary minus operator.\\n\\n *\\n\\n * @param[in] lhs Vector to negate.\\n\\n * @returns result of negation.\\n\\n */\\n\\n friend Vector operator-(const Vector &lhs) {\\n\\n Vector v(lhs);\\n\\n std::transform(v.data_.begin(), v.data_.begin() + v.vector_size,\\n\\n v.data_.begin(), std::negate<T>());\\n\\n return v;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Subtraction operator.\\n\\n *\\n\\n * @param[in] lhs scalar to subtract.\\n\\n * @param[in] rhs Vector to subtract.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 44,\n \"score\": 166933.96011787295\n },\n {\n \"content\": \" return lhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Multiplication assignment operator.\\n\\n *\\n\\n * @param[in] rhs Vector to multiply.\\n\\n * @returns this after multiplication.\\n\\n */\\n\\n Vector &operator*=(const Vector &rhs) {\\n\\n std::transform(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), data_.begin(), std::multiplies<T>());\\n\\n return *this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Multiplication operator.\\n\\n *\\n\\n * @param[in] lhs Vector to multiply.\\n\\n * @param[in] rhs Vector to multiply.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 45,\n \"score\": 166933.96011787295\n },\n {\n \"content\": \" }\\n\\n\\n\\n /**\\n\\n * Greater than operator.\\n\\n *\\n\\n * @param[in] lhs Vector to compare.\\n\\n * @param[in] rhs scalar to compare.\\n\\n * @returns true if all lhs values are greater than rhs values.\\n\\n */\\n\\n friend bool operator>(Vector lhs, const T &rhs) {\\n\\n Vector rhs_vector(rhs);\\n\\n return lhs > rhs_vector;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Less than or equal operator.\\n\\n *\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are less than or equal to rhs values.\\n\\n */\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 46,\n \"score\": 166933.92243724788\n },\n {\n \"content\": \" };\\n\\n\\n\\n /**\\n\\n * Greater than or equal operator.\\n\\n *\\n\\n * @param[in] lhs scalar to compare.\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are greater than or equal to rhs values.\\n\\n */\\n\\n friend bool operator>=(const T &lhs, const Vector &rhs) {\\n\\n Vector lhs_vector(lhs);\\n\\n return lhs_vector >= rhs;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Greater than or equal operator.\\n\\n *\\n\\n * @param[in] lhs Vector to compare.\\n\\n * @param[in] rhs scalar to compare.\\n\\n * @returns true if all lhs values are greater than or equal to rhs values.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 47,\n \"score\": 166933.8778063828\n },\n {\n \"content\": \" throw VectorAccessViolationException(index, N);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Vector type.\\n\\n */\\n\\n using value_type = T;\\n\\n\\n\\n /**\\n\\n * Compile-time vector size.\\n\\n */\\n\\n constexpr static int vector_size = N;\\n\\n\\n\\n /**\\n\\n * Compile-time size in memory.\\n\\n */\\n\\n constexpr static int size_in_memory = SIZE_IN_MEMORY;\\n\\n\\n\\n /**\\n\\n * Metadata needed to distinguish vector-like data types.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 48,\n \"score\": 166933.85419425942\n },\n {\n \"content\": \" return output;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Pre-decrement operator.\\n\\n *\\n\\n * @returns this after decrement operation.\\n\\n */\\n\\n Vector &operator--() {\\n\\n std::for_each(data_.begin(), data_.begin() + vector_size,\\n\\n [](T &a) { --a; });\\n\\n return *this;\\n\\n }\\n\\n\\n\\n /**\\n\\n * Post-decrement operator.\\n\\n *\\n\\n * @returns Vector after decrement operation.\\n\\n */\\n\\n Vector operator--(int) {\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 49,\n \"score\": 166933.82999910502\n },\n {\n \"content\": \" }\\n\\n\\n\\n /**\\n\\n * Less than operator.\\n\\n *\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are less than rhs values.\\n\\n */\\n\\n bool operator<(const Vector &rhs) const {\\n\\n return std::equal(data_.begin(), data_.begin() + vector_size,\\n\\n rhs.data_.begin(), rhs.data_.begin() + vector_size,\\n\\n [](T a, T b) -> bool { return a < b; });\\n\\n };\\n\\n\\n\\n /**\\n\\n * Less than operator.\\n\\n *\\n\\n * @param[in] lhs scalar to compare.\\n\\n * @param[in] rhs Vector to compare.\\n\\n * @returns true if all lhs values are less than rhs values.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 50,\n \"score\": 166933.74189607476\n },\n {\n \"content\": \" return data_[index];\\n\\n }\\n\\n throw VectorAccessViolationException(index, N);\\n\\n }\\n\\n\\n\\n /**\\n\\n * Get iterator of a vector beginning.\\n\\n *\\n\\n */\\n\\n constexpr auto begin() const { return data_.begin(); }\\n\\n\\n\\n /**\\n\\n * Get const element from vector.\\n\\n *\\n\\n * @overload\\n\\n */\\n\\n const T &operator[](int index) const {\\n\\n if (index < N) {\\n\\n return data_[index];\\n\\n }\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 51,\n \"score\": 166933.5552188118\n },\n {\n \"content\": \"\\n\\n/**\\n\\n * Metafunction to enable a function declaration if T is floating point.\\n\\n *\\n\\n * @tparam T type.\\n\\n */\\n\\ntemplate <typename T>\\n\\nusing EnableIfIsFloatingPoint =\\n\\n std::enable_if_t<std::is_floating_point<T>::value, int>;\\n\\n\\n\\n/**\\n\\n * Meta class for scalar types.\\n\\n *\\n\\n * @tparam T scalar type.\\n\\n */\\n\\ntemplate <typename T, typename ENABLE = void> struct ScalarType {\\n\\n /**\\n\\n * Scalar type.\\n\\n */\\n\\n using value = T;\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 52,\n \"score\": 166933.19875974176\n },\n {\n \"content\": \"class VectorAccessViolationException : public std::logic_error {\\n\\npublic:\\n\\n /**\\n\\n * Construct exception with preformatted error message.\\n\\n *\\n\\n * @param[in] index accessed index.\\n\\n * @param[in] size size of vector.\\n\\n */\\n\\n VectorAccessViolationException(int index, int size)\\n\\n : std::logic_error(error_message(index, size)) {}\\n\\n\\n\\nprivate:\\n\\n std::string static error_message(int index, int size);\\n\\n};\\n\\n\\n\\n/**\\n\\n * Static vector implementation.\\n\\n *\\n\\n * @tparam T the type of vector elements.\\n\\n * @tparam N the number of vector elements.\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 53,\n \"score\": 155994.40382709014\n },\n {\n \"content\": \"class VectorBadNumberOfElementsException : public std::logic_error {\\n\\npublic:\\n\\n /**\\n\\n * Construct exception with preformatted error message.\\n\\n *\\n\\n * @param[in] source source of the invalid number of elements.\\n\\n * @param[in] expected expected number of elements.\\n\\n * @param[in] actual actual number of elements.\\n\\n */\\n\\n VectorBadNumberOfElementsException(const std::string &source, int expected,\\n\\n int actual)\\n\\n : std::logic_error(error_message(source, expected, actual)) {}\\n\\n\\n\\nprivate:\\n\\n std::string static error_message(const std::string &source, int expected,\\n\\n int actual);\\n\\n};\\n\\n\\n\\n/**\\n\\n * Exception class used when a trying to access element at index greater or\\n\\n * equal vector size\\n\\n */\\n\",\n \"file_path\": \"src/core/vector/include/cassian/vector/vector.hpp\",\n \"rank\": 54,\n \"score\": 154493.97667164032\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_RUNTIME_RUNTIME_HPP\\n\\n#define CASSIAN_RUNTIME_RUNTIME_HPP\\n\\n\\n\\n#include <algorithm>\\n\\n#include <array>\\n\\n#include <cstddef>\\n\\n#include <cstdint>\\n\\n#include <optional>\\n\\n#include <sstream>\\n\\n#include <stdexcept>\\n\\n#include <string>\\n\\n#include <type_traits>\\n\\n#include <vector>\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 55,\n \"score\": 100806.0195040686\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_REFERENCE_DP4A_HPP\\n\\n#define CASSIAN_REFERENCE_DP4A_HPP\\n\\n\\n\\n#include <cstddef>\\n\\n#include <cstdint>\\n\\n#include <vector>\\n\\n\\n\\n#include <cassian/vector/vector.hpp>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\",\n \"file_path\": \"src/core/reference/include/cassian/reference/dp4a.hpp\",\n \"rank\": 56,\n \"score\": 100804.57742784992\n },\n {\n \"content\": \"namespace fs = std::filesystem;\\n\\n#endif\\n\\n#include <stdexcept>\\n\\n#include <string>\\n\\n#include <type_traits>\\n\\n#include <vector>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Load text file.\\n\\n *\\n\\n * @param[in] file_path path to a file to read.\\n\\n * @returns text read from a file.\\n\\n */\\n\\nstd::string load_text_file(const std::string &file_path);\\n\\n\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/utility.hpp\",\n \"rank\": 57,\n \"score\": 100803.75127398015\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_UTILITY_MATH_HPP\\n\\n#define CASSIAN_UTILITY_MATH_HPP\\n\\n\\n\\n#include <cassian/vector/vector.hpp>\\n\\n#include <cmath>\\n\\n#include <limits>\\n\\n#include <numeric>\\n\\n\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Computes dot product of two vectors\\n\\n * @param[in] a input vector.\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/math.hpp\",\n \"rank\": 58,\n \"score\": 100803.15971931555\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_UTILITY_UTILITY_HPP\\n\\n#define CASSIAN_UTILITY_UTILITY_HPP\\n\\n\\n\\n#include <cassert>\\n\\n#include <cassian/vector/vector.hpp>\\n\\n#include <cstddef>\\n\\n#include <cstdint>\\n\\n#include <cstring>\\n\\n#ifdef CASSIAN_OLD_GNU\\n\\n#include <experimental/filesystem>\\n\\nnamespace fs = std::experimental::filesystem;\\n\\n#else\\n\\n#include <filesystem>\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/utility.hpp\",\n \"rank\": 59,\n \"score\": 100802.32962385922\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_RUNTIME_FACTORY_HPP\\n\\n#define CASSIAN_RUNTIME_FACTORY_HPP\\n\\n\\n\\n#include <cassian/cli/cli.hpp>\\n\\n#include <cassian/runtime/runtime.hpp>\\n\\n#include <memory>\\n\\n#include <stdexcept>\\n\\n#include <string>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/factory.hpp\",\n \"rank\": 60,\n \"score\": 100798.47965417188\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_RANDOM_RANDOM_HPP\\n\\n#define CASSIAN_RANDOM_RANDOM_HPP\\n\\n\\n\\n#include <algorithm>\\n\\n#include <cstdint>\\n\\n#include <limits>\\n\\n#include <random>\\n\\n#include <vector>\\n\\n\\n\\n#include <cassian/fp_types/bfloat.hpp>\\n\\n#include <cassian/fp_types/half.hpp>\\n\\n#include <cassian/fp_types/tfloat.hpp>\\n\\n#include <cassian/vector/vector.hpp>\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 61,\n \"score\": 100798.43023412861\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_SYSTEM_FACTORY_HPP\\n\\n#define CASSIAN_SYSTEM_FACTORY_HPP\\n\\n\\n\\n#include <cassian/system/library.hpp>\\n\\n#include <memory>\\n\\n#include <string>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\",\n \"file_path\": \"src/core/system/include/cassian/system/factory.hpp\",\n \"rank\": 62,\n \"score\": 100798.36726740938\n },\n {\n \"content\": \"/**\\n\\n * Compute dp4a reference from regular elements.\\n\\n *\\n\\n * This function implements algorithm for computing `dot(a, b) + c`.\\n\\n *\\n\\n * @tparam A_TYPE the type of input_a.\\n\\n * @tparam B_TYPE the type of input_b.\\n\\n * @param[in] input_a a operand.\\n\\n * @param[in] input_b b operand.\\n\\n * @param[in] input_c c operand.\\n\\n * @returns `dot(a, b) + c`.\\n\\n */\\n\\ntemplate <typename A_TYPE, typename B_TYPE>\\n\\nstd::vector<int32_t> dp4a(const std::vector<A_TYPE> &input_a,\\n\\n const std::vector<B_TYPE> &input_b,\\n\\n const std::vector<int32_t> &input_c);\\n\\n\\n\\n} // namespace cassian\\n\\n#endif\\n\",\n \"file_path\": \"src/core/reference/include/cassian/reference/dp4a.hpp\",\n \"rank\": 63,\n \"score\": 100798.32493640191\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_MAIN_CONFIG_HPP\\n\\n#define CASSIAN_MAIN_CONFIG_HPP\\n\\n\\n\\n#include <memory>\\n\\n#include <string>\\n\\n\\n\\n#include <cassian/cli/cli.hpp>\\n\\n#include <cassian/runtime/runtime.hpp>\\n\\n\\n\\nnamespace cassian {\\n\\nnamespace test {\\n\\n\\n\",\n \"file_path\": \"src/core/main/include/cassian/main/config.hpp\",\n \"rank\": 64,\n \"score\": 100798.30855255334\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_IMAGE_IMAGE_HPP\\n\\n#define CASSIAN_IMAGE_IMAGE_HPP\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <vector>\\n\\n\\n\\n#include <cassian/random/random.hpp>\\n\\n#include <cassian/runtime/image_properties.hpp>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\",\n \"file_path\": \"src/core/image/include/cassian/image/image.hpp\",\n \"rank\": 65,\n \"score\": 100798.13011673458\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_UTILITY_VERSION_HPP\\n\\n#define CASSIAN_UTILITY_VERSION_HPP\\n\\n\\n\\n#include <string>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Get version string.\\n\\n *\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/version.hpp\",\n \"rank\": 66,\n \"score\": 100798.03131427511\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_CLI_CLI_HPP\\n\\n#define CASSIAN_CLI_CLI_HPP\\n\\n\\n\\n#include <string>\\n\\n#include <unordered_map>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Class for parsing command line arguments.\\n\\n */\\n\",\n \"file_path\": \"src/core/cli/include/cassian/cli/cli.hpp\",\n \"rank\": 67,\n \"score\": 100797.684740332\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_SYSTEM_LIBRARY_HPP\\n\\n#define CASSIAN_SYSTEM_LIBRARY_HPP\\n\\n\\n\\n#include <stdexcept>\\n\\n#include <string>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Interface for a system specific, shared library management.\\n\\n */\\n\",\n \"file_path\": \"src/core/system/include/cassian/system/library.hpp\",\n \"rank\": 68,\n \"score\": 100797.684740332\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_RUNTIME_FEATURE_HPP\\n\\n#define CASSIAN_RUNTIME_FEATURE_HPP\\n\\n\\n\\n#include <string>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Runtime features.\\n\\n */\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/feature.hpp\",\n \"rank\": 69,\n \"score\": 100797.11882682968\n },\n {\n \"content\": \" * Returned value of an argument.\\n\\n *\\n\\n * @tparam T the type of returned argument value.\\n\\n * @param[in] name argument name.\\n\\n * @returns argument value.\\n\\n * @note T must define a constructor accepting std::string.\\n\\n */\\n\\n template <typename T> T get(const std::string &name) const;\\n\\n\\n\\nprivate:\\n\\n std::unordered_map<std::string, std::string> arguments_;\\n\\n};\\n\\n\\n\\ntemplate <typename T> T CommandLineParser::get(const std::string &name) const {\\n\\n return T(arguments_.at(name));\\n\\n}\\n\\n\\n\\n} // namespace cassian\\n\\n#endif\\n\",\n \"file_path\": \"src/core/cli/include/cassian/cli/cli.hpp\",\n \"rank\": 70,\n \"score\": 100795.15433907293\n },\n {\n \"content\": \"\\n\\n#include <cassian/fp_types/bfloat.hpp>\\n\\n#include <cassian/fp_types/half.hpp>\\n\\n#include <cassian/fp_types/tfloat.hpp>\\n\\n#include <cassian/runtime/access_qualifier.hpp>\\n\\n#include <cassian/runtime/device_properties.hpp>\\n\\n#include <cassian/runtime/feature.hpp>\\n\\n#include <cassian/runtime/image_properties.hpp>\\n\\n#include <cassian/runtime/program_descriptor.hpp>\\n\\n#include <cassian/runtime/sampler_properties.hpp>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * API agnostic representation of a compute buffer.\\n\\n */\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 71,\n \"score\": 100793.85397939649\n },\n {\n \"content\": \"/**\\n\\n * Generate random Vector value.\\n\\n *\\n\\n * @overload\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\\n\\nT generate_value(const int seed) {\\n\\n using scalar_type = scalar_type_v<T>;\\n\\n const scalar_type min = std::numeric_limits<scalar_type>::min();\\n\\n const scalar_type max = std::numeric_limits<scalar_type>::max();\\n\\n return generate_value<T>(min, max, seed);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Generate vector of random scalar values in range [min, max].\\n\\n *\\n\\n * @param[in] size Number of values to generate.\\n\\n * @param[in] min Minimum value.\\n\\n * @param[in] max Maximum value.\\n\\n * @param[in] seed Random seed.\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 72,\n \"score\": 100793.25293631869\n },\n {\n \"content\": \" return output;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Unpack a vector into smaller data type. Overload when unpacking from\\n\\n * cassian::Vector\\n\\n *\\n\\n * @overload\\n\\n */\\n\\ntemplate <typename OUTPUT_TYPE, typename VALUE_TYPE, int N, int SIZE_IN_MEMORY>\\n\\nstd::vector<OUTPUT_TYPE>\\n\\nunpack_vector(const std::vector<Vector<VALUE_TYPE, N, SIZE_IN_MEMORY>> &input,\\n\\n const int step = 1) {\\n\\n static_assert(std::is_same<OUTPUT_TYPE, VALUE_TYPE>::value,\\n\\n \\\"When unpacking ca::Vector OUTPUT_TYPE needs to be same as \\\"\\n\\n \\\"VECTOR::value_type\\\");\\n\\n assert(step > 0);\\n\\n\\n\\n std::vector<VALUE_TYPE> output(input.size() * N);\\n\\n\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/utility.hpp\",\n \"rank\": 73,\n \"score\": 100793.21905366905\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_LOGGING_LOGGING_HPP\\n\\n#define CASSIAN_LOGGING_LOGGING_HPP\\n\\n\\n\\n#include <iostream>\\n\\n\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Namespace for logging related functions.\\n\\n */\\n\\nnamespace logging {\\n\\n\\n\\n/**\\n\\n * Class implementing logging capabilities.\\n\\n */\\n\",\n \"file_path\": \"src/core/logging/include/cassian/logging/logging.hpp\",\n \"rank\": 74,\n \"score\": 100792.51345007909\n },\n {\n \"content\": \" * @returns version string.\\n\\n */\\n\\nstd::string get_version();\\n\\n\\n\\n/**\\n\\n * Print version string.\\n\\n */\\n\\nvoid print_version();\\n\\n\\n\\n} // namespace cassian\\n\\n#endif\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/version.hpp\",\n \"rank\": 75,\n \"score\": 100791.74177711915\n },\n {\n \"content\": \"/*\\n\\n * Copyright (C) 2021 Intel Corporation\\n\\n *\\n\\n * SPDX-License-Identifier: MIT\\n\\n *\\n\\n */\\n\\n\\n\\n#ifndef CASSIAN_UTILITY_METAPROGRAMMING_HPP\\n\\n#define CASSIAN_UTILITY_METAPROGRAMMING_HPP\\n\\n\\n\\n#include <tuple>\\n\\n#include <type_traits>\\n\\n\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Iterates over @c std::integer_sequence.\\n\\n * Example usage:\\n\\n * @code{.cpp}\\n\\n * static_for(std::index_sequence<2, 3, 4, 8, 16>{}, [&](auto i) {\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/metaprogramming.hpp\",\n \"rank\": 76,\n \"score\": 100791.36262301511\n },\n {\n \"content\": \"std::vector<T> generate_vector(const int size, const int seed) {\\n\\n std::vector<T> data(size);\\n\\n std::generate(data.begin(), data.end(),\\n\\n [&] { return generate_value<T>(seed); });\\n\\n return data;\\n\\n}\\n\\n\\n\\n} // namespace cassian\\n\\n\\n\\n#endif\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 77,\n \"score\": 100790.58649847076\n },\n {\n \"content\": \"\\n\\n return data_[index];\\n\\n }\\n\\n\\n\\nprivate:\\n\\n const ImageDimensions dimensions_;\\n\\n std::vector<pixel_type> data_;\\n\\n};\\n\\n\\n\\n} // namespace cassian\\n\\n#endif\\n\",\n \"file_path\": \"src/core/image/include/cassian/image/image.hpp\",\n \"rank\": 78,\n \"score\": 100790.39465897255\n },\n {\n \"content\": \" * @param[in] str string to convert.\\n\\n * @returns converted string.\\n\\n */\\n\\nstd::string convert_to_forward_slashes(const std::string &str);\\n\\n\\n\\n/**\\n\\n * Convert typed-value to string. Switches between arithmetic std and\\n\\n * cassian to_string function\\n\\n *\\n\\n * @tparam T the type to log.\\n\\n * @param[in] value typed value to convert.\\n\\n * @returns string returned from another to_string function.\\n\\n */\\n\\ntemplate <typename T> std::string to_string(const T &value) {\\n\\n if constexpr (std::is_arithmetic_v<T>) {\\n\\n return std::to_string(value);\\n\\n } else {\\n\\n return to_string(value);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/utility.hpp\",\n \"rank\": 79,\n \"score\": 100790.26535298128\n },\n {\n \"content\": \" std::memcpy(&output[output_offset], tmp.data(), sizeof(OUTPUT_TYPE));\\n\\n }\\n\\n }\\n\\n\\n\\n return output;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Pack a vector into larger data type. Overload when packing into\\n\\n * cassian::Vector\\n\\n *\\n\\n * @overload\\n\\n */\\n\\ntemplate <typename VECTOR>\\n\\nstd::vector<Vector<typename VECTOR::value_type, VECTOR::vector_size,\\n\\n VECTOR::size_in_memory>>\\n\\npack_vector(const std::vector<typename VECTOR::value_type> &input,\\n\\n int step = 1) {\\n\\n assert(step > 0);\\n\\n\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/utility.hpp\",\n \"rank\": 80,\n \"score\": 100790.04538231212\n },\n {\n \"content\": \" * @tparam T type of generated values.\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\\n\\nstd::vector<T> generate_vector(const int size, const scalar_type_v<T> min,\\n\\n const scalar_type_v<T> max, const int seed) {\\n\\n std::vector<T> data(size);\\n\\n std::generate(data.begin(), data.end(),\\n\\n [&] { return generate_value<T>(min, max, seed); });\\n\\n return data;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Generate vector of random values.\\n\\n *\\n\\n * @param[in] size Number of values to generate.\\n\\n * @param[in] seed Random seed.\\n\\n * @returns vector of generated values.\\n\\n * @tparam T type of generated value.\\n\\n */\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 81,\n \"score\": 100789.99909380506\n },\n {\n \"content\": \"\\n\\n/**\\n\\n * Cassian namespace.\\n\\n */\\n\\nnamespace cassian {\\n\\n\\n\\n/**\\n\\n * Generate random scalar value in range [min, max].\\n\\n *\\n\\n * @param[in] min Minimum value.\\n\\n * @param[in] max Maximum value.\\n\\n * @param[in] seed Random seed.\\n\\n * @returns generated value.\\n\\n * @tparam T type of generated value.\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\\n\\nT generate_value(const T min, const T max, const int seed) {\\n\\n static std::default_random_engine engine(seed);\\n\\n std::uniform_int_distribution<T> distribution(min, max);\\n\\n return distribution(engine);\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 82,\n \"score\": 100789.97936268209\n },\n {\n \"content\": \" *\\n\\n * @param[in] sampler sampler to release.\\n\\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\\n\\n * error.\\n\\n * @note After releasing, sampler must not be used anymore.\\n\\n * @note Sampler must not be in use when calling this function.\\n\\n */\\n\\n virtual void release_sampler(const Sampler &sampler) = 0;\\n\\n\\n\\n /**\\n\\n * Read buffer to std::vector.\\n\\n *\\n\\n * @tparam T std::vector type.\\n\\n * @param[in] buffer buffer to read.\\n\\n * @returns std::vector with read buffer data.\\n\\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\\n\\n * error.\\n\\n */\\n\\n template <typename T>\\n\\n std::vector<T> read_buffer_to_vector(const Buffer &buffer);\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 83,\n \"score\": 100789.96562789287\n },\n {\n \"content\": \" *\\n\\n * @overload\\n\\n */\\n\\ntemplate <>\\n\\nhalf generate_value<half>(const half min, const half max, const int seed);\\n\\n\\n\\n/**\\n\\n * Generate random value.\\n\\n *\\n\\n * @param[in] seed Random seed.\\n\\n * @returns generated value.\\n\\n * @tparam T type of generated value.\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\\n\\nT generate_value(const int seed) {\\n\\n const T min = std::numeric_limits<T>::min();\\n\\n const T max = std::numeric_limits<T>::max();\\n\\n return generate_value(min, max, seed);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 84,\n \"score\": 100789.78572421057\n },\n {\n \"content\": \" ~FinalAction() { act(); }\\n\\n\\n\\nprivate:\\n\\n A act;\\n\\n};\\n\\n\\n\\n/**\\n\\n * Creates FinalAction object instance\\n\\n *\\n\\n * @tparam A type for callable object\\n\\n * @param[in] act callable object\\n\\n */\\n\\ntemplate <typename A> FinalAction<A> finally(A act) {\\n\\n return FinalAction<A>{act};\\n\\n}\\n\\n\\n\\n} // namespace cassian\\n\\n#endif\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/utility.hpp\",\n \"rank\": 85,\n \"score\": 100789.62743632834\n },\n {\n \"content\": \" * Load shared library.\\n\\n *\\n\\n * Library name must contain all system specific parts like:\\n\\n * - `lib` prefix;\\n\\n * - `.dll`/`.so` suffix;\\n\\n *\\n\\n * @param[in] name library name.\\n\\n * @returns pointer to an object implementing cassian::Library interface.\\n\\n * @throws cassian::LibraryNotFoundException Thrown if `name` library is not\\n\\n * found in the system.\\n\\n * @note library is unloaded when pointer is freed.\\n\\n */\\n\\nstd::unique_ptr<Library> load_library(const std::string &name);\\n\\n\\n\\n} // namespace cassian\\n\\n#endif\\n\",\n \"file_path\": \"src/core/system/include/cassian/system/factory.hpp\",\n \"rank\": 86,\n \"score\": 100789.5759840341\n },\n {\n \"content\": \" * as `a` but with a length of 1.\\n\\n * @param[in] a input vector.\\n\\n * @returns vector.\\n\\n */\\n\\ntemplate <typename T, EnableIfIsVector<T> = 0> T normalize(const T &a) {\\n\\n using scalar_type = scalar_type_v<T>;\\n\\n for (auto i = 0; i < T::vector_size; i++) {\\n\\n if (std::isnan(a[i])) {\\n\\n return T(std::numeric_limits<scalar_type>::quiet_NaN());\\n\\n }\\n\\n }\\n\\n T result = a;\\n\\n if (std::find_if(a.begin(), a.begin() + T::vector_size,\\n\\n [](const scalar_type &val) { return std::isinf(val); }) !=\\n\\n a.begin() + T::vector_size) {\\n\\n for (size_t i = 0; i < T::vector_size; i++) {\\n\\n result[i] = std::isinf(a[i]) ? std::copysign(1.0, a[i]) : 0.0 * a[i];\\n\\n }\\n\\n }\\n\\n long double norm = 0.0;\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/math.hpp\",\n \"rank\": 87,\n \"score\": 100789.21355825446\n },\n {\n \"content\": \"\\n\\n /**\\n\\n * Write buffer from std::vector.\\n\\n *\\n\\n * @tparam T std::vector type.\\n\\n * @param[in] buffer buffer to write.\\n\\n * @param[in] data vector with data to write.\\n\\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\\n\\n * error.\\n\\n */\\n\\n template <typename T>\\n\\n void write_buffer_from_vector(const Buffer &buffer,\\n\\n const std::vector<T> &data);\\n\\n\\n\\n /**\\n\\n * Create kernel.\\n\\n *\\n\\n * @param[in] kernel_name kernel name.\\n\\n * @param[in] source kernel source code.\\n\\n * @param[in] build_options build options to use during kernel construction.\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 88,\n \"score\": 100789.15311274845\n },\n {\n \"content\": \" * @returns vector of generated values.\\n\\n * @tparam T type of generated values.\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\\n\\nstd::vector<T> generate_vector(const int size, const T min, const T max,\\n\\n const int seed) {\\n\\n std::vector<T> data(size);\\n\\n std::generate(data.begin(), data.end(),\\n\\n [&] { return generate_value<T>(min, max, seed); });\\n\\n return data;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Generate vector of random Vector values in range [min, max].\\n\\n *\\n\\n * @param[in] size Number of values to generate.\\n\\n * @param[in] min Minimum scalar value.\\n\\n * @param[in] max Maximum scalar value.\\n\\n * @param[in] seed Random seed.\\n\\n * @returns vector of generated values.\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 89,\n \"score\": 100788.69283376618\n },\n {\n \"content\": \" for (size_t i = 0; i < T::vector_size; i++) {\\n\\n norm += static_cast<long double>(result[i]) *\\n\\n static_cast<long double>(result[i]);\\n\\n }\\n\\n if (norm == 0.0) {\\n\\n return result;\\n\\n }\\n\\n norm = std::sqrt(norm);\\n\\n for (size_t i = 0; i < T::vector_size; i++) {\\n\\n result[i] /= norm;\\n\\n }\\n\\n return result;\\n\\n}\\n\\n\\n\\ntemplate <typename T, EnableIfIsScalar<T> = 0> T normalize(const T &a) {\\n\\n if (std::isnan(a)) {\\n\\n return std::numeric_limits<T>::quiet_NaN();\\n\\n }\\n\\n if (std::isinf(a)) {\\n\\n T result = std::isinf(a) ? std::copysign(1.0, a) : 0.0 * a;\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/math.hpp\",\n \"rank\": 90,\n \"score\": 100788.53445619083\n },\n {\n \"content\": \" * @param[in] file_path path to output file.\\n\\n */\\n\\nvoid save_binary_file(const std::vector<uint8_t> &data,\\n\\n const std::string &file_path);\\n\\n\\n\\n/**\\n\\n * Combine bytes from multiple elements into single, larger element.\\n\\n *\\n\\n * @tparam IN input data type.\\n\\n * @tparam OUT output data type.\\n\\n * @param[in] input elements to combine.\\n\\n * @returns combined elements.\\n\\n */\\n\\ntemplate <typename OUT, typename IN>\\n\\nOUT combine_bytes(const std::vector<IN> &input) {\\n\\n const size_t bits = 8;\\n\\n OUT output = 0;\\n\\n for (size_t i = 0; i < input.size(); ++i) {\\n\\n output |= uint8_t(input[i]) << (i * bits);\\n\\n }\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/utility.hpp\",\n \"rank\": 91,\n \"score\": 100788.34738103059\n },\n {\n \"content\": \" */\\n\\n virtual Kernel create_kernel_from_multiple_programs(\\n\\n const std::string &kernel_name,\\n\\n const std::vector<ProgramDescriptor> &program_descriptors,\\n\\n const std::string &linker_options = \\\"\\\") = 0;\\n\\n\\n\\n /**\\n\\n * Set buffer as kernel argument.\\n\\n *\\n\\n * @param[in] kernel kernel to use.\\n\\n * @param[in] argument_index argument index.\\n\\n * @param[in] buffer buffer to set as kernel argument.\\n\\n * @throws cassian::RuntimeException Thrown if runtime encountered a fatal\\n\\n * error.\\n\\n */\\n\\n virtual void set_kernel_argument(const Kernel &kernel, int argument_index,\\n\\n const Buffer &buffer) = 0;\\n\\n\\n\\n /**\\n\\n * Set image as kernel argument.\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 92,\n \"score\": 100787.97639045578\n },\n {\n \"content\": \" return value;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Generate random Vector value in range [min, max]. If specialization\\n\\n * is floating point the range is [min, max). Use std::nextafter as max\\n\\n * parameter to close interval.\\n\\n *\\n\\n * @param[in] min Minimum scalar value.\\n\\n * @param[in] max Maximum scalar value.\\n\\n * @param[in] seed Random seed.\\n\\n * @returns generated value.\\n\\n * @tparam T type of generated value.\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\\n\\nT generate_value(const scalar_type_v<T> min, const scalar_type_v<T> max,\\n\\n const int seed) {\\n\\n using scalar_type = scalar_type_v<T>;\\n\\n std::vector<scalar_type> data(T::vector_size);\\n\\n std::generate(data.begin(), data.end(),\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 93,\n \"score\": 100787.96450849103\n },\n {\n \"content\": \" [&] { return generate_value<scalar_type>(min, max, seed); });\\n\\n return T(data);\\n\\n}\\n\\n\\n\\n/**\\n\\n * Generate random Vector value in range [min, max] \\\\ except. If specialization\\n\\n * is floating point the range is [min, max) \\\\ except. Use std::nextafter as max\\n\\n * parameter to close interval.\\n\\n *\\n\\n * @param[in] min Minimum scalar value.\\n\\n * @param[in] max Maximum scalar value.\\n\\n * @param[in] seed Random seed.\\n\\n * @param[in] except except values vector.\\n\\n * @returns generated value.\\n\\n * @tparam T type of generated value.\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsVector<T> = 0>\\n\\nT generate_value(const scalar_type_v<T> min, const scalar_type_v<T> max,\\n\\n const int seed, const std::vector<scalar_type_v<T>> &except) {\\n\\n T generated_value;\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 94,\n \"score\": 100787.76915667873\n },\n {\n \"content\": \"}\\n\\n\\n\\n/**\\n\\n * Generate random scalar value in range [min, max] \\\\ except.\\n\\n *\\n\\n * @param[in] min Minimum value.\\n\\n * @param[in] max Maximum value.\\n\\n * @param[in] seed Random seed.\\n\\n * @param[in] except except values vector.\\n\\n * @returns generated value.\\n\\n * @tparam T type of generated value.\\n\\n */\\n\\ntemplate <typename T, typename cassian::EnableIfIsScalar<T> = 0>\\n\\nT generate_value(const T min, const T max, const int seed,\\n\\n const std::vector<T> &except) {\\n\\n auto value = generate_value(min, max, seed);\\n\\n while (!except.empty() &&\\n\\n std::find(except.begin(), except.end(), value) != except.end()) {\\n\\n value = generate_value(min, max, seed);\\n\\n }\\n\",\n \"file_path\": \"src/core/random/include/cassian/random/random.hpp\",\n \"rank\": 95,\n \"score\": 100787.37194119932\n },\n {\n \"content\": \"/**\\n\\n * Specialization for Tfloat.\\n\\n */\\n\\ntemplate <>\\n\\nstd::vector<Tfloat>\\n\\nRuntime::read_buffer_to_vector<Tfloat>(const Buffer &buffer);\\n\\n\\n\\ntemplate <typename T>\\n\\nvoid Runtime::write_buffer_from_vector(const Buffer &buffer,\\n\\n const std::vector<T> &data) {\\n\\n write_buffer(buffer, data.data());\\n\\n}\\n\\n\\n\\n/**\\n\\n * Specialization for Bfloat.\\n\\n */\\n\\ntemplate <>\\n\\nvoid Runtime::write_buffer_from_vector<Bfloat>(const Buffer &buffer,\\n\\n const std::vector<Bfloat> &data);\\n\\n\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 96,\n \"score\": 100787.03498348579\n },\n {\n \"content\": \" * Vector<int, i.value> v();\\n\\n * })\\n\\n * @endcode\\n\\n *\\n\\n * @param[in] seq std::integer_sequence of numbers to iterate through\\n\\n * @param[in] func Lambda function containing loop body. It should take\\n\\n * one parameter. Compile-time constant integer is\\n\\n * accessible using std::integral_constant::value member.\\n\\n */\\n\\ntemplate <typename F, typename T, T... ints>\\n\\nvoid static_for(std::integer_sequence<T, ints...> seq, F func) {\\n\\n (void)seq;\\n\\n (func(std::integral_constant<T, ints>{}), ...);\\n\\n}\\n\\n\\n\\nnamespace detail {\\n\\n\\n\\n/**\\n\\n * Helper struct for CartesianProduct.\\n\\n * Creates @c std::tuple containing tuples with first type = T, and second type\\n\",\n \"file_path\": \"src/core/utility/include/cassian/utility/metaprogramming.hpp\",\n \"rank\": 97,\n \"score\": 100786.6999581161\n },\n {\n \"content\": \"/**\\n\\n * Specialization for Half.\\n\\n */\\n\\ntemplate <>\\n\\nvoid Runtime::write_buffer_from_vector<Half>(const Buffer &buffer,\\n\\n const std::vector<Half> &data);\\n\\n\\n\\n/**\\n\\n * Specialization for Tfloat.\\n\\n */\\n\\ntemplate <>\\n\\nvoid Runtime::write_buffer_from_vector<Tfloat>(const Buffer &buffer,\\n\\n const std::vector<Tfloat> &data);\\n\\n\\n\\n/**\\n\\n * Exception class used when a runtime encounters a fatal error.\\n\\n */\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 98,\n \"score\": 100786.52986241228\n },\n {\n \"content\": \"std::vector<T> Runtime::read_buffer_to_vector(const Buffer &buffer) {\\n\\n const size_t elements = buffer.size / sizeof(T);\\n\\n std::vector<T> output(elements);\\n\\n read_buffer(buffer, output.data());\\n\\n return output;\\n\\n}\\n\\n\\n\\n/**\\n\\n * Specialization for Bfloat.\\n\\n */\\n\\ntemplate <>\\n\\nstd::vector<Bfloat>\\n\\nRuntime::read_buffer_to_vector<Bfloat>(const Buffer &buffer);\\n\\n\\n\\n/**\\n\\n * Specialization for Half.\\n\\n */\\n\\ntemplate <>\\n\\nstd::vector<Half> Runtime::read_buffer_to_vector<Half>(const Buffer &buffer);\\n\\n\\n\",\n \"file_path\": \"src/core/runtime/include/cassian/runtime/runtime.hpp\",\n \"rank\": 99,\n \"score\": 100786.51242202985\n }\n]","isConversational":false}}},{"rowIdx":493,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"Sankore-3.1/src/gui/UBDownloadWidget.cpp"},"repo_name":{"kind":"string","value":"eaglezzb/rsdc"},"commit":{"kind":"string","value":"cce881f6542ff206bf286cf798c8ec8da3b51d50"},"file_code":{"kind":"string","value":"\n\n#include <QDebug>\n#include <QHeaderView>\n#include <QStyleOptionProgressBarV2>\n#include <QApplication>\n\n#include \"UBDownloadWidget.h\"\n\n#include \"globals/UBGlobals.h\"\n\n#include \"core/UBApplication.h\"\n#include \"core/memcheck.h\"\n\nUBDownloadWidget::UBDownloadWidget(QWidget *parent, const char *name):QWidget(parent)\n , mpLayout(NULL)\n , mpBttnLayout(NULL)\n , mpTree(NULL)\n , mpCancelBttn(NULL)\n , mpItem(NULL)\n{\n setObjectName(name);\n setWindowTitle(tr(\"Downloading files\"));\n SET_STYLE_SHEET();\n resize(400, 300);\n\n mpLayout = new QVBoxLayout(this);\n setLayout(mpLayout);\n\n mpTree = new QTreeWidget(this);\n mpTree->setRootIsDecorated(false);\n mpTree->setColumnCount(2);\n mpTree->header()->setStretchLastSection(false);\n mpTree->header()->setResizeMode(eItemColumn_Desc, QHeaderView::Stretch);\n mpTree->header()->setResizeMode(eItemColumn_Close, QHeaderView::Custom);\n mpTree->resizeColumnToContents(eItemColumn_Close);\n mpTree->header()->close();\n mpLayout->addWidget(mpTree, 1);\n\n mpBttnLayout = new QHBoxLayout();\n mpBttnLayout->addStretch(1);\n mpCancelBttn = new QPushButton(tr(\"Cancel\"), this);\n mpCancelBttn->setObjectName(\"DockPaletteWidgetButton\");\n mpBttnLayout->addWidget(mpCancelBttn, 0);\n mpLayout->addLayout(mpBttnLayout);\n\n connect(UBDownloadManager::downloadManager(), SIGNAL(fileAddedToDownload()), this, SLOT(onFileAddedToDownload()));\n connect(UBDownloadManager::downloadManager(), SIGNAL(downloadUpdated(int,qint64,qint64)), this, SLOT(onDownloadUpdated(int,qint64,qint64)));\n connect(UBDownloadManager::downloadManager(), SIGNAL(downloadFinished(int)), this, SLOT(onDownloadFinished(int)));\n connect(mpCancelBttn, SIGNAL(clicked()), this, SLOT(onCancelClicked()));\n connect(mpTree, SIGNAL(itemClicked(QTreeWidgetItem*,int)), this, SLOT(onItemClicked(QTreeWidgetItem*,int)));\n}\n\nUBDownloadWidget::~UBDownloadWidget()\n{\n if(NULL != mpCancelBttn)\n {\n delete mpCancelBttn;\n mpCancelBttn = NULL;\n }\n if(NULL != mpTree)\n {\n delete mpTree;\n mpTree = NULL;\n }\n if(NULL != mpBttnLayout)\n {\n delete mpBttnLayout;\n mpBttnLayout = NULL;\n }\n if(NULL != mpLayout)\n {\n delete mpLayout;\n mpLayout = NULL;\n }\n}\n\nvoid UBDownloadWidget::onFileAddedToDownload()\n{\n if(NULL != mpTree)\n {\n mpTree->clear();\n addCurrentDownloads();\n addPendingDownloads();\n }\n}\n\nvoid UBDownloadWidget::addCurrentDownloads()\n{\n QVector<sDownloadFileDesc> actualDL = UBDownloadManager::downloadManager()->currentDownloads();\n qDebug() << \"Actual downloads size: \" << actualDL.size();\n for(int i=0; i<actualDL.size();i++)\n {\n mpItem = new QTreeWidgetItem(mpTree);\n mpItem->setText(eItemColumn_Desc, actualDL.at(i).name);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole, QVariant(actualDL.at(i).id));\n mpItem->setIcon(eItemColumn_Close, QIcon(\":images/close.svg\"));\n mpTree->addTopLevelItem(mpItem);\n mpItem = new QTreeWidgetItem(mpTree);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole, actualDL.at(i).currentSize);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole + 1, actualDL.at(i).totalSize);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole + 2, actualDL.at(i).id);\n mpTree->addTopLevelItem(mpItem);\n mpTree->setItemDelegateForRow(((i+1)*2)-1, &mProgressBarDelegate);\n }\n}\n\nvoid UBDownloadWidget::addPendingDownloads()\n{\n QVector<sDownloadFileDesc> pendingDL = UBDownloadManager::downloadManager()->pendingDownloads();\n for(int i=0; i<pendingDL.size(); i++)\n {\n mpItem = new QTreeWidgetItem(mpTree);\n mpItem->setText(eItemColumn_Desc, pendingDL.at(i).name);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole, QVariant(pendingDL.at(i).id));\n mpTree->addTopLevelItem(mpItem);\n }\n}\n\nvoid UBDownloadWidget::onDownloadUpdated(int id, qint64 crnt, qint64 total)\n{\n if(NULL != mpTree)\n {\n QAbstractItemModel* model = mpTree->model();\n if(NULL != model)\n {\n for(int i=0; i< model->rowCount(); i++)\n {\n QModelIndex currentIndex = model->index(i, eItemColumn_Desc);\n if(id == currentIndex.data(Qt::UserRole + 2))\n {\n \n model->setData(currentIndex, crnt, Qt::UserRole);\n model->setData(currentIndex, total, Qt::UserRole + 1);\n break;\n }\n }\n }\n }\n}\n\nvoid UBDownloadWidget::onDownloadFinished(int id)\n{\n Q_UNUSED(id);\n \n onFileAddedToDownload();\n}\n\nvoid UBDownloadWidget::onCancelClicked()\n{\n UBDownloadManager::downloadManager()->cancelDownloads();\n}\n\nvoid UBDownloadWidget::onItemClicked(QTreeWidgetItem *pItem, int col)\n{\n if( eItemColumn_Close == col\n && \"\" != pItem->text(eItemColumn_Desc)){\n\n \n UBDownloadManager::downloadManager()->cancelDownload(pItem->data(eItemColumn_Desc, Qt::UserRole).toInt());\n }\n}\n\nUBDownloadProgressDelegate::UBDownloadProgressDelegate(QObject *parent):QItemDelegate(parent)\n{\n\n}\n\nvoid UBDownloadProgressDelegate::paint(QPainter *painter, const QStyleOptionViewItem &option, const QModelIndex &index) const\n{\n QStyleOptionProgressBarV2 opt;\n opt.rect = option.rect;\n opt.minimum = 0;\n opt.maximum = index.data(Qt::UserRole + 1).toInt();\n opt.progress = index.data(Qt::UserRole).toInt();\n\n if(0 == index.column()){\n QApplication::style()->drawControl(QStyle::CE_ProgressBar, &opt, painter, 0);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <QDebug>\n#include <QHeaderView>\n#include <QStyleOptionProgressBarV2>\n#include <QApplication>\n\n#include \"UBDownloadWidget.h\"\n\n#include \"globals/UBGlobals.h\"\n\n#include \"core/UBApplication.h\"\n#include \"core/memcheck.h\"\n\nUBDownloadWidget::UBDownloadWidget(QWidget *parent, const char *name):QWidget(parent)\n , mpLayout(NULL)\n , mpBttnLayout(NULL)\n , mpTree(NULL)\n , mpCancelBttn(NULL)\n , mpItem(NULL)\n{\n setObjectName(name);\n setWindowTitle(tr(\"Downloading files\"));\n SET_STYLE_SHEET();\n resize(400, 300);\n\n mpLayout = new QVBoxLayout(this);\n setLayout(mpLayout);\n\n mpTree = new QTreeWidget(this);\n mpTree->setRootIsDecorated(false);\n mpTree->setColumnCount(2);\n mpTree->header()->setStretchLastSection(false);\n mpTree->header()->setResizeMode(eItemColumn_Desc, QHeaderView::Stretch);\n mpTree->header()->setResizeMode(eItemColumn_Close, QHeaderView::Custom);\n mpTree->resizeColumnToContents(eItemColumn_Close);\n mpTree->header()->close();\n mpLayout->addWidget(mpTree, 1);\n\n mpBttnLayout = new QHBoxLayout();\n mpBttnLayout->addStretch(1);\n mpCancelBttn = new QPushButton(tr"},"suffix":{"kind":"string","value":"n_Desc, Qt::UserRole, QVariant(actualDL.at(i).id));\n mpItem->setIcon(eItemColumn_Close, QIcon(\":images/close.svg\"));\n mpTree->addTopLevelItem(mpItem);\n mpItem = new QTreeWidgetItem(mpTree);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole, actualDL.at(i).currentSize);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole + 1, actualDL.at(i).totalSize);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole + 2, actualDL.at(i).id);\n mpTree->addTopLevelItem(mpItem);\n mpTree->setItemDelegateForRow(((i+1)*2)-1, &mProgressBarDelegate);\n }\n}\n\nvoid UBDownloadWidget::addPendingDownloads()\n{\n QVector<sDownloadFileDesc> pendingDL = UBDownloadManager::downloadManager()->pendingDownloads();\n for(int i=0; i<pendingDL.size(); i++)\n {\n mpItem = new QTreeWidgetItem(mpTree);\n mpItem->setText(eItemColumn_Desc, pendingDL.at(i).name);\n mpItem->setData(eItemColumn_Desc, Qt::UserRole, QVariant(pendingDL.at(i).id));\n mpTree->addTopLevelItem(mpItem);\n }\n}\n\nvoid UBDownloadWidget::onDownloadUpdated(int id, qint64 crnt, qint64 total)\n{\n if(NULL != mpTree)\n {\n QAbstractItemModel* model = mpTree->model();\n if(NULL != model)\n {\n for(int i=0; i< model->rowCount(); i++)\n {\n QModelIndex currentIndex = model->index(i, eItemColumn_Desc);\n if(id == currentIndex.data(Qt::UserRole + 2))\n {\n \n model->setData(currentIndex, crnt, Qt::UserRole);\n model->setData(currentIndex, total, Qt::UserRole + 1);\n break;\n }\n }\n }\n }\n}\n\nvoid UBDownloadWidget::onDownloadFinished(int id)\n{\n Q_UNUSED(id);\n \n onFileAddedToDownload();\n}\n\nvoid UBDownloadWidget::onCancelClicked()\n{\n UBDownloadManager::downloadManager()->cancelDownloads();\n}\n\nvoid UBDownloadWidget::onItemClicked(QTreeWidgetItem *pItem, int col)\n{\n if( eItemColumn_Close == col\n && \"\" != pItem->text(eItemColumn_Desc)){\n\n \n UBDownloadManager::downloadManager()->cancelDownload(pItem->data(eItemColumn_Desc, Qt::UserRole).toInt());\n }\n}\n\nUBDownloadProgressDelegate::UBDownloadProgressDelegate(QObject *parent):QItemDelegate(parent)\n{\n\n}\n\nvoid UBDownloadProgressDelegate::paint(QPainter *painter, const QStyleOptionViewItem &option, const QModelIndex &index) const\n{\n QStyleOptionProgressBarV2 opt;\n opt.rect = option.rect;\n opt.minimum = 0;\n opt.maximum = index.data(Qt::UserRole + 1).toInt();\n opt.progress = index.data(Qt::UserRole).toInt();\n\n if(0 == index.column()){\n QApplication::style()->drawControl(QStyle::CE_ProgressBar, &opt, painter, 0);\n }\n}\n"},"middle":{"kind":"string","value":"(\"Cancel\"), this);\n mpCancelBttn->setObjectName(\"DockPaletteWidgetButton\");\n mpBttnLayout->addWidget(mpCancelBttn, 0);\n mpLayout->addLayout(mpBttnLayout);\n\n connect(UBDownloadManager::downloadManager(), SIGNAL(fileAddedToDownload()), this, SLOT(onFileAddedToDownload()));\n connect(UBDownloadManager::downloadManager(), SIGNAL(downloadUpdated(int,qint64,qint64)), this, SLOT(onDownloadUpdated(int,qint64,qint64)));\n connect(UBDownloadManager::downloadManager(), SIGNAL(downloadFinished(int)), this, SLOT(onDownloadFinished(int)));\n connect(mpCancelBttn, SIGNAL(clicked()), this, SLOT(onCancelClicked()));\n connect(mpTree, SIGNAL(itemClicked(QTreeWidgetItem*,int)), this, SLOT(onItemClicked(QTreeWidgetItem*,int)));\n}\n\nUBDownloadWidget::~UBDownloadWidget()\n{\n if(NULL != mpCancelBttn)\n {\n delete mpCancelBttn;\n mpCancelBttn = NULL;\n }\n if(NULL != mpTree)\n {\n delete mpTree;\n mpTree = NULL;\n }\n if(NULL != mpBttnLayout)\n {\n delete mpBttnLayout;\n mpBttnLayout = NULL;\n }\n if(NULL != mpLayout)\n {\n delete mpLayout;\n mpLayout = NULL;\n }\n}\n\nvoid UBDownloadWidget::onFileAddedToDownload()\n{\n if(NULL != mpTree)\n {\n mpTree->clear();\n addCurrentDownloads();\n addPendingDownloads();\n }\n}\n\nvoid UBDownloadWidget::addCurrentDownloads()\n{\n QVector<sDownloadFileDesc> actualDL = UBDownloadManager::downloadManager()->currentDownloads();\n qDebug() << \"Actual downloads size: \" << actualDL.size();\n for(int i=0; i<actualDL.size();i++)\n {\n mpItem = new QTreeWidgetItem(mpTree);\n mpItem->setText(eItemColumn_Desc, actualDL.at(i).name);\n mpItem->setData(eItemColum"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"\t\tSSL_CIPHER *new_cipher;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl3.h","rank":0,"score":129144.86743968823},{"content":"X509V3_EXT_NEW ext_new;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/x509v3.h","rank":1,"score":129138.11819616328},{"content":"\t\tconst EVP_MD *new_hash;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl3.h","rank":2,"score":129138.11819616328},{"content":"pitem *pitem_new(PQ_64BIT priority, void *data);\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/pqueue.h","rank":3,"score":129138.11819616328},{"content":"pqueue pqueue_new(void);\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/pqueue.h","rank":4,"score":129138.11819616328},{"content":"\tCRYPTO_EX_new *new_func;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/crypto.h","rank":5,"score":129138.11819616328},{"content":"\tASN1_new_func *asn1_new;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/asn1t.h","rank":6,"score":129138.11819616328},{"content":"\tint new_session;/* 1 if we are to use a new session.\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl.h","rank":7,"score":129138.11819616328},{"content":"\tASN1_ex_new_func *prim_new;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/asn1t.h","rank":8,"score":129138.11819616328},{"content":"\tchar *keytab_file;\t/* S\t NULL (/etc/krb5.keytab) */\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/kssl.h","rank":9,"score":129110.89737241171},{"content":"\tconst char *err_file[ERR_NUM_ERRORS];\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/err.h","rank":10,"score":129110.89737241171},{"content":" FT_Byte last_char;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h","rank":11,"score":127099.45324464793},{"content":" FT_Byte first_char;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h","rank":12,"score":127099.45324464793},{"content":" FT_Byte break_char;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h","rank":13,"score":127099.45324464793},{"content":" FT_Byte default_char;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h","rank":14,"score":127099.45324464793},{"content":"\t\tconst EVP_CIPHER *new_sym_enc;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl3.h","rank":15,"score":127075.19388028208},{"content":" FT_Raster_NewFunc raster_new;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftimage.h","rank":16,"score":127075.19388028208},{"content":"\tASN1_ex_new_func *asn1_ex_new;\n","file_path":"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/asn1t.h","rank":17,"score":127075.19388028208},{"content":" FT_UShort file_type;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h","rank":18,"score":127048.40789714921},{"content":" FT_Char FileName[6];\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h","rank":19,"score":127048.40789714921},{"content":" FT_ULong file_size;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h","rank":20,"score":127048.40789714921},{"content":"extern int ZEXPORT zipOpenNewFileInZip3 (file, filename, zipfi,\n\n extrafield_local, size_extrafield_local,\n\n extrafield_global, size_extrafield_global,\n\n comment, method, level, raw,\n\n windowBits, memLevel, strategy,\n","file_path":"Sankore-ThirdParty/quazip/quazip-0.3/zip.c","rank":21,"score":125793.77882277481},{"content":" FT_Short xAvgCharWidth;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h","rank":22,"score":125101.01979005462},{"content":" FT_UShort* char_index;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/t1types.h","rank":23,"score":125101.01979005462},{"content":" FT_CMap_CharIndexFunc char_index;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h","rank":24,"score":125101.01979005462},{"content":" FT_EXPORT( FT_Error )\n\n FT_Load_Char( FT_Face face,\n\n FT_ULong char_code,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":25,"score":125101.01979005462},{"content":" FT_UShort usDefaultChar;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h","rank":26,"score":125101.01979005462},{"content":" FT_Int num_chars;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/t1types.h","rank":27,"score":125101.01979005462},{"content":" FT_String** char_name;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/t1types.h","rank":28,"score":125101.01979005462},{"content":" FT_CMap_CharNextFunc char_next;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h","rank":29,"score":125101.01979005462},{"content":" FT_UShort usBreakChar;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h","rank":30,"score":125101.01979005462},{"content":" FT_EXPORT( FT_Error )\n\n FT_Stroker_New( FT_Library library,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftstroke.h","rank":31,"score":125084.35006910993},{"content":" FT_EXPORT( FT_Error )\n\n FT_New_Face( FT_Library library,\n\n const char* filepathname,\n\n FT_Long face_index,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":32,"score":125077.14186497979},{"content":"FT_BEGIN_HEADER\n\n\n\n\n\n /*************************************************************************/\n\n /* */\n\n /* <Section> */\n\n /* sizes_management */\n\n /* */\n\n /* <Title> */\n\n /* Size Management */\n\n /* */\n\n /* <Abstract> */\n\n /* Managing multiple sizes per face. */\n\n /* */\n\n /* <Description> */\n\n /* When creating a new face object (e.g., with @FT_New_Face), an */\n\n /* @FT_Size object is automatically created and used to store all */\n\n /* pixel-size dependent information, available in the `face->size' */\n\n /* field. */\n\n /* */\n\n /* It is however possible to create more sizes for a given face, */\n\n /* mostly in order to manage several character pixel sizes of the */\n\n /* same font family and style. See @FT_New_Size and @FT_Done_Size. */\n\n /* */\n\n /* Note that @FT_Set_Pixel_Sizes and @FT_Set_Char_Size only */\n\n /* modify the contents of the current `active' size; you thus need */\n\n /* to use @FT_Activate_Size to change it. */\n\n /* */\n\n /* 99% of applications won't need the functions provided here, */\n\n /* especially if they use the caching sub-system, so be cautious */\n\n /* when using these. */\n\n /* */\n\n /*************************************************************************/\n\n\n\n\n\n /*************************************************************************/\n\n /* */\n\n /* <Function> */\n\n /* FT_New_Size */\n\n /* */\n\n /* <Description> */\n\n /* Create a new size object from a given face object. */\n\n /* */\n\n /* <Input> */\n\n /* face :: A handle to a parent face object. */\n\n /* */\n\n /* <Output> */\n\n /* asize :: A handle to a new size object. */\n\n /* */\n\n /* <Return> */\n\n /* FreeType error code. 0~means success. */\n\n /* */\n\n /* <Note> */\n\n /* You need to call @FT_Activate_Size in order to select the new size */\n\n /* for upcoming calls to @FT_Set_Pixel_Sizes, @FT_Set_Char_Size, */\n\n /* @FT_Load_Glyph, @FT_Load_Char, etc. */\n\n /* */\n\n FT_EXPORT( FT_Error )\n\n FT_New_Size( FT_Face face,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftsizes.h","rank":33,"score":125077.14186497979},{"content":" FT_EXPORT( FT_Error )\n\n FT_New_Library( FT_Memory memory,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmodapi.h","rank":34,"score":125077.14186497979},{"content":" FT_EXPORT( FT_Error )\n\n FTC_Manager_New( FT_Library library,\n\n FT_UInt max_faces,\n\n FT_UInt max_sizes,\n\n FT_ULong max_bytes,\n\n FTC_Face_Requester requester,\n\n FT_Pointer req_data,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h","rank":35,"score":125077.14186497979},{"content":" FT_EXPORT( FT_Error )\n\n FT_Outline_New( FT_Library library,\n\n FT_UInt numPoints,\n\n FT_Int numContours,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftoutln.h","rank":36,"score":125077.14186497979},{"content":" FT_Face_AttachFunc attach_file;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftdriver.h","rank":37,"score":125050.77704813395},{"content":" FT_EXPORT( FT_Error )\n\n FT_Attach_File( FT_Face face,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":38,"score":125050.77704813395},{"content":" FT_EXPORT( FT_ULong )\n\n FT_Get_First_Char( FT_Face face,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":39,"score":123164.45777851199},{"content":" FT_CMap_CharVarIndexFunc char_var_index;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h","rank":40,"score":123164.45777851199},{"content":" FT_UShort usLastCharIndex;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h","rank":41,"score":123164.45777851199},{"content":" FT_EXPORT( FT_UInt )\n\n FT_Get_Char_Index( FT_Face face,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":42,"score":123164.45777851199},{"content":" FT_CMap_CharVarIsDefaultFunc char_var_default;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h","rank":43,"score":123164.45777851199},{"content":" FT_UShort usFirstCharIndex;\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h","rank":44,"score":123164.45777851199},{"content":" FT_EXPORT( FT_ULong )\n\n FT_Get_Next_Char( FT_Face face,\n\n FT_ULong char_code,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":45,"score":123164.45777851199},{"content":" FT_EXPORT( FT_Error )\n\n FT_Set_Char_Size( FT_Face face,\n\n FT_F26Dot6 char_width,\n\n FT_F26Dot6 char_height,\n\n FT_UInt horz_resolution,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":46,"score":123164.45777851199},{"content":" FT_BASE( FT_Error )\n\n FT_Stream_New( FT_Library library,\n\n const FT_Open_Args* args,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftstream.h","rank":47,"score":123147.47484075185},{"content":" FT_EXPORT( FT_Error )\n\n FTC_ImageCache_New( FTC_Manager manager,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h","rank":48,"score":123140.94948337856},{"content":" FT_EXPORT( FT_Error )\n\n FT_New_Memory_Face( FT_Library library,\n\n const FT_Byte* file_base,\n\n FT_Long file_size,\n\n FT_Long face_index,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":49,"score":123140.94948337856},{"content":" FT_EXPORT( FT_Error )\n\n FT_Outline_New_Internal( FT_Memory memory,\n\n FT_UInt numPoints,\n\n FT_Int numContours,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftoutln.h","rank":50,"score":123140.94948337856},{"content":" FT_EXPORT( FT_Error )\n\n FT_New_Face_From_FOND( FT_Library library,\n\n Handle fond,\n\n FT_Long face_index,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h","rank":51,"score":123140.94948337856},{"content":" FT_EXPORT( FT_UInt32* )\n\n FT_Face_GetCharsOfVariant( FT_Face face,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":52,"score":121286.93770355797},{"content":" FT_BASE( FT_Char )\n\n FT_Stream_ReadChar( FT_Stream stream,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftstream.h","rank":53,"score":121286.93770355797},{"content":" FT_EXPORT( FT_UInt32* )\n\n FT_Face_GetVariantsOfChar( FT_Face face,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":54,"score":121286.93770355797},{"content":" FT_BASE( FT_Char )\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftstream.h","rank":55,"score":121286.93770355797},{"content":" FT_EXPORT( FT_Error )\n\n FTC_CMapCache_New( FTC_Manager manager,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h","rank":56,"score":121270.66020148697},{"content":" FT_BASE( FT_Error )\n\n FT_GlyphLoader_New( FT_Memory memory,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftgloadr.h","rank":57,"score":121270.65481742095},{"content":" FT_BASE( FT_Error )\n\n FT_CMap_New( FT_CMap_Class clazz,\n\n FT_Pointer init_data,\n\n FT_CharMap charmap,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h","rank":58,"score":121270.53701260674},{"content":" FT_EXPORT( FT_Error )\n\n FT_New_Face_From_FSSpec( FT_Library library,\n\n const FSSpec *spec,\n\n FT_Long face_index,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h","rank":59,"score":121263.7877690818},{"content":" FT_EXPORT( FT_Error )\n\n FT_New_Face_From_FSRef( FT_Library library,\n\n const FSRef *ref,\n\n FT_Long face_index,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h","rank":60,"score":121263.7877690818},{"content":" FT_EXPORT( FT_Error )\n\n FTC_SBitCache_New( FTC_Manager manager,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h","rank":61,"score":121263.7877690818},{"content":" FT_BASE( FT_Error )\n\n FT_New_GlyphSlot( FT_Face face,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h","rank":62,"score":121263.7877690818},{"content":" FT_EXPORT( FT_Error )\n\n FT_GetFile_From_Mac_Name( const char* fontName,\n\n FSSpec* pathSpec,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h","rank":63,"score":121238.22676323459},{"content":" FT_EXPORT( FT_UInt )\n\n FT_Face_GetCharVariantIndex( FT_Face face,\n\n FT_ULong charcode,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":64,"score":119465.80000022614},{"content":" FT_EXPORT( FT_Int )\n\n FT_Face_GetCharVariantIsDefault( FT_Face face,\n\n FT_ULong charcode,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h","rank":65,"score":119465.80000022614},{"content":" FT_EXPORT( FT_Error )\n\n FT_GetFile_From_Mac_ATS_Name( const char* fontName,\n\n FSSpec* pathSpec,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h","rank":66,"score":119417.8204604284},{"content":" FT_EXPORT( FT_Error )\n\n FT_GetFilePath_From_Mac_ATS_Name( const char* fontName,\n\n UInt8* path,\n\n UInt32 maxPathSize,\n","file_path":"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h","rank":67,"score":117651.2726968361},{"content":"extern int ZEXPORT unzGetFilePos(file, file_pos)\n","file_path":"Sankore-ThirdParty/quazip/quazip-0.3/unzip.c","rank":68,"score":117038.64668891537},{"content":"int ZEXPORT gzsetparams(file, level, strategy)\n","file_path":"Sankore-ThirdParty/zlib/zlib-1.2.5/gzwrite.c","rank":69,"score":117030.12945452155},{"content":"const char * ZEXPORT gzerror(file, errnum)\n","file_path":"Sankore-ThirdParty/zlib/zlib-1.2.5/gzlib.c","rank":70,"score":117030.12945452155},{"content":"extern int ZEXPORT zipClose (file, global_comment)\n","file_path":"Sankore-ThirdParty/quazip/quazip-0.3/zip.c","rank":71,"score":117030.12945452155},{"content":"char * ZEXPORT gzgets(file, buf, len)\n","file_path":"Sankore-ThirdParty/zlib/zlib-1.2.5/gzread.c","rank":72,"score":117030.12945452155},{"content":" char *file;\n","file_path":"Sankore-ThirdParty/zlib/zlib-1.2.5/minigzip.c","rank":73,"score":117030.12945452155},{"content":"#include <QFile>\n\n#include <QFileInfo>\n\n#include <QDebug>\n\n\n\n#include \"TextDocument.h\"\n\n#include \"core/globalDefs.h\"\n\n\n\nTextDocument::TextDocument(const QString& docName, const char *name, QWidget *parent):DocumentWidget(docName, name, parent)\n\n{\n\n mPath = docName;\n\n mpWidget = new QTextEdit(this);\n\n dynamic_cast<QTextEdit*>(mpWidget)->setTabStopWidth(40);\n\n mpLayout->addWidget(mpWidget);\n\n setHighlighter();\n\n\n\n QFile f(docName);\n\n if(f.exists())\n\n {\n\n if(f.open(QIODevice::ReadOnly))\n\n {\n","file_path":"Sankore-AppToolkit/src/gui/TextDocument.cpp","rank":74,"score":24.26227545587836},{"content":"}\n\n\n\nFileManagementDlg::FileManagementDlg(eDialogType type, const char *name, QWidget *parent) : QDialog(parent)\n\n , mpLayout(NULL)\n\n , mpLabel(NULL)\n\n , mpLineEdit(NULL)\n\n , mpBttn(NULL)\n\n , mpHLayout(NULL)\n\n{\n\n setObjectName(name);\n\n setFixedSize(300, 100);\n\n mType = type;\n\n mpLayout = new QVBoxLayout();\n\n setLayout(mpLayout);\n\n\n\n switch(type)\n\n {\n\n case eDialogType_NewFile:\n\n setWindowTitle(tr(\"Add New File\"));\n\n mpHLayout = new QHBoxLayout();\n","file_path":"Sankore-AppToolkit/src/gui/ProjectTree.cpp","rank":75,"score":20.952222881495288},{"content":"#include <QDebug>\n\n#include <QFileInfo>\n\n#include <QUrl>\n\n#include <QCursor>\n\n#include <QMessageBox>\n\n#include <QHeaderView>\n\n\n\n#include \"ProjectTree.h\"\n\n#include \"core/globalDefs.h\"\n\n\n\nProjectTree::ProjectTree(QWidget *parent, const char *name):QTreeWidget(parent)\n\n , pItem(NULL)\n\n , mpContextMenu(NULL)\n\n , mpActionNew(NULL)\n\n , mpActionRename(NULL)\n\n , mpActionDelete(NULL)\n\n{\n\n setObjectName(name);\n\n connect(this, SIGNAL(itemDoubleClicked(QTreeWidgetItem*,int)), this, SLOT(onItemDoubleClicked(QTreeWidgetItem*,int)));\n\n\n","file_path":"Sankore-AppToolkit/src/gui/ProjectTree.cpp","rank":76,"score":20.944648922028925},{"content":"\n\n\n\n\n\n#include \"UBHttpFileDownloader.h\"\n\n\n\n#include \"network/UBNetworkAccessManager.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\nUBHttpFileDownloader::UBHttpFileDownloader(QObject *parent)\n\n : QObject(parent)\n\n{\n\n // NOOP\n\n}\n\n\n\n\n\nUBHttpFileDownloader::~UBHttpFileDownloader()\n\n{\n\n // NOOP\n\n}\n","file_path":"Sankore-3.1/src/network/UBHttpFileDownloader.cpp","rank":77,"score":20.856950260289295},{"content":"\n\n\n\n\n\n#include <QtGui>\n\n#include <QTextCodec>\n\n\n\n#include \"frameworks/UBPlatformUtils.h\"\n\n#include \"frameworks/UBFileSystemUtils.h\"\n\n\n\n#include \"UBApplication.h\"\n\n#include \"UBSettings.h\"\n\n\n\n/* Uncomment this for memory leaks detection */\n\n/*\n\n#if defined(WIN32) && defined(_DEBUG)\n\n #define _CRTDBG_MAP_ALLOC\n\n #include <stdlib.h>\n\n #include <crtdbg.h>\n\n #define DEBUG_NEW new( _NORMAL_BLOCK, __FILE__, __LINE__ )\n\n #define new DEBUG_NEW\n","file_path":"Sankore-3.1/src/core/main.cpp","rank":78,"score":20.641954531576168},{"content":" if(fi.isDir())\n\n {\n\n pParentItem = pCrntItem;\n\n qsNewPath = QString(\"%0%1%2\").arg(qsPath).arg(QDir::separator()).arg(dlg.name());\n\n }\n\n else\n\n {\n\n pParentItem = pCrntItem->parent();\n\n qsNewPath = QString(\"%0%1%2\").arg(fi.path()).arg(QDir::separator()).arg(dlg.name());\n\n }\n\n QFile newFile(qsNewPath);\n\n if(newFile.exists())\n\n {\n\n QMessageBox::critical(parentWidget(), tr(\"Error\"), tr(\"You cannot create this file because it already exists.\"));\n\n }\n\n else\n\n {\n\n // Create the file\n\n if(newFile.open(QIODevice::WriteOnly))\n\n {\n","file_path":"Sankore-AppToolkit/src/gui/ProjectTree.cpp","rank":79,"score":20.30545642642408},{"content":"#include \"Dict.h\"\n\n#include \"XRef.h\"\n\n#include \"Catalog.h\"\n\n#include \"Page.h\"\n\n#include \"PDFDoc.h\"\n\n#include \"TextOutputDev.h\"\n\n#include \"CharTypes.h\"\n\n#include \"UnicodeMap.h\"\n\n#include \"Error.h\"\n\n#include \"config.h\"\n\n\n\nstatic void printInfoString(FILE *f, Dict *infoDict, const char *key,\n\n\t\t\t const char *text1, const char *text2,\n\n\t\t\t UnicodeMap *uMap);\n\nstatic void printInfoDate(FILE *f, Dict *infoDict, const char *key,\n\n\t\t\t const char *fmt);\n\n\n\nstatic int firstPage = 1;\n\nstatic int lastPage = 0;\n\nstatic GBool physLayout = gFalse;\n","file_path":"Sankore-ThirdParty/xpdf/xpdf-3.03/xpdf/pdftotext.cc","rank":80,"score":20.256411653956683},{"content":"#include <QUrl>\n\n#include <QApplication>\n\n\n\n#include \"HelpViewer.h\"\n\n#include \"core/globalDefs.h\"\n\n\n\nHelpViewer::HelpViewer(QWidget *parent, const char *name):QWebView(parent)\n\n{\n\n setObjectName(name);\n\n\n\n QString qsDocFiles;\n\n QString qsDocFilename = \"doc/index.htm\";\n\n\n\n#ifdef Q_WS_MAC\n\n qsDocFiles = QString(\"%0/../Resources/%1\").arg(QApplication::applicationDirPath()).arg(qsDocFilename);\n\n#else\n\n qsDocFiles = qsDocFilename;\n\n#endif\n\n\n\n load(QUrl(qsDocFiles));\n\n}\n\n\n\nHelpViewer::~HelpViewer()\n\n{\n\n\n\n}\n","file_path":"Sankore-AppToolkit/src/gui/HelpViewer.cpp","rank":81,"score":20.25191793095807},{"content":"#include \"core/UBApplicationController.h\"\n\n\n\n#include \"gui/UBDockTeacherGuideWidget.h\"\n\n#include \"gui/UBTeacherGuideWidget.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\n/**\n\n * \\brief Constructor\n\n * @param parent as the parent widget\n\n * @param name as the object name\n\n */\n\nUBDocumentNavigator::UBDocumentNavigator(QWidget *parent, const char *name):QGraphicsView(parent)\n\n , mScene(NULL)\n\n , mNbColumns(1)\n\n , mThumbnailWidth(0)\n\n , mThumbnailMinWidth(100)\n\n{\n\n setObjectName(name);\n\n mScene = new QGraphicsScene(this);\n","file_path":"Sankore-3.1/src/gui/UBDocumentNavigator.cpp","rank":82,"score":20.251090779173843},{"content":"#include <QFileInfo>\n\n#include <QDebug>\n\n\n\n#include \"DocumentTab.h\"\n\n#include \"core/globalDefs.h\"\n\n#include \"TextDocument.h\"\n\n#include \"WebDocument.h\"\n\n\n\nDocumentTab::DocumentTab(QWidget *parent, const char *name):QTabWidget(parent)\n\n{\n\n setObjectName(name);\n\n setTabsClosable(true);\n\n\n\n connect(this, SIGNAL(tabCloseRequested(int)), this, SLOT(onTabCloseRequest(int)));\n\n}\n\n\n\nDocumentTab::~DocumentTab()\n\n{\n\n if(!mWidgets.empty())\n\n {\n","file_path":"Sankore-AppToolkit/src/gui/DocumentTab.cpp","rank":83,"score":20.027986327438285},{"content":"\n\n\n\n\n\n#include \"UBDockDownloadWidget.h\"\n\n#include \"core/UBApplication.h\"\n\n\n\n#include \"globals/UBGlobals.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\nUBDockDownloadWidget::UBDockDownloadWidget(QWidget *parent, const char *name):UBDockPaletteWidget(parent, name)\n\n , mpLayout(NULL)\n\n , mpDLWidget(NULL)\n\n{\n\n mName = \"DownloadWidget\";\n\n mVisibleState = false;\n\n\n\n SET_STYLE_SHEET();\n\n\n\n mpLayout = new QVBoxLayout(this);\n","file_path":"Sankore-3.1/src/gui/UBDockDownloadWidget.cpp","rank":84,"score":19.38450667790762},{"content":"\n\n\n\n\n\n#include \"UBQuickTimeFile.h\"\n\n\n\n#include <AudioToolbox/AudioToolbox.h>\n\n\n\n#include \"UBAudioQueueRecorder.h\"\n\n#include <QtGui>\n\n\n\n#include \"core/memcheck.h\"\n\n\n\nQQueue<UBQuickTimeFile::VideoFrame> UBQuickTimeFile::frameQueue;\n\nQMutex UBQuickTimeFile::frameQueueMutex;\n\nQWaitCondition UBQuickTimeFile::frameBufferNotEmpty;\n\n\n\n\n\nUBQuickTimeFile::UBQuickTimeFile(QObject * pParent)\n\n : QThread(pParent)\n\n , mVideoCompressionSession(0)\n","file_path":"Sankore-3.1/src/podcast/quicktime/UBQuickTimeFile.cpp","rank":85,"score":19.361965620191203},{"content":"\n\n\n\n\n\n#include \"UBDownloadManager.h\"\n\n#include \"core/UBApplication.h\"\n\n#include \"core/UBPersistenceManager.h\"\n\n#include \"gui/UBMainWindow.h\"\n\n#include \"board/UBBoardController.h\"\n\n#include \"board/UBBoardPaletteManager.h\"\n\n#include \"frameworks/UBFileSystemUtils.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\n\n\nUBAsyncLocalFileDownloader::UBAsyncLocalFileDownloader(sDownloadFileDesc desc, QByteArray data, QObject *parent)\n\n: QThread(parent)\n\n, mDesc(desc)\n\n, mData(data)\n\n, m_bAborting(false)\n\n{\n","file_path":"Sankore-3.1/src/core/UBDownloadManager.cpp","rank":86,"score":19.34429559437859},{"content":"\n\n\n\n\n\n#include \"UBWindowsMediaFile.h\"\n\n\n\n#include <QtGui>\n\n\n\n#include \"core/UBApplication.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\nUBWindowsMediaFile::UBWindowsMediaFile(QObject * pParent)\n\n : QObject(pParent)\n\n , mWMhDC(0)\n\n , mWMWriter(0)\n\n , mPushSink(0)\n\n , mVideoInputIndex(0)\n\n , mWMProfile(0)\n\n , mWMInputVideoProps(0)\n\n , mWMInputAudioProps(0)\n","file_path":"Sankore-3.1/src/podcast/windowsmedia/UBWindowsMediaFile.cpp","rank":87,"score":19.224752949138118},{"content":"#include <QHeaderView>\n\n\n\n#include \"OptionsDlg.h\"\n\n#include \"core/globalDefs.h\"\n\n\n\nOptionsDlg::OptionsDlg(QWidget *parent, const char *name):QDialog(parent)\n\n , mpLayout(NULL)\n\n , mpHLayout(NULL)\n\n , mpTree(NULL)\n\n , mpStack(NULL)\n\n , mpButtons(NULL)\n\n{\n\n setObjectName(name);\n\n setModal(true);\n\n resize(DLG_WIDTH, DLG_HEIGHT);\n\n\n\n mpLayout = new QVBoxLayout();\n\n setLayout(mpLayout);\n\n\n\n mpHLayout = new QHBoxLayout();\n","file_path":"Sankore-AppToolkit/src/gui/OptionsDlg.cpp","rank":88,"score":19.02528203507665},{"content":"\n\n s = new GString();\n\n for (p = path; *p; ++p) {\n\n if (*p < 0x80) {\n\n s->append((char)*p);\n\n } else if (*p < 0x800) {\n\n s->append((char)(0xc0 | ((*p >> 6) & 0x1f)));\n\n s->append((char)(0x80 | (*p & 0x3f)));\n\n } else {\n\n s->append((char)(0xe0 | ((*p >> 12) & 0x0f)));\n\n s->append((char)(0x80 | ((*p >> 6) & 0x3f)));\n\n s->append((char)(0x80 | (*p & 0x3f)));\n\n }\n\n }\n\n return s;\n\n}\n\n#endif\n\n\n\nFILE *openFile(const char *path, const char *mode) {\n\n#ifdef WIN32\n","file_path":"Sankore-ThirdParty/xpdf/xpdf-3.03/goo/gfile.cc","rank":89,"score":18.99408262476025},{"content":"\n\n\n\n\n\n#include <QDebug>\n\n#include <QNetworkProxy>\n\n#include <QNetworkDiskCache>\n\n\n\n#include \"core/UBSettings.h\"\n\n\n\n#include \"UBDownloadThread.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\n/**\n\n * \\brief Constructor\n\n * @param parent as the parent object\n\n * @param name as the object name\n\n */\n\nUBDownloadThread::UBDownloadThread(QObject *parent, const char *name):QThread(parent)\n\n , mbRun(false)\n","file_path":"Sankore-3.1/src/core/UBDownloadThread.cpp","rank":90,"score":18.974217552580942},{"content":"// if(!file.open(QIODevice::ReadOnly)) {\n\n// qWarning() << \"Import failed. Cause: file.open(): \" << zip.getZipError();\n\n// return \"\";\n\n// }\n\n file.open(QIODevice::ReadOnly);\n\n if(file.getZipError()!= UNZ_OK) {\n\n qWarning() << \"Import failed. Cause: file.getFileName(): \" << zip.getZipError();\n\n return \"\";\n\n }\n\n\n\n QString newFileName = documentRootFolder + \"/\" + file.getActualFileName();\n\n\n\n QFileInfo newFileInfo(newFileName);\n\n rootDir.mkpath(newFileInfo.absolutePath());\n\n\n\n out.setFileName(newFileName);\n\n out.open(QIODevice::WriteOnly);\n\n\n\n while(file.getChar(&c))\n\n out.putChar(c);\n","file_path":"Sankore-3.1/src/adaptors/UBImportCFF.cpp","rank":91,"score":18.889293316814936},{"content":"\n\n\n\n\n\n#include \"UBWindowsMediaVideoEncoder.h\"\n\n\n\n#include <QtGui>\n\n\n\n#include \"frameworks/UBFileSystemUtils.h\"\n\n\n\n#include \"core/UBApplication.h\"\n\n\n\n#include \"UBWindowsMediaFile.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\nUBWindowsMediaVideoEncoder::UBWindowsMediaVideoEncoder(QObject* pParent)\n\n : UBAbstractVideoEncoder(pParent)\n\n , mWMVideo(0)\n\n , mWaveRecorder(0)\n\n , mRecordAudio(true)\n","file_path":"Sankore-3.1/src/podcast/windowsmedia/UBWindowsMediaVideoEncoder.cpp","rank":92,"score":18.700169614925976},{"content":"\n\n\n\n\n\n#include <QFileDialog>\n\n\n\n#include \"UBUpdateDlg.h\"\n\n#include \"core/UBApplication.h\"\n\n#include \"UBMainWindow.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\nUBUpdateDlg::UBUpdateDlg(QWidget *parent, int nbFiles, const QString& bkpPath)\n\n : QDialog(parent)\n\n , mMainLayout(NULL)\n\n , mNbFilesLabel(NULL)\n\n , mBkpLabel(NULL)\n\n , mBkpPath(NULL)\n\n , mBrowseBttn(NULL)\n\n , mpDlgBttn(NULL)\n\n , mLayout(NULL)\n","file_path":"Sankore-3.1/src/gui/UBUpdateDlg.cpp","rank":93,"score":18.561151251509145},{"content":" root.mkpath(newFileInfo.absolutePath());\n\n\n\n out.setFileName(newFileName);\n\n out.open(QIODevice::WriteOnly);\n\n\n\n // Slow like hell (on GNU/Linux at least), but it is not my fault.\n\n // Not ZIP/UNZIP package's fault either.\n\n // The slowest thing here is out.putChar(c).\n\n QByteArray outFileContent = file.readAll();\n\n if (out.write(outFileContent) == -1)\n\n {\n\n // qWarning() << \"ZIP expand failed. Cause: Unable to write file\";\n\n // this may happen if we are decompressing a directory\n\n }\n\n\n\n while(file.getChar(&c))\n\n out.putChar(c);\n\n\n\n out.close();\n\n\n","file_path":"Sankore-3.1/src/frameworks/UBFileSystemUtils.cpp","rank":94,"score":18.50495515019746},{"content":"\n\n\n\n\n\n#include \"UBPageNavigationWidget.h\"\n\n#include \"core/UBApplication.h\"\n\n\n\n#include \"board/UBBoardController.h\"\n\n\n\n#include \"document/UBDocumentContainer.h\"\n\n\n\n#include \"globals/UBGlobals.h\"\n\n\n\n#include \"core/memcheck.h\"\n\n\n\n/**\n\n * \\brief Constructor\n\n * @param parent as the parent widget\n\n * @param name as the object name\n\n */\n\nUBPageNavigationWidget::UBPageNavigationWidget(QWidget *parent, const char *name):UBDockPaletteWidget(parent)\n","file_path":"Sankore-3.1/src/gui/UBPageNavigationWidget.cpp","rank":95,"score":18.50037294710396},{"content":"#include \"gfile.h\"\n\n#include \"FoFiTrueType.h\"\n\n#include \"FoFiType1C.h\"\n\n#include \"SplashFTFontFile.h\"\n\n#include \"SplashFTFontEngine.h\"\n\n\n\n#ifdef VMS\n\n#if (__VMS_VER < 70000000)\n\nextern \"C\" int unlink(char *filename);\n\n#endif\n\n#endif\n\n\n\n//------------------------------------------------------------------------\n\n\n\nstatic void fileWrite(void *stream, const char *data, int len) {\n\n fwrite(data, 1, len, (FILE *)stream);\n\n}\n\n\n\n//------------------------------------------------------------------------\n\n// SplashFTFontEngine\n","file_path":"Sankore-ThirdParty/xpdf/xpdf-3.03/splash/SplashFTFontEngine.cc","rank":96,"score":18.46579421277498},{"content":"\n\n\n\n\n\n#include \"UBResources.h\"\n\n\n\n#include <QtGui>\n\n\n\n#include \"core/UBApplication.h\"\n\n#include \"core/UBSettings.h\"\n\n#include \"frameworks/UBFileSystemUtils.h\"\n\n#include \"core/memcheck.h\"\n\n\n\n\n\nUBResources* UBResources::sSingleton = 0;\n\n\n\nUBResources::UBResources(QObject* pParent)\n\n : QObject(pParent)\n\n{\n\n // NOOP\n\n}\n","file_path":"Sankore-3.1/src/gui/UBResources.cpp","rank":97,"score":18.45114984885999},{"content":"#include \"DocumentWidget.h\"\n\n#include \"core/globalDefs.h\"\n\n\n\nDocumentWidget::DocumentWidget(const QString& docName, const char *name, QWidget *parent):QWidget(parent)\n\n{\n\n setObjectName(name);\n\n mName = docName;\n\n\n\n mpLayout = new QVBoxLayout();\n\n setLayout(mpLayout);\n\n}\n\n\n\nDocumentWidget::~DocumentWidget()\n\n{\n\n DELETEPTR(mpWidget);\n\n DELETEPTR(mpLayout);\n\n}\n\n\n\nQWidget* DocumentWidget::widget()\n\n{\n","file_path":"Sankore-AppToolkit/src/gui/DocumentWidget.cpp","rank":98,"score":18.361126786779586},{"content":"};\n\n\n\nFileReader *FileReader::make(char *fileName) {\n\n FILE *fA;\n\n\n\n if (!(fA = fopen(fileName, \"rb\"))) {\n\n return NULL;\n\n }\n\n return new FileReader(fA);\n\n}\n\n\n\nFileReader::FileReader(FILE *fA) {\n\n f = fA;\n\n bufPos = 0;\n\n bufLen = 0;\n\n}\n\n\n\nFileReader::~FileReader() {\n\n fclose(f);\n\n}\n","file_path":"Sankore-ThirdParty/xpdf/xpdf-3.03/fofi/FoFiIdentifier.cc","rank":99,"score":18.34424585771272}],"string":"[\n {\n \"content\": \"\\t\\tSSL_CIPHER *new_cipher;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl3.h\",\n \"rank\": 0,\n \"score\": 129144.86743968823\n },\n {\n \"content\": \"X509V3_EXT_NEW ext_new;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/x509v3.h\",\n \"rank\": 1,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"\\t\\tconst EVP_MD *new_hash;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl3.h\",\n \"rank\": 2,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"pitem *pitem_new(PQ_64BIT priority, void *data);\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/pqueue.h\",\n \"rank\": 3,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"pqueue pqueue_new(void);\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/pqueue.h\",\n \"rank\": 4,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"\\tCRYPTO_EX_new *new_func;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/crypto.h\",\n \"rank\": 5,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"\\tASN1_new_func *asn1_new;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/asn1t.h\",\n \"rank\": 6,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"\\tint new_session;/* 1 if we are to use a new session.\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl.h\",\n \"rank\": 7,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"\\tASN1_ex_new_func *prim_new;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/asn1t.h\",\n \"rank\": 8,\n \"score\": 129138.11819616328\n },\n {\n \"content\": \"\\tchar *keytab_file;\\t/* S\\t NULL (/etc/krb5.keytab) */\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/kssl.h\",\n \"rank\": 9,\n \"score\": 129110.89737241171\n },\n {\n \"content\": \"\\tconst char *err_file[ERR_NUM_ERRORS];\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/err.h\",\n \"rank\": 10,\n \"score\": 129110.89737241171\n },\n {\n \"content\": \" FT_Byte last_char;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h\",\n \"rank\": 11,\n \"score\": 127099.45324464793\n },\n {\n \"content\": \" FT_Byte first_char;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h\",\n \"rank\": 12,\n \"score\": 127099.45324464793\n },\n {\n \"content\": \" FT_Byte break_char;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h\",\n \"rank\": 13,\n \"score\": 127099.45324464793\n },\n {\n \"content\": \" FT_Byte default_char;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h\",\n \"rank\": 14,\n \"score\": 127099.45324464793\n },\n {\n \"content\": \"\\t\\tconst EVP_CIPHER *new_sym_enc;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl3.h\",\n \"rank\": 15,\n \"score\": 127075.19388028208\n },\n {\n \"content\": \" FT_Raster_NewFunc raster_new;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftimage.h\",\n \"rank\": 16,\n \"score\": 127075.19388028208\n },\n {\n \"content\": \"\\tASN1_ex_new_func *asn1_ex_new;\\n\",\n \"file_path\": \"Sankore-ThirdParty/openssl/0.9.8i/include/openssl/asn1t.h\",\n \"rank\": 17,\n \"score\": 127075.19388028208\n },\n {\n \"content\": \" FT_UShort file_type;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h\",\n \"rank\": 18,\n \"score\": 127048.40789714921\n },\n {\n \"content\": \" FT_Char FileName[6];\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h\",\n \"rank\": 19,\n \"score\": 127048.40789714921\n },\n {\n \"content\": \" FT_ULong file_size;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftwinfnt.h\",\n \"rank\": 20,\n \"score\": 127048.40789714921\n },\n {\n \"content\": \"extern int ZEXPORT zipOpenNewFileInZip3 (file, filename, zipfi,\\n\\n extrafield_local, size_extrafield_local,\\n\\n extrafield_global, size_extrafield_global,\\n\\n comment, method, level, raw,\\n\\n windowBits, memLevel, strategy,\\n\",\n \"file_path\": \"Sankore-ThirdParty/quazip/quazip-0.3/zip.c\",\n \"rank\": 21,\n \"score\": 125793.77882277481\n },\n {\n \"content\": \" FT_Short xAvgCharWidth;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h\",\n \"rank\": 22,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_UShort* char_index;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/t1types.h\",\n \"rank\": 23,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_CMap_CharIndexFunc char_index;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h\",\n \"rank\": 24,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_Load_Char( FT_Face face,\\n\\n FT_ULong char_code,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 25,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_UShort usDefaultChar;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h\",\n \"rank\": 26,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_Int num_chars;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/t1types.h\",\n \"rank\": 27,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_String** char_name;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/t1types.h\",\n \"rank\": 28,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_CMap_CharNextFunc char_next;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h\",\n \"rank\": 29,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_UShort usBreakChar;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h\",\n \"rank\": 30,\n \"score\": 125101.01979005462\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_Stroker_New( FT_Library library,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftstroke.h\",\n \"rank\": 31,\n \"score\": 125084.35006910993\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_New_Face( FT_Library library,\\n\\n const char* filepathname,\\n\\n FT_Long face_index,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 32,\n \"score\": 125077.14186497979\n },\n {\n \"content\": \"FT_BEGIN_HEADER\\n\\n\\n\\n\\n\\n /*************************************************************************/\\n\\n /* */\\n\\n /* <Section> */\\n\\n /* sizes_management */\\n\\n /* */\\n\\n /* <Title> */\\n\\n /* Size Management */\\n\\n /* */\\n\\n /* <Abstract> */\\n\\n /* Managing multiple sizes per face. */\\n\\n /* */\\n\\n /* <Description> */\\n\\n /* When creating a new face object (e.g., with @FT_New_Face), an */\\n\\n /* @FT_Size object is automatically created and used to store all */\\n\\n /* pixel-size dependent information, available in the `face->size' */\\n\\n /* field. */\\n\\n /* */\\n\\n /* It is however possible to create more sizes for a given face, */\\n\\n /* mostly in order to manage several character pixel sizes of the */\\n\\n /* same font family and style. See @FT_New_Size and @FT_Done_Size. */\\n\\n /* */\\n\\n /* Note that @FT_Set_Pixel_Sizes and @FT_Set_Char_Size only */\\n\\n /* modify the contents of the current `active' size; you thus need */\\n\\n /* to use @FT_Activate_Size to change it. */\\n\\n /* */\\n\\n /* 99% of applications won't need the functions provided here, */\\n\\n /* especially if they use the caching sub-system, so be cautious */\\n\\n /* when using these. */\\n\\n /* */\\n\\n /*************************************************************************/\\n\\n\\n\\n\\n\\n /*************************************************************************/\\n\\n /* */\\n\\n /* <Function> */\\n\\n /* FT_New_Size */\\n\\n /* */\\n\\n /* <Description> */\\n\\n /* Create a new size object from a given face object. */\\n\\n /* */\\n\\n /* <Input> */\\n\\n /* face :: A handle to a parent face object. */\\n\\n /* */\\n\\n /* <Output> */\\n\\n /* asize :: A handle to a new size object. */\\n\\n /* */\\n\\n /* <Return> */\\n\\n /* FreeType error code. 0~means success. */\\n\\n /* */\\n\\n /* <Note> */\\n\\n /* You need to call @FT_Activate_Size in order to select the new size */\\n\\n /* for upcoming calls to @FT_Set_Pixel_Sizes, @FT_Set_Char_Size, */\\n\\n /* @FT_Load_Glyph, @FT_Load_Char, etc. */\\n\\n /* */\\n\\n FT_EXPORT( FT_Error )\\n\\n FT_New_Size( FT_Face face,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftsizes.h\",\n \"rank\": 33,\n \"score\": 125077.14186497979\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_New_Library( FT_Memory memory,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmodapi.h\",\n \"rank\": 34,\n \"score\": 125077.14186497979\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FTC_Manager_New( FT_Library library,\\n\\n FT_UInt max_faces,\\n\\n FT_UInt max_sizes,\\n\\n FT_ULong max_bytes,\\n\\n FTC_Face_Requester requester,\\n\\n FT_Pointer req_data,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h\",\n \"rank\": 35,\n \"score\": 125077.14186497979\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_Outline_New( FT_Library library,\\n\\n FT_UInt numPoints,\\n\\n FT_Int numContours,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftoutln.h\",\n \"rank\": 36,\n \"score\": 125077.14186497979\n },\n {\n \"content\": \" FT_Face_AttachFunc attach_file;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftdriver.h\",\n \"rank\": 37,\n \"score\": 125050.77704813395\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_Attach_File( FT_Face face,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 38,\n \"score\": 125050.77704813395\n },\n {\n \"content\": \" FT_EXPORT( FT_ULong )\\n\\n FT_Get_First_Char( FT_Face face,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 39,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_CMap_CharVarIndexFunc char_var_index;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h\",\n \"rank\": 40,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_UShort usLastCharIndex;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h\",\n \"rank\": 41,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_EXPORT( FT_UInt )\\n\\n FT_Get_Char_Index( FT_Face face,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 42,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_CMap_CharVarIsDefaultFunc char_var_default;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h\",\n \"rank\": 43,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_UShort usFirstCharIndex;\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/tttables.h\",\n \"rank\": 44,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_EXPORT( FT_ULong )\\n\\n FT_Get_Next_Char( FT_Face face,\\n\\n FT_ULong char_code,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 45,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_Set_Char_Size( FT_Face face,\\n\\n FT_F26Dot6 char_width,\\n\\n FT_F26Dot6 char_height,\\n\\n FT_UInt horz_resolution,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 46,\n \"score\": 123164.45777851199\n },\n {\n \"content\": \" FT_BASE( FT_Error )\\n\\n FT_Stream_New( FT_Library library,\\n\\n const FT_Open_Args* args,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftstream.h\",\n \"rank\": 47,\n \"score\": 123147.47484075185\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FTC_ImageCache_New( FTC_Manager manager,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h\",\n \"rank\": 48,\n \"score\": 123140.94948337856\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_New_Memory_Face( FT_Library library,\\n\\n const FT_Byte* file_base,\\n\\n FT_Long file_size,\\n\\n FT_Long face_index,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 49,\n \"score\": 123140.94948337856\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_Outline_New_Internal( FT_Memory memory,\\n\\n FT_UInt numPoints,\\n\\n FT_Int numContours,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftoutln.h\",\n \"rank\": 50,\n \"score\": 123140.94948337856\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_New_Face_From_FOND( FT_Library library,\\n\\n Handle fond,\\n\\n FT_Long face_index,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h\",\n \"rank\": 51,\n \"score\": 123140.94948337856\n },\n {\n \"content\": \" FT_EXPORT( FT_UInt32* )\\n\\n FT_Face_GetCharsOfVariant( FT_Face face,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 52,\n \"score\": 121286.93770355797\n },\n {\n \"content\": \" FT_BASE( FT_Char )\\n\\n FT_Stream_ReadChar( FT_Stream stream,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftstream.h\",\n \"rank\": 53,\n \"score\": 121286.93770355797\n },\n {\n \"content\": \" FT_EXPORT( FT_UInt32* )\\n\\n FT_Face_GetVariantsOfChar( FT_Face face,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 54,\n \"score\": 121286.93770355797\n },\n {\n \"content\": \" FT_BASE( FT_Char )\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftstream.h\",\n \"rank\": 55,\n \"score\": 121286.93770355797\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FTC_CMapCache_New( FTC_Manager manager,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h\",\n \"rank\": 56,\n \"score\": 121270.66020148697\n },\n {\n \"content\": \" FT_BASE( FT_Error )\\n\\n FT_GlyphLoader_New( FT_Memory memory,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftgloadr.h\",\n \"rank\": 57,\n \"score\": 121270.65481742095\n },\n {\n \"content\": \" FT_BASE( FT_Error )\\n\\n FT_CMap_New( FT_CMap_Class clazz,\\n\\n FT_Pointer init_data,\\n\\n FT_CharMap charmap,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h\",\n \"rank\": 58,\n \"score\": 121270.53701260674\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_New_Face_From_FSSpec( FT_Library library,\\n\\n const FSSpec *spec,\\n\\n FT_Long face_index,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h\",\n \"rank\": 59,\n \"score\": 121263.7877690818\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_New_Face_From_FSRef( FT_Library library,\\n\\n const FSRef *ref,\\n\\n FT_Long face_index,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h\",\n \"rank\": 60,\n \"score\": 121263.7877690818\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FTC_SBitCache_New( FTC_Manager manager,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftcache.h\",\n \"rank\": 61,\n \"score\": 121263.7877690818\n },\n {\n \"content\": \" FT_BASE( FT_Error )\\n\\n FT_New_GlyphSlot( FT_Face face,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/internal/ftobjs.h\",\n \"rank\": 62,\n \"score\": 121263.7877690818\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_GetFile_From_Mac_Name( const char* fontName,\\n\\n FSSpec* pathSpec,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h\",\n \"rank\": 63,\n \"score\": 121238.22676323459\n },\n {\n \"content\": \" FT_EXPORT( FT_UInt )\\n\\n FT_Face_GetCharVariantIndex( FT_Face face,\\n\\n FT_ULong charcode,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 64,\n \"score\": 119465.80000022614\n },\n {\n \"content\": \" FT_EXPORT( FT_Int )\\n\\n FT_Face_GetCharVariantIsDefault( FT_Face face,\\n\\n FT_ULong charcode,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/freetype.h\",\n \"rank\": 65,\n \"score\": 119465.80000022614\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_GetFile_From_Mac_ATS_Name( const char* fontName,\\n\\n FSSpec* pathSpec,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h\",\n \"rank\": 66,\n \"score\": 119417.8204604284\n },\n {\n \"content\": \" FT_EXPORT( FT_Error )\\n\\n FT_GetFilePath_From_Mac_ATS_Name( const char* fontName,\\n\\n UInt8* path,\\n\\n UInt32 maxPathSize,\\n\",\n \"file_path\": \"Sankore-ThirdParty/freetype/freetype-2.4.6/include/freetype/ftmac.h\",\n \"rank\": 67,\n \"score\": 117651.2726968361\n },\n {\n \"content\": \"extern int ZEXPORT unzGetFilePos(file, file_pos)\\n\",\n \"file_path\": \"Sankore-ThirdParty/quazip/quazip-0.3/unzip.c\",\n \"rank\": 68,\n \"score\": 117038.64668891537\n },\n {\n \"content\": \"int ZEXPORT gzsetparams(file, level, strategy)\\n\",\n \"file_path\": \"Sankore-ThirdParty/zlib/zlib-1.2.5/gzwrite.c\",\n \"rank\": 69,\n \"score\": 117030.12945452155\n },\n {\n \"content\": \"const char * ZEXPORT gzerror(file, errnum)\\n\",\n \"file_path\": \"Sankore-ThirdParty/zlib/zlib-1.2.5/gzlib.c\",\n \"rank\": 70,\n \"score\": 117030.12945452155\n },\n {\n \"content\": \"extern int ZEXPORT zipClose (file, global_comment)\\n\",\n \"file_path\": \"Sankore-ThirdParty/quazip/quazip-0.3/zip.c\",\n \"rank\": 71,\n \"score\": 117030.12945452155\n },\n {\n \"content\": \"char * ZEXPORT gzgets(file, buf, len)\\n\",\n \"file_path\": \"Sankore-ThirdParty/zlib/zlib-1.2.5/gzread.c\",\n \"rank\": 72,\n \"score\": 117030.12945452155\n },\n {\n \"content\": \" char *file;\\n\",\n \"file_path\": \"Sankore-ThirdParty/zlib/zlib-1.2.5/minigzip.c\",\n \"rank\": 73,\n \"score\": 117030.12945452155\n },\n {\n \"content\": \"#include <QFile>\\n\\n#include <QFileInfo>\\n\\n#include <QDebug>\\n\\n\\n\\n#include \\\"TextDocument.h\\\"\\n\\n#include \\\"core/globalDefs.h\\\"\\n\\n\\n\\nTextDocument::TextDocument(const QString& docName, const char *name, QWidget *parent):DocumentWidget(docName, name, parent)\\n\\n{\\n\\n mPath = docName;\\n\\n mpWidget = new QTextEdit(this);\\n\\n dynamic_cast<QTextEdit*>(mpWidget)->setTabStopWidth(40);\\n\\n mpLayout->addWidget(mpWidget);\\n\\n setHighlighter();\\n\\n\\n\\n QFile f(docName);\\n\\n if(f.exists())\\n\\n {\\n\\n if(f.open(QIODevice::ReadOnly))\\n\\n {\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/TextDocument.cpp\",\n \"rank\": 74,\n \"score\": 24.26227545587836\n },\n {\n \"content\": \"}\\n\\n\\n\\nFileManagementDlg::FileManagementDlg(eDialogType type, const char *name, QWidget *parent) : QDialog(parent)\\n\\n , mpLayout(NULL)\\n\\n , mpLabel(NULL)\\n\\n , mpLineEdit(NULL)\\n\\n , mpBttn(NULL)\\n\\n , mpHLayout(NULL)\\n\\n{\\n\\n setObjectName(name);\\n\\n setFixedSize(300, 100);\\n\\n mType = type;\\n\\n mpLayout = new QVBoxLayout();\\n\\n setLayout(mpLayout);\\n\\n\\n\\n switch(type)\\n\\n {\\n\\n case eDialogType_NewFile:\\n\\n setWindowTitle(tr(\\\"Add New File\\\"));\\n\\n mpHLayout = new QHBoxLayout();\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/ProjectTree.cpp\",\n \"rank\": 75,\n \"score\": 20.952222881495288\n },\n {\n \"content\": \"#include <QDebug>\\n\\n#include <QFileInfo>\\n\\n#include <QUrl>\\n\\n#include <QCursor>\\n\\n#include <QMessageBox>\\n\\n#include <QHeaderView>\\n\\n\\n\\n#include \\\"ProjectTree.h\\\"\\n\\n#include \\\"core/globalDefs.h\\\"\\n\\n\\n\\nProjectTree::ProjectTree(QWidget *parent, const char *name):QTreeWidget(parent)\\n\\n , pItem(NULL)\\n\\n , mpContextMenu(NULL)\\n\\n , mpActionNew(NULL)\\n\\n , mpActionRename(NULL)\\n\\n , mpActionDelete(NULL)\\n\\n{\\n\\n setObjectName(name);\\n\\n connect(this, SIGNAL(itemDoubleClicked(QTreeWidgetItem*,int)), this, SLOT(onItemDoubleClicked(QTreeWidgetItem*,int)));\\n\\n\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/ProjectTree.cpp\",\n \"rank\": 76,\n \"score\": 20.944648922028925\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBHttpFileDownloader.h\\\"\\n\\n\\n\\n#include \\\"network/UBNetworkAccessManager.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\nUBHttpFileDownloader::UBHttpFileDownloader(QObject *parent)\\n\\n : QObject(parent)\\n\\n{\\n\\n // NOOP\\n\\n}\\n\\n\\n\\n\\n\\nUBHttpFileDownloader::~UBHttpFileDownloader()\\n\\n{\\n\\n // NOOP\\n\\n}\\n\",\n \"file_path\": \"Sankore-3.1/src/network/UBHttpFileDownloader.cpp\",\n \"rank\": 77,\n \"score\": 20.856950260289295\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include <QtGui>\\n\\n#include <QTextCodec>\\n\\n\\n\\n#include \\\"frameworks/UBPlatformUtils.h\\\"\\n\\n#include \\\"frameworks/UBFileSystemUtils.h\\\"\\n\\n\\n\\n#include \\\"UBApplication.h\\\"\\n\\n#include \\\"UBSettings.h\\\"\\n\\n\\n\\n/* Uncomment this for memory leaks detection */\\n\\n/*\\n\\n#if defined(WIN32) && defined(_DEBUG)\\n\\n #define _CRTDBG_MAP_ALLOC\\n\\n #include <stdlib.h>\\n\\n #include <crtdbg.h>\\n\\n #define DEBUG_NEW new( _NORMAL_BLOCK, __FILE__, __LINE__ )\\n\\n #define new DEBUG_NEW\\n\",\n \"file_path\": \"Sankore-3.1/src/core/main.cpp\",\n \"rank\": 78,\n \"score\": 20.641954531576168\n },\n {\n \"content\": \" if(fi.isDir())\\n\\n {\\n\\n pParentItem = pCrntItem;\\n\\n qsNewPath = QString(\\\"%0%1%2\\\").arg(qsPath).arg(QDir::separator()).arg(dlg.name());\\n\\n }\\n\\n else\\n\\n {\\n\\n pParentItem = pCrntItem->parent();\\n\\n qsNewPath = QString(\\\"%0%1%2\\\").arg(fi.path()).arg(QDir::separator()).arg(dlg.name());\\n\\n }\\n\\n QFile newFile(qsNewPath);\\n\\n if(newFile.exists())\\n\\n {\\n\\n QMessageBox::critical(parentWidget(), tr(\\\"Error\\\"), tr(\\\"You cannot create this file because it already exists.\\\"));\\n\\n }\\n\\n else\\n\\n {\\n\\n // Create the file\\n\\n if(newFile.open(QIODevice::WriteOnly))\\n\\n {\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/ProjectTree.cpp\",\n \"rank\": 79,\n \"score\": 20.30545642642408\n },\n {\n \"content\": \"#include \\\"Dict.h\\\"\\n\\n#include \\\"XRef.h\\\"\\n\\n#include \\\"Catalog.h\\\"\\n\\n#include \\\"Page.h\\\"\\n\\n#include \\\"PDFDoc.h\\\"\\n\\n#include \\\"TextOutputDev.h\\\"\\n\\n#include \\\"CharTypes.h\\\"\\n\\n#include \\\"UnicodeMap.h\\\"\\n\\n#include \\\"Error.h\\\"\\n\\n#include \\\"config.h\\\"\\n\\n\\n\\nstatic void printInfoString(FILE *f, Dict *infoDict, const char *key,\\n\\n\\t\\t\\t const char *text1, const char *text2,\\n\\n\\t\\t\\t UnicodeMap *uMap);\\n\\nstatic void printInfoDate(FILE *f, Dict *infoDict, const char *key,\\n\\n\\t\\t\\t const char *fmt);\\n\\n\\n\\nstatic int firstPage = 1;\\n\\nstatic int lastPage = 0;\\n\\nstatic GBool physLayout = gFalse;\\n\",\n \"file_path\": \"Sankore-ThirdParty/xpdf/xpdf-3.03/xpdf/pdftotext.cc\",\n \"rank\": 80,\n \"score\": 20.256411653956683\n },\n {\n \"content\": \"#include <QUrl>\\n\\n#include <QApplication>\\n\\n\\n\\n#include \\\"HelpViewer.h\\\"\\n\\n#include \\\"core/globalDefs.h\\\"\\n\\n\\n\\nHelpViewer::HelpViewer(QWidget *parent, const char *name):QWebView(parent)\\n\\n{\\n\\n setObjectName(name);\\n\\n\\n\\n QString qsDocFiles;\\n\\n QString qsDocFilename = \\\"doc/index.htm\\\";\\n\\n\\n\\n#ifdef Q_WS_MAC\\n\\n qsDocFiles = QString(\\\"%0/../Resources/%1\\\").arg(QApplication::applicationDirPath()).arg(qsDocFilename);\\n\\n#else\\n\\n qsDocFiles = qsDocFilename;\\n\\n#endif\\n\\n\\n\\n load(QUrl(qsDocFiles));\\n\\n}\\n\\n\\n\\nHelpViewer::~HelpViewer()\\n\\n{\\n\\n\\n\\n}\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/HelpViewer.cpp\",\n \"rank\": 81,\n \"score\": 20.25191793095807\n },\n {\n \"content\": \"#include \\\"core/UBApplicationController.h\\\"\\n\\n\\n\\n#include \\\"gui/UBDockTeacherGuideWidget.h\\\"\\n\\n#include \\\"gui/UBTeacherGuideWidget.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\n/**\\n\\n * \\\\brief Constructor\\n\\n * @param parent as the parent widget\\n\\n * @param name as the object name\\n\\n */\\n\\nUBDocumentNavigator::UBDocumentNavigator(QWidget *parent, const char *name):QGraphicsView(parent)\\n\\n , mScene(NULL)\\n\\n , mNbColumns(1)\\n\\n , mThumbnailWidth(0)\\n\\n , mThumbnailMinWidth(100)\\n\\n{\\n\\n setObjectName(name);\\n\\n mScene = new QGraphicsScene(this);\\n\",\n \"file_path\": \"Sankore-3.1/src/gui/UBDocumentNavigator.cpp\",\n \"rank\": 82,\n \"score\": 20.251090779173843\n },\n {\n \"content\": \"#include <QFileInfo>\\n\\n#include <QDebug>\\n\\n\\n\\n#include \\\"DocumentTab.h\\\"\\n\\n#include \\\"core/globalDefs.h\\\"\\n\\n#include \\\"TextDocument.h\\\"\\n\\n#include \\\"WebDocument.h\\\"\\n\\n\\n\\nDocumentTab::DocumentTab(QWidget *parent, const char *name):QTabWidget(parent)\\n\\n{\\n\\n setObjectName(name);\\n\\n setTabsClosable(true);\\n\\n\\n\\n connect(this, SIGNAL(tabCloseRequested(int)), this, SLOT(onTabCloseRequest(int)));\\n\\n}\\n\\n\\n\\nDocumentTab::~DocumentTab()\\n\\n{\\n\\n if(!mWidgets.empty())\\n\\n {\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/DocumentTab.cpp\",\n \"rank\": 83,\n \"score\": 20.027986327438285\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBDockDownloadWidget.h\\\"\\n\\n#include \\\"core/UBApplication.h\\\"\\n\\n\\n\\n#include \\\"globals/UBGlobals.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\nUBDockDownloadWidget::UBDockDownloadWidget(QWidget *parent, const char *name):UBDockPaletteWidget(parent, name)\\n\\n , mpLayout(NULL)\\n\\n , mpDLWidget(NULL)\\n\\n{\\n\\n mName = \\\"DownloadWidget\\\";\\n\\n mVisibleState = false;\\n\\n\\n\\n SET_STYLE_SHEET();\\n\\n\\n\\n mpLayout = new QVBoxLayout(this);\\n\",\n \"file_path\": \"Sankore-3.1/src/gui/UBDockDownloadWidget.cpp\",\n \"rank\": 84,\n \"score\": 19.38450667790762\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBQuickTimeFile.h\\\"\\n\\n\\n\\n#include <AudioToolbox/AudioToolbox.h>\\n\\n\\n\\n#include \\\"UBAudioQueueRecorder.h\\\"\\n\\n#include <QtGui>\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\nQQueue<UBQuickTimeFile::VideoFrame> UBQuickTimeFile::frameQueue;\\n\\nQMutex UBQuickTimeFile::frameQueueMutex;\\n\\nQWaitCondition UBQuickTimeFile::frameBufferNotEmpty;\\n\\n\\n\\n\\n\\nUBQuickTimeFile::UBQuickTimeFile(QObject * pParent)\\n\\n : QThread(pParent)\\n\\n , mVideoCompressionSession(0)\\n\",\n \"file_path\": \"Sankore-3.1/src/podcast/quicktime/UBQuickTimeFile.cpp\",\n \"rank\": 85,\n \"score\": 19.361965620191203\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBDownloadManager.h\\\"\\n\\n#include \\\"core/UBApplication.h\\\"\\n\\n#include \\\"core/UBPersistenceManager.h\\\"\\n\\n#include \\\"gui/UBMainWindow.h\\\"\\n\\n#include \\\"board/UBBoardController.h\\\"\\n\\n#include \\\"board/UBBoardPaletteManager.h\\\"\\n\\n#include \\\"frameworks/UBFileSystemUtils.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\n\\n\\nUBAsyncLocalFileDownloader::UBAsyncLocalFileDownloader(sDownloadFileDesc desc, QByteArray data, QObject *parent)\\n\\n: QThread(parent)\\n\\n, mDesc(desc)\\n\\n, mData(data)\\n\\n, m_bAborting(false)\\n\\n{\\n\",\n \"file_path\": \"Sankore-3.1/src/core/UBDownloadManager.cpp\",\n \"rank\": 86,\n \"score\": 19.34429559437859\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBWindowsMediaFile.h\\\"\\n\\n\\n\\n#include <QtGui>\\n\\n\\n\\n#include \\\"core/UBApplication.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\nUBWindowsMediaFile::UBWindowsMediaFile(QObject * pParent)\\n\\n : QObject(pParent)\\n\\n , mWMhDC(0)\\n\\n , mWMWriter(0)\\n\\n , mPushSink(0)\\n\\n , mVideoInputIndex(0)\\n\\n , mWMProfile(0)\\n\\n , mWMInputVideoProps(0)\\n\\n , mWMInputAudioProps(0)\\n\",\n \"file_path\": \"Sankore-3.1/src/podcast/windowsmedia/UBWindowsMediaFile.cpp\",\n \"rank\": 87,\n \"score\": 19.224752949138118\n },\n {\n \"content\": \"#include <QHeaderView>\\n\\n\\n\\n#include \\\"OptionsDlg.h\\\"\\n\\n#include \\\"core/globalDefs.h\\\"\\n\\n\\n\\nOptionsDlg::OptionsDlg(QWidget *parent, const char *name):QDialog(parent)\\n\\n , mpLayout(NULL)\\n\\n , mpHLayout(NULL)\\n\\n , mpTree(NULL)\\n\\n , mpStack(NULL)\\n\\n , mpButtons(NULL)\\n\\n{\\n\\n setObjectName(name);\\n\\n setModal(true);\\n\\n resize(DLG_WIDTH, DLG_HEIGHT);\\n\\n\\n\\n mpLayout = new QVBoxLayout();\\n\\n setLayout(mpLayout);\\n\\n\\n\\n mpHLayout = new QHBoxLayout();\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/OptionsDlg.cpp\",\n \"rank\": 88,\n \"score\": 19.02528203507665\n },\n {\n \"content\": \"\\n\\n s = new GString();\\n\\n for (p = path; *p; ++p) {\\n\\n if (*p < 0x80) {\\n\\n s->append((char)*p);\\n\\n } else if (*p < 0x800) {\\n\\n s->append((char)(0xc0 | ((*p >> 6) & 0x1f)));\\n\\n s->append((char)(0x80 | (*p & 0x3f)));\\n\\n } else {\\n\\n s->append((char)(0xe0 | ((*p >> 12) & 0x0f)));\\n\\n s->append((char)(0x80 | ((*p >> 6) & 0x3f)));\\n\\n s->append((char)(0x80 | (*p & 0x3f)));\\n\\n }\\n\\n }\\n\\n return s;\\n\\n}\\n\\n#endif\\n\\n\\n\\nFILE *openFile(const char *path, const char *mode) {\\n\\n#ifdef WIN32\\n\",\n \"file_path\": \"Sankore-ThirdParty/xpdf/xpdf-3.03/goo/gfile.cc\",\n \"rank\": 89,\n \"score\": 18.99408262476025\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include <QDebug>\\n\\n#include <QNetworkProxy>\\n\\n#include <QNetworkDiskCache>\\n\\n\\n\\n#include \\\"core/UBSettings.h\\\"\\n\\n\\n\\n#include \\\"UBDownloadThread.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\n/**\\n\\n * \\\\brief Constructor\\n\\n * @param parent as the parent object\\n\\n * @param name as the object name\\n\\n */\\n\\nUBDownloadThread::UBDownloadThread(QObject *parent, const char *name):QThread(parent)\\n\\n , mbRun(false)\\n\",\n \"file_path\": \"Sankore-3.1/src/core/UBDownloadThread.cpp\",\n \"rank\": 90,\n \"score\": 18.974217552580942\n },\n {\n \"content\": \"// if(!file.open(QIODevice::ReadOnly)) {\\n\\n// qWarning() << \\\"Import failed. Cause: file.open(): \\\" << zip.getZipError();\\n\\n// return \\\"\\\";\\n\\n// }\\n\\n file.open(QIODevice::ReadOnly);\\n\\n if(file.getZipError()!= UNZ_OK) {\\n\\n qWarning() << \\\"Import failed. Cause: file.getFileName(): \\\" << zip.getZipError();\\n\\n return \\\"\\\";\\n\\n }\\n\\n\\n\\n QString newFileName = documentRootFolder + \\\"/\\\" + file.getActualFileName();\\n\\n\\n\\n QFileInfo newFileInfo(newFileName);\\n\\n rootDir.mkpath(newFileInfo.absolutePath());\\n\\n\\n\\n out.setFileName(newFileName);\\n\\n out.open(QIODevice::WriteOnly);\\n\\n\\n\\n while(file.getChar(&c))\\n\\n out.putChar(c);\\n\",\n \"file_path\": \"Sankore-3.1/src/adaptors/UBImportCFF.cpp\",\n \"rank\": 91,\n \"score\": 18.889293316814936\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBWindowsMediaVideoEncoder.h\\\"\\n\\n\\n\\n#include <QtGui>\\n\\n\\n\\n#include \\\"frameworks/UBFileSystemUtils.h\\\"\\n\\n\\n\\n#include \\\"core/UBApplication.h\\\"\\n\\n\\n\\n#include \\\"UBWindowsMediaFile.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\nUBWindowsMediaVideoEncoder::UBWindowsMediaVideoEncoder(QObject* pParent)\\n\\n : UBAbstractVideoEncoder(pParent)\\n\\n , mWMVideo(0)\\n\\n , mWaveRecorder(0)\\n\\n , mRecordAudio(true)\\n\",\n \"file_path\": \"Sankore-3.1/src/podcast/windowsmedia/UBWindowsMediaVideoEncoder.cpp\",\n \"rank\": 92,\n \"score\": 18.700169614925976\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include <QFileDialog>\\n\\n\\n\\n#include \\\"UBUpdateDlg.h\\\"\\n\\n#include \\\"core/UBApplication.h\\\"\\n\\n#include \\\"UBMainWindow.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\nUBUpdateDlg::UBUpdateDlg(QWidget *parent, int nbFiles, const QString& bkpPath)\\n\\n : QDialog(parent)\\n\\n , mMainLayout(NULL)\\n\\n , mNbFilesLabel(NULL)\\n\\n , mBkpLabel(NULL)\\n\\n , mBkpPath(NULL)\\n\\n , mBrowseBttn(NULL)\\n\\n , mpDlgBttn(NULL)\\n\\n , mLayout(NULL)\\n\",\n \"file_path\": \"Sankore-3.1/src/gui/UBUpdateDlg.cpp\",\n \"rank\": 93,\n \"score\": 18.561151251509145\n },\n {\n \"content\": \" root.mkpath(newFileInfo.absolutePath());\\n\\n\\n\\n out.setFileName(newFileName);\\n\\n out.open(QIODevice::WriteOnly);\\n\\n\\n\\n // Slow like hell (on GNU/Linux at least), but it is not my fault.\\n\\n // Not ZIP/UNZIP package's fault either.\\n\\n // The slowest thing here is out.putChar(c).\\n\\n QByteArray outFileContent = file.readAll();\\n\\n if (out.write(outFileContent) == -1)\\n\\n {\\n\\n // qWarning() << \\\"ZIP expand failed. Cause: Unable to write file\\\";\\n\\n // this may happen if we are decompressing a directory\\n\\n }\\n\\n\\n\\n while(file.getChar(&c))\\n\\n out.putChar(c);\\n\\n\\n\\n out.close();\\n\\n\\n\",\n \"file_path\": \"Sankore-3.1/src/frameworks/UBFileSystemUtils.cpp\",\n \"rank\": 94,\n \"score\": 18.50495515019746\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBPageNavigationWidget.h\\\"\\n\\n#include \\\"core/UBApplication.h\\\"\\n\\n\\n\\n#include \\\"board/UBBoardController.h\\\"\\n\\n\\n\\n#include \\\"document/UBDocumentContainer.h\\\"\\n\\n\\n\\n#include \\\"globals/UBGlobals.h\\\"\\n\\n\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\n/**\\n\\n * \\\\brief Constructor\\n\\n * @param parent as the parent widget\\n\\n * @param name as the object name\\n\\n */\\n\\nUBPageNavigationWidget::UBPageNavigationWidget(QWidget *parent, const char *name):UBDockPaletteWidget(parent)\\n\",\n \"file_path\": \"Sankore-3.1/src/gui/UBPageNavigationWidget.cpp\",\n \"rank\": 95,\n \"score\": 18.50037294710396\n },\n {\n \"content\": \"#include \\\"gfile.h\\\"\\n\\n#include \\\"FoFiTrueType.h\\\"\\n\\n#include \\\"FoFiType1C.h\\\"\\n\\n#include \\\"SplashFTFontFile.h\\\"\\n\\n#include \\\"SplashFTFontEngine.h\\\"\\n\\n\\n\\n#ifdef VMS\\n\\n#if (__VMS_VER < 70000000)\\n\\nextern \\\"C\\\" int unlink(char *filename);\\n\\n#endif\\n\\n#endif\\n\\n\\n\\n//------------------------------------------------------------------------\\n\\n\\n\\nstatic void fileWrite(void *stream, const char *data, int len) {\\n\\n fwrite(data, 1, len, (FILE *)stream);\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------\\n\\n// SplashFTFontEngine\\n\",\n \"file_path\": \"Sankore-ThirdParty/xpdf/xpdf-3.03/splash/SplashFTFontEngine.cc\",\n \"rank\": 96,\n \"score\": 18.46579421277498\n },\n {\n \"content\": \"\\n\\n\\n\\n\\n\\n#include \\\"UBResources.h\\\"\\n\\n\\n\\n#include <QtGui>\\n\\n\\n\\n#include \\\"core/UBApplication.h\\\"\\n\\n#include \\\"core/UBSettings.h\\\"\\n\\n#include \\\"frameworks/UBFileSystemUtils.h\\\"\\n\\n#include \\\"core/memcheck.h\\\"\\n\\n\\n\\n\\n\\nUBResources* UBResources::sSingleton = 0;\\n\\n\\n\\nUBResources::UBResources(QObject* pParent)\\n\\n : QObject(pParent)\\n\\n{\\n\\n // NOOP\\n\\n}\\n\",\n \"file_path\": \"Sankore-3.1/src/gui/UBResources.cpp\",\n \"rank\": 97,\n \"score\": 18.45114984885999\n },\n {\n \"content\": \"#include \\\"DocumentWidget.h\\\"\\n\\n#include \\\"core/globalDefs.h\\\"\\n\\n\\n\\nDocumentWidget::DocumentWidget(const QString& docName, const char *name, QWidget *parent):QWidget(parent)\\n\\n{\\n\\n setObjectName(name);\\n\\n mName = docName;\\n\\n\\n\\n mpLayout = new QVBoxLayout();\\n\\n setLayout(mpLayout);\\n\\n}\\n\\n\\n\\nDocumentWidget::~DocumentWidget()\\n\\n{\\n\\n DELETEPTR(mpWidget);\\n\\n DELETEPTR(mpLayout);\\n\\n}\\n\\n\\n\\nQWidget* DocumentWidget::widget()\\n\\n{\\n\",\n \"file_path\": \"Sankore-AppToolkit/src/gui/DocumentWidget.cpp\",\n \"rank\": 98,\n \"score\": 18.361126786779586\n },\n {\n \"content\": \"};\\n\\n\\n\\nFileReader *FileReader::make(char *fileName) {\\n\\n FILE *fA;\\n\\n\\n\\n if (!(fA = fopen(fileName, \\\"rb\\\"))) {\\n\\n return NULL;\\n\\n }\\n\\n return new FileReader(fA);\\n\\n}\\n\\n\\n\\nFileReader::FileReader(FILE *fA) {\\n\\n f = fA;\\n\\n bufPos = 0;\\n\\n bufLen = 0;\\n\\n}\\n\\n\\n\\nFileReader::~FileReader() {\\n\\n fclose(f);\\n\\n}\\n\",\n \"file_path\": \"Sankore-ThirdParty/xpdf/xpdf-3.03/fofi/FoFiIdentifier.cc\",\n \"rank\": 99,\n \"score\": 18.34424585771272\n }\n]","isConversational":false}}},{"rowIdx":494,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"libs/semanticsearch/src/semanticsearch/query/query_executor.cpp"},"repo_name":{"kind":"string","value":"devjsc/ledger"},"commit":{"kind":"string","value":"5681480faf6e2aeee577f149c17745d6ab4d4ab3"},"file_code":{"kind":"string","value":"\n\n#include \"semanticsearch/query/query_executor.hpp\"\n\n#include <cassert>\n\nnamespace fetch {\nnamespace semanticsearch {\n\nQueryExecutor::QueryExecutor(SharedSemanticSearchModule instance, ErrorTracker &error_tracker)\n : error_tracker_(error_tracker)\n , semantic_search_module_{std::move(instance)}\n{}\n\nvoid QueryExecutor::Execute(Query const &query, Agent agent)\n{\n agent_ = std::move(agent);\n error_tracker_.SetSource(query.source, query.filename);\n if (query.statements.empty())\n {\n return;\n }\n\n for (auto const &stmt : query.statements)\n {\n switch (stmt[0].properties)\n {\n case QueryInstruction::PROP_CTX_MODEL:\n ExecuteDefine(stmt);\n break;\n case QueryInstruction::PROP_CTX_SET:\n ExecuteSet(stmt);\n break;\n case QueryInstruction::PROP_CTX_STORE:\n ExecuteStore(stmt);\n break;\n default:\n error_tracker_.RaiseRuntimeError(\"Unknown statement type.\", stmt[0].token);\n return;\n }\n\n if (error_tracker_.HasErrors())\n {\n break;\n }\n }\n}\n\nQueryExecutor::Vocabulary QueryExecutor::GetInstance(std::string const &name)\n{\n assert(context_.Has(name));\n return context_.Get(name);\n}\n\nvoid QueryExecutor::ExecuteStore(CompiledStatement const &stmt)\n{\n using Type = QueryInstruction::Type;\n\n if (stmt[1].type != Type::IDENTIFIER)\n {\n error_tracker_.RaiseSyntaxError(\"Expected variable name.\", stmt[1].token);\n return;\n }\n\n auto name = static_cast<std::string>(stmt[1].token);\n\n if (!context_.Has(name))\n {\n error_tracker_.RaiseSyntaxError(\"Vairable not defined\", stmt[1].token);\n return;\n }\n\n auto obj = context_.Get(name);\n auto model_name = context_.GetModelName(name);\n\n if (!semantic_search_module_->HasModel(model_name))\n {\n error_tracker_.RaiseSyntaxError(\"Could not find model '\" + model_name + \"'\", stmt[1].token);\n return;\n }\n\n auto model = semantic_search_module_->GetModel(model_name);\n if (model == nullptr)\n {\n error_tracker_.RaiseInternalError(\"Model '\" + model_name + \"' is null.\", stmt[1].token);\n return;\n }\n\n model->VisitSubmodelsWithVocabulary(\n [this, stmt](std::string, std::string mname, Vocabulary obj) {\n auto model = semantic_search_module_->GetModel(mname);\n if (model == nullptr)\n {\n error_tracker_.RaiseSyntaxError(\"Could not find model '\" + mname + \"'\", stmt[1].token);\n return;\n }\n SemanticPosition position = model->Reduce(obj);\n assert(semantic_search_module_->advertisement_register() != nullptr);\n\n semantic_search_module_->advertisement_register()->AdvertiseAgent(agent_->id, mname,\n position);\n agent_->RegisterVocabularyLocation(mname, position);\n },\n obj);\n}\n\nvoid QueryExecutor::ExecuteSet(CompiledStatement const &stmt)\n{\n using Type = QueryInstruction::Type;\n std::size_t i = 3;\n\n if (stmt.size() < i)\n {\n error_tracker_.RaiseSyntaxError(\"Set statment has incorrect syntax.\", stmt[0].token);\n return;\n }\n\n if (stmt[1].type != Type::IDENTIFIER)\n {\n error_tracker_.RaiseSyntaxError(\"Expected variable name.\", stmt[1].token);\n return;\n }\n\n if (stmt[2].type != Type::IDENTIFIER)\n {\n error_tracker_.RaiseSyntaxError(\"Expected variable type.\", stmt[2].token);\n return;\n }\n\n std::vector<QueryVariant> stack;\n std::vector<Vocabulary> scope_objects;\n Vocabulary last;\n int scope_depth = 0;\n\n QueryVariant object_name =\n NewQueryVariant(static_cast<std::string>(stmt[1].token), TYPE_KEY, stmt[1].token);\n stack.push_back(object_name);\n\n QueryVariant model_name =\n NewQueryVariant(static_cast<std::string>(stmt[2].token), TYPE_KEY, stmt[2].token);\n stack.push_back(model_name);\n\n while (i < stmt.size())\n {\n auto x = stmt[i];\n\n switch (x.type)\n {\n case Type::PUSH_SCOPE:\n {\n ++scope_depth;\n auto obj = VocabularyInstance::New<PropertyMap>({});\n scope_objects.push_back(obj);\n break;\n }\n case Type::POP_SCOPE:\n --scope_depth;\n \n last = scope_objects.back();\n scope_objects.pop_back();\n\n {\n QueryVariant s =\n NewQueryVariant(last, TYPE_INSTANCE,\n x.token); \n stack.push_back(s);\n }\n\n break;\n\n case Type::ATTRIBUTE:\n\n {\n auto value = stack.back();\n stack.pop_back();\n auto key = stack.back();\n stack.pop_back();\n auto object = scope_objects.back();\n assert(object != nullptr);\n\n \n \n std::string name = static_cast<std::string>(key->As<Token>());\n switch (value->type())\n {\n case TYPE_INTEGER:\n object->Insert(name, VocabularyInstance::New<Int>(value->As<Int>()));\n break;\n case TYPE_FLOAT:\n object->Insert(name, VocabularyInstance::New<Float>(value->As<Float>()));\n break;\n case TYPE_STRING:\n object->Insert(name, VocabularyInstance::New<String>(value->As<String>()));\n break;\n case TYPE_INSTANCE:\n object->Insert(name, value->As<Vocabulary>());\n break;\n \n default:\n break;\n }\n }\n\n break;\n\n case Type::SEPARATOR:\n \n break;\n\n case Type::IDENTIFIER:\n {\n auto obj = context_.Get(static_cast<std::string>(\n x.token)); \n QueryVariant ele = NewQueryVariant(obj, TYPE_INSTANCE, x.token);\n\n stack.push_back(ele);\n break;\n }\n case Type::FLOAT:\n {\n QueryVariant ele = NewQueryVariant(Float(x.token.AsFloat()), TYPE_FLOAT, x.token);\n stack.push_back(ele);\n break;\n }\n case Type::INTEGER:\n {\n QueryVariant ele =\n NewQueryVariant(Int(atol(std::string(x.token).c_str())), TYPE_INTEGER, x.token);\n stack.push_back(ele);\n break;\n }\n case Type::STRING:\n {\n std::string str = static_cast<std::string>(x.token.SubArray(1, x.token.size() - 2));\n QueryVariant ele = NewQueryVariant(str, TYPE_STRING, x.token);\n stack.push_back(ele);\n break;\n }\n case Type::OBJECT_KEY:\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_KEY, x.token);\n stack.push_back(ele);\n break;\n }\n default:\n break;\n }\n\n ++i;\n }\n\n if (static_cast<bool>(last))\n {\n\n auto value = stack.back();\n stack.pop_back();\n auto model_var = stack.back();\n stack.pop_back();\n auto key = stack.back();\n stack.pop_back();\n\n \n\n auto name_of_model = model_var->As<std::string>();\n auto model = semantic_search_module_->GetModel(name_of_model);\n if (model == nullptr)\n {\n error_tracker_.RaiseRuntimeError(\"Could not find model '\" + name_of_model + \"'.\",\n stmt[stmt.size() - 1].token);\n return;\n }\n\n if (!model->Validate(last))\n {\n error_tracker_.RaiseRuntimeError(\"Instance does not match model requirements.\",\n stmt[stmt.size() - 1].token);\n \n return;\n }\n\n context_.Set(key->As<std::string>(), last, name_of_model);\n }\n else\n {\n error_tracker_.RaiseRuntimeError(\n \"No object instance was created, only declared. This is not supported yet.\",\n stmt[stmt.size() - 1].token);\n return;\n }\n}\n\nvoid QueryExecutor::ExecuteDefine(CompiledStatement const &stmt)\n{\n std::size_t i = 1;\n\n stack_.clear();\n std::vector<ModelInterfaceBuilder> scope_models;\n ModelInterfaceBuilder last;\n int scope_depth = 0;\n\n using Type = QueryInstruction::Type;\n\n while (i < stmt.size())\n {\n auto x = stmt[i];\n\n switch (x.type)\n {\n case Type::PUSH_SCOPE:\n ++scope_depth;\n scope_models.push_back(semantic_search_module_->NewProxy());\n break;\n\n case Type::POP_SCOPE:\n\n --scope_depth;\n \n last = scope_models.back();\n scope_models.pop_back();\n\n {\n QueryVariant s = NewQueryVariant(last.model(), TYPE_MODEL, x.token);\n stack_.push_back(s);\n }\n\n break;\n\n case Type::ATTRIBUTE:\n {\n QueryVariant value = stack_.back();\n stack_.pop_back();\n QueryVariant key = stack_.back();\n stack_.pop_back();\n\n auto model = scope_models.back();\n\n \n if (TypeMismatch<ModelField>(value, x.token))\n {\n return;\n }\n\n if (TypeMismatch<Token>(key, x.token))\n {\n return;\n }\n\n \n if (value->As<ModelField>() == nullptr)\n {\n error_tracker_.RaiseInternalError(\"Attribute value is null.\", x.token);\n break;\n }\n\n if (model.model() == nullptr)\n {\n error_tracker_.RaiseInternalError(\"Model is null.\", x.token);\n break;\n }\n\n \n model.Field(static_cast<std::string>(key->As<Token>()), value->As<ModelField>());\n }\n\n break;\n\n case Type::SEPARATOR:\n \n break;\n\n case Type::IDENTIFIER:\n if (scope_depth == 0)\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_KEY, x.token);\n stack_.push_back(ele);\n }\n else\n {\n auto field_name = static_cast<std::string>(x.token);\n if (!semantic_search_module_->HasField(field_name))\n {\n error_tracker_.RaiseRuntimeError(\n \"Could not find field: \" + static_cast<std::string>(x.token), x.token);\n return;\n }\n\n QueryVariant ele =\n NewQueryVariant(semantic_search_module_->GetField(field_name), TYPE_MODEL, x.token);\n stack_.push_back(ele);\n }\n\n break;\n case Type::FLOAT:\n {\n QueryVariant ele = NewQueryVariant(x.token.AsFloat(), TYPE_FLOAT, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::INTEGER:\n {\n QueryVariant ele =\n NewQueryVariant(Int(atol(std::string(x.token).c_str())), TYPE_INTEGER, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::STRING:\n {\n std::string str = static_cast<std::string>(x.token.SubArray(1, x.token.size() - 2));\n QueryVariant ele = NewQueryVariant(str, TYPE_STRING, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::OBJECT_KEY:\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_KEY, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::FUNCTION:\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_FUNCTION_NAME, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::EXECUTE_CALL:\n {\n if (stack_.empty())\n {\n std::cerr << \"INTERNAL ERROR!\" << std::endl; \n exit(-1);\n }\n\n std::vector<void const *> args;\n std::vector<std::type_index> arg_signature;\n\n \n uint64_t n = stack_.size() - 1;\n while ((n != 0) && (stack_[n]->type() != TYPE_FUNCTION_NAME))\n {\n auto arg = stack_[n];\n args.push_back(arg->data());\n arg_signature.push_back(arg->type_index());\n\n --n;\n }\n\n \n std::reverse(args.begin(), args.end());\n std::reverse(arg_signature.begin(), arg_signature.end());\n\n \n if (TypeMismatch<Token>(stack_[n], stack_[n]->token()))\n {\n return;\n }\n auto function_name = static_cast<std::string>(stack_[n]->As<Token>());\n\n if (!semantic_search_module_->HasFunction(function_name))\n {\n error_tracker_.RaiseRuntimeError(\"Function '\" + function_name + \"' does not exist.\",\n stack_[n]->token());\n return;\n }\n\n auto & function = (*semantic_search_module_)[function_name];\n std::type_index ret_type = function.return_type();\n\n if (!function.ValidateSignature(ret_type, arg_signature))\n {\n error_tracker_.RaiseRuntimeError(\n \"Call to '\" + function_name + \"' does not match signature.\", stack_[n]->token());\n return;\n }\n\n QueryVariant ret;\n try\n {\n ret = function(args);\n }\n catch (std::runtime_error const &e)\n {\n error_tracker_.RaiseRuntimeError(e.what(), stack_[n]->token());\n return;\n }\n\n \n for (std::size_t j = 0; j < args.size(); ++j)\n {\n stack_.pop_back();\n }\n stack_.pop_back(); \n\n \n stack_.push_back(ret);\n break;\n }\n default:\n std::cout << \"'\" << x.token << \"' - TODO IMPLEMENT \"\n << std::endl; \n break;\n }\n\n ++i;\n }\n\n if (bool(last))\n {\n auto value = stack_.back();\n stack_.pop_back();\n auto key = stack_.back();\n stack_.pop_back();\n\n \n semantic_search_module_->AddModel(static_cast<std::string>(key->As<Token>()), last.model());\n }\n else\n {\n \n std::cout << \"NOT READY: \" << last.model() << std::endl;\n }\n}\n\n} \n} \n"},"prefix":{"kind":"string","value":"\n\n#include \"semanticsearch/query/query_executor.hpp\"\n\n#include <cassert>\n\nnamespace fetch {\nnamespace semanticsearch {\n\nQueryExecutor::QueryExecutor(SharedSemanticSearchModule instance, ErrorTracker &error_tracker)\n : error_tracker_(error_tracker)\n , semantic_search_module_{std::move(instance)}\n{}\n\nvoid QueryExecutor::Execute(Query const &query, Agent agent)\n{\n agent_ = std::move(agent);\n error_tracker_.SetSource(query.source, query.filename);\n if (query.statements.empty())\n {\n return;\n }\n\n for (auto const &stmt : query.statements)\n {\n switch (stmt[0].properties)\n {\n case QueryInstruction::PROP_CTX_MODEL:\n ExecuteDefine(stmt);\n break;\n case QueryInstruction::PROP_CTX_SET:\n ExecuteSet(stmt);\n break;\n case QueryInstruction::PROP_CTX_STORE:\n ExecuteStore(stmt);\n break;\n default:\n error_tracker_.RaiseRuntimeError(\"Unknown statement type.\", stmt[0].token);\n return;\n }\n\n if (error_tracker_.HasErrors())\n {\n break;\n }\n }\n}\n\nQueryExecutor::Vocabulary QueryExecutor::GetInstance(std::string const &name)\n{\n assert(context_.Has(name));\n return context_.Get(name);\n}\n\nvoid QueryExecutor::ExecuteStore(CompiledStatement const &stmt)\n{\n using Type = QueryInstruction::Type;\n\n if (stmt[1].type != Type::IDENTIFIER)\n {\n error_tracker_.RaiseSyntaxError(\"Expected variable name.\", stmt[1].token);\n return;\n }\n\n auto name = static_cast<std::string>(stmt[1].token);\n\n if (!context_.Has(name))\n {\n error_tracker_.RaiseSyntaxError(\"Vairable not defined\", stmt[1].token);\n return;\n }\n\n auto obj = context_.Get(name);\n auto model_name = context_.GetModelName(name);\n\n if (!semantic_search_module_->HasModel(model_name))\n {\n error_tracker_.RaiseSyntaxError(\"Could not find model '\" + model_name + \"'\", stmt[1].token);\n return;\n }\n\n auto model = semantic_search_module_->GetModel(model_name);\n if (model == nullptr)\n {\n error_tracker_.RaiseInternalError(\"Model '\" + model_name + \"' is null.\", stmt[1].token);\n return;\n }\n\n "},"suffix":{"kind":"string","value":";\n}\n\nvoid QueryExecutor::ExecuteSet(CompiledStatement const &stmt)\n{\n using Type = QueryInstruction::Type;\n std::size_t i = 3;\n\n if (stmt.size() < i)\n {\n error_tracker_.RaiseSyntaxError(\"Set statment has incorrect syntax.\", stmt[0].token);\n return;\n }\n\n if (stmt[1].type != Type::IDENTIFIER)\n {\n error_tracker_.RaiseSyntaxError(\"Expected variable name.\", stmt[1].token);\n return;\n }\n\n if (stmt[2].type != Type::IDENTIFIER)\n {\n error_tracker_.RaiseSyntaxError(\"Expected variable type.\", stmt[2].token);\n return;\n }\n\n std::vector<QueryVariant> stack;\n std::vector<Vocabulary> scope_objects;\n Vocabulary last;\n int scope_depth = 0;\n\n QueryVariant object_name =\n NewQueryVariant(static_cast<std::string>(stmt[1].token), TYPE_KEY, stmt[1].token);\n stack.push_back(object_name);\n\n QueryVariant model_name =\n NewQueryVariant(static_cast<std::string>(stmt[2].token), TYPE_KEY, stmt[2].token);\n stack.push_back(model_name);\n\n while (i < stmt.size())\n {\n auto x = stmt[i];\n\n switch (x.type)\n {\n case Type::PUSH_SCOPE:\n {\n ++scope_depth;\n auto obj = VocabularyInstance::New<PropertyMap>({});\n scope_objects.push_back(obj);\n break;\n }\n case Type::POP_SCOPE:\n --scope_depth;\n \n last = scope_objects.back();\n scope_objects.pop_back();\n\n {\n QueryVariant s =\n NewQueryVariant(last, TYPE_INSTANCE,\n x.token); \n stack.push_back(s);\n }\n\n break;\n\n case Type::ATTRIBUTE:\n\n {\n auto value = stack.back();\n stack.pop_back();\n auto key = stack.back();\n stack.pop_back();\n auto object = scope_objects.back();\n assert(object != nullptr);\n\n \n \n std::string name = static_cast<std::string>(key->As<Token>());\n switch (value->type())\n {\n case TYPE_INTEGER:\n object->Insert(name, VocabularyInstance::New<Int>(value->As<Int>()));\n break;\n case TYPE_FLOAT:\n object->Insert(name, VocabularyInstance::New<Float>(value->As<Float>()));\n break;\n case TYPE_STRING:\n object->Insert(name, VocabularyInstance::New<String>(value->As<String>()));\n break;\n case TYPE_INSTANCE:\n object->Insert(name, value->As<Vocabulary>());\n break;\n \n default:\n break;\n }\n }\n\n break;\n\n case Type::SEPARATOR:\n \n break;\n\n case Type::IDENTIFIER:\n {\n auto obj = context_.Get(static_cast<std::string>(\n x.token)); \n QueryVariant ele = NewQueryVariant(obj, TYPE_INSTANCE, x.token);\n\n stack.push_back(ele);\n break;\n }\n case Type::FLOAT:\n {\n QueryVariant ele = NewQueryVariant(Float(x.token.AsFloat()), TYPE_FLOAT, x.token);\n stack.push_back(ele);\n break;\n }\n case Type::INTEGER:\n {\n QueryVariant ele =\n NewQueryVariant(Int(atol(std::string(x.token).c_str())), TYPE_INTEGER, x.token);\n stack.push_back(ele);\n break;\n }\n case Type::STRING:\n {\n std::string str = static_cast<std::string>(x.token.SubArray(1, x.token.size() - 2));\n QueryVariant ele = NewQueryVariant(str, TYPE_STRING, x.token);\n stack.push_back(ele);\n break;\n }\n case Type::OBJECT_KEY:\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_KEY, x.token);\n stack.push_back(ele);\n break;\n }\n default:\n break;\n }\n\n ++i;\n }\n\n if (static_cast<bool>(last))\n {\n\n auto value = stack.back();\n stack.pop_back();\n auto model_var = stack.back();\n stack.pop_back();\n auto key = stack.back();\n stack.pop_back();\n\n \n\n auto name_of_model = model_var->As<std::string>();\n auto model = semantic_search_module_->GetModel(name_of_model);\n if (model == nullptr)\n {\n error_tracker_.RaiseRuntimeError(\"Could not find model '\" + name_of_model + \"'.\",\n stmt[stmt.size() - 1].token);\n return;\n }\n\n if (!model->Validate(last))\n {\n error_tracker_.RaiseRuntimeError(\"Instance does not match model requirements.\",\n stmt[stmt.size() - 1].token);\n \n return;\n }\n\n context_.Set(key->As<std::string>(), last, name_of_model);\n }\n else\n {\n error_tracker_.RaiseRuntimeError(\n \"No object instance was created, only declared. This is not supported yet.\",\n stmt[stmt.size() - 1].token);\n return;\n }\n}\n\nvoid QueryExecutor::ExecuteDefine(CompiledStatement const &stmt)\n{\n std::size_t i = 1;\n\n stack_.clear();\n std::vector<ModelInterfaceBuilder> scope_models;\n ModelInterfaceBuilder last;\n int scope_depth = 0;\n\n using Type = QueryInstruction::Type;\n\n while (i < stmt.size())\n {\n auto x = stmt[i];\n\n switch (x.type)\n {\n case Type::PUSH_SCOPE:\n ++scope_depth;\n scope_models.push_back(semantic_search_module_->NewProxy());\n break;\n\n case Type::POP_SCOPE:\n\n --scope_depth;\n \n last = scope_models.back();\n scope_models.pop_back();\n\n {\n QueryVariant s = NewQueryVariant(last.model(), TYPE_MODEL, x.token);\n stack_.push_back(s);\n }\n\n break;\n\n case Type::ATTRIBUTE:\n {\n QueryVariant value = stack_.back();\n stack_.pop_back();\n QueryVariant key = stack_.back();\n stack_.pop_back();\n\n auto model = scope_models.back();\n\n \n if (TypeMismatch<ModelField>(value, x.token))\n {\n return;\n }\n\n if (TypeMismatch<Token>(key, x.token))\n {\n return;\n }\n\n \n if (value->As<ModelField>() == nullptr)\n {\n error_tracker_.RaiseInternalError(\"Attribute value is null.\", x.token);\n break;\n }\n\n if (model.model() == nullptr)\n {\n error_tracker_.RaiseInternalError(\"Model is null.\", x.token);\n break;\n }\n\n \n model.Field(static_cast<std::string>(key->As<Token>()), value->As<ModelField>());\n }\n\n break;\n\n case Type::SEPARATOR:\n \n break;\n\n case Type::IDENTIFIER:\n if (scope_depth == 0)\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_KEY, x.token);\n stack_.push_back(ele);\n }\n else\n {\n auto field_name = static_cast<std::string>(x.token);\n if (!semantic_search_module_->HasField(field_name))\n {\n error_tracker_.RaiseRuntimeError(\n \"Could not find field: \" + static_cast<std::string>(x.token), x.token);\n return;\n }\n\n QueryVariant ele =\n NewQueryVariant(semantic_search_module_->GetField(field_name), TYPE_MODEL, x.token);\n stack_.push_back(ele);\n }\n\n break;\n case Type::FLOAT:\n {\n QueryVariant ele = NewQueryVariant(x.token.AsFloat(), TYPE_FLOAT, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::INTEGER:\n {\n QueryVariant ele =\n NewQueryVariant(Int(atol(std::string(x.token).c_str())), TYPE_INTEGER, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::STRING:\n {\n std::string str = static_cast<std::string>(x.token.SubArray(1, x.token.size() - 2));\n QueryVariant ele = NewQueryVariant(str, TYPE_STRING, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::OBJECT_KEY:\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_KEY, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::FUNCTION:\n {\n QueryVariant ele = NewQueryVariant(x.token, TYPE_FUNCTION_NAME, x.token);\n stack_.push_back(ele);\n break;\n }\n case Type::EXECUTE_CALL:\n {\n if (stack_.empty())\n {\n std::cerr << \"INTERNAL ERROR!\" << std::endl; \n exit(-1);\n }\n\n std::vector<void const *> args;\n std::vector<std::type_index> arg_signature;\n\n \n uint64_t n = stack_.size() - 1;\n while ((n != 0) && (stack_[n]->type() != TYPE_FUNCTION_NAME))\n {\n auto arg = stack_[n];\n args.push_back(arg->data());\n arg_signature.push_back(arg->type_index());\n\n --n;\n }\n\n \n std::reverse(args.begin(), args.end());\n std::reverse(arg_signature.begin(), arg_signature.end());\n\n \n if (TypeMismatch<Token>(stack_[n], stack_[n]->token()))\n {\n return;\n }\n auto function_name = static_cast<std::string>(stack_[n]->As<Token>());\n\n if (!semantic_search_module_->HasFunction(function_name))\n {\n error_tracker_.RaiseRuntimeError(\"Function '\" + function_name + \"' does not exist.\",\n stack_[n]->token());\n return;\n }\n\n auto & function = (*semantic_search_module_)[function_name];\n std::type_index ret_type = function.return_type();\n\n if (!function.ValidateSignature(ret_type, arg_signature))\n {\n error_tracker_.RaiseRuntimeError(\n \"Call to '\" + function_name + \"' does not match signature.\", stack_[n]->token());\n return;\n }\n\n QueryVariant ret;\n try\n {\n ret = function(args);\n }\n catch (std::runtime_error const &e)\n {\n error_tracker_.RaiseRuntimeError(e.what(), stack_[n]->token());\n return;\n }\n\n \n for (std::size_t j = 0; j < args.size(); ++j)\n {\n stack_.pop_back();\n }\n stack_.pop_back(); \n\n \n stack_.push_back(ret);\n break;\n }\n default:\n std::cout << \"'\" << x.token << \"' - TODO IMPLEMENT \"\n << std::endl; \n break;\n }\n\n ++i;\n }\n\n if (bool(last))\n {\n auto value = stack_.back();\n stack_.pop_back();\n auto key = stack_.back();\n stack_.pop_back();\n\n \n semantic_search_module_->AddModel(static_cast<std::string>(key->As<Token>()), last.model());\n }\n else\n {\n \n std::cout << \"NOT READY: \" << last.model() << std::endl;\n }\n}\n\n} \n} \n"},"middle":{"kind":"string","value":"model->VisitSubmodelsWithVocabulary(\n [this, stmt](std::string, std::string mname, Vocabulary obj) {\n auto model = semantic_search_module_->GetModel(mname);\n if (model == nullptr)\n {\n error_tracker_.RaiseSyntaxError(\"Could not find model '\" + mname + \"'\", stmt[1].token);\n return;\n }\n SemanticPosition position = model->Reduce(obj);\n assert(semantic_search_module_->advertisement_register() != nullptr);\n\n semantic_search_module_->advertisement_register()->AdvertiseAgent(agent_->id, mname,\n position);\n agent_->RegisterVocabularyLocation(mname, position);\n },\n obj)"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":" enum class Type\n\n {\n\n UNKNOWN = 0,\n\n SET_CONTEXT,\n\n PUSH_SCOPE,\n\n POP_SCOPE,\n\n\n\n FUNCTION = 50,\n\n EXECUTE_CALL,\n\n\n\n // Operators come first and are ordered according to precendence\n\n // That is: DO not change the order unless you intensionally\n\n // want to change the behaviour of the program.\n\n MULTIPLY = 100,\n\n ADD,\n\n SUB,\n\n\n\n EQUAL,\n\n NOT_EQUAL,\n\n LESS_THAN,\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp","rank":0,"score":289331.1386359479},{"content":"struct MapSerializer<fetch::ml::model::ModelConfig<DataType>, D>\n\n{\n\n using Type = fetch::ml::model::ModelConfig<DataType>;\n\n using DriverType = D;\n\n\n\n // public member variables\n\n static uint8_t const EARLY_STOPPING = 1;\n\n static uint8_t const TEST = 2;\n\n static uint8_t const PATIENCE = 3;\n\n static uint8_t const MIN_DELTA = 4;\n\n static uint8_t const LEARNING_RATE_PARAM = 6;\n\n static uint8_t const BATCH_SIZE = 7;\n\n static uint8_t const SUSBET_SIZE = 8;\n\n static uint8_t const PRINT_STATS = 9;\n\n\n\n template <typename Constructor>\n\n static void Serialize(Constructor &map_constructor, Type const &sp)\n\n {\n\n auto map = map_constructor(9);\n\n\n","file_path":"libs/ml/include/ml/model/model_config.hpp","rank":1,"score":270665.2542752603},{"content":"type InnerProduct(array_type const &A, array_type const &B)\n\n{\n\n type ret{0};\n\n\n\n ret = A.in_parallel().SumReduce(\n\n [](auto const &a, auto const &b) {\n\n auto d = a - b;\n\n return d * d;\n\n },\n\n B);\n\n\n\n return ret;\n\n}\n\n\n\nint main(int argc, char const **argv)\n\n{\n\n if (argc != 2)\n\n {\n\n std::cout << std::endl;\n\n std::cout << \"Usage: \" << argv[0] << \" [array size] \" << std::endl;\n","file_path":"libs/vectorise/examples/03_sum_reduce_fetch/main.cpp","rank":2,"score":256100.03522125137},{"content":"type InnerProduct(array_type const &A, array_type const &B)\n\n{\n\n type ret = 0;\n\n\n\n ret = A.in_parallel().SumReduce(\n\n [](auto const &a, auto const &b) {\n\n auto d = a - b;\n\n return d * d;\n\n },\n\n B);\n\n\n\n return ret;\n\n}\n\n\n\nint main(int /*argc*/, char ** /*argv*/)\n\n{\n\n array_type A, B;\n\n\n\n double product = InnerProduct(A, B);\n\n std::cout << \"product = \" << product << std::endl;\n\n\n\n return 0;\n\n}\n","file_path":"libs/vectorise/examples/04_product_reduce_fetch/main.cpp","rank":3,"score":256100.03522125137},{"content":"struct ArgumentsToTypeVector<R, void>\n\n{\n\n static void Apply(std::vector<std::type_index> & /*args*/)\n\n {}\n\n};\n\n\n\n/* This code converts a vector of type-erased types\n\n * into the types matching the argument types.\n\n */\n\ntemplate <uint64_t N, typename... UsedArgs>\n","file_path":"libs/semanticsearch/include/semanticsearch/module/args_resolver.hpp","rank":4,"score":255810.43422285342},{"content":"type Reduction(array_type const &A)\n\n{\n\n type ret{0};\n\n\n\n ret = A.in_parallel().Reduce([](auto const &a, auto const &b) { return a + b; },\n\n [](vector_type const &a) -> type { return reduce(a); });\n\n\n\n return ret;\n\n}\n\n\n\nint main(int argc, char const **argv)\n\n{\n\n if (argc != 2)\n\n {\n\n std::cout << std::endl;\n\n std::cout << \"Usage: \" << argv[0] << \" [array size] \" << std::endl;\n\n std::cout << std::endl;\n\n return 0;\n\n }\n\n\n","file_path":"libs/vectorise/examples/02_reduction_fetch/main.cpp","rank":5,"score":251146.5771658036},{"content":"class Switch : public fetch::ml::ops::Ops<T>\n\n{\n\npublic:\n\n using TensorType = T;\n\n using DataType = typename TensorType::Type;\n\n using SizeType = fetch::math::SizeType;\n\n using ArrayPtrType = std::shared_ptr<TensorType>;\n\n using VecTensorType = typename Ops<T>::VecTensorType;\n\n using SPType = OpSwitchSaveableParams<T>;\n\n using MyType = Switch<TensorType>;\n\n\n\n Switch() = default;\n\n\n\n explicit Switch(SPType const &sp)\n\n : Ops<T>(sp)\n\n {}\n\n\n\n ~Switch() override = default;\n\n\n\n std::shared_ptr<OpsSaveableParams> GetOpSaveableParams() override\n","file_path":"libs/ml/include/ml/ops/switch.hpp","rank":6,"score":223860.00393159877},{"content":"struct MapSerializer<ml::model::Model<TensorType>, D>\n\n{\n\n using Type = ml::model::Model<TensorType>;\n\n using DriverType = D;\n\n\n\n // protected member variables\n\n static uint8_t const GRAPH = 1;\n\n static uint8_t const MODEL_CONFIG = 2;\n\n static uint8_t const DATALOADER_PTR = 3;\n\n static uint8_t const DATALOADER_TYPE = 4;\n\n static uint8_t const OPTIMISER_PTR = 5;\n\n static uint8_t const OPTIMISER_TYPE = 6;\n\n\n\n static uint8_t const INPUT_NODE_NAME = 7;\n\n static uint8_t const LABEL_NODE_NAME = 8;\n\n static uint8_t const OUTPUT_NODE_NAME = 9;\n\n static uint8_t const ERROR_NODE_NAME = 10;\n\n\n\n static uint8_t const LOSS_SET_FLAG = 11;\n\n static uint8_t const OPTIMISER_SET_FLAG = 12;\n","file_path":"libs/ml/include/ml/model/model.hpp","rank":7,"score":218022.4973769128},{"content":"struct Invoke<ClassType, MemberFunctionPointer, void, UsedArgs...>\n\n{\n\n static void MemberFunction(SerializerType &result, ClassType &cls, MemberFunctionPointer &m,\n\n UsedArgs &... args)\n\n {\n\n result << uint8_t(0);\n\n (cls.*m)(args...);\n\n };\n\n};\n\n\n\n/* Struct used for unrolling arguments in a function signature.\n\n * @UsedArgs are the unpacked arguments.\n\n */\n\ntemplate <typename ClassType, typename MemberFunctionPointer, typename ReturnType,\n\n typename... UsedArgs>\n","file_path":"libs/network/include/network/service/callable_class_member.hpp","rank":8,"score":213207.68423119298},{"content":"type InnerProduct(array_type const &A, array_type const &B)\n\n{\n\n type ret{0};\n\n\n\n for (std::size_t i = 0; i < A.size(); ++i)\n\n {\n\n type d = A[i] - B[i];\n\n ret += d * d;\n\n }\n\n\n\n return ret;\n\n}\n\n\n\nint main(int argc, char const **argv)\n\n{\n\n\n\n if (argc != 2)\n\n {\n\n std::cout << std::endl;\n\n std::cout << \"Usage: \" << argv[0] << \" [array size] \" << std::endl;\n","file_path":"libs/vectorise/examples/03_sum_reduce/ordinary_solution.cpp","rank":9,"score":210272.00089386024},{"content":"class Sequential : public Model<TensorType>\n\n{\n\npublic:\n\n using SizeType = fetch::math::SizeType;\n\n using DataType = typename TensorType::Type;\n\n using CostFunctionType = fetch::ml::ops::CrossEntropyLoss<TensorType>;\n\n using OptimiserType = fetch::ml::OptimiserType;\n\n using DataLoaderPtrType = typename Model<TensorType>::DataLoaderPtrType;\n\n\n\n Sequential();\n\n Sequential(Sequential const &other) = default;\n\n explicit Sequential(ModelConfig<DataType> model_config);\n\n ~Sequential() override = default;\n\n\n\n template <typename LayerType, typename... Params>\n\n void Add(Params... params);\n\n\n\n template <typename X, typename D>\n\n friend struct serializers::MapSerializer;\n\n\n","file_path":"libs/ml/include/ml/model/sequential.hpp","rank":10,"score":205855.93084630012},{"content":"struct MemberFunctionTraits<void, R (C::*)(Args...) const>\n\n{\n\n using ReturnType = R;\n\n using ArgsTupleType = std::tuple<Args...>;\n\n};\n\ntemplate <typename R, typename C, typename... Args>\n","file_path":"libs/meta/include/meta/callable/callable_traits.hpp","rank":11,"score":205655.82208797312},{"content":"struct Query\n\n{\n\n using ConstByteArray = fetch::byte_array::ConstByteArray;\n\n ConstByteArray source;\n\n ConstByteArray filename;\n\n std::vector<CompiledStatement> statements;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query.hpp","rank":12,"score":204031.11548877592},{"content":"\n\n#include \"core/byte_array/byte_array.hpp\"\n\n#include \"core/byte_array/const_byte_array.hpp\"\n\n#include \"core/byte_array/consumers.hpp\"\n\n#include \"core/byte_array/tokenizer/tokenizer.hpp\"\n\n\n\n#include <vector>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query.hpp","rank":13,"score":201113.7491416155},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/query/query_instruction.hpp\"\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query.hpp","rank":14,"score":201112.79322393824},{"content":"class DNNRegressor : public Model<TensorType>\n\n{\n\npublic:\n\n using SizeType = fetch::math::SizeType;\n\n using DataType = typename TensorType::Type;\n\n using CostFunctionType = fetch::ml::ops::MeanSquareErrorLoss<TensorType>;\n\n using OptimiserType = fetch::ml::OptimiserType;\n\n using DataLoaderPtrType = typename Model<TensorType>::DataLoaderPtrType;\n\n\n\n DNNRegressor() = default;\n\n DNNRegressor(DNNRegressor const &other) = default;\n\n ~DNNRegressor() override = default;\n\n\n\n DNNRegressor(ModelConfig<DataType> model_config, std::vector<SizeType> const &hidden_layers);\n\n};\n\n\n\n/**\n\n * constructor sets up the neural net architecture and optimiser\n\n * @tparam TensorType\n\n * @param data_loader_ptr pointer to the dataloader for running the optimiser\n","file_path":"libs/ml/include/ml/model/dnn_regressor.hpp","rank":15,"score":199220.0237408324},{"content":"class DNNClassifier : public Model<TensorType>\n\n{\n\npublic:\n\n using SizeType = fetch::math::SizeType;\n\n using DataType = typename TensorType::Type;\n\n using CostFunctionType = fetch::ml::ops::CrossEntropyLoss<TensorType>;\n\n using OptimiserType = fetch::ml::OptimiserType;\n\n using DataLoaderPtrType = typename Model<TensorType>::DataLoaderPtrType;\n\n\n\n DNNClassifier() = default;\n\n DNNClassifier(DNNClassifier const &other) = default;\n\n ~DNNClassifier() override = default;\n\n\n\n DNNClassifier(ModelConfig<DataType> model_config, std::vector<SizeType> const &hidden_layers);\n\n};\n\n\n\n/**\n\n * constructor sets up the neural net architecture and optimiser\n\n * @tparam TensorType\n\n * @param data_loader_ptr pointer to the dataloader for running the optimiser\n","file_path":"libs/ml/include/ml/model/dnn_classifier.hpp","rank":16,"score":199220.0237408324},{"content":"class VMModel : public fetch::vm::Object\n\n{\n\npublic:\n\n using DataType = fetch::vm_modules::math::DataType;\n\n using TensorType = fetch::math::Tensor<DataType>;\n\n using ModelType = fetch::ml::model::Model<TensorType>;\n\n using ModelPtrType = std::shared_ptr<ModelType>;\n\n using ModelConfigType = fetch::ml::model::ModelConfig<DataType>;\n\n using ModelConfigPtrType = std::shared_ptr<fetch::ml::model::ModelConfig<DataType>>;\n\n using GraphType = fetch::ml::Graph<TensorType>;\n\n using TensorDataloader = fetch::ml::dataloaders::TensorDataLoader<TensorType, TensorType>;\n\n using TensorDataloaderPtr = std::shared_ptr<TensorDataloader>;\n\n using VMTensor = fetch::vm_modules::math::VMTensor;\n\n\n\n VMModel(fetch::vm::VM *vm, fetch::vm::TypeId type_id);\n\n\n\n VMModel(fetch::vm::VM *vm, fetch::vm::TypeId type_id,\n\n fetch::vm::Ptr<fetch::vm::String> const &model_category);\n\n\n\n VMModel(fetch::vm::VM *vm, fetch::vm::TypeId type_id, std::string const &model_category);\n","file_path":"libs/vm-modules/include/vm_modules/ml/model/model.hpp","rank":17,"score":198672.188464703},{"content":"type Reduction(array_type const &A)\n\n{\n\n type ret = 0;\n\n\n\n for (float i : A)\n\n {\n\n ret += i;\n\n }\n\n\n\n return ret;\n\n}\n\n\n\nint main(int argc, char const **argv)\n\n{\n\n std::vector<type> A;\n\n if (argc != 2)\n\n {\n\n std::cout << std::endl;\n\n std::cout << \"Usage: \" << argv[0] << \" [array size] \" << std::endl;\n\n std::cout << std::endl;\n","file_path":"libs/vectorise/examples/02_reduction/ordinary_solution.cpp","rank":18,"score":198535.96208472},{"content":" enum\n\n {\n\n TYPE_NONE = 0,\n\n TYPE_MODEL = 10,\n\n TYPE_INSTANCE,\n\n TYPE_KEY,\n\n TYPE_STRING,\n\n TYPE_INTEGER,\n\n TYPE_FLOAT,\n\n\n\n TYPE_FUNCTION_NAME\n\n };\n\n\n\n // TODO(private issue AEA-128): combine these three into a single execute statement.\n\n void ExecuteStore(CompiledStatement const &stmt);\n\n void ExecuteSet(CompiledStatement const &stmt);\n\n void ExecuteDefine(CompiledStatement const &stmt);\n\n\n\n template <typename T>\n\n bool TypeMismatch(QueryVariant const &var, Token token)\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp","rank":19,"score":197222.233550629},{"content":" {\n\n if (!var->IsType<T>())\n\n {\n\n auto type_a = semantic_search_module_->GetName<T>();\n\n auto type_b = semantic_search_module_->GetName(var->type_index());\n\n error_tracker_.RaiseInternalError(\"Expected \" + type_a + \", but found other type \" + type_b,\n\n std::move(token));\n\n return true;\n\n }\n\n return false;\n\n }\n\n\n\n ErrorTracker & error_tracker_;\n\n std::vector<QueryVariant> stack_;\n\n ExecutionContext context_;\n\n SharedSemanticSearchModule semantic_search_module_;\n\n Agent agent_{nullptr};\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp","rank":20,"score":197215.21693077145},{"content":" INTERNAL_OPEN_GROUP,\n\n INTERNAL_CLOSE_GROUP\n\n };\n\n\n\n enum\n\n {\n\n PROP_NO_PROP = 0ull,\n\n PROP_CTX_MODEL,\n\n PROP_CTX_STORE,\n\n PROP_CTX_SET,\n\n PROP_CTX_FIND,\n\n\n\n PROP_IS_OPERATOR = 1ul << 16,\n\n PROP_IS_GROUP = 1ul << 17,\n\n PROP_IS_GROUP_OPEN = 1ul << 18,\n\n PROP_IS_CALL = 1ul << 19\n\n };\n\n\n\n Type type = Type::UNKNOWN;\n\n uint64_t properties = PROP_NO_PROP;\n\n int consumes = 2;\n\n Token token;\n\n};\n\n\n\nusing CompiledStatement = std::vector<QueryInstruction>;\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp","rank":21,"score":197211.77258214226},{"content":" bool Match(ConstByteArray const &token) const;\n\n void SkipUntilEOL();\n\n void SkipWhitespaces();\n\n void SkipChar();\n\n void SkipChars(uint64_t const &length);\n\n\n\n void SkipUntil(uint8_t byte);\n\n\n\n ErrorTracker &error_tracker_;\n\n ByteArray document_;\n\n uint64_t position_{0};\n\n uint64_t char_index_{0};\n\n int line_{0};\n\n\n\n std::vector<Statement> statements_;\n\n\n\n std::vector<ConstByteArray> keywords_ = {\"model\", \"store\", \"find\", \"var\", \"subspace\", \"schema\"};\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp","rank":22,"score":197206.76158881577},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/query/error_tracker.hpp\"\n\n#include \"semanticsearch/query/execution_context.hpp\"\n\n#include \"semanticsearch/schema/vocabulary_instance.hpp\"\n\n#include \"semanticsearch/semantic_search_module.hpp\"\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp","rank":23,"score":197205.92805941642},{"content":"#include \"core/byte_array/const_byte_array.hpp\"\n\n#include \"core/byte_array/consumers.hpp\"\n\n#include \"core/byte_array/tokenizer/tokenizer.hpp\"\n\n\n\n#include \"semanticsearch/query/error_tracker.hpp\"\n\n#include \"semanticsearch/query/query.hpp\"\n\n\n\n#include <vector>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp","rank":24,"score":197201.15004570823},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"core/byte_array/byte_array.hpp\"\n\n#include \"core/byte_array/const_byte_array.hpp\"\n\n#include \"core/byte_array/consumers.hpp\"\n\n#include \"core/byte_array/tokenizer/tokenizer.hpp\"\n\n\n\n#include <vector>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp","rank":25,"score":197192.24509104964},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"core/byte_array/byte_array.hpp\"\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp","rank":26,"score":197179.35765690348},{"content":" LESS_THAN_EQUAL,\n\n MORE_THAN,\n\n MORE_THAN_EQUAL,\n\n\n\n SUBSCOPE,\n\n VAR_TYPE,\n\n ASSIGN,\n\n ATTRIBUTE,\n\n SEPARATOR,\n\n\n\n OBJECT_KEY,\n\n\n\n // Literals\n\n FLOAT,\n\n INTEGER,\n\n STRING,\n\n\n\n IDENTIFIER,\n\n\n\n // Only used for compilation\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp","rank":27,"score":197177.69648052406},{"content":"struct QueryInstruction\n\n{\n\n using ConstByteArray = fetch::byte_array::ConstByteArray;\n\n using ByteArray = fetch::byte_array::ByteArray;\n\n using Token = fetch::byte_array::Token;\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp","rank":28,"score":197098.57604697032},{"content":"class QueryCompiler\n\n{\n\npublic:\n\n using ConstByteArray = fetch::byte_array::ConstByteArray;\n\n using ByteArray = fetch::byte_array::ByteArray;\n\n using Token = fetch::byte_array::Token;\n\n\n\n explicit QueryCompiler(ErrorTracker &error_tracker);\n\n Query operator()(ByteArray doc, ConstByteArray const &filename = \"(internal)\");\n\n\n\nprivate:\n\n struct Statement\n\n {\n\n std::vector<Token> tokens;\n\n int type;\n\n };\n\n\n\n std::vector<QueryInstruction> AssembleStatement(Statement const &stmt);\n\n void Tokenise();\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp","rank":29,"score":197098.57604697032},{"content":"class QueryExecutor\n\n{\n\npublic:\n\n using VocabularySchema = SemanticSearchModule::VocabularySchema;\n\n using ModelField = SemanticSearchModule::ModelField;\n\n using Token = fetch::byte_array::Token;\n\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\n\n using SharedModelRegister = ModelRegister::SharedModelRegister;\n\n\n\n using Int = int; // TODO(private issue AEA-126): Get rid of these\n\n using Float = double;\n\n using String = std::string;\n\n\n\n QueryExecutor(SharedSemanticSearchModule instance, ErrorTracker &error_tracker);\n\n void Execute(Query const &query, Agent agent);\n\n Vocabulary GetInstance(std::string const &name);\n\n\n\nprivate:\n\n using PropertyMap = std::map<std::string, std::shared_ptr<VocabularyInstance>>;\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp","rank":30,"score":197098.57604697032},{"content":" , value_{std::move(value)}\n\n {}\n\n\n\n T value_;\n\n};\n\n\n\nusing QueryVariant = std::shared_ptr<AbstractQueryVariant>;\n\n\n\ntemplate <typename T>\n\nQueryVariant NewQueryVariant(\n\n T val, int type = 0,\n\n AbstractQueryVariant::Token token = static_cast<AbstractQueryVariant::Token>(\"\"))\n\n{\n\n return SpecialisedQueryVariant<T>::New(std::move(val), type, std::move(token));\n\n}\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp","rank":31,"score":193434.98854420625},{"content":"class AgentDirectory\n\n{\n\npublic:\n\n using AgentId = AgentProfile::AgentId;\n\n using ConstByteArray = fetch::byte_array::ConstByteArray;\n\n using Agent = AgentProfile::Agent;\n\n\n\n AgentId RegisterAgent(ConstByteArray const &pk);\n\n Agent GetAgent(ConstByteArray const &pk);\n\n bool UnregisterAgent(ConstByteArray const &pk);\n\n bool RegisterVocabularyLocation(AgentId id, std::string model, SemanticPosition position);\n\n\n\nprivate:\n\n AgentId counter_{0};\n\n std::unordered_map<ConstByteArray, AgentId> pk_to_id_;\n\n std::map<AgentId, Agent> agents_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/agent_directory.hpp","rank":32,"score":193431.56122202356},{"content":"struct AgentProfile\n\n{\n\n using Identity = fetch::crypto::Identity;\n\n using Agent = std::shared_ptr<AgentProfile>;\n\n using AgentId = uint64_t;\n\n\n\n static Agent New(AgentId id)\n\n {\n\n return Agent(new AgentProfile(id));\n\n }\n\n\n\n void RegisterVocabularyLocation(std::string model, SemanticPosition position)\n\n {\n\n VocabularyLocation loc;\n\n\n\n loc.model = std::move(model);\n\n loc.position = std::move(position);\n\n\n\n locations.insert(std::move(loc));\n\n }\n","file_path":"libs/semanticsearch/include/semanticsearch/agent_profile.hpp","rank":33,"score":193431.56122202356},{"content":"#include \"core/byte_array/const_byte_array.hpp\"\n\n#include \"core/byte_array/tokenizer/tokenizer.hpp\"\n\n\n\n#include <memory>\n\n#include <stdexcept>\n\n#include <typeindex>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp","rank":34,"score":193428.0184247696},{"content":" }\n\n return *reinterpret_cast<T *>(data());\n\n }\n\n\n\n template <typename T>\n\n bool IsType() const\n\n {\n\n return std::type_index(typeid(T)) == type_index_;\n\n }\n\n\n\n template <typename T>\n\n T const &As() const\n\n {\n\n if (std::type_index(typeid(T)) != type_index_)\n\n {\n\n auto t = std::type_index(typeid(T));\n\n throw std::runtime_error(\"Type mismatch in QueryVariant: stored \" +\n\n std::string(type_index_.name()) + \" vs. requested \" +\n\n std::string(t.name()));\n\n }\n","file_path":"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp","rank":35,"score":193425.14993921365},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"core/byte_array/byte_array.hpp\"\n","file_path":"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp","rank":36,"score":193414.5814790188},{"content":" return *reinterpret_cast<T const *>(data());\n\n }\n\n\n\n template <typename T>\n\n friend class SpecialisedQueryVariant;\n\n\n\nprivate:\n\n AbstractQueryVariant(int32_t type, Token token, std::type_index type_index)\n\n : type_{type}\n\n , token_{std::move(token)}\n\n , type_index_{type_index}\n\n {}\n\n\n\n int32_t type_;\n\n Token token_;\n\n std::type_index type_index_;\n\n};\n\n\n\ntemplate <typename T>\n","file_path":"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp","rank":37,"score":193414.58312639286},{"content":"struct hash<fetch::byte_array::ByteArray> : public hash<fetch::byte_array::ConstByteArray>\n\n{\n\n};\n\n\n\n} // namespace std\n","file_path":"libs/core/include/core/byte_array/const_byte_array.hpp","rank":38,"score":192430.03290344155},{"content":"struct MapSerializer<ml::model::Sequential<TensorType>, D>\n\n{\n\n using Type = ml::model::Sequential<TensorType>;\n\n using DriverType = D;\n\n static uint8_t const BASE_MODEL = 1;\n\n static uint8_t const LAYER_COUNT = 2;\n\n static uint8_t const PREV_LAYER_STR = 3;\n\n\n\n template <typename Constructor>\n\n static void Serialize(Constructor &map_constructor, Type const &sp)\n\n {\n\n auto map = map_constructor(3);\n\n\n\n // serialize the optimiser parent class\n\n auto base_pointer = static_cast<ml::model::Model<TensorType> const *>(&sp);\n\n map.Append(BASE_MODEL, *base_pointer);\n\n map.Append(LAYER_COUNT, sp.layer_count_);\n\n map.Append(PREV_LAYER_STR, sp.prev_layer_);\n\n }\n\n\n","file_path":"libs/ml/include/ml/model/sequential.hpp","rank":39,"score":191044.84589822163},{"content":"class AbstractQueryVariant\n\n{\n\npublic:\n\n using Token = fetch::byte_array::Token;\n\n\n\n virtual ~AbstractQueryVariant() = default;\n\n virtual void const *data() const = 0;\n\n\n\n void SetType(int type);\n\n int type() const;\n\n void SetToken(Token token);\n\n Token token() const;\n\n std::type_index type_index() const;\n\n\n\n template <typename T>\n\n explicit operator T() const\n\n {\n\n if (std::type_index(typeid(T)) != type_index_)\n\n {\n\n throw std::runtime_error(\"Type mismatch in QueryVariant.\");\n","file_path":"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp","rank":40,"score":190662.68495294751},{"content":"struct hash<fetch::byte_array::ConstByteArray>\n\n{\n\n std::size_t operator()(fetch::byte_array::ConstByteArray const &value) const noexcept\n\n {\n\n uint64_t h = 2166136261U;\n\n uint64_t i;\n\n\n\n for (i = 0; i < value.size(); ++i)\n\n {\n\n h = (h * 16777619) ^ value[i];\n\n }\n\n\n\n return h;\n\n }\n\n};\n\n\n\ntemplate <>\n","file_path":"libs/core/include/core/byte_array/const_byte_array.hpp","rank":41,"score":190184.78026413923},{"content":"class ModelRegister\n\n{\n\npublic:\n\n using VocabularySchema = std::shared_ptr<PropertiesToSubspace>;\n\n using SharedModelRegister = std::shared_ptr<ModelRegister>;\n\n\n\n ModelRegister() = default;\n\n virtual ~ModelRegister() = default;\n\n\n\n void AddModel(std::string const &name, VocabularySchema const &object);\n\n VocabularySchema GetModel(std::string const &name);\n\n bool HasModel(std::string const &name);\n\n\n\n virtual void OnAddModel(std::string const &name, VocabularySchema const &object) = 0;\n\n\n\nprivate:\n\n std::unordered_map<std::string, VocabularySchema> models_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/schema/model_register.hpp","rank":42,"score":189768.15197451258},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/agent_profile.hpp\"\n\n#include \"semanticsearch/index/base_types.hpp\"\n\n\n\n#include <map>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/agent_directory.hpp","rank":43,"score":186585.56477191346},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/index/base_types.hpp\"\n\n#include \"semanticsearch/location.hpp\"\n\n\n\n#include <crypto/identity.hpp>\n\n#include <memory>\n\n#include <string>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/agent_profile.hpp","rank":44,"score":186581.22698532534},{"content":"\n\n Identity identity;\n\n AgentId id;\n\n std::set<VocabularyLocation> locations;\n\n\n\nprivate:\n\n explicit AgentProfile(AgentId i)\n\n : id(i)\n\n {}\n\n};\n\n\n\nusing Agent = AgentProfile::Agent;\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/agent_profile.hpp","rank":45,"score":186580.03747222526},{"content":" }\n\n\n\n AgentIdSet FindAgents(SemanticPosition position, SemanticCoordinateType granularity)\n\n {\n\n return index_.Find(granularity, std::move(position));\n\n }\n\n\n\n VocabularySchema model() const\n\n {\n\n return object_model_;\n\n }\n\n\n\nprivate:\n\n VocabularySchema object_model_;\n\n InMemoryDBIndex index_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/model_advertisement.hpp","rank":46,"score":186553.55047096146},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/index/in_memory_db_index.hpp\"\n\n#include \"semanticsearch/schema/properties_map.hpp\"\n\n#include \"semanticsearch/schema/vocabulary_instance.hpp\"\n\n\n\n#include <string>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/model_advertisement.hpp","rank":47,"score":186542.7546661555},{"content":"struct UnrollPointers<0, ClassType, MemberFunctionPointer, ReturnType, UsedArgs...>\n\n{\n\n template <typename... remaining_args>\n\n struct LoopOver\n\n {\n\n static void Unroll(SerializerType &result, ClassType &cls, MemberFunctionPointer &m,\n\n CallableArgumentList const & /*additional_args*/, SerializerType &s,\n\n UsedArgs &... used)\n\n {\n\n UnrollArguments<ClassType, MemberFunctionPointer, ReturnType, UsedArgs...>::template LoopOver<\n\n CountArguments<remaining_args...>::value, remaining_args...>::Unroll(result, cls, m, s,\n\n used...);\n\n }\n\n };\n\n};\n\n} // namespace details\n\n\n\n/* A member function wrapper that takes a serialized input.\n\n * @C is the class type to which the member function belongs.\n\n * @F is the function signature.\n\n *\n\n * This module should be benchmarked against the more general class\n\n * <Function>. If there is no notable performance difference this\n\n * implementation should be dropped to keep the code base small and\n\n * simple.\n\n *\n\n * TODO(issue 23):\n\n */\n\ntemplate <typename C, typename F, std::size_t N = 0>\n","file_path":"libs/network/include/network/service/callable_class_member.hpp","rank":48,"score":186489.75173495465},{"content":"struct MapSerializer<ml::model::DNNClassifier<TensorType>, D>\n\n{\n\n using Type = ml::model::DNNClassifier<TensorType>;\n\n using DriverType = D;\n\n static uint8_t const BASE_MODEL = 1;\n\n\n\n template <typename Constructor>\n\n static void Serialize(Constructor &map_constructor, Type const &sp)\n\n {\n\n auto map = map_constructor(1);\n\n\n\n // serialize the optimiser parent class\n\n auto base_pointer = static_cast<ml::model::Model<TensorType> const *>(&sp);\n\n map.Append(BASE_MODEL, *base_pointer);\n\n }\n\n\n\n template <typename MapDeserializer>\n\n static void Deserialize(MapDeserializer &map, Type &sp)\n\n {\n\n auto base_pointer = static_cast<ml::model::Model<TensorType> *>(&sp);\n\n map.ExpectKeyGetValue(BASE_MODEL, *base_pointer);\n\n }\n\n};\n\n} // namespace serializers\n\n\n\n} // namespace fetch\n","file_path":"libs/ml/include/ml/model/dnn_classifier.hpp","rank":49,"score":185171.6367080124},{"content":"struct MapSerializer<ml::model::DNNRegressor<TensorType>, D>\n\n{\n\n using Type = ml::model::DNNRegressor<TensorType>;\n\n using DriverType = D;\n\n static uint8_t const BASE_MODEL = 1;\n\n\n\n template <typename Constructor>\n\n static void Serialize(Constructor &map_constructor, Type const &sp)\n\n {\n\n auto map = map_constructor(1);\n\n\n\n // serialize the optimiser parent class\n\n auto base_pointer = static_cast<ml::model::Model<TensorType> const *>(&sp);\n\n map.Append(BASE_MODEL, *base_pointer);\n\n }\n\n\n\n template <typename MapDeserializer>\n\n static void Deserialize(MapDeserializer &map, Type &sp)\n\n {\n\n auto base_pointer = static_cast<ml::model::Model<TensorType> *>(&sp);\n\n map.ExpectKeyGetValue(BASE_MODEL, *base_pointer);\n\n }\n\n};\n\n} // namespace serializers\n\n\n\n} // namespace fetch\n","file_path":"libs/ml/include/ml/model/dnn_regressor.hpp","rank":50,"score":185171.6367080124},{"content":"class BuiltinQueryFunction\n\n{\n\npublic:\n\n using CallerSignature = std::function<QueryVariant(std::vector<void const *> &)>;\n\n using Function = std::shared_ptr<BuiltinQueryFunction>;\n\n\n\n template <typename R, typename... Args>\n\n static Function New(std::function<R(Args...)> caller)\n\n {\n\n // Creating a shared builtin query function and\n\n // computes a list of type indices for the function arguments\n\n Function ret = Function(new BuiltinQueryFunction(std::type_index(typeid(R))));\n\n details::ArgumentsToTypeVector<R, Args...>::Apply(ret->arguments_);\n\n\n\n // Creating a type converter which converts type-erased void* arguments\n\n // into their original types\n\n ret->caller_ = [caller](std::vector<void const *> &args) -> QueryVariant {\n\n R return_value;\n\n\n\n // Calls the original caller function\n","file_path":"libs/semanticsearch/include/semanticsearch/module/builtin_query_function.hpp","rank":51,"score":182957.0748567484},{"content":"class ModelInterfaceBuilder\n\n{\n\npublic:\n\n using ModelField = std::shared_ptr<VocabularyToSubspaceMapInterface>;\n\n using VocabularySchema = std::shared_ptr<PropertiesToSubspace>;\n\n\n\n explicit ModelInterfaceBuilder(VocabularySchema model = nullptr,\n\n SemanticSearchModule *factory = nullptr);\n\n\n\n explicit operator bool() const;\n\n ModelInterfaceBuilder &Field(std::string const &name, std::string const &type);\n\n ModelInterfaceBuilder &Field(std::string const &name, ModelInterfaceBuilder proxy);\n\n ModelInterfaceBuilder &Field(std::string const &name, ModelField const &model);\n\n\n\n ModelInterfaceBuilder Vocabulary(std::string const &name);\n\n\n\n VocabularySchema const &model() const\n\n {\n\n return model_;\n\n }\n\n\n\nprivate:\n\n VocabularySchema model_;\n\n SemanticSearchModule *factory_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/module/model_interface_builder.hpp","rank":52,"score":182942.14231966884},{"content":"class Model\n\n{\n\npublic:\n\n using DataType = typename TensorType::Type;\n\n using SizeType = fetch::math::SizeType;\n\n using GraphType = Graph<TensorType>;\n\n using DataLoaderType = dataloaders::DataLoader<TensorType, TensorType>;\n\n using ModelOptimiserType = optimisers::Optimiser<TensorType>;\n\n using GraphPtrType = typename std::shared_ptr<GraphType>;\n\n using DataLoaderPtrType = typename std::shared_ptr<DataLoaderType>;\n\n using OptimiserPtrType = typename std::shared_ptr<ModelOptimiserType>;\n\n\n\n explicit Model(ModelConfig<DataType> model_config = ModelConfig<DataType>())\n\n : model_config_(std::move(model_config))\n\n {}\n\n Model(Model const &other)\n\n {\n\n graph_ptr_.reset(other.graph_ptr_.get());\n\n dataloader_ptr_.reset(other.dataloader_ptr_.get());\n\n optimiser_ptr_.reset(other.optimiser_ptr_.get());\n","file_path":"libs/ml/include/ml/model/model.hpp","rank":53,"score":182395.61360096958},{"content":" {\n\n return type_;\n\n }\n\n\n\n void Walk(std::function<void(std::string, Vocabulary)> const &callback,\n\n std::string const & name = \"\");\n\n Vocabulary &operator[](std::string const &name);\n\n void Insert(std::string const &name, Vocabulary const &value);\n\n\n\nprivate:\n\n VocabularyInstance(std::type_index type, void *data)\n\n : type_(type)\n\n , data_(data)\n\n {}\n\n\n\n std::type_index type_;\n\n void * data_{nullptr};\n\n\n\n template <typename T>\n\n friend class DataToSubspaceMap;\n\n friend class PropertiesToSubspace;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/schema/vocabulary_instance.hpp","rank":54,"score":182340.81674328088},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include <functional>\n\n#include <map>\n\n#include <string>\n\n#include <type_traits>\n\n#include <typeindex>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/schema/vocabulary_instance.hpp","rank":55,"score":182327.7758122146},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/query/query.hpp\"\n\n#include \"semanticsearch/schema/vocabulary_instance.hpp\"\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/execution_context.hpp","rank":56,"score":182309.89438753968},{"content":" }\n\n\n\n std::string GetModelName(std::string const &name)\n\n {\n\n return models_[name];\n\n }\n\n\n\nprivate:\n\n std::map<std::string, Vocabulary> context_;\n\n std::map<std::string, std::string> models_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/execution_context.hpp","rank":57,"score":182303.8621102495},{"content":" }\n\n Type type() const\n\n {\n\n return type_;\n\n }\n\n int line() const\n\n {\n\n return token_.line();\n\n }\n\n uint64_t character() const\n\n {\n\n return token_.character();\n\n }\n\n\n\nprivate:\n\n ConstByteArray filename_;\n\n ConstByteArray source_;\n\n ConstByteArray message_;\n\n Token token_;\n\n Type type_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_message.hpp","rank":58,"score":182303.00211263497},{"content":" bool HasErrors() const;\n\n\n\nprivate:\n\n void PrintLine(int line, uint64_t character, uint64_t char_end = uint64_t(-1)) const;\n\n void PrintErrorMessage(ErrorMessage const &error);\n\n\n\n ConstByteArray source_;\n\n ConstByteArray filename_;\n\n std::vector<ErrorMessage> errors_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp","rank":59,"score":182301.043911967},{"content":"#include \"core/byte_array/const_byte_array.hpp\"\n\n#include \"core/byte_array/consumers.hpp\"\n\n#include \"core/byte_array/tokenizer/tokenizer.hpp\"\n\n#include \"core/commandline/vt100.hpp\"\n\n\n\n#include <vector>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_message.hpp","rank":60,"score":182296.1056854471},{"content":"\n\n#include <core/byte_array/byte_array.hpp>\n\n#include <core/byte_array/const_byte_array.hpp>\n\n#include <core/byte_array/consumers.hpp>\n\n#include <core/byte_array/tokenizer/tokenizer.hpp>\n\n#include <vector>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp","rank":61,"score":182295.85806048443},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/query/error_message.hpp\"\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp","rank":62,"score":182293.32209769974},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/schema/properties_map.hpp\"\n\n\n\n#include <memory>\n\n#include <unordered_map>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/schema/model_register.hpp","rank":63,"score":182286.4728693481},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"core/byte_array/byte_array.hpp\"\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_message.hpp","rank":64,"score":182283.58175397458},{"content":" , message_(std::move(message))\n\n , token_(std::move(token))\n\n , type_(type)\n\n {}\n\n\n\n ConstByteArray filename() const\n\n {\n\n return filename_;\n\n }\n\n ConstByteArray source() const\n\n {\n\n return source_;\n\n }\n\n ConstByteArray message() const\n\n {\n\n return message_;\n\n }\n\n Token token() const\n\n {\n\n return token_;\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_message.hpp","rank":65,"score":182277.6560652008},{"content":"#include <set>\n\n#include <vector>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n\nusing DBIndexType = uint64_t;\n\nusing SemanticCoordinateType = uint64_t; // Always internal 0 -> 1\n\nusing SemanticPosition = std::vector<SemanticCoordinateType>;\n\n\n\nusing DBIndexList = std::set<DBIndexType>;\n\nusing DBIndexListPtr = std::shared_ptr<DBIndexList>;\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/index/base_types.hpp","rank":66,"score":182174.54775018923},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include <memory>\n","file_path":"libs/semanticsearch/include/semanticsearch/index/base_types.hpp","rank":67,"score":182146.79686800533},{"content":"struct std::hash<fetch::network::Uri> : private std::hash<fetch::byte_array::ConstByteArray>\n\n{\n\n std::size_t operator()(fetch::network::Uri const &x) const\n\n {\n\n return std::hash<fetch::byte_array::ConstByteArray>::operator()(x.uri());\n\n }\n\n};\n","file_path":"libs/network/include/network/uri.hpp","rank":68,"score":182051.81534822332},{"content":"class SpecialisedQueryVariant final : public AbstractQueryVariant\n\n{\n\npublic:\n\n using Token = fetch::byte_array::Token;\n\n using QueryVariant = std::shared_ptr<AbstractQueryVariant>;\n\n\n\n static QueryVariant New(T value, int32_t type = 0, Token token = static_cast<Token>(\"\"))\n\n {\n\n return QueryVariant(new SpecialisedQueryVariant<T>(std::move(value), type, std::move(token),\n\n std::type_index(typeid(T))));\n\n }\n\n\n\n void const *data() const override\n\n {\n\n return reinterpret_cast<void const *>(&value_);\n\n }\n\n\n\nprivate:\n\n SpecialisedQueryVariant(T value, int32_t type, Token token, std::type_index type_index)\n\n : AbstractQueryVariant(type, std::move(token), type_index)\n","file_path":"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp","rank":69,"score":181563.59564195637},{"content":"class VocabularyInstance : public std::enable_shared_from_this<VocabularyInstance>\n\n{\n\npublic:\n\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\n\n using PropertyMap = std::map<std::string, std::shared_ptr<VocabularyInstance>>;\n\n\n\n template <typename T>\n\n static Vocabulary New(T data)\n\n {\n\n // TODO(private issue 143): add destructor\n\n Vocabulary ret;\n\n ret.reset(new VocabularyInstance(std::type_index(typeid(T)), new T(data)));\n\n\n\n return ret;\n\n }\n\n\n\n VocabularyInstance() = delete;\n\n VocabularyInstance(VocabularyInstance const &other) = delete;\n\n VocabularyInstance &operator=(VocabularyInstance const &other) = delete;\n\n std::type_index type() const\n","file_path":"libs/semanticsearch/include/semanticsearch/schema/vocabulary_instance.hpp","rank":70,"score":179104.08854688812},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/module/args_resolver.hpp\"\n\n#include \"semanticsearch/query/abstract_query_variant.hpp\"\n\n\n\n#include <functional>\n\n#include <memory>\n\n#include <vector>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/module/builtin_query_function.hpp","rank":71,"score":178252.100887338},{"content":" details::VectorToArguments<sizeof...(Args)>::template Unroll<R, Args...>::Apply(\n\n 0, caller, return_value, args);\n\n\n\n // Creating a resulting variant for the return type.\n\n return NewQueryVariant(return_value);\n\n };\n\n\n\n return ret;\n\n }\n\n\n\n bool ValidateSignature(std::type_index const &ret, std::vector<std::type_index> const &args);\n\n QueryVariant operator()(std::vector<void const *> &args);\n\n std::type_index return_type() const;\n\n\n\nprivate:\n\n explicit BuiltinQueryFunction(std::type_index return_type)\n\n : return_type_(return_type)\n\n {}\n\n\n\n std::vector<std::type_index> arguments_;\n\n std::type_index return_type_;\n\n\n\n CallerSignature caller_;\n\n};\n\n\n\n} // namespace semanticsearch\n\n} // namespace fetch\n","file_path":"libs/semanticsearch/include/semanticsearch/module/builtin_query_function.hpp","rank":72,"score":178249.8641776989},{"content":"#pragma once\n\n//------------------------------------------------------------------------------\n\n//\n\n// Copyright 2018-2019 Fetch.AI Limited\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n//\n\n//------------------------------------------------------------------------------\n\n\n\n#include \"semanticsearch/schema/properties_map.hpp\"\n\n#include \"semanticsearch/schema/subspace_map_interface.hpp\"\n\n\n\n#include <memory>\n\n\n\nnamespace fetch {\n\nnamespace semanticsearch {\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/module/model_interface_builder.hpp","rank":73,"score":178233.24168027364},{"content":"class VocabularyAdvertisement\n\n{\n\npublic:\n\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\n\n using Index = uint64_t;\n\n using VocabularySchema = std::shared_ptr<PropertiesToSubspace>;\n\n using AgentId = uint64_t;\n\n using AgentIdSet = std::shared_ptr<std::set<AgentId>>;\n\n\n\n explicit VocabularyAdvertisement(VocabularySchema object_model)\n\n : object_model_(std::move(object_model))\n\n {}\n\n\n\n void SubscribeAgent(AgentId aid, SemanticPosition position)\n\n {\n\n SemanticSubscription rel;\n\n rel.position = std::move(position);\n\n rel.index = aid; // TODO(private issue AEA-129): Change to agent id\n\n\n\n index_.AddRelation(rel);\n","file_path":"libs/semanticsearch/include/semanticsearch/model_advertisement.hpp","rank":74,"score":178203.49976042839},{"content":"class Agent;\n","file_path":"libs/oef-core/include/oef-core/agents/Agents.hpp","rank":75,"score":177864.4518536752},{"content":"class Agent\n\n{\n\npublic:\n\n Agent(std::string key, std::shared_ptr<OefAgentEndpoint> endpoint)\n\n {\n\n this->key = std::move(key);\n\n this->endpoint = std::move(endpoint);\n\n }\n\n\n\n ~Agent() = default;\n\n\n\n Notification::NotificationBuilder send(std::shared_ptr<google::protobuf::Message> s);\n\n\n\n void run_sending();\n\n\n\n std::string getPublicKey()\n\n {\n\n return key;\n\n }\n\n\n","file_path":"libs/oef-core/include/oef-core/agents/Agent.hpp","rank":76,"score":177864.4518536752},{"content":"class Weights : public fetch::ml::ops::Variable<T>\n\n{\n\npublic:\n\n using TensorType = T;\n\n using SizeType = fetch::math::SizeType;\n\n using DataType = typename TensorType::Type;\n\n using ArrayPtrType = std::shared_ptr<TensorType>;\n\n using VecTensorType = typename Variable<T>::VecTensorType;\n\n using SPType = OpWeightsSaveableParams<TensorType>;\n\n using WeightsPtrType = typename std::shared_ptr<Weights<TensorType>>;\n\n\n\npublic:\n\n Weights() = default;\n\n\n\n explicit Weights(SPType const &sp)\n\n : Variable<T>(sp)\n\n {}\n\n\n\n ~Weights() override = default;\n\n\n","file_path":"libs/ml/include/ml/ops/weights.hpp","rank":77,"score":175943.044694561},{"content":"struct MapSerializer<fetch::ml::dataloaders::DataLoader<LabelType, InputType>, D>\n\n{\n\n using Type = fetch::ml::dataloaders::DataLoader<LabelType, InputType>;\n\n using DriverType = D;\n\n\n\n static uint8_t const RANDOM_MODE = 1;\n\n static uint8_t const SIZE_NOT_SET = 2;\n\n static uint8_t const CUR_TRAINING_PAIR_FIRST = 3;\n\n static uint8_t const CUR_TRAINING_PAIR_SECOND = 4;\n\n static uint8_t const RET_PAIR_FIRST = 5;\n\n static uint8_t const RET_PAIR_SECOND = 6;\n\n\n\n template <typename Constructor>\n\n static void Serialize(Constructor &map_constructor, Type const &sp)\n\n {\n\n auto map = map_constructor(6);\n\n\n\n map.Append(RANDOM_MODE, sp.random_mode_);\n\n map.Append(SIZE_NOT_SET, sp.size_not_set_);\n\n map.Append(CUR_TRAINING_PAIR_FIRST, sp.cur_training_pair_.first);\n","file_path":"libs/ml/include/ml/dataloaders/dataloader.hpp","rank":78,"score":175660.80987024822},{"content":"class ErrorTracker\n\n{\n\npublic:\n\n using ConstByteArray = fetch::byte_array::ConstByteArray;\n\n using Token = fetch::byte_array::Token;\n\n using SharedErrorTracker = std::shared_ptr<ErrorTracker>;\n\n\n\n ErrorTracker() = default;\n\n\n\n explicit operator bool()\n\n {\n\n return !errors_.empty();\n\n }\n\n\n\n void Print();\n\n void RaiseSyntaxError(ConstByteArray message, Token token);\n\n void RaiseRuntimeError(ConstByteArray message, Token token);\n\n void RaiseInternalError(ConstByteArray message, Token token);\n\n void SetSource(ConstByteArray source, ConstByteArray filename);\n\n void ClearErrors();\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp","rank":79,"score":174345.4958219476},{"content":"class ExecutionContext\n\n{\n\npublic:\n\n using ConstByteArray = fetch::byte_array::ConstByteArray;\n\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\n\n\n\n Vocabulary Get(std::string const &name)\n\n {\n\n return context_[name];\n\n }\n\n\n\n void Set(std::string const &name, Vocabulary object, std::string type)\n\n {\n\n models_[name] = std::move(type);\n\n context_[name] = std::move(object);\n\n }\n\n\n\n bool Has(std::string const &name)\n\n {\n\n return context_.find(name) != context_.end();\n","file_path":"libs/semanticsearch/include/semanticsearch/query/execution_context.hpp","rank":80,"score":174345.4958219476},{"content":"class ErrorMessage\n\n{\n\npublic:\n\n using ConstByteArray = fetch::byte_array::ConstByteArray;\n\n using Token = fetch::byte_array::Token;\n\n\n\n enum Type\n\n {\n\n WARNING,\n\n SYNTAX_ERROR,\n\n RUNTIME_ERROR,\n\n INTERNAL_ERROR,\n\n INFO,\n\n APPEND\n\n };\n\n\n\n ErrorMessage(ConstByteArray filename, ConstByteArray source, ConstByteArray message, Token token,\n\n Type type = SYNTAX_ERROR)\n\n : filename_(std::move(filename))\n\n , source_(std::move(source))\n","file_path":"libs/semanticsearch/include/semanticsearch/query/error_message.hpp","rank":81,"score":174345.4958219476},{"content":"enum class MetricType\n\n{\n\n LOSS,\n\n ACCURACY\n\n};\n\n\n\ntemplate <typename TensorType>\n","file_path":"libs/ml/include/ml/model/model.hpp","rank":82,"score":174230.25573304683},{"content":"struct MapSerializer<fetch::ml::dataloaders::TensorDataLoader<LabelType, InputType>, D>\n\n{\n\n using Type = fetch::ml::dataloaders::TensorDataLoader<LabelType, InputType>;\n\n using DriverType = D;\n\n\n\n static uint8_t const BASE_DATA_LOADER = 1;\n\n static uint8_t const TRAIN_CURSOR = 2;\n\n static uint8_t const TEST_CURSOR = 3;\n\n static uint8_t const VALIDATION_CURSOR = 4;\n\n static uint8_t const TEST_OFFSET = 5;\n\n static uint8_t const VALIDATION_OFFSET = 6;\n\n static uint8_t const TEST_TO_TRAIN_RATIO = 7;\n\n static uint8_t const VALIDATION_TO_TRAIN_RATIO = 8;\n\n static uint8_t const N_SAMPLES = 9;\n\n static uint8_t const N_TRAIN_SAMPLES = 10;\n\n static uint8_t const N_TEST_SAMPLES = 11;\n\n static uint8_t const N_VALIDATION_SAMPLES = 12;\n\n static uint8_t const DATA = 13;\n\n static uint8_t const LABELS = 14;\n\n\n","file_path":"libs/ml/include/ml/dataloaders/tensor_dataloader.hpp","rank":83,"score":170612.25695277023},{"content":"struct ArgumentsToTypeVector\n\n{\n\n static void Apply(std::vector<std::type_index> &args)\n\n {\n\n args.push_back(std::type_index(typeid(A)));\n\n ArgumentsToTypeVector<R, Args...>::Apply(args);\n\n }\n\n};\n\n\n\ntemplate <typename R, typename A>\n","file_path":"libs/semanticsearch/include/semanticsearch/module/args_resolver.hpp","rank":84,"score":170519.19920289444},{"content":"class SemanticSearchModule;\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/module/model_interface_builder.hpp","rank":85,"score":167095.2075889893},{"content":"class AdvertisementRegister : public ModelRegister\n\n{\n\npublic:\n\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\n\n using SharedModel = std::shared_ptr<VocabularyAdvertisement>;\n\n using SharedModelRegister = ModelRegister::SharedModelRegister;\n\n using Index = VocabularyAdvertisement::Index;\n\n using AgentId = VocabularyAdvertisement::AgentId;\n\n using AgentIdSet = VocabularyAdvertisement::AgentIdSet;\n\n\n\n AdvertisementRegister() = default;\n\n\n\n bool CreateModel(std::string const &name, VocabularySchema const &object);\n\n SharedModel GetAdvertisementModel(std::string const &name);\n\n void AdvertiseAgent(AgentId aid, std::string const &name, SemanticPosition const &position);\n\n AgentIdSet FindAgents(std::string const &name, SemanticPosition const &position,\n\n SemanticCoordinateType granularity);\n\n AgentIdSet FindAgents(std::string const &name, Vocabulary const &object,\n\n SemanticCoordinateType granularity);\n\n\n","file_path":"libs/semanticsearch/include/semanticsearch/advertisement_register.hpp","rank":86,"score":167095.2075889893},{"content":"struct ArgumentsToTypeVector<R, A>\n\n{\n\n static void Apply(std::vector<std::type_index> &args)\n\n {\n\n args.push_back(std::type_index(typeid(A)));\n\n }\n\n};\n\n\n\ntemplate <typename R>\n","file_path":"libs/semanticsearch/include/semanticsearch/module/args_resolver.hpp","rank":87,"score":166982.6294867155},{"content":"struct Type;\n\nusing TypePtr = std::shared_ptr<Type>;\n\nusing TypePtrArray = std::vector<TypePtr>;\n\nusing Operators = std::unordered_set<Operator>;\n\n\n","file_path":"libs/vm/include/vm/node.hpp","rank":88,"score":163534.13204099747},{"content":"struct IsMathImpl<float, ReturnType>\n\n{\n\n using Type = ReturnType;\n\n};\n\ntemplate <typename ReturnType>\n","file_path":"libs/vectorise/include/vectorise/meta/math_type_traits.hpp","rank":89,"score":160372.88851432505},{"content":"struct IsMathImpl<double, ReturnType>\n\n{\n\n using Type = ReturnType;\n\n};\n\ntemplate <typename ReturnType>\n","file_path":"libs/vectorise/include/vectorise/meta/math_type_traits.hpp","rank":90,"score":160372.88851432505},{"content":"struct IsMathImpl<int, ReturnType>\n\n{\n\n using Type = ReturnType;\n\n};\n\ntemplate <typename ReturnType>\n","file_path":"libs/vectorise/include/vectorise/meta/math_type_traits.hpp","rank":91,"score":160372.88851432505},{"content":"struct MakeParameterType<T, std::enable_if_t<fetch::vm::IsPtr<T>::value>>\n\n{\n\n using type = T const &;\n\n};\n\n\n\n} // namespace vm\n\n} // namespace fetch\n","file_path":"libs/vm/include/vm/module/base.hpp","rank":92,"score":160215.04038607207},{"content":"struct MakeParameterType<T, std::enable_if_t<fetch::vm::IsVariant<T>::value>>\n\n{\n\n using type = T const &;\n\n};\n\ntemplate <typename T>\n","file_path":"libs/vm/include/vm/module/base.hpp","rank":93,"score":160215.04038607207},{"content":"struct MakeParameterType<T, std::enable_if_t<fetch::vm::IsPrimitive<T>::value>>\n\n{\n\n using type = T;\n\n};\n\ntemplate <typename T>\n","file_path":"libs/vm/include/vm/module/base.hpp","rank":94,"score":160215.04038607207},{"content":"struct IsMathArrayImpl<Tensor<DataType, ContainerType>, ReturnType>\n\n{\n\n using Type = ReturnType;\n\n};\n\ntemplate <typename DataType, typename ReturnType>\n\nusing IfIsMathArray = typename IsMathArrayImpl<DataType, ReturnType>::Type;\n\n\n\ntemplate <typename DataType, typename ReturnType>\n\nusing IfIsMathFixedPointArray =\n\n IfIsFixedPoint<typename DataType::Type, IfIsMathArray<DataType, ReturnType>>;\n\n\n\ntemplate <typename DataType, typename ReturnType>\n\nusing IfIsMathNonFixedPointArray =\n\n IfIsNotFixedPoint<typename DataType::Type, IfIsMathArray<DataType, ReturnType>>;\n\n\n\n} // namespace meta\n\n} // namespace math\n\n} // namespace fetch\n","file_path":"libs/math/include/math/meta/math_type_traits.hpp","rank":95,"score":159978.50571165458},{"content":"class ConstByteArray;\n\n}\n\n\n\nnamespace crypto {\n\n\n\nbool IsFetchIdentity(byte_array::ConstByteArray const &identity);\n\n\n\n} // namespace crypto\n\n} // namespace fetch\n","file_path":"libs/crypto/include/crypto/fetch_identity.hpp","rank":96,"score":158915.38260329622},{"content":"class ConstByteArray;\n\n} // namespace byte_array\n\n\n\nnamespace meta {\n\n\n\ntemplate <typename... T>\n","file_path":"libs/meta/include/meta/type_traits.hpp","rank":97,"score":158826.862043779},{"content":" enum class Type\n\n {\n\n INVALID,\n\n NORMAL,\n\n SMART_OR_SYNERGETIC_CONTRACT\n\n };\n\n\n\n using ConstByteArray = byte_array::ConstByteArray;\n\n using Tokens = std::vector<ConstByteArray>;\n\n\n\n // Construction / Destruction\n\n Identifier() = default;\n\n explicit Identifier(ConstByteArray identifier);\n\n Identifier(Identifier const &) = default;\n\n Identifier(Identifier &&) = default;\n\n ~Identifier() = default;\n\n\n\n // Accessors\n\n Type type() const;\n\n ConstByteArray name() const;\n","file_path":"libs/ledger/include/ledger/identifier.hpp","rank":98,"score":156104.24774416786},{"content":" enum class Type\n\n {\n\n UNDEFINED,\n\n INTEGER,\n\n FLOATING_POINT,\n\n FIXED_POINT,\n\n BOOLEAN,\n\n STRING,\n\n NULL_VALUE,\n\n ARRAY,\n\n OBJECT,\n\n };\n\n\n\n constexpr Type type() const\n\n {\n\n return type_;\n\n }\n\n\n\nprivate:\n\n using VariantList = std::vector<Variant>;\n","file_path":"libs/variant/include/variant/variant.hpp","rank":99,"score":156104.24774416786}],"string":"[\n {\n \"content\": \" enum class Type\\n\\n {\\n\\n UNKNOWN = 0,\\n\\n SET_CONTEXT,\\n\\n PUSH_SCOPE,\\n\\n POP_SCOPE,\\n\\n\\n\\n FUNCTION = 50,\\n\\n EXECUTE_CALL,\\n\\n\\n\\n // Operators come first and are ordered according to precendence\\n\\n // That is: DO not change the order unless you intensionally\\n\\n // want to change the behaviour of the program.\\n\\n MULTIPLY = 100,\\n\\n ADD,\\n\\n SUB,\\n\\n\\n\\n EQUAL,\\n\\n NOT_EQUAL,\\n\\n LESS_THAN,\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp\",\n \"rank\": 0,\n \"score\": 289331.1386359479\n },\n {\n \"content\": \"struct MapSerializer<fetch::ml::model::ModelConfig<DataType>, D>\\n\\n{\\n\\n using Type = fetch::ml::model::ModelConfig<DataType>;\\n\\n using DriverType = D;\\n\\n\\n\\n // public member variables\\n\\n static uint8_t const EARLY_STOPPING = 1;\\n\\n static uint8_t const TEST = 2;\\n\\n static uint8_t const PATIENCE = 3;\\n\\n static uint8_t const MIN_DELTA = 4;\\n\\n static uint8_t const LEARNING_RATE_PARAM = 6;\\n\\n static uint8_t const BATCH_SIZE = 7;\\n\\n static uint8_t const SUSBET_SIZE = 8;\\n\\n static uint8_t const PRINT_STATS = 9;\\n\\n\\n\\n template <typename Constructor>\\n\\n static void Serialize(Constructor &map_constructor, Type const &sp)\\n\\n {\\n\\n auto map = map_constructor(9);\\n\\n\\n\",\n \"file_path\": \"libs/ml/include/ml/model/model_config.hpp\",\n \"rank\": 1,\n \"score\": 270665.2542752603\n },\n {\n \"content\": \"type InnerProduct(array_type const &A, array_type const &B)\\n\\n{\\n\\n type ret{0};\\n\\n\\n\\n ret = A.in_parallel().SumReduce(\\n\\n [](auto const &a, auto const &b) {\\n\\n auto d = a - b;\\n\\n return d * d;\\n\\n },\\n\\n B);\\n\\n\\n\\n return ret;\\n\\n}\\n\\n\\n\\nint main(int argc, char const **argv)\\n\\n{\\n\\n if (argc != 2)\\n\\n {\\n\\n std::cout << std::endl;\\n\\n std::cout << \\\"Usage: \\\" << argv[0] << \\\" [array size] \\\" << std::endl;\\n\",\n \"file_path\": \"libs/vectorise/examples/03_sum_reduce_fetch/main.cpp\",\n \"rank\": 2,\n \"score\": 256100.03522125137\n },\n {\n \"content\": \"type InnerProduct(array_type const &A, array_type const &B)\\n\\n{\\n\\n type ret = 0;\\n\\n\\n\\n ret = A.in_parallel().SumReduce(\\n\\n [](auto const &a, auto const &b) {\\n\\n auto d = a - b;\\n\\n return d * d;\\n\\n },\\n\\n B);\\n\\n\\n\\n return ret;\\n\\n}\\n\\n\\n\\nint main(int /*argc*/, char ** /*argv*/)\\n\\n{\\n\\n array_type A, B;\\n\\n\\n\\n double product = InnerProduct(A, B);\\n\\n std::cout << \\\"product = \\\" << product << std::endl;\\n\\n\\n\\n return 0;\\n\\n}\\n\",\n \"file_path\": \"libs/vectorise/examples/04_product_reduce_fetch/main.cpp\",\n \"rank\": 3,\n \"score\": 256100.03522125137\n },\n {\n \"content\": \"struct ArgumentsToTypeVector<R, void>\\n\\n{\\n\\n static void Apply(std::vector<std::type_index> & /*args*/)\\n\\n {}\\n\\n};\\n\\n\\n\\n/* This code converts a vector of type-erased types\\n\\n * into the types matching the argument types.\\n\\n */\\n\\ntemplate <uint64_t N, typename... UsedArgs>\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/args_resolver.hpp\",\n \"rank\": 4,\n \"score\": 255810.43422285342\n },\n {\n \"content\": \"type Reduction(array_type const &A)\\n\\n{\\n\\n type ret{0};\\n\\n\\n\\n ret = A.in_parallel().Reduce([](auto const &a, auto const &b) { return a + b; },\\n\\n [](vector_type const &a) -> type { return reduce(a); });\\n\\n\\n\\n return ret;\\n\\n}\\n\\n\\n\\nint main(int argc, char const **argv)\\n\\n{\\n\\n if (argc != 2)\\n\\n {\\n\\n std::cout << std::endl;\\n\\n std::cout << \\\"Usage: \\\" << argv[0] << \\\" [array size] \\\" << std::endl;\\n\\n std::cout << std::endl;\\n\\n return 0;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"libs/vectorise/examples/02_reduction_fetch/main.cpp\",\n \"rank\": 5,\n \"score\": 251146.5771658036\n },\n {\n \"content\": \"class Switch : public fetch::ml::ops::Ops<T>\\n\\n{\\n\\npublic:\\n\\n using TensorType = T;\\n\\n using DataType = typename TensorType::Type;\\n\\n using SizeType = fetch::math::SizeType;\\n\\n using ArrayPtrType = std::shared_ptr<TensorType>;\\n\\n using VecTensorType = typename Ops<T>::VecTensorType;\\n\\n using SPType = OpSwitchSaveableParams<T>;\\n\\n using MyType = Switch<TensorType>;\\n\\n\\n\\n Switch() = default;\\n\\n\\n\\n explicit Switch(SPType const &sp)\\n\\n : Ops<T>(sp)\\n\\n {}\\n\\n\\n\\n ~Switch() override = default;\\n\\n\\n\\n std::shared_ptr<OpsSaveableParams> GetOpSaveableParams() override\\n\",\n \"file_path\": \"libs/ml/include/ml/ops/switch.hpp\",\n \"rank\": 6,\n \"score\": 223860.00393159877\n },\n {\n \"content\": \"struct MapSerializer<ml::model::Model<TensorType>, D>\\n\\n{\\n\\n using Type = ml::model::Model<TensorType>;\\n\\n using DriverType = D;\\n\\n\\n\\n // protected member variables\\n\\n static uint8_t const GRAPH = 1;\\n\\n static uint8_t const MODEL_CONFIG = 2;\\n\\n static uint8_t const DATALOADER_PTR = 3;\\n\\n static uint8_t const DATALOADER_TYPE = 4;\\n\\n static uint8_t const OPTIMISER_PTR = 5;\\n\\n static uint8_t const OPTIMISER_TYPE = 6;\\n\\n\\n\\n static uint8_t const INPUT_NODE_NAME = 7;\\n\\n static uint8_t const LABEL_NODE_NAME = 8;\\n\\n static uint8_t const OUTPUT_NODE_NAME = 9;\\n\\n static uint8_t const ERROR_NODE_NAME = 10;\\n\\n\\n\\n static uint8_t const LOSS_SET_FLAG = 11;\\n\\n static uint8_t const OPTIMISER_SET_FLAG = 12;\\n\",\n \"file_path\": \"libs/ml/include/ml/model/model.hpp\",\n \"rank\": 7,\n \"score\": 218022.4973769128\n },\n {\n \"content\": \"struct Invoke<ClassType, MemberFunctionPointer, void, UsedArgs...>\\n\\n{\\n\\n static void MemberFunction(SerializerType &result, ClassType &cls, MemberFunctionPointer &m,\\n\\n UsedArgs &... args)\\n\\n {\\n\\n result << uint8_t(0);\\n\\n (cls.*m)(args...);\\n\\n };\\n\\n};\\n\\n\\n\\n/* Struct used for unrolling arguments in a function signature.\\n\\n * @UsedArgs are the unpacked arguments.\\n\\n */\\n\\ntemplate <typename ClassType, typename MemberFunctionPointer, typename ReturnType,\\n\\n typename... UsedArgs>\\n\",\n \"file_path\": \"libs/network/include/network/service/callable_class_member.hpp\",\n \"rank\": 8,\n \"score\": 213207.68423119298\n },\n {\n \"content\": \"type InnerProduct(array_type const &A, array_type const &B)\\n\\n{\\n\\n type ret{0};\\n\\n\\n\\n for (std::size_t i = 0; i < A.size(); ++i)\\n\\n {\\n\\n type d = A[i] - B[i];\\n\\n ret += d * d;\\n\\n }\\n\\n\\n\\n return ret;\\n\\n}\\n\\n\\n\\nint main(int argc, char const **argv)\\n\\n{\\n\\n\\n\\n if (argc != 2)\\n\\n {\\n\\n std::cout << std::endl;\\n\\n std::cout << \\\"Usage: \\\" << argv[0] << \\\" [array size] \\\" << std::endl;\\n\",\n \"file_path\": \"libs/vectorise/examples/03_sum_reduce/ordinary_solution.cpp\",\n \"rank\": 9,\n \"score\": 210272.00089386024\n },\n {\n \"content\": \"class Sequential : public Model<TensorType>\\n\\n{\\n\\npublic:\\n\\n using SizeType = fetch::math::SizeType;\\n\\n using DataType = typename TensorType::Type;\\n\\n using CostFunctionType = fetch::ml::ops::CrossEntropyLoss<TensorType>;\\n\\n using OptimiserType = fetch::ml::OptimiserType;\\n\\n using DataLoaderPtrType = typename Model<TensorType>::DataLoaderPtrType;\\n\\n\\n\\n Sequential();\\n\\n Sequential(Sequential const &other) = default;\\n\\n explicit Sequential(ModelConfig<DataType> model_config);\\n\\n ~Sequential() override = default;\\n\\n\\n\\n template <typename LayerType, typename... Params>\\n\\n void Add(Params... params);\\n\\n\\n\\n template <typename X, typename D>\\n\\n friend struct serializers::MapSerializer;\\n\\n\\n\",\n \"file_path\": \"libs/ml/include/ml/model/sequential.hpp\",\n \"rank\": 10,\n \"score\": 205855.93084630012\n },\n {\n \"content\": \"struct MemberFunctionTraits<void, R (C::*)(Args...) const>\\n\\n{\\n\\n using ReturnType = R;\\n\\n using ArgsTupleType = std::tuple<Args...>;\\n\\n};\\n\\ntemplate <typename R, typename C, typename... Args>\\n\",\n \"file_path\": \"libs/meta/include/meta/callable/callable_traits.hpp\",\n \"rank\": 11,\n \"score\": 205655.82208797312\n },\n {\n \"content\": \"struct Query\\n\\n{\\n\\n using ConstByteArray = fetch::byte_array::ConstByteArray;\\n\\n ConstByteArray source;\\n\\n ConstByteArray filename;\\n\\n std::vector<CompiledStatement> statements;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query.hpp\",\n \"rank\": 12,\n \"score\": 204031.11548877592\n },\n {\n \"content\": \"\\n\\n#include \\\"core/byte_array/byte_array.hpp\\\"\\n\\n#include \\\"core/byte_array/const_byte_array.hpp\\\"\\n\\n#include \\\"core/byte_array/consumers.hpp\\\"\\n\\n#include \\\"core/byte_array/tokenizer/tokenizer.hpp\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query.hpp\",\n \"rank\": 13,\n \"score\": 201113.7491416155\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/query/query_instruction.hpp\\\"\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query.hpp\",\n \"rank\": 14,\n \"score\": 201112.79322393824\n },\n {\n \"content\": \"class DNNRegressor : public Model<TensorType>\\n\\n{\\n\\npublic:\\n\\n using SizeType = fetch::math::SizeType;\\n\\n using DataType = typename TensorType::Type;\\n\\n using CostFunctionType = fetch::ml::ops::MeanSquareErrorLoss<TensorType>;\\n\\n using OptimiserType = fetch::ml::OptimiserType;\\n\\n using DataLoaderPtrType = typename Model<TensorType>::DataLoaderPtrType;\\n\\n\\n\\n DNNRegressor() = default;\\n\\n DNNRegressor(DNNRegressor const &other) = default;\\n\\n ~DNNRegressor() override = default;\\n\\n\\n\\n DNNRegressor(ModelConfig<DataType> model_config, std::vector<SizeType> const &hidden_layers);\\n\\n};\\n\\n\\n\\n/**\\n\\n * constructor sets up the neural net architecture and optimiser\\n\\n * @tparam TensorType\\n\\n * @param data_loader_ptr pointer to the dataloader for running the optimiser\\n\",\n \"file_path\": \"libs/ml/include/ml/model/dnn_regressor.hpp\",\n \"rank\": 15,\n \"score\": 199220.0237408324\n },\n {\n \"content\": \"class DNNClassifier : public Model<TensorType>\\n\\n{\\n\\npublic:\\n\\n using SizeType = fetch::math::SizeType;\\n\\n using DataType = typename TensorType::Type;\\n\\n using CostFunctionType = fetch::ml::ops::CrossEntropyLoss<TensorType>;\\n\\n using OptimiserType = fetch::ml::OptimiserType;\\n\\n using DataLoaderPtrType = typename Model<TensorType>::DataLoaderPtrType;\\n\\n\\n\\n DNNClassifier() = default;\\n\\n DNNClassifier(DNNClassifier const &other) = default;\\n\\n ~DNNClassifier() override = default;\\n\\n\\n\\n DNNClassifier(ModelConfig<DataType> model_config, std::vector<SizeType> const &hidden_layers);\\n\\n};\\n\\n\\n\\n/**\\n\\n * constructor sets up the neural net architecture and optimiser\\n\\n * @tparam TensorType\\n\\n * @param data_loader_ptr pointer to the dataloader for running the optimiser\\n\",\n \"file_path\": \"libs/ml/include/ml/model/dnn_classifier.hpp\",\n \"rank\": 16,\n \"score\": 199220.0237408324\n },\n {\n \"content\": \"class VMModel : public fetch::vm::Object\\n\\n{\\n\\npublic:\\n\\n using DataType = fetch::vm_modules::math::DataType;\\n\\n using TensorType = fetch::math::Tensor<DataType>;\\n\\n using ModelType = fetch::ml::model::Model<TensorType>;\\n\\n using ModelPtrType = std::shared_ptr<ModelType>;\\n\\n using ModelConfigType = fetch::ml::model::ModelConfig<DataType>;\\n\\n using ModelConfigPtrType = std::shared_ptr<fetch::ml::model::ModelConfig<DataType>>;\\n\\n using GraphType = fetch::ml::Graph<TensorType>;\\n\\n using TensorDataloader = fetch::ml::dataloaders::TensorDataLoader<TensorType, TensorType>;\\n\\n using TensorDataloaderPtr = std::shared_ptr<TensorDataloader>;\\n\\n using VMTensor = fetch::vm_modules::math::VMTensor;\\n\\n\\n\\n VMModel(fetch::vm::VM *vm, fetch::vm::TypeId type_id);\\n\\n\\n\\n VMModel(fetch::vm::VM *vm, fetch::vm::TypeId type_id,\\n\\n fetch::vm::Ptr<fetch::vm::String> const &model_category);\\n\\n\\n\\n VMModel(fetch::vm::VM *vm, fetch::vm::TypeId type_id, std::string const &model_category);\\n\",\n \"file_path\": \"libs/vm-modules/include/vm_modules/ml/model/model.hpp\",\n \"rank\": 17,\n \"score\": 198672.188464703\n },\n {\n \"content\": \"type Reduction(array_type const &A)\\n\\n{\\n\\n type ret = 0;\\n\\n\\n\\n for (float i : A)\\n\\n {\\n\\n ret += i;\\n\\n }\\n\\n\\n\\n return ret;\\n\\n}\\n\\n\\n\\nint main(int argc, char const **argv)\\n\\n{\\n\\n std::vector<type> A;\\n\\n if (argc != 2)\\n\\n {\\n\\n std::cout << std::endl;\\n\\n std::cout << \\\"Usage: \\\" << argv[0] << \\\" [array size] \\\" << std::endl;\\n\\n std::cout << std::endl;\\n\",\n \"file_path\": \"libs/vectorise/examples/02_reduction/ordinary_solution.cpp\",\n \"rank\": 18,\n \"score\": 198535.96208472\n },\n {\n \"content\": \" enum\\n\\n {\\n\\n TYPE_NONE = 0,\\n\\n TYPE_MODEL = 10,\\n\\n TYPE_INSTANCE,\\n\\n TYPE_KEY,\\n\\n TYPE_STRING,\\n\\n TYPE_INTEGER,\\n\\n TYPE_FLOAT,\\n\\n\\n\\n TYPE_FUNCTION_NAME\\n\\n };\\n\\n\\n\\n // TODO(private issue AEA-128): combine these three into a single execute statement.\\n\\n void ExecuteStore(CompiledStatement const &stmt);\\n\\n void ExecuteSet(CompiledStatement const &stmt);\\n\\n void ExecuteDefine(CompiledStatement const &stmt);\\n\\n\\n\\n template <typename T>\\n\\n bool TypeMismatch(QueryVariant const &var, Token token)\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp\",\n \"rank\": 19,\n \"score\": 197222.233550629\n },\n {\n \"content\": \" {\\n\\n if (!var->IsType<T>())\\n\\n {\\n\\n auto type_a = semantic_search_module_->GetName<T>();\\n\\n auto type_b = semantic_search_module_->GetName(var->type_index());\\n\\n error_tracker_.RaiseInternalError(\\\"Expected \\\" + type_a + \\\", but found other type \\\" + type_b,\\n\\n std::move(token));\\n\\n return true;\\n\\n }\\n\\n return false;\\n\\n }\\n\\n\\n\\n ErrorTracker & error_tracker_;\\n\\n std::vector<QueryVariant> stack_;\\n\\n ExecutionContext context_;\\n\\n SharedSemanticSearchModule semantic_search_module_;\\n\\n Agent agent_{nullptr};\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp\",\n \"rank\": 20,\n \"score\": 197215.21693077145\n },\n {\n \"content\": \" INTERNAL_OPEN_GROUP,\\n\\n INTERNAL_CLOSE_GROUP\\n\\n };\\n\\n\\n\\n enum\\n\\n {\\n\\n PROP_NO_PROP = 0ull,\\n\\n PROP_CTX_MODEL,\\n\\n PROP_CTX_STORE,\\n\\n PROP_CTX_SET,\\n\\n PROP_CTX_FIND,\\n\\n\\n\\n PROP_IS_OPERATOR = 1ul << 16,\\n\\n PROP_IS_GROUP = 1ul << 17,\\n\\n PROP_IS_GROUP_OPEN = 1ul << 18,\\n\\n PROP_IS_CALL = 1ul << 19\\n\\n };\\n\\n\\n\\n Type type = Type::UNKNOWN;\\n\\n uint64_t properties = PROP_NO_PROP;\\n\\n int consumes = 2;\\n\\n Token token;\\n\\n};\\n\\n\\n\\nusing CompiledStatement = std::vector<QueryInstruction>;\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp\",\n \"rank\": 21,\n \"score\": 197211.77258214226\n },\n {\n \"content\": \" bool Match(ConstByteArray const &token) const;\\n\\n void SkipUntilEOL();\\n\\n void SkipWhitespaces();\\n\\n void SkipChar();\\n\\n void SkipChars(uint64_t const &length);\\n\\n\\n\\n void SkipUntil(uint8_t byte);\\n\\n\\n\\n ErrorTracker &error_tracker_;\\n\\n ByteArray document_;\\n\\n uint64_t position_{0};\\n\\n uint64_t char_index_{0};\\n\\n int line_{0};\\n\\n\\n\\n std::vector<Statement> statements_;\\n\\n\\n\\n std::vector<ConstByteArray> keywords_ = {\\\"model\\\", \\\"store\\\", \\\"find\\\", \\\"var\\\", \\\"subspace\\\", \\\"schema\\\"};\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp\",\n \"rank\": 22,\n \"score\": 197206.76158881577\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/query/error_tracker.hpp\\\"\\n\\n#include \\\"semanticsearch/query/execution_context.hpp\\\"\\n\\n#include \\\"semanticsearch/schema/vocabulary_instance.hpp\\\"\\n\\n#include \\\"semanticsearch/semantic_search_module.hpp\\\"\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp\",\n \"rank\": 23,\n \"score\": 197205.92805941642\n },\n {\n \"content\": \"#include \\\"core/byte_array/const_byte_array.hpp\\\"\\n\\n#include \\\"core/byte_array/consumers.hpp\\\"\\n\\n#include \\\"core/byte_array/tokenizer/tokenizer.hpp\\\"\\n\\n\\n\\n#include \\\"semanticsearch/query/error_tracker.hpp\\\"\\n\\n#include \\\"semanticsearch/query/query.hpp\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp\",\n \"rank\": 24,\n \"score\": 197201.15004570823\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"core/byte_array/byte_array.hpp\\\"\\n\\n#include \\\"core/byte_array/const_byte_array.hpp\\\"\\n\\n#include \\\"core/byte_array/consumers.hpp\\\"\\n\\n#include \\\"core/byte_array/tokenizer/tokenizer.hpp\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp\",\n \"rank\": 25,\n \"score\": 197192.24509104964\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"core/byte_array/byte_array.hpp\\\"\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp\",\n \"rank\": 26,\n \"score\": 197179.35765690348\n },\n {\n \"content\": \" LESS_THAN_EQUAL,\\n\\n MORE_THAN,\\n\\n MORE_THAN_EQUAL,\\n\\n\\n\\n SUBSCOPE,\\n\\n VAR_TYPE,\\n\\n ASSIGN,\\n\\n ATTRIBUTE,\\n\\n SEPARATOR,\\n\\n\\n\\n OBJECT_KEY,\\n\\n\\n\\n // Literals\\n\\n FLOAT,\\n\\n INTEGER,\\n\\n STRING,\\n\\n\\n\\n IDENTIFIER,\\n\\n\\n\\n // Only used for compilation\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp\",\n \"rank\": 27,\n \"score\": 197177.69648052406\n },\n {\n \"content\": \"struct QueryInstruction\\n\\n{\\n\\n using ConstByteArray = fetch::byte_array::ConstByteArray;\\n\\n using ByteArray = fetch::byte_array::ByteArray;\\n\\n using Token = fetch::byte_array::Token;\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_instruction.hpp\",\n \"rank\": 28,\n \"score\": 197098.57604697032\n },\n {\n \"content\": \"class QueryCompiler\\n\\n{\\n\\npublic:\\n\\n using ConstByteArray = fetch::byte_array::ConstByteArray;\\n\\n using ByteArray = fetch::byte_array::ByteArray;\\n\\n using Token = fetch::byte_array::Token;\\n\\n\\n\\n explicit QueryCompiler(ErrorTracker &error_tracker);\\n\\n Query operator()(ByteArray doc, ConstByteArray const &filename = \\\"(internal)\\\");\\n\\n\\n\\nprivate:\\n\\n struct Statement\\n\\n {\\n\\n std::vector<Token> tokens;\\n\\n int type;\\n\\n };\\n\\n\\n\\n std::vector<QueryInstruction> AssembleStatement(Statement const &stmt);\\n\\n void Tokenise();\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_compiler.hpp\",\n \"rank\": 29,\n \"score\": 197098.57604697032\n },\n {\n \"content\": \"class QueryExecutor\\n\\n{\\n\\npublic:\\n\\n using VocabularySchema = SemanticSearchModule::VocabularySchema;\\n\\n using ModelField = SemanticSearchModule::ModelField;\\n\\n using Token = fetch::byte_array::Token;\\n\\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\\n\\n using SharedModelRegister = ModelRegister::SharedModelRegister;\\n\\n\\n\\n using Int = int; // TODO(private issue AEA-126): Get rid of these\\n\\n using Float = double;\\n\\n using String = std::string;\\n\\n\\n\\n QueryExecutor(SharedSemanticSearchModule instance, ErrorTracker &error_tracker);\\n\\n void Execute(Query const &query, Agent agent);\\n\\n Vocabulary GetInstance(std::string const &name);\\n\\n\\n\\nprivate:\\n\\n using PropertyMap = std::map<std::string, std::shared_ptr<VocabularyInstance>>;\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/query_executor.hpp\",\n \"rank\": 30,\n \"score\": 197098.57604697032\n },\n {\n \"content\": \" , value_{std::move(value)}\\n\\n {}\\n\\n\\n\\n T value_;\\n\\n};\\n\\n\\n\\nusing QueryVariant = std::shared_ptr<AbstractQueryVariant>;\\n\\n\\n\\ntemplate <typename T>\\n\\nQueryVariant NewQueryVariant(\\n\\n T val, int type = 0,\\n\\n AbstractQueryVariant::Token token = static_cast<AbstractQueryVariant::Token>(\\\"\\\"))\\n\\n{\\n\\n return SpecialisedQueryVariant<T>::New(std::move(val), type, std::move(token));\\n\\n}\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp\",\n \"rank\": 31,\n \"score\": 193434.98854420625\n },\n {\n \"content\": \"class AgentDirectory\\n\\n{\\n\\npublic:\\n\\n using AgentId = AgentProfile::AgentId;\\n\\n using ConstByteArray = fetch::byte_array::ConstByteArray;\\n\\n using Agent = AgentProfile::Agent;\\n\\n\\n\\n AgentId RegisterAgent(ConstByteArray const &pk);\\n\\n Agent GetAgent(ConstByteArray const &pk);\\n\\n bool UnregisterAgent(ConstByteArray const &pk);\\n\\n bool RegisterVocabularyLocation(AgentId id, std::string model, SemanticPosition position);\\n\\n\\n\\nprivate:\\n\\n AgentId counter_{0};\\n\\n std::unordered_map<ConstByteArray, AgentId> pk_to_id_;\\n\\n std::map<AgentId, Agent> agents_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/agent_directory.hpp\",\n \"rank\": 32,\n \"score\": 193431.56122202356\n },\n {\n \"content\": \"struct AgentProfile\\n\\n{\\n\\n using Identity = fetch::crypto::Identity;\\n\\n using Agent = std::shared_ptr<AgentProfile>;\\n\\n using AgentId = uint64_t;\\n\\n\\n\\n static Agent New(AgentId id)\\n\\n {\\n\\n return Agent(new AgentProfile(id));\\n\\n }\\n\\n\\n\\n void RegisterVocabularyLocation(std::string model, SemanticPosition position)\\n\\n {\\n\\n VocabularyLocation loc;\\n\\n\\n\\n loc.model = std::move(model);\\n\\n loc.position = std::move(position);\\n\\n\\n\\n locations.insert(std::move(loc));\\n\\n }\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/agent_profile.hpp\",\n \"rank\": 33,\n \"score\": 193431.56122202356\n },\n {\n \"content\": \"#include \\\"core/byte_array/const_byte_array.hpp\\\"\\n\\n#include \\\"core/byte_array/tokenizer/tokenizer.hpp\\\"\\n\\n\\n\\n#include <memory>\\n\\n#include <stdexcept>\\n\\n#include <typeindex>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp\",\n \"rank\": 34,\n \"score\": 193428.0184247696\n },\n {\n \"content\": \" }\\n\\n return *reinterpret_cast<T *>(data());\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n bool IsType() const\\n\\n {\\n\\n return std::type_index(typeid(T)) == type_index_;\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n T const &As() const\\n\\n {\\n\\n if (std::type_index(typeid(T)) != type_index_)\\n\\n {\\n\\n auto t = std::type_index(typeid(T));\\n\\n throw std::runtime_error(\\\"Type mismatch in QueryVariant: stored \\\" +\\n\\n std::string(type_index_.name()) + \\\" vs. requested \\\" +\\n\\n std::string(t.name()));\\n\\n }\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp\",\n \"rank\": 35,\n \"score\": 193425.14993921365\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"core/byte_array/byte_array.hpp\\\"\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp\",\n \"rank\": 36,\n \"score\": 193414.5814790188\n },\n {\n \"content\": \" return *reinterpret_cast<T const *>(data());\\n\\n }\\n\\n\\n\\n template <typename T>\\n\\n friend class SpecialisedQueryVariant;\\n\\n\\n\\nprivate:\\n\\n AbstractQueryVariant(int32_t type, Token token, std::type_index type_index)\\n\\n : type_{type}\\n\\n , token_{std::move(token)}\\n\\n , type_index_{type_index}\\n\\n {}\\n\\n\\n\\n int32_t type_;\\n\\n Token token_;\\n\\n std::type_index type_index_;\\n\\n};\\n\\n\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp\",\n \"rank\": 37,\n \"score\": 193414.58312639286\n },\n {\n \"content\": \"struct hash<fetch::byte_array::ByteArray> : public hash<fetch::byte_array::ConstByteArray>\\n\\n{\\n\\n};\\n\\n\\n\\n} // namespace std\\n\",\n \"file_path\": \"libs/core/include/core/byte_array/const_byte_array.hpp\",\n \"rank\": 38,\n \"score\": 192430.03290344155\n },\n {\n \"content\": \"struct MapSerializer<ml::model::Sequential<TensorType>, D>\\n\\n{\\n\\n using Type = ml::model::Sequential<TensorType>;\\n\\n using DriverType = D;\\n\\n static uint8_t const BASE_MODEL = 1;\\n\\n static uint8_t const LAYER_COUNT = 2;\\n\\n static uint8_t const PREV_LAYER_STR = 3;\\n\\n\\n\\n template <typename Constructor>\\n\\n static void Serialize(Constructor &map_constructor, Type const &sp)\\n\\n {\\n\\n auto map = map_constructor(3);\\n\\n\\n\\n // serialize the optimiser parent class\\n\\n auto base_pointer = static_cast<ml::model::Model<TensorType> const *>(&sp);\\n\\n map.Append(BASE_MODEL, *base_pointer);\\n\\n map.Append(LAYER_COUNT, sp.layer_count_);\\n\\n map.Append(PREV_LAYER_STR, sp.prev_layer_);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"libs/ml/include/ml/model/sequential.hpp\",\n \"rank\": 39,\n \"score\": 191044.84589822163\n },\n {\n \"content\": \"class AbstractQueryVariant\\n\\n{\\n\\npublic:\\n\\n using Token = fetch::byte_array::Token;\\n\\n\\n\\n virtual ~AbstractQueryVariant() = default;\\n\\n virtual void const *data() const = 0;\\n\\n\\n\\n void SetType(int type);\\n\\n int type() const;\\n\\n void SetToken(Token token);\\n\\n Token token() const;\\n\\n std::type_index type_index() const;\\n\\n\\n\\n template <typename T>\\n\\n explicit operator T() const\\n\\n {\\n\\n if (std::type_index(typeid(T)) != type_index_)\\n\\n {\\n\\n throw std::runtime_error(\\\"Type mismatch in QueryVariant.\\\");\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp\",\n \"rank\": 40,\n \"score\": 190662.68495294751\n },\n {\n \"content\": \"struct hash<fetch::byte_array::ConstByteArray>\\n\\n{\\n\\n std::size_t operator()(fetch::byte_array::ConstByteArray const &value) const noexcept\\n\\n {\\n\\n uint64_t h = 2166136261U;\\n\\n uint64_t i;\\n\\n\\n\\n for (i = 0; i < value.size(); ++i)\\n\\n {\\n\\n h = (h * 16777619) ^ value[i];\\n\\n }\\n\\n\\n\\n return h;\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <>\\n\",\n \"file_path\": \"libs/core/include/core/byte_array/const_byte_array.hpp\",\n \"rank\": 41,\n \"score\": 190184.78026413923\n },\n {\n \"content\": \"class ModelRegister\\n\\n{\\n\\npublic:\\n\\n using VocabularySchema = std::shared_ptr<PropertiesToSubspace>;\\n\\n using SharedModelRegister = std::shared_ptr<ModelRegister>;\\n\\n\\n\\n ModelRegister() = default;\\n\\n virtual ~ModelRegister() = default;\\n\\n\\n\\n void AddModel(std::string const &name, VocabularySchema const &object);\\n\\n VocabularySchema GetModel(std::string const &name);\\n\\n bool HasModel(std::string const &name);\\n\\n\\n\\n virtual void OnAddModel(std::string const &name, VocabularySchema const &object) = 0;\\n\\n\\n\\nprivate:\\n\\n std::unordered_map<std::string, VocabularySchema> models_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/schema/model_register.hpp\",\n \"rank\": 42,\n \"score\": 189768.15197451258\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/agent_profile.hpp\\\"\\n\\n#include \\\"semanticsearch/index/base_types.hpp\\\"\\n\\n\\n\\n#include <map>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/agent_directory.hpp\",\n \"rank\": 43,\n \"score\": 186585.56477191346\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/index/base_types.hpp\\\"\\n\\n#include \\\"semanticsearch/location.hpp\\\"\\n\\n\\n\\n#include <crypto/identity.hpp>\\n\\n#include <memory>\\n\\n#include <string>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/agent_profile.hpp\",\n \"rank\": 44,\n \"score\": 186581.22698532534\n },\n {\n \"content\": \"\\n\\n Identity identity;\\n\\n AgentId id;\\n\\n std::set<VocabularyLocation> locations;\\n\\n\\n\\nprivate:\\n\\n explicit AgentProfile(AgentId i)\\n\\n : id(i)\\n\\n {}\\n\\n};\\n\\n\\n\\nusing Agent = AgentProfile::Agent;\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/agent_profile.hpp\",\n \"rank\": 45,\n \"score\": 186580.03747222526\n },\n {\n \"content\": \" }\\n\\n\\n\\n AgentIdSet FindAgents(SemanticPosition position, SemanticCoordinateType granularity)\\n\\n {\\n\\n return index_.Find(granularity, std::move(position));\\n\\n }\\n\\n\\n\\n VocabularySchema model() const\\n\\n {\\n\\n return object_model_;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n VocabularySchema object_model_;\\n\\n InMemoryDBIndex index_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/model_advertisement.hpp\",\n \"rank\": 46,\n \"score\": 186553.55047096146\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/index/in_memory_db_index.hpp\\\"\\n\\n#include \\\"semanticsearch/schema/properties_map.hpp\\\"\\n\\n#include \\\"semanticsearch/schema/vocabulary_instance.hpp\\\"\\n\\n\\n\\n#include <string>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/model_advertisement.hpp\",\n \"rank\": 47,\n \"score\": 186542.7546661555\n },\n {\n \"content\": \"struct UnrollPointers<0, ClassType, MemberFunctionPointer, ReturnType, UsedArgs...>\\n\\n{\\n\\n template <typename... remaining_args>\\n\\n struct LoopOver\\n\\n {\\n\\n static void Unroll(SerializerType &result, ClassType &cls, MemberFunctionPointer &m,\\n\\n CallableArgumentList const & /*additional_args*/, SerializerType &s,\\n\\n UsedArgs &... used)\\n\\n {\\n\\n UnrollArguments<ClassType, MemberFunctionPointer, ReturnType, UsedArgs...>::template LoopOver<\\n\\n CountArguments<remaining_args...>::value, remaining_args...>::Unroll(result, cls, m, s,\\n\\n used...);\\n\\n }\\n\\n };\\n\\n};\\n\\n} // namespace details\\n\\n\\n\\n/* A member function wrapper that takes a serialized input.\\n\\n * @C is the class type to which the member function belongs.\\n\\n * @F is the function signature.\\n\\n *\\n\\n * This module should be benchmarked against the more general class\\n\\n * <Function>. If there is no notable performance difference this\\n\\n * implementation should be dropped to keep the code base small and\\n\\n * simple.\\n\\n *\\n\\n * TODO(issue 23):\\n\\n */\\n\\ntemplate <typename C, typename F, std::size_t N = 0>\\n\",\n \"file_path\": \"libs/network/include/network/service/callable_class_member.hpp\",\n \"rank\": 48,\n \"score\": 186489.75173495465\n },\n {\n \"content\": \"struct MapSerializer<ml::model::DNNClassifier<TensorType>, D>\\n\\n{\\n\\n using Type = ml::model::DNNClassifier<TensorType>;\\n\\n using DriverType = D;\\n\\n static uint8_t const BASE_MODEL = 1;\\n\\n\\n\\n template <typename Constructor>\\n\\n static void Serialize(Constructor &map_constructor, Type const &sp)\\n\\n {\\n\\n auto map = map_constructor(1);\\n\\n\\n\\n // serialize the optimiser parent class\\n\\n auto base_pointer = static_cast<ml::model::Model<TensorType> const *>(&sp);\\n\\n map.Append(BASE_MODEL, *base_pointer);\\n\\n }\\n\\n\\n\\n template <typename MapDeserializer>\\n\\n static void Deserialize(MapDeserializer &map, Type &sp)\\n\\n {\\n\\n auto base_pointer = static_cast<ml::model::Model<TensorType> *>(&sp);\\n\\n map.ExpectKeyGetValue(BASE_MODEL, *base_pointer);\\n\\n }\\n\\n};\\n\\n} // namespace serializers\\n\\n\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/ml/include/ml/model/dnn_classifier.hpp\",\n \"rank\": 49,\n \"score\": 185171.6367080124\n },\n {\n \"content\": \"struct MapSerializer<ml::model::DNNRegressor<TensorType>, D>\\n\\n{\\n\\n using Type = ml::model::DNNRegressor<TensorType>;\\n\\n using DriverType = D;\\n\\n static uint8_t const BASE_MODEL = 1;\\n\\n\\n\\n template <typename Constructor>\\n\\n static void Serialize(Constructor &map_constructor, Type const &sp)\\n\\n {\\n\\n auto map = map_constructor(1);\\n\\n\\n\\n // serialize the optimiser parent class\\n\\n auto base_pointer = static_cast<ml::model::Model<TensorType> const *>(&sp);\\n\\n map.Append(BASE_MODEL, *base_pointer);\\n\\n }\\n\\n\\n\\n template <typename MapDeserializer>\\n\\n static void Deserialize(MapDeserializer &map, Type &sp)\\n\\n {\\n\\n auto base_pointer = static_cast<ml::model::Model<TensorType> *>(&sp);\\n\\n map.ExpectKeyGetValue(BASE_MODEL, *base_pointer);\\n\\n }\\n\\n};\\n\\n} // namespace serializers\\n\\n\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/ml/include/ml/model/dnn_regressor.hpp\",\n \"rank\": 50,\n \"score\": 185171.6367080124\n },\n {\n \"content\": \"class BuiltinQueryFunction\\n\\n{\\n\\npublic:\\n\\n using CallerSignature = std::function<QueryVariant(std::vector<void const *> &)>;\\n\\n using Function = std::shared_ptr<BuiltinQueryFunction>;\\n\\n\\n\\n template <typename R, typename... Args>\\n\\n static Function New(std::function<R(Args...)> caller)\\n\\n {\\n\\n // Creating a shared builtin query function and\\n\\n // computes a list of type indices for the function arguments\\n\\n Function ret = Function(new BuiltinQueryFunction(std::type_index(typeid(R))));\\n\\n details::ArgumentsToTypeVector<R, Args...>::Apply(ret->arguments_);\\n\\n\\n\\n // Creating a type converter which converts type-erased void* arguments\\n\\n // into their original types\\n\\n ret->caller_ = [caller](std::vector<void const *> &args) -> QueryVariant {\\n\\n R return_value;\\n\\n\\n\\n // Calls the original caller function\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/builtin_query_function.hpp\",\n \"rank\": 51,\n \"score\": 182957.0748567484\n },\n {\n \"content\": \"class ModelInterfaceBuilder\\n\\n{\\n\\npublic:\\n\\n using ModelField = std::shared_ptr<VocabularyToSubspaceMapInterface>;\\n\\n using VocabularySchema = std::shared_ptr<PropertiesToSubspace>;\\n\\n\\n\\n explicit ModelInterfaceBuilder(VocabularySchema model = nullptr,\\n\\n SemanticSearchModule *factory = nullptr);\\n\\n\\n\\n explicit operator bool() const;\\n\\n ModelInterfaceBuilder &Field(std::string const &name, std::string const &type);\\n\\n ModelInterfaceBuilder &Field(std::string const &name, ModelInterfaceBuilder proxy);\\n\\n ModelInterfaceBuilder &Field(std::string const &name, ModelField const &model);\\n\\n\\n\\n ModelInterfaceBuilder Vocabulary(std::string const &name);\\n\\n\\n\\n VocabularySchema const &model() const\\n\\n {\\n\\n return model_;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n VocabularySchema model_;\\n\\n SemanticSearchModule *factory_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/model_interface_builder.hpp\",\n \"rank\": 52,\n \"score\": 182942.14231966884\n },\n {\n \"content\": \"class Model\\n\\n{\\n\\npublic:\\n\\n using DataType = typename TensorType::Type;\\n\\n using SizeType = fetch::math::SizeType;\\n\\n using GraphType = Graph<TensorType>;\\n\\n using DataLoaderType = dataloaders::DataLoader<TensorType, TensorType>;\\n\\n using ModelOptimiserType = optimisers::Optimiser<TensorType>;\\n\\n using GraphPtrType = typename std::shared_ptr<GraphType>;\\n\\n using DataLoaderPtrType = typename std::shared_ptr<DataLoaderType>;\\n\\n using OptimiserPtrType = typename std::shared_ptr<ModelOptimiserType>;\\n\\n\\n\\n explicit Model(ModelConfig<DataType> model_config = ModelConfig<DataType>())\\n\\n : model_config_(std::move(model_config))\\n\\n {}\\n\\n Model(Model const &other)\\n\\n {\\n\\n graph_ptr_.reset(other.graph_ptr_.get());\\n\\n dataloader_ptr_.reset(other.dataloader_ptr_.get());\\n\\n optimiser_ptr_.reset(other.optimiser_ptr_.get());\\n\",\n \"file_path\": \"libs/ml/include/ml/model/model.hpp\",\n \"rank\": 53,\n \"score\": 182395.61360096958\n },\n {\n \"content\": \" {\\n\\n return type_;\\n\\n }\\n\\n\\n\\n void Walk(std::function<void(std::string, Vocabulary)> const &callback,\\n\\n std::string const & name = \\\"\\\");\\n\\n Vocabulary &operator[](std::string const &name);\\n\\n void Insert(std::string const &name, Vocabulary const &value);\\n\\n\\n\\nprivate:\\n\\n VocabularyInstance(std::type_index type, void *data)\\n\\n : type_(type)\\n\\n , data_(data)\\n\\n {}\\n\\n\\n\\n std::type_index type_;\\n\\n void * data_{nullptr};\\n\\n\\n\\n template <typename T>\\n\\n friend class DataToSubspaceMap;\\n\\n friend class PropertiesToSubspace;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/schema/vocabulary_instance.hpp\",\n \"rank\": 54,\n \"score\": 182340.81674328088\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include <functional>\\n\\n#include <map>\\n\\n#include <string>\\n\\n#include <type_traits>\\n\\n#include <typeindex>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/schema/vocabulary_instance.hpp\",\n \"rank\": 55,\n \"score\": 182327.7758122146\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/query/query.hpp\\\"\\n\\n#include \\\"semanticsearch/schema/vocabulary_instance.hpp\\\"\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/execution_context.hpp\",\n \"rank\": 56,\n \"score\": 182309.89438753968\n },\n {\n \"content\": \" }\\n\\n\\n\\n std::string GetModelName(std::string const &name)\\n\\n {\\n\\n return models_[name];\\n\\n }\\n\\n\\n\\nprivate:\\n\\n std::map<std::string, Vocabulary> context_;\\n\\n std::map<std::string, std::string> models_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/execution_context.hpp\",\n \"rank\": 57,\n \"score\": 182303.8621102495\n },\n {\n \"content\": \" }\\n\\n Type type() const\\n\\n {\\n\\n return type_;\\n\\n }\\n\\n int line() const\\n\\n {\\n\\n return token_.line();\\n\\n }\\n\\n uint64_t character() const\\n\\n {\\n\\n return token_.character();\\n\\n }\\n\\n\\n\\nprivate:\\n\\n ConstByteArray filename_;\\n\\n ConstByteArray source_;\\n\\n ConstByteArray message_;\\n\\n Token token_;\\n\\n Type type_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_message.hpp\",\n \"rank\": 58,\n \"score\": 182303.00211263497\n },\n {\n \"content\": \" bool HasErrors() const;\\n\\n\\n\\nprivate:\\n\\n void PrintLine(int line, uint64_t character, uint64_t char_end = uint64_t(-1)) const;\\n\\n void PrintErrorMessage(ErrorMessage const &error);\\n\\n\\n\\n ConstByteArray source_;\\n\\n ConstByteArray filename_;\\n\\n std::vector<ErrorMessage> errors_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp\",\n \"rank\": 59,\n \"score\": 182301.043911967\n },\n {\n \"content\": \"#include \\\"core/byte_array/const_byte_array.hpp\\\"\\n\\n#include \\\"core/byte_array/consumers.hpp\\\"\\n\\n#include \\\"core/byte_array/tokenizer/tokenizer.hpp\\\"\\n\\n#include \\\"core/commandline/vt100.hpp\\\"\\n\\n\\n\\n#include <vector>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_message.hpp\",\n \"rank\": 60,\n \"score\": 182296.1056854471\n },\n {\n \"content\": \"\\n\\n#include <core/byte_array/byte_array.hpp>\\n\\n#include <core/byte_array/const_byte_array.hpp>\\n\\n#include <core/byte_array/consumers.hpp>\\n\\n#include <core/byte_array/tokenizer/tokenizer.hpp>\\n\\n#include <vector>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp\",\n \"rank\": 61,\n \"score\": 182295.85806048443\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/query/error_message.hpp\\\"\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp\",\n \"rank\": 62,\n \"score\": 182293.32209769974\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/schema/properties_map.hpp\\\"\\n\\n\\n\\n#include <memory>\\n\\n#include <unordered_map>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/schema/model_register.hpp\",\n \"rank\": 63,\n \"score\": 182286.4728693481\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"core/byte_array/byte_array.hpp\\\"\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_message.hpp\",\n \"rank\": 64,\n \"score\": 182283.58175397458\n },\n {\n \"content\": \" , message_(std::move(message))\\n\\n , token_(std::move(token))\\n\\n , type_(type)\\n\\n {}\\n\\n\\n\\n ConstByteArray filename() const\\n\\n {\\n\\n return filename_;\\n\\n }\\n\\n ConstByteArray source() const\\n\\n {\\n\\n return source_;\\n\\n }\\n\\n ConstByteArray message() const\\n\\n {\\n\\n return message_;\\n\\n }\\n\\n Token token() const\\n\\n {\\n\\n return token_;\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_message.hpp\",\n \"rank\": 65,\n \"score\": 182277.6560652008\n },\n {\n \"content\": \"#include <set>\\n\\n#include <vector>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\\nusing DBIndexType = uint64_t;\\n\\nusing SemanticCoordinateType = uint64_t; // Always internal 0 -> 1\\n\\nusing SemanticPosition = std::vector<SemanticCoordinateType>;\\n\\n\\n\\nusing DBIndexList = std::set<DBIndexType>;\\n\\nusing DBIndexListPtr = std::shared_ptr<DBIndexList>;\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/index/base_types.hpp\",\n \"rank\": 66,\n \"score\": 182174.54775018923\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include <memory>\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/index/base_types.hpp\",\n \"rank\": 67,\n \"score\": 182146.79686800533\n },\n {\n \"content\": \"struct std::hash<fetch::network::Uri> : private std::hash<fetch::byte_array::ConstByteArray>\\n\\n{\\n\\n std::size_t operator()(fetch::network::Uri const &x) const\\n\\n {\\n\\n return std::hash<fetch::byte_array::ConstByteArray>::operator()(x.uri());\\n\\n }\\n\\n};\\n\",\n \"file_path\": \"libs/network/include/network/uri.hpp\",\n \"rank\": 68,\n \"score\": 182051.81534822332\n },\n {\n \"content\": \"class SpecialisedQueryVariant final : public AbstractQueryVariant\\n\\n{\\n\\npublic:\\n\\n using Token = fetch::byte_array::Token;\\n\\n using QueryVariant = std::shared_ptr<AbstractQueryVariant>;\\n\\n\\n\\n static QueryVariant New(T value, int32_t type = 0, Token token = static_cast<Token>(\\\"\\\"))\\n\\n {\\n\\n return QueryVariant(new SpecialisedQueryVariant<T>(std::move(value), type, std::move(token),\\n\\n std::type_index(typeid(T))));\\n\\n }\\n\\n\\n\\n void const *data() const override\\n\\n {\\n\\n return reinterpret_cast<void const *>(&value_);\\n\\n }\\n\\n\\n\\nprivate:\\n\\n SpecialisedQueryVariant(T value, int32_t type, Token token, std::type_index type_index)\\n\\n : AbstractQueryVariant(type, std::move(token), type_index)\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/abstract_query_variant.hpp\",\n \"rank\": 69,\n \"score\": 181563.59564195637\n },\n {\n \"content\": \"class VocabularyInstance : public std::enable_shared_from_this<VocabularyInstance>\\n\\n{\\n\\npublic:\\n\\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\\n\\n using PropertyMap = std::map<std::string, std::shared_ptr<VocabularyInstance>>;\\n\\n\\n\\n template <typename T>\\n\\n static Vocabulary New(T data)\\n\\n {\\n\\n // TODO(private issue 143): add destructor\\n\\n Vocabulary ret;\\n\\n ret.reset(new VocabularyInstance(std::type_index(typeid(T)), new T(data)));\\n\\n\\n\\n return ret;\\n\\n }\\n\\n\\n\\n VocabularyInstance() = delete;\\n\\n VocabularyInstance(VocabularyInstance const &other) = delete;\\n\\n VocabularyInstance &operator=(VocabularyInstance const &other) = delete;\\n\\n std::type_index type() const\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/schema/vocabulary_instance.hpp\",\n \"rank\": 70,\n \"score\": 179104.08854688812\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/module/args_resolver.hpp\\\"\\n\\n#include \\\"semanticsearch/query/abstract_query_variant.hpp\\\"\\n\\n\\n\\n#include <functional>\\n\\n#include <memory>\\n\\n#include <vector>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/builtin_query_function.hpp\",\n \"rank\": 71,\n \"score\": 178252.100887338\n },\n {\n \"content\": \" details::VectorToArguments<sizeof...(Args)>::template Unroll<R, Args...>::Apply(\\n\\n 0, caller, return_value, args);\\n\\n\\n\\n // Creating a resulting variant for the return type.\\n\\n return NewQueryVariant(return_value);\\n\\n };\\n\\n\\n\\n return ret;\\n\\n }\\n\\n\\n\\n bool ValidateSignature(std::type_index const &ret, std::vector<std::type_index> const &args);\\n\\n QueryVariant operator()(std::vector<void const *> &args);\\n\\n std::type_index return_type() const;\\n\\n\\n\\nprivate:\\n\\n explicit BuiltinQueryFunction(std::type_index return_type)\\n\\n : return_type_(return_type)\\n\\n {}\\n\\n\\n\\n std::vector<std::type_index> arguments_;\\n\\n std::type_index return_type_;\\n\\n\\n\\n CallerSignature caller_;\\n\\n};\\n\\n\\n\\n} // namespace semanticsearch\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/builtin_query_function.hpp\",\n \"rank\": 72,\n \"score\": 178249.8641776989\n },\n {\n \"content\": \"#pragma once\\n\\n//------------------------------------------------------------------------------\\n\\n//\\n\\n// Copyright 2018-2019 Fetch.AI Limited\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n//\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#include \\\"semanticsearch/schema/properties_map.hpp\\\"\\n\\n#include \\\"semanticsearch/schema/subspace_map_interface.hpp\\\"\\n\\n\\n\\n#include <memory>\\n\\n\\n\\nnamespace fetch {\\n\\nnamespace semanticsearch {\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/model_interface_builder.hpp\",\n \"rank\": 73,\n \"score\": 178233.24168027364\n },\n {\n \"content\": \"class VocabularyAdvertisement\\n\\n{\\n\\npublic:\\n\\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\\n\\n using Index = uint64_t;\\n\\n using VocabularySchema = std::shared_ptr<PropertiesToSubspace>;\\n\\n using AgentId = uint64_t;\\n\\n using AgentIdSet = std::shared_ptr<std::set<AgentId>>;\\n\\n\\n\\n explicit VocabularyAdvertisement(VocabularySchema object_model)\\n\\n : object_model_(std::move(object_model))\\n\\n {}\\n\\n\\n\\n void SubscribeAgent(AgentId aid, SemanticPosition position)\\n\\n {\\n\\n SemanticSubscription rel;\\n\\n rel.position = std::move(position);\\n\\n rel.index = aid; // TODO(private issue AEA-129): Change to agent id\\n\\n\\n\\n index_.AddRelation(rel);\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/model_advertisement.hpp\",\n \"rank\": 74,\n \"score\": 178203.49976042839\n },\n {\n \"content\": \"class Agent;\\n\",\n \"file_path\": \"libs/oef-core/include/oef-core/agents/Agents.hpp\",\n \"rank\": 75,\n \"score\": 177864.4518536752\n },\n {\n \"content\": \"class Agent\\n\\n{\\n\\npublic:\\n\\n Agent(std::string key, std::shared_ptr<OefAgentEndpoint> endpoint)\\n\\n {\\n\\n this->key = std::move(key);\\n\\n this->endpoint = std::move(endpoint);\\n\\n }\\n\\n\\n\\n ~Agent() = default;\\n\\n\\n\\n Notification::NotificationBuilder send(std::shared_ptr<google::protobuf::Message> s);\\n\\n\\n\\n void run_sending();\\n\\n\\n\\n std::string getPublicKey()\\n\\n {\\n\\n return key;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"libs/oef-core/include/oef-core/agents/Agent.hpp\",\n \"rank\": 76,\n \"score\": 177864.4518536752\n },\n {\n \"content\": \"class Weights : public fetch::ml::ops::Variable<T>\\n\\n{\\n\\npublic:\\n\\n using TensorType = T;\\n\\n using SizeType = fetch::math::SizeType;\\n\\n using DataType = typename TensorType::Type;\\n\\n using ArrayPtrType = std::shared_ptr<TensorType>;\\n\\n using VecTensorType = typename Variable<T>::VecTensorType;\\n\\n using SPType = OpWeightsSaveableParams<TensorType>;\\n\\n using WeightsPtrType = typename std::shared_ptr<Weights<TensorType>>;\\n\\n\\n\\npublic:\\n\\n Weights() = default;\\n\\n\\n\\n explicit Weights(SPType const &sp)\\n\\n : Variable<T>(sp)\\n\\n {}\\n\\n\\n\\n ~Weights() override = default;\\n\\n\\n\",\n \"file_path\": \"libs/ml/include/ml/ops/weights.hpp\",\n \"rank\": 77,\n \"score\": 175943.044694561\n },\n {\n \"content\": \"struct MapSerializer<fetch::ml::dataloaders::DataLoader<LabelType, InputType>, D>\\n\\n{\\n\\n using Type = fetch::ml::dataloaders::DataLoader<LabelType, InputType>;\\n\\n using DriverType = D;\\n\\n\\n\\n static uint8_t const RANDOM_MODE = 1;\\n\\n static uint8_t const SIZE_NOT_SET = 2;\\n\\n static uint8_t const CUR_TRAINING_PAIR_FIRST = 3;\\n\\n static uint8_t const CUR_TRAINING_PAIR_SECOND = 4;\\n\\n static uint8_t const RET_PAIR_FIRST = 5;\\n\\n static uint8_t const RET_PAIR_SECOND = 6;\\n\\n\\n\\n template <typename Constructor>\\n\\n static void Serialize(Constructor &map_constructor, Type const &sp)\\n\\n {\\n\\n auto map = map_constructor(6);\\n\\n\\n\\n map.Append(RANDOM_MODE, sp.random_mode_);\\n\\n map.Append(SIZE_NOT_SET, sp.size_not_set_);\\n\\n map.Append(CUR_TRAINING_PAIR_FIRST, sp.cur_training_pair_.first);\\n\",\n \"file_path\": \"libs/ml/include/ml/dataloaders/dataloader.hpp\",\n \"rank\": 78,\n \"score\": 175660.80987024822\n },\n {\n \"content\": \"class ErrorTracker\\n\\n{\\n\\npublic:\\n\\n using ConstByteArray = fetch::byte_array::ConstByteArray;\\n\\n using Token = fetch::byte_array::Token;\\n\\n using SharedErrorTracker = std::shared_ptr<ErrorTracker>;\\n\\n\\n\\n ErrorTracker() = default;\\n\\n\\n\\n explicit operator bool()\\n\\n {\\n\\n return !errors_.empty();\\n\\n }\\n\\n\\n\\n void Print();\\n\\n void RaiseSyntaxError(ConstByteArray message, Token token);\\n\\n void RaiseRuntimeError(ConstByteArray message, Token token);\\n\\n void RaiseInternalError(ConstByteArray message, Token token);\\n\\n void SetSource(ConstByteArray source, ConstByteArray filename);\\n\\n void ClearErrors();\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_tracker.hpp\",\n \"rank\": 79,\n \"score\": 174345.4958219476\n },\n {\n \"content\": \"class ExecutionContext\\n\\n{\\n\\npublic:\\n\\n using ConstByteArray = fetch::byte_array::ConstByteArray;\\n\\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\\n\\n\\n\\n Vocabulary Get(std::string const &name)\\n\\n {\\n\\n return context_[name];\\n\\n }\\n\\n\\n\\n void Set(std::string const &name, Vocabulary object, std::string type)\\n\\n {\\n\\n models_[name] = std::move(type);\\n\\n context_[name] = std::move(object);\\n\\n }\\n\\n\\n\\n bool Has(std::string const &name)\\n\\n {\\n\\n return context_.find(name) != context_.end();\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/execution_context.hpp\",\n \"rank\": 80,\n \"score\": 174345.4958219476\n },\n {\n \"content\": \"class ErrorMessage\\n\\n{\\n\\npublic:\\n\\n using ConstByteArray = fetch::byte_array::ConstByteArray;\\n\\n using Token = fetch::byte_array::Token;\\n\\n\\n\\n enum Type\\n\\n {\\n\\n WARNING,\\n\\n SYNTAX_ERROR,\\n\\n RUNTIME_ERROR,\\n\\n INTERNAL_ERROR,\\n\\n INFO,\\n\\n APPEND\\n\\n };\\n\\n\\n\\n ErrorMessage(ConstByteArray filename, ConstByteArray source, ConstByteArray message, Token token,\\n\\n Type type = SYNTAX_ERROR)\\n\\n : filename_(std::move(filename))\\n\\n , source_(std::move(source))\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/query/error_message.hpp\",\n \"rank\": 81,\n \"score\": 174345.4958219476\n },\n {\n \"content\": \"enum class MetricType\\n\\n{\\n\\n LOSS,\\n\\n ACCURACY\\n\\n};\\n\\n\\n\\ntemplate <typename TensorType>\\n\",\n \"file_path\": \"libs/ml/include/ml/model/model.hpp\",\n \"rank\": 82,\n \"score\": 174230.25573304683\n },\n {\n \"content\": \"struct MapSerializer<fetch::ml::dataloaders::TensorDataLoader<LabelType, InputType>, D>\\n\\n{\\n\\n using Type = fetch::ml::dataloaders::TensorDataLoader<LabelType, InputType>;\\n\\n using DriverType = D;\\n\\n\\n\\n static uint8_t const BASE_DATA_LOADER = 1;\\n\\n static uint8_t const TRAIN_CURSOR = 2;\\n\\n static uint8_t const TEST_CURSOR = 3;\\n\\n static uint8_t const VALIDATION_CURSOR = 4;\\n\\n static uint8_t const TEST_OFFSET = 5;\\n\\n static uint8_t const VALIDATION_OFFSET = 6;\\n\\n static uint8_t const TEST_TO_TRAIN_RATIO = 7;\\n\\n static uint8_t const VALIDATION_TO_TRAIN_RATIO = 8;\\n\\n static uint8_t const N_SAMPLES = 9;\\n\\n static uint8_t const N_TRAIN_SAMPLES = 10;\\n\\n static uint8_t const N_TEST_SAMPLES = 11;\\n\\n static uint8_t const N_VALIDATION_SAMPLES = 12;\\n\\n static uint8_t const DATA = 13;\\n\\n static uint8_t const LABELS = 14;\\n\\n\\n\",\n \"file_path\": \"libs/ml/include/ml/dataloaders/tensor_dataloader.hpp\",\n \"rank\": 83,\n \"score\": 170612.25695277023\n },\n {\n \"content\": \"struct ArgumentsToTypeVector\\n\\n{\\n\\n static void Apply(std::vector<std::type_index> &args)\\n\\n {\\n\\n args.push_back(std::type_index(typeid(A)));\\n\\n ArgumentsToTypeVector<R, Args...>::Apply(args);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename R, typename A>\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/args_resolver.hpp\",\n \"rank\": 84,\n \"score\": 170519.19920289444\n },\n {\n \"content\": \"class SemanticSearchModule;\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/model_interface_builder.hpp\",\n \"rank\": 85,\n \"score\": 167095.2075889893\n },\n {\n \"content\": \"class AdvertisementRegister : public ModelRegister\\n\\n{\\n\\npublic:\\n\\n using Vocabulary = std::shared_ptr<VocabularyInstance>;\\n\\n using SharedModel = std::shared_ptr<VocabularyAdvertisement>;\\n\\n using SharedModelRegister = ModelRegister::SharedModelRegister;\\n\\n using Index = VocabularyAdvertisement::Index;\\n\\n using AgentId = VocabularyAdvertisement::AgentId;\\n\\n using AgentIdSet = VocabularyAdvertisement::AgentIdSet;\\n\\n\\n\\n AdvertisementRegister() = default;\\n\\n\\n\\n bool CreateModel(std::string const &name, VocabularySchema const &object);\\n\\n SharedModel GetAdvertisementModel(std::string const &name);\\n\\n void AdvertiseAgent(AgentId aid, std::string const &name, SemanticPosition const &position);\\n\\n AgentIdSet FindAgents(std::string const &name, SemanticPosition const &position,\\n\\n SemanticCoordinateType granularity);\\n\\n AgentIdSet FindAgents(std::string const &name, Vocabulary const &object,\\n\\n SemanticCoordinateType granularity);\\n\\n\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/advertisement_register.hpp\",\n \"rank\": 86,\n \"score\": 167095.2075889893\n },\n {\n \"content\": \"struct ArgumentsToTypeVector<R, A>\\n\\n{\\n\\n static void Apply(std::vector<std::type_index> &args)\\n\\n {\\n\\n args.push_back(std::type_index(typeid(A)));\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename R>\\n\",\n \"file_path\": \"libs/semanticsearch/include/semanticsearch/module/args_resolver.hpp\",\n \"rank\": 87,\n \"score\": 166982.6294867155\n },\n {\n \"content\": \"struct Type;\\n\\nusing TypePtr = std::shared_ptr<Type>;\\n\\nusing TypePtrArray = std::vector<TypePtr>;\\n\\nusing Operators = std::unordered_set<Operator>;\\n\\n\\n\",\n \"file_path\": \"libs/vm/include/vm/node.hpp\",\n \"rank\": 88,\n \"score\": 163534.13204099747\n },\n {\n \"content\": \"struct IsMathImpl<float, ReturnType>\\n\\n{\\n\\n using Type = ReturnType;\\n\\n};\\n\\ntemplate <typename ReturnType>\\n\",\n \"file_path\": \"libs/vectorise/include/vectorise/meta/math_type_traits.hpp\",\n \"rank\": 89,\n \"score\": 160372.88851432505\n },\n {\n \"content\": \"struct IsMathImpl<double, ReturnType>\\n\\n{\\n\\n using Type = ReturnType;\\n\\n};\\n\\ntemplate <typename ReturnType>\\n\",\n \"file_path\": \"libs/vectorise/include/vectorise/meta/math_type_traits.hpp\",\n \"rank\": 90,\n \"score\": 160372.88851432505\n },\n {\n \"content\": \"struct IsMathImpl<int, ReturnType>\\n\\n{\\n\\n using Type = ReturnType;\\n\\n};\\n\\ntemplate <typename ReturnType>\\n\",\n \"file_path\": \"libs/vectorise/include/vectorise/meta/math_type_traits.hpp\",\n \"rank\": 91,\n \"score\": 160372.88851432505\n },\n {\n \"content\": \"struct MakeParameterType<T, std::enable_if_t<fetch::vm::IsPtr<T>::value>>\\n\\n{\\n\\n using type = T const &;\\n\\n};\\n\\n\\n\\n} // namespace vm\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/vm/include/vm/module/base.hpp\",\n \"rank\": 92,\n \"score\": 160215.04038607207\n },\n {\n \"content\": \"struct MakeParameterType<T, std::enable_if_t<fetch::vm::IsVariant<T>::value>>\\n\\n{\\n\\n using type = T const &;\\n\\n};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"libs/vm/include/vm/module/base.hpp\",\n \"rank\": 93,\n \"score\": 160215.04038607207\n },\n {\n \"content\": \"struct MakeParameterType<T, std::enable_if_t<fetch::vm::IsPrimitive<T>::value>>\\n\\n{\\n\\n using type = T;\\n\\n};\\n\\ntemplate <typename T>\\n\",\n \"file_path\": \"libs/vm/include/vm/module/base.hpp\",\n \"rank\": 94,\n \"score\": 160215.04038607207\n },\n {\n \"content\": \"struct IsMathArrayImpl<Tensor<DataType, ContainerType>, ReturnType>\\n\\n{\\n\\n using Type = ReturnType;\\n\\n};\\n\\ntemplate <typename DataType, typename ReturnType>\\n\\nusing IfIsMathArray = typename IsMathArrayImpl<DataType, ReturnType>::Type;\\n\\n\\n\\ntemplate <typename DataType, typename ReturnType>\\n\\nusing IfIsMathFixedPointArray =\\n\\n IfIsFixedPoint<typename DataType::Type, IfIsMathArray<DataType, ReturnType>>;\\n\\n\\n\\ntemplate <typename DataType, typename ReturnType>\\n\\nusing IfIsMathNonFixedPointArray =\\n\\n IfIsNotFixedPoint<typename DataType::Type, IfIsMathArray<DataType, ReturnType>>;\\n\\n\\n\\n} // namespace meta\\n\\n} // namespace math\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/math/include/math/meta/math_type_traits.hpp\",\n \"rank\": 95,\n \"score\": 159978.50571165458\n },\n {\n \"content\": \"class ConstByteArray;\\n\\n}\\n\\n\\n\\nnamespace crypto {\\n\\n\\n\\nbool IsFetchIdentity(byte_array::ConstByteArray const &identity);\\n\\n\\n\\n} // namespace crypto\\n\\n} // namespace fetch\\n\",\n \"file_path\": \"libs/crypto/include/crypto/fetch_identity.hpp\",\n \"rank\": 96,\n \"score\": 158915.38260329622\n },\n {\n \"content\": \"class ConstByteArray;\\n\\n} // namespace byte_array\\n\\n\\n\\nnamespace meta {\\n\\n\\n\\ntemplate <typename... T>\\n\",\n \"file_path\": \"libs/meta/include/meta/type_traits.hpp\",\n \"rank\": 97,\n \"score\": 158826.862043779\n },\n {\n \"content\": \" enum class Type\\n\\n {\\n\\n INVALID,\\n\\n NORMAL,\\n\\n SMART_OR_SYNERGETIC_CONTRACT\\n\\n };\\n\\n\\n\\n using ConstByteArray = byte_array::ConstByteArray;\\n\\n using Tokens = std::vector<ConstByteArray>;\\n\\n\\n\\n // Construction / Destruction\\n\\n Identifier() = default;\\n\\n explicit Identifier(ConstByteArray identifier);\\n\\n Identifier(Identifier const &) = default;\\n\\n Identifier(Identifier &&) = default;\\n\\n ~Identifier() = default;\\n\\n\\n\\n // Accessors\\n\\n Type type() const;\\n\\n ConstByteArray name() const;\\n\",\n \"file_path\": \"libs/ledger/include/ledger/identifier.hpp\",\n \"rank\": 98,\n \"score\": 156104.24774416786\n },\n {\n \"content\": \" enum class Type\\n\\n {\\n\\n UNDEFINED,\\n\\n INTEGER,\\n\\n FLOATING_POINT,\\n\\n FIXED_POINT,\\n\\n BOOLEAN,\\n\\n STRING,\\n\\n NULL_VALUE,\\n\\n ARRAY,\\n\\n OBJECT,\\n\\n };\\n\\n\\n\\n constexpr Type type() const\\n\\n {\\n\\n return type_;\\n\\n }\\n\\n\\n\\nprivate:\\n\\n using VariantList = std::vector<Variant>;\\n\",\n \"file_path\": \"libs/variant/include/variant/variant.hpp\",\n \"rank\": 99,\n \"score\": 156104.24774416786\n }\n]","isConversational":false}}},{"rowIdx":495,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"ipc/src/client_endpoint_com.cpp"},"repo_name":{"kind":"string","value":"tyoma/micro-profiler"},"commit":{"kind":"string","value":"32f6981c643b93997752d414f631fd6684772b28"},"file_code":{"kind":"string","value":"\n\n#include <ipc/endpoint.h>\n\n#include <atlbase.h>\n#include <common/module.h>\n#include <common/string.h>\n#include <ipc/com/init.h>\n#include <functional>\n\nusing namespace std;\n\nnamespace micro_profiler\n{\n\tnamespace ipc\n\t{\n\t\tnamespace com\n\t\t{\n\t\t\tclass inbound_stream : public ISequentialStream\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tinbound_stream(channel &underlying);\n\t\t\t\t~inbound_stream();\n\n\t\t\t\t\n\t\t\t\tSTDMETHODIMP QueryInterface(REFIID riid, void **ppvObject);\n\t\t\t\tSTDMETHODIMP_(ULONG) AddRef();\n\t\t\t\tSTDMETHODIMP_(ULONG) Release();\n\n\t\t\t\t\n\t\t\t\tSTDMETHODIMP Read(void *, ULONG, ULONG *);\n\t\t\t\tSTDMETHODIMP Write(const void *message, ULONG size, ULONG *written);\n\n\t\t\tprivate:\n\t\t\t\tunsigned _references;\n\t\t\t\tchannel &_underlying;\n\t\t\t};\n\n\t\t\tclass client_session : public channel\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tclient_session(const char *destination_endpoint_id, channel &inbound);\n\n\t\t\t\tvirtual void disconnect() throw();\n\t\t\t\tvirtual void message(const_byte_range payload);\n\n\t\t\tprivate:\n\t\t\t\tstatic shared_ptr<void> create_activation_context();\n\t\t\t\tstatic shared_ptr<void> lock_activation_context(const shared_ptr<void> &ctx);\n\n\t\t\tprivate:\n\t\t\t\tchannel &_inbound;\n\t\t\t\tcom_initialize _com_initialize;\n\t\t\t\tCComPtr<ISequentialStream> _stream;\n\t\t\t\tDWORD _sink_cookie;\n\t\t\t};\n\n\t\t\tinbound_stream::inbound_stream(channel &underlying)\n\t\t\t\t: _references(0), _underlying(underlying)\n\t\t\t{\t}\n\n\t\t\tinbound_stream::~inbound_stream()\n\t\t\t{\t_underlying.disconnect();\t}\n\n\t\t\tSTDMETHODIMP inbound_stream::QueryInterface(REFIID riid, void **object)\n\t\t\t{\n\t\t\t\tif (IID_IUnknown != riid && IID_ISequentialStream != riid)\n\t\t\t\t\treturn E_NOINTERFACE;\n\t\t\t\t*object = (ISequentialStream *)this;\n\t\t\t\tAddRef();\n\t\t\t\treturn S_OK;\n\t\t\t}\n\n\t\t\tSTDMETHODIMP_(ULONG) inbound_stream::AddRef()\n\t\t\t{\treturn ++_references;\t}\n\n\t\t\tSTDMETHODIMP_(ULONG) inbound_stream::Release()\n\t\t\t{\n\t\t\t\tunsigned int r = --_references;\n\n\t\t\t\tif (!r)\n\t\t\t\t\tdelete this;\n\t\t\t\treturn r;\n\t\t\t}\n\n\t\t\tSTDMETHODIMP inbound_stream::Read(void *, ULONG, ULONG *)\n\t\t\t{\treturn E_NOTIMPL;\t}\n\n\t\t\tSTDMETHODIMP inbound_stream::Write(const void *buffer, ULONG size, ULONG * )\n\t\t\t{\treturn _underlying.message(const_byte_range(static_cast<const byte *>(buffer), size)), S_OK;\t}\n\n\t\t\tclient_session::client_session(const char *destination_endpoint_id, channel &inbound)\n\t\t\t\t: _inbound(inbound)\n\t\t\t{\n\t\t\t\tshared_ptr<void> ctx = create_activation_context();\n\t\t\t\tshared_ptr<void> ctx_lock = lock_activation_context(ctx);\n\t\t\t\tconst guid_t id = from_string(destination_endpoint_id);\n\t\t\t\tCComPtr<inbound_stream> sink(new inbound_stream(inbound));\n\n\t\t\t\tif (S_OK != _stream.CoCreateInstance(id, NULL, CLSCTX_LOCAL_SERVER))\n\t\t\t\t\tthrow connection_refused(destination_endpoint_id);\n\n\t\t\t\tCComQIPtr<IConnectionPoint>(_stream)->Advise(sink, &_sink_cookie);\n\t\t\t}\n\n\t\t\tvoid client_session::disconnect() throw()\n\t\t\t{\t}\n\n\t\t\tvoid client_session::message(const_byte_range payload)\n\t\t\t{\n\t\t\t\tULONG written;\n\t\t\t\t_stream->Write(payload.begin(), static_cast<ULONG>(payload.length()), &written);\n\t\t\t}\n\n\t\t\tshared_ptr<void> client_session::create_activation_context()\n\t\t\t{\n\t\t\t\tACTCTX ctx = { sizeof(ACTCTX), };\n\t\t\t\tHMODULE hmodule = (HMODULE)get_module_info((void *)&create_activation_context).base;\n\n\t\t\t\tctx.hModule = hmodule;\n\t\t\t\tctx.lpResourceName = ISOLATIONAWARE_MANIFEST_RESOURCE_ID;\n\t\t\t\tctx.dwFlags = ACTCTX_FLAG_HMODULE_VALID | ACTCTX_FLAG_RESOURCE_NAME_VALID;\n\n\t\t\t\tHANDLE hcontext = ::CreateActCtx(&ctx);\n\n\t\t\t\treturn INVALID_HANDLE_VALUE == hcontext\n\t\t\t\t\t? shared_ptr<void>()\n\t\t\t\t\t: shared_ptr<void>(hcontext, &::ReleaseActCtx);\n\t\t\t}\n\n\t\t\tshared_ptr<void> client_session::lock_activation_context(const shared_ptr<void> &ctx)\n\t\t\t{\n\t\t\t\tULONG_PTR cookie;\n\n\t\t\t\treturn ctx && ::ActivateActCtx(ctx.get(), &cookie)\n\t\t\t\t\t? shared_ptr<void>(reinterpret_cast<void*>(cookie), bind(&::DeactivateActCtx, 0, cookie))\n\t\t\t\t\t: shared_ptr<void>();\n\t\t\t}\n\n\t\t\tchannel_ptr_t connect_client(const char *destination_endpoint_id, channel &inbound)\n\t\t\t{\treturn channel_ptr_t(new client_session(destination_endpoint_id, inbound));\t}\n\t\t}\n\t}\n}\n"},"prefix":{"kind":"string","value":"\n\n#include <ipc/endpoint.h>\n\n#include <atlbase.h>\n#include <common/module.h>\n#include <common/string.h>\n#include <ipc/com/init.h>\n#include <functional>\n\nusing namespace std;\n\nnamespace micro_profiler\n{\n\tnamespace ipc\n\t{\n\t\tnamespace com\n\t\t{\n\t\t\tclass inbound_stream : public ISequentialStream\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tinbound_stream(channel &underlying);\n\t\t\t\t~inbound_stream();\n\n\t\t\t\t\n\t\t\t\tSTDMETHODIMP QueryInterface(REFIID riid, void **ppvObject);\n\t\t\t\tSTDMETHODIMP_(ULONG) AddRef();\n\t\t\t\tSTDMETHODIMP_(ULONG) Release();\n\n\t\t\t\t\n\t\t\t\tSTDMETHODIMP Read(void *, ULONG, ULONG *);\n\t\t\t\tSTDMETHODIMP Write(const void *message, ULONG size, ULONG *written);\n\n\t\t\tprivate:\n\t\t\t\tunsigned _references;\n\t\t\t\tchannel &_underlying;\n\t\t\t};\n\n\t\t\tclass client_session : public channel\n\t\t\t{\n\t\t\tpublic:\n\t\t\t\tclient_session(const char *destination_endpoint_id, channel &inbound);\n\n\t\t\t\tvirtual void disconnect() throw();\n\t\t\t\tvirtual void message(const_byte_range payload);\n\n\t\t\tprivate:\n\t\t\t\tstatic shared_ptr<void> create_activation_context();\n\t\t\t\tstatic shared_ptr<void> lock_activation_context(const shared_ptr<void> &ctx);\n\n\t\t\tprivate:\n\t\t\t\tchannel &_inbound;\n\t\t\t\tcom_initialize _com_initialize;\n\t\t\t\tCComPtr<ISequentialStream> _stream;\n\t\t\t\tDWORD _sink_cookie;\n\t\t\t};\n\n\t\t\tinbound_stream::inbound_stream(channel &underlying)\n\t\t\t\t: _references(0), _underlying(underlying)\n\t\t\t{\t}\n\n\t\t\tinbound_stream::~inbound_stream()\n\t\t\t{\t_underlying.disconnect();\t}\n\n\t\t\tSTDMETHODIMP inbound_stream::QueryInterface(REFIID riid, void **object)\n\t\t\t{\n\t\t\t\tif (IID_IUnknown != riid && IID_ISequentialStream != riid)\n\t\t\t\t\treturn E_NOINTERFACE;\n\t\t\t\t*object = (ISequentialStream *)this;\n\t\t\t\tAddRef();\n\t\t\t\treturn S_OK;\n\t\t\t}\n\n\t\t\tSTDMETHODIMP_(ULONG) inbound_stream::AddRef()\n\t\t\t{\treturn ++_references;\t}\n\n\t\t\tSTDMETHODIMP_(ULONG) inbound_stream::Release()\n\t\t\t{\n\t\t\t\tunsigned int r = --_references;\n\n\t\t\t\tif (!r)\n\t\t\t\t\tdelete this;\n\t\t\t\treturn r;\n\t\t\t}\n\n\t\t\tSTDMETHODIMP inbound_stream::Read(void *, ULONG, ULONG *)\n\t\t\t{\treturn E_NOTIMPL;\t}\n\n\t\t\tSTDMETHODIMP inbound_stream::Write(const void *buffer, ULONG size, ULONG * )\n\t\t\t{\treturn _underlying.message(const_byte_range(static_cast<const byte *>(buffer), size)), S_OK;\t}\n\n\t\t\tclient_session::client_session(const char *destination_endpoint_id, channel &inbound)\n\t\t\t\t: _inbound(inbound)\n\t\t\t{\n\t\t\t\tshared_ptr<void> ctx = create_activation_context();\n\t\t\t\tshared_ptr<void> ctx_lock = lock_activation_context(ctx);\n\t\t\t\tconst guid_t id = from_string(destination_endpoint_id);\n\t\t\t\tCComPtr<inbound_stream> sink(new inbound_stream(inbound));\n\n\t\t\t\tif (S_OK != _stream.CoCreateInstance(id, NULL, CLSCTX_LOCAL_SERVER))\n\t\t\t\t\tthrow connection_refused(destination_endpoint_id);\n\n\t\t\t\tCComQIPtr<IConnectionPoint>(_stream)->Advise(sink, &_sink_cookie);\n\t\t\t}\n\n\t\t\tvoid client_session::disconnect() throw()\n\t\t\t{\t}\n\n\t\t\tvoid client_session::message(const_byte_range payload)\n\t\t\t{\n\t\t\t\tULONG written;\n\t\t\t\t_stream->Write(payload.begin(), static_cast<ULONG>(payload.length()), &written);\n\t\t\t}\n\n\t\t\tshared_ptr<void> client_session::create_activation_context()\n\t\t\t{\n\t\t\t\tACTCTX ctx = { sizeof(ACTCTX), };\n\t\t\t\tHMODULE hmodule = (HMODULE)get_module_info((void *)&create_activation_context).base;\n\n\t\t\t\tctx.hModule = hmodule;\n\t\t\t\tctx.lpResourceName = ISOLATIONAWARE_MANIFEST_RESOURCE_ID;\n\t\t\t\tctx.dwFlags = ACTCTX_FLAG_HMODULE_VALID | ACTCTX_FLAG_RESOURCE_NAME_VALID;\n\n\t\t\t\tHANDLE hcontext = ::CreateActCtx(&ctx);\n\n\t\t\t\treturn INVALID_HANDLE_VALUE == hcontext\n\t\t\t\t\t? shared_ptr<void>()\n\t\t\t\t\t: shared_ptr<void>(hcontext, &::ReleaseActCtx);\n\t\t\t}\n\n\t\t\t"},"suffix":{"kind":"string","value":"\n\n\t\t\tchannel_ptr_t connect_client(const char *destination_endpoint_id, channel &inbound)\n\t\t\t{\treturn channel_ptr_t(new client_session(destination_endpoint_id, inbound));\t}\n\t\t}\n\t}\n}\n"},"middle":{"kind":"string","value":"shared_ptr<void> client_session::lock_activation_context(const shared_ptr<void> &ctx)\n\t\t\t{\n\t\t\t\tULONG_PTR cookie;\n\n\t\t\t\treturn ctx && ::ActivateActCtx(ctx.get(), &cookie)\n\t\t\t\t\t? shared_ptr<void>(reinterpret_cast<void*>(cookie), bind(&::DeactivateActCtx, 0, cookie))\n\t\t\t\t\t: shared_ptr<void>();\n\t\t\t}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"\t\t\tclass session : public ISequentialStream, public IConnectionPoint, public /*outbound*/ ipc::channel,\n\n\t\t\t\tpublic CComObjectRoot\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tBEGIN_COM_MAP(session)\n\n\t\t\t\t\tCOM_INTERFACE_ENTRY(ISequentialStream)\n\n\t\t\t\t\tCOM_INTERFACE_ENTRY(IConnectionPoint)\n\n\t\t\t\tEND_COM_MAP()\n\n\n\n\t\t\t\tvoid FinalRelease();\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tchannel_ptr_t inbound;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\t// ISequentialStream methods\n\n\t\t\t\tSTDMETHODIMP Read(void *, ULONG, ULONG *);\n\n\t\t\t\tSTDMETHODIMP Write(const void *message, ULONG size, ULONG *written);\n\n\n\n\t\t\t\t// IConnectionPoint methods\n","file_path":"ipc/com/endpoint.h","rank":0,"score":326805.7874631604},{"content":"\t\t\t\tclass channel : public ipc::channel\n\n\t\t\t\t{\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tstd::function<void (const_byte_range payload)> on_message;\n\n\t\t\t\t\tstd::function<void ()> on_disconnect;\n\n\n\n\t\t\t\tprivate:\n\n\t\t\t\t\tvirtual void disconnect() throw();\n\n\t\t\t\t\tvirtual void message(const_byte_range payload);\n\n\t\t\t\t};\n\n\n","file_path":"ipc/tests/mocks.h","rank":1,"score":321074.07106002304},{"content":"\t\t\t\tclass session : public ipc::channel\n\n\t\t\t\t{\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tsession();\n\n\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tipc::channel *outbound;\n\n\t\t\t\t\tstd::vector< std::vector<byte> > payloads_log;\n\n\t\t\t\t\tunsigned disconnections;\n\n\t\t\t\t\tstd::function<void()> received_message;\n\n\t\t\t\t\tstd::function<void()> disconnected;\n\n\n\n\t\t\t\tprivate:\n\n\t\t\t\t\tvirtual void disconnect() throw();\n\n\t\t\t\t\tvirtual void message(const_byte_range payload);\n\n\t\t\t\t};\n\n\n","file_path":"ipc/tests/mocks.h","rank":3,"score":298075.79394406226},{"content":"\t\t\tclass outbound_channel : public ipc::channel\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\toutbound_channel();\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tbool disconnected;\n\n\t\t\t\tstd::vector<unsigned int /*persistent_id*/> requested_metadata;\n\n\t\t\t\tstd::vector< std::vector<unsigned int /*thread_id*/> > requested_threads;\n\n\t\t\t\tunsigned requested_upadtes;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tvirtual void disconnect() throw();\n\n\t\t\t\tvirtual void message(const_byte_range payload);\n\n\t\t\t};\n\n\t\t}\n\n\t}\n\n}\n","file_path":"frontend/tests/mock_channel.h","rank":4,"score":294214.12043725804},{"content":"\t\tclass controllee_session : public ipc::channel\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tcontrollee_session(ipc::channel &outbound);\n\n\n\n\t\t\tvoid disconnect_client();\n\n\t\t\tvoid send(const_byte_range payload);\n\n\n\n\t\t\tvirtual void disconnect() throw();\n\n\t\t\tvirtual void message(const_byte_range payload);\n\n\n\n\t\tpublic:\n\n\t\t\tstd::vector< std::vector<byte> > messages;\n\n\n\n\t\tprivate:\n\n\t\t\tipc::channel *_outbound;\n\n\t\t\tmt::event _ready;\n\n\t\t};\n\n\n\n\t\ttemplate <typename SessionT = controllee_session>\n","file_path":"test-helpers/process.h","rank":6,"score":280470.0181342943},{"content":"\t\t\t\tclass valid_sink : public CComObjectRoot, public ISequentialStream\n\n\t\t\t\t{\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tBEGIN_COM_MAP(valid_sink)\n\n\t\t\t\t\t\tCOM_INTERFACE_ENTRY(ISequentialStream)\n\n\t\t\t\t\tEND_COM_MAP()\n\n\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tvalid_sink()\n\n\t\t\t\t\t\t: _destroyed(0)\n\n\t\t\t\t\t{\t}\n\n\n\n\t\t\t\t\tvoid set_destroyed(bool &destroyed)\n\n\t\t\t\t\t{\t_destroyed = &destroyed;\t}\n\n\n\n\t\t\t\t\tvoid FinalRelease()\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tif (_destroyed)\n\n\t\t\t\t\t\t\t*_destroyed = true;\n\n\t\t\t\t\t}\n","file_path":"ipc/tests/COMEndpointServerDuplexTests.cpp","rank":7,"score":279231.6162602297},{"content":"\tclass file_id : std::pair<unsigned long long, unsigned long long>, std::shared_ptr<void>\n\n\t{\n\n\tpublic:\n\n\t\tfile_id(const std::string &path);\n\n\n\n\t\tbool operator ==(const file_id &rhs) const;\n\n\n\n\tprivate:\n\n\t\ttemplate <typename T>\n\n\t\tfriend struct std::hash;\n\n\t};\n\n\n\n\n\n\n\n\tinline bool file_id::operator ==(const file_id &rhs) const\n\n\t{\treturn *this == static_cast<const std::pair<unsigned long long, unsigned long long> &>(rhs);\t}\n\n}\n\n\n\nnamespace std\n\n{\n","file_path":"common/file_id.h","rank":8,"score":271899.495257596},{"content":"\t\t\tclass frontend : public ipc::channel\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\texplicit frontend(shared_ptr<frontend_state> state);\n\n\t\t\t\tfrontend(const frontend &other);\n\n\t\t\t\t~frontend();\n\n\n\n\t\t\t\tvirtual void disconnect() throw();\n\n\t\t\t\tvirtual void message(const_byte_range payload);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tconst frontend &operator =(const frontend &rhs);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tmutable shared_ptr<frontend_state> _state;\n\n\t\t\t};\n\n\n\n\n\n\t\t\tipc::channel_ptr_t frontend_state::create()\n\n\t\t\t{\treturn ipc::channel_ptr_t(new frontend(shared_from_this()));\t}\n","file_path":"micro-profiler.tests/mock_frontend.cpp","rank":9,"score":270450.1125408769},{"content":"\t\tclass client_session : public channel\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\ttypedef std::function<void (deserializer &payload_deserializer)> callback_t;\n\n\n\n\t\tpublic:\n\n\t\t\t// User establishes and controls the connection.\n\n\t\t\ttemplate <typename ChannelFactoryT>\n\n\t\t\tclient_session(const ChannelFactoryT &connection_factory);\n\n\n\n\t\t\t// Connection is established and controlled by an outside entity.\n\n\t\t\tclient_session(channel &outbound);\n\n\n\n\t\t\tvirtual ~client_session();\n\n\n\n\t\t\tvoid disconnect_session() throw();\n\n\n\n\t\t\ttemplate <typename MessageCallbackT>\n\n\t\t\tvoid subscribe(std::shared_ptr<void> &handle, int message_id, const MessageCallbackT &callback);\n\n\n","file_path":"ipc/client_session.h","rank":10,"score":267506.9295124965},{"content":"\t\t\t\tclass wrong_sink : public CComObjectRoot, public IUnknown\n\n\t\t\t\t{\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tBEGIN_COM_MAP(wrong_sink)\n\n\t\t\t\t\t\tCOM_INTERFACE_ENTRY(IUnknown)\n\n\t\t\t\t\tEND_COM_MAP()\n\n\t\t\t\t};\n\n\n","file_path":"ipc/tests/COMEndpointServerDuplexTests.cpp","rank":11,"score":259329.38736569963},{"content":"\t\tclass server_session : public channel, noncopyable\n\n\t\t{\n\n\t\tpublic:\n","file_path":"ipc/server_session.h","rank":12,"score":254474.14260405552},{"content":"\t\t\tclass server : public CComClassFactory\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tvoid set_server(const std::shared_ptr<ipc::server> &factory);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tSTDMETHODIMP CreateInstance(IUnknown *outer, REFIID riid, void **object);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tstd::shared_ptr<ipc::server> _session_factory;\n\n\t\t\t};\n\n\t\t}\n\n\t}\n\n}\n","file_path":"ipc/com/endpoint.h","rank":13,"score":252929.4295037996},{"content":"\t\t\tclass client_session : public channel\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tclient_session(const host_port &hp, channel &inbound);\n\n\t\t\t\t~client_session();\n\n\n\n\t\t\t\tvirtual void disconnect() throw();\n\n\t\t\t\tvirtual void message(const_byte_range payload);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tvoid worker(channel *inbound);\n\n\t\t\t\tstatic int open(const host_port &hp);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tsockets_initializer _initializer;\n\n\t\t\t\tsocket_handle _socket;\n\n\t\t\t\tunique_ptr<mt::thread> _thread;\n\n\t\t\t};\n\n\n\n\n","file_path":"ipc/src/client_endpoint_sockets.cpp","rank":14,"score":252019.25030282928},{"content":"\t\tclass marshalled_passive_session : public channel, noncopyable\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tmarshalled_passive_session(std::shared_ptr<scheduler::queue> queue, channel &outbound);\n\n\t\t\t~marshalled_passive_session();\n\n\n\n\t\t\tvoid create_underlying(std::shared_ptr<server> underlying_server);\n\n\n\n\t\tprivate:\n","file_path":"ipc/marshalled_session.h","rank":15,"score":249320.34604634534},{"content":"\t\tclass command_handler : public ipc::channel, noncopyable\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tcommand_handler(mt::event &exit, const char *destination_endpoint)\n\n\t\t\t\t: _exit(exit)\n\n\t\t\t{\t_commander_channel = ipc::connect_client(destination_endpoint, *this);\t}\n\n\n\n\t\tprivate:\n\n\t\t\tvirtual void disconnect() throw()\n\n\t\t\t{\t_exit.set();\t}\n\n\n\n\t\t\tvirtual void message(const_byte_range payload)\n\n\t\t\t{\n\n\t\t\t\tvector_adapter reader(payload);\n\n\t\t\t\tstrmd::deserializer<vector_adapter> archive(reader);\n\n\t\t\t\trunner_commands c;\n\n\t\t\t\tstring data1, data2;\n\n\n\n\t\t\t\tswitch (archive(c), c)\n\n\t\t\t\t{\n","file_path":"micro-profiler.tests/guineapigs/guinea_runner.cpp","rank":16,"score":248878.3219732191},{"content":"\t\tclass image : private std::shared_ptr<void>\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\texplicit image(std::string path);\n\n\n\n\t\t\tbyte *base_ptr() const;\n\n\t\t\tlong_address_t base() const;\n\n\t\t\tconst char *absolute_path() const;\n\n\t\t\tvoid *get_symbol_address(const char *name) const;\n\n\t\t\tunsigned get_symbol_rva(const char *name) const;\n\n\t\t\ttemplate <typename T>\n\n\t\t\tT *get_symbol(const char *name) const;\n\n\n\n\t\tprivate:\n\n\t\t\tbyte *_base;\n\n\t\t\tstd::string _fullpath;\n\n\t\t};\n\n\n","file_path":"test-helpers/helpers.h","rank":17,"score":244397.4383936341},{"content":"\t\tclass marshalled_passive_session::outbound_wrapper : public channel, noncopyable\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\toutbound_wrapper(channel &underlying);\n\n\n\n\t\t\tvoid stop();\n\n\n\n\t\tprivate:\n\n\t\t\tvirtual void disconnect() throw() override;\n\n\t\t\tvirtual void message(const_byte_range payload) override;\n\n\n\n\t\tprivate:\n\n\t\t\tconst std::shared_ptr<lifetime> _lifetime;\n\n\t\t\tchannel &_underlying;\n\n\t\t};\n\n\n\n\n\n\n\n\t\ttemplate <typename ConnectionFactoryT, typename ServerSessionFactoryT>\n\n\t\tinline marshalled_active_session::marshalled_active_session(const ConnectionFactoryT &connection_factory,\n\n\t\t\t\tstd::shared_ptr<scheduler::queue> queue, const ServerSessionFactoryT &server_session_factory)\n\n\t\t\t: _queue(queue)\n\n\t\t{\n\n\t\t\t_connection_outbound = connection_factory(*this);\n\n\t\t\t_server_inbound = server_session_factory(*_connection_outbound);\n\n\t\t}\n\n\n\n\t}\n\n}\n","file_path":"ipc/marshalled_session.h","rank":18,"score":233557.6943039728},{"content":"\t\t\tclass socket_handler : public /*outbound*/ channel, noncopyable\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tenum status { proceed, remove_this, exit, };\n\n\t\t\t\ttypedef std::function<status (socket_handler &self, const socket_handle &s)> handler_t;\n\n\t\t\t\ttypedef std::shared_ptr<socket_handler> ptr_t;\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tsocket_handler(unsigned id_, socket_handle &s, const socket_handle &aux_socket,\n\n\t\t\t\t\tconst handler_t &initial_handler);\n\n\t\t\t\t~socket_handler() throw();\n\n\n\n\t\t\t\ttemplate <typename ContainerT>\n\n\t\t\t\tstatic void run(ContainerT &handlers);\n\n\n\n\t\t\t\tvirtual void disconnect() throw();\n\n\t\t\t\tvirtual void message(const_byte_range payload);\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tconst unsigned id;\n\n\t\t\t\thandler_t handler;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tsocket_handle _socket;\n\n\t\t\t\tconst socket_handle &_aux_socket;\n\n\t\t\t};\n\n\n","file_path":"ipc/src/server_endpoint_sockets.h","rank":19,"score":233557.6943039728},{"content":"\t\tclass FauxFrontend : public IUnknown, public CComObjectRoot, public CComCoClass<FauxFrontend>\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tDECLARE_REGISTRY_RESOURCEID(IDR_PROFILER_FRONTEND)\n\n\t\t\tBEGIN_COM_MAP(FauxFrontend)\n\n\t\t\t\tCOM_INTERFACE_ENTRY(IUnknown)\n\n\t\t\tEND_COM_MAP()\n\n\t\t};\n\n\n\n\n\n\n\n\t\tshared_ptr<hive> open_configuration(const vector<string> &configuration_path)\n\n\t\t{\n\n\t\t\tauto h = registry_hive::open_user_settings(\"Software\");\n\n\n\n\t\t\tfor (auto i = configuration_path.begin(); i != configuration_path.end(); ++i)\n\n\t\t\t\th = h->create(i->c_str());\n\n\t\t\treturn h;\n\n\t\t}\n\n\t}\n","file_path":"standalone/application_win32.cpp","rank":20,"score":232627.7270294888},{"content":"\t\t\t\tclass server : public ipc::server\n\n\t\t\t\t{\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tstd::vector< std::shared_ptr<session> > sessions;\n\n\t\t\t\t\tstd::function<void (const std::shared_ptr<session> &new_session)> session_created;\n\n\n\n\t\t\t\tprivate:\n\n\t\t\t\t\tvirtual channel_ptr_t create_session(ipc::channel &outbound);\n\n\n\n\t\t\t\tprivate:\n\n\t\t\t\t\tmt::mutex _mutex;\n\n\t\t\t\t};\n\n\n\n\n\n\n\n\t\t\t\tinline void channel::disconnect() throw()\n\n\t\t\t\t{\n\n\t\t\t\t\tif (on_disconnect)\n\n\t\t\t\t\t\ton_disconnect();\n\n\t\t\t\t}\n","file_path":"ipc/tests/mocks.h","rank":21,"score":225563.89245304617},{"content":"\t\tclass runner_controller : public ipc::server\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tbool wait_connection();\n\n\n\n\t\tpublic:\n\n\t\t\tstd::vector< std::shared_ptr<SessionT> > sessions;\n\n\n\n\t\tprivate:\n\n\t\t\t// ipc::server methods\n\n\t\t\tvirtual ipc::channel_ptr_t create_session(ipc::channel &outbound);\n\n\n\n\t\tprivate:\n\n\t\t\tmt::event _ready;\n\n\t\t};\n\n\n\n\n\n\n\n\t\tstd::shared_ptr<running_process> create_process(const std::string &executable_path,\n\n\t\t\tconst std::string &command_line);\n","file_path":"test-helpers/process.h","rank":22,"score":209333.87115159153},{"content":"\tclass frontend : public ipc::client_session, noncopyable\n\n\t{\n\n\tpublic:\n\n\t\ttypedef frontend_ui_context session_type;\n\n\n\n\tpublic:\n\n\t\tfrontend(ipc::channel &outbound);\n\n\t\t~frontend();\n\n\n\n\tpublic:\n\n\t\tstd::function<void (const session_type &ui_context)> initialized;\n\n\n\n\tprivate:\n\n\t\ttypedef std::list< std::shared_ptr<void> > requests_t;\n\n\n\n\tprivate:\n\n\t\t// ipc::channel methods\n\n\t\tvirtual void disconnect() throw() override;\n\n\n\n\t\tvoid init_patcher();\n","file_path":"frontend/frontend.h","rank":23,"score":203037.12298805304},{"content":"\t\tclass logging_server : public ipc::server, noncopyable\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tlogging_server(const shared_ptr<ipc::server> &server, const string &endpoint_id)\n\n\t\t\t\t: _server(server), _endpoint_id(endpoint_id)\n\n\t\t\t{\t}\n\n\n\n\t\t\tvirtual ipc::channel_ptr_t create_session(ipc::channel &outbound) override\n\n\t\t\t{\n\n\t\t\t\tLOG(PREAMBLE \"creating frontend server session...\") % A(_endpoint_id);\n\n\t\t\t\treturn _server->create_session(outbound);\n\n\t\t\t}\n\n\n\n\t\tprivate:\n\n\t\t\tconst shared_ptr<ipc::server> _server;\n\n\t\t\tconst string _endpoint_id;\n\n\t\t};\n\n\n\n\t\tshared_ptr<void> try_run_server(const string &endpoint_id, const shared_ptr<ipc::server> &server)\n\n\t\ttry\n","file_path":"frontend/src/untested/ipc_manager.cpp","rank":24,"score":201940.12910223968},{"content":"\tclass file_hive : public hive, public std::enable_shared_from_this<file_hive>\n\n\t{\n\n\tpublic:\n\n\t\tstatic std::shared_ptr<hive> open_ini(const char *path);\n\n\n\n\tprivate:\n\n\t\tfile_hive(const char *path);\n\n\n\n\t\tvirtual std::shared_ptr<hive> create(const char *name) override;\n\n\t\tvirtual std::shared_ptr<const hive> open(const char *name) const override;\n\n\n\n\t\tvirtual void store(const char *name, int value) override;\n\n\t\tvirtual void store(const char *name, const char *value) override;\n\n\n\n\t\tvirtual bool load(const char *name, int &value) const override;\n\n\t\tvirtual bool load(const char *name, std::string &value) const override;\n\n\t};\n\n}\n","file_path":"common/configuration_file.h","rank":25,"score":199777.81539067515},{"content":"\tclass frontend_manager : public ipc::server, noncopyable\n\n\t{\n\n\tpublic:\n\n\t\tstruct instance\n\n\t\t{\n\n\t\t\tstd::string title;\n\n\t\t\tstd::shared_ptr<frontend_ui> ui;\n\n\t\t};\n\n\n\n\tpublic:\n\n\t\ttemplate <typename FrontendFactoryT, typename FrontendUIFactoryT>\n\n\t\tfrontend_manager(FrontendFactoryT frontend_factory, FrontendUIFactoryT ui_factory);\n\n\t\t~frontend_manager();\n\n\n\n\t\tvoid close_all() throw();\n\n\n\n\t\tsize_t instances_count() const throw();\n\n\t\tconst instance *get_instance(unsigned index) const throw();\n\n\t\tconst instance *get_active() const throw();\n\n\n","file_path":"frontend/frontend_manager.h","rank":26,"score":199180.08071221865},{"content":"\tclass function_hint : public wpl::view\n\n\t{\n\n\tpublic:\n\n\t\tfunction_hint(wpl::gcontext::text_engine_type &text_services);\n\n\n\n\t\tvoid apply_styles(const wpl::stylesheet &stylesheet_);\n\n\n\n\t\tvoid set_model(std::shared_ptr<wpl::richtext_table_model> model);\n\n\t\tbool select(wpl::table_model_base::index_type index);\n\n\t\tbool is_active() const;\n\n\t\tagge::box<int> get_box() const;\n\n\n\n\tprivate:\n\n\t\tvirtual void draw(wpl::gcontext &context, wpl::gcontext::rasterizer_ptr &rasterizer) const override;\n\n\n\n\t\tvoid update_text_and_calculate_locations(wpl::table_model_base::index_type index);\n\n\n\n\tprivate:\n\n\t\twpl::gcontext::text_engine_type &_text_services;\n\n\t\tstd::shared_ptr<wpl::richtext_table_model> _model;\n","file_path":"frontend/function_hint.h","rank":27,"score":196274.68206914118},{"content":"\t\tclass unordered_map : std::list< std::pair<const KeyT, ValueT> >\n\n\t\t{\n\n\t\tprivate:\n\n\t\t\tenum { initial_nbuckets = 16, };\n\n\t\t\ttypedef std::list< std::pair<const KeyT, ValueT> > base_t;\n\n\n\n\t\tpublic:\n\n\t\t\ttypedef KeyT key_type;\n\n\t\t\ttypedef ValueT mapped_type;\n\n\t\t\ttypedef std::pair<const KeyT, ValueT> value_type;\n\n\t\t\ttypedef unsigned short internal_size_type;\n\n\t\t\tusing typename base_t::const_iterator;\n\n\t\t\tusing typename base_t::iterator;\n\n\n\n\t\tpublic:\n\n\t\t\tusing base_t::begin;\n\n\t\t\tusing base_t::end;\n\n\t\t\tusing base_t::empty;\n\n\t\t\tusing base_t::size;\n\n\n","file_path":"common/unordered_map.h","rank":28,"score":193696.98479875407},{"content":"\tclass thread_monitor : public std::enable_shared_from_this<thread_monitor>\n\n\t{\n\n\tpublic:\n\n\t\ttypedef unsigned int thread_id;\n\n\t\ttypedef unsigned long long native_thread_id;\n\n\t\ttypedef std::pair<thread_id, thread_info> value_type;\n\n\n\n\tpublic:\n\n\t\tthread_monitor(mt::thread_callbacks &callbacks);\n\n\n\n\t\tvirtual thread_id register_self();\n\n\n\n\t\ttemplate <typename OutputIteratorT, typename IteratorT>\n\n\t\tvoid get_info(OutputIteratorT destination, IteratorT begin_id, IteratorT end_id) const;\n\n\n\n\tprotected:\n\n\t\tstruct live_thread_info;\n\n\n\n\t\ttypedef containers::unordered_map<native_thread_id, live_thread_info> running_threads_map;\n\n\t\ttypedef containers::unordered_map<thread_id, thread_info> threads_map;\n","file_path":"collector/thread_monitor.h","rank":29,"score":192579.32080453407},{"content":"\t\tclass buffer_deleter;\n\n\n\n\t\ttypedef std::unique_ptr<buffer, buffer_deleter> buffer_ptr;\n\n\n\n\tprivate:\n\n\t\tvoid create_buffer(buffer_ptr &new_buffer);\n\n\t\tvoid start_buffer(buffer_ptr &ready_buffer) throw();\n\n\t\tvoid adjust_empty_buffers(const buffering_policy &policy, size_t base_n);\n\n\n\n\tprivate:\n\n\t\tE *_ptr;\n\n\t\tunsigned int _n_left;\n\n\n\n\t\tunsigned int _id;\n\n\t\tbuffer_ptr _active_buffer;\n\n\t\tpolyq::circular_buffer< buffer_ptr, polyq::static_entry<buffer_ptr> > _ready_buffers;\n\n\t\tbuffer_ptr *_empty_buffers_top;\n\n\t\tsize_t _allocated_buffers;\n\n\n\n\t\tbuffering_policy _policy;\n","file_path":"collector/buffers_queue.h","rank":30,"score":192529.94935912458},{"content":"\t\tclass message_loop_android : public message_loop\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tmessage_loop_android()\n\n\t\t\t\t: _exit(false), _looper(ALooper_prepare(ALOOPER_PREPARE_ALLOW_NON_CALLBACKS))\n\n\t\t\t{\tALooper_acquire(_looper);\t}\n\n\n\n\t\t\t~message_loop_android()\n\n\t\t\t{\tALooper_release(_looper);\t}\n\n\n\n\t\t\tvirtual void run() override\n\n\t\t\t{\n\n\t\t\t\tint dummy[2];\n\n\t\t\t\tvoid *vdummy;\n\n\n\n\t\t\t\twhile (!_exit && ALOOPER_POLL_ERROR != ALooper_pollOnce(-1, &dummy[0], &dummy[1], &vdummy))\n\n\t\t\t\t{\t}\n\n\t\t\t}\n\n\n\n\t\t\tvirtual void exit() override\n","file_path":"scheduler/tests/helpers_android.cpp","rank":31,"score":191091.6151219264},{"content":"\t\tclass message_loop_win32 : public message_loop\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tmessage_loop_win32()\n\n\t\t\t\t: _thread_id(::GetCurrentThreadId())\n\n\t\t\t{\t}\n\n\n\n\t\t\tvirtual void run() override\n\n\t\t\t{\n\n\t\t\t\tMSG msg = {};\n\n\n\n\t\t\t\twhile (::GetMessage(&msg, NULL, 0, 0) && WM_QUIT != msg.message)\n\n\t\t\t\t\t::DispatchMessage(&msg);\n\n\t\t\t}\n\n\n\n\t\t\tvirtual void exit() override\n\n\t\t\t{\t::PostThreadMessage(_thread_id, WM_QUIT, 0, 0);\t}\n\n\n\n\t\tprivate:\n\n\t\t\tunsigned _thread_id;\n","file_path":"scheduler/tests/helpers_win32.cpp","rank":32,"score":191091.6151219264},{"content":"\t\tclass marshalled_active_session : channel, noncopyable\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\ttemplate <typename ConnectionFactoryT, typename ServerSessionFactoryT>\n\n\t\t\tmarshalled_active_session(const ConnectionFactoryT &connection_factory,\n\n\t\t\t\tstd::shared_ptr<scheduler::queue> queue, const ServerSessionFactoryT &server_session_factory);\n\n\n\n\t\tprivate:\n\n\t\t\tvirtual void disconnect() throw() override;\n\n\t\t\tvirtual void message(const_byte_range payload) override;\n\n\n\n\t\tprivate:\n\n\t\t\tchannel_ptr_t _connection_outbound, _server_inbound;\n\n\t\t\tscheduler::private_queue _queue;\n\n\t\t};\n\n\n\n\n","file_path":"ipc/marshalled_session.h","rank":33,"score":189098.27727653447},{"content":"\t\tclass marshalled_server : public server, noncopyable\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tmarshalled_server(std::shared_ptr<server> underlying, std::shared_ptr<scheduler::queue> queue);\n\n\t\t\t~marshalled_server();\n\n\n\n\t\t\tvoid stop();\n\n\n\n\t\tprivate:\n\n\t\t\tvirtual channel_ptr_t create_session(channel &outbound) override;\n\n\n\n\t\tprivate:\n\n\t\t\tconst std::shared_ptr<lifetime> _lifetime;\n\n\t\t\tstd::shared_ptr<server> _underlying;\n\n\t\t\tconst std::shared_ptr<scheduler::queue> _queue;\n\n\t\t};\n\n\t}\n\n}\n","file_path":"ipc/marshalled_server.h","rank":34,"score":183337.99562135275},{"content":"\tclass buffers_queue<E>::buffer_deleter\n\n\t{\n\n\tpublic:\n\n\t\tbuffer_deleter();\n\n\t\texplicit buffer_deleter(allocator &allocator_);\n\n\n\n\t\tvoid operator ()(buffer *object) throw();\n\n\n\n\tprivate:\n\n\t\tallocator *_allocator;\n\n\t};\n\n\n\n\n\n\n\n\ttemplate <typename E>\n\n\tinline buffers_queue<E>::buffers_queue(allocator &allocator_, const buffering_policy &policy, unsigned int id)\n\n\t\t: _id(id), _ready_buffers(policy.max_buffers()), _allocated_buffers(0), _policy(policy),\n\n\t\t\t_empty_buffers(new buffer_ptr[policy.max_buffers()]), _allocator(allocator_)\n\n\t{\n\n\t\tbuffer_ptr b;\n","file_path":"collector/buffers_queue.h","rank":35,"score":179627.0793618212},{"content":"\t\t\tvirtual void disconnect() throw() = 0;\n","file_path":"ipc/endpoint.h","rank":36,"score":179509.95297381445},{"content":"\tclass threads_model : public wpl::list_model<std::string>, noncopyable\n\n\t{\n\n\tpublic:\n\n\t\tthreads_model(std::shared_ptr<const tables::threads> threads);\n\n\n\n\t\tbool get_key(unsigned int &thread_id, index_type index) const throw();\n\n\n\n\t\tvirtual index_type get_count() const throw() override;\n\n\t\tvirtual void get_value(index_type index, std::string &text) const override;\n\n\t\tvirtual std::shared_ptr<const wpl::trackable> track(index_type index) const override;\n\n\n\n\tprivate:\n\n\t\ttypedef views::ordered<tables::threads> view_type;\n\n\t\ttypedef trackables_provider<view_type> trackables_type;\n\n\n\n\tprivate:\n\n\t\tconst std::shared_ptr<const tables::threads> _underlying;\n\n\t\tconst std::shared_ptr<view_type> _view;\n\n\t\tconst std::shared_ptr<trackables_type> _trackables;\n\n\t\twpl::slot_connection _invalidation;\n\n\t};\n\n}\n","file_path":"frontend/threads_model.h","rank":37,"score":179435.95875718273},{"content":"\t\t\tclass frontend_state : noncopyable, public std::enable_shared_from_this<frontend_state>\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\texplicit frontend_state(const std::shared_ptr<void> &ownee = std::shared_ptr<void>());\n\n\n\n\t\t\t\tipc::channel_ptr_t create();\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tstd::function<void ()> constructed;\n\n\t\t\t\tstd::function<void ()> destroyed;\n\n\n\n\t\t\t\tstd::function<void (const initialization_data &id)> initialized;\n\n\t\t\t\tstd::function<void (unsigned token, const loaded_modules &m)> modules_loaded;\n\n\t\t\t\tstd::function<void (unsigned token, const thread_statistics_map &u)> updated;\n\n\t\t\t\tstd::function<void (unsigned token, const unloaded_modules &m)> modules_unloaded;\n\n\t\t\t\tstd::function<void (unsigned token, const module_info_metadata &md)> metadata_received;\n\n\t\t\t\tstd::function<void (unsigned token, const std::vector< std::pair<unsigned /*thread_id*/, thread_info> > &threads)> threads_received;\n\n\t\t\t\tstd::function<void (unsigned token, const patch_manager::apply_results &results)> activation_response_received;\n\n\t\t\t\tstd::function<void (unsigned token, const patch_manager::revert_results &results)> revert_response_received;\n\n\n","file_path":"micro-profiler.tests/mock_frontend.h","rank":38,"score":177927.36064859768},{"content":"\t\t\t\tclass sequential_stream\n\n\t\t\t\t{\n\n\t\t\t\tpublic:\n\n\t\t\t\t\tsequential_stream(const CLSID &id)\n\n\t\t\t\t\t\t: _frontend(0)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\t::CoCreateInstance(id, NULL, CLSCTX_LOCAL_SERVER, IID_ISequentialStream, (void **)&_frontend);\n\n\t\t\t\t\t\tassert_not_null(_frontend);\n\n\t\t\t\t\t}\n\n\n\n\t\t\t\t\tsequential_stream(const sequential_stream &other)\n\n\t\t\t\t\t\t: _frontend(other._frontend)\n\n\t\t\t\t\t{\t_frontend->AddRef();\t}\n\n\n\n\t\t\t\t\t~sequential_stream()\n\n\t\t\t\t\t{\t_frontend->Release();\t}\n\n\n\n\t\t\t\t\tbool operator()(const void *buffer, size_t size)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tULONG written;\n","file_path":"ipc/tests/helpers_com.cpp","rank":39,"score":170499.35546884098},{"content":"\tclass calls_collector_thread : public buffers_queue<call_record>\n\n\t{\n\n\tpublic:\n\n\t\ttypedef std::function<void (unsigned int id, const call_record *calls, size_t count)> reader_t;\n\n\n\n\tpublic:\n\n\t\texplicit calls_collector_thread(allocator &allocator_, const buffering_policy &policy, unsigned int id);\n\n\n\n\t\tvoid on_enter(const void **stack_ptr, timestamp_t timestamp, const void *callee) throw();\n\n\t\tconst void *on_exit(const void **stack_ptr, timestamp_t timestamp) throw();\n\n\n\n\t\tvoid track(const void *callee, timestamp_t timestamp) throw();\n\n\n\n\t\tvoid flush();\n\n\n\n\tprivate:\n\n\t\tpod_vector<return_entry> _return_stack;\n\n\t};\n\n\n\n\n\n\n\n\tFORCE_INLINE void calls_collector_thread::track(const void *callee, timestamp_t timestamp) throw()\n\n\t{\n\n\t\tauto &c = current();\n\n\n\n\t\tc.timestamp = timestamp, c.callee = callee;\n\n\t\tpush();\n\n\t}\n\n}\n","file_path":"collector/calls_collector_thread.h","rank":40,"score":169682.2995140495},{"content":"\t\t\tclass socket_handle : noncopyable\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tsocket_handle();\n\n\t\t\t\t~socket_handle();\n\n\n\n\t\t\t\toperator int() const;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tint _socket;\n\n\t\t\t};\n\n\n","file_path":"ipc/tests/helpers_sockets.h","rank":41,"score":167560.28881072742},{"content":"\t\t\tclass socket_handle : noncopyable\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\ttemplate <typename T>\n\n\t\t\t\texplicit socket_handle(T s);\n\n\t\t\t\tsocket_handle(socket_handle &other);\n\n\t\t\t\t~socket_handle();\n\n\n\n\t\t\t\tvoid reset() throw();\n\n\t\t\t\tvoid reset(int s);\n\n\t\t\t\toperator int() const;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tint _socket;\n\n\t\t\t};\n\n\n\n\n\n\n\n\t\t\tinline host_port::host_port(const char *address, const char *default_host)\n\n\t\t\t{\n","file_path":"ipc/src/socket_helpers.h","rank":42,"score":167560.28881072742},{"content":"\tclass trackables_provider<UnderlyingT>::trackable : public wpl::trackable\n\n\t{\n\n\tpublic:\n\n\t\ttrackable(key_type key_, size_t current_index_) : key(key_), current_index(current_index_) {\t}\n\n\t\tvirtual size_t index() const override {\treturn current_index;\t}\n\n\n\n\tpublic:\n\n\t\tkey_type key;\n\n\t\tsize_t current_index;\n\n\t};\n\n\n\n\n\n\n\n\ttemplate <typename UnderlyingT>\n\n\tinline trackables_provider<UnderlyingT>::trackables_provider(const UnderlyingT &underlying)\n\n\t\t: _underlying(underlying), _trackables(std::make_shared<trackables_t>())\n\n\t{\t}\n\n\n\n\ttemplate <typename UnderlyingT>\n\n\tinline trackables_provider<UnderlyingT>::~trackables_provider()\n","file_path":"frontend/trackables_provider.h","rank":43,"score":165399.73391991862},{"content":"\tclass variant<T, void>\n\n\t{\n\n\tpublic:\n\n\t\tvariant(const T &from)\n\n\t\t\t: _type(0), _value(from)\n\n\t\t{\t}\n\n\n\n\t\tunsigned int get_type() const\n\n\t\t{\treturn _type;\t}\n\n\n\n\t\tvoid change_type(unsigned int type)\n\n\t\t{\t_type = type;\t}\n\n\n\n\t\ttemplate <typename V>\n\n\t\ttypename V::return_type visit(const V &visitor) const\n\n\t\t{\treturn visitor(_value);\t}\n\n\n\n\t\ttemplate <typename V>\n\n\t\ttypename V::return_type visit(const V &visitor)\n\n\t\t{\treturn visitor(_value);\t}\n","file_path":"math/variant.h","rank":44,"score":153428.9315956888},{"content":"\tclass functions_list : public statistics_model_impl< wpl::richtext_table_model, views::filter<statistic_types::map_detailed> >\n\n\t{\n\n\tpublic:\n\n\t\ttypedef statistic_types::map_detailed::value_type value_type;\n\n\n\n\tpublic:\n\n\t\tfunctions_list(std::shared_ptr<tables::statistics> statistics, double tick_interval_,\n\n\t\t\tstd::shared_ptr<symbol_resolver> resolver_, std::shared_ptr<const tables::threads> threads_);\n\n\t\tvirtual ~functions_list();\n\n\n\n\t\ttemplate <typename PredicateT>\n\n\t\tvoid set_filter(const PredicateT &predicate);\n\n\t\tvoid set_filter();\n\n\n\n\t\tvoid clear();\n\n\t\tvoid print(std::string &content) const;\n\n\n\n\tprivate:\n\n\t\ttypedef statistics_model_impl< wpl::richtext_table_model, views::filter<statistic_types::map_detailed> > base;\n\n\n","file_path":"frontend/function_list.h","rank":45,"score":148952.51101605932},{"content":"\t\tclass ref_attribute_impl : public attribute\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tref_attribute_impl(const char *name_, const T &value);\n\n\n\n\t\tprivate:\n\n\t\t\tvirtual void format_value(buffer_t &buffer) const;\n\n\n\n\t\tprivate:\n\n\t\t\tconst T &_value;\n\n\t\t};\n\n\n","file_path":"logger/log.h","rank":46,"score":146466.39119402465},{"content":"\tclass pool_allocator : public allocator\n\n\t{\n\n\tprivate:\n\n\t\tstruct entry\n\n\t\t{\n\n\t\t\tstd::size_t size;\n\n\t\t};\n\n\n\n\tpublic:\n\n\t\tenum {\toverhead = sizeof(entry)\t};\n\n\n\n\tpublic:\n\n\t\tpool_allocator(allocator &underlying);\n\n\t\t~pool_allocator();\n\n\n\n\t\tvirtual void *allocate(std::size_t length) override;\n\n\t\tvirtual void deallocate(void *memory) throw() override;\n\n\n\n\tprivate:\n\n\t\ttypedef std::vector<entry *> free_bin_t;\n","file_path":"common/pool_allocator.h","rank":47,"score":146466.39119402465},{"content":"\t\t\tclass tracer : public calls_collector_i\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tvirtual void read_collected(acceptor &a) override;\n\n\t\t\t\tvirtual void flush() override;\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tstd::function<void (acceptor &a)> on_read_collected;\n\n\t\t\t\tstd::function<void ()> on_flush;\n\n\t\t\t};\n\n\n\n\n\n\n\n\t\t\tinline void tracer::read_collected(acceptor &a)\n\n\t\t\t{\n\n\t\t\t\tif (on_read_collected)\n\n\t\t\t\t\ton_read_collected(a);\n\n\t\t\t}\n\n\n\n\t\t\tinline void tracer::flush()\n\n\t\t\t{\n\n\t\t\t\tif (on_flush)\n\n\t\t\t\t\ton_flush();\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n}\n","file_path":"collector/tests/mocks.h","rank":48,"score":146466.39119402465},{"content":"\tclass ui_queue : public queue\n\n\t{\n\n\tpublic:\n\n\t\tui_queue(const clock &clock_);\n\n\t\t~ui_queue();\n\n\n\n\t\tvirtual void schedule(std::function<void ()> &&task, mt::milliseconds defer_by) override;\n\n\n\n\t\tvoid stop();\n\n\n\n\tprivate:\n\n\t\tstruct impl;\n\n\n\n\tprivate:\n\n\t\tscheduler::task_queue _tasks;\n\n\t\tstd::shared_ptr<impl> _impl;\n\n\t};\n\n}\n","file_path":"scheduler/ui_queue.h","rank":49,"score":146466.39119402465},{"content":"\tclass histogram : std::vector<Y>\n\n\t{\n\n\tpublic:\n\n\t\ttypedef std::vector<Y> base_t;\n\n\t\ttypedef ScaleT scale_type;\n\n\t\ttypedef typename scale_type::value_type x_type;\n\n\t\ttypedef Y y_type;\n\n\n\n\tpublic:\n\n\t\tvoid set_scale(const scale_type &scale_);\n\n\t\tconst scale_type &get_scale() const;\n\n\n\n\t\tusing base_t::size;\n\n\t\tusing base_t::begin;\n\n\t\tusing base_t::end;\n\n\n\n\t\tvoid add(x_type value, y_type d = 1);\n\n\n\n\t\ttemplate <typename IteratorT /*partition*/>\n\n\t\tvoid find_partitions(IteratorT first, IteratorT last) const;\n","file_path":"math/histogram.h","rank":50,"score":145127.65842280193},{"content":"\tclass about_ui : public wpl::stack\n\n\t{\n\n\tpublic:\n\n\t\tabout_ui(const wpl::factory &factory_);\n\n\n\n\tprivate:\n\n\t\tvoid on_link(const std::string &address);\n\n\n\n\tprivate:\n\n\t\tstd::vector<wpl::slot_connection> _connections;\n\n\t\tstd::shared_ptr<wpl::button> _close_button;\n\n\n\n\tpublic:\n\n\t\twpl::signal<void (const std::string &address)> link;\n\n\t\twpl::signal<void ()> &close;\n\n\t};\n\n}\n","file_path":"frontend/about_ui.h","rank":51,"score":144428.82171258074},{"content":"\tclass registry_hive : public hive\n\n\t{\n\n\tpublic:\n\n\t\tregistry_hive(std::shared_ptr<void> key);\n\n\n\n\t\tstatic std::shared_ptr<hive> open_user_settings(const char *registry_path);\n\n\n\n\tprivate:\n\n\t\t// hive methods\n\n\t\tvirtual std::shared_ptr<hive> create(const char *name) override;\n\n\t\tvirtual std::shared_ptr<const hive> open(const char *name) const override;\n\n\t\tvirtual void store(const char *name, int value) override;\n\n\t\tvirtual void store(const char *name, const char *value) override;\n\n\t\tvirtual bool load(const char *name, int &value) const override;\n\n\t\tvirtual bool load(const char *name, std::string &value) const override;\n\n\n\n\t\toperator HKEY() const;\n\n\n\n\tprivate:\n\n\t\tstd::shared_ptr<void> _key;\n\n\t};\n\n}\n","file_path":"common/win32/configuration_registry.h","rank":52,"score":143731.42772876847},{"content":"\tclass private_queue\n\n\t{\n\n\tpublic:\n\n\t\texplicit private_queue(std::shared_ptr<queue> underlying);\n\n\t\t~private_queue();\n\n\n\n\t\tvoid schedule(std::function<void ()> &&task, mt::milliseconds defer_by = mt::milliseconds(0));\n\n\n\n\tprivate:\n\n\t\tstruct control_block;\n\n\n\n\tprivate:\n\n\t\tprivate_queue(const private_queue &other);\n\n\t\tvoid operator =(const private_queue &rhs);\n\n\n\n\tprivate:\n\n\t\tstd::shared_ptr<queue> _underlying;\n\n\t\tstd::shared_ptr<control_block> _control_block;\n\n\t};\n\n}\n","file_path":"scheduler/private_queue.h","rank":53,"score":142965.8536003438},{"content":"\tclass buffers_queue\n\n\t{\n\n\tpublic:\n\n\t\ttypedef E value_type;\n\n\n\n\tpublic:\n\n\t\tbuffers_queue(allocator &allocator_, const buffering_policy &policy, unsigned int id);\n\n\n\n\t\tunsigned int get_id() throw();\n\n\n\n\t\tE ¤t() throw();\n\n\t\tvoid push() throw();\n\n\t\tvoid flush() throw();\n\n\n\n\t\ttemplate <typename ReaderT>\n\n\t\tvoid read_collected(const ReaderT &reader);\n\n\n\n\t\tvoid set_buffering_policy(const buffering_policy &policy);\n\n\n\n\tprivate:\n\n\t\tstruct buffer;\n","file_path":"collector/buffers_queue.h","rank":54,"score":142932.4429510645},{"content":"\t\tclass com_event\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tcom_event();\n\n\n\n\t\t\tvoid set();\n\n\t\t\tvoid wait();\n\n\n\n\t\tprivate:\n\n\t\t\tstd::shared_ptr<void> _handle;\n\n\t\t};\n\n\t}\n\n}\n","file_path":"test-helpers/com.h","rank":55,"score":142028.69649476206},{"content":"\tclass selection_model : public selection<typename key_traits<typename UnderlyingT::value_type>::key_type>,\n\n\t\tnoncopyable\n\n\t{\n\n\tpublic:\n\n\t\ttypedef wpl::dynamic_set_model::index_type index_type;\n\n\t\ttypedef key_traits<typename UnderlyingT::value_type> selection_key_type;\n\n\t\ttypedef typename selection_key_type::key_type key_type;\n\n\n\n\tpublic:\n\n\t\tselection_model(const UnderlyingT &underlying);\n\n\n\n\t\t// wpl::dynamic_set_model methods\n\n\t\tvirtual void clear() throw() override;\n\n\t\tvirtual void add(index_type item) override;\n\n\t\tvirtual void remove(index_type item) override;\n\n\t\tvirtual bool contains(index_type item) const throw() override;\n\n\n\n\t\t// selection<...> methods\n\n\t\tvirtual void enumerate(const std::function<void (const key_type &key)> &callback) const override;\n\n\n","file_path":"frontend/selection_model.h","rank":56,"score":140221.70591159002},{"content":"\tclass calls_collector : public calls_collector_i, public thread_queue_manager<calls_collector_thread>\n\n\t{\n\n\tpublic:\n\n\t\tcalls_collector(allocator &allocator_, size_t trace_limit, thread_monitor &thread_monitor_,\n\n\t\t\tmt::thread_callbacks &thread_callbacks);\n\n\n\n\t\tvirtual void read_collected(acceptor &a) override;\n\n\t\tvirtual void flush() override;\n\n\n\n\t\tstatic void CC_(fastcall) on_enter(calls_collector *instance, const void **stack_ptr,\n\n\t\t\ttimestamp_t timestamp, const void *callee) _CC(fastcall);\n\n\t\tstatic const void *CC_(fastcall) on_exit(calls_collector *instance, const void **stack_ptr,\n\n\t\t\ttimestamp_t timestamp) _CC(fastcall);\n\n\n\n\t\tvoid track(timestamp_t timestamp, const void *callee);\n\n\n\n\tprivate:\n\n\t\ttypedef thread_queue_manager<calls_collector_thread> base_t;\n\n\n\n\tprivate:\n\n\t\tcalls_collector_thread &construct_thread_trace();\n\n\t};\n\n}\n","file_path":"collector/calls_collector.h","rank":57,"score":139595.67281464557},{"content":"\tclass tables_ui : public wpl::stack\n\n\t{\n\n\tpublic:\n\n\t\ttables_ui(const wpl::factory &factory_, const frontend_ui_context &context, hive &configuration);\n\n\n\n\t\tvoid save(hive &configuration);\n\n\n\n\tpublic:\n\n\t\twpl::signal<void(const std::string &file, unsigned line)> open_source;\n\n\n\n\tprivate:\n\n\t\tstatic std::pair<statistic_types::key, bool> get_first_item(const selection<statistic_types::key> &selection_);\n\n\n\n\t\ttemplate <typename ModelT, typename SelectionModelT>\n\n\t\tvoid attach_section(wpl::listview &lv, piechart *pc, function_hint *hint, std::shared_ptr<headers_model> cm,\n\n\t\t\tstd::shared_ptr<ModelT> model, std::shared_ptr<SelectionModelT> selection_);\n\n\n\n\tprivate:\n\n\t\tconst std::shared_ptr<headers_model> _cm_main;\n\n\t\tconst std::shared_ptr<headers_model> _cm_parents;\n\n\t\tconst std::shared_ptr<headers_model> _cm_children;\n\n\n\n\t\tstd::shared_ptr<wpl::listview> _lv_main;\n\n\n\n\t\tstd::vector<wpl::slot_connection> _connections;\n\n\t};\n\n}\n","file_path":"frontend/tables_ui.h","rank":58,"score":138787.041915369},{"content":"\t\t\tclass queue : public scheduler::queue\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tvirtual void schedule(std::function<void ()> &&task, mt::milliseconds defer_by = mt::milliseconds(0)) override;\n\n\n\n\t\t\t\tvoid run_one();\n\n\t\t\t\tvoid run_till_end();\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tstd::deque< std::pair<std::function<void ()>, mt::milliseconds > > tasks;\n\n\t\t\t};\n\n\n\n\n\n\n\n\t\t\tinline void queue::schedule(std::function<void ()> &&task, mt::milliseconds defer_by)\n\n\t\t\t{\n\n\t\t\t\ttasks.emplace_back(std::make_pair(std::move(task), defer_by));\n\n\t\t\t\ttask = std::function<void ()>();\n\n\t\t\t}\n\n\n","file_path":"test-helpers/mock_queue.h","rank":59,"score":138787.041915369},{"content":"\t\tclass multithreaded_logger : public logger, noncopyable\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\ttypedef std::function<void (const char *text)> writer_t;\n\n\t\t\ttypedef std::function<datetime ()> time_provider_t;\n\n\n\n\t\tpublic:\n\n\t\t\tmultithreaded_logger(const writer_t &writer, const time_provider_t &time_provider);\n\n\t\t\t~multithreaded_logger();\n\n\n\n\t\t\tvirtual void begin(const char *message, level level_) throw();\n\n\t\t\tvirtual void add_attribute(const attribute &a) throw();\n\n\t\t\tvirtual void commit() throw();\n\n\n\n\t\tprivate:\n\n\t\t\tbuffer_t &get_buffer();\n\n\n\n\t\tprivate:\n\n\t\t\tconst writer_t _writer;\n\n\t\t\tconst time_provider_t _time_provider;\n\n\t\t\tstd::list<buffer_t> _buffer_container;\n\n\t\t\tmt::tls<buffer_t> _buffers;\n\n\t\t\tmt::mutex _construction_mutex;\n\n\t\t};\n\n\t}\n\n}\n","file_path":"logger/multithreaded_logger.h","rank":60,"score":138787.041915369},{"content":"\t\t\tclass allocation_monitor : public allocator\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tstd::function<void (size_t length, void *memory)> allocated;\n\n\t\t\t\tstd::function<void (void *memory)> freeing;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tvirtual void *allocate(std::size_t length) override\n\n\t\t\t\t{\n\n\t\t\t\t\tauto memory = malloc(length);\n\n\n\n\t\t\t\t\ttry\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tif (allocated)\n\n\t\t\t\t\t\t\tallocated(length, memory);\n\n\t\t\t\t\t}\n\n\t\t\t\t\tcatch (...)\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tfree(memory);\n\n\t\t\t\t\t\tthrow;\n","file_path":"common/tests/PoolAllocatorTests.cpp","rank":61,"score":138719.50191642868},{"content":"\tclass linear_display_scale : public display_scale_base\n\n\t{\n\n\tpublic:\n\n\t\ttemplate <typename T>\n\n\t\tlinear_display_scale(const linear_scale<T> &scale, T divisor, int pixel_size);\n\n\n\n\t\tfloat operator [](float value) const;\n\n\n\n\tprivate:\n\n\t\tconst float _near, _display_k;\n\n\t};\n\n\n\n\n","file_path":"math/display_scale.h","rank":62,"score":138719.50191642868},{"content":"\t\t\tclass mock_hive : public hive\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\ttypedef map<string, int> int_values_map;\n\n\t\t\t\ttypedef map<string, string> str_values_map;\n\n\t\t\t\t\n\n\t\t\tpublic:\n\n\t\t\t\tmock_hive(int_values_map &int_values, str_values_map &str_values, const char *prefix = \"\");\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tconst mock_hive &operator =(const mock_hive &rhs);\n\n\n\n\t\t\t\tvirtual shared_ptr<hive> create(const char *name);\n\n\t\t\t\tvirtual shared_ptr<const hive> open(const char *name) const;\n\n\n\n\t\t\t\tvirtual void store(const char *name, int value);\n\n\t\t\t\tvirtual void store(const char *name, const char *value);\n\n\n\n\t\t\t\tvirtual bool load(const char *name, int &value) const;\n\n\t\t\t\tvirtual bool load(const char *name, string &value) const;\n","file_path":"frontend/tests/HeadersModelTests.cpp","rank":63,"score":138719.50191642868},{"content":"\tclass log_display_scale : public display_scale_base\n\n\t{\n\n\tpublic:\n\n\t\ttemplate <typename T>\n\n\t\tlog_display_scale(const log_scale<T> &scale, T divisor, int pixel_size);\n\n\n\n\t\tfloat operator [](float value) const;\n\n\n\n\tprivate:\n\n\t\tconst float _near, _display_k;\n\n\t};\n\n\n\n\n\n\n\n\tinline display_scale_base::display_scale_base(unsigned samples, int pixel_size)\n\n\t\t: _bin_width(static_cast<float>(pixel_size) / samples)\n\n\t{\t}\n\n\n\n\tinline std::pair<float, float> display_scale_base::at(unsigned int index) const\n\n\t{\n","file_path":"math/display_scale.h","rank":64,"score":138719.50191642868},{"content":"namespace std\n\n{\n\n\tnamespace tr1 { }\n\n\tusing namespace tr1;\n","file_path":"build.props/emit-tr1-to-std.h","rank":65,"score":138554.59795387727},{"content":"\t\t\tvirtual void message(const_byte_range payload) = 0;\n","file_path":"ipc/endpoint.h","rank":66,"score":138333.24655992072},{"content":"\tclass function_patch : noncopyable\n\n\t{\n\n\tpublic:\n\n\t\ttemplate <typename T>\n\n\t\tfunction_patch(void *target, T *interceptor, executable_memory_allocator &allocator_);\n\n\n\n\t\tconst void *target() const;\n\n\t\tbool active() const;\n\n\t\tbool activate(bool atomic);\n\n\t\tbool revert();\n\n\t\tvoid detach();\n\n\n\n\tprivate:\n\n\t\tstd::shared_ptr<void> _trampoline;\n\n\t\tjumper _jumper;\n\n\t};\n\n\n\n\n\n\n\n\ttemplate <typename T>\n","file_path":"patcher/function_patch.h","rank":67,"score":136270.26267424936},{"content":"\t\t\tclass queue : public scheduler::queue\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tvector< pair<function<void ()>, mt::milliseconds> > tasks;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tvirtual void schedule(function<void ()> &&task, mt::milliseconds defer_by) override\n\n\t\t\t\t{\ttasks.emplace_back(make_pair(move(task), defer_by));\t}\n\n\t\t\t};\n\n\t\t}\n\n\n\n\t\tbegin_test_suite( PrivateQueueTests )\n\n\t\t\ttest( SchedulingIsDelegatedToUnderlyingQueue )\n\n\t\t\t{\n\n\t\t\t\t// INIT\n\n\t\t\t\tconst auto u = make_shared<mocks::queue>();\n\n\t\t\t\tauto a = false;\n\n\t\t\t\tauto b = false;\n\n\n\n\t\t\t\t// INIT / ACT\n","file_path":"scheduler/tests/MiscTests.cpp","rank":68,"score":136209.12880448048},{"content":"\t\t\tclass allocator : public micro_profiler::allocator\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tallocator();\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tsize_t allocated, operations;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tvirtual void *allocate(size_t length) override;\n\n\t\t\t\tvirtual void deallocate(void *memory) throw() override;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tdefault_allocator _underlying;\n\n\t\t\t};\n\n\n\n\n\n\n\n\t\t\tinline allocator::allocator()\n\n\t\t\t\t: allocated(0), operations(0)\n","file_path":"collector/tests/mocks_allocator.h","rank":69,"score":136209.12880448048},{"content":"\t\t\tclass thread_callbacks : public mt::thread_callbacks\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tunsigned invoke_destructors();\n\n\t\t\t\tunsigned invoke_destructors(mt::thread::id thread_id);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tvirtual void at_thread_exit(const atexit_t &handler) override;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tmt::mutex _mutex;\n\n\t\t\t\tcontainers::unordered_map< mt::thread::id, std::vector<atexit_t> > _destructors;\n\n\t\t\t};\n\n\n\n\n","file_path":"collector/tests/mocks.h","rank":70,"score":136209.12880448048},{"content":"\tclass headers_model : public wpl::headers_model\n\n\t{\n\n\tpublic:\n\n\t\tstruct column;\n\n\t\tenum sort_direction\t{\tdir_none, dir_ascending, dir_descending\t};\n\n\n\n\tpublic:\n\n\t\ttemplate <size_t N>\n\n\t\theaders_model(const column (&columns)[N], index_type sort_column, bool sort_ascending);\n\n\n\n\t\tvoid store(hive &configuration) const;\n\n\t\tvoid update(const hive &configuration);\n\n\n\n\t\tvirtual index_type get_count() const throw() override;\n\n\t\tvirtual void get_value(index_type index, short int &width) const throw() override;\n\n\t\tvirtual std::pair<index_type, bool> get_sort_order() const throw() override;\n\n\t\tvirtual void set_width(index_type index, short int width) override;\n\n\t\tvirtual agge::full_alignment get_alignment(index_type index) const override;\n\n\t\tvirtual agge::full_alignment get_header_alignment(index_type index) const override;\n\n\t\tvirtual void get_caption(index_type index, agge::richtext_t &caption) const override;\n","file_path":"frontend/headers_model.h","rank":71,"score":136209.12880448048},{"content":"\tclass ipc_manager : noncopyable\n\n\t{\n\n\tpublic:\n\n\t\ttypedef std::pair<unsigned short /*start*/, unsigned short /*size*/> port_range;\n\n\n\n\tpublic:\n\n\t\tipc_manager(std::shared_ptr<ipc::server> server, std::shared_ptr<scheduler::queue> queue, port_range range_,\n\n\t\t\tconst guid_t *com_server_id);\n\n\t\t~ipc_manager();\n\n\n\n\t\tunsigned short get_sockets_port() const;\n\n\t\tbool remote_sockets_enabled() const;\n\n\t\tvoid enable_remote_sockets(bool enable);\n\n\n\n\t\tbool com_enabled() const;\n\n\t\tvoid enable_com(bool enable);\n\n\n\n\tprivate:\n\n\t\tstatic std::shared_ptr<void> probe_create_server(const std::shared_ptr<ipc::server> &server,\n\n\t\t\tipc::ip_v4 interface_, unsigned short &port, port_range range_);\n","file_path":"frontend/ipc_manager.h","rank":72,"score":135710.80581083093},{"content":"\tclass analyzer : public calls_collector_i::acceptor, noncopyable\n\n\t{\n\n\tpublic:\n\n\t\ttypedef containers::unordered_map<unsigned int, thread_analyzer> thread_analyzers;\n\n\t\ttypedef thread_analyzers::const_iterator const_iterator;\n\n\t\ttypedef std::pair<unsigned int, thread_analyzer> value_type;\n\n\n\n\tpublic:\n\n\t\tanalyzer(const overhead& overhead_);\n\n\n\n\t\tvoid clear() throw();\n\n\t\tsize_t size() const throw();\n\n\t\tconst_iterator begin() const throw();\n\n\t\tconst_iterator end() const throw();\n\n\t\tbool has_data() const throw();\n\n\n\n\t\tvirtual void accept_calls(unsigned int threadid, const call_record *calls, size_t count) override;\n\n\n\n\tprivate:\n\n\t\tconst overhead _overhead;\n\n\t\tthread_analyzers _thread_analyzers;\n\n\t};\n\n}\n","file_path":"collector/analyzer.h","rank":73,"score":134672.92344967992},{"content":"\t\t\tclass const_iterator;\n\n\t\t\ttypedef typename U::value_type value_type;\n\n\t\t\ttypedef typename U::const_reference const_reference;\n\n\t\t\ttypedef const_reference reference;\n\n\t\t\ttypedef std::function<bool (const value_type &value)> predicate_t;\n\n\n\n\t\tpublic:\n\n\t\t\tfilter(const U &underlying);\n\n\n\n\t\t\ttemplate <typename PredicateT>\n\n\t\t\tvoid set_filter(const PredicateT &predicate);\n\n\t\t\tvoid set_filter();\n\n\n\n\t\t\tconst_iterator begin() const throw();\n\n\t\t\tconst_iterator end() const throw();\n\n\n\n\t\tprivate:\n\n\t\t\tbool match(const value_type &value) const;\n\n\n\n\t\tprivate:\n\n\t\t\tconst U &_underlying;\n\n\t\t\tpredicate_t _predicate;\n\n\n\n\t\tprivate:\n\n\t\t\tfriend class const_iterator;\n\n\t\t};\n\n\n\n\t\ttemplate <class U>\n","file_path":"views/filter.h","rank":74,"score":134620.48367916333},{"content":"\t\t\tclass const_iterator;\n\n\t\t\ttypedef typename X::const_reference const_reference;\n\n\t\t\ttypedef const_iterator iterator;\n\n\t\t\ttypedef typename X::const_reference reference;\n\n\t\t\ttypedef typename X::value_type value_type;\n\n\n\n\t\tpublic:\n\n\t\t\tflatten(const U &underlying_, const X &transform_ = X());\n\n\n\n\t\t\tconst_iterator begin() const;\n\n\t\t\tconst_iterator end() const;\n\n\n\n\t\tpublic:\n\n\t\t\tconst U &underlying;\n\n\t\t\tconst X transform;\n\n\n\n\t\tprivate:\n\n\t\t\tvoid operator =(const flatten &rhs);\n\n\t\t};\n\n\n\n\t\ttemplate <class U, class X>\n","file_path":"views/flatten.h","rank":75,"score":134620.48367916333},{"content":"\tclass buffering_policy\n\n\t{\n\n\tpublic:\n\n\t\tenum {\tbuffer_size = 384 /*entries*/,\t};\n\n\n\n\tpublic:\n\n\t\tbuffering_policy(size_t max_allocation, double max_empty_factor, double min_empty_factor);\n\n\n\n\t\tsize_t max_buffers() const;\n\n\t\tsize_t max_empty() const;\n\n\t\tsize_t min_empty() const;\n\n\n\n\tprivate:\n\n\t\tsize_t _max_buffers, _max_empty, _min_empty;\n\n\t};\n\n\n\n\n\n\n\n\tinline guid_t::operator const GUID &() const\n\n\t{\treturn *reinterpret_cast<const GUID *>(values);\t}\n","file_path":"common/types.h","rank":76,"score":134596.83201870864},{"content":"\tclass function_hint;\n\n\n","file_path":"frontend/piechart.h","rank":77,"score":134378.2381897387},{"content":"\t\tclass dbghelp_image_info : public image_info\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tdbghelp_image_info(const shared_ptr<dbghelp> &dbghelp_, const string &path);\n\n\n\n\t\tprivate:\n\n\t\t\tvirtual string get_path() const override;\n\n\t\t\tvirtual void enumerate_functions(const symbol_callback_t &callback) const override;\n\n\t\t\tvirtual void enumerate_files(const file_callback_t &callback) const override;\n\n\n\n\t\tprivate:\n\n\t\t\tstring _path;\n\n\t\t\tshared_ptr<dbghelp> _dbghelp;\n\n\t\t\tlong_address_t _base;\n\n\t\t};\n\n\n\n\n\n\n\n\t\tdbghelp::dbghelp()\n\n\t\t{\n","file_path":"common/src/image_info_win32.cpp","rank":78,"score":134237.5302475882},{"content":"\tclass thread_callbacks_impl : public thread_callbacks\n\n\t{\n\n\tpublic:\n\n\t\tthread_callbacks_impl();\n\n\t\t~thread_callbacks_impl();\n\n\n\n\t\tvirtual void at_thread_exit(const atexit_t &handler);\n\n\n\n\tprivate:\n\n\t\ttypedef vector<atexit_t> destructors_t;\n\n\n\n\tprivate:\n\n\t\tstatic void invoke_destructors(void *destructors);\n\n\n\n\tprivate:\n\n\t\tmt::mutex _mutex;\n\n\t\tlist<destructors_t> _all_destructors;\n\n\t\tpthread_key_t _thread_destructors;\n\n\t};\n\n\n","file_path":"mt/src/thread_callbacks_unix.cpp","rank":79,"score":134237.5302475882},{"content":"\t\tclass elf_image_info : public image_info\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\telf_image_info(const string &path);\n\n\n\n\t\tprivate:\n\n\t\t\tvirtual string get_path() const override;\n\n\t\t\tvirtual void enumerate_functions(const symbol_callback_t &callback) const override;\n\n\n\n\t\tprivate:\n\n\t\t\tstring _path;\n\n\t\t\tshared_ptr<const symreader::mapped_region> _image;\n\n\t\t};\n\n\n\n\n\n\n\n\t\telf_image_info::elf_image_info(const string &path)\n\n\t\t\t: _path(path), _image(symreader::map_file(path.c_str()))\n\n\t\t{\n\n\t\t\tif (!_image->first)\n","file_path":"common/src/image_info_unix.cpp","rank":80,"score":134237.5302475882},{"content":"\t\t\tclass running_process_impl : public running_process\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\trunning_process_impl(const string &executable_path, const string &command_line)\n\n\t\t\t\t{\n\n\t\t\t\t\tSTARTUPINFOA si = { };\n\n\t\t\t\t\tstring path = executable_path;\n\n\t\t\t\t\tvector<char> cl2(command_line.begin(), command_line.end());\n\n\n\n\t\t\t\t\tif (path.find(\".exe\") == string::npos)\n\n\t\t\t\t\t\tpath += \".exe\";\n\n\t\t\t\t\tcl2.push_back(char());\n\n\n\n\t\t\t\t\tsi.cb = sizeof(si);\n\n\t\t\t\t\tif (!::CreateProcessA(path.c_str(), &cl2[0], NULL, NULL, FALSE, NORMAL_PRIORITY_CLASS , NULL,\n\n\t\t\t\t\t\tNULL, &si, &_process))\n\n\t\t\t\t\t{\n\n\t\t\t\t\t\tDWORD err = ::GetLastError();\n\n\t\t\t\t\t\terr;\n\n\t\t\t\t\t\tthrow runtime_error(\"Cannot run child process!\");\n","file_path":"test-helpers/src/process_win32.cpp","rank":81,"score":134237.5302475882},{"content":"\tclass thread_callbacks_impl : public thread_callbacks\n\n\t{\n\n\tpublic:\n\n\t\tvoid notify_thread_exit() throw();\n\n\n\n\t\tvirtual void at_thread_exit(const atexit_t &handler);\n\n\n\n\tprivate:\n\n\t\ttypedef vector<atexit_t> destructors_t;\n\n\n\n\tprivate:\n\n\t\tmt::mutex _mutex;\n\n\t\tlist<destructors_t> _all_destructors;\n\n\t\tmt::tls<destructors_t> _thread_destructors;\n\n\t};\n\n\n\n\n\n\n\n\tvoid thread_callbacks_impl::notify_thread_exit() throw()\n\n\t{\n","file_path":"mt/src/thread_callbacks_win32.cpp","rank":82,"score":134237.5302475882},{"content":"\t\t\tvirtual channel_ptr_t create_session(channel &outbound) = 0;\n","file_path":"ipc/endpoint.h","rank":83,"score":134213.6757041122},{"content":"\t\tclass lifetime\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tlifetime()\n\n\t\t\t\t: _alive(true)\n\n\t\t\t{\t}\n\n\n\n\t\t\tvoid mark_destroyed()\n\n\t\t\t{\n\n\t\t\t\tmt::lock_guard<mt::mutex> l(_mtx);\n\n\n\n\t\t\t\t_alive = false;\n\n\t\t\t}\n\n\n\n\t\t\ttemplate <typename F>\n\n\t\t\tvoid execute_safe(const F &f)\n\n\t\t\t{\n\n\t\t\t\tmt::lock_guard<mt::mutex> l(_mtx);\n\n\n\n\t\t\t\tif (_alive)\n","file_path":"ipc/src/lifetime.h","rank":84,"score":133900.64670686063},{"content":"\t\tclass lifetime;\n\n\n","file_path":"ipc/marshalled_server.h","rank":85,"score":133900.64670686063},{"content":"\t\tclass lifetime;\n\n\n","file_path":"ipc/marshalled_session.h","rank":86,"score":133900.64670686063},{"content":"\t\t\tclass response;\n\n\t\t\ttypedef unsigned long long token_t;\n\n\n\n\t\tpublic:\n\n\t\t\tserver_session(channel &outbound, std::shared_ptr<scheduler::queue> queue = std::shared_ptr<scheduler::queue>());\n\n\n\n\t\t\tvoid set_disconnect_handler(const std::function<void ()> &handler);\n\n\n\n\t\t\ttemplate <typename F>\n\n\t\t\tvoid add_handler(int request_id, const F &handler);\n\n\n\n\t\t\ttemplate <typename FormatterT>\n\n\t\t\tvoid message(int message_id, const FormatterT &message_formatter);\n\n\n\n\t\tprivate:\n\n\t\t\ttemplate <typename ArgumentsT, typename U>\n\n\t\t\tstruct handler_thunk;\n\n\t\t\ttypedef std::function<void (response &response_, deserializer &payload)> handler_t;\n\n\n\n\t\tprivate:\n","file_path":"ipc/server_session.h","rank":87,"score":133900.64670686063},{"content":"\t\t\tclass thread_monitor : public micro_profiler::thread_monitor\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tthread_monitor();\n\n\n\n\t\t\t\tthread_monitor::thread_id get_id(mt::thread::id tid) const;\n\n\t\t\t\tthread_monitor::thread_id get_this_thread_id() const;\n\n\n\n\t\t\t\tvoid add_info(thread_id id, const thread_info &info);\n\n\n\n\t\t\tpublic:\n\n\t\t\t\tthread_id provide_this_id;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tvirtual thread_id register_self() override;\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tunsigned _next_id;\n\n\t\t\t\tcontainers::unordered_map<mt::thread::id, thread_monitor::thread_id> _ids;\n\n\t\t\t\tmutable mt::mutex _mtx;\n\n\t\t\t};\n\n\n\n\n","file_path":"collector/tests/mocks.h","rank":88,"score":133775.11610302917},{"content":"\t\t\tclass symbol_resolver : public micro_profiler::symbol_resolver\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tsymbol_resolver(std::shared_ptr<tables::modules> modules, std::shared_ptr<tables::module_mappings> mappings);\n\n\n\n\t\t\t\tvirtual const std::string &symbol_name_by_va(long_address_t address) const;\n\n\n\n\t\t\t\tstatic std::string to_string_address(long_address_t value);\n\n\n\n\t\t\t\ttemplate <typename T, size_t n>\n\n\t\t\t\tstatic std::shared_ptr<symbol_resolver> create(T (&symbols)[n]);\n\n\n\n\t\t\tprivate:\n\n\t\t\t\tmutable containers::unordered_map<long_address_t, std::string> _names;\n\n\t\t\t};\n\n\t\t}\n\n\t}\n\n}\n","file_path":"frontend/tests/mocks.h","rank":89,"score":133775.11610302917},{"content":"\tclass process_list : public wpl::richtext_table_model\n\n\t{\n\n\tpublic:\n\n\t\ttypedef std::function<void (const process::enumerate_callback_t &callback)> process_enumerator_t;\n\n\n\n\tpublic:\n\n\t\tvoid update(const process_enumerator_t &enumerator);\n\n\n\n\t\tstd::shared_ptr<process> get_process(index_type row) const;\n\n\t\tvoid set_order(index_type column, bool ascending);\n\n\n\n\t\tvirtual index_type get_count() const throw() override;\n\n\t\tvirtual void get_text(index_type row, index_type column, agge::richtext_t &text) const override;\n\n\n\n\tprivate:\n\n\t\ttypedef std::vector< std::shared_ptr<process> > process_container_t;\n\n\n\n\tprivate:\n\n\t\ttemplate <typename PredicateT>\n\n\t\tvoid init_sorter(const PredicateT &p);\n\n\n\n\tprivate:\n\n\t\tstd::vector< std::shared_ptr<process> > _processes;\n\n\t\tstd::function<void (process_container_t &processes)> _sorter;\n\n\t};\n\n}\n","file_path":"frontend/process_list.h","rank":90,"score":133775.11610302917},{"content":"\tclass statistics_model_impl : public BaseT, noncopyable\n\n\t{\n\n\tpublic:\n\n\t\ttypedef typename BaseT::index_type index_type;\n\n\t\ttypedef typename key_traits<typename U::value_type>::key_type key_type;\n\n\n\n\tpublic:\n\n\t\tstatistics_model_impl(std::shared_ptr<U> underlying, double tick_interval_,\n\n\t\t\tstd::shared_ptr<symbol_resolver> resolver_, std::shared_ptr<const tables::threads> threads_);\n\n\n\n\t\tstd::shared_ptr<U> get_underlying() const;\n\n\n\n\t\t// wpl::richtext_table_model methods\n\n\t\tvirtual index_type get_count() const throw() override;\n\n\t\tvirtual void get_text(index_type item, index_type subitem, agge::richtext_t &text) const override;\n\n\t\tvirtual std::shared_ptr<const wpl::trackable> track(index_type row) const override;\n\n\n\n\t\t// linked_statistics methods\n\n\t\tvirtual void fetch() /*override*/;\n\n\t\tvirtual void set_order(index_type column, bool ascending) /*override*/;\n","file_path":"frontend/statistics_model.h","rank":91,"score":133775.11610302917},{"content":"\tclass image_patch_ui : public wpl::stack\n\n\t{\n\n\tpublic:\n\n\t\timage_patch_ui(const wpl::factory &factory_, std::shared_ptr<image_patch_model> model,\n\n\t\t\tstd::shared_ptr<const tables::patches> patches);\n\n\n\n\tprivate:\n\n\t\tvoid check_selection(const selection<symbol_key> &selection_);\n\n\n\n\tprivate:\n\n\t\tstd::shared_ptr<image_patch_model> _model;\n\n\t\tstd::vector<wpl::slot_connection> _connections;\n\n\t\tstd::unordered_set<symbol_key> _to_apply, _to_revert;\n\n\t};\n\n}\n","file_path":"frontend/image_patch_ui.h","rank":92,"score":133775.11610302917},{"content":"\t\tclass process : public micro_profiler::process\n\n\t\t{\n\n\t\tpublic:\n\n\t\t\tprocess(unsigned int pid, const string &name_)\n\n\t\t\t\t: _pid(pid), _name(name_), _hprocess(::OpenProcess(rights, FALSE, pid), &::CloseHandle)\n\n\t\t\t{\n\n\t\t\t\tif (!_hprocess)\n\n\t\t\t\t\tthrow runtime_error(\"\");\n\n\t\t\t}\n\n\n\n\t\t\tvirtual unsigned get_pid() const\n\n\t\t\t{\treturn _pid;\t}\n\n\n\n\t\t\tvirtual string name() const\n\n\t\t\t{\treturn _name;\t}\n\n\n\n\t\t\tvirtual void remote_execute(injection_function_t *injection, const_byte_range payload)\n\n\t\t\t{\n\n\t\t\t\tconst mapped_module m = get_module_info(&g_dummy);\n\n\t\t\t\tconst shared_ptr<void> fpath = foreign_allocate(m.path.size() + 1);\n","file_path":"injector/src/process_win32.cpp","rank":93,"score":133775.11610302917},{"content":"\t\tstd::size_t operator ()(unsigned int key) const throw();\n","file_path":"common/hash.h","rank":94,"score":133601.9436251504},{"content":"\t\ttypedef void (injection_function_t)(const_byte_range payload);\n","file_path":"injector/process.h","rank":95,"score":133571.5183711627},{"content":"\t\tunsigned int id = 0;\n","file_path":"common/serialization.h","rank":96,"score":133553.23543054127},{"content":"\t\tunsigned int id; // Identifier assigned or existed before for a dormant patch.\n","file_path":"patcher/interface.h","rank":97,"score":133553.23543054127},{"content":"\t\ttypedef std::function<void (const std::shared_ptr<process> &entry)> enumerate_callback_t;\n","file_path":"injector/process.h","rank":98,"score":133303.3979497558}],"string":"[\n {\n \"content\": \"\\t\\t\\tclass session : public ISequentialStream, public IConnectionPoint, public /*outbound*/ ipc::channel,\\n\\n\\t\\t\\t\\tpublic CComObjectRoot\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tBEGIN_COM_MAP(session)\\n\\n\\t\\t\\t\\t\\tCOM_INTERFACE_ENTRY(ISequentialStream)\\n\\n\\t\\t\\t\\t\\tCOM_INTERFACE_ENTRY(IConnectionPoint)\\n\\n\\t\\t\\t\\tEND_COM_MAP()\\n\\n\\n\\n\\t\\t\\t\\tvoid FinalRelease();\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tchannel_ptr_t inbound;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\t// ISequentialStream methods\\n\\n\\t\\t\\t\\tSTDMETHODIMP Read(void *, ULONG, ULONG *);\\n\\n\\t\\t\\t\\tSTDMETHODIMP Write(const void *message, ULONG size, ULONG *written);\\n\\n\\n\\n\\t\\t\\t\\t// IConnectionPoint methods\\n\",\n \"file_path\": \"ipc/com/endpoint.h\",\n \"rank\": 0,\n \"score\": 326805.7874631604\n },\n {\n \"content\": \"\\t\\t\\t\\tclass channel : public ipc::channel\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tstd::function<void (const_byte_range payload)> on_message;\\n\\n\\t\\t\\t\\t\\tstd::function<void ()> on_disconnect;\\n\\n\\n\\n\\t\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\t\\tvirtual void disconnect() throw();\\n\\n\\t\\t\\t\\t\\tvirtual void message(const_byte_range payload);\\n\\n\\t\\t\\t\\t};\\n\\n\\n\",\n \"file_path\": \"ipc/tests/mocks.h\",\n \"rank\": 1,\n \"score\": 321074.07106002304\n },\n {\n \"content\": \"\\t\\t\\t\\tclass session : public ipc::channel\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tsession();\\n\\n\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tipc::channel *outbound;\\n\\n\\t\\t\\t\\t\\tstd::vector< std::vector<byte> > payloads_log;\\n\\n\\t\\t\\t\\t\\tunsigned disconnections;\\n\\n\\t\\t\\t\\t\\tstd::function<void()> received_message;\\n\\n\\t\\t\\t\\t\\tstd::function<void()> disconnected;\\n\\n\\n\\n\\t\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\t\\tvirtual void disconnect() throw();\\n\\n\\t\\t\\t\\t\\tvirtual void message(const_byte_range payload);\\n\\n\\t\\t\\t\\t};\\n\\n\\n\",\n \"file_path\": \"ipc/tests/mocks.h\",\n \"rank\": 3,\n \"score\": 298075.79394406226\n },\n {\n \"content\": \"\\t\\t\\tclass outbound_channel : public ipc::channel\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\toutbound_channel();\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tbool disconnected;\\n\\n\\t\\t\\t\\tstd::vector<unsigned int /*persistent_id*/> requested_metadata;\\n\\n\\t\\t\\t\\tstd::vector< std::vector<unsigned int /*thread_id*/> > requested_threads;\\n\\n\\t\\t\\t\\tunsigned requested_upadtes;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tvirtual void disconnect() throw();\\n\\n\\t\\t\\t\\tvirtual void message(const_byte_range payload);\\n\\n\\t\\t\\t};\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"frontend/tests/mock_channel.h\",\n \"rank\": 4,\n \"score\": 294214.12043725804\n },\n {\n \"content\": \"\\t\\tclass controllee_session : public ipc::channel\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tcontrollee_session(ipc::channel &outbound);\\n\\n\\n\\n\\t\\t\\tvoid disconnect_client();\\n\\n\\t\\t\\tvoid send(const_byte_range payload);\\n\\n\\n\\n\\t\\t\\tvirtual void disconnect() throw();\\n\\n\\t\\t\\tvirtual void message(const_byte_range payload);\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tstd::vector< std::vector<byte> > messages;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tipc::channel *_outbound;\\n\\n\\t\\t\\tmt::event _ready;\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\ttemplate <typename SessionT = controllee_session>\\n\",\n \"file_path\": \"test-helpers/process.h\",\n \"rank\": 6,\n \"score\": 280470.0181342943\n },\n {\n \"content\": \"\\t\\t\\t\\tclass valid_sink : public CComObjectRoot, public ISequentialStream\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tBEGIN_COM_MAP(valid_sink)\\n\\n\\t\\t\\t\\t\\t\\tCOM_INTERFACE_ENTRY(ISequentialStream)\\n\\n\\t\\t\\t\\t\\tEND_COM_MAP()\\n\\n\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tvalid_sink()\\n\\n\\t\\t\\t\\t\\t\\t: _destroyed(0)\\n\\n\\t\\t\\t\\t\\t{\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\tvoid set_destroyed(bool &destroyed)\\n\\n\\t\\t\\t\\t\\t{\\t_destroyed = &destroyed;\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\tvoid FinalRelease()\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tif (_destroyed)\\n\\n\\t\\t\\t\\t\\t\\t\\t*_destroyed = true;\\n\\n\\t\\t\\t\\t\\t}\\n\",\n \"file_path\": \"ipc/tests/COMEndpointServerDuplexTests.cpp\",\n \"rank\": 7,\n \"score\": 279231.6162602297\n },\n {\n \"content\": \"\\tclass file_id : std::pair<unsigned long long, unsigned long long>, std::shared_ptr<void>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tfile_id(const std::string &path);\\n\\n\\n\\n\\t\\tbool operator ==(const file_id &rhs) const;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttemplate <typename T>\\n\\n\\t\\tfriend struct std::hash;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\tinline bool file_id::operator ==(const file_id &rhs) const\\n\\n\\t{\\treturn *this == static_cast<const std::pair<unsigned long long, unsigned long long> &>(rhs);\\t}\\n\\n}\\n\\n\\n\\nnamespace std\\n\\n{\\n\",\n \"file_path\": \"common/file_id.h\",\n \"rank\": 8,\n \"score\": 271899.495257596\n },\n {\n \"content\": \"\\t\\t\\tclass frontend : public ipc::channel\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\texplicit frontend(shared_ptr<frontend_state> state);\\n\\n\\t\\t\\t\\tfrontend(const frontend &other);\\n\\n\\t\\t\\t\\t~frontend();\\n\\n\\n\\n\\t\\t\\t\\tvirtual void disconnect() throw();\\n\\n\\t\\t\\t\\tvirtual void message(const_byte_range payload);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tconst frontend &operator =(const frontend &rhs);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tmutable shared_ptr<frontend_state> _state;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\\n\\t\\t\\tipc::channel_ptr_t frontend_state::create()\\n\\n\\t\\t\\t{\\treturn ipc::channel_ptr_t(new frontend(shared_from_this()));\\t}\\n\",\n \"file_path\": \"micro-profiler.tests/mock_frontend.cpp\",\n \"rank\": 9,\n \"score\": 270450.1125408769\n },\n {\n \"content\": \"\\t\\tclass client_session : public channel\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\ttypedef std::function<void (deserializer &payload_deserializer)> callback_t;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\t// User establishes and controls the connection.\\n\\n\\t\\t\\ttemplate <typename ChannelFactoryT>\\n\\n\\t\\t\\tclient_session(const ChannelFactoryT &connection_factory);\\n\\n\\n\\n\\t\\t\\t// Connection is established and controlled by an outside entity.\\n\\n\\t\\t\\tclient_session(channel &outbound);\\n\\n\\n\\n\\t\\t\\tvirtual ~client_session();\\n\\n\\n\\n\\t\\t\\tvoid disconnect_session() throw();\\n\\n\\n\\n\\t\\t\\ttemplate <typename MessageCallbackT>\\n\\n\\t\\t\\tvoid subscribe(std::shared_ptr<void> &handle, int message_id, const MessageCallbackT &callback);\\n\\n\\n\",\n \"file_path\": \"ipc/client_session.h\",\n \"rank\": 10,\n \"score\": 267506.9295124965\n },\n {\n \"content\": \"\\t\\t\\t\\tclass wrong_sink : public CComObjectRoot, public IUnknown\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tBEGIN_COM_MAP(wrong_sink)\\n\\n\\t\\t\\t\\t\\t\\tCOM_INTERFACE_ENTRY(IUnknown)\\n\\n\\t\\t\\t\\t\\tEND_COM_MAP()\\n\\n\\t\\t\\t\\t};\\n\\n\\n\",\n \"file_path\": \"ipc/tests/COMEndpointServerDuplexTests.cpp\",\n \"rank\": 11,\n \"score\": 259329.38736569963\n },\n {\n \"content\": \"\\t\\tclass server_session : public channel, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\",\n \"file_path\": \"ipc/server_session.h\",\n \"rank\": 12,\n \"score\": 254474.14260405552\n },\n {\n \"content\": \"\\t\\t\\tclass server : public CComClassFactory\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tvoid set_server(const std::shared_ptr<ipc::server> &factory);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tSTDMETHODIMP CreateInstance(IUnknown *outer, REFIID riid, void **object);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tstd::shared_ptr<ipc::server> _session_factory;\\n\\n\\t\\t\\t};\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"ipc/com/endpoint.h\",\n \"rank\": 13,\n \"score\": 252929.4295037996\n },\n {\n \"content\": \"\\t\\t\\tclass client_session : public channel\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tclient_session(const host_port &hp, channel &inbound);\\n\\n\\t\\t\\t\\t~client_session();\\n\\n\\n\\n\\t\\t\\t\\tvirtual void disconnect() throw();\\n\\n\\t\\t\\t\\tvirtual void message(const_byte_range payload);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tvoid worker(channel *inbound);\\n\\n\\t\\t\\t\\tstatic int open(const host_port &hp);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tsockets_initializer _initializer;\\n\\n\\t\\t\\t\\tsocket_handle _socket;\\n\\n\\t\\t\\t\\tunique_ptr<mt::thread> _thread;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\",\n \"file_path\": \"ipc/src/client_endpoint_sockets.cpp\",\n \"rank\": 14,\n \"score\": 252019.25030282928\n },\n {\n \"content\": \"\\t\\tclass marshalled_passive_session : public channel, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tmarshalled_passive_session(std::shared_ptr<scheduler::queue> queue, channel &outbound);\\n\\n\\t\\t\\t~marshalled_passive_session();\\n\\n\\n\\n\\t\\t\\tvoid create_underlying(std::shared_ptr<server> underlying_server);\\n\\n\\n\\n\\t\\tprivate:\\n\",\n \"file_path\": \"ipc/marshalled_session.h\",\n \"rank\": 15,\n \"score\": 249320.34604634534\n },\n {\n \"content\": \"\\t\\tclass command_handler : public ipc::channel, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tcommand_handler(mt::event &exit, const char *destination_endpoint)\\n\\n\\t\\t\\t\\t: _exit(exit)\\n\\n\\t\\t\\t{\\t_commander_channel = ipc::connect_client(destination_endpoint, *this);\\t}\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvirtual void disconnect() throw()\\n\\n\\t\\t\\t{\\t_exit.set();\\t}\\n\\n\\n\\n\\t\\t\\tvirtual void message(const_byte_range payload)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tvector_adapter reader(payload);\\n\\n\\t\\t\\t\\tstrmd::deserializer<vector_adapter> archive(reader);\\n\\n\\t\\t\\t\\trunner_commands c;\\n\\n\\t\\t\\t\\tstring data1, data2;\\n\\n\\n\\n\\t\\t\\t\\tswitch (archive(c), c)\\n\\n\\t\\t\\t\\t{\\n\",\n \"file_path\": \"micro-profiler.tests/guineapigs/guinea_runner.cpp\",\n \"rank\": 16,\n \"score\": 248878.3219732191\n },\n {\n \"content\": \"\\t\\tclass image : private std::shared_ptr<void>\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\texplicit image(std::string path);\\n\\n\\n\\n\\t\\t\\tbyte *base_ptr() const;\\n\\n\\t\\t\\tlong_address_t base() const;\\n\\n\\t\\t\\tconst char *absolute_path() const;\\n\\n\\t\\t\\tvoid *get_symbol_address(const char *name) const;\\n\\n\\t\\t\\tunsigned get_symbol_rva(const char *name) const;\\n\\n\\t\\t\\ttemplate <typename T>\\n\\n\\t\\t\\tT *get_symbol(const char *name) const;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tbyte *_base;\\n\\n\\t\\t\\tstd::string _fullpath;\\n\\n\\t\\t};\\n\\n\\n\",\n \"file_path\": \"test-helpers/helpers.h\",\n \"rank\": 17,\n \"score\": 244397.4383936341\n },\n {\n \"content\": \"\\t\\tclass marshalled_passive_session::outbound_wrapper : public channel, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\toutbound_wrapper(channel &underlying);\\n\\n\\n\\n\\t\\t\\tvoid stop();\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvirtual void disconnect() throw() override;\\n\\n\\t\\t\\tvirtual void message(const_byte_range payload) override;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tconst std::shared_ptr<lifetime> _lifetime;\\n\\n\\t\\t\\tchannel &_underlying;\\n\\n\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\ttemplate <typename ConnectionFactoryT, typename ServerSessionFactoryT>\\n\\n\\t\\tinline marshalled_active_session::marshalled_active_session(const ConnectionFactoryT &connection_factory,\\n\\n\\t\\t\\t\\tstd::shared_ptr<scheduler::queue> queue, const ServerSessionFactoryT &server_session_factory)\\n\\n\\t\\t\\t: _queue(queue)\\n\\n\\t\\t{\\n\\n\\t\\t\\t_connection_outbound = connection_factory(*this);\\n\\n\\t\\t\\t_server_inbound = server_session_factory(*_connection_outbound);\\n\\n\\t\\t}\\n\\n\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"ipc/marshalled_session.h\",\n \"rank\": 18,\n \"score\": 233557.6943039728\n },\n {\n \"content\": \"\\t\\t\\tclass socket_handler : public /*outbound*/ channel, noncopyable\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tenum status { proceed, remove_this, exit, };\\n\\n\\t\\t\\t\\ttypedef std::function<status (socket_handler &self, const socket_handle &s)> handler_t;\\n\\n\\t\\t\\t\\ttypedef std::shared_ptr<socket_handler> ptr_t;\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tsocket_handler(unsigned id_, socket_handle &s, const socket_handle &aux_socket,\\n\\n\\t\\t\\t\\t\\tconst handler_t &initial_handler);\\n\\n\\t\\t\\t\\t~socket_handler() throw();\\n\\n\\n\\n\\t\\t\\t\\ttemplate <typename ContainerT>\\n\\n\\t\\t\\t\\tstatic void run(ContainerT &handlers);\\n\\n\\n\\n\\t\\t\\t\\tvirtual void disconnect() throw();\\n\\n\\t\\t\\t\\tvirtual void message(const_byte_range payload);\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tconst unsigned id;\\n\\n\\t\\t\\t\\thandler_t handler;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tsocket_handle _socket;\\n\\n\\t\\t\\t\\tconst socket_handle &_aux_socket;\\n\\n\\t\\t\\t};\\n\\n\\n\",\n \"file_path\": \"ipc/src/server_endpoint_sockets.h\",\n \"rank\": 19,\n \"score\": 233557.6943039728\n },\n {\n \"content\": \"\\t\\tclass FauxFrontend : public IUnknown, public CComObjectRoot, public CComCoClass<FauxFrontend>\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tDECLARE_REGISTRY_RESOURCEID(IDR_PROFILER_FRONTEND)\\n\\n\\t\\t\\tBEGIN_COM_MAP(FauxFrontend)\\n\\n\\t\\t\\t\\tCOM_INTERFACE_ENTRY(IUnknown)\\n\\n\\t\\t\\tEND_COM_MAP()\\n\\n\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\tshared_ptr<hive> open_configuration(const vector<string> &configuration_path)\\n\\n\\t\\t{\\n\\n\\t\\t\\tauto h = registry_hive::open_user_settings(\\\"Software\\\");\\n\\n\\n\\n\\t\\t\\tfor (auto i = configuration_path.begin(); i != configuration_path.end(); ++i)\\n\\n\\t\\t\\t\\th = h->create(i->c_str());\\n\\n\\t\\t\\treturn h;\\n\\n\\t\\t}\\n\\n\\t}\\n\",\n \"file_path\": \"standalone/application_win32.cpp\",\n \"rank\": 20,\n \"score\": 232627.7270294888\n },\n {\n \"content\": \"\\t\\t\\t\\tclass server : public ipc::server\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tstd::vector< std::shared_ptr<session> > sessions;\\n\\n\\t\\t\\t\\t\\tstd::function<void (const std::shared_ptr<session> &new_session)> session_created;\\n\\n\\n\\n\\t\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\t\\tvirtual channel_ptr_t create_session(ipc::channel &outbound);\\n\\n\\n\\n\\t\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\t\\tmt::mutex _mutex;\\n\\n\\t\\t\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\t\\t\\tinline void channel::disconnect() throw()\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tif (on_disconnect)\\n\\n\\t\\t\\t\\t\\t\\ton_disconnect();\\n\\n\\t\\t\\t\\t}\\n\",\n \"file_path\": \"ipc/tests/mocks.h\",\n \"rank\": 21,\n \"score\": 225563.89245304617\n },\n {\n \"content\": \"\\t\\tclass runner_controller : public ipc::server\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tbool wait_connection();\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tstd::vector< std::shared_ptr<SessionT> > sessions;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\t// ipc::server methods\\n\\n\\t\\t\\tvirtual ipc::channel_ptr_t create_session(ipc::channel &outbound);\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tmt::event _ready;\\n\\n\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\tstd::shared_ptr<running_process> create_process(const std::string &executable_path,\\n\\n\\t\\t\\tconst std::string &command_line);\\n\",\n \"file_path\": \"test-helpers/process.h\",\n \"rank\": 22,\n \"score\": 209333.87115159153\n },\n {\n \"content\": \"\\tclass frontend : public ipc::client_session, noncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef frontend_ui_context session_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tfrontend(ipc::channel &outbound);\\n\\n\\t\\t~frontend();\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tstd::function<void (const session_type &ui_context)> initialized;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef std::list< std::shared_ptr<void> > requests_t;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\t// ipc::channel methods\\n\\n\\t\\tvirtual void disconnect() throw() override;\\n\\n\\n\\n\\t\\tvoid init_patcher();\\n\",\n \"file_path\": \"frontend/frontend.h\",\n \"rank\": 23,\n \"score\": 203037.12298805304\n },\n {\n \"content\": \"\\t\\tclass logging_server : public ipc::server, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tlogging_server(const shared_ptr<ipc::server> &server, const string &endpoint_id)\\n\\n\\t\\t\\t\\t: _server(server), _endpoint_id(endpoint_id)\\n\\n\\t\\t\\t{\\t}\\n\\n\\n\\n\\t\\t\\tvirtual ipc::channel_ptr_t create_session(ipc::channel &outbound) override\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tLOG(PREAMBLE \\\"creating frontend server session...\\\") % A(_endpoint_id);\\n\\n\\t\\t\\t\\treturn _server->create_session(outbound);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tconst shared_ptr<ipc::server> _server;\\n\\n\\t\\t\\tconst string _endpoint_id;\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\tshared_ptr<void> try_run_server(const string &endpoint_id, const shared_ptr<ipc::server> &server)\\n\\n\\t\\ttry\\n\",\n \"file_path\": \"frontend/src/untested/ipc_manager.cpp\",\n \"rank\": 24,\n \"score\": 201940.12910223968\n },\n {\n \"content\": \"\\tclass file_hive : public hive, public std::enable_shared_from_this<file_hive>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tstatic std::shared_ptr<hive> open_ini(const char *path);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tfile_hive(const char *path);\\n\\n\\n\\n\\t\\tvirtual std::shared_ptr<hive> create(const char *name) override;\\n\\n\\t\\tvirtual std::shared_ptr<const hive> open(const char *name) const override;\\n\\n\\n\\n\\t\\tvirtual void store(const char *name, int value) override;\\n\\n\\t\\tvirtual void store(const char *name, const char *value) override;\\n\\n\\n\\n\\t\\tvirtual bool load(const char *name, int &value) const override;\\n\\n\\t\\tvirtual bool load(const char *name, std::string &value) const override;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"common/configuration_file.h\",\n \"rank\": 25,\n \"score\": 199777.81539067515\n },\n {\n \"content\": \"\\tclass frontend_manager : public ipc::server, noncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tstruct instance\\n\\n\\t\\t{\\n\\n\\t\\t\\tstd::string title;\\n\\n\\t\\t\\tstd::shared_ptr<frontend_ui> ui;\\n\\n\\t\\t};\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\ttemplate <typename FrontendFactoryT, typename FrontendUIFactoryT>\\n\\n\\t\\tfrontend_manager(FrontendFactoryT frontend_factory, FrontendUIFactoryT ui_factory);\\n\\n\\t\\t~frontend_manager();\\n\\n\\n\\n\\t\\tvoid close_all() throw();\\n\\n\\n\\n\\t\\tsize_t instances_count() const throw();\\n\\n\\t\\tconst instance *get_instance(unsigned index) const throw();\\n\\n\\t\\tconst instance *get_active() const throw();\\n\\n\\n\",\n \"file_path\": \"frontend/frontend_manager.h\",\n \"rank\": 26,\n \"score\": 199180.08071221865\n },\n {\n \"content\": \"\\tclass function_hint : public wpl::view\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tfunction_hint(wpl::gcontext::text_engine_type &text_services);\\n\\n\\n\\n\\t\\tvoid apply_styles(const wpl::stylesheet &stylesheet_);\\n\\n\\n\\n\\t\\tvoid set_model(std::shared_ptr<wpl::richtext_table_model> model);\\n\\n\\t\\tbool select(wpl::table_model_base::index_type index);\\n\\n\\t\\tbool is_active() const;\\n\\n\\t\\tagge::box<int> get_box() const;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tvirtual void draw(wpl::gcontext &context, wpl::gcontext::rasterizer_ptr &rasterizer) const override;\\n\\n\\n\\n\\t\\tvoid update_text_and_calculate_locations(wpl::table_model_base::index_type index);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\twpl::gcontext::text_engine_type &_text_services;\\n\\n\\t\\tstd::shared_ptr<wpl::richtext_table_model> _model;\\n\",\n \"file_path\": \"frontend/function_hint.h\",\n \"rank\": 27,\n \"score\": 196274.68206914118\n },\n {\n \"content\": \"\\t\\tclass unordered_map : std::list< std::pair<const KeyT, ValueT> >\\n\\n\\t\\t{\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tenum { initial_nbuckets = 16, };\\n\\n\\t\\t\\ttypedef std::list< std::pair<const KeyT, ValueT> > base_t;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\ttypedef KeyT key_type;\\n\\n\\t\\t\\ttypedef ValueT mapped_type;\\n\\n\\t\\t\\ttypedef std::pair<const KeyT, ValueT> value_type;\\n\\n\\t\\t\\ttypedef unsigned short internal_size_type;\\n\\n\\t\\t\\tusing typename base_t::const_iterator;\\n\\n\\t\\t\\tusing typename base_t::iterator;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tusing base_t::begin;\\n\\n\\t\\t\\tusing base_t::end;\\n\\n\\t\\t\\tusing base_t::empty;\\n\\n\\t\\t\\tusing base_t::size;\\n\\n\\n\",\n \"file_path\": \"common/unordered_map.h\",\n \"rank\": 28,\n \"score\": 193696.98479875407\n },\n {\n \"content\": \"\\tclass thread_monitor : public std::enable_shared_from_this<thread_monitor>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef unsigned int thread_id;\\n\\n\\t\\ttypedef unsigned long long native_thread_id;\\n\\n\\t\\ttypedef std::pair<thread_id, thread_info> value_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tthread_monitor(mt::thread_callbacks &callbacks);\\n\\n\\n\\n\\t\\tvirtual thread_id register_self();\\n\\n\\n\\n\\t\\ttemplate <typename OutputIteratorT, typename IteratorT>\\n\\n\\t\\tvoid get_info(OutputIteratorT destination, IteratorT begin_id, IteratorT end_id) const;\\n\\n\\n\\n\\tprotected:\\n\\n\\t\\tstruct live_thread_info;\\n\\n\\n\\n\\t\\ttypedef containers::unordered_map<native_thread_id, live_thread_info> running_threads_map;\\n\\n\\t\\ttypedef containers::unordered_map<thread_id, thread_info> threads_map;\\n\",\n \"file_path\": \"collector/thread_monitor.h\",\n \"rank\": 29,\n \"score\": 192579.32080453407\n },\n {\n \"content\": \"\\t\\tclass buffer_deleter;\\n\\n\\n\\n\\t\\ttypedef std::unique_ptr<buffer, buffer_deleter> buffer_ptr;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tvoid create_buffer(buffer_ptr &new_buffer);\\n\\n\\t\\tvoid start_buffer(buffer_ptr &ready_buffer) throw();\\n\\n\\t\\tvoid adjust_empty_buffers(const buffering_policy &policy, size_t base_n);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tE *_ptr;\\n\\n\\t\\tunsigned int _n_left;\\n\\n\\n\\n\\t\\tunsigned int _id;\\n\\n\\t\\tbuffer_ptr _active_buffer;\\n\\n\\t\\tpolyq::circular_buffer< buffer_ptr, polyq::static_entry<buffer_ptr> > _ready_buffers;\\n\\n\\t\\tbuffer_ptr *_empty_buffers_top;\\n\\n\\t\\tsize_t _allocated_buffers;\\n\\n\\n\\n\\t\\tbuffering_policy _policy;\\n\",\n \"file_path\": \"collector/buffers_queue.h\",\n \"rank\": 30,\n \"score\": 192529.94935912458\n },\n {\n \"content\": \"\\t\\tclass message_loop_android : public message_loop\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tmessage_loop_android()\\n\\n\\t\\t\\t\\t: _exit(false), _looper(ALooper_prepare(ALOOPER_PREPARE_ALLOW_NON_CALLBACKS))\\n\\n\\t\\t\\t{\\tALooper_acquire(_looper);\\t}\\n\\n\\n\\n\\t\\t\\t~message_loop_android()\\n\\n\\t\\t\\t{\\tALooper_release(_looper);\\t}\\n\\n\\n\\n\\t\\t\\tvirtual void run() override\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tint dummy[2];\\n\\n\\t\\t\\t\\tvoid *vdummy;\\n\\n\\n\\n\\t\\t\\t\\twhile (!_exit && ALOOPER_POLL_ERROR != ALooper_pollOnce(-1, &dummy[0], &dummy[1], &vdummy))\\n\\n\\t\\t\\t\\t{\\t}\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tvirtual void exit() override\\n\",\n \"file_path\": \"scheduler/tests/helpers_android.cpp\",\n \"rank\": 31,\n \"score\": 191091.6151219264\n },\n {\n \"content\": \"\\t\\tclass message_loop_win32 : public message_loop\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tmessage_loop_win32()\\n\\n\\t\\t\\t\\t: _thread_id(::GetCurrentThreadId())\\n\\n\\t\\t\\t{\\t}\\n\\n\\n\\n\\t\\t\\tvirtual void run() override\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tMSG msg = {};\\n\\n\\n\\n\\t\\t\\t\\twhile (::GetMessage(&msg, NULL, 0, 0) && WM_QUIT != msg.message)\\n\\n\\t\\t\\t\\t\\t::DispatchMessage(&msg);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tvirtual void exit() override\\n\\n\\t\\t\\t{\\t::PostThreadMessage(_thread_id, WM_QUIT, 0, 0);\\t}\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tunsigned _thread_id;\\n\",\n \"file_path\": \"scheduler/tests/helpers_win32.cpp\",\n \"rank\": 32,\n \"score\": 191091.6151219264\n },\n {\n \"content\": \"\\t\\tclass marshalled_active_session : channel, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\ttemplate <typename ConnectionFactoryT, typename ServerSessionFactoryT>\\n\\n\\t\\t\\tmarshalled_active_session(const ConnectionFactoryT &connection_factory,\\n\\n\\t\\t\\t\\tstd::shared_ptr<scheduler::queue> queue, const ServerSessionFactoryT &server_session_factory);\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvirtual void disconnect() throw() override;\\n\\n\\t\\t\\tvirtual void message(const_byte_range payload) override;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tchannel_ptr_t _connection_outbound, _server_inbound;\\n\\n\\t\\t\\tscheduler::private_queue _queue;\\n\\n\\t\\t};\\n\\n\\n\\n\\n\",\n \"file_path\": \"ipc/marshalled_session.h\",\n \"rank\": 33,\n \"score\": 189098.27727653447\n },\n {\n \"content\": \"\\t\\tclass marshalled_server : public server, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tmarshalled_server(std::shared_ptr<server> underlying, std::shared_ptr<scheduler::queue> queue);\\n\\n\\t\\t\\t~marshalled_server();\\n\\n\\n\\n\\t\\t\\tvoid stop();\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvirtual channel_ptr_t create_session(channel &outbound) override;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tconst std::shared_ptr<lifetime> _lifetime;\\n\\n\\t\\t\\tstd::shared_ptr<server> _underlying;\\n\\n\\t\\t\\tconst std::shared_ptr<scheduler::queue> _queue;\\n\\n\\t\\t};\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"ipc/marshalled_server.h\",\n \"rank\": 34,\n \"score\": 183337.99562135275\n },\n {\n \"content\": \"\\tclass buffers_queue<E>::buffer_deleter\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tbuffer_deleter();\\n\\n\\t\\texplicit buffer_deleter(allocator &allocator_);\\n\\n\\n\\n\\t\\tvoid operator ()(buffer *object) throw();\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tallocator *_allocator;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\ttemplate <typename E>\\n\\n\\tinline buffers_queue<E>::buffers_queue(allocator &allocator_, const buffering_policy &policy, unsigned int id)\\n\\n\\t\\t: _id(id), _ready_buffers(policy.max_buffers()), _allocated_buffers(0), _policy(policy),\\n\\n\\t\\t\\t_empty_buffers(new buffer_ptr[policy.max_buffers()]), _allocator(allocator_)\\n\\n\\t{\\n\\n\\t\\tbuffer_ptr b;\\n\",\n \"file_path\": \"collector/buffers_queue.h\",\n \"rank\": 35,\n \"score\": 179627.0793618212\n },\n {\n \"content\": \"\\t\\t\\tvirtual void disconnect() throw() = 0;\\n\",\n \"file_path\": \"ipc/endpoint.h\",\n \"rank\": 36,\n \"score\": 179509.95297381445\n },\n {\n \"content\": \"\\tclass threads_model : public wpl::list_model<std::string>, noncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tthreads_model(std::shared_ptr<const tables::threads> threads);\\n\\n\\n\\n\\t\\tbool get_key(unsigned int &thread_id, index_type index) const throw();\\n\\n\\n\\n\\t\\tvirtual index_type get_count() const throw() override;\\n\\n\\t\\tvirtual void get_value(index_type index, std::string &text) const override;\\n\\n\\t\\tvirtual std::shared_ptr<const wpl::trackable> track(index_type index) const override;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef views::ordered<tables::threads> view_type;\\n\\n\\t\\ttypedef trackables_provider<view_type> trackables_type;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tconst std::shared_ptr<const tables::threads> _underlying;\\n\\n\\t\\tconst std::shared_ptr<view_type> _view;\\n\\n\\t\\tconst std::shared_ptr<trackables_type> _trackables;\\n\\n\\t\\twpl::slot_connection _invalidation;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"frontend/threads_model.h\",\n \"rank\": 37,\n \"score\": 179435.95875718273\n },\n {\n \"content\": \"\\t\\t\\tclass frontend_state : noncopyable, public std::enable_shared_from_this<frontend_state>\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\texplicit frontend_state(const std::shared_ptr<void> &ownee = std::shared_ptr<void>());\\n\\n\\n\\n\\t\\t\\t\\tipc::channel_ptr_t create();\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tstd::function<void ()> constructed;\\n\\n\\t\\t\\t\\tstd::function<void ()> destroyed;\\n\\n\\n\\n\\t\\t\\t\\tstd::function<void (const initialization_data &id)> initialized;\\n\\n\\t\\t\\t\\tstd::function<void (unsigned token, const loaded_modules &m)> modules_loaded;\\n\\n\\t\\t\\t\\tstd::function<void (unsigned token, const thread_statistics_map &u)> updated;\\n\\n\\t\\t\\t\\tstd::function<void (unsigned token, const unloaded_modules &m)> modules_unloaded;\\n\\n\\t\\t\\t\\tstd::function<void (unsigned token, const module_info_metadata &md)> metadata_received;\\n\\n\\t\\t\\t\\tstd::function<void (unsigned token, const std::vector< std::pair<unsigned /*thread_id*/, thread_info> > &threads)> threads_received;\\n\\n\\t\\t\\t\\tstd::function<void (unsigned token, const patch_manager::apply_results &results)> activation_response_received;\\n\\n\\t\\t\\t\\tstd::function<void (unsigned token, const patch_manager::revert_results &results)> revert_response_received;\\n\\n\\n\",\n \"file_path\": \"micro-profiler.tests/mock_frontend.h\",\n \"rank\": 38,\n \"score\": 177927.36064859768\n },\n {\n \"content\": \"\\t\\t\\t\\tclass sequential_stream\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\t\\tsequential_stream(const CLSID &id)\\n\\n\\t\\t\\t\\t\\t\\t: _frontend(0)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t::CoCreateInstance(id, NULL, CLSCTX_LOCAL_SERVER, IID_ISequentialStream, (void **)&_frontend);\\n\\n\\t\\t\\t\\t\\t\\tassert_not_null(_frontend);\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\tsequential_stream(const sequential_stream &other)\\n\\n\\t\\t\\t\\t\\t\\t: _frontend(other._frontend)\\n\\n\\t\\t\\t\\t\\t{\\t_frontend->AddRef();\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\t~sequential_stream()\\n\\n\\t\\t\\t\\t\\t{\\t_frontend->Release();\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\tbool operator()(const void *buffer, size_t size)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tULONG written;\\n\",\n \"file_path\": \"ipc/tests/helpers_com.cpp\",\n \"rank\": 39,\n \"score\": 170499.35546884098\n },\n {\n \"content\": \"\\tclass calls_collector_thread : public buffers_queue<call_record>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef std::function<void (unsigned int id, const call_record *calls, size_t count)> reader_t;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\texplicit calls_collector_thread(allocator &allocator_, const buffering_policy &policy, unsigned int id);\\n\\n\\n\\n\\t\\tvoid on_enter(const void **stack_ptr, timestamp_t timestamp, const void *callee) throw();\\n\\n\\t\\tconst void *on_exit(const void **stack_ptr, timestamp_t timestamp) throw();\\n\\n\\n\\n\\t\\tvoid track(const void *callee, timestamp_t timestamp) throw();\\n\\n\\n\\n\\t\\tvoid flush();\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tpod_vector<return_entry> _return_stack;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\tFORCE_INLINE void calls_collector_thread::track(const void *callee, timestamp_t timestamp) throw()\\n\\n\\t{\\n\\n\\t\\tauto &c = current();\\n\\n\\n\\n\\t\\tc.timestamp = timestamp, c.callee = callee;\\n\\n\\t\\tpush();\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"collector/calls_collector_thread.h\",\n \"rank\": 40,\n \"score\": 169682.2995140495\n },\n {\n \"content\": \"\\t\\t\\tclass socket_handle : noncopyable\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tsocket_handle();\\n\\n\\t\\t\\t\\t~socket_handle();\\n\\n\\n\\n\\t\\t\\t\\toperator int() const;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tint _socket;\\n\\n\\t\\t\\t};\\n\\n\\n\",\n \"file_path\": \"ipc/tests/helpers_sockets.h\",\n \"rank\": 41,\n \"score\": 167560.28881072742\n },\n {\n \"content\": \"\\t\\t\\tclass socket_handle : noncopyable\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\ttemplate <typename T>\\n\\n\\t\\t\\t\\texplicit socket_handle(T s);\\n\\n\\t\\t\\t\\tsocket_handle(socket_handle &other);\\n\\n\\t\\t\\t\\t~socket_handle();\\n\\n\\n\\n\\t\\t\\t\\tvoid reset() throw();\\n\\n\\t\\t\\t\\tvoid reset(int s);\\n\\n\\t\\t\\t\\toperator int() const;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tint _socket;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\t\\tinline host_port::host_port(const char *address, const char *default_host)\\n\\n\\t\\t\\t{\\n\",\n \"file_path\": \"ipc/src/socket_helpers.h\",\n \"rank\": 42,\n \"score\": 167560.28881072742\n },\n {\n \"content\": \"\\tclass trackables_provider<UnderlyingT>::trackable : public wpl::trackable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttrackable(key_type key_, size_t current_index_) : key(key_), current_index(current_index_) {\\t}\\n\\n\\t\\tvirtual size_t index() const override {\\treturn current_index;\\t}\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tkey_type key;\\n\\n\\t\\tsize_t current_index;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\ttemplate <typename UnderlyingT>\\n\\n\\tinline trackables_provider<UnderlyingT>::trackables_provider(const UnderlyingT &underlying)\\n\\n\\t\\t: _underlying(underlying), _trackables(std::make_shared<trackables_t>())\\n\\n\\t{\\t}\\n\\n\\n\\n\\ttemplate <typename UnderlyingT>\\n\\n\\tinline trackables_provider<UnderlyingT>::~trackables_provider()\\n\",\n \"file_path\": \"frontend/trackables_provider.h\",\n \"rank\": 43,\n \"score\": 165399.73391991862\n },\n {\n \"content\": \"\\tclass variant<T, void>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tvariant(const T &from)\\n\\n\\t\\t\\t: _type(0), _value(from)\\n\\n\\t\\t{\\t}\\n\\n\\n\\n\\t\\tunsigned int get_type() const\\n\\n\\t\\t{\\treturn _type;\\t}\\n\\n\\n\\n\\t\\tvoid change_type(unsigned int type)\\n\\n\\t\\t{\\t_type = type;\\t}\\n\\n\\n\\n\\t\\ttemplate <typename V>\\n\\n\\t\\ttypename V::return_type visit(const V &visitor) const\\n\\n\\t\\t{\\treturn visitor(_value);\\t}\\n\\n\\n\\n\\t\\ttemplate <typename V>\\n\\n\\t\\ttypename V::return_type visit(const V &visitor)\\n\\n\\t\\t{\\treturn visitor(_value);\\t}\\n\",\n \"file_path\": \"math/variant.h\",\n \"rank\": 44,\n \"score\": 153428.9315956888\n },\n {\n \"content\": \"\\tclass functions_list : public statistics_model_impl< wpl::richtext_table_model, views::filter<statistic_types::map_detailed> >\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef statistic_types::map_detailed::value_type value_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tfunctions_list(std::shared_ptr<tables::statistics> statistics, double tick_interval_,\\n\\n\\t\\t\\tstd::shared_ptr<symbol_resolver> resolver_, std::shared_ptr<const tables::threads> threads_);\\n\\n\\t\\tvirtual ~functions_list();\\n\\n\\n\\n\\t\\ttemplate <typename PredicateT>\\n\\n\\t\\tvoid set_filter(const PredicateT &predicate);\\n\\n\\t\\tvoid set_filter();\\n\\n\\n\\n\\t\\tvoid clear();\\n\\n\\t\\tvoid print(std::string &content) const;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef statistics_model_impl< wpl::richtext_table_model, views::filter<statistic_types::map_detailed> > base;\\n\\n\\n\",\n \"file_path\": \"frontend/function_list.h\",\n \"rank\": 45,\n \"score\": 148952.51101605932\n },\n {\n \"content\": \"\\t\\tclass ref_attribute_impl : public attribute\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tref_attribute_impl(const char *name_, const T &value);\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvirtual void format_value(buffer_t &buffer) const;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tconst T &_value;\\n\\n\\t\\t};\\n\\n\\n\",\n \"file_path\": \"logger/log.h\",\n \"rank\": 46,\n \"score\": 146466.39119402465\n },\n {\n \"content\": \"\\tclass pool_allocator : public allocator\\n\\n\\t{\\n\\n\\tprivate:\\n\\n\\t\\tstruct entry\\n\\n\\t\\t{\\n\\n\\t\\t\\tstd::size_t size;\\n\\n\\t\\t};\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tenum {\\toverhead = sizeof(entry)\\t};\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tpool_allocator(allocator &underlying);\\n\\n\\t\\t~pool_allocator();\\n\\n\\n\\n\\t\\tvirtual void *allocate(std::size_t length) override;\\n\\n\\t\\tvirtual void deallocate(void *memory) throw() override;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef std::vector<entry *> free_bin_t;\\n\",\n \"file_path\": \"common/pool_allocator.h\",\n \"rank\": 47,\n \"score\": 146466.39119402465\n },\n {\n \"content\": \"\\t\\t\\tclass tracer : public calls_collector_i\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tvirtual void read_collected(acceptor &a) override;\\n\\n\\t\\t\\t\\tvirtual void flush() override;\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tstd::function<void (acceptor &a)> on_read_collected;\\n\\n\\t\\t\\t\\tstd::function<void ()> on_flush;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\t\\tinline void tracer::read_collected(acceptor &a)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif (on_read_collected)\\n\\n\\t\\t\\t\\t\\ton_read_collected(a);\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tinline void tracer::flush()\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif (on_flush)\\n\\n\\t\\t\\t\\t\\ton_flush();\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"collector/tests/mocks.h\",\n \"rank\": 48,\n \"score\": 146466.39119402465\n },\n {\n \"content\": \"\\tclass ui_queue : public queue\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tui_queue(const clock &clock_);\\n\\n\\t\\t~ui_queue();\\n\\n\\n\\n\\t\\tvirtual void schedule(std::function<void ()> &&task, mt::milliseconds defer_by) override;\\n\\n\\n\\n\\t\\tvoid stop();\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstruct impl;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tscheduler::task_queue _tasks;\\n\\n\\t\\tstd::shared_ptr<impl> _impl;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"scheduler/ui_queue.h\",\n \"rank\": 49,\n \"score\": 146466.39119402465\n },\n {\n \"content\": \"\\tclass histogram : std::vector<Y>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef std::vector<Y> base_t;\\n\\n\\t\\ttypedef ScaleT scale_type;\\n\\n\\t\\ttypedef typename scale_type::value_type x_type;\\n\\n\\t\\ttypedef Y y_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid set_scale(const scale_type &scale_);\\n\\n\\t\\tconst scale_type &get_scale() const;\\n\\n\\n\\n\\t\\tusing base_t::size;\\n\\n\\t\\tusing base_t::begin;\\n\\n\\t\\tusing base_t::end;\\n\\n\\n\\n\\t\\tvoid add(x_type value, y_type d = 1);\\n\\n\\n\\n\\t\\ttemplate <typename IteratorT /*partition*/>\\n\\n\\t\\tvoid find_partitions(IteratorT first, IteratorT last) const;\\n\",\n \"file_path\": \"math/histogram.h\",\n \"rank\": 50,\n \"score\": 145127.65842280193\n },\n {\n \"content\": \"\\tclass about_ui : public wpl::stack\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tabout_ui(const wpl::factory &factory_);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tvoid on_link(const std::string &address);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstd::vector<wpl::slot_connection> _connections;\\n\\n\\t\\tstd::shared_ptr<wpl::button> _close_button;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\twpl::signal<void (const std::string &address)> link;\\n\\n\\t\\twpl::signal<void ()> &close;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"frontend/about_ui.h\",\n \"rank\": 51,\n \"score\": 144428.82171258074\n },\n {\n \"content\": \"\\tclass registry_hive : public hive\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tregistry_hive(std::shared_ptr<void> key);\\n\\n\\n\\n\\t\\tstatic std::shared_ptr<hive> open_user_settings(const char *registry_path);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\t// hive methods\\n\\n\\t\\tvirtual std::shared_ptr<hive> create(const char *name) override;\\n\\n\\t\\tvirtual std::shared_ptr<const hive> open(const char *name) const override;\\n\\n\\t\\tvirtual void store(const char *name, int value) override;\\n\\n\\t\\tvirtual void store(const char *name, const char *value) override;\\n\\n\\t\\tvirtual bool load(const char *name, int &value) const override;\\n\\n\\t\\tvirtual bool load(const char *name, std::string &value) const override;\\n\\n\\n\\n\\t\\toperator HKEY() const;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstd::shared_ptr<void> _key;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"common/win32/configuration_registry.h\",\n \"rank\": 52,\n \"score\": 143731.42772876847\n },\n {\n \"content\": \"\\tclass private_queue\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\texplicit private_queue(std::shared_ptr<queue> underlying);\\n\\n\\t\\t~private_queue();\\n\\n\\n\\n\\t\\tvoid schedule(std::function<void ()> &&task, mt::milliseconds defer_by = mt::milliseconds(0));\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstruct control_block;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tprivate_queue(const private_queue &other);\\n\\n\\t\\tvoid operator =(const private_queue &rhs);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstd::shared_ptr<queue> _underlying;\\n\\n\\t\\tstd::shared_ptr<control_block> _control_block;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"scheduler/private_queue.h\",\n \"rank\": 53,\n \"score\": 142965.8536003438\n },\n {\n \"content\": \"\\tclass buffers_queue\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef E value_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tbuffers_queue(allocator &allocator_, const buffering_policy &policy, unsigned int id);\\n\\n\\n\\n\\t\\tunsigned int get_id() throw();\\n\\n\\n\\n\\t\\tE ¤t() throw();\\n\\n\\t\\tvoid push() throw();\\n\\n\\t\\tvoid flush() throw();\\n\\n\\n\\n\\t\\ttemplate <typename ReaderT>\\n\\n\\t\\tvoid read_collected(const ReaderT &reader);\\n\\n\\n\\n\\t\\tvoid set_buffering_policy(const buffering_policy &policy);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstruct buffer;\\n\",\n \"file_path\": \"collector/buffers_queue.h\",\n \"rank\": 54,\n \"score\": 142932.4429510645\n },\n {\n \"content\": \"\\t\\tclass com_event\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tcom_event();\\n\\n\\n\\n\\t\\t\\tvoid set();\\n\\n\\t\\t\\tvoid wait();\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tstd::shared_ptr<void> _handle;\\n\\n\\t\\t};\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"test-helpers/com.h\",\n \"rank\": 55,\n \"score\": 142028.69649476206\n },\n {\n \"content\": \"\\tclass selection_model : public selection<typename key_traits<typename UnderlyingT::value_type>::key_type>,\\n\\n\\t\\tnoncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef wpl::dynamic_set_model::index_type index_type;\\n\\n\\t\\ttypedef key_traits<typename UnderlyingT::value_type> selection_key_type;\\n\\n\\t\\ttypedef typename selection_key_type::key_type key_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tselection_model(const UnderlyingT &underlying);\\n\\n\\n\\n\\t\\t// wpl::dynamic_set_model methods\\n\\n\\t\\tvirtual void clear() throw() override;\\n\\n\\t\\tvirtual void add(index_type item) override;\\n\\n\\t\\tvirtual void remove(index_type item) override;\\n\\n\\t\\tvirtual bool contains(index_type item) const throw() override;\\n\\n\\n\\n\\t\\t// selection<...> methods\\n\\n\\t\\tvirtual void enumerate(const std::function<void (const key_type &key)> &callback) const override;\\n\\n\\n\",\n \"file_path\": \"frontend/selection_model.h\",\n \"rank\": 56,\n \"score\": 140221.70591159002\n },\n {\n \"content\": \"\\tclass calls_collector : public calls_collector_i, public thread_queue_manager<calls_collector_thread>\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tcalls_collector(allocator &allocator_, size_t trace_limit, thread_monitor &thread_monitor_,\\n\\n\\t\\t\\tmt::thread_callbacks &thread_callbacks);\\n\\n\\n\\n\\t\\tvirtual void read_collected(acceptor &a) override;\\n\\n\\t\\tvirtual void flush() override;\\n\\n\\n\\n\\t\\tstatic void CC_(fastcall) on_enter(calls_collector *instance, const void **stack_ptr,\\n\\n\\t\\t\\ttimestamp_t timestamp, const void *callee) _CC(fastcall);\\n\\n\\t\\tstatic const void *CC_(fastcall) on_exit(calls_collector *instance, const void **stack_ptr,\\n\\n\\t\\t\\ttimestamp_t timestamp) _CC(fastcall);\\n\\n\\n\\n\\t\\tvoid track(timestamp_t timestamp, const void *callee);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef thread_queue_manager<calls_collector_thread> base_t;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tcalls_collector_thread &construct_thread_trace();\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"collector/calls_collector.h\",\n \"rank\": 57,\n \"score\": 139595.67281464557\n },\n {\n \"content\": \"\\tclass tables_ui : public wpl::stack\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttables_ui(const wpl::factory &factory_, const frontend_ui_context &context, hive &configuration);\\n\\n\\n\\n\\t\\tvoid save(hive &configuration);\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\twpl::signal<void(const std::string &file, unsigned line)> open_source;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstatic std::pair<statistic_types::key, bool> get_first_item(const selection<statistic_types::key> &selection_);\\n\\n\\n\\n\\t\\ttemplate <typename ModelT, typename SelectionModelT>\\n\\n\\t\\tvoid attach_section(wpl::listview &lv, piechart *pc, function_hint *hint, std::shared_ptr<headers_model> cm,\\n\\n\\t\\t\\tstd::shared_ptr<ModelT> model, std::shared_ptr<SelectionModelT> selection_);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tconst std::shared_ptr<headers_model> _cm_main;\\n\\n\\t\\tconst std::shared_ptr<headers_model> _cm_parents;\\n\\n\\t\\tconst std::shared_ptr<headers_model> _cm_children;\\n\\n\\n\\n\\t\\tstd::shared_ptr<wpl::listview> _lv_main;\\n\\n\\n\\n\\t\\tstd::vector<wpl::slot_connection> _connections;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"frontend/tables_ui.h\",\n \"rank\": 58,\n \"score\": 138787.041915369\n },\n {\n \"content\": \"\\t\\t\\tclass queue : public scheduler::queue\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tvirtual void schedule(std::function<void ()> &&task, mt::milliseconds defer_by = mt::milliseconds(0)) override;\\n\\n\\n\\n\\t\\t\\t\\tvoid run_one();\\n\\n\\t\\t\\t\\tvoid run_till_end();\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tstd::deque< std::pair<std::function<void ()>, mt::milliseconds > > tasks;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\t\\tinline void queue::schedule(std::function<void ()> &&task, mt::milliseconds defer_by)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\ttasks.emplace_back(std::make_pair(std::move(task), defer_by));\\n\\n\\t\\t\\t\\ttask = std::function<void ()>();\\n\\n\\t\\t\\t}\\n\\n\\n\",\n \"file_path\": \"test-helpers/mock_queue.h\",\n \"rank\": 59,\n \"score\": 138787.041915369\n },\n {\n \"content\": \"\\t\\tclass multithreaded_logger : public logger, noncopyable\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\ttypedef std::function<void (const char *text)> writer_t;\\n\\n\\t\\t\\ttypedef std::function<datetime ()> time_provider_t;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tmultithreaded_logger(const writer_t &writer, const time_provider_t &time_provider);\\n\\n\\t\\t\\t~multithreaded_logger();\\n\\n\\n\\n\\t\\t\\tvirtual void begin(const char *message, level level_) throw();\\n\\n\\t\\t\\tvirtual void add_attribute(const attribute &a) throw();\\n\\n\\t\\t\\tvirtual void commit() throw();\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tbuffer_t &get_buffer();\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tconst writer_t _writer;\\n\\n\\t\\t\\tconst time_provider_t _time_provider;\\n\\n\\t\\t\\tstd::list<buffer_t> _buffer_container;\\n\\n\\t\\t\\tmt::tls<buffer_t> _buffers;\\n\\n\\t\\t\\tmt::mutex _construction_mutex;\\n\\n\\t\\t};\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"logger/multithreaded_logger.h\",\n \"rank\": 60,\n \"score\": 138787.041915369\n },\n {\n \"content\": \"\\t\\t\\tclass allocation_monitor : public allocator\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tstd::function<void (size_t length, void *memory)> allocated;\\n\\n\\t\\t\\t\\tstd::function<void (void *memory)> freeing;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tvirtual void *allocate(std::size_t length) override\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tauto memory = malloc(length);\\n\\n\\n\\n\\t\\t\\t\\t\\ttry\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tif (allocated)\\n\\n\\t\\t\\t\\t\\t\\t\\tallocated(length, memory);\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tcatch (...)\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tfree(memory);\\n\\n\\t\\t\\t\\t\\t\\tthrow;\\n\",\n \"file_path\": \"common/tests/PoolAllocatorTests.cpp\",\n \"rank\": 61,\n \"score\": 138719.50191642868\n },\n {\n \"content\": \"\\tclass linear_display_scale : public display_scale_base\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttemplate <typename T>\\n\\n\\t\\tlinear_display_scale(const linear_scale<T> &scale, T divisor, int pixel_size);\\n\\n\\n\\n\\t\\tfloat operator [](float value) const;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tconst float _near, _display_k;\\n\\n\\t};\\n\\n\\n\\n\\n\",\n \"file_path\": \"math/display_scale.h\",\n \"rank\": 62,\n \"score\": 138719.50191642868\n },\n {\n \"content\": \"\\t\\t\\tclass mock_hive : public hive\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\ttypedef map<string, int> int_values_map;\\n\\n\\t\\t\\t\\ttypedef map<string, string> str_values_map;\\n\\n\\t\\t\\t\\t\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tmock_hive(int_values_map &int_values, str_values_map &str_values, const char *prefix = \\\"\\\");\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tconst mock_hive &operator =(const mock_hive &rhs);\\n\\n\\n\\n\\t\\t\\t\\tvirtual shared_ptr<hive> create(const char *name);\\n\\n\\t\\t\\t\\tvirtual shared_ptr<const hive> open(const char *name) const;\\n\\n\\n\\n\\t\\t\\t\\tvirtual void store(const char *name, int value);\\n\\n\\t\\t\\t\\tvirtual void store(const char *name, const char *value);\\n\\n\\n\\n\\t\\t\\t\\tvirtual bool load(const char *name, int &value) const;\\n\\n\\t\\t\\t\\tvirtual bool load(const char *name, string &value) const;\\n\",\n \"file_path\": \"frontend/tests/HeadersModelTests.cpp\",\n \"rank\": 63,\n \"score\": 138719.50191642868\n },\n {\n \"content\": \"\\tclass log_display_scale : public display_scale_base\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttemplate <typename T>\\n\\n\\t\\tlog_display_scale(const log_scale<T> &scale, T divisor, int pixel_size);\\n\\n\\n\\n\\t\\tfloat operator [](float value) const;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tconst float _near, _display_k;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\tinline display_scale_base::display_scale_base(unsigned samples, int pixel_size)\\n\\n\\t\\t: _bin_width(static_cast<float>(pixel_size) / samples)\\n\\n\\t{\\t}\\n\\n\\n\\n\\tinline std::pair<float, float> display_scale_base::at(unsigned int index) const\\n\\n\\t{\\n\",\n \"file_path\": \"math/display_scale.h\",\n \"rank\": 64,\n \"score\": 138719.50191642868\n },\n {\n \"content\": \"namespace std\\n\\n{\\n\\n\\tnamespace tr1 { }\\n\\n\\tusing namespace tr1;\\n\",\n \"file_path\": \"build.props/emit-tr1-to-std.h\",\n \"rank\": 65,\n \"score\": 138554.59795387727\n },\n {\n \"content\": \"\\t\\t\\tvirtual void message(const_byte_range payload) = 0;\\n\",\n \"file_path\": \"ipc/endpoint.h\",\n \"rank\": 66,\n \"score\": 138333.24655992072\n },\n {\n \"content\": \"\\tclass function_patch : noncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttemplate <typename T>\\n\\n\\t\\tfunction_patch(void *target, T *interceptor, executable_memory_allocator &allocator_);\\n\\n\\n\\n\\t\\tconst void *target() const;\\n\\n\\t\\tbool active() const;\\n\\n\\t\\tbool activate(bool atomic);\\n\\n\\t\\tbool revert();\\n\\n\\t\\tvoid detach();\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstd::shared_ptr<void> _trampoline;\\n\\n\\t\\tjumper _jumper;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\ttemplate <typename T>\\n\",\n \"file_path\": \"patcher/function_patch.h\",\n \"rank\": 67,\n \"score\": 136270.26267424936\n },\n {\n \"content\": \"\\t\\t\\tclass queue : public scheduler::queue\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tvector< pair<function<void ()>, mt::milliseconds> > tasks;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tvirtual void schedule(function<void ()> &&task, mt::milliseconds defer_by) override\\n\\n\\t\\t\\t\\t{\\ttasks.emplace_back(make_pair(move(task), defer_by));\\t}\\n\\n\\t\\t\\t};\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tbegin_test_suite( PrivateQueueTests )\\n\\n\\t\\t\\ttest( SchedulingIsDelegatedToUnderlyingQueue )\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\t// INIT\\n\\n\\t\\t\\t\\tconst auto u = make_shared<mocks::queue>();\\n\\n\\t\\t\\t\\tauto a = false;\\n\\n\\t\\t\\t\\tauto b = false;\\n\\n\\n\\n\\t\\t\\t\\t// INIT / ACT\\n\",\n \"file_path\": \"scheduler/tests/MiscTests.cpp\",\n \"rank\": 68,\n \"score\": 136209.12880448048\n },\n {\n \"content\": \"\\t\\t\\tclass allocator : public micro_profiler::allocator\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tallocator();\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tsize_t allocated, operations;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tvirtual void *allocate(size_t length) override;\\n\\n\\t\\t\\t\\tvirtual void deallocate(void *memory) throw() override;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tdefault_allocator _underlying;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\t\\tinline allocator::allocator()\\n\\n\\t\\t\\t\\t: allocated(0), operations(0)\\n\",\n \"file_path\": \"collector/tests/mocks_allocator.h\",\n \"rank\": 69,\n \"score\": 136209.12880448048\n },\n {\n \"content\": \"\\t\\t\\tclass thread_callbacks : public mt::thread_callbacks\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tunsigned invoke_destructors();\\n\\n\\t\\t\\t\\tunsigned invoke_destructors(mt::thread::id thread_id);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tvirtual void at_thread_exit(const atexit_t &handler) override;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tmt::mutex _mutex;\\n\\n\\t\\t\\t\\tcontainers::unordered_map< mt::thread::id, std::vector<atexit_t> > _destructors;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\",\n \"file_path\": \"collector/tests/mocks.h\",\n \"rank\": 70,\n \"score\": 136209.12880448048\n },\n {\n \"content\": \"\\tclass headers_model : public wpl::headers_model\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tstruct column;\\n\\n\\t\\tenum sort_direction\\t{\\tdir_none, dir_ascending, dir_descending\\t};\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\ttemplate <size_t N>\\n\\n\\t\\theaders_model(const column (&columns)[N], index_type sort_column, bool sort_ascending);\\n\\n\\n\\n\\t\\tvoid store(hive &configuration) const;\\n\\n\\t\\tvoid update(const hive &configuration);\\n\\n\\n\\n\\t\\tvirtual index_type get_count() const throw() override;\\n\\n\\t\\tvirtual void get_value(index_type index, short int &width) const throw() override;\\n\\n\\t\\tvirtual std::pair<index_type, bool> get_sort_order() const throw() override;\\n\\n\\t\\tvirtual void set_width(index_type index, short int width) override;\\n\\n\\t\\tvirtual agge::full_alignment get_alignment(index_type index) const override;\\n\\n\\t\\tvirtual agge::full_alignment get_header_alignment(index_type index) const override;\\n\\n\\t\\tvirtual void get_caption(index_type index, agge::richtext_t &caption) const override;\\n\",\n \"file_path\": \"frontend/headers_model.h\",\n \"rank\": 71,\n \"score\": 136209.12880448048\n },\n {\n \"content\": \"\\tclass ipc_manager : noncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef std::pair<unsigned short /*start*/, unsigned short /*size*/> port_range;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tipc_manager(std::shared_ptr<ipc::server> server, std::shared_ptr<scheduler::queue> queue, port_range range_,\\n\\n\\t\\t\\tconst guid_t *com_server_id);\\n\\n\\t\\t~ipc_manager();\\n\\n\\n\\n\\t\\tunsigned short get_sockets_port() const;\\n\\n\\t\\tbool remote_sockets_enabled() const;\\n\\n\\t\\tvoid enable_remote_sockets(bool enable);\\n\\n\\n\\n\\t\\tbool com_enabled() const;\\n\\n\\t\\tvoid enable_com(bool enable);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstatic std::shared_ptr<void> probe_create_server(const std::shared_ptr<ipc::server> &server,\\n\\n\\t\\t\\tipc::ip_v4 interface_, unsigned short &port, port_range range_);\\n\",\n \"file_path\": \"frontend/ipc_manager.h\",\n \"rank\": 72,\n \"score\": 135710.80581083093\n },\n {\n \"content\": \"\\tclass analyzer : public calls_collector_i::acceptor, noncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef containers::unordered_map<unsigned int, thread_analyzer> thread_analyzers;\\n\\n\\t\\ttypedef thread_analyzers::const_iterator const_iterator;\\n\\n\\t\\ttypedef std::pair<unsigned int, thread_analyzer> value_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tanalyzer(const overhead& overhead_);\\n\\n\\n\\n\\t\\tvoid clear() throw();\\n\\n\\t\\tsize_t size() const throw();\\n\\n\\t\\tconst_iterator begin() const throw();\\n\\n\\t\\tconst_iterator end() const throw();\\n\\n\\t\\tbool has_data() const throw();\\n\\n\\n\\n\\t\\tvirtual void accept_calls(unsigned int threadid, const call_record *calls, size_t count) override;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tconst overhead _overhead;\\n\\n\\t\\tthread_analyzers _thread_analyzers;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"collector/analyzer.h\",\n \"rank\": 73,\n \"score\": 134672.92344967992\n },\n {\n \"content\": \"\\t\\t\\tclass const_iterator;\\n\\n\\t\\t\\ttypedef typename U::value_type value_type;\\n\\n\\t\\t\\ttypedef typename U::const_reference const_reference;\\n\\n\\t\\t\\ttypedef const_reference reference;\\n\\n\\t\\t\\ttypedef std::function<bool (const value_type &value)> predicate_t;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tfilter(const U &underlying);\\n\\n\\n\\n\\t\\t\\ttemplate <typename PredicateT>\\n\\n\\t\\t\\tvoid set_filter(const PredicateT &predicate);\\n\\n\\t\\t\\tvoid set_filter();\\n\\n\\n\\n\\t\\t\\tconst_iterator begin() const throw();\\n\\n\\t\\t\\tconst_iterator end() const throw();\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tbool match(const value_type &value) const;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tconst U &_underlying;\\n\\n\\t\\t\\tpredicate_t _predicate;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tfriend class const_iterator;\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\ttemplate <class U>\\n\",\n \"file_path\": \"views/filter.h\",\n \"rank\": 74,\n \"score\": 134620.48367916333\n },\n {\n \"content\": \"\\t\\t\\tclass const_iterator;\\n\\n\\t\\t\\ttypedef typename X::const_reference const_reference;\\n\\n\\t\\t\\ttypedef const_iterator iterator;\\n\\n\\t\\t\\ttypedef typename X::const_reference reference;\\n\\n\\t\\t\\ttypedef typename X::value_type value_type;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tflatten(const U &underlying_, const X &transform_ = X());\\n\\n\\n\\n\\t\\t\\tconst_iterator begin() const;\\n\\n\\t\\t\\tconst_iterator end() const;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tconst U &underlying;\\n\\n\\t\\t\\tconst X transform;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvoid operator =(const flatten &rhs);\\n\\n\\t\\t};\\n\\n\\n\\n\\t\\ttemplate <class U, class X>\\n\",\n \"file_path\": \"views/flatten.h\",\n \"rank\": 75,\n \"score\": 134620.48367916333\n },\n {\n \"content\": \"\\tclass buffering_policy\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tenum {\\tbuffer_size = 384 /*entries*/,\\t};\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tbuffering_policy(size_t max_allocation, double max_empty_factor, double min_empty_factor);\\n\\n\\n\\n\\t\\tsize_t max_buffers() const;\\n\\n\\t\\tsize_t max_empty() const;\\n\\n\\t\\tsize_t min_empty() const;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tsize_t _max_buffers, _max_empty, _min_empty;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\tinline guid_t::operator const GUID &() const\\n\\n\\t{\\treturn *reinterpret_cast<const GUID *>(values);\\t}\\n\",\n \"file_path\": \"common/types.h\",\n \"rank\": 76,\n \"score\": 134596.83201870864\n },\n {\n \"content\": \"\\tclass function_hint;\\n\\n\\n\",\n \"file_path\": \"frontend/piechart.h\",\n \"rank\": 77,\n \"score\": 134378.2381897387\n },\n {\n \"content\": \"\\t\\tclass dbghelp_image_info : public image_info\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tdbghelp_image_info(const shared_ptr<dbghelp> &dbghelp_, const string &path);\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvirtual string get_path() const override;\\n\\n\\t\\t\\tvirtual void enumerate_functions(const symbol_callback_t &callback) const override;\\n\\n\\t\\t\\tvirtual void enumerate_files(const file_callback_t &callback) const override;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tstring _path;\\n\\n\\t\\t\\tshared_ptr<dbghelp> _dbghelp;\\n\\n\\t\\t\\tlong_address_t _base;\\n\\n\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\tdbghelp::dbghelp()\\n\\n\\t\\t{\\n\",\n \"file_path\": \"common/src/image_info_win32.cpp\",\n \"rank\": 78,\n \"score\": 134237.5302475882\n },\n {\n \"content\": \"\\tclass thread_callbacks_impl : public thread_callbacks\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tthread_callbacks_impl();\\n\\n\\t\\t~thread_callbacks_impl();\\n\\n\\n\\n\\t\\tvirtual void at_thread_exit(const atexit_t &handler);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef vector<atexit_t> destructors_t;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstatic void invoke_destructors(void *destructors);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tmt::mutex _mutex;\\n\\n\\t\\tlist<destructors_t> _all_destructors;\\n\\n\\t\\tpthread_key_t _thread_destructors;\\n\\n\\t};\\n\\n\\n\",\n \"file_path\": \"mt/src/thread_callbacks_unix.cpp\",\n \"rank\": 79,\n \"score\": 134237.5302475882\n },\n {\n \"content\": \"\\t\\tclass elf_image_info : public image_info\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\telf_image_info(const string &path);\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tvirtual string get_path() const override;\\n\\n\\t\\t\\tvirtual void enumerate_functions(const symbol_callback_t &callback) const override;\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\tstring _path;\\n\\n\\t\\t\\tshared_ptr<const symreader::mapped_region> _image;\\n\\n\\t\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\t\\telf_image_info::elf_image_info(const string &path)\\n\\n\\t\\t\\t: _path(path), _image(symreader::map_file(path.c_str()))\\n\\n\\t\\t{\\n\\n\\t\\t\\tif (!_image->first)\\n\",\n \"file_path\": \"common/src/image_info_unix.cpp\",\n \"rank\": 80,\n \"score\": 134237.5302475882\n },\n {\n \"content\": \"\\t\\t\\tclass running_process_impl : public running_process\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\trunning_process_impl(const string &executable_path, const string &command_line)\\n\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tSTARTUPINFOA si = { };\\n\\n\\t\\t\\t\\t\\tstring path = executable_path;\\n\\n\\t\\t\\t\\t\\tvector<char> cl2(command_line.begin(), command_line.end());\\n\\n\\n\\n\\t\\t\\t\\t\\tif (path.find(\\\".exe\\\") == string::npos)\\n\\n\\t\\t\\t\\t\\t\\tpath += \\\".exe\\\";\\n\\n\\t\\t\\t\\t\\tcl2.push_back(char());\\n\\n\\n\\n\\t\\t\\t\\t\\tsi.cb = sizeof(si);\\n\\n\\t\\t\\t\\t\\tif (!::CreateProcessA(path.c_str(), &cl2[0], NULL, NULL, FALSE, NORMAL_PRIORITY_CLASS , NULL,\\n\\n\\t\\t\\t\\t\\t\\tNULL, &si, &_process))\\n\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tDWORD err = ::GetLastError();\\n\\n\\t\\t\\t\\t\\t\\terr;\\n\\n\\t\\t\\t\\t\\t\\tthrow runtime_error(\\\"Cannot run child process!\\\");\\n\",\n \"file_path\": \"test-helpers/src/process_win32.cpp\",\n \"rank\": 81,\n \"score\": 134237.5302475882\n },\n {\n \"content\": \"\\tclass thread_callbacks_impl : public thread_callbacks\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\tvoid notify_thread_exit() throw();\\n\\n\\n\\n\\t\\tvirtual void at_thread_exit(const atexit_t &handler);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef vector<atexit_t> destructors_t;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tmt::mutex _mutex;\\n\\n\\t\\tlist<destructors_t> _all_destructors;\\n\\n\\t\\tmt::tls<destructors_t> _thread_destructors;\\n\\n\\t};\\n\\n\\n\\n\\n\\n\\n\\n\\tvoid thread_callbacks_impl::notify_thread_exit() throw()\\n\\n\\t{\\n\",\n \"file_path\": \"mt/src/thread_callbacks_win32.cpp\",\n \"rank\": 82,\n \"score\": 134237.5302475882\n },\n {\n \"content\": \"\\t\\t\\tvirtual channel_ptr_t create_session(channel &outbound) = 0;\\n\",\n \"file_path\": \"ipc/endpoint.h\",\n \"rank\": 83,\n \"score\": 134213.6757041122\n },\n {\n \"content\": \"\\t\\tclass lifetime\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tlifetime()\\n\\n\\t\\t\\t\\t: _alive(true)\\n\\n\\t\\t\\t{\\t}\\n\\n\\n\\n\\t\\t\\tvoid mark_destroyed()\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tmt::lock_guard<mt::mutex> l(_mtx);\\n\\n\\n\\n\\t\\t\\t\\t_alive = false;\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\ttemplate <typename F>\\n\\n\\t\\t\\tvoid execute_safe(const F &f)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tmt::lock_guard<mt::mutex> l(_mtx);\\n\\n\\n\\n\\t\\t\\t\\tif (_alive)\\n\",\n \"file_path\": \"ipc/src/lifetime.h\",\n \"rank\": 84,\n \"score\": 133900.64670686063\n },\n {\n \"content\": \"\\t\\tclass lifetime;\\n\\n\\n\",\n \"file_path\": \"ipc/marshalled_server.h\",\n \"rank\": 85,\n \"score\": 133900.64670686063\n },\n {\n \"content\": \"\\t\\tclass lifetime;\\n\\n\\n\",\n \"file_path\": \"ipc/marshalled_session.h\",\n \"rank\": 86,\n \"score\": 133900.64670686063\n },\n {\n \"content\": \"\\t\\t\\tclass response;\\n\\n\\t\\t\\ttypedef unsigned long long token_t;\\n\\n\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tserver_session(channel &outbound, std::shared_ptr<scheduler::queue> queue = std::shared_ptr<scheduler::queue>());\\n\\n\\n\\n\\t\\t\\tvoid set_disconnect_handler(const std::function<void ()> &handler);\\n\\n\\n\\n\\t\\t\\ttemplate <typename F>\\n\\n\\t\\t\\tvoid add_handler(int request_id, const F &handler);\\n\\n\\n\\n\\t\\t\\ttemplate <typename FormatterT>\\n\\n\\t\\t\\tvoid message(int message_id, const FormatterT &message_formatter);\\n\\n\\n\\n\\t\\tprivate:\\n\\n\\t\\t\\ttemplate <typename ArgumentsT, typename U>\\n\\n\\t\\t\\tstruct handler_thunk;\\n\\n\\t\\t\\ttypedef std::function<void (response &response_, deserializer &payload)> handler_t;\\n\\n\\n\\n\\t\\tprivate:\\n\",\n \"file_path\": \"ipc/server_session.h\",\n \"rank\": 87,\n \"score\": 133900.64670686063\n },\n {\n \"content\": \"\\t\\t\\tclass thread_monitor : public micro_profiler::thread_monitor\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tthread_monitor();\\n\\n\\n\\n\\t\\t\\t\\tthread_monitor::thread_id get_id(mt::thread::id tid) const;\\n\\n\\t\\t\\t\\tthread_monitor::thread_id get_this_thread_id() const;\\n\\n\\n\\n\\t\\t\\t\\tvoid add_info(thread_id id, const thread_info &info);\\n\\n\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tthread_id provide_this_id;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tvirtual thread_id register_self() override;\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tunsigned _next_id;\\n\\n\\t\\t\\t\\tcontainers::unordered_map<mt::thread::id, thread_monitor::thread_id> _ids;\\n\\n\\t\\t\\t\\tmutable mt::mutex _mtx;\\n\\n\\t\\t\\t};\\n\\n\\n\\n\\n\",\n \"file_path\": \"collector/tests/mocks.h\",\n \"rank\": 88,\n \"score\": 133775.11610302917\n },\n {\n \"content\": \"\\t\\t\\tclass symbol_resolver : public micro_profiler::symbol_resolver\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\tpublic:\\n\\n\\t\\t\\t\\tsymbol_resolver(std::shared_ptr<tables::modules> modules, std::shared_ptr<tables::module_mappings> mappings);\\n\\n\\n\\n\\t\\t\\t\\tvirtual const std::string &symbol_name_by_va(long_address_t address) const;\\n\\n\\n\\n\\t\\t\\t\\tstatic std::string to_string_address(long_address_t value);\\n\\n\\n\\n\\t\\t\\t\\ttemplate <typename T, size_t n>\\n\\n\\t\\t\\t\\tstatic std::shared_ptr<symbol_resolver> create(T (&symbols)[n]);\\n\\n\\n\\n\\t\\t\\tprivate:\\n\\n\\t\\t\\t\\tmutable containers::unordered_map<long_address_t, std::string> _names;\\n\\n\\t\\t\\t};\\n\\n\\t\\t}\\n\\n\\t}\\n\\n}\\n\",\n \"file_path\": \"frontend/tests/mocks.h\",\n \"rank\": 89,\n \"score\": 133775.11610302917\n },\n {\n \"content\": \"\\tclass process_list : public wpl::richtext_table_model\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef std::function<void (const process::enumerate_callback_t &callback)> process_enumerator_t;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tvoid update(const process_enumerator_t &enumerator);\\n\\n\\n\\n\\t\\tstd::shared_ptr<process> get_process(index_type row) const;\\n\\n\\t\\tvoid set_order(index_type column, bool ascending);\\n\\n\\n\\n\\t\\tvirtual index_type get_count() const throw() override;\\n\\n\\t\\tvirtual void get_text(index_type row, index_type column, agge::richtext_t &text) const override;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttypedef std::vector< std::shared_ptr<process> > process_container_t;\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\ttemplate <typename PredicateT>\\n\\n\\t\\tvoid init_sorter(const PredicateT &p);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstd::vector< std::shared_ptr<process> > _processes;\\n\\n\\t\\tstd::function<void (process_container_t &processes)> _sorter;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"frontend/process_list.h\",\n \"rank\": 90,\n \"score\": 133775.11610302917\n },\n {\n \"content\": \"\\tclass statistics_model_impl : public BaseT, noncopyable\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\ttypedef typename BaseT::index_type index_type;\\n\\n\\t\\ttypedef typename key_traits<typename U::value_type>::key_type key_type;\\n\\n\\n\\n\\tpublic:\\n\\n\\t\\tstatistics_model_impl(std::shared_ptr<U> underlying, double tick_interval_,\\n\\n\\t\\t\\tstd::shared_ptr<symbol_resolver> resolver_, std::shared_ptr<const tables::threads> threads_);\\n\\n\\n\\n\\t\\tstd::shared_ptr<U> get_underlying() const;\\n\\n\\n\\n\\t\\t// wpl::richtext_table_model methods\\n\\n\\t\\tvirtual index_type get_count() const throw() override;\\n\\n\\t\\tvirtual void get_text(index_type item, index_type subitem, agge::richtext_t &text) const override;\\n\\n\\t\\tvirtual std::shared_ptr<const wpl::trackable> track(index_type row) const override;\\n\\n\\n\\n\\t\\t// linked_statistics methods\\n\\n\\t\\tvirtual void fetch() /*override*/;\\n\\n\\t\\tvirtual void set_order(index_type column, bool ascending) /*override*/;\\n\",\n \"file_path\": \"frontend/statistics_model.h\",\n \"rank\": 91,\n \"score\": 133775.11610302917\n },\n {\n \"content\": \"\\tclass image_patch_ui : public wpl::stack\\n\\n\\t{\\n\\n\\tpublic:\\n\\n\\t\\timage_patch_ui(const wpl::factory &factory_, std::shared_ptr<image_patch_model> model,\\n\\n\\t\\t\\tstd::shared_ptr<const tables::patches> patches);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tvoid check_selection(const selection<symbol_key> &selection_);\\n\\n\\n\\n\\tprivate:\\n\\n\\t\\tstd::shared_ptr<image_patch_model> _model;\\n\\n\\t\\tstd::vector<wpl::slot_connection> _connections;\\n\\n\\t\\tstd::unordered_set<symbol_key> _to_apply, _to_revert;\\n\\n\\t};\\n\\n}\\n\",\n \"file_path\": \"frontend/image_patch_ui.h\",\n \"rank\": 92,\n \"score\": 133775.11610302917\n },\n {\n \"content\": \"\\t\\tclass process : public micro_profiler::process\\n\\n\\t\\t{\\n\\n\\t\\tpublic:\\n\\n\\t\\t\\tprocess(unsigned int pid, const string &name_)\\n\\n\\t\\t\\t\\t: _pid(pid), _name(name_), _hprocess(::OpenProcess(rights, FALSE, pid), &::CloseHandle)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tif (!_hprocess)\\n\\n\\t\\t\\t\\t\\tthrow runtime_error(\\\"\\\");\\n\\n\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\tvirtual unsigned get_pid() const\\n\\n\\t\\t\\t{\\treturn _pid;\\t}\\n\\n\\n\\n\\t\\t\\tvirtual string name() const\\n\\n\\t\\t\\t{\\treturn _name;\\t}\\n\\n\\n\\n\\t\\t\\tvirtual void remote_execute(injection_function_t *injection, const_byte_range payload)\\n\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tconst mapped_module m = get_module_info(&g_dummy);\\n\\n\\t\\t\\t\\tconst shared_ptr<void> fpath = foreign_allocate(m.path.size() + 1);\\n\",\n \"file_path\": \"injector/src/process_win32.cpp\",\n \"rank\": 93,\n \"score\": 133775.11610302917\n },\n {\n \"content\": \"\\t\\tstd::size_t operator ()(unsigned int key) const throw();\\n\",\n \"file_path\": \"common/hash.h\",\n \"rank\": 94,\n \"score\": 133601.9436251504\n },\n {\n \"content\": \"\\t\\ttypedef void (injection_function_t)(const_byte_range payload);\\n\",\n \"file_path\": \"injector/process.h\",\n \"rank\": 95,\n \"score\": 133571.5183711627\n },\n {\n \"content\": \"\\t\\tunsigned int id = 0;\\n\",\n \"file_path\": \"common/serialization.h\",\n \"rank\": 96,\n \"score\": 133553.23543054127\n },\n {\n \"content\": \"\\t\\tunsigned int id; // Identifier assigned or existed before for a dormant patch.\\n\",\n \"file_path\": \"patcher/interface.h\",\n \"rank\": 97,\n \"score\": 133553.23543054127\n },\n {\n \"content\": \"\\t\\ttypedef std::function<void (const std::shared_ptr<process> &entry)> enumerate_callback_t;\\n\",\n \"file_path\": \"injector/process.h\",\n \"rank\": 98,\n \"score\": 133303.3979497558\n }\n]","isConversational":false}}},{"rowIdx":496,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"test/ese/src/devlibtest/stat/statunit/movingavg.cxx"},"repo_name":{"kind":"string","value":"ScriptBox99/Extensible-Storage-Engine"},"commit":{"kind":"string","value":"3bcf428c8a041733043e18fd9ae55cffeba307b2"},"file_code":{"kind":"string","value":"\n\n#include \"statunittest.hxx\"\n\n#include \"stat.hxx\"\n\nclass MovingAverageTest : public UNITTEST\n\n{\n private:\n static MovingAverageTest s_instance;\n\n protected:\n MovingAverageTest() {}\n public:\n ~MovingAverageTest() {}\n public:\n const char * SzName() const;\n const char * SzDescription() const;\n\n bool FRunUnderESE98() const;\n bool FRunUnderESENT() const;\n bool FRunUnderESE97() const;\n\n ERR ErrTest();\n};\n\nMovingAverageTest MovingAverageTest::s_instance;\n\nconst char * MovingAverageTest::SzName() const { return \"MovingAverage\"; };\nconst char * MovingAverageTest::SzDescription() const { return \"Tests the statistic libraries' moving average support.\"; }\nbool MovingAverageTest::FRunUnderESE98() const { return true; }\nbool MovingAverageTest::FRunUnderESENT() const { return true; }\nbool MovingAverageTest::FRunUnderESE97() const { return true; }\n\nERR MovingAverageTest::ErrTest()\n\n{\n wprintf( L\"\\tTesting Moving Average support ...\\n\");\n\n #define TestTest( ftest ) if ( !(ftest) ) \\\n { \\\n wprintf(L\" [line=%d] Test( %S ) failed w/ %d\\n\", __LINE__, #ftest, (DWORD)(ftest) ); \\\n STATAssertSz( fFalse, \"HaltTest\" ); \\\n }\n\n printf( \"\\tSingle-sample moving average...\\n\" );\n\n CMovingAverage< ULONG, 1 > avgOneSample( 10 );\n\n TestTest( 10 == avgOneSample.GetLastSample() );\n TestTest( 10 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 12 );\n TestTest( 12 == avgOneSample.GetLastSample() );\n TestTest( 12 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 15 );\n TestTest( 15 == avgOneSample.GetLastSample() );\n TestTest( 15 == avgOneSample.GetAverage() );\n\n avgOneSample.Reset( 20 );\n TestTest( 20 == avgOneSample.GetLastSample() );\n TestTest( 20 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 30 );\n TestTest( 30 == avgOneSample.GetLastSample() );\n TestTest( 30 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 5 );\n TestTest( 5 == avgOneSample.GetLastSample() );\n TestTest( 5 == avgOneSample.GetAverage() );\n\n printf( \"\\tTwo-sample moving average...\\n\" );\n\n CMovingAverage< LONG, 2 > avgTwoSamples( 100 ); \n\n TestTest( 100 == avgTwoSamples.GetLastSample() );\n TestTest( 100 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 50 ); \n TestTest( 50 == avgTwoSamples.GetLastSample() );\n TestTest( 75 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 10 ); \n TestTest( 10 == avgTwoSamples.GetLastSample() );\n TestTest( 30 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 60 ); \n TestTest( 60 == avgTwoSamples.GetLastSample() );\n TestTest( 35 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 80 ); \n TestTest( 80 == avgTwoSamples.GetLastSample() );\n TestTest( 70 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( -30 ); \n TestTest( -30 == avgTwoSamples.GetLastSample() );\n TestTest( 25 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( -10 ); \n TestTest( -10 == avgTwoSamples.GetLastSample() );\n TestTest( -20 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 110 ); \n TestTest( 110 == avgTwoSamples.GetLastSample() );\n TestTest( 50 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.Reset( -30 ); \n TestTest( -30 == avgTwoSamples.GetLastSample() );\n TestTest( -30 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( -40 ); \n TestTest( -40 == avgTwoSamples.GetLastSample() );\n TestTest( -35 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 240 ); \n TestTest( 240 == avgTwoSamples.GetLastSample() );\n TestTest( 100 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 60 ); \n TestTest( 60 == avgTwoSamples.GetLastSample() );\n TestTest( 150 == avgTwoSamples.GetAverage() );\n\n printf( \"\\tFive-sample moving average...\\n\" );\n\n CMovingAverage< INT, 5 > avgFiveSamples( -1000 ); \n\n TestTest( -1000 == avgFiveSamples.GetLastSample() );\n TestTest( -1000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -800 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 500 ); \n TestTest( 500 == avgFiveSamples.GetLastSample() );\n TestTest( -500 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 5000 ); \n TestTest( 5000 == avgFiveSamples.GetLastSample() );\n TestTest( 700 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( -10000 ); \n TestTest( -10000 == avgFiveSamples.GetLastSample() );\n TestTest( -1100 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 1000 ); \n TestTest( 1000 == avgFiveSamples.GetLastSample() );\n TestTest( -700 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 10000 ); \n TestTest( 10000 == avgFiveSamples.GetLastSample() );\n TestTest( 1300 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 5000 ); \n TestTest( 5000 == avgFiveSamples.GetLastSample() );\n TestTest( 2200 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( -100000 );\n TestTest( -100000 == avgFiveSamples.GetLastSample() );\n TestTest( -18800 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.Reset( -10000 ); \n TestTest( -10000 == avgFiveSamples.GetLastSample() );\n TestTest( -10000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -8000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -6000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -4000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -2000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( 0 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 10000 ); \n TestTest( 10000 == avgFiveSamples.GetLastSample() );\n TestTest( 2000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 1000 ); \n TestTest( 1000 == avgFiveSamples.GetLastSample() );\n TestTest( 2200 == avgFiveSamples.GetAverage() );\n\n return JET_errSuccess;\n}\n\n"},"prefix":{"kind":"string","value":"\n\n#include \"statunittest.hxx\"\n\n#include \"stat.hxx\"\n\nclass MovingAverageTest : public UNITTEST\n\n{\n private:\n static MovingAverageTest s_instance;\n\n protected:\n MovingAverageTest() {}\n public:\n ~MovingAverageTest() {}\n public:\n const char * SzName() const;\n const char * SzDescription() const;\n\n bool FRunUnderESE98() const;\n bool FRunUnderESENT() const;\n bool FRunUnderESE97() const;\n\n ERR ErrTest();\n};\n\nMovingAverageTest MovingAverageTest::s_instance;\n\nconst char * MovingAverageTest::SzName() const { return \"MovingAverage\"; };\nconst char * MovingAverageTest::SzDescription() const { return \"Tests the statistic libraries' moving average support.\"; }\nbool MovingAverageTest::FRunUnderESE98() const { return true; }\nbool MovingAverageTest::FRunUnderESENT() const { return true; }\nbool MovingAverageTest::FRunUnderESE97() const { return true; }\n\nERR MovingAverageTest::ErrTest()\n\n{\n wprintf( L\"\\tTesting Moving Average support ...\\n\");\n\n #define TestTest( ftest ) if ( !(ftest) ) \\\n { \\\n wprintf(L\" [line=%d] Test( %S ) failed w/ %d\\n\", __LINE__, #ftest, (DWORD)(ftest) ); \\\n STATAssertSz( fFalse, \"HaltTest\" ); \\\n }\n\n printf( \"\\tSingle-sample moving average...\\n\" );\n\n CMovingAverage< ULONG, 1 > avgOneSample( 10 );\n\n TestTest( 10 == avgOneSample.GetLastSample() );\n TestTest( 10 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 12 );\n TestTest( 12 == avgOneSample.GetLastSample() );\n TestTest( 12 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 15 );\n TestTest( 15 == avgOneSample.GetLastSample() );\n TestTest( 15 == avgOneSample.GetAverage() );\n\n avgOneSample.Reset( 20 );\n TestTest( 20 == avgOneSample.GetLastSample() );\n TestTest( 20 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 30 );\n TestTest( 30 == avgOneSample.GetLastSample() );\n TestTest( 30 == avgOneSample.GetAverage() );\n\n avgOneSample.AddSample( 5 );\n TestTest( 5 == avgOneSample.GetLastSample() );\n TestTest( 5 == avgOneSample.GetAverage() );\n\n printf( \"\\tTwo-sample moving average...\\n\" );\n\n CMovingAverage< LONG, 2 > avgTwoSamples( 100 ); \n\n TestTest( 100 == avgTwoSamples.GetLastSample() );\n TestTest( 100 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 50 ); \n TestTest( 50 == avgTwoSamples.GetLastSample() );\n TestTest( 75 == avgTwoSamples.GetAverag"},"suffix":{"kind":"string","value":"\n\n"},"middle":{"kind":"string","value":"e() );\n\n avgTwoSamples.AddSample( 10 ); \n TestTest( 10 == avgTwoSamples.GetLastSample() );\n TestTest( 30 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 60 ); \n TestTest( 60 == avgTwoSamples.GetLastSample() );\n TestTest( 35 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 80 ); \n TestTest( 80 == avgTwoSamples.GetLastSample() );\n TestTest( 70 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( -30 ); \n TestTest( -30 == avgTwoSamples.GetLastSample() );\n TestTest( 25 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( -10 ); \n TestTest( -10 == avgTwoSamples.GetLastSample() );\n TestTest( -20 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 110 ); \n TestTest( 110 == avgTwoSamples.GetLastSample() );\n TestTest( 50 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.Reset( -30 ); \n TestTest( -30 == avgTwoSamples.GetLastSample() );\n TestTest( -30 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( -40 ); \n TestTest( -40 == avgTwoSamples.GetLastSample() );\n TestTest( -35 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 240 ); \n TestTest( 240 == avgTwoSamples.GetLastSample() );\n TestTest( 100 == avgTwoSamples.GetAverage() );\n\n avgTwoSamples.AddSample( 60 ); \n TestTest( 60 == avgTwoSamples.GetLastSample() );\n TestTest( 150 == avgTwoSamples.GetAverage() );\n\n printf( \"\\tFive-sample moving average...\\n\" );\n\n CMovingAverage< INT, 5 > avgFiveSamples( -1000 ); \n\n TestTest( -1000 == avgFiveSamples.GetLastSample() );\n TestTest( -1000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -800 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 500 ); \n TestTest( 500 == avgFiveSamples.GetLastSample() );\n TestTest( -500 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 5000 ); \n TestTest( 5000 == avgFiveSamples.GetLastSample() );\n TestTest( 700 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( -10000 ); \n TestTest( -10000 == avgFiveSamples.GetLastSample() );\n TestTest( -1100 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 1000 ); \n TestTest( 1000 == avgFiveSamples.GetLastSample() );\n TestTest( -700 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 10000 ); \n TestTest( 10000 == avgFiveSamples.GetLastSample() );\n TestTest( 1300 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 5000 ); \n TestTest( 5000 == avgFiveSamples.GetLastSample() );\n TestTest( 2200 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( -100000 );\n TestTest( -100000 == avgFiveSamples.GetLastSample() );\n TestTest( -18800 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.Reset( -10000 ); \n TestTest( -10000 == avgFiveSamples.GetLastSample() );\n TestTest( -10000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -8000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -6000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -4000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( -2000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 0 ); \n TestTest( 0 == avgFiveSamples.GetLastSample() );\n TestTest( 0 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 10000 ); \n TestTest( 10000 == avgFiveSamples.GetLastSample() );\n TestTest( 2000 == avgFiveSamples.GetAverage() );\n\n avgFiveSamples.AddSample( 1000 ); \n TestTest( 1000 == avgFiveSamples.GetLastSample() );\n TestTest( 2200 == avgFiveSamples.GetAverage() );\n\n return JET_errSuccess;\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":497,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"app/DiskFSTree.cpp"},"repo_name":{"kind":"string","value":"Toysoft/ciderpress"},"commit":{"kind":"string","value":"640959dad551ba75a48bd3c49629579730ead351"},"file_code":{"kind":"string","value":"\r\n#include \"StdAfx.h\"\r\n#include \"DiskFSTree.h\"\r\n#include \"ChooseAddTargetDialog.h\"\r\n#include \"../reformat/Charset.h\"\r\n\r\nusing namespace DiskImgLib;\r\n\r\nbool DiskFSTree::BuildTree(DiskFS* pDiskFS, CTreeCtrl* pTree)\r\n{\r\n ASSERT(pDiskFS != NULL);\r\n ASSERT(pTree != NULL);\r\n\r\n pTree->SetImageList(&fTreeImageList, TVSIL_NORMAL);\r\n return AddDiskFS(pTree, TVI_ROOT, pDiskFS, 1);\r\n}\r\n\r\nbool DiskFSTree::AddDiskFS(CTreeCtrl* pTree, HTREEITEM parent,\r\n DiskImgLib::DiskFS* pDiskFS, int depth)\r\n{\r\n const DiskFS::SubVolume* pSubVol;\r\n TargetData* pTarget;\r\n HTREEITEM hLocalRoot;\r\n TVITEM tvi;\r\n TVINSERTSTRUCT tvins;\r\n\r\n \r\n pTarget = AllocTargetData();\r\n pTarget->kind = kTargetDiskFS;\r\n pTarget->pDiskFS = pDiskFS;\r\n pTarget->pFile = NULL; \n tvi.mask = TVIF_TEXT | TVIF_IMAGE | TVIF_SELECTEDIMAGE | TVIF_PARAM;\r\n CString volumeId(Charset::ConvertMORToUNI(pDiskFS->GetVolumeID()));\r\n int index = fStringHolder.Add(volumeId);\r\n tvi.pszText = (LPWSTR)(LPCWSTR) fStringHolder.GetAt(index);\r\n tvi.cchTextMax = 0; \n\n if (pDiskFS->GetReadWriteSupported() && !pDiskFS->GetFSDamaged()) {\r\n tvi.iImage = kTreeImageHardDriveRW;\r\n pTarget->selectable = true;\r\n } else {\r\n tvi.iImage = kTreeImageHardDriveRO;\r\n pTarget->selectable = false;\r\n }\r\n tvi.iSelectedImage = tvi.iImage;\r\n tvi.lParam = (LPARAM) pTarget;\r\n tvins.item = tvi;\r\n tvins.hInsertAfter = parent;\r\n tvins.hParent = parent;\r\n hLocalRoot = pTree->InsertItem(&tvins);\r\n if (hLocalRoot == NULL) {\r\n LOGW(\"Tree root InsertItem failed\");\r\n return false;\r\n }\r\n\r\n \r\n pSubVol = pDiskFS->GetNextSubVolume(NULL);\r\n while (pSubVol != NULL) {\r\n if (!AddDiskFS(pTree, hLocalRoot, pSubVol->GetDiskFS(), depth+1))\r\n return false;\r\n\r\n pSubVol = pDiskFS->GetNextSubVolume(pSubVol);\r\n }\r\n\r\n \r\n if (fIncludeSubdirs && pDiskFS->GetReadWriteSupported() &&\r\n !pDiskFS->GetFSDamaged())\r\n {\r\n AddSubdir(pTree, hLocalRoot, pDiskFS, NULL, depth);\r\n }\r\n\r\n \r\n if (fExpandDepth == -1 || depth <= fExpandDepth)\r\n pTree->Expand(hLocalRoot, TVE_EXPAND);\r\n\r\n \r\n if (parent == TVI_ROOT) {\r\n pTree->Select(hLocalRoot, TVGN_CARET);\r\n }\r\n\r\n return true;\r\n}\r\n\r\nDiskImgLib::A2File* DiskFSTree::AddSubdir(CTreeCtrl* pTree, HTREEITEM parent,\r\n DiskImgLib::DiskFS* pDiskFS, DiskImgLib::A2File* pParentFile,\r\n int depth)\r\n{\r\n A2File* pFile;\r\n TargetData* pTarget;\r\n HTREEITEM hLocalRoot;\r\n TVITEM tvi;\r\n TVINSERTSTRUCT tvins;\r\n\r\n pFile = pDiskFS->GetNextFile(pParentFile);\r\n if (pFile == NULL && pParentFile == NULL) {\r\n \r\n \r\n return NULL;\r\n }\r\n\r\n if (pParentFile == NULL) {\r\n \r\n if (pFile->IsVolumeDirectory()) {\r\n pParentFile = pFile;\r\n pFile = pDiskFS->GetNextFile(pFile);\r\n }\r\n hLocalRoot = parent;\r\n } else {\r\n \r\n pTarget = AllocTargetData();\r\n pTarget->kind = kTargetSubdir;\r\n pTarget->selectable = true;\r\n pTarget->pDiskFS = pDiskFS;\r\n pTarget->pFile = pParentFile;\r\n tvi.mask = TVIF_TEXT | TVIF_IMAGE | TVIF_SELECTEDIMAGE | TVIF_PARAM;\r\n CString fileNameW(pParentFile->GetFileName());\r\n int index = fStringHolder.Add(fileNameW);\r\n tvi.pszText = (LPWSTR)(LPCWSTR) fStringHolder.GetAt(index);\r\n tvi.cchTextMax = 0; \n tvi.iImage = kTreeImageFolderClosed;\r\n tvi.iSelectedImage = kTreeImageFolderOpen;\r\n tvi.lParam = (LPARAM) pTarget;\r\n tvins.item = tvi;\r\n tvins.hInsertAfter = parent;\r\n tvins.hParent = parent;\r\n hLocalRoot = pTree->InsertItem(&tvins);\r\n if (hLocalRoot == NULL) {\r\n LOGW(\"Tree insert '%ls' failed\", tvi.pszText);\r\n return NULL;\r\n }\r\n }\r\n\r\n while (pFile != NULL) {\r\n if (pFile->IsDirectory()) {\r\n ASSERT(!pFile->IsVolumeDirectory());\r\n\r\n if (pFile->GetParent() == pParentFile) {\r\n \r\n pFile = AddSubdir(pTree, hLocalRoot, pDiskFS, pFile, depth+1);\r\n if (pFile == NULL)\r\n break; \n } else {\r\n \r\n break; \n }\r\n } else {\r\n pFile = pDiskFS->GetNextFile(pFile);\r\n }\r\n }\r\n\r\n \r\n if (fExpandDepth == -1 || depth <= fExpandDepth)\r\n pTree->Expand(hLocalRoot, TVE_EXPAND);\r\n\r\n return pFile;\r\n}\r\n\r\nDiskFSTree::TargetData* DiskFSTree::AllocTargetData(void)\r\n{\r\n TargetData* pNew = new TargetData;\r\n\r\n if (pNew == NULL)\r\n return NULL;\r\n\r\n \r\n pNew->pNext = fpTargetData;\r\n fpTargetData = pNew;\r\n\r\n return pNew;\r\n}\r\n\r\nvoid DiskFSTree::FreeAllTargetData(void)\r\n{\r\n TargetData* pTarget;\r\n TargetData* pNext;\r\n\r\n pTarget = fpTargetData;\r\n while (pTarget != NULL) {\r\n pNext = pTarget->pNext;\r\n delete pTarget;\r\n pTarget = pNext;\r\n }\r\n\r\n fpTargetData = NULL;\r\n}\r\n"},"prefix":{"kind":"string","value":"\r\n#include \"StdAfx.h\"\r\n#include \"DiskFSTree.h\"\r\n#include \"ChooseAddTargetDialog.h\"\r\n#include \"../reformat/Charset.h\"\r\n\r\nusing namespace DiskImgLib;\r\n\r\nbool DiskFSTree::BuildTree(DiskFS* pDiskFS, CTreeCtrl* pTree)\r\n{\r\n ASSERT(pDiskFS != NULL);\r\n ASSERT(pTree != NULL);\r\n\r\n pTree->SetImageList(&fTreeImageList, TVSIL_NORMAL);\r\n return AddDiskFS(pTree, TVI_ROOT, pDiskFS, 1);\r\n}\r\n\r\nbool DiskFSTree::AddDiskFS(CTreeCtrl* pTree, HTREEITEM parent,\r\n DiskImgLib::DiskFS* pDiskFS, int depth)\r\n{\r\n const DiskFS::SubVolume* pSubVol;\r\n TargetData* pTarget;\r\n HTREEITEM hLocalRoot;\r\n TVITEM tvi;\r\n TVINSERTSTRUCT tvins;\r\n\r\n \r\n pTarget = AllocTargetData();\r\n pTarget->kind = kTargetDiskFS;\r\n pTarget->pDiskFS = pDiskFS;\r\n pTarget->pFile = NULL; \n tvi.mask = TVIF_TEXT | TVIF_IMAGE | TVIF_SELECTEDIMAGE | TVIF_PARAM;\r\n CString volumeId(Charset::ConvertMORToUNI(pDiskFS->GetVolumeID()));\r\n int index = fStringHolder.Add(volumeId);\r\n tvi.pszText = (LPWSTR)(LPCWSTR) fStringHolder.GetAt(index);\r\n tvi.cchTextMax = 0; \n\n if (pDiskFS->GetReadWriteSupported() && !pDiskFS->GetFSDamaged()) {\r\n tvi.iImage = kTreeImageHardDriveRW;\r\n pTarget->selectable = true;\r\n } else {\r\n tvi.iImage = kTreeImageHardDriveRO;\r\n pTarget->selectable = false;\r\n }\r\n tvi.iSelectedImage = tvi.iImage;\r\n tvi.lParam = (LPARAM) pTarget;\r\n tvins.item = tvi;\r\n tvins.hInsertAfter = parent;\r\n tvins.hParent = parent;\r\n hLocalRoot = pTree->InsertItem(&tvins);\r\n if (hLocalRoot == NULL) {\r\n LOGW(\"Tree root InsertItem failed\");\r\n return false;\r\n }\r\n\r\n \r\n pSubVol = pDiskFS->GetNextSubVolume(NULL);\r\n while (pSubVol != NULL) {\r\n if (!AddDiskFS(pTree, hLocalRoot, pSubVol->GetDiskFS(), depth+1))\r\n return false;\r\n\r\n pSubVol = pDiskFS->GetNextSubVolume(pSubVol);\r\n }\r\n\r\n \r\n if (fIncludeSubdirs && pDiskFS->GetReadWriteSupported() &&\r\n !pDiskFS->GetFSDamaged())\r\n {\r\n AddSubdir(pTree, hLocalRoot, pDiskFS, NULL, depth);\r\n }\r\n\r\n \r\n if (fExpandDepth == -1 || depth <= fExpandDepth)\r\n pTree->Expand(hLocalRoot, TVE_EXPAND);\r\n\r\n \r\n if (parent == TVI_ROOT) {\r\n pTree->Select(hLocalRoot, TVGN_CARET);\r\n }\r\n\r\n return true;\r\n}\r\n\r\nDiskImgLib::A2File* DiskFSTree::AddSubdir(CTreeCtrl* pTree, HTREEITEM parent,\r\n DiskImgLib::DiskFS* pDiskFS, DiskImgLib::A2File* pParentFile,\r\n int depth)\r\n{\r\n A2File* pFile;\r\n TargetData* pTarget;\r\n HTREEITEM hLocalRoot;\r\n TVITEM tvi;\r\n TVINSERTSTRUCT tvins;\r\n\r\n pFile = pDiskFS->GetNextFile(pParentFile);\r\n if (pFile == NULL && pParentFile == NULL) {\r\n \r\n \r\n return NULL;\r\n }\r\n\r\n if (pParentFile == NULL) {\r\n \r\n if (pFile->IsVolumeDirectory()) {\r\n pParentFile = pFile;\r\n pFile = pDiskFS->GetNextFile(pFile);\r\n }\r\n hLocalRoot = parent;\r\n } else {\r\n \r\n pTarget = AllocTargetData();\r\n pTarget->kind = kTargetSubdir;\r\n pTarget->selectable = true;\r\n pTarget->pDiskFS = pDiskFS;\r\n pTarget->pFile = pParentFile;\r\n tvi.mask = TVIF_TEXT | TVIF_IMAGE | TVIF_SELECTEDIMAGE | TVIF_PARAM;\r\n CString fileNameW(pParentFile->GetFileName());\r\n int index = fStringHolder.Add(fileNameW);\r\n tvi.pszText = (LPWSTR)(LPCWSTR) fStringHolder.GetAt(index);\r\n tvi.cchTextMax = 0; \n tvi.iImage = kTreeImageFolderClosed;\r\n tvi.iSelectedImage = kTreeImageFolderOpen;\r\n tvi.lParam = (LPARAM) pTarget;\r\n tvins.item = tvi;\r\n tvins.hInsertAfter = parent;\r\n tvins.hParent = parent;\r\n hLocalRoot = pTree->InsertItem(&tvins);\r\n if (hLocalRoot == NULL) {\r\n LOGW(\"Tree insert '%ls' failed\", tvi.pszText);\r\n return NULL;\r\n }\r\n }\r\n\r\n while (pFile != NULL) {\r\n if (pFile->IsDirectory()) {\r\n ASSERT(!pFile->IsVolumeDirectory());\r\n\r\n if (pFile->GetParent() == pParentFile) {\r\n \r\n pFile = AddSubdir(pTree, hLocalRoot, pDiskFS, pFile, depth+1);\r\n if (pFile == NULL)\r\n break; \n } else {\r\n \r\n break; \n }\r\n } else {\r\n pFile = pDiskFS->GetNextFile(pFile);\r\n }\r\n }\r\n\r\n \r\n if (fExpandDepth == -1 || depth <= fExpandDepth)\r\n pTree->Expand(hLocalRoot, TVE_EXPAND);\r\n\r\n return pFile;\r\n}\r\n\r\n"},"suffix":{"kind":"string","value":"\r\n\r\nvoid DiskFSTree::FreeAllTargetData(void)\r\n{\r\n TargetData* pTarget;\r\n TargetData* pNext;\r\n\r\n pTarget = fpTargetData;\r\n while (pTarget != NULL) {\r\n pNext = pTarget->pNext;\r\n delete pTarget;\r\n pTarget = pNext;\r\n }\r\n\r\n fpTargetData = NULL;\r\n}\r\n"},"middle":{"kind":"string","value":"DiskFSTree::TargetData* DiskFSTree::AllocTargetData(void)\r\n{\r\n TargetData* pNew = new TargetData;\r\n\r\n if (pNew == NULL)\r\n return NULL;\r\n\r\n \r\n pNew->pNext = fpTargetData;\r\n fpTargetData = pNew;\r\n\r\n return pNew;\r\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":" uch depth[2*L_CODES+1];\n","file_path":"zlib/deflate.h","rank":0,"score":93639.98853513303},{"content":" uInt insert; /* bytes at end of window left to insert */\n","file_path":"zlib/deflate.h","rank":1,"score":93630.98532131276},{"content":"local int build_bl_tree(s)\n","file_path":"zlib/trees.c","rank":2,"score":93608.07720701321},{"content":"local int gz_avail(state)\n","file_path":"zlib/gzread.c","rank":3,"score":93605.356769784},{"content":"local int gz_init(state)\n","file_path":"zlib/gzwrite.c","rank":4,"score":93602.05526818347},{"content":"local int updatewindow OF((z_streamp strm, const unsigned char FAR *end,\n","file_path":"zlib/inflate.c","rank":5,"score":93596.13390992681},{"content":"local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size));\n","file_path":"zlib/deflate.c","rank":6,"score":93596.13390992681},{"content":"#define true (!false)\n\n\n\n\n","file_path":"nufxlib/samples/ImgConv.c","rank":7,"score":89928.77524166822},{"content":"class UseSelectionDialog : public CDialog {\n\npublic:\n\n UseSelectionDialog(int selCount, CWnd* pParentWnd = NULL, int rsrcID = IDD_USE_SELECTION) :\n\n CDialog(rsrcID, pParentWnd), fSelectedCount(selCount)\n\n {\n\n // init values; these should be overridden before DoModal\n\n fFilesToAction = 0;\n\n }\n\n virtual ~UseSelectionDialog(void) {}\n\n\n\n // set up dialog parameters; must be called before DoModal\n\n void Setup(int titleID, int okLabelID, int countID, int countsID,\n\n int allID)\n\n {\n\n fTitleID = titleID;\n\n fOkLabelID = okLabelID;\n\n fSelCountID = countID;\n\n fSelCountsID = countsID;\n\n fAllID = allID;\n\n }\n","file_path":"app/UseSelectionDialog.h","rank":8,"score":59595.161554119884},{"content":"// The filter index is saved in the registry, so if you reorder this list\n\n// you will briefly annoy existing users.\n\nenum FilterIndex {\n\n kFilterIndexFIRST = 1, // first index, must be non-Generic\n\n kFilterIndexNuFX = 1,\n\n kFilterIndexBinaryII = 2,\n\n kFilterIndexACU = 3,\n\n kFilterIndexAppleSingle = 4,\n\n kFilterIndexDiskImage = 5,\n\n kFilterIndexLASTNG = 5, // last non-Generic index\n\n\n\n kFilterIndexGeneric = 6, // *.* filter used\n\n kFilterIndexMAX = 6 // highest valid number\n\n};\n\n\n","file_path":"app/Main.h","rank":9,"score":55458.328233552515},{"content":"\n\n enum { kActionSelection = 0, kActionAll = 1 };\n\n int fFilesToAction;\n\n\n\nprotected:\n\n virtual BOOL OnInitDialog(void) override;\n\n virtual void DoDataExchange(CDataExchange* pDX) override;\n\n\n\n afx_msg BOOL OnHelpInfo(HELPINFO* lpHelpInfo) {\n\n return MyApp::HandleHelpInfo(lpHelpInfo);\n\n }\n\n\n\nprivate:\n\n int fSelectedCount;\n\n\n\n /* dialog parameters */\n\n int fTitleID;\n\n int fOkLabelID;\n\n int fSelCountID;\n\n int fSelCountsID;\n\n int fAllID;\n\n\n\n DECLARE_MESSAGE_MAP()\n\n};\n\n\n\n#endif /*APP_USESELECTIONDIALOG_H*/\n","file_path":"app/UseSelectionDialog.h","rank":10,"score":55451.57734176381},{"content":"/*\n\n * CiderPress\n\n * Copyright (C) 2007 by faddenSoft, LLC. All Rights Reserved.\n\n * See the file LICENSE for distribution terms.\n\n */\n\n/*\n\n * Acknowledge and clarify a request to do something, e.g. delete files.\n\n */\n\n#ifndef APP_USESELECTIONDIALOG_H\n\n#define APP_USESELECTIONDIALOG_H\n\n\n\n#include \"resource.h\"\n\n\n\n/*\n\n * Straightforward confirmation.\n\n */\n","file_path":"app/UseSelectionDialog.h","rank":11,"score":55443.72347069881},{"content":"/*\n\n * CiderPress\n\n * Copyright (C) 2007 by faddenSoft, LLC. All Rights Reserved.\n\n * See the file LICENSE for distribution terms.\n\n */\n\n#include \"stdafx.h\"\n\n#include \"UseSelectionDialog.h\"\n\n\n\nBEGIN_MESSAGE_MAP(UseSelectionDialog, CDialog)\n\n ON_WM_HELPINFO()\n\n //ON_COMMAND(IDHELP, OnHelp)\n\nEND_MESSAGE_MAP()\n\n\n\n\n\nBOOL UseSelectionDialog::OnInitDialog(void)\n\n{\n\n CString str;\n\n CString selStr;\n\n CWnd* pWnd;\n\n\n","file_path":"app/UseSelectionDialog.cpp","rank":12,"score":53201.7114220574},{"content":" CheckedLoadString(&str, fTitleID);\n\n SetWindowText(str);\n\n\n\n pWnd = GetDlgItem(IDC_USE_ALL);\n\n ASSERT(pWnd != NULL);\n\n CheckedLoadString(&str, fAllID);\n\n pWnd->SetWindowText(str);\n\n\n\n pWnd = GetDlgItem(IDOK);\n\n ASSERT(pWnd != NULL);\n\n CheckedLoadString(&str, fOkLabelID);\n\n pWnd->SetWindowText(str);\n\n\n\n return TRUE;\n\n}\n\n\n\nvoid UseSelectionDialog::DoDataExchange(CDataExchange* pDX)\n\n{\n\n DDX_Radio(pDX, IDC_USE_SELECTED, fFilesToAction);\n\n}\n","file_path":"app/UseSelectionDialog.cpp","rank":13,"score":53200.5552312211},{"content":" CDialog::OnInitDialog();\n\n\n\n /* grab the radio button with the selection count */\n\n pWnd = GetDlgItem(IDC_USE_SELECTED);\n\n ASSERT(pWnd != NULL);\n\n\n\n /* set the string using a string table entry */\n\n if (fSelectedCount == 1) {\n\n CheckedLoadString(&str, fSelCountID);\n\n pWnd->SetWindowText(str);\n\n } else {\n\n CheckedLoadString(&str, fSelCountsID);\n\n selStr.Format((LPCWSTR) str, fSelectedCount);\n\n pWnd->SetWindowText(selStr);\n\n\n\n if (fSelectedCount == 0)\n\n pWnd->EnableWindow(FALSE);\n\n }\n\n\n\n /* set the other strings */\n","file_path":"app/UseSelectionDialog.cpp","rank":14,"score":53194.3031891208},{"content":"int n_insert(node *np, byte *record, unsigned int *reclen)\n\n{\n\n /* check for free space */\n\n\n\n if (np->nd.ndNRecs >= HFS_MAX_NRECS ||\n\n *reclen + 2 > NODEFREE(*np))\n\n return split(np, record, reclen);\n\n\n\n n_insertx(np, record, *reclen);\n\n *reclen = 0;\n\n\n\n return bt_putnode(np);\n","file_path":"diskimg/libhfs/node.c","rank":15,"score":49215.98589065552},{"content":"void n_index(const node *np, byte *record, unsigned int *reclen)\n\n{\n\n const byte *key = HFS_NODEREC(*np, 0);\n\n\n\n if (np->bt == &np->bt->f.vol->cat)\n\n {\n\n /* force the key length to be 0x25 */\n\n\n\n HFS_SETKEYLEN(record, 0x25);\n\n memset(record + 1, 0, 0x25);\n\n memcpy(record + 1, key + 1, HFS_RECKEYLEN(key));\n\n }\n\n else\n\n memcpy(record, key, HFS_RECKEYSKIP(key));\n\n\n\n d_putul(HFS_RECDATA(record), np->nnum);\n\n\n\n if (reclen)\n\n *reclen = HFS_RECKEYSKIP(record) + 4;\n","file_path":"diskimg/libhfs/node.c","rank":16,"score":49204.8905500282},{"content":"void n_index(const node *, byte *, unsigned int *);\n","file_path":"diskimg/libhfs/node.h","rank":17,"score":49197.62585950512},{"content":"int n_insert(node *, byte *, unsigned int *);\n","file_path":"diskimg/libhfs/node.h","rank":18,"score":49196.449760267584},{"content":"#define IDS_FAILED 111\n","file_path":"mdc/resource.h","rank":19,"score":49194.13442054864},{"content":"#define IDS_FAILED 2023\n","file_path":"app/resource.h","rank":20,"score":49194.13442054864},{"content":" uint16_t used; /* mark as uninteresting */\n","file_path":"nufxlib/NufxLib.h","rank":21,"score":49192.08519711983},{"content":"#define IDC_USE_ALL 1193\n","file_path":"app/resource.h","rank":22,"score":49185.50694918639},{"content":" ULongInt\tbthRoot;\t/* number of root node */\n","file_path":"diskimg/libhfs/apple.h","rank":23,"score":47422.7777028922},{"content":"int bt_insert(btree *bt, const byte *record, unsigned int reclen)\n\n{\n\n node root;\n\n byte newrec[HFS_MAX_RECLEN];\n\n\n\n if (bt->hdr.bthRoot == 0)\n\n {\n\n /* create root node */\n\n\n\n n_init(&root, bt, ndLeafNode, 1);\n\n if (n_new(&root) == -1 ||\n\n\t bt_putnode(&root) == -1)\n\n\tgoto fail;\n\n\n\n bt->hdr.bthDepth = 1;\n\n bt->hdr.bthRoot = root.nnum;\n\n bt->hdr.bthFNode = root.nnum;\n\n bt->hdr.bthLNode = root.nnum;\n\n\n\n bt->flags |= HFS_BT_UPDATE_HDR;\n\n }\n\n else if (bt_getnode(&root, bt, bt->hdr.bthRoot) == -1)\n\n goto fail;\n\n\n\n memcpy(newrec, record, reclen);\n\n\n\n if (insertx(&root, newrec, &reclen) == -1)\n\n goto fail;\n\n\n\n if (reclen)\n\n {\n\n byte oroot[HFS_MAX_RECLEN];\n\n unsigned int orootlen;\n\n\n\n /* root node was split; create a new root */\n\n\n\n n_index(&root, oroot, &orootlen);\n\n\n\n n_init(&root, bt, ndIndxNode, root.nd.ndNHeight + 1);\n\n if (n_new(&root) == -1)\n\n\tgoto fail;\n\n\n\n ++bt->hdr.bthDepth;\n\n bt->hdr.bthRoot = root.nnum;\n\n\n\n bt->flags |= HFS_BT_UPDATE_HDR;\n\n\n\n /* insert index records for new root */\n\n\n\n n_search(&root, oroot);\n\n n_insertx(&root, oroot, orootlen);\n\n\n\n n_search(&root, newrec);\n\n n_insertx(&root, newrec, reclen);\n\n\n\n if (bt_putnode(&root) == -1)\n\n\tgoto fail;\n\n }\n\n\n\n ++bt->hdr.bthNRecs;\n\n bt->flags |= HFS_BT_UPDATE_HDR;\n\n\n\n return 0;\n\n\n\nfail:\n\n return -1;\n","file_path":"diskimg/libhfs/btree.c","rank":24,"score":47421.15068864529},{"content":" ULONG ReturnCode; \n","file_path":"diskimg/CP_ntddscsi.h","rank":25,"score":47416.15710403755},{"content":" UInteger\tbthDepth;\t/* current depth of tree */\n","file_path":"diskimg/libhfs/apple.h","rank":26,"score":47415.53123454727},{"content":"int bt_insert(btree *, const byte *, unsigned int);\n","file_path":"diskimg/libhfs/btree.h","rank":27,"score":47413.81388897092},{"content":"#define IDC_CASSIMPTARG_INT 1422\n","file_path":"app/resource.h","rank":28,"score":47404.375635465876},{"content":"#define IDC_USE_SELECTED 1192\n","file_path":"app/resource.h","rank":29,"score":47403.2675912085},{"content":"#define IDD_USE_SELECTION 147\n","file_path":"app/resource.h","rank":30,"score":47403.2675912085},{"content":" Boolean used;\n","file_path":"nufxlib/NufxLibPriv.h","rank":31,"score":47403.2675912085},{"content":" LongInt\tdrLsMod;\t/* date and time of last modification */\n","file_path":"diskimg/libhfs/apple.h","rank":32,"score":45758.10966192414},{"content":"#define IDC_ADDFILES_INCLUDE_SUBFOLDERS 1180\n","file_path":"app/resource.h","rank":33,"score":45757.50567782844},{"content":"#define IDS_NLIST_DATA_FAILED 2149\n","file_path":"app/resource.h","rank":34,"score":45753.694970172844},{"content":"#define FAIL_BAD gSuppressError = false;\n\n\n\n\n","file_path":"nufxlib/samples/TestBasic.c","rank":35,"score":45753.694970172844},{"content":"#define IDS_DEFILE_OPEN_FAILED 2049\n","file_path":"app/resource.h","rank":36,"score":45753.694970172844},{"content":"#define IDS_DEFILE_FIND_FAILED 2047\n","file_path":"app/resource.h","rank":37,"score":45753.694970172844},{"content":"#define FAIL_OK gSuppressError = true;\n","file_path":"nufxlib/samples/TestBasic.c","rank":38,"score":45753.694970172844},{"content":"static NuError Nu_ResetUsedFlags(NuArchive* pArchive, NuRecordSet* pRecordSet)\n\n{\n\n NuError err = kNuErrNone;\n\n NuRecord* pRecord;\n\n\n\n pRecord = Nu_RecordSet_GetListHead(pRecordSet);\n\n while (pRecord != NULL) {\n\n err = Nu_RecordResetUsedFlags(pArchive, pRecord);\n\n if (err != kNuErrNone) {\n\n Assert(0);\n\n break;\n\n }\n\n\n\n pRecord = pRecord->pNext;\n\n }\n\n\n\n return err;\n","file_path":"nufxlib/Deferred.c","rank":39,"score":45751.84154784641},{"content":" BOOLEAN UseDiskDump;\n","file_path":"diskimg/CP_ntddscsi.h","rank":40,"score":45745.67086937868},{"content":"#define kFlagUseTmp (1 << 4)\n\n\n\n\n","file_path":"nufxlib/samples/Launder.c","rank":41,"score":45745.67086937868},{"content":"#define IDH_USE_ALL 1193\n","file_path":"app/Help/PopUpIds.h","rank":42,"score":45745.67086937868},{"content":" BOOLEAN AdapterUsesPio;\n","file_path":"diskimg/CP_ntddscsi.h","rank":43,"score":45745.67086937868},{"content":"NuError Nu_HeaderIOFailed(NuArchive* pArchive, FILE* fp)\n\n{\n\n if (feof(fp) || ferror(fp))\n\n return kNuErrFile;\n\n else\n\n return kNuErrNone;\n","file_path":"nufxlib/ArchiveIO.c","rank":44,"score":44207.83604868612},{"content":"static NuError Nu_RecordResetUsedFlags(NuArchive* pArchive, NuRecord* pRecord)\n\n{\n\n NuThread* pThread;\n\n long idx;\n\n\n\n Assert(pArchive != NULL);\n\n Assert(pRecord != NULL);\n\n\n\n /* these should already be clear */\n\n if (pRecord->pThreadMods) {\n\n Assert(0);\n\n return kNuErrInternal;\n\n }\n\n\n\n /* these might still be set */\n\n for (idx = 0; idx < (long)pRecord->recTotalThreads; idx++) {\n\n pThread = Nu_GetThread(pRecord, idx);\n\n Assert(pThread != NULL);\n\n\n\n pThread->used = false;\n\n }\n\n\n\n /* and this */\n\n pRecord->dirtyHeader = false;\n\n\n\n return kNuErrNone;\n","file_path":"nufxlib/Deferred.c","rank":45,"score":44205.5734005915},{"content":"#define IDH_CASSIMPTARG_INT 1422\n","file_path":"app/Help/PopUpIds.h","rank":46,"score":44201.11622477282},{"content":"#define IDH_USE_SELECTED 1192\n","file_path":"app/Help/PopUpIds.h","rank":47,"score":44200.08305447269},{"content":"#define IDH_ADDFILES_INCLUDE_SUBFOLDERS 1180\n","file_path":"app/Help/PopUpIds.h","rank":48,"score":42766.5832459142},{"content":"NuError Nu_HeaderIOFailed(NuArchive* pArchive, FILE* fp);\n","file_path":"nufxlib/NufxLibPriv.h","rank":49,"score":42763.021623754845},{"content":"class RecompressOptionsDialog : public UseSelectionDialog {\n\npublic:\n\n RecompressOptionsDialog(int selCount, CWnd* pParentWnd = NULL) :\n\n UseSelectionDialog(selCount, pParentWnd, IDD_RECOMPRESS_OPTS)\n\n {\n\n fCompressionType = 0;\n\n }\n\n virtual ~RecompressOptionsDialog(void) {}\n\n\n\n // maps directly to NuThreadFormat enum\n\n int fCompressionType;\n\n\n\nprivate:\n\n virtual BOOL OnInitDialog(void) override;\n\n virtual void DoDataExchange(CDataExchange* pDX) override;\n\n\n\n /*\n\n * Load strings into the combo box. Only load formats supported by the\n\n * NufxLib DLL.\n\n *\n","file_path":"app/RecompressOptionsDialog.h","rank":50,"score":42755.52201534079},{"content":"class ConvFileOptionsDialog : public UseSelectionDialog {\n\npublic:\n\n ConvFileOptionsDialog(int selCount, CWnd* pParentWnd = NULL) :\n\n UseSelectionDialog(selCount, pParentWnd, IDD_CONVFILE_OPTS)\n\n {\n\n fPreserveEmptyFolders = FALSE;\n\n }\n\n virtual ~ConvFileOptionsDialog(void) {}\n\n\n\n //BOOL fConvDOSText;\n\n //BOOL fConvPascalText;\n\n BOOL fPreserveEmptyFolders;\n\n\n\nprivate:\n\n virtual void DoDataExchange(CDataExchange* pDX) override;\n\n\n\n //DECLARE_MESSAGE_MAP()\n\n};\n\n\n\n#endif /*APP_CONFFILEOPTIONSDIALOG_H*/\n","file_path":"app/ConvFileOptionsDialog.h","rank":51,"score":40132.2897421687},{"content":"class ConvDiskOptionsDialog : public UseSelectionDialog {\n\npublic:\n\n ConvDiskOptionsDialog(int selCount, CWnd* pParentWnd = NULL) :\n\n UseSelectionDialog(selCount, pParentWnd, IDD_CONVDISK_OPTS)\n\n {\n\n fDiskSizeIdx = 0;\n\n //fAllowLower = fSparseAlloc = FALSE;\n\n fVolName = L\"NEW.DISK\";\n\n fNumBlocks = -1;\n\n }\n\n virtual ~ConvDiskOptionsDialog(void) {}\n\n\n\n int fDiskSizeIdx;\n\n //BOOL fAllowLower;\n\n //BOOL fSparseAlloc;\n\n CString fVolName;\n\n\n\n long fNumBlocks; // computed when DoModal finishes\n\n\n\nprivate:\n","file_path":"app/ConvDiskOptionsDialog.h","rank":52,"score":40132.2897421687},{"content":"private:\n\n /*\n\n * Load the specified DiskFS into the tree, recursively adding any\n\n * sub-volumes. Pass in an initial depth of 1.\n\n *\n\n * Returns true on success.\n\n */\n\n bool AddDiskFS(CTreeCtrl* pTree, HTREEITEM root,\n\n DiskImgLib::DiskFS* pDiskFS, int depth);\n\n\n\n /*\n\n * Add the subdir and all of the subdirectories of the current subdir.\n\n *\n\n * The files are held in a linear list in the DiskFS, so we have to\n\n * reconstruct the hierarchy from the path names. Pass in NULL for the\n\n * root volume.\n\n *\n\n * Returns a pointer to the next A2File in the list (i.e. the first one\n\n * that we couldn't digest). This assumes that the contents of a\n\n * subdirectory are grouped together in the linear list, so that we can\n","file_path":"app/DiskFSTree.h","rank":57,"score":36.544556779242974},{"content":" * in. If the fssep is '\\0' (as is the case for DOS 3.3), then the entire\n\n * pathname is returned.\n\n *\n\n * Always returns a pointer to a string; never returns NULL.\n\n */\n\n static const WCHAR* FilenameOnly(const WCHAR* pathname, WCHAR fssep);\n\n\n\n /*\n\n * Test to see if a wide-to-narrow filename conversion failed.\n\n *\n\n * Returns true if all is well, false with *pErrMsg set if something\n\n * went wrong.\n\n */\n\n static bool TestNarrowConversion(const CString& original,\n\n const CStringA& converted, CString* pErrMsg) {\n\n int index = converted.ReverseFind('?');\n\n if (index < 0) {\n\n // no '?' is good\n\n } else if (index == 2 && converted.Left(4) == \"\\\\\\\\?\\\\\") {\n\n // Win32 file namespace path strings start with \"\\\\?\\\". If that's\n","file_path":"util/PathName.h","rank":59,"score":35.16528685719828},{"content":" pListView->InsertItem(itemIndex, driveName);\n\n pListView->SetItemText(itemIndex, 1, remark);\n\n pListView->SetItemData(itemIndex, aspiAddr);\n\n itemIndex++;\n\n }\n\n }\n\n\n\n delete[] deviceArray;\n\n#endif\n\n }\n\n\n\n *pItemIndex = itemIndex;\n\n return true;\n\n}\n\n\n\nbool OpenVolumeDialog::HasPhysicalDriveWin9x(int unit, CString* pRemark)\n\n{\n\n HANDLE handle = NULL;\n\n const int VWIN32_DIOC_DOS_INT13 = 4;\n\n const int CARRY_FLAG = 1;\n","file_path":"app/OpenVolumeDialog.cpp","rank":61,"score":31.19040539420343},{"content":" return false;\n\n name++;\n\n }\n\n\n\n return true;\n\n}\n\n\n\n/*\n\n * Return \"true\" if \"name\" is valid for use as an HFS file name.\n\n */\n\n/*static*/ bool DiskFSHFS::IsValidFileName(const char* name)\n\n{\n\n if (name == NULL)\n\n return false;\n\n\n\n int len = strlen(name);\n\n if (len < 1 || len > A2FileHFS::kMaxFileName)\n\n return false;\n\n\n\n while (*name != '\\0') {\n","file_path":"diskimg/HFS.cpp","rank":62,"score":30.995069764701668},{"content":" return dierr;\n\n\n\n return kDIErrNone;\n\n}\n\n\n\n/*\n\n * Get the state of an entry in the block use map.\n\n *\n\n * Returns \"true\" if it's in use, \"false\" otherwise.\n\n */\n\nbool DiskFSProDOS::GetBlockUseEntry(long block) const\n\n{\n\n assert(block >= 0 && block < fTotalBlocks);\n\n assert(fBlockUseMap != NULL);\n\n\n\n int offset;\n\n uint8_t mask;\n\n\n\n offset = block / 8;\n\n mask = 0x80 >> (block & 0x07);\n","file_path":"diskimg/ProDOS.cpp","rank":64,"score":30.35034892613418},{"content":" uint8_t mask;\n\n\n\n offset = block / 8;\n\n mask = 0x80 >> (block & 0x07);\n\n if (!inUse)\n\n fBlockUseMap[offset] |= mask;\n\n else\n\n fBlockUseMap[offset] &= ~mask;\n\n}\n\n\n\n/*\n\n * Check for entries in the block use map past the point where they should be.\n\n *\n\n * Returns \"true\" if bogus entries were found, \"false\" if all is well.\n\n */\n\nbool DiskFSProDOS::ScanForExtraEntries(void) const\n\n{\n\n assert(fBlockUseMap != NULL);\n\n\n\n int offset, endOffset;\n","file_path":"diskimg/ProDOS.cpp","rank":65,"score":29.95141267827531},{"content":" */\n\nbool DiskImg::CheckForBadBlocks(long startBlock, int numBlocks)\n\n{\n\n int i;\n\n\n\n if (fpBadBlockMap == NULL)\n\n return false;\n\n\n\n for (i = startBlock; i < startBlock+numBlocks; i++) {\n\n if (fpBadBlockMap->IsSet(i))\n\n return true;\n\n }\n\n return false;\n\n}\n\n\n\n/*\n\n * Write a block of data to a DiskImg.\n\n *\n\n * Returns immediately when a block write fails. Does not try to write all\n\n * blocks before returning failure.\n","file_path":"diskimg/DiskImg.cpp","rank":66,"score":29.27121765010991},{"content":" * Handle a bulk extraction.\n\n */\n\n void DoBulkExtract(SelectionSet* pSelSet,\n\n const ExtractOptionsDialog* pExtOpts);\n\n\n\n /*\n\n * Extract a single entry.\n\n *\n\n * If pHolder is non-NULL, it holds the data from the file, and can be\n\n * used for formatted or non-formatted output. If it's NULL, we need to\n\n * extract the data ourselves.\n\n *\n\n * Returns true on success, false on failure.\n\n */\n\n bool ExtractEntry(GenericEntry* pEntry, int thread,\n\n ReformatHolder* pHolder, const ExtractOptionsDialog* pExtOpts,\n\n bool* pOverwriteExisting, bool* pOvwrForAll);\n\n\n\n /*\n\n * Open an output file.\n","file_path":"app/Main.h","rank":67,"score":28.687712474187844},{"content":" for (int i = 0; i < argc; i++) {\n\n LOGI(\" %d '%ls'\", i, argv[i]);\n\n }\n\n\n\n /*\n\n * Figure out what the arguments are.\n\n */\n\n const WCHAR* filename = NULL;\n\n const WCHAR* dispName = NULL;\n\n FilterIndex filterIndex = kFilterIndexGeneric;\n\n bool temp = false;\n\n\n\n for (int i = 1; i < argc; i++) {\n\n if (argv[i][0] == '-') {\n\n if (wcsicmp(argv[i], L\"-mode\") == 0) {\n\n if (i == argc-1) {\n\n LOGI(\"WARNING: -mode specified without mode\");\n\n } else\n\n i++;\n\n if (wcsicmp(argv[i], kModeNuFX) == 0)\n","file_path":"app/Main.cpp","rank":68,"score":28.5662385231819},{"content":" CDialog::OnInitDialog();\n\n\n\n CTreeCtrl* pTree = (CTreeCtrl*) GetDlgItem(IDC_ADD_TARGET_TREE);\n\n\n\n ASSERT(fpDiskFS != NULL);\n\n ASSERT(pTree != NULL);\n\n\n\n fDiskFSTree.fIncludeSubdirs = true;\n\n fDiskFSTree.fExpandDepth = -1;\n\n if (!fDiskFSTree.BuildTree(fpDiskFS, pTree)) {\n\n LOGI(\"Tree load failed!\");\n\n OnCancel();\n\n }\n\n\n\n int count = pTree->GetCount();\n\n LOGI(\"ChooseAddTargetDialog tree has %d items\", count);\n\n if (count <= 1) {\n\n LOGI(\" Skipping out of target selection\");\n\n // adding to root volume of the sole DiskFS\n\n fpChosenDiskFS = fpDiskFS;\n","file_path":"app/ChooseAddTargetDialog.cpp","rank":69,"score":27.819130649825468},{"content":" return cp1;\n\n if (towlower(*cp1a) != towlower(*cp2))\n\n break;\n\n }\n\n }\n\n }\n\n }\n\n return NULL;\n\n}\n\n\n\nvoid VectorizeString(WCHAR* mangle, WCHAR** argv, int* pArgc)\n\n{\n\n bool inWhiteSpace = true;\n\n bool inQuote = false;\n\n WCHAR* cp = mangle;\n\n int idx = 0;\n\n\n\n while (*cp != '\\0') {\n\n ASSERT(!inWhiteSpace || !inQuote);\n\n if (!inQuote && (*cp == ' ' || *cp == '\\t')) {\n","file_path":"util/Util.cpp","rank":70,"score":27.546933435272386},{"content":" * hfslib functions convert to time_t for us.\n\n */\n\n fCreateWhen = dirEntry->crdate;\n\n fModWhen = dirEntry->mddate;\n\n}\n\n\n\n/*\n\n * Return \"true\" if \"name\" is valid for use as an HFS volume name.\n\n */\n\n/*static*/ bool DiskFSHFS::IsValidVolumeName(const char* name)\n\n{\n\n if (name == NULL)\n\n return false;\n\n\n\n int len = strlen(name);\n\n if (len < 1 || len > kMaxVolumeName)\n\n return false;\n\n\n\n while (*name != '\\0') {\n\n if (*name == A2FileHFS::kFssep)\n","file_path":"diskimg/HFS.cpp","rank":71,"score":27.301039403843234},{"content":" int len;\n\n int result = -1;\n\n\n\n ASSERT(dirName != NULL);\n\n ASSERT(pErrMsg != NULL);\n\n\n\n LOGI(\"+++ DESCEND: '%ls'\", (LPCWSTR) dirName);\n\n\n\n dirp = OpenDir(dirName);\n\n if (dirp == NULL) {\n\n pErrMsg->Format(L\"Failed on '%ls': %hs\", dirName, strerror(errno));\n\n goto bail;\n\n }\n\n\n\n fssep = kLocalFssep;\n\n\n\n /* could use readdir_r, but we don't care about reentrancy here */\n\n while ((entry = ReadDir(dirp)) != NULL) {\n\n /* skip the dotsies */\n\n if (wcscmp(entry->d_name, L\".\") == 0 || wcscmp(entry->d_name, L\"..\") == 0)\n","file_path":"mdc/Main.cpp","rank":73,"score":26.77142362772284},{"content":"\n\n\n\n/*\n\n * Convert a track encoded as one or more pulse streams to nibbles.\n\n *\n\n * This decompresses the pulse streams in \"inputBuf\", then converts them\n\n * to nibble form in \"nibbleBuf\".\n\n *\n\n * \"*pNibbleLen\" should hold the maximum size of the buffer. On success,\n\n * it will hold the actual number of bytes used.\n\n *\n\n * Returns \"true\" on success, \"false\" on failure.\n\n */\n\nbool WrapperFDI::DecodePulseTrack(const uint8_t* inputBuf, long inputLen,\n\n int bitRate, uint8_t* nibbleBuf, long* pNibbleLen)\n\n{\n\n const int kSizeValueMask = 0x003fffff;\n\n const int kSizeCompressMask = 0x00c00000;\n\n const int kSizeCompressShift = 22;\n\n PulseIndexHeader hdr;\n","file_path":"diskimg/FDI.cpp","rank":74,"score":26.40661564097852},{"content":" if (fBlockUseMap[offset] & mask)\n\n return false;\n\n else\n\n return true;\n\n}\n\n\n\n/*\n\n * Change the state of an entry in the block use map.\n\n */\n\nvoid DiskFSProDOS::SetBlockUseEntry(long block, bool inUse)\n\n{\n\n assert(block >= 0 && block < fTotalBlocks);\n\n assert(fBlockUseMap != NULL);\n\n\n\n if (block == 0 && !inUse) {\n\n // shouldn't happen\n\n assert(false);\n\n }\n\n\n\n int offset;\n","file_path":"diskimg/ProDOS.cpp","rank":75,"score":26.38585511008108},{"content":"#include <stdio.h>\n\n#include <string.h>\n\n#include <unistd.h>\n\n#include <assert.h>\n\n#include \"../diskimg/DiskImg.h\"\n\n#include \"../nufxlib/NufxLib.h\"\n\n\n\nusing namespace DiskImgLib;\n\n\n\n#define nil NULL\n\n#define NELEM(x) (sizeof(x) / sizeof((x)[0]))\n\n\n\nFILE* gLog = nil;\n\npid_t gPid = getpid();\n\n\n\nconst int kTrackLen = 4096;\n\nconst int kNumSymbols = 256;\n\nconst int kNumFavorites = 20;\n\nconst int kRLEDelim = 0x97; // value MUST have high bit set\n\nconst int kNumTracks = 35;\n\n\n\n/* I suspect this is random garbage, but it's consistent for me */\n\nconst unsigned long kDDDProSignature = 0xd0bfc903;\n\n\n\n\n\n/*\n\n * Class for getting and putting bits to and from a file.\n\n */\n","file_path":"linux/PackDDD.cpp","rank":76,"score":26.37596194477581},{"content":"}\n\n\n\n/*\n\n * Convert the EOL markers in a buffer. The output is written to the work\n\n * buffer. The input buffer may be CR, LF, or CRLF.\n\n *\n\n * If \"stripHiBits\" is set, the high bit of each character is cleared before\n\n * the value is considered.\n\n *2\n\n * If \"stripNulls\" is true, no null values will make it through.\n\n */\n\nvoid ReformatText::ConvertEOL(const uint8_t* srcBuf, long srcLen,\n\n bool stripHiBits, bool stripNulls)\n\n{\n\n uint8_t ch;\n\n int mask;\n\n\n\n assert(!fUseRTF); // else we have to use RTFPrintChar\n\n\n\n if (stripHiBits)\n","file_path":"reformat/ReformatBase.cpp","rank":77,"score":26.04473852276724},{"content":" *\n\n * Returns 0 if there's no data, which can only happen if \"remLen\" is zero\n\n * (i.e. we hit EOF).\n\n */\n\n/*static*/ int NiftyList::ScanLine(const char* pData, long remLen)\n\n{\n\n bool atEOL = false;\n\n int lineLen = 0;\n\n\n\n while (remLen--) {\n\n if (*pData == '\\r' || *pData == '\\n')\n\n atEOL = true;\n\n else if (atEOL)\n\n break;\n\n pData++;\n\n lineLen++;\n\n }\n\n\n\n return lineLen;\n\n}\n","file_path":"reformat/NiftyList.cpp","rank":78,"score":25.79775838643139},{"content":"\n\n GenericArchive* CreateArchiveInstance(FilterIndex filterIndex) const;\n\n\n\n /*\n\n * Load an archive, using the appropriate GenericArchive subclass.\n\n *\n\n * \"filename\" is the full path to the file, \"extension\" is the\n\n * filetype component of the name (without the leading '.'), \"filterIndex\"\n\n * is the offset into the set of filename filters used in the standard\n\n * file dialog, and \"readOnly\" reflects the state of the stdfile dialog\n\n * checkbox.\n\n *\n\n * Returns 0 on success, nonzero on failure.\n\n */\n\n int LoadArchive(const WCHAR* filename, const WCHAR* extension,\n\n FilterIndex filterIndex, bool readOnly);\n\n\n\n /*\n\n * Open a raw disk volume. Useful for ProDOS-formatted 1.44MB floppy disks\n\n * and CFFA flash cards.\n","file_path":"app/Main.h","rank":79,"score":25.111734041290212},{"content":"}\n\n\n\nGenericArchive* MainWindow::CreateArchiveInstance(FilterIndex filterIndex) const\n\n{\n\n GenericArchive* pOpenArchive = NULL;\n\n\n\n switch (filterIndex) {\n\n case kFilterIndexNuFX: pOpenArchive = new NufxArchive; break;\n\n case kFilterIndexBinaryII: pOpenArchive = new BnyArchive; break;\n\n case kFilterIndexACU: pOpenArchive = new AcuArchive; break;\n\n case kFilterIndexAppleSingle: pOpenArchive = new AppleSingleArchive; break;\n\n case kFilterIndexDiskImage: pOpenArchive = new DiskArchive; break;\n\n default: ASSERT(false); break;\n\n }\n\n\n\n return pOpenArchive;\n\n}\n\n\n\nint MainWindow::LoadArchive(const WCHAR* fileName, const WCHAR* extension,\n\n FilterIndex filterIndex, bool readOnly)\n","file_path":"app/Main.cpp","rank":80,"score":25.066848460667103},{"content":" long fEndSample;\n\n unsigned char fChecksum;\n\n bool fChecksumGood;\n\n };\n\n\n\n /*\n\n * Analyze the contents of a WAV file.\n\n *\n\n * Returns true if it found anything at all, false if not.\n\n */\n\n bool AnalyzeWAV(void);\n\n\n\n /*\n\n * Add an entry to the list.\n\n *\n\n * Layout: index format length checksum start-offset\n\n */\n\n void AddEntry(int idx, CListCtrl* pListCtrl, long* pFileType);\n\n\n\n enum {\n","file_path":"app/CassetteDialog.h","rank":81,"score":24.873579721840038},{"content":" // Return true on success, false if something failed and we want to keep\n\n // the dialog open.\n\n virtual bool MyDataExchange(bool saveAndValidate) { return true; }\n\n\n\n // Handles a click on the \"help\" button.\n\n virtual void HandleHelp() {}\n\n\n\nprivate:\n\n DECLARE_COPY_AND_OPEQ(SelectFilesDialog)\n\n\n\n /*\n\n * Finishes configuring the file dialog.\n\n */\n\n virtual void OnInitDone() override;\n\n\n\n /*\n\n * Tracks changes to the current directory.\n\n *\n\n * Updates fCurrentDirectory with the path currently being used by the\n\n * dialog. For items with no path (e.g. Computer or Libraries), this\n","file_path":"util/SelectFilesDialog.h","rank":82,"score":24.790773285697263},{"content":" result = OwnExtension(ext, kFileTypeAssoc[idx].progId);\n\n } else {\n\n LOGI(\" SetFileAssoc: do nothing with '%ls'\", ext);\n\n /* do nothing */\n\n }\n\n\n\n return 0;\n\n}\n\n\n\nbool MyRegistry::GetAssocState(const WCHAR* ext) const\n\n{\n\n WCHAR buf[260];\n\n HKEY hExtKey = NULL;\n\n int res;\n\n bool result = false;\n\n\n\n HKEY hClassesKey = NULL;\n\n if (OpenHKCUSoftwareClasses(&hClassesKey) != ERROR_SUCCESS) {\n\n LOGW(\"GetAssocState failed to open HKCU\");\n\n return result;\n","file_path":"app/Registry.cpp","rank":83,"score":24.778233601873215},{"content":" // set/get individual pixel values; the \"RGB\" functions always set\n\n // alpha to zero, while \"RGBA\" follow the current alpha mode\n\n\n\n void FASTCALL GetPixelRGB(int x, int y, RGBQUAD* pRgbQuad) const;\n\n void FASTCALL SetPixelRGB(int x, int y, const RGBQUAD* pRgbQuad);\n\n void FASTCALL GetPixelRGBA(int x, int y, RGBQUAD* pRgbQuad) const;\n\n void FASTCALL SetPixelRGBA(int x, int y, const RGBQUAD* pRgbQuad);\n\n void FASTCALL GetPixelIndex(int x, int y, int* pIdx) const;\n\n void FASTCALL SetPixelIndex(int x, int y, int idx);\n\n\n\n // Return a pointer to the raw pixel storage.\n\n void* GetPixelBuf(void) const { return mpPixels; }\n\n\n\n // Return the DIB handle; keep in mind that this HBITMAP is different\n\n // from a DDB HBITMAP, and many calls that take an HBITMAP will fail.\n\n HBITMAP GetHandle(void) {\n\n if (mhBitmap == NULL && mpFileBuffer != NULL)\n\n ConvertBufToDIBSection();\n\n return mhBitmap;\n\n }\n","file_path":"util/MyDIBitmap.h","rank":84,"score":24.69481255218193},{"content":"static int Nu_SQCmpTrees(SQState* pSqState, int a, int b)\n\n{\n\n if (pSqState->node[a].weight > pSqState->node[b].weight)\n\n return true;\n\n if (pSqState->node[a].weight == pSqState->node[b].weight)\n\n if (pSqState->node[a].tdepth > pSqState->node[b].tdepth)\n\n return true;\n\n return false;\n","file_path":"nufxlib/Squeeze.c","rank":85,"score":24.50415930815239},{"content":" /* pointer to directory entry (update dir if file size or dates change) */\n\n uint16_t fParentDirBlock; // directory block\n\n int fParentDirIdx; // index in dir block\n\n\n\n /* these are only valid if storageType == kStorageExtended */\n\n ExtendedInfo fExtData;\n\n ExtendedInfo fExtRsrc;\n\n\n\n void SetPathName(const char* basePath, const char* fileName);\n\n static time_t ConvertProDate(ProDate proDate);\n\n static ProDate ConvertProDate(time_t unixDate);\n\n\n\n /* returns \"true\" if AppleWorks aux type is used for lower-case name */\n\n static bool UsesAppleWorksAuxType(uint8_t fileType) {\n\n return (fileType >= 0x19 && fileType <= 0x1b);\n\n }\n\n\n\n#if 0\n\n /* change fPathName; should only be used by DiskFS rename */\n\n void SetPathName(const char* name) {\n","file_path":"diskimg/DiskImgDetail.h","rank":86,"score":24.40720651469844},{"content":" bool isWin9x = IsWin9x();\n\n int itemIndex = *pItemIndex;\n\n\n\n ASSERT(pListView != NULL);\n\n\n\n drivesAvailable = GetLogicalDrives();\n\n if (drivesAvailable == 0) {\n\n LOGI(\"GetLogicalDrives failed, err=0x%08lx\", drivesAvailable);\n\n return false;\n\n }\n\n LOGI(\"GetLogicalDrives returned 0x%08lx\", drivesAvailable);\n\n\n\n // SetErrorMode(SEM_FAILCRITICALERRORS)\n\n\n\n /* run through the list, from A-Z */\n\n int i;\n\n for (i = 0; i < kMaxLogicalDrives; i++) {\n\n fVolumeInfo[i].driveType = DRIVE_UNKNOWN;\n\n\n\n if ((drivesAvailable >> i) & 0x01) {\n","file_path":"app/OpenVolumeDialog.cpp","rank":87,"score":24.40322304959824},{"content":" WCHAR driveName[] = L\"_:\\\\\";\n\n driveName[0] = 'A' + i;\n\n\n\n unsigned int driveType;\n\n const WCHAR* driveTypeComment = NULL;\n\n BOOL result;\n\n\n\n driveType = fVolumeInfo[i].driveType = GetDriveType(driveName);\n\n switch (driveType) {\n\n case DRIVE_UNKNOWN:\n\n // The drive type cannot be determined.\n\n break;\n\n case DRIVE_NO_ROOT_DIR:\n\n // The root path is invalid. For example, no volume is mounted at the path.\n\n break;\n\n case DRIVE_REMOVABLE:\n\n // The disk can be removed from the drive.\n\n driveTypeComment = L\"Removable\";\n\n break;\n\n case DRIVE_FIXED:\n","file_path":"app/OpenVolumeDialog.cpp","rank":88,"score":24.38022447633507},{"content":" ASSERT(pOutput->GetTextBuf() != NULL);\n\n int err = 0;\n\n if (fwrite(pOutput->GetTextBuf(),\n\n pOutput->GetTextLen(), 1, fp) != 1)\n\n err = errno;\n\n if (err != 0) {\n\n errMsg.Format(L\"Unable to save reformatted file '%ls': %hs\\n\",\n\n (LPCWSTR) outputPath, strerror(err));\n\n fpActionProgress->MessageBox(errMsg, failed,\n\n MB_OK | MB_ICONERROR);\n\n writeFailed = true;\n\n } else {\n\n SET_PROGRESS_UPDATE(100);\n\n }\n\n } else if (pOutput->GetOutputKind() == ReformatOutput::kOutputBitmap) {\n\n LOGI(\" Writing bitmap\");\n\n ASSERT(pOutput->GetDIB() != NULL);\n\n int err = pOutput->GetDIB()->WriteToFile(fp);\n\n if (err != 0) {\n\n errMsg.Format(L\"Unable to save bitmap '%ls': %hs\\n\",\n","file_path":"app/Actions.cpp","rank":89,"score":24.11423846841045},{"content":"{\n\n static const WCHAR kFileArchive[] = L\"This appears to be a file archive.\";\n\n GenericArchive::OpenResult openResult;\n\n const FilterIndex origFilterIndex = filterIndex;\n\n GenericArchive* pOpenArchive = NULL;\n\n\n\n LOGI(\"LoadArchive: '%ls' ro=%d idx=%d\", fileName, readOnly, filterIndex);\n\n\n\n /* close any existing archive to avoid weirdness from re-open */\n\n CloseArchive();\n\n\n\n /*\n\n * If they used the \"All Files (*.*)\" filter, try guess based\n\n * on the file extension.\n\n */\n\n if (filterIndex == kFilterIndexGeneric) {\n\n int i;\n\n\n\n for (i = 0; i < NELEM(gExtensionToIndex); i++) {\n\n if (wcsicmp(extension, gExtensionToIndex[i].extension) == 0) {\n","file_path":"app/Main.cpp","rank":90,"score":23.968348937684112},{"content":"/*\n\n * Make a control larger by the same delta as the parent window.\n\n */\n\nvoid StretchControl(CDialog* pDlg, int id, int deltaX, int deltaY,\n\n bool redraw = true);\n\n\n\n/*\n\n * Stretch and move a control.\n\n */\n\nvoid MoveStretchControl(CDialog* pDlg, int id, int moveX, int moveY,\n\n int stretchX, int stretchY, bool redraw = true);\n\n\n\n/*\n\n * Move a control so it maintains its same position relative to the bottom\n\n * and right edges.\n\n */\n\nHDWP MoveControl(HDWP hdwp, CDialog* pDlg, int id, int deltaX, int deltaY,\n\n bool redraw = true);\n\n\n\n/*\n","file_path":"util/Util.h","rank":91,"score":23.927909903494278},{"content":"int MyRegistry::DisownExtension(const WCHAR* ext) const\n\n{\n\n ASSERT(ext != NULL);\n\n ASSERT(ext[0] == '.');\n\n if (ext == NULL || wcslen(ext) < 2)\n\n return -1;\n\n\n\n if (RegDeleteKeyHKCU(ext) == ERROR_SUCCESS) {\n\n LOGI(\" HKCU\\\\%ls\\\\%ls subtree deleted\", kFileAssocBase, ext);\n\n } else {\n\n LOGW(\" Failed deleting HKCU\\\\%ls\\\\'%ls'\", kFileAssocBase, ext);\n\n return -1;\n\n }\n\n\n\n return 0;\n\n}\n\n\n\nint MyRegistry::OwnExtension(const WCHAR* ext, const WCHAR* progIdKeyName) const\n\n{\n\n ASSERT(ext != NULL);\n","file_path":"app/Registry.cpp","rank":92,"score":23.719821189194327},{"content":"static const char kEmptyFolderMarker[] = \".$$EmptyFolder\";\n\n\n\n\n\n/*\n\n * ===========================================================================\n\n * DiskEntry\n\n * ===========================================================================\n\n */\n\n\n\nint DiskEntry::ExtractThreadToBuffer(int which, char** ppText, long* pLength,\n\n CString* pErrMsg) const\n\n{\n\n DIError dierr;\n\n A2FileDescr* pOpenFile = NULL;\n\n char* dataBuf = NULL;\n\n bool rsrcFork;\n\n bool needAlloc = true;\n\n int result = -1;\n\n\n\n ASSERT(fpFile != NULL);\n","file_path":"app/DiskArchive.cpp","rank":93,"score":23.573678797297024},{"content":" return;\n\n }\n\n len = pParent->SendMessage(CDM_GETFOLDERIDLIST, len,\n\n (LPARAM) pidlFolder);\n\n ASSERT(len > 0); // should fail earlier, or not at all\n\n\n\n WCHAR buf[MAX_PATH];\n\n BOOL result = SHGetPathFromIDList(pidlFolder, buf);\n\n if (result) {\n\n fCurrentDirectory = buf;\n\n } else {\n\n fCurrentDirectory = L\"\";\n\n }\n\n CoTaskMemFree((LPVOID) pidlFolder);\n\n }\n\n\n\n LOGD(\"OnFolderChange: '%ls'\", (LPCWSTR) fCurrentDirectory);\n\n}\n\n\n\nBOOL SelectFilesDialog::OnFileNameOK()\n","file_path":"util/SelectFilesDialog.cpp","rank":94,"score":23.44936364765088},{"content":"void ShowFailureMsg(CWnd* pWnd, int msgId, int titleStrID);\n\n\n\n\n\n/*\n\n * Returns \"true\" if we're running on Win9x (Win95, Win98, WinME), \"false\"\n\n * if not (could be WinNT/2K/XP or even Win31 with Win32s).\n\n */\n\nbool IsWin9x(void);\n\n\n\n/*\n\n * Wrapper for CString::LoadString that checks the return value and logs a\n\n * complaint if the load fails.\n\n */\n\nvoid CheckedLoadString(CString* pString, UINT nID);\n\n\n\n/*\n\n * ====================================\n\n * Miscellaneous functions\n\n * ====================================\n\n */\n","file_path":"util/Util.h","rank":95,"score":23.397288660456383},{"content":" virtual void PostNcDestroy();\n\n //}}AFX_VIRTUAL\n\n\n\npublic:\n\n BOOL Create(CWnd* pParentWnd = NULL) {\n\n return CDialog::Create(IDD_PROGRESS, pParentWnd);\n\n }\n\n void SetCurrentFile(const WCHAR* fileName);\n\n\n\n// Implementation\n\nprotected:\n\n // Generated message map functions\n\n //{{AFX_MSG(ProgressDlg)\n\n virtual void OnCancel();\n\n //}}AFX_MSG\n\n DECLARE_MESSAGE_MAP()\n\n};\n\n\n\n//{{AFX_INSERT_LOCATION}}\n\n// Microsoft Visual C++ will insert additional declarations immediately before the previous line.\n\n\n\n#endif // !defined(AFX_PROGRESSDLG_H__94B5552B_1337_4FA4_A336_32FA9544ADAC__INCLUDED_)\n","file_path":"mdc/ProgressDlg.h","rank":96,"score":23.38632512873862},{"content":"#define OneStateCount(_val) ((_val) & 0xff)\n\n\n\n/*\n\n * Convert our collection of pulse streams into (what we hope will be)\n\n * Apple II nibble form.\n\n *\n\n * This modifies the contents of the minStream, maxStream, and idxStream\n\n * arrays.\n\n *\n\n * \"*pNibbleLen\" should hold the maximum size of the buffer. On success,\n\n * it will hold the actual number of bytes used.\n\n */\n\nbool WrapperFDI::ConvertPulseStreamsToNibbles(PulseIndexHeader* pHdr, int bitRate,\n\n uint8_t* nibbleBuf, long* pNibbleLen)\n\n{\n\n uint32_t* fakeIdxStream = NULL;\n\n bool result = false;\n\n int i;\n\n\n\n /*\n","file_path":"diskimg/FDI.cpp","rank":97,"score":23.27449651382105},{"content":" dierr = SaveVolBitmap();\n\n FreeVolBitmap();\n\n if (dierr != kDIErrNone)\n\n return dierr;\n\n\n\n return kDIErrNone;\n\n}\n\n\n\n/*\n\n * Get the state of an entry in the VTOC sector use map.\n\n *\n\n * Returns \"true\" if it's in use, \"false\" otherwise.\n\n */\n\nbool DiskFSDOS33::GetSectorUseEntry(long track, int sector) const\n\n{\n\n assert(fVTOCLoaded);\n\n assert(track >= 0 && track < fpImg->GetNumTracks());\n\n assert(sector >= 0 && sector < fpImg->GetNumSectPerTrack());\n\n\n\n uint32_t val, mask;\n","file_path":"diskimg/DOS33.cpp","rank":98,"score":23.23130831447392},{"content":" * Returns a pointer to the pixel storage on success, or NULL on failure.\n\n */\n\n void* Create(int width, int height, int bitsPerPixel, int colorsUsed,\n\n bool dibSection = false);\n\n\n\n /*\n\n * Set the values in the color table.\n\n */\n\n void SetColorTable(const RGBQUAD* pColorTable);\n\n\n\n const RGBQUAD* GetColorTable(void) const { return mpColorTable; }\n\n\n\n /*\n\n * Zero out a bitmap's pixels. Does not touch the color table.\n\n */\n\n void ClearPixels(void);\n\n\n\n /*\n\n * Create a DDB from the current bitmap in the specified DC, and return its\n\n * handle. The returned handle must eventually be disposed with DeleteObject.\n","file_path":"util/MyDIBitmap.h","rank":99,"score":23.01072730005132}],"string":"[\n {\n \"content\": \" uch depth[2*L_CODES+1];\\n\",\n \"file_path\": \"zlib/deflate.h\",\n \"rank\": 0,\n \"score\": 93639.98853513303\n },\n {\n \"content\": \" uInt insert; /* bytes at end of window left to insert */\\n\",\n \"file_path\": \"zlib/deflate.h\",\n \"rank\": 1,\n \"score\": 93630.98532131276\n },\n {\n \"content\": \"local int build_bl_tree(s)\\n\",\n \"file_path\": \"zlib/trees.c\",\n \"rank\": 2,\n \"score\": 93608.07720701321\n },\n {\n \"content\": \"local int gz_avail(state)\\n\",\n \"file_path\": \"zlib/gzread.c\",\n \"rank\": 3,\n \"score\": 93605.356769784\n },\n {\n \"content\": \"local int gz_init(state)\\n\",\n \"file_path\": \"zlib/gzwrite.c\",\n \"rank\": 4,\n \"score\": 93602.05526818347\n },\n {\n \"content\": \"local int updatewindow OF((z_streamp strm, const unsigned char FAR *end,\\n\",\n \"file_path\": \"zlib/inflate.c\",\n \"rank\": 5,\n \"score\": 93596.13390992681\n },\n {\n \"content\": \"local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size));\\n\",\n \"file_path\": \"zlib/deflate.c\",\n \"rank\": 6,\n \"score\": 93596.13390992681\n },\n {\n \"content\": \"#define true (!false)\\n\\n\\n\\n\\n\",\n \"file_path\": \"nufxlib/samples/ImgConv.c\",\n \"rank\": 7,\n \"score\": 89928.77524166822\n },\n {\n \"content\": \"class UseSelectionDialog : public CDialog {\\n\\npublic:\\n\\n UseSelectionDialog(int selCount, CWnd* pParentWnd = NULL, int rsrcID = IDD_USE_SELECTION) :\\n\\n CDialog(rsrcID, pParentWnd), fSelectedCount(selCount)\\n\\n {\\n\\n // init values; these should be overridden before DoModal\\n\\n fFilesToAction = 0;\\n\\n }\\n\\n virtual ~UseSelectionDialog(void) {}\\n\\n\\n\\n // set up dialog parameters; must be called before DoModal\\n\\n void Setup(int titleID, int okLabelID, int countID, int countsID,\\n\\n int allID)\\n\\n {\\n\\n fTitleID = titleID;\\n\\n fOkLabelID = okLabelID;\\n\\n fSelCountID = countID;\\n\\n fSelCountsID = countsID;\\n\\n fAllID = allID;\\n\\n }\\n\",\n \"file_path\": \"app/UseSelectionDialog.h\",\n \"rank\": 8,\n \"score\": 59595.161554119884\n },\n {\n \"content\": \"// The filter index is saved in the registry, so if you reorder this list\\n\\n// you will briefly annoy existing users.\\n\\nenum FilterIndex {\\n\\n kFilterIndexFIRST = 1, // first index, must be non-Generic\\n\\n kFilterIndexNuFX = 1,\\n\\n kFilterIndexBinaryII = 2,\\n\\n kFilterIndexACU = 3,\\n\\n kFilterIndexAppleSingle = 4,\\n\\n kFilterIndexDiskImage = 5,\\n\\n kFilterIndexLASTNG = 5, // last non-Generic index\\n\\n\\n\\n kFilterIndexGeneric = 6, // *.* filter used\\n\\n kFilterIndexMAX = 6 // highest valid number\\n\\n};\\n\\n\\n\",\n \"file_path\": \"app/Main.h\",\n \"rank\": 9,\n \"score\": 55458.328233552515\n },\n {\n \"content\": \"\\n\\n enum { kActionSelection = 0, kActionAll = 1 };\\n\\n int fFilesToAction;\\n\\n\\n\\nprotected:\\n\\n virtual BOOL OnInitDialog(void) override;\\n\\n virtual void DoDataExchange(CDataExchange* pDX) override;\\n\\n\\n\\n afx_msg BOOL OnHelpInfo(HELPINFO* lpHelpInfo) {\\n\\n return MyApp::HandleHelpInfo(lpHelpInfo);\\n\\n }\\n\\n\\n\\nprivate:\\n\\n int fSelectedCount;\\n\\n\\n\\n /* dialog parameters */\\n\\n int fTitleID;\\n\\n int fOkLabelID;\\n\\n int fSelCountID;\\n\\n int fSelCountsID;\\n\\n int fAllID;\\n\\n\\n\\n DECLARE_MESSAGE_MAP()\\n\\n};\\n\\n\\n\\n#endif /*APP_USESELECTIONDIALOG_H*/\\n\",\n \"file_path\": \"app/UseSelectionDialog.h\",\n \"rank\": 10,\n \"score\": 55451.57734176381\n },\n {\n \"content\": \"/*\\n\\n * CiderPress\\n\\n * Copyright (C) 2007 by faddenSoft, LLC. All Rights Reserved.\\n\\n * See the file LICENSE for distribution terms.\\n\\n */\\n\\n/*\\n\\n * Acknowledge and clarify a request to do something, e.g. delete files.\\n\\n */\\n\\n#ifndef APP_USESELECTIONDIALOG_H\\n\\n#define APP_USESELECTIONDIALOG_H\\n\\n\\n\\n#include \\\"resource.h\\\"\\n\\n\\n\\n/*\\n\\n * Straightforward confirmation.\\n\\n */\\n\",\n \"file_path\": \"app/UseSelectionDialog.h\",\n \"rank\": 11,\n \"score\": 55443.72347069881\n },\n {\n \"content\": \"/*\\n\\n * CiderPress\\n\\n * Copyright (C) 2007 by faddenSoft, LLC. All Rights Reserved.\\n\\n * See the file LICENSE for distribution terms.\\n\\n */\\n\\n#include \\\"stdafx.h\\\"\\n\\n#include \\\"UseSelectionDialog.h\\\"\\n\\n\\n\\nBEGIN_MESSAGE_MAP(UseSelectionDialog, CDialog)\\n\\n ON_WM_HELPINFO()\\n\\n //ON_COMMAND(IDHELP, OnHelp)\\n\\nEND_MESSAGE_MAP()\\n\\n\\n\\n\\n\\nBOOL UseSelectionDialog::OnInitDialog(void)\\n\\n{\\n\\n CString str;\\n\\n CString selStr;\\n\\n CWnd* pWnd;\\n\\n\\n\",\n \"file_path\": \"app/UseSelectionDialog.cpp\",\n \"rank\": 12,\n \"score\": 53201.7114220574\n },\n {\n \"content\": \" CheckedLoadString(&str, fTitleID);\\n\\n SetWindowText(str);\\n\\n\\n\\n pWnd = GetDlgItem(IDC_USE_ALL);\\n\\n ASSERT(pWnd != NULL);\\n\\n CheckedLoadString(&str, fAllID);\\n\\n pWnd->SetWindowText(str);\\n\\n\\n\\n pWnd = GetDlgItem(IDOK);\\n\\n ASSERT(pWnd != NULL);\\n\\n CheckedLoadString(&str, fOkLabelID);\\n\\n pWnd->SetWindowText(str);\\n\\n\\n\\n return TRUE;\\n\\n}\\n\\n\\n\\nvoid UseSelectionDialog::DoDataExchange(CDataExchange* pDX)\\n\\n{\\n\\n DDX_Radio(pDX, IDC_USE_SELECTED, fFilesToAction);\\n\\n}\\n\",\n \"file_path\": \"app/UseSelectionDialog.cpp\",\n \"rank\": 13,\n \"score\": 53200.5552312211\n },\n {\n \"content\": \" CDialog::OnInitDialog();\\n\\n\\n\\n /* grab the radio button with the selection count */\\n\\n pWnd = GetDlgItem(IDC_USE_SELECTED);\\n\\n ASSERT(pWnd != NULL);\\n\\n\\n\\n /* set the string using a string table entry */\\n\\n if (fSelectedCount == 1) {\\n\\n CheckedLoadString(&str, fSelCountID);\\n\\n pWnd->SetWindowText(str);\\n\\n } else {\\n\\n CheckedLoadString(&str, fSelCountsID);\\n\\n selStr.Format((LPCWSTR) str, fSelectedCount);\\n\\n pWnd->SetWindowText(selStr);\\n\\n\\n\\n if (fSelectedCount == 0)\\n\\n pWnd->EnableWindow(FALSE);\\n\\n }\\n\\n\\n\\n /* set the other strings */\\n\",\n \"file_path\": \"app/UseSelectionDialog.cpp\",\n \"rank\": 14,\n \"score\": 53194.3031891208\n },\n {\n \"content\": \"int n_insert(node *np, byte *record, unsigned int *reclen)\\n\\n{\\n\\n /* check for free space */\\n\\n\\n\\n if (np->nd.ndNRecs >= HFS_MAX_NRECS ||\\n\\n *reclen + 2 > NODEFREE(*np))\\n\\n return split(np, record, reclen);\\n\\n\\n\\n n_insertx(np, record, *reclen);\\n\\n *reclen = 0;\\n\\n\\n\\n return bt_putnode(np);\\n\",\n \"file_path\": \"diskimg/libhfs/node.c\",\n \"rank\": 15,\n \"score\": 49215.98589065552\n },\n {\n \"content\": \"void n_index(const node *np, byte *record, unsigned int *reclen)\\n\\n{\\n\\n const byte *key = HFS_NODEREC(*np, 0);\\n\\n\\n\\n if (np->bt == &np->bt->f.vol->cat)\\n\\n {\\n\\n /* force the key length to be 0x25 */\\n\\n\\n\\n HFS_SETKEYLEN(record, 0x25);\\n\\n memset(record + 1, 0, 0x25);\\n\\n memcpy(record + 1, key + 1, HFS_RECKEYLEN(key));\\n\\n }\\n\\n else\\n\\n memcpy(record, key, HFS_RECKEYSKIP(key));\\n\\n\\n\\n d_putul(HFS_RECDATA(record), np->nnum);\\n\\n\\n\\n if (reclen)\\n\\n *reclen = HFS_RECKEYSKIP(record) + 4;\\n\",\n \"file_path\": \"diskimg/libhfs/node.c\",\n \"rank\": 16,\n \"score\": 49204.8905500282\n },\n {\n \"content\": \"void n_index(const node *, byte *, unsigned int *);\\n\",\n \"file_path\": \"diskimg/libhfs/node.h\",\n \"rank\": 17,\n \"score\": 49197.62585950512\n },\n {\n \"content\": \"int n_insert(node *, byte *, unsigned int *);\\n\",\n \"file_path\": \"diskimg/libhfs/node.h\",\n \"rank\": 18,\n \"score\": 49196.449760267584\n },\n {\n \"content\": \"#define IDS_FAILED 111\\n\",\n \"file_path\": \"mdc/resource.h\",\n \"rank\": 19,\n \"score\": 49194.13442054864\n },\n {\n \"content\": \"#define IDS_FAILED 2023\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 20,\n \"score\": 49194.13442054864\n },\n {\n \"content\": \" uint16_t used; /* mark as uninteresting */\\n\",\n \"file_path\": \"nufxlib/NufxLib.h\",\n \"rank\": 21,\n \"score\": 49192.08519711983\n },\n {\n \"content\": \"#define IDC_USE_ALL 1193\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 22,\n \"score\": 49185.50694918639\n },\n {\n \"content\": \" ULongInt\\tbthRoot;\\t/* number of root node */\\n\",\n \"file_path\": \"diskimg/libhfs/apple.h\",\n \"rank\": 23,\n \"score\": 47422.7777028922\n },\n {\n \"content\": \"int bt_insert(btree *bt, const byte *record, unsigned int reclen)\\n\\n{\\n\\n node root;\\n\\n byte newrec[HFS_MAX_RECLEN];\\n\\n\\n\\n if (bt->hdr.bthRoot == 0)\\n\\n {\\n\\n /* create root node */\\n\\n\\n\\n n_init(&root, bt, ndLeafNode, 1);\\n\\n if (n_new(&root) == -1 ||\\n\\n\\t bt_putnode(&root) == -1)\\n\\n\\tgoto fail;\\n\\n\\n\\n bt->hdr.bthDepth = 1;\\n\\n bt->hdr.bthRoot = root.nnum;\\n\\n bt->hdr.bthFNode = root.nnum;\\n\\n bt->hdr.bthLNode = root.nnum;\\n\\n\\n\\n bt->flags |= HFS_BT_UPDATE_HDR;\\n\\n }\\n\\n else if (bt_getnode(&root, bt, bt->hdr.bthRoot) == -1)\\n\\n goto fail;\\n\\n\\n\\n memcpy(newrec, record, reclen);\\n\\n\\n\\n if (insertx(&root, newrec, &reclen) == -1)\\n\\n goto fail;\\n\\n\\n\\n if (reclen)\\n\\n {\\n\\n byte oroot[HFS_MAX_RECLEN];\\n\\n unsigned int orootlen;\\n\\n\\n\\n /* root node was split; create a new root */\\n\\n\\n\\n n_index(&root, oroot, &orootlen);\\n\\n\\n\\n n_init(&root, bt, ndIndxNode, root.nd.ndNHeight + 1);\\n\\n if (n_new(&root) == -1)\\n\\n\\tgoto fail;\\n\\n\\n\\n ++bt->hdr.bthDepth;\\n\\n bt->hdr.bthRoot = root.nnum;\\n\\n\\n\\n bt->flags |= HFS_BT_UPDATE_HDR;\\n\\n\\n\\n /* insert index records for new root */\\n\\n\\n\\n n_search(&root, oroot);\\n\\n n_insertx(&root, oroot, orootlen);\\n\\n\\n\\n n_search(&root, newrec);\\n\\n n_insertx(&root, newrec, reclen);\\n\\n\\n\\n if (bt_putnode(&root) == -1)\\n\\n\\tgoto fail;\\n\\n }\\n\\n\\n\\n ++bt->hdr.bthNRecs;\\n\\n bt->flags |= HFS_BT_UPDATE_HDR;\\n\\n\\n\\n return 0;\\n\\n\\n\\nfail:\\n\\n return -1;\\n\",\n \"file_path\": \"diskimg/libhfs/btree.c\",\n \"rank\": 24,\n \"score\": 47421.15068864529\n },\n {\n \"content\": \" ULONG ReturnCode; \\n\",\n \"file_path\": \"diskimg/CP_ntddscsi.h\",\n \"rank\": 25,\n \"score\": 47416.15710403755\n },\n {\n \"content\": \" UInteger\\tbthDepth;\\t/* current depth of tree */\\n\",\n \"file_path\": \"diskimg/libhfs/apple.h\",\n \"rank\": 26,\n \"score\": 47415.53123454727\n },\n {\n \"content\": \"int bt_insert(btree *, const byte *, unsigned int);\\n\",\n \"file_path\": \"diskimg/libhfs/btree.h\",\n \"rank\": 27,\n \"score\": 47413.81388897092\n },\n {\n \"content\": \"#define IDC_CASSIMPTARG_INT 1422\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 28,\n \"score\": 47404.375635465876\n },\n {\n \"content\": \"#define IDC_USE_SELECTED 1192\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 29,\n \"score\": 47403.2675912085\n },\n {\n \"content\": \"#define IDD_USE_SELECTION 147\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 30,\n \"score\": 47403.2675912085\n },\n {\n \"content\": \" Boolean used;\\n\",\n \"file_path\": \"nufxlib/NufxLibPriv.h\",\n \"rank\": 31,\n \"score\": 47403.2675912085\n },\n {\n \"content\": \" LongInt\\tdrLsMod;\\t/* date and time of last modification */\\n\",\n \"file_path\": \"diskimg/libhfs/apple.h\",\n \"rank\": 32,\n \"score\": 45758.10966192414\n },\n {\n \"content\": \"#define IDC_ADDFILES_INCLUDE_SUBFOLDERS 1180\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 33,\n \"score\": 45757.50567782844\n },\n {\n \"content\": \"#define IDS_NLIST_DATA_FAILED 2149\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 34,\n \"score\": 45753.694970172844\n },\n {\n \"content\": \"#define FAIL_BAD gSuppressError = false;\\n\\n\\n\\n\\n\",\n \"file_path\": \"nufxlib/samples/TestBasic.c\",\n \"rank\": 35,\n \"score\": 45753.694970172844\n },\n {\n \"content\": \"#define IDS_DEFILE_OPEN_FAILED 2049\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 36,\n \"score\": 45753.694970172844\n },\n {\n \"content\": \"#define IDS_DEFILE_FIND_FAILED 2047\\n\",\n \"file_path\": \"app/resource.h\",\n \"rank\": 37,\n \"score\": 45753.694970172844\n },\n {\n \"content\": \"#define FAIL_OK gSuppressError = true;\\n\",\n \"file_path\": \"nufxlib/samples/TestBasic.c\",\n \"rank\": 38,\n \"score\": 45753.694970172844\n },\n {\n \"content\": \"static NuError Nu_ResetUsedFlags(NuArchive* pArchive, NuRecordSet* pRecordSet)\\n\\n{\\n\\n NuError err = kNuErrNone;\\n\\n NuRecord* pRecord;\\n\\n\\n\\n pRecord = Nu_RecordSet_GetListHead(pRecordSet);\\n\\n while (pRecord != NULL) {\\n\\n err = Nu_RecordResetUsedFlags(pArchive, pRecord);\\n\\n if (err != kNuErrNone) {\\n\\n Assert(0);\\n\\n break;\\n\\n }\\n\\n\\n\\n pRecord = pRecord->pNext;\\n\\n }\\n\\n\\n\\n return err;\\n\",\n \"file_path\": \"nufxlib/Deferred.c\",\n \"rank\": 39,\n \"score\": 45751.84154784641\n },\n {\n \"content\": \" BOOLEAN UseDiskDump;\\n\",\n \"file_path\": \"diskimg/CP_ntddscsi.h\",\n \"rank\": 40,\n \"score\": 45745.67086937868\n },\n {\n \"content\": \"#define kFlagUseTmp (1 << 4)\\n\\n\\n\\n\\n\",\n \"file_path\": \"nufxlib/samples/Launder.c\",\n \"rank\": 41,\n \"score\": 45745.67086937868\n },\n {\n \"content\": \"#define IDH_USE_ALL 1193\\n\",\n \"file_path\": \"app/Help/PopUpIds.h\",\n \"rank\": 42,\n \"score\": 45745.67086937868\n },\n {\n \"content\": \" BOOLEAN AdapterUsesPio;\\n\",\n \"file_path\": \"diskimg/CP_ntddscsi.h\",\n \"rank\": 43,\n \"score\": 45745.67086937868\n },\n {\n \"content\": \"NuError Nu_HeaderIOFailed(NuArchive* pArchive, FILE* fp)\\n\\n{\\n\\n if (feof(fp) || ferror(fp))\\n\\n return kNuErrFile;\\n\\n else\\n\\n return kNuErrNone;\\n\",\n \"file_path\": \"nufxlib/ArchiveIO.c\",\n \"rank\": 44,\n \"score\": 44207.83604868612\n },\n {\n \"content\": \"static NuError Nu_RecordResetUsedFlags(NuArchive* pArchive, NuRecord* pRecord)\\n\\n{\\n\\n NuThread* pThread;\\n\\n long idx;\\n\\n\\n\\n Assert(pArchive != NULL);\\n\\n Assert(pRecord != NULL);\\n\\n\\n\\n /* these should already be clear */\\n\\n if (pRecord->pThreadMods) {\\n\\n Assert(0);\\n\\n return kNuErrInternal;\\n\\n }\\n\\n\\n\\n /* these might still be set */\\n\\n for (idx = 0; idx < (long)pRecord->recTotalThreads; idx++) {\\n\\n pThread = Nu_GetThread(pRecord, idx);\\n\\n Assert(pThread != NULL);\\n\\n\\n\\n pThread->used = false;\\n\\n }\\n\\n\\n\\n /* and this */\\n\\n pRecord->dirtyHeader = false;\\n\\n\\n\\n return kNuErrNone;\\n\",\n \"file_path\": \"nufxlib/Deferred.c\",\n \"rank\": 45,\n \"score\": 44205.5734005915\n },\n {\n \"content\": \"#define IDH_CASSIMPTARG_INT 1422\\n\",\n \"file_path\": \"app/Help/PopUpIds.h\",\n \"rank\": 46,\n \"score\": 44201.11622477282\n },\n {\n \"content\": \"#define IDH_USE_SELECTED 1192\\n\",\n \"file_path\": \"app/Help/PopUpIds.h\",\n \"rank\": 47,\n \"score\": 44200.08305447269\n },\n {\n \"content\": \"#define IDH_ADDFILES_INCLUDE_SUBFOLDERS 1180\\n\",\n \"file_path\": \"app/Help/PopUpIds.h\",\n \"rank\": 48,\n \"score\": 42766.5832459142\n },\n {\n \"content\": \"NuError Nu_HeaderIOFailed(NuArchive* pArchive, FILE* fp);\\n\",\n \"file_path\": \"nufxlib/NufxLibPriv.h\",\n \"rank\": 49,\n \"score\": 42763.021623754845\n },\n {\n \"content\": \"class RecompressOptionsDialog : public UseSelectionDialog {\\n\\npublic:\\n\\n RecompressOptionsDialog(int selCount, CWnd* pParentWnd = NULL) :\\n\\n UseSelectionDialog(selCount, pParentWnd, IDD_RECOMPRESS_OPTS)\\n\\n {\\n\\n fCompressionType = 0;\\n\\n }\\n\\n virtual ~RecompressOptionsDialog(void) {}\\n\\n\\n\\n // maps directly to NuThreadFormat enum\\n\\n int fCompressionType;\\n\\n\\n\\nprivate:\\n\\n virtual BOOL OnInitDialog(void) override;\\n\\n virtual void DoDataExchange(CDataExchange* pDX) override;\\n\\n\\n\\n /*\\n\\n * Load strings into the combo box. Only load formats supported by the\\n\\n * NufxLib DLL.\\n\\n *\\n\",\n \"file_path\": \"app/RecompressOptionsDialog.h\",\n \"rank\": 50,\n \"score\": 42755.52201534079\n },\n {\n \"content\": \"class ConvFileOptionsDialog : public UseSelectionDialog {\\n\\npublic:\\n\\n ConvFileOptionsDialog(int selCount, CWnd* pParentWnd = NULL) :\\n\\n UseSelectionDialog(selCount, pParentWnd, IDD_CONVFILE_OPTS)\\n\\n {\\n\\n fPreserveEmptyFolders = FALSE;\\n\\n }\\n\\n virtual ~ConvFileOptionsDialog(void) {}\\n\\n\\n\\n //BOOL fConvDOSText;\\n\\n //BOOL fConvPascalText;\\n\\n BOOL fPreserveEmptyFolders;\\n\\n\\n\\nprivate:\\n\\n virtual void DoDataExchange(CDataExchange* pDX) override;\\n\\n\\n\\n //DECLARE_MESSAGE_MAP()\\n\\n};\\n\\n\\n\\n#endif /*APP_CONFFILEOPTIONSDIALOG_H*/\\n\",\n \"file_path\": \"app/ConvFileOptionsDialog.h\",\n \"rank\": 51,\n \"score\": 40132.2897421687\n },\n {\n \"content\": \"class ConvDiskOptionsDialog : public UseSelectionDialog {\\n\\npublic:\\n\\n ConvDiskOptionsDialog(int selCount, CWnd* pParentWnd = NULL) :\\n\\n UseSelectionDialog(selCount, pParentWnd, IDD_CONVDISK_OPTS)\\n\\n {\\n\\n fDiskSizeIdx = 0;\\n\\n //fAllowLower = fSparseAlloc = FALSE;\\n\\n fVolName = L\\\"NEW.DISK\\\";\\n\\n fNumBlocks = -1;\\n\\n }\\n\\n virtual ~ConvDiskOptionsDialog(void) {}\\n\\n\\n\\n int fDiskSizeIdx;\\n\\n //BOOL fAllowLower;\\n\\n //BOOL fSparseAlloc;\\n\\n CString fVolName;\\n\\n\\n\\n long fNumBlocks; // computed when DoModal finishes\\n\\n\\n\\nprivate:\\n\",\n \"file_path\": \"app/ConvDiskOptionsDialog.h\",\n \"rank\": 52,\n \"score\": 40132.2897421687\n },\n {\n \"content\": \"private:\\n\\n /*\\n\\n * Load the specified DiskFS into the tree, recursively adding any\\n\\n * sub-volumes. Pass in an initial depth of 1.\\n\\n *\\n\\n * Returns true on success.\\n\\n */\\n\\n bool AddDiskFS(CTreeCtrl* pTree, HTREEITEM root,\\n\\n DiskImgLib::DiskFS* pDiskFS, int depth);\\n\\n\\n\\n /*\\n\\n * Add the subdir and all of the subdirectories of the current subdir.\\n\\n *\\n\\n * The files are held in a linear list in the DiskFS, so we have to\\n\\n * reconstruct the hierarchy from the path names. Pass in NULL for the\\n\\n * root volume.\\n\\n *\\n\\n * Returns a pointer to the next A2File in the list (i.e. the first one\\n\\n * that we couldn't digest). This assumes that the contents of a\\n\\n * subdirectory are grouped together in the linear list, so that we can\\n\",\n \"file_path\": \"app/DiskFSTree.h\",\n \"rank\": 57,\n \"score\": 36.544556779242974\n },\n {\n \"content\": \" * in. If the fssep is '\\\\0' (as is the case for DOS 3.3), then the entire\\n\\n * pathname is returned.\\n\\n *\\n\\n * Always returns a pointer to a string; never returns NULL.\\n\\n */\\n\\n static const WCHAR* FilenameOnly(const WCHAR* pathname, WCHAR fssep);\\n\\n\\n\\n /*\\n\\n * Test to see if a wide-to-narrow filename conversion failed.\\n\\n *\\n\\n * Returns true if all is well, false with *pErrMsg set if something\\n\\n * went wrong.\\n\\n */\\n\\n static bool TestNarrowConversion(const CString& original,\\n\\n const CStringA& converted, CString* pErrMsg) {\\n\\n int index = converted.ReverseFind('?');\\n\\n if (index < 0) {\\n\\n // no '?' is good\\n\\n } else if (index == 2 && converted.Left(4) == \\\"\\\\\\\\\\\\\\\\?\\\\\\\\\\\") {\\n\\n // Win32 file namespace path strings start with \\\"\\\\\\\\?\\\\\\\". If that's\\n\",\n \"file_path\": \"util/PathName.h\",\n \"rank\": 59,\n \"score\": 35.16528685719828\n },\n {\n \"content\": \" pListView->InsertItem(itemIndex, driveName);\\n\\n pListView->SetItemText(itemIndex, 1, remark);\\n\\n pListView->SetItemData(itemIndex, aspiAddr);\\n\\n itemIndex++;\\n\\n }\\n\\n }\\n\\n\\n\\n delete[] deviceArray;\\n\\n#endif\\n\\n }\\n\\n\\n\\n *pItemIndex = itemIndex;\\n\\n return true;\\n\\n}\\n\\n\\n\\nbool OpenVolumeDialog::HasPhysicalDriveWin9x(int unit, CString* pRemark)\\n\\n{\\n\\n HANDLE handle = NULL;\\n\\n const int VWIN32_DIOC_DOS_INT13 = 4;\\n\\n const int CARRY_FLAG = 1;\\n\",\n \"file_path\": \"app/OpenVolumeDialog.cpp\",\n \"rank\": 61,\n \"score\": 31.19040539420343\n },\n {\n \"content\": \" return false;\\n\\n name++;\\n\\n }\\n\\n\\n\\n return true;\\n\\n}\\n\\n\\n\\n/*\\n\\n * Return \\\"true\\\" if \\\"name\\\" is valid for use as an HFS file name.\\n\\n */\\n\\n/*static*/ bool DiskFSHFS::IsValidFileName(const char* name)\\n\\n{\\n\\n if (name == NULL)\\n\\n return false;\\n\\n\\n\\n int len = strlen(name);\\n\\n if (len < 1 || len > A2FileHFS::kMaxFileName)\\n\\n return false;\\n\\n\\n\\n while (*name != '\\\\0') {\\n\",\n \"file_path\": \"diskimg/HFS.cpp\",\n \"rank\": 62,\n \"score\": 30.995069764701668\n },\n {\n \"content\": \" return dierr;\\n\\n\\n\\n return kDIErrNone;\\n\\n}\\n\\n\\n\\n/*\\n\\n * Get the state of an entry in the block use map.\\n\\n *\\n\\n * Returns \\\"true\\\" if it's in use, \\\"false\\\" otherwise.\\n\\n */\\n\\nbool DiskFSProDOS::GetBlockUseEntry(long block) const\\n\\n{\\n\\n assert(block >= 0 && block < fTotalBlocks);\\n\\n assert(fBlockUseMap != NULL);\\n\\n\\n\\n int offset;\\n\\n uint8_t mask;\\n\\n\\n\\n offset = block / 8;\\n\\n mask = 0x80 >> (block & 0x07);\\n\",\n \"file_path\": \"diskimg/ProDOS.cpp\",\n \"rank\": 64,\n \"score\": 30.35034892613418\n },\n {\n \"content\": \" uint8_t mask;\\n\\n\\n\\n offset = block / 8;\\n\\n mask = 0x80 >> (block & 0x07);\\n\\n if (!inUse)\\n\\n fBlockUseMap[offset] |= mask;\\n\\n else\\n\\n fBlockUseMap[offset] &= ~mask;\\n\\n}\\n\\n\\n\\n/*\\n\\n * Check for entries in the block use map past the point where they should be.\\n\\n *\\n\\n * Returns \\\"true\\\" if bogus entries were found, \\\"false\\\" if all is well.\\n\\n */\\n\\nbool DiskFSProDOS::ScanForExtraEntries(void) const\\n\\n{\\n\\n assert(fBlockUseMap != NULL);\\n\\n\\n\\n int offset, endOffset;\\n\",\n \"file_path\": \"diskimg/ProDOS.cpp\",\n \"rank\": 65,\n \"score\": 29.95141267827531\n },\n {\n \"content\": \" */\\n\\nbool DiskImg::CheckForBadBlocks(long startBlock, int numBlocks)\\n\\n{\\n\\n int i;\\n\\n\\n\\n if (fpBadBlockMap == NULL)\\n\\n return false;\\n\\n\\n\\n for (i = startBlock; i < startBlock+numBlocks; i++) {\\n\\n if (fpBadBlockMap->IsSet(i))\\n\\n return true;\\n\\n }\\n\\n return false;\\n\\n}\\n\\n\\n\\n/*\\n\\n * Write a block of data to a DiskImg.\\n\\n *\\n\\n * Returns immediately when a block write fails. Does not try to write all\\n\\n * blocks before returning failure.\\n\",\n \"file_path\": \"diskimg/DiskImg.cpp\",\n \"rank\": 66,\n \"score\": 29.27121765010991\n },\n {\n \"content\": \" * Handle a bulk extraction.\\n\\n */\\n\\n void DoBulkExtract(SelectionSet* pSelSet,\\n\\n const ExtractOptionsDialog* pExtOpts);\\n\\n\\n\\n /*\\n\\n * Extract a single entry.\\n\\n *\\n\\n * If pHolder is non-NULL, it holds the data from the file, and can be\\n\\n * used for formatted or non-formatted output. If it's NULL, we need to\\n\\n * extract the data ourselves.\\n\\n *\\n\\n * Returns true on success, false on failure.\\n\\n */\\n\\n bool ExtractEntry(GenericEntry* pEntry, int thread,\\n\\n ReformatHolder* pHolder, const ExtractOptionsDialog* pExtOpts,\\n\\n bool* pOverwriteExisting, bool* pOvwrForAll);\\n\\n\\n\\n /*\\n\\n * Open an output file.\\n\",\n \"file_path\": \"app/Main.h\",\n \"rank\": 67,\n \"score\": 28.687712474187844\n },\n {\n \"content\": \" for (int i = 0; i < argc; i++) {\\n\\n LOGI(\\\" %d '%ls'\\\", i, argv[i]);\\n\\n }\\n\\n\\n\\n /*\\n\\n * Figure out what the arguments are.\\n\\n */\\n\\n const WCHAR* filename = NULL;\\n\\n const WCHAR* dispName = NULL;\\n\\n FilterIndex filterIndex = kFilterIndexGeneric;\\n\\n bool temp = false;\\n\\n\\n\\n for (int i = 1; i < argc; i++) {\\n\\n if (argv[i][0] == '-') {\\n\\n if (wcsicmp(argv[i], L\\\"-mode\\\") == 0) {\\n\\n if (i == argc-1) {\\n\\n LOGI(\\\"WARNING: -mode specified without mode\\\");\\n\\n } else\\n\\n i++;\\n\\n if (wcsicmp(argv[i], kModeNuFX) == 0)\\n\",\n \"file_path\": \"app/Main.cpp\",\n \"rank\": 68,\n \"score\": 28.5662385231819\n },\n {\n \"content\": \" CDialog::OnInitDialog();\\n\\n\\n\\n CTreeCtrl* pTree = (CTreeCtrl*) GetDlgItem(IDC_ADD_TARGET_TREE);\\n\\n\\n\\n ASSERT(fpDiskFS != NULL);\\n\\n ASSERT(pTree != NULL);\\n\\n\\n\\n fDiskFSTree.fIncludeSubdirs = true;\\n\\n fDiskFSTree.fExpandDepth = -1;\\n\\n if (!fDiskFSTree.BuildTree(fpDiskFS, pTree)) {\\n\\n LOGI(\\\"Tree load failed!\\\");\\n\\n OnCancel();\\n\\n }\\n\\n\\n\\n int count = pTree->GetCount();\\n\\n LOGI(\\\"ChooseAddTargetDialog tree has %d items\\\", count);\\n\\n if (count <= 1) {\\n\\n LOGI(\\\" Skipping out of target selection\\\");\\n\\n // adding to root volume of the sole DiskFS\\n\\n fpChosenDiskFS = fpDiskFS;\\n\",\n \"file_path\": \"app/ChooseAddTargetDialog.cpp\",\n \"rank\": 69,\n \"score\": 27.819130649825468\n },\n {\n \"content\": \" return cp1;\\n\\n if (towlower(*cp1a) != towlower(*cp2))\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n return NULL;\\n\\n}\\n\\n\\n\\nvoid VectorizeString(WCHAR* mangle, WCHAR** argv, int* pArgc)\\n\\n{\\n\\n bool inWhiteSpace = true;\\n\\n bool inQuote = false;\\n\\n WCHAR* cp = mangle;\\n\\n int idx = 0;\\n\\n\\n\\n while (*cp != '\\\\0') {\\n\\n ASSERT(!inWhiteSpace || !inQuote);\\n\\n if (!inQuote && (*cp == ' ' || *cp == '\\\\t')) {\\n\",\n \"file_path\": \"util/Util.cpp\",\n \"rank\": 70,\n \"score\": 27.546933435272386\n },\n {\n \"content\": \" * hfslib functions convert to time_t for us.\\n\\n */\\n\\n fCreateWhen = dirEntry->crdate;\\n\\n fModWhen = dirEntry->mddate;\\n\\n}\\n\\n\\n\\n/*\\n\\n * Return \\\"true\\\" if \\\"name\\\" is valid for use as an HFS volume name.\\n\\n */\\n\\n/*static*/ bool DiskFSHFS::IsValidVolumeName(const char* name)\\n\\n{\\n\\n if (name == NULL)\\n\\n return false;\\n\\n\\n\\n int len = strlen(name);\\n\\n if (len < 1 || len > kMaxVolumeName)\\n\\n return false;\\n\\n\\n\\n while (*name != '\\\\0') {\\n\\n if (*name == A2FileHFS::kFssep)\\n\",\n \"file_path\": \"diskimg/HFS.cpp\",\n \"rank\": 71,\n \"score\": 27.301039403843234\n },\n {\n \"content\": \" int len;\\n\\n int result = -1;\\n\\n\\n\\n ASSERT(dirName != NULL);\\n\\n ASSERT(pErrMsg != NULL);\\n\\n\\n\\n LOGI(\\\"+++ DESCEND: '%ls'\\\", (LPCWSTR) dirName);\\n\\n\\n\\n dirp = OpenDir(dirName);\\n\\n if (dirp == NULL) {\\n\\n pErrMsg->Format(L\\\"Failed on '%ls': %hs\\\", dirName, strerror(errno));\\n\\n goto bail;\\n\\n }\\n\\n\\n\\n fssep = kLocalFssep;\\n\\n\\n\\n /* could use readdir_r, but we don't care about reentrancy here */\\n\\n while ((entry = ReadDir(dirp)) != NULL) {\\n\\n /* skip the dotsies */\\n\\n if (wcscmp(entry->d_name, L\\\".\\\") == 0 || wcscmp(entry->d_name, L\\\"..\\\") == 0)\\n\",\n \"file_path\": \"mdc/Main.cpp\",\n \"rank\": 73,\n \"score\": 26.77142362772284\n },\n {\n \"content\": \"\\n\\n\\n\\n/*\\n\\n * Convert a track encoded as one or more pulse streams to nibbles.\\n\\n *\\n\\n * This decompresses the pulse streams in \\\"inputBuf\\\", then converts them\\n\\n * to nibble form in \\\"nibbleBuf\\\".\\n\\n *\\n\\n * \\\"*pNibbleLen\\\" should hold the maximum size of the buffer. On success,\\n\\n * it will hold the actual number of bytes used.\\n\\n *\\n\\n * Returns \\\"true\\\" on success, \\\"false\\\" on failure.\\n\\n */\\n\\nbool WrapperFDI::DecodePulseTrack(const uint8_t* inputBuf, long inputLen,\\n\\n int bitRate, uint8_t* nibbleBuf, long* pNibbleLen)\\n\\n{\\n\\n const int kSizeValueMask = 0x003fffff;\\n\\n const int kSizeCompressMask = 0x00c00000;\\n\\n const int kSizeCompressShift = 22;\\n\\n PulseIndexHeader hdr;\\n\",\n \"file_path\": \"diskimg/FDI.cpp\",\n \"rank\": 74,\n \"score\": 26.40661564097852\n },\n {\n \"content\": \" if (fBlockUseMap[offset] & mask)\\n\\n return false;\\n\\n else\\n\\n return true;\\n\\n}\\n\\n\\n\\n/*\\n\\n * Change the state of an entry in the block use map.\\n\\n */\\n\\nvoid DiskFSProDOS::SetBlockUseEntry(long block, bool inUse)\\n\\n{\\n\\n assert(block >= 0 && block < fTotalBlocks);\\n\\n assert(fBlockUseMap != NULL);\\n\\n\\n\\n if (block == 0 && !inUse) {\\n\\n // shouldn't happen\\n\\n assert(false);\\n\\n }\\n\\n\\n\\n int offset;\\n\",\n \"file_path\": \"diskimg/ProDOS.cpp\",\n \"rank\": 75,\n \"score\": 26.38585511008108\n },\n {\n \"content\": \"#include <stdio.h>\\n\\n#include <string.h>\\n\\n#include <unistd.h>\\n\\n#include <assert.h>\\n\\n#include \\\"../diskimg/DiskImg.h\\\"\\n\\n#include \\\"../nufxlib/NufxLib.h\\\"\\n\\n\\n\\nusing namespace DiskImgLib;\\n\\n\\n\\n#define nil NULL\\n\\n#define NELEM(x) (sizeof(x) / sizeof((x)[0]))\\n\\n\\n\\nFILE* gLog = nil;\\n\\npid_t gPid = getpid();\\n\\n\\n\\nconst int kTrackLen = 4096;\\n\\nconst int kNumSymbols = 256;\\n\\nconst int kNumFavorites = 20;\\n\\nconst int kRLEDelim = 0x97; // value MUST have high bit set\\n\\nconst int kNumTracks = 35;\\n\\n\\n\\n/* I suspect this is random garbage, but it's consistent for me */\\n\\nconst unsigned long kDDDProSignature = 0xd0bfc903;\\n\\n\\n\\n\\n\\n/*\\n\\n * Class for getting and putting bits to and from a file.\\n\\n */\\n\",\n \"file_path\": \"linux/PackDDD.cpp\",\n \"rank\": 76,\n \"score\": 26.37596194477581\n },\n {\n \"content\": \"}\\n\\n\\n\\n/*\\n\\n * Convert the EOL markers in a buffer. The output is written to the work\\n\\n * buffer. The input buffer may be CR, LF, or CRLF.\\n\\n *\\n\\n * If \\\"stripHiBits\\\" is set, the high bit of each character is cleared before\\n\\n * the value is considered.\\n\\n *2\\n\\n * If \\\"stripNulls\\\" is true, no null values will make it through.\\n\\n */\\n\\nvoid ReformatText::ConvertEOL(const uint8_t* srcBuf, long srcLen,\\n\\n bool stripHiBits, bool stripNulls)\\n\\n{\\n\\n uint8_t ch;\\n\\n int mask;\\n\\n\\n\\n assert(!fUseRTF); // else we have to use RTFPrintChar\\n\\n\\n\\n if (stripHiBits)\\n\",\n \"file_path\": \"reformat/ReformatBase.cpp\",\n \"rank\": 77,\n \"score\": 26.04473852276724\n },\n {\n \"content\": \" *\\n\\n * Returns 0 if there's no data, which can only happen if \\\"remLen\\\" is zero\\n\\n * (i.e. we hit EOF).\\n\\n */\\n\\n/*static*/ int NiftyList::ScanLine(const char* pData, long remLen)\\n\\n{\\n\\n bool atEOL = false;\\n\\n int lineLen = 0;\\n\\n\\n\\n while (remLen--) {\\n\\n if (*pData == '\\\\r' || *pData == '\\\\n')\\n\\n atEOL = true;\\n\\n else if (atEOL)\\n\\n break;\\n\\n pData++;\\n\\n lineLen++;\\n\\n }\\n\\n\\n\\n return lineLen;\\n\\n}\\n\",\n \"file_path\": \"reformat/NiftyList.cpp\",\n \"rank\": 78,\n \"score\": 25.79775838643139\n },\n {\n \"content\": \"\\n\\n GenericArchive* CreateArchiveInstance(FilterIndex filterIndex) const;\\n\\n\\n\\n /*\\n\\n * Load an archive, using the appropriate GenericArchive subclass.\\n\\n *\\n\\n * \\\"filename\\\" is the full path to the file, \\\"extension\\\" is the\\n\\n * filetype component of the name (without the leading '.'), \\\"filterIndex\\\"\\n\\n * is the offset into the set of filename filters used in the standard\\n\\n * file dialog, and \\\"readOnly\\\" reflects the state of the stdfile dialog\\n\\n * checkbox.\\n\\n *\\n\\n * Returns 0 on success, nonzero on failure.\\n\\n */\\n\\n int LoadArchive(const WCHAR* filename, const WCHAR* extension,\\n\\n FilterIndex filterIndex, bool readOnly);\\n\\n\\n\\n /*\\n\\n * Open a raw disk volume. Useful for ProDOS-formatted 1.44MB floppy disks\\n\\n * and CFFA flash cards.\\n\",\n \"file_path\": \"app/Main.h\",\n \"rank\": 79,\n \"score\": 25.111734041290212\n },\n {\n \"content\": \"}\\n\\n\\n\\nGenericArchive* MainWindow::CreateArchiveInstance(FilterIndex filterIndex) const\\n\\n{\\n\\n GenericArchive* pOpenArchive = NULL;\\n\\n\\n\\n switch (filterIndex) {\\n\\n case kFilterIndexNuFX: pOpenArchive = new NufxArchive; break;\\n\\n case kFilterIndexBinaryII: pOpenArchive = new BnyArchive; break;\\n\\n case kFilterIndexACU: pOpenArchive = new AcuArchive; break;\\n\\n case kFilterIndexAppleSingle: pOpenArchive = new AppleSingleArchive; break;\\n\\n case kFilterIndexDiskImage: pOpenArchive = new DiskArchive; break;\\n\\n default: ASSERT(false); break;\\n\\n }\\n\\n\\n\\n return pOpenArchive;\\n\\n}\\n\\n\\n\\nint MainWindow::LoadArchive(const WCHAR* fileName, const WCHAR* extension,\\n\\n FilterIndex filterIndex, bool readOnly)\\n\",\n \"file_path\": \"app/Main.cpp\",\n \"rank\": 80,\n \"score\": 25.066848460667103\n },\n {\n \"content\": \" long fEndSample;\\n\\n unsigned char fChecksum;\\n\\n bool fChecksumGood;\\n\\n };\\n\\n\\n\\n /*\\n\\n * Analyze the contents of a WAV file.\\n\\n *\\n\\n * Returns true if it found anything at all, false if not.\\n\\n */\\n\\n bool AnalyzeWAV(void);\\n\\n\\n\\n /*\\n\\n * Add an entry to the list.\\n\\n *\\n\\n * Layout: index format length checksum start-offset\\n\\n */\\n\\n void AddEntry(int idx, CListCtrl* pListCtrl, long* pFileType);\\n\\n\\n\\n enum {\\n\",\n \"file_path\": \"app/CassetteDialog.h\",\n \"rank\": 81,\n \"score\": 24.873579721840038\n },\n {\n \"content\": \" // Return true on success, false if something failed and we want to keep\\n\\n // the dialog open.\\n\\n virtual bool MyDataExchange(bool saveAndValidate) { return true; }\\n\\n\\n\\n // Handles a click on the \\\"help\\\" button.\\n\\n virtual void HandleHelp() {}\\n\\n\\n\\nprivate:\\n\\n DECLARE_COPY_AND_OPEQ(SelectFilesDialog)\\n\\n\\n\\n /*\\n\\n * Finishes configuring the file dialog.\\n\\n */\\n\\n virtual void OnInitDone() override;\\n\\n\\n\\n /*\\n\\n * Tracks changes to the current directory.\\n\\n *\\n\\n * Updates fCurrentDirectory with the path currently being used by the\\n\\n * dialog. For items with no path (e.g. Computer or Libraries), this\\n\",\n \"file_path\": \"util/SelectFilesDialog.h\",\n \"rank\": 82,\n \"score\": 24.790773285697263\n },\n {\n \"content\": \" result = OwnExtension(ext, kFileTypeAssoc[idx].progId);\\n\\n } else {\\n\\n LOGI(\\\" SetFileAssoc: do nothing with '%ls'\\\", ext);\\n\\n /* do nothing */\\n\\n }\\n\\n\\n\\n return 0;\\n\\n}\\n\\n\\n\\nbool MyRegistry::GetAssocState(const WCHAR* ext) const\\n\\n{\\n\\n WCHAR buf[260];\\n\\n HKEY hExtKey = NULL;\\n\\n int res;\\n\\n bool result = false;\\n\\n\\n\\n HKEY hClassesKey = NULL;\\n\\n if (OpenHKCUSoftwareClasses(&hClassesKey) != ERROR_SUCCESS) {\\n\\n LOGW(\\\"GetAssocState failed to open HKCU\\\");\\n\\n return result;\\n\",\n \"file_path\": \"app/Registry.cpp\",\n \"rank\": 83,\n \"score\": 24.778233601873215\n },\n {\n \"content\": \" // set/get individual pixel values; the \\\"RGB\\\" functions always set\\n\\n // alpha to zero, while \\\"RGBA\\\" follow the current alpha mode\\n\\n\\n\\n void FASTCALL GetPixelRGB(int x, int y, RGBQUAD* pRgbQuad) const;\\n\\n void FASTCALL SetPixelRGB(int x, int y, const RGBQUAD* pRgbQuad);\\n\\n void FASTCALL GetPixelRGBA(int x, int y, RGBQUAD* pRgbQuad) const;\\n\\n void FASTCALL SetPixelRGBA(int x, int y, const RGBQUAD* pRgbQuad);\\n\\n void FASTCALL GetPixelIndex(int x, int y, int* pIdx) const;\\n\\n void FASTCALL SetPixelIndex(int x, int y, int idx);\\n\\n\\n\\n // Return a pointer to the raw pixel storage.\\n\\n void* GetPixelBuf(void) const { return mpPixels; }\\n\\n\\n\\n // Return the DIB handle; keep in mind that this HBITMAP is different\\n\\n // from a DDB HBITMAP, and many calls that take an HBITMAP will fail.\\n\\n HBITMAP GetHandle(void) {\\n\\n if (mhBitmap == NULL && mpFileBuffer != NULL)\\n\\n ConvertBufToDIBSection();\\n\\n return mhBitmap;\\n\\n }\\n\",\n \"file_path\": \"util/MyDIBitmap.h\",\n \"rank\": 84,\n \"score\": 24.69481255218193\n },\n {\n \"content\": \"static int Nu_SQCmpTrees(SQState* pSqState, int a, int b)\\n\\n{\\n\\n if (pSqState->node[a].weight > pSqState->node[b].weight)\\n\\n return true;\\n\\n if (pSqState->node[a].weight == pSqState->node[b].weight)\\n\\n if (pSqState->node[a].tdepth > pSqState->node[b].tdepth)\\n\\n return true;\\n\\n return false;\\n\",\n \"file_path\": \"nufxlib/Squeeze.c\",\n \"rank\": 85,\n \"score\": 24.50415930815239\n },\n {\n \"content\": \" /* pointer to directory entry (update dir if file size or dates change) */\\n\\n uint16_t fParentDirBlock; // directory block\\n\\n int fParentDirIdx; // index in dir block\\n\\n\\n\\n /* these are only valid if storageType == kStorageExtended */\\n\\n ExtendedInfo fExtData;\\n\\n ExtendedInfo fExtRsrc;\\n\\n\\n\\n void SetPathName(const char* basePath, const char* fileName);\\n\\n static time_t ConvertProDate(ProDate proDate);\\n\\n static ProDate ConvertProDate(time_t unixDate);\\n\\n\\n\\n /* returns \\\"true\\\" if AppleWorks aux type is used for lower-case name */\\n\\n static bool UsesAppleWorksAuxType(uint8_t fileType) {\\n\\n return (fileType >= 0x19 && fileType <= 0x1b);\\n\\n }\\n\\n\\n\\n#if 0\\n\\n /* change fPathName; should only be used by DiskFS rename */\\n\\n void SetPathName(const char* name) {\\n\",\n \"file_path\": \"diskimg/DiskImgDetail.h\",\n \"rank\": 86,\n \"score\": 24.40720651469844\n },\n {\n \"content\": \" bool isWin9x = IsWin9x();\\n\\n int itemIndex = *pItemIndex;\\n\\n\\n\\n ASSERT(pListView != NULL);\\n\\n\\n\\n drivesAvailable = GetLogicalDrives();\\n\\n if (drivesAvailable == 0) {\\n\\n LOGI(\\\"GetLogicalDrives failed, err=0x%08lx\\\", drivesAvailable);\\n\\n return false;\\n\\n }\\n\\n LOGI(\\\"GetLogicalDrives returned 0x%08lx\\\", drivesAvailable);\\n\\n\\n\\n // SetErrorMode(SEM_FAILCRITICALERRORS)\\n\\n\\n\\n /* run through the list, from A-Z */\\n\\n int i;\\n\\n for (i = 0; i < kMaxLogicalDrives; i++) {\\n\\n fVolumeInfo[i].driveType = DRIVE_UNKNOWN;\\n\\n\\n\\n if ((drivesAvailable >> i) & 0x01) {\\n\",\n \"file_path\": \"app/OpenVolumeDialog.cpp\",\n \"rank\": 87,\n \"score\": 24.40322304959824\n },\n {\n \"content\": \" WCHAR driveName[] = L\\\"_:\\\\\\\\\\\";\\n\\n driveName[0] = 'A' + i;\\n\\n\\n\\n unsigned int driveType;\\n\\n const WCHAR* driveTypeComment = NULL;\\n\\n BOOL result;\\n\\n\\n\\n driveType = fVolumeInfo[i].driveType = GetDriveType(driveName);\\n\\n switch (driveType) {\\n\\n case DRIVE_UNKNOWN:\\n\\n // The drive type cannot be determined.\\n\\n break;\\n\\n case DRIVE_NO_ROOT_DIR:\\n\\n // The root path is invalid. For example, no volume is mounted at the path.\\n\\n break;\\n\\n case DRIVE_REMOVABLE:\\n\\n // The disk can be removed from the drive.\\n\\n driveTypeComment = L\\\"Removable\\\";\\n\\n break;\\n\\n case DRIVE_FIXED:\\n\",\n \"file_path\": \"app/OpenVolumeDialog.cpp\",\n \"rank\": 88,\n \"score\": 24.38022447633507\n },\n {\n \"content\": \" ASSERT(pOutput->GetTextBuf() != NULL);\\n\\n int err = 0;\\n\\n if (fwrite(pOutput->GetTextBuf(),\\n\\n pOutput->GetTextLen(), 1, fp) != 1)\\n\\n err = errno;\\n\\n if (err != 0) {\\n\\n errMsg.Format(L\\\"Unable to save reformatted file '%ls': %hs\\\\n\\\",\\n\\n (LPCWSTR) outputPath, strerror(err));\\n\\n fpActionProgress->MessageBox(errMsg, failed,\\n\\n MB_OK | MB_ICONERROR);\\n\\n writeFailed = true;\\n\\n } else {\\n\\n SET_PROGRESS_UPDATE(100);\\n\\n }\\n\\n } else if (pOutput->GetOutputKind() == ReformatOutput::kOutputBitmap) {\\n\\n LOGI(\\\" Writing bitmap\\\");\\n\\n ASSERT(pOutput->GetDIB() != NULL);\\n\\n int err = pOutput->GetDIB()->WriteToFile(fp);\\n\\n if (err != 0) {\\n\\n errMsg.Format(L\\\"Unable to save bitmap '%ls': %hs\\\\n\\\",\\n\",\n \"file_path\": \"app/Actions.cpp\",\n \"rank\": 89,\n \"score\": 24.11423846841045\n },\n {\n \"content\": \"{\\n\\n static const WCHAR kFileArchive[] = L\\\"This appears to be a file archive.\\\";\\n\\n GenericArchive::OpenResult openResult;\\n\\n const FilterIndex origFilterIndex = filterIndex;\\n\\n GenericArchive* pOpenArchive = NULL;\\n\\n\\n\\n LOGI(\\\"LoadArchive: '%ls' ro=%d idx=%d\\\", fileName, readOnly, filterIndex);\\n\\n\\n\\n /* close any existing archive to avoid weirdness from re-open */\\n\\n CloseArchive();\\n\\n\\n\\n /*\\n\\n * If they used the \\\"All Files (*.*)\\\" filter, try guess based\\n\\n * on the file extension.\\n\\n */\\n\\n if (filterIndex == kFilterIndexGeneric) {\\n\\n int i;\\n\\n\\n\\n for (i = 0; i < NELEM(gExtensionToIndex); i++) {\\n\\n if (wcsicmp(extension, gExtensionToIndex[i].extension) == 0) {\\n\",\n \"file_path\": \"app/Main.cpp\",\n \"rank\": 90,\n \"score\": 23.968348937684112\n },\n {\n \"content\": \"/*\\n\\n * Make a control larger by the same delta as the parent window.\\n\\n */\\n\\nvoid StretchControl(CDialog* pDlg, int id, int deltaX, int deltaY,\\n\\n bool redraw = true);\\n\\n\\n\\n/*\\n\\n * Stretch and move a control.\\n\\n */\\n\\nvoid MoveStretchControl(CDialog* pDlg, int id, int moveX, int moveY,\\n\\n int stretchX, int stretchY, bool redraw = true);\\n\\n\\n\\n/*\\n\\n * Move a control so it maintains its same position relative to the bottom\\n\\n * and right edges.\\n\\n */\\n\\nHDWP MoveControl(HDWP hdwp, CDialog* pDlg, int id, int deltaX, int deltaY,\\n\\n bool redraw = true);\\n\\n\\n\\n/*\\n\",\n \"file_path\": \"util/Util.h\",\n \"rank\": 91,\n \"score\": 23.927909903494278\n },\n {\n \"content\": \"int MyRegistry::DisownExtension(const WCHAR* ext) const\\n\\n{\\n\\n ASSERT(ext != NULL);\\n\\n ASSERT(ext[0] == '.');\\n\\n if (ext == NULL || wcslen(ext) < 2)\\n\\n return -1;\\n\\n\\n\\n if (RegDeleteKeyHKCU(ext) == ERROR_SUCCESS) {\\n\\n LOGI(\\\" HKCU\\\\\\\\%ls\\\\\\\\%ls subtree deleted\\\", kFileAssocBase, ext);\\n\\n } else {\\n\\n LOGW(\\\" Failed deleting HKCU\\\\\\\\%ls\\\\\\\\'%ls'\\\", kFileAssocBase, ext);\\n\\n return -1;\\n\\n }\\n\\n\\n\\n return 0;\\n\\n}\\n\\n\\n\\nint MyRegistry::OwnExtension(const WCHAR* ext, const WCHAR* progIdKeyName) const\\n\\n{\\n\\n ASSERT(ext != NULL);\\n\",\n \"file_path\": \"app/Registry.cpp\",\n \"rank\": 92,\n \"score\": 23.719821189194327\n },\n {\n \"content\": \"static const char kEmptyFolderMarker[] = \\\".$$EmptyFolder\\\";\\n\\n\\n\\n\\n\\n/*\\n\\n * ===========================================================================\\n\\n * DiskEntry\\n\\n * ===========================================================================\\n\\n */\\n\\n\\n\\nint DiskEntry::ExtractThreadToBuffer(int which, char** ppText, long* pLength,\\n\\n CString* pErrMsg) const\\n\\n{\\n\\n DIError dierr;\\n\\n A2FileDescr* pOpenFile = NULL;\\n\\n char* dataBuf = NULL;\\n\\n bool rsrcFork;\\n\\n bool needAlloc = true;\\n\\n int result = -1;\\n\\n\\n\\n ASSERT(fpFile != NULL);\\n\",\n \"file_path\": \"app/DiskArchive.cpp\",\n \"rank\": 93,\n \"score\": 23.573678797297024\n },\n {\n \"content\": \" return;\\n\\n }\\n\\n len = pParent->SendMessage(CDM_GETFOLDERIDLIST, len,\\n\\n (LPARAM) pidlFolder);\\n\\n ASSERT(len > 0); // should fail earlier, or not at all\\n\\n\\n\\n WCHAR buf[MAX_PATH];\\n\\n BOOL result = SHGetPathFromIDList(pidlFolder, buf);\\n\\n if (result) {\\n\\n fCurrentDirectory = buf;\\n\\n } else {\\n\\n fCurrentDirectory = L\\\"\\\";\\n\\n }\\n\\n CoTaskMemFree((LPVOID) pidlFolder);\\n\\n }\\n\\n\\n\\n LOGD(\\\"OnFolderChange: '%ls'\\\", (LPCWSTR) fCurrentDirectory);\\n\\n}\\n\\n\\n\\nBOOL SelectFilesDialog::OnFileNameOK()\\n\",\n \"file_path\": \"util/SelectFilesDialog.cpp\",\n \"rank\": 94,\n \"score\": 23.44936364765088\n },\n {\n \"content\": \"void ShowFailureMsg(CWnd* pWnd, int msgId, int titleStrID);\\n\\n\\n\\n\\n\\n/*\\n\\n * Returns \\\"true\\\" if we're running on Win9x (Win95, Win98, WinME), \\\"false\\\"\\n\\n * if not (could be WinNT/2K/XP or even Win31 with Win32s).\\n\\n */\\n\\nbool IsWin9x(void);\\n\\n\\n\\n/*\\n\\n * Wrapper for CString::LoadString that checks the return value and logs a\\n\\n * complaint if the load fails.\\n\\n */\\n\\nvoid CheckedLoadString(CString* pString, UINT nID);\\n\\n\\n\\n/*\\n\\n * ====================================\\n\\n * Miscellaneous functions\\n\\n * ====================================\\n\\n */\\n\",\n \"file_path\": \"util/Util.h\",\n \"rank\": 95,\n \"score\": 23.397288660456383\n },\n {\n \"content\": \" virtual void PostNcDestroy();\\n\\n //}}AFX_VIRTUAL\\n\\n\\n\\npublic:\\n\\n BOOL Create(CWnd* pParentWnd = NULL) {\\n\\n return CDialog::Create(IDD_PROGRESS, pParentWnd);\\n\\n }\\n\\n void SetCurrentFile(const WCHAR* fileName);\\n\\n\\n\\n// Implementation\\n\\nprotected:\\n\\n // Generated message map functions\\n\\n //{{AFX_MSG(ProgressDlg)\\n\\n virtual void OnCancel();\\n\\n //}}AFX_MSG\\n\\n DECLARE_MESSAGE_MAP()\\n\\n};\\n\\n\\n\\n//{{AFX_INSERT_LOCATION}}\\n\\n// Microsoft Visual C++ will insert additional declarations immediately before the previous line.\\n\\n\\n\\n#endif // !defined(AFX_PROGRESSDLG_H__94B5552B_1337_4FA4_A336_32FA9544ADAC__INCLUDED_)\\n\",\n \"file_path\": \"mdc/ProgressDlg.h\",\n \"rank\": 96,\n \"score\": 23.38632512873862\n },\n {\n \"content\": \"#define OneStateCount(_val) ((_val) & 0xff)\\n\\n\\n\\n/*\\n\\n * Convert our collection of pulse streams into (what we hope will be)\\n\\n * Apple II nibble form.\\n\\n *\\n\\n * This modifies the contents of the minStream, maxStream, and idxStream\\n\\n * arrays.\\n\\n *\\n\\n * \\\"*pNibbleLen\\\" should hold the maximum size of the buffer. On success,\\n\\n * it will hold the actual number of bytes used.\\n\\n */\\n\\nbool WrapperFDI::ConvertPulseStreamsToNibbles(PulseIndexHeader* pHdr, int bitRate,\\n\\n uint8_t* nibbleBuf, long* pNibbleLen)\\n\\n{\\n\\n uint32_t* fakeIdxStream = NULL;\\n\\n bool result = false;\\n\\n int i;\\n\\n\\n\\n /*\\n\",\n \"file_path\": \"diskimg/FDI.cpp\",\n \"rank\": 97,\n \"score\": 23.27449651382105\n },\n {\n \"content\": \" dierr = SaveVolBitmap();\\n\\n FreeVolBitmap();\\n\\n if (dierr != kDIErrNone)\\n\\n return dierr;\\n\\n\\n\\n return kDIErrNone;\\n\\n}\\n\\n\\n\\n/*\\n\\n * Get the state of an entry in the VTOC sector use map.\\n\\n *\\n\\n * Returns \\\"true\\\" if it's in use, \\\"false\\\" otherwise.\\n\\n */\\n\\nbool DiskFSDOS33::GetSectorUseEntry(long track, int sector) const\\n\\n{\\n\\n assert(fVTOCLoaded);\\n\\n assert(track >= 0 && track < fpImg->GetNumTracks());\\n\\n assert(sector >= 0 && sector < fpImg->GetNumSectPerTrack());\\n\\n\\n\\n uint32_t val, mask;\\n\",\n \"file_path\": \"diskimg/DOS33.cpp\",\n \"rank\": 98,\n \"score\": 23.23130831447392\n },\n {\n \"content\": \" * Returns a pointer to the pixel storage on success, or NULL on failure.\\n\\n */\\n\\n void* Create(int width, int height, int bitsPerPixel, int colorsUsed,\\n\\n bool dibSection = false);\\n\\n\\n\\n /*\\n\\n * Set the values in the color table.\\n\\n */\\n\\n void SetColorTable(const RGBQUAD* pColorTable);\\n\\n\\n\\n const RGBQUAD* GetColorTable(void) const { return mpColorTable; }\\n\\n\\n\\n /*\\n\\n * Zero out a bitmap's pixels. Does not touch the color table.\\n\\n */\\n\\n void ClearPixels(void);\\n\\n\\n\\n /*\\n\\n * Create a DDB from the current bitmap in the specified DC, and return its\\n\\n * handle. The returned handle must eventually be disposed with DeleteObject.\\n\",\n \"file_path\": \"util/MyDIBitmap.h\",\n \"rank\": 99,\n \"score\": 23.01072730005132\n }\n]","isConversational":false}}},{"rowIdx":498,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"include/dll/datasets/imagenet.hpp"},"repo_name":{"kind":"string","value":"jw-j/dll"},"commit":{"kind":"string","value":"2a72ec0a5c8d52de5565eb5075bc44f078955fca"},"file_code":{"kind":"string","value":"\n\n#pragma once\n\n#include <vector>\n#include <unordered_map>\n#include <utility>\n#include <string>\n\n#include <dirent.h>\n\n#include <opencv2/highgui/highgui.hpp>\n\nnamespace dll {\n\nnamespace imagenet {\n\ninline void read_files(std::vector<std::pair<size_t, size_t>>& files, std::unordered_map<size_t, float>& label_map, const std::string& file_path){\n files.reserve(1200000);\n\n struct dirent* entry;\n auto dir = opendir(file_path.c_str());\n\n while ((entry = readdir(dir))) {\n std::string file_name(entry->d_name);\n\n if (file_name.find(\"n\") != 0) {\n continue;\n }\n\n std::string label_name(file_name.begin() + 1, file_name.end());\n size_t label = std::atoi(label_name.c_str());\n\n auto l = label_map.size();\n label_map[label] = l;\n\n struct dirent* sub_entry;\n auto sub_dir = opendir((file_path + \"/\" + file_name).c_str());\n\n while ((sub_entry = readdir(sub_dir))) {\n std::string image_name(sub_entry->d_name);\n\n if (image_name.find(\"n\") != 0){\n continue;\n }\n\n std::string image_number(image_name.begin() + image_name.find('_') + 1, image_name.end() - 5);\n size_t image = std::atoi(image_number.c_str());\n\n files.emplace_back(label, image);\n }\n }\n}\n\nstruct image_iterator : std::iterator<\n std::input_iterator_tag,\n etl::fast_dyn_matrix<float, 3, 256, 256>,\n ptrdiff_t,\n etl::fast_dyn_matrix<float, 3, 256, 256>*,\n etl::fast_dyn_matrix<float, 3, 256, 256>&\n > {\n\n using value_type = etl::fast_dyn_matrix<float, 3, 256, 256>;\n\n std::string imagenet_path;\n std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files;\n std::shared_ptr<std::unordered_map<size_t, float>> labels;\n\n size_t index;\n\n image_iterator(const std::string& imagenet_path, std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files, std::shared_ptr<std::unordered_map<size_t, float>> labels, size_t index) :\n imagenet_path(imagenet_path), files(files), labels(labels), index(index)\n {\n \n }\n\n image_iterator(image_iterator&& rhs) = default;\n image_iterator(const image_iterator& rhs) = default;\n\n image_iterator& operator=(image_iterator&& rhs) = default;\n image_iterator& operator=(const image_iterator& rhs) = default;\n\n image_iterator& operator++(){\n ++index;\n return *this;\n }\n\n \n \n image_iterator operator++(int){\n cpp_unreachable(\"Should never be called\");\n\n return *this;\n }\n\n value_type operator*() {\n auto& image_file = (*files)[index];\n\n auto label = std::string(\"/n\") + (image_file.first < 10000000 ? \"0\" : \"\") + std::to_string(image_file.first);\n\n auto image_path =\n std::string(imagenet_path) + \"/train\" + label + label +\n \"_\" + std::to_string(image_file.second) + \".JPEG\";\n\n auto mat = cv::imread(image_path.c_str(), cv::IMREAD_ANYCOLOR | cv::IMREAD_ANYDEPTH);\n\n value_type image;\n\n if (!mat.data || mat.empty()) {\n std::cerr << \"ERROR: Failed to read image: \" << image_path << std::endl;\n image = 0;\n return image;\n }\n\n if (mat.cols != 256 || mat.rows != 256) {\n std::cerr << \"ERROR: Image of invalid size: \" << image_path << std::endl;\n image = 0;\n return image;\n }\n\n if (cpp_likely(mat.channels() == 3)) {\n for (size_t x = 0; x < 256; ++x) {\n for (size_t y = 0; y < 256; ++y) {\n auto pixel = mat.at<cv::Vec3b>(y, x);\n\n image(0, x, y) = pixel.val[0];\n image(1, x, y) = pixel.val[1];\n image(2, x, y) = pixel.val[2];\n }\n }\n } else {\n for (size_t x = 0; x < 256; ++x) {\n for (size_t y = 0; y < 256; ++y) {\n image(0, x, y) = mat.at<unsigned char>(y, x);\n }\n }\n\n image(1) = 0;\n image(2) = 0;\n }\n\n return image;\n }\n\n bool operator==(const image_iterator& rhs) const {\n return index == rhs.index;\n }\n\n bool operator!=(const image_iterator& rhs) const {\n return index != rhs.index;\n }\n};\n\nstruct label_iterator : std::iterator<\n std::input_iterator_tag,\n float,\n ptrdiff_t,\n float*,\n float&\n > {\n\n std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files;\n std::shared_ptr<std::unordered_map<size_t, float>> labels;\n\n size_t index;\n\n label_iterator(std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files, std::shared_ptr<std::unordered_map<size_t, float>> labels, size_t index) :\n files(files), labels(labels), index(index)\n {\n \n }\n\n label_iterator(const label_iterator& rhs) = default;\n label_iterator(label_iterator&& rhs) = default;\n\n label_iterator& operator=(const label_iterator& rhs) = default;\n label_iterator& operator=(label_iterator&& rhs) = default;\n\n label_iterator& operator++(){\n ++index;\n return *this;\n }\n\n label_iterator operator++(int){\n auto it = *this;\n ++index;\n return it;\n }\n\n float operator*() const {\n return (*labels)[(*files)[index].first];\n }\n\n bool operator==(const label_iterator& rhs) const {\n return index == rhs.index;\n }\n\n bool operator!=(const label_iterator& rhs) const {\n return index != rhs.index;\n }\n};\n\n} \n\ntemplate<typename... Parameters>\nauto make_imagenet_dataset(const std::string& folder, Parameters&&... ){\n auto train_files = std::make_shared<std::vector<std::pair<size_t, size_t>>>();\n auto labels = std::make_shared<std::unordered_map<size_t, float>>();\n\n imagenet::read_files(*train_files, *labels, std::string(folder) + \"train\");\n\n \n std::random_device rd;\n std::default_random_engine engine(rd());\n std::shuffle(train_files->begin(), train_files->end(), engine);\n\n \n imagenet::image_iterator iit(folder, train_files, labels, 0);\n imagenet::image_iterator iend(folder, train_files, labels, train_files->size());\n\n \n imagenet::label_iterator lit(train_files, labels, 0);\n imagenet::label_iterator lend(train_files, labels, train_files->size());\n\n return make_dataset_holder(\n make_generator(iit, iend, lit, lend, train_files->size(), 1000, dll::outmemory_data_generator_desc<Parameters..., dll::categorical>{}),\n make_generator(iit, iend, lit, lend, train_files->size(), 1000, dll::outmemory_data_generator_desc<Parameters..., dll::categorical>{}));\n}\n\n} \n"},"prefix":{"kind":"string","value":"\n\n#pragma once\n\n#include <vector>\n#include <unordered_map>\n#include <utility>\n#include <string>\n\n#include <dirent.h>\n\n#include <opencv2/highgui/highgui.hpp>\n\nnamespace dll {\n\nnamespace imagenet {\n\ninline void read_files(std::vector<std::pair<size_t, size_t>>& files, std::unordered_map<size_t, float>& label_map, const std::string& file_path){\n files.reserve(1200000);\n\n struct dirent* entry;\n auto dir = opendir(file_path.c_str());\n\n while ((entry = readdir(dir))) {\n std::string file_name(entry->d_name);\n\n if (file_name.find(\"n\") != 0) {\n continue;\n }\n\n std::string label_name(file_name.begin() + 1, file_name.end());\n size_t label = std::atoi(label_name.c_str());\n\n auto l = label_map.size();\n label_map[label] = l;\n\n struct dirent* sub_entry;\n auto sub_dir = opendir((file_path + \"/\" + file_name).c_str());\n\n while ((sub_entry = readdir(sub_dir))) {\n std::string image_name(sub_entry->d_name);\n\n if (image_name.find(\"n\") != 0){\n continue;\n }\n\n std::string image_number(image_name.begin() + image_name.find('_') + 1, image_name.end() - 5);\n size_t image = std::atoi(image_number.c_str());\n\n files.emplace_back(label, image);\n }\n }\n}\n\nstruct image_iterator : std::iterator<\n std::input_iterator_tag,\n etl::fast_dyn_matrix<float, 3, 256, 256>,\n ptrdiff_t,\n etl::fast_dyn_matrix<float, 3, 256, 256>*,\n etl::fast_dyn_matrix<float, 3, 256, 256>&\n > {\n\n using value_type = etl::fast_dyn_matrix<float, 3, 256, 256>;\n\n std::string imagenet_path;\n std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files;\n std::shared_ptr<std::unordered_map<size_t, float>> labels;\n\n size_t index;\n\n image_iterator(const std::string& imagenet_path, std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files, std::shared_ptr<std::unordered_map<size_t, float>> labels, size_t index) :\n imagenet_path(imagenet_path), files(files), labels(labels), index(index)\n {\n \n }\n\n image_iterator(image_iterator&& rhs) = default;\n image_iterator(const image_iterator& rhs) = default;\n\n image_iterator& operator=(image_iterator&& rhs) = default;\n image_iterator& operator=(const image_iterator& rhs) = default;\n\n image_iterator& operator++(){\n ++index;\n return *this;\n }\n\n \n \n image_iterator operator++(int){\n cpp_unreachable(\"Should never be called\");\n\n return *this;\n }\n\n value_type operator*() {\n auto& image_file = (*files)[index];\n\n auto label = std::string(\"/n\") + (image_file.first < 10000000 ? \"0\" : \"\") + std::to_string(image_file.first);\n\n auto image_path =\n std::string(imagenet_path) + \"/train\" + label + label +\n \"_\" + std::to_string(image_file.second) + \".JPEG\";\n\n auto mat = cv::imread(image_path.c_str(), cv::IMREAD_ANYCOLOR | cv::IMREAD_ANYDEPTH);\n\n value_type image;\n\n if (!mat.data || mat.empty()) {\n std::cerr << \"ERROR: Failed to read image: \" << image_path << std::endl;\n image = 0;\n return image;\n }\n\n if (mat.cols != 256 || mat.rows != 256) {\n std::cerr << \"ERROR: Image of invalid size: \" << image_path << std::endl;\n image = 0;\n return image;\n }\n\n if (cpp_likely(mat.channels() == 3)) {\n for (size_t x = 0; x < 256; ++x) {\n for (size_t y = 0; y < 256; ++y) {\n auto pixel = mat.at<cv::Vec3b>(y, x);\n\n image(0, x, y) = pixel.val[0];\n image(1, x, y) = pixel.val[1];\n image(2, x, y) = pixel.val[2];\n }\n }\n } else {\n for (size_t x = 0; x < 256; ++x) {\n for (size_t y = 0; y < 256; ++y) {\n image(0, x, y) = mat.at<unsigned char>(y, x);\n }\n }\n\n image(1) = 0;\n image(2) = 0;\n }\n\n return image;\n }\n\n bool operator==(const image_iterator& rhs) const {\n return index == rhs.index;\n }\n\n bool operator!=(const image_iterator& rhs) const {\n return index != rhs.index;\n }\n};\n\nstruct label_iterator : std::iterator<\n std::input_iterator_tag,\n float,\n ptrdiff_t,\n float*,\n float&\n > {\n\n std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files;\n std::shared_ptr<std::unordered_map<size_t, float>> labels;\n\n size_t index;\n\n label_iterator(std::shared_ptr<std::vector<std::pair<size_t, size_t>>> files, s"},"suffix":{"kind":"string","value":"l_iterator&& rhs) = default;\n\n label_iterator& operator++(){\n ++index;\n return *this;\n }\n\n label_iterator operator++(int){\n auto it = *this;\n ++index;\n return it;\n }\n\n float operator*() const {\n return (*labels)[(*files)[index].first];\n }\n\n bool operator==(const label_iterator& rhs) const {\n return index == rhs.index;\n }\n\n bool operator!=(const label_iterator& rhs) const {\n return index != rhs.index;\n }\n};\n\n} \n\ntemplate<typename... Parameters>\nauto make_imagenet_dataset(const std::string& folder, Parameters&&... ){\n auto train_files = std::make_shared<std::vector<std::pair<size_t, size_t>>>();\n auto labels = std::make_shared<std::unordered_map<size_t, float>>();\n\n imagenet::read_files(*train_files, *labels, std::string(folder) + \"train\");\n\n \n std::random_device rd;\n std::default_random_engine engine(rd());\n std::shuffle(train_files->begin(), train_files->end(), engine);\n\n \n imagenet::image_iterator iit(folder, train_files, labels, 0);\n imagenet::image_iterator iend(folder, train_files, labels, train_files->size());\n\n \n imagenet::label_iterator lit(train_files, labels, 0);\n imagenet::label_iterator lend(train_files, labels, train_files->size());\n\n return make_dataset_holder(\n make_generator(iit, iend, lit, lend, train_files->size(), 1000, dll::outmemory_data_generator_desc<Parameters..., dll::categorical>{}),\n make_generator(iit, iend, lit, lend, train_files->size(), 1000, dll::outmemory_data_generator_desc<Parameters..., dll::categorical>{}));\n}\n\n} \n"},"middle":{"kind":"string","value":"td::shared_ptr<std::unordered_map<size_t, float>> labels, size_t index) :\n files(files), labels(labels), index(index)\n {\n \n }\n\n label_iterator(const label_iterator& rhs) = default;\n label_iterator(label_iterator&& rhs) = default;\n\n label_iterator& operator=(const label_iterator& rhs) = default;\n label_iterator& operator=(labe"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"struct random_crop : value_pair_conf_elt<random_crop_id, size_t, X, Y> {};\n\n\n\n/*!\n\n * \\brief Elastic distortion\n\n */\n\ntemplate <size_t C, size_t K = 9>\n","file_path":"include/dll/base_conf.hpp","rank":0,"score":284440.7828568713},{"content":"struct converter_one<std::vector<T_F, A>, etl::dyn_matrix<T_T, 1>> {\n\n static_assert(std::is_convertible<T_F, T_T>::value, \"DLL cannot convert your value type to the weight type (one)\");\n\n\n\n /*!\n\n * \\brief Convert from the given container into the specific type\n\n * \\param l The layer for which to convert\n\n * \\param from The container to convert from\n\n * \\return the converted result\n\n */\n\n template<typename L>\n\n static etl::dyn_matrix<T_T, 1> convert(const L&, const std::vector<T_F, A>& from){\n\n debug_convert(\"converter::one\");\n\n etl::dyn_matrix<T_T, 1> c;\n\n c = from;\n\n return c;\n\n }\n\n};\n\n\n\n// Convert a list<T_F> to a dyn_vector<T_T>\n\n\n\n/*!\n\n * \\copydoc converter_one\n\n */\n\ntemplate<typename T_F, typename T_T, typename A>\n","file_path":"include/dll/util/converter.hpp","rank":1,"score":277641.09570838197},{"content":"struct fake_label_array {\n\n using value_type = V;\n\n using this_type = fake_label_array<value_type>;\n\n\n\n value_type value;\n\n\n\n fake_label_array(value_type v)\n\n : value(v) {}\n\n\n\n double operator[](size_t i) const {\n\n if (i == value) {\n\n return 1.0;\n\n } else {\n\n return 0.0;\n\n }\n\n }\n\n};\n\n\n\ntemplate <typename Iterator>\n\nstd::vector<fake_label_array<std::remove_cv_t<typename std::iterator_traits<Iterator>::value_type>>> make_fake(Iterator first, Iterator last) {\n","file_path":"include/dll/util/labels.hpp","rank":2,"score":265176.9558043879},{"content":"struct auto_timer {\n\n const char* name; ///< The name of the timer\n\n std::chrono::time_point<std::chrono::steady_clock> start; ///< The start time\n\n std::chrono::time_point<std::chrono::steady_clock> end; ///< The end time\n\n\n\n /*!\n\n * \\brief Create an auto_timer witht the given name\n\n * \\param name The name of the timer\n\n */\n\n auto_timer(const char* name) : name(name) {\n\n start = std::chrono::steady_clock::now();\n\n }\n\n\n\n /*!\n\n * \\brief Destructs the timer, effectively incrementing the timer.\n\n */\n\n ~auto_timer() {\n\n end = std::chrono::steady_clock::now();\n\n auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count();\n\n\n","file_path":"include/dll/util/timers.hpp","rank":3,"score":258686.65767264448},{"content":"struct is_generator_impl<T, decltype((void)T::dll_generator, 0)> : std::true_type {};\n\n\n\n/*!\n\n * \\brief Traits to test if a type is DLL generator or not\n\n */\n\ntemplate <typename T>\n\nconstexpr bool is_generator = is_generator_impl<T>::value;\n\n\n\n/*!\n\n * \\brief Helper to tell from the generator description if it is\n\n * augmenting the data\n\n */\n\ntemplate<typename Desc>\n\nconstexpr bool is_augmented =\n\n (Desc::random_crop_x > 0 && Desc::random_crop_y > 0)\n\n || Desc::HorizontalMirroring || Desc::VerticalMirroring || Desc::Noise || Desc::ElasticDistortion;\n\n\n\n/*!\n\n * \\brief Helper to tell from the generator description if it is\n\n * threaded.\n\n */\n\ntemplate<typename Desc>\n\nstatic constexpr bool is_threaded = Desc::Threaded;\n\n\n\n} // end of namespace dll\n\n\n\n#include \"dll/generators/inmemory_data_generator.hpp\"\n\n#include \"dll/generators/outmemory_data_generator.hpp\"\n","file_path":"include/dll/generators.hpp","rank":4,"score":247894.685443361},{"content":"struct converter_one<std::vector<T_F, A>, etl::dyn_matrix<T_T, D>> {\n\n static_assert(std::is_convertible<T_F, T_T>::value, \"DLL cannot convert your value type to the weight type (one)\");\n\n\n\n /*!\n\n * \\brief Convert from the given container into the specific type\n\n * \\param l The layer for which to convert\n\n * \\param from The container to convert from\n\n * \\return the converted result\n\n */\n\n template<typename L>\n\n static etl::dyn_matrix<T_T, D> convert(const L& l, const std::vector<T_F, A>& from){\n\n debug_convert(\"converter::one\");\n\n etl::dyn_matrix<T_T, D> converted;\n\n l.prepare_input(converted);\n\n converted = from;\n\n return converted;\n\n }\n\n};\n\n\n\n// Convert a list<T_F> to a dyn_matrix<T_T, D>\n\n\n\n/*!\n\n * \\copydoc converter_one\n\n */\n\ntemplate<typename T_F, typename T_T, typename A, size_t D>\n","file_path":"include/dll/util/converter.hpp","rank":7,"score":243676.88061547733},{"content":"struct converter_one<std::vector<T_F, A>, etl::fast_dyn_matrix<T_T, Dims...>> {\n\n static_assert(std::is_convertible<T_F, T_T>::value, \"DLL cannot convert your value type to the weight type (one)\");\n\n\n\n /*!\n\n * \\brief Convert from the given container into the specific type\n\n * \\param l The layer for which to convert\n\n * \\param from The container to convert from\n\n * \\return the converted result\n\n */\n\n template<typename L>\n\n static etl::fast_dyn_matrix<T_T, Dims...> convert(const L&, const std::vector<T_F, A>& from){\n\n debug_convert(\"converter::one\");\n\n etl::fast_dyn_matrix<T_T, Dims...> c;\n\n c = from;\n\n return c;\n\n }\n\n};\n\n\n\n// Convert a list<T_F> to a fast_dyn_matrix<T_T, Dims...>\n\n\n\n/*!\n\n * \\copydoc converter_one\n\n */\n\ntemplate<typename T_F, typename T_T, typename A, size_t... Dims>\n","file_path":"include/dll/util/converter.hpp","rank":8,"score":240473.11091447232},{"content":"struct sequence_add <std::index_sequence<I...>, N> {\n\n using type = std::index_sequence<I..., N>;\n\n};\n\n\n\ntemplate <typename T, size_t F, size_t L, typename Acc, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":9,"score":237429.75926227216},{"content":"struct get_value<D> : cpp::auto_constant<D> {};\n\n\n\n/*!\n\n * \\brief Extract the value corresponding to the given configuration element from the parameters.\n\n * \\tparam D The configuration element type\n\n * \\tparam Args The arguments to extract the value from\n\n */\n\ntemplate <typename D, typename... Args>\n\nconstexpr const auto get_value_v = get_value<D, Args...>::value;\n\n\n\n/*!\n\n * \\brief Extract the first value corresponding to the given configuration element from the parameters.\n\n * \\tparam D The configuration element type\n\n * \\tparam Args The arguments to extract the value from\n\n */\n\ntemplate <typename D, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":10,"score":233489.25109846765},{"content":"struct batch_size : value_conf_elt<batch_size_id, size_t, B> {};\n\n\n\n/*!\n\n * \\brief Sets the big batch size.\n\n *\n\n * This is the number of minibatch that the DBN will load at once.\n\n *\n\n * \\tparam B The big batch size\n\n */\n\ntemplate <size_t B>\n","file_path":"include/dll/base_conf.hpp","rank":11,"score":233183.8541005827},{"content":"struct dyn_layers_t <dll::detail::layers<Labels, Layers...>> {\n\n using dyn_t = dll::detail::layers<Labels, typename Layers::desc::dyn_layer_t...>;\n\n};\n\n\n\ntemplate <template <typename> class DBN_T, typename Layers, typename... Parameters>\n","file_path":"include/dll/dbn_desc.hpp","rank":12,"score":231431.09440118214},{"content":"struct validate_weight_type_impl< I, DBN, T, std::enable_if_t<(I == DBN::layers_t::size - 1)> > {\n\n static constexpr bool value = weight_type_same<I, DBN, T>::value;\n\n};\n\n\n\ntemplate <size_t I, typename DBN, typename T>\n","file_path":"include/dll/dbn_detail.hpp","rank":13,"score":229272.8819218221},{"content":"struct validate_weight_type_impl< I, DBN, T, std::enable_if_t<(I < DBN::layers_t::size - 1)> > {\n\n static constexpr bool value = weight_type_same<I, DBN, T>::value && validate_weight_type_impl<I + 1, DBN, T>::value;\n\n};\n\n\n\ntemplate <typename DBN, typename T>\n","file_path":"include/dll/dbn_detail.hpp","rank":14,"score":229272.8819218221},{"content":"struct big_batch_size : value_conf_elt<big_batch_size_id, size_t, B> {};\n\n\n\n/*!\n\n * \\brief Sets the updater type\n\n * \\tparam UT The updater type\n\n */\n\ntemplate <updater_type UT>\n","file_path":"include/dll/base_conf.hpp","rank":15,"score":228351.4816077628},{"content":"struct for_each_impl<D, 1, std::index_sequence<I...>> {\n\n D& dbn;\n\n\n\n for_each_impl(D& dbn)\n\n : dbn(dbn) {}\n\n\n\n template <typename Functor>\n\n void for_each_layer(Functor&& functor) {\n\n functor(dbn.template layer_get<0>());\n\n }\n\n\n\n template <typename Functor>\n\n void for_each_layer_i(Functor&& functor) {\n\n functor(dbn.template layer_get<0>(), 0);\n\n }\n\n\n\n template <typename Functor>\n\n void for_each_layer_pair(Functor&& functor) {\n\n cpp_unused(functor);\n\n // Nothing to do here\n","file_path":"include/dll/dbn_detail.hpp","rank":16,"score":227608.53908734157},{"content":"struct validate_label_layers<L1, L2, Layers...> : cpp::bool_constant_c<\n\n cpp::and_u<\n\n L1::output_size() <= L2::input_size(),\n\n validate_label_layers<L2, Layers...>::value>> {};\n\n\n\n} // end of namespace detail\n\n\n\nnamespace detail {\n\n\n\n/*!\n\n * \\brief A leaf in the list of layers.\n\n */\n\ntemplate <size_t I, typename T>\n","file_path":"include/dll/dbn_layers.hpp","rank":17,"score":225480.8727049497},{"content":"struct build_dyn_layer_t <Layer, Desc, std::index_sequence<I...>, Args...> {\n\n using type = Layer<Desc<cpp::nth_type_t<I, Args...>...>>;\n\n};\n\n\n\ntemplate <typename Index, size_t N>\n","file_path":"include/dll/util/tmp.hpp","rank":18,"score":224535.92551801988},{"content":"struct conditional_constant_v1<false, V1, V2> : cpp::auto_constant<V2> {};\n\n\n\n/*!\n\n * \\brief A conditional constant extracting the member value_2 from V1 or value V2 depending on the condition\n\n * \\tparam C The boolean value\n\n * \\tparam V1 The first value class\n\n * \\tparam V2 The second value class\n\n */\n\ntemplate <bool C, typename V1, typename V2>\n","file_path":"include/dll/util/tmp.hpp","rank":19,"score":220991.15266661355},{"content":"struct conditional_constant_v2<false, V1, V2> : cpp::auto_constant<V2> {};\n\n\n\ntemplate <typename V, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":20,"score":220991.15266661355},{"content":"struct copy : value_conf_elt<copy_id, size_t, C> {};\n\n\n\n/*!\n\n * \\brief Sets the random cropping size\n\n * \\tparam B The minibatch size\n\n */\n\ntemplate <size_t X, size_t Y>\n","file_path":"include/dll/base_conf.hpp","rank":21,"score":220599.29825140198},{"content":"struct noise : value_conf_elt<noise_id, size_t, N> {};\n\n\n\n/*!\n\n * \\brief Sets the prescaling factor\n\n * \\tparam S The scaling factor\n\n */\n\ntemplate <size_t S>\n","file_path":"include/dll/base_conf.hpp","rank":22,"score":220599.29825140198},{"content":"struct sgd_context<DBN, rbm_impl<Desc>, L> {\n\n using layer_t = rbm_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto num_visible = layer_t::num_visible;\n\n static constexpr auto num_hidden = layer_t::num_hidden;\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, num_visible> input;\n\n etl::fast_matrix<weight, batch_size, num_hidden> output;\n\n etl::fast_matrix<weight, batch_size, num_hidden> errors;\n\n\n\n sgd_context(layer_t& /*layer*/)\n\n : output(0.0), errors(0.0) {}\n\n};\n\n\n\n/*!\n\n * \\brief specialization of cg_context for rbm\n\n */\n\ntemplate <typename Desc>\n","file_path":"include/dll/rbm/rbm_impl.hpp","rank":23,"score":220221.30116069884},{"content":"struct binarize_pre : value_conf_elt<binarize_pre_id, size_t, B> {};\n\n\n\n/*!\n\n * \\brief Normalize the inputs\n\n */\n","file_path":"include/dll/base_conf.hpp","rank":24,"score":214930.15944975824},{"content":"struct elastic_distortion : value_conf_elt<elastic_distortion_id, size_t, K> {};\n\n\n\n/*!\n\n * \\brief Sets the noise\n\n * \\tparam N The percent of noise\n\n */\n\ntemplate <size_t N>\n","file_path":"include/dll/base_conf.hpp","rank":25,"score":214930.15944975824},{"content":"struct scale_pre : value_conf_elt<scale_pre_id, size_t, S> {};\n\n\n\n/*!\n\n * \\brief Sets the binarize threshold\n\n * \\tparam B The binarize threshold\n\n */\n\ntemplate <size_t B>\n","file_path":"include/dll/base_conf.hpp","rank":26,"score":214930.15944975818},{"content":"struct sgd_context<DBN, mp_2d_layer_impl<Desc>, L> {\n\n using layer_t = mp_2d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\n\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\n\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\n\n\n\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\n\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\n\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\n\n\n\n sgd_context(mp_2d_layer_impl<Desc>& /*layer*/){}\n\n};\n\n\n\n/*!\n\n * \\brief Standard max pooling layer (3D pooling)\n\n */\n\ntemplate <typename Desc>\n","file_path":"include/dll/pooling/mp_layer_impl.hpp","rank":27,"score":214554.8044468202},{"content":"struct sgd_context<DBN, rectifier_layer_impl<Desc>, L> {\n\n using layer_t = rectifier_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/rectifier_layer_impl.hpp","rank":28,"score":214554.8044468202},{"content":"struct sgd_context<DBN, shape_1d_layer_impl<Desc>, L> {\n\n using layer_t = shape_1d_layer_impl<Desc>;\n\n using weight = typename DBN::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, layer_t::Size> input;\n\n etl::fast_matrix<weight, batch_size, layer_t::Size> output;\n\n etl::fast_matrix<weight, batch_size, layer_t::Size> errors;\n\n\n\n sgd_context(const shape_1d_layer_impl<Desc>& /* layer */){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/shape_1d_layer_impl.hpp","rank":29,"score":214554.8044468202},{"content":"struct sgd_context<DBN, normalize_layer_impl<Desc>, L> {\n\n using layer_t = normalize_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/normalize_layer_impl.hpp","rank":30,"score":214554.8044468202},{"content":"struct sgd_context<DBN, dropout_layer_impl<Desc>, L> {\n\n using layer_t = dropout_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dropout_layer_impl.hpp","rank":31,"score":214554.8044468202},{"content":"struct sgd_context<DBN, conv_rbm_impl<Desc>, L> {\n\n using layer_t = conv_rbm_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t NV1 = layer_t::NV1;\n\n static constexpr size_t NV2 = layer_t::NV2;\n\n static constexpr size_t NH1 = layer_t::NH1;\n\n static constexpr size_t NH2 = layer_t::NH2;\n\n static constexpr size_t NW1 = layer_t::NW1;\n\n static constexpr size_t NW2 = layer_t::NW2;\n\n static constexpr size_t NC = layer_t::NC;\n\n static constexpr size_t K = layer_t::K;\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\n\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> output;\n\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> errors;\n\n\n\n sgd_context(layer_t& /*layer*/)\n\n : output(0.0), errors(0.0) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/rbm/conv_rbm_impl.hpp","rank":32,"score":214554.8044468202},{"content":"struct sgd_context<DBN, lcn_layer_impl<Desc>, L> {\n\n using layer_t = lcn_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/lcn_layer_impl.hpp","rank":33,"score":214554.8044468202},{"content":"struct sgd_context<DBN, shape_3d_layer_impl<Desc>, L> {\n\n using layer_t = shape_3d_layer_impl<Desc>;\n\n using weight = typename DBN::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, layer_t::C, layer_t::H, layer_t::W> input;\n\n etl::fast_matrix<weight, batch_size, layer_t::C, layer_t::H, layer_t::W> output;\n\n etl::fast_matrix<weight, batch_size, layer_t::C, layer_t::H, layer_t::W> errors;\n\n\n\n sgd_context(const shape_3d_layer_impl<Desc>& /* layer */){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/shape_3d_layer_impl.hpp","rank":34,"score":214554.8044468202},{"content":"struct sgd_context<DBN, dyn_rbm_impl<Desc>, L> {\n\n using layer_t = dyn_rbm_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 2> input;\n\n etl::dyn_matrix<weight, 2> output;\n\n etl::dyn_matrix<weight, 2> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.num_visible, 0.0), output(batch_size, layer.num_hidden, 0.0), errors(batch_size, layer.num_hidden, 0.0) {}\n\n};\n\n\n\n/*!\n\n * \\brief Specialzation of cg_context for dyn_rbm_impl\n\n */\n\ntemplate <typename Desc>\n","file_path":"include/dll/rbm/dyn_rbm_impl.hpp","rank":35,"score":214554.8044468202},{"content":"struct sgd_context<DBN, mp_3d_layer_impl<Desc>, L> {\n\n using layer_t = mp_3d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\n\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\n\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\n\n\n\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\n\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\n\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\n\n\n\n sgd_context(mp_3d_layer_impl<Desc>& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/pooling/mp_layer_impl.hpp","rank":36,"score":214554.8044468202},{"content":"struct sgd_context<DBN, deconv_layer_impl<Desc>, L> {\n\n using layer_t = deconv_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t NV1 = layer_t::NV1;\n\n static constexpr size_t NV2 = layer_t::NV2;\n\n static constexpr size_t NH1 = layer_t::NH1;\n\n static constexpr size_t NH2 = layer_t::NH2;\n\n static constexpr size_t NW1 = layer_t::NW1;\n\n static constexpr size_t NW2 = layer_t::NW2;\n\n static constexpr size_t NC = layer_t::NC;\n\n static constexpr size_t K = layer_t::K;\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\n\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> output;\n\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> errors;\n\n\n\n sgd_context(layer_t& /* layer */)\n\n : output(0.0), errors(0.0) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/deconv_layer_impl.hpp","rank":37,"score":214554.8044468202},{"content":"struct sgd_context<DBN, conv_layer_impl<Desc>, L> {\n\n using layer_t = conv_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t NV1 = layer_t::NV1;\n\n static constexpr size_t NV2 = layer_t::NV2;\n\n static constexpr size_t NH1 = layer_t::NH1;\n\n static constexpr size_t NH2 = layer_t::NH2;\n\n static constexpr size_t NW1 = layer_t::NW1;\n\n static constexpr size_t NW2 = layer_t::NW2;\n\n static constexpr size_t NC = layer_t::NC;\n\n static constexpr size_t K = layer_t::K;\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\n\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> output;\n\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> errors;\n\n\n\n sgd_context(conv_layer_impl<Desc>& /* layer */)\n\n : output(0.0), errors(0.0) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/conv_layer_impl.hpp","rank":38,"score":214554.8044468202},{"content":"struct full_sgd_context : sgd_context<DBN, Layer, L> {\n\n using context_type = sgd_context<DBN, Layer, L>; ///< The parent context type\n\n\n\n /*!\n\n * \\brief The updater context\n\n */\n\n updater_context<DBN::updater, decay_layer_traits<Layer>::is_neural_layer(), Layer> up;\n\n\n\n /*!\n\n * \\brief Construct the full_sgd_context for the given layer\n\n */\n\n full_sgd_context(Layer& layer) : context_type(layer), up(layer) {\n\n // Nothing else to init\n\n }\n\n};\n\n\n\n/*!\n\n * \\brief Build the context for a DBN for the given sequence of layers\n\n * \\param dbn The DBN to build the context from\n\n */\n","file_path":"include/dll/trainer/stochastic_gradient_descent.hpp","rank":39,"score":214554.80444682026},{"content":"struct sgd_context<DBN, random_layer_impl<Desc>, L> {\n\n using layer_t = random_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/random_layer_impl.hpp","rank":40,"score":214554.8044468202},{"content":"struct sgd_context<DBN, binarize_layer_impl<Desc>, L> {\n\n using layer_t = binarize_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n/*!\n\n * \\brief Specialization of cg_context for binarize_layer_impl\n\n */\n\ntemplate <typename Desc>\n","file_path":"include/dll/transform/binarize_layer_impl.hpp","rank":41,"score":214554.8044468202},{"content":"struct sgd_context<DBN, avgp_3d_layer_impl<Desc>, L> {\n\n using layer_t = avgp_3d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\n\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\n\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\n\n\n\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\n\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\n\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\n\n\n\n sgd_context(avgp_3d_layer_impl<Desc>& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/pooling/avgp_layer_impl.hpp","rank":42,"score":214554.8044468202},{"content":"struct sgd_context<DBN, dense_layer_impl<Desc>, L> {\n\n using layer_t = dense_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto num_visible = layer_t::num_visible;\n\n static constexpr auto num_hidden = layer_t::num_hidden;\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, num_visible> input;\n\n etl::fast_matrix<weight, batch_size, num_hidden> output;\n\n etl::fast_matrix<weight, batch_size, num_hidden> errors;\n\n\n\n sgd_context(const dense_layer_impl<Desc>& /* layer */)\n\n : output(0.0), errors(0.0) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dense_layer_impl.hpp","rank":43,"score":214554.8044468202},{"content":"struct sgd_context<DBN, activation_layer_impl<Desc>, L> {\n\n using layer_t = activation_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/activation_layer_impl.hpp","rank":44,"score":214554.8044468202},{"content":"struct sgd_context<DBN, upsample_3d_layer_impl<Desc>, L> {\n\n using layer_t = upsample_3d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\n\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\n\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\n\n\n\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\n\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\n\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\n\n\n\n sgd_context(layer_t& /*layer*/) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/pooling/upsample_layer_impl.hpp","rank":45,"score":214554.8044468202},{"content":"struct sgd_context<DBN, avgp_2d_layer_impl<Desc>, L> {\n\n using layer_t = avgp_2d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\n\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\n\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\n\n\n\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\n\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\n\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\n\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\n\n\n\n sgd_context(avgp_2d_layer_impl<Desc>& /*layer*/){}\n\n};\n\n\n\n/*!\n\n * \\brief Standard average pooling layer\n\n */\n\ntemplate <typename Desc>\n","file_path":"include/dll/pooling/avgp_layer_impl.hpp","rank":46,"score":214554.8044468202},{"content":"struct sgd_context<DBN, conv_same_layer_impl<Desc>, L> {\n\n using layer_t = conv_same_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr size_t NV1 = layer_t::NV1;\n\n static constexpr size_t NV2 = layer_t::NV2;\n\n static constexpr size_t NC = layer_t::NC;\n\n static constexpr size_t K = layer_t::K;\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\n\n etl::fast_matrix<weight, batch_size, K, NV1, NV2> output;\n\n etl::fast_matrix<weight, batch_size, K, NV1, NV2> errors;\n\n\n\n sgd_context(layer_t& /* layer */)\n\n : output(0.0), errors(0.0) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/conv_same_layer_impl.hpp","rank":47,"score":214554.8044468202},{"content":"struct sgd_context<DBN, scale_layer_impl<Desc>, L> {\n\n using layer_t = scale_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/scale_layer_impl.hpp","rank":48,"score":214554.8044468202},{"content":"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<etl::is_1d<typename std::iterator_traits<LIterator>::value_type>>> {\n\n using cache_type = etl::dyn_matrix<T, 2>; ///< The type of the cache\n\n using big_cache_type = etl::dyn_matrix<T, 3>; ///< The type of the big cache\n\n\n\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\n\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\n\n\n\n static_assert(!Desc::Categorical, \"Cannot make such vector labels categorical\");\n\n\n\n /*!\n\n * \\brief Init the cache\n\n * \\param n The size of the cache\n\n * \\param n_classes The number of classes\n\n * \\param it An iterator to an element\n\n * \\param cache The cache to initialize\n\n */\n\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\n\n auto one = *it;\n\n cache = cache_type(n, etl::dim<0>(one));\n\n\n","file_path":"include/dll/generators/label_cache_helper.hpp","rank":49,"score":214530.6627228975},{"content":"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<etl::is_3d<typename std::iterator_traits<LIterator>::value_type>>> {\n\n using cache_type = etl::dyn_matrix<T, 4>; ///< The type of the cache\n\n using big_cache_type = etl::dyn_matrix<T, 5>; ///< The type of the big cache\n\n\n\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\n\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\n\n\n\n static_assert(!Desc::Categorical, \"Cannot make such matrix labels categorical\");\n\n\n\n /*!\n\n * \\brief Init the cache\n\n * \\param n The size of the cache\n\n * \\param n_classes The number of classes\n\n * \\param it An iterator to an element\n\n * \\param cache The cache to initialize\n\n */\n\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\n\n auto one = *it;\n\n cache = cache_type(n, etl::dim<0>(one), etl::dim<1>(one), etl::dim<2>(one));\n\n\n","file_path":"include/dll/generators/label_cache_helper.hpp","rank":50,"score":214530.6627228975},{"content":"struct label_predictor {\n\n /*!\n\n * \\brief Return the predicted label for the given image using the given DBN\n\n */\n\n template <typename T, typename V>\n\n size_t operator()(T& dbn, V& image) {\n\n return dbn->predict_labels(image, 10);\n\n }\n\n};\n\n\n\ntemplate <typename DBN, typename Functor, typename Samples, typename Labels>\n\ndouble test_set(DBN& dbn, const Samples& images, const Labels& labels, Functor&& f) {\n\n return test_set(dbn, images.begin(), images.end(), labels.begin(), labels.end(), std::forward<Functor>(f));\n\n}\n\n\n\ntemplate <typename DBN, typename Functor, typename Iterator, typename LIterator>\n\ndouble test_set(DBN& dbn, Iterator first, Iterator last, LIterator lfirst, LIterator /*llast*/, Functor&& f) {\n\n size_t success = 0;\n\n size_t images = 0;\n\n\n","file_path":"include/dll/test.hpp","rank":51,"score":211833.9773784324},{"content":"struct timer_t {\n\n const char* name; ///< The name of the timer\n\n std::atomic<size_t> count; ///< The number of times it was incremented\n\n std::atomic<size_t> duration; ///< The total duration\n\n\n\n /*!\n\n * \\brief Initialize an empty counter\n\n */\n\n timer_t()\n\n : name(nullptr), count(0), duration(0) {}\n\n\n\n /*!\n\n * \\brief Copy a timer\n\n */\n\n timer_t(const timer_t& rhs)\n\n : name(rhs.name), count(rhs.count.load()), duration(rhs.duration.load()) {}\n\n\n\n /*!\n\n * \\brief Copy assign a timer\n\n */\n","file_path":"include/dll/util/timers.hpp","rank":52,"score":211566.74668838768},{"content":"struct is_valid;\n\n\n\ntemplate <typename V, typename T1, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":53,"score":211566.74668838768},{"content":"struct timers_t {\n\n std::array<timer_t, max_timers> timers; ///< The timers\n\n std::mutex lock; ///< The lock to protect the timers\n\n\n\n /*!\n\n * \\brief Reset the status of the timers\n\n */\n\n void reset(){\n\n std::lock_guard<std::mutex> l(lock);\n\n\n\n for(auto& timer : timers){\n\n timer.name = nullptr;\n\n timer.duration = 0;\n\n timer.count = 0;\n\n }\n\n }\n\n};\n\n\n\n/*!\n\n * \\brief Get a reference to the timer structure\n","file_path":"include/dll/util/timers.hpp","rank":54,"score":211566.74668838768},{"content":"struct batch {\n\n using size_type = size_t; ///< The size type of the batch\n\n using value_type = typename std::decay_t<Iterator>::value_type; ///< The value type of the batch\n\n\n\n Iterator first; ///< The iterator to the first element\n\n Iterator last; ///< The iterator to the past the end element\n\n\n\n /*!\n\n * \\brief Create a batch\n\n * \\param first The first element of the batch\n\n * \\param first The past-the-end element of the batch\n\n */\n\n batch(Iterator&& first, Iterator&& last)\n\n : first(std::forward<Iterator>(first)),\n\n last(std::forward<Iterator>(last)) {\n\n cpp_assert(std::distance(first, last) > 0, \"Batch cannot be empty or reversed\");\n\n }\n\n\n\n /*!\n\n * \\brief Return an iterator pointing to the first element of the batch\n","file_path":"include/dll/util/batch.hpp","rank":55,"score":211566.74668838768},{"content":"struct cannot_convert {\n\n /*!\n\n * \\brief False flag for TMP purpose\n\n */\n\n static constexpr bool value = false;\n\n};\n\n\n\n/*!\n\n * \\brief Converter utility to converty from type *From* to type *To*.\n\n */\n\ntemplate<typename From, typename To, typename Enable = void>\n","file_path":"include/dll/util/converter.hpp","rank":56,"score":211566.74668838768},{"content":"struct rbm_training_context {\n\n double reconstruction_error = 0.0; ///< The mean reconstruction error\n\n double free_energy = 0.0; ///< The mean free energy\n\n double sparsity = 0.0; ///< The mean sparsity\n\n\n\n double batch_error = 0.0; ///< The mean reconstruction error for the last batch\n\n double batch_sparsity = 0.0; ///< The mean sparsity for the last batch\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/trainer/rbm_training_context.hpp","rank":57,"score":209312.7974210647},{"content":"struct sgd_context<DBN, dyn_shape_3d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_shape_3d_layer_impl<Desc>;\n\n using weight = typename DBN::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n using inputs_t = etl::dyn_matrix<weight, 4>;\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& layer) : input(batch_size, layer.C, layer.W, layer.H), output(batch_size, layer.C, layer.W, layer.H), errors(batch_size, layer.C, layer.W, layer.H){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/dyn_shape_3d_layer_impl.hpp","rank":58,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_mp_3d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_mp_3d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.i1, layer.i2, layer.i3),\n\n output(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3),\n\n errors(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/pooling/dyn_mp_layer_impl.hpp","rank":59,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_deconv_layer_impl<Desc>, L> {\n\n using layer_t = dyn_deconv_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\n\n output(batch_size, layer.k, layer.nh1, layer.nh2),\n\n errors(batch_size, layer.k, layer.nh1, layer.nh2) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dyn_deconv_layer_impl.hpp","rank":60,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_mp_2d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_mp_2d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.i1, layer.i2, layer.i3),\n\n output(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2),\n\n errors(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2) {}\n\n};\n\n\n\n/*!\n\n * \\brief Standard dyn max pooling layer\n\n */\n\ntemplate <typename Desc>\n","file_path":"include/dll/pooling/dyn_mp_layer_impl.hpp","rank":61,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_avgp_2d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_avgp_2d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.i1, layer.i2, layer.i3),\n\n output(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2),\n\n errors(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2) {}\n\n};\n\n\n\n/*!\n\n * \\brief Standard average pooling layer\n\n */\n\ntemplate <typename Desc>\n","file_path":"include/dll/pooling/dyn_avgp_layer_impl.hpp","rank":62,"score":209261.76706147043},{"content":"struct sgd_context<DBN, batch_normalization_4d_layer_impl<Desc>, L> {\n\n using layer_t = batch_normalization_4d_layer_impl<Desc>; ///< The current layer type\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, layer_t::Kernels, layer_t::W, layer_t::H> input; ///< A batch of input\n\n etl::fast_matrix<weight, batch_size, layer_t::Kernels, layer_t::W, layer_t::H> output; ///< A batch of output\n\n etl::fast_matrix<weight, batch_size, layer_t::Kernels, layer_t::W, layer_t::H> errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/batch_normalization_4d_layer_impl.hpp","rank":63,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_conv_same_layer_impl<Desc>, L> {\n\n using layer_t = dyn_conv_same_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\n\n output(batch_size, layer.k, layer.nv1, layer.nv2), errors(batch_size, layer.k, layer.nv1, layer.nv2) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dyn_conv_same_layer_impl.hpp","rank":64,"score":209261.76706147043},{"content":"struct sgd_context<DBN, batch_normalization_2d_layer_impl<Desc>, L> {\n\n using layer_t = batch_normalization_2d_layer_impl<Desc>; ///< The current layer type\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::fast_matrix<weight, batch_size, Desc::Input> input; ///< A batch of input\n\n etl::fast_matrix<weight, batch_size, Desc::Input> output; ///< A batch of output\n\n etl::fast_matrix<weight, batch_size, Desc::Input> errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/batch_normalization_2d_layer_impl.hpp","rank":65,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_lcn_layer_impl<Desc>, L> {\n\n using layer_t = dyn_lcn_layer_impl<Desc>; ///< The current layer type\n\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\n\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\n\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& /*layer*/){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/dyn_lcn_layer_impl.hpp","rank":66,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_avgp_3d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_avgp_3d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.i1, layer.i2, layer.i3),\n\n output(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3),\n\n errors(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/pooling/dyn_avgp_layer_impl.hpp","rank":67,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_conv_layer_impl<Desc>, L> {\n\n using layer_t = dyn_conv_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\n\n output(batch_size, layer.k, layer.nh1, layer.nh2), errors(batch_size, layer.k, layer.nh1, layer.nh2) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dyn_conv_layer_impl.hpp","rank":68,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_upsample_3d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_upsample_3d_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.i1, layer.i2, layer.i3),\n\n output(batch_size, layer.i1 * layer.c1, layer.i2 * layer.c2, layer.i3 * layer.c3),\n\n errors(batch_size, layer.i1 * layer.c1, layer.i2 * layer.c2, layer.i3 * layer.c3) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/pooling/dyn_upsample_layer_impl.hpp","rank":69,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_shape_1d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_shape_1d_layer_impl<Desc>;\n\n using weight = typename DBN::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n using inputs_t = etl::dyn_matrix<weight, 2>;\n\n\n\n inputs_t input; ///< A batch of input\n\n inputs_t output; ///< A batch of output\n\n inputs_t errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& layer) : input(batch_size, layer.S), output(batch_size, layer.S), errors(batch_size, layer.S){}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/transform/dyn_shape_1d_layer_impl.hpp","rank":70,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_dense_layer_impl<Desc>, L> {\n\n using layer_t = dyn_dense_layer_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 2> input;\n\n etl::dyn_matrix<weight, 2> output;\n\n etl::dyn_matrix<weight, 2> errors;\n\n\n\n sgd_context(layer_t& layer) : input(batch_size, layer.num_visible, 0.0), output(batch_size, layer.num_hidden, 0.0), errors(batch_size, layer.num_hidden, 0.0) {}\n\n};\n\n\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dyn_dense_layer_impl.hpp","rank":71,"score":209261.76706147043},{"content":"struct sgd_context<DBN, dyn_conv_rbm_impl<Desc>, L> {\n\n using layer_t = dyn_conv_rbm_impl<Desc>;\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input;\n\n etl::dyn_matrix<weight, 4> output;\n\n etl::dyn_matrix<weight, 4> errors;\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\n\n output(batch_size, layer.k, layer.nh1, layer.nh2), errors(batch_size, layer.k, layer.nh1, layer.nh2) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/rbm/dyn_conv_rbm_impl.hpp","rank":72,"score":209261.76706147043},{"content":"struct label_cache_helper;\n\n\n\n/*!\n\n * \\brief Helper to create and initialize a cache for labels.\n\n *\n\n * This version makes the label categorical.\n\n */\n\ntemplate <typename Desc, typename T, typename LIterator>\n","file_path":"include/dll/generators/label_cache_helper.hpp","rank":73,"score":209256.22228308965},{"content":"struct default_dbn_watcher {\n\n static constexpr bool ignore_sub = false; ///< For pretraining of a DBN, indicates if the regular RBM watcher should be used (false) or ignored (true)\n\n static constexpr bool replace_sub = false; ///< For pretraining of a DBN, indicates if the DBN watcher should replace (true) the RBM watcher or not (false)\n\n\n\n size_t ft_max_epochs = 0; ///< The maximum number of epochs\n\n dll::stop_timer ft_epoch_timer; ///< Timer for an epoch\n\n dll::stop_timer ft_batch_timer; ///< Timer for a batch\n\n cpp::stop_watch<std::chrono::seconds> watch; ///< Timer for the entire training\n\n\n\n /*!\n\n * \\brief Indicates that the pretraining has begun for the given\n\n * DBN\n\n * \\param dbn The DBN being pretrained\n\n * \\param max_epochs The maximum number of epochs\n\n */\n\n void pretraining_begin(const DBN& dbn, size_t max_epochs) {\n\n std::cout << \"DBN: Pretraining begin for \" << max_epochs << \" epochs\" << std::endl;\n\n cpp_unused(dbn);\n\n }\n\n\n","file_path":"include/dll/watcher.hpp","rank":74,"score":208143.72524829075},{"content":"struct default_rbm_watcher {\n\n cpp::stop_watch<std::chrono::seconds> watch; ///< Timer for the entire training\n\n\n\n /*!\n\n * \\brief Indicates that the training of the given RBM started.\n\n * \\param rbm The rbm that started training.\n\n */\n\n template <typename RBM = R>\n\n void training_begin(const RBM& rbm) {\n\n using rbm_t = std::decay_t<RBM>;\n\n\n\n std::cout << \"Train RBM with \\\"\" << RBM::desc::template trainer_t<RBM>::name() << \"\\\"\" << std::endl;\n\n\n\n rbm.display();\n\n\n\n std::cout << \"With parameters:\" << std::endl;\n\n\n\n if(std::is_same<typename rbm_t::weight, float>::value){\n\n std::cout << \" single-precision\" << std::endl;\n\n } else if(std::is_same<typename rbm_t::weight, double>::value){\n","file_path":"include/dll/watcher.hpp","rank":75,"score":208143.72524829075},{"content":"struct training_desc {\n\n size_t epochs = 25;\n\n double learning_rate = stupid_default;\n\n double momentum = stupid_default;\n\n size_t batch_size = 0;\n\n\n\n std::string decay = \"none\";\n\n double l1_weight_cost = stupid_default;\n\n double l2_weight_cost = stupid_default;\n\n\n\n std::string trainer = \"none\";\n\n\n\n bool verbose = false;\n\n};\n\n\n","file_path":"include/dll/processor/processor.hpp","rank":76,"score":208138.5510125068},{"content":"struct get_value_l;\n\n\n\n/*!\n\n * \\copydoc get_value_l\n\n */\n\ntemplate <typename D, typename... T>\n","file_path":"include/dll/util/tmp.hpp","rank":77,"score":207828.30467693185},{"content":"struct sequence_add;\n\n\n\ntemplate <size_t... I, size_t N>\n","file_path":"include/dll/util/tmp.hpp","rank":78,"score":207828.30467693185},{"content":"struct get_value;\n\n\n\n/*!\n\n * \\copydoc get_value\n\n */\n\ntemplate <typename D, typename T2, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":79,"score":207828.30467693185},{"content":"struct converter_one {\n\n static_assert(cannot_convert<From, To>::value, \"DLL does not know how to convert your input type (one)\");\n\n};\n\n\n\n// No conversion\n\n// This should only happen when used from converter_many\n\n\n\n/*!\n\n * \\copydoc converter_one\n\n */\n\ntemplate<typename From>\n","file_path":"include/dll/util/converter.hpp","rank":80,"score":207828.30467693188},{"content":"struct get_value_1;\n\n\n\n/*!\n\n * \\copydoc get_value_1\n\n */\n\ntemplate <typename D, typename T2, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":81,"score":207828.30467693185},{"content":"struct stop_timer {\n\n std::chrono::time_point<std::chrono::steady_clock> start_time; ///< The start time\n\n\n\n /*!\n\n * \\brief Start the timer\n\n */\n\n void start() {\n\n start_time = std::chrono::steady_clock::now();\n\n }\n\n\n\n /*!\n\n * \\brief Stop the timer and get the elapsed since start\n\n * \\return elapsed time since start()\n\n */\n\n size_t stop() const {\n\n auto end = std::chrono::steady_clock::now();\n\n return std::chrono::duration_cast<std::chrono::milliseconds>(end - start_time).count();\n\n }\n\n};\n\n\n","file_path":"include/dll/util/timers.hpp","rank":82,"score":207828.30467693185},{"content":"struct get_value_2;\n\n\n\n/*!\n\n * \\copydoc get_value_2\n\n */\n\ntemplate <typename D, typename T2, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":83,"score":207828.30467693185},{"content":"struct converter_many {\n\n static_assert(cannot_convert<From, To>::value, \"DLL does not know how to convert your input type (many)\");\n\n};\n\n\n\n// Only convert the sub types not the outer container\n\ntemplate<template<typename...> class Container, typename From, typename To>\n","file_path":"include/dll/util/converter.hpp","rank":84,"score":207828.30467693188},{"content":"struct get_type;\n\n\n\n/*!\n\n * \\copydoc get_type\n\n */\n\ntemplate <typename D, typename T2, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":85,"score":207828.30467693188},{"content":"struct get_value_l<D, cpp::type_list<T...>> : cpp::auto_constant<get_value<D, T...>> {};\n\n\n\n/*!\n\n * \\brief Extract the type corresponding to the given configuration element from\n\n * the list of the parameters.\n\n * \\tparam D The configuration element type\n\n * \\tparam Args The arguments to extract the type from\n\n */\n\ntemplate <typename D, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":86,"score":206126.6154566121},{"content":"struct converter_one <From, From> {\n\n /*!\n\n * \\brief Convert from the given container into the specific type\n\n * \\param l The layer for which to convert\n\n * \\param from The container to convert from\n\n * \\return the converted result\n\n */\n\n template<typename L>\n\n static const From& convert(const L&, const From& from){\n\n return from;\n\n }\n\n};\n\n\n\n// Convert a vector<T_F> to a dyn_vector<T_T>\n\n\n\n/*!\n\n * \\copydoc converter_one\n\n */\n\ntemplate<typename T_F, typename T_T, typename A>\n","file_path":"include/dll/util/converter.hpp","rank":87,"score":205657.28456934472},{"content":"struct no_epoch_error_id;\n","file_path":"include/dll/base_conf.hpp","rank":88,"score":204546.43688897716},{"content":"struct early_training_id;\n\n\n\n/*!\n\n * \\brief Sets the minibatch size\n\n * \\tparam B The minibatch size\n\n */\n\ntemplate <size_t B>\n","file_path":"include/dll/base_conf.hpp","rank":89,"score":204538.75018689985},{"content":"struct batch_size_id;\n","file_path":"include/dll/base_conf.hpp","rank":90,"score":204516.30655443203},{"content":"struct validate_label_layers;\n\n\n\ntemplate <typename Layer>\n","file_path":"include/dll/dbn_layers.hpp","rank":91,"score":204491.39702062242},{"content":"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<Desc::Categorical && !etl::is_etl_expr<typename std::iterator_traits<LIterator>::value_type>>> {\n\n using cache_type = etl::dyn_matrix<T, 2>; ///< The type of the cache\n\n using big_cache_type = etl::dyn_matrix<T, 3>; ///< The type of the big cache\n\n\n\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\n\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\n\n\n\n /*!\n\n * \\brief Init the cache\n\n * \\param n The size of the cache\n\n * \\param n_classes The number of classes\n\n * \\param it An iterator to an element\n\n * \\param cache The cache to initialize\n\n */\n\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\n\n cache = cache_type(n, n_classes);\n\n cache = T(0);\n\n\n\n cpp_unused(it);\n\n }\n","file_path":"include/dll/generators/label_cache_helper.hpp","rank":92,"score":204370.99071949517},{"content":"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<!Desc::Categorical && !etl::is_etl_expr<typename std::iterator_traits<LIterator>::value_type>>> {\n\n using cache_type = etl::dyn_matrix<T, 1>; ///< The type of the cache\n\n using big_cache_type = etl::dyn_matrix<T, 2>; ///< The type of the big cache\n\n\n\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\n\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\n\n\n\n /*!\n\n * \\brief Init the cache\n\n * \\param n The size of the cache\n\n * \\param n_classes The number of classes\n\n * \\param it An iterator to an element\n\n * \\param cache The cache to initialize\n\n */\n\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\n\n cache = cache_type(n);\n\n\n\n cpp_unused(it);\n\n cpp_unused(n_classes);\n\n }\n","file_path":"include/dll/generators/label_cache_helper.hpp","rank":93,"score":204370.99071949517},{"content":"struct sgd_context<DBN, dyn_batch_normalization_4d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_batch_normalization_4d_layer_impl<Desc>; ///< The current layer type\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 4> input; ///< A batch of input\n\n etl::dyn_matrix<weight, 4> output; ///< A batch of output\n\n etl::dyn_matrix<weight, 4> errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& layer)\n\n : input(batch_size, layer.Kernels, layer.W, layer.H), output(batch_size, layer.Kernels, layer.W, layer.H), errors(batch_size, layer.Kernels, layer.W, layer.H) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dyn_batch_normalization_4d_layer_impl.hpp","rank":94,"score":204306.44669919563},{"content":"struct sgd_context<DBN, dyn_batch_normalization_2d_layer_impl<Desc>, L> {\n\n using layer_t = dyn_batch_normalization_2d_layer_impl<Desc>; ///< The current layer type\n\n using weight = typename layer_t::weight; ///< The data type for this layer\n\n\n\n static constexpr auto batch_size = DBN::batch_size;\n\n\n\n etl::dyn_matrix<weight, 2> input; ///< A batch of input\n\n etl::dyn_matrix<weight, 2> output; ///< A batch of output\n\n etl::dyn_matrix<weight, 2> errors; ///< A batch of errors\n\n\n\n sgd_context(layer_t& layer) : input(batch_size, layer.Input), output(batch_size, layer.Input), errors(batch_size, layer.Input) {}\n\n};\n\n\n\n} //end of dll namespace\n","file_path":"include/dll/neural/dyn_batch_normalization_2d_layer_impl.hpp","rank":95,"score":204306.44669919563},{"content":"struct conditional_constant_v1;\n\n\n\n/*!\n\n * \\copydoc conditional_constant_v1\n\n */\n\ntemplate <typename V1, typename V2>\n","file_path":"include/dll/util/tmp.hpp","rank":96,"score":204234.50567836658},{"content":"struct conditional_constant_v2;\n\n\n\n/*!\n\n * \\copydoc conditional_constant_v2\n\n */\n\ntemplate <typename V1, typename V2>\n","file_path":"include/dll/util/tmp.hpp","rank":97,"score":204234.50567836658},{"content":"struct get_template_type;\n\n\n\n/*!\n\n * \\copydoc get_template_type\n\n */\n\ntemplate <typename D, typename T2, typename... Args>\n","file_path":"include/dll/util/tmp.hpp","rank":98,"score":204234.50567836658}],"string":"[\n {\n \"content\": \"struct random_crop : value_pair_conf_elt<random_crop_id, size_t, X, Y> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Elastic distortion\\n\\n */\\n\\ntemplate <size_t C, size_t K = 9>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 0,\n \"score\": 284440.7828568713\n },\n {\n \"content\": \"struct converter_one<std::vector<T_F, A>, etl::dyn_matrix<T_T, 1>> {\\n\\n static_assert(std::is_convertible<T_F, T_T>::value, \\\"DLL cannot convert your value type to the weight type (one)\\\");\\n\\n\\n\\n /*!\\n\\n * \\\\brief Convert from the given container into the specific type\\n\\n * \\\\param l The layer for which to convert\\n\\n * \\\\param from The container to convert from\\n\\n * \\\\return the converted result\\n\\n */\\n\\n template<typename L>\\n\\n static etl::dyn_matrix<T_T, 1> convert(const L&, const std::vector<T_F, A>& from){\\n\\n debug_convert(\\\"converter::one\\\");\\n\\n etl::dyn_matrix<T_T, 1> c;\\n\\n c = from;\\n\\n return c;\\n\\n }\\n\\n};\\n\\n\\n\\n// Convert a list<T_F> to a dyn_vector<T_T>\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc converter_one\\n\\n */\\n\\ntemplate<typename T_F, typename T_T, typename A>\\n\",\n \"file_path\": \"include/dll/util/converter.hpp\",\n \"rank\": 1,\n \"score\": 277641.09570838197\n },\n {\n \"content\": \"struct fake_label_array {\\n\\n using value_type = V;\\n\\n using this_type = fake_label_array<value_type>;\\n\\n\\n\\n value_type value;\\n\\n\\n\\n fake_label_array(value_type v)\\n\\n : value(v) {}\\n\\n\\n\\n double operator[](size_t i) const {\\n\\n if (i == value) {\\n\\n return 1.0;\\n\\n } else {\\n\\n return 0.0;\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename Iterator>\\n\\nstd::vector<fake_label_array<std::remove_cv_t<typename std::iterator_traits<Iterator>::value_type>>> make_fake(Iterator first, Iterator last) {\\n\",\n \"file_path\": \"include/dll/util/labels.hpp\",\n \"rank\": 2,\n \"score\": 265176.9558043879\n },\n {\n \"content\": \"struct auto_timer {\\n\\n const char* name; ///< The name of the timer\\n\\n std::chrono::time_point<std::chrono::steady_clock> start; ///< The start time\\n\\n std::chrono::time_point<std::chrono::steady_clock> end; ///< The end time\\n\\n\\n\\n /*!\\n\\n * \\\\brief Create an auto_timer witht the given name\\n\\n * \\\\param name The name of the timer\\n\\n */\\n\\n auto_timer(const char* name) : name(name) {\\n\\n start = std::chrono::steady_clock::now();\\n\\n }\\n\\n\\n\\n /*!\\n\\n * \\\\brief Destructs the timer, effectively incrementing the timer.\\n\\n */\\n\\n ~auto_timer() {\\n\\n end = std::chrono::steady_clock::now();\\n\\n auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(end - start).count();\\n\\n\\n\",\n \"file_path\": \"include/dll/util/timers.hpp\",\n \"rank\": 3,\n \"score\": 258686.65767264448\n },\n {\n \"content\": \"struct is_generator_impl<T, decltype((void)T::dll_generator, 0)> : std::true_type {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Traits to test if a type is DLL generator or not\\n\\n */\\n\\ntemplate <typename T>\\n\\nconstexpr bool is_generator = is_generator_impl<T>::value;\\n\\n\\n\\n/*!\\n\\n * \\\\brief Helper to tell from the generator description if it is\\n\\n * augmenting the data\\n\\n */\\n\\ntemplate<typename Desc>\\n\\nconstexpr bool is_augmented =\\n\\n (Desc::random_crop_x > 0 && Desc::random_crop_y > 0)\\n\\n || Desc::HorizontalMirroring || Desc::VerticalMirroring || Desc::Noise || Desc::ElasticDistortion;\\n\\n\\n\\n/*!\\n\\n * \\\\brief Helper to tell from the generator description if it is\\n\\n * threaded.\\n\\n */\\n\\ntemplate<typename Desc>\\n\\nstatic constexpr bool is_threaded = Desc::Threaded;\\n\\n\\n\\n} // end of namespace dll\\n\\n\\n\\n#include \\\"dll/generators/inmemory_data_generator.hpp\\\"\\n\\n#include \\\"dll/generators/outmemory_data_generator.hpp\\\"\\n\",\n \"file_path\": \"include/dll/generators.hpp\",\n \"rank\": 4,\n \"score\": 247894.685443361\n },\n {\n \"content\": \"struct converter_one<std::vector<T_F, A>, etl::dyn_matrix<T_T, D>> {\\n\\n static_assert(std::is_convertible<T_F, T_T>::value, \\\"DLL cannot convert your value type to the weight type (one)\\\");\\n\\n\\n\\n /*!\\n\\n * \\\\brief Convert from the given container into the specific type\\n\\n * \\\\param l The layer for which to convert\\n\\n * \\\\param from The container to convert from\\n\\n * \\\\return the converted result\\n\\n */\\n\\n template<typename L>\\n\\n static etl::dyn_matrix<T_T, D> convert(const L& l, const std::vector<T_F, A>& from){\\n\\n debug_convert(\\\"converter::one\\\");\\n\\n etl::dyn_matrix<T_T, D> converted;\\n\\n l.prepare_input(converted);\\n\\n converted = from;\\n\\n return converted;\\n\\n }\\n\\n};\\n\\n\\n\\n// Convert a list<T_F> to a dyn_matrix<T_T, D>\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc converter_one\\n\\n */\\n\\ntemplate<typename T_F, typename T_T, typename A, size_t D>\\n\",\n \"file_path\": \"include/dll/util/converter.hpp\",\n \"rank\": 7,\n \"score\": 243676.88061547733\n },\n {\n \"content\": \"struct converter_one<std::vector<T_F, A>, etl::fast_dyn_matrix<T_T, Dims...>> {\\n\\n static_assert(std::is_convertible<T_F, T_T>::value, \\\"DLL cannot convert your value type to the weight type (one)\\\");\\n\\n\\n\\n /*!\\n\\n * \\\\brief Convert from the given container into the specific type\\n\\n * \\\\param l The layer for which to convert\\n\\n * \\\\param from The container to convert from\\n\\n * \\\\return the converted result\\n\\n */\\n\\n template<typename L>\\n\\n static etl::fast_dyn_matrix<T_T, Dims...> convert(const L&, const std::vector<T_F, A>& from){\\n\\n debug_convert(\\\"converter::one\\\");\\n\\n etl::fast_dyn_matrix<T_T, Dims...> c;\\n\\n c = from;\\n\\n return c;\\n\\n }\\n\\n};\\n\\n\\n\\n// Convert a list<T_F> to a fast_dyn_matrix<T_T, Dims...>\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc converter_one\\n\\n */\\n\\ntemplate<typename T_F, typename T_T, typename A, size_t... Dims>\\n\",\n \"file_path\": \"include/dll/util/converter.hpp\",\n \"rank\": 8,\n \"score\": 240473.11091447232\n },\n {\n \"content\": \"struct sequence_add <std::index_sequence<I...>, N> {\\n\\n using type = std::index_sequence<I..., N>;\\n\\n};\\n\\n\\n\\ntemplate <typename T, size_t F, size_t L, typename Acc, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 9,\n \"score\": 237429.75926227216\n },\n {\n \"content\": \"struct get_value<D> : cpp::auto_constant<D> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Extract the value corresponding to the given configuration element from the parameters.\\n\\n * \\\\tparam D The configuration element type\\n\\n * \\\\tparam Args The arguments to extract the value from\\n\\n */\\n\\ntemplate <typename D, typename... Args>\\n\\nconstexpr const auto get_value_v = get_value<D, Args...>::value;\\n\\n\\n\\n/*!\\n\\n * \\\\brief Extract the first value corresponding to the given configuration element from the parameters.\\n\\n * \\\\tparam D The configuration element type\\n\\n * \\\\tparam Args The arguments to extract the value from\\n\\n */\\n\\ntemplate <typename D, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 10,\n \"score\": 233489.25109846765\n },\n {\n \"content\": \"struct batch_size : value_conf_elt<batch_size_id, size_t, B> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Sets the big batch size.\\n\\n *\\n\\n * This is the number of minibatch that the DBN will load at once.\\n\\n *\\n\\n * \\\\tparam B The big batch size\\n\\n */\\n\\ntemplate <size_t B>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 11,\n \"score\": 233183.8541005827\n },\n {\n \"content\": \"struct dyn_layers_t <dll::detail::layers<Labels, Layers...>> {\\n\\n using dyn_t = dll::detail::layers<Labels, typename Layers::desc::dyn_layer_t...>;\\n\\n};\\n\\n\\n\\ntemplate <template <typename> class DBN_T, typename Layers, typename... Parameters>\\n\",\n \"file_path\": \"include/dll/dbn_desc.hpp\",\n \"rank\": 12,\n \"score\": 231431.09440118214\n },\n {\n \"content\": \"struct validate_weight_type_impl< I, DBN, T, std::enable_if_t<(I == DBN::layers_t::size - 1)> > {\\n\\n static constexpr bool value = weight_type_same<I, DBN, T>::value;\\n\\n};\\n\\n\\n\\ntemplate <size_t I, typename DBN, typename T>\\n\",\n \"file_path\": \"include/dll/dbn_detail.hpp\",\n \"rank\": 13,\n \"score\": 229272.8819218221\n },\n {\n \"content\": \"struct validate_weight_type_impl< I, DBN, T, std::enable_if_t<(I < DBN::layers_t::size - 1)> > {\\n\\n static constexpr bool value = weight_type_same<I, DBN, T>::value && validate_weight_type_impl<I + 1, DBN, T>::value;\\n\\n};\\n\\n\\n\\ntemplate <typename DBN, typename T>\\n\",\n \"file_path\": \"include/dll/dbn_detail.hpp\",\n \"rank\": 14,\n \"score\": 229272.8819218221\n },\n {\n \"content\": \"struct big_batch_size : value_conf_elt<big_batch_size_id, size_t, B> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Sets the updater type\\n\\n * \\\\tparam UT The updater type\\n\\n */\\n\\ntemplate <updater_type UT>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 15,\n \"score\": 228351.4816077628\n },\n {\n \"content\": \"struct for_each_impl<D, 1, std::index_sequence<I...>> {\\n\\n D& dbn;\\n\\n\\n\\n for_each_impl(D& dbn)\\n\\n : dbn(dbn) {}\\n\\n\\n\\n template <typename Functor>\\n\\n void for_each_layer(Functor&& functor) {\\n\\n functor(dbn.template layer_get<0>());\\n\\n }\\n\\n\\n\\n template <typename Functor>\\n\\n void for_each_layer_i(Functor&& functor) {\\n\\n functor(dbn.template layer_get<0>(), 0);\\n\\n }\\n\\n\\n\\n template <typename Functor>\\n\\n void for_each_layer_pair(Functor&& functor) {\\n\\n cpp_unused(functor);\\n\\n // Nothing to do here\\n\",\n \"file_path\": \"include/dll/dbn_detail.hpp\",\n \"rank\": 16,\n \"score\": 227608.53908734157\n },\n {\n \"content\": \"struct validate_label_layers<L1, L2, Layers...> : cpp::bool_constant_c<\\n\\n cpp::and_u<\\n\\n L1::output_size() <= L2::input_size(),\\n\\n validate_label_layers<L2, Layers...>::value>> {};\\n\\n\\n\\n} // end of namespace detail\\n\\n\\n\\nnamespace detail {\\n\\n\\n\\n/*!\\n\\n * \\\\brief A leaf in the list of layers.\\n\\n */\\n\\ntemplate <size_t I, typename T>\\n\",\n \"file_path\": \"include/dll/dbn_layers.hpp\",\n \"rank\": 17,\n \"score\": 225480.8727049497\n },\n {\n \"content\": \"struct build_dyn_layer_t <Layer, Desc, std::index_sequence<I...>, Args...> {\\n\\n using type = Layer<Desc<cpp::nth_type_t<I, Args...>...>>;\\n\\n};\\n\\n\\n\\ntemplate <typename Index, size_t N>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 18,\n \"score\": 224535.92551801988\n },\n {\n \"content\": \"struct conditional_constant_v1<false, V1, V2> : cpp::auto_constant<V2> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief A conditional constant extracting the member value_2 from V1 or value V2 depending on the condition\\n\\n * \\\\tparam C The boolean value\\n\\n * \\\\tparam V1 The first value class\\n\\n * \\\\tparam V2 The second value class\\n\\n */\\n\\ntemplate <bool C, typename V1, typename V2>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 19,\n \"score\": 220991.15266661355\n },\n {\n \"content\": \"struct conditional_constant_v2<false, V1, V2> : cpp::auto_constant<V2> {};\\n\\n\\n\\ntemplate <typename V, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 20,\n \"score\": 220991.15266661355\n },\n {\n \"content\": \"struct copy : value_conf_elt<copy_id, size_t, C> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Sets the random cropping size\\n\\n * \\\\tparam B The minibatch size\\n\\n */\\n\\ntemplate <size_t X, size_t Y>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 21,\n \"score\": 220599.29825140198\n },\n {\n \"content\": \"struct noise : value_conf_elt<noise_id, size_t, N> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Sets the prescaling factor\\n\\n * \\\\tparam S The scaling factor\\n\\n */\\n\\ntemplate <size_t S>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 22,\n \"score\": 220599.29825140198\n },\n {\n \"content\": \"struct sgd_context<DBN, rbm_impl<Desc>, L> {\\n\\n using layer_t = rbm_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto num_visible = layer_t::num_visible;\\n\\n static constexpr auto num_hidden = layer_t::num_hidden;\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, num_visible> input;\\n\\n etl::fast_matrix<weight, batch_size, num_hidden> output;\\n\\n etl::fast_matrix<weight, batch_size, num_hidden> errors;\\n\\n\\n\\n sgd_context(layer_t& /*layer*/)\\n\\n : output(0.0), errors(0.0) {}\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief specialization of cg_context for rbm\\n\\n */\\n\\ntemplate <typename Desc>\\n\",\n \"file_path\": \"include/dll/rbm/rbm_impl.hpp\",\n \"rank\": 23,\n \"score\": 220221.30116069884\n },\n {\n \"content\": \"struct binarize_pre : value_conf_elt<binarize_pre_id, size_t, B> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Normalize the inputs\\n\\n */\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 24,\n \"score\": 214930.15944975824\n },\n {\n \"content\": \"struct elastic_distortion : value_conf_elt<elastic_distortion_id, size_t, K> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Sets the noise\\n\\n * \\\\tparam N The percent of noise\\n\\n */\\n\\ntemplate <size_t N>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 25,\n \"score\": 214930.15944975824\n },\n {\n \"content\": \"struct scale_pre : value_conf_elt<scale_pre_id, size_t, S> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Sets the binarize threshold\\n\\n * \\\\tparam B The binarize threshold\\n\\n */\\n\\ntemplate <size_t B>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 26,\n \"score\": 214930.15944975818\n },\n {\n \"content\": \"struct sgd_context<DBN, mp_2d_layer_impl<Desc>, L> {\\n\\n using layer_t = mp_2d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\\n\\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\\n\\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\\n\\n\\n\\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\\n\\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\\n\\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\\n\\n\\n\\n sgd_context(mp_2d_layer_impl<Desc>& /*layer*/){}\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Standard max pooling layer (3D pooling)\\n\\n */\\n\\ntemplate <typename Desc>\\n\",\n \"file_path\": \"include/dll/pooling/mp_layer_impl.hpp\",\n \"rank\": 27,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, rectifier_layer_impl<Desc>, L> {\\n\\n using layer_t = rectifier_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/rectifier_layer_impl.hpp\",\n \"rank\": 28,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, shape_1d_layer_impl<Desc>, L> {\\n\\n using layer_t = shape_1d_layer_impl<Desc>;\\n\\n using weight = typename DBN::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, layer_t::Size> input;\\n\\n etl::fast_matrix<weight, batch_size, layer_t::Size> output;\\n\\n etl::fast_matrix<weight, batch_size, layer_t::Size> errors;\\n\\n\\n\\n sgd_context(const shape_1d_layer_impl<Desc>& /* layer */){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/shape_1d_layer_impl.hpp\",\n \"rank\": 29,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, normalize_layer_impl<Desc>, L> {\\n\\n using layer_t = normalize_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/normalize_layer_impl.hpp\",\n \"rank\": 30,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, dropout_layer_impl<Desc>, L> {\\n\\n using layer_t = dropout_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dropout_layer_impl.hpp\",\n \"rank\": 31,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, conv_rbm_impl<Desc>, L> {\\n\\n using layer_t = conv_rbm_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t NV1 = layer_t::NV1;\\n\\n static constexpr size_t NV2 = layer_t::NV2;\\n\\n static constexpr size_t NH1 = layer_t::NH1;\\n\\n static constexpr size_t NH2 = layer_t::NH2;\\n\\n static constexpr size_t NW1 = layer_t::NW1;\\n\\n static constexpr size_t NW2 = layer_t::NW2;\\n\\n static constexpr size_t NC = layer_t::NC;\\n\\n static constexpr size_t K = layer_t::K;\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\\n\\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> output;\\n\\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> errors;\\n\\n\\n\\n sgd_context(layer_t& /*layer*/)\\n\\n : output(0.0), errors(0.0) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/rbm/conv_rbm_impl.hpp\",\n \"rank\": 32,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, lcn_layer_impl<Desc>, L> {\\n\\n using layer_t = lcn_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/lcn_layer_impl.hpp\",\n \"rank\": 33,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, shape_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = shape_3d_layer_impl<Desc>;\\n\\n using weight = typename DBN::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, layer_t::C, layer_t::H, layer_t::W> input;\\n\\n etl::fast_matrix<weight, batch_size, layer_t::C, layer_t::H, layer_t::W> output;\\n\\n etl::fast_matrix<weight, batch_size, layer_t::C, layer_t::H, layer_t::W> errors;\\n\\n\\n\\n sgd_context(const shape_3d_layer_impl<Desc>& /* layer */){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/shape_3d_layer_impl.hpp\",\n \"rank\": 34,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_rbm_impl<Desc>, L> {\\n\\n using layer_t = dyn_rbm_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 2> input;\\n\\n etl::dyn_matrix<weight, 2> output;\\n\\n etl::dyn_matrix<weight, 2> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.num_visible, 0.0), output(batch_size, layer.num_hidden, 0.0), errors(batch_size, layer.num_hidden, 0.0) {}\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Specialzation of cg_context for dyn_rbm_impl\\n\\n */\\n\\ntemplate <typename Desc>\\n\",\n \"file_path\": \"include/dll/rbm/dyn_rbm_impl.hpp\",\n \"rank\": 35,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, mp_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = mp_3d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\\n\\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\\n\\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\\n\\n\\n\\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\\n\\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\\n\\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\\n\\n\\n\\n sgd_context(mp_3d_layer_impl<Desc>& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/pooling/mp_layer_impl.hpp\",\n \"rank\": 36,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, deconv_layer_impl<Desc>, L> {\\n\\n using layer_t = deconv_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t NV1 = layer_t::NV1;\\n\\n static constexpr size_t NV2 = layer_t::NV2;\\n\\n static constexpr size_t NH1 = layer_t::NH1;\\n\\n static constexpr size_t NH2 = layer_t::NH2;\\n\\n static constexpr size_t NW1 = layer_t::NW1;\\n\\n static constexpr size_t NW2 = layer_t::NW2;\\n\\n static constexpr size_t NC = layer_t::NC;\\n\\n static constexpr size_t K = layer_t::K;\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\\n\\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> output;\\n\\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> errors;\\n\\n\\n\\n sgd_context(layer_t& /* layer */)\\n\\n : output(0.0), errors(0.0) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/deconv_layer_impl.hpp\",\n \"rank\": 37,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, conv_layer_impl<Desc>, L> {\\n\\n using layer_t = conv_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t NV1 = layer_t::NV1;\\n\\n static constexpr size_t NV2 = layer_t::NV2;\\n\\n static constexpr size_t NH1 = layer_t::NH1;\\n\\n static constexpr size_t NH2 = layer_t::NH2;\\n\\n static constexpr size_t NW1 = layer_t::NW1;\\n\\n static constexpr size_t NW2 = layer_t::NW2;\\n\\n static constexpr size_t NC = layer_t::NC;\\n\\n static constexpr size_t K = layer_t::K;\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\\n\\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> output;\\n\\n etl::fast_matrix<weight, batch_size, K, NH1, NH2> errors;\\n\\n\\n\\n sgd_context(conv_layer_impl<Desc>& /* layer */)\\n\\n : output(0.0), errors(0.0) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/conv_layer_impl.hpp\",\n \"rank\": 38,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct full_sgd_context : sgd_context<DBN, Layer, L> {\\n\\n using context_type = sgd_context<DBN, Layer, L>; ///< The parent context type\\n\\n\\n\\n /*!\\n\\n * \\\\brief The updater context\\n\\n */\\n\\n updater_context<DBN::updater, decay_layer_traits<Layer>::is_neural_layer(), Layer> up;\\n\\n\\n\\n /*!\\n\\n * \\\\brief Construct the full_sgd_context for the given layer\\n\\n */\\n\\n full_sgd_context(Layer& layer) : context_type(layer), up(layer) {\\n\\n // Nothing else to init\\n\\n }\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Build the context for a DBN for the given sequence of layers\\n\\n * \\\\param dbn The DBN to build the context from\\n\\n */\\n\",\n \"file_path\": \"include/dll/trainer/stochastic_gradient_descent.hpp\",\n \"rank\": 39,\n \"score\": 214554.80444682026\n },\n {\n \"content\": \"struct sgd_context<DBN, random_layer_impl<Desc>, L> {\\n\\n using layer_t = random_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/random_layer_impl.hpp\",\n \"rank\": 40,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, binarize_layer_impl<Desc>, L> {\\n\\n using layer_t = binarize_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Specialization of cg_context for binarize_layer_impl\\n\\n */\\n\\ntemplate <typename Desc>\\n\",\n \"file_path\": \"include/dll/transform/binarize_layer_impl.hpp\",\n \"rank\": 41,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, avgp_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = avgp_3d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\\n\\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\\n\\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\\n\\n\\n\\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\\n\\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\\n\\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\\n\\n\\n\\n sgd_context(avgp_3d_layer_impl<Desc>& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/pooling/avgp_layer_impl.hpp\",\n \"rank\": 42,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, dense_layer_impl<Desc>, L> {\\n\\n using layer_t = dense_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto num_visible = layer_t::num_visible;\\n\\n static constexpr auto num_hidden = layer_t::num_hidden;\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, num_visible> input;\\n\\n etl::fast_matrix<weight, batch_size, num_hidden> output;\\n\\n etl::fast_matrix<weight, batch_size, num_hidden> errors;\\n\\n\\n\\n sgd_context(const dense_layer_impl<Desc>& /* layer */)\\n\\n : output(0.0), errors(0.0) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dense_layer_impl.hpp\",\n \"rank\": 43,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, activation_layer_impl<Desc>, L> {\\n\\n using layer_t = activation_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/activation_layer_impl.hpp\",\n \"rank\": 44,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, upsample_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = upsample_3d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\\n\\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\\n\\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\\n\\n\\n\\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\\n\\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\\n\\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\\n\\n\\n\\n sgd_context(layer_t& /*layer*/) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/pooling/upsample_layer_impl.hpp\",\n \"rank\": 45,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, avgp_2d_layer_impl<Desc>, L> {\\n\\n using layer_t = avgp_2d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t I1 = layer_t::I1; ///< The input first dimension\\n\\n static constexpr size_t I2 = layer_t::I2; ///< The input second dimension\\n\\n static constexpr size_t I3 = layer_t::I3; ///< The input third dimension\\n\\n\\n\\n static constexpr size_t O1 = layer_t::O1; ///< The padding first dimension\\n\\n static constexpr size_t O2 = layer_t::O2; ///< The padding second dimension\\n\\n static constexpr size_t O3 = layer_t::O3; ///< The padding third dimension\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, I1, I2, I3> input;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> output;\\n\\n etl::fast_matrix<weight, batch_size, O1, O2, O3> errors;\\n\\n\\n\\n sgd_context(avgp_2d_layer_impl<Desc>& /*layer*/){}\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Standard average pooling layer\\n\\n */\\n\\ntemplate <typename Desc>\\n\",\n \"file_path\": \"include/dll/pooling/avgp_layer_impl.hpp\",\n \"rank\": 46,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, conv_same_layer_impl<Desc>, L> {\\n\\n using layer_t = conv_same_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr size_t NV1 = layer_t::NV1;\\n\\n static constexpr size_t NV2 = layer_t::NV2;\\n\\n static constexpr size_t NC = layer_t::NC;\\n\\n static constexpr size_t K = layer_t::K;\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, NC, NV1, NV2> input;\\n\\n etl::fast_matrix<weight, batch_size, K, NV1, NV2> output;\\n\\n etl::fast_matrix<weight, batch_size, K, NV1, NV2> errors;\\n\\n\\n\\n sgd_context(layer_t& /* layer */)\\n\\n : output(0.0), errors(0.0) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/conv_same_layer_impl.hpp\",\n \"rank\": 47,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct sgd_context<DBN, scale_layer_impl<Desc>, L> {\\n\\n using layer_t = scale_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/scale_layer_impl.hpp\",\n \"rank\": 48,\n \"score\": 214554.8044468202\n },\n {\n \"content\": \"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<etl::is_1d<typename std::iterator_traits<LIterator>::value_type>>> {\\n\\n using cache_type = etl::dyn_matrix<T, 2>; ///< The type of the cache\\n\\n using big_cache_type = etl::dyn_matrix<T, 3>; ///< The type of the big cache\\n\\n\\n\\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\\n\\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\\n\\n\\n\\n static_assert(!Desc::Categorical, \\\"Cannot make such vector labels categorical\\\");\\n\\n\\n\\n /*!\\n\\n * \\\\brief Init the cache\\n\\n * \\\\param n The size of the cache\\n\\n * \\\\param n_classes The number of classes\\n\\n * \\\\param it An iterator to an element\\n\\n * \\\\param cache The cache to initialize\\n\\n */\\n\\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\\n\\n auto one = *it;\\n\\n cache = cache_type(n, etl::dim<0>(one));\\n\\n\\n\",\n \"file_path\": \"include/dll/generators/label_cache_helper.hpp\",\n \"rank\": 49,\n \"score\": 214530.6627228975\n },\n {\n \"content\": \"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<etl::is_3d<typename std::iterator_traits<LIterator>::value_type>>> {\\n\\n using cache_type = etl::dyn_matrix<T, 4>; ///< The type of the cache\\n\\n using big_cache_type = etl::dyn_matrix<T, 5>; ///< The type of the big cache\\n\\n\\n\\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\\n\\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\\n\\n\\n\\n static_assert(!Desc::Categorical, \\\"Cannot make such matrix labels categorical\\\");\\n\\n\\n\\n /*!\\n\\n * \\\\brief Init the cache\\n\\n * \\\\param n The size of the cache\\n\\n * \\\\param n_classes The number of classes\\n\\n * \\\\param it An iterator to an element\\n\\n * \\\\param cache The cache to initialize\\n\\n */\\n\\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\\n\\n auto one = *it;\\n\\n cache = cache_type(n, etl::dim<0>(one), etl::dim<1>(one), etl::dim<2>(one));\\n\\n\\n\",\n \"file_path\": \"include/dll/generators/label_cache_helper.hpp\",\n \"rank\": 50,\n \"score\": 214530.6627228975\n },\n {\n \"content\": \"struct label_predictor {\\n\\n /*!\\n\\n * \\\\brief Return the predicted label for the given image using the given DBN\\n\\n */\\n\\n template <typename T, typename V>\\n\\n size_t operator()(T& dbn, V& image) {\\n\\n return dbn->predict_labels(image, 10);\\n\\n }\\n\\n};\\n\\n\\n\\ntemplate <typename DBN, typename Functor, typename Samples, typename Labels>\\n\\ndouble test_set(DBN& dbn, const Samples& images, const Labels& labels, Functor&& f) {\\n\\n return test_set(dbn, images.begin(), images.end(), labels.begin(), labels.end(), std::forward<Functor>(f));\\n\\n}\\n\\n\\n\\ntemplate <typename DBN, typename Functor, typename Iterator, typename LIterator>\\n\\ndouble test_set(DBN& dbn, Iterator first, Iterator last, LIterator lfirst, LIterator /*llast*/, Functor&& f) {\\n\\n size_t success = 0;\\n\\n size_t images = 0;\\n\\n\\n\",\n \"file_path\": \"include/dll/test.hpp\",\n \"rank\": 51,\n \"score\": 211833.9773784324\n },\n {\n \"content\": \"struct timer_t {\\n\\n const char* name; ///< The name of the timer\\n\\n std::atomic<size_t> count; ///< The number of times it was incremented\\n\\n std::atomic<size_t> duration; ///< The total duration\\n\\n\\n\\n /*!\\n\\n * \\\\brief Initialize an empty counter\\n\\n */\\n\\n timer_t()\\n\\n : name(nullptr), count(0), duration(0) {}\\n\\n\\n\\n /*!\\n\\n * \\\\brief Copy a timer\\n\\n */\\n\\n timer_t(const timer_t& rhs)\\n\\n : name(rhs.name), count(rhs.count.load()), duration(rhs.duration.load()) {}\\n\\n\\n\\n /*!\\n\\n * \\\\brief Copy assign a timer\\n\\n */\\n\",\n \"file_path\": \"include/dll/util/timers.hpp\",\n \"rank\": 52,\n \"score\": 211566.74668838768\n },\n {\n \"content\": \"struct is_valid;\\n\\n\\n\\ntemplate <typename V, typename T1, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 53,\n \"score\": 211566.74668838768\n },\n {\n \"content\": \"struct timers_t {\\n\\n std::array<timer_t, max_timers> timers; ///< The timers\\n\\n std::mutex lock; ///< The lock to protect the timers\\n\\n\\n\\n /*!\\n\\n * \\\\brief Reset the status of the timers\\n\\n */\\n\\n void reset(){\\n\\n std::lock_guard<std::mutex> l(lock);\\n\\n\\n\\n for(auto& timer : timers){\\n\\n timer.name = nullptr;\\n\\n timer.duration = 0;\\n\\n timer.count = 0;\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Get a reference to the timer structure\\n\",\n \"file_path\": \"include/dll/util/timers.hpp\",\n \"rank\": 54,\n \"score\": 211566.74668838768\n },\n {\n \"content\": \"struct batch {\\n\\n using size_type = size_t; ///< The size type of the batch\\n\\n using value_type = typename std::decay_t<Iterator>::value_type; ///< The value type of the batch\\n\\n\\n\\n Iterator first; ///< The iterator to the first element\\n\\n Iterator last; ///< The iterator to the past the end element\\n\\n\\n\\n /*!\\n\\n * \\\\brief Create a batch\\n\\n * \\\\param first The first element of the batch\\n\\n * \\\\param first The past-the-end element of the batch\\n\\n */\\n\\n batch(Iterator&& first, Iterator&& last)\\n\\n : first(std::forward<Iterator>(first)),\\n\\n last(std::forward<Iterator>(last)) {\\n\\n cpp_assert(std::distance(first, last) > 0, \\\"Batch cannot be empty or reversed\\\");\\n\\n }\\n\\n\\n\\n /*!\\n\\n * \\\\brief Return an iterator pointing to the first element of the batch\\n\",\n \"file_path\": \"include/dll/util/batch.hpp\",\n \"rank\": 55,\n \"score\": 211566.74668838768\n },\n {\n \"content\": \"struct cannot_convert {\\n\\n /*!\\n\\n * \\\\brief False flag for TMP purpose\\n\\n */\\n\\n static constexpr bool value = false;\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Converter utility to converty from type *From* to type *To*.\\n\\n */\\n\\ntemplate<typename From, typename To, typename Enable = void>\\n\",\n \"file_path\": \"include/dll/util/converter.hpp\",\n \"rank\": 56,\n \"score\": 211566.74668838768\n },\n {\n \"content\": \"struct rbm_training_context {\\n\\n double reconstruction_error = 0.0; ///< The mean reconstruction error\\n\\n double free_energy = 0.0; ///< The mean free energy\\n\\n double sparsity = 0.0; ///< The mean sparsity\\n\\n\\n\\n double batch_error = 0.0; ///< The mean reconstruction error for the last batch\\n\\n double batch_sparsity = 0.0; ///< The mean sparsity for the last batch\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/trainer/rbm_training_context.hpp\",\n \"rank\": 57,\n \"score\": 209312.7974210647\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_shape_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_shape_3d_layer_impl<Desc>;\\n\\n using weight = typename DBN::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n using inputs_t = etl::dyn_matrix<weight, 4>;\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& layer) : input(batch_size, layer.C, layer.W, layer.H), output(batch_size, layer.C, layer.W, layer.H), errors(batch_size, layer.C, layer.W, layer.H){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/dyn_shape_3d_layer_impl.hpp\",\n \"rank\": 58,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_mp_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_mp_3d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.i1, layer.i2, layer.i3),\\n\\n output(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3),\\n\\n errors(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/pooling/dyn_mp_layer_impl.hpp\",\n \"rank\": 59,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_deconv_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_deconv_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\\n\\n output(batch_size, layer.k, layer.nh1, layer.nh2),\\n\\n errors(batch_size, layer.k, layer.nh1, layer.nh2) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dyn_deconv_layer_impl.hpp\",\n \"rank\": 60,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_mp_2d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_mp_2d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.i1, layer.i2, layer.i3),\\n\\n output(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2),\\n\\n errors(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2) {}\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Standard dyn max pooling layer\\n\\n */\\n\\ntemplate <typename Desc>\\n\",\n \"file_path\": \"include/dll/pooling/dyn_mp_layer_impl.hpp\",\n \"rank\": 61,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_avgp_2d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_avgp_2d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.i1, layer.i2, layer.i3),\\n\\n output(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2),\\n\\n errors(batch_size, layer.i1, layer.i2 / layer.c1, layer.i3 / layer.c2) {}\\n\\n};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Standard average pooling layer\\n\\n */\\n\\ntemplate <typename Desc>\\n\",\n \"file_path\": \"include/dll/pooling/dyn_avgp_layer_impl.hpp\",\n \"rank\": 62,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, batch_normalization_4d_layer_impl<Desc>, L> {\\n\\n using layer_t = batch_normalization_4d_layer_impl<Desc>; ///< The current layer type\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, layer_t::Kernels, layer_t::W, layer_t::H> input; ///< A batch of input\\n\\n etl::fast_matrix<weight, batch_size, layer_t::Kernels, layer_t::W, layer_t::H> output; ///< A batch of output\\n\\n etl::fast_matrix<weight, batch_size, layer_t::Kernels, layer_t::W, layer_t::H> errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/batch_normalization_4d_layer_impl.hpp\",\n \"rank\": 63,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_conv_same_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_conv_same_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\\n\\n output(batch_size, layer.k, layer.nv1, layer.nv2), errors(batch_size, layer.k, layer.nv1, layer.nv2) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dyn_conv_same_layer_impl.hpp\",\n \"rank\": 64,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, batch_normalization_2d_layer_impl<Desc>, L> {\\n\\n using layer_t = batch_normalization_2d_layer_impl<Desc>; ///< The current layer type\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::fast_matrix<weight, batch_size, Desc::Input> input; ///< A batch of input\\n\\n etl::fast_matrix<weight, batch_size, Desc::Input> output; ///< A batch of output\\n\\n etl::fast_matrix<weight, batch_size, Desc::Input> errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/batch_normalization_2d_layer_impl.hpp\",\n \"rank\": 65,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_lcn_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_lcn_layer_impl<Desc>; ///< The current layer type\\n\\n using previous_layer = typename DBN::template layer_type<L - 1>; ///< The previous layer type\\n\\n using previous_context = sgd_context<DBN, previous_layer, L - 1>; ///< The previous layer's context\\n\\n using inputs_t = decltype(std::declval<previous_context>().output); ///< The type of inputs\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& /*layer*/){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/dyn_lcn_layer_impl.hpp\",\n \"rank\": 66,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_avgp_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_avgp_3d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.i1, layer.i2, layer.i3),\\n\\n output(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3),\\n\\n errors(batch_size, layer.i1 / layer.c1, layer.i2 / layer.c2, layer.i3 / layer.c3) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/pooling/dyn_avgp_layer_impl.hpp\",\n \"rank\": 67,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_conv_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_conv_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\\n\\n output(batch_size, layer.k, layer.nh1, layer.nh2), errors(batch_size, layer.k, layer.nh1, layer.nh2) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dyn_conv_layer_impl.hpp\",\n \"rank\": 68,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_upsample_3d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_upsample_3d_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.i1, layer.i2, layer.i3),\\n\\n output(batch_size, layer.i1 * layer.c1, layer.i2 * layer.c2, layer.i3 * layer.c3),\\n\\n errors(batch_size, layer.i1 * layer.c1, layer.i2 * layer.c2, layer.i3 * layer.c3) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/pooling/dyn_upsample_layer_impl.hpp\",\n \"rank\": 69,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_shape_1d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_shape_1d_layer_impl<Desc>;\\n\\n using weight = typename DBN::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n using inputs_t = etl::dyn_matrix<weight, 2>;\\n\\n\\n\\n inputs_t input; ///< A batch of input\\n\\n inputs_t output; ///< A batch of output\\n\\n inputs_t errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& layer) : input(batch_size, layer.S), output(batch_size, layer.S), errors(batch_size, layer.S){}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/transform/dyn_shape_1d_layer_impl.hpp\",\n \"rank\": 70,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_dense_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_dense_layer_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 2> input;\\n\\n etl::dyn_matrix<weight, 2> output;\\n\\n etl::dyn_matrix<weight, 2> errors;\\n\\n\\n\\n sgd_context(layer_t& layer) : input(batch_size, layer.num_visible, 0.0), output(batch_size, layer.num_hidden, 0.0), errors(batch_size, layer.num_hidden, 0.0) {}\\n\\n};\\n\\n\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dyn_dense_layer_impl.hpp\",\n \"rank\": 71,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_conv_rbm_impl<Desc>, L> {\\n\\n using layer_t = dyn_conv_rbm_impl<Desc>;\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input;\\n\\n etl::dyn_matrix<weight, 4> output;\\n\\n etl::dyn_matrix<weight, 4> errors;\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.nc, layer.nv1, layer.nv2),\\n\\n output(batch_size, layer.k, layer.nh1, layer.nh2), errors(batch_size, layer.k, layer.nh1, layer.nh2) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/rbm/dyn_conv_rbm_impl.hpp\",\n \"rank\": 72,\n \"score\": 209261.76706147043\n },\n {\n \"content\": \"struct label_cache_helper;\\n\\n\\n\\n/*!\\n\\n * \\\\brief Helper to create and initialize a cache for labels.\\n\\n *\\n\\n * This version makes the label categorical.\\n\\n */\\n\\ntemplate <typename Desc, typename T, typename LIterator>\\n\",\n \"file_path\": \"include/dll/generators/label_cache_helper.hpp\",\n \"rank\": 73,\n \"score\": 209256.22228308965\n },\n {\n \"content\": \"struct default_dbn_watcher {\\n\\n static constexpr bool ignore_sub = false; ///< For pretraining of a DBN, indicates if the regular RBM watcher should be used (false) or ignored (true)\\n\\n static constexpr bool replace_sub = false; ///< For pretraining of a DBN, indicates if the DBN watcher should replace (true) the RBM watcher or not (false)\\n\\n\\n\\n size_t ft_max_epochs = 0; ///< The maximum number of epochs\\n\\n dll::stop_timer ft_epoch_timer; ///< Timer for an epoch\\n\\n dll::stop_timer ft_batch_timer; ///< Timer for a batch\\n\\n cpp::stop_watch<std::chrono::seconds> watch; ///< Timer for the entire training\\n\\n\\n\\n /*!\\n\\n * \\\\brief Indicates that the pretraining has begun for the given\\n\\n * DBN\\n\\n * \\\\param dbn The DBN being pretrained\\n\\n * \\\\param max_epochs The maximum number of epochs\\n\\n */\\n\\n void pretraining_begin(const DBN& dbn, size_t max_epochs) {\\n\\n std::cout << \\\"DBN: Pretraining begin for \\\" << max_epochs << \\\" epochs\\\" << std::endl;\\n\\n cpp_unused(dbn);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"include/dll/watcher.hpp\",\n \"rank\": 74,\n \"score\": 208143.72524829075\n },\n {\n \"content\": \"struct default_rbm_watcher {\\n\\n cpp::stop_watch<std::chrono::seconds> watch; ///< Timer for the entire training\\n\\n\\n\\n /*!\\n\\n * \\\\brief Indicates that the training of the given RBM started.\\n\\n * \\\\param rbm The rbm that started training.\\n\\n */\\n\\n template <typename RBM = R>\\n\\n void training_begin(const RBM& rbm) {\\n\\n using rbm_t = std::decay_t<RBM>;\\n\\n\\n\\n std::cout << \\\"Train RBM with \\\\\\\"\\\" << RBM::desc::template trainer_t<RBM>::name() << \\\"\\\\\\\"\\\" << std::endl;\\n\\n\\n\\n rbm.display();\\n\\n\\n\\n std::cout << \\\"With parameters:\\\" << std::endl;\\n\\n\\n\\n if(std::is_same<typename rbm_t::weight, float>::value){\\n\\n std::cout << \\\" single-precision\\\" << std::endl;\\n\\n } else if(std::is_same<typename rbm_t::weight, double>::value){\\n\",\n \"file_path\": \"include/dll/watcher.hpp\",\n \"rank\": 75,\n \"score\": 208143.72524829075\n },\n {\n \"content\": \"struct training_desc {\\n\\n size_t epochs = 25;\\n\\n double learning_rate = stupid_default;\\n\\n double momentum = stupid_default;\\n\\n size_t batch_size = 0;\\n\\n\\n\\n std::string decay = \\\"none\\\";\\n\\n double l1_weight_cost = stupid_default;\\n\\n double l2_weight_cost = stupid_default;\\n\\n\\n\\n std::string trainer = \\\"none\\\";\\n\\n\\n\\n bool verbose = false;\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/dll/processor/processor.hpp\",\n \"rank\": 76,\n \"score\": 208138.5510125068\n },\n {\n \"content\": \"struct get_value_l;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc get_value_l\\n\\n */\\n\\ntemplate <typename D, typename... T>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 77,\n \"score\": 207828.30467693185\n },\n {\n \"content\": \"struct sequence_add;\\n\\n\\n\\ntemplate <size_t... I, size_t N>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 78,\n \"score\": 207828.30467693185\n },\n {\n \"content\": \"struct get_value;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc get_value\\n\\n */\\n\\ntemplate <typename D, typename T2, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 79,\n \"score\": 207828.30467693185\n },\n {\n \"content\": \"struct converter_one {\\n\\n static_assert(cannot_convert<From, To>::value, \\\"DLL does not know how to convert your input type (one)\\\");\\n\\n};\\n\\n\\n\\n// No conversion\\n\\n// This should only happen when used from converter_many\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc converter_one\\n\\n */\\n\\ntemplate<typename From>\\n\",\n \"file_path\": \"include/dll/util/converter.hpp\",\n \"rank\": 80,\n \"score\": 207828.30467693188\n },\n {\n \"content\": \"struct get_value_1;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc get_value_1\\n\\n */\\n\\ntemplate <typename D, typename T2, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 81,\n \"score\": 207828.30467693185\n },\n {\n \"content\": \"struct stop_timer {\\n\\n std::chrono::time_point<std::chrono::steady_clock> start_time; ///< The start time\\n\\n\\n\\n /*!\\n\\n * \\\\brief Start the timer\\n\\n */\\n\\n void start() {\\n\\n start_time = std::chrono::steady_clock::now();\\n\\n }\\n\\n\\n\\n /*!\\n\\n * \\\\brief Stop the timer and get the elapsed since start\\n\\n * \\\\return elapsed time since start()\\n\\n */\\n\\n size_t stop() const {\\n\\n auto end = std::chrono::steady_clock::now();\\n\\n return std::chrono::duration_cast<std::chrono::milliseconds>(end - start_time).count();\\n\\n }\\n\\n};\\n\\n\\n\",\n \"file_path\": \"include/dll/util/timers.hpp\",\n \"rank\": 82,\n \"score\": 207828.30467693185\n },\n {\n \"content\": \"struct get_value_2;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc get_value_2\\n\\n */\\n\\ntemplate <typename D, typename T2, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 83,\n \"score\": 207828.30467693185\n },\n {\n \"content\": \"struct converter_many {\\n\\n static_assert(cannot_convert<From, To>::value, \\\"DLL does not know how to convert your input type (many)\\\");\\n\\n};\\n\\n\\n\\n// Only convert the sub types not the outer container\\n\\ntemplate<template<typename...> class Container, typename From, typename To>\\n\",\n \"file_path\": \"include/dll/util/converter.hpp\",\n \"rank\": 84,\n \"score\": 207828.30467693188\n },\n {\n \"content\": \"struct get_type;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc get_type\\n\\n */\\n\\ntemplate <typename D, typename T2, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 85,\n \"score\": 207828.30467693188\n },\n {\n \"content\": \"struct get_value_l<D, cpp::type_list<T...>> : cpp::auto_constant<get_value<D, T...>> {};\\n\\n\\n\\n/*!\\n\\n * \\\\brief Extract the type corresponding to the given configuration element from\\n\\n * the list of the parameters.\\n\\n * \\\\tparam D The configuration element type\\n\\n * \\\\tparam Args The arguments to extract the type from\\n\\n */\\n\\ntemplate <typename D, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 86,\n \"score\": 206126.6154566121\n },\n {\n \"content\": \"struct converter_one <From, From> {\\n\\n /*!\\n\\n * \\\\brief Convert from the given container into the specific type\\n\\n * \\\\param l The layer for which to convert\\n\\n * \\\\param from The container to convert from\\n\\n * \\\\return the converted result\\n\\n */\\n\\n template<typename L>\\n\\n static const From& convert(const L&, const From& from){\\n\\n return from;\\n\\n }\\n\\n};\\n\\n\\n\\n// Convert a vector<T_F> to a dyn_vector<T_T>\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc converter_one\\n\\n */\\n\\ntemplate<typename T_F, typename T_T, typename A>\\n\",\n \"file_path\": \"include/dll/util/converter.hpp\",\n \"rank\": 87,\n \"score\": 205657.28456934472\n },\n {\n \"content\": \"struct no_epoch_error_id;\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 88,\n \"score\": 204546.43688897716\n },\n {\n \"content\": \"struct early_training_id;\\n\\n\\n\\n/*!\\n\\n * \\\\brief Sets the minibatch size\\n\\n * \\\\tparam B The minibatch size\\n\\n */\\n\\ntemplate <size_t B>\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 89,\n \"score\": 204538.75018689985\n },\n {\n \"content\": \"struct batch_size_id;\\n\",\n \"file_path\": \"include/dll/base_conf.hpp\",\n \"rank\": 90,\n \"score\": 204516.30655443203\n },\n {\n \"content\": \"struct validate_label_layers;\\n\\n\\n\\ntemplate <typename Layer>\\n\",\n \"file_path\": \"include/dll/dbn_layers.hpp\",\n \"rank\": 91,\n \"score\": 204491.39702062242\n },\n {\n \"content\": \"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<Desc::Categorical && !etl::is_etl_expr<typename std::iterator_traits<LIterator>::value_type>>> {\\n\\n using cache_type = etl::dyn_matrix<T, 2>; ///< The type of the cache\\n\\n using big_cache_type = etl::dyn_matrix<T, 3>; ///< The type of the big cache\\n\\n\\n\\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\\n\\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\\n\\n\\n\\n /*!\\n\\n * \\\\brief Init the cache\\n\\n * \\\\param n The size of the cache\\n\\n * \\\\param n_classes The number of classes\\n\\n * \\\\param it An iterator to an element\\n\\n * \\\\param cache The cache to initialize\\n\\n */\\n\\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\\n\\n cache = cache_type(n, n_classes);\\n\\n cache = T(0);\\n\\n\\n\\n cpp_unused(it);\\n\\n }\\n\",\n \"file_path\": \"include/dll/generators/label_cache_helper.hpp\",\n \"rank\": 92,\n \"score\": 204370.99071949517\n },\n {\n \"content\": \"struct label_cache_helper<Desc, T, LIterator, std::enable_if_t<!Desc::Categorical && !etl::is_etl_expr<typename std::iterator_traits<LIterator>::value_type>>> {\\n\\n using cache_type = etl::dyn_matrix<T, 1>; ///< The type of the cache\\n\\n using big_cache_type = etl::dyn_matrix<T, 2>; ///< The type of the big cache\\n\\n\\n\\n static constexpr size_t batch_size = Desc::BatchSize; ///< The size of the generated batches\\n\\n static constexpr size_t big_batch_size = Desc::BigBatchSize; ///< The number of batches kept in cache\\n\\n\\n\\n /*!\\n\\n * \\\\brief Init the cache\\n\\n * \\\\param n The size of the cache\\n\\n * \\\\param n_classes The number of classes\\n\\n * \\\\param it An iterator to an element\\n\\n * \\\\param cache The cache to initialize\\n\\n */\\n\\n static void init(size_t n, size_t n_classes, const LIterator& it, cache_type& cache) {\\n\\n cache = cache_type(n);\\n\\n\\n\\n cpp_unused(it);\\n\\n cpp_unused(n_classes);\\n\\n }\\n\",\n \"file_path\": \"include/dll/generators/label_cache_helper.hpp\",\n \"rank\": 93,\n \"score\": 204370.99071949517\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_batch_normalization_4d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_batch_normalization_4d_layer_impl<Desc>; ///< The current layer type\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 4> input; ///< A batch of input\\n\\n etl::dyn_matrix<weight, 4> output; ///< A batch of output\\n\\n etl::dyn_matrix<weight, 4> errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& layer)\\n\\n : input(batch_size, layer.Kernels, layer.W, layer.H), output(batch_size, layer.Kernels, layer.W, layer.H), errors(batch_size, layer.Kernels, layer.W, layer.H) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dyn_batch_normalization_4d_layer_impl.hpp\",\n \"rank\": 94,\n \"score\": 204306.44669919563\n },\n {\n \"content\": \"struct sgd_context<DBN, dyn_batch_normalization_2d_layer_impl<Desc>, L> {\\n\\n using layer_t = dyn_batch_normalization_2d_layer_impl<Desc>; ///< The current layer type\\n\\n using weight = typename layer_t::weight; ///< The data type for this layer\\n\\n\\n\\n static constexpr auto batch_size = DBN::batch_size;\\n\\n\\n\\n etl::dyn_matrix<weight, 2> input; ///< A batch of input\\n\\n etl::dyn_matrix<weight, 2> output; ///< A batch of output\\n\\n etl::dyn_matrix<weight, 2> errors; ///< A batch of errors\\n\\n\\n\\n sgd_context(layer_t& layer) : input(batch_size, layer.Input), output(batch_size, layer.Input), errors(batch_size, layer.Input) {}\\n\\n};\\n\\n\\n\\n} //end of dll namespace\\n\",\n \"file_path\": \"include/dll/neural/dyn_batch_normalization_2d_layer_impl.hpp\",\n \"rank\": 95,\n \"score\": 204306.44669919563\n },\n {\n \"content\": \"struct conditional_constant_v1;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc conditional_constant_v1\\n\\n */\\n\\ntemplate <typename V1, typename V2>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 96,\n \"score\": 204234.50567836658\n },\n {\n \"content\": \"struct conditional_constant_v2;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc conditional_constant_v2\\n\\n */\\n\\ntemplate <typename V1, typename V2>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 97,\n \"score\": 204234.50567836658\n },\n {\n \"content\": \"struct get_template_type;\\n\\n\\n\\n/*!\\n\\n * \\\\copydoc get_template_type\\n\\n */\\n\\ntemplate <typename D, typename T2, typename... Args>\\n\",\n \"file_path\": \"include/dll/util/tmp.hpp\",\n \"rank\": 98,\n \"score\": 204234.50567836658\n }\n]","isConversational":false}}},{"rowIdx":499,"cells":{"lang":{"kind":"string","value":"C++"},"file_path":{"kind":"string","value":"torch/csrc/jit/testing/module_differ.cpp"},"repo_name":{"kind":"string","value":"aaditya-panik/pytorch"},"commit":{"kind":"string","value":"731c8255b7e8ed5435bfa09c7e0ad5f60bcc91d4"},"file_code":{"kind":"string","value":"#include <torch/csrc/jit/testing/module_differ.h>\n\n#include <torch/csrc/jit/mobile/interpreter.h>\n\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\nnamespace torch {\nnamespace jit {\n\ntemplate <typename It>\nbool ivalueListEquals(\n It lbegin,\n It lend,\n It rbegin,\n It rend,\n bool print,\n int print_indent) {\n int i = 0;\n const std::string indent(print_indent, '\\t');\n for (; lbegin != lend && rbegin != rend; ++lbegin, ++rbegin, ++i) {\n if (!ivalueEquals(*lbegin, *rbegin, print, print_indent + 1)) {\n std::cout << indent << \"list element differs at position \" << i\n << std::endl;\n return false;\n }\n }\n return true;\n}\n\nbool ivalueEquals(\n const IValue& lhs,\n const IValue& rhs,\n bool print,\n int print_indent) {\n const std::string indent(print_indent, '\\t');\n if (lhs.tagKind() != rhs.tagKind()) {\n if (print) {\n std::cout << indent << \"lhs is type: \" << lhs.tagKind()\n << \"rhs is type: \" << rhs.tagKind() << std::endl;\n }\n return false;\n }\n if (lhs.isCapsule()) {\n return true;\n }\n\n if (lhs.isDouble() || lhs.isComplexDouble() || lhs.isInt() || lhs.isBool() ||\n lhs.isString() || lhs.isDevice() || lhs.isCapsule() || lhs.isRRef() ||\n lhs.isEnum() || lhs.isIntList() || lhs.isDoubleList() ||\n lhs.isBoolList() || lhs.isNone()) {\n \n if (lhs != rhs) {\n if (print) {\n std::cout << indent << \"lhs is \" << lhs << \" || rhs is \" << rhs\n << std::endl;\n }\n return false;\n }\n return true;\n }\n\n if (lhs.isTensor()) {\n const auto& lt = lhs.toTensor();\n const auto& rt = rhs.toTensor();\n std::stringstream lsize;\n std::stringstream rsize;\n for (const auto x : lt.sizes()) {\n lsize << x << \",\";\n }\n for (const auto x : rt.sizes()) {\n rsize << x << \",\";\n }\n if (lsize.str() != lsize.str()) {\n if (print) {\n std::cout << indent << \"left tensor is of shape \" << lsize.str()\n << \"but right tensor is of shape \" << rsize.str()\n << std::endl;\n }\n return false;\n }\n if (lt.allclose(rt)) {\n return true;\n } else {\n if (print) {\n std::cout << indent << \"rhs and lhs has are not close\" << std::endl;\n }\n return false;\n }\n }\n\n if (lhs.isGenericDict()) {\n const auto& ldict = lhs.toGenericDict();\n const auto& rdict = rhs.toGenericDict();\n if (ldict.size() != rdict.size()) {\n if (print) {\n std::cout << indent << \"lhs and rhs are dicts of different sizes: \"\n << ldict.size() << \" vs. \" << rdict.size() << std::endl;\n }\n return false;\n }\n\n for (const auto& kv : ldict) {\n auto rhs_iter = rdict.find(kv.key());\n if (rhs_iter == rdict.end()) {\n if (print) {\n std::cout << indent << \"rhs missing key: \" << kv.key() << std::endl;\n }\n }\n if (!ivalueEquals(\n kv.value(), rhs_iter->value(), print, print_indent + 1)) {\n if (print) {\n std::cout << indent << \"for key: \" << kv.key() << \" value differs.\"\n << std::endl;\n }\n return false;\n }\n }\n return true;\n } else if (lhs.isTensorList() || lhs.isList()) {\n const auto& vec = lhs.toList();\n const auto& rvec = rhs.toList();\n return ivalueListEquals(\n vec.begin(), vec.end(), rvec.begin(), rvec.end(), print, print_indent);\n } else if (lhs.isTuple()) {\n const auto vec = lhs.toTuple()->elements();\n const auto rvec = rhs.toTuple()->elements();\n return ivalueListEquals(\n vec.begin(), vec.end(), rvec.begin(), rvec.end(), print, print_indent);\n } else if (lhs.isObject()) {\n auto lobj = lhs.toObject();\n auto robj = rhs.toObject();\n auto ltype = lobj->type();\n auto rtype = robj->type();\n\n if (ltype->name() != rtype->name()) {\n if (print) {\n std::cerr << indent << \"left object is of type: \"\n << ltype->name()->qualifiedName()\n << \" but right obj is of type: \"\n << rtype->name()->qualifiedName() << std::endl;\n }\n return false;\n }\n\n auto getstate = ltype->findMethod(\"__getstate__\");\n if (getstate != nullptr) {\n return ivalueEquals(\n (*getstate)({lobj}), (*getstate)({robj}), print, print_indent + 1);\n }\n\n for (int i = 0; i < ltype->numAttributes(); i++) {\n if (!ivalueEquals(\n lobj->getSlot(i), robj->getSlot(i), print, print_indent + 1)) {\n std::cout << \"attribute differs at position \" << i << std::endl;\n return false;\n }\n }\n return true;\n }\n std::cerr << \" I am here and should not be: \" << rhs.tagKind() << std::endl;\n return false;\n}\n\ntemplate <typename T, typename COMP, typename PRINTER>\nbool vectorEqual(\n const std::vector<T>& lhs,\n const std::vector<T>& rhs,\n bool print,\n COMP comparator,\n PRINTER printer) {\n if (lhs.size() != rhs.size()) {\n if (print) {\n std::cout << \"lhs and rhs has different size: \" << lhs.size() << \"vs. \"\n << rhs.size() << std::endl;\n }\n return false;\n }\n\n for (int i = 0; i < lhs.size(); i++) {\n if (!comparator(lhs[i], rhs[i])) {\n if (print) {\n std::cout << i << \"th element of lhs and rhs differs \\n lhs is \"\n << printer(lhs[i]) << \" rhs is \" << printer(rhs[i])\n << std::endl;\n }\n return false;\n }\n }\n\n return true;\n}\n\nbool moduleFunctionEquals(\n const mobile::Function& lhs,\n const mobile::Function& rhs,\n bool print) {\n const auto* lhs_code = lhs.get_code().get();\n const auto* rhs_code = rhs.get_code().get();\n\n \n if (print) {\n std::cout << \"> Diffing instructions...\" << std::endl;\n }\n auto ins_equal = [](Instruction lins, Instruction rins) -> bool {\n return (lins.op == rins.op && lins.N == rins.N && lins.X == rins.X);\n };\n auto id = [](auto ins) {\n return ins; \n };\n if (vectorEqual(\n lhs_code->instructions_,\n rhs_code->instructions_,\n true,\n ins_equal,\n id)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n \n\n if (print) {\n std::cout << \"> Diffing constants...\" << std::endl;\n }\n if (ivalueListEquals(\n lhs_code->constants_.begin(),\n lhs_code->constants_.end(),\n rhs_code->constants_.begin(),\n rhs_code->constants_.end(),\n true,\n 2)) {\n std::cout << \" pass\" << std::endl;\n } else {\n std::cout << \" fail\" << std::endl;\n return false;\n }\n\n \n if (print) {\n std::cout << \"> Diffing operators ...\" << std::endl;\n }\n auto equals = [](auto op1, auto op2) -> bool { return op1 == op2; };\n if (vectorEqual(lhs_code->op_names_, rhs_code->op_names_, true, equals, id)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n if (lhs_code->register_size_ != rhs_code->register_size_) {\n std::cout << \"Register size differs: \" << lhs_code->register_size_\n << \" vs. \" << rhs_code->register_size_ << std::endl;\n return false;\n }\n\n \n if (print) {\n std::cout << \"> Diffing debug handles...\" << std::endl;\n }\n if (vectorEqual(\n lhs_code->debug_handles_,\n rhs_code->debug_handles_,\n true,\n equals,\n id)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n \n auto type_eq = [](auto t1, auto t2) { return t1->str() == t2->str(); };\n auto type_print = [](auto t1) { return t1->str(); };\n\n if (print) {\n std::cout << \"> Diffing types...\" << std::endl;\n }\n if (vectorEqual(\n lhs_code->types_, rhs_code->types_, true, type_eq, type_print)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n if (print) {\n std::cout << \"> Diffing schema...\" << std::endl;\n }\n \n \n \n if (toString(lhs.getSchema()) == toString(rhs.getSchema())) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" lhs is \" << lhs.getSchema() << std::endl;\n std::cout << \" rhs is \" << rhs.getSchema() << std::endl;\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n return true;\n}\n\nbool moduleEquals(const mobile::Module& lhs, const mobile::Module& rhs) {\n std::unordered_map<std::string, const mobile::Function*> lhs_name_to_func;\n std::unordered_map<std::string, const mobile::Function*> rhs_name_to_func;\n\n for (const auto& func : lhs.compilation_unit().methods()) {\n lhs_name_to_func[func->name()] = func.get();\n }\n for (const auto& func : rhs.compilation_unit().methods()) {\n rhs_name_to_func[func->name()] = func.get();\n }\n\n for (const auto& name_func : lhs_name_to_func) {\n auto rhs_func = rhs_name_to_func.find(name_func.first);\n if (rhs_func == rhs_name_to_func.end()) {\n std::cout << \"Method with name: \" << name_func.first\n << \" only exists in lhs\";\n }\n std::cout << \"comparing method with name \" << name_func.first << std::endl;\n if (moduleFunctionEquals(*name_func.second, *rhs_func->second, true)) {\n std::cout << \"pass\" << std::endl;\n } else {\n std::cout << \"fail\" << std::endl;\n return false;\n }\n }\n\n std::cout << \"Diffing m._ivalue()...\" << std::endl;\n if (ivalueEquals(lhs._ivalue(), rhs._ivalue(), true, 0)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n return true;\n}\n\n} \n} \n"},"prefix":{"kind":"string","value":"#include <torch/csrc/jit/testing/module_differ.h>\n\n#include <torch/csrc/jit/mobile/interpreter.h>\n\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\nnamespace torch {\nnamespace jit {\n\ntemplate <typename It>\nbool ivalueListEquals(\n It lbegin,\n It lend,\n It rbegin,\n It rend,\n bool print,\n int print_indent) {\n int i = 0;\n const std::string indent(print_indent, '\\t');\n for (; lbegin != lend && rbegin != rend; ++lbegin, ++rbegin, ++i) {\n if (!ivalueEquals(*lbegin, *rbegin, print, print_indent + 1)) {\n std::cout << indent << \"list element differs at position \" << i\n << std::endl;\n return false;\n }\n }\n return true;\n}\n\nbool ivalueEquals(\n const IValue& lhs,\n const IValue& rhs,\n bool print,\n int print_indent) {\n const std::string indent(print_indent, '\\t');\n if (lhs.tagKind() != rhs.tagKind()) {\n if (print) {\n std::cout << indent << \"lhs is type: \" << lhs.tagKind()\n << \"rhs is type: \" << rhs.tagKind() << std::endl;\n }\n return false;\n }\n if (lhs.isCapsule()) {\n return true;\n }\n\n if (lhs.isDouble() || lhs.isComplexDouble() || lhs.isInt() || lhs.isBool() ||\n lhs.isString() || lhs.isDevice() || lhs.isCapsule() || lhs.isRRef() ||\n lhs.isEnum() || lhs.isIntList() || lhs.isDoubleList() ||\n lhs.isBoolList() || lhs.isNone()) {\n \n if (lhs != rhs) {\n if (print) {\n std::cout << indent << \"lhs is \" << lhs << \" || rhs is \" << rhs\n << std::endl;\n }\n return false;\n }\n return true;\n }\n\n if (lhs.isTensor()) {\n const auto& lt = lhs.toTensor();\n const auto& rt = rhs.toTensor();\n std::stringstream lsize;\n std::stringstream rsize;\n for (const auto x : lt.sizes()) {\n lsize << x << \",\";\n }\n for (const auto x : rt.sizes()) {\n rsize << x << \",\";\n }\n if (lsize.str() != lsize.str()) {\n if (print) {\n std::cout << indent << \"left tensor is of shape \" << lsize.str()\n << \"but right tensor is of shape \" << rsize.str()\n << std::endl;\n }\n return false;\n }\n if (lt.allclose(rt)) {\n return true;\n } else {\n if (print) {\n std::cout << indent << \"rhs and lhs has are not close\" << std::endl;\n }\n return false;\n }\n }\n\n if (lhs.isGenericDict()) {\n const auto& ldict = lhs.toGenericDict();\n const auto& rdict = rhs.toGenericDict();\n if (ldict.size() != rdict.size()) {\n if (print) {\n std::cout << indent << \"lhs and rhs are dicts of different sizes: \"\n << ldict.size() << \" vs. \" << rdict.size() << std::endl;\n }\n return false;\n }\n\n for (const auto& kv : ldict) {\n auto rhs_iter = rdict.find(kv.key());\n if (rhs_iter == rdict.end()) {\n if (print) {\n std::cout << indent << \"rhs missing key: \" << kv.key() << std::endl;\n }\n }\n if (!ivalueEquals(\n kv.value(), rhs_iter->value(), print, print_indent + 1)) {\n if (print) {\n std::cout << indent << \"for key: \" << kv.key() << \" value differs.\"\n << std::endl;\n }\n return false;\n }\n }\n return true;\n } else if (lhs.isTensorList() || lhs.isList()) {\n const auto& vec = lhs.toList();\n const auto& rvec = rhs.toList();\n return ivalueListEquals(\n vec.begin(), vec.end(), rvec.begin(), rvec.end(), print, print_indent);\n } else if (lhs.isTuple()) {\n const auto vec = lhs.toTuple()->elements();\n const auto rvec = rhs.toTuple()->elements();\n return ivalueListEquals(\n vec.begin(), vec.end(), rvec.begin(), rvec.end(), print, print_indent);\n } else if (lhs.isObject()) {\n auto lobj = lhs.toObject();\n auto robj = rhs.toObject();\n auto ltype = lobj->type();\n auto rtype = robj->type();\n\n if (ltype->name() != rtype->name()) {\n if (print) {\n std::cerr << indent << \"left object is of type: \"\n << ltype->name()->qualifiedName()\n << \" but right obj is of type: \"\n << rtype->name()->qualifiedName() << std::endl;\n }\n return false;\n }\n\n auto getstate = ltype->findMethod(\"__getstate__\");\n if (getstate != nullptr) {\n return ivalueEquals(\n (*getstate)({lobj}), (*getstate)({robj}), print, print_indent + 1);\n }\n\n for (int i = 0; i < ltype->numAttributes(); i++) {\n if (!ivalueEquals(\n lobj->getSlot(i), robj->getSlot(i), print, print_indent + 1)) {\n std::cout << \"attribute differs at position \" << i << std::endl;\n return false;\n }\n }\n return true;\n }\n std::cerr << \" I am here and should not be: \" << rhs.tagKind() << std::endl;\n return false;\n}\n\ntemplate <typename T, typename COMP, typename PRINTER>\nbool vectorEqual(\n const std::vector<T>& lhs,\n const std::vector<T>& rhs,\n bool print,\n COMP comparator,\n PRINTER printer) {\n if (lhs.size() != rhs.size()) {\n if (print) {\n std::cout << \"lhs and rhs has different size: \" << lhs.size() << \"vs. \"\n << rhs.size() << std::endl;\n }\n return false;\n }\n\n for (int i = 0; i < lhs.size(); i++) {\n if (!comparator(lhs[i], rhs[i])) {\n if (print) {\n std::cout << i << \"th element of lhs and rhs differs \\n lhs is \"\n << printer(lhs[i]) << \" rhs is \" << printer(rhs[i])\n << std::endl;\n }\n return false;\n }\n }\n\n return true;\n}\n\nbool moduleFunctionEquals(\n const mobile::Function& lhs,\n const mobile::Function& rhs,\n bool print) {\n const auto* lhs_code = lhs.get_code().get();\n const auto* rhs_code = rhs.get_code().get();\n\n \n if (print) {\n std::cout << \"> Diffing instructions...\" << std::endl;\n }\n auto ins_equal = [](Instruction lins, Instruction rins) -> bool {\n return (lins.op == rins.op && lins.N == rins.N && lins.X == rins.X);\n };\n auto id = [](auto ins) {\n return ins; \n };\n if (vectorEqual(\n lhs_code->instructions_,\n rhs_code->instructions_,\n true,\n ins_equal,\n id)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n \n\n if (print) {\n std::cout << \"> Diffing constants...\" << std::endl;\n }\n if (ivalueListEquals(\n lhs_code->constants_.begin(),\n lhs_code->constants_.end(),\n rhs_code->constants_.begin(),\n rhs_code->constants_.end(),\n true,\n 2)) {\n std::cout << \" pass\" << std::endl;\n } else {\n std::cout << \" fail\" << std::endl;\n return false;\n }\n\n \n if (print) {\n std::cout << \"> Diffing operators ...\" << std::endl;\n }\n auto equals = [](auto op1, auto op2) -> bool { return op1 == op2; };\n if (vectorEqual(lhs_code->op_names_, rhs_code->op_names_, true, equals, id)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n if (lhs_code->register_size_ != rhs_code->register_size_) {\n std::cout << \"Register size differs: \" << lhs_code->register_size_\n << \" vs. \" << rhs_code->register_size_ << std::endl;\n return false;\n }\n\n \n if (print) {\n std::cout << \"> Diffing debug handles...\" << std::endl;\n }\n if ("},"suffix":{"kind":"string","value":") {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n \n auto type_eq = [](auto t1, auto t2) { return t1->str() == t2->str(); };\n auto type_print = [](auto t1) { return t1->str(); };\n\n if (print) {\n std::cout << \"> Diffing types...\" << std::endl;\n }\n if (vectorEqual(\n lhs_code->types_, rhs_code->types_, true, type_eq, type_print)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n if (print) {\n std::cout << \"> Diffing schema...\" << std::endl;\n }\n \n \n \n if (toString(lhs.getSchema()) == toString(rhs.getSchema())) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" lhs is \" << lhs.getSchema() << std::endl;\n std::cout << \" rhs is \" << rhs.getSchema() << std::endl;\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n\n return true;\n}\n\nbool moduleEquals(const mobile::Module& lhs, const mobile::Module& rhs) {\n std::unordered_map<std::string, const mobile::Function*> lhs_name_to_func;\n std::unordered_map<std::string, const mobile::Function*> rhs_name_to_func;\n\n for (const auto& func : lhs.compilation_unit().methods()) {\n lhs_name_to_func[func->name()] = func.get();\n }\n for (const auto& func : rhs.compilation_unit().methods()) {\n rhs_name_to_func[func->name()] = func.get();\n }\n\n for (const auto& name_func : lhs_name_to_func) {\n auto rhs_func = rhs_name_to_func.find(name_func.first);\n if (rhs_func == rhs_name_to_func.end()) {\n std::cout << \"Method with name: \" << name_func.first\n << \" only exists in lhs\";\n }\n std::cout << \"comparing method with name \" << name_func.first << std::endl;\n if (moduleFunctionEquals(*name_func.second, *rhs_func->second, true)) {\n std::cout << \"pass\" << std::endl;\n } else {\n std::cout << \"fail\" << std::endl;\n return false;\n }\n }\n\n std::cout << \"Diffing m._ivalue()...\" << std::endl;\n if (ivalueEquals(lhs._ivalue(), rhs._ivalue(), true, 0)) {\n std::cout << \" pass.\" << std::endl;\n } else {\n std::cout << \" fail.\" << std::endl;\n return false;\n }\n return true;\n}\n\n} \n} \n"},"middle":{"kind":"string","value":"vectorEqual(\n lhs_code->debug_handles_,\n rhs_code->debug_handles_,\n true,\n equals,\n id)"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":4,"numItemsPerPage":100,"numTotalItems":13489,"offset":400,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTI5MjYzMywic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3NzkyOTYyMzMsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.iSJsWP9JxVxGlpzgFAnewJubAhRwBWEP55HI7_4RN3xejaPyZLDJYxu556Ebmu-5Z95ORXPCX88ufNMQVchHAQ","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++ | lib/src/Core/AnimatedEntity.cpp | emilhornlund/DV1537Project-AlienAdventure | b370e49d259ee722edd6f39c979824280522076a |
#include <Core/AnimatedEntity.hpp>
#include <Core/Animation.hpp>
#include <SFML/Graphics/RenderStates.hpp>
#include <SFML/Graphics/RenderTarget.hpp>
CGL::AnimatedEntity::AnimatedEntity(const bool paused) : m_animation(nullptr),
m_currentFrame(0),
... |
#include <Core/AnimatedEntity.hpp>
#include <Core/Animation.hpp>
#include <SFML/Graphics/RenderStates.hpp>
#include <SFML/Graphics/RenderTarget.hpp>
CGL::AnimatedEntity::AnimatedEntity(const bool paused) : m_animation(nullptr),
m_currentFrame(0),
... |
void CGL::AnimatedEntity::update(sf::Time deltaTime) {
if (!this->m_isPaused && this->m_animation) {
this->m_currentTime += deltaTime;
if (this->m_currentTime >= this->m_animation->getFrameTime()) {
this->m_currentTime = sf::microseconds(this->m_currentTime.asMicroseconds() % this->m_a... | t>(rect.left) + 0.0001f;
float right = left + static_cast<float>(rect.width);
float top = static_cast<float>(rect.top);
float bottom = top + static_cast<float>(rect.height);
this->m_vertices[0].texCoords = sf::Vector2f(left, top);
this->m_vertices[1].texCoords = sf::Vector2f(lef... | function_block-function_prefixed | [
{
"content": " class Animation {\n\n private:\n\n sf::Time m_frameTime;\n\n\n\n bool m_isLooped;\n\n\n\n std::vector<sf::IntRect> m_frames;\n\n\n\n const sf::Texture *m_texture;\n\n\n\n Animation(const Animation &original);\n\n\n\n Animation &operator=(const Anima... |
C++ | NNet/ModelIO/NNetModelImporter.cpp | pk1954/solutions | 02cd67fc1e6299e9fe56ce04dce2515d6f30df92 |
#include "stdafx.h"
#include <filesystem>
#include <assert.h>
#include "ERRHNDL.H"
#include "SignalFactory.h"
#include "SignalGenerator.h"
#include "UPSigGenList.h"
#include "Knot.h"
#include "Neuron.h"
#include "InputConnector.h"
#include "OutputConnector.h"
#include "MonitorData.h"
#include "NobException.h"
#includ... |
#include "stdafx.h"
#include <filesystem>
#include <assert.h>
#include "ERRHNDL.H"
#include "SignalFactory.h"
#include "SignalGenerator.h"
#include "UPSigGenList.h"
#include "Knot.h"
#include "Neuron.h"
#include "InputConnector.h"
#include "OutputConnector.h"
#include "MonitorData.h"
#include "NobException.h"
#includ... | ;
}
);
}
void NNetModelImporter::importModel()
{
ImportTermination::Result res;
Script script;
bool bSuccess { false };
if (! m_wstrFile2Read.empty())
{
script.SetEcho(true);
try
{
bSuccess = script.ScrProcess... | SymbolTable::ScrDefConst
(
ParamType::GetName(param),
static_cast<unsigned long>(param)
) | call_expression | [
{
"content": "class Neuron : public BaseKnot\n\n{\n\npublic:\n\n\tNeuron(MicroMeterPnt const &, NobType const = NobType::Value::neuron);\n\n\tNeuron(BaseKnot const &, NobType const = NobType::Value::neuron);\n\n\tNeuron(Neuron const &); // copy constructor\n\n\n\n\tNeuron & operator=(Neuron con... |
C++ | hpx/runtime/serialization/map.hpp | akemp/hpx | 1ddf7282e322c30d82f2be044071aed14807ebe1 |
#ifndef HPX_SERIALIZATION_MAP_HPP
#define HPX_SERIALIZATION_MAP_HPP
#include <map>
#include <boost/mpl/and.hpp>
#include <boost/type_traits/remove_const.hpp>
#include <boost/type_traits/add_reference.hpp>
#include <hpx/runtime/serialization/input_archive.hpp>
#include <hpx/runtime/serialization/output_archive.hpp>... |
#ifndef HPX_SERIALIZATION_MAP_HPP
#define HPX_SERIALIZATION_MAP_HPP
#include <map>
#include <boost/mpl/and.hpp>
#include <boost/type_traits/remove_const.hpp>
#include <boost/type_traits/add_reference.hpp>
#include <hpx/runtime/serialization/input_archive.hpp>
#include <hpx/runtime/serialization/output_archive.hpp>... |
}
}
template <class Key, class Value>
void serialize(input_archive& ar, std::pair<Key, Value>& t, unsigned)
{
typedef std::pair<Key, Value> pair_type;
typedef typename traits::is_bitwise_serializable<pair_type> optimized;
detail::load_... | if (!has_array_optimization(ar))
save_pair_impl(ar, t, boost::mpl::false_());
else
save_binary(ar, &t, sizeof(std::pair<Key, Value>)); | if_condition | [
{
"content": " class function<Sig, void, void>\n\n : public detail::basic_function<\n\n detail::function_vtable_ptr<Sig, void, void>\n\n , Sig\n\n >\n\n {\n\n typedef detail::function_vtable_ptr<Sig, void, void> vtable_ptr;\n\n typedef detail::basic_function<v... |
C++ | native-library/src/util_classes/accessor_base.hpp | AVSystem/Anjay-java | c8f8c5e0ac5a086db4ca183155eed07374fc6585 |
#pragma once
#include "../jni_wrapper.hpp"
#include <optional>
#include <string>
#include <type_traits>
#include <unordered_map>
#include "./exception.hpp"
#include "./optional_tag.hpp"
namespace utils {
namespace detail {
template <class T>
struct dependent_false : std::false_type {};
template <typename T>
st... |
#pragma once
#include "../jni_wrapper.hpp"
#include <optional>
#include <string>
#include <type_traits>
#include <unordered_map>
#include "./exception.hpp"
#include "./optional_tag.hpp"
namespace utils {
namespace detail {
template <class T>
struct dependent_false : std::false_type {};
template <typename T>
st... |
template <typename T>
auto get_value(const char *field_name) {
if constexpr (std::is_same<T, size_t>::value) {
auto value = get_impl<jni::jlong>(field_name);
if (value < 0) {
avs_throw(IllegalArgumentException(
env_,
... | std::optional<std::vector<T>> get_optional_array(const char *field_name) {
if constexpr (std::is_arithmetic<T>::value) {
auto optional_value =
get_impl<jni::Object<OptionalTag>>(field_name);
auto accessor = AccessorBase<OptionalTag>{ env_, optional_value };
... | function_block-full_function | [
{
"content": "struct ClassCastException : public jni::PendingJavaException {\n\n ClassCastException(JNIEnv &env, const char *str)\n\n : jni::PendingJavaException() {\n\n env.ThrowNew(env.FindClass(\"java/lang/ClassCastException\"), str);\n\n }\n\n\n\n ClassCastException(JNIEnv &env, c... |
C++ | tools/macpo/tests/integration-tests/itest_harness.cpp | roystgnr/perfexpert | a03b13db9ac83e992e1c5cc3b6e45e52c266fe30 |
#include <fcntl.h>
#include <rose.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <cerrno>
#include <fstream>
#include <string>
#include <vector>
#include "generic_defs.h"
#include "itest_harness.h"
#include "minst.h"
bool file_exists(const std::string& filename) {
return access(filename.c_str(), F_OK)... |
#include <fcntl.h>
#include <rose.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <cerrno>
#include <fstream>
#include <string>
#include <vector>
#include "generic_defs.h"
#include "itest_harness.h"
#include "minst.h"
bool file_exists(const std::string& filename) {
return access(filename.c_str(), F_OK)... | .push_back("-o");
args.push_back(output_file);
args.push_back("-lstdc++");
std::string mock_include_path = get_src_directory() + "/../libmrt";
args.push_back("-I" + mock_include_path);
args.push_back(get_build_directory() + "/mrt.o");
if (special_args) {
args.insert(args.end(), sp... | put_file,
std::string& output_file, string_list_t* special_args) {
args.push_back("cc");
args.push_back(input_file);
args | random | [
{
"content": "class FooTest : public ::testing::TestWithParam<const char*> {\n\n // You can implement all the usual class fixture members here.\n\n};\n\n\n\n// Then, use the TEST_P macro to define as many parameterized tests\n\n// for this fixture as you want. The _P suffix is for \"parameterized\"\n\n// or \"... |
C++ | Common/Loader/ssloader_sspj.cpp | SpriteStudio/SpriteStudio6-SDK | f2ad84c8e3ca9d189904da9c3d1114bb4044eecb | #include "ssloader_sspj.h"
#include "ssloader_ssae.h"
#include "ssloader_ssce.h"
#include "ssloader_ssee.h"
#include "ssloader_ssqe.h"
#include "ssstring_uty.h"
#include "../Helper/DebugPrint.h"
#include "sscharconverter.h"
namespace spritestudio6
{
SsString SsProject::getSsceBasepath(){
return getFullPath( m_pro... | #include "ssloader_sspj.h"
#include "ssloader_ssae.h"
#include "ssloader_ssce.h"
#include "ssloader_ssee.h"
#include "ssloader_ssqe.h"
#include "ssstring_uty.h"
#include "../Helper/DebugPrint.h"
#include "sscharconverter.h"
namespace spritestudio6
{
SsString SsProject::getSsceBasepath(){
return getFullPath( m_pro... | rsion" );
if ( anime ) delete anime;
delete proj;
return 0;
}
}
std::map<std::string, std::string> textures;
for ( size_t i = 0 ;i < proj->getCellMapNum() ; i++ )
{
SsString sscepath = SsCharConverter::convert_path_string(proj->getCellMapFilePath(i));
SsCellMap* cell = ssloader_ssce::... | FullPath( m_proj_filepath , settings.animeBaseDirectory );
}
SsString SsProject::getImageBasepath()
{
return getFullPath( m_proj_filepath , settings.imageBaseDirectory );
}
SsProject::~SsProject()
{
for ( SsAnimePackListItr itr = animeList.begin() ;
itr != animeList.end() ; itr ++ ) itr->reset();
animeList.clear... | random | [
{
"content": "namespace spritestudio6\n\n{\n\n\n\n\n",
"file_path": "Common/Animator/ssplayer_types.h",
"rank": 0,
"score": 87211.16099266979
},
{
"content": "namespace spritestudio6\n\n{\n\n\n\n\tconstexpr auto __PI__ = (3.14159265358979323846f);\n\n\t// #define RadianToDegree(Radian) ((dou... |
C++ | lib/getTunViaUSocket.cpp | xywzwd/VT-Wireless | ec42e742e2be26310df4b25cef9cea873896890b | #include <stdio.h>
#include <string.h>
#include <signal.h>
#include <stdlib.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/wait.h>
#include <errno.h>
#include <unistd.h>
#include "crts/debug.h"
#include "getTunViaUSocket.hpp"
static int checkHaveRead(int fd, long sec, long usec)... | #include <stdio.h>
#include <string.h>
#include <signal.h>
#include <stdlib.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/wait.h>
#include <errno.h>
#include <unistd.h>
#include "crts/debug.h"
#include "getTunViaUSocket.hpp"
static int checkHaveRead(int fd, long sec, long usec)... | et);
const char *s = subnet;
if(len > 18 || len < 10) goto fail;
if(subnet[len-3] != '/') goto fail;
errno = 0;
val = strtoul(&subnet[len-2], 0, 10);
if(errno || val > 31 || val < 24) goto fail;
for(int i=0; i<3; ++i)
{
val = strtoul(s, 0, 10);
if(errno || val >... | );
int fd = *((int*) data);
INFO("Got from UNIX Socket TUN fd=%d", fd);
close(socket);
if((fd = dup2(fd, socket)) != socket)
{
ERROR("dup2() failed");
close(fd);
socket = -1;
return -1;
}
socket = -1;
INFO("Got TUN duped to fd=%d", fd);
... | random | [
{
"content": "// This is an internal data structure and not a user interface; hence\n\n// it's not called CRTSParameter.\n\nstruct Parameter\n\n{\n\n // called in CRTSController to set the value.\n\n std::function<bool (double)> set;\n\n\n\n // called in CRTSController to poll the value\n\n std::fun... |
C++ | iRODS/server/re/src/testMS.cpp | nesi/irods | 49eeaf76305fc483f21b1bbfbdd77d540b59cfd2 |
#include "reGlobalsExtern.hpp"
#include "reFuncDefs.hpp"
#include "icatHighLevelRoutines.hpp"
int
print_hello( ruleExecInfo_t *rei ) {
RE_TEST_MACRO( "Test for print_hello\n" );
fprintf( stdout, "Hello\n" );
_writeString( "stdout", "Hello\n", rei );
return 0;
}
int
recover_print_hello( ruleExecIn... |
#include "reGlobalsExtern.hpp"
#include "reFuncDefs.hpp"
#include "icatHighLevelRoutines.hpp"
int
print_hello( ruleExecInfo_t *rei ) {
RE_TEST_MACRO( "Test for print_hello\n" );
fprintf( stdout, "Hello\n" );
_writeString( "stdout", "Hello\n", rei );
return 0;
}
int
recover_print_hello( ruleExecIn... |
int
print_uoi( userInfo_t *uoi ) {
if ( reTestFlag == COMMAND_TEST_1 ) {
fprintf( stdout, " userName = %s\n", uoi->userName );
fprintf( stdout, " rodsZone= %s\n", uoi->rodsZone );
fprintf( stdout, " userType= %s\n", uoi->userType );
}
else if ( reTestFlag == HTML_TEST_1... | tdout, " objPath = %s\n", doi->objPath );
fprintf( stdout, " rescName= %s\n", doi->rescName );
fprintf( stdout, " dataType= %s\n", doi->dataType );
fprintf( stdout, " dataSize= %lld\n", doi->dataSize );
}
else if ( reTestFlag == HTML_TEST_1 ) {
fprintf( stdout, " ... | function_block-function_prefixed | [
{
"content": " def test(self):\n\n self.rods_session.assert_icommand(\"icd\")\n\n self.rods_session.assert_icommand(\"irule -vF \" + rules30dir + rulefile,\n",
"file_path": "tests/pydevtest/test_allrules.py",
"rank": 0,
"score": 117236.89308473901... |
C++ | src/ukf.cpp | lb5160482/Sensor-Fusion-Unscented-Kalman-Filter | 4636755b6a5dcc25f181684796d3ade82cb943f9 | #include "ukf.h"
#include "Eigen/Dense"
#include <iostream>
using namespace std;
using Eigen::MatrixXd;
using Eigen::VectorXd;
using std::vector;
UKF::UKF() {
is_initialized_ = false;
use_laser_ = true;
use_radar_ = true;
x_ = VectorXd(5);
x_pred = VectorXd(5);
P_ = Mat... | #include "ukf.h"
#include "Eigen/Dense"
#include <iostream>
using namespace std;
using Eigen::MatrixXd;
using Eigen::VectorXd;
using std::vector;
UKF::UKF() {
is_initialized_ = false;
use_laser_ = true;
use_radar_ = true;
x_ = VectorXd(5);
x_pred = VectorXd(5);
P_ = Mat... |
}
void UKF::Prediction(double dt) {
MatrixXd sigAug = GenerateSigmaAug();
SigPrediction(sigAug, dt);
MeanAndCovPrediction();
}
void UKF::UpdateLidar(MeasurementPackage meas_package) {
MatrixXd ZSig = MatrixXd(n_z_lidar_, 2 * n_aug_ + 1);
VectorXd zPred = VectorXd(n_z_lid... | if (meas_package.sensor_type_ == MeasurementPackage::RADAR) {
UpdateRadar(meas_package);
}
else {
UpdateLidar(meas_package);
} | if_condition | [
{
"content": "struct has_std_result_type {int a[2];};\n",
"file_path": "src/Eigen/src/Core/util/Meta.h",
"rank": 0,
"score": 167285.48100387253
},
{
"content": "struct has_none {int a[1];};\n",
"file_path": "src/Eigen/src/Core/util/Meta.h",
"rank": 1,
"score": 117858.8414467264
... |
C++ | wled00/7segmdisp.cpp | imeszaros/ledclock | e739b11608e52a1e2a3dc88c54dcc40dbc1e5793 | #include "7segmdisp.h"
static CRGB dummy;
void LedBasedDisplay::setRowColor(uint8_t row, bool state, CRGB color) {
for (uint8_t c = 0, n = columnCount(); c < n; ++c) {
setLedColor(row, c, state, color);
}
}
void LedBasedDisplay::setColumnColor(uint8_t column, bool state, CRGB color) {
for (uint8_... | #include "7segmdisp.h"
static CRGB dummy;
void LedBasedDisplay::setRowColor(uint8_t row, bool state, CRGB color) {
for (uint8_t c = 0, n = columnCount(); c < n; ++c) {
setLedColor(row, c, state, color);
}
}
void LedBasedDisplay::setColumnColor(uint8_t column, bool state, CRGB color) {
for (uint8_... |
SevenSegmentDisplay::~SevenSegmentDisplay() {
delete _indices;
delete _offColors;
delete _onColors;
}
uint8_t SevenSegmentDisplay::rowCount() {
return _ledsPerSegment * 2 + 3;
}
uint8_t SevenSegmentDisplay::columnCount() {
return _ledsPerSegment + 2;
}
uint8_t SevenSegmentDisplay::internalIndex... | SevenSegmentDisplay::SevenSegmentDisplay(LedBasedDisplayOutput output, uint8_t ledsPerSegment):
_output(output),
_ledsPerSegment(ledsPerSegment),
_value(_7SEG_SYM_EMPTY),
_mode(LedBasedDisplayMode::SET_ALL_LEDS) {
_offColors = (CRGB*) malloc(7 * _ledsPerSegment * sizeof(CRGB));
_onColors = (CRG... | function_block-full_function | [
{
"content": "const _C = d.querySelector('.container'), N = 4;\n",
"file_path": "wled00/data/index.js",
"rank": 0,
"score": 80796.51181418088
},
{
"content": "struct Reader<VariantRef, void> : Reader<char*, void> {\n\n explicit Reader(VariantRef x) : Reader<char*, void>(x.as<const char*>())... |
C++ | lib/src/TypeRegistration.cpp | PrincetonUniversity/mcpib | 72a6b7a04288b9707f20699dbbdcdb964a8ca379 |
#include "mcpib/TypeRegistration.hpp"
#include "mcpib/TypeRegistry.hpp"
#include "mcpib/WrapperError.hpp"
namespace mcpib {
void TypeRegistration::registerFromPython(std::unique_ptr<FromPythonFactory> factory) {
for (auto const & existing : _from_python) {
if (factory->name == existing->name) {
... |
#include "mcpib/TypeRegistration.hpp"
#include "mcpib/TypeRegistry.hpp"
#include "mcpib/WrapperError.hpp"
namespace mcpib {
void TypeRegistration::registerFromPython(std::unique_ptr<FromPythonFactory> factory) {
for (auto const & existing : _from_python) {
if (factory->name == existing->name) {
... |
}
| _ref_to_python;
}
ToPythonConverter const & TypeRegistration::getConstRefToPython() const {
if (!_const_ref_to_python) {
throw raiseToPythonError("No const reference to-Python converter found");
}
return *_const_ref_to_python;
}
ToPythonConverter const & TypeRegistration::getPointerToPyth... | random | [
{
"content": "class ReturnConverter<void> {\n\npublic:\n\n\n\n explicit ReturnConverter(TypeRegistry &) {}\n\n\n\n template <typename ArgumentBuilder, typename ...Args>\n\n PyPtr apply(ArgumentBuilder builder, std::function<void(Args...)> const & function) const {\n\n callFunction(builder, funct... |
C++ | ecmascript/napi/test/jsi_test.cpp | openharmony-gitee-mirror/ark_js_runtime | b5ac878349b00b337c45f4702332c23aa82e1e28 |
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <memory>
#include "ark_js_runtime.h"
#include "js_value.h"
using OHOS::Ace::Framework::ArkJSRuntime;
using OHOS::Ace::Framework::JsRuntime;
using OHOS::Ace::Framework::JsValue;
using OHOS::Ace::Framework::RegisterFunctionType;
usin... |
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <memory>
#include "ark_js_runtime.h"
#include "js_value.h"
using OHOS::Ace::Framework::ArkJSRuntime;
using OHOS::Ace::Framework::JsRuntime;
using OHOS::Ace::Framework::JsValue;
using OHOS::Ace::Framework::RegisterFunctionType;
usin... | int main()
{
TestRuntime runtime;
RegisterFunctionType func = AppDebugLogPrint;
shared_ptr<JsValue> global = runtime->GetGlobal();
shared_ptr<JsValue> logFunc = runtime->NewFunction(func);
shared_ptr<JsValue> consoleObj = runtime->NewObject();
global->SetProperty(*runtime, "console", consoleObj)... | function_block-full_function | [
{
"content": "class JSTaggedValue : public coretypes::TaggedValue {\n\npublic:\n\n static JSTaggedValue Cast(ObjectHeader *object)\n\n {\n\n return JSTaggedValue(object);\n\n }\n\n\n\n JSTaggedValue(void *) = delete;\n\n\n\n constexpr JSTaggedValue() = default;\n\n constexpr explicit JS... | |
C++ | sourceCode/dotNet4.6/ndp/fx/src/data/native/sni/include/sni_servicebindings.hpp | csoap/csoap.github.io | 2a8db44eb63425deff147652b65c5912f065334e |
#ifndef _SNI_SERVICE_BINDINGS_07_15_2009_
#define _SNI_SERVICE_BINDINGS_07_15_2009_
#include "sni_spn.hpp"
class SNI_ServiceBindings
{
public:
static DWORD SetHostNamesAndAcceptedSPNs(__in_ecount_opt(dwcAllowedSPNs) WCHAR **pwszAcceptedSPNs, DWORD... |
#ifndef _SNI_SERVICE_BINDINGS_07_15_2009_
#define _SNI_SERVICE_BINDINGS_07_15_2009_
#include "sni_spn.hpp"
class SNI_ServiceBindings
{
public:
static DWORD SetHostNamesAndAcceptedSPNs(__in_ecount_opt(dwcAllowedSPNs) WCHAR **pwszAcceptedSPNs, DWORD... | stNames);
static DWORD AllocAndSetHostname(COMPUTER_NAME_FORMAT NameType);
static DWORD RepackSzIntoWsz(__in_z LPCSTR szMbcsString);
static void ReleaseIPs();
static void ReleaseNames();
inline static void BidTraceAddedIPv4Address(__in struct in_addr *psin_addr);
inline static void BidTraceAddedIPv6Address(__in ... | zClientSuppliedSPN, __out SNIAuthErrStates *pSSPIFailureState);
static void Release();
#ifndef SNIX
private:
static volatile LONG s_lClusterAddressesInitialized;
static bool s_fClusterHostNamesInitialized;
static bool s_fWSAStarted;
static struct in_addr *s_piaIPv4Address;
st... | random | [] |
C++ | src/red4ext/FlightSettings.cpp | jackhumbert/flight_control | 02938f5a26b3a299ef3d9b9e4d40e9294872a7ee | #include "FlightSettings.hpp"
#include "FlightModule.hpp"
#include "Utils.hpp"
#include "stdafx.hpp"
namespace FlightSettings {
RED4ext::TTypedClass<FlightSettings> cls("FlightSettings");
RED4ext::CClass *FlightSettings::GetNativeType() { return &cls; }
RED4ext::HashMap<RED4ext::CName, float> floats;
void GetFloa... | #include "FlightSettings.hpp"
#include "FlightModule.hpp"
#include "Utils.hpp"
#include "stdafx.hpp"
namespace FlightSettings {
RED4ext::TTypedClass<FlightSettings> cls("FlightSettings");
RED4ext::CClass *FlightSettings::GetNativeType() { return &cls; }
RED4ext::HashMap<RED4ext::CName, float> floats;
void GetFloa... | auto setFloat = RED4ext::CClassStaticFunction::Create(&cls, "SetFloat", "SetFloat", &SetFloat,
{.isNative = true, .isStatic = true});
cls.RegisterFunction(setFloat);
}
};
REGISTER_FLIGHT_MODULE(FlightSettingsModule);
} | actorDrone", 5.0);
return true;
}
struct FlightSettingsModule : FlightModule {
void Load(const RED4ext::Sdk *aSdk, RED4ext::PluginHandle aHandle) {
RED4ext::GameState runningState;
runningState.OnEnter = nullptr;
runningState.OnUpdate = &Setup;
runningState.OnExit = nullptr;
aSdk->gameStates-... | random | [
{
"content": " FMOD_DSP_ALLOC_FUNC alloc;\n",
"file_path": "deps/fmod/include/fmod_dsp.h",
"rank": 0,
"score": 130866.68190463846
},
{
"content": " FMOD_CODEC_ALLOC_FUNC alloc;\n",
"file_path": "deps/fmod/include/fmod_codec.h",
"rank": 1,
"score": 130... |
C++ | diffkemp/simpll/Utils.cpp | tmalecova/diffkemp | 226166cec9044ff23753e7d74b49d2272677c0d6 |
#include "Utils.h"
#include "Config.h"
#include <llvm/IR/Instructions.h>
#include <llvm/IR/Module.h>
#include <llvm/IR/Operator.h>
#include <llvm/Support/LineIterator.h>
#include <llvm/Support/MemoryBuffer.h>
#include <llvm/Support/Path.h>
#include <llvm/Support/raw_ostream.h>
#include <set>
#include <iostream>
#incl... |
#include "Utils.h"
#include "Config.h"
#include <llvm/IR/Instructions.h>
#include <llvm/IR/Module.h>
#include <llvm/IR/Operator.h>
#include <llvm/Support/LineIterator.h>
#include <llvm/Support/MemoryBuffer.h>
#include <llvm/Support/Path.h>
#include <llvm/Support/raw_ostream.h>
#include <set>
#include <iostream>
#incl... |
return Type;
}
void simplifyFunction(Function *Fun) {
PassBuilder pb;
FunctionPassManager fpm(false);
FunctionAnalysisManager fam(false);
pb.registerFunctionAnalyses(fam);
fpm.addPass(SimplifyCFGPass {});
fpm.addPass(DCEPass {});
fpm.addPass(NewGVNPass {});
fpm.run(*Fun, fam);
}
A... | if (auto PtrTy = dyn_cast<PointerType>(Value->getType())) {
if (auto *StructTy = dyn_cast<StructType>(PtrTy->getElementType())) {
Type = StructTy;
} else if (auto *BitCast = dyn_cast<BitCastInst>(Value)) {
if (auto *SrcPtrTy = dyn_cast<PointerTy... | if_condition | [
{
"content": "class CalledFunctionsAnalysis\n\n : public AnalysisInfoMixin<CalledFunctionsAnalysis> {\n\n public:\n\n using Result = std::set<const Function *>;\n\n Result run(Module &Mod,\n\n AnalysisManager<Module, Function *> &mam,\n\n Function *Main);\n\n\n\n prote... |
C++ | src/EDepSimModuleBuilder.hh | andrewmogan/edep-sim | 4e9923ccba8b2f65f47b72cbb41ed683f19f1123 | #ifndef EDepSim_ModuleBuilder_hh_seen
#define EDepSim_ModuleBuilder_hh_seen
#include <sstream>
#include <G4ThreeVector.hh>
class G4LogicalVolume;
#include "EDepSimBuilder.hh"
#include "EDepSimComponentBuilder.hh"
namespace EDepSim {class ModuleBuilder;}
class EDepSim::ModuleBuilder : public EDepSim::Builder {
pub... | #ifndef EDepSim_ModuleBuilder_hh_seen
#define EDepSim_ModuleBuilder_hh_seen
#include <sstream>
#include <G4ThreeVector.hh>
class G4LogicalVolume;
#include "EDepSimBuilder.hh"
#include "EDepSimComponentBuilder.hh"
namespace EDepSim {class ModuleBuilder;}
class EDepSim::ModuleBuilder : public EDepSim::Builder {
pub... | ;
virtual ~ModuleBuilderMessenger() {
delete fClearCMD;
delete fAddCMD;
delete fRepeatCMD;
delete fWidthCMD;
delete fHeightCMD;
};
void SetNewValue(G4UIcommand *cmd, G4String val) {
if (cmd==fClearCMD) {
fBuilder->ClearComponentList();
}
... | ModuleBuilderMessenger(EDepSim::ModuleBuilder* c,
const char* guide=NULL)
: EDepSim::BuilderMessenger(c,guide),
fBuilder(c) {
fClearCMD = new G4UIcmdWithoutParameter(CommandName("clear"),this);
fClearCMD->SetGuidance("Clear the component list for th... | function_block-full_function | [
{
"content": "class EDepSim::DokeBirks : public G4VRestDiscreteProcess //class definition\n\n{\n\npublic:\n\n\n\n DokeBirks(const G4String& processName = \"Doke-Birks\",\n\n G4ProcessType type = fElectromagnetic);\n\n ~DokeBirks();\n\n\n\n /// Determine which particles this process sho... |
C++ | Classes/Bmob/baseobject/bmobobject.cpp | isuhao/RaidenFree | 1811a79d6704fb58e2abc58fb3feaad79af33841 |
#include "bmobobject.h"
#include "network/HttpClient.h"
#include "network/HttpResponse.h"
#include "../util/bmobstrutil.h"
using namespace network;
BmobObject::BmobObject(){
this->m_pSaveDelegate = NULL;
this->m_pUpdateDelegate = NULL;
this->m_pSaveDelegate = NULL;
}
BmobObject::BmobObject(string tableN... |
#include "bmobobject.h"
#include "network/HttpClient.h"
#include "network/HttpResponse.h"
#include "../util/bmobstrutil.h"
using namespace network;
BmobObject::BmobObject(){
this->m_pSaveDelegate = NULL;
this->m_pUpdateDelegate = NULL;
this->m_pSaveDelegate = NULL;
}
BmobObject::BmobObject(string tableN... | y,"objects");
this->enParamsToHttp(name,dict);
}
void BmobObject::del(BmobDeleteDelegate* delegate){
_opType = HTTP_OP_Type::_bHTTP_DELETE;
this->m_pDeleteDelegate = delegate;
this->m_url = BmobSDKInit::URL + m_tableName + "/" + m_objectId;
this->send(HttpRequest::Type::DELETE);
}
void BmobObjec... |
if (array == NULL)
{
return ;
}
__Dictionary* dict = __Dictionary::create();
string op = "Remove";
dict->setObject(__String::createWithFormat("%s",op.c_str()),"__op");
dict->setObject(arra | function_block-random_span | [
{
"content": "class DefaultValueArrayAllocator : public ValueArrayAllocator\n\n{\n\npublic: // overridden from ValueArrayAllocator\n\n virtual ~DefaultValueArrayAllocator()\n\n {\n\n }\n\n\n\n virtual ValueInternalArray *newArray()\n\n {\n\n return new ValueInternalArray();\n\n }\n\n\n\n virt... |
C++ | Raspberry Pi/build-GUI_app-Desktop-Debug/moc_writewindow.cpp | AnasKhedr/Smart-Home-2017 | b847baa26fbd12b831e2f4325f74d0aa1a766dad |
#include "../gui/writewindow.h"
#include <QtCore/qbytearray.h>
#include <QtCore/qmetatype.h>
#if !defined(Q_MOC_OUTPUT_REVISION)
#error "The header file 'writewindow.h' doesn't include <QObject>."
#elif Q_MOC_OUTPUT_REVISION != 67
#error "This file was generated using the moc from 5.3.2. It"
#error "cannot be used wi... |
#include "../gui/writewindow.h"
#include <QtCore/qbytearray.h>
#include <QtCore/qmetatype.h>
#if !defined(Q_MOC_OUTPUT_REVISION)
#error "The header file 'writewindow.h' doesn't include <QObject>."
#elif Q_MOC_OUTPUT_REVISION != 67
#error "This file was generated using the moc from 5.3.2. It"
#error "cannot be used wi... | 2),
QT_MOC_LITERAL(9, 181, 31)
},
"WriteWindow\0on_dial_temp_valueChanged\0"
"\0value\0on_spinBox_temp_valueChanged\0"
"arg1\0on_horizontalSlider_light_valueChanged\0"
"on_spinBox_light_valueChanged\0"
"on_pushButton_send_light_clicked\0"
"on_pushButton_send_temp_clicked"
};
#undef QT_MOC_LI... | ARRAY_DATA_HEADER_INITIALIZER_WITH_OFFSET(len, \
qptrdiff(offsetof(qt_meta_stringdata_WriteWindow_t, stringdata) + ofs \
- idx * sizeof(QByteArrayData)) \
)
static const qt_meta_stringdata_WriteWindow_t qt_meta_stringdata_WriteWindow = {
{
QT_MOC_LITERAL(0, 0, 11),
QT_MOC_LITERAL(1, 12, 25),
QT_MOC_... | random | [
{
"content": "struct qt_meta_stringdata_ReadWindow_t {\n\n QByteArrayData data[5];\n\n char stringdata[80];\n\n};\n\n#define QT_MOC_LITERAL(idx, ofs, len) \\\n\n Q_STATIC_BYTE_ARRAY_DATA_HEADER_INITIALIZER_WITH_OFFSET(len, \\\n\n qptrdiff(offsetof(qt_meta_stringdata_ReadWindow_t, stringdata) + ofs \... |
C++ | src/canoe/phrasetable_filter_joint.cc | nrc-cnrc/Portage-SMT-TAS | 73f5a65de4adfa13008ea9a01758385c97526059 |
#include "phrasetable_filter_joint.h"
#include "soft_filter_tm_visitor.h"
#include "hard_filter_tm_visitor.h"
#include "logging.h"
using namespace Portage;
Logging::logger ptLogger_filter_joint(Logging::getLogger("debug.canoe.phraseTable_filter_joint"));
PhraseTableFilterJoint::PhraseTableFilterJoint(bool limitPhr... |
#include "phrasetable_filter_joint.h"
#include "soft_filter_tm_visitor.h"
#include "hard_filter_tm_visitor.h"
#include "logging.h"
using namespace Portage;
Logging::logger ptLogger_filter_joint(Logging::getLogger("debug.canoe.phraseTable_filter_joint"));
PhraseTableFilterJoint::PhraseTableFilterJoint(bool limitPhr... | ;
const Uint numBeforeFiltering(tgtTable->size());
visitor->set(L, tgtTable->begin()->second.backward.size());
(*visitor)(*tgtTable);
write(*online_filter_output, src, *tgtTable);
const Uint numKeptEntry(tgtTable->size());
tgtTable->clear();
return numBeforeFiltering - numKeptEntry;... | LOG_VERBOSE3(ptLogger_filter_joint,
"Online processing of one entry (%s) L=%d n=%d",
visitor->style.c_str(),
L,
tgtTable->begin()->second.backward.size()) | call_expression | [
{
"content": "struct null_deleter\n\n{\n\n void operator()(T const *) const {}\n\n};\n\n\n\n\n\nptr_FF FeatureFunctionSet::create(const string& name,\n\n const string& arg,\n\n const char* fileff_prefix,\n\n boo... |
C++ | cpp/test/main.cc | yjhatfdu/zstd-codec | f3f52dd801df1ece0d6cdbc9445dcb2a00973e37 | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iterator>
#include <iostream>
#include <string>
#include "zstd-codec.h"
#include "zstd-dict.h"
#include "zstd-stream.h"
#define CATCH_CONFIG_MAIN
#include "catch.hpp"
class FileResource : public Resource<FILE>
{
public:
Fil... | #include <algorithm>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iterator>
#include <iostream>
#include <string>
#include "zstd-codec.h"
#include "zstd-dict.h"
#include "zstd-stream.h"
#define CATCH_CONFIG_MAIN
#include "catch.hpp"
class FileResource : public Resource<FILE>
{
public:
Fil... |
TEST_CASE("Zstd-Dictionary-Interfaces", "[zstd][compress][decompress][dictionary]")
{
const auto dict_bytes = loadFixture("sample-dict");
const auto sample_books = loadFixture("sample-books.json");
const auto compression_level = 5;
ZstdCompressionDict cdict(dict_bytes, compression_level);
ZstdDec... | const auto path = fixturePath(name);
std::ifstream stream(path.c_str(), std::ios::in | std::ios::binary);
return Vec<u8>((std::istreambuf_iterator<char>(stream)), std::istreambuf_iterator<char>());
} | function_block-function_prefix_line | [
{
"content": " class NamePattern : public Pattern {\n\n public:\n\n NamePattern( std::string const& name );\n\n virtual ~NamePattern();\n\n virtual bool matches( TestCaseInfo const& testCase ) const override;\n\n private:\n\n WildcardPattern m_wil... |
C++ | WebKit2-7604.1.38.0.7/WebKit2-7604.1.38.0.7/UIProcess/API/glib/WebKitWebResource.cpp | mlcldh/appleWebKit2 | 39cc42a4710c9319c8da269621844493ab2ccdd6 |
#include "config.h"
#include "WebKitWebResource.h"
#include "APIData.h"
#include "WebFrameProxy.h"
#include "WebKitURIRequest.h"
#include "WebKitWebResourcePrivate.h"
#include <glib/gi18n-lib.h>
#include <wtf/glib/GRefPtr.h>
#include <wtf/glib/WTFGType.h>
#include <wtf/text/CString.h>
using namespace WebKit;
enum ... |
#include "config.h"
#include "WebKitWebResource.h"
#include "APIData.h"
#include "WebFrameProxy.h"
#include "WebKitURIRequest.h"
#include "WebKitWebResourcePrivate.h"
#include <glib/gi18n-lib.h>
#include <wtf/glib/GRefPtr.h>
#include <wtf/glib/WTFGType.h>
#include <wtf/text/CString.h>
using namespace WebKit;
enum ... | Errors(WebKitWebResource* resource, GTlsCertificateFlags tlsErrors, GTlsCertificate* certificate)
{
g_signal_emit(resource, signals[FAILED_WITH_TLS_ERRORS], 0, certificate, tlsErrors);
g_signal_emit(resource, signals[FINISHED], 0, nullptr);
}
WebFrameProxy* webkitWebResourceGetFrame(WebKitWebResource* resource... | _("URI"),
_("The current active URI of the resource"),
0,
WEBKIT_PARAM_READABLE));
g_object_class_install_property... | random | [
{
"content": "struct external_constructor<value_t::object>\n\n{\n\n template<typename BasicJsonType>\n\n static void construct(BasicJsonType& j, const typename BasicJsonType::object_t& obj)\n\n {\n\n j.m_type = value_t::object;\n\n j.m_value = obj;\n\n j.assert_invariant();\n\n ... |
C++ | core/src/love/DrawDataFrame.hpp | castle-games/castle-client | 7fb34759b164d8de1d83b43bc00ff200a5086e2e |
#ifndef DrawDataFrame_hpp
#define DrawDataFrame_hpp
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <functional>
#include <memory>
#include "GhostTypes.hpp"
namespace love {
class DrawData;
struct DrawDataLayer;
class DrawDataFrame {
public:
bool isLinked;
PathDataList pathDataList;
Bounds fillImage... |
#ifndef DrawDataFrame_hpp
#define DrawDataFrame_hpp
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <functional>
#include <memory>
#include "GhostTypes.hpp"
namespace love {
class DrawData;
struct DrawDataLayer;
class DrawDataFrame {
public:
bool isLinked;
PathDataList pathDataList;
Bounds fillImage... |
const char *fileDataString = (const char *)fileData->getData();
size_t fileDataSize = fileData->getSize();
size_t dstlen = 0;
char *result = data::encode(data::ENCODE_BASE64, fileDataString, fileDataSize, dstlen, 0);
archive.str("fillPng", std::string(result));
delete result;
... | love::filesystem::FileData *fileData = fillImageData->encode(
love::image::FormatHandler::EncodedFormat::ENCODED_PNG, "Image.png", false); | assignment_statement | [] |
C++ | plugins/CleverbotPlugin/CleverbotPlugin/CleverbotPlugin.cpp | daemon/monkeybot | 50bf65674daefa12bfc002771243360bb1d07481 | #include "api/Api.h"
#include "plugin/Plugin.h"
#include "CleverbotHTTP.h"
#include <algorithm>
#include <future>
#include <thread>
#include <queue>
#include <iostream>
#include <string>
#include <random>
#include <atomic>
#include <chrono>
#include <curl/curl.h>
namespace {
const long Timeout = 12000;
const ChatMes... | #include "api/Api.h"
#include "plugin/Plugin.h"
#include "CleverbotHTTP.h"
#include <algorithm>
#include <future>
#include <thread>
#include <queue>
#include <iostream>
#include <string>
#include <random>
#include <atomic>
#include <chrono>
#include <curl/curl.h>
namespace {
const long Timeout = 12000;
const ChatMes... |
bool Contains(std::string str, const std::string& find) {
std::string find_lower = strtolower(find);
str = strtolower(str);
return str.find(find_lower) != std::string::npos;
}
std::string EraseName(std::string thought) {
std::string bot_name = strtolower(m_Bot->GetName())... | void StripEntities(std::string& str) {
using namespace std;
while (true) {
size_t begin = str.find("&");
size_t end = str.find(";");
if (begin == string::npos || end == string::npos || begin >= end) return;
str.erase(begin, end - begin + 1);
}
... | function_block-full_function | [
{
"content": "class int_generator {\n\n public:\n\n typedef typename concurrency::scoped_lock_type scoped_lock_type;\n\n typedef typename concurrency::mutex_type mutex_type;\n\n\n\n /// constructor\n\n //mac TODO: figure out if signed types present a range problem\n\n int_g... |
C++ | src/hdf5/DataTypeHDF5.cpp | balint42/nix | 50f1de33b946b7b194c82fb0efd9b0cecba9ed54 |
#include <nix/hdf5/DataTypeHDF5.hpp>
#include <stdexcept>
#include <iostream>
#include <cassert>
namespace nix {
namespace hdf5 {
namespace h5x {
DataType DataType::copy(hid_t source) {
DataType hi_copy = H5Tcopy(source);
hi_copy.check("Could not copy type");
return hi_copy;
}
DataType DataType::makeS... |
#include <nix/hdf5/DataTypeHDF5.hpp>
#include <stdexcept>
#include <iostream>
#include <cassert>
namespace nix {
namespace hdf5 {
namespace h5x {
DataType DataType::copy(hid_t source) {
DataType hi_copy = H5Tcopy(source);
hi_copy.check("Could not copy type");
return hi_copy;
}
DataType DataType::makeS... |
std::cerr << "FIXME: Not implemented " << vclass << " " << vsize << " " << vsign << " " << std::endl;
assert(NOT_IMPLEMENTED);
return DataType::Nothing;
}
}
}
| if (vclass == H5T_STRING) {
return DataType::String;
} else if (vclass == H5T_BITFIELD) {
switch (vsize) {
case 1: return DataType::Bool;
}
} | if_condition | [
{
"content": "struct to_data_type<bool> {\n\n static const bool is_valid = true;\n\n static const DataType value = DataType::Bool;\n\n};\n\n\n\n/**\n\n * @brief Determine if a type is a valid data type.\n\n */\n\ntemplate<>\n",
"file_path": "include/nix/DataType.hpp",
"rank": 0,
"score": 18745... |
C++ | src/base/circlebuffer.cpp | aksenofo/sparrow | c0300700a023f374ebb8faa69bcefe261e99d9d5 |
#include "circlebuffer.h"
namespace sparrow
{
CircularBuffer::CircularBuffer(uint32_t size)
: m_size(size)
{
m_buffer.reset(new uint8_t[m_size]);
m_head = m_tail = m_buffer.get();
m_state = m_size == 0 ? Full : Empty;
}
uint32_t CircularBuffer::WriteEnd(const void* ptr, uint32_t size) noexcept
{
as... |
#include "circlebuffer.h"
namespace sparrow
{
CircularBuffer::CircularBuffer(uint32_t size)
: m_size(size)
{
m_buffer.reset(new uint8_t[m_size]);
m_head = m_tail = m_buffer.get();
m_state = m_size == 0 ? Full : Empty;
}
uint32_t CircularBuffer::WriteEnd(const void* ptr, uint32_t size) noexcept
{
as... | }
uint32_t s2 = m_buffer.get() - m_head;
if (s1 < lateSize)
return consumed;
else {
uint8_t* start = m_buffer.get() + lateSize;
uint8_t* stop = std::min(start + size, m_head);
memcpy(start, point, stop - start);
consumed += stop - sta... | start = m_tail + lateSize;
uint8_t* stop = std::min(m_buffer.get() + m_size, start + size);
memcpy(start, point, stop - start);
point += stop - start;
consumed += stop - start;
size -= stop - start;
lateSize = 0;
| random | [
{
"content": "class Consumer\n\n{\n\npublic:\n\n Consumer() = default;\n\n COPYBLE_DEFAULT(Consumer);\n\n MOVEBLE_DEFAULT(Consumer);\n\n\n\n template<typename Func>\n\n uint32_t operator()(CircularBuffer& circularBuffer, Func fn)\n\n {\n\n uint32_t totallyConsumed = 0;\n\n while ... |
C++ | caffe2/operators/load_save_op_util.cc | wenhaopeter/read_pytorch_code | 491f989cd918cf08874dd4f671fb7f0142a0bc4f | #include "caffe2/operators/load_save_op_util.h"
namespace caffe2 {
namespace load_save_op_util {
std::string buildBlobNameFromDbKey(
const std::string& dbKey,
const std::string& strip_prefix,
const std::string& add_prefix) {
std::string key = dbKey.substr(0, dbKey.find(kChunkIdSeparator));
if (!strip_... | #include "caffe2/operators/load_save_op_util.h"
namespace caffe2 {
namespace load_save_op_util {
std::string buildBlobNameFromDbKey(
const std::string& dbKey,
const std::string& strip_prefix,
const std::string& add_prefix) {
std::string key = dbKey.substr(0, dbKey.find(kChunkIdSeparator));
if (!strip_... | ;
CAFFE_ENFORCE(
proto.tensor().has_segment(),
"Partial tensor must have a segment: ",
key);
blob_states[key].current_size +=
proto.tensor().segment().end() - proto.tensor().segment().begin();
CAFFE_ENFORCE(
blob_states[key].current_size <= blob_states[key].total_size... | CAFFE_ENFORCE(
blob_states[key].current_size < blob_states[key].total_size,
"Found an extra part for an already filled tensor: ",
key) | call_expression | [
{
"content": "class Int8GivenIntTensorFillOp final : public Operator<CPUContext> {\n\n public:\n\n template <class... Args>\n\n explicit Int8GivenIntTensorFillOp(Args&&... args)\n\n : Operator<CPUContext>(std::forward<Args>(args)...),\n\n scale_(this->template GetSingleArgument<float>(\"Y_scale\",... |
C++ | test/syscalls/linux/close_range.cc | neilalexander/gvisor | 14807179c24110d46441efbf30cf375a22d04e57 |
#include <asm-generic/errno-base.h>
#include <unistd.h>
#include <vector>
#include "gtest/gtest.h"
#include "absl/base/macros.h"
#include "test/util/file_descriptor.h"
#include "test/util/posix_error.h"
#include "test/util/temp_path.h"
#include "test/util/test_util.h"
namespace gvisor {
namespace testing {
namesp... |
#include <asm-generic/errno-base.h>
#include <unistd.h>
#include <vector>
#include "gtest/gtest.h"
#include "absl/base/macros.h"
#include "test/util/file_descriptor.h"
#include "test/util/posix_error.h"
#include "test/util/temp_path.h"
#include "test/util/test_util.h"
namespace gvisor {
namespace testing {
namesp... |
TEST_F(CloseRangeTest, RangeFirstGreaterThanLast) {
SKIP_IF(!IsRunningOnGvisor() && close_range(1, 0, 0) < 0 && errno == ENOSYS);
int num_files_in_range = 10;
unsigned int flags = 0;
CreateFiles(num_files_in_range);
OpenFilesRdwr();
EXPECT_THAT(close_range(fds_[num_files_in_range - 1], fds_[0], flags),
... | TEST_F(CloseRangeTest, CloexecAndUnshareFlagTest) {
SKIP_IF(!IsRunningOnGvisor() && close_range(1, 0, 0) < 0 && errno == ENOSYS);
int num_files_in_range = 10;
unsigned int flags = CLOSE_RANGE_CLOEXEC | CLOSE_RANGE_UNSHARE;
CreateFiles(num_files_in_range);
OpenFilesRdwr();
for (int fd : fds_) {
auto re... | function_block-full_function | [
{
"content": "class SpecificErrnoMatcher : public ::testing::MatcherInterface<int> {\n\n public:\n\n explicit SpecificErrnoMatcher(int const expected) : expected_(expected) {}\n\n\n\n bool MatchAndExplain(\n\n int const actual_errno,\n\n ::testing::MatchResultListener* const listener) const override... |
C++ | src/modules/Bots/playerbot/RandomPlayerbotFactory.cpp | YggDrazil/-MaNGOsZero0.20 | 6bc64bf5c42cbd1e491c28a4d7a2bf91051323fb | #include "Config/Config.h"
#include "../botpch.h"
#include "playerbot.h"
#include "PlayerbotAIConfig.h"
#include "PlayerbotFactory.h"
#include "AccountMgr.h"
#include "ObjectMgr.h"
#include "DatabaseEnv.h"
#include "PlayerbotAI.h"
#include "Player.h"
#include "RandomPlayerbotFactory.h"
#include "SystemConfig.h"
map<ui... | #include "Config/Config.h"
#include "../botpch.h"
#include "playerbot.h"
#include "PlayerbotAIConfig.h"
#include "PlayerbotFactory.h"
#include "AccountMgr.h"
#include "ObjectMgr.h"
#include "DatabaseEnv.h"
#include "PlayerbotAI.h"
#include "Player.h"
#include "RandomPlayerbotFactory.h"
#include "SystemConfig.h"
map<ui... |
player->setCinematic(2);
player->SetAtLoginFlag(AT_LOGIN_NONE);
player->SaveToDB();
sLog.outDetail("Random bot created for account %d - name: \"%s\"; race: %u; class: %u; gender: %u; skin: %u; face: %u; hairStyle: %u; hairColor: %u; facialHair: %u; outfitId: %u",
accountId, name.c_str(), ... | if (!player->Create(sObjectMgr.GeneratePlayerLowGuid(), name, race, cls, gender, skin, face, hairStyle, hairColor, facialHair, outfitId))
{
player->DeleteFromDB(player->GetObjectGuid(), accountId, true, true);
delete session;
delete player;
sLog.outError("Unable to create random bot ... | if_condition | [
{
"content": "class Player;\n",
"file_path": "src/modules/Bots/playerbot/RandomPlayerbotMgr.h",
"rank": 0,
"score": 310367.1292837344
},
{
"content": "class Player;\n",
"file_path": "src/modules/Bots/playerbot/RandomPlayerbotFactory.h",
"rank": 1,
"score": 310367.1292837344
},
... |
C++ | examples/FloodPedestrian_2019/Flood_XML_inpGen/XML_inpGen/xmlGen.cpp | SahebSh/FLAMEGPU | c81323b68532a52756b96dbf55fd29416e642cc9 | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
double bed_data(double x_int, double y_int);
#define SIZE 128
#define xmin 0
#define xmax 15
#define ymin 0
#define ymax 15
#define OFF 0
#define ON 1
int main()
{
FILE *fp = fopen("flood_init.xml", "w");
if (fp == NULL)
{
prin... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
double bed_data(double x_int, double y_int);
#define SIZE 128
#define xmin 0
#define xmax 15
#define ymin 0
#define ymax 15
#define OFF 0
#define ON 1
int main()
{
FILE *fp = fopen("flood_init.xml", "w");
if (fp == NULL)
{
prin... | 1;
double x1 = (xmax - flume_length) / 2 ;
double x2 = (xmax + flume_length) / 2 ;
if ((x_int <= x1) || (x_int >= x2))
zz = 10;
else
zz = 0;
return zz;
} | function_block-function_prefixed | [
{
"content": "class Double {\n\npublic:\n\n Double() {}\n\n Double(double d) : d_(d) {}\n\n Double(uint64_t u) : u_(u) {}\n\n\n\n double Value() const { return d_; }\n\n uint64_t Uint64Value() const { return u_; }\n\n\n\n double NextPositiveDouble() const {\n\n RAPIDJSON_ASSERT(!Sign())... | |
C++ | LuaKitProject/src/Projects/jni/com_common_luakit_LuaHelper.cpp | williamwen1986/Luakit | 2e113a3b429a8205cf8ac0dbc074480906b34384 | #include <com_common_luakit_LuaHelper.h>
#include "base/logging.h"
#include "base/command_line.h"
#include "base/memory/scoped_ptr.h"
#include "common/business_main_delegate.h"
#include "common/business_runtime.h"
#include "base/android/base_jni_registrar.h"
#include "base/android/jni_android.h"
#include "JniEn... | #include <com_common_luakit_LuaHelper.h>
#include "base/logging.h"
#include "base/command_line.h"
#include "base/memory/scoped_ptr.h"
#include "common/business_main_delegate.h"
#include "common/business_runtime.h"
#include "base/android/base_jni_registrar.h"
#include "base/android/jni_android.h"
#include "JniEn... |
#ifdef __cplusplus
}
#endif | NI_Onload start";
base::android::InitVM(jvm);
if (!base::android::RegisterJni(env)) {
LOG(ERROR)<<"base::android::RegisterJni(env) error";
return -1;
}
CommandLine::Init(0, nullptr);
LOG(INFO) << "JNI_Onload end";
return JNI_VERSION_1_6;
} | function_block-function_prefixed | [
{
"content": "struct BindState<Runnable, RunType, void(P1, P2, P3, P4, P5,\n\n P6)> : public BindStateBase {\n\n typedef Runnable RunnableType;\n\n typedef IsWeakMethod<HasIsMethodTag<Runnable>::value, P1> IsWeakCall;\n\n typedef Invoker<6, BindState, RunType> InvokerType;\n\n typedef typename InvokerTyp... |
C++ | xls/noc/config_ng/flattened_multi_dimensional_array_test.cc | felixzhuologist/xls | b6a4ec7190049002be1c0829d52b1d7767c88204 |
#include "xls/noc/config_ng/flattened_multi_dimensional_array.h"
#include "gtest/gtest.h"
namespace xls::noc {
namespace {
TEST(FlattenedMultiDimensionalArrayTest, GetElementCount) {
FlattenedMultiDimensionalArray<int64_t> array({3, 4});
EXPECT_EQ(array.GetElementCount(), 12);
FlattenedMultiDimensional... |
#include "xls/noc/config_ng/flattened_multi_dimensional_array.h"
#include "gtest/gtest.h"
namespace xls::noc {
namespace {
TEST(FlattenedMultiDimensionalArrayTest, GetElementCount) {
FlattenedMultiDimensionalArray<int64_t> array({3, 4});
EXPECT_EQ(array.GetElementCount(), 12);
FlattenedMultiDimensional... | PECT_EQ(zero_array.GetValue(0), 42);
}
}
}
| or =
zero_array.GetDimensionalSpaceIterator({});
array_t::DimensionalSpaceIterator zero_iterator_copy(zero_iterator);
array_t::DimensionalSpaceIterator zero_iterator_postfix = zero_iterator++;
EXPECT_EQ(zero_iterator_copy, zero_iterator_postfix);
EXPECT_NE(zero_iterator, zero_iterator_postfix);
}
TEST(Fl... | random | [
{
"content": "fn array_and_array(p: bits[2][5][4][42], q: bits[32], v: bits[2][5][4]) -> bits[2][5][4][42] {\n\n ret array_update.1: bits[2][5][4][42] = array_update(p, v, indices=[q], id=1)\n\n}\n\n)\";\n\n ParseFunctionAndCheckDump(input);\n\n}\n\n\n\nTEST(IrParserTest, DifferentWidthMultiplies) {\n\n std:... |
C++ | src/god_field.cpp | connorzl/geometry-central | 99114ffaf3efb58c912f94402dd0426cbb17d3f1 | #include "geometrycentral/god_field.h"
GodField::GodField(HalfedgeMesh *m, Geometry<Euclidean>* g) : mesh(m), geom(g) {
edgeVector = HalfedgeData<std::complex<double>>(mesh);
r = HalfedgeData<std::complex<double>>(mesh);
field = FaceData<std::complex<double>>(mesh);
faceAreas = FaceData<double>(mesh);
... | #include "geometrycentral/god_field.h"
GodField::GodField(HalfedgeMesh *m, Geometry<Euclidean>* g) : mesh(m), geom(g) {
edgeVector = HalfedgeData<std::complex<double>>(mesh);
r = HalfedgeData<std::complex<double>>(mesh);
field = FaceData<std::complex<double>>(mesh);
faceAreas = FaceData<double>(mesh);
... |
void GodField::setup() {
for (FacePtr f : mesh->faces()) {
HalfedgePtr he = f.halfedge();
double l_jl = edgeLengths[he.edge()];
double l_ij = edgeLengths[he.prev().edge()];
double theta_ijl = heAngles[he.next()];
Vector2 j = Vector2{0,0};
Vector2... | void GodField::computeCrossField(EdgeData<double> &lengths, HalfedgeData<double> &angles) {
std::cout << "Computing Smoothest Cross Field" << std::endl;
edgeLengths = lengths;
heAngles = angles;
faceAreas = Operators::computeAreas(mesh, edgeLengths);
setup();
Eigen::SparseMatrix<std::... | function_block-full_function | [
{
"content": "class GodField {\n\n public:\n\n GodField() {};\n\n GodField(HalfedgeMesh *m, Geometry<Euclidean> *geom);\n\n\n\n void computeCrossField(EdgeData<double> &lengths, HalfedgeData<double> &angles);\n\n size_t computeSingularities(VertexData<int> &singularities);\n\n\n\n... |
C++ | Src/Graphics/Camera.cpp | QuaternionMark/COMP371-FinalProject | ac750a5bb4896f4800d8fbc08fac9ef9a002ed44 | #include <cmath>
#include <stdexcept>
#include "Camera.h"
#include "../Math/MathUtil.h"
Camera::Camera(int w, int h, float fov, float nearZ, float farZ, bool orthographic) {
position = Vector3f(0.f, 0.f, 0.f);
lookAt = Vector3f(0.f, 0.f, 1.f);
upDir = Vector3f(0.f, 1.f, 0.f);
viewMatrix = Matrix4x4f:... | #include <cmath>
#include <stdexcept>
#include "Camera.h"
#include "../Math/MathUtil.h"
Camera::Camera(int w, int h, float fov, float nearZ, float farZ, bool orthographic) {
position = Vector3f(0.f, 0.f, 0.f);
lookAt = Vector3f(0.f, 0.f, 1.f);
upDir = Vector3f(0.f, 1.f, 0.f);
viewMatrix = Matrix4x4f:... | ;
viewMatrix = Matrix4x4f::constructViewMat(thirdPersonPosition, position.subtract(thirdPersonPosition).normalize(), upDir);
}
for (int i = 0; i < (int)shaders.size(); i++) {
shaders[i]->getMat4Uniform("viewMatrix")->setValue(viewMatrix);
}
... | position.subtract(Vector3f(thirdPersonRadius * cosYAngle * cosXAngle,
thirdPersonRadius * sinYAngle,
-thirdPersonRadius * cosYAngle * sinXAngle)) | call_expression | [
{
"content": "struct NameCompare: std::binary_function <const char *, const char *, bool>\n\n{\n\n bool\n\n operator () (const char *x, const char *y) const\n\n {\n\n\treturn strcmp (x, y) < 0;\n\n }\n\n};\n\n\n\n\n\ntypedef Attribute* (*Constructor)();\n\ntypedef std::map <const char *, Constructor... |
C++ | StageProc2F64Neon.hpp | unevens/hiir | 4589fedb4d08b899514cb605ccd7418bf262ab18 |
#if ! defined (hiir_StageProc2F64Neon_CODEHEADER_INCLUDED)
#define hiir_StageProc2F64Neon_CODEHEADER_INCLUDED
#include "hiir/StageDataNeonV2F64.h"
namespace hiir
{
template <>
inline void StageProc2F64Neon <1>::process_sample_pos (const int nbr_coefs, float64x2_t &spl_0, float64x2_t &spl_1, StageDataNeonV2F64 *sta... |
#if ! defined (hiir_StageProc2F64Neon_CODEHEADER_INCLUDED)
#define hiir_StageProc2F64Neon_CODEHEADER_INCLUDED
#include "hiir/StageDataNeonV2F64.h"
namespace hiir
{
template <>
inline void StageProc2F64Neon <1>::process_sample_pos (const int nbr_coefs, float64x2_t &spl_0, float64x2_t &spl_1, St | aq_f64 (
vld1q_f64 (stage_arr [cnt - 2]._mem ),
spl_0 - vld1q_f64 (stage_arr [cnt ]._mem ),
vld1q_f64 (stage_arr [cnt ]._coef)
);
const float64x2_t tmp_1 = vmlaq_f64 (
vld1q_f64 (stage_arr [cnt - 1]._mem ),
spl_1 - vld1q_f64 (stage_arr [cnt + 1]._mem ),
vld1q_f64 (sta... | ageDataNeonV2F64 *stage_arr)
{
const int cnt = nbr_coefs + 2 - 1;
const float64x2_t tmp_0 = vmlaq_f64 (
vld1q_f64 (stage_arr [cnt - 2]._mem ),
spl_0 - vld1q_f64 (stage_arr [cnt ]._mem ),
vld1q_f64 (stage_arr [cnt ]._coef)
);
vst1q_f64 (stage_arr [cnt - 2]._mem, spl_0);
vst1q_f64 ... | random | [
{
"content": "class StageProc2F64Neon\n\n{\n\n\tstatic_assert (REMAINING >= 0, \"REMAINING must be >= 0.\");\n\n\n\n/*\\\\\\ PUBLIC \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\*/\n\n\n\npublic:\n\n\n\n\tstatic hiir_FORCEINLINE voi... |
C++ | dependencies/mountutils/src/linux/functions.cpp | runcitadel/imager | 5519eec99a8003b4acb71cbfea507f384d4fb910 |
#include "../mountutils.hpp"
#include <cerrno>
#include <mntent.h>
#include <sys/mount.h>
#include <sys/stat.h>
auto unmount_disk(const char *device_path) -> MOUNTUTILS_RESULT {
const char *mount_path = nullptr;
std::vector<std::string> mount_dirs = {};
struct stat stats;
if (stat(device_path, &stats) !... |
#include "../mountutils.hpp"
#include <cerrno>
#include <mntent.h>
#include <sys/mount.h>
#include <sys/stat.h>
auto unmount_disk(const char *device_path) -> MOUNTUTILS_RESULT {
const char *mount_path = nullptr;
std::vector<std::string> mount_dirs = {};
struct stat stats;
if (stat(device_path, &stats) !... | ts == nullptr) {
MountUtilsLog("Couldn't read /proc/mounts");
return MOUNTUTILS_ERROR_GENERAL;
}
while ((mnt_p = getmntent_r(proc_mounts, &data, mnt_buf, sizeof(mnt_buf))) != nullptr) {
mount_path = mnt_p->mnt_fsname;
if (strncmp(mount_path, device_... | iled");
return MOUNTUTILS_ERROR_GENERAL;
} else if (S_ISDIR(stats.st_mode)) {
MountUtilsLog("Device is a directory");
return MOUNTUTILS_ERROR_INVALID_DRIVE;
}
struct mntent *mnt_p;
struct mntent data;
char mnt_buf[4096 + 1024];
FILE *... | random | [
{
"content": "#define HAVE_STRUCT_STAT_ST_BLKSIZE 1\n",
"file_path": "dependencies/libarchive-3.4.2/libarchive/config_freebsd.h",
"rank": 0,
"score": 121046.8140738607
},
{
"content": "#define\tHAVE_STRUCT_STAT_ST_FLAGS 1\n",
"file_path": "dependencies/libarchive-3.4.2/tar/config_freebsd... |
C++ | src/imageio/NumpyImageLoader.cpp | gao-duan/tev | 4916200e2315f4fe3c22dfa1546faa085ea68a62 |
#include <tev/imageio/NumpyImageLoader.h>
#include <tev/ThreadPool.h>
#include <regex>
using namespace Eigen;
using namespace filesystem;
using namespace std;
TEV_NAMESPACE_BEGIN
bool NumpyImageLoader::canLoadFile(std::istream& iStream) const
{
std::string header;
std::getline(iStream, header);
bool r... |
#include <tev/imageio/NumpyImageLoader.h>
#include <tev/ThreadPool.h>
#include <regex>
using namespace Eigen;
using namespace filesystem;
using namespace std;
TEV_NAMESPACE_BEGIN
bool NumpyImageLoader::canLoadFile(std::istream& iStream) const
{
std::string header;
std::getline(iStream, header);
bool r... |
TEV_NAMESPACE_END
| if (!channelSelector.empty()) {
sort(begin(matches), end(matches));
}
for (const auto& match : matches) {
result.channels.emplace_back(move(channels[match.second]));
}
result.layers.emplace_back("");
return result;
} | function_block-function_prefix_line | [
{
"content": "class NumpyImageSaver : public TypedImageSaver<float> {\n\npublic:\n\n void save(std::ostream& oStream, const filesystem::path& path, const std::vector<float>& data, const Eigen::Vector2i& imageSize, int nChannels) const override;\n\n\n\n bool hasPremultipliedAlpha() const override {\n\n ... |
C++ | externals/mpir-3.0.0/tests/cxx/t-binary.cc | JaminChan/eos_win | c03e57151cfe152d0d3120abb13226f4df74f37e |
#include <iostream>
#include "mpir.h"
#include "mpirxx.h"
#include "gmp-impl.h"
#include "tests.h"
using namespace std;
void
check_mpz (void)
{
{
mpz_class a(1), b(2);
mpz_class c(a + b); ASSERT_ALWAYS(c == 3);
}
{
mpz_class a(3), b(4);
mpz_class c;
c = a * b; ASSERT_ALWAYS(c == 12)... |
#include <iostream>
#include "mpir.h"
#include "mpirxx.h"
#include "gmp-impl.h"
#include "tests.h"
using namespace std;
void
check_mpz (void)
{
{
mpz_class a(1), b(2);
mpz_class c(a + b); ASSERT_ALWAYS(c == 3);
}
{
mpz_class a(3), b(4);
mpz_class c;
c = a * b; ASSERT_ALWAYS(c == 12)... | 2), b(1, 4);
mpz_class c(1);
mpq_class d((a + b) - c); ASSERT_ALWAYS(d == -0.25);
}
{
mpq_class a(1, 3), b(3, 2);
mpz_class c(2), d(4);
mpq_class e;
e = (a * b) / (c - d); ASSERT_ALWAYS(e == -0.25);
}
{
mpq_class a(1, 3), b(3, 4);
mpz_class c(-3);
mpq_class d(c * (a * ... | YS(b == 0.5);
}
{
mpq_class a(2, 3);
signed int b = 4;
mpq_class c;
c = b / a; ASSERT_ALWAYS(c == 6);
}
{
mpq_class a(1, 2);
mpz_class b(1);
mpq_class c(a + b); ASSERT_ALWAYS(c == 1.5);
}
{
mpq_class a(2, 3);
mpz_class b(1);
double c = 2.0;
mpq_class... | random | [] |
C++ | Classes/Scene/BattleMode/BattleScene.cpp | jimmyy512/LegendStory | d2b271023d02eab4f1b540a297d56eae5716bf1f | #include "scene/BattleMode/BattleScene.h"
#include <sstream>
#include "cocos-ext.h"
#include "spine\spine-cocos2dx.h"
#include "spine\spine.h"
#include "Tools\AudioManagement.h"
#include "UI\BattleMode\BattleHUDlayer.h"
#include "Map\BattleMode\BattleMap.h"
#include "Monster\BattleMode\BattleSoldierFactory.h"
#include... | #include "scene/BattleMode/BattleScene.h"
#include <sstream>
#include "cocos-ext.h"
#include "spine\spine-cocos2dx.h"
#include "spine\spine.h"
#include "Tools\AudioManagement.h"
#include "UI\BattleMode\BattleHUDlayer.h"
#include "Map\BattleMode\BattleMap.h"
#include "Monster\BattleMode\BattleSoldierFactory.h"
#include... | irginSize.width * battleMap->getAnchorPoint().x+origin.x;
auto MaxMapPosY = battleMapOirginSize.height * battleMap->getAnchorPoint().y+origin.y;
auto MinMapPosX = -battleMapOirginSize.width + visible.width + battleMapOirginSize.width * battleMap->getAnchorPoint().x+origin.x;
auto MinMapPosY = -battleMapOirginS... | _BattleScene = this;
visible = Director::getInstance()->getVisibleSize();
origin = Director::getInstance()->getVisibleOrigin();
NotificationCenter::getInstance()->addObserver(this,
callfuncO_selector(BattleScene::pauseBattleMapListenerCallBack), "PauseBattleMapListenerCallBack", NULL);
NotificationCenter::getInst... | random | [
{
"content": "#include \"cocos2d.h\"\n\n#include \"DefinitionBattleMode.h\"\n\n#include \"cocostudio\\CocoStudio.h\"\n\n#include \"ui/CocosGUI.h\"\n\nclass LoginScene : public cocos2d::Layer\n\n{\n\npublic:\n\n static cocos2d::Scene* createScene();\n\n virtual bool init();\n\n CREATE_FUNC(LoginScene);\... |
C++ | 3rdParty/iresearch/utils/index-convert.cpp | sita1999/arangodb | 6a4f462fa209010cd064f99e63d85ce1d432c500 |
#if defined(_MSC_VER)
#pragma warning(disable: 4101)
#pragma warning(disable: 4267)
#endif
#include <cmdline.h>
#if defined(_MSC_VER)
#pragma warning(default: 4267)
#pragma warning(default: 4101)
#endif
#include "shared.hpp"
#include "index-convert.hpp"
#include "common.hpp"
#include "formats/formats.hp... |
#if defined(_MSC_VER)
#pragma warning(disable: 4101)
#pragma warning(disable: 4267)
#endif
#include <cmdline.h>
#if defined(_MSC_VER)
#pragma warning(default: 4267)
#pragma warning(default: 4101)
#endif
#include "shared.hpp"
#include "index-convert.hpp"
#include "common.hpp"
#include "formats/formats.hp... |
int convert(const cmdline::parser& args) {
if (!args.exist(IN_DIR)
|| !args.exist(OUT_DIR)
|| !args.exist(OUT_FORMAT)) {
return 1;
}
const auto& in_path = args.get<std::string>(IN_DIR);
if (in_path.empty()) {
return 1;
}
const auto& out_path = args.get<std::string>(OUT_DIR);
if (... | NS_END
int convert(
const std::string& in,
const std::string& out,
const std::string& dir_type,
const std::string& format) {
auto in_dir = create_directory(dir_type, in);
if (!in_dir) {
std::cerr << "Unable to create input directory directory of type '" << dir_type << "'" << std::endl;
ret... | function_block-full_function | [] |
C++ | asw/xy_to_angle.cpp | aswdevz/asw | ba483a71742fefbe6aa886e0e6acf56f22f375fe |
#include "stdafx.h"
#include "asw.h"
#include "xy_to_angle.h"
#ifdef USE_ORIGINAL_DEADZONE_FUNCTION
bool in_deadzone(short x, short y, int deadzone)
{
int x_percent = (int)(abs(x) / 327.67);
int y_percent = (int)(abs(y) / 327.67);
if ( sqrt(pow(x_percent, 2) + pow(y_percent, 2) ) <= deadzone)
{
return TR... |
#include "stdafx.h"
#include "asw.h"
#include "xy_to_angle.h"
#ifdef USE_ORIGINAL_DEADZONE_FUNCTION
bool in_deadzone(short x, short y, int deadzone)
{
int x_percent = (int)(abs(x) / 327.67);
int y_percent = (int)(abs(y) / 327.67);
if ( sqrt(pow(x_percent, 2) + pow(y_percent, 2) ) <= deadzone)
{
return TR... | uble)virtual_wheel_max_angle)) + 1));
return finalvalue;
}
int check_if_rotated_past_180(double current, double last, int* rotations)
{
if (((current >= -180.0) && (current < 0.0)) && (current < (last - 180.0)))
{
*rotations = *rotations + 1;
return 1;
}
if (((current <= 180.0)... | = 0)
return 90.0;
else
return -90.0;
}
if (x > 0)
{
if (y > 0)
{
return (atan((double)x / (double)y) * 180.0 / M_PI);
}
if (y < 0)
{
return ((atan(-(double)y / (double)x) * 180.0 / M_PI) + 90.0);
}
}
if (x < 0)
{
if (y > 0)
{
return ((-atan(-(double)x / (double)y)) * 180.0 / ... | random | [
{
"content": "\tint* thumbstick_deadzone;\n",
"file_path": "asw/asw.h",
"rank": 0,
"score": 26571.359982119866
},
{
"content": "bool in_deadzone(short x, short y, int deadzone);\n",
"file_path": "asw/xy_to_angle.h",
"rank": 1,
"score": 26571.359982119866
},
{
"content": "... |
C++ | thread_lib/main.cpp | fu4ck/linux_env_dev | 8076ca56a2ec907dec0c952e6ed27b6e644c5ae1 | #include <iostream>
#include <unistd.h>
#include <signal.h>
#include <sys/types.h>
#include <sys/epoll.h>
#include <fcntl.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <assert.h>
#include <sys/stat.h>
#include <string>
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#inc... | #include <iostream>
#include <unistd.h>
#include <signal.h>
#include <sys/types.h>
#include <sys/epoll.h>
#include <fcntl.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <assert.h>
#include <sys/stat.h>
#include <string>
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#inc... | else if(events[i].events&EPOLLOUT){
if(!users[sockfd].write()){
users[sockfd].close_conn();
}
}else{
}
}
}
close(epollfd);
close(listenfd);
delete []users;
delete pool;
return 0;
} | function_block-function_prefix_line | [
{
"content": "char const* info_compiler = \"INFO\" \":\" \"compiler[\" COMPILER_ID \"]\";\n",
"file_path": "thread_lib/cmake-build-debug/CMakeFiles/3.20.2/CompilerIdC/CMakeCCompilerId.c",
"rank": 0,
"score": 15856.93664216525
},
{
"content": "char const* info_platform = \"INFO\" \":\" \"plat... | |
C++ | cpp_analysis/bin/check_sizes.cpp | shahrukhqasim/HGCalML | 2808564b31c89d9b7eb882734f6aebc6f35e94f3 |
#include "TString.h"
#include "TFile.h"
#include "TTree.h"
#include <vector>
#include <iostream>
#include "TH1D.h"
#include "TCanvas.h"
void mergeOF(TH1D* h){
double lastb = h->GetBinContent(h->GetNbinsX());
h->SetBinContent(h->GetNbinsX(), lastb+h->GetBinContent(h->GetNbinsX()+1));
}
int main(int argc, cha... |
#include "TString.h"
#include "TFile.h"
#include "TTree.h"
#include <vector>
#include <iostream>
#include "TH1D.h"
#include "TCanvas.h"
void mergeOF(TH1D* h){
double lastb = h->GetBinContent(h->GetNbinsX());
h->SetBinContent(h->GetNbinsX(), lastb+h->GetBinContent(h->GetNbinsX()+1));
}
| int main(int argc, char* argv[]){
if(argc<2) return -1;
TString infile = argv[1];
TFile f(infile, "READ");
TTree * tree = (TTree*) f.Get("Delphes");
if(!tree || tree->IsZombie()){
std::cerr << "tree has a problem" << std::endl;
return -1;
}
std::vector<std::vector<float> >... | function_block-full_function | [
{
"content": "//#define GOOGLE_CUDA 1\n\n\n\n#if GOOGLE_CUDA\n\n#define EIGEN_USE_GPU\n\n#define HANDLE_ERROR( err ) ( tensorflow::functor::HandleError( err, __FILE__, __LINE__ ) )\n\n\n\n#include \"slicing_knn_kernel.h\"\n\n#include \"helpers.h\"\n\n#include \"tensorflow/core/util/gpu_kernel_helper.h\"\n\n#inc... | |
C++ | src/platform/threadmgr/ThreadManager.cpp | shorton3/dashingplatforms | f461c967827b92c8bcf872c365afa64e56871aba |
#include <iostream>
#include <sstream>
#include <ace/Thread.h>
#include "ThreadManager.h"
#include "platform/logger/Logger.h"
#include "platform/common/Defines.h"
#define THREAD_FUNC_RETRY 5
#define THREAD_MONITOR_PERIOD 2
#define MONITOR_GROUP_ID 17239115
ThreadManager::ThreadsWaitingForRestartMap ThreadMana... |
#include <iostream>
#include <sstream>
#include <ace/Thread.h>
#include "ThreadManager.h"
#include "platform/logger/Logger.h"
#include "platform/common/Defines.h"
#define THREAD_FUNC_RETRY 5
#define THREAD_MONITOR_PERIOD 2
#define MONITOR_GROUP_ID 17239115
ThreadManager::ThreadsWaitingForRestartMap ThreadMana... | ;
ostringstream ostr;
ostr << "Thread (" << threadParms->threadName_ << ") restarted with new Thread Id ("
<< newThreadId << ")" << ends;
STRACELOG(DEBUGLOG, THREADLOG, ostr.str().c_str());
ThreadManager::restartMap_.erase(restartMapIterato... | ThreadManager::createThread(threadParms->function_,
threadParms->functionArgs_, threadParms->threadName_.c_str(), threadParms->shouldRestart_,
threadParms->threadFlags_, threadParms->priority_, threadParms->threadGroup_,
threadParms->stackSize_) | call_expression | [
{
"content": "function with a return - the return value is simply ignored.\n\n(See ethel example below)\n\n\n\nAll the correct virtual function behavior is preserved. (see ricky\n\nexample below).\n\n\n\nIf you somehow try to create something in violation\n\nof the type system you will get a compile-time or tem... |
C++ | fboss/agent/state/tests/NeighborTests.cpp | dgrnbrg-meta/fboss | cde5aa021fbb28e08cc912a7c227e93ed3faefee |
#include <fboss/agent/state/ArpResponseEntry.h>
#include "fboss/agent/test/TestUtils.h"
#include "fboss/agent/state/ArpEntry.h"
#include "fboss/agent/state/NdpEntry.h"
#include "fboss/agent/state/NeighborEntry.h"
#include "fboss/agent/state/NeighborResponseTable.h"
#include "fboss/agent/state/Vlan.h"
#include <gtes... |
#include <fboss/agent/state/ArpResponseEntry.h>
#include "fboss/agent/test/TestUtils.h"
#include "fboss/agent/state/ArpEntry.h"
#include "fboss/agent/state/NdpEntry.h"
#include "fboss/agent/state/NeighborEntry.h"
#include "fboss/agent/state/NeighborResponseTable.h"
#include "fboss/agent/state/Vlan.h"
#include <gtes... |
TEST(NdpTable, serialize) {
NdpTable table;
table.addEntry(
IPAddressV6("2401:db00:21:70cb:face:0:96:0"),
MacAddress("01:01:01:01:01:01"),
PortDescriptor(PortID(10)),
InterfaceID(10),
NeighborState::REACHABLE);
table.addEntry(
IPAddressV6("2401:db00:21:70cb:face:0:96:1"),
... | TEST(ArpTable, serialize) {
ArpTable table;
table.addEntry(
IPAddressV4("192.168.0.1"),
MacAddress("01:01:01:01:01:01"),
PortDescriptor(PortID(10)),
InterfaceID(10),
NeighborState::REACHABLE);
table.addEntry(
IPAddressV4("192.168.0.2"),
MacAddress("01:01:01:01:01:02"),
... | function_block-full_function | [
{
"content": "class MacEntry\n\n : public ThriftyBaseT<state::MacEntryFields, MacEntry, MacEntryFields> {\n\n public:\n\n MacEntry(\n\n folly::MacAddress mac,\n\n PortDescriptor portDescr,\n\n std::optional<cfg::AclLookupClass> classID = std::nullopt,\n\n MacEntryType type = MacEntryType... |
C++ | src/hermite.cpp | azurite/AST-245-N-Body | cc3e3acd61f62415c1e5f40c8aba5b93703837fa | #include <iostream>
#include <fstream>
#include <chrono>
#include <hermite.hpp>
Hermite::Hermite()
{
t = .0;
dt = 0.01;
eps = 0.01;
N = 0;
filename = "";
lean = false;
blockSize = 1;
}
void Hermite::enableLean()
{
if(!lean)
lean = true;
}
void Hermite::disableLean()
{
if(lean)
lean = false;... | #include <iostream>
#include <fstream>
#include <chrono>
#include <hermite.hpp>
Hermite::Hermite()
{
t = .0;
dt = 0.01;
eps = 0.01;
N = 0;
filename = "";
lean = false;
blockSize = 1;
}
void Hermite::enableLean()
{
if(!lean)
lean = true;
}
void Hermite::disableLean()
{
if(lean)
lean = false;... |
std::ofstream file_energy(filename + ".output_energy.txt");
for(int i = 0; i <= energy.size() - blockSize; i += blockSize) {
file_energy << energy(i) << " ";
}
file_energy << std::endl;
std::ofstream file_meta(filename + ".output_meta.txt");
file_meta << N << " " << dt << " " << (numSteps * dt)... | if(!lean) {
std::ofstream file_pos(filename + ".output_pos.txt");
for(int i = 0; i < totalData.rows(); i++) {
for(int j = 0; j < totalData.cols(); j++) {
file_pos << totalData(i, j) << " ";
}
file_pos << std::endl;
}
} | if_condition | [
{
"content": " VectorXd energy;\n\n std::string filename;\n\n bool lean; // if set to true solver will not write position files because they can get quite large\n\n int blockSize;\n\n Matrix<double, 3, Dynamic> totalData; // positions of all particles over all time steps\n\n\n\n void computeEnergy(int ste... |
C++ | sandbox/rootfs.cc | Codu-LLC/sandbox | f78cb0fb8705904ffcda370f3395ca134d5fd87e |
#include "debug.h"
#include "rootfs.h"
#include "sandbox.h"
#include "util.h"
#include <fcntl.h>
#include <iostream>
#include <sys/types.h>
#include <sys/mount.h>
#include <sys/stat.h>
#include <unistd.h>
int setup_rootfs(Sandbox *ptr) {
if (mount(ptr->get_src_root_fs_dir().c_str(), ptr->get_target_root_fs_... |
#include "debug.h"
#include "rootfs.h"
#include "sandbox.h"
#include "util.h"
#include <fcntl.h>
#include <iostream>
#include <sys/types.h>
#include <sys/mount.h>
#include <sys/stat.h>
#include <unistd.h>
int setup_rootfs(Sandbox *ptr) {
if (mount(ptr->get_src_root_fs_dir().c_str(), ptr->get_target_root_fs_... | 1;
}
if (umount2("sandbox/put_old", MNT_DETACH) == -1) {
print_string(ptr->is_debug(), "Detaching old rootfs failed.");
return -1;
}
if (remove("sandbox/put_old") == -1) {
print_string(ptr->is_debug(), "Removing old rootfs failed.");
return -1;
}
if (chdir("san... | EXIST) {
print_string(ptr->is_debug(), "Making a directory for sandbox failed");
return -1;
}
if (mount(ptr->get_sandbox_dir().c_str(),
(ptr->get_target_root_fs_dir() + "/sandbox").c_str(),
"",
MS_BIND,
NULL) == -1) {
print_string(... | random | [
{
"content": "//\n\n// Created by Eugene Junghyun Kim on 1/13/2021.\n\n//\n\n\n\n#include \"cgroup.h\"\n\n#include \"debug.h\"\n\n#include \"execution.h\"\n\n#include \"file.h\"\n\n#include \"limit.h\"\n\n#include <memory>\n\n#include <sched.h>\n\n#include <signal.h>\n\n#include <string>\n\n#include <sys/types.... |
C++ | src/cpp/toHTML/toHTML.cpp | tmadden/asm-dom | 5cc18c41ba0da8319280355260d96d58bf67d782 | #include "toHTML.hpp"
#include "../utils/utils.hpp"
#include "../VNode/VNode.hpp"
#include "../Config/Config.hpp"
#include <emscripten/val.h>
#include <unordered_map>
#include <string>
namespace asmdom {
std::unordered_map<std::string, bool> containerElements {
{"a", true},
{"defs", true},
{"glyph", true... | #include "toHTML.hpp"
#include "../utils/utils.hpp"
#include "../VNode/VNode.hpp"
#include "../Config/Config.hpp"
#include <emscripten/val.h>
#include <unordered_map>
#include <string>
namespace asmdom {
std::unordered_map<std::string, bool> containerElements {
{"a", true},
{"defs", true},
{"glyph", true... | ;
#else
if (vnode->data.props.count("innerHTML") != 0) {
html.append(vnode->data.props.at("innerHTML").as<std::string>());
} else
#endif
for(Children::size_type i = 0; i != vnode->children.size(); ++i) {
toHTML(vnode->children[i], html);
}
html.append("</" + vnode->sel + ">... | html.append(
wstring_to_utf8(emscripten::val::module_property("insertInnerHTML")(reinterpret_cast<std::uintptr_t>(vnode)).as<std::wstring>())
) | call_expression | [
{
"content": "const getData = (Module, obj) => {\n\n let hasRaws = obj.raw !== undefined;\n\n let hasEvents = false;\n\n\n\n let ref;\n\n const attrs = new Module.MapStringString();\n\n const raw = obj.raw !== undefined ? obj.raw : {};\n\n const events = {};\n\n\n\n if (typeof obj.className === 'string')... |
C++ | lite/kernels/cuda/lookup_table_compute_test.cc | jameswu2014/Paddle-Lite | 827e349ac8eb769a873fe9b3aa961af8b8b20a96 |
#include "lite/kernels/cuda/lookup_table_compute.h"
#include <gtest/gtest.h>
#include <cmath>
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "lite/core/op_registry.h"
namespace paddle {
namespace lite {
namespace kernels {
namespace cuda {
using Tensor = lite::Tensor;
void Lookup... |
#include "lite/kernels/cuda/lookup_table_compute.h"
#include <gtest/gtest.h>
#include <cmath>
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "lite/core/op_registry.h"
namespace paddle {
namespace lite {
namespace kernels {
namespace cuda {
using Tensor = lite::Tensor;
|
TEST(lookup_table_cuda, retrieve_op) {
auto lookup_table =
KernelRegistry::Global().Create<TARGET(kCUDA), PRECISION(kFloat)>(
"lookup_table");
ASSERT_FALSE(lookup_table.empty());
ASSERT_TRUE(lookup_table.front());
}
TEST(lookup_table_cuda, init) {
LookupTableCompute lookup_table;
ASSERT_EQ(... | void LookupTableComputeRef(const operators::LookupTableParam& param) {
auto* ids_t = param.Ids;
auto* output_t = param.Out;
int64_t padding_idx = param.padding_idx;
auto* ids = ids_t->data<int64_t>();
int64_t ids_numel = ids_t->dims().production();
auto* table_t = param.W;
int64_t row_number = table_t->d... | function_block-full_function | [
{
"content": "namespace paddle {\n\nnamespace lite {\n\n\n\ntemplate <typename Dtype>\n\nvoid fill_tensor_host_const_impl(Dtype* dio, Dtype value, int64_t size) {\n\n for (int64_t i = 0; i < size; ++i) {\n\n dio[i] = value;\n\n }\n\n}\n\n/**\n\n * \\brief Fill the host tensor buffer with rand value.\n\n *... |
C++ | kt-nn/src/main/cpp/LayerImage.cpp | viveret/kotlin-tiny-dnn | 0f33d497384fe14b34edaa705642d67a15fadc66 |
#include "pocketn2.h"
extern "C"
JNIEXPORT jlong JNICALL
Java_com_viveret_tinydnn_data_graphics_LayerImage_jniConstructor(
JNIEnv *env, jobject thiz, jlong width, jlong height, jlong depth, tiny_dnn::image_type format) {
auto fn = [&]() {
auto size = new shape3d(width, height, depth);
ret... |
#include "pocketn2.h"
extern "C"
JNIEXPORT jlong JNICALL
Java_com_viveret_tinydnn_data_graphics_LayerImage_jniConstructor(
JNIEnv *env, jobject thiz, jlong width, jlong height, jlong depth, tiny_dnn::image_type format) {
auto fn = [&]() {
auto size = new shape3d(width, height, depth);
ret... | r);
return ret2;
}
extern "C"
JNIEXPORT jint JNICALL
Java_com_viveret_tinydnn_data_graphics_LayerImage_jniGetFormat(JNIEnv *env, jobject thiz,
jlong handle) {
auto fn = [&]() {
return ((tiny_dnn::image<unsigned char> *) handle)->type()... | {
ret = std::vector<unsigned char>(0);
}
jbyte* jbyteBuffer = new jbyte[ret.size()];
std::copy(ret.begin(), ret.end(), jbyteBuffer);
jbyteArray ret2 = env->NewByteArray((jsize)ret.size());
env->SetByteArrayRegion(ret2, 0, (jsize)ret.size(), jbyteBuffe | function_block-random_span | [
{
"content": "class GeneratePackageAction(val size: Int, val includeFitTo: Boolean, val path: String): ProjectAction {\n\n override val name: String = \"@Generate Package\"\n\n override fun doAction(project: NeuralNetProject): OnSelectedResult { return OnSelectedResult(true) }\n\n}",
"file_path": "kt-... |
C++ | src/core-util/pipe.cpp | rocksat/mLib | 1bd996008200b54d0984e957264e03faa24651d2 |
#ifdef _WIN32
#include <AccCtrl.h>
#include <Aclapi.h>
namespace ml {
Pipe::Pipe()
{
m_handle = nullptr;
}
Pipe::~Pipe()
{
closePipe();
}
void Pipe::closePipe()
{
if(m_handle != nullptr)
{
FlushFileBuffers(m_handle);
DisconnectNamedPipe(m_handle);
Cl... |
#ifdef _WIN32
#include <AccCtrl.h>
#include <Aclapi.h>
namespace ml {
Pipe::Pipe()
{
m_handle = nullptr;
}
Pipe::~Pipe()
{
closePipe();
}
void Pipe::closePipe()
{
if(m_handle != nullptr)
{
FlushFileBuffers(m_handle);
DisconnectNamedPipe(m_handle);
Cl... | m_handle,
nullptr,
0,
nullptr,
&BytesReady,
&BytesLeft);
return (BytesReady > 0);
}
bool Pipe::readMessage(std::vector<BYTE> &Message)
{
MLIB_ASSERT_STR(m_handle != nullptr, "Pipe invalid in Pipe::ReadMessage");
DWORD BytesReady = 0;
BOOL s... | d in Pipe::MessagePresent");
DWORD BytesReady = 0;
DWORD BytesLeft = 0;
BOOL success = PeekNamedPipe(
| function_block-random_span | [
{
"content": "class Pipe\n\n{\n\npublic:\n\n Pipe();\n\n ~Pipe();\n\n \n\n //\n\n // Connection\n\n //\n\n void closePipe();\n\n void createPipe(const std::string &pipeName, bool block);\n\n void connectToLocalPipe(const std::string &pipeName);\n\n void connectToPipe(const std::str... |
C++ | libcat/src/cat_storage_resmgr.cpp | shadow-paw/cat | 975749c9d716687f1bd74c80d474fed6065768de | #include "cat_storage_resmgr.h"
#include <new>
#include <string.h>
#include <png.h>
using namespace cat;
ResourceManager::ResourceManager(VFS* vfs) {
m_contextready = false;
m_vfs = vfs;
}
ResourceManager::~ResourceManager() {
fini();
}
bool ResourceManager::init() {
return true;
}
void ResourceMan... | #include "cat_storage_resmgr.h"
#include <new>
#include <string.h>
#include <png.h>
using namespace cat;
ResourceManager::ResourceManager(VFS* vfs) {
m_contextready = false;
m_vfs = vfs;
}
ResourceManager::~ResourceManager() {
fini();
}
bool ResourceManager::init() {
return true;
}
void ResourceMan... |
const Shader* ResourceManager::retain_shader(const std::string& name, const std::unordered_map<int, std::string>& uniforms, const std::unordered_map<int, std::string>& attrs) {
Buffer buffer;
auto cached = m_shaders.find(name);
if (cached!=m_shaders.end()) {
auto& pair = cached->second;
pa... | bool ResourceManager::context_restored() {
if (m_contextready) return true;
m_contextready = true;
for (auto it: m_shaders) {
reload_shader(&it.second.first, it.first);
}
for (auto it : m_texs) {
reload_tex(it.second.first, it.first);
}
return true;
} | function_block-full_function | [
{
"content": "namespace cat {\n\n// ----------------------------------------------------------------------------\n\n// UI Event\n\n// ----------------------------------------------------------------------------\n\nstruct TouchEvent {\n\n enum EventType { TouchDown, TouchUp, TouchMove, Scroll };\n\n EventT... |
C++ | examples/classes/slider/sliderx.cpp | pierrebestwork/owl642 | 3f4aa9ec0febc52acd3523f0b6ba063d5e388365 |
#include <owl/applicat.h>
#include <owl/framewin.h>
#include <owl/slider.h>
#include <owl/gauge.h>
#include <owl/static.h>
using namespace owl;
class TMainWindow
: public TWindow
{
public:
TMainWindow();
protected:
virtual void SetupWindow();
void EvTimer(uint timerId);
private:
enum
{
IDC_T... |
#include <owl/applicat.h>
#include <owl/framewin.h>
#include <owl/slider.h>
#include <owl/gauge.h>
#include <owl/static.h>
using namespace owl;
class TMainWindow
: public TWindow
{
public:
TMainWindow();
protected:
virtual void SetupWindow();
void EvTimer(uint timerId);
private:
enum
{
IDC_T... |
}
class THomeHeaterSimulator
: public TApplication
{
public:
THomeHeaterSimulator()
: TApplication("Home Heater Simulator")
{}
protected:
virtual void InitMainWindow()
{
TFrameWindow* frame = new TFrameWindow(0, GetName(), new TMainWindow, true);
frame->ModifyStyle(WS_SIZEBOX | WS_MAXIMIZE... | if (!IsHeaterOn && Temp <= lowTriggerTemp)
IsHeaterOn = true;
else if (IsHeaterOn && Temp >= highTriggerTemp)
IsHeaterOn = false; | if_condition | [
{
"content": "//----------------------------------------------------------------------------\n\nclass OWLEXTCLASS TNotebook : public virtual owl::TWindow {\n\n public:\n\n //--- redefined functions ---\n\n TNotebook(int tabloc = 0);\n\n ~TNotebook();\n\n void SetTabCnt(int tabcnt, int firsttab = 0,... |
C++ | src/plugins/lackman/packagesmodel.cpp | devel29a/leechcraft | faf5e856010fb785e4bbf3ce7b5c6a5c49f3239a |
#include "packagesmodel.h"
#include <QIcon>
#include <QApplication>
#include <util/util.h>
#include "core.h"
#include "storage.h"
#include "pendingmanager.h"
namespace LeechCraft
{
namespace LackMan
{
PackagesModel::PackagesModel (QObject *parent)
: QAbstractItemModel (parent)
{
}
int PackagesModel::columnCoun... |
#include "packagesmodel.h"
#include <QIcon>
#include <QApplication>
#include <util/util.h>
#include "core.h"
#include "storage.h"
#include "pendingmanager.h"
namespace LeechCraft
{
namespace LackMan
{
PackagesModel::PackagesModel (QObject *parent)
: QAbstractItemModel (parent)
{
}
int PackagesModel::columnCoun... |
int PackagesModel::GetRow (int packageId) const
{
for (int i = 0, size = Packages_.size (); i < size; ++i)
if (Packages_.at (i).PackageID_ == packageId)
return i;
return -1;
}
void PackagesModel::Clear ()
{
beginResetModel ();
Packages_.clear ();
endResetModel ();
}
void PackagesModel::hand... | ListPackageInfo PackagesModel::FindPackage (const QString& name) const
{
const auto pos = std::find_if (Packages_.begin (), Packages_.end (),
[&name] (const auto& lpi) { return lpi.Name_ == name; });
return pos != Packages_.end () ?
*pos :
ListPackageInfo {};
} | function_block-full_function | [
{
"content": "\tconst struct\n\n\t{\n\n\t\ttemplate<typename Vec>\n\n\t\tauto operator() (Vec&& vec) const\n\n\t\t{\n\n\t\t\tusing std::begin;\n\n\t\t\tusing std::end;\n\n\t\t\tusing MP = typename Vec::value_type;\n\n\t\t\treturn std::accumulate (begin (vec), end (vec), Mzero<MP> (), &operator+<MP>);\n\n\t\t}\n... |
C++ | pxr/imaging/plugin/hdRpr/rifcpp/rifContext.cpp | MagisterDemens/RadeonProRenderUSD | 51d3855b7c1a0cd8dafb5986d5ac4c6eb9df38e2 | #include "rifContext.h"
#include "rifError.h"
#include "RadeonProRender_CL.h"
#include "RadeonProRender_GL.h"
#include "RadeonImageFilters_cl.h"
#include "RadeonImageFilters_gl.h"
#include "RadeonImageFilters_metal.h"
#include "rprcpp/rprContext.h"
#include "rprcpp/rprFramebufferGL.h"
#include <vector>
#include <cass... | #include "rifContext.h"
#include "rifError.h"
#include "RadeonProRender_CL.h"
#include "RadeonProRender_GL.h"
#include "RadeonImageFilters_cl.h"
#include "RadeonImageFilters_gl.h"
#include "RadeonImageFilters_metal.h"
#include "rprcpp/rprContext.h"
#include "rprcpp/rprFramebufferGL.h"
#include <vector>
#include <cass... |
ContextMetal::ContextMetal(rpr_context rprContext, std::string const& modelPath)
: Context(modelPath) {
int deviceCount = 0;
RIF_ERROR_CHECK_THROW(rifGetDeviceCount(rifBackendApiType, &deviceCount), "Failed to query device count");
assert(deviceCount != 0);
if (0 == deviceCount)
RIF_THROW... | undef GPU
for (rpr_int i = 0; i < gpu_ids.size(); i++ )
{
if ((contextFlags & gpu_ids[i]) != 0)
return i;
}
return -1;
} | function_block-function_prefix_line | [
{
"content": "class FrameBufferGL : public FrameBuffer {\n\npublic:\n\n FrameBufferGL(rpr_context context, rpr_uint width, rpr_uint height);\n\n FrameBufferGL(FrameBufferGL&& fb) noexcept;\n\n ~FrameBufferGL() override;\n\n\n\n FrameBufferGL const& operator=(FrameBufferGL&& fb) noexcept;\n\n\n\n ... |
C++ | Code/Framework/AzCore/AzCore/Math/TransformSerializer.cpp | aaarsene/o3de | 37e3b0226958974defd14dd6d808e8557dcd7345 |
#include <AzCore/Math/Transform.h>
#include <AzCore/Math/TransformSerializer.h>
namespace AZ
{
AZ_CLASS_ALLOCATOR_IMPL(JsonTransformSerializer, AZ::SystemAllocator, 0);
JsonSerializationResult::Result JsonTransformSerializer::Load(
void* outputValue, [[maybe_unused]] const Uuid& outputValueTypeId, c... |
#include <AzCore/Math/Transform.h>
#include <AzCore/Math/TransformSerializer.h>
namespace AZ
{
AZ_CLASS_ALLOCATOR_IMPL(JsonTransformSerializer, AZ::SystemAllocator, 0);
|
JsonSerializationResult::Result JsonTransformSerializer::Store(
rapidjson::Value& outputValue, const void* inputValue, const void* defaultValue, [[maybe_unused]] const Uuid& valueTypeId,
JsonSerializerContext& context)
{
namespace JSR = AZ::JsonSerializationResult;
if (azrtti_... | JsonSerializationResult::Result JsonTransformSerializer::Load(
void* outputValue, [[maybe_unused]] const Uuid& outputValueTypeId, const rapidjson::Value& inputValue,
JsonDeserializerContext& context)
{
namespace JSR = JsonSerializationResult;
if (azrtti_typeid<AZ::Transform>() != ou... | function_block-full_function | [] |
C++ | widgets/mainwindow.cpp | AxelLeLouedec/Fitts | 23ff29373f6e8cd3bdbe8eaf1f60c9c0808cf44b | #include "./widgets/mainwindow.h"
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
, m_settings(new QSettings("options.ini", QSettings::IniFormat))
{
ui->setupUi(this);
openHome();
}
void MainWindow::onHomeEvent(int val, void *obj) {
qDebug() <<... | #include "./widgets/mainwindow.h"
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
, m_settings(new QSettings("options.ini", QSettings::IniFormat))
{
ui->setupUi(this);
openHome();
}
void MainWindow::onHomeEvent(int val, void *obj) {
qDebug() <<... |
void MainWindow::openHome() {
qDebug() << "Opening home";
home = new Home(model);
connect(home, SIGNAL(onHomeEvent(int,void*)), this, SLOT(onHomeEvent(int,void*)));
this->setCentralWidget(home);
}
void MainWindow::openResults(FittsModel *model) {
qDebug() << "Opening results";
results = n... | ent";
switch(val) {
case RESULTS_RESTART:
openHome();
break;
case RESULTS_EXIT_PRGM:
qApp->exit();
default:
break;
}
} | function_block-function_prefixed | [
{
"content": "class FittsModel\n\n{\n\npublic:\n\n FittsModel();\n\n\n\n int cibleLeft = 10;\n\n int nbCible = 10;\n\n int minSize = 10;\n\n int maxSize = 150;\n\n\n\n double a = 0.20;\n\n double b = 0.10;\n\n\n\n double ecartType = 0;\n\n double erreurType = 0;\n\n double diffMoy ... |
C++ | tests/test_address.cc | wavesplatform/wavespp | 9505613e01b19e5a73dfb90e9569323be98a3852 | #include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#include "../src/address.hpp"
#include "../src/utils.hpp"
static constexpr auto PUBLIC_KEY_BIN_LEN = wavespp::public_key::PUBLIC_KEY_BIN_LEN;
static int test_address_to_base58()
{
const std::string base58_address = "3MtBqEtkF8cYkNJv85Q... | #include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#include "../src/address.hpp"
#include "../src/utils.hpp"
static constexpr auto PUBLIC_KEY_BIN_LEN = wavespp::public_key::PUBLIC_KEY_BIN_LEN;
static int test_address_to_base58()
{
const std::string base58_address = "3MtBqEtkF8cYkNJv85Q... |
return 0;
}
static int test_address_from_unsigned_char()
{
printf("%s\n", __func__);
const char* address_base58 = "3ND8YwWJ5XHhYNbLcWv9uZEqVboSU8iyMgu";
const auto expected_address_binary = wavespp::utils::from_base58(address_base58);
const std::string input_public_key_str = "Do24gp5eC4HrN6XQkYh... | if (address_binary != expected_address_binary) {
fprintf(stderr, "%s: binary address %s != expected_address_binary %s \n",
__func__,
address_binary.c_str(),
expected_address_binary.c_str());
return 1;
} | if_condition | [
{
"content": "struct address\n\n{\n\n // Length of an address in Base58 format.\n\n static const size_t ADDRESS_B58_LEN = 36;\n\n // Length of an address in binary format.\n\n static constexpr size_t ADDRESS_BIN_LEN = 26;\n\n\n\n address();\n\n address(const char* _str); // from base58\n\n ... |
C++ | xfa/src/fwl/src/basewidget/fwl_tooltipctrlimp.cpp | andoma/pdfium | 6c0c0ce4b67502b89edf9c47c7e248328a8d8e9c |
#include "xfa/src/foxitlib.h"
#include "xfa/src/fwl/src/core/include/fwl_targetimp.h"
#include "xfa/src/fwl/src/core/include/fwl_noteimp.h"
#include "xfa/src/fwl/src/core/include/fwl_widgetimp.h"
#include "xfa/src/fwl/src/core/include/fwl_panelimp.h"
#include "xfa/src/fwl/src/core/include/fwl_formimp.h"
#include "xfa... |
#include "xfa/src/foxitlib.h"
#include "xfa/src/fwl/src/core/include/fwl_targetimp.h"
#include "xfa/src/fwl/src/core/include/fwl_noteimp.h"
#include "xfa/src/fwl/src/core/include/fwl_widgetimp.h"
#include "xfa/src/fwl/src/core/include/fwl_panelimp.h"
#include "xfa/src/fwl/src/core/include/fwl_formimp.h"
#include "xfa... |
FWL_ERR CFWL_ToolTipImp::GetClientRect(CFX_RectF& rect) {
FX_FLOAT x = 0;
FX_FLOAT y = 0;
FX_FLOAT t = 0;
IFWL_ThemeProvider* pTheme = m_pProperties->m_pThemeProvider;
if (pTheme) {
CFWL_ThemePart part;
part.m_pWidget = m_pInterface;
x = *static_cast<FX_FLOAT*>(
pTheme->GetCapacity(&part,... | return FWL_ERR_Indefinite;
}
if (!m_pProperties->m_pThemeProvider) {
m_pProperties->m_pThemeProvider = GetAvailableTheme();
}
UpdateTextOutStyles();
GetClientRect(m_rtClient);
m_rtCaption = m_rtClient;
return FWL_ERR_Succeeded;
} | function_block-function_prefix_line | [
{
"content": "class CLST_Rect : public CPDF_Rect {\n\n public:\n\n CLST_Rect() { left = top = right = bottom = 0.0f; }\n\n\n\n CLST_Rect(FX_FLOAT other_left,\n\n FX_FLOAT other_top,\n\n FX_FLOAT other_right,\n\n FX_FLOAT other_bottom) {\n\n left = other_left;\n\n top = o... |
C++ | qtmultimedia/tests/auto/unit/qmediaserviceprovider/tst_qmediaserviceprovider.cpp | wgnet/wds_qt | 8db722fd367d2d0744decf99ac7bafaba8b8a3d3 |
#include <QtTest/QtTest>
#include <QDebug>
#include <QStringList>
#include <private/qmediaserviceprovider_p.h>
#include <qmediaserviceproviderplugin.h>
#include <private/qmediapluginloader_p.h>
#include <qmediaobject.h>
#include <qmediaservice.h>
#include <qmediaplayer.h>
#include <qaudiorecorder.h>
#include <qcamer... |
#include <QtTest/QtTest>
#include <QDebug>
#include <QStringList>
#include <private/qmediaserviceprovider_p.h>
#include <qmediaserviceproviderplugin.h>
#include <private/qmediapluginloader_p.h>
#include <qmediaobject.h>
#include <qmediaservice.h>
#include <qmediaplayer.h>
#include <qaudiorecorder.h>
#include <qcamer... | e(), QMediaServiceProviderHint::Device);
QCOMPARE(hint.device(), deviceName);
QCOMPARE(hint.cameraPosition(), QCamera::UnspecifiedPosition);
QVERIFY(hint.mimeType().isEmpty());
QVERIFY(hint.codecs().isEmpty());
QCOMPARE(hint.features(), 0);
}
{
QMediaServiceProvi... | ist()),
QMultimedia::ProbablySupported);
QCOMPARE(provider->hasSupport(QByteArray(Q_MEDIASERVICE_MEDIAPLAYER), "video/avi",
QStringList() << "mpeg4"),
QMultimedia::MaybeSupported);
QCOMPARE(provider->hasSupport(QByteArray("non existing serv... | random | [] |
C++ | main/svl/source/misc/sharecontrolfile.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 |
#include "precompiled_svl.hxx"
#include <stdio.h>
#include <com/sun/star/ucb/XSimpleFileAccess.hpp>
#include <com/sun/star/ucb/XCommandEnvironment.hpp>
#include <com/sun/star/ucb/XContent.hpp>
#include <com/sun/star/ucb/InsertCommandArgument.hpp>
#include <com/sun/star/ucb/InteractiveIOException.hpp>
#include <com/... |
#include "precompiled_svl.hxx"
#include <stdio.h>
#include <com/sun/star/ucb/XSimpleFileAccess.hpp>
#include <com/sun/star/ucb/XCommandEnvironment.hpp>
#include <com/sun/star/ucb/XContent.hpp>
#include <com/sun/star/ucb/InsertCommandArgument.hpp>
#include <com/sun/star/ucb/InteractiveIOException.hpp>
#include <com/... |
}
else
{
aNewData[nNewInd] = m_aUsersData[nInd];
}
nNewInd++;
}
}
if ( !bExists )
aNewData[nNewInd++] = aNewEntry;
aNewData.realloc( nNewInd );
SetUsersDataAndStore( aNewData );
return aNewEntry;
}
bool... | if ( !bExists )
{
aNewData[nNewInd] = aNewEntry;
bExists = sal_True;
} | if_condition | [] |
C++ | tools/mesh_import/src/core/binary_exporter.cpp | ValtoForks/Terminus-Engine | 0c7381af84736ec7b029977843590453cde64b1d | #include <binary_exporter.h>
#include <assimp_importer.h>
#include <filesystem.h>
#include <timer.h>
#include <iostream>
namespace binary_exporter
{
void export_mesh(AssimpImportData* data, std::string output, Options options)
{
std::string meshOutputName = filesystem::get_filename(data->filename);
... | #include <binary_exporter.h>
#include <assimp_importer.h>
#include <filesystem.h>
#include <timer.h>
#include <iostream>
namespace binary_exporter
{
void export_mesh(AssimpImportData* data, std::string output, Options options)
{
std::string meshOutputName = filesystem::get_filename(data->filename);
... | string file, std::string output, Options options)
{
Timer timer;
timer.start();
filesystem::create_directory(output);
filesystem::create_directory(output + "/mesh");
filesystem::create_directory(output + "/material");
filesystem::create_directory(output + "/t... | std::string dest_path = output;
dest_path += "/";
dest_path += path_in_mat;
filesystem::copy_file(sourcePath, dest_path);
}
else
{
doc["roughness_value"] = 0.5f;
... | random | [
{
"content": "using String = std::string;\n",
"file_path": "tools/mesh_import/include/types.h",
"rank": 0,
"score": 120601.69996484136
},
{
"content": "using Json = nlohmann::json;\n",
"file_path": "tools/mesh_import/include/types.h",
"rank": 1,
"score": 120591.52757084777
},
... |
C++ | src/EventTraceKit.Etw/EventSession.cpp | ljani/event-trace-kit | 59a217fbaecfc87b3915e2494a8d25593d04ae99 | #include "Descriptors.h"
#include "TraceLog.h"
#include "WatchDog.h"
#include "InteropHelper.h"
#include "etk/ITraceLog.h"
#include "etk/ITraceProcessor.h"
#include "etk/ITraceSession.h"
#include <memory>
#include <string>
using namespace System;
using namespace System::Collections::Generic;
using namespace System::... | #include "Descriptors.h"
#include "TraceLog.h"
#include "WatchDog.h"
#include "InteropHelper.h"
#include "etk/ITraceLog.h"
#include "etk/ITraceProcessor.h"
#include "etk/ITraceSession.h"
#include <memory>
#include <string>
using namespace System;
using namespace System::Collections::Generic;
using namespace System::... | on* kernelSession = nullptr;
etk::ITraceProcessor* processor = nullptr;
};
static std::wstring LoggerNameBase = L"EventTraceKit_54644792-9281-48E9-B69D-E82A86F98960";
static std::wstring CreateLoggerName()
{
int pid = System::Diagnostics::Process::GetCurrentProcess()->Id;
return LoggerNameBase + L"_" + st... | viderBinary(String^ filePath)
{
return
filePath->EndsWith(L".exe", StringComparison::OrdinalIgnoreCase) ||
filePath->EndsWith(L".dll", StringComparison::OrdinalIgnoreCase);
}
template<>
inline etk::TraceProviderDescriptor marshal_as(EventProviderDescriptor^ const& provider)
{
etk::TraceProvider... | random | [
{
"content": "namespace EventTraceKit.EventTracing.Schema\n\n{\n\n using System.Xml.Linq;\n\n using EventTraceKit.EventTracing.Schema.Base;\n\n\n\n public static class EventManifestSchema\n\n {\n\n public static readonly XNamespace Namespace =\n\n \"http://schemas.microsoft.com/win... |
C++ | export/windows/cpp/obj/src/haxe/Timer.cpp | TinyPlanetStudios/Project-Crash-Land | 365f196be4212602d32251566f26b53fb70693f6 |
#include <hxcpp.h>
#ifndef INCLUDED_haxe_Log
#include <haxe/Log.h>
#endif
#ifndef INCLUDED_haxe_Timer
#include <haxe/Timer.h>
#endif
#ifndef INCLUDED_openfl__legacy_Lib
#include <openfl/_legacy/Lib.h>
#endif
namespace haxe{
void Timer_obj::__construct(Float time){
HX_STACK_FRAME("haxe.Timer","new",0x41... |
#include <hxcpp.h>
#ifndef INCLUDED_haxe_Log
#include <haxe/Log.h>
#endif
#ifndef INCLUDED_haxe_Timer
#include <haxe/Timer.h>
#endif
#ifndef INCLUDED_openfl__legacy_Lib
#include <openfl/_legacy/Lib.h>
#endif
namespace haxe{
void Timer_obj::__construct(Float time){
HX_STACK_FRAME("haxe.Timer","new",0x41... |
::Dynamic Timer_obj::lime_time_stamp;
Timer_obj::Timer_obj()
{
run = new __default_run(this);
}
void Timer_obj::__Mark(HX_MARK_PARAMS)
{
HX_MARK_BEGIN_CLASS(Timer);
HX_MARK_MEMBER_NAME(mTime,"mTime");
HX_MARK_MEMBER_NAME(mFireAt,"mFireAt");
HX_MARK_MEMBER_NAME(mRunning,"mRunning");
HX_MARK_MEMBER_NAME(run,"r... | STATIC_HX_DEFINE_DYNAMIC_FUNC0(Timer_obj,_hx___checkTimers,(void))
Float Timer_obj::_hx___nextWake(Float limit){
HX_STACK_FRAME("haxe.Timer","__nextWake",0x0e101148,"haxe.Timer.__nextWake","haxe/Timer.hx",339,0x1a690682)
HX_STACK_ARG(limit,"limit")
HXLINE( 341) HX_VARI( Float,now) = ::haxe::... | call_expression | [
{
"content": "class HXCPP_CLASS_ATTRIBUTES Timer_obj : public hx::Object\n\n{\n\n\tpublic:\n\n\t\ttypedef hx::Object super;\n\n\t\ttypedef Timer_obj OBJ_;\n\n\t\tTimer_obj();\n\n\n\n\tpublic:\n\n\t\tvoid __construct(Float time);\n\n\t\tinline void *operator new(size_t inSize, bool inContainer=true,const char *i... |
C++ | include/external/urdl/istreambuf.hpp | Ptomaine/nstd | 72daa4abab97dc82b407c774b00476459df0730b |
#ifndef URDL_ISTREAMBUF_HPP
#define URDL_ISTREAMBUF_HPP
#include <streambuf>
#include "detail/config.hpp"
#include "option_set.hpp"
#include "url.hpp"
#include "detail/abi_prefix.hpp"
namespace urdl {
class istreambuf
: public std::streambuf
{
public:
URDL_DECL istreambuf();
URDL_DECL ~istreambuf();
... |
#ifndef URDL_ISTREAMBUF_HPP
#define URDL_ISTREAMBUF_HPP
#include <streambuf>
#include "detail/config.hpp"
#include "option_set.hpp"
#include "url.hpp"
#include "detail/abi_prefix.hpp"
namespace urdl { | fix.hpp"
#if defined(URDL_HEADER_ONLY)
# include "impl/istreambuf.ipp"
#endif
#endif
|
class istreambuf
: public std::streambuf
{
public:
URDL_DECL istreambuf();
URDL_DECL ~istreambuf();
template <typename Option>
void set_option(const Option& option)
{
option_set options;
options.set_option(option);
set_options(options);
}
URDL_DECL void set_options(con... | random | [
{
"content": "*/\n\n\n\n#define URDL_HEADER_ONLY\n\n#define URDL_DISABLE_SSL\n\n#define ASIO_STANDALONE\n\n#define ASIO_HAS_STD_CHRONO\n\n\n\n#include \"external/asio/asio/include/asio.hpp\"\n\n#include \"external/urdl/http.hpp\"\n\n#include \"external/urdl/istream.hpp\"\n\n#include \"external/urdl/istreambuf.h... |
C++ | src/machine_learning/matrix_factorization.cpp | rafaelppires/rex | 4d3c10ba4bde86365090b5c7c5e8de037a1fb885 | #include "matrix_factorization.h"
#include <utils/time_probe.h>
#include <iostream>
MatrixFactorizationModel::MatrixFactorizationModel(int rank) : rank_(rank) {}
double MatrixFactorizationModel::predict(int user, int item) const {
return weights_.predict(user, item);
}
double MatrixFactorizationModel::rmse(cons... | #include "matrix_factorization.h"
#include <utils/time_probe.h>
#include <iostream>
MatrixFactorizationModel::MatrixFactorizationModel(int rank) : rank_(rank) {}
double MatrixFactorizationModel::predict(int user, int item) const {
return weights_.predict(user, item);
}
double MatrixFactorizationModel::rmse(cons... | rank_) + weights_.estimate_serial_size();
}
void MatrixFactorizationModel::serialize_append(
std::vector<uint8_t> &out) const {
const uint8_t *rptr = reinterpret_cast<const uint8_t *>(&rank_);
out.insert(out.end(), rptr, rptr + sizeof(rank_));
weights_.serialize_append(out);
}
size_t MatrixFactorizati... | s.coeffRef(0, index) *= my_weight;
factors.col(index) += embedding.col(0);
biases.coeffRef(0, index) += bias.coeff(0, 0);
ret.insert(index);
});
return ret;
}
std::set<int> MatrixFactorizationModel::metropolis_hastings_users(
size_t my_degree, const DegreesAndModels &models) {
r... | random | [
{
"content": "class meta_sqrt<Y, InfX, SupX, true> { public: enum { ret = (SupX*SupX <= Y) ? SupX : InfX }; };\n\n\n\n\n\n/** \\internal Computes the least common multiple of two positive integer A and B\n\n * at compile-time. It implements a naive algorithm testing all multiples of A.\n\n * It thus works be... |
C++ | vtkMAF/Testing/vtkMAFVolumeResampleTest.cpp | FusionBox2/MAF2 | b576955f4f6b954467021f12baedfebcaf79a382 |
#include <cppunit/config/SourcePrefix.h>
#include "vtkMAFVolumeResampleTest.h"
#include "vtkMAFSmartPointer.h"
#include "vtkMAFVolumeResample.h"
#include "vtkDataSet.h"
#include "vtkStructuredPoints.h"
#include "vtkRectilinearGridReader.h"
#include "vtkRectilinearGrid.h"
#include "vtkDataArray.h"
#include "vtkPoin... |
#include <cppunit/config/SourcePrefix.h>
#include "vtkMAFVolumeResampleTest.h"
#include "vtkMAFSmartPointer.h"
#include "vtkMAFVolumeResample.h"
#include "vtkDataSet.h"
#include "vtkStructuredPoints.h"
#include "vtkRectilinearGridReader.h"
#include "vtkRectilinearGrid.h"
#include "vtkDataArray.h"
#include "vtkPoin... | == volumeOrigin[i]);
}
resample->Delete();
}
void vtkMAFVolumeResampleTest::TestSetGetVolumeAxisX()
{
double volumeAxisX[3] = {0,0,1};
vtkMAFVolumeResample *resample = vtkMAFVolumeResample::New();
resample->SetVolumeAxisX(volumeAxisX);
double checkVolumeAxisX[3] = {0,0,1};
resample->GetVolumeAxisX(ch... | eOrigin[3] = {1,2,3};
resample->GetVolumeOrigin(checkVolumeOrigin);
for (int i = 0; i < 3; i++)
{
CPPUNIT_ASSERT(checkVolumeOrigin[i] | function_block-random_span | [
{
"content": "class vtkTransform;\n",
"file_path": "Interaction/mafCameraTransform.h",
"rank": 0,
"score": 127481.85520661279
},
{
"content": "class vtkTransform;\n",
"file_path": "Testing/Base/mafTransformFrameTest.h",
"rank": 1,
"score": 124946.89338589914
},
{
"content... |
C++ | Libraries/VtkVgQtSceneUtil/vtkVgCoordinateTransform.cxx | PinkDiamond1/vivia | 70f7fbed4b33b14d34de35c69b2b14df3514d720 |
#include "vtkVgCoordinateTransform.h"
#include <vtkVgAdapt.h>
#include <vtkMatrix4x4.h>
#include <vtkObjectFactory.h>
#include <vgl/vgl_homg_point_2d.h>
#include <vgl/algo/vgl_h_matrix_2d.h>
#include <vgl/algo/vgl_h_matrix_2d_compute_linear.h>
vtkStandardNewMacro(vtkVgCoordinateTransform);
vtkVgCoordinateTransfo... |
#include "vtkVgCoordinateTransform.h"
#include <vtkVgAdapt.h>
#include <vtkMatrix4x4.h>
#include <vtkObjectFactory.h>
#include <vgl/vgl_homg_point_2d.h>
#include <vgl/algo/vgl_h_matrix_2d.h>
#include <vgl/algo/vgl_h_matrix_2d_compute_linear.h>
vtkStandardNewMacro(vtkVgCoordinateTransform);
vtkVgCoordinateTransfo... |
vtkSmartPointer<vtkMatrix4x4> vtkVgCoordinateTransform::GetHomographyMatrix()
{
std::vector<vgl_homg_point_2d<double> > fromPoints;
std::vector<vgl_homg_point_2d<double> > toPoints;
for (int i = 0; i < 4; ++i)
{
vgl_homg_point_2d<double> vglPt2d(this->FromPoint[i][0], this->FromPoint[i][1], 1);
... | this->ToPoint[0][0] = x1;
this->ToPoint[0][1] = y1;
this->ToPoint[1][0] = x2;
this->ToPoint[1][1] = y2;
this->ToPoint[2][0] = x3;
this->ToPoint[2][1] = y3;
this->ToPoint[3][0] = x4;
this->ToPoint[3][1] = y4;
} | function_block-function_prefix_line | [
{
"content": "class QT_TESTINGSUPPORT_EXPORT pqQteDoubleSliderEventPlayer :\n\n public pqWidgetEventPlayer\n\n{\n\n Q_OBJECT\n\n\n\npublic:\n\n pqQteDoubleSliderEventPlayer(QObject* p = 0);\n\n\n\n bool playEvent(QObject* Object, const QString& Command, const QString& Arguments, bool& Error);\n\n\n\nprivate... |
C++ | kraken/resources/home/dnanexus/jellyfish-1.1.11/jellyfish/stats_main_cmdline.hpp | transcript/DNAnexus_apps | 12c2ba6f57b805a9fcf6e1da4f9d64394ef72256 |
#ifndef __STATS_ARGS_HPP__
#define __STATS_ARGS_HPP__
#include <jellyfish/yaggo.hpp>
class stats_args {
public:
bool recompute_flag;
uint64_t lower_count_arg;
bool lower_count_given;
uint64_t upper_count_arg;
b... |
#ifndef __STATS_ARGS_HPP__
#define __STATS_ARGS_HPP__
#include <jellyfish/yaggo.hpp>
class stats_args {
public:
bool recompute_flag;
uint64_t lower_count_arg;
bool lower_count_given;
uint64_t upper_count_arg;
b... |
private:
};
#endif
| void dump(std::ostream &os = std::cout) {
os << "recompute_flag:" << recompute_flag << "\n";
os << "lower_count_given:" << lower_count_given << " lower_count_arg:" << lower_count_arg << "\n";
os << "upper_count_given:" << upper_count_given << " upper_count_arg:" << upper_count_arg << "\n";
os << "verbos... | function_block-full_function | [
{
"content": "struct tuple_size<GTEST_1_TUPLE_(T)> { static const int value = 1; };\n\n\n\ntemplate <GTEST_2_TYPENAMES_(T)>\n",
"file_path": "kraken/resources/home/dnanexus/jellyfish-1.1.11/unit_tests/gtest/include/gtest/internal/gtest-tuple.h",
"rank": 0,
"score": 416406.8253525696
},
{
"co... |
C++ | sources/dansandu/ballotin/logging.cpp | dansandu/ballotin | e92aac53153ca85759bc412a86937b28c5dbfc4c | #include "dansandu/ballotin/logging.hpp"
#include "dansandu/ballotin/date_time.hpp"
#include "dansandu/ballotin/exception.hpp"
#include "dansandu/ballotin/file_system.hpp"
#include "dansandu/ballotin/string.hpp"
#include <algorithm>
#include <fstream>
using dansandu::ballotin::date_time::getDateTime;
using dansandu::... | #include "dansandu/ballotin/logging.hpp"
#include "dansandu/ballotin/date_time.hpp"
#include "dansandu/ballotin/exception.hpp"
#include "dansandu/ballotin/file_system.hpp"
#include "dansandu/ballotin/string.hpp"
#include <algorithm>
#include <fstream>
using dansandu::ballotin::date_time::getDateTime;
using dansandu::... |
void standardOutputHandler(const LogEntry& logEntry)
{
auto stream = std::stringstream{};
stream << logEntry.timestamp << " " << levelToString(logEntry.level) << " " << logEntry.threadId << " "
<< logEntry.file << ":" << logEntry.line << " " << logEntry.message << std::endl;
const auto string =... | void Logger::log(const Level level, const char* const function, const char* const file, const int line,
const std::function<std::string()>& messageSupplier) const
{
if (level <= getLevel())
{
const auto timestamp = getDateTime();
const auto message = messageSupplier();
c... | function_block-full_function | [
{
"content": "enum class Level\n\n{\n\n none,\n\n error,\n\n warn,\n\n info,\n\n debug\n\n};\n\n\n\nconstexpr bool operator<(const Level left, const Level right)\n\n{\n\n return static_cast<int>(left) < static_cast<int>(right);\n\n}\n\n\n\nconstexpr bool operator>(const Level left, const Level... |
C++ | external/opengl/libagl2/src/texture.cpp | gordonjohnpatrick/XobotOS | 888ed3b8cc8d8e0a54b1858bfa5a3572545f4d2f | #include "gles2context.h"
#define API_ENTRY
#define CALL_GL_API(NAME,...) LOGD("?"#NAME); assert(0);
#define CALL_GL_API_RETURN(NAME,...) LOGD("?"#NAME); assert(0); return 0;
static inline GGLTexture * AllocTexture()
{
GGLTexture * tex = (GGLTexture *)calloc(1, sizeof(GGLTexture));
tex->minFilter = GGLTexture::... | #include "gles2context.h"
#define API_ENTRY
#define CALL_GL_API(NAME,...) LOGD("?"#NAME); assert(0);
#define CALL_GL_API_RETURN(NAME,...) LOGD("?"#NAME); assert(0); return 0;
|
void GLES2Context::InitializeTextures()
{
tex.textures = std::map<GLuint, GGLTexture *>();
tex.tex2D = AllocTexture();
tex.textures[GL_TEXTURE_2D] = tex.tex2D;
tex.texCube = AllocTexture();
tex.textures[GL_TEXTURE_CUBE_MAP] = tex.texCube;
for (unsigned i = 0; i < GGL_MAXCOMBINEDTEXTUREIMAGEUNITS; i... | static inline GGLTexture * AllocTexture()
{
GGLTexture * tex = (GGLTexture *)calloc(1, sizeof(GGLTexture));
tex->minFilter = GGLTexture::GGL_LINEAR;
tex->magFilter = GGLTexture::GGL_LINEAR;
return tex;
} | function_block-full_function | [] |
C++ | activemq-cpp/src/test/activemq/core/ConnectionAuditTest.cpp | novomatic-tech/activemq-cpp | d6f76ede90d21b7ee2f0b5d4648e440e66d63003 |
#include "ConnectionAuditTest.h"
#include <activemq/core/ConnectionAudit.h>
#include <activemq/core/Dispatcher.h>
#include <activemq/core/ActiveMQMessageAudit.h>
#include <activemq/util/IdGenerator.h>
#include <activemq/commands/Message.h>
#include <activemq/commands/ActiveMQDestination.h>
#include <activemq/command... |
#include "ConnectionAuditTest.h"
#include <activemq/core/ConnectionAudit.h>
#include <activemq/core/Dispatcher.h>
#include <activemq/core/ActiveMQMessageAudit.h>
#include <activemq/util/IdGenerator.h>
#include <activemq/commands/Message.h>
#include <activemq/commands/ActiveMQDestination.h>
#include <activemq/command... | eId> id(new MessageId);
id->setProducerId(pid);
id->setProducerSequenceId(i);
list.add(id);
message->setMessageId(id);
CPPUNIT_ASSERT(!audit.isDuplicate(dispatcher.get(), message));
}
int index = list.size() -1 -audit.getAuditDepth();
for (; index < list.size(); ind... | ucerNumber() == ActiveMQMessageAudit::MAXIMUM_PRODUCER_COUNT);
}
void ConnectionAuditTest::testConstructor2() {
ConnectionAudit audit(100, 200);
CPPUNIT_ASSERT(audit.isCheckForDuplicates());
CPPUNIT_ASSERT(audit.getAuditDepth() == 100);
CPPUNIT_ASSERT(audit.getAuditMaximumProducerNumber() == 200);
}
... | random | [
{
"content": " class DECAF_API Reader: public virtual decaf::io::Closeable, public virtual decaf::lang::Readable {\n\n private:\n\n\n\n Reader(const Reader&);\n\n Reader& operator=(const Reader&);\n\n\n\n protected:\n\n\n\n Reader();\n\n\n\n public:\n\n\n\n virtual ~Reade... |
C++ | PlayTools/mainwindow.cpp | memorywalker/playtools | 39441f3df16484a0784a5cc3b62c57af049fdc52 | #include "mainwindow.h"
#include "firewallrules.h"
#include "ui_mainwindow.h"
#include <Windows.h>
#include "AutoMate.h"
#include <QDebug>
#include <QHotkey>
#include <QSound>
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
, m_nLuckwheelInteval(4000)
{
ui->setupUi(t... | #include "mainwindow.h"
#include "firewallrules.h"
#include "ui_mainwindow.h"
#include <Windows.h>
#include "AutoMate.h"
#include <QDebug>
#include <QHotkey>
#include <QSound>
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
, m_nLuckwheelInteval(4000)
{
ui->setupUi(t... | m_firewallRules.StartProcessOffline(m_GtaProcessPath);
}
else
{
m_firewallRules.StopProcessOffine();
}
switchOn = !switchOn;
if (switchOn)
{
ui->disconnectProcessButton->setStyleSheet("background-color: rgb(255, 0, 0)");
}
else
{
ui->disconnectProcess... | _FuncHotkeys[FunctionType_Finger]->setShortcut(QKeySequence(strKey), true);
conn = QObject::connect(m_FuncHotkeys[FunctionType_Finger], &QHotkey::activated, this, &MainWindow::on_fingerPrintButton_clicked);
Q_ASSERT(conn);
strKey = ui->lineEditLuckyWheel->text().trimmed().toLower();
m_FuncHotkeys[FunctionType_Luck... | random | [
{
"content": "class AutoMate\n\n{\n\npublic:\n\n\tAutoMate();\n\n\t~AutoMate();\n\n\n\n\tvoid SetWindow(QObject* qObj);\n\n\n\n\tvoid SendTestCommand();\n\n\n\n\tvoid SendSnackCmd();\n\n\tvoid SendArmorCmd();\n\n\tvoid SendDoomsDayIICmd();\n\n\tvoid SendDoomsDayIIICmd();\n\n\tvoid SendLuckyWheelCmd(int millisec... |
C++ | fltl/include/mpl/Static.hpp | iambrosie/Grail-Plus | e102de735e86df241e4311394190ad39181f073b |
#ifndef FLTL_STATIC_HPP_
#define FLTL_STATIC_HPP_
#include <new>
namespace fltl { namespace mpl {
namespace detail {
template <typename T>
class StaticValue {
public:
inline static T &default_value(void) throw() {
static T val;
static bool is... |
#ifndef FLTL_STATIC_HPP_
#define FLTL_STATIC_HPP_
#include <new>
namespace fltl { namespace mpl {
namespace detail {
template <typename T>
class StaticValue {
public:
inline static T &default_value(void) throw() {
static T val;
static bool is... | taticValue<unsigned short> {
public:
inline static unsigned short &default_value(void) throw() {
static unsigned short val(0U);
return val;
}
};
template <>
class StaticValue<int> {
public:
inline static int &de... | public:
inline static T *&default_value(void) throw() {
static T *val(0);
return val;
}
};
template <>
class StaticValue<char> {
public:
inline static char &default_value(void) throw() {
static c... | random | [
{
"content": " class IfTrue<true,ThenT,ElseT> {\n\n public:\n\n typedef ThenT type;\n\n };\n\n\n\n template <typename T0, typename T2, typename ThenT, typename ElseT>\n",
"file_path": "fltl/include/mpl/If.hpp",
"rank": 1,
"score": 226457.0076507059
},
{
"content": " cla... |
C++ | src/chwSurfaceTweak.cpp | bradleyhenke/chwtools | 733e346b4dc6452954b6ba19899d2ccf0a0cd79f |
#include "chwSurfaceTweak.h"
const MTypeId chwSurfaceTweak::typeId( 0x89007 );
const MString chwSurfaceTweak::typeName( "chwSurfaceTweak" );
MObject chwSurfaceTweak::aInVert;
MObject chwSurfaceTweak::aFalloffMode;
MObject chwSurfaceTweak::aFalloffCurve;
MObject chwSurfaceTweak::aFalloffRadius;
MObject ... |
#include "chwSurfaceTweak.h"
const MTypeId chwSurfaceTweak::typeId( 0x89007 );
const MString chwSurfaceTweak::typeName( "chwSurfaceTweak" );
MObject chwSurfaceTweak::aInVert;
MObject chwSurfaceTweak::aFalloffMode;
MObject chwSurfaceTweak::aFalloffCurve;
MObject chwSurfaceTweak::aFalloffRadius;
MObject ... |
void chwSurfaceTweak::postConstructor()
{
MStatus status;
status = postConstructor_initialise_ramp_curve( aFalloffCurve, 0, 0.0f, 1.0f, 2 );
CHECK_MSTATUS(status);
status = postConstructor_initialise_ramp_curve( aFalloffCurve, 1, 1.0f, 0.0f, 2 );
CHECK_MSTATUS(status);
}
| MStatus chwSurfaceTweak::postConstructor_initialise_ramp_curve( MObject &rampObj, int index, float position, float value, int interpolation)
{
MStatus status;
MObject thisNode = this->thisMObject();
MPlug rampPlug( thisNode, rampObj );
MPlug elementPlug = rampPlug.elementByLogicalIndex( index, &status );
MPlug ... | function_block-full_function | [
{
"content": "class chwVertexBindData\n\n{\n\n\tpublic:\n\n\t\tMPointArray\t\tm_drvpoints;\n\n\t\tMPointArray\t\tm_defpoints;\n\n\t\tMFloatArray\t\tm_weights;\n\n\t\tMIntArray\t\tm_mapping;\n\n\t\tMMatrix\t\t\tm_localToWorldMatrix;\n\n\t\tfloat\t\t\tm_cutoffDistance;\n\n\t\tfloat\t\t\tm_searchDistance;\n\n};\n\... |
C++ | src/transpiler/transpiler.cpp | GeminiLab/afbd | 6855eedd6e3b1309adea2071074d0ce0003e6079 | #include <transpiler/transpiler.h>
#include <llvm/IR/TypeBuilder.h>
#include <queue>
#include <set>
#include <sstream>
#include <iostream>
using namespace std;
using namespace afbd;
void print_common_header(fstream &fs) {
}
shared_ptr<set<shared_ptr<Instruction>>> get_all_instrs(shared_ptr<Instruction> root) {... | #include <transpiler/transpiler.h>
#include <llvm/IR/TypeBuilder.h>
#include <queue>
#include <set>
#include <sstream>
#include <iostream>
using namespace std;
using namespace afbd;
void print_common_header(fstream &fs) {
}
shared_ptr<set<shared_ptr<Instruction>>> get_all_instrs(shared_ptr<Instruction> root) {... |
process_type = llvm::FunctionType::get(
voidTy,
llvm::ArrayRef<llvm::Type *>{sim_type->getPointerTo()},
false
);
set_var_count = llvm::Function::Create(
llvm::FunctionType::get(
voidTy,
llvm::ArrayRef<llvm::Type *>{var... | (x->triggers()->size() > 0) {
builder.CreateCall(prepare_wait);
for (auto &w: *x->triggers()) {
builder.CreateCall(
add_wait,
llvm::ArrayRef<llvm::Value*> {
builder.getInt32(v... | random | [
{
"content": "class SigSet<T, typename std::enable_if<!std::is_pointer<T>::value>::type> : public SigSet<T, std::less<T>> {};\n\ntemplate<typename T>\n\nusing sort_by_name_id_guard = typename std::enable_if<std::is_same<T,RTLIL::Cell*>::value>::type;\n\ntemplate<typename T>\n",
"file_path": "3rd/yosys/inclu... |
C++ | Editor/HairParticleWindow.cpp | mewbak/WickedEngine | 572bc7836fa14793b1c3b3b4733ddc61f1da5887 | #include "stdafx.h"
#include "HairParticleWindow.h"
using namespace std;
using namespace wiECS;
using namespace wiScene;
HairParticleWindow::HairParticleWindow(wiGUI* gui) : GUI(gui)
{
assert(GUI && "Invalid GUI!");
float screenW = (float)wiRenderer::GetDevice()->GetScreenWidth();
float screenH = (float)wiRendere... | #include "stdafx.h"
#include "HairParticleWindow.h"
using namespace std;
using namespace wiECS;
using namespace wiScene;
HairParticleWindow::HairParticleWindow(wiGUI* gui) : GUI(gui)
{
assert(GUI && "Invalid GUI!");
float screenW = (float)wiRenderer::GetDevice()->GetScreenWidth();
float screenH = (float)wiRendere... | ;
addButton->SetTooltip("Add new hair particle system.");
hairWindow->AddWidget(addButton);
meshComboBox = new wiComboBox("Mesh: ");
meshComboBox->SetSize(XMFLOAT2(300, 25));
meshComboBox->SetPos(XMFLOAT2(x, y += step));
meshComboBox->SetEnabled(false);
meshComboBox->OnSelect([&](wiEventArgs args) {
auto hair... | addButton->OnClick([&](wiEventArgs args) {
Scene& scene = wiScene::GetScene();
scene.Entity_CreateHair("editorHair");
}) | call_expression | [
{
"content": "class wiGUI;\n",
"file_path": "Editor/HairParticleWindow.h",
"rank": 0,
"score": 231629.97973045165
},
{
"content": "class HairParticleWindow\n\n{\n\npublic:\n\n\tHairParticleWindow(wiGUI* gui);\n\n\t~HairParticleWindow();\n\n\n\n\twiECS::Entity entity;\n\n\tvoid SetEntity(wiEC... |
C++ | libmarch/include/march/python/wrapper_core.hpp | j8xixo12/solvcon | a8bf3a54d4b1ed91d292e0cdbcb6f2710d33d99a | #pragma once
#include <pybind11/pybind11.h>
#include <pybind11/stl.h>
#include <utility>
#include <memory>
#include <vector>
#include <algorithm>
#include <cstring>
#include "march.hpp"
#include "march/python/WrapBase.hpp"
namespace march {
namespace python {
class
MARCH_PYTHON_WRAPPER_VISIBILITY
WrapBuffer
: p... | #pragma once
#include <pybind11/pybind11.h>
#include <pybind11/stl.h>
#include <utility>
#include <memory>
#include <vector>
#include <algorithm>
#include <cstring>
#include "march.hpp"
#include "march/python/WrapBase.hpp"
namespace march {
namespace python {
class
MARCH_PYTHON_WRAPPER_VISIBILITY
WrapBuffer
: p... |
},
"Ghost-part array.")
.def_property(
"B",
[](LookupTableCore & tbl) { return Table(tbl).body(); },
[](LookupTableCore & tbl, py::array src) { Table::CopyInto(Table(tbl).body(), src); },
"Body-part array.")
;
}
wrapper_ty... | if (tbl.nghost()) {
Table::CopyInto(Table(tbl).ghost(), src);
} else {
throw py::index_error("ghost is zero");
} | if_condition | [
{
"content": "class LookupTable<ElemType, 0>: public LookupTableCore\n\n{\n\n\n\npublic:\n\n\n\n using elem_type = ElemType;\n\n\n\n typedef elem_type (&row_type);\n\n typedef const elem_type (&const_row_type);\n\n\n\n LookupTable() {}\n\n\n\n LookupTable(index_type nghost, index_type nbody)\n\n ... |
C++ | cpp/mindalpha/dense_tensor.cpp | mindalpha/MindAlpha | 5b6fe017a37238884a6e963fd6b0a1492938e186 |
#include <string.h>
#include <json11.hpp>
#include <mindalpha/dense_tensor.h>
#include <mindalpha/file_utils.h>
#include <mindalpha/tensor_utils.h>
namespace mindalpha
{
void DenseTensor::Init(std::function<void()> cb)
{
PSMessage req = std::make_shared<Message>();
json11::Json json = json11::Json::object
... |
#include <string.h>
#include <json11.hpp>
#include <mindalpha/dense_tensor.h>
#include <mindalpha/file_utils.h>
#include <mindalpha/tensor_utils.h>
namespace mindalpha
{
void DenseTensor::Init(std::function<void()> cb)
{
PSMessage req = std::make_shared<Message>();
json11::Json json = json11::Json::object
... |
}
void DenseTensor::Save(const std::string& dir_path, std::function<void()> cb)
{
PullMeta([this, dir_path, cb](DenseTensorMeta meta) {
std::string meta_path = GetDenseMetaPath(dir_path);
std::string str = meta.ToJsonString();
EnsureLocalDirectory(dir_path);
StreamWriteAll(meta_pat... | if (keep_meta || agent_->GetAgentRank() != 0)
push_data_and_state();
else
{
meta.SetName(GetMeta().GetName());
meta.SetPartitionCount(agent_->GetServerCount());
PushMeta(meta, push_data_and_state);
} | if_condition | [
{
"content": "class DenseTensorMeta\n\n{\n\npublic:\n\n const std::string& GetName() const { return name_; }\n\n void SetName(std::string value) { name_ = std::move(value); }\n\n\n\n DataType GetDataType() const { return data_type_; }\n\n void SetDataType(DataType value) { data_type_ = value; }\n\n\... |
C++ | chrome/browser/ui/views/tabs/color_picker_view.cc | sarang-apps/darshan_browser | 173649bb8a7c656dc60784d19e7bb73e07c20daa |
#include "chrome/browser/ui/views/tabs/color_picker_view.h"
#include <memory>
#include <vector>
#include "base/bind.h"
#include "base/callback.h"
#include "base/containers/span.h"
#include "chrome/browser/themes/theme_properties.h"
#include "chrome/browser/ui/tabs/tab_group_theme.h"
#include "chrome/browser/ui/view... |
#include "chrome/browser/ui/views/tabs/color_picker_view.h"
#include <memory>
#include <vector>
#include "base/bind.h"
#include "base/callback.h"
#include "base/containers/span.h"
#include "chrome/browser/themes/theme_properties.h"
#include "chrome/browser/ui/tabs/tab_group_theme.h"
#include "chrome/browser/ui/view... |
void ButtonPressed(Button* sender, const ui::Event& event) override {
DCHECK_EQ(this, sender);
if (!selected_) {
selected_ = true;
SchedulePaint();
selected_callback_.Run(this);
}
}
private:
void PaintSelectionIndicator(gfx::Canvas* canvas) {
if (!selected_) {
... | l_Style);
flags.setColor(color);
flags.setAntiAlias(true);
canvas->DrawCircle(bounds.CenterPoint(), bounds.width() / 2.0f, flags);
PaintSelectionIndicator(canvas);
} | function_block-function_prefixed | [] |
C++ | src/libmv/simple_pipeline/camera_intrinsics.cc | Matthias-Fauconneau/libmv | 531c79bf95fddaaa70707d1abcd4fdafda16bbf0 |
#include "libmv/simple_pipeline/camera_intrinsics.h"
#include "libmv/numeric/levenberg_marquardt.h"
namespace libmv {
struct Offset { signed char ix,iy; unsigned char fx,fy; };
CameraIntrinsics::CameraIntrinsics()
: K_(Mat3::Identity()),
image_width_(0),
image_height_(0),
k1_(0),
k2_(0)... |
#include "libmv/simple_pipeline/camera_intrinsics.h"
#include "libmv/numeric/levenberg_marquardt.h"
namespace libmv {
struct Offset { signed char ix,iy; unsigned char fx,fy; };
CameraIntrinsics::CameraIntrinsics()
: K_(Mat3::Identity()),
image_width_(0),
image_height_(0),
k1_(0),
k2_(0)... | (undistort_,src,dst,width,height);
}
}
| t i = 0; i < N; i++) {
dst[(y*width+x)*N+i] = ((s[ i] * (256-offset.fx) + s[ N+i] * offset.fx) * (256-offset.fy)
+(s[width*N+i] * (256-offset.fx) + s[width*N+N+i] * offset.fx) * offset.fy) / (256*256);
}
}
}
}
void CameraIntrinsics::FreeLookupGrid() {
... | random | [
{
"content": "struct tuple_size<GTEST_2_TUPLE_(T)> { static const int value = 2; };\n\n\n\ntemplate <GTEST_3_TYPENAMES_(T)>\n",
"file_path": "src/third_party/gtest/include/gtest/internal/gtest-tuple.h",
"rank": 1,
"score": 343036.2119991771
},
{
"content": "struct tuple_size<GTEST_0_TUPLE_(T... |
C++ | tests/experimental/strong_type/strong_type.t.cpp | tobanteAudio/taetl | 0aa6365aa156b297745f395882ff366a8626e5e0 |
#include "etl/experimental/strong_type/strong_type.hpp"
#include "etl/cstdint.hpp"
#include "etl/type_traits.hpp"
#include "testing/testing.hpp"
using namespace etl::experimental;
template <typename T>
constexpr auto test() -> bool
{
{
using Kilogram = strong_type<T, struct Kilogram_tag>;
au... |
#include "etl/experimental/strong_type/strong_type.hpp"
#include "etl/cstdint.hpp"
#include "etl/type_traits.hpp"
#include "testing/testing.hpp"
using namespace etl::experimental;
template <typename T>
constexpr auto test() -> bool
{
{
using Kilogram = strong_type<T, struct Kilogram_tag>;
au... | to const sum = lhs / rhs;
assert((sum.raw_value() == T(1)));
}
{
using Hertz = strong_type<T, struct Hertz_tag, skill::comparable>;
auto const lhs = Hertz { typename Hertz::value_type(44) };
auto const rhs = Hertz { typename Hertz::value_type(48) };
assert((lhs.raw_... | :is_constructible_v<Kilo>));
assert((etl::is_trivially_constructible_v<Kilo>));
assert((etl::is_nothrow_constructible_v<Kilo>));
assert((etl::is_destructible_v<Kilo>));
assert((etl::is_trivially_destructible_v<Kilo>));
assert((etl::is_nothrow_destructible_v<Kilo>));
ass... | function_block-random_span | [
{
"content": "struct auto_reg {\n\n explicit auto_reg(name_and_tags const& sp, test_func_t func)\n\n {\n\n current_session().add_test(sp, func);\n\n }\n\n};\n\n\n\n} // namespace etl::test\n\n\n\n#endif // ETL_EXPERIMENTAL_TESTING_SESSION_HPP\n",
"file_path": "etl/experimental/testing/sessio... |
C++ | tests/benchmark/src/UAutomizerFileReader-test.cpp | typesAreSpaces/AXDInterpolator | e0759c806480ff54b7a4f878e007b534a71dad44 | #include "UAutomizerFileReader.h"
void UAutomizerFileReader::testAXDInterpolator() const {
TEMP_FILE_SETUP;
BENCHMARK_COMMAND(
z3::solver tseitin_solver(ctx, "QF_AUFLIA");
tseitin_solver.add(z3::mk_and(part_a));
tseitin_solver.add(z3::mk_and(part_b));
axdinterpolator_file << tseitin_solve... | #include "UAutomizerFileReader.h"
void UAutomizerFileReader::testAXDInterpolator() const {
TEMP_FILE_SETUP;
BENCHMARK_COMMAND(
z3::solver tseitin_solver(ctx, "QF_AUFLIA");
tseitin_solver.add(z3::mk_and(part_a));
tseitin_solver.add(z3::mk_and(part_b));
axdinterpolator_file << tseitin_solve... | interpolant_from_file += ")\n";
interpolant_from_file += "(check-sat)\n";
system(("rm -rf " + temp_file_name).c_str());
z3::solver smtinterpol_interpolant_parser(ctx, "QF_AUFLIA");
smtinterpol_interpolant_parser.from_string(interpolant_from_file.c_str());
... | function_block-function_prefix_line | [
{
"content": "enum SMT_SOLVER { Z3, MATHSAT, SMTINTERPOL };\n\n\n",
"file_path": "tests/benchmark/include/UAutomizerFileReader.h",
"rank": 0,
"score": 219527.99814903465
},
{
"content": "enum BENCHMARK_EXIT_CODE { SUCCESS, FAILED, TIMEOUT };\n",
"file_path": "tests/benchmark/include/UAut... | |
C++ | problemes/probleme1xx/probleme185.cpp | ZongoForSpeed/ProjectEuler | 2e2d45f984d48a1da8275886c976f909a0de94ce | #include "problemes.h"
#include "arithmetique.h"
#include <fstream>
typedef unsigned long long nombre;
typedef std::vector<nombre> vecteur;
typedef std::pair<std::string, unsigned short> paire;
typedef std::vector<paire> ensemble;
namespace {
template<typename Iterator>
bool cherche_solution(Iterator debut,... | #include "problemes.h"
#include "arithmetique.h"
#include <fstream>
typedef unsigned long long nombre;
typedef std::vector<nombre> vecteur;
typedef std::pair<std::string, unsigned short> paire;
typedef std::vector<paire> ensemble;
namespace {
template<typename Iterator>
bool cherche_solution(Iterator debut,... |
}
ENREGISTRER_PROBLEME(185, "Number Mind") {
std::ifstream ifs("data/p185_number_mind.txt");
... | if (s.find(essai.first[n]) == s.end()) {
test.erase(n);
}
}
if (test.size() < essai.second)
return false;
if (essai.second == 0) {
for (size_t n: test) {
solutions[n].erase(essai.first[n]);
}
return ch... | function_block-function_prefix_line | [
{
"content": " class numeric_limits<mpz_nombre> : public numeric_limits<long long> {\n\n public:\n\n static constexpr int digits = INT_MAX;\n\n static constexpr int digits10 = INT_MAX;\n\n\n\n static mpz_nombre max() {\n\n return mpz_nombre::puissance(2, digits);\n\n ... |
C++ | include/zisa/memory/array_view_impl.hpp | 1uc/ZisaMemory | 9d9689e46e63629f842b04765bc322f32d91758e | #ifndef ARRAY_VIEW_IMPL_HPP
#define ARRAY_VIEW_IMPL_HPP
namespace zisa {
template <class T>
auto raw_ptr(T *a) -> decltype(a) {
return a;
}
template <class T, class Indexing>
array_view_base<T, Indexing>::array_view_base(array_view_base::shape_type shape,
T *ptr,
... | #ifndef ARRAY_VIEW_IMPL_HPP
#define ARRAY_VIEW_IMPL_HPP
namespace zisa {
template <class T>
auto raw_ptr(T *a) -> decltype(a) {
return a;
}
template <class T, class Indexing>
array_view_base<T, Indexing>::array_view_base(array_view_base::shape_type shape,
T *ptr,
... | int n_dims, template <int> class Indexing>
T const *array_view<T, n_dims, Indexing>::cbegin() const {
return this->_ptr;
}
template <class T, int n_dims, template <int> class Indexing>
T const *array_view<T, n_dims, Indexing>::cend() const {
return this->_ptr + this->size();
}
template <class T, int n_dims, templ... | s, template <int> class Indexing>
T &array_view<T, n_dims, Indexing>::operator[](array_view::size_type i) const {
return this->_ptr[i];
}
template <class T, int n_dims, template <int> class Indexing>
template <class... Ints>
T &array_view<T, n_dims, Indexing>::operator()(Ints... ints) const {
auto l = Indexing<n_d... | random | [
{
"content": "class array_const_view : public array_view_base<const T, Indexing<n_dims>> {\n\n\n\nprivate:\n\n using super = array_view_base<const T, Indexing<n_dims>>;\n\n using size_type = typename super::size_type;\n\n\n\npublic:\n\n ANY_DEVICE_INLINE\n\n array_const_view(const shape_t<n_dims> &shape,\n\... |
C++ | src/developer/debug/unwinder/dwarf_cfi.cc | lalrochhara/fuchsia | f56c62fa108cfd72b8034eeddb4e403f1f69fdbd |
#include "src/developer/debug/unwinder/dwarf_cfi.h"
#include <algorithm>
#include <cinttypes>
#include <cstdint>
#include <map>
#include <string>
#include "src/developer/debug/unwinder/dwarf_cfi_parser.h"
#include "third_party/crashpad/third_party/glibc/elf/elf.h"
namespace unwinder {
namespace {
struct DwarfCie... |
#include "src/developer/debug/unwinder/dwarf_cfi.h"
#include <algorithm>
#include <cinttypes>
#include <cstdint>
#include <map>
#include <string>
#include "src/developer/debug/unwinder/dwarf_cfi_parser.h"
#include "third_party/crashpad/third_party/glibc/elf/elf.h"
namespace unwinder {
namespace {
struct DwarfCie... |
cfi_parser.Snapshot();
if (auto err = cfi_parser.ParseInstructions(elf_, cie.code_alignment_factor,
cie.data_alignment_factor, fde.instructions_begin,
fde.instructions_end, pc - fde.pc_begin);
err.has_err()) {
... | if (auto err =
cfi_parser.ParseInstructions(elf_, cie.code_alignment_factor, cie.data_alignment_factor,
cie.instructions_begin, cie.instructions_end, -1);
err.has_err()) {
return err;
} | if_condition | [] |
C++ | Code/trunk/cpp/Geometry/CartesianMesh/CartesianMesh_base.hh | jlconlin/PhDThesis | 8e704613721a800ce1c59576e94f40fa6f7cd986 |
#ifndef CARTESIANMESH_BASE_HH
#define CARTESIANMESH_BASE_HH
#include <boost/ptr_container/ptr_vector.hpp>
#include "Types.hh"
#include "Dimension.hh"
#include "GeomId.hh"
#include "MeshTraits.hh"
#include "Assert.hh"
#include "GeometricElementConcept.hh"
using boost::ptr_vector;
template<typename dimension_type, ... |
#ifndef CARTESIANMESH_BASE_HH
#define CARTESIANMESH_BASE_HH
#include <boost/ptr_container/ptr_vector.hpp>
#include "Types.hh"
#include "Dimension.hh"
#include "GeomId.hh"
#include "MeshTraits.hh"
#include "Assert.hh"
#include "GeometricElementConcept.hh"
using boost::ptr_vector;
template<typename dimension_type, ... |
typename Base::const_NodeIterator nodeEnd() const
{
return typename Base::const_NodeIterator( mNodes, mNodes.end() );
}
typename Base::CornerIterator cornerBegin()
{
return typename Base::CornerIterator( mCorners, mCorners.begin() );
}
typename Base::CornerIterator cornerEnd()
{
r... | return 0;
else
return mGhostCorners->size();
}
typename Base::ZoneIterator zoneBegin()
{
return typename Base::ZoneIterator( mZones, mZones.begin() );
}
typename Base::ZoneIterator zoneEnd()
{
return typename Base::ZoneIterator( mZones, mZones.end() );
}
typen... | random | [
{
"content": "class MeshBaseException : public ExceptionBase\n\n{\n\npublic:\n\n /// Imports the \\c LineNumType from the \\c ExceptionBase base class.\n\n\ttypedef ExceptionBase::LineNumType LineNumType;\n\n\n\n\t/*! \\brief Constructor. Takes in the line number and filename where the exception \n\n\t * ... |
C++ | OpenSees/SRC/element/PFEMElement/TclModelBuilder_addPFEMElement.cpp | kuanshi/ductile-fracture | ccb350564df54f5c5ec3a079100effe261b46650 | #include "TclModelBuilder_addPFEMElement.h"
#include "PFEMElement2D.h"
#include "PFEMElement2DFIC.h"
#include "PFEMElement2DCompressible.h"
#include "PFEMElement2DBubble.h"
#include "PFEMElement2Dmini.h"
#include "PFEMElement3D.h"
#include <cstring>
#include <string>
int
TclModelBuilder_addPFEMElement2D(ClientData cli... | #include "TclModelBuilder_addPFEMElement.h"
#include "PFEMElement2D.h"
#include "PFEMElement2DFIC.h"
#include "PFEMElement2DCompressible.h"
#include "PFEMElement2DBubble.h"
#include "PFEMElement2Dmini.h"
#include "PFEMElement3D.h"
#include <cstring>
#include <string>
|
int
TclModelBuilder_addPFEMElement3D(ClientData clientData, Tcl_Interp *interp,
int argc, TCL_Char **argv,
Domain *theDomain,
TclModelBuilder *theBuilder)
{
if(argc < 13) {
opserr << "Invalid #args: wan... | int
TclModelBuilder_addPFEMElement2D(ClientData clientData, Tcl_Interp *interp,
int argc, TCL_Char **argv,
Domain *theDomain,
TclModelBuilder *theBuilder)
{
if(argc < 11) {
opserr << "Invalid #args: want ... | function_block-full_function | [
{
"content": " CONST char *string;\t\t/* Last string passed to Tcl_RegExpExec. */\n",
"file_path": "OpenSees/SRC/tcl/include/tclRegexp.h",
"rank": 0,
"score": 183596.33256221714
},
{
"content": " public TypedIOPort string;\n",
"file_path": "OpenSees/SRC/java/kepler/opensees/StringT... |
C++ | OpenTES4/bsa.cpp | Cyril-Meyer/OpenTES4Oblivion | dc2791a5a7ea911d0960d79ce0b9445fcbe329ee | #include "bsa.h"
BSA::BSA() {}
void BSA::summary()
{
std::cout << "header" << std::endl;
std::cout << this->header.fileId << std::endl;
std::cout << this->header.version << std::endl;
std::cout << this->header.offset << std::endl;
std::cout << this->header.archiveFlags << std::endl;
std::cout ... | #include "bsa.h"
BSA::BSA() {}
void BSA::summary()
{
std::cout << "header" << std::endl;
std::cout << this->header.fileId << std::endl;
std::cout << this->header.version << std::endl;
std::cout << this->header.offset << std::endl;
std::cout << this->header.archiveFlags << std::endl;
std::cout ... |
frb.name = bzs;
for (uint32_t j = 0; j < bsa.folderRecords[i].count; ++j) {
BSA::FileRecord fr;
read(is, &fr.nameHash, sizeof(fr.nameHash));
read(is, &fr.size, sizeof(fr.size));
read(is, &fr.offset, sizeof(fr.offset));
frb.fileRecords.push_... | if (archiveFlags.test(0)) {
read(is, &bzs.length, sizeof(bzs.length));
bzs.data = new char[bzs.length];
read(is, bzs.data, bzs.length);
if (bzs.data[bzs.length - 1] != '\0') {
std::cout << "ERROR : invalid bzstring" << std::endl;
... | if_condition | [
{
"content": " def read(self):\n\n # open file\n\n file = open(self.filename, 'rb')\n\n # read file header\n\n self.header = {\n\n \"fileId\": str(file.read(4)),\n\n \"version\": bytes_to_int(file.read(4)),\n\n \"offset\": bytes_to_int(file.read(4)... |
C++ | libuuidpp/libuuidpp.hpp | dagronf/UUID_Wrapper | 6ad8e7390d200bb96ef3e6e815650c2d5a2f886c |
#pragma once
#include <uuid/uuid.h>
#include <string>
#include <array>
#ifndef __APPLE__
#include <string.h>
typedef char __uuid_string_t[37];
typedef __uuid_string_t uuid_string_t;
#endif
static_assert(16 == sizeof(uuid_t), "uuid_t is of unexpected size");
static_assert(37 == sizeof(uuid_string_t), "Unexpected ... |
#pragma once
#include <uuid/uuid.h>
#include <string>
#include <array>
#ifndef __APPLE__
#include <string.h>
typedef char __uuid_string_t[37];
typedef __uuid_string_t uuid_string_t;
#endif
static_assert(16 == sizeof(uuid_t), "uuid_t is of unexpected size");
static_assert(37 == sizeof(uuid_string_t), "Unexpected ... |
bool uuid::internal_microsoft_create(const char* uuidString, uuid_t& result) {
if (is_microsoft_formatted(uuidString)) {
char temp[STR_GUID_LEN];
::memset(temp, 0, STR_GUID_LEN);
::memcpy(temp, uuidString+1, STR_GUID_LEN - 1);
if (::uuid_parse(temp, result) != 0) {
return false;
}
return true;
}
ret... | g != nullptr) {
if (internal_microsoft_create(uuidString, result)) {
return true;
}
else if (internal_uuid_create(uuidString, result)) {
return true;
}
}
::uuid_clear(result);
return false;
} | function_block-function_prefixed | [
{
"content": "# libuuidpp - A lightweight C++ UUID class.\n\n\n\nA lightweight C++ class wrapper around the `libuuid` library.\n\n\n\n## Features\n\n\n\n* Compatible with std containers such as `std::vector`, `std::set`, `std::map` etc.\n\n* Handles upper and lower case uuids.\n\n* Automatically handles Microso... |
C++ | Base/QTGUI/qSlicerExtensionsManagerDialog.cxx | TheInterventionCentre/NorMIT-Plan-App | 765ed9a5dccc1cc134b65ccabe93fc132baeb2ea |
#include <QPushButton>
#include "qSlicerApplication.h"
#include "qSlicerExtensionsManagerDialog.h"
#include "qSlicerExtensionsManagerModel.h"
#include "qSlicerSettingsExtensionsPanel.h"
#include "ui_qSlicerExtensionsManagerDialog.h"
class qSlicerExtensionsManagerDialogPrivate: public Ui_qSlicerExtensionsManagerDial... |
#include <QPushButton>
#include "qSlicerApplication.h"
#include "qSlicerExtensionsManagerDialog.h"
#include "qSlicerExtensionsManagerModel.h"
#include "qSlicerSettingsExtensionsPanel.h"
#include "ui_qSlicerExtensionsManagerDialog.h"
class qSlicerExtensionsManagerDialogPrivate: public Ui_qSlicerExtensionsManagerDial... | lication * coreApp = qSlicerCoreApplication::application();
if (d->PreviousModulesAdditionalPaths
!= coreApp->revisionUserSettings()->value("Modules/AdditionalPaths").toStringList() ||
d->PreviousExtensionsScheduledForUninstall
!= coreApp->revisionUserSettings()->value("Extensions/ScheduledForUninst... | )->revisionUserSettings();
this->PreviousModulesAdditionalPaths = settings->value("Modules/AdditionalPaths").toStringList();
this->PreviousExtensionsScheduledForUninstall = settings->value("Extensions/ScheduledForUninstall").toStringList();
this->PreviousExtensionsScheduledForUpdate = settings->value("Extensions/... | random | [
{
"content": "class DiffusionTensor3DTransform : public Object\n\n{\n\npublic:\n\n typedef TData DataType;\n\n typedef double TransformType;\n\n typedef DiffusionTensor3DTransform Self;\n\n typedef Point<TransformType, 3> PointT... |
C++ | main/sw/source/ui/docvw/SidebarTxtControlAcc.cxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 |
#include "precompiled_sw.hxx"
#include <SidebarTxtControlAcc.hxx>
#include <SidebarTxtControl.hxx>
#include <svl/brdcst.hxx>
#include <toolkit/awt/vclxaccessiblecomponent.hxx>
#include <editeng/unoedsrc.hxx>
#include <editeng/unoforou.hxx>
#include <editeng/unoviwou.hxx>
#include <editeng/unoedhlp.hxx>
#include <s... |
#include "precompiled_sw.hxx"
#include <SidebarTxtControlAcc.hxx>
#include <SidebarTxtControl.hxx>
#include <svl/brdcst.hxx>
#include <toolkit/awt/vclxaccessiblecomponent.hxx>
#include <editeng/unoedsrc.hxx>
#include <editeng/unoforou.hxx>
#include <editeng/unoviwou.hxx>
#include <editeng/unoedhlp.hxx>
#include <s... |
}
SidebarTextEditSource::~SidebarTextEditSource()
{
if ( mrSidebarTxtControl.GetTextView() )
{
mrSidebarTxtControl.GetTextView()->GetOutliner()->SetNotifyHdl( Link() );
}
}
SvxEditSource* SidebarTextEditSource::Clone() const
{
return new SidebarTextEditSource( mrSidebarTxtControl );
}
SvxTex... | if ( mrSidebarTxtControl.GetTextView() )
{
mrSidebarTxtControl.GetTextView()->GetOutliner()->SetNotifyHdl( LINK(this, SidebarTextEditSource, NotifyHdl) );
} | if_condition | [] |
C++ | Operations/albaOpExporterAnsysCommon.cpp | IOR-BIC/ALBA | b574968b05d9a3a2756dd2ac61d015a0d20232a4 |
#include "albaDefines.h"
#include "albaOpExporterAnsysCommon.h"
#include "albaOpImporterAnsysCommon.h"
#include "albaDecl.h"
#include "albaGUI.h"
#include "albaSmartPointer.h"
#include "albaTagItem.h"
#include "albaTagArray.h"
#include "albaVME.h"
#include "albaVMEMesh.h"
#include "albaVMEMeshAnsysTextExporter.h"... |
#include "albaDefines.h"
#include "albaOpExporterAnsysCommon.h"
#include "albaOpImporterAnsysCommon.h"
#include "albaDecl.h"
#include "albaGUI.h"
#include "albaSmartPointer.h"
#include "albaTagItem.h"
#include "albaTagArray.h"
#include "albaVME.h"
#include "albaVMEMesh.h"
#include "albaVMEMeshAnsysTextExporter.h"... |
}
}
ExportElement *albaOpExporterAnsysCommon::CreateExportElements(albaVMEMesh * input, int rowsNumber, vtkUnstructuredGrid * inputUGrid, FILE * file)
{
vtkIntArray *elementIdArray = input->GetElementsIDArray();
vtkIntArray *nodesIDArray = input->GetNodesIDArray();
vtkIntArray *typeArray = input->G... | if (result < 0)
return -1;
else if (result > 0)
return 1;
else
{
result = a->elementID - b->elementID;
if (result < 0)
return -1;
else if (result > 0)
return 1;
else
assert(0);
} | if_condition | [
{
"content": " function is of type void *, and returns NULL.\n\n Otherwise the type is void which is correct for WIN32\n\n and SPROC\n\n*/ \n\n#ifdef CMAKE_USE_SPROC_INIT\n\ntypedef int mmuThreadProcessIDType;\n\n#endif\n\n\n\n\n\n#ifdef CMAKE_USE_PTHREADS_INIT\n\ntypedef void *(*mmuInternalThreadFunctionTy... |
C++ | src/test_suites/oclc/oclc_miscellaneous_vector_functions/src/vec_step.cpp | intel/cassian | 8e9594f053f9b9464066c8002297346580e4aa2a |
#include <algorithm>
#include <cassian/catch2_utils/catch2_utils.hpp>
#include <cassian/cli/cli.hpp>
#include <cassian/runtime/openclc_type_tuples.hpp>
#include <cassian/runtime/runtime.hpp>
#include <cassian/test_harness/test_harness.hpp>
#include <cassian/utility/metaprogramming.hpp>
#include <cassian/utility/utili... |
#include <algorithm>
#include <cassian/catch2_utils/catch2_utils.hpp>
#include <cassian/cli/cli.hpp>
#include <cassian/runtime/openclc_type_tuples.hpp>
#include <cassian/runtime/runtime.hpp>
#include <cassian/test_harness/test_harness.hpp>
#include <cassian/utility/metaprogramming.hpp>
#include <cassian/utility/utili... |
template <typename T> std::string get_build_options() {
const std::string clc_data_type = T::device_type;
std::string build_options = " -D DATA_TYPE=" + clc_data_type;
return build_options;
}
ca::Kernel create_kernel(const std::string &path, const std::string &name,
const std::string &... | int get_reference() {
using data_host_type = typename T::host_type;
if constexpr (ca::is_vector_v<data_host_type>) {
return data_host_type::size_in_memory;
}
return 1;
} | function_block-full_function | [
{
"content": "/*\n\n * Copyright (C) 2021 Intel Corporation\n\n *\n\n * SPDX-License-Identifier: MIT\n\n *\n\n */\n\n\n\n#ifndef CASSIAN_VECTOR_VECTOR_HPP\n\n#define CASSIAN_VECTOR_VECTOR_HPP\n\n\n\n#include <algorithm>\n\n#include <array>\n\n#include <cstddef>\n\n#include <functional>\n\n#include <initializer_... |
C++ | Sankore-3.1/src/gui/UBDownloadWidget.cpp | eaglezzb/rsdc | cce881f6542ff206bf286cf798c8ec8da3b51d50 |
#include <QDebug>
#include <QHeaderView>
#include <QStyleOptionProgressBarV2>
#include <QApplication>
#include "UBDownloadWidget.h"
#include "globals/UBGlobals.h"
#include "core/UBApplication.h"
#include "core/memcheck.h"
UBDownloadWidget::UBDownloadWidget(QWidget *parent, const char *name):QWidget(parent)
, mp... |
#include <QDebug>
#include <QHeaderView>
#include <QStyleOptionProgressBarV2>
#include <QApplication>
#include "UBDownloadWidget.h"
#include "globals/UBGlobals.h"
#include "core/UBApplication.h"
#include "core/memcheck.h"
UBDownloadWidget::UBDownloadWidget(QWidget *parent, const char *name):QWidget(parent)
, mp... | n_Desc, Qt::UserRole, QVariant(actualDL.at(i).id));
mpItem->setIcon(eItemColumn_Close, QIcon(":images/close.svg"));
mpTree->addTopLevelItem(mpItem);
mpItem = new QTreeWidgetItem(mpTree);
mpItem->setData(eItemColumn_Desc, Qt::UserRole, actualDL.at(i).currentSize);
mpItem->setData(... | ("Cancel"), this);
mpCancelBttn->setObjectName("DockPaletteWidgetButton");
mpBttnLayout->addWidget(mpCancelBttn, 0);
mpLayout->addLayout(mpBttnLayout);
connect(UBDownloadManager::downloadManager(), SIGNAL(fileAddedToDownload()), this, SLOT(onFileAddedToDownload()));
connect(UBDownloadManager::downl... | random | [
{
"content": "\t\tSSL_CIPHER *new_cipher;\n",
"file_path": "Sankore-ThirdParty/openssl/0.9.8i/include/openssl/ssl3.h",
"rank": 0,
"score": 129144.86743968823
},
{
"content": "X509V3_EXT_NEW ext_new;\n",
"file_path": "Sankore-ThirdParty/openssl/0.9.8i/include/openssl/x509v3.h",
"rank"... |
C++ | libs/semanticsearch/src/semanticsearch/query/query_executor.cpp | devjsc/ledger | 5681480faf6e2aeee577f149c17745d6ab4d4ab3 |
#include "semanticsearch/query/query_executor.hpp"
#include <cassert>
namespace fetch {
namespace semanticsearch {
QueryExecutor::QueryExecutor(SharedSemanticSearchModule instance, ErrorTracker &error_tracker)
: error_tracker_(error_tracker)
, semantic_search_module_{std::move(instance)}
{}
void QueryExecutor... |
#include "semanticsearch/query/query_executor.hpp"
#include <cassert>
namespace fetch {
namespace semanticsearch {
QueryExecutor::QueryExecutor(SharedSemanticSearchModule instance, ErrorTracker &error_tracker)
: error_tracker_(error_tracker)
, semantic_search_module_{std::move(instance)}
{}
void QueryExecutor... | ;
}
void QueryExecutor::ExecuteSet(CompiledStatement const &stmt)
{
using Type = QueryInstruction::Type;
std::size_t i = 3;
if (stmt.size() < i)
{
error_tracker_.RaiseSyntaxError("Set statment has incorrect syntax.", stmt[0].token);
return;
}
if (stmt[1].type != Type::IDENTIFIER)
{
error... | model->VisitSubmodelsWithVocabulary(
[this, stmt](std::string, std::string mname, Vocabulary obj) {
auto model = semantic_search_module_->GetModel(mname);
if (model == nullptr)
{
error_tracker_.RaiseSyntaxError("Could not find model '" + mname + "'", stmt[1].token);
ret... | call_expression | [
{
"content": " enum class Type\n\n {\n\n UNKNOWN = 0,\n\n SET_CONTEXT,\n\n PUSH_SCOPE,\n\n POP_SCOPE,\n\n\n\n FUNCTION = 50,\n\n EXECUTE_CALL,\n\n\n\n // Operators come first and are ordered according to precendence\n\n // That is: DO not change the order unless you intensionally\n\n ... |
C++ | ipc/src/client_endpoint_com.cpp | tyoma/micro-profiler | 32f6981c643b93997752d414f631fd6684772b28 |
#include <ipc/endpoint.h>
#include <atlbase.h>
#include <common/module.h>
#include <common/string.h>
#include <ipc/com/init.h>
#include <functional>
using namespace std;
namespace micro_profiler
{
namespace ipc
{
namespace com
{
class inbound_stream : public ISequentialStream
{
public:
inbound_s... |
#include <ipc/endpoint.h>
#include <atlbase.h>
#include <common/module.h>
#include <common/string.h>
#include <ipc/com/init.h>
#include <functional>
using namespace std;
namespace micro_profiler
{
namespace ipc
{
namespace com
{
class inbound_stream : public ISequentialStream
{
public:
inbound_s... |
channel_ptr_t connect_client(const char *destination_endpoint_id, channel &inbound)
{ return channel_ptr_t(new client_session(destination_endpoint_id, inbound)); }
}
}
}
| shared_ptr<void> client_session::lock_activation_context(const shared_ptr<void> &ctx)
{
ULONG_PTR cookie;
return ctx && ::ActivateActCtx(ctx.get(), &cookie)
? shared_ptr<void>(reinterpret_cast<void*>(cookie), bind(&::DeactivateActCtx, 0, cookie))
: shared_ptr<void>();
} | function_block-full_function | [
{
"content": "\t\t\tclass session : public ISequentialStream, public IConnectionPoint, public /*outbound*/ ipc::channel,\n\n\t\t\t\tpublic CComObjectRoot\n\n\t\t\t{\n\n\t\t\tpublic:\n\n\t\t\t\tBEGIN_COM_MAP(session)\n\n\t\t\t\t\tCOM_INTERFACE_ENTRY(ISequentialStream)\n\n\t\t\t\t\tCOM_INTERFACE_ENTRY(IConnection... |
C++ | test/ese/src/devlibtest/stat/statunit/movingavg.cxx | ScriptBox99/Extensible-Storage-Engine | 3bcf428c8a041733043e18fd9ae55cffeba307b2 |
#include "statunittest.hxx"
#include "stat.hxx"
class MovingAverageTest : public UNITTEST
{
private:
static MovingAverageTest s_instance;
protected:
MovingAverageTest() {}
public:
~MovingAverageTest() {}
public:
const char * SzName() const;
const char * SzDe... |
#include "statunittest.hxx"
#include "stat.hxx"
class MovingAverageTest : public UNITTEST
{
private:
static MovingAverageTest s_instance;
protected:
MovingAverageTest() {}
public:
~MovingAverageTest() {}
public:
const char * SzName() const;
const char * SzDe... | e() );
avgTwoSamples.AddSample( 10 );
TestTest( 10 == avgTwoSamples.GetLastSample() );
TestTest( 30 == avgTwoSamples.GetAverage() );
avgTwoSamples.AddSample( 60 );
TestTest( 60 == avgTwoSamples.GetLastSample() );
TestTest( 35 == avgTwoSamples.GetAverage() );
avgTwoSamples.AddSample( 8... | function_block-function_prefixed | [] | |
C++ | app/DiskFSTree.cpp | Toysoft/ciderpress | 640959dad551ba75a48bd3c49629579730ead351 |
#include "StdAfx.h"
#include "DiskFSTree.h"
#include "ChooseAddTargetDialog.h"
#include "../reformat/Charset.h"
using namespace DiskImgLib;
bool DiskFSTree::BuildTree(DiskFS* pDiskFS, CTreeCtrl* pTree)
{
ASSERT(pDiskFS != NULL);
ASSERT(pTree != NULL);
pTree->SetImageList(&fTreeImageList, TV... |
#include "StdAfx.h"
#include "DiskFSTree.h"
#include "ChooseAddTargetDialog.h"
#include "../reformat/Charset.h"
using namespace DiskImgLib;
bool DiskFSTree::BuildTree(DiskFS* pDiskFS, CTreeCtrl* pTree)
{
ASSERT(pDiskFS != NULL);
ASSERT(pTree != NULL);
pTree->SetImageList(&fTreeImageList, TV... |
void DiskFSTree::FreeAllTargetData(void)
{
TargetData* pTarget;
TargetData* pNext;
pTarget = fpTargetData;
while (pTarget != NULL) {
pNext = pTarget->pNext;
delete pTarget;
pTarget = pNext;
}
fpTargetData = NULL;
}
| DiskFSTree::TargetData* DiskFSTree::AllocTargetData(void)
{
TargetData* pNew = new TargetData;
if (pNew == NULL)
return NULL;
pNew->pNext = fpTargetData;
fpTargetData = pNew;
return pNew;
} | function_block-full_function | [
{
"content": " uch depth[2*L_CODES+1];\n",
"file_path": "zlib/deflate.h",
"rank": 0,
"score": 93639.98853513303
},
{
"content": " uInt insert; /* bytes at end of window left to insert */\n",
"file_path": "zlib/deflate.h",
"rank": 1,
"score": 93630.98532131276
},
... |
C++ | include/dll/datasets/imagenet.hpp | jw-j/dll | 2a72ec0a5c8d52de5565eb5075bc44f078955fca |
#pragma once
#include <vector>
#include <unordered_map>
#include <utility>
#include <string>
#include <dirent.h>
#include <opencv2/highgui/highgui.hpp>
namespace dll {
namespace imagenet {
inline void read_files(std::vector<std::pair<size_t, size_t>>& files, std::unordered_map<size_t, float>& label_map, const s... |
#pragma once
#include <vector>
#include <unordered_map>
#include <utility>
#include <string>
#include <dirent.h>
#include <opencv2/highgui/highgui.hpp>
namespace dll {
namespace imagenet {
inline void read_files(std::vector<std::pair<size_t, size_t>>& files, std::unordered_map<size_t, float>& label_map, const s... | l_iterator&& rhs) = default;
label_iterator& operator++(){
++index;
return *this;
}
label_iterator operator++(int){
auto it = *this;
++index;
return it;
}
float operator*() const {
return (*labels)[(*files)[index].first];
}
bool operator==(... | td::shared_ptr<std::unordered_map<size_t, float>> labels, size_t index) :
files(files), labels(labels), index(index)
{
}
label_iterator(const label_iterator& rhs) = default;
label_iterator(label_iterator&& rhs) = default;
label_iterator& operator=(const label_iterator& rhs) = defa... | random | [
{
"content": "struct random_crop : value_pair_conf_elt<random_crop_id, size_t, X, Y> {};\n\n\n\n/*!\n\n * \\brief Elastic distortion\n\n */\n\ntemplate <size_t C, size_t K = 9>\n",
"file_path": "include/dll/base_conf.hpp",
"rank": 0,
"score": 284440.7828568713
},
{
"content": "struct convert... |
C++ | torch/csrc/jit/testing/module_differ.cpp | aaditya-panik/pytorch | 731c8255b7e8ed5435bfa09c7e0ad5f60bcc91d4 | #include <torch/csrc/jit/testing/module_differ.h>
#include <torch/csrc/jit/mobile/interpreter.h>
#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
namespace torch {
namespace jit {
template <typename It>
bool ivalueListEquals(
It lbegin,
It lend,
It rbeg... | #include <torch/csrc/jit/testing/module_differ.h>
#include <torch/csrc/jit/mobile/interpreter.h>
#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
namespace torch {
namespace jit {
template <typename It>
bool ivalueListEquals(
It lbegin,
It lend,
It rbeg... | ) {
std::cout << " pass." << std::endl;
} else {
std::cout << " fail." << std::endl;
return false;
}
auto type_eq = [](auto t1, auto t2) { return t1->str() == t2->str(); };
auto type_print = [](auto t1) { return t1->str(); };
if (print) {
std::cout << "> Diffing types..." << std::... | vectorEqual(
lhs_code->debug_handles_,
rhs_code->debug_handles_,
true,
equals,
id) | call_expression | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.